LLVMFuzzerTestOneInput: 24| 11.7k|{ 25| 11.7k| constexpr auto var_count = 8; 26| 11.7k| constexpr auto bits = 3; 27| | 28| 11.7k| using vector_t = immer::flex_vector; 29| 11.7k| using size_t = std::uint8_t; 30| | 31| 11.7k| auto vars = std::array{}; 32| | 33| 11.7k| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; 34| 11.7k| auto is_valid_var_neq = [](auto other) { 35| 11.7k| return [=](auto idx) { 36| 11.7k| return idx >= 0 && idx < var_count && idx != other; 37| 11.7k| }; 38| 11.7k| }; 39| 11.7k| auto is_valid_index = [](auto& v) { 40| 11.7k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 41| 11.7k| }; 42| 11.7k| auto is_valid_size = [](auto& v) { 43| 11.7k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 44| 11.7k| }; 45| 11.7k| auto can_concat = [](auto&& v1, auto&& v2) { 46| 11.7k| return v1.size() + v2.size() < vector_t::max_size(); 47| 11.7k| }; 48| 11.7k| auto can_compare = [](auto&& v) { 49| | // avoid comparing vectors that are too big, and hence, slow to compare 50| 11.7k| return v.size() < (1 << 15); 51| 11.7k| }; 52| 11.7k| return fuzzer_input{data, size}.run([&](auto& in) { 53| 11.7k| enum ops 54| 11.7k| { 55| 11.7k| op_push_back, 56| 11.7k| op_update, 57| 11.7k| op_take, 58| 11.7k| op_drop, 59| 11.7k| op_concat, 60| 11.7k| op_push_back_move, 61| 11.7k| op_update_move, 62| 11.7k| op_take_move, 63| 11.7k| op_drop_move, 64| 11.7k| op_concat_move_l, 65| 11.7k| op_concat_move_r, 66| 11.7k| op_concat_move_lr, 67| 11.7k| op_insert, 68| 11.7k| op_erase, 69| 11.7k| op_compare, 70| 11.7k| }; 71| 11.7k| auto src = read(in, is_valid_var); 72| 11.7k| auto dst = read(in, is_valid_var); 73| 11.7k| switch (read(in)) { 74| 11.7k| case op_push_back: { 75| 11.7k| vars[dst] = vars[src].push_back(42); 76| 11.7k| break; 77| 11.7k| } 78| 11.7k| case op_update: { 79| 11.7k| auto idx = read(in, is_valid_index(vars[src])); 80| 11.7k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 81| 11.7k| break; 82| 11.7k| } 83| 11.7k| case op_take: { 84| 11.7k| auto idx = read(in, is_valid_size(vars[src])); 85| 11.7k| vars[dst] = vars[src].take(idx); 86| 11.7k| break; 87| 11.7k| } 88| 11.7k| case op_drop: { 89| 11.7k| auto idx = read(in, is_valid_size(vars[src])); 90| 11.7k| vars[dst] = vars[src].drop(idx); 91| 11.7k| break; 92| 11.7k| } 93| 11.7k| case op_concat: { 94| 11.7k| auto src2 = read(in, is_valid_var); 95| 11.7k| if (can_concat(vars[src], vars[src2])) 96| 11.7k| vars[dst] = vars[src] + vars[src2]; 97| 11.7k| break; 98| 11.7k| } 99| 11.7k| case op_push_back_move: { 100| 11.7k| vars[dst] = std::move(vars[src]).push_back(21); 101| 11.7k| break; 102| 11.7k| } 103| 11.7k| case op_update_move: { 104| 11.7k| auto idx = read(in, is_valid_index(vars[src])); 105| 11.7k| vars[dst] = 106| 11.7k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 107| 11.7k| break; 108| 11.7k| } 109| 11.7k| case op_take_move: { 110| 11.7k| auto idx = read(in, is_valid_size(vars[src])); 111| 11.7k| vars[dst] = std::move(vars[src]).take(idx); 112| 11.7k| break; 113| 11.7k| } 114| 11.7k| case op_drop_move: { 115| 11.7k| auto idx = read(in, is_valid_size(vars[src])); 116| 11.7k| vars[dst] = std::move(vars[src]).drop(idx); 117| 11.7k| break; 118| 11.7k| } 119| 11.7k| case op_concat_move_l: { 120| 11.7k| auto src2 = read(in, is_valid_var_neq(src)); 121| 11.7k| if (can_concat(vars[src], vars[src2])) 122| 11.7k| vars[dst] = std::move(vars[src]) + vars[src2]; 123| 11.7k| break; 124| 11.7k| } 125| 11.7k| case op_concat_move_r: { 126| 11.7k| auto src2 = read(in, is_valid_var_neq(src)); 127| 11.7k| if (can_concat(vars[src], vars[src2])) 128| 11.7k| vars[dst] = vars[src] + std::move(vars[src2]); 129| 11.7k| break; 130| 11.7k| } 131| 11.7k| case op_concat_move_lr: { 132| 11.7k| auto src2 = read(in, is_valid_var_neq(src)); 133| 11.7k| if (can_concat(vars[src], vars[src2])) 134| 11.7k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 135| 11.7k| break; 136| 11.7k| } 137| 11.7k| case op_compare: { 138| 11.7k| using std::swap; 139| 11.7k| if (can_compare(vars[src]) && vars[src] == vars[dst]) 140| 11.7k| swap(vars[src], vars[dst]); 141| 11.7k| break; 142| 11.7k| } 143| 11.7k| case op_erase: { 144| 11.7k| auto idx = read(in, is_valid_index(vars[src])); 145| 11.7k| vars[dst] = vars[src].erase(idx); 146| 11.7k| break; 147| 11.7k| } 148| 11.7k| case op_insert: { 149| 11.7k| auto idx = read(in, is_valid_size(vars[src])); 150| 11.7k| vars[dst] = vars[src].insert(idx, immer::box{42}); 151| 11.7k| break; 152| 11.7k| } 153| 11.7k| default: 154| 11.7k| break; 155| 11.7k| }; 156| 11.7k| return true; 157| 11.7k| }); 158| 11.7k|} flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_: 52| 2.75M| return fuzzer_input{data, size}.run([&](auto& in) { 53| 2.75M| enum ops 54| 2.75M| { 55| 2.75M| op_push_back, 56| 2.75M| op_update, 57| 2.75M| op_take, 58| 2.75M| op_drop, 59| 2.75M| op_concat, 60| 2.75M| op_push_back_move, 61| 2.75M| op_update_move, 62| 2.75M| op_take_move, 63| 2.75M| op_drop_move, 64| 2.75M| op_concat_move_l, 65| 2.75M| op_concat_move_r, 66| 2.75M| op_concat_move_lr, 67| 2.75M| op_insert, 68| 2.75M| op_erase, 69| 2.75M| op_compare, 70| 2.75M| }; 71| 2.75M| auto src = read(in, is_valid_var); 72| 2.75M| auto dst = read(in, is_valid_var); 73| 2.75M| switch (read(in)) { 74| 274k| case op_push_back: { ------------------ | Branch (74:9): [True: 274k, False: 2.47M] ------------------ 75| 274k| vars[dst] = vars[src].push_back(42); 76| 274k| break; 77| 0| } 78| 363k| case op_update: { ------------------ | Branch (78:9): [True: 363k, False: 2.39M] ------------------ 79| 363k| auto idx = read(in, is_valid_index(vars[src])); 80| 363k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 81| 363k| break; 82| 0| } 83| 1.56k| case op_take: { ------------------ | Branch (83:9): [True: 1.56k, False: 2.75M] ------------------ 84| 1.56k| auto idx = read(in, is_valid_size(vars[src])); 85| 1.56k| vars[dst] = vars[src].take(idx); 86| 1.56k| break; 87| 0| } 88| 11.5k| case op_drop: { ------------------ | Branch (88:9): [True: 11.5k, False: 2.74M] ------------------ 89| 11.5k| auto idx = read(in, is_valid_size(vars[src])); 90| 11.5k| vars[dst] = vars[src].drop(idx); 91| 11.5k| break; 92| 0| } 93| 462k| case op_concat: { ------------------ | Branch (93:9): [True: 462k, False: 2.29M] ------------------ 94| 462k| auto src2 = read(in, is_valid_var); 95| 462k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (95:17): [True: 445k, False: 17.0k] ------------------ 96| 445k| vars[dst] = vars[src] + vars[src2]; 97| 462k| break; 98| 0| } 99| 21.9k| case op_push_back_move: { ------------------ | Branch (99:9): [True: 21.9k, False: 2.73M] ------------------ 100| 21.9k| vars[dst] = std::move(vars[src]).push_back(21); 101| 21.9k| break; 102| 0| } 103| 24.9k| case op_update_move: { ------------------ | Branch (103:9): [True: 24.9k, False: 2.72M] ------------------ 104| 24.9k| auto idx = read(in, is_valid_index(vars[src])); 105| 24.9k| vars[dst] = 106| 24.9k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 107| 24.9k| break; 108| 0| } 109| 33.6k| case op_take_move: { ------------------ | Branch (109:9): [True: 33.6k, False: 2.71M] ------------------ 110| 33.6k| auto idx = read(in, is_valid_size(vars[src])); 111| 33.6k| vars[dst] = std::move(vars[src]).take(idx); 112| 33.6k| break; 113| 0| } 114| 58.1k| case op_drop_move: { ------------------ | Branch (114:9): [True: 58.1k, False: 2.69M] ------------------ 115| 58.1k| auto idx = read(in, is_valid_size(vars[src])); 116| 58.1k| vars[dst] = std::move(vars[src]).drop(idx); 117| 58.1k| break; 118| 0| } 119| 270k| case op_concat_move_l: { ------------------ | Branch (119:9): [True: 270k, False: 2.48M] ------------------ 120| 270k| auto src2 = read(in, is_valid_var_neq(src)); 121| 270k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (121:17): [True: 266k, False: 3.79k] ------------------ 122| 266k| vars[dst] = std::move(vars[src]) + vars[src2]; 123| 270k| break; 124| 0| } 125| 5.13k| case op_concat_move_r: { ------------------ | Branch (125:9): [True: 5.13k, False: 2.74M] ------------------ 126| 5.13k| auto src2 = read(in, is_valid_var_neq(src)); 127| 5.13k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (127:17): [True: 4.74k, False: 388] ------------------ 128| 4.74k| vars[dst] = vars[src] + std::move(vars[src2]); 129| 5.13k| break; 130| 0| } 131| 1.11M| case op_concat_move_lr: { ------------------ | Branch (131:9): [True: 1.11M, False: 1.64M] ------------------ 132| 1.11M| auto src2 = read(in, is_valid_var_neq(src)); 133| 1.11M| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (133:17): [True: 1.08M, False: 31.0k] ------------------ 134| 1.08M| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 135| 1.11M| break; 136| 0| } 137| 54.7k| case op_compare: { ------------------ | Branch (137:9): [True: 54.7k, False: 2.69M] ------------------ 138| 54.7k| using std::swap; 139| 54.7k| if (can_compare(vars[src]) && vars[src] == vars[dst]) ------------------ | Branch (139:17): [True: 37.3k, False: 17.4k] | Branch (139:43): [True: 10.0k, False: 27.2k] ------------------ 140| 10.0k| swap(vars[src], vars[dst]); 141| 54.7k| break; 142| 0| } 143| 4.80k| case op_erase: { ------------------ | Branch (143:9): [True: 4.80k, False: 2.74M] ------------------ 144| 4.80k| auto idx = read(in, is_valid_index(vars[src])); 145| 4.80k| vars[dst] = vars[src].erase(idx); 146| 4.80k| break; 147| 0| } 148| 17.7k| case op_insert: { ------------------ | Branch (148:9): [True: 17.7k, False: 2.73M] ------------------ 149| 17.7k| auto idx = read(in, is_valid_size(vars[src])); 150| 17.7k| vars[dst] = vars[src].insert(idx, immer::box{42}); 151| 17.7k| break; 152| 0| } 153| 23.4k| default: ------------------ | Branch (153:9): [True: 23.4k, False: 2.73M] ------------------ 154| 23.4k| break; 155| 2.75M| }; 156| 2.74M| return true; 157| 2.75M| }); flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_0clIcEEDaT_: 33| 6.36M| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; ------------------ | Branch (33:48): [True: 6.21M, False: 144k] | Branch (33:60): [True: 5.94M, False: 269k] ------------------ 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| 421k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; ------------------ | Branch (40:39): [True: 421k, False: 0] | Branch (40:51): [True: 393k, False: 28.1k] ------------------ flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaRT_: 39| 393k| auto is_valid_index = [](auto& v) { 40| 393k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 41| 393k| }; flex-vector-bo.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E_clIiEEDaS2_: 80| 363k| 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| 132k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; ------------------ | Branch (43:39): [True: 132k, False: 0] | Branch (43:51): [True: 122k, False: 9.99k] ------------------ flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaRT_: 42| 122k| auto is_valid_size = [](auto& v) { 43| 122k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 44| 122k| }; 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.85M| auto can_concat = [](auto&& v1, auto&& v2) { 46| 1.85M| return v1.size() + v2.size() < vector_t::max_size(); 47| 1.85M| }; flex-vector-bo.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E0_clIiEEDaS2_: 106| 24.9k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); flex-vector-bo.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_ENKUlS1_E_clIcEEDaS1_: 35| 1.49M| return [=](auto idx) { 36| 1.49M| return idx >= 0 && idx < var_count && idx != other; ------------------ | Branch (36:20): [True: 1.47M, False: 13.5k] | Branch (36:32): [True: 1.44M, False: 32.1k] | Branch (36:51): [True: 1.38M, False: 58.6k] ------------------ 37| 1.49M| }; flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_: 34| 1.38M| auto is_valid_var_neq = [](auto other) { 35| 1.38M| return [=](auto idx) { 36| 1.38M| return idx >= 0 && idx < var_count && idx != other; 37| 1.38M| }; 38| 1.38M| }; flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_5clIRN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaOT_: 48| 54.7k| auto can_compare = [](auto&& v) { 49| | // avoid comparing vectors that are too big, and hence, slow to compare 50| 54.7k| return v.size() < (1 << 15); 51| 54.7k| }; flex-vector-bo.cpp:_ZN12fuzzer_input3runIZ22LLVMFuzzerTestOneInputE3$_6EEiT_: 50| 11.7k| { 51| 11.7k| if (size_ > fuzzer_input_max_size) ------------------ | Branch (51:13): [True: 6, False: 11.7k] ------------------ 52| 6| return 0; 53| 11.7k| try { 54| 2.75M| while (step(*this)) ------------------ | Branch (54:20): [True: 2.74M, False: 11.7k] ------------------ 55| 2.74M| continue; 56| 11.7k| } catch (const no_more_input&) {}; 57| 11.7k| return 0; 58| 11.7k| } flex-vector-bo.cpp:_Z4readIcZ22LLVMFuzzerTestOneInputE3$_0ET_R12fuzzer_inputT0_: 69| 5.95M|{ 70| 5.95M| auto x = read(fz); 71| 6.37M| while (!cond(x)) ------------------ | Branch (71:12): [True: 413k, False: 5.95M] ------------------ 72| 413k| x = read(fz); 73| 5.95M| return x; 74| 5.95M|} _Z4readIcERKT_R12fuzzer_input: 63| 10.6M|{ 64| 10.6M| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 65| 10.6M|} _ZN12fuzzer_input4nextEmm: 40| 11.1M| { 41| 11.1M| auto& p = const_cast(reinterpret_cast(data_)); 42| 11.1M| auto r = std::align(align, size, p, size_); 43| 11.1M| if (r == nullptr) ------------------ | Branch (43:13): [True: 11.7k, False: 11.1M] ------------------ 44| 11.7k| throw no_more_input{}; 45| 11.1M| return next(size); 46| 11.1M| } _ZN12fuzzer_input4nextEm: 30| 11.1M| { 31| 11.1M| if (size_ < size) ------------------ | Branch (31:13): [True: 0, False: 11.1M] ------------------ 32| 0| throw no_more_input{}; 33| 11.1M| auto r = data_; 34| 11.1M| data_ += size; 35| 11.1M| size_ -= size; 36| 11.1M| return r; 37| 11.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_: 69| 393k|{ 70| 393k| auto x = read(fz); 71| 421k| while (!cond(x)) ------------------ | Branch (71:12): [True: 28.1k, False: 393k] ------------------ 72| 28.1k| x = read(fz); 73| 393k| return x; 74| 393k|} _Z4readIhERKT_R12fuzzer_input: 63| 554k|{ 64| 554k| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 65| 554k|} 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_: 69| 122k|{ 70| 122k| auto x = read(fz); 71| 132k| while (!cond(x)) ------------------ | Branch (71:12): [True: 9.99k, False: 122k] ------------------ 72| 9.99k| x = read(fz); 73| 122k| return x; 74| 122k|} flex-vector-bo.cpp:_Z4readIcZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_EUlS2_E_ES2_R12fuzzer_inputT0_: 69| 1.38M|{ 70| 1.38M| auto x = read(fz); 71| 1.49M| while (!cond(x)) ------------------ | Branch (71:12): [True: 104k, False: 1.38M] ------------------ 72| 104k| x = read(fz); 73| 1.38M| return x; 74| 1.38M|} _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2IivEEOT_: 81| 17.7k| {} _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderC2IJiEEEDpOT_: 48| 17.7k| {} _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEcvRKiEv: 128| 17.7k| operator const T&() const { return get(); } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE3getEv: 125| 17.7k| 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: 117| 17.7k| { 118| 17.7k| if (impl_ && impl_->dec()) { ------------------ | Branch (118:13): [True: 17.7k, False: 0] | Branch (118:22): [True: 17.7k, False: 0] ------------------ 119| 17.7k| impl_->~holder(); 120| 17.7k| heap::deallocate(sizeof(holder), impl_); 121| 17.7k| } 122| 17.7k| } _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| 388M| { 171| 388M| return x.get_(type_t{}); 172| 388M| } _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| 388M| { 185| 388M| return n.get_(t); 186| 388M| } _ZNK5immer6detail3csl6memberINS_22unsafe_refcount_policyENS1_7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4typeEE4type4get_ENS1_6type_tIS3_EE: 128| 388M| 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| 31.5M| { 166| 31.5M| return x.get_(type_t{}); 167| 31.5M| } _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| 31.5M| { 180| 31.5M| return n.get_(t); 181| 31.5M| } _ZN5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 102| 31.5M| 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| 450k| { 171| 450k| return x.get_(type_t{}); 172| 450k| } _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| 450k| { 185| 450k| return n.get_(t); 186| 450k| } _ZNK5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 103| 450k| 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: 112| 10.8M| ReferenceT operator*() const { return access_t::dereference(derived()); } _ZN5immer6detail20iterator_core_access11dereferenceIRKNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDcOT_: 22| 10.8M| { 23| 10.8M| return x.dereference(); 24| 10.8M| } _ZNK5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_E7derivedEv: 99| 10.9M| { 100| 10.9M| static_assert(std::is_base_of::value, 101| 10.9M| "must pass a derived thing"); 102| 10.9M| return *static_cast(this); 103| 10.9M| } _ZN5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_EpLEl: 156| 295k| { 157| 295k| access_t::advance(derived(), n); 158| 295k| return derived(); 159| 295k| } _ZN5immer6detail20iterator_core_access7advanceIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEElEEDcOT_T0_: 46| 295k| { 47| 295k| return x.advance(d); 48| 295k| } _ZN5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_E7derivedEv: 105| 19.3M| { 106| 19.3M| static_assert(std::is_base_of::value, 107| 19.3M| "must pass a derived thing"); 108| 19.3M| return *static_cast(this); 109| 19.3M| } _ZN5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_EppEv: 130| 9.37M| { 131| 9.37M| access_t::increment(derived()); 132| 9.37M| return derived(); 133| 9.37M| } _ZN5immer6detail20iterator_core_access9incrementIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDcOT_: 28| 9.37M| { 29| 9.37M| return x.increment(); 30| 9.37M| } _ZNK5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_EplEl: 167| 87.8k| { 168| 87.8k| static_assert(is_random_access, ""); 169| 87.8k| auto tmp = derived(); 170| 87.8k| return tmp += n; 171| 87.8k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE17make_inner_n_intoEPvmj: 203| 774k| { 204| 774k| assert(n <= branches); 205| 0| assert(size >= sizeof_inner_n(n)); 206| 0| auto p = new (buffer) node_t; 207| 774k| p->impl.d.data.inner.relaxed = nullptr; 208| 774k|#if IMMER_TAGGED_NODE 209| 774k| p->impl.d.kind = node_t::kind_t::inner; 210| 774k|#endif 211| 774k| return p; 212| 774k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14sizeof_inner_nEj: 135| 31.0M| { 136| 31.0M| return keep_headroom ? max_sizeof_inner : sizeof_packed_inner_n(n); ------------------ | Branch (136:16): [Folded - Ignored] ------------------ 137| 31.0M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3incEv: 946| 103M| { 947| 103M| refs(this).inc(); 948| 103M| return this; 949| 103M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4refsEPKSB_: 193| 388M| { 194| 388M| return auto_const_cast(get(x->impl)); 195| 388M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE16make_leaf_n_intoEPvmj: 320| 1.06M| { 321| 1.06M| assert(n <= branches); 322| 0| assert(size >= sizeof_leaf_n(n)); 323| 0| auto p = new (buffer) node_t; 324| 1.06M|#if IMMER_TAGGED_NODE 325| 1.06M| p->impl.d.kind = node_t::kind_t::leaf; 326| 1.06M|#endif 327| 1.06M| return p; 328| 1.06M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13sizeof_leaf_nEj: 150| 4.91M| { 151| 4.91M| return keep_headroom ? max_sizeof_leaf : sizeof_packed_leaf_n(n); ------------------ | Branch (151:16): [Folded - Ignored] ------------------ 152| 4.91M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7relaxedEv: 162| 564M| { 163| 564M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 60| 564M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 164| 0| return impl.d.data.inner.relaxed; 165| 564M| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4kindEv: 158| 861M| kind_t kind() const { return impl.d.kind; } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3decEv: 957| 207M| bool dec() const { return refs(this).dec(); } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5innerEv: 174| 245M| { 175| 245M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 60| 245M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 176| 0| return reinterpret_cast(&impl.d.data.inner.buffer); 177| 245M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14delete_inner_rEPSB_j: 822| 27.9M| { 823| 27.9M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 60| 27.9M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 824| 0| auto r = p->relaxed(); 825| 27.9M| assert(r); 826| 0| static_if([&](auto) { 827| 27.9M| if (node_t::refs(r).dec()) 828| 27.9M| heap::deallocate(node_t::ownee(r).owned() 829| 27.9M| ? node_t::max_sizeof_relaxed 830| 27.9M| : node_t::sizeof_relaxed_n(n), 831| 27.9M| r); 832| 27.9M| }); 833| 27.9M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner_r ------------------ | Branch (833:26): [True: 0, False: 27.9M] ------------------ 834| 27.9M| : node_t::sizeof_inner_r_n(n), 835| 27.9M| p); 836| 27.9M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5owneeEPSB_: 200| 31.5M| 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: 140| 55.8M| { 141| 55.8M| return keep_headroom ? max_sizeof_inner_r : sizeof_packed_inner_r_n(n); ------------------ | Branch (141:16): [Folded - Ignored] ------------------ 142| 55.8M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11delete_leafEPSB_j: 851| 1.72M| { 852| 1.72M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::leaf); ------------------ | | 60| 1.72M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 853| 0| detail::destroy_n(p->leaf(), n); 854| 1.72M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_leaf ------------------ | Branch (854:26): [True: 0, False: 1.72M] ------------------ 855| 1.72M| : node_t::sizeof_leaf_n(n), 856| 1.72M| p); 857| 1.72M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4leafEv: 180| 13.0M| { 181| 13.0M| IMMER_ASSERT_TAGGED(kind() == kind_t::leaf); ------------------ | | 60| 13.0M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 182| 0| return reinterpret_cast(&impl.d.data.leaf.buffer); 183| 13.0M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12delete_innerEPSB_j: 798| 901k| { 799| 901k| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 60| 901k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 800| 0| assert(!p->relaxed()); 801| 901k| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner ------------------ | Branch (801:26): [True: 0, False: 901k] ------------------ 802| 901k| : node_t::sizeof_inner_n(n), 803| 901k| p); 804| 901k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE17copy_leaf_emplaceIiEEPSB_SD_jOT_: 784| 231k| { 785| 231k| auto dst = copy_leaf_n(n + 1, src, n); 786| 231k| IMMER_TRY { ------------------ | | 41| 231k|#define IMMER_TRY try ------------------ 787| 231k| new (dst->leaf() + n) T{std::forward(x)}; 788| 231k| } 789| 231k| IMMER_CATCH (...) { 790| 0| detail::destroy_n(dst->leaf(), n); 791| 0| heap::deallocate(node_t::sizeof_leaf_n(n + 1), dst); 792| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 793| 0| } 794| 0| return dst; 795| 231k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11copy_leaf_nEjPSB_j: 686| 231k| { 687| 231k| assert(allocn >= n); 688| 231k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 60| 231k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 689| 0| auto dst = make_leaf_n(allocn); 690| 231k| IMMER_TRY { ------------------ | | 41| 231k|#define IMMER_TRY try ------------------ 691| 231k| detail::uninitialized_copy( 692| 231k| src->leaf(), src->leaf() + n, dst->leaf()); 693| 231k| } 694| 231k| IMMER_CATCH (...) { 695| 0| heap::deallocate(node_t::sizeof_leaf_n(allocn), dst); 696| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 697| 0| } 698| 0| return dst; 699| 231k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_nEj: 331| 1.06M| { 332| 1.06M| assert(n <= branches); 333| 0| auto m = heap::allocate(sizeof_leaf_n(n)); 334| 1.06M| return make_leaf_n_into(m, sizeof_leaf_n(n), n); 335| 1.06M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_nIiEEPSB_jOT_: 460| 43.2k| { 461| 43.2k| assert(n >= 1); 462| 0| auto p = make_leaf_n(n); 463| 43.2k| IMMER_TRY { ------------------ | | 41| 43.2k|#define IMMER_TRY try ------------------ 464| 43.2k| new (p->leaf()) T{std::forward(x)}; 465| 43.2k| } 466| 43.2k| IMMER_CATCH (...) { 467| 0| heap::deallocate(node_t::sizeof_leaf_n(n), p); 468| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 469| 0| } 470| 0| return p; 471| 43.2k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13do_copy_innerEPSB_SC_j: 548| 667k| { 549| 667k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 60| 667k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 550| 667k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 60| 667k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 551| 0| auto p = src->inner(); 552| 667k| inc_nodes(p, n); 553| 667k| std::copy(p, p + n, dst->inner()); 554| 667k| return dst; 555| 667k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9inc_nodesEPPSB_j: 960| 20.1M| { 961| 93.0M| for (auto i = p, e = i + n; i != e; ++i) ------------------ | Branch (961:37): [True: 72.8M, False: 20.1M] ------------------ 962| 72.8M| refs(*i).inc(); 963| 20.1M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14copy_inner_r_nEjPSB_j: 578| 212k| { 579| 212k| assert(allocn >= n); 580| 212k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 60| 212k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 581| 0| auto dst = make_inner_r_n(allocn); 582| 212k| return do_copy_inner_r(dst, src, n); 583| 212k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15do_copy_inner_rEPSB_SC_j: 600| 264k| { 601| 264k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 60| 264k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 602| 264k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 60| 264k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 603| 0| auto src_r = src->relaxed(); 604| 264k| auto dst_r = dst->relaxed(); 605| 264k| inc_nodes(src->inner(), n); 606| 264k| std::copy(src->inner(), src->inner() + n, dst->inner()); 607| 264k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 608| 264k| dst_r->d.count = n; 609| 264k| return dst; 610| 264k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14make_inner_r_nEj: 233| 27.8M| { 234| 27.8M| assert(n <= branches); 235| 0| auto mp = heap::allocate(sizeof_inner_r_n(n)); 236| 27.8M| auto mr = static_cast(nullptr); 237| 27.8M| if (embed_relaxed) { ------------------ | Branch (237:13): [Folded - Ignored] ------------------ 238| 27.8M| mr = reinterpret_cast(mp) + sizeof_inner_n(n); 239| 27.8M| } else { 240| 0| IMMER_TRY { ------------------ | | 41| 0|#define IMMER_TRY try ------------------ 241| 0| mr = heap::allocate(sizeof_relaxed_n(n), norefs_tag{}); 242| 0| } 243| 0| IMMER_CATCH (...) { 244| 0| heap::deallocate(sizeof_inner_r_n(n), mp); 245| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 246| 0| } 247| 0| } 248| 27.8M| auto p = new (mp) node_t; 249| 27.8M| auto r = new (mr) relaxed_t; 250| 27.8M| r->d.count = 0; 251| 27.8M| p->impl.d.data.inner.relaxed = r; 252| 27.8M|#if IMMER_TAGGED_NODE 253| 27.8M| p->impl.d.kind = node_t::kind_t::inner; 254| 27.8M|#endif 255| 27.8M| return p; 256| 27.8M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9make_pathEjPSB_: 488| 277k| { 489| 277k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 60| 277k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 490| 277k| if (shift == endshift) ------------------ | Branch (490:13): [True: 220k, False: 57.4k] ------------------ 491| 220k| return node; 492| 57.4k| else { 493| 57.4k| auto n = node_t::make_inner_n(1); 494| 57.4k| IMMER_TRY { ------------------ | | 41| 57.4k|#define IMMER_TRY try ------------------ 495| 57.4k| n->inner()[0] = make_path(shift - B, node); 496| 57.4k| } 497| 57.4k| IMMER_CATCH (...) { 498| 0| heap::deallocate(node_t::sizeof_inner_n(1), n); 499| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 500| 0| } 501| 57.4k| return n; 502| 57.4k| } 503| 277k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12make_inner_nEj: 214| 774k| { 215| 774k| assert(n <= branches); 216| 0| auto m = heap::allocate(sizeof_inner_n(n)); 217| 774k| return make_inner_n_into(m, sizeof_inner_n(n), n); 218| 774k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9copy_leafEPSB_j: 656| 377k| { 657| 377k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 60| 377k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 658| 0| auto dst = make_leaf_n(n); 659| 377k| IMMER_TRY { ------------------ | | 41| 377k|#define IMMER_TRY try ------------------ 660| 377k| detail::uninitialized_copy( 661| 377k| src->leaf(), src->leaf() + n, dst->leaf()); 662| 377k| } 663| 377k| IMMER_CATCH (...) { 664| 0| heap::deallocate(node_t::sizeof_leaf_n(n), dst); 665| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 666| 0| } 667| 0| return dst; 668| 377k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15make_inner_sr_nEjPNS0_3csl6memberINSB_14relaxed_data_tEvE4typeE: 259| 88.7k| { 260| 88.7k| return static_if( 261| 88.7k| [&](auto) { return node_t::make_inner_r_n(n); }, 262| 88.7k| [&](auto) { 263| 88.7k| auto p = 264| 88.7k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 265| 88.7k| assert(r->d.count >= n); 266| 88.7k| node_t::refs(r).inc(); 267| 88.7k| p->impl.d.data.inner.relaxed = r; 268| 88.7k|#if IMMER_TAGGED_NODE 269| 88.7k| p->impl.d.kind = node_t::kind_t::inner; 270| 88.7k|#endif 271| 88.7k| return p; 272| 88.7k| }); 273| 88.7k| } _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_: 261| 88.7k| [&](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_: 642| 88.7k| { 643| 88.7k| if (embed_relaxed) ------------------ | Branch (643:13): [Folded - Ignored] ------------------ 644| 88.7k| return do_copy_inner_replace_r(dst, src, n, offset, child); 645| 0| else { 646| 0| auto p = src->inner(); 647| 0| inc_nodes(p, offset); 648| 0| inc_nodes(p + offset + 1, n - offset - 1); 649| 0| std::copy(p, p + n, dst->inner()); 650| 0| dst->inner()[offset] = child; 651| 0| return dst; 652| 0| } 653| 88.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE23do_copy_inner_replace_rEPSB_SC_jjSC_: 614| 88.7k| { 615| 88.7k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 60| 88.7k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 616| 88.7k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 60| 88.7k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 617| 0| auto src_r = src->relaxed(); 618| 88.7k| auto dst_r = dst->relaxed(); 619| 88.7k| auto p = src->inner(); 620| 88.7k| inc_nodes(p, offset); 621| 88.7k| inc_nodes(p + offset + 1, n - offset - 1); 622| 88.7k| std::copy(src->inner(), src->inner() + n, dst->inner()); 623| 88.7k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 624| 88.7k| dst_r->d.count = n; 625| 88.7k| dst->inner()[offset] = child; 626| 88.7k| return dst; 627| 88.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE21do_copy_inner_replaceEPSB_SC_jjSC_: 559| 73.2k| { 560| 73.2k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 60| 73.2k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 561| 73.2k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 60| 73.2k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 562| 0| auto p = src->inner(); 563| 73.2k| inc_nodes(p, offset); 564| 73.2k| inc_nodes(p + offset + 1, n - offset - 1); 565| 73.2k| std::copy(p, p + n, dst->inner()); 566| 73.2k| dst->inner()[offset] = child; 567| 73.2k| return dst; 568| 73.2k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12copy_inner_nEjPSB_j: 533| 10.7k| { 534| 10.7k| assert(allocn >= n); 535| 10.7k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 60| 10.7k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 536| 0| auto dst = make_inner_n(allocn); 537| 10.7k| return do_copy_inner(dst, src, n); 538| 10.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12copy_inner_rEPSB_j: 571| 3.90k| { 572| 3.90k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 60| 3.90k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 573| 0| auto dst = make_inner_r_n(n); 574| 3.90k| return do_copy_inner_r(dst, src, n); 575| 3.90k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13compute_shiftEv: 967| 2.52M| { 968| 2.52M| if (kind() == kind_t::leaf) ------------------ | Branch (968:13): [True: 258k, False: 2.26M] ------------------ 969| 258k| return endshift; 970| 2.26M| else 971| 2.26M| return B + inner()[0]->compute_shift(); 972| 2.52M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5checkEjm: 976| 258k| { 977| |#if IMMER_DEBUG_DEEP_CHECK 978| | assert(size > 0); 979| | if (shift == endshift) { 980| | IMMER_ASSERT_TAGGED(kind() == kind_t::leaf); 981| | assert(size <= branches); 982| | } else if (auto r = relaxed()) { 983| | auto count = r->d.count; 984| | assert(count > 0); 985| | assert(count <= branches); 986| | if (r->d.sizes[count - 1] != size) { 987| | IMMER_TRACE_F("check"); 988| | IMMER_TRACE_E(r->d.sizes[count - 1]); 989| | IMMER_TRACE_E(size); 990| | } 991| | assert(r->d.sizes[count - 1] == size); 992| | for (auto i = 1u; i < count; ++i) 993| | assert(r->d.sizes[i - 1] < r->d.sizes[i]); 994| | auto last_size = size_t{}; 995| | for (auto i = 0u; i < count; ++i) { 996| | assert(inner()[i]->check(shift - B, r->d.sizes[i] - last_size)); 997| | last_size = r->d.sizes[i]; 998| | } 999| | } else { 1000| | assert(size <= branches << shift); 1001| | auto count = 1002| | (size >> shift) + (size - ((size >> shift) << shift) > 0); 1003| | assert(count <= branches); 1004| | if (count) { 1005| | for (auto i = 1u; i < count - 1; ++i) 1006| | assert(inner()[i]->check(shift - B, 1 << shift)); 1007| | assert(inner()[count - 1]->check( 1008| | shift - B, size - ((count - 1) << shift))); 1009| | } 1010| | } 1011| |#endif // IMMER_DEBUG_DEEP_CHECK 1012| 258k| return true; 1013| 258k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9copy_leafEPSB_jj: 768| 141k| { 769| 141k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 60| 141k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 770| 0| auto dst = make_leaf_n(last - idx); 771| 141k| IMMER_TRY { ------------------ | | 41| 141k|#define IMMER_TRY try ------------------ 772| 141k| detail::uninitialized_copy( 773| 141k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 774| 141k| } 775| 141k| IMMER_CATCH (...) { 776| 0| heap::deallocate(node_t::sizeof_leaf_n(last - idx), dst); 777| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 778| 0| } 779| 0| return dst; 780| 141k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9copy_leafEPSB_jSC_j: 702| 135k| { 703| 135k| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 60| 135k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 704| 135k| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 60| 135k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 705| 0| auto dst = make_leaf_n(n1 + n2); 706| 135k| IMMER_TRY { ------------------ | | 41| 135k|#define IMMER_TRY try ------------------ 707| 135k| detail::uninitialized_copy( 708| 135k| src1->leaf(), src1->leaf() + n1, dst->leaf()); 709| 135k| } 710| 135k| IMMER_CATCH (...) { 711| 0| heap::deallocate(node_t::sizeof_leaf_n(n1 + n2), dst); 712| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 713| 0| } 714| 0| IMMER_TRY { ------------------ | | 41| 0|#define IMMER_TRY try ------------------ 715| 0| detail::uninitialized_copy( 716| 0| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 717| 0| } 718| 0| IMMER_CATCH (...) { 719| 0| detail::destroy_n(dst->leaf(), n1); 720| 0| heap::deallocate(node_t::sizeof_leaf_n(n1 + n2), dst); 721| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 722| 0| } 723| 0| return dst; 724| 0| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10can_mutateENS9_5applyIS6_E4type4editE: 860| 4.24M| { 861| 4.24M| return refs(this).unique() || ownee(this).can_mutate(e); ------------------ | Branch (861:16): [True: 3.79M, False: 450k] | Branch (861:39): [True: 0, False: 450k] ------------------ 862| 4.24M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5owneeEPKSB_: 197| 450k| { 198| 450k| return get(x->impl); 199| 450k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_j: 671| 42.2k| { 672| 42.2k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 60| 42.2k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 673| 0| auto dst = make_leaf_e(e); 674| 42.2k| IMMER_TRY { ------------------ | | 41| 42.2k|#define IMMER_TRY try ------------------ 675| 42.2k| detail::uninitialized_copy( 676| 42.2k| src->leaf(), src->leaf() + n, dst->leaf()); 677| 42.2k| } 678| 42.2k| IMMER_CATCH (...) { 679| 0| heap::deallocate(node_t::max_sizeof_leaf, dst); 680| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 681| 0| } 682| 0| return dst; 683| 42.2k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_eENS9_5applyIS6_E4type4editE: 338| 653k| { 339| 653k| auto p = new (heap::allocate(max_sizeof_leaf)) node_t; 340| 653k| ownee(p) = e; 341| 653k|#if IMMER_TAGGED_NODE 342| 653k| p->impl.d.kind = node_t::kind_t::leaf; 343| 653k|#endif 344| 653k| return p; 345| 653k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_eIiEEPSB_NS9_5applyIS6_E4type4editEOT_: 475| 8.55k| { 476| 8.55k| auto p = make_leaf_e(e); 477| 8.55k| IMMER_TRY { ------------------ | | 41| 8.55k|#define IMMER_TRY try ------------------ 478| 8.55k| new (p->leaf()) T{std::forward(x)}; 479| 8.55k| } 480| 8.55k| IMMER_CATCH (...) { 481| 0| heap::deallocate(node_t::max_sizeof_leaf, p); 482| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 483| 0| } 484| 0| return p; 485| 8.55k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEj: 920| 293k| { 921| 293k| auto src_r = relaxed(); 922| 293k| return static_if( 923| 293k| [&](auto) { return src_r; }, 924| 293k| [&](auto) { 925| 293k| if (node_t::refs(src_r).unique() || 926| 293k| node_t::ownee(src_r).can_mutate(e)) 927| 293k| return src_r; 928| 293k| else { 929| 293k| auto dst_r = 930| 293k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 931| 293k| if (src_r) { 932| 293k| std::copy( 933| 293k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 934| 293k| if (node_t::refs(src_r).dec()) 935| 293k| heap::deallocate(node_t::sizeof_inner_r_n(n), 936| 293k| src_r); 937| 293k| } 938| 293k| dst_r->d.count = n; 939| 293k| node_t::ownee(dst_r) = e; 940| 293k| return impl.d.data.inner.relaxed = dst_r; 941| 293k| } 942| 293k| }); 943| 293k| } _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_: 923| 293k| [&](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: 586| 21.6k| { 587| 21.6k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 60| 21.6k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 588| 0| auto dst = make_inner_r_e(e); 589| 21.6k| return do_copy_inner_r(dst, src, n); 590| 21.6k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14make_inner_r_eENS9_5applyIS6_E4type4editE: 276| 143k| { 277| 143k| auto mp = heap::allocate(max_sizeof_inner_r); 278| 143k| auto mr = static_cast(nullptr); 279| 143k| if (embed_relaxed) { ------------------ | Branch (279:13): [Folded - Ignored] ------------------ 280| 143k| mr = reinterpret_cast(mp) + max_sizeof_inner; 281| 143k| } else { 282| 0| IMMER_TRY { ------------------ | | 41| 0|#define IMMER_TRY try ------------------ 283| 0| mr = heap::allocate(max_sizeof_relaxed, norefs_tag{}); 284| 0| } 285| 0| IMMER_CATCH (...) { 286| 0| heap::deallocate(max_sizeof_inner_r, mp); 287| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 288| 0| } 289| 0| } 290| 143k| auto p = new (mp) node_t; 291| 143k| auto r = new (mr) relaxed_t; 292| 143k| ownee(p) = e; 293| 143k| static_if([&](auto) { node_t::ownee(r) = e; }); 294| 143k| r->d.count = 0; 295| 143k| p->impl.d.data.inner.relaxed = r; 296| 143k|#if IMMER_TAGGED_NODE 297| 143k| p->impl.d.kind = node_t::kind_t::inner; 298| 143k|#endif 299| 143k| return p; 300| 143k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_path_eENS9_5applyIS6_E4type4editEjPSB_: 506| 744k| { 507| 744k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 60| 744k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 508| 744k| if (shift == endshift) ------------------ | Branch (508:13): [True: 647k, False: 97.0k] ------------------ 509| 647k| return node; 510| 97.0k| else { 511| 97.0k| auto n = node_t::make_inner_e(e); 512| 97.0k| IMMER_TRY { ------------------ | | 41| 97.0k|#define IMMER_TRY try ------------------ 513| 97.0k| n->inner()[0] = make_path_e(e, shift - B, node); 514| 97.0k| } 515| 97.0k| IMMER_CATCH (...) { 516| 0| heap::deallocate(node_t::max_sizeof_inner, n); 517| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 518| 0| } 519| 97.0k| return n; 520| 97.0k| } 521| 744k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12make_inner_eENS9_5applyIS6_E4type4editE: 221| 126k| { 222| 126k| auto m = heap::allocate(max_sizeof_inner); 223| 126k| auto p = new (m) node_t; 224| 126k| ownee(p) = e; 225| 126k| p->impl.d.data.inner.relaxed = nullptr; 226| 126k|#if IMMER_TAGGED_NODE 227| 126k| p->impl.d.kind = node_t::kind_t::inner; 228| 126k|#endif 229| 126k| return p; 230| 126k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12copy_inner_eENS9_5applyIS6_E4type4editEPSB_j: 541| 19.7k| { 542| 19.7k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 60| 19.7k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 543| 0| auto dst = make_inner_e(e); 544| 19.7k| return do_copy_inner(dst, src, n); 545| 19.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15copy_inner_sr_eENS9_5applyIS6_E4type4editEPSB_j: 593| 25.9k| { 594| 25.9k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 60| 25.9k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 595| 0| auto dst = make_inner_sr_e(e, src->relaxed()); 596| 25.9k| return do_copy_inner_sr(dst, src, n); 597| 25.9k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15make_inner_sr_eENS9_5applyIS6_E4type4editEPNS0_3csl6memberINSB_14relaxed_data_tEvE4typeE: 303| 25.9k| { 304| 25.9k| return static_if( 305| 25.9k| [&](auto) { return node_t::make_inner_r_e(e); }, 306| 25.9k| [&](auto) { 307| 25.9k| auto p = 308| 25.9k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 309| 25.9k| node_t::refs(r).inc(); 310| 25.9k| p->impl.d.data.inner.relaxed = r; 311| 25.9k| node_t::ownee(p) = e; 312| 25.9k|#if IMMER_TAGGED_NODE 313| 25.9k| p->impl.d.kind = node_t::kind_t::inner; 314| 25.9k|#endif 315| 25.9k| return p; 316| 25.9k| }); 317| 25.9k| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15make_inner_sr_eENS9_5applyIS6_E4type4editEPNS0_3csl6memberINSB_14relaxed_data_tEvE4typeEENKUlT_E_clINS0_7empty_tEEEDaSM_: 305| 25.9k| [&](auto) { return node_t::make_inner_r_e(e); }, _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE16do_copy_inner_srEPSB_SC_j: 630| 25.9k| { 631| 25.9k| if (embed_relaxed) ------------------ | Branch (631:13): [Folded - Ignored] ------------------ 632| 25.9k| return do_copy_inner_r(dst, src, n); 633| 0| else { 634| 0| inc_nodes(src->inner(), n); 635| 0| std::copy(src->inner(), src->inner() + n, dst->inner()); 636| 0| return dst; 637| 0| } 638| 25.9k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jj: 753| 602k| { 754| 602k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 60| 602k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 755| 0| auto dst = make_leaf_e(e); 756| 602k| IMMER_TRY { ------------------ | | 41| 602k|#define IMMER_TRY try ------------------ 757| 602k| detail::uninitialized_copy( 758| 602k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 759| 602k| } 760| 602k| IMMER_CATCH (...) { 761| 0| heap::deallocate(max_sizeof_leaf, dst); 762| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 763| 0| } 764| 0| return dst; 765| 602k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE22ensure_mutable_relaxedENS9_5applyIS6_E4type4editE: 867| 180k| { 868| 180k| auto src_r = relaxed(); 869| 180k| return static_if( 870| 180k| [&](auto) { return src_r; }, 871| 180k| [&](auto) { 872| 180k| if (node_t::refs(src_r).unique() || 873| 180k| node_t::ownee(src_r).can_mutate(e)) 874| 180k| return src_r; 875| 180k| else { 876| 180k| auto dst_r = impl.d.data.inner.relaxed = 877| 180k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 878| 180k| if (src_r) { 879| 180k| auto n = dst_r->d.count = src_r->d.count; 880| 180k| std::copy( 881| 180k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 882| 180k| if (node_t::refs(src_r).dec()) 883| 180k| heap::deallocate(node_t::sizeof_inner_r_n(n), 884| 180k| src_r); 885| 180k| } 886| 180k| node_t::ownee(dst_r) = e; 887| 180k| return dst_r; 888| 180k| } 889| 180k| }); 890| 180k| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE22ensure_mutable_relaxedENS9_5applyIS6_E4type4editEENKUlT_E_clINS0_7empty_tEEEDaSG_: 870| 180k| [&](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: 728| 592| { 729| 592| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 60| 592|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 730| 592| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 60| 592|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 731| 0| auto dst = make_leaf_e(e); 732| 592| IMMER_TRY { ------------------ | | 41| 592|#define IMMER_TRY try ------------------ 733| 592| detail::uninitialized_copy( 734| 592| src1->leaf(), src1->leaf() + n1, dst->leaf()); 735| 592| } 736| 592| IMMER_CATCH (...) { 737| 0| heap::deallocate(max_sizeof_leaf, dst); 738| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 739| 0| } 740| 0| IMMER_TRY { ------------------ | | 41| 0|#define IMMER_TRY try ------------------ 741| 0| detail::uninitialized_copy( 742| 0| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 743| 0| } 744| 0| IMMER_CATCH (...) { 745| 0| detail::destroy_n(dst->leaf(), n1); 746| 0| heap::deallocate(max_sizeof_leaf, dst); 747| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 748| 0| } 749| 0| return dst; 750| 0| } _ZN5immer6detail4rbts11dec_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 522| 143M| { 523| 143M| using node_t = node_type; 524| 143M| auto node = p.node(); 525| 143M| if (node->dec()) { ------------------ | Branch (525:13): [True: 27.9M, False: 115M] ------------------ 526| 27.9M| p.each(this_t{}); 527| 27.9M| node_t::delete_inner_r(node, p.count()); 528| 27.9M| } 529| 143M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 533| 11.3M| { 534| 11.3M| using node_t = node_type; 535| 11.3M| auto node = p.node(); 536| 11.3M| if (node->dec()) { ------------------ | Branch (536:13): [True: 281k, False: 11.0M] ------------------ 537| 281k| p.each(this_t{}); 538| 281k| node_t::delete_inner(node, p.count()); 539| 281k| } 540| 11.3M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 544| 1.41M| { 545| 1.41M| using node_t = node_type; 546| 1.41M| auto node = p.node(); 547| 1.41M| if (node->dec()) { ------------------ | Branch (547:13): [True: 676k, False: 742k] ------------------ 548| 676k| node_t::delete_leaf(node, p.count()); 549| 676k| } 550| 1.41M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 544| 266k| { 545| 266k| using node_t = node_type; 546| 266k| auto node = p.node(); 547| 266k| if (node->dec()) { ------------------ | Branch (547:13): [True: 41.9k, False: 224k] ------------------ 548| 41.9k| node_t::delete_leaf(node, p.count()); 549| 41.9k| } 550| 266k| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 533| 1.36M| { 534| 1.36M| using node_t = node_type; 535| 1.36M| auto node = p.node(); 536| 1.36M| if (node->dec()) { ------------------ | Branch (536:13): [True: 111k, False: 1.25M] ------------------ 537| 111k| p.each(this_t{}); 538| 111k| node_t::delete_inner(node, p.count()); 539| 111k| } 540| 1.36M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 533| 525k| { 534| 525k| using node_t = node_type; 535| 525k| auto node = p.node(); 536| 525k| if (node->dec()) { ------------------ | Branch (536:13): [True: 497k, False: 28.3k] ------------------ 537| 497k| p.each(this_t{}); 538| 497k| node_t::delete_inner(node, p.count()); 539| 497k| } 540| 525k| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 533| 1.60M| { 534| 1.60M| using node_t = node_type; 535| 1.60M| auto node = p.node(); 536| 1.60M| if (node->dec()) { ------------------ | Branch (536:13): [True: 0, False: 1.60M] ------------------ 537| 0| p.each(this_t{}); 538| 0| node_t::delete_inner(node, p.count()); 539| 0| } 540| 1.60M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 544| 45.6M| { 545| 45.6M| using node_t = node_type; 546| 45.6M| auto node = p.node(); 547| 45.6M| if (node->dec()) { ------------------ | Branch (547:13): [True: 1.00M, False: 44.6M] ------------------ 548| 1.00M| node_t::delete_leaf(node, p.count()); 549| 1.00M| } 550| 45.6M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 544| 1.27M| { 545| 1.27M| using node_t = node_type; 546| 1.27M| auto node = p.node(); 547| 1.27M| if (node->dec()) { ------------------ | Branch (547:13): [True: 0, False: 1.27M] ------------------ 548| 0| node_t::delete_leaf(node, p.count()); 549| 0| } 550| 1.27M| } _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: 790| 215k| { 791| 215k| auto level = pos.shift(); 792| 215k| auto idx = pos.count() - 1; 793| 215k| auto children = pos.size(idx); 794| 215k| auto new_idx = 795| 215k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (795:13): [True: 15.9k, False: 199k] | Branch (795:47): [True: 873, False: 198k] ------------------ 796| 215k| auto new_child = static_cast(nullptr); 797| 215k| if (new_idx >= branches) ------------------ | Branch (797:13): [True: 4.95k, False: 210k] ------------------ 798| 4.95k| return nullptr; 799| 210k| else if (idx == new_idx) { ------------------ | Branch (799:18): [True: 198k, False: 11.8k] ------------------ 800| 198k| new_child = pos.last_oh_csh(this_t{}, idx, children, tail, ts); 801| 198k| if (!new_child) { ------------------ | Branch (801:17): [True: 5.34k, False: 193k] ------------------ 802| 5.34k| if (++new_idx < branches) ------------------ | Branch (802:21): [True: 2.68k, False: 2.65k] ------------------ 803| 2.68k| new_child = node_t::make_path(level - B, tail); 804| 2.65k| else 805| 2.65k| return nullptr; 806| 5.34k| } 807| 198k| } else 808| 11.8k| new_child = node_t::make_path(level - B, tail); 809| 207k| IMMER_TRY { ------------------ | | 41| 207k|#define IMMER_TRY try ------------------ 810| 207k| auto count = new_idx + 1; 811| 207k| auto new_parent = 812| 207k| node_t::copy_inner_r_n(count, pos.node(), new_idx); 813| 207k| auto new_relaxed = new_parent->relaxed(); 814| 207k| new_parent->inner()[new_idx] = new_child; 815| 207k| new_relaxed->d.sizes[new_idx] = pos.size() + ts; 816| 207k| new_relaxed->d.count = count; 817| 207k| assert(new_relaxed->d.sizes[new_idx]); 818| 0| return new_parent; 819| 207k| } 820| 207k| IMMER_CATCH (...) { 821| 0| auto shift = pos.shift(); 822| 0| auto size = new_idx == idx ? children + ts : ts; ------------------ | Branch (822:26): [True: 0, False: 0] ------------------ 823| 0| if (shift > BL) { ------------------ | Branch (823:17): [True: 0, False: 0] ------------------ 824| 0| tail->inc(); 825| 0| dec_inner(new_child, shift - B, size); 826| 0| } 827| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 828| 0| } 829| 207k| } _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_: 833| 40.6k| { 834| 40.6k| assert((pos.size() & mask) == 0); 835| 0| auto idx = pos.index(pos.size() - 1); 836| 40.6k| auto new_idx = pos.index(pos.size() + branches - 1); 837| 40.6k| auto count = new_idx + 1; 838| 40.6k| auto new_parent = node_t::make_inner_n(count); 839| 40.6k| IMMER_TRY { ------------------ | | 41| 40.6k|#define IMMER_TRY try ------------------ 840| 40.6k| new_parent->inner()[new_idx] = 841| 40.6k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (841:17): [True: 31.7k, False: 8.91k] ------------------ 842| | /* otherwise */ 843| 40.6k| : node_t::make_path(pos.shift() - B, tail); 844| 40.6k| } 845| 40.6k| IMMER_CATCH (...) { 846| 0| node_t::delete_inner(new_parent, count); 847| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 848| 0| } 849| 40.6k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 850| 40.6k| } _ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_regularIRNS1_11regular_posISC_EEJEEEPSC_OT_SI_DpOT0_: 833| 444k| { 834| 444k| assert((pos.size() & mask) == 0); 835| 0| auto idx = pos.index(pos.size() - 1); 836| 444k| auto new_idx = pos.index(pos.size() + branches - 1); 837| 444k| auto count = new_idx + 1; 838| 444k| auto new_parent = node_t::make_inner_n(count); 839| 444k| IMMER_TRY { ------------------ | | 41| 444k|#define IMMER_TRY try ------------------ 840| 444k| new_parent->inner()[new_idx] = 841| 444k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (841:17): [True: 287k, False: 156k] ------------------ 842| | /* otherwise */ 843| 444k| : node_t::make_path(pos.shift() - B, tail); 844| 444k| } 845| 444k| IMMER_CATCH (...) { 846| 0| node_t::delete_inner(new_parent, count); 847| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 848| 0| } 849| 444k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 850| 444k| } _ZN5immer6detail4rbts9dec_innerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEvPT_jm: 561| 446|{ 562| 446| visit_maybe_relaxed_sub(node, shift, size, dec_visitor()); 563| 446|} _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_: 833| 144k| { 834| 144k| assert((pos.size() & mask) == 0); 835| 0| auto idx = pos.index(pos.size() - 1); 836| 144k| auto new_idx = pos.index(pos.size() + branches - 1); 837| 144k| auto count = new_idx + 1; 838| 144k| auto new_parent = node_t::make_inner_n(count); 839| 144k| IMMER_TRY { ------------------ | | 41| 144k|#define IMMER_TRY try ------------------ 840| 144k| new_parent->inner()[new_idx] = 841| 144k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (841:17): [True: 124k, False: 19.8k] ------------------ 842| | /* otherwise */ 843| 144k| : node_t::make_path(pos.shift() - B, tail); 844| 144k| } 845| 144k| IMMER_CATCH (...) { 846| 0| node_t::delete_inner(new_parent, count); 847| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 848| 0| } 849| 144k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 850| 144k| } 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_: 501| 313k| { 502| 313k| auto offset = pos.index(idx); 503| 313k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 504| 313k| IMMER_TRY { ------------------ | | 41| 313k|#define IMMER_TRY try ------------------ 505| 313k| node->leaf()[offset] = 506| 313k| std::forward(fn)(std::move(node->leaf()[offset])); 507| 313k| return node; 508| 313k| } 509| 313k| IMMER_CATCH (...) { 510| 0| node_t::delete_leaf(node, pos.count()); 511| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 512| 0| } 513| 313k| } 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_: 465| 88.7k| { 466| 88.7k| auto offset = pos.index(idx); 467| 88.7k| auto count = pos.count(); 468| 88.7k| auto node = node_t::make_inner_sr_n(count, pos.relaxed()); 469| 88.7k| IMMER_TRY { ------------------ | | 41| 88.7k|#define IMMER_TRY try ------------------ 470| 88.7k| auto child = pos.towards_oh(this_t{}, idx, offset, fn); 471| 88.7k| node_t::do_copy_inner_replace_sr( 472| 88.7k| node, pos.node(), count, offset, child); 473| 88.7k| return node; 474| 88.7k| } 475| 88.7k| IMMER_CATCH (...) { 476| 0| node_t::delete_inner_r(node, count); 477| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 478| 0| } 479| 88.7k| } 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_: 483| 49.4k| { 484| 49.4k| auto offset = pos.index(idx); 485| 49.4k| auto count = pos.count(); 486| 49.4k| auto node = node_t::make_inner_n(count); 487| 49.4k| IMMER_TRY { ------------------ | | 41| 49.4k|#define IMMER_TRY try ------------------ 488| 49.4k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 489| 49.4k| node_t::do_copy_inner_replace( 490| 49.4k| node, pos.node(), count, offset, child); 491| 49.4k| return node; 492| 49.4k| } 493| 49.4k| IMMER_CATCH (...) { 494| 0| node_t::delete_inner(node, count); 495| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 496| 0| } 497| 49.4k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_13full_leaf_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 501| 22.4k| { 502| 22.4k| auto offset = pos.index(idx); 503| 22.4k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 504| 22.4k| IMMER_TRY { ------------------ | | 41| 22.4k|#define IMMER_TRY try ------------------ 505| 22.4k| node->leaf()[offset] = 506| 22.4k| std::forward(fn)(std::move(node->leaf()[offset])); 507| 22.4k| return node; 508| 22.4k| } 509| 22.4k| IMMER_CATCH (...) { 510| 0| node_t::delete_leaf(node, pos.count()); 511| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 512| 0| } 513| 22.4k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_regularIRNS1_8full_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 483| 9.67k| { 484| 9.67k| auto offset = pos.index(idx); 485| 9.67k| auto count = pos.count(); 486| 9.67k| auto node = node_t::make_inner_n(count); 487| 9.67k| IMMER_TRY { ------------------ | | 41| 9.67k|#define IMMER_TRY try ------------------ 488| 9.67k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 489| 9.67k| node_t::do_copy_inner_replace( 490| 9.67k| node, pos.node(), count, offset, child); 491| 9.67k| return node; 492| 9.67k| } 493| 9.67k| IMMER_CATCH (...) { 494| 0| node_t::delete_inner(node, count); 495| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 496| 0| } 497| 9.67k| } 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_: 501| 26.9k| { 502| 26.9k| auto offset = pos.index(idx); 503| 26.9k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 504| 26.9k| IMMER_TRY { ------------------ | | 41| 26.9k|#define IMMER_TRY try ------------------ 505| 26.9k| node->leaf()[offset] = 506| 26.9k| std::forward(fn)(std::move(node->leaf()[offset])); 507| 26.9k| return node; 508| 26.9k| } 509| 26.9k| IMMER_CATCH (...) { 510| 0| node_t::delete_leaf(node, pos.count()); 511| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 512| 0| } 513| 26.9k| } 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_: 483| 14.1k| { 484| 14.1k| auto offset = pos.index(idx); 485| 14.1k| auto count = pos.count(); 486| 14.1k| auto node = node_t::make_inner_n(count); 487| 14.1k| IMMER_TRY { ------------------ | | 41| 14.1k|#define IMMER_TRY try ------------------ 488| 14.1k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 489| 14.1k| node_t::do_copy_inner_replace( 490| 14.1k| node, pos.node(), count, offset, child); 491| 14.1k| return node; 492| 14.1k| } 493| 14.1k| IMMER_CATCH (...) { 494| 0| node_t::delete_inner(node, count); 495| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 496| 0| } 497| 14.1k| } _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: 1095| 31.9k| { 1096| 31.9k| auto idx = pos.index(last); 1097| 31.9k| if (Collapse && idx == 0) { ------------------ | Branch (1097:13): [Folded - Ignored] | Branch (1097:25): [True: 24.6k, False: 7.29k] ------------------ 1098| 24.6k| return pos.towards_oh(this_t{}, last, idx); 1099| 24.6k| } else { 1100| 7.29k| using std::get; 1101| 7.29k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1102| 7.29k| auto next = get<1>(subs); 1103| 7.29k| auto ts = get<2>(subs); 1104| 7.29k| auto tail = get<3>(subs); 1105| 7.29k| IMMER_TRY { ------------------ | | 41| 7.29k|#define IMMER_TRY try ------------------ 1106| 7.29k| if (next) { ------------------ | Branch (1106:21): [True: 4.08k, False: 3.21k] ------------------ 1107| 4.08k| auto count = idx + 1; 1108| 4.08k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1109| 4.08k| auto newr = newn->relaxed(); 1110| 4.08k| newn->inner()[idx] = next; 1111| 4.08k| newr->d.sizes[idx] = last + 1 - ts; 1112| 4.08k| newr->d.count = count; 1113| 4.08k| assert(newr->d.sizes[idx]); 1114| 0| return std::make_tuple(pos.shift(), newn, ts, tail); 1115| 4.08k| } else if (idx == 0) { ------------------ | Branch (1115:28): [True: 0, False: 3.21k] ------------------ 1116| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1117| 3.21k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1117:28): [Folded - Ignored] | Branch (1117:40): [True: 1.84k, False: 1.36k] | Branch (1117:52): [True: 1.05k, False: 795] ------------------ 1118| 1.05k| auto newn = pos.node()->inner()[0]; 1119| 1.05k| return std::make_tuple( 1120| 1.05k| pos.shift() - B, newn->inc(), ts, tail); 1121| 2.16k| } else { 1122| 2.16k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1123| 2.16k| return std::make_tuple(pos.shift(), newn, ts, tail); 1124| 2.16k| } 1125| 7.29k| } 1126| 7.29k| IMMER_CATCH (...) { 1127| 0| assert(!next || pos.shift() > BL); 1128| 0| if (next) ------------------ | Branch (1128:21): [True: 0, False: 0] ------------------ 1129| 0| dec_inner(next, 1130| 0| pos.shift() - B, 1131| 0| last + 1 - ts - pos.size_before(idx)); 1132| 0| if (tail) ------------------ | Branch (1132:21): [True: 0, False: 0] ------------------ 1133| 0| dec_leaf(tail, ts); 1134| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1135| 0| } 1136| 7.29k| } 1137| 31.9k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1180| 1.97k| { 1181| 1.97k| auto old_tail_size = pos.count(); 1182| 1.97k| auto new_tail_size = pos.index(last) + 1; 1183| 1.97k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1183:30): [True: 489, False: 1.48k] ------------------ 1184| 1.97k| ? pos.node()->inc() 1185| 1.97k| : node_t::copy_leaf(pos.node(), new_tail_size); 1186| 1.97k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1187| 1.97k| } _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: 1180| 4.35k| { 1181| 4.35k| auto old_tail_size = pos.count(); 1182| 4.35k| auto new_tail_size = pos.index(last) + 1; 1183| 4.35k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1183:30): [True: 1.22k, False: 3.12k] ------------------ 1184| 4.35k| ? pos.node()->inc() 1185| 4.35k| : node_t::copy_leaf(pos.node(), new_tail_size); 1186| 4.35k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1187| 4.35k| } _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: 1095| 3.59k| { 1096| 3.59k| auto idx = pos.index(last); 1097| 3.59k| if (Collapse && idx == 0) { ------------------ | Branch (1097:13): [Folded - Ignored] | Branch (1097:25): [True: 0, False: 0] ------------------ 1098| 0| return pos.towards_oh(this_t{}, last, idx); 1099| 3.59k| } else { 1100| 3.59k| using std::get; 1101| 3.59k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1102| 3.59k| auto next = get<1>(subs); 1103| 3.59k| auto ts = get<2>(subs); 1104| 3.59k| auto tail = get<3>(subs); 1105| 3.59k| IMMER_TRY { ------------------ | | 41| 3.59k|#define IMMER_TRY try ------------------ 1106| 3.59k| if (next) { ------------------ | Branch (1106:21): [True: 739, False: 2.85k] ------------------ 1107| 739| auto count = idx + 1; 1108| 739| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1109| 739| auto newr = newn->relaxed(); 1110| 739| newn->inner()[idx] = next; 1111| 739| newr->d.sizes[idx] = last + 1 - ts; 1112| 739| newr->d.count = count; 1113| 739| assert(newr->d.sizes[idx]); 1114| 0| return std::make_tuple(pos.shift(), newn, ts, tail); 1115| 2.85k| } else if (idx == 0) { ------------------ | Branch (1115:28): [True: 1.10k, False: 1.74k] ------------------ 1116| 1.10k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1117| 1.74k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1117:28): [Folded - Ignored] | Branch (1117:40): [True: 0, False: 0] | Branch (1117:52): [True: 0, False: 0] ------------------ 1118| 0| auto newn = pos.node()->inner()[0]; 1119| 0| return std::make_tuple( 1120| 0| pos.shift() - B, newn->inc(), ts, tail); 1121| 1.74k| } else { 1122| 1.74k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1123| 1.74k| return std::make_tuple(pos.shift(), newn, ts, tail); 1124| 1.74k| } 1125| 3.59k| } 1126| 3.59k| IMMER_CATCH (...) { 1127| 0| assert(!next || pos.shift() > BL); 1128| 0| if (next) ------------------ | Branch (1128:21): [True: 0, False: 0] ------------------ 1129| 0| dec_inner(next, 1130| 0| pos.shift() - B, 1131| 0| last + 1 - ts - pos.size_before(idx)); 1132| 0| if (tail) ------------------ | Branch (1132:21): [True: 0, False: 0] ------------------ 1133| 0| dec_leaf(tail, ts); 1134| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1135| 0| } 1136| 3.59k| } 1137| 3.59k| } _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: 1141| 2.93k| { 1142| 2.93k| auto idx = pos.index(last); 1143| 2.93k| if (Collapse && idx == 0) { ------------------ | Branch (1143:13): [Folded - Ignored] | Branch (1143:25): [True: 0, False: 0] ------------------ 1144| 0| return pos.towards_oh(this_t{}, last, idx); 1145| 2.93k| } else { 1146| 2.93k| using std::get; 1147| 2.93k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1148| 2.93k| auto next = get<1>(subs); 1149| 2.93k| auto ts = get<2>(subs); 1150| 2.93k| auto tail = get<3>(subs); 1151| 2.93k| IMMER_TRY { ------------------ | | 41| 2.93k|#define IMMER_TRY try ------------------ 1152| 2.93k| if (next) { ------------------ | Branch (1152:21): [True: 1.53k, False: 1.40k] ------------------ 1153| 1.53k| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1154| 1.53k| newn->inner()[idx] = next; 1155| 1.53k| return std::make_tuple(pos.shift(), newn, ts, tail); 1156| 1.53k| } else if (idx == 0) { ------------------ | Branch (1156:28): [True: 604, False: 803] ------------------ 1157| 604| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1158| 803| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1158:28): [Folded - Ignored] | Branch (1158:40): [True: 0, False: 0] | Branch (1158:52): [True: 0, False: 0] ------------------ 1159| 0| auto newn = pos.node()->inner()[0]; 1160| 0| return std::make_tuple( 1161| 0| pos.shift() - B, newn->inc(), ts, tail); 1162| 803| } else { 1163| 803| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1164| 803| return std::make_tuple(pos.shift(), newn, ts, tail); 1165| 803| } 1166| 2.93k| } 1167| 2.93k| IMMER_CATCH (...) { 1168| 0| assert(!next || pos.shift() > BL); 1169| 0| assert(tail); 1170| 0| if (next) ------------------ | Branch (1170:21): [True: 0, False: 0] ------------------ 1171| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1172| 0| dec_leaf(tail, ts); 1173| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1174| 0| } 1175| 2.93k| } 1176| 2.93k| } _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: 1180| 5.33k| { 1181| 5.33k| auto old_tail_size = pos.count(); 1182| 5.33k| auto new_tail_size = pos.index(last) + 1; 1183| 5.33k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1183:30): [True: 1.12k, False: 4.20k] ------------------ 1184| 5.33k| ? pos.node()->inc() 1185| 5.33k| : node_t::copy_leaf(pos.node(), new_tail_size); 1186| 5.33k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1187| 5.33k| } _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: 1141| 2.20k| { 1142| 2.20k| auto idx = pos.index(last); 1143| 2.20k| if (Collapse && idx == 0) { ------------------ | Branch (1143:13): [Folded - Ignored] | Branch (1143:25): [True: 0, False: 0] ------------------ 1144| 0| return pos.towards_oh(this_t{}, last, idx); 1145| 2.20k| } else { 1146| 2.20k| using std::get; 1147| 2.20k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1148| 2.20k| auto next = get<1>(subs); 1149| 2.20k| auto ts = get<2>(subs); 1150| 2.20k| auto tail = get<3>(subs); 1151| 2.20k| IMMER_TRY { ------------------ | | 41| 2.20k|#define IMMER_TRY try ------------------ 1152| 2.20k| if (next) { ------------------ | Branch (1152:21): [True: 233, False: 1.97k] ------------------ 1153| 233| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1154| 233| newn->inner()[idx] = next; 1155| 233| return std::make_tuple(pos.shift(), newn, ts, tail); 1156| 1.97k| } else if (idx == 0) { ------------------ | Branch (1156:28): [True: 429, False: 1.54k] ------------------ 1157| 429| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1158| 1.54k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1158:28): [Folded - Ignored] | Branch (1158:40): [True: 0, False: 0] | Branch (1158:52): [True: 0, False: 0] ------------------ 1159| 0| auto newn = pos.node()->inner()[0]; 1160| 0| return std::make_tuple( 1161| 0| pos.shift() - B, newn->inc(), ts, tail); 1162| 1.54k| } else { 1163| 1.54k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1164| 1.54k| return std::make_tuple(pos.shift(), newn, ts, tail); 1165| 1.54k| } 1166| 2.20k| } 1167| 2.20k| IMMER_CATCH (...) { 1168| 0| assert(!next || pos.shift() > BL); 1169| 0| assert(tail); 1170| 0| if (next) ------------------ | Branch (1170:21): [True: 0, False: 0] ------------------ 1171| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1172| 0| dec_leaf(tail, ts); 1173| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1174| 0| } 1175| 2.20k| } 1176| 2.20k| } _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: 1180| 2.92k| { 1181| 2.92k| auto old_tail_size = pos.count(); 1182| 2.92k| auto new_tail_size = pos.index(last) + 1; 1183| 2.92k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1183:30): [True: 1.12k, False: 1.80k] ------------------ 1184| 2.92k| ? pos.node()->inc() 1185| 2.92k| : node_t::copy_leaf(pos.node(), new_tail_size); 1186| 2.92k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1187| 2.92k| } _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: 1141| 3.13k| { 1142| 3.13k| auto idx = pos.index(last); 1143| 3.13k| if (Collapse && idx == 0) { ------------------ | Branch (1143:13): [Folded - Ignored] | Branch (1143:25): [True: 0, False: 0] ------------------ 1144| 0| return pos.towards_oh(this_t{}, last, idx); 1145| 3.13k| } else { 1146| 3.13k| using std::get; 1147| 3.13k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1148| 3.13k| auto next = get<1>(subs); 1149| 3.13k| auto ts = get<2>(subs); 1150| 3.13k| auto tail = get<3>(subs); 1151| 3.13k| IMMER_TRY { ------------------ | | 41| 3.13k|#define IMMER_TRY try ------------------ 1152| 3.13k| if (next) { ------------------ | Branch (1152:21): [True: 874, False: 2.25k] ------------------ 1153| 874| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1154| 874| newn->inner()[idx] = next; 1155| 874| return std::make_tuple(pos.shift(), newn, ts, tail); 1156| 2.25k| } else if (idx == 0) { ------------------ | Branch (1156:28): [True: 892, False: 1.36k] ------------------ 1157| 892| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1158| 1.36k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1158:28): [Folded - Ignored] | Branch (1158:40): [True: 0, False: 0] | Branch (1158:52): [True: 0, False: 0] ------------------ 1159| 0| auto newn = pos.node()->inner()[0]; 1160| 0| return std::make_tuple( 1161| 0| pos.shift() - B, newn->inc(), ts, tail); 1162| 1.36k| } else { 1163| 1.36k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1164| 1.36k| return std::make_tuple(pos.shift(), newn, ts, tail); 1165| 1.36k| } 1166| 3.13k| } 1167| 3.13k| IMMER_CATCH (...) { 1168| 0| assert(!next || pos.shift() > BL); 1169| 0| assert(tail); 1170| 0| if (next) ------------------ | Branch (1170:21): [True: 0, False: 0] ------------------ 1171| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1172| 0| dec_leaf(tail, ts); 1173| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1174| 0| } 1175| 3.13k| } 1176| 3.13k| } _ZN5immer6detail4rbts8dec_leafINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEvPT_j: 555| 40.8k|{ 556| 40.8k| make_leaf_sub_pos(node, n).visit(dec_visitor{}); 557| 40.8k|} _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: 1141| 7.68k| { 1142| 7.68k| auto idx = pos.index(last); 1143| 7.68k| if (Collapse && idx == 0) { ------------------ | Branch (1143:13): [Folded - Ignored] | Branch (1143:25): [True: 4.74k, False: 2.93k] ------------------ 1144| 4.74k| return pos.towards_oh(this_t{}, last, idx); 1145| 4.74k| } else { 1146| 2.93k| using std::get; 1147| 2.93k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1148| 2.93k| auto next = get<1>(subs); 1149| 2.93k| auto ts = get<2>(subs); 1150| 2.93k| auto tail = get<3>(subs); 1151| 2.93k| IMMER_TRY { ------------------ | | 41| 2.93k|#define IMMER_TRY try ------------------ 1152| 2.93k| if (next) { ------------------ | Branch (1152:21): [True: 918, False: 2.01k] ------------------ 1153| 918| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1154| 918| newn->inner()[idx] = next; 1155| 918| return std::make_tuple(pos.shift(), newn, ts, tail); 1156| 2.01k| } else if (idx == 0) { ------------------ | Branch (1156:28): [True: 0, False: 2.01k] ------------------ 1157| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1158| 2.01k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1158:28): [Folded - Ignored] | Branch (1158:40): [True: 1.36k, False: 655] | Branch (1158:52): [True: 679, False: 685] ------------------ 1159| 679| auto newn = pos.node()->inner()[0]; 1160| 679| return std::make_tuple( 1161| 679| pos.shift() - B, newn->inc(), ts, tail); 1162| 1.34k| } else { 1163| 1.34k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1164| 1.34k| return std::make_tuple(pos.shift(), newn, ts, tail); 1165| 1.34k| } 1166| 2.93k| } 1167| 2.93k| IMMER_CATCH (...) { 1168| 0| assert(!next || pos.shift() > BL); 1169| 0| assert(tail); 1170| 0| if (next) ------------------ | Branch (1170:21): [True: 0, False: 0] ------------------ 1171| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1172| 0| dec_leaf(tail, ts); 1173| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1174| 0| } 1175| 2.93k| } 1176| 7.68k| } _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: 1180| 1.48k| { 1181| 1.48k| auto old_tail_size = pos.count(); 1182| 1.48k| auto new_tail_size = pos.index(last) + 1; 1183| 1.48k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1183:30): [True: 467, False: 1.01k] ------------------ 1184| 1.48k| ? pos.node()->inc() 1185| 1.48k| : node_t::copy_leaf(pos.node(), new_tail_size); 1186| 1.48k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1187| 1.48k| } _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: 1141| 4.25k| { 1142| 4.25k| auto idx = pos.index(last); 1143| 4.25k| if (Collapse && idx == 0) { ------------------ | Branch (1143:13): [Folded - Ignored] | Branch (1143:25): [True: 1.87k, False: 2.38k] ------------------ 1144| 1.87k| return pos.towards_oh(this_t{}, last, idx); 1145| 2.38k| } else { 1146| 2.38k| using std::get; 1147| 2.38k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1148| 2.38k| auto next = get<1>(subs); 1149| 2.38k| auto ts = get<2>(subs); 1150| 2.38k| auto tail = get<3>(subs); 1151| 2.38k| IMMER_TRY { ------------------ | | 41| 2.38k|#define IMMER_TRY try ------------------ 1152| 2.38k| if (next) { ------------------ | Branch (1152:21): [True: 462, False: 1.91k] ------------------ 1153| 462| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1154| 462| newn->inner()[idx] = next; 1155| 462| return std::make_tuple(pos.shift(), newn, ts, tail); 1156| 1.91k| } else if (idx == 0) { ------------------ | Branch (1156:28): [True: 0, False: 1.91k] ------------------ 1157| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1158| 1.91k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1158:28): [Folded - Ignored] | Branch (1158:40): [True: 584, False: 1.33k] | Branch (1158:52): [True: 204, False: 380] ------------------ 1159| 204| auto newn = pos.node()->inner()[0]; 1160| 204| return std::make_tuple( 1161| 204| pos.shift() - B, newn->inc(), ts, tail); 1162| 1.71k| } else { 1163| 1.71k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1164| 1.71k| return std::make_tuple(pos.shift(), newn, ts, tail); 1165| 1.71k| } 1166| 2.38k| } 1167| 2.38k| IMMER_CATCH (...) { 1168| 0| assert(!next || pos.shift() > BL); 1169| 0| assert(tail); 1170| 0| if (next) ------------------ | Branch (1170:21): [True: 0, False: 0] ------------------ 1171| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1172| 0| dec_leaf(tail, ts); 1173| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1174| 0| } 1175| 2.38k| } 1176| 4.25k| } _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: 1180| 888| { 1181| 888| auto old_tail_size = pos.count(); 1182| 888| auto new_tail_size = pos.index(last) + 1; 1183| 888| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1183:30): [True: 362, False: 526] ------------------ 1184| 888| ? pos.node()->inc() 1185| 888| : node_t::copy_leaf(pos.node(), new_tail_size); 1186| 888| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1187| 888| } _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: 1413| 21.0k| { 1414| 21.0k| auto idx = pos.subindex(first); 1415| 21.0k| auto count = pos.count(); 1416| 21.0k| auto left_size = pos.size_before(idx); 1417| 21.0k| auto child_size = pos.size_sbh(idx, left_size); 1418| 21.0k| auto dropped_size = first; 1419| 21.0k| auto child_dropped_size = dropped_size - left_size; 1420| 21.0k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1420:13): [Folded - Ignored] | Branch (1420:25): [True: 18.7k, False: 2.25k] | Branch (1420:45): [True: 3.80k, False: 14.9k] ------------------ 1421| 3.80k| return pos.towards_sub_oh(this_t{}, first, idx); 1422| 17.2k| } else { 1423| 17.2k| using std::get; 1424| 17.2k| auto n = pos.node(); 1425| 17.2k| auto newc = count - idx; 1426| 17.2k| auto newn = node_t::make_inner_r_n(newc); 1427| 17.2k| IMMER_TRY { ------------------ | | 41| 17.2k|#define IMMER_TRY try ------------------ 1428| 17.2k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1429| 17.2k| auto newr = newn->relaxed(); 1430| 17.2k| newr->d.count = count - idx; 1431| 17.2k| newr->d.sizes[0] = child_size - child_dropped_size; 1432| 17.2k| assert(newr->d.sizes[0]); 1433| 0| pos.copy_sizes(idx + 1, 1434| 17.2k| newr->d.count - 1, 1435| 17.2k| newr->d.sizes[0], 1436| 17.2k| newr->d.sizes + 1); 1437| 17.2k| assert(newr->d.sizes[newr->d.count - 1] == 1438| 17.2k| pos.size() - dropped_size); 1439| 0| newn->inner()[0] = get<1>(subs); 1440| 17.2k| std::copy(n->inner() + idx + 1, 1441| 17.2k| n->inner() + count, 1442| 17.2k| newn->inner() + 1); 1443| 17.2k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1444| 17.2k| return std::make_tuple(pos.shift(), newn); 1445| 17.2k| } 1446| 17.2k| IMMER_CATCH (...) { 1447| 0| node_t::delete_inner_r(newn, newc); 1448| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1449| 0| } 1450| 17.2k| } 1451| 21.0k| } _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: 1455| 15.9k| { 1456| 15.9k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1457| 15.9k| return std::make_tuple(0, n); 1458| 15.9k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE11visit_innerIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1413| 80.0k| { 1414| 80.0k| auto idx = pos.subindex(first); 1415| 80.0k| auto count = pos.count(); 1416| 80.0k| auto left_size = pos.size_before(idx); 1417| 80.0k| auto child_size = pos.size_sbh(idx, left_size); 1418| 80.0k| auto dropped_size = first; 1419| 80.0k| auto child_dropped_size = dropped_size - left_size; 1420| 80.0k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1420:13): [Folded - Ignored] | Branch (1420:25): [True: 0, False: 0] | Branch (1420:45): [True: 0, False: 0] ------------------ 1421| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1422| 80.0k| } else { 1423| 80.0k| using std::get; 1424| 80.0k| auto n = pos.node(); 1425| 80.0k| auto newc = count - idx; 1426| 80.0k| auto newn = node_t::make_inner_r_n(newc); 1427| 80.0k| IMMER_TRY { ------------------ | | 41| 80.0k|#define IMMER_TRY try ------------------ 1428| 80.0k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1429| 80.0k| auto newr = newn->relaxed(); 1430| 80.0k| newr->d.count = count - idx; 1431| 80.0k| newr->d.sizes[0] = child_size - child_dropped_size; 1432| 80.0k| assert(newr->d.sizes[0]); 1433| 0| pos.copy_sizes(idx + 1, 1434| 80.0k| newr->d.count - 1, 1435| 80.0k| newr->d.sizes[0], 1436| 80.0k| newr->d.sizes + 1); 1437| 80.0k| assert(newr->d.sizes[newr->d.count - 1] == 1438| 80.0k| pos.size() - dropped_size); 1439| 0| newn->inner()[0] = get<1>(subs); 1440| 80.0k| std::copy(n->inner() + idx + 1, 1441| 80.0k| n->inner() + count, 1442| 80.0k| newn->inner() + 1); 1443| 80.0k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1444| 80.0k| return std::make_tuple(pos.shift(), newn); 1445| 80.0k| } 1446| 80.0k| IMMER_CATCH (...) { 1447| 0| node_t::delete_inner_r(newn, newc); 1448| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1449| 0| } 1450| 80.0k| } 1451| 80.0k| } _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: 1413| 1.30k| { 1414| 1.30k| auto idx = pos.subindex(first); 1415| 1.30k| auto count = pos.count(); 1416| 1.30k| auto left_size = pos.size_before(idx); 1417| 1.30k| auto child_size = pos.size_sbh(idx, left_size); 1418| 1.30k| auto dropped_size = first; 1419| 1.30k| auto child_dropped_size = dropped_size - left_size; 1420| 1.30k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1420:13): [Folded - Ignored] | Branch (1420:25): [True: 0, False: 0] | Branch (1420:45): [True: 0, False: 0] ------------------ 1421| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1422| 1.30k| } else { 1423| 1.30k| using std::get; 1424| 1.30k| auto n = pos.node(); 1425| 1.30k| auto newc = count - idx; 1426| 1.30k| auto newn = node_t::make_inner_r_n(newc); 1427| 1.30k| IMMER_TRY { ------------------ | | 41| 1.30k|#define IMMER_TRY try ------------------ 1428| 1.30k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1429| 1.30k| auto newr = newn->relaxed(); 1430| 1.30k| newr->d.count = count - idx; 1431| 1.30k| newr->d.sizes[0] = child_size - child_dropped_size; 1432| 1.30k| assert(newr->d.sizes[0]); 1433| 0| pos.copy_sizes(idx + 1, 1434| 1.30k| newr->d.count - 1, 1435| 1.30k| newr->d.sizes[0], 1436| 1.30k| newr->d.sizes + 1); 1437| 1.30k| assert(newr->d.sizes[newr->d.count - 1] == 1438| 1.30k| pos.size() - dropped_size); 1439| 0| newn->inner()[0] = get<1>(subs); 1440| 1.30k| std::copy(n->inner() + idx + 1, 1441| 1.30k| n->inner() + count, 1442| 1.30k| newn->inner() + 1); 1443| 1.30k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1444| 1.30k| return std::make_tuple(pos.shift(), newn); 1445| 1.30k| } 1446| 1.30k| IMMER_CATCH (...) { 1447| 0| node_t::delete_inner_r(newn, newc); 1448| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1449| 0| } 1450| 1.30k| } 1451| 1.30k| } _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: 1455| 9.49k| { 1456| 9.49k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1457| 9.49k| return std::make_tuple(0, n); 1458| 9.49k| } _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: 1413| 6.32k| { 1414| 6.32k| auto idx = pos.subindex(first); 1415| 6.32k| auto count = pos.count(); 1416| 6.32k| auto left_size = pos.size_before(idx); 1417| 6.32k| auto child_size = pos.size_sbh(idx, left_size); 1418| 6.32k| auto dropped_size = first; 1419| 6.32k| auto child_dropped_size = dropped_size - left_size; 1420| 6.32k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1420:13): [Folded - Ignored] | Branch (1420:25): [True: 0, False: 0] | Branch (1420:45): [True: 0, False: 0] ------------------ 1421| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1422| 6.32k| } else { 1423| 6.32k| using std::get; 1424| 6.32k| auto n = pos.node(); 1425| 6.32k| auto newc = count - idx; 1426| 6.32k| auto newn = node_t::make_inner_r_n(newc); 1427| 6.32k| IMMER_TRY { ------------------ | | 41| 6.32k|#define IMMER_TRY try ------------------ 1428| 6.32k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1429| 6.32k| auto newr = newn->relaxed(); 1430| 6.32k| newr->d.count = count - idx; 1431| 6.32k| newr->d.sizes[0] = child_size - child_dropped_size; 1432| 6.32k| assert(newr->d.sizes[0]); 1433| 0| pos.copy_sizes(idx + 1, 1434| 6.32k| newr->d.count - 1, 1435| 6.32k| newr->d.sizes[0], 1436| 6.32k| newr->d.sizes + 1); 1437| 6.32k| assert(newr->d.sizes[newr->d.count - 1] == 1438| 6.32k| pos.size() - dropped_size); 1439| 0| newn->inner()[0] = get<1>(subs); 1440| 6.32k| std::copy(n->inner() + idx + 1, 1441| 6.32k| n->inner() + count, 1442| 6.32k| newn->inner() + 1); 1443| 6.32k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1444| 6.32k| return std::make_tuple(pos.shift(), newn); 1445| 6.32k| } 1446| 6.32k| IMMER_CATCH (...) { 1447| 0| node_t::delete_inner_r(newn, newc); 1448| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1449| 0| } 1450| 6.32k| } 1451| 6.32k| } _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: 1413| 10.1k| { 1414| 10.1k| auto idx = pos.subindex(first); 1415| 10.1k| auto count = pos.count(); 1416| 10.1k| auto left_size = pos.size_before(idx); 1417| 10.1k| auto child_size = pos.size_sbh(idx, left_size); 1418| 10.1k| auto dropped_size = first; 1419| 10.1k| auto child_dropped_size = dropped_size - left_size; 1420| 10.1k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1420:13): [Folded - Ignored] | Branch (1420:25): [True: 6.44k, False: 3.71k] | Branch (1420:45): [True: 2.75k, False: 3.69k] ------------------ 1421| 2.75k| return pos.towards_sub_oh(this_t{}, first, idx); 1422| 7.40k| } else { 1423| 7.40k| using std::get; 1424| 7.40k| auto n = pos.node(); 1425| 7.40k| auto newc = count - idx; 1426| 7.40k| auto newn = node_t::make_inner_r_n(newc); 1427| 7.40k| IMMER_TRY { ------------------ | | 41| 7.40k|#define IMMER_TRY try ------------------ 1428| 7.40k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1429| 7.40k| auto newr = newn->relaxed(); 1430| 7.40k| newr->d.count = count - idx; 1431| 7.40k| newr->d.sizes[0] = child_size - child_dropped_size; 1432| 7.40k| assert(newr->d.sizes[0]); 1433| 0| pos.copy_sizes(idx + 1, 1434| 7.40k| newr->d.count - 1, 1435| 7.40k| newr->d.sizes[0], 1436| 7.40k| newr->d.sizes + 1); 1437| 7.40k| assert(newr->d.sizes[newr->d.count - 1] == 1438| 7.40k| pos.size() - dropped_size); 1439| 0| newn->inner()[0] = get<1>(subs); 1440| 7.40k| std::copy(n->inner() + idx + 1, 1441| 7.40k| n->inner() + count, 1442| 7.40k| newn->inner() + 1); 1443| 7.40k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1444| 7.40k| return std::make_tuple(pos.shift(), newn); 1445| 7.40k| } 1446| 7.40k| IMMER_CATCH (...) { 1447| 0| node_t::delete_inner_r(newn, newc); 1448| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1449| 0| } 1450| 7.40k| } 1451| 10.1k| } _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: 1413| 784| { 1414| 784| auto idx = pos.subindex(first); 1415| 784| auto count = pos.count(); 1416| 784| auto left_size = pos.size_before(idx); 1417| 784| auto child_size = pos.size_sbh(idx, left_size); 1418| 784| auto dropped_size = first; 1419| 784| auto child_dropped_size = dropped_size - left_size; 1420| 784| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1420:13): [Folded - Ignored] | Branch (1420:25): [True: 350, False: 434] | Branch (1420:45): [True: 0, False: 350] ------------------ 1421| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1422| 784| } else { 1423| 784| using std::get; 1424| 784| auto n = pos.node(); 1425| 784| auto newc = count - idx; 1426| 784| auto newn = node_t::make_inner_r_n(newc); 1427| 784| IMMER_TRY { ------------------ | | 41| 784|#define IMMER_TRY try ------------------ 1428| 784| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1429| 784| auto newr = newn->relaxed(); 1430| 784| newr->d.count = count - idx; 1431| 784| newr->d.sizes[0] = child_size - child_dropped_size; 1432| 784| assert(newr->d.sizes[0]); 1433| 0| pos.copy_sizes(idx + 1, 1434| 784| newr->d.count - 1, 1435| 784| newr->d.sizes[0], 1436| 784| newr->d.sizes + 1); 1437| 784| assert(newr->d.sizes[newr->d.count - 1] == 1438| 784| pos.size() - dropped_size); 1439| 0| newn->inner()[0] = get<1>(subs); 1440| 784| std::copy(n->inner() + idx + 1, 1441| 784| n->inner() + count, 1442| 784| newn->inner() + 1); 1443| 784| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1444| 784| return std::make_tuple(pos.shift(), newn); 1445| 784| } 1446| 784| IMMER_CATCH (...) { 1447| 0| node_t::delete_inner_r(newn, newc); 1448| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1449| 0| } 1450| 784| } 1451| 784| } _ZN5immer6detail4rbts12concat_treesINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_11relaxed_posIT_EEPSE_jSG_jm: 1996| 9.37k|{ 1997| 9.37k| return make_singleton_regular_sub_pos(ltail, ltcount) 1998| 9.37k| .visit(concat_trees_left_visitor{}, 1999| 9.37k| empty_leaf_pos{}, 2000| 9.37k| rroot, 2001| 9.37k| rshift, 2002| 9.37k| rsize) 2003| 9.37k| .realize(); 2004| 9.37k|} _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_: 1966| 9.37k| { 1967| 9.37k| return visit_maybe_relaxed_sub( 1968| 9.37k| args..., concat_trees_right_visitor{}, lpos, tpos); 1969| 9.37k| } _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_: 1953| 6.74k| { 1954| 6.74k| return concat_inners(lpos, tpos, rpos); 1955| 6.74k| } _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_: 1867| 29.5k|{ 1868| 29.5k| auto lshift = lpos.shift(); 1869| 29.5k| auto rshift = rpos.shift(); 1870| 29.5k| if (lshift > rshift) { ------------------ | Branch (1870:9): [True: 0, False: 29.5k] ------------------ 1871| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1872| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1873| 29.5k| } else if (lshift < rshift) { ------------------ | Branch (1873:16): [True: 23.1k, False: 6.44k] ------------------ 1874| 23.1k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1875| 23.1k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1876| 23.1k| } else { 1877| 6.44k| assert(lshift == rshift); 1878| 0| assert(Node::bits_leaf == 0u || lshift > 0); 1879| 0| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1880| 6.44k| return concat_rebalance(lpos, cpos, rpos); 1881| 6.44k| } 1882| 29.5k|} _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_: 1508| 11.0M| { 1509| 11.0M| if (shift_ == BL) { ------------------ | Branch (1509:13): [True: 966k, False: 10.0M] ------------------ 1510| 966k| auto s = size_t{}; 1511| 3.85M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1511:39): [True: 2.89M, False: 966k] ------------------ 1512| 2.89M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1513| 2.89M| s = sizes_[i]; 1514| 2.89M| } 1515| 10.0M| } else { 1516| 27.2M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1516:39): [True: 17.1M, False: 10.0M] ------------------ 1517| 17.1M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1518| 17.1M| .visit(v, args...); 1519| 10.0M| } 1520| 11.0M| } _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_: 1728| 6.93M| { 1729| 6.93M| auto count = p.count(); 1730| 6.93M| assert(plan.n < Plan::max_children); 1731| 0| plan.counts[plan.n++] = count; 1732| 6.93M| plan.total += count; 1733| 6.93M| } _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_: 1728| 93.0M| { 1729| 93.0M| auto count = p.count(); 1730| 93.0M| assert(plan.n < Plan::max_children); 1731| 0| plan.counts[plan.n++] = count; 1732| 93.0M| plan.total += count; 1733| 93.0M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE7shuffleEj: 1757| 11.0M| { 1758| | // gcc seems to not really understand this code... :( 1759| 11.0M|#if !defined(_MSC_VER) 1760| 11.0M|#pragma GCC diagnostic push 1761| 11.0M|#pragma GCC diagnostic ignored "-Warray-bounds" 1762| 11.0M|#endif 1763| 11.0M| constexpr count_t rrb_extras = 2; 1764| 11.0M| constexpr count_t rrb_invariant = 1; 1765| 11.0M| const auto bits = shift == BL ? BL : B; ------------------ | Branch (1765:43): [True: 966k, False: 10.0M] ------------------ 1766| 11.0M| const auto branches = count_t{1} << bits; 1767| 11.0M| const auto optimal = ((total - 1) >> bits) + 1; 1768| 11.0M| count_t i = 0; 1769| 13.6M| while (n >= optimal + rrb_extras) { ------------------ | Branch (1769:16): [True: 2.63M, False: 11.0M] ------------------ 1770| | // skip ok nodes 1771| 5.99M| while (counts[i] > branches - rrb_invariant) ------------------ | Branch (1771:20): [True: 3.36M, False: 2.63M] ------------------ 1772| 3.36M| i++; 1773| 2.63M| assert(i < n); 1774| | // short node, redistribute 1775| 0| auto remaining = counts[i]; 1776| 9.70M| do { 1777| 9.70M| auto next = counts[i + 1]; 1778| 9.70M| auto count = std::min(remaining + next, branches); 1779| 9.70M| counts[i] = count; 1780| 9.70M| assert(counts[i]); 1781| 0| remaining += next - count; 1782| 9.70M| ++i; 1783| 9.70M| } while (remaining > 0); ------------------ | Branch (1783:22): [True: 7.07M, False: 2.63M] ------------------ 1784| | // remove node 1785| 0| std::move(counts + i + 1, counts + n, counts + i); 1786| 2.63M| --n; 1787| 2.63M| --i; 1788| 2.63M| } 1789| 11.0M|#if !defined(_MSC_VER) 1790| 11.0M|#pragma GCC diagnostic pop 1791| 11.0M|#endif 1792| 11.0M| } _ZNK5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 1477| 22.0M| auto shift() const { return shift_; } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPjj: 1577| 11.0M| {} _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPSC_m: 1484| 11.0M| {} _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_: 1508| 11.0M| { 1509| 11.0M| if (shift_ == BL) { ------------------ | Branch (1509:13): [True: 966k, False: 10.0M] ------------------ 1510| 966k| auto s = size_t{}; 1511| 3.85M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1511:39): [True: 2.89M, False: 966k] ------------------ 1512| 2.89M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1513| 2.89M| s = sizes_[i]; 1514| 2.89M| } 1515| 10.0M| } else { 1516| 27.2M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1516:39): [True: 17.1M, False: 10.0M] ------------------ 1517| 17.1M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1518| 17.1M| .visit(v, args...); 1519| 10.0M| } 1520| 11.0M| } _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_: 1716| 6.93M| { 1717| 6.93M| merger.merge_leaf(p); 1718| 6.93M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10merge_leafIRNS1_12leaf_sub_posISC_EEEEvOT_: 1609| 6.93M| { 1610| 6.93M| auto from = p.node(); 1611| 6.93M| auto from_size = p.size(); 1612| 6.93M| auto from_count = p.count(); 1613| 6.93M| assert(from_size); 1614| 6.93M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1614:13): [True: 6.79M, False: 142k] | Branch (1614:21): [True: 6.73M, False: 59.7k] ------------------ 1615| 6.73M| add_child(from, from_size); 1616| 6.73M| from->inc(); 1617| 6.73M| } else { 1618| 202k| auto from_offset = count_t{}; 1619| 202k| auto from_data = from->leaf(); 1620| 280k| do { 1621| 280k| if (!to_) { ------------------ | Branch (1621:21): [True: 137k, False: 142k] ------------------ 1622| 137k| to_ = node_t::make_leaf_n(*curr_); 1623| 137k| to_offset_ = 0; 1624| 137k| } 1625| 280k| auto data = to_->leaf(); 1626| 280k| auto to_copy = 1627| 280k| std::min(from_count - from_offset, *curr_ - to_offset_); 1628| 280k| detail::uninitialized_copy(from_data + from_offset, 1629| 280k| from_data + from_offset + to_copy, 1630| 280k| data + to_offset_); 1631| 280k| to_offset_ += to_copy; 1632| 280k| from_offset += to_copy; 1633| 280k| if (*curr_ == to_offset_) { ------------------ | Branch (1633:21): [True: 137k, False: 142k] ------------------ 1634| 137k| add_child(to_, to_offset_); 1635| 137k| to_ = nullptr; 1636| 137k| } 1637| 280k| } while (from_offset != from_count); ------------------ | Branch (1637:22): [True: 77.3k, False: 202k] ------------------ 1638| 202k| } 1639| 6.93M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9add_childEPSC_m: 1584| 105M| { 1585| 105M| assert(size); 1586| 0| ++curr_; 1587| 105M| auto parent = result_.nodes_[result_.count_ - 1]; 1588| 105M| auto relaxed = parent->relaxed(); 1589| 105M| if (relaxed->d.count == branches) { ------------------ | Branch (1589:13): [True: 7.17M, False: 98.6M] ------------------ 1590| 7.17M| assert(result_.count_ < result_t::max_children); 1591| 0| n_ -= branches; 1592| 7.17M| parent = node_t::make_inner_r_n(std::min(n_, branches)); 1593| 7.17M| relaxed = parent->relaxed(); 1594| 7.17M| result_.nodes_[result_.count_] = parent; 1595| 7.17M| result_.sizes_[result_.count_] = result_.sizes_[result_.count_ - 1]; 1596| 7.17M| assert(result_.sizes_[result_.count_]); 1597| 0| ++result_.count_; 1598| 7.17M| } 1599| 0| auto idx = relaxed->d.count++; 1600| 105M| result_.sizes_[result_.count_ - 1] += size; 1601| 105M| assert(result_.sizes_[result_.count_ - 1]); 1602| 105M| relaxed->d.sizes[idx] = size + (idx ? relaxed->d.sizes[idx - 1] : 0); ------------------ | Branch (1602:41): [True: 87.6M, False: 18.2M] ------------------ 1603| 105M| assert(relaxed->d.sizes[idx]); 1604| 0| parent->inner()[idx] = p; 1605| 105M| }; _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_: 1710| 93.0M| { 1711| 93.0M| merger.merge_inner(p); 1712| 93.0M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11merge_innerIRNS1_11relaxed_posISC_EEEEvOT_: 1643| 93.0M| { 1644| 93.0M| auto from = p.node(); 1645| 93.0M| auto from_size = p.size(); 1646| 93.0M| auto from_count = p.count(); 1647| 93.0M| assert(from_size); 1648| 93.0M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1648:13): [True: 84.7M, False: 8.29M] | Branch (1648:21): [True: 82.5M, False: 2.17M] ------------------ 1649| 82.5M| add_child(from, from_size); 1650| 82.5M| from->inc(); 1651| 82.5M| } else { 1652| 10.4M| auto from_offset = count_t{}; 1653| 10.4M| auto from_data = from->inner(); 1654| 16.1M| do { 1655| 16.1M| if (!to_) { ------------------ | Branch (1655:21): [True: 7.90M, False: 8.29M] ------------------ 1656| 7.90M| to_ = node_t::make_inner_r_n(*curr_); 1657| 7.90M| to_offset_ = 0; 1658| 7.90M| to_size_ = 0; 1659| 7.90M| } 1660| 16.1M| auto data = to_->inner(); 1661| 16.1M| auto to_copy = 1662| 16.1M| std::min(from_count - from_offset, *curr_ - to_offset_); 1663| 16.1M| std::copy(from_data + from_offset, 1664| 16.1M| from_data + from_offset + to_copy, 1665| 16.1M| data + to_offset_); 1666| 16.1M| node_t::inc_nodes(from_data + from_offset, to_copy); 1667| 16.1M| auto sizes = to_->relaxed()->d.sizes; 1668| 16.1M| p.copy_sizes( 1669| 16.1M| from_offset, to_copy, to_size_, sizes + to_offset_); 1670| 16.1M| to_offset_ += to_copy; 1671| 16.1M| from_offset += to_copy; 1672| 16.1M| to_size_ = sizes[to_offset_ - 1]; 1673| 16.1M| assert(to_size_); 1674| 16.1M| if (*curr_ == to_offset_) { ------------------ | Branch (1674:21): [True: 7.90M, False: 8.29M] ------------------ 1675| 7.90M| to_->relaxed()->d.count = to_offset_; 1676| 7.90M| add_child(to_, to_size_); 1677| 7.90M| to_ = nullptr; 1678| 7.90M| } 1679| 16.1M| } while (from_offset != from_count); ------------------ | Branch (1679:22): [True: 5.72M, False: 10.4M] ------------------ 1680| 10.4M| } 1681| 93.0M| } _ZNK5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE6finishEv: 1684| 11.0M| { 1685| 11.0M| assert(!to_); 1686| 0| return result_; 1687| 11.0M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8each_subINS1_11dec_visitorEJEEEvT_DpOT0_: 1508| 11.0M| { 1509| 11.0M| if (shift_ == BL) { ------------------ | Branch (1509:13): [True: 966k, False: 10.0M] ------------------ 1510| 966k| auto s = size_t{}; 1511| 3.85M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1511:39): [True: 2.89M, False: 966k] ------------------ 1512| 2.89M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1513| 2.89M| s = sizes_[i]; 1514| 2.89M| } 1515| 10.0M| } else { 1516| 27.2M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1516:39): [True: 17.1M, False: 10.0M] ------------------ 1517| 17.1M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1518| 17.1M| .visit(v, args...); 1519| 10.0M| } 1520| 11.0M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPSC_mSE_mSE_m: 1504| 957k| {} _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPSC_mSE_m: 1491| 9.37k| {} _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_: 1912| 22.8k| { 1913| 22.8k| return concat_inners(lpos, tpos, rpos); 1914| 22.8k| } _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_: 1912| 304| { 1913| 304| return concat_inners(lpos, tpos, rpos); 1914| 304| } _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_: 1867| 2.93k|{ 1868| 2.93k| auto lshift = lpos.shift(); 1869| 2.93k| auto rshift = rpos.shift(); 1870| 2.93k| if (lshift > rshift) { ------------------ | Branch (1870:9): [True: 0, False: 2.93k] ------------------ 1871| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1872| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1873| 2.93k| } else if (lshift < rshift) { ------------------ | Branch (1873:16): [True: 764, False: 2.16k] ------------------ 1874| 764| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1875| 764| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1876| 2.16k| } else { 1877| 2.16k| assert(lshift == rshift); 1878| 0| assert(Node::bits_leaf == 0u || lshift > 0); 1879| 0| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1880| 2.16k| return concat_rebalance(lpos, cpos, rpos); 1881| 2.16k| } 1882| 2.93k|} _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_: 1912| 1.08k| { 1913| 1.08k| return concat_inners(lpos, tpos, rpos); 1914| 1.08k| } _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_: 1867| 1.08k|{ 1868| 1.08k| auto lshift = lpos.shift(); 1869| 1.08k| auto rshift = rpos.shift(); 1870| 1.08k| if (lshift > rshift) { ------------------ | Branch (1870:9): [True: 0, False: 1.08k] ------------------ 1871| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1872| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1873| 1.08k| } else if (lshift < rshift) { ------------------ | Branch (1873:16): [True: 319, False: 764] ------------------ 1874| 319| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1875| 319| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1876| 764| } else { 1877| 764| assert(lshift == rshift); 1878| 0| assert(Node::bits_leaf == 0u || lshift > 0); 1879| 0| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1880| 764| return concat_rebalance(lpos, cpos, rpos); 1881| 764| } 1882| 1.08k|} _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_: 1818| 733|{ 1819| 733| auto plan = concat_rebalance_plan{}; 1820| 733| plan.fill(lpos, cpos, rpos); 1821| 733| plan.shuffle(cpos.shift()); 1822| 733| IMMER_TRY { ------------------ | | 41| 733|#define IMMER_TRY try ------------------ 1823| 733| return plan.merge(lpos, cpos, rpos); 1824| 733| } 1825| 733| IMMER_CATCH (...) { 1826| 0| cpos.each_sub(dec_visitor{}); 1827| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1828| 0| } 1829| 733|} _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_: 1747| 733| { 1748| 733| assert(n == 0u); 1749| 0| assert(total == 0u); 1750| 0| using visitor_t = concat_rebalance_plan_fill_visitor; 1751| 733| lpos.each_left_sub(visitor_t{}, *this); 1752| 733| cpos.each_sub(visitor_t{}, *this); 1753| 733| rpos.each_right_sub(visitor_t{}, *this); 1754| 733| } _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_: 1728| 4.79M| { 1729| 4.79M| auto count = p.count(); 1730| 4.79M| assert(plan.n < Plan::max_children); 1731| 0| plan.counts[plan.n++] = count; 1732| 4.79M| plan.total += count; 1733| 4.79M| } _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_: 1728| 584k| { 1729| 584k| auto count = p.count(); 1730| 584k| assert(plan.n < Plan::max_children); 1731| 0| plan.counts[plan.n++] = count; 1732| 584k| plan.total += count; 1733| 584k| } _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_: 1797| 733| { 1798| 733| using node_t = node_type; 1799| 733| using merger_t = concat_merger; 1800| 733| using visitor_t = concat_merger_visitor; 1801| 733| auto merger = merger_t{cpos.shift(), counts, n}; 1802| 733| IMMER_TRY { ------------------ | | 41| 733|#define IMMER_TRY try ------------------ 1803| 733| lpos.each_left_sub(visitor_t{}, merger); 1804| 733| cpos.each_sub(visitor_t{}, merger); 1805| 733| rpos.each_right_sub(visitor_t{}, merger); 1806| 733| cpos.each_sub(dec_visitor{}); 1807| 733| return merger.finish(); 1808| 733| } 1809| 733| IMMER_CATCH (...) { 1810| 0| merger.abort(); 1811| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1812| 0| } 1813| 733| } _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_: 1716| 4.79M| { 1717| 4.79M| merger.merge_leaf(p); 1718| 4.79M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10merge_leafIRNS1_13full_leaf_posISC_EEEEvOT_: 1609| 4.79M| { 1610| 4.79M| auto from = p.node(); 1611| 4.79M| auto from_size = p.size(); 1612| 4.79M| auto from_count = p.count(); 1613| 4.79M| assert(from_size); 1614| 4.79M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1614:13): [True: 4.79M, False: 0] | Branch (1614:21): [True: 4.79M, False: 0] ------------------ 1615| 4.79M| add_child(from, from_size); 1616| 4.79M| from->inc(); 1617| 4.79M| } else { 1618| 0| auto from_offset = count_t{}; 1619| 0| auto from_data = from->leaf(); 1620| 0| do { 1621| 0| if (!to_) { ------------------ | Branch (1621:21): [True: 0, False: 0] ------------------ 1622| 0| to_ = node_t::make_leaf_n(*curr_); 1623| 0| to_offset_ = 0; 1624| 0| } 1625| 0| auto data = to_->leaf(); 1626| 0| auto to_copy = 1627| 0| std::min(from_count - from_offset, *curr_ - to_offset_); 1628| 0| detail::uninitialized_copy(from_data + from_offset, 1629| 0| from_data + from_offset + to_copy, 1630| 0| data + to_offset_); 1631| 0| to_offset_ += to_copy; 1632| 0| from_offset += to_copy; 1633| 0| if (*curr_ == to_offset_) { ------------------ | Branch (1633:21): [True: 0, False: 0] ------------------ 1634| 0| add_child(to_, to_offset_); 1635| 0| to_ = nullptr; 1636| 0| } 1637| 0| } while (from_offset != from_count); ------------------ | Branch (1637:22): [True: 0, False: 0] ------------------ 1638| 0| } 1639| 4.79M| } _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_: 1710| 584k| { 1711| 584k| merger.merge_inner(p); 1712| 584k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11merge_innerIRNS1_8full_posISC_EEEEvOT_: 1643| 584k| { 1644| 584k| auto from = p.node(); 1645| 584k| auto from_size = p.size(); 1646| 584k| auto from_count = p.count(); 1647| 584k| assert(from_size); 1648| 584k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1648:13): [True: 584k, False: 0] | Branch (1648:21): [True: 584k, False: 0] ------------------ 1649| 584k| add_child(from, from_size); 1650| 584k| from->inc(); 1651| 584k| } else { 1652| 0| auto from_offset = count_t{}; 1653| 0| auto from_data = from->inner(); 1654| 0| do { 1655| 0| if (!to_) { ------------------ | Branch (1655:21): [True: 0, False: 0] ------------------ 1656| 0| to_ = node_t::make_inner_r_n(*curr_); 1657| 0| to_offset_ = 0; 1658| 0| to_size_ = 0; 1659| 0| } 1660| 0| auto data = to_->inner(); 1661| 0| auto to_copy = 1662| 0| std::min(from_count - from_offset, *curr_ - to_offset_); 1663| 0| std::copy(from_data + from_offset, 1664| 0| from_data + from_offset + to_copy, 1665| 0| data + to_offset_); 1666| 0| node_t::inc_nodes(from_data + from_offset, to_copy); 1667| 0| auto sizes = to_->relaxed()->d.sizes; 1668| 0| p.copy_sizes( 1669| 0| from_offset, to_copy, to_size_, sizes + to_offset_); 1670| 0| to_offset_ += to_copy; 1671| 0| from_offset += to_copy; 1672| 0| to_size_ = sizes[to_offset_ - 1]; 1673| 0| assert(to_size_); 1674| 0| if (*curr_ == to_offset_) { ------------------ | Branch (1674:21): [True: 0, False: 0] ------------------ 1675| 0| to_->relaxed()->d.count = to_offset_; 1676| 0| add_child(to_, to_size_); 1677| 0| to_ = nullptr; 1678| 0| } 1679| 0| } while (from_offset != from_count); ------------------ | Branch (1679:22): [True: 0, False: 0] ------------------ 1680| 0| } 1681| 584k| } _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_: 1939| 764| { 1940| 764| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1941| 764| } _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_: 1919| 2.93k| { 1920| 2.93k| return concat_leafs(lpos, tpos, rpos); 1921| 2.93k| } _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_: 1833| 2.93k|{ 1834| 2.93k| static_assert(Node::bits >= 2, ""); 1835| 2.93k| assert(lpos.shift() == tpos.shift()); 1836| 0| assert(lpos.shift() == rpos.shift()); 1837| 0| assert(lpos.shift() == 0); 1838| 2.93k| if (tpos.count() > 0) ------------------ | Branch (1838:9): [True: 0, False: 2.93k] ------------------ 1839| 0| return { 1840| 0| Node::bits_leaf, 1841| 0| lpos.node()->inc(), 1842| 0| lpos.count(), 1843| 0| tpos.node()->inc(), 1844| 0| tpos.count(), 1845| 0| rpos.node()->inc(), 1846| 0| rpos.count(), 1847| 0| }; 1848| 2.93k| else 1849| 2.93k| return { 1850| 2.93k| Node::bits_leaf, 1851| 2.93k| lpos.node()->inc(), 1852| 2.93k| lpos.count(), 1853| 2.93k| rpos.node()->inc(), 1854| 2.93k| rpos.count(), 1855| 2.93k| }; 1856| 2.93k|} _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_: 1818| 764|{ 1819| 764| auto plan = concat_rebalance_plan{}; 1820| 764| plan.fill(lpos, cpos, rpos); 1821| 764| plan.shuffle(cpos.shift()); 1822| 764| IMMER_TRY { ------------------ | | 41| 764|#define IMMER_TRY try ------------------ 1823| 764| return plan.merge(lpos, cpos, rpos); 1824| 764| } 1825| 764| IMMER_CATCH (...) { 1826| 0| cpos.each_sub(dec_visitor{}); 1827| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1828| 0| } 1829| 764|} _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_: 1747| 764| { 1748| 764| assert(n == 0u); 1749| 0| assert(total == 0u); 1750| 0| using visitor_t = concat_rebalance_plan_fill_visitor; 1751| 764| lpos.each_left_sub(visitor_t{}, *this); 1752| 764| cpos.each_sub(visitor_t{}, *this); 1753| 764| rpos.each_right_sub(visitor_t{}, *this); 1754| 764| } _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_: 1797| 764| { 1798| 764| using node_t = node_type; 1799| 764| using merger_t = concat_merger; 1800| 764| using visitor_t = concat_merger_visitor; 1801| 764| auto merger = merger_t{cpos.shift(), counts, n}; 1802| 764| IMMER_TRY { ------------------ | | 41| 764|#define IMMER_TRY try ------------------ 1803| 764| lpos.each_left_sub(visitor_t{}, merger); 1804| 764| cpos.each_sub(visitor_t{}, merger); 1805| 764| rpos.each_right_sub(visitor_t{}, merger); 1806| 764| cpos.each_sub(dec_visitor{}); 1807| 764| return merger.finish(); 1808| 764| } 1809| 764| IMMER_CATCH (...) { 1810| 0| merger.abort(); 1811| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1812| 0| } 1813| 764| } _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_: 1818| 1.94k|{ 1819| 1.94k| auto plan = concat_rebalance_plan{}; 1820| 1.94k| plan.fill(lpos, cpos, rpos); 1821| 1.94k| plan.shuffle(cpos.shift()); 1822| 1.94k| IMMER_TRY { ------------------ | | 41| 1.94k|#define IMMER_TRY try ------------------ 1823| 1.94k| return plan.merge(lpos, cpos, rpos); 1824| 1.94k| } 1825| 1.94k| IMMER_CATCH (...) { 1826| 0| cpos.each_sub(dec_visitor{}); 1827| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1828| 0| } 1829| 1.94k|} _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_: 1747| 1.94k| { 1748| 1.94k| assert(n == 0u); 1749| 0| assert(total == 0u); 1750| 0| using visitor_t = concat_rebalance_plan_fill_visitor; 1751| 1.94k| lpos.each_left_sub(visitor_t{}, *this); 1752| 1.94k| cpos.each_sub(visitor_t{}, *this); 1753| 1.94k| rpos.each_right_sub(visitor_t{}, *this); 1754| 1.94k| } _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_: 1728| 3.12M| { 1729| 3.12M| auto count = p.count(); 1730| 3.12M| assert(plan.n < Plan::max_children); 1731| 0| plan.counts[plan.n++] = count; 1732| 3.12M| plan.total += count; 1733| 3.12M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_15regular_sub_posISH_EEEENS7_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1797| 1.94k| { 1798| 1.94k| using node_t = node_type; 1799| 1.94k| using merger_t = concat_merger; 1800| 1.94k| using visitor_t = concat_merger_visitor; 1801| 1.94k| auto merger = merger_t{cpos.shift(), counts, n}; 1802| 1.94k| IMMER_TRY { ------------------ | | 41| 1.94k|#define IMMER_TRY try ------------------ 1803| 1.94k| lpos.each_left_sub(visitor_t{}, merger); 1804| 1.94k| cpos.each_sub(visitor_t{}, merger); 1805| 1.94k| rpos.each_right_sub(visitor_t{}, merger); 1806| 1.94k| cpos.each_sub(dec_visitor{}); 1807| 1.94k| return merger.finish(); 1808| 1.94k| } 1809| 1.94k| IMMER_CATCH (...) { 1810| 0| merger.abort(); 1811| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1812| 0| } 1813| 1.94k| } _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_: 1710| 3.12M| { 1711| 3.12M| merger.merge_inner(p); 1712| 3.12M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11merge_innerIRNS1_15regular_sub_posISC_EEEEvOT_: 1643| 3.12M| { 1644| 3.12M| auto from = p.node(); 1645| 3.12M| auto from_size = p.size(); 1646| 3.12M| auto from_count = p.count(); 1647| 3.12M| assert(from_size); 1648| 3.12M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1648:13): [True: 1.85M, False: 1.26M] | Branch (1648:21): [True: 1.85M, False: 0] ------------------ 1649| 1.85M| add_child(from, from_size); 1650| 1.85M| from->inc(); 1651| 1.85M| } else { 1652| 1.26M| auto from_offset = count_t{}; 1653| 1.26M| auto from_data = from->inner(); 1654| 2.53M| do { 1655| 2.53M| if (!to_) { ------------------ | Branch (1655:21): [True: 1.26M, False: 1.26M] ------------------ 1656| 1.26M| to_ = node_t::make_inner_r_n(*curr_); 1657| 1.26M| to_offset_ = 0; 1658| 1.26M| to_size_ = 0; 1659| 1.26M| } 1660| 2.53M| auto data = to_->inner(); 1661| 2.53M| auto to_copy = 1662| 2.53M| std::min(from_count - from_offset, *curr_ - to_offset_); 1663| 2.53M| std::copy(from_data + from_offset, 1664| 2.53M| from_data + from_offset + to_copy, 1665| 2.53M| data + to_offset_); 1666| 2.53M| node_t::inc_nodes(from_data + from_offset, to_copy); 1667| 2.53M| auto sizes = to_->relaxed()->d.sizes; 1668| 2.53M| p.copy_sizes( 1669| 2.53M| from_offset, to_copy, to_size_, sizes + to_offset_); 1670| 2.53M| to_offset_ += to_copy; 1671| 2.53M| from_offset += to_copy; 1672| 2.53M| to_size_ = sizes[to_offset_ - 1]; 1673| 2.53M| assert(to_size_); 1674| 2.53M| if (*curr_ == to_offset_) { ------------------ | Branch (1674:21): [True: 1.26M, False: 1.26M] ------------------ 1675| 1.26M| to_->relaxed()->d.count = to_offset_; 1676| 1.26M| add_child(to_, to_size_); 1677| 1.26M| to_ = nullptr; 1678| 1.26M| } 1679| 2.53M| } while (from_offset != from_count); ------------------ | Branch (1679:22): [True: 1.26M, False: 1.26M] ------------------ 1680| 1.26M| } 1681| 3.12M| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1939| 2.16k| { 1940| 2.16k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1941| 2.16k| } _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_: 1919| 6.44k| { 1920| 6.44k| return concat_leafs(lpos, tpos, rpos); 1921| 6.44k| } _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_: 1833| 6.44k|{ 1834| 6.44k| static_assert(Node::bits >= 2, ""); 1835| 6.44k| assert(lpos.shift() == tpos.shift()); 1836| 0| assert(lpos.shift() == rpos.shift()); 1837| 0| assert(lpos.shift() == 0); 1838| 6.44k| if (tpos.count() > 0) ------------------ | Branch (1838:9): [True: 0, False: 6.44k] ------------------ 1839| 0| return { 1840| 0| Node::bits_leaf, 1841| 0| lpos.node()->inc(), 1842| 0| lpos.count(), 1843| 0| tpos.node()->inc(), 1844| 0| tpos.count(), 1845| 0| rpos.node()->inc(), 1846| 0| rpos.count(), 1847| 0| }; 1848| 6.44k| else 1849| 6.44k| return { 1850| 6.44k| Node::bits_leaf, 1851| 6.44k| lpos.node()->inc(), 1852| 6.44k| lpos.count(), 1853| 6.44k| rpos.node()->inc(), 1854| 6.44k| rpos.count(), 1855| 6.44k| }; 1856| 6.44k|} _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_: 1818| 2.16k|{ 1819| 2.16k| auto plan = concat_rebalance_plan{}; 1820| 2.16k| plan.fill(lpos, cpos, rpos); 1821| 2.16k| plan.shuffle(cpos.shift()); 1822| 2.16k| IMMER_TRY { ------------------ | | 41| 2.16k|#define IMMER_TRY try ------------------ 1823| 2.16k| return plan.merge(lpos, cpos, rpos); 1824| 2.16k| } 1825| 2.16k| IMMER_CATCH (...) { 1826| 0| cpos.each_sub(dec_visitor{}); 1827| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1828| 0| } 1829| 2.16k|} _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_: 1747| 2.16k| { 1748| 2.16k| assert(n == 0u); 1749| 0| assert(total == 0u); 1750| 0| using visitor_t = concat_rebalance_plan_fill_visitor; 1751| 2.16k| lpos.each_left_sub(visitor_t{}, *this); 1752| 2.16k| cpos.each_sub(visitor_t{}, *this); 1753| 2.16k| rpos.each_right_sub(visitor_t{}, *this); 1754| 2.16k| } _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_: 1797| 2.16k| { 1798| 2.16k| using node_t = node_type; 1799| 2.16k| using merger_t = concat_merger; 1800| 2.16k| using visitor_t = concat_merger_visitor; 1801| 2.16k| auto merger = merger_t{cpos.shift(), counts, n}; 1802| 2.16k| IMMER_TRY { ------------------ | | 41| 2.16k|#define IMMER_TRY try ------------------ 1803| 2.16k| lpos.each_left_sub(visitor_t{}, merger); 1804| 2.16k| cpos.each_sub(visitor_t{}, merger); 1805| 2.16k| rpos.each_right_sub(visitor_t{}, merger); 1806| 2.16k| cpos.each_sub(dec_visitor{}); 1807| 2.16k| return merger.finish(); 1808| 2.16k| } 1809| 2.16k| IMMER_CATCH (...) { 1810| 0| merger.abort(); 1811| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1812| 0| } 1813| 2.16k| } _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_: 1818| 66.7k|{ 1819| 66.7k| auto plan = concat_rebalance_plan{}; 1820| 66.7k| plan.fill(lpos, cpos, rpos); 1821| 66.7k| plan.shuffle(cpos.shift()); 1822| 66.7k| IMMER_TRY { ------------------ | | 41| 66.7k|#define IMMER_TRY try ------------------ 1823| 66.7k| return plan.merge(lpos, cpos, rpos); 1824| 66.7k| } 1825| 66.7k| IMMER_CATCH (...) { 1826| 0| cpos.each_sub(dec_visitor{}); 1827| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1828| 0| } 1829| 66.7k|} _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_: 1747| 66.7k| { 1748| 66.7k| assert(n == 0u); 1749| 0| assert(total == 0u); 1750| 0| using visitor_t = concat_rebalance_plan_fill_visitor; 1751| 66.7k| lpos.each_left_sub(visitor_t{}, *this); 1752| 66.7k| cpos.each_sub(visitor_t{}, *this); 1753| 66.7k| rpos.each_right_sub(visitor_t{}, *this); 1754| 66.7k| } _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_: 1797| 66.7k| { 1798| 66.7k| using node_t = node_type; 1799| 66.7k| using merger_t = concat_merger; 1800| 66.7k| using visitor_t = concat_merger_visitor; 1801| 66.7k| auto merger = merger_t{cpos.shift(), counts, n}; 1802| 66.7k| IMMER_TRY { ------------------ | | 41| 66.7k|#define IMMER_TRY try ------------------ 1803| 66.7k| lpos.each_left_sub(visitor_t{}, merger); 1804| 66.7k| cpos.each_sub(visitor_t{}, merger); 1805| 66.7k| rpos.each_right_sub(visitor_t{}, merger); 1806| 66.7k| cpos.each_sub(dec_visitor{}); 1807| 66.7k| return merger.finish(); 1808| 66.7k| } 1809| 66.7k| IMMER_CATCH (...) { 1810| 0| merger.abort(); 1811| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1812| 0| } 1813| 66.7k| } _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_: 1939| 6.44k| { 1940| 6.44k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1941| 6.44k| } _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_: 1818| 6.44k|{ 1819| 6.44k| auto plan = concat_rebalance_plan{}; 1820| 6.44k| plan.fill(lpos, cpos, rpos); 1821| 6.44k| plan.shuffle(cpos.shift()); 1822| 6.44k| IMMER_TRY { ------------------ | | 41| 6.44k|#define IMMER_TRY try ------------------ 1823| 6.44k| return plan.merge(lpos, cpos, rpos); 1824| 6.44k| } 1825| 6.44k| IMMER_CATCH (...) { 1826| 0| cpos.each_sub(dec_visitor{}); 1827| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1828| 0| } 1829| 6.44k|} _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_: 1747| 6.44k| { 1748| 6.44k| assert(n == 0u); 1749| 0| assert(total == 0u); 1750| 0| using visitor_t = concat_rebalance_plan_fill_visitor; 1751| 6.44k| lpos.each_left_sub(visitor_t{}, *this); 1752| 6.44k| cpos.each_sub(visitor_t{}, *this); 1753| 6.44k| rpos.each_right_sub(visitor_t{}, *this); 1754| 6.44k| } _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_: 1797| 6.44k| { 1798| 6.44k| using node_t = node_type; 1799| 6.44k| using merger_t = concat_merger; 1800| 6.44k| using visitor_t = concat_merger_visitor; 1801| 6.44k| auto merger = merger_t{cpos.shift(), counts, n}; 1802| 6.44k| IMMER_TRY { ------------------ | | 41| 6.44k|#define IMMER_TRY try ------------------ 1803| 6.44k| lpos.each_left_sub(visitor_t{}, merger); 1804| 6.44k| cpos.each_sub(visitor_t{}, merger); 1805| 6.44k| rpos.each_right_sub(visitor_t{}, merger); 1806| 6.44k| cpos.each_sub(dec_visitor{}); 1807| 6.44k| return merger.finish(); 1808| 6.44k| } 1809| 6.44k| IMMER_CATCH (...) { 1810| 0| merger.abort(); 1811| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1812| 0| } 1813| 6.44k| } _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_: 1953| 2.62k| { 1954| 2.62k| return concat_inners(lpos, tpos, rpos); 1955| 2.62k| } _ZNO5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7realizeEv: 1523| 966k| { 1524| 966k| if (count_ > 1) { ------------------ | Branch (1524:13): [True: 53.6k, False: 913k] ------------------ 1525| 53.6k| IMMER_TRY { ------------------ | | 41| 53.6k|#define IMMER_TRY try ------------------ 1526| 53.6k| auto result = node_t::make_inner_r_n(count_); 1527| 53.6k| auto r = result->relaxed(); 1528| 53.6k| r->d.count = count_; 1529| 53.6k| std::copy(nodes_, nodes_ + count_, result->inner()); 1530| 53.6k| std::copy(sizes_, sizes_ + count_, r->d.sizes); 1531| 53.6k| return {result, shift_, r}; 1532| 53.6k| } 1533| 53.6k| IMMER_CATCH (...) { 1534| 0| each_sub(dec_visitor{}); 1535| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1536| 0| } 1537| 913k| } else { 1538| 913k| assert(shift_ >= B + BL); 1539| 0| return {nodes_[0], shift_ - B, nodes_[0]->relaxed()}; 1540| 913k| } 1541| 966k| } _ZN5immer6detail4rbts12concat_treesINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_11relaxed_posIT_EEPSE_jmSG_jSG_jm: 1981| 957k|{ 1982| 957k| return visit_maybe_relaxed_sub(lroot, 1983| 957k| lshift, 1984| 957k| lsize, 1985| 957k| concat_trees_left_visitor{}, 1986| 957k| make_leaf_pos(ltail, ltcount), 1987| 957k| rroot, 1988| 957k| rshift, 1989| 957k| rsize) 1990| 957k| .realize(); 1991| 957k|} _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_: 1966| 940k| { 1967| 940k| return visit_maybe_relaxed_sub( 1968| 940k| args..., concat_trees_right_visitor{}, lpos, tpos); 1969| 940k| } _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_: 1953| 925k| { 1954| 925k| return concat_inners(lpos, tpos, rpos); 1955| 925k| } _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_: 1867| 9.71M|{ 1868| 9.71M| auto lshift = lpos.shift(); 1869| 9.71M| auto rshift = rpos.shift(); 1870| 9.71M| if (lshift > rshift) { ------------------ | Branch (1870:9): [True: 2.65M, False: 7.06M] ------------------ 1871| 2.65M| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1872| 2.65M| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1873| 7.06M| } else if (lshift < rshift) { ------------------ | Branch (1873:16): [True: 36.0k, False: 7.02M] ------------------ 1874| 36.0k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1875| 36.0k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1876| 7.02M| } else { 1877| 7.02M| assert(lshift == rshift); 1878| 0| assert(Node::bits_leaf == 0u || lshift > 0); 1879| 0| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1880| 7.02M| return concat_rebalance(lpos, cpos, rpos); 1881| 7.02M| } 1882| 9.71M|} _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_: 1892| 2.65M| { 1893| 2.65M| return concat_inners(lpos, tpos, rpos); 1894| 2.65M| } _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_: 1892| 4.74k| { 1893| 4.74k| return concat_inners(lpos, tpos, rpos); 1894| 4.74k| } _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_: 1867| 899k|{ 1868| 899k| auto lshift = lpos.shift(); 1869| 899k| auto rshift = rpos.shift(); 1870| 899k| if (lshift > rshift) { ------------------ | Branch (1870:9): [True: 2.70k, False: 896k] ------------------ 1871| 2.70k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1872| 2.70k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1873| 896k| } else if (lshift < rshift) { ------------------ | Branch (1873:16): [True: 7.56k, False: 889k] ------------------ 1874| 7.56k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1875| 7.56k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1876| 889k| } else { 1877| 889k| assert(lshift == rshift); 1878| 0| assert(Node::bits_leaf == 0u || lshift > 0); 1879| 0| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1880| 889k| return concat_rebalance(lpos, cpos, rpos); 1881| 889k| } 1882| 899k|} _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_: 1818| 3.68k|{ 1819| 3.68k| auto plan = concat_rebalance_plan{}; 1820| 3.68k| plan.fill(lpos, cpos, rpos); 1821| 3.68k| plan.shuffle(cpos.shift()); 1822| 3.68k| IMMER_TRY { ------------------ | | 41| 3.68k|#define IMMER_TRY try ------------------ 1823| 3.68k| return plan.merge(lpos, cpos, rpos); 1824| 3.68k| } 1825| 3.68k| IMMER_CATCH (...) { 1826| 0| cpos.each_sub(dec_visitor{}); 1827| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1828| 0| } 1829| 3.68k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEEvOT_OT0_OT1_: 1747| 3.68k| { 1748| 3.68k| assert(n == 0u); 1749| 0| assert(total == 0u); 1750| 0| using visitor_t = concat_rebalance_plan_fill_visitor; 1751| 3.68k| lpos.each_left_sub(visitor_t{}, *this); 1752| 3.68k| cpos.each_sub(visitor_t{}, *this); 1753| 3.68k| rpos.each_right_sub(visitor_t{}, *this); 1754| 3.68k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1797| 3.68k| { 1798| 3.68k| using node_t = node_type; 1799| 3.68k| using merger_t = concat_merger; 1800| 3.68k| using visitor_t = concat_merger_visitor; 1801| 3.68k| auto merger = merger_t{cpos.shift(), counts, n}; 1802| 3.68k| IMMER_TRY { ------------------ | | 41| 3.68k|#define IMMER_TRY try ------------------ 1803| 3.68k| lpos.each_left_sub(visitor_t{}, merger); 1804| 3.68k| cpos.each_sub(visitor_t{}, merger); 1805| 3.68k| rpos.each_right_sub(visitor_t{}, merger); 1806| 3.68k| cpos.each_sub(dec_visitor{}); 1807| 3.68k| return merger.finish(); 1808| 3.68k| } 1809| 3.68k| IMMER_CATCH (...) { 1810| 0| merger.abort(); 1811| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1812| 0| } 1813| 3.68k| } _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_: 1912| 887k| { 1913| 887k| return concat_inners(lpos, tpos, rpos); 1914| 887k| } _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_: 1912| 286k| { 1913| 286k| return concat_inners(lpos, tpos, rpos); 1914| 286k| } _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_: 1867| 297k|{ 1868| 297k| auto lshift = lpos.shift(); 1869| 297k| auto rshift = rpos.shift(); 1870| 297k| if (lshift > rshift) { ------------------ | Branch (1870:9): [True: 973, False: 296k] ------------------ 1871| 973| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1872| 973| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1873| 296k| } else if (lshift < rshift) { ------------------ | Branch (1873:16): [True: 441, False: 296k] ------------------ 1874| 441| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1875| 441| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1876| 296k| } else { 1877| 296k| assert(lshift == rshift); 1878| 0| assert(Node::bits_leaf == 0u || lshift > 0); 1879| 0| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1880| 296k| return concat_rebalance(lpos, cpos, rpos); 1881| 296k| } 1882| 297k|} _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_: 1892| 1.37k| { 1893| 1.37k| return concat_inners(lpos, tpos, rpos); 1894| 1.37k| } _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_: 1912| 37.4k| { 1913| 37.4k| return concat_inners(lpos, tpos, rpos); 1914| 37.4k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1867| 37.4k|{ 1868| 37.4k| auto lshift = lpos.shift(); 1869| 37.4k| auto rshift = rpos.shift(); 1870| 37.4k| if (lshift > rshift) { ------------------ | Branch (1870:9): [True: 0, False: 37.4k] ------------------ 1871| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1872| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1873| 37.4k| } else if (lshift < rshift) { ------------------ | Branch (1873:16): [True: 212, False: 37.2k] ------------------ 1874| 212| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1875| 212| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1876| 37.2k| } else { 1877| 37.2k| assert(lshift == rshift); 1878| 0| assert(Node::bits_leaf == 0u || lshift > 0); 1879| 0| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1880| 37.2k| return concat_rebalance(lpos, cpos, rpos); 1881| 37.2k| } 1882| 37.4k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1939| 27.6k| { 1940| 27.6k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1941| 27.6k| } _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_: 1919| 312k| { 1920| 312k| return concat_leafs(lpos, tpos, rpos); 1921| 312k| } _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_: 1833| 312k|{ 1834| 312k| static_assert(Node::bits >= 2, ""); 1835| 312k| assert(lpos.shift() == tpos.shift()); 1836| 0| assert(lpos.shift() == rpos.shift()); 1837| 0| assert(lpos.shift() == 0); 1838| 312k| if (tpos.count() > 0) ------------------ | Branch (1838:9): [True: 312k, False: 0] ------------------ 1839| 312k| return { 1840| 312k| Node::bits_leaf, 1841| 312k| lpos.node()->inc(), 1842| 312k| lpos.count(), 1843| 312k| tpos.node()->inc(), 1844| 312k| tpos.count(), 1845| 312k| rpos.node()->inc(), 1846| 312k| rpos.count(), 1847| 312k| }; 1848| 0| else 1849| 0| return { 1850| 0| Node::bits_leaf, 1851| 0| lpos.node()->inc(), 1852| 0| lpos.count(), 1853| 0| rpos.node()->inc(), 1854| 0| rpos.count(), 1855| 0| }; 1856| 312k|} _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_: 1932| 11.1k| { 1933| 11.1k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1934| 11.1k| } _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_: 1818| 37.2k|{ 1819| 37.2k| auto plan = concat_rebalance_plan{}; 1820| 37.2k| plan.fill(lpos, cpos, rpos); 1821| 37.2k| plan.shuffle(cpos.shift()); 1822| 37.2k| IMMER_TRY { ------------------ | | 41| 37.2k|#define IMMER_TRY try ------------------ 1823| 37.2k| return plan.merge(lpos, cpos, rpos); 1824| 37.2k| } 1825| 37.2k| IMMER_CATCH (...) { 1826| 0| cpos.each_sub(dec_visitor{}); 1827| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1828| 0| } 1829| 37.2k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEEvOT_OT0_OT1_: 1747| 37.2k| { 1748| 37.2k| assert(n == 0u); 1749| 0| assert(total == 0u); 1750| 0| using visitor_t = concat_rebalance_plan_fill_visitor; 1751| 37.2k| lpos.each_left_sub(visitor_t{}, *this); 1752| 37.2k| cpos.each_sub(visitor_t{}, *this); 1753| 37.2k| rpos.each_right_sub(visitor_t{}, *this); 1754| 37.2k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1797| 37.2k| { 1798| 37.2k| using node_t = node_type; 1799| 37.2k| using merger_t = concat_merger; 1800| 37.2k| using visitor_t = concat_merger_visitor; 1801| 37.2k| auto merger = merger_t{cpos.shift(), counts, n}; 1802| 37.2k| IMMER_TRY { ------------------ | | 41| 37.2k|#define IMMER_TRY try ------------------ 1803| 37.2k| lpos.each_left_sub(visitor_t{}, merger); 1804| 37.2k| cpos.each_sub(visitor_t{}, merger); 1805| 37.2k| rpos.each_right_sub(visitor_t{}, merger); 1806| 37.2k| cpos.each_sub(dec_visitor{}); 1807| 37.2k| return merger.finish(); 1808| 37.2k| } 1809| 37.2k| IMMER_CATCH (...) { 1810| 0| merger.abort(); 1811| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1812| 0| } 1813| 37.2k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1939| 285k| { 1940| 285k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1941| 285k| } _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_: 1919| 644k| { 1920| 644k| return concat_leafs(lpos, tpos, rpos); 1921| 644k| } _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_: 1833| 644k|{ 1834| 644k| static_assert(Node::bits >= 2, ""); 1835| 644k| assert(lpos.shift() == tpos.shift()); 1836| 0| assert(lpos.shift() == rpos.shift()); 1837| 0| assert(lpos.shift() == 0); 1838| 644k| if (tpos.count() > 0) ------------------ | Branch (1838:9): [True: 644k, False: 0] ------------------ 1839| 644k| return { 1840| 644k| Node::bits_leaf, 1841| 644k| lpos.node()->inc(), 1842| 644k| lpos.count(), 1843| 644k| tpos.node()->inc(), 1844| 644k| tpos.count(), 1845| 644k| rpos.node()->inc(), 1846| 644k| rpos.count(), 1847| 644k| }; 1848| 0| else 1849| 0| return { 1850| 0| Node::bits_leaf, 1851| 0| lpos.node()->inc(), 1852| 0| lpos.count(), 1853| 0| rpos.node()->inc(), 1854| 0| rpos.count(), 1855| 0| }; 1856| 644k|} _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_: 1932| 25.6k| { 1933| 25.6k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1934| 25.6k| } _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_: 1818| 296k|{ 1819| 296k| auto plan = concat_rebalance_plan{}; 1820| 296k| plan.fill(lpos, cpos, rpos); 1821| 296k| plan.shuffle(cpos.shift()); 1822| 296k| IMMER_TRY { ------------------ | | 41| 296k|#define IMMER_TRY try ------------------ 1823| 296k| return plan.merge(lpos, cpos, rpos); 1824| 296k| } 1825| 296k| IMMER_CATCH (...) { 1826| 0| cpos.each_sub(dec_visitor{}); 1827| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1828| 0| } 1829| 296k|} _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_: 1747| 296k| { 1748| 296k| assert(n == 0u); 1749| 0| assert(total == 0u); 1750| 0| using visitor_t = concat_rebalance_plan_fill_visitor; 1751| 296k| lpos.each_left_sub(visitor_t{}, *this); 1752| 296k| cpos.each_sub(visitor_t{}, *this); 1753| 296k| rpos.each_right_sub(visitor_t{}, *this); 1754| 296k| } _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_: 1797| 296k| { 1798| 296k| using node_t = node_type; 1799| 296k| using merger_t = concat_merger; 1800| 296k| using visitor_t = concat_merger_visitor; 1801| 296k| auto merger = merger_t{cpos.shift(), counts, n}; 1802| 296k| IMMER_TRY { ------------------ | | 41| 296k|#define IMMER_TRY try ------------------ 1803| 296k| lpos.each_left_sub(visitor_t{}, merger); 1804| 296k| cpos.each_sub(visitor_t{}, merger); 1805| 296k| rpos.each_right_sub(visitor_t{}, merger); 1806| 296k| cpos.each_sub(dec_visitor{}); 1807| 296k| return merger.finish(); 1808| 296k| } 1809| 296k| IMMER_CATCH (...) { 1810| 0| merger.abort(); 1811| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1812| 0| } 1813| 296k| } _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_: 1939| 644k| { 1940| 644k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1941| 644k| } _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_: 1932| 1.16M| { 1933| 1.16M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1934| 1.16M| } _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_: 1818| 889k|{ 1819| 889k| auto plan = concat_rebalance_plan{}; 1820| 889k| plan.fill(lpos, cpos, rpos); 1821| 889k| plan.shuffle(cpos.shift()); 1822| 889k| IMMER_TRY { ------------------ | | 41| 889k|#define IMMER_TRY try ------------------ 1823| 889k| return plan.merge(lpos, cpos, rpos); 1824| 889k| } 1825| 889k| IMMER_CATCH (...) { 1826| 0| cpos.each_sub(dec_visitor{}); 1827| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1828| 0| } 1829| 889k|} _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_: 1747| 889k| { 1748| 889k| assert(n == 0u); 1749| 0| assert(total == 0u); 1750| 0| using visitor_t = concat_rebalance_plan_fill_visitor; 1751| 889k| lpos.each_left_sub(visitor_t{}, *this); 1752| 889k| cpos.each_sub(visitor_t{}, *this); 1753| 889k| rpos.each_right_sub(visitor_t{}, *this); 1754| 889k| } _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_: 1797| 889k| { 1798| 889k| using node_t = node_type; 1799| 889k| using merger_t = concat_merger; 1800| 889k| using visitor_t = concat_merger_visitor; 1801| 889k| auto merger = merger_t{cpos.shift(), counts, n}; 1802| 889k| IMMER_TRY { ------------------ | | 41| 889k|#define IMMER_TRY try ------------------ 1803| 889k| lpos.each_left_sub(visitor_t{}, merger); 1804| 889k| cpos.each_sub(visitor_t{}, merger); 1805| 889k| rpos.each_right_sub(visitor_t{}, merger); 1806| 889k| cpos.each_sub(dec_visitor{}); 1807| 889k| return merger.finish(); 1808| 889k| } 1809| 889k| IMMER_CATCH (...) { 1810| 0| merger.abort(); 1811| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1812| 0| } 1813| 889k| } _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_: 1818| 2.68M|{ 1819| 2.68M| auto plan = concat_rebalance_plan{}; 1820| 2.68M| plan.fill(lpos, cpos, rpos); 1821| 2.68M| plan.shuffle(cpos.shift()); 1822| 2.68M| IMMER_TRY { ------------------ | | 41| 2.68M|#define IMMER_TRY try ------------------ 1823| 2.68M| return plan.merge(lpos, cpos, rpos); 1824| 2.68M| } 1825| 2.68M| IMMER_CATCH (...) { 1826| 0| cpos.each_sub(dec_visitor{}); 1827| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1828| 0| } 1829| 2.68M|} _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_: 1747| 2.68M| { 1748| 2.68M| assert(n == 0u); 1749| 0| assert(total == 0u); 1750| 0| using visitor_t = concat_rebalance_plan_fill_visitor; 1751| 2.68M| lpos.each_left_sub(visitor_t{}, *this); 1752| 2.68M| cpos.each_sub(visitor_t{}, *this); 1753| 2.68M| rpos.each_right_sub(visitor_t{}, *this); 1754| 2.68M| } _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_: 1797| 2.68M| { 1798| 2.68M| using node_t = node_type; 1799| 2.68M| using merger_t = concat_merger; 1800| 2.68M| using visitor_t = concat_merger_visitor; 1801| 2.68M| auto merger = merger_t{cpos.shift(), counts, n}; 1802| 2.68M| IMMER_TRY { ------------------ | | 41| 2.68M|#define IMMER_TRY try ------------------ 1803| 2.68M| lpos.each_left_sub(visitor_t{}, merger); 1804| 2.68M| cpos.each_sub(visitor_t{}, merger); 1805| 2.68M| rpos.each_right_sub(visitor_t{}, merger); 1806| 2.68M| cpos.each_sub(dec_visitor{}); 1807| 2.68M| return merger.finish(); 1808| 2.68M| } 1809| 2.68M| IMMER_CATCH (...) { 1810| 0| merger.abort(); 1811| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1812| 0| } 1813| 2.68M| } _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_: 1912| 6.13M| { 1913| 6.13M| return concat_inners(lpos, tpos, rpos); 1914| 6.13M| } _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_: 1912| 1.42k| { 1913| 1.42k| return concat_inners(lpos, tpos, rpos); 1914| 1.42k| } _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_: 1867| 49.1k|{ 1868| 49.1k| auto lshift = lpos.shift(); 1869| 49.1k| auto rshift = rpos.shift(); 1870| 49.1k| if (lshift > rshift) { ------------------ | Branch (1870:9): [True: 33.0k, False: 16.0k] ------------------ 1871| 33.0k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1872| 33.0k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1873| 33.0k| } else if (lshift < rshift) { ------------------ | Branch (1873:16): [True: 742, False: 15.3k] ------------------ 1874| 742| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1875| 742| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1876| 15.3k| } else { 1877| 15.3k| assert(lshift == rshift); 1878| 0| assert(Node::bits_leaf == 0u || lshift > 0); 1879| 0| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1880| 15.3k| return concat_rebalance(lpos, cpos, rpos); 1881| 15.3k| } 1882| 49.1k|} _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1892| 32.6k| { 1893| 32.6k| return concat_inners(lpos, tpos, rpos); 1894| 32.6k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_8full_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1912| 1.98k| { 1913| 1.98k| return concat_inners(lpos, tpos, rpos); 1914| 1.98k| } _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_: 1867| 1.98k|{ 1868| 1.98k| auto lshift = lpos.shift(); 1869| 1.98k| auto rshift = rpos.shift(); 1870| 1.98k| if (lshift > rshift) { ------------------ | Branch (1870:9): [True: 0, False: 1.98k] ------------------ 1871| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1872| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1873| 1.98k| } else if (lshift < rshift) { ------------------ | Branch (1873:16): [True: 202, False: 1.78k] ------------------ 1874| 202| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1875| 202| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1876| 1.78k| } else { 1877| 1.78k| assert(lshift == rshift); 1878| 0| assert(Node::bits_leaf == 0u || lshift > 0); 1879| 0| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1880| 1.78k| return concat_rebalance(lpos, cpos, rpos); 1881| 1.78k| } 1882| 1.98k|} _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_: 1932| 209| { 1933| 209| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1934| 209| } _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_: 1818| 1.78k|{ 1819| 1.78k| auto plan = concat_rebalance_plan{}; 1820| 1.78k| plan.fill(lpos, cpos, rpos); 1821| 1.78k| plan.shuffle(cpos.shift()); 1822| 1.78k| IMMER_TRY { ------------------ | | 41| 1.78k|#define IMMER_TRY try ------------------ 1823| 1.78k| return plan.merge(lpos, cpos, rpos); 1824| 1.78k| } 1825| 1.78k| IMMER_CATCH (...) { 1826| 0| cpos.each_sub(dec_visitor{}); 1827| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1828| 0| } 1829| 1.78k|} _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_: 1747| 1.78k| { 1748| 1.78k| assert(n == 0u); 1749| 0| assert(total == 0u); 1750| 0| using visitor_t = concat_rebalance_plan_fill_visitor; 1751| 1.78k| lpos.each_left_sub(visitor_t{}, *this); 1752| 1.78k| cpos.each_sub(visitor_t{}, *this); 1753| 1.78k| rpos.each_right_sub(visitor_t{}, *this); 1754| 1.78k| } _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_: 1797| 1.78k| { 1798| 1.78k| using node_t = node_type; 1799| 1.78k| using merger_t = concat_merger; 1800| 1.78k| using visitor_t = concat_merger_visitor; 1801| 1.78k| auto merger = merger_t{cpos.shift(), counts, n}; 1802| 1.78k| IMMER_TRY { ------------------ | | 41| 1.78k|#define IMMER_TRY try ------------------ 1803| 1.78k| lpos.each_left_sub(visitor_t{}, merger); 1804| 1.78k| cpos.each_sub(visitor_t{}, merger); 1805| 1.78k| rpos.each_right_sub(visitor_t{}, merger); 1806| 1.78k| cpos.each_sub(dec_visitor{}); 1807| 1.78k| return merger.finish(); 1808| 1.78k| } 1809| 1.78k| IMMER_CATCH (...) { 1810| 0| merger.abort(); 1811| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1812| 0| } 1813| 1.78k| } _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_: 1932| 829| { 1933| 829| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1934| 829| } _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_: 1818| 15.3k|{ 1819| 15.3k| auto plan = concat_rebalance_plan{}; 1820| 15.3k| plan.fill(lpos, cpos, rpos); 1821| 15.3k| plan.shuffle(cpos.shift()); 1822| 15.3k| IMMER_TRY { ------------------ | | 41| 15.3k|#define IMMER_TRY try ------------------ 1823| 15.3k| return plan.merge(lpos, cpos, rpos); 1824| 15.3k| } 1825| 15.3k| IMMER_CATCH (...) { 1826| 0| cpos.each_sub(dec_visitor{}); 1827| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1828| 0| } 1829| 15.3k|} _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_: 1747| 15.3k| { 1748| 15.3k| assert(n == 0u); 1749| 0| assert(total == 0u); 1750| 0| using visitor_t = concat_rebalance_plan_fill_visitor; 1751| 15.3k| lpos.each_left_sub(visitor_t{}, *this); 1752| 15.3k| cpos.each_sub(visitor_t{}, *this); 1753| 15.3k| rpos.each_right_sub(visitor_t{}, *this); 1754| 15.3k| } _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_: 1797| 15.3k| { 1798| 15.3k| using node_t = node_type; 1799| 15.3k| using merger_t = concat_merger; 1800| 15.3k| using visitor_t = concat_merger_visitor; 1801| 15.3k| auto merger = merger_t{cpos.shift(), counts, n}; 1802| 15.3k| IMMER_TRY { ------------------ | | 41| 15.3k|#define IMMER_TRY try ------------------ 1803| 15.3k| lpos.each_left_sub(visitor_t{}, merger); 1804| 15.3k| cpos.each_sub(visitor_t{}, merger); 1805| 15.3k| rpos.each_right_sub(visitor_t{}, merger); 1806| 15.3k| cpos.each_sub(dec_visitor{}); 1807| 15.3k| return merger.finish(); 1808| 15.3k| } 1809| 15.3k| IMMER_CATCH (...) { 1810| 0| merger.abort(); 1811| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1812| 0| } 1813| 15.3k| } _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_: 1932| 6.10M| { 1933| 6.10M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1934| 6.10M| } _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_: 1818| 7.02M|{ 1819| 7.02M| auto plan = concat_rebalance_plan{}; 1820| 7.02M| plan.fill(lpos, cpos, rpos); 1821| 7.02M| plan.shuffle(cpos.shift()); 1822| 7.02M| IMMER_TRY { ------------------ | | 41| 7.02M|#define IMMER_TRY try ------------------ 1823| 7.02M| return plan.merge(lpos, cpos, rpos); 1824| 7.02M| } 1825| 7.02M| IMMER_CATCH (...) { 1826| 0| cpos.each_sub(dec_visitor{}); 1827| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1828| 0| } 1829| 7.02M|} _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_: 1747| 7.02M| { 1748| 7.02M| assert(n == 0u); 1749| 0| assert(total == 0u); 1750| 0| using visitor_t = concat_rebalance_plan_fill_visitor; 1751| 7.02M| lpos.each_left_sub(visitor_t{}, *this); 1752| 7.02M| cpos.each_sub(visitor_t{}, *this); 1753| 7.02M| rpos.each_right_sub(visitor_t{}, *this); 1754| 7.02M| } _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_: 1797| 7.02M| { 1798| 7.02M| using node_t = node_type; 1799| 7.02M| using merger_t = concat_merger; 1800| 7.02M| using visitor_t = concat_merger_visitor; 1801| 7.02M| auto merger = merger_t{cpos.shift(), counts, n}; 1802| 7.02M| IMMER_TRY { ------------------ | | 41| 7.02M|#define IMMER_TRY try ------------------ 1803| 7.02M| lpos.each_left_sub(visitor_t{}, merger); 1804| 7.02M| cpos.each_sub(visitor_t{}, merger); 1805| 7.02M| rpos.each_right_sub(visitor_t{}, merger); 1806| 7.02M| cpos.each_sub(dec_visitor{}); 1807| 7.02M| return merger.finish(); 1808| 7.02M| } 1809| 7.02M| IMMER_CATCH (...) { 1810| 0| merger.abort(); 1811| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1812| 0| } 1813| 7.02M| } _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_: 1953| 15.0k| { 1954| 15.0k| return concat_inners(lpos, tpos, rpos); 1955| 15.0k| } _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_: 1966| 16.9k| { 1967| 16.9k| return visit_maybe_relaxed_sub( 1968| 16.9k| args..., concat_trees_right_visitor{}, lpos, tpos); 1969| 16.9k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_11relaxed_posISC_EERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1953| 6.79k| { 1954| 6.79k| return concat_inners(lpos, tpos, rpos); 1955| 6.79k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_15regular_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1953| 10.1k| { 1954| 10.1k| return concat_inners(lpos, tpos, rpos); 1955| 10.1k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEEPSC_OT_NSA_5applyIS7_E4type4editESI_j: 679| 289k| { 680| 289k| auto node = pos.node(); 681| 289k| auto level = pos.shift(); 682| 289k| auto idx = pos.count() - 1; 683| 289k| auto children = pos.size(idx); 684| 289k| auto new_idx = 685| 289k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (685:13): [True: 2.66k, False: 286k] | Branch (685:47): [True: 552, False: 286k] ------------------ 686| 289k| auto new_child = static_cast(nullptr); 687| 289k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (687:26): [Folded - Ignored] | Branch (687:38): [True: 286k, False: 2.93k] ------------------ 688| | 689| 289k| if (new_idx >= branches) ------------------ | Branch (689:13): [True: 829, False: 288k] ------------------ 690| 829| return nullptr; 691| 288k| else if (idx == new_idx) { ------------------ | Branch (691:18): [True: 286k, False: 2.38k] ------------------ 692| 286k| new_child = 693| 286k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (693:17): [True: 283k, False: 2.52k] ------------------ 694| 286k| : pos.last_oh_csh( 695| 2.52k| this_no_mut_t{}, idx, children, e, tail, ts); 696| 286k| if (!new_child) { ------------------ | Branch (696:17): [True: 1.04k, False: 285k] ------------------ 697| 1.04k| if (++new_idx < branches) ------------------ | Branch (697:21): [True: 334, False: 708] ------------------ 698| 334| new_child = node_t::make_path_e(e, level - B, tail); 699| 708| else 700| 708| return nullptr; 701| 1.04k| } 702| 286k| } else 703| 2.38k| new_child = node_t::make_path_e(e, level - B, tail); 704| | 705| 287k| if (mutate) { ------------------ | Branch (705:13): [True: 285k, False: 2.55k] ------------------ 706| 285k| auto count = new_idx + 1; 707| 285k| auto relaxed = node->ensure_mutable_relaxed_n(e, new_idx); 708| 285k| node->inner()[new_idx] = new_child; 709| 285k| relaxed->d.sizes[new_idx] = pos.size() + ts; 710| 285k| relaxed->d.count = count; 711| 285k| assert(relaxed->d.sizes[new_idx]); 712| 0| return node; 713| 285k| } else { 714| 2.55k| IMMER_TRY { ------------------ | | 41| 2.55k|#define IMMER_TRY try ------------------ 715| 2.55k| auto count = new_idx + 1; 716| 2.55k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 717| 2.55k| auto relaxed = new_node->relaxed(); 718| 2.55k| new_node->inner()[new_idx] = new_child; 719| 2.55k| relaxed->d.sizes[new_idx] = pos.size() + ts; 720| 2.55k| relaxed->d.count = count; 721| 2.55k| assert(relaxed->d.sizes[new_idx]); 722| 2.55k| if (Mutating) ------------------ | Branch (722:21): [Folded - Ignored] ------------------ 723| 2.55k| pos.visit(dec_visitor{}); 724| 2.55k| return new_node; 725| 2.55k| } 726| 2.55k| IMMER_CATCH (...) { 727| 0| auto shift = pos.shift(); 728| 0| auto size = new_idx == idx ? children + ts : ts; ------------------ | Branch (728:30): [True: 0, False: 0] ------------------ 729| 0| if (shift > BL) { ------------------ | Branch (729:21): [True: 0, False: 0] ------------------ 730| 0| tail->inc(); 731| 0| dec_inner(new_child, shift - B, size); 732| 0| } 733| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 734| 0| } 735| 2.55k| } 736| 287k| } _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_: 740| 214k| { 741| 214k| assert((pos.size() & mask) == 0); 742| 0| auto node = pos.node(); 743| 214k| auto idx = pos.index(pos.size() - 1); 744| 214k| auto new_idx = pos.index(pos.size() + branches - 1); 745| 214k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (745:24): [Folded - Ignored] | Branch (745:36): [True: 213k, False: 884] ------------------ 746| 214k| if (mutate) { ------------------ | Branch (746:13): [True: 213k, False: 884] ------------------ 747| 213k| node->inner()[new_idx] = 748| 213k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (748:17): [True: 210k, False: 2.45k] ------------------ 749| | /* otherwise */ 750| 213k| : node_t::make_path_e(e, pos.shift() - B, tail); 751| 213k| return node; 752| 213k| } else { 753| 884| auto new_parent = node_t::make_inner_e(e); 754| 884| IMMER_TRY { ------------------ | | 41| 884|#define IMMER_TRY try ------------------ 755| 884| new_parent->inner()[new_idx] = 756| 884| idx == new_idx ------------------ | Branch (756:21): [True: 613, False: 271] ------------------ 757| 884| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 758| | /* otherwise */ 759| 884| : node_t::make_path_e(e, pos.shift() - B, tail); 760| 884| node_t::do_copy_inner(new_parent, node, new_idx); 761| 884| if (Mutating) ------------------ | Branch (761:21): [Folded - Ignored] ------------------ 762| 884| pos.visit(dec_visitor{}); 763| 884| return new_parent; 764| 884| } 765| 884| IMMER_CATCH (...) { 766| 0| node_t::delete_inner_e(new_parent); 767| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 768| 0| } 769| 884| } 770| 214k| } _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_: 740| 1.85M| { 741| 1.85M| assert((pos.size() & mask) == 0); 742| 0| auto node = pos.node(); 743| 1.85M| auto idx = pos.index(pos.size() - 1); 744| 1.85M| auto new_idx = pos.index(pos.size() + branches - 1); 745| 1.85M| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (745:24): [Folded - Ignored] | Branch (745:36): [True: 1.85M, False: 1.06k] ------------------ 746| 1.85M| if (mutate) { ------------------ | Branch (746:13): [True: 1.85M, False: 1.06k] ------------------ 747| 1.85M| node->inner()[new_idx] = 748| 1.85M| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (748:17): [True: 1.23M, False: 619k] ------------------ 749| | /* otherwise */ 750| 1.85M| : node_t::make_path_e(e, pos.shift() - B, tail); 751| 1.85M| return node; 752| 1.85M| } else { 753| 1.06k| auto new_parent = node_t::make_inner_e(e); 754| 1.06k| IMMER_TRY { ------------------ | | 41| 1.06k|#define IMMER_TRY try ------------------ 755| 1.06k| new_parent->inner()[new_idx] = 756| 1.06k| idx == new_idx ------------------ | Branch (756:21): [True: 672, False: 396] ------------------ 757| 1.06k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 758| | /* otherwise */ 759| 1.06k| : node_t::make_path_e(e, pos.shift() - B, tail); 760| 1.06k| node_t::do_copy_inner(new_parent, node, new_idx); 761| 1.06k| if (Mutating) ------------------ | Branch (761:21): [Folded - Ignored] ------------------ 762| 1.06k| pos.visit(dec_visitor{}); 763| 1.06k| return new_parent; 764| 1.06k| } 765| 1.06k| IMMER_CATCH (...) { 766| 0| node_t::delete_inner_e(new_parent); 767| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 768| 0| } 769| 1.06k| } 770| 1.85M| } _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_: 740| 3.89k| { 741| 3.89k| assert((pos.size() & mask) == 0); 742| 0| auto node = pos.node(); 743| 3.89k| auto idx = pos.index(pos.size() - 1); 744| 3.89k| auto new_idx = pos.index(pos.size() + branches - 1); 745| 3.89k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (745:24): [Folded - Ignored] | Branch (745:36): [True: 0, False: 0] ------------------ 746| 3.89k| if (mutate) { ------------------ | Branch (746:13): [True: 0, False: 3.89k] ------------------ 747| 0| node->inner()[new_idx] = 748| 0| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (748:17): [True: 0, False: 0] ------------------ 749| | /* otherwise */ 750| 0| : node_t::make_path_e(e, pos.shift() - B, tail); 751| 0| return node; 752| 3.89k| } else { 753| 3.89k| auto new_parent = node_t::make_inner_e(e); 754| 3.89k| IMMER_TRY { ------------------ | | 41| 3.89k|#define IMMER_TRY try ------------------ 755| 3.89k| new_parent->inner()[new_idx] = 756| 3.89k| idx == new_idx ------------------ | Branch (756:21): [True: 1.69k, False: 2.19k] ------------------ 757| 3.89k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 758| | /* otherwise */ 759| 3.89k| : node_t::make_path_e(e, pos.shift() - B, tail); 760| 3.89k| node_t::do_copy_inner(new_parent, node, new_idx); 761| 3.89k| if (Mutating) ------------------ | Branch (761:21): [Folded - Ignored] ------------------ 762| 0| pos.visit(dec_visitor{}); 763| 3.89k| return new_parent; 764| 3.89k| } 765| 3.89k| IMMER_CATCH (...) { 766| 0| node_t::delete_inner_e(new_parent); 767| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 768| 0| } 769| 3.89k| } 770| 3.89k| } _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: 679| 9.78k| { 680| 9.78k| auto node = pos.node(); 681| 9.78k| auto level = pos.shift(); 682| 9.78k| auto idx = pos.count() - 1; 683| 9.78k| auto children = pos.size(idx); 684| 9.78k| auto new_idx = 685| 9.78k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (685:13): [True: 1.11k, False: 8.66k] | Branch (685:47): [True: 271, False: 8.39k] ------------------ 686| 9.78k| auto new_child = static_cast(nullptr); 687| 9.78k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (687:26): [Folded - Ignored] | Branch (687:38): [True: 0, False: 0] ------------------ 688| | 689| 9.78k| if (new_idx >= branches) ------------------ | Branch (689:13): [True: 654, False: 9.13k] ------------------ 690| 654| return nullptr; 691| 9.13k| else if (idx == new_idx) { ------------------ | Branch (691:18): [True: 8.39k, False: 736] ------------------ 692| 8.39k| new_child = 693| 8.39k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (693:17): [True: 0, False: 8.39k] ------------------ 694| 8.39k| : pos.last_oh_csh( 695| 8.39k| this_no_mut_t{}, idx, children, e, tail, ts); 696| 8.39k| if (!new_child) { ------------------ | Branch (696:17): [True: 795, False: 7.60k] ------------------ 697| 795| if (++new_idx < branches) ------------------ | Branch (697:21): [True: 327, False: 468] ------------------ 698| 327| new_child = node_t::make_path_e(e, level - B, tail); 699| 468| else 700| 468| return nullptr; 701| 795| } 702| 8.39k| } else 703| 736| new_child = node_t::make_path_e(e, level - B, tail); 704| | 705| 8.66k| if (mutate) { ------------------ | Branch (705:13): [True: 0, False: 8.66k] ------------------ 706| 0| auto count = new_idx + 1; 707| 0| auto relaxed = node->ensure_mutable_relaxed_n(e, new_idx); 708| 0| node->inner()[new_idx] = new_child; 709| 0| relaxed->d.sizes[new_idx] = pos.size() + ts; 710| 0| relaxed->d.count = count; 711| 0| assert(relaxed->d.sizes[new_idx]); 712| 0| return node; 713| 8.66k| } else { 714| 8.66k| IMMER_TRY { ------------------ | | 41| 8.66k|#define IMMER_TRY try ------------------ 715| 8.66k| auto count = new_idx + 1; 716| 8.66k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 717| 8.66k| auto relaxed = new_node->relaxed(); 718| 8.66k| new_node->inner()[new_idx] = new_child; 719| 8.66k| relaxed->d.sizes[new_idx] = pos.size() + ts; 720| 8.66k| relaxed->d.count = count; 721| 8.66k| assert(relaxed->d.sizes[new_idx]); 722| 8.66k| if (Mutating) ------------------ | Branch (722:21): [Folded - Ignored] ------------------ 723| 0| pos.visit(dec_visitor{}); 724| 8.66k| return new_node; 725| 8.66k| } 726| 8.66k| IMMER_CATCH (...) { 727| 0| auto shift = pos.shift(); 728| 0| auto size = new_idx == idx ? children + ts : ts; ------------------ | Branch (728:30): [True: 0, False: 0] ------------------ 729| 0| if (shift > BL) { ------------------ | Branch (729:21): [True: 0, False: 0] ------------------ 730| 0| tail->inc(); 731| 0| dec_inner(new_child, shift - B, size); 732| 0| } 733| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 734| 0| } 735| 8.66k| } 736| 8.66k| } _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_: 740| 1.13k| { 741| 1.13k| assert((pos.size() & mask) == 0); 742| 0| auto node = pos.node(); 743| 1.13k| auto idx = pos.index(pos.size() - 1); 744| 1.13k| auto new_idx = pos.index(pos.size() + branches - 1); 745| 1.13k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (745:24): [Folded - Ignored] | Branch (745:36): [True: 0, False: 0] ------------------ 746| 1.13k| if (mutate) { ------------------ | Branch (746:13): [True: 0, False: 1.13k] ------------------ 747| 0| node->inner()[new_idx] = 748| 0| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (748:17): [True: 0, False: 0] ------------------ 749| | /* otherwise */ 750| 0| : node_t::make_path_e(e, pos.shift() - B, tail); 751| 0| return node; 752| 1.13k| } else { 753| 1.13k| auto new_parent = node_t::make_inner_e(e); 754| 1.13k| IMMER_TRY { ------------------ | | 41| 1.13k|#define IMMER_TRY try ------------------ 755| 1.13k| new_parent->inner()[new_idx] = 756| 1.13k| idx == new_idx ------------------ | Branch (756:21): [True: 668, False: 469] ------------------ 757| 1.13k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 758| | /* otherwise */ 759| 1.13k| : node_t::make_path_e(e, pos.shift() - B, tail); 760| 1.13k| node_t::do_copy_inner(new_parent, node, new_idx); 761| 1.13k| if (Mutating) ------------------ | Branch (761:21): [Folded - Ignored] ------------------ 762| 0| pos.visit(dec_visitor{}); 763| 1.13k| return new_parent; 764| 1.13k| } 765| 1.13k| IMMER_CATCH (...) { 766| 0| node_t::delete_inner_e(new_parent); 767| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 768| 0| } 769| 1.13k| } 770| 1.13k| } _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_: 740| 422k| { 741| 422k| assert((pos.size() & mask) == 0); 742| 0| auto node = pos.node(); 743| 422k| auto idx = pos.index(pos.size() - 1); 744| 422k| auto new_idx = pos.index(pos.size() + branches - 1); 745| 422k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (745:24): [Folded - Ignored] | Branch (745:36): [True: 421k, False: 520] ------------------ 746| 422k| if (mutate) { ------------------ | Branch (746:13): [True: 421k, False: 520] ------------------ 747| 421k| node->inner()[new_idx] = 748| 421k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (748:17): [True: 409k, False: 12.4k] ------------------ 749| | /* otherwise */ 750| 421k| : node_t::make_path_e(e, pos.shift() - B, tail); 751| 421k| return node; 752| 421k| } else { 753| 520| auto new_parent = node_t::make_inner_e(e); 754| 520| IMMER_TRY { ------------------ | | 41| 520|#define IMMER_TRY try ------------------ 755| 520| new_parent->inner()[new_idx] = 756| 520| idx == new_idx ------------------ | Branch (756:21): [True: 245, False: 275] ------------------ 757| 520| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 758| | /* otherwise */ 759| 520| : node_t::make_path_e(e, pos.shift() - B, tail); 760| 520| node_t::do_copy_inner(new_parent, node, new_idx); 761| 520| if (Mutating) ------------------ | Branch (761:21): [Folded - Ignored] ------------------ 762| 520| pos.visit(dec_visitor{}); 763| 520| return new_parent; 764| 520| } 765| 520| IMMER_CATCH (...) { 766| 0| node_t::delete_inner_e(new_parent); 767| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 768| 0| } 769| 520| } 770| 422k| } _ZN5immer6detail4rbts17dec_empty_regularINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEvPT_: 579| 2.71k|{ 580| 2.71k| make_empty_regular_pos(node).visit(dec_visitor()); 581| 2.71k|} _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_: 594| 84.7k| { 595| 84.7k| auto offset = pos.index(idx); 596| 84.7k| auto count = pos.count(); 597| 84.7k| auto node = pos.node(); 598| 84.7k| if (node->can_mutate(e)) { ------------------ | Branch (598:13): [True: 58.7k, False: 25.9k] ------------------ 599| 58.7k| return pos.towards_oh( 600| 58.7k| this_t{}, idx, offset, e, &node->inner()[offset]); 601| 58.7k| } else { 602| 25.9k| auto new_node = node_t::copy_inner_sr_e(e, node, count); 603| 25.9k| IMMER_TRY { ------------------ | | 41| 25.9k|#define IMMER_TRY try ------------------ 604| 25.9k| auto& res = pos.towards_oh( 605| 25.9k| this_t{}, idx, offset, e, &new_node->inner()[offset]); 606| 25.9k| pos.visit(dec_visitor{}); 607| 25.9k| *location = new_node; 608| 25.9k| return res; 609| 25.9k| } 610| 25.9k| IMMER_CATCH (...) { 611| 0| dec_relaxed(new_node, pos.shift()); 612| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 613| 0| } 614| 25.9k| } 615| 84.7k| } _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_: 651| 13.0k| { 652| 13.0k| assert(pos.node() == *location); 653| 0| auto node = pos.node(); 654| 13.0k| if (node->can_mutate(e)) { ------------------ | Branch (654:13): [True: 1.00k, False: 12.0k] ------------------ 655| 1.00k| return node->leaf()[pos.index(idx)]; 656| 12.0k| } else { 657| 12.0k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 658| 12.0k| pos.visit(dec_visitor{}); 659| 12.0k| *location = new_node; 660| 12.0k| return new_node->leaf()[pos.index(idx)]; 661| 12.0k| } 662| 13.0k| } _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_: 620| 4.32k| { 621| 4.32k| assert(pos.node() == *location); 622| 0| auto offset = pos.index(idx); 623| 4.32k| auto count = pos.count(); 624| 4.32k| auto node = pos.node(); 625| 4.32k| if (node->can_mutate(e)) { ------------------ | Branch (625:13): [True: 2.70k, False: 1.61k] ------------------ 626| 2.70k| return pos.towards_oh_ch( 627| 2.70k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 628| 2.70k| } else { 629| 1.61k| auto new_node = node_t::copy_inner_e(e, node, count); 630| 1.61k| IMMER_TRY { ------------------ | | 41| 1.61k|#define IMMER_TRY try ------------------ 631| 1.61k| auto& res = pos.towards_oh_ch(this_t{}, 632| 1.61k| idx, 633| 1.61k| offset, 634| 1.61k| count, 635| 1.61k| e, 636| 1.61k| &new_node->inner()[offset]); 637| 1.61k| pos.visit(dec_visitor{}); 638| 1.61k| *location = new_node; 639| 1.61k| return res; 640| 1.61k| } 641| 1.61k| IMMER_CATCH (...) { 642| 0| dec_regular(new_node, pos.shift(), pos.size()); 643| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 644| 0| } 645| 1.61k| } 646| 4.32k| } _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_: 651| 3.02k| { 652| 3.02k| assert(pos.node() == *location); 653| 0| auto node = pos.node(); 654| 3.02k| if (node->can_mutate(e)) { ------------------ | Branch (654:13): [True: 1.36k, False: 1.66k] ------------------ 655| 1.36k| return node->leaf()[pos.index(idx)]; 656| 1.66k| } else { 657| 1.66k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 658| 1.66k| pos.visit(dec_visitor{}); 659| 1.66k| *location = new_node; 660| 1.66k| return new_node->leaf()[pos.index(idx)]; 661| 1.66k| } 662| 3.02k| } _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_: 620| 2.45k| { 621| 2.45k| assert(pos.node() == *location); 622| 0| auto offset = pos.index(idx); 623| 2.45k| auto count = pos.count(); 624| 2.45k| auto node = pos.node(); 625| 2.45k| if (node->can_mutate(e)) { ------------------ | Branch (625:13): [True: 1.36k, False: 1.09k] ------------------ 626| 1.36k| return pos.towards_oh_ch( 627| 1.36k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 628| 1.36k| } else { 629| 1.09k| auto new_node = node_t::copy_inner_e(e, node, count); 630| 1.09k| IMMER_TRY { ------------------ | | 41| 1.09k|#define IMMER_TRY try ------------------ 631| 1.09k| auto& res = pos.towards_oh_ch(this_t{}, 632| 1.09k| idx, 633| 1.09k| offset, 634| 1.09k| count, 635| 1.09k| e, 636| 1.09k| &new_node->inner()[offset]); 637| 1.09k| pos.visit(dec_visitor{}); 638| 1.09k| *location = new_node; 639| 1.09k| return res; 640| 1.09k| } 641| 1.09k| IMMER_CATCH (...) { 642| 0| dec_regular(new_node, pos.shift(), pos.size()); 643| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 644| 0| } 645| 1.09k| } 646| 2.45k| } _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_: 651| 1.29k| { 652| 1.29k| assert(pos.node() == *location); 653| 0| auto node = pos.node(); 654| 1.29k| if (node->can_mutate(e)) { ------------------ | Branch (654:13): [True: 809, False: 483] ------------------ 655| 809| return node->leaf()[pos.index(idx)]; 656| 809| } else { 657| 483| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 658| 483| pos.visit(dec_visitor{}); 659| 483| *location = new_node; 660| 483| return new_node->leaf()[pos.index(idx)]; 661| 483| } 662| 1.29k| } _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_: 620| 1.82k| { 621| 1.82k| assert(pos.node() == *location); 622| 0| auto offset = pos.index(idx); 623| 1.82k| auto count = pos.count(); 624| 1.82k| auto node = pos.node(); 625| 1.82k| if (node->can_mutate(e)) { ------------------ | Branch (625:13): [True: 1.38k, False: 441] ------------------ 626| 1.38k| return pos.towards_oh_ch( 627| 1.38k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 628| 1.38k| } else { 629| 441| auto new_node = node_t::copy_inner_e(e, node, count); 630| 441| IMMER_TRY { ------------------ | | 41| 441|#define IMMER_TRY try ------------------ 631| 441| auto& res = pos.towards_oh_ch(this_t{}, 632| 441| idx, 633| 441| offset, 634| 441| count, 635| 441| e, 636| 441| &new_node->inner()[offset]); 637| 441| pos.visit(dec_visitor{}); 638| 441| *location = new_node; 639| 441| return res; 640| 441| } 641| 441| IMMER_CATCH (...) { 642| 0| dec_regular(new_node, pos.shift(), pos.size()); 643| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 644| 0| } 645| 441| } 646| 1.82k| } _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: 912| 35.1k| { 913| 35.1k| auto idx = pos.index(last); 914| 35.1k| auto node = pos.node(); 915| 35.1k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (915:23): [Folded - Ignored] | Branch (915:35): [True: 25.0k, False: 10.1k] ------------------ 916| 35.1k| if (Collapse && idx == 0) { ------------------ | Branch (916:13): [Folded - Ignored] | Branch (916:25): [True: 22.1k, False: 12.9k] ------------------ 917| 22.1k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (917:24): [True: 16.9k, False: 5.25k] ------------------ 918| 22.1k| : pos.towards_oh(no_mut_t{}, last, idx, e); 919| 22.1k| if (Mutating) ------------------ | Branch (919:17): [Folded - Ignored] ------------------ 920| 22.1k| pos.visit(dec_right_visitor{}, count_t{1}); 921| 22.1k| return res; 922| 22.1k| } else { 923| 12.9k| using std::get; 924| 12.9k| auto subs = 925| 12.9k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (925:17): [True: 8.07k, False: 4.89k] ------------------ 926| 12.9k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 927| 12.9k| auto next = get<1>(subs); 928| 12.9k| auto ts = get<2>(subs); 929| 12.9k| auto tail = get<3>(subs); 930| 12.9k| IMMER_TRY { ------------------ | | 41| 12.9k|#define IMMER_TRY try ------------------ 931| 12.9k| if (next) { ------------------ | Branch (931:21): [True: 8.99k, False: 3.97k] ------------------ 932| 8.99k| if (mutate) { ------------------ | Branch (932:25): [True: 5.77k, False: 3.22k] ------------------ 933| 5.77k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 934| 5.77k| pos.each_right(dec_visitor{}, idx + 1); 935| 5.77k| node->inner()[idx] = next; 936| 5.77k| nodr->d.sizes[idx] = last + 1 - ts; 937| 5.77k| nodr->d.count = idx + 1; 938| 5.77k| assert(nodr->d.sizes[idx]); 939| 0| return std::make_tuple(pos.shift(), node, ts, tail); 940| 5.77k| } else { 941| 3.22k| auto newn = node_t::copy_inner_r_e(e, node, idx); 942| 3.22k| auto newr = newn->relaxed(); 943| 3.22k| newn->inner()[idx] = next; 944| 3.22k| newr->d.sizes[idx] = last + 1 - ts; 945| 3.22k| newr->d.count = idx + 1; 946| 3.22k| assert(newr->d.sizes[idx]); 947| 3.22k| if (Mutating) ------------------ | Branch (947:29): [Folded - Ignored] ------------------ 948| 3.22k| pos.visit(dec_visitor{}); 949| 3.22k| return std::make_tuple(pos.shift(), newn, ts, tail); 950| 3.22k| } 951| 8.99k| } else if (idx == 0) { ------------------ | Branch (951:28): [True: 0, False: 3.97k] ------------------ 952| 0| if (Mutating) ------------------ | Branch (952:25): [Folded - Ignored] ------------------ 953| 0| pos.visit(dec_right_visitor{}, count_t{1}); 954| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 955| 3.97k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (955:28): [Folded - Ignored] | Branch (955:40): [True: 3.21k, False: 764] | Branch (955:52): [True: 2.55k, False: 660] ------------------ 956| 2.55k| auto newn = pos.node()->inner()[0]; 957| 2.55k| if (!mutate) ------------------ | Branch (957:25): [True: 957, False: 1.59k] ------------------ 958| 957| newn->inc(); 959| 2.55k| if (Mutating) ------------------ | Branch (959:25): [Folded - Ignored] ------------------ 960| 2.55k| pos.visit(dec_right_visitor{}, count_t{2}); 961| 2.55k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 962| 2.55k| } else { 963| 1.42k| if (mutate) { ------------------ | Branch (963:25): [True: 712, False: 712] ------------------ 964| 712| pos.each_right(dec_visitor{}, idx + 1); 965| 712| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 966| 712| return std::make_tuple(pos.shift(), node, ts, tail); 967| 712| } else { 968| 712| auto newn = node_t::copy_inner_r_e(e, node, idx); 969| 712| if (Mutating) ------------------ | Branch (969:29): [Folded - Ignored] ------------------ 970| 712| pos.visit(dec_visitor{}); 971| 712| return std::make_tuple(pos.shift(), newn, ts, tail); 972| 712| } 973| 1.42k| } 974| 12.9k| } 975| 12.9k| IMMER_CATCH (...) { 976| 0| assert(!mutate); 977| 0| assert(!next || pos.shift() > BL); 978| 0| if (next) ------------------ | Branch (978:21): [True: 0, False: 0] ------------------ 979| 0| dec_inner(next, 980| 0| pos.shift() - B, 981| 0| last + 1 - ts - pos.size_before(idx)); 982| 0| dec_leaf(tail, ts); 983| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 984| 0| } 985| 12.9k| } 986| 35.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: 1058| 944| { 1059| 944| auto old_tail_size = pos.count(); 1060| 944| auto new_tail_size = pos.index(last) + 1; 1061| 944| auto node = pos.node(); 1062| 944| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1062:30): [Folded - Ignored] | Branch (1062:42): [True: 257, False: 687] ------------------ 1063| 944| if (new_tail_size == old_tail_size) { ------------------ | Branch (1063:13): [True: 207, False: 737] ------------------ 1064| 207| if (!Mutating) ------------------ | Branch (1064:17): [Folded - Ignored] ------------------ 1065| 0| node->inc(); 1066| 207| return std::make_tuple(0, nullptr, new_tail_size, node); 1067| 737| } else if (mutate) { ------------------ | Branch (1067:20): [True: 248, False: 489] ------------------ 1068| 248| detail::destroy_n(node->leaf() + new_tail_size, 1069| 248| old_tail_size - new_tail_size); 1070| 248| return std::make_tuple(0, nullptr, new_tail_size, node); 1071| 489| } else { 1072| 489| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1073| 489| if (Mutating) ------------------ | Branch (1073:17): [Folded - Ignored] ------------------ 1074| 489| pos.visit(dec_visitor{}); 1075| 489| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1076| 489| } 1077| 944| } _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: 1058| 1.22k| { 1059| 1.22k| auto old_tail_size = pos.count(); 1060| 1.22k| auto new_tail_size = pos.index(last) + 1; 1061| 1.22k| auto node = pos.node(); 1062| 1.22k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1062:30): [Folded - Ignored] | Branch (1062:42): [True: 0, False: 0] ------------------ 1063| 1.22k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1063:13): [True: 827, False: 400] ------------------ 1064| 827| if (!Mutating) ------------------ | Branch (1064:17): [Folded - Ignored] ------------------ 1065| 827| node->inc(); 1066| 827| return std::make_tuple(0, nullptr, new_tail_size, node); 1067| 827| } else if (mutate) { ------------------ | Branch (1067:20): [True: 0, False: 400] ------------------ 1068| 0| detail::destroy_n(node->leaf() + new_tail_size, 1069| 0| old_tail_size - new_tail_size); 1070| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1071| 400| } else { 1072| 400| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1073| 400| if (Mutating) ------------------ | Branch (1073:17): [Folded - Ignored] ------------------ 1074| 0| pos.visit(dec_visitor{}); 1075| 400| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1076| 400| } 1077| 1.22k| } _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: 912| 23.8k| { 913| 23.8k| auto idx = pos.index(last); 914| 23.8k| auto node = pos.node(); 915| 23.8k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (915:23): [Folded - Ignored] | Branch (915:35): [True: 0, False: 0] ------------------ 916| 23.8k| if (Collapse && idx == 0) { ------------------ | Branch (916:13): [Folded - Ignored] | Branch (916:25): [True: 21.0k, False: 2.79k] ------------------ 917| 21.0k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (917:24): [True: 0, False: 21.0k] ------------------ 918| 21.0k| : pos.towards_oh(no_mut_t{}, last, idx, e); 919| 21.0k| if (Mutating) ------------------ | Branch (919:17): [Folded - Ignored] ------------------ 920| 0| pos.visit(dec_right_visitor{}, count_t{1}); 921| 21.0k| return res; 922| 21.0k| } else { 923| 2.79k| using std::get; 924| 2.79k| auto subs = 925| 2.79k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (925:17): [True: 0, False: 2.79k] ------------------ 926| 2.79k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 927| 2.79k| auto next = get<1>(subs); 928| 2.79k| auto ts = get<2>(subs); 929| 2.79k| auto tail = get<3>(subs); 930| 2.79k| IMMER_TRY { ------------------ | | 41| 2.79k|#define IMMER_TRY try ------------------ 931| 2.79k| if (next) { ------------------ | Branch (931:21): [True: 1.36k, False: 1.42k] ------------------ 932| 1.36k| if (mutate) { ------------------ | Branch (932:25): [True: 0, False: 1.36k] ------------------ 933| 0| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 934| 0| pos.each_right(dec_visitor{}, idx + 1); 935| 0| node->inner()[idx] = next; 936| 0| nodr->d.sizes[idx] = last + 1 - ts; 937| 0| nodr->d.count = idx + 1; 938| 0| assert(nodr->d.sizes[idx]); 939| 0| return std::make_tuple(pos.shift(), node, ts, tail); 940| 1.36k| } else { 941| 1.36k| auto newn = node_t::copy_inner_r_e(e, node, idx); 942| 1.36k| auto newr = newn->relaxed(); 943| 1.36k| newn->inner()[idx] = next; 944| 1.36k| newr->d.sizes[idx] = last + 1 - ts; 945| 1.36k| newr->d.count = idx + 1; 946| 1.36k| assert(newr->d.sizes[idx]); 947| 1.36k| if (Mutating) ------------------ | Branch (947:29): [Folded - Ignored] ------------------ 948| 0| pos.visit(dec_visitor{}); 949| 1.36k| return std::make_tuple(pos.shift(), newn, ts, tail); 950| 1.36k| } 951| 1.42k| } else if (idx == 0) { ------------------ | Branch (951:28): [True: 0, False: 1.42k] ------------------ 952| 0| if (Mutating) ------------------ | Branch (952:25): [Folded - Ignored] ------------------ 953| 0| pos.visit(dec_right_visitor{}, count_t{1}); 954| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 955| 1.42k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (955:28): [Folded - Ignored] | Branch (955:40): [True: 749, False: 680] | Branch (955:52): [True: 341, False: 408] ------------------ 956| 341| auto newn = pos.node()->inner()[0]; 957| 341| if (!mutate) ------------------ | Branch (957:25): [True: 341, False: 0] ------------------ 958| 341| newn->inc(); 959| 341| if (Mutating) ------------------ | Branch (959:25): [Folded - Ignored] ------------------ 960| 0| pos.visit(dec_right_visitor{}, count_t{2}); 961| 341| return std::make_tuple(pos.shift() - B, newn, ts, tail); 962| 1.08k| } else { 963| 1.08k| if (mutate) { ------------------ | Branch (963:25): [True: 0, False: 1.08k] ------------------ 964| 0| pos.each_right(dec_visitor{}, idx + 1); 965| 0| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 966| 0| return std::make_tuple(pos.shift(), node, ts, tail); 967| 1.08k| } else { 968| 1.08k| auto newn = node_t::copy_inner_r_e(e, node, idx); 969| 1.08k| if (Mutating) ------------------ | Branch (969:29): [Folded - Ignored] ------------------ 970| 0| pos.visit(dec_visitor{}); 971| 1.08k| return std::make_tuple(pos.shift(), newn, ts, tail); 972| 1.08k| } 973| 1.08k| } 974| 2.79k| } 975| 2.79k| IMMER_CATCH (...) { 976| 0| assert(!mutate); 977| 0| assert(!next || pos.shift() > BL); 978| 0| if (next) ------------------ | Branch (978:21): [True: 0, False: 0] ------------------ 979| 0| dec_inner(next, 980| 0| pos.shift() - B, 981| 0| last + 1 - ts - pos.size_before(idx)); 982| 0| dec_leaf(tail, ts); 983| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 984| 0| } 985| 2.79k| } 986| 23.8k| } _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: 990| 1.23k| { 991| 1.23k| auto idx = pos.index(last); 992| 1.23k| auto node = pos.node(); 993| 1.23k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (993:23): [Folded - Ignored] | Branch (993:35): [True: 0, False: 0] ------------------ 994| 1.23k| if (Collapse && idx == 0) { ------------------ | Branch (994:13): [Folded - Ignored] | Branch (994:25): [True: 261, False: 972] ------------------ 995| 261| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (995:24): [True: 0, False: 261] ------------------ 996| 261| : pos.towards_oh(no_mut_t{}, last, idx, e); 997| 261| if (Mutating) ------------------ | Branch (997:17): [Folded - Ignored] ------------------ 998| 0| pos.visit(dec_right_visitor{}, count_t{1}); 999| 261| return res; 1000| 972| } else { 1001| 972| using std::get; 1002| 972| auto subs = 1003| 972| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1003:17): [True: 0, False: 972] ------------------ 1004| 972| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1005| 972| auto next = get<1>(subs); 1006| 972| auto ts = get<2>(subs); 1007| 972| auto tail = get<3>(subs); 1008| 972| IMMER_TRY { ------------------ | | 41| 972|#define IMMER_TRY try ------------------ 1009| 972| if (next) { ------------------ | Branch (1009:21): [True: 269, False: 703] ------------------ 1010| 269| if (mutate) { ------------------ | Branch (1010:25): [True: 0, False: 269] ------------------ 1011| 0| node->inner()[idx] = next; 1012| 0| pos.each_right(dec_visitor{}, idx + 1); 1013| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1014| 269| } else { 1015| 269| auto newn = node_t::copy_inner_e(e, node, idx); 1016| 269| newn->inner()[idx] = next; 1017| 269| if (Mutating) ------------------ | Branch (1017:29): [Folded - Ignored] ------------------ 1018| 0| pos.visit(dec_visitor{}); 1019| 269| return std::make_tuple(pos.shift(), newn, ts, tail); 1020| 269| } 1021| 703| } else if (idx == 0) { ------------------ | Branch (1021:28): [True: 0, False: 703] ------------------ 1022| 0| if (Mutating) ------------------ | Branch (1022:25): [Folded - Ignored] ------------------ 1023| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1024| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1025| 703| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1025:28): [Folded - Ignored] | Branch (1025:40): [True: 463, False: 240] | Branch (1025:52): [True: 197, False: 266] ------------------ 1026| 197| auto newn = pos.node()->inner()[0]; 1027| 197| if (!mutate) ------------------ | Branch (1027:25): [True: 197, False: 0] ------------------ 1028| 197| newn->inc(); 1029| 197| if (Mutating) ------------------ | Branch (1029:25): [Folded - Ignored] ------------------ 1030| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1031| 197| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1032| 506| } else { 1033| 506| if (mutate) { ------------------ | Branch (1033:25): [True: 0, False: 506] ------------------ 1034| 0| pos.each_right(dec_visitor{}, idx + 1); 1035| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1036| 506| } else { 1037| 506| auto newn = node_t::copy_inner_e(e, node, idx); 1038| 506| if (Mutating) ------------------ | Branch (1038:29): [Folded - Ignored] ------------------ 1039| 0| pos.visit(dec_visitor{}); 1040| 506| return std::make_tuple(pos.shift(), newn, ts, tail); 1041| 506| } 1042| 506| } 1043| 972| } 1044| 972| IMMER_CATCH (...) { 1045| 0| assert(!mutate); 1046| 0| assert(!next || pos.shift() > BL); 1047| 0| assert(tail); 1048| 0| if (next) ------------------ | Branch (1048:21): [True: 0, False: 0] ------------------ 1049| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1050| 0| dec_leaf(tail, ts); 1051| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1052| 0| } 1053| 972| } 1054| 1.23k| } _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: 1058| 1.39k| { 1059| 1.39k| auto old_tail_size = pos.count(); 1060| 1.39k| auto new_tail_size = pos.index(last) + 1; 1061| 1.39k| auto node = pos.node(); 1062| 1.39k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1062:30): [Folded - Ignored] | Branch (1062:42): [True: 0, False: 0] ------------------ 1063| 1.39k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1063:13): [True: 949, False: 444] ------------------ 1064| 949| if (!Mutating) ------------------ | Branch (1064:17): [Folded - Ignored] ------------------ 1065| 949| node->inc(); 1066| 949| return std::make_tuple(0, nullptr, new_tail_size, node); 1067| 949| } else if (mutate) { ------------------ | Branch (1067:20): [True: 0, False: 444] ------------------ 1068| 0| detail::destroy_n(node->leaf() + new_tail_size, 1069| 0| old_tail_size - new_tail_size); 1070| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1071| 444| } else { 1072| 444| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1073| 444| if (Mutating) ------------------ | Branch (1073:17): [Folded - Ignored] ------------------ 1074| 0| pos.visit(dec_visitor{}); 1075| 444| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1076| 444| } 1077| 1.39k| } _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: 990| 1.42k| { 991| 1.42k| auto idx = pos.index(last); 992| 1.42k| auto node = pos.node(); 993| 1.42k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (993:23): [Folded - Ignored] | Branch (993:35): [True: 0, False: 0] ------------------ 994| 1.42k| if (Collapse && idx == 0) { ------------------ | Branch (994:13): [Folded - Ignored] | Branch (994:25): [True: 377, False: 1.04k] ------------------ 995| 377| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (995:24): [True: 0, False: 377] ------------------ 996| 377| : pos.towards_oh(no_mut_t{}, last, idx, e); 997| 377| if (Mutating) ------------------ | Branch (997:17): [Folded - Ignored] ------------------ 998| 0| pos.visit(dec_right_visitor{}, count_t{1}); 999| 377| return res; 1000| 1.04k| } else { 1001| 1.04k| using std::get; 1002| 1.04k| auto subs = 1003| 1.04k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1003:17): [True: 0, False: 1.04k] ------------------ 1004| 1.04k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1005| 1.04k| auto next = get<1>(subs); 1006| 1.04k| auto ts = get<2>(subs); 1007| 1.04k| auto tail = get<3>(subs); 1008| 1.04k| IMMER_TRY { ------------------ | | 41| 1.04k|#define IMMER_TRY try ------------------ 1009| 1.04k| if (next) { ------------------ | Branch (1009:21): [True: 288, False: 757] ------------------ 1010| 288| if (mutate) { ------------------ | Branch (1010:25): [True: 0, False: 288] ------------------ 1011| 0| node->inner()[idx] = next; 1012| 0| pos.each_right(dec_visitor{}, idx + 1); 1013| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1014| 288| } else { 1015| 288| auto newn = node_t::copy_inner_e(e, node, idx); 1016| 288| newn->inner()[idx] = next; 1017| 288| if (Mutating) ------------------ | Branch (1017:29): [Folded - Ignored] ------------------ 1018| 0| pos.visit(dec_visitor{}); 1019| 288| return std::make_tuple(pos.shift(), newn, ts, tail); 1020| 288| } 1021| 757| } else if (idx == 0) { ------------------ | Branch (1021:28): [True: 0, False: 757] ------------------ 1022| 0| if (Mutating) ------------------ | Branch (1022:25): [Folded - Ignored] ------------------ 1023| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1024| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1025| 757| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1025:28): [Folded - Ignored] | Branch (1025:40): [True: 394, False: 363] | Branch (1025:52): [True: 197, False: 197] ------------------ 1026| 197| auto newn = pos.node()->inner()[0]; 1027| 197| if (!mutate) ------------------ | Branch (1027:25): [True: 197, False: 0] ------------------ 1028| 197| newn->inc(); 1029| 197| if (Mutating) ------------------ | Branch (1029:25): [Folded - Ignored] ------------------ 1030| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1031| 197| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1032| 560| } else { 1033| 560| if (mutate) { ------------------ | Branch (1033:25): [True: 0, False: 560] ------------------ 1034| 0| pos.each_right(dec_visitor{}, idx + 1); 1035| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1036| 560| } else { 1037| 560| auto newn = node_t::copy_inner_e(e, node, idx); 1038| 560| if (Mutating) ------------------ | Branch (1038:29): [Folded - Ignored] ------------------ 1039| 0| pos.visit(dec_visitor{}); 1040| 560| return std::make_tuple(pos.shift(), newn, ts, tail); 1041| 560| } 1042| 560| } 1043| 1.04k| } 1044| 1.04k| IMMER_CATCH (...) { 1045| 0| assert(!mutate); 1046| 0| assert(!next || pos.shift() > BL); 1047| 0| assert(tail); 1048| 0| if (next) ------------------ | Branch (1048:21): [True: 0, False: 0] ------------------ 1049| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1050| 0| dec_leaf(tail, ts); 1051| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1052| 0| } 1053| 1.04k| } 1054| 1.42k| } _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: 1058| 3.18k| { 1059| 3.18k| auto old_tail_size = pos.count(); 1060| 3.18k| auto new_tail_size = pos.index(last) + 1; 1061| 3.18k| auto node = pos.node(); 1062| 3.18k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1062:30): [Folded - Ignored] | Branch (1062:42): [True: 300, False: 2.88k] ------------------ 1063| 3.18k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1063:13): [True: 1.21k, False: 1.96k] ------------------ 1064| 1.21k| if (!Mutating) ------------------ | Branch (1064:17): [Folded - Ignored] ------------------ 1065| 0| node->inc(); 1066| 1.21k| return std::make_tuple(0, nullptr, new_tail_size, node); 1067| 1.96k| } else if (mutate) { ------------------ | Branch (1067:20): [True: 292, False: 1.67k] ------------------ 1068| 292| detail::destroy_n(node->leaf() + new_tail_size, 1069| 292| old_tail_size - new_tail_size); 1070| 292| return std::make_tuple(0, nullptr, new_tail_size, node); 1071| 1.67k| } else { 1072| 1.67k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1073| 1.67k| if (Mutating) ------------------ | Branch (1073:17): [Folded - Ignored] ------------------ 1074| 1.67k| pos.visit(dec_visitor{}); 1075| 1.67k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1076| 1.67k| } 1077| 3.18k| } _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: 990| 3.77k| { 991| 3.77k| auto idx = pos.index(last); 992| 3.77k| auto node = pos.node(); 993| 3.77k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (993:23): [Folded - Ignored] | Branch (993:35): [True: 1.21k, False: 2.55k] ------------------ 994| 3.77k| if (Collapse && idx == 0) { ------------------ | Branch (994:13): [Folded - Ignored] | Branch (994:25): [True: 0, False: 0] ------------------ 995| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (995:24): [True: 0, False: 0] ------------------ 996| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 997| 0| if (Mutating) ------------------ | Branch (997:17): [Folded - Ignored] ------------------ 998| 0| pos.visit(dec_right_visitor{}, count_t{1}); 999| 0| return res; 1000| 3.77k| } else { 1001| 3.77k| using std::get; 1002| 3.77k| auto subs = 1003| 3.77k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1003:17): [True: 1.21k, False: 2.55k] ------------------ 1004| 3.77k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1005| 3.77k| auto next = get<1>(subs); 1006| 3.77k| auto ts = get<2>(subs); 1007| 3.77k| auto tail = get<3>(subs); 1008| 3.77k| IMMER_TRY { ------------------ | | 41| 3.77k|#define IMMER_TRY try ------------------ 1009| 3.77k| if (next) { ------------------ | Branch (1009:21): [True: 1.01k, False: 2.75k] ------------------ 1010| 1.01k| if (mutate) { ------------------ | Branch (1010:25): [True: 414, False: 604] ------------------ 1011| 414| node->inner()[idx] = next; 1012| 414| pos.each_right(dec_visitor{}, idx + 1); 1013| 414| return std::make_tuple(pos.shift(), node, ts, tail); 1014| 604| } else { 1015| 604| auto newn = node_t::copy_inner_e(e, node, idx); 1016| 604| newn->inner()[idx] = next; 1017| 604| if (Mutating) ------------------ | Branch (1017:29): [Folded - Ignored] ------------------ 1018| 604| pos.visit(dec_visitor{}); 1019| 604| return std::make_tuple(pos.shift(), newn, ts, tail); 1020| 604| } 1021| 2.75k| } else if (idx == 0) { ------------------ | Branch (1021:28): [True: 1.09k, False: 1.66k] ------------------ 1022| 1.09k| if (Mutating) ------------------ | Branch (1022:25): [Folded - Ignored] ------------------ 1023| 1.09k| pos.visit(dec_right_visitor{}, count_t{1}); 1024| 1.09k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1025| 1.66k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1025:28): [Folded - Ignored] | Branch (1025:40): [True: 0, False: 0] | Branch (1025:52): [True: 0, False: 0] ------------------ 1026| 0| auto newn = pos.node()->inner()[0]; 1027| 0| if (!mutate) ------------------ | Branch (1027:25): [True: 0, False: 0] ------------------ 1028| 0| newn->inc(); 1029| 0| if (Mutating) ------------------ | Branch (1029:25): [Folded - Ignored] ------------------ 1030| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1031| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1032| 1.66k| } else { 1033| 1.66k| if (mutate) { ------------------ | Branch (1033:25): [True: 522, False: 1.14k] ------------------ 1034| 522| pos.each_right(dec_visitor{}, idx + 1); 1035| 522| return std::make_tuple(pos.shift(), node, ts, tail); 1036| 1.14k| } else { 1037| 1.14k| auto newn = node_t::copy_inner_e(e, node, idx); 1038| 1.14k| if (Mutating) ------------------ | Branch (1038:29): [Folded - Ignored] ------------------ 1039| 1.14k| pos.visit(dec_visitor{}); 1040| 1.14k| return std::make_tuple(pos.shift(), newn, ts, tail); 1041| 1.14k| } 1042| 1.66k| } 1043| 3.77k| } 1044| 3.77k| IMMER_CATCH (...) { 1045| 0| assert(!mutate); 1046| 0| assert(!next || pos.shift() > BL); 1047| 0| assert(tail); 1048| 0| if (next) ------------------ | Branch (1048:21): [True: 0, False: 0] ------------------ 1049| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1050| 0| dec_leaf(tail, ts); 1051| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1052| 0| } 1053| 3.77k| } 1054| 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: 877| 3.46k| { 878| 3.46k| using node_t = node_type; 879| 3.46k| auto node = p.node(); 880| 3.46k| if (node->dec()) { ------------------ | Branch (880:13): [True: 1.71k, False: 1.74k] ------------------ 881| 1.71k| p.each_right(dec_t{}, idx); 882| 1.71k| node_t::delete_inner(node, p.count()); 883| 1.71k| } 884| 3.46k| } _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: 1058| 10.6k| { 1059| 10.6k| auto old_tail_size = pos.count(); 1060| 10.6k| auto new_tail_size = pos.index(last) + 1; 1061| 10.6k| auto node = pos.node(); 1062| 10.6k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1062:30): [Folded - Ignored] | Branch (1062:42): [True: 0, False: 0] ------------------ 1063| 10.6k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1063:13): [True: 4.36k, False: 6.30k] ------------------ 1064| 4.36k| if (!Mutating) ------------------ | Branch (1064:17): [Folded - Ignored] ------------------ 1065| 4.36k| node->inc(); 1066| 4.36k| return std::make_tuple(0, nullptr, new_tail_size, node); 1067| 6.30k| } else if (mutate) { ------------------ | Branch (1067:20): [True: 0, False: 6.30k] ------------------ 1068| 0| detail::destroy_n(node->leaf() + new_tail_size, 1069| 0| old_tail_size - new_tail_size); 1070| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1071| 6.30k| } else { 1072| 6.30k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1073| 6.30k| if (Mutating) ------------------ | Branch (1073:17): [Folded - Ignored] ------------------ 1074| 0| pos.visit(dec_visitor{}); 1075| 6.30k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1076| 6.30k| } 1077| 10.6k| } _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: 990| 5.74k| { 991| 5.74k| auto idx = pos.index(last); 992| 5.74k| auto node = pos.node(); 993| 5.74k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (993:23): [Folded - Ignored] | Branch (993:35): [True: 0, False: 0] ------------------ 994| 5.74k| if (Collapse && idx == 0) { ------------------ | Branch (994:13): [Folded - Ignored] | Branch (994:25): [True: 0, False: 0] ------------------ 995| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (995:24): [True: 0, False: 0] ------------------ 996| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 997| 0| if (Mutating) ------------------ | Branch (997:17): [Folded - Ignored] ------------------ 998| 0| pos.visit(dec_right_visitor{}, count_t{1}); 999| 0| return res; 1000| 5.74k| } else { 1001| 5.74k| using std::get; 1002| 5.74k| auto subs = 1003| 5.74k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1003:17): [True: 0, False: 5.74k] ------------------ 1004| 5.74k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1005| 5.74k| auto next = get<1>(subs); 1006| 5.74k| auto ts = get<2>(subs); 1007| 5.74k| auto tail = get<3>(subs); 1008| 5.74k| IMMER_TRY { ------------------ | | 41| 5.74k|#define IMMER_TRY try ------------------ 1009| 5.74k| if (next) { ------------------ | Branch (1009:21): [True: 868, False: 4.87k] ------------------ 1010| 868| if (mutate) { ------------------ | Branch (1010:25): [True: 0, False: 868] ------------------ 1011| 0| node->inner()[idx] = next; 1012| 0| pos.each_right(dec_visitor{}, idx + 1); 1013| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1014| 868| } else { 1015| 868| auto newn = node_t::copy_inner_e(e, node, idx); 1016| 868| newn->inner()[idx] = next; 1017| 868| if (Mutating) ------------------ | Branch (1017:29): [Folded - Ignored] ------------------ 1018| 0| pos.visit(dec_visitor{}); 1019| 868| return std::make_tuple(pos.shift(), newn, ts, tail); 1020| 868| } 1021| 4.87k| } else if (idx == 0) { ------------------ | Branch (1021:28): [True: 1.09k, False: 3.78k] ------------------ 1022| 1.09k| if (Mutating) ------------------ | Branch (1022:25): [Folded - Ignored] ------------------ 1023| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1024| 1.09k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1025| 3.78k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1025:28): [Folded - Ignored] | Branch (1025:40): [True: 0, False: 0] | Branch (1025:52): [True: 0, False: 0] ------------------ 1026| 0| auto newn = pos.node()->inner()[0]; 1027| 0| if (!mutate) ------------------ | Branch (1027:25): [True: 0, False: 0] ------------------ 1028| 0| newn->inc(); 1029| 0| if (Mutating) ------------------ | Branch (1029:25): [Folded - Ignored] ------------------ 1030| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1031| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1032| 3.78k| } else { 1033| 3.78k| if (mutate) { ------------------ | Branch (1033:25): [True: 0, False: 3.78k] ------------------ 1034| 0| pos.each_right(dec_visitor{}, idx + 1); 1035| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1036| 3.78k| } else { 1037| 3.78k| auto newn = node_t::copy_inner_e(e, node, idx); 1038| 3.78k| if (Mutating) ------------------ | Branch (1038:29): [Folded - Ignored] ------------------ 1039| 0| pos.visit(dec_visitor{}); 1040| 3.78k| return std::make_tuple(pos.shift(), newn, ts, tail); 1041| 3.78k| } 1042| 3.78k| } 1043| 5.74k| } 1044| 5.74k| IMMER_CATCH (...) { 1045| 0| assert(!mutate); 1046| 0| assert(!next || pos.shift() > BL); 1047| 0| assert(tail); 1048| 0| if (next) ------------------ | Branch (1048:21): [True: 0, False: 0] ------------------ 1049| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1050| 0| dec_leaf(tail, ts); 1051| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1052| 0| } 1053| 5.74k| } 1054| 5.74k| } _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: 1058| 454| { 1059| 454| auto old_tail_size = pos.count(); 1060| 454| auto new_tail_size = pos.index(last) + 1; 1061| 454| auto node = pos.node(); 1062| 454| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1062:30): [Folded - Ignored] | Branch (1062:42): [True: 0, False: 0] ------------------ 1063| 454| if (new_tail_size == old_tail_size) { ------------------ | Branch (1063:13): [True: 226, False: 228] ------------------ 1064| 226| if (!Mutating) ------------------ | Branch (1064:17): [Folded - Ignored] ------------------ 1065| 226| node->inc(); 1066| 226| return std::make_tuple(0, nullptr, new_tail_size, node); 1067| 228| } else if (mutate) { ------------------ | Branch (1067:20): [True: 0, False: 228] ------------------ 1068| 0| detail::destroy_n(node->leaf() + new_tail_size, 1069| 0| old_tail_size - new_tail_size); 1070| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1071| 228| } else { 1072| 228| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1073| 228| if (Mutating) ------------------ | Branch (1073:17): [Folded - Ignored] ------------------ 1074| 0| pos.visit(dec_visitor{}); 1075| 228| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1076| 228| } 1077| 454| } _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: 1058| 1.38k| { 1059| 1.38k| auto old_tail_size = pos.count(); 1060| 1.38k| auto new_tail_size = pos.index(last) + 1; 1061| 1.38k| auto node = pos.node(); 1062| 1.38k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1062:30): [Folded - Ignored] | Branch (1062:42): [True: 208, False: 1.18k] ------------------ 1063| 1.38k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1063:13): [True: 345, False: 1.04k] ------------------ 1064| 345| if (!Mutating) ------------------ | Branch (1064:17): [Folded - Ignored] ------------------ 1065| 0| node->inc(); 1066| 345| return std::make_tuple(0, nullptr, new_tail_size, node); 1067| 1.04k| } else if (mutate) { ------------------ | Branch (1067:20): [True: 208, False: 836] ------------------ 1068| 208| detail::destroy_n(node->leaf() + new_tail_size, 1069| 208| old_tail_size - new_tail_size); 1070| 208| return std::make_tuple(0, nullptr, new_tail_size, node); 1071| 836| } else { 1072| 836| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1073| 836| if (Mutating) ------------------ | Branch (1073:17): [Folded - Ignored] ------------------ 1074| 836| pos.visit(dec_visitor{}); 1075| 836| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1076| 836| } 1077| 1.38k| } _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: 990| 3.93k| { 991| 3.93k| auto idx = pos.index(last); 992| 3.93k| auto node = pos.node(); 993| 3.93k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (993:23): [Folded - Ignored] | Branch (993:35): [True: 3.00k, False: 930] ------------------ 994| 3.93k| if (Collapse && idx == 0) { ------------------ | Branch (994:13): [Folded - Ignored] | Branch (994:25): [True: 0, False: 0] ------------------ 995| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (995:24): [True: 0, False: 0] ------------------ 996| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 997| 0| if (Mutating) ------------------ | Branch (997:17): [Folded - Ignored] ------------------ 998| 0| pos.visit(dec_right_visitor{}, count_t{1}); 999| 0| return res; 1000| 3.93k| } else { 1001| 3.93k| using std::get; 1002| 3.93k| auto subs = 1003| 3.93k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1003:17): [True: 3.00k, False: 930] ------------------ 1004| 3.93k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1005| 3.93k| auto next = get<1>(subs); 1006| 3.93k| auto ts = get<2>(subs); 1007| 3.93k| auto tail = get<3>(subs); 1008| 3.93k| IMMER_TRY { ------------------ | | 41| 3.93k|#define IMMER_TRY try ------------------ 1009| 3.93k| if (next) { ------------------ | Branch (1009:21): [True: 1.50k, False: 2.42k] ------------------ 1010| 1.50k| if (mutate) { ------------------ | Branch (1010:25): [True: 1.03k, False: 475] ------------------ 1011| 1.03k| node->inner()[idx] = next; 1012| 1.03k| pos.each_right(dec_visitor{}, idx + 1); 1013| 1.03k| return std::make_tuple(pos.shift(), node, ts, tail); 1014| 1.03k| } else { 1015| 475| auto newn = node_t::copy_inner_e(e, node, idx); 1016| 475| newn->inner()[idx] = next; 1017| 475| if (Mutating) ------------------ | Branch (1017:29): [Folded - Ignored] ------------------ 1018| 475| pos.visit(dec_visitor{}); 1019| 475| return std::make_tuple(pos.shift(), newn, ts, tail); 1020| 475| } 1021| 2.42k| } else if (idx == 0) { ------------------ | Branch (1021:28): [True: 1.59k, False: 834] ------------------ 1022| 1.59k| if (Mutating) ------------------ | Branch (1022:25): [Folded - Ignored] ------------------ 1023| 1.59k| pos.visit(dec_right_visitor{}, count_t{1}); 1024| 1.59k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1025| 1.59k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1025:28): [Folded - Ignored] | Branch (1025:40): [True: 0, False: 0] | Branch (1025:52): [True: 0, False: 0] ------------------ 1026| 0| auto newn = pos.node()->inner()[0]; 1027| 0| if (!mutate) ------------------ | Branch (1027:25): [True: 0, False: 0] ------------------ 1028| 0| newn->inc(); 1029| 0| if (Mutating) ------------------ | Branch (1029:25): [Folded - Ignored] ------------------ 1030| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1031| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1032| 834| } else { 1033| 834| if (mutate) { ------------------ | Branch (1033:25): [True: 588, False: 246] ------------------ 1034| 588| pos.each_right(dec_visitor{}, idx + 1); 1035| 588| return std::make_tuple(pos.shift(), node, ts, tail); 1036| 588| } else { 1037| 246| auto newn = node_t::copy_inner_e(e, node, idx); 1038| 246| if (Mutating) ------------------ | Branch (1038:29): [Folded - Ignored] ------------------ 1039| 246| pos.visit(dec_visitor{}); 1040| 246| return std::make_tuple(pos.shift(), newn, ts, tail); 1041| 246| } 1042| 834| } 1043| 3.93k| } 1044| 3.93k| IMMER_CATCH (...) { 1045| 0| assert(!mutate); 1046| 0| assert(!next || pos.shift() > BL); 1047| 0| assert(tail); 1048| 0| if (next) ------------------ | Branch (1048:21): [True: 0, False: 0] ------------------ 1049| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1050| 0| dec_leaf(tail, ts); 1051| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1052| 0| } 1053| 3.93k| } 1054| 3.93k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 877| 1.59k| { 878| 1.59k| using node_t = node_type; 879| 1.59k| auto node = p.node(); 880| 1.59k| if (node->dec()) { ------------------ | Branch (880:13): [True: 1.38k, False: 209] ------------------ 881| 1.38k| p.each_right(dec_t{}, idx); 882| 1.38k| node_t::delete_inner(node, p.count()); 883| 1.38k| } 884| 1.59k| } _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: 1058| 2.68k| { 1059| 2.68k| auto old_tail_size = pos.count(); 1060| 2.68k| auto new_tail_size = pos.index(last) + 1; 1061| 2.68k| auto node = pos.node(); 1062| 2.68k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1062:30): [Folded - Ignored] | Branch (1062:42): [True: 0, False: 0] ------------------ 1063| 2.68k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1063:13): [True: 520, False: 2.16k] ------------------ 1064| 520| if (!Mutating) ------------------ | Branch (1064:17): [Folded - Ignored] ------------------ 1065| 520| node->inc(); 1066| 520| return std::make_tuple(0, nullptr, new_tail_size, node); 1067| 2.16k| } else if (mutate) { ------------------ | Branch (1067:20): [True: 0, False: 2.16k] ------------------ 1068| 0| detail::destroy_n(node->leaf() + new_tail_size, 1069| 0| old_tail_size - new_tail_size); 1070| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1071| 2.16k| } else { 1072| 2.16k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1073| 2.16k| if (Mutating) ------------------ | Branch (1073:17): [Folded - Ignored] ------------------ 1074| 0| pos.visit(dec_visitor{}); 1075| 2.16k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1076| 2.16k| } 1077| 2.68k| } _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: 990| 3.58k| { 991| 3.58k| auto idx = pos.index(last); 992| 3.58k| auto node = pos.node(); 993| 3.58k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (993:23): [Folded - Ignored] | Branch (993:35): [True: 0, False: 0] ------------------ 994| 3.58k| if (Collapse && idx == 0) { ------------------ | Branch (994:13): [Folded - Ignored] | Branch (994:25): [True: 0, False: 0] ------------------ 995| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (995:24): [True: 0, False: 0] ------------------ 996| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 997| 0| if (Mutating) ------------------ | Branch (997:17): [Folded - Ignored] ------------------ 998| 0| pos.visit(dec_right_visitor{}, count_t{1}); 999| 0| return res; 1000| 3.58k| } else { 1001| 3.58k| using std::get; 1002| 3.58k| auto subs = 1003| 3.58k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1003:17): [True: 0, False: 3.58k] ------------------ 1004| 3.58k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1005| 3.58k| auto next = get<1>(subs); 1006| 3.58k| auto ts = get<2>(subs); 1007| 3.58k| auto tail = get<3>(subs); 1008| 3.58k| IMMER_TRY { ------------------ | | 41| 3.58k|#define IMMER_TRY try ------------------ 1009| 3.58k| if (next) { ------------------ | Branch (1009:21): [True: 944, False: 2.63k] ------------------ 1010| 944| if (mutate) { ------------------ | Branch (1010:25): [True: 0, False: 944] ------------------ 1011| 0| node->inner()[idx] = next; 1012| 0| pos.each_right(dec_visitor{}, idx + 1); 1013| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1014| 944| } else { 1015| 944| auto newn = node_t::copy_inner_e(e, node, idx); 1016| 944| newn->inner()[idx] = next; 1017| 944| if (Mutating) ------------------ | Branch (1017:29): [Folded - Ignored] ------------------ 1018| 0| pos.visit(dec_visitor{}); 1019| 944| return std::make_tuple(pos.shift(), newn, ts, tail); 1020| 944| } 1021| 2.63k| } else if (idx == 0) { ------------------ | Branch (1021:28): [True: 1.17k, False: 1.46k] ------------------ 1022| 1.17k| if (Mutating) ------------------ | Branch (1022:25): [Folded - Ignored] ------------------ 1023| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1024| 1.17k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1025| 1.46k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1025:28): [Folded - Ignored] | Branch (1025:40): [True: 0, False: 0] | Branch (1025:52): [True: 0, False: 0] ------------------ 1026| 0| auto newn = pos.node()->inner()[0]; 1027| 0| if (!mutate) ------------------ | Branch (1027:25): [True: 0, False: 0] ------------------ 1028| 0| newn->inc(); 1029| 0| if (Mutating) ------------------ | Branch (1029:25): [Folded - Ignored] ------------------ 1030| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1031| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1032| 1.46k| } else { 1033| 1.46k| if (mutate) { ------------------ | Branch (1033:25): [True: 0, False: 1.46k] ------------------ 1034| 0| pos.each_right(dec_visitor{}, idx + 1); 1035| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1036| 1.46k| } else { 1037| 1.46k| auto newn = node_t::copy_inner_e(e, node, idx); 1038| 1.46k| if (Mutating) ------------------ | Branch (1038:29): [Folded - Ignored] ------------------ 1039| 0| pos.visit(dec_visitor{}); 1040| 1.46k| return std::make_tuple(pos.shift(), newn, ts, tail); 1041| 1.46k| } 1042| 1.46k| } 1043| 3.58k| } 1044| 3.58k| IMMER_CATCH (...) { 1045| 0| assert(!mutate); 1046| 0| assert(!next || pos.shift() > BL); 1047| 0| assert(tail); 1048| 0| if (next) ------------------ | Branch (1048:21): [True: 0, False: 0] ------------------ 1049| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1050| 0| dec_leaf(tail, ts); 1051| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1052| 0| } 1053| 3.58k| } 1054| 3.58k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 866| 25.4k| { 867| 25.4k| using node_t = node_type; 868| 25.4k| auto node = p.node(); 869| 25.4k| if (node->dec()) { ------------------ | Branch (869:13): [True: 18.9k, False: 6.49k] ------------------ 870| 18.9k| p.each_right(dec_t{}, idx); 871| 18.9k| node_t::delete_inner_r(node, p.count()); 872| 18.9k| } 873| 25.4k| } _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: 1058| 1.90k| { 1059| 1.90k| auto old_tail_size = pos.count(); 1060| 1.90k| auto new_tail_size = pos.index(last) + 1; 1061| 1.90k| auto node = pos.node(); 1062| 1.90k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1062:30): [Folded - Ignored] | Branch (1062:42): [True: 282, False: 1.62k] ------------------ 1063| 1.90k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1063:13): [True: 442, False: 1.46k] ------------------ 1064| 442| if (!Mutating) ------------------ | Branch (1064:17): [Folded - Ignored] ------------------ 1065| 0| node->inc(); 1066| 442| return std::make_tuple(0, nullptr, new_tail_size, node); 1067| 1.46k| } else if (mutate) { ------------------ | Branch (1067:20): [True: 260, False: 1.20k] ------------------ 1068| 260| detail::destroy_n(node->leaf() + new_tail_size, 1069| 260| old_tail_size - new_tail_size); 1070| 260| return std::make_tuple(0, nullptr, new_tail_size, node); 1071| 1.20k| } else { 1072| 1.20k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1073| 1.20k| if (Mutating) ------------------ | Branch (1073:17): [Folded - Ignored] ------------------ 1074| 1.20k| pos.visit(dec_visitor{}); 1075| 1.20k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1076| 1.20k| } 1077| 1.90k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 912| 2.91k| { 913| 2.91k| auto idx = pos.index(last); 914| 2.91k| auto node = pos.node(); 915| 2.91k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (915:23): [Folded - Ignored] | Branch (915:35): [True: 1.75k, False: 1.15k] ------------------ 916| 2.91k| if (Collapse && idx == 0) { ------------------ | Branch (916:13): [Folded - Ignored] | Branch (916:25): [True: 0, False: 0] ------------------ 917| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (917:24): [True: 0, False: 0] ------------------ 918| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 919| 0| if (Mutating) ------------------ | Branch (919:17): [Folded - Ignored] ------------------ 920| 0| pos.visit(dec_right_visitor{}, count_t{1}); 921| 0| return res; 922| 2.91k| } else { 923| 2.91k| using std::get; 924| 2.91k| auto subs = 925| 2.91k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (925:17): [True: 1.75k, False: 1.15k] ------------------ 926| 2.91k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 927| 2.91k| auto next = get<1>(subs); 928| 2.91k| auto ts = get<2>(subs); 929| 2.91k| auto tail = get<3>(subs); 930| 2.91k| IMMER_TRY { ------------------ | | 41| 2.91k|#define IMMER_TRY try ------------------ 931| 2.91k| if (next) { ------------------ | Branch (931:21): [True: 698, False: 2.21k] ------------------ 932| 698| if (mutate) { ------------------ | Branch (932:25): [True: 404, False: 294] ------------------ 933| 404| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 934| 404| pos.each_right(dec_visitor{}, idx + 1); 935| 404| node->inner()[idx] = next; 936| 404| nodr->d.sizes[idx] = last + 1 - ts; 937| 404| nodr->d.count = idx + 1; 938| 404| assert(nodr->d.sizes[idx]); 939| 0| return std::make_tuple(pos.shift(), node, ts, tail); 940| 404| } else { 941| 294| auto newn = node_t::copy_inner_r_e(e, node, idx); 942| 294| auto newr = newn->relaxed(); 943| 294| newn->inner()[idx] = next; 944| 294| newr->d.sizes[idx] = last + 1 - ts; 945| 294| newr->d.count = idx + 1; 946| 294| assert(newr->d.sizes[idx]); 947| 294| if (Mutating) ------------------ | Branch (947:29): [Folded - Ignored] ------------------ 948| 294| pos.visit(dec_visitor{}); 949| 294| return std::make_tuple(pos.shift(), newn, ts, tail); 950| 294| } 951| 2.21k| } else if (idx == 0) { ------------------ | Branch (951:28): [True: 696, False: 1.52k] ------------------ 952| 696| if (Mutating) ------------------ | Branch (952:25): [Folded - Ignored] ------------------ 953| 696| pos.visit(dec_right_visitor{}, count_t{1}); 954| 696| return std::make_tuple(pos.shift(), nullptr, ts, tail); 955| 1.52k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (955:28): [Folded - Ignored] | Branch (955:40): [True: 0, False: 0] | Branch (955:52): [True: 0, False: 0] ------------------ 956| 0| auto newn = pos.node()->inner()[0]; 957| 0| if (!mutate) ------------------ | Branch (957:25): [True: 0, False: 0] ------------------ 958| 0| newn->inc(); 959| 0| if (Mutating) ------------------ | Branch (959:25): [Folded - Ignored] ------------------ 960| 0| pos.visit(dec_right_visitor{}, count_t{2}); 961| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 962| 1.52k| } else { 963| 1.52k| if (mutate) { ------------------ | Branch (963:25): [True: 942, False: 581] ------------------ 964| 942| pos.each_right(dec_visitor{}, idx + 1); 965| 942| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 966| 942| return std::make_tuple(pos.shift(), node, ts, tail); 967| 942| } else { 968| 581| auto newn = node_t::copy_inner_r_e(e, node, idx); 969| 581| if (Mutating) ------------------ | Branch (969:29): [Folded - Ignored] ------------------ 970| 581| pos.visit(dec_visitor{}); 971| 581| return std::make_tuple(pos.shift(), newn, ts, tail); 972| 581| } 973| 1.52k| } 974| 2.91k| } 975| 2.91k| IMMER_CATCH (...) { 976| 0| assert(!mutate); 977| 0| assert(!next || pos.shift() > BL); 978| 0| if (next) ------------------ | Branch (978:21): [True: 0, False: 0] ------------------ 979| 0| dec_inner(next, 980| 0| pos.shift() - B, 981| 0| last + 1 - ts - pos.size_before(idx)); 982| 0| dec_leaf(tail, ts); 983| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 984| 0| } 985| 2.91k| } 986| 2.91k| } _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: 990| 5.01k| { 991| 5.01k| auto idx = pos.index(last); 992| 5.01k| auto node = pos.node(); 993| 5.01k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (993:23): [Folded - Ignored] | Branch (993:35): [True: 3.61k, False: 1.40k] ------------------ 994| 5.01k| if (Collapse && idx == 0) { ------------------ | Branch (994:13): [Folded - Ignored] | Branch (994:25): [True: 0, False: 0] ------------------ 995| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (995:24): [True: 0, False: 0] ------------------ 996| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 997| 0| if (Mutating) ------------------ | Branch (997:17): [Folded - Ignored] ------------------ 998| 0| pos.visit(dec_right_visitor{}, count_t{1}); 999| 0| return res; 1000| 5.01k| } else { 1001| 5.01k| using std::get; 1002| 5.01k| auto subs = 1003| 5.01k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1003:17): [True: 3.61k, False: 1.40k] ------------------ 1004| 5.01k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1005| 5.01k| auto next = get<1>(subs); 1006| 5.01k| auto ts = get<2>(subs); 1007| 5.01k| auto tail = get<3>(subs); 1008| 5.01k| IMMER_TRY { ------------------ | | 41| 5.01k|#define IMMER_TRY try ------------------ 1009| 5.01k| if (next) { ------------------ | Branch (1009:21): [True: 3.25k, False: 1.75k] ------------------ 1010| 3.25k| if (mutate) { ------------------ | Branch (1010:25): [True: 2.67k, False: 586] ------------------ 1011| 2.67k| node->inner()[idx] = next; 1012| 2.67k| pos.each_right(dec_visitor{}, idx + 1); 1013| 2.67k| return std::make_tuple(pos.shift(), node, ts, tail); 1014| 2.67k| } else { 1015| 586| auto newn = node_t::copy_inner_e(e, node, idx); 1016| 586| newn->inner()[idx] = next; 1017| 586| if (Mutating) ------------------ | Branch (1017:29): [Folded - Ignored] ------------------ 1018| 586| pos.visit(dec_visitor{}); 1019| 586| return std::make_tuple(pos.shift(), newn, ts, tail); 1020| 586| } 1021| 3.25k| } else if (idx == 0) { ------------------ | Branch (1021:28): [True: 1.06k, False: 694] ------------------ 1022| 1.06k| if (Mutating) ------------------ | Branch (1022:25): [Folded - Ignored] ------------------ 1023| 1.06k| pos.visit(dec_right_visitor{}, count_t{1}); 1024| 1.06k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1025| 1.06k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1025:28): [Folded - Ignored] | Branch (1025:40): [True: 0, False: 0] | Branch (1025:52): [True: 0, False: 0] ------------------ 1026| 0| auto newn = pos.node()->inner()[0]; 1027| 0| if (!mutate) ------------------ | Branch (1027:25): [True: 0, False: 0] ------------------ 1028| 0| newn->inc(); 1029| 0| if (Mutating) ------------------ | Branch (1029:25): [Folded - Ignored] ------------------ 1030| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1031| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1032| 694| } else { 1033| 694| if (mutate) { ------------------ | Branch (1033:25): [True: 318, False: 376] ------------------ 1034| 318| pos.each_right(dec_visitor{}, idx + 1); 1035| 318| return std::make_tuple(pos.shift(), node, ts, tail); 1036| 376| } else { 1037| 376| auto newn = node_t::copy_inner_e(e, node, idx); 1038| 376| if (Mutating) ------------------ | Branch (1038:29): [Folded - Ignored] ------------------ 1039| 376| pos.visit(dec_visitor{}); 1040| 376| return std::make_tuple(pos.shift(), newn, ts, tail); 1041| 376| } 1042| 694| } 1043| 5.01k| } 1044| 5.01k| IMMER_CATCH (...) { 1045| 0| assert(!mutate); 1046| 0| assert(!next || pos.shift() > BL); 1047| 0| assert(tail); 1048| 0| if (next) ------------------ | Branch (1048:21): [True: 0, False: 0] ------------------ 1049| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1050| 0| dec_leaf(tail, ts); 1051| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1052| 0| } 1053| 5.01k| } 1054| 5.01k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 877| 10.5k| { 878| 10.5k| using node_t = node_type; 879| 10.5k| auto node = p.node(); 880| 10.5k| if (node->dec()) { ------------------ | Branch (880:13): [True: 7.54k, False: 2.98k] ------------------ 881| 7.54k| p.each_right(dec_t{}, idx); 882| 7.54k| node_t::delete_inner(node, p.count()); 883| 7.54k| } 884| 10.5k| } _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: 1058| 5.13k| { 1059| 5.13k| auto old_tail_size = pos.count(); 1060| 5.13k| auto new_tail_size = pos.index(last) + 1; 1061| 5.13k| auto node = pos.node(); 1062| 5.13k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1062:30): [Folded - Ignored] | Branch (1062:42): [True: 0, False: 0] ------------------ 1063| 5.13k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1063:13): [True: 1.31k, False: 3.81k] ------------------ 1064| 1.31k| if (!Mutating) ------------------ | Branch (1064:17): [Folded - Ignored] ------------------ 1065| 1.31k| node->inc(); 1066| 1.31k| return std::make_tuple(0, nullptr, new_tail_size, node); 1067| 3.81k| } else if (mutate) { ------------------ | Branch (1067:20): [True: 0, False: 3.81k] ------------------ 1068| 0| detail::destroy_n(node->leaf() + new_tail_size, 1069| 0| old_tail_size - new_tail_size); 1070| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1071| 3.81k| } else { 1072| 3.81k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1073| 3.81k| if (Mutating) ------------------ | Branch (1073:17): [Folded - Ignored] ------------------ 1074| 0| pos.visit(dec_visitor{}); 1075| 3.81k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1076| 3.81k| } 1077| 5.13k| } _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: 912| 4.10k| { 913| 4.10k| auto idx = pos.index(last); 914| 4.10k| auto node = pos.node(); 915| 4.10k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (915:23): [Folded - Ignored] | Branch (915:35): [True: 0, False: 0] ------------------ 916| 4.10k| if (Collapse && idx == 0) { ------------------ | Branch (916:13): [Folded - Ignored] | Branch (916:25): [True: 0, False: 0] ------------------ 917| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (917:24): [True: 0, False: 0] ------------------ 918| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 919| 0| if (Mutating) ------------------ | Branch (919:17): [Folded - Ignored] ------------------ 920| 0| pos.visit(dec_right_visitor{}, count_t{1}); 921| 0| return res; 922| 4.10k| } else { 923| 4.10k| using std::get; 924| 4.10k| auto subs = 925| 4.10k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (925:17): [True: 0, False: 4.10k] ------------------ 926| 4.10k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 927| 4.10k| auto next = get<1>(subs); 928| 4.10k| auto ts = get<2>(subs); 929| 4.10k| auto tail = get<3>(subs); 930| 4.10k| IMMER_TRY { ------------------ | | 41| 4.10k|#define IMMER_TRY try ------------------ 931| 4.10k| if (next) { ------------------ | Branch (931:21): [True: 872, False: 3.23k] ------------------ 932| 872| if (mutate) { ------------------ | Branch (932:25): [True: 0, False: 872] ------------------ 933| 0| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 934| 0| pos.each_right(dec_visitor{}, idx + 1); 935| 0| node->inner()[idx] = next; 936| 0| nodr->d.sizes[idx] = last + 1 - ts; 937| 0| nodr->d.count = idx + 1; 938| 0| assert(nodr->d.sizes[idx]); 939| 0| return std::make_tuple(pos.shift(), node, ts, tail); 940| 872| } else { 941| 872| auto newn = node_t::copy_inner_r_e(e, node, idx); 942| 872| auto newr = newn->relaxed(); 943| 872| newn->inner()[idx] = next; 944| 872| newr->d.sizes[idx] = last + 1 - ts; 945| 872| newr->d.count = idx + 1; 946| 872| assert(newr->d.sizes[idx]); 947| 872| if (Mutating) ------------------ | Branch (947:29): [Folded - Ignored] ------------------ 948| 0| pos.visit(dec_visitor{}); 949| 872| return std::make_tuple(pos.shift(), newn, ts, tail); 950| 872| } 951| 3.23k| } else if (idx == 0) { ------------------ | Branch (951:28): [True: 993, False: 2.24k] ------------------ 952| 993| if (Mutating) ------------------ | Branch (952:25): [Folded - Ignored] ------------------ 953| 0| pos.visit(dec_right_visitor{}, count_t{1}); 954| 993| return std::make_tuple(pos.shift(), nullptr, ts, tail); 955| 2.24k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (955:28): [Folded - Ignored] | Branch (955:40): [True: 0, False: 0] | Branch (955:52): [True: 0, False: 0] ------------------ 956| 0| auto newn = pos.node()->inner()[0]; 957| 0| if (!mutate) ------------------ | Branch (957:25): [True: 0, False: 0] ------------------ 958| 0| newn->inc(); 959| 0| if (Mutating) ------------------ | Branch (959:25): [Folded - Ignored] ------------------ 960| 0| pos.visit(dec_right_visitor{}, count_t{2}); 961| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 962| 2.24k| } else { 963| 2.24k| if (mutate) { ------------------ | Branch (963:25): [True: 0, False: 2.24k] ------------------ 964| 0| pos.each_right(dec_visitor{}, idx + 1); 965| 0| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 966| 0| return std::make_tuple(pos.shift(), node, ts, tail); 967| 2.24k| } else { 968| 2.24k| auto newn = node_t::copy_inner_r_e(e, node, idx); 969| 2.24k| if (Mutating) ------------------ | Branch (969:29): [Folded - Ignored] ------------------ 970| 0| pos.visit(dec_visitor{}); 971| 2.24k| return std::make_tuple(pos.shift(), newn, ts, tail); 972| 2.24k| } 973| 2.24k| } 974| 4.10k| } 975| 4.10k| IMMER_CATCH (...) { 976| 0| assert(!mutate); 977| 0| assert(!next || pos.shift() > BL); 978| 0| if (next) ------------------ | Branch (978:21): [True: 0, False: 0] ------------------ 979| 0| dec_inner(next, 980| 0| pos.shift() - B, 981| 0| last + 1 - ts - pos.size_before(idx)); 982| 0| dec_leaf(tail, ts); 983| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 984| 0| } 985| 4.10k| } 986| 4.10k| } _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: 990| 3.71k| { 991| 3.71k| auto idx = pos.index(last); 992| 3.71k| auto node = pos.node(); 993| 3.71k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (993:23): [Folded - Ignored] | Branch (993:35): [True: 0, False: 0] ------------------ 994| 3.71k| if (Collapse && idx == 0) { ------------------ | Branch (994:13): [Folded - Ignored] | Branch (994:25): [True: 0, False: 0] ------------------ 995| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (995:24): [True: 0, False: 0] ------------------ 996| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 997| 0| if (Mutating) ------------------ | Branch (997:17): [Folded - Ignored] ------------------ 998| 0| pos.visit(dec_right_visitor{}, count_t{1}); 999| 0| return res; 1000| 3.71k| } else { 1001| 3.71k| using std::get; 1002| 3.71k| auto subs = 1003| 3.71k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1003:17): [True: 0, False: 3.71k] ------------------ 1004| 3.71k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1005| 3.71k| auto next = get<1>(subs); 1006| 3.71k| auto ts = get<2>(subs); 1007| 3.71k| auto tail = get<3>(subs); 1008| 3.71k| IMMER_TRY { ------------------ | | 41| 3.71k|#define IMMER_TRY try ------------------ 1009| 3.71k| if (next) { ------------------ | Branch (1009:21): [True: 2.22k, False: 1.48k] ------------------ 1010| 2.22k| if (mutate) { ------------------ | Branch (1010:25): [True: 0, False: 2.22k] ------------------ 1011| 0| node->inner()[idx] = next; 1012| 0| pos.each_right(dec_visitor{}, idx + 1); 1013| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1014| 2.22k| } else { 1015| 2.22k| auto newn = node_t::copy_inner_e(e, node, idx); 1016| 2.22k| newn->inner()[idx] = next; 1017| 2.22k| if (Mutating) ------------------ | Branch (1017:29): [Folded - Ignored] ------------------ 1018| 0| pos.visit(dec_visitor{}); 1019| 2.22k| return std::make_tuple(pos.shift(), newn, ts, tail); 1020| 2.22k| } 1021| 2.22k| } else if (idx == 0) { ------------------ | Branch (1021:28): [True: 1.07k, False: 417] ------------------ 1022| 1.07k| if (Mutating) ------------------ | Branch (1022:25): [Folded - Ignored] ------------------ 1023| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1024| 1.07k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1025| 1.07k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1025:28): [Folded - Ignored] | Branch (1025:40): [True: 0, False: 0] | Branch (1025:52): [True: 0, False: 0] ------------------ 1026| 0| auto newn = pos.node()->inner()[0]; 1027| 0| if (!mutate) ------------------ | Branch (1027:25): [True: 0, False: 0] ------------------ 1028| 0| newn->inc(); 1029| 0| if (Mutating) ------------------ | Branch (1029:25): [Folded - Ignored] ------------------ 1030| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1031| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1032| 417| } else { 1033| 417| if (mutate) { ------------------ | Branch (1033:25): [True: 0, False: 417] ------------------ 1034| 0| pos.each_right(dec_visitor{}, idx + 1); 1035| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1036| 417| } else { 1037| 417| auto newn = node_t::copy_inner_e(e, node, idx); 1038| 417| if (Mutating) ------------------ | Branch (1038:29): [Folded - Ignored] ------------------ 1039| 0| pos.visit(dec_visitor{}); 1040| 417| return std::make_tuple(pos.shift(), newn, ts, tail); 1041| 417| } 1042| 417| } 1043| 3.71k| } 1044| 3.71k| IMMER_CATCH (...) { 1045| 0| assert(!mutate); 1046| 0| assert(!next || pos.shift() > BL); 1047| 0| assert(tail); 1048| 0| if (next) ------------------ | Branch (1048:21): [True: 0, False: 0] ------------------ 1049| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1050| 0| dec_leaf(tail, ts); 1051| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1052| 0| } 1053| 3.71k| } 1054| 3.71k| } _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: 990| 12.4k| { 991| 12.4k| auto idx = pos.index(last); 992| 12.4k| auto node = pos.node(); 993| 12.4k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (993:23): [Folded - Ignored] | Branch (993:35): [True: 8.76k, False: 3.63k] ------------------ 994| 12.4k| if (Collapse && idx == 0) { ------------------ | Branch (994:13): [Folded - Ignored] | Branch (994:25): [True: 7.19k, False: 5.21k] ------------------ 995| 7.19k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (995:24): [True: 5.23k, False: 1.95k] ------------------ 996| 7.19k| : pos.towards_oh(no_mut_t{}, last, idx, e); 997| 7.19k| if (Mutating) ------------------ | Branch (997:17): [Folded - Ignored] ------------------ 998| 7.19k| pos.visit(dec_right_visitor{}, count_t{1}); 999| 7.19k| return res; 1000| 7.19k| } else { 1001| 5.21k| using std::get; 1002| 5.21k| auto subs = 1003| 5.21k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1003:17): [True: 3.53k, False: 1.67k] ------------------ 1004| 5.21k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1005| 5.21k| auto next = get<1>(subs); 1006| 5.21k| auto ts = get<2>(subs); 1007| 5.21k| auto tail = get<3>(subs); 1008| 5.21k| IMMER_TRY { ------------------ | | 41| 5.21k|#define IMMER_TRY try ------------------ 1009| 5.21k| if (next) { ------------------ | Branch (1009:21): [True: 1.24k, False: 3.97k] ------------------ 1010| 1.24k| if (mutate) { ------------------ | Branch (1010:25): [True: 705, False: 535] ------------------ 1011| 705| node->inner()[idx] = next; 1012| 705| pos.each_right(dec_visitor{}, idx + 1); 1013| 705| return std::make_tuple(pos.shift(), node, ts, tail); 1014| 705| } else { 1015| 535| auto newn = node_t::copy_inner_e(e, node, idx); 1016| 535| newn->inner()[idx] = next; 1017| 535| if (Mutating) ------------------ | Branch (1017:29): [Folded - Ignored] ------------------ 1018| 535| pos.visit(dec_visitor{}); 1019| 535| return std::make_tuple(pos.shift(), newn, ts, tail); 1020| 535| } 1021| 3.97k| } else if (idx == 0) { ------------------ | Branch (1021:28): [True: 0, False: 3.97k] ------------------ 1022| 0| if (Mutating) ------------------ | Branch (1022:25): [Folded - Ignored] ------------------ 1023| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1024| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1025| 3.97k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1025:28): [Folded - Ignored] | Branch (1025:40): [True: 3.45k, False: 511] | Branch (1025:52): [True: 2.27k, False: 1.18k] ------------------ 1026| 2.27k| auto newn = pos.node()->inner()[0]; 1027| 2.27k| if (!mutate) ------------------ | Branch (1027:25): [True: 592, False: 1.68k] ------------------ 1028| 592| newn->inc(); 1029| 2.27k| if (Mutating) ------------------ | Branch (1029:25): [Folded - Ignored] ------------------ 1030| 2.27k| pos.visit(dec_right_visitor{}, count_t{2}); 1031| 2.27k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1032| 2.27k| } else { 1033| 1.69k| if (mutate) { ------------------ | Branch (1033:25): [True: 1.14k, False: 552] ------------------ 1034| 1.14k| pos.each_right(dec_visitor{}, idx + 1); 1035| 1.14k| return std::make_tuple(pos.shift(), node, ts, tail); 1036| 1.14k| } else { 1037| 552| auto newn = node_t::copy_inner_e(e, node, idx); 1038| 552| if (Mutating) ------------------ | Branch (1038:29): [Folded - Ignored] ------------------ 1039| 552| pos.visit(dec_visitor{}); 1040| 552| return std::make_tuple(pos.shift(), newn, ts, tail); 1041| 552| } 1042| 1.69k| } 1043| 5.21k| } 1044| 5.21k| IMMER_CATCH (...) { 1045| 0| assert(!mutate); 1046| 0| assert(!next || pos.shift() > BL); 1047| 0| assert(tail); 1048| 0| if (next) ------------------ | Branch (1048:21): [True: 0, False: 0] ------------------ 1049| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1050| 0| dec_leaf(tail, ts); 1051| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1052| 0| } 1053| 5.21k| } 1054| 12.4k| } _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: 1058| 1.71k| { 1059| 1.71k| auto old_tail_size = pos.count(); 1060| 1.71k| auto new_tail_size = pos.index(last) + 1; 1061| 1.71k| auto node = pos.node(); 1062| 1.71k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1062:30): [Folded - Ignored] | Branch (1062:42): [True: 648, False: 1.07k] ------------------ 1063| 1.71k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1063:13): [True: 269, False: 1.44k] ------------------ 1064| 269| if (!Mutating) ------------------ | Branch (1064:17): [Folded - Ignored] ------------------ 1065| 0| node->inc(); 1066| 269| return std::make_tuple(0, nullptr, new_tail_size, node); 1067| 1.44k| } else if (mutate) { ------------------ | Branch (1067:20): [True: 646, False: 803] ------------------ 1068| 646| detail::destroy_n(node->leaf() + new_tail_size, 1069| 646| old_tail_size - new_tail_size); 1070| 646| return std::make_tuple(0, nullptr, new_tail_size, node); 1071| 803| } else { 1072| 803| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1073| 803| if (Mutating) ------------------ | Branch (1073:17): [Folded - Ignored] ------------------ 1074| 803| pos.visit(dec_visitor{}); 1075| 803| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1076| 803| } 1077| 1.71k| } _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: 990| 3.88k| { 991| 3.88k| auto idx = pos.index(last); 992| 3.88k| auto node = pos.node(); 993| 3.88k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (993:23): [Folded - Ignored] | Branch (993:35): [True: 2.15k, False: 1.73k] ------------------ 994| 3.88k| if (Collapse && idx == 0) { ------------------ | Branch (994:13): [Folded - Ignored] | Branch (994:25): [True: 1.91k, False: 1.97k] ------------------ 995| 1.91k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (995:24): [True: 1.23k, False: 675] ------------------ 996| 1.91k| : pos.towards_oh(no_mut_t{}, last, idx, e); 997| 1.91k| if (Mutating) ------------------ | Branch (997:17): [Folded - Ignored] ------------------ 998| 1.91k| pos.visit(dec_right_visitor{}, count_t{1}); 999| 1.91k| return res; 1000| 1.97k| } else { 1001| 1.97k| using std::get; 1002| 1.97k| auto subs = 1003| 1.97k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1003:17): [True: 916, False: 1.05k] ------------------ 1004| 1.97k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1005| 1.97k| auto next = get<1>(subs); 1006| 1.97k| auto ts = get<2>(subs); 1007| 1.97k| auto tail = get<3>(subs); 1008| 1.97k| IMMER_TRY { ------------------ | | 41| 1.97k|#define IMMER_TRY try ------------------ 1009| 1.97k| if (next) { ------------------ | Branch (1009:21): [True: 458, False: 1.51k] ------------------ 1010| 458| if (mutate) { ------------------ | Branch (1010:25): [True: 197, False: 261] ------------------ 1011| 197| node->inner()[idx] = next; 1012| 197| pos.each_right(dec_visitor{}, idx + 1); 1013| 197| return std::make_tuple(pos.shift(), node, ts, tail); 1014| 261| } else { 1015| 261| auto newn = node_t::copy_inner_e(e, node, idx); 1016| 261| newn->inner()[idx] = next; 1017| 261| if (Mutating) ------------------ | Branch (1017:29): [Folded - Ignored] ------------------ 1018| 261| pos.visit(dec_visitor{}); 1019| 261| return std::make_tuple(pos.shift(), newn, ts, tail); 1020| 261| } 1021| 1.51k| } else if (idx == 0) { ------------------ | Branch (1021:28): [True: 0, False: 1.51k] ------------------ 1022| 0| if (Mutating) ------------------ | Branch (1022:25): [Folded - Ignored] ------------------ 1023| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1024| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1025| 1.51k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1025:28): [Folded - Ignored] | Branch (1025:40): [True: 678, False: 835] | Branch (1025:52): [True: 456, False: 222] ------------------ 1026| 456| auto newn = pos.node()->inner()[0]; 1027| 456| if (!mutate) ------------------ | Branch (1027:25): [True: 258, False: 198] ------------------ 1028| 258| newn->inc(); 1029| 456| if (Mutating) ------------------ | Branch (1029:25): [Folded - Ignored] ------------------ 1030| 456| pos.visit(dec_right_visitor{}, count_t{2}); 1031| 456| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1032| 1.05k| } else { 1033| 1.05k| if (mutate) { ------------------ | Branch (1033:25): [True: 521, False: 536] ------------------ 1034| 521| pos.each_right(dec_visitor{}, idx + 1); 1035| 521| return std::make_tuple(pos.shift(), node, ts, tail); 1036| 536| } else { 1037| 536| auto newn = node_t::copy_inner_e(e, node, idx); 1038| 536| if (Mutating) ------------------ | Branch (1038:29): [Folded - Ignored] ------------------ 1039| 536| pos.visit(dec_visitor{}); 1040| 536| return std::make_tuple(pos.shift(), newn, ts, tail); 1041| 536| } 1042| 1.05k| } 1043| 1.97k| } 1044| 1.97k| IMMER_CATCH (...) { 1045| 0| assert(!mutate); 1046| 0| assert(!next || pos.shift() > BL); 1047| 0| assert(tail); 1048| 0| if (next) ------------------ | Branch (1048:21): [True: 0, False: 0] ------------------ 1049| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1050| 0| dec_leaf(tail, ts); 1051| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1052| 0| } 1053| 1.97k| } 1054| 3.88k| } _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: 1058| 871| { 1059| 871| auto old_tail_size = pos.count(); 1060| 871| auto new_tail_size = pos.index(last) + 1; 1061| 871| auto node = pos.node(); 1062| 871| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1062:30): [Folded - Ignored] | Branch (1062:42): [True: 224, False: 647] ------------------ 1063| 871| if (new_tail_size == old_tail_size) { ------------------ | Branch (1063:13): [True: 257, False: 614] ------------------ 1064| 257| if (!Mutating) ------------------ | Branch (1064:17): [Folded - Ignored] ------------------ 1065| 0| node->inc(); 1066| 257| return std::make_tuple(0, nullptr, new_tail_size, node); 1067| 614| } else if (mutate) { ------------------ | Branch (1067:20): [True: 224, False: 390] ------------------ 1068| 224| detail::destroy_n(node->leaf() + new_tail_size, 1069| 224| old_tail_size - new_tail_size); 1070| 224| return std::make_tuple(0, nullptr, new_tail_size, node); 1071| 390| } else { 1072| 390| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1073| 390| if (Mutating) ------------------ | Branch (1073:17): [Folded - Ignored] ------------------ 1074| 390| pos.visit(dec_visitor{}); 1075| 390| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1076| 390| } 1077| 871| } _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: 1376| 932| { 1377| 932| auto node = pos.node(); 1378| 932| auto idx = pos.index(first); 1379| 932| auto count = pos.count(); 1380| 932| auto mutate = Mutating && ------------------ | Branch (1380:23): [Folded - Ignored] ------------------ 1381| 932| std::is_nothrow_move_constructible::value && ------------------ | Branch (1381:23): [Folded - Ignored] ------------------ 1382| 932| node->can_mutate(e); ------------------ | Branch (1382:23): [True: 580, False: 352] ------------------ 1383| 932| if (mutate) { ------------------ | Branch (1383:13): [True: 580, False: 352] ------------------ 1384| 580| auto data = node->leaf(); 1385| 580| auto newcount = count - idx; 1386| 580| std::move(data + idx, data + count, data); 1387| 580| detail::destroy_n(data + newcount, idx); 1388| 580| return std::make_tuple(0, node); 1389| 580| } else { 1390| 352| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1391| 352| if (Mutating) ------------------ | Branch (1391:17): [Folded - Ignored] ------------------ 1392| 352| pos.visit(dec_visitor{}); 1393| 352| return std::make_tuple(0, newn); 1394| 352| } 1395| 932| } _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: 1245| 50.7k| { 1246| 50.7k| auto idx = pos.subindex(first); 1247| 50.7k| auto count = pos.count(); 1248| 50.7k| auto node = pos.node(); 1249| 50.7k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1249:35): [Folded - Ignored] | Branch (1249:47): [True: 43.4k, False: 7.22k] ------------------ 1250| 50.7k| auto left_size = pos.size_before(idx); 1251| 50.7k| auto child_size = pos.size_sbh(idx, left_size); 1252| 50.7k| auto dropped_size = first; 1253| 50.7k| auto child_dropped_size = dropped_size - left_size; 1254| 50.7k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1254:13): [Folded - Ignored] | Branch (1254:25): [True: 48.6k, False: 2.10k] | Branch (1254:45): [True: 4.52k, False: 44.0k] ------------------ 1255| 4.52k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1255:22): [True: 1.52k, False: 2.99k] ------------------ 1256| 4.52k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1257| 4.52k| if (mutate) ------------------ | Branch (1257:17): [True: 1.52k, False: 2.99k] ------------------ 1258| 1.52k| pos.visit(dec_left_visitor{}, idx); 1259| 2.99k| else if (Mutating) ------------------ | Branch (1259:22): [Folded - Ignored] ------------------ 1260| 2.99k| pos.visit(dec_visitor{}); 1261| 4.52k| return r; 1262| 46.1k| } else { 1263| 46.1k| using std::get; 1264| 46.1k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1264:29): [True: 41.9k, False: 4.22k] ------------------ 1265| 46.1k| : node_t::make_inner_r_e(e); 1266| 46.1k| auto newr = newn->relaxed(); 1267| 46.1k| auto newcount = count - idx; 1268| 46.1k| auto new_child_size = child_size - child_dropped_size; 1269| 46.1k| IMMER_TRY { ------------------ | | 41| 46.1k|#define IMMER_TRY try ------------------ 1270| 46.1k| auto subs = 1271| 46.1k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1271:21): [True: 41.9k, False: 4.22k] ------------------ 1272| 46.1k| : pos.towards_sub_oh( 1273| 4.22k| no_collapse_no_mut_t{}, first, idx, e); 1274| 46.1k| if (mutate) ------------------ | Branch (1274:21): [True: 41.9k, False: 4.22k] ------------------ 1275| 41.9k| pos.each_left(dec_visitor{}, idx); 1276| 46.1k| pos.copy_sizes( 1277| 46.1k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1278| 46.1k| std::copy(node->inner() + idx + 1, 1279| 46.1k| node->inner() + count, 1280| 46.1k| newn->inner() + 1); 1281| 46.1k| newn->inner()[0] = get<1>(subs); 1282| 46.1k| newr->d.sizes[0] = new_child_size; 1283| 46.1k| newr->d.count = newcount; 1284| 46.1k| assert(new_child_size); 1285| 46.1k| if (!mutate) { ------------------ | Branch (1285:21): [True: 4.22k, False: 41.9k] ------------------ 1286| 4.22k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1287| 4.22k| if (Mutating) ------------------ | Branch (1287:25): [Folded - Ignored] ------------------ 1288| 4.22k| pos.visit(dec_visitor{}); 1289| 4.22k| } 1290| 46.1k| return std::make_tuple(pos.shift(), newn); 1291| 46.1k| } 1292| 46.1k| IMMER_CATCH (...) { 1293| 0| if (!mutate) ------------------ | Branch (1293:21): [True: 0, False: 0] ------------------ 1294| 0| node_t::delete_inner_r_e(newn); 1295| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1296| 0| } 1297| 46.1k| } 1298| 50.7k| } _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: 1245| 2.52k| { 1246| 2.52k| auto idx = pos.subindex(first); 1247| 2.52k| auto count = pos.count(); 1248| 2.52k| auto node = pos.node(); 1249| 2.52k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1249:35): [Folded - Ignored] | Branch (1249:47): [True: 0, False: 0] ------------------ 1250| 2.52k| auto left_size = pos.size_before(idx); 1251| 2.52k| auto child_size = pos.size_sbh(idx, left_size); 1252| 2.52k| auto dropped_size = first; 1253| 2.52k| auto child_dropped_size = dropped_size - left_size; 1254| 2.52k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1254:13): [Folded - Ignored] | Branch (1254:25): [True: 1.09k, False: 1.43k] | Branch (1254:45): [True: 759, False: 337] ------------------ 1255| 759| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1255:22): [True: 0, False: 759] ------------------ 1256| 759| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1257| 759| if (mutate) ------------------ | Branch (1257:17): [True: 0, False: 759] ------------------ 1258| 0| pos.visit(dec_left_visitor{}, idx); 1259| 759| else if (Mutating) ------------------ | Branch (1259:22): [Folded - Ignored] ------------------ 1260| 0| pos.visit(dec_visitor{}); 1261| 759| return r; 1262| 1.77k| } else { 1263| 1.77k| using std::get; 1264| 1.77k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1264:29): [True: 0, False: 1.77k] ------------------ 1265| 1.77k| : node_t::make_inner_r_e(e); 1266| 1.77k| auto newr = newn->relaxed(); 1267| 1.77k| auto newcount = count - idx; 1268| 1.77k| auto new_child_size = child_size - child_dropped_size; 1269| 1.77k| IMMER_TRY { ------------------ | | 41| 1.77k|#define IMMER_TRY try ------------------ 1270| 1.77k| auto subs = 1271| 1.77k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1271:21): [True: 0, False: 1.77k] ------------------ 1272| 1.77k| : pos.towards_sub_oh( 1273| 1.77k| no_collapse_no_mut_t{}, first, idx, e); 1274| 1.77k| if (mutate) ------------------ | Branch (1274:21): [True: 0, False: 1.77k] ------------------ 1275| 0| pos.each_left(dec_visitor{}, idx); 1276| 1.77k| pos.copy_sizes( 1277| 1.77k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1278| 1.77k| std::copy(node->inner() + idx + 1, 1279| 1.77k| node->inner() + count, 1280| 1.77k| newn->inner() + 1); 1281| 1.77k| newn->inner()[0] = get<1>(subs); 1282| 1.77k| newr->d.sizes[0] = new_child_size; 1283| 1.77k| newr->d.count = newcount; 1284| 1.77k| assert(new_child_size); 1285| 1.77k| if (!mutate) { ------------------ | Branch (1285:21): [True: 1.77k, False: 0] ------------------ 1286| 1.77k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1287| 1.77k| if (Mutating) ------------------ | Branch (1287:25): [Folded - Ignored] ------------------ 1288| 0| pos.visit(dec_visitor{}); 1289| 1.77k| } 1290| 1.77k| return std::make_tuple(pos.shift(), newn); 1291| 1.77k| } 1292| 1.77k| IMMER_CATCH (...) { 1293| 0| if (!mutate) ------------------ | Branch (1293:21): [True: 0, False: 0] ------------------ 1294| 0| node_t::delete_inner_r_e(newn); 1295| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1296| 0| } 1297| 1.77k| } 1298| 2.52k| } _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: 1302| 2.27k| { 1303| 2.27k| auto idx = pos.subindex(first); 1304| 2.27k| auto count = pos.count(); 1305| 2.27k| auto node = pos.node(); 1306| 2.27k| auto mutate = Mutating ------------------ | Branch (1306:23): [Folded - Ignored] ------------------ 1307| | // this is more restrictive than actually needed because 1308| | // it causes the algorithm to also avoid mutating the leaf 1309| | // in place 1310| 2.27k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1310:26): [Folded - Ignored] | Branch (1310:52): [True: 0, False: 0] ------------------ 1311| 2.27k| auto left_size = pos.size_before(idx); 1312| 2.27k| auto child_size = pos.size_sbh(idx, left_size); 1313| 2.27k| auto dropped_size = first; 1314| 2.27k| auto child_dropped_size = dropped_size - left_size; 1315| 2.27k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1315:13): [Folded - Ignored] | Branch (1315:25): [True: 901, False: 1.36k] | Branch (1315:45): [True: 656, False: 245] ------------------ 1316| 656| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1316:22): [True: 0, False: 656] ------------------ 1317| 656| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1318| 656| if (mutate) ------------------ | Branch (1318:17): [True: 0, False: 656] ------------------ 1319| 0| pos.visit(dec_left_visitor{}, idx); 1320| 656| else if (Mutating) ------------------ | Branch (1320:22): [Folded - Ignored] ------------------ 1321| 0| pos.visit(dec_visitor{}); 1322| 656| return r; 1323| 1.61k| } else { 1324| 1.61k| using std::get; 1325| | // if possible, we convert the node to a relaxed one simply by 1326| | // allocating a `relaxed_t` size table for it... maybe some of this 1327| | // magic should be moved as a `node<...>` static method... 1328| 1.61k| auto newcount = count - idx; 1329| 1.61k| auto newn = 1330| 1.61k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1330:17): [True: 0, False: 1.61k] ------------------ 1331| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1332| 0| norefs_tag{})) relaxed_t, 1333| 0| node) 1334| 1.61k| : node_t::make_inner_r_e(e); 1335| 1.61k| auto newr = newn->relaxed(); 1336| 1.61k| IMMER_TRY { ------------------ | | 41| 1.61k|#define IMMER_TRY try ------------------ 1337| 1.61k| auto subs = 1338| 1.61k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1338:21): [True: 0, False: 1.61k] ------------------ 1339| 1.61k| : pos.towards_sub_oh( 1340| 1.61k| no_collapse_no_mut_t{}, first, idx, e); 1341| 1.61k| if (mutate) ------------------ | Branch (1341:21): [True: 0, False: 1.61k] ------------------ 1342| 0| pos.each_left(dec_visitor{}, idx); 1343| 1.61k| newr->d.sizes[0] = child_size - child_dropped_size; 1344| 1.61k| assert(newr->d.sizes[0]); 1345| 0| pos.copy_sizes( 1346| 1.61k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1347| 1.61k| newr->d.count = newcount; 1348| 1.61k| newn->inner()[0] = get<1>(subs); 1349| 1.61k| std::copy(node->inner() + idx + 1, 1350| 1.61k| node->inner() + count, 1351| 1.61k| newn->inner() + 1); 1352| 1.61k| if (!mutate) { ------------------ | Branch (1352:21): [True: 1.61k, False: 0] ------------------ 1353| 1.61k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1354| 1.61k| if (Mutating) ------------------ | Branch (1354:25): [Folded - Ignored] ------------------ 1355| 0| pos.visit(dec_visitor{}); 1356| 1.61k| } 1357| 1.61k| return std::make_tuple(pos.shift(), newn); 1358| 1.61k| } 1359| 1.61k| IMMER_CATCH (...) { 1360| 0| if (!mutate) ------------------ | Branch (1360:21): [True: 0, False: 0] ------------------ 1361| 0| node_t::delete_inner_r_e(newn); 1362| 0| else { 1363| | // restore the regular node that we were 1364| | // attempting to relax... 1365| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1366| 0| node->impl.d.data.inner.relaxed); 1367| 0| node->impl.d.data.inner.relaxed = nullptr; 1368| 0| } 1369| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1370| 0| } 1371| 1.61k| } 1372| 2.27k| } _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: 1302| 633| { 1303| 633| auto idx = pos.subindex(first); 1304| 633| auto count = pos.count(); 1305| 633| auto node = pos.node(); 1306| 633| auto mutate = Mutating ------------------ | Branch (1306:23): [Folded - Ignored] ------------------ 1307| | // this is more restrictive than actually needed because 1308| | // it causes the algorithm to also avoid mutating the leaf 1309| | // in place 1310| 633| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1310:26): [Folded - Ignored] | Branch (1310:52): [True: 0, False: 0] ------------------ 1311| 633| auto left_size = pos.size_before(idx); 1312| 633| auto child_size = pos.size_sbh(idx, left_size); 1313| 633| auto dropped_size = first; 1314| 633| auto child_dropped_size = dropped_size - left_size; 1315| 633| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1315:13): [Folded - Ignored] | Branch (1315:25): [True: 204, False: 429] | Branch (1315:45): [True: 0, False: 204] ------------------ 1316| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1316:22): [True: 0, False: 0] ------------------ 1317| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1318| 0| if (mutate) ------------------ | Branch (1318:17): [True: 0, False: 0] ------------------ 1319| 0| pos.visit(dec_left_visitor{}, idx); 1320| 0| else if (Mutating) ------------------ | Branch (1320:22): [Folded - Ignored] ------------------ 1321| 0| pos.visit(dec_visitor{}); 1322| 0| return r; 1323| 633| } else { 1324| 633| using std::get; 1325| | // if possible, we convert the node to a relaxed one simply by 1326| | // allocating a `relaxed_t` size table for it... maybe some of this 1327| | // magic should be moved as a `node<...>` static method... 1328| 633| auto newcount = count - idx; 1329| 633| auto newn = 1330| 633| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1330:17): [True: 0, False: 633] ------------------ 1331| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1332| 0| norefs_tag{})) relaxed_t, 1333| 0| node) 1334| 633| : node_t::make_inner_r_e(e); 1335| 633| auto newr = newn->relaxed(); 1336| 633| IMMER_TRY { ------------------ | | 41| 633|#define IMMER_TRY try ------------------ 1337| 633| auto subs = 1338| 633| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1338:21): [True: 0, False: 633] ------------------ 1339| 633| : pos.towards_sub_oh( 1340| 633| no_collapse_no_mut_t{}, first, idx, e); 1341| 633| if (mutate) ------------------ | Branch (1341:21): [True: 0, False: 633] ------------------ 1342| 0| pos.each_left(dec_visitor{}, idx); 1343| 633| newr->d.sizes[0] = child_size - child_dropped_size; 1344| 633| assert(newr->d.sizes[0]); 1345| 0| pos.copy_sizes( 1346| 633| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1347| 633| newr->d.count = newcount; 1348| 633| newn->inner()[0] = get<1>(subs); 1349| 633| std::copy(node->inner() + idx + 1, 1350| 633| node->inner() + count, 1351| 633| newn->inner() + 1); 1352| 633| if (!mutate) { ------------------ | Branch (1352:21): [True: 633, False: 0] ------------------ 1353| 633| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1354| 633| if (Mutating) ------------------ | Branch (1354:25): [Folded - Ignored] ------------------ 1355| 0| pos.visit(dec_visitor{}); 1356| 633| } 1357| 633| return std::make_tuple(pos.shift(), newn); 1358| 633| } 1359| 633| IMMER_CATCH (...) { 1360| 0| if (!mutate) ------------------ | Branch (1360:21): [True: 0, False: 0] ------------------ 1361| 0| node_t::delete_inner_r_e(newn); 1362| 0| else { 1363| | // restore the regular node that we were 1364| | // attempting to relax... 1365| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1366| 0| node->impl.d.data.inner.relaxed); 1367| 0| node->impl.d.data.inner.relaxed = nullptr; 1368| 0| } 1369| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1370| 0| } 1371| 633| } 1372| 633| } _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: 1376| 7.28k| { 1377| 7.28k| auto node = pos.node(); 1378| 7.28k| auto idx = pos.index(first); 1379| 7.28k| auto count = pos.count(); 1380| 7.28k| auto mutate = Mutating && ------------------ | Branch (1380:23): [Folded - Ignored] ------------------ 1381| 7.28k| std::is_nothrow_move_constructible::value && ------------------ | Branch (1381:23): [Folded - Ignored] ------------------ 1382| 7.28k| node->can_mutate(e); ------------------ | Branch (1382:23): [True: 0, False: 0] ------------------ 1383| 7.28k| if (mutate) { ------------------ | Branch (1383:13): [True: 0, False: 7.28k] ------------------ 1384| 0| auto data = node->leaf(); 1385| 0| auto newcount = count - idx; 1386| 0| std::move(data + idx, data + count, data); 1387| 0| detail::destroy_n(data + newcount, idx); 1388| 0| return std::make_tuple(0, node); 1389| 7.28k| } else { 1390| 7.28k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1391| 7.28k| if (Mutating) ------------------ | Branch (1391:17): [Folded - Ignored] ------------------ 1392| 0| pos.visit(dec_visitor{}); 1393| 7.28k| return std::make_tuple(0, newn); 1394| 7.28k| } 1395| 7.28k| } _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: 1302| 1.83k| { 1303| 1.83k| auto idx = pos.subindex(first); 1304| 1.83k| auto count = pos.count(); 1305| 1.83k| auto node = pos.node(); 1306| 1.83k| auto mutate = Mutating ------------------ | Branch (1306:23): [Folded - Ignored] ------------------ 1307| | // this is more restrictive than actually needed because 1308| | // it causes the algorithm to also avoid mutating the leaf 1309| | // in place 1310| 1.83k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1310:26): [Folded - Ignored] | Branch (1310:52): [True: 0, False: 0] ------------------ 1311| 1.83k| auto left_size = pos.size_before(idx); 1312| 1.83k| auto child_size = pos.size_sbh(idx, left_size); 1313| 1.83k| auto dropped_size = first; 1314| 1.83k| auto child_dropped_size = dropped_size - left_size; 1315| 1.83k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1315:13): [Folded - Ignored] | Branch (1315:25): [True: 0, False: 0] | Branch (1315:45): [True: 0, False: 0] ------------------ 1316| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1316:22): [True: 0, False: 0] ------------------ 1317| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1318| 0| if (mutate) ------------------ | Branch (1318:17): [True: 0, False: 0] ------------------ 1319| 0| pos.visit(dec_left_visitor{}, idx); 1320| 0| else if (Mutating) ------------------ | Branch (1320:22): [Folded - Ignored] ------------------ 1321| 0| pos.visit(dec_visitor{}); 1322| 0| return r; 1323| 1.83k| } else { 1324| 1.83k| using std::get; 1325| | // if possible, we convert the node to a relaxed one simply by 1326| | // allocating a `relaxed_t` size table for it... maybe some of this 1327| | // magic should be moved as a `node<...>` static method... 1328| 1.83k| auto newcount = count - idx; 1329| 1.83k| auto newn = 1330| 1.83k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1330:17): [True: 0, False: 1.83k] ------------------ 1331| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1332| 0| norefs_tag{})) relaxed_t, 1333| 0| node) 1334| 1.83k| : node_t::make_inner_r_e(e); 1335| 1.83k| auto newr = newn->relaxed(); 1336| 1.83k| IMMER_TRY { ------------------ | | 41| 1.83k|#define IMMER_TRY try ------------------ 1337| 1.83k| auto subs = 1338| 1.83k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1338:21): [True: 0, False: 1.83k] ------------------ 1339| 1.83k| : pos.towards_sub_oh( 1340| 1.83k| no_collapse_no_mut_t{}, first, idx, e); 1341| 1.83k| if (mutate) ------------------ | Branch (1341:21): [True: 0, False: 1.83k] ------------------ 1342| 0| pos.each_left(dec_visitor{}, idx); 1343| 1.83k| newr->d.sizes[0] = child_size - child_dropped_size; 1344| 1.83k| assert(newr->d.sizes[0]); 1345| 0| pos.copy_sizes( 1346| 1.83k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1347| 1.83k| newr->d.count = newcount; 1348| 1.83k| newn->inner()[0] = get<1>(subs); 1349| 1.83k| std::copy(node->inner() + idx + 1, 1350| 1.83k| node->inner() + count, 1351| 1.83k| newn->inner() + 1); 1352| 1.83k| if (!mutate) { ------------------ | Branch (1352:21): [True: 1.83k, False: 0] ------------------ 1353| 1.83k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1354| 1.83k| if (Mutating) ------------------ | Branch (1354:25): [Folded - Ignored] ------------------ 1355| 0| pos.visit(dec_visitor{}); 1356| 1.83k| } 1357| 1.83k| return std::make_tuple(pos.shift(), newn); 1358| 1.83k| } 1359| 1.83k| IMMER_CATCH (...) { 1360| 0| if (!mutate) ------------------ | Branch (1360:21): [True: 0, False: 0] ------------------ 1361| 0| node_t::delete_inner_r_e(newn); 1362| 0| else { 1363| | // restore the regular node that we were 1364| | // attempting to relax... 1365| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1366| 0| node->impl.d.data.inner.relaxed); 1367| 0| node->impl.d.data.inner.relaxed = nullptr; 1368| 0| } 1369| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1370| 0| } 1371| 1.83k| } 1372| 1.83k| } _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: 1376| 4.49k| { 1377| 4.49k| auto node = pos.node(); 1378| 4.49k| auto idx = pos.index(first); 1379| 4.49k| auto count = pos.count(); 1380| 4.49k| auto mutate = Mutating && ------------------ | Branch (1380:23): [Folded - Ignored] ------------------ 1381| 4.49k| std::is_nothrow_move_constructible::value && ------------------ | Branch (1381:23): [Folded - Ignored] ------------------ 1382| 4.49k| node->can_mutate(e); ------------------ | Branch (1382:23): [True: 1.79k, False: 2.69k] ------------------ 1383| 4.49k| if (mutate) { ------------------ | Branch (1383:13): [True: 1.79k, False: 2.69k] ------------------ 1384| 1.79k| auto data = node->leaf(); 1385| 1.79k| auto newcount = count - idx; 1386| 1.79k| std::move(data + idx, data + count, data); 1387| 1.79k| detail::destroy_n(data + newcount, idx); 1388| 1.79k| return std::make_tuple(0, node); 1389| 2.69k| } else { 1390| 2.69k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1391| 2.69k| if (Mutating) ------------------ | Branch (1391:17): [Folded - Ignored] ------------------ 1392| 2.69k| pos.visit(dec_visitor{}); 1393| 2.69k| return std::make_tuple(0, newn); 1394| 2.69k| } 1395| 4.49k| } _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: 1302| 1.61k| { 1303| 1.61k| auto idx = pos.subindex(first); 1304| 1.61k| auto count = pos.count(); 1305| 1.61k| auto node = pos.node(); 1306| 1.61k| auto mutate = Mutating ------------------ | Branch (1306:23): [Folded - Ignored] ------------------ 1307| | // this is more restrictive than actually needed because 1308| | // it causes the algorithm to also avoid mutating the leaf 1309| | // in place 1310| 1.61k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1310:26): [Folded - Ignored] | Branch (1310:52): [True: 0, False: 0] ------------------ 1311| 1.61k| auto left_size = pos.size_before(idx); 1312| 1.61k| auto child_size = pos.size_sbh(idx, left_size); 1313| 1.61k| auto dropped_size = first; 1314| 1.61k| auto child_dropped_size = dropped_size - left_size; 1315| 1.61k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1315:13): [Folded - Ignored] | Branch (1315:25): [True: 0, False: 0] | Branch (1315:45): [True: 0, False: 0] ------------------ 1316| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1316:22): [True: 0, False: 0] ------------------ 1317| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1318| 0| if (mutate) ------------------ | Branch (1318:17): [True: 0, False: 0] ------------------ 1319| 0| pos.visit(dec_left_visitor{}, idx); 1320| 0| else if (Mutating) ------------------ | Branch (1320:22): [Folded - Ignored] ------------------ 1321| 0| pos.visit(dec_visitor{}); 1322| 0| return r; 1323| 1.61k| } else { 1324| 1.61k| using std::get; 1325| | // if possible, we convert the node to a relaxed one simply by 1326| | // allocating a `relaxed_t` size table for it... maybe some of this 1327| | // magic should be moved as a `node<...>` static method... 1328| 1.61k| auto newcount = count - idx; 1329| 1.61k| auto newn = 1330| 1.61k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1330:17): [True: 0, False: 1.61k] ------------------ 1331| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1332| 0| norefs_tag{})) relaxed_t, 1333| 0| node) 1334| 1.61k| : node_t::make_inner_r_e(e); 1335| 1.61k| auto newr = newn->relaxed(); 1336| 1.61k| IMMER_TRY { ------------------ | | 41| 1.61k|#define IMMER_TRY try ------------------ 1337| 1.61k| auto subs = 1338| 1.61k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1338:21): [True: 0, False: 1.61k] ------------------ 1339| 1.61k| : pos.towards_sub_oh( 1340| 1.61k| no_collapse_no_mut_t{}, first, idx, e); 1341| 1.61k| if (mutate) ------------------ | Branch (1341:21): [True: 0, False: 1.61k] ------------------ 1342| 0| pos.each_left(dec_visitor{}, idx); 1343| 1.61k| newr->d.sizes[0] = child_size - child_dropped_size; 1344| 1.61k| assert(newr->d.sizes[0]); 1345| 0| pos.copy_sizes( 1346| 1.61k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1347| 1.61k| newr->d.count = newcount; 1348| 1.61k| newn->inner()[0] = get<1>(subs); 1349| 1.61k| std::copy(node->inner() + idx + 1, 1350| 1.61k| node->inner() + count, 1351| 1.61k| newn->inner() + 1); 1352| 1.61k| if (!mutate) { ------------------ | Branch (1352:21): [True: 1.61k, False: 0] ------------------ 1353| 1.61k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1354| 1.61k| if (Mutating) ------------------ | Branch (1354:25): [Folded - Ignored] ------------------ 1355| 1.61k| pos.visit(dec_visitor{}); 1356| 1.61k| } 1357| 1.61k| return std::make_tuple(pos.shift(), newn); 1358| 1.61k| } 1359| 1.61k| IMMER_CATCH (...) { 1360| 0| if (!mutate) ------------------ | Branch (1360:21): [True: 0, False: 0] ------------------ 1361| 0| node_t::delete_inner_r_e(newn); 1362| 0| else { 1363| | // restore the regular node that we were 1364| | // attempting to relax... 1365| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1366| 0| node->impl.d.data.inner.relaxed); 1367| 0| node->impl.d.data.inner.relaxed = nullptr; 1368| 0| } 1369| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1370| 0| } 1371| 1.61k| } 1372| 1.61k| } _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: 1376| 40.3k| { 1377| 40.3k| auto node = pos.node(); 1378| 40.3k| auto idx = pos.index(first); 1379| 40.3k| auto count = pos.count(); 1380| 40.3k| auto mutate = Mutating && ------------------ | Branch (1380:23): [Folded - Ignored] ------------------ 1381| 40.3k| std::is_nothrow_move_constructible::value && ------------------ | Branch (1381:23): [Folded - Ignored] ------------------ 1382| 40.3k| node->can_mutate(e); ------------------ | Branch (1382:23): [True: 0, False: 0] ------------------ 1383| 40.3k| if (mutate) { ------------------ | Branch (1383:13): [True: 0, False: 40.3k] ------------------ 1384| 0| auto data = node->leaf(); 1385| 0| auto newcount = count - idx; 1386| 0| std::move(data + idx, data + count, data); 1387| 0| detail::destroy_n(data + newcount, idx); 1388| 0| return std::make_tuple(0, node); 1389| 40.3k| } else { 1390| 40.3k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1391| 40.3k| if (Mutating) ------------------ | Branch (1391:17): [Folded - Ignored] ------------------ 1392| 0| pos.visit(dec_visitor{}); 1393| 40.3k| return std::make_tuple(0, newn); 1394| 40.3k| } 1395| 40.3k| } _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: 1302| 1.47k| { 1303| 1.47k| auto idx = pos.subindex(first); 1304| 1.47k| auto count = pos.count(); 1305| 1.47k| auto node = pos.node(); 1306| 1.47k| auto mutate = Mutating ------------------ | Branch (1306:23): [Folded - Ignored] ------------------ 1307| | // this is more restrictive than actually needed because 1308| | // it causes the algorithm to also avoid mutating the leaf 1309| | // in place 1310| 1.47k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1310:26): [Folded - Ignored] | Branch (1310:52): [True: 0, False: 0] ------------------ 1311| 1.47k| auto left_size = pos.size_before(idx); 1312| 1.47k| auto child_size = pos.size_sbh(idx, left_size); 1313| 1.47k| auto dropped_size = first; 1314| 1.47k| auto child_dropped_size = dropped_size - left_size; 1315| 1.47k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1315:13): [Folded - Ignored] | Branch (1315:25): [True: 0, False: 0] | Branch (1315:45): [True: 0, False: 0] ------------------ 1316| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1316:22): [True: 0, False: 0] ------------------ 1317| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1318| 0| if (mutate) ------------------ | Branch (1318:17): [True: 0, False: 0] ------------------ 1319| 0| pos.visit(dec_left_visitor{}, idx); 1320| 0| else if (Mutating) ------------------ | Branch (1320:22): [Folded - Ignored] ------------------ 1321| 0| pos.visit(dec_visitor{}); 1322| 0| return r; 1323| 1.47k| } else { 1324| 1.47k| using std::get; 1325| | // if possible, we convert the node to a relaxed one simply by 1326| | // allocating a `relaxed_t` size table for it... maybe some of this 1327| | // magic should be moved as a `node<...>` static method... 1328| 1.47k| auto newcount = count - idx; 1329| 1.47k| auto newn = 1330| 1.47k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1330:17): [True: 0, False: 1.47k] ------------------ 1331| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1332| 0| norefs_tag{})) relaxed_t, 1333| 0| node) 1334| 1.47k| : node_t::make_inner_r_e(e); 1335| 1.47k| auto newr = newn->relaxed(); 1336| 1.47k| IMMER_TRY { ------------------ | | 41| 1.47k|#define IMMER_TRY try ------------------ 1337| 1.47k| auto subs = 1338| 1.47k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1338:21): [True: 0, False: 1.47k] ------------------ 1339| 1.47k| : pos.towards_sub_oh( 1340| 1.47k| no_collapse_no_mut_t{}, first, idx, e); 1341| 1.47k| if (mutate) ------------------ | Branch (1341:21): [True: 0, False: 1.47k] ------------------ 1342| 0| pos.each_left(dec_visitor{}, idx); 1343| 1.47k| newr->d.sizes[0] = child_size - child_dropped_size; 1344| 1.47k| assert(newr->d.sizes[0]); 1345| 0| pos.copy_sizes( 1346| 1.47k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1347| 1.47k| newr->d.count = newcount; 1348| 1.47k| newn->inner()[0] = get<1>(subs); 1349| 1.47k| std::copy(node->inner() + idx + 1, 1350| 1.47k| node->inner() + count, 1351| 1.47k| newn->inner() + 1); 1352| 1.47k| if (!mutate) { ------------------ | Branch (1352:21): [True: 1.47k, False: 0] ------------------ 1353| 1.47k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1354| 1.47k| if (Mutating) ------------------ | Branch (1354:25): [Folded - Ignored] ------------------ 1355| 0| pos.visit(dec_visitor{}); 1356| 1.47k| } 1357| 1.47k| return std::make_tuple(pos.shift(), newn); 1358| 1.47k| } 1359| 1.47k| IMMER_CATCH (...) { 1360| 0| if (!mutate) ------------------ | Branch (1360:21): [True: 0, False: 0] ------------------ 1361| 0| node_t::delete_inner_r_e(newn); 1362| 0| else { 1363| | // restore the regular node that we were 1364| | // attempting to relax... 1365| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1366| 0| node->impl.d.data.inner.relaxed); 1367| 0| node->impl.d.data.inner.relaxed = nullptr; 1368| 0| } 1369| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1370| 0| } 1371| 1.47k| } 1372| 1.47k| } _ZN5immer6detail4rbts16dec_left_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 1197| 1.52k| { 1198| 1.52k| using node_t = node_type; 1199| 1.52k| auto node = p.node(); 1200| 1.52k| if (node->dec()) { ------------------ | Branch (1200:13): [True: 1.52k, False: 0] ------------------ 1201| 1.52k| p.each_left(dec_t{}, idx); 1202| 1.52k| node_t::delete_inner_r(node, p.count()); 1203| 1.52k| } 1204| 1.52k| } _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: 1245| 174k| { 1246| 174k| auto idx = pos.subindex(first); 1247| 174k| auto count = pos.count(); 1248| 174k| auto node = pos.node(); 1249| 174k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1249:35): [Folded - Ignored] | Branch (1249:47): [True: 138k, False: 35.8k] ------------------ 1250| 174k| auto left_size = pos.size_before(idx); 1251| 174k| auto child_size = pos.size_sbh(idx, left_size); 1252| 174k| auto dropped_size = first; 1253| 174k| auto child_dropped_size = dropped_size - left_size; 1254| 174k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1254:13): [Folded - Ignored] | Branch (1254:25): [True: 0, False: 0] | Branch (1254:45): [True: 0, False: 0] ------------------ 1255| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1255:22): [True: 0, False: 0] ------------------ 1256| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1257| 0| if (mutate) ------------------ | Branch (1257:17): [True: 0, False: 0] ------------------ 1258| 0| pos.visit(dec_left_visitor{}, idx); 1259| 0| else if (Mutating) ------------------ | Branch (1259:22): [Folded - Ignored] ------------------ 1260| 0| pos.visit(dec_visitor{}); 1261| 0| return r; 1262| 174k| } else { 1263| 174k| using std::get; 1264| 174k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1264:29): [True: 138k, False: 35.8k] ------------------ 1265| 174k| : node_t::make_inner_r_e(e); 1266| 174k| auto newr = newn->relaxed(); 1267| 174k| auto newcount = count - idx; 1268| 174k| auto new_child_size = child_size - child_dropped_size; 1269| 174k| IMMER_TRY { ------------------ | | 41| 174k|#define IMMER_TRY try ------------------ 1270| 174k| auto subs = 1271| 174k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1271:21): [True: 138k, False: 35.8k] ------------------ 1272| 174k| : pos.towards_sub_oh( 1273| 35.8k| no_collapse_no_mut_t{}, first, idx, e); 1274| 174k| if (mutate) ------------------ | Branch (1274:21): [True: 138k, False: 35.8k] ------------------ 1275| 138k| pos.each_left(dec_visitor{}, idx); 1276| 174k| pos.copy_sizes( 1277| 174k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1278| 174k| std::copy(node->inner() + idx + 1, 1279| 174k| node->inner() + count, 1280| 174k| newn->inner() + 1); 1281| 174k| newn->inner()[0] = get<1>(subs); 1282| 174k| newr->d.sizes[0] = new_child_size; 1283| 174k| newr->d.count = newcount; 1284| 174k| assert(new_child_size); 1285| 174k| if (!mutate) { ------------------ | Branch (1285:21): [True: 35.8k, False: 138k] ------------------ 1286| 35.8k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1287| 35.8k| if (Mutating) ------------------ | Branch (1287:25): [Folded - Ignored] ------------------ 1288| 35.8k| pos.visit(dec_visitor{}); 1289| 35.8k| } 1290| 174k| return std::make_tuple(pos.shift(), newn); 1291| 174k| } 1292| 174k| IMMER_CATCH (...) { 1293| 0| if (!mutate) ------------------ | Branch (1293:21): [True: 0, False: 0] ------------------ 1294| 0| node_t::delete_inner_r_e(newn); 1295| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1296| 0| } 1297| 174k| } 1298| 174k| } _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: 1245| 44.0k| { 1246| 44.0k| auto idx = pos.subindex(first); 1247| 44.0k| auto count = pos.count(); 1248| 44.0k| auto node = pos.node(); 1249| 44.0k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1249:35): [Folded - Ignored] | Branch (1249:47): [True: 0, False: 0] ------------------ 1250| 44.0k| auto left_size = pos.size_before(idx); 1251| 44.0k| auto child_size = pos.size_sbh(idx, left_size); 1252| 44.0k| auto dropped_size = first; 1253| 44.0k| auto child_dropped_size = dropped_size - left_size; 1254| 44.0k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1254:13): [Folded - Ignored] | Branch (1254:25): [True: 0, False: 0] | Branch (1254:45): [True: 0, False: 0] ------------------ 1255| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1255:22): [True: 0, False: 0] ------------------ 1256| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1257| 0| if (mutate) ------------------ | Branch (1257:17): [True: 0, False: 0] ------------------ 1258| 0| pos.visit(dec_left_visitor{}, idx); 1259| 0| else if (Mutating) ------------------ | Branch (1259:22): [Folded - Ignored] ------------------ 1260| 0| pos.visit(dec_visitor{}); 1261| 0| return r; 1262| 44.0k| } else { 1263| 44.0k| using std::get; 1264| 44.0k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1264:29): [True: 0, False: 44.0k] ------------------ 1265| 44.0k| : node_t::make_inner_r_e(e); 1266| 44.0k| auto newr = newn->relaxed(); 1267| 44.0k| auto newcount = count - idx; 1268| 44.0k| auto new_child_size = child_size - child_dropped_size; 1269| 44.0k| IMMER_TRY { ------------------ | | 41| 44.0k|#define IMMER_TRY try ------------------ 1270| 44.0k| auto subs = 1271| 44.0k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1271:21): [True: 0, False: 44.0k] ------------------ 1272| 44.0k| : pos.towards_sub_oh( 1273| 44.0k| no_collapse_no_mut_t{}, first, idx, e); 1274| 44.0k| if (mutate) ------------------ | Branch (1274:21): [True: 0, False: 44.0k] ------------------ 1275| 0| pos.each_left(dec_visitor{}, idx); 1276| 44.0k| pos.copy_sizes( 1277| 44.0k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1278| 44.0k| std::copy(node->inner() + idx + 1, 1279| 44.0k| node->inner() + count, 1280| 44.0k| newn->inner() + 1); 1281| 44.0k| newn->inner()[0] = get<1>(subs); 1282| 44.0k| newr->d.sizes[0] = new_child_size; 1283| 44.0k| newr->d.count = newcount; 1284| 44.0k| assert(new_child_size); 1285| 44.0k| if (!mutate) { ------------------ | Branch (1285:21): [True: 44.0k, False: 0] ------------------ 1286| 44.0k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1287| 44.0k| if (Mutating) ------------------ | Branch (1287:25): [Folded - Ignored] ------------------ 1288| 0| pos.visit(dec_visitor{}); 1289| 44.0k| } 1290| 44.0k| return std::make_tuple(pos.shift(), newn); 1291| 44.0k| } 1292| 44.0k| IMMER_CATCH (...) { 1293| 0| if (!mutate) ------------------ | Branch (1293:21): [True: 0, False: 0] ------------------ 1294| 0| node_t::delete_inner_r_e(newn); 1295| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1296| 0| } 1297| 44.0k| } 1298| 44.0k| } _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: 1302| 2.97k| { 1303| 2.97k| auto idx = pos.subindex(first); 1304| 2.97k| auto count = pos.count(); 1305| 2.97k| auto node = pos.node(); 1306| 2.97k| auto mutate = Mutating ------------------ | Branch (1306:23): [Folded - Ignored] ------------------ 1307| | // this is more restrictive than actually needed because 1308| | // it causes the algorithm to also avoid mutating the leaf 1309| | // in place 1310| 2.97k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1310:26): [Folded - Ignored] | Branch (1310:52): [True: 0, False: 0] ------------------ 1311| 2.97k| auto left_size = pos.size_before(idx); 1312| 2.97k| auto child_size = pos.size_sbh(idx, left_size); 1313| 2.97k| auto dropped_size = first; 1314| 2.97k| auto child_dropped_size = dropped_size - left_size; 1315| 2.97k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1315:13): [Folded - Ignored] | Branch (1315:25): [True: 1.74k, False: 1.22k] | Branch (1315:45): [True: 1.02k, False: 723] ------------------ 1316| 1.02k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1316:22): [True: 0, False: 1.02k] ------------------ 1317| 1.02k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1318| 1.02k| if (mutate) ------------------ | Branch (1318:17): [True: 0, False: 1.02k] ------------------ 1319| 0| pos.visit(dec_left_visitor{}, idx); 1320| 1.02k| else if (Mutating) ------------------ | Branch (1320:22): [Folded - Ignored] ------------------ 1321| 1.02k| pos.visit(dec_visitor{}); 1322| 1.02k| return r; 1323| 1.95k| } else { 1324| 1.95k| using std::get; 1325| | // if possible, we convert the node to a relaxed one simply by 1326| | // allocating a `relaxed_t` size table for it... maybe some of this 1327| | // magic should be moved as a `node<...>` static method... 1328| 1.95k| auto newcount = count - idx; 1329| 1.95k| auto newn = 1330| 1.95k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1330:17): [True: 0, False: 1.95k] ------------------ 1331| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1332| 0| norefs_tag{})) relaxed_t, 1333| 0| node) 1334| 1.95k| : node_t::make_inner_r_e(e); 1335| 1.95k| auto newr = newn->relaxed(); 1336| 1.95k| IMMER_TRY { ------------------ | | 41| 1.95k|#define IMMER_TRY try ------------------ 1337| 1.95k| auto subs = 1338| 1.95k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1338:21): [True: 0, False: 1.95k] ------------------ 1339| 1.95k| : pos.towards_sub_oh( 1340| 1.95k| no_collapse_no_mut_t{}, first, idx, e); 1341| 1.95k| if (mutate) ------------------ | Branch (1341:21): [True: 0, False: 1.95k] ------------------ 1342| 0| pos.each_left(dec_visitor{}, idx); 1343| 1.95k| newr->d.sizes[0] = child_size - child_dropped_size; 1344| 1.95k| assert(newr->d.sizes[0]); 1345| 0| pos.copy_sizes( 1346| 1.95k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1347| 1.95k| newr->d.count = newcount; 1348| 1.95k| newn->inner()[0] = get<1>(subs); 1349| 1.95k| std::copy(node->inner() + idx + 1, 1350| 1.95k| node->inner() + count, 1351| 1.95k| newn->inner() + 1); 1352| 1.95k| if (!mutate) { ------------------ | Branch (1352:21): [True: 1.95k, False: 0] ------------------ 1353| 1.95k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1354| 1.95k| if (Mutating) ------------------ | Branch (1354:25): [Folded - Ignored] ------------------ 1355| 1.95k| pos.visit(dec_visitor{}); 1356| 1.95k| } 1357| 1.95k| return std::make_tuple(pos.shift(), newn); 1358| 1.95k| } 1359| 1.95k| IMMER_CATCH (...) { 1360| 0| if (!mutate) ------------------ | Branch (1360:21): [True: 0, False: 0] ------------------ 1361| 0| node_t::delete_inner_r_e(newn); 1362| 0| else { 1363| | // restore the regular node that we were 1364| | // attempting to relax... 1365| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1366| 0| node->impl.d.data.inner.relaxed); 1367| 0| node->impl.d.data.inner.relaxed = nullptr; 1368| 0| } 1369| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1370| 0| } 1371| 1.95k| } 1372| 2.97k| } _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: 348| 13.0k| { 349| 13.0k| assert(shiftl <= posr.shift()); 350| 13.0k| return shiftl == posr.shift() ------------------ | Branch (350:20): [True: 12.1k, False: 872] ------------------ 351| 13.0k| ? visit_maybe_relaxed_sub(rootl, 352| 12.1k| shiftl, 353| 12.1k| sizel, 354| 12.1k| this_t{}, 355| 12.1k| posr, 356| 12.1k| first, 357| 12.1k| size_t{}) 358| 13.0k| : posr.first_sub_inner( 359| 872| rrb{}, first, rootl, shiftl, sizel); 360| 13.0k| } _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: 381| 31.2k| { 382| 31.2k| auto nl = posl.node(); 383| 31.2k| auto nr = posr.node(); 384| 31.2k| if (nl == nr) ------------------ | Branch (384:13): [True: 13.8k, False: 17.3k] ------------------ 385| 13.8k| return true; 386| 17.3k| auto cl = posl.count(); 387| 17.3k| auto cr = posr.count(); 388| 17.3k| assert(cr > 0); 389| 0| auto sbr = size_t{}; 390| 17.3k| auto i = count_t{}; 391| 17.3k| auto j = count_t{}; 392| 111k| for (; i < cl; ++i) { ------------------ | Branch (392:16): [True: 97.5k, False: 13.6k] ------------------ 393| 97.5k| auto sbl = posl.size_before(i); 394| 176k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (394:20): [True: 155k, False: 20.6k] | Branch (394:34): [True: 78.7k, False: 76.9k] ------------------ 395| 78.7k| ; 396| 97.5k| auto res = 397| 97.5k| sbl == sbr ------------------ | Branch (397:17): [True: 45.9k, False: 51.5k] ------------------ 398| 97.5k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 399| 97.5k| : posl.nth_sub(i, 400| 51.5k| for_each_chunk_p_visitor{}, 401| 51.5k| this_t::equal_chunk_p(first + (idx + sbl))); 402| 97.5k| if (!res) ------------------ | Branch (402:17): [True: 3.75k, False: 93.7k] ------------------ 403| 3.75k| return false; 404| 97.5k| } 405| 13.6k| return true; 406| 17.3k| } _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: 335| 21.7k| { 336| 21.7k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 337| 21.7k| } _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: 426| 22.8k| { 427| 22.8k| if (posl.node() == posr.node()) ------------------ | Branch (427:13): [True: 14.1k, False: 8.70k] ------------------ 428| 14.1k| return true; 429| 8.70k| auto cl = posl.count(); 430| 8.70k| auto cr = posr.count(); 431| 8.70k| auto mp = std::min(cl, cr); 432| 8.70k| return std::equal(posl.node()->leaf(), ------------------ | Branch (432:16): [True: 7.84k, False: 864] ------------------ 433| 8.70k| posl.node()->leaf() + mp, 434| 8.70k| posr.node()->leaf()) && 435| 8.70k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (435:16): [True: 7.41k, False: 429] ------------------ 436| 7.84k| posl.node()->leaf() + posl.count(), 437| 7.84k| first + (idx + mp)); 438| 22.8k| } _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: 328| 22.6k| { 329| 22.6k| return posl.nth_sub(i, this_t{}, posr, first, idx); 330| 22.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: 411| 4.85k| { 412| 4.85k| return this_t::visit_relaxed(posl, posr, first, idx); 413| 4.85k| } _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: 381| 4.85k| { 382| 4.85k| auto nl = posl.node(); 383| 4.85k| auto nr = posr.node(); 384| 4.85k| if (nl == nr) ------------------ | Branch (384:13): [True: 0, False: 4.85k] ------------------ 385| 0| return true; 386| 4.85k| auto cl = posl.count(); 387| 4.85k| auto cr = posr.count(); 388| 4.85k| assert(cr > 0); 389| 0| auto sbr = size_t{}; 390| 4.85k| auto i = count_t{}; 391| 4.85k| auto j = count_t{}; 392| 16.9k| for (; i < cl; ++i) { ------------------ | Branch (392:16): [True: 14.6k, False: 2.28k] ------------------ 393| 14.6k| auto sbl = posl.size_before(i); 394| 24.7k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (394:20): [True: 21.0k, False: 3.69k] | Branch (394:34): [True: 10.0k, False: 10.9k] ------------------ 395| 10.0k| ; 396| 14.6k| auto res = 397| 14.6k| sbl == sbr ------------------ | Branch (397:17): [True: 9.45k, False: 5.23k] ------------------ 398| 14.6k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 399| 14.6k| : posl.nth_sub(i, 400| 5.23k| for_each_chunk_p_visitor{}, 401| 5.23k| this_t::equal_chunk_p(first + (idx + sbl))); 402| 14.6k| if (!res) ------------------ | Branch (402:17): [True: 2.56k, False: 12.1k] ------------------ 403| 2.56k| return false; 404| 14.6k| } 405| 2.28k| return true; 406| 4.85k| } _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: 335| 6.31k| { 336| 6.31k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 337| 6.31k| } _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: 426| 13.2k| { 427| 13.2k| if (posl.node() == posr.node()) ------------------ | Branch (427:13): [True: 8.20k, False: 5.00k] ------------------ 428| 8.20k| return true; 429| 5.00k| auto cl = posl.count(); 430| 5.00k| auto cr = posr.count(); 431| 5.00k| auto mp = std::min(cl, cr); 432| 5.00k| return std::equal(posl.node()->leaf(), ------------------ | Branch (432:16): [True: 4.49k, False: 516] ------------------ 433| 5.00k| posl.node()->leaf() + mp, 434| 5.00k| posr.node()->leaf()) && 435| 5.00k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (435:16): [True: 4.10k, False: 389] ------------------ 436| 4.49k| posl.node()->leaf() + posl.count(), 437| 4.49k| first + (idx + mp)); 438| 13.2k| } _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: 328| 2.14k| { 329| 2.14k| return posl.nth_sub(i, this_t{}, posr, first, idx); 330| 2.14k| } _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: 411| 2.29k| { 412| 2.29k| return this_t::visit_relaxed(posl, posr, first, idx); 413| 2.29k| } _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: 381| 2.29k| { 382| 2.29k| auto nl = posl.node(); 383| 2.29k| auto nr = posr.node(); 384| 2.29k| if (nl == nr) ------------------ | Branch (384:13): [True: 0, False: 2.29k] ------------------ 385| 0| return true; 386| 2.29k| auto cl = posl.count(); 387| 2.29k| auto cr = posr.count(); 388| 2.29k| assert(cr > 0); 389| 0| auto sbr = size_t{}; 390| 2.29k| auto i = count_t{}; 391| 2.29k| auto j = count_t{}; 392| 17.0k| for (; i < cl; ++i) { ------------------ | Branch (392:16): [True: 15.4k, False: 1.53k] ------------------ 393| 15.4k| auto sbl = posl.size_before(i); 394| 27.2k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (394:20): [True: 23.3k, False: 3.96k] | Branch (394:34): [True: 11.7k, False: 11.5k] ------------------ 395| 11.7k| ; 396| 15.4k| auto res = 397| 15.4k| sbl == sbr ------------------ | Branch (397:17): [True: 9.25k, False: 6.23k] ------------------ 398| 15.4k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 399| 15.4k| : posl.nth_sub(i, 400| 6.23k| for_each_chunk_p_visitor{}, 401| 6.23k| this_t::equal_chunk_p(first + (idx + sbl))); 402| 15.4k| if (!res) ------------------ | Branch (402:17): [True: 759, False: 14.7k] ------------------ 403| 759| return false; 404| 15.4k| } 405| 1.53k| return true; 406| 2.29k| } _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: 335| 7.94k| { 336| 7.94k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 337| 7.94k| } _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: 328| 473| { 329| 473| return posl.nth_sub(i, this_t{}, posr, first, idx); 330| 473| } _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: 328| 838| { 329| 838| return posl.nth_sub(i, this_t{}, posr, first, idx); 330| 838| } _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: 418| 1.82k| { 419| 1.82k| return posl.count() >= posr.count() ------------------ | Branch (419:16): [True: 1.82k, False: 0] ------------------ 420| 1.82k| ? this_t::visit_regular(posl, posr.node()) 421| 1.82k| : this_t::visit_regular(posr, posl.node()); 422| 1.82k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 442| 12.9k| { 443| 12.9k| auto node = pos.node(); 444| 12.9k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (444:16): [True: 9.72k, False: 3.26k] | Branch (444:33): [True: 1.56k, False: 1.70k] ------------------ 445| 12.9k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 449| 19.5k| { 450| 19.5k| auto node = pos.node(); 451| 19.5k| return node == other || std::equal(node->leaf(), ------------------ | Branch (451:16): [True: 12.2k, False: 7.22k] | Branch (451:33): [True: 4.67k, False: 2.55k] ------------------ 452| 7.22k| node->leaf() + pos.count(), 453| 7.22k| other->leaf()); 454| 19.5k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 442| 10.2k| { 443| 10.2k| auto node = pos.node(); 444| 10.2k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (444:16): [True: 3.76k, False: 6.46k] | Branch (444:33): [True: 2.33k, False: 4.13k] ------------------ 445| 10.2k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 449| 3.84k| { 450| 3.84k| auto node = pos.node(); 451| 3.84k| return node == other || std::equal(node->leaf(), ------------------ | Branch (451:16): [True: 1.33k, False: 2.50k] | Branch (451:33): [True: 660, False: 1.84k] ------------------ 452| 2.50k| node->leaf() + pos.count(), 453| 2.50k| other->leaf()); 454| 3.84k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 442| 4.12k| { 443| 4.12k| auto node = pos.node(); 444| 4.12k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (444:16): [True: 331, False: 3.79k] | Branch (444:33): [True: 1.52k, False: 2.26k] ------------------ 445| 4.12k| } _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_: 111| 279k| { 112| 279k| auto data = as_const(pos.node()->leaf()); 113| 279k| return fn(data, data + pos.count()); 114| 279k| } _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_: 366| 1.43M| return [iter](auto f, auto e) mutable { 367| 1.43M| if (f == &*iter) { ------------------ | Branch (367:17): [True: 208k, False: 1.22M] ------------------ 368| 208k| iter += e - f; 369| 208k| return true; 370| 208k| } 371| 10.5M| for (; f != e; ++f, ++iter) ------------------ | Branch (371:20): [True: 9.34M, False: 1.22M] ------------------ 372| 9.34M| if (*f != *iter) ------------------ | Branch (372:21): [True: 3.35k, False: 9.34M] ------------------ 373| 3.35k| return false; 374| 1.22M| return true; 375| 1.22M| }; _ZN5immer6detail4rbts18region_for_visitorIiE11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 52| 5.55M| { 53| 5.55M| return pos.towards(this_t{}, idx); 54| 5.55M| } _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: 58| 1.18M| { 59| 1.18M| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 60| 1.18M| } _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: 52| 310k| { 53| 310k| return pos.towards(this_t{}, idx); 54| 310k| } _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: 58| 286k| { 59| 286k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 60| 286k| } _ZN5immer6detail4rbts18region_for_visitorIiE11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 52| 343k| { 53| 343k| return pos.towards(this_t{}, idx); 54| 343k| } _ZN5immer6detail4rbts18region_for_visitorIiE10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 58| 24.1k| { 59| 24.1k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 60| 24.1k| } _ZN5immer6detail4rbts18region_for_visitorIiE11visit_innerIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 52| 41.8k| { 53| 41.8k| return pos.towards(this_t{}, idx); 54| 41.8k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 105| 24.1k| { 106| 24.1k| return pos.each_pred(this_t{}, fn); 107| 24.1k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESH_RNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 328| 990| { 329| 990| return posl.nth_sub(i, this_t{}, posr, first, idx); 330| 990| } _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: 418| 9.18k| { 419| 9.18k| return posl.count() >= posr.count() ------------------ | Branch (419:16): [True: 9.18k, False: 0] ------------------ 420| 9.18k| ? this_t::visit_regular(posl, posr.node()) 421| 9.18k| : this_t::visit_regular(posr, posl.node()); 422| 9.18k| } _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_: 111| 1.13M| { 112| 1.13M| auto data = as_const(pos.node()->leaf()); 113| 1.13M| return fn(data, data + pos.count()); 114| 1.13M| } _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_: 105| 18.5k| { 106| 18.5k| return pos.each_pred(this_t{}, fn); 107| 18.5k| } _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_: 111| 17.3k| { 112| 17.3k| auto data = as_const(pos.node()->leaf()); 113| 17.3k| return fn(data, data + pos.count()); 114| 17.3k| } _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_: 105| 3.40k| { 106| 3.40k| return pos.each_pred(this_t{}, fn); 107| 3.40k| } _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: 328| 2.07k| { 329| 2.07k| return posl.nth_sub(i, this_t{}, posr, first, idx); 330| 2.07k| } _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: 381| 2.96k| { 382| 2.96k| auto nl = posl.node(); 383| 2.96k| auto nr = posr.node(); 384| 2.96k| if (nl == nr) ------------------ | Branch (384:13): [True: 0, False: 2.96k] ------------------ 385| 0| return true; 386| 2.96k| auto cl = posl.count(); 387| 2.96k| auto cr = posr.count(); 388| 2.96k| assert(cr > 0); 389| 0| auto sbr = size_t{}; 390| 2.96k| auto i = count_t{}; 391| 2.96k| auto j = count_t{}; 392| 12.2k| for (; i < cl; ++i) { ------------------ | Branch (392:16): [True: 10.5k, False: 1.73k] ------------------ 393| 10.5k| auto sbl = posl.size_before(i); 394| 17.0k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (394:20): [True: 14.2k, False: 2.88k] | Branch (394:34): [True: 6.55k, False: 7.65k] ------------------ 395| 6.55k| ; 396| 10.5k| auto res = 397| 10.5k| sbl == sbr ------------------ | Branch (397:17): [True: 6.15k, False: 4.38k] ------------------ 398| 10.5k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 399| 10.5k| : posl.nth_sub(i, 400| 4.38k| for_each_chunk_p_visitor{}, 401| 4.38k| this_t::equal_chunk_p(first + (idx + sbl))); 402| 10.5k| if (!res) ------------------ | Branch (402:17): [True: 1.22k, False: 9.31k] ------------------ 403| 1.22k| return false; 404| 10.5k| } 405| 1.73k| return true; 406| 2.96k| } _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: 335| 8.16k| { 336| 8.16k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 337| 8.16k| } _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: 426| 8.16k| { 427| 8.16k| if (posl.node() == posr.node()) ------------------ | Branch (427:13): [True: 4.78k, False: 3.38k] ------------------ 428| 4.78k| return true; 429| 3.38k| auto cl = posl.count(); 430| 3.38k| auto cr = posr.count(); 431| 3.38k| auto mp = std::min(cl, cr); 432| 3.38k| return std::equal(posl.node()->leaf(), ------------------ | Branch (432:16): [True: 2.85k, False: 533] ------------------ 433| 3.38k| posl.node()->leaf() + mp, 434| 3.38k| posr.node()->leaf()) && 435| 3.38k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (435:16): [True: 2.85k, False: 0] ------------------ 436| 2.85k| posl.node()->leaf() + posl.count(), 437| 2.85k| first + (idx + mp)); 438| 8.16k| } _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: 328| 2.11k| { 329| 2.11k| return posl.nth_sub(i, this_t{}, posr, first, idx); 330| 2.11k| } _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: 381| 1.06k| { 382| 1.06k| auto nl = posl.node(); 383| 1.06k| auto nr = posr.node(); 384| 1.06k| if (nl == nr) ------------------ | Branch (384:13): [True: 0, False: 1.06k] ------------------ 385| 0| return true; 386| 1.06k| auto cl = posl.count(); 387| 1.06k| auto cr = posr.count(); 388| 1.06k| assert(cr > 0); 389| 0| auto sbr = size_t{}; 390| 1.06k| auto i = count_t{}; 391| 1.06k| auto j = count_t{}; 392| 8.06k| for (; i < cl; ++i) { ------------------ | Branch (392:16): [True: 7.22k, False: 836] ------------------ 393| 7.22k| auto sbl = posl.size_before(i); 394| 13.2k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (394:20): [True: 12.5k, False: 740] | Branch (394:34): [True: 6.05k, False: 6.48k] ------------------ 395| 6.05k| ; 396| 7.22k| auto res = 397| 7.22k| sbl == sbr ------------------ | Branch (397:17): [True: 4.68k, False: 2.54k] ------------------ 398| 7.22k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 399| 7.22k| : posl.nth_sub(i, 400| 2.54k| for_each_chunk_p_visitor{}, 401| 2.54k| this_t::equal_chunk_p(first + (idx + sbl))); 402| 7.22k| if (!res) ------------------ | Branch (402:17): [True: 230, False: 6.99k] ------------------ 403| 230| return false; 404| 7.22k| } 405| 836| return true; 406| 1.06k| } _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: 418| 1.05k| { 419| 1.05k| return posl.count() >= posr.count() ------------------ | Branch (419:16): [True: 1.05k, False: 0] ------------------ 420| 1.05k| ? this_t::visit_regular(posl, posr.node()) 421| 1.05k| : this_t::visit_regular(posr, posl.node()); 422| 1.05k| } _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_: 105| 170k| { 106| 170k| return pos.each_pred(this_t{}, fn); 107| 170k| } _ZN5immer6detail4rbts14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaOT_: 365| 69.9k| { 366| 69.9k| return [iter](auto f, auto e) mutable { 367| 69.9k| if (f == &*iter) { 368| 69.9k| iter += e - f; 369| 69.9k| return true; 370| 69.9k| } 371| 69.9k| for (; f != e; ++f, ++iter) 372| 69.9k| if (*f != *iter) 373| 69.9k| return false; 374| 69.9k| return true; 375| 69.9k| }; 376| 69.9k| } _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: 348| 1.13k| { 349| 1.13k| assert(shiftl <= posr.shift()); 350| 1.13k| return shiftl == posr.shift() ------------------ | Branch (350:20): [True: 872, False: 264] ------------------ 351| 1.13k| ? visit_maybe_relaxed_sub(rootl, 352| 872| shiftl, 353| 872| sizel, 354| 872| this_t{}, 355| 872| posr, 356| 872| first, 357| 872| size_t{}) 358| 1.13k| : posr.first_sub_inner( 359| 264| rrb{}, first, rootl, shiftl, sizel); 360| 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: 348| 10.0k| { 349| 10.0k| assert(shiftl <= posr.shift()); 350| 10.0k| return shiftl == posr.shift() ------------------ | Branch (350:20): [True: 10.0k, False: 0] ------------------ 351| 10.0k| ? visit_maybe_relaxed_sub(rootl, 352| 10.0k| shiftl, 353| 10.0k| sizel, 354| 10.0k| this_t{}, 355| 10.0k| posr, 356| 10.0k| first, 357| 10.0k| size_t{}) 358| 10.0k| : posr.first_sub_inner( 359| 0| rrb{}, first, rootl, shiftl, sizel); 360| 10.0k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 449| 9.05k| { 450| 9.05k| auto node = pos.node(); 451| 9.05k| return node == other || std::equal(node->leaf(), ------------------ | Branch (451:16): [True: 5.72k, False: 3.33k] | Branch (451:33): [True: 2.03k, False: 1.30k] ------------------ 452| 3.33k| node->leaf() + pos.count(), 453| 3.33k| other->leaf()); 454| 9.05k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_11dec_visitorEJEEEDcPT_jmT0_DpOT1_: 1830| 137M|{ 1831| 137M| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 137M| if (relaxed) { ------------------ | Branch (1833:9): [True: 126M, False: 11.3M] ------------------ 1834| 126M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 126M| .visit(v, std::forward(args)...); 1837| 126M| } else { 1838| 11.3M| return make_regular_sub_pos(node, shift, size) 1839| 11.3M| .visit(v, std::forward(args)...); 1840| 11.3M| } 1841| 137M|} _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: 1820| 354M|{ 1821| 354M| assert(node); 1822| 0| assert(relaxed); 1823| 0| assert(shift >= NodeT::bits_leaf); 1824| 0| return {node, shift, relaxed}; 1825| 354M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1805| 143M| { 1806| 143M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 143M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 1423| 239M| 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_: 1468| 27.9M| { 1469| 27.9M| each_left(v, relaxed_->d.count, args...); 1470| 27.9M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1615| 28.1M| { 1616| 28.1M| auto p = node_->inner(); 1617| 28.1M| auto s = size_t{}; 1618| 28.1M| if (shift_ == BL) { ------------------ | Branch (1618:13): [True: 5.76M, False: 22.3M] ------------------ 1619| 46.6M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1619:39): [True: 40.8M, False: 5.76M] ------------------ 1620| 40.8M| IMMER_PREFETCH(p + i + 1); 1621| 40.8M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1622| 40.8M| .visit(v, args...); 1623| 40.8M| s = relaxed_->d.sizes[i]; 1624| 40.8M| assert(s); 1625| 40.8M| } 1626| 22.3M| } else { 1627| 22.3M| auto ss = shift_ - B; 1628| 158M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1628:39): [True: 136M, False: 22.3M] ------------------ 1629| 136M| visit_maybe_relaxed_sub( 1630| 136M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1631| 136M| s = relaxed_->d.sizes[i]; 1632| 136M| assert(s); 1633| 136M| } 1634| 22.3M| } 1635| 28.1M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 1422| 215M| 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: 1036| 20.4M|{ 1037| 20.4M| assert(node); 1038| 0| assert(shift >= NodeT::bits_leaf); 1039| 0| assert(size > 0); 1040| 0| assert(size <= (branches << shift)); 1041| 0| return {node, shift, size}; 1042| 20.4M|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1028| 11.3M| { 1029| 11.3M| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 11.3M| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 777| 20.6M| node_t* node() const { return node_; } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 817| 281k| { 818| 281k| return each_regular(*this, v, args...); 819| 281k| } _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_: 341| 281k|{ 342| 281k| constexpr auto B = bits; 343| 281k| constexpr auto BL = bits_leaf; 344| 281k| auto n = p.node()->inner(); 345| 281k| auto last = p.count() - 1; 346| 281k| auto e = n + last; 347| 281k| if (p.shift() == BL) { ------------------ | Branch (347:9): [True: 83.2k, False: 198k] ------------------ 348| 228k| for (; n != e; ++n) { ------------------ | Branch (348:16): [True: 145k, False: 83.2k] ------------------ 349| 145k| IMMER_PREFETCH(n + 1); 350| 145k| make_full_leaf_pos(*n).visit(v, args...); 351| 145k| } 352| 83.2k| make_leaf_pos(*n, p.size()).visit(v, args...); 353| 198k| } else { 354| 198k| auto ss = p.shift() - B; 355| 690k| for (; n != e; ++n) ------------------ | Branch (355:16): [True: 491k, False: 198k] ------------------ 356| 491k| make_full_pos(*n, ss).visit(v, args...); 357| 198k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 358| 198k| } 359| 281k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 779| 8.54M| 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_: 212| 11.9M|{ 213| 11.9M| assert(node); 214| 0| return {node}; 215| 11.9M|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 205| 1.41M| { 206| 1.41M| return Visitor::visit_leaf(*this, std::forward(args)...); 207| 1.41M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 197| 7.22M| 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: 196| 11.2M| count_t count() const { return branches; } _ZN5immer6detail4rbts13make_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_8leaf_posIT_EEPSE_m: 118| 1.30M|{ 119| 1.30M| assert(node); 120| 0| assert(size > 0); 121| 0| return {node, size}; 122| 1.30M|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 778| 6.79M| 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_: 111| 266k| { 112| 266k| return Visitor::visit_leaf(*this, std::forward(args)...); 113| 266k| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 103| 1.30M| node_t* node() const { return node_; } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 102| 2.03M| 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: 106| 2.09M| 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: 1404| 3.00M|{ 1405| 3.00M| assert(node); 1406| 0| assert(shift >= NodeT::bits_leaf); 1407| 0| return {node, shift}; 1408| 3.00M|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1397| 1.36M| { 1398| 1.36M| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 1.36M| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 1151| 2.01M| 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_: 1177| 111k| { 1178| 111k| auto p = node_->inner(); 1179| 111k| auto e = p + branches; 1180| 111k| if (shift_ == BL) { ------------------ | Branch (1180:13): [True: 98.7k, False: 13.0k] ------------------ 1181| 888k| for (; p != e; ++p) { ------------------ | Branch (1181:20): [True: 790k, False: 98.7k] ------------------ 1182| 790k| IMMER_PREFETCH(p + 1); 1183| 790k| make_full_leaf_pos(*p).visit(v, args...); 1184| 790k| } 1185| 98.7k| } else { 1186| 13.0k| auto ss = shift_ - B; 1187| 117k| for (; p != e; ++p) ------------------ | Branch (1187:20): [True: 104k, False: 13.0k] ------------------ 1188| 104k| make_full_pos(*p, ss).visit(v, args...); 1189| 13.0k| } 1190| 111k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 1150| 1.33M| 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: 688| 2.90M|{ 689| 2.90M| assert(node); 690| 0| assert(shift >= NodeT::bits_leaf); 691| 0| assert(size > 0); 692| 0| return {node, shift, size}; 693| 2.90M|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 334| 525k| { 335| 525k| return Visitor::visit_regular(*this, std::forward(args)...); 336| 525k| } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 229| 4.96M| 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_: 241| 497k| { 242| 497k| return each_regular(*this, v, args...); 243| 497k| } _ZN5immer6detail4rbts12each_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_11dec_visitorEJEEEvOT_T0_DpOT1_: 341| 497k|{ 342| 497k| constexpr auto B = bits; 343| 497k| constexpr auto BL = bits_leaf; 344| 497k| auto n = p.node()->inner(); 345| 497k| auto last = p.count() - 1; 346| 497k| auto e = n + last; 347| 497k| if (p.shift() == BL) { ------------------ | Branch (347:9): [True: 178k, False: 318k] ------------------ 348| 646k| for (; n != e; ++n) { ------------------ | Branch (348:16): [True: 467k, False: 178k] ------------------ 349| 467k| IMMER_PREFETCH(n + 1); 350| 467k| make_full_leaf_pos(*n).visit(v, args...); 351| 467k| } 352| 178k| make_leaf_pos(*n, p.size()).visit(v, args...); 353| 318k| } else { 354| 318k| auto ss = p.shift() - B; 355| 1.07M| for (; n != e; ++n) ------------------ | Branch (355:16): [True: 758k, False: 318k] ------------------ 356| 758k| make_full_pos(*n, ss).visit(v, args...); 357| 318k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 358| 318k| } 359| 497k|} _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 231| 4.76M| shift_t shift() const { return shift_; } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 230| 8.95M| size_t size() const { return size_; } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 228| 2.68M| 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: 232| 7.41M| 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: 776| 15.9M| 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: 781| 18.5M| 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_: 63| 1.60M|{ 64| 1.60M| return {node}; 65| 1.60M|} _ZN5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 56| 1.60M| { 57| 1.60M| return Visitor::visit_regular(*this, std::forward(args)...); 58| 1.60M| } _ZNK5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 41| 1.60M| 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: 150| 63.9M|{ 151| 63.9M| assert(node); 152| 0| assert(count <= branches); 153| 0| return {node, count}; 154| 63.9M|} _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 143| 45.6M| { 144| 45.6M| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 45.6M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 135| 57.1M| 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: 134| 19.2M| 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_: 87| 1.27M|{ 88| 1.27M| assert(node); 89| 0| return {node}; 90| 1.27M|} _ZN5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 80| 1.27M| { 81| 1.27M| return Visitor::visit_leaf(*this, std::forward(args)...); 82| 1.27M| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 74| 1.27M| 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: 73| 9.37k| 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_: 1805| 215k| { 1806| 215k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 215k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 1425| 22.3M| shift_t shift() const { return shift_; } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEj: 1435| 10.9M| { 1436| 10.9M| return size_sbh(offset, size_before(offset)); 1437| 10.9M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8size_sbhEjm: 1440| 11.2M| { 1441| 11.2M| assert(size_before_hint == size_before(offset)); 1442| 0| return relaxed_->d.sizes[offset] - size_before_hint; 1443| 11.2M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11size_beforeEj: 1430| 39.4M| { 1431| 39.4M| return offset ? relaxed_->d.sizes[offset - 1] : 0; ------------------ | Branch (1431:16): [True: 26.1M, False: 13.2M] ------------------ 1432| 39.4M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11last_oh_cshINS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcT_jmDpOT0_: 1729| 198k| { 1730| 198k| assert(offset_hint == count() - 1); 1731| 0| assert(child_size_hint == size(offset_hint)); 1732| 0| auto child = node_->inner()[offset_hint]; 1733| 198k| auto is_leaf = shift_ == BL; 1734| 198k| return is_leaf ------------------ | Branch (1734:16): [True: 0, False: 198k] ------------------ 1735| 198k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1736| 198k| : visit_maybe_relaxed_sub( 1737| 198k| child, shift_ - B, child_size_hint, v, args...); 1738| 198k| } _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_: 1830| 198k|{ 1831| 198k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 198k| if (relaxed) { ------------------ | Branch (1833:9): [True: 158k, False: 40.6k] ------------------ 1834| 158k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 158k| .visit(v, std::forward(args)...); 1837| 158k| } else { 1838| 40.6k| return make_regular_sub_pos(node, shift, size) 1839| 40.6k| .visit(v, std::forward(args)...); 1840| 40.6k| } 1841| 198k|} _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_: 1028| 40.6k| { 1029| 40.6k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 40.6k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 780| 2.46M| 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_: 944| 156k| { 945| 156k| return last_oh_regular(*this, v, offset_hint, args...); 946| 156k| } _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_: 675| 156k|{ 676| 156k| assert(offset_hint == p.count() - 1); 677| 0| constexpr auto B = bits; 678| 156k| constexpr auto BL = bits_leaf; 679| 156k| auto child = p.node()->inner()[offset_hint]; 680| 156k| auto is_leaf = p.shift() == BL; 681| 156k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (681:12): [True: 0, False: 156k] ------------------ 682| 156k| : make_regular_pos(child, p.shift() - B, p.size()) 683| 156k| .visit(v, args...); 684| 156k|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_DpOT0_: 334| 444k| { 335| 444k| return Visitor::visit_regular(*this, std::forward(args)...); 336| 444k| } _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_: 328| 287k| { 329| 287k| return last_oh_regular(*this, v, offset_hint, args...); 330| 287k| } _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_: 675| 287k|{ 676| 287k| assert(offset_hint == p.count() - 1); 677| 0| constexpr auto B = bits; 678| 287k| constexpr auto BL = bits_leaf; 679| 287k| auto child = p.node()->inner()[offset_hint]; 680| 287k| auto is_leaf = p.shift() == BL; 681| 287k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (681:12): [True: 0, False: 287k] ------------------ 682| 287k| : make_regular_pos(child, p.shift() - B, p.size()) 683| 287k| .visit(v, args...); 684| 287k|} _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 1424| 93.6M| 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_: 1028| 144k| { 1029| 144k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 144k| } 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_: 143| 301k| { 144| 301k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 301k| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 138| 1.59M| 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_: 1830| 138k|{ 1831| 138k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 138k| if (relaxed) { ------------------ | Branch (1833:9): [True: 88.7k, False: 49.4k] ------------------ 1834| 88.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 88.7k| .visit(v, std::forward(args)...); 1837| 88.7k| } else { 1838| 49.4k| return make_regular_sub_pos(node, shift, size) 1839| 49.4k| .visit(v, std::forward(args)...); 1840| 49.4k| } 1841| 138k|} 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_: 1805| 88.7k| { 1806| 88.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 88.7k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 1446| 18.6M| { 1447| 18.6M| auto offset = idx >> shift_; 1448| 26.1M| while (relaxed_->d.sizes[offset] <= idx) ------------------ | Branch (1448:16): [True: 7.56M, False: 18.6M] ------------------ 1449| 7.56M| ++offset; 1450| 18.6M| return offset; 1451| 18.6M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7relaxedEv: 1427| 88.7k| 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_: 1678| 88.7k| { 1679| 88.7k| assert(offset_hint == index(idx)); 1680| 88.7k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1680:26): [True: 9.77k, False: 78.9k] ------------------ 1681| 88.7k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1682| 88.7k| } 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_: 1690| 88.7k| { 1691| 88.7k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1692| 88.7k| } 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_: 1709| 88.7k| { 1710| 88.7k| assert(offset_hint == index(idx)); 1711| 0| assert(left_size_hint == 1712| 88.7k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1713| 0| auto child = node_->inner()[offset_hint]; 1714| 88.7k| auto is_leaf = shift_ == BL; 1715| 88.7k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1716| 88.7k| auto next_idx = idx - left_size_hint; 1717| 88.7k| return is_leaf ------------------ | Branch (1717:16): [True: 12.7k, False: 75.9k] ------------------ 1718| 88.7k| ? make_leaf_sub_pos(child, next_size) 1719| 12.7k| .visit(v, next_idx, args...) 1720| 88.7k| : visit_maybe_relaxed_sub( 1721| 75.9k| child, shift_ - B, next_size, v, next_idx, args...); 1722| 88.7k| } 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_: 143| 12.7k| { 144| 12.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 12.7k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 1028| 49.4k| { 1029| 49.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 49.4k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_: 930| 49.4k| { 931| 49.4k| return towards_oh_ch_regular( 932| 49.4k| *this, v, idx, offset_hint, count(), args...); 933| 49.4k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_14update_visitorISD_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcOSL_T0_mjjDpOT1_: 630| 49.4k|{ 631| 49.4k| constexpr auto B = bits; 632| 49.4k| constexpr auto BL = bits_leaf; 633| 49.4k| assert(offset_hint == p.index(idx)); 634| 0| assert(count_hint == p.count()); 635| 0| auto is_leaf = p.shift() == BL; 636| 49.4k| auto child = p.node()->inner()[offset_hint]; 637| 49.4k| auto is_full = offset_hint + 1 != count_hint; 638| 49.4k| return is_full ------------------ | Branch (638:12): [True: 20.4k, False: 28.9k] ------------------ 639| 49.4k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (639:19): [True: 14.8k, False: 5.58k] ------------------ 640| 20.4k| : make_full_pos(child, p.shift() - B) 641| 5.58k| .visit(v, idx, args...)) 642| 49.4k| : (is_leaf ------------------ | Branch (642:19): [True: 15.1k, False: 13.8k] ------------------ 643| 28.9k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 644| 28.9k| : make_regular_pos(child, p.shift() - B, p.size()) 645| 13.8k| .visit(v, idx, args...)); 646| 49.4k|} flex-vector-bo.cpp:_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 205| 22.4k| { 206| 22.4k| return Visitor::visit_leaf(*this, std::forward(args)...); 207| 22.4k| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 200| 352k| 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_: 1397| 9.67k| { 1398| 9.67k| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 9.67k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 1154| 763k| 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_: 1321| 9.67k| { 1322| 9.67k| return towards_oh(v, idx, offset_hint, args...); 1323| 9.67k| } 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_: 1328| 9.67k| { 1329| 9.67k| assert(offset_hint == index(idx)); 1330| 0| auto is_leaf = shift_ == BL; 1331| 9.67k| auto child = node_->inner()[offset_hint]; 1332| 9.67k| return is_leaf ------------------ | Branch (1332:16): [True: 6.81k, False: 2.86k] ------------------ 1333| 9.67k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1334| 9.67k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1335| 9.67k| } 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_: 111| 26.9k| { 112| 26.9k| return Visitor::visit_leaf(*this, std::forward(args)...); 113| 26.9k| } 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_: 334| 14.1k| { 335| 14.1k| return Visitor::visit_regular(*this, std::forward(args)...); 336| 14.1k| } 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_: 314| 14.1k| { 315| 14.1k| return towards_oh_ch_regular( 316| 14.1k| *this, v, idx, offset_hint, count(), args...); 317| 14.1k| } 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_: 630| 14.1k|{ 631| 14.1k| constexpr auto B = bits; 632| 14.1k| constexpr auto BL = bits_leaf; 633| 14.1k| assert(offset_hint == p.index(idx)); 634| 0| assert(count_hint == p.count()); 635| 0| auto is_leaf = p.shift() == BL; 636| 14.1k| auto child = p.node()->inner()[offset_hint]; 637| 14.1k| auto is_full = offset_hint + 1 != count_hint; 638| 14.1k| return is_full ------------------ | Branch (638:12): [True: 2.01k, False: 12.1k] ------------------ 639| 14.1k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (639:19): [True: 778, False: 1.23k] ------------------ 640| 2.01k| : make_full_pos(child, p.shift() - B) 641| 1.23k| .visit(v, idx, args...)) 642| 14.1k| : (is_leaf ------------------ | Branch (642:19): [True: 11.8k, False: 318] ------------------ 643| 12.1k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 644| 12.1k| : make_regular_pos(child, p.shift() - B, p.size()) 645| 318| .visit(v, idx, args...)); 646| 14.1k|} _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_: 1830| 39.6k|{ 1831| 39.6k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 39.6k| if (relaxed) { ------------------ | Branch (1833:9): [True: 31.9k, False: 7.68k] ------------------ 1834| 31.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 31.9k| .visit(v, std::forward(args)...); 1837| 31.9k| } else { 1838| 7.68k| return make_regular_sub_pos(node, shift, size) 1839| 7.68k| .visit(v, std::forward(args)...); 1840| 7.68k| } 1841| 39.6k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1805| 31.9k| { 1806| 31.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 31.9k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 1678| 24.6k| { 1679| 24.6k| assert(offset_hint == index(idx)); 1680| 24.6k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1680:26): [True: 0, False: 24.6k] ------------------ 1681| 24.6k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1682| 24.6k| } _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_: 1690| 24.6k| { 1691| 24.6k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1692| 24.6k| } _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_: 1709| 24.6k| { 1710| 24.6k| assert(offset_hint == index(idx)); 1711| 0| assert(left_size_hint == 1712| 24.6k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1713| 0| auto child = node_->inner()[offset_hint]; 1714| 24.6k| auto is_leaf = shift_ == BL; 1715| 24.6k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1716| 24.6k| auto next_idx = idx - left_size_hint; 1717| 24.6k| return is_leaf ------------------ | Branch (1717:16): [True: 1.97k, False: 22.6k] ------------------ 1718| 24.6k| ? make_leaf_sub_pos(child, next_size) 1719| 1.97k| .visit(v, next_idx, args...) 1720| 24.6k| : visit_maybe_relaxed_sub( 1721| 22.6k| child, shift_ - B, next_size, v, next_idx, args...); 1722| 24.6k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 143| 1.97k| { 144| 1.97k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 1.97k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1678| 10.8k| { 1679| 10.8k| assert(offset_hint == index(idx)); 1680| 10.8k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1680:26): [True: 9.45k, False: 1.43k] ------------------ 1681| 10.8k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1682| 10.8k| } _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_: 1690| 10.8k| { 1691| 10.8k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1692| 10.8k| } _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_: 1709| 10.8k| { 1710| 10.8k| assert(offset_hint == index(idx)); 1711| 0| assert(left_size_hint == 1712| 10.8k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1713| 0| auto child = node_->inner()[offset_hint]; 1714| 10.8k| auto is_leaf = shift_ == BL; 1715| 10.8k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1716| 10.8k| auto next_idx = idx - left_size_hint; 1717| 10.8k| return is_leaf ------------------ | Branch (1717:16): [True: 4.35k, False: 6.52k] ------------------ 1718| 10.8k| ? make_leaf_sub_pos(child, next_size) 1719| 4.35k| .visit(v, next_idx, args...) 1720| 10.8k| : visit_maybe_relaxed_sub( 1721| 6.52k| child, shift_ - B, next_size, v, next_idx, args...); 1722| 10.8k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 143| 4.35k| { 144| 4.35k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 4.35k| } _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_: 1830| 6.52k|{ 1831| 6.52k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 6.52k| if (relaxed) { ------------------ | Branch (1833:9): [True: 3.59k, False: 2.93k] ------------------ 1834| 3.59k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 3.59k| .visit(v, std::forward(args)...); 1837| 3.59k| } else { 1838| 2.93k| return make_regular_sub_pos(node, shift, size) 1839| 2.93k| .visit(v, std::forward(args)...); 1840| 2.93k| } 1841| 6.52k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1805| 3.59k| { 1806| 3.59k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 3.59k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1028| 2.93k| { 1029| 2.93k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 2.93k| } _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_: 919| 5.87k| { 920| 5.87k| return towards_oh_ch_regular( 921| 5.87k| *this, v, idx, offset_hint, count(), args...); 922| 5.87k| } _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_: 630| 5.87k|{ 631| 5.87k| constexpr auto B = bits; 632| 5.87k| constexpr auto BL = bits_leaf; 633| 5.87k| assert(offset_hint == p.index(idx)); 634| 0| assert(count_hint == p.count()); 635| 0| auto is_leaf = p.shift() == BL; 636| 5.87k| auto child = p.node()->inner()[offset_hint]; 637| 5.87k| auto is_full = offset_hint + 1 != count_hint; 638| 5.87k| return is_full ------------------ | Branch (638:12): [True: 1.74k, False: 4.13k] ------------------ 639| 5.87k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (639:19): [True: 1.01k, False: 725] ------------------ 640| 1.74k| : make_full_pos(child, p.shift() - B) 641| 725| .visit(v, idx, args...)) 642| 5.87k| : (is_leaf ------------------ | Branch (642:19): [True: 1.48k, False: 2.64k] ------------------ 643| 4.13k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 644| 4.13k| : make_regular_pos(child, p.shift() - B, p.size()) 645| 2.64k| .visit(v, idx, args...)); 646| 5.87k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 205| 5.33k| { 206| 5.33k| return Visitor::visit_leaf(*this, std::forward(args)...); 207| 5.33k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1397| 2.20k| { 1398| 2.20k| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 2.20k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1328| 4.59k| { 1329| 4.59k| assert(offset_hint == index(idx)); 1330| 0| auto is_leaf = shift_ == BL; 1331| 4.59k| auto child = node_->inner()[offset_hint]; 1332| 4.59k| return is_leaf ------------------ | Branch (1332:16): [True: 3.68k, False: 902] ------------------ 1333| 4.59k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1334| 4.59k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1335| 4.59k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 1153| 70.3k| shift_t shift() const { return shift_; } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 111| 2.92k| { 112| 2.92k| return Visitor::visit_leaf(*this, std::forward(args)...); 113| 2.92k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 334| 3.13k| { 335| 3.13k| return Visitor::visit_regular(*this, std::forward(args)...); 336| 3.13k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 303| 3.13k| { 304| 3.13k| return towards_oh_ch_regular( 305| 3.13k| *this, v, idx, offset_hint, count(), args...); 306| 3.13k| } _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_: 630| 3.13k|{ 631| 3.13k| constexpr auto B = bits; 632| 3.13k| constexpr auto BL = bits_leaf; 633| 3.13k| assert(offset_hint == p.index(idx)); 634| 0| assert(count_hint == p.count()); 635| 0| auto is_leaf = p.shift() == BL; 636| 3.13k| auto child = p.node()->inner()[offset_hint]; 637| 3.13k| auto is_full = offset_hint + 1 != count_hint; 638| 3.13k| return is_full ------------------ | Branch (638:12): [True: 1.21k, False: 1.91k] ------------------ 639| 3.13k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (639:19): [True: 630, False: 582] ------------------ 640| 1.21k| : make_full_pos(child, p.shift() - B) 641| 582| .visit(v, idx, args...)) 642| 3.13k| : (is_leaf ------------------ | Branch (642:19): [True: 1.43k, False: 482] ------------------ 643| 1.91k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 644| 1.91k| : make_regular_pos(child, p.shift() - B, p.size()) 645| 482| .visit(v, idx, args...)); 646| 3.13k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1028| 7.68k| { 1029| 7.68k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 7.68k| } _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_: 919| 4.74k| { 920| 4.74k| return towards_oh_ch_regular( 921| 4.74k| *this, v, idx, offset_hint, count(), args...); 922| 4.74k| } _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_: 630| 4.74k|{ 631| 4.74k| constexpr auto B = bits; 632| 4.74k| constexpr auto BL = bits_leaf; 633| 4.74k| assert(offset_hint == p.index(idx)); 634| 0| assert(count_hint == p.count()); 635| 0| auto is_leaf = p.shift() == BL; 636| 4.74k| auto child = p.node()->inner()[offset_hint]; 637| 4.74k| auto is_full = offset_hint + 1 != count_hint; 638| 4.74k| return is_full ------------------ | Branch (638:12): [True: 3.86k, False: 888] ------------------ 639| 4.74k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (639:19): [True: 836, False: 3.02k] ------------------ 640| 3.86k| : make_full_pos(child, p.shift() - B) 641| 3.02k| .visit(v, idx, args...)) 642| 4.74k| : (is_leaf ------------------ | Branch (642:19): [True: 888, False: 0] ------------------ 643| 888| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 644| 888| : make_regular_pos(child, p.shift() - B, p.size()) 645| 0| .visit(v, idx, args...)); 646| 4.74k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 205| 1.48k| { 206| 1.48k| return Visitor::visit_leaf(*this, std::forward(args)...); 207| 1.48k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1397| 4.25k| { 1398| 4.25k| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 4.25k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 1328| 1.87k| { 1329| 1.87k| assert(offset_hint == index(idx)); 1330| 0| auto is_leaf = shift_ == BL; 1331| 1.87k| auto child = node_->inner()[offset_hint]; 1332| 1.87k| return is_leaf ------------------ | Branch (1332:16): [True: 644, False: 1.23k] ------------------ 1333| 1.87k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1334| 1.87k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1335| 1.87k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 111| 888| { 112| 888| return Visitor::visit_leaf(*this, std::forward(args)...); 113| 888| } _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_: 1830| 29.2k|{ 1831| 29.2k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 29.2k| if (relaxed) { ------------------ | Branch (1833:9): [True: 21.0k, False: 8.19k] ------------------ 1834| 21.0k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 21.0k| .visit(v, std::forward(args)...); 1837| 21.0k| } else { 1838| 8.19k| return make_regular_sub_pos(node, shift, size) 1839| 8.19k| .visit(v, std::forward(args)...); 1840| 8.19k| } 1841| 29.2k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1805| 21.0k| { 1806| 21.0k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 21.0k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8subindexEm: 1426| 5.93M| 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_: 1697| 3.80k| { 1698| 3.80k| assert(offset_hint == index(idx)); 1699| 3.80k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1699:26): [True: 3.49k, False: 308] ------------------ 1700| 3.80k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1701| 3.80k| } _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_: 1709| 3.80k| { 1710| 3.80k| assert(offset_hint == index(idx)); 1711| 0| assert(left_size_hint == 1712| 3.80k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1713| 0| auto child = node_->inner()[offset_hint]; 1714| 3.80k| auto is_leaf = shift_ == BL; 1715| 3.80k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1716| 3.80k| auto next_idx = idx - left_size_hint; 1717| 3.80k| return is_leaf ------------------ | Branch (1717:16): [True: 0, False: 3.80k] ------------------ 1718| 3.80k| ? make_leaf_sub_pos(child, next_size) 1719| 0| .visit(v, next_idx, args...) 1720| 3.80k| : visit_maybe_relaxed_sub( 1721| 3.80k| child, shift_ - B, next_size, v, next_idx, args...); 1722| 3.80k| } _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_: 1697| 97.2k| { 1698| 97.2k| assert(offset_hint == index(idx)); 1699| 97.2k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1699:26): [True: 27.0k, False: 70.2k] ------------------ 1700| 97.2k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1701| 97.2k| } _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_: 1709| 97.2k| { 1710| 97.2k| assert(offset_hint == index(idx)); 1711| 0| assert(left_size_hint == 1712| 97.2k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1713| 0| auto child = node_->inner()[offset_hint]; 1714| 97.2k| auto is_leaf = shift_ == BL; 1715| 97.2k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1716| 97.2k| auto next_idx = idx - left_size_hint; 1717| 97.2k| return is_leaf ------------------ | Branch (1717:16): [True: 15.9k, False: 81.3k] ------------------ 1718| 97.2k| ? make_leaf_sub_pos(child, next_size) 1719| 15.9k| .visit(v, next_idx, args...) 1720| 97.2k| : visit_maybe_relaxed_sub( 1721| 81.3k| child, shift_ - B, next_size, v, next_idx, args...); 1722| 97.2k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 143| 15.9k| { 144| 15.9k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 15.9k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcPT_jmT0_DpOT1_: 1830| 81.3k|{ 1831| 81.3k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 81.3k| if (relaxed) { ------------------ | Branch (1833:9): [True: 80.0k, False: 1.30k] ------------------ 1834| 80.0k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 80.0k| .visit(v, std::forward(args)...); 1837| 80.0k| } else { 1838| 1.30k| return make_regular_sub_pos(node, shift, size) 1839| 1.30k| .visit(v, std::forward(args)...); 1840| 1.30k| } 1841| 81.3k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1805| 80.0k| { 1806| 80.0k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 80.0k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1028| 1.30k| { 1029| 1.30k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 1.30k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11size_beforeEj: 783| 1.35M| { 784| 1.35M| return size_t{offset} << shift_; 785| 1.35M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8size_sbhEjm: 795| 19.7k| { 796| 19.7k| assert(size_before_hint == size_before(offset)); 797| 19.7k| return offset == subindex(size_ - 1) ? size_ - size_before_hint ------------------ | Branch (797:16): [True: 9.46k, False: 10.3k] ------------------ 798| 19.7k| : size_t{1} << shift_; 799| 19.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_: 938| 8.71k| { 939| 8.71k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 940| 8.71k| } _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_: 651| 8.71k|{ 652| 8.71k| constexpr auto B = bits; 653| 8.71k| constexpr auto BL = bits_leaf; 654| 8.71k| assert(offset_hint == p.index(idx)); 655| 0| auto is_leaf = p.shift() == BL; 656| 8.71k| auto child = p.node()->inner()[offset_hint]; 657| 8.71k| auto lsize = offset_hint << p.shift(); 658| 8.71k| auto size = p.this_size(); 659| 8.71k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 660| 8.71k| return is_full ------------------ | Branch (660:12): [True: 8.71k, False: 0] ------------------ 661| 8.71k| ? (is_leaf ------------------ | Branch (661:19): [True: 4.87k, False: 3.83k] ------------------ 662| 8.71k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 663| 8.71k| : make_full_pos(child, p.shift() - B) 664| 3.83k| .visit(v, idx - lsize, args...)) 665| 8.71k| : (is_leaf ------------------ | Branch (665:19): [True: 0, False: 0] ------------------ 666| 0| ? make_leaf_sub_pos(child, size - lsize) 667| 0| .visit(v, idx - lsize, args...) 668| 0| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 669| 0| .visit(v, idx - lsize, args...)); 670| 8.71k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9this_sizeEv: 786| 19.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_: 205| 9.49k| { 206| 9.49k| return Visitor::visit_leaf(*this, std::forward(args)...); 207| 9.49k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJmEEEDcT_DpOT0_: 1397| 6.32k| { 1398| 6.32k| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 6.32k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8subindexEm: 1155| 9.57k| 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: 1162| 37.6k| { 1163| 37.6k| return size_t{offset} << shift_; 1164| 37.6k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8size_sbhEjm: 1158| 9.57k| { 1159| 9.57k| return size_t{1} << shift_; 1160| 9.57k| } _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_: 1340| 7.10k| { 1341| 7.10k| assert(offset_hint == index(idx)); 1342| 0| auto is_leaf = shift_ == BL; 1343| 7.10k| auto child = node_->inner()[offset_hint]; 1344| 7.10k| auto lsize = size_t{offset_hint} << shift_; 1345| 7.10k| return is_leaf ------------------ | Branch (1345:16): [True: 4.62k, False: 2.48k] ------------------ 1346| 7.10k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1347| 7.10k| : make_full_pos(child, shift_ - B) 1348| 2.48k| .visit(v, idx - lsize, args...); 1349| 7.10k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 1167| 9.57k| { 1168| 9.57k| auto e = sizes + n; 1169| 53.6k| for (; sizes != e; ++sizes) { ------------------ | Branch (1169:16): [True: 44.0k, False: 9.57k] ------------------ 1170| 44.0k| init = *sizes = init + (size_t{1} << shift_); 1171| 44.0k| assert(init); 1172| 44.0k| } 1173| 9.57k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 1152| 592k| 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: 802| 2.55M| { 803| 2.55M| if (n) { ------------------ | Branch (803:13): [True: 2.54M, False: 5.03k] ------------------ 804| 2.54M| auto last = offset + n - 1; 805| 2.54M| auto e = sizes + n - 1; 806| 10.1M| for (; sizes != e; ++sizes) { ------------------ | Branch (806:20): [True: 7.62M, False: 2.54M] ------------------ 807| 7.62M| init = *sizes = init + (size_t{1} << shift_); 808| 7.62M| assert(init); 809| 7.62M| } 810| 2.54M| *sizes = init + size(last); 811| 2.54M| assert(*sizes); 812| 2.54M| } 813| 2.55M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEj: 789| 2.56M| { 790| 2.56M| return offset == subindex(size_ - 1) ? size_ - size_before(offset) ------------------ | Branch (790:16): [True: 1.28M, False: 1.28M] ------------------ 791| 2.56M| : size_t{1} << shift_; 792| 2.56M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 1454| 16.5M| { 1455| 16.5M| auto e = sizes + n; 1456| 16.5M| auto prev = size_before(offset); 1457| 16.5M| auto these = relaxed_->d.sizes + offset; 1458| 76.4M| for (; sizes != e; ++sizes, ++these) { ------------------ | Branch (1458:16): [True: 59.9M, False: 16.5M] ------------------ 1459| 59.9M| auto this_size = *these; 1460| 59.9M| init = *sizes = init + (this_size - prev); 1461| 59.9M| assert(init); 1462| 0| prev = this_size; 1463| 59.9M| } 1464| 16.5M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1028| 8.19k| { 1029| 8.19k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 8.19k| } _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_: 938| 2.75k| { 939| 2.75k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 940| 2.75k| } _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_: 651| 2.75k|{ 652| 2.75k| constexpr auto B = bits; 653| 2.75k| constexpr auto BL = bits_leaf; 654| 2.75k| assert(offset_hint == p.index(idx)); 655| 0| auto is_leaf = p.shift() == BL; 656| 2.75k| auto child = p.node()->inner()[offset_hint]; 657| 2.75k| auto lsize = offset_hint << p.shift(); 658| 2.75k| auto size = p.this_size(); 659| 2.75k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 660| 2.75k| return is_full ------------------ | Branch (660:12): [True: 784, False: 1.96k] ------------------ 661| 2.75k| ? (is_leaf ------------------ | Branch (661:19): [True: 0, False: 784] ------------------ 662| 784| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 663| 784| : make_full_pos(child, p.shift() - B) 664| 784| .visit(v, idx - lsize, args...)) 665| 2.75k| : (is_leaf ------------------ | Branch (665:19): [True: 0, False: 1.96k] ------------------ 666| 1.96k| ? make_leaf_sub_pos(child, size - lsize) 667| 0| .visit(v, idx - lsize, args...) 668| 1.96k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 669| 1.96k| .visit(v, idx - lsize, args...)); 670| 2.75k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_: 1397| 784| { 1398| 784| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 784| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_: 1028| 1.96k| { 1029| 1.96k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 1.96k| } _ZN5immer6detail4rbts30make_singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaPT_j: 758| 9.37k|{ 759| 9.37k| assert(leaf); 760| 9.37k| IMMER_ASSERT_TAGGED(leaf->kind() == NodeT::kind_t::leaf); ------------------ | | 60| 9.37k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 761| 0| assert(count > 0); 762| 0| return singleton_regular_sub_pos{leaf, count}; 763| 9.37k|} _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_: 751| 9.37k| { 752| 9.37k| return Visitor::visit_regular(*this, std::forward(args)...); 753| 9.37k| } _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_: 1830| 9.37k|{ 1831| 9.37k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 9.37k| if (relaxed) { ------------------ | Branch (1833:9): [True: 6.74k, False: 2.62k] ------------------ 1834| 6.74k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 6.74k| .visit(v, std::forward(args)...); 1837| 6.74k| } else { 1838| 2.62k| return make_regular_sub_pos(node, shift, size) 1839| 2.62k| .visit(v, std::forward(args)...); 1840| 2.62k| } 1841| 9.37k|} _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_: 1805| 6.74k| { 1806| 6.74k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 6.74k| } _ZNK5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 729| 33.5k| shift_t shift() const { return BL; } _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 738| 9.37k| {} _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_: 143| 6.93M| { 144| 6.93M| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 6.93M| } _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_: 1805| 93.0M| { 1806| 93.0M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 93.0M| } _ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 704| 2.68M| {} _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_: 738| 9.37k| {} _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_: 143| 6.93M| { 144| 6.93M| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 6.93M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 136| 6.93M| 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_: 1805| 93.0M| { 1806| 93.0M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 93.0M| } _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_: 704| 2.68M| {} _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_: 1754| 23.1k| { 1755| 23.1k| auto child = node_->inner()[0]; 1756| 23.1k| auto child_size = relaxed_->d.sizes[0]; 1757| 23.1k| auto is_leaf = shift_ == BL; 1758| 23.1k| assert(child_size); 1759| 23.1k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1759:16): [True: 0, False: 23.1k] ------------------ 1760| 23.1k| : visit_maybe_relaxed_sub( 1761| 23.1k| child, shift_ - B, child_size, v, args...); 1762| 23.1k| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 75| 9.37k| 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: 137| 3.55M| 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_: 1830| 23.1k|{ 1831| 23.1k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 23.1k| if (relaxed) { ------------------ | Branch (1833:9): [True: 22.8k, False: 304] ------------------ 1834| 22.8k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 22.8k| .visit(v, std::forward(args)...); 1837| 22.8k| } else { 1838| 304| return make_regular_sub_pos(node, shift, size) 1839| 304| .visit(v, std::forward(args)...); 1840| 304| } 1841| 23.1k|} _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_: 1805| 22.8k| { 1806| 22.8k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 22.8k| } _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_: 1028| 304| { 1029| 304| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 304| } _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_: 962| 764| { 963| 764| auto is_leaf = shift_ == BL; 964| 764| auto child = node_->inner()[0]; 965| 764| auto is_full = size_ >= (size_t{1} << shift_); 966| 764| return is_full ------------------ | Branch (966:16): [True: 764, False: 0] ------------------ 967| 764| ? (is_leaf ------------------ | Branch (967:23): [True: 0, False: 764] ------------------ 968| 764| ? make_full_leaf_pos(child).visit(v, args...) 969| 764| : make_full_pos(child, shift_ - B).visit(v, args...)) 970| 764| : (is_leaf ------------------ | Branch (970:23): [True: 0, False: 0] ------------------ 971| 0| ? make_leaf_sub_pos(child, size_).visit(v, args...) 972| 0| : make_regular_sub_pos(child, shift_ - B, size_) 973| 0| .visit(v, args...)); 974| 764| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 199| 315k| 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_: 1397| 1.08k| { 1398| 1.08k| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 1.08k| } _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_: 1353| 319| { 1354| 319| auto is_leaf = shift_ == BL; 1355| 319| auto child = node_->inner()[0]; 1356| 319| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1356:16): [True: 0, False: 319] ------------------ 1357| 319| : make_full_pos(child, shift_ - B).visit(v, args...); 1358| 319| } _ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 707| 69.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_: 1296| 40.5k| { 1297| 40.5k| each_i(v, 1, branches, args...); 1298| 40.5k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE6each_iINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_jjDpOT0_: 1255| 40.5k| { 1256| 40.5k| auto p = node_->inner() + i; 1257| 40.5k| auto e = node_->inner() + n; 1258| 40.5k| if (shift_ == BL) { ------------------ | Branch (1258:13): [True: 28.4k, False: 12.1k] ------------------ 1259| 227k| for (; p != e; ++p) { ------------------ | Branch (1259:20): [True: 198k, False: 28.4k] ------------------ 1260| 198k| IMMER_PREFETCH(p + 1); 1261| 198k| make_full_leaf_pos(*p).visit(v, args...); 1262| 198k| } 1263| 28.4k| } else { 1264| 12.1k| auto ss = shift_ - B; 1265| 96.8k| for (; p != e; ++p) ------------------ | Branch (1265:20): [True: 84.7k, False: 12.1k] ------------------ 1266| 84.7k| make_full_pos(*p, ss).visit(v, args...); 1267| 12.1k| } 1268| 40.5k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcT_DpOT0_: 205| 4.79M| { 206| 4.79M| return Visitor::visit_leaf(*this, std::forward(args)...); 207| 4.79M| } _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_: 1397| 584k| { 1398| 584k| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 584k| } _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_: 707| 69.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_: 1296| 40.5k| { 1297| 40.5k| each_i(v, 1, branches, args...); 1298| 40.5k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE6each_iINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jjDpOT0_: 1255| 40.5k| { 1256| 40.5k| auto p = node_->inner() + i; 1257| 40.5k| auto e = node_->inner() + n; 1258| 40.5k| if (shift_ == BL) { ------------------ | Branch (1258:13): [True: 28.4k, False: 12.1k] ------------------ 1259| 227k| for (; p != e; ++p) { ------------------ | Branch (1259:20): [True: 198k, False: 28.4k] ------------------ 1260| 198k| IMMER_PREFETCH(p + 1); 1261| 198k| make_full_leaf_pos(*p).visit(v, args...); 1262| 198k| } 1263| 28.4k| } else { 1264| 12.1k| auto ss = shift_ - B; 1265| 96.8k| for (; p != e; ++p) ------------------ | Branch (1265:20): [True: 84.7k, False: 12.1k] ------------------ 1266| 84.7k| make_full_pos(*p, ss).visit(v, args...); 1267| 12.1k| } 1268| 40.5k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 205| 4.79M| { 206| 4.79M| return Visitor::visit_leaf(*this, std::forward(args)...); 207| 4.79M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 198| 4.79M| 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_: 1397| 584k| { 1398| 584k| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 584k| } _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_: 745| 764| { 746| 764| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 747| 764| } _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_: 143| 764| { 144| 764| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 764| } _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_: 1362| 764| { 1363| 764| assert(shift_ == BL); 1364| 0| auto child = node_->inner()[0]; 1365| 764| return make_full_leaf_pos(child).visit(v, args...); 1366| 764| } _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_: 205| 2.93k| { 206| 2.93k| return Visitor::visit_leaf(*this, std::forward(args)...); 207| 2.93k| } _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_: 898| 315k| { 899| 315k| if (count() > 1) ------------------ | Branch (899:13): [True: 304k, False: 11.0k] ------------------ 900| 304k| each_right_sub_(v, 1, args...); 901| 315k| } _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_: 871| 304k| { 872| 304k| auto last = count() - 1; 873| 304k| auto lsize = size_ - (last << shift_); 874| 304k| auto n = node()->inner() + i; 875| 304k| auto e = node()->inner() + last; 876| 304k| if (shift() == BL) { ------------------ | Branch (876:13): [True: 276k, False: 28.4k] ------------------ 877| 1.92M| for (; n != e; ++n) { ------------------ | Branch (877:20): [True: 1.64M, False: 276k] ------------------ 878| 1.64M| IMMER_PREFETCH(n + 1); 879| 1.64M| make_full_leaf_pos(*n).visit(v, args...); 880| 1.64M| } 881| 276k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 882| 276k| } else { 883| 28.4k| auto ss = shift_ - B; 884| 142k| for (; n != e; ++n) ------------------ | Branch (884:20): [True: 114k, False: 28.4k] ------------------ 885| 114k| make_full_pos(*n, ss).visit(v, args...); 886| 28.4k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 887| 28.4k| } 888| 304k| } _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_: 1028| 3.12M| { 1029| 3.12M| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 3.12M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 898| 315k| { 899| 315k| if (count() > 1) ------------------ | Branch (899:13): [True: 304k, False: 11.0k] ------------------ 900| 304k| each_right_sub_(v, 1, args...); 901| 315k| } _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_: 871| 304k| { 872| 304k| auto last = count() - 1; 873| 304k| auto lsize = size_ - (last << shift_); 874| 304k| auto n = node()->inner() + i; 875| 304k| auto e = node()->inner() + last; 876| 304k| if (shift() == BL) { ------------------ | Branch (876:13): [True: 276k, False: 28.4k] ------------------ 877| 1.92M| for (; n != e; ++n) { ------------------ | Branch (877:20): [True: 1.64M, False: 276k] ------------------ 878| 1.64M| IMMER_PREFETCH(n + 1); 879| 1.64M| make_full_leaf_pos(*n).visit(v, args...); 880| 1.64M| } 881| 276k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 882| 276k| } else { 883| 28.4k| auto ss = shift_ - B; 884| 142k| for (; n != e; ++n) ------------------ | Branch (884:20): [True: 114k, False: 28.4k] ------------------ 885| 114k| make_full_pos(*n, ss).visit(v, args...); 886| 28.4k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 887| 28.4k| } 888| 304k| } _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_: 1028| 3.12M| { 1029| 3.12M| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 3.12M| } _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 745| 2.16k| { 746| 2.16k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 747| 2.16k| } _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_: 143| 2.16k| { 144| 2.16k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 2.16k| } _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_: 978| 2.16k| { 979| 2.16k| assert(shift_ == BL); 980| 0| auto child = node_->inner()[0]; 981| 2.16k| auto is_full = size_ >= branches; 982| 2.16k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (982:16): [True: 2.16k, False: 0] ------------------ 983| 2.16k| : make_leaf_sub_pos(child, size_).visit(v, args...); 984| 2.16k| } _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_: 143| 6.44k| { 144| 6.44k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 6.44k| } _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_: 1639| 7.98M| { 1640| 7.98M| each_right(v, 1, std::forward(args)...); 1641| 7.98M| } _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_: 1645| 7.98M| { 1646| 7.98M| assert(start > 0); 1647| 0| assert(start <= relaxed_->d.count); 1648| 0| auto s = relaxed_->d.sizes[start - 1]; 1649| 7.98M| auto p = node_->inner(); 1650| 7.98M| if (shift_ == BL) { ------------------ | Branch (1650:13): [True: 650k, False: 7.33M] ------------------ 1651| 3.17M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1651:34): [True: 2.52M, False: 650k] ------------------ 1652| 2.52M| IMMER_PREFETCH(p + i + 1); 1653| 2.52M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1654| 2.52M| .visit(v, args...); 1655| 2.52M| s = relaxed_->d.sizes[i]; 1656| 2.52M| assert(s); 1657| 2.52M| } 1658| 7.33M| } else { 1659| 7.33M| auto ss = shift_ - B; 1660| 53.0M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1660:34): [True: 45.7M, False: 7.33M] ------------------ 1661| 45.7M| visit_maybe_relaxed_sub( 1662| 45.7M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1663| 45.7M| s = relaxed_->d.sizes[i]; 1664| 45.7M| assert(s); 1665| 45.7M| } 1666| 7.33M| } 1667| 7.98M| } _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_: 1830| 78.9M|{ 1831| 78.9M| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 78.9M| if (relaxed) { ------------------ | Branch (1833:9): [True: 75.8M, False: 3.09M] ------------------ 1834| 75.8M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 75.8M| .visit(v, std::forward(args)...); 1837| 75.8M| } else { 1838| 3.09M| return make_regular_sub_pos(node, shift, size) 1839| 3.09M| .visit(v, std::forward(args)...); 1840| 3.09M| } 1841| 78.9M|} _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_: 1639| 7.98M| { 1640| 7.98M| each_right(v, 1, std::forward(args)...); 1641| 7.98M| } _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_: 1645| 7.98M| { 1646| 7.98M| assert(start > 0); 1647| 0| assert(start <= relaxed_->d.count); 1648| 0| auto s = relaxed_->d.sizes[start - 1]; 1649| 7.98M| auto p = node_->inner(); 1650| 7.98M| if (shift_ == BL) { ------------------ | Branch (1650:13): [True: 650k, False: 7.33M] ------------------ 1651| 3.17M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1651:34): [True: 2.52M, False: 650k] ------------------ 1652| 2.52M| IMMER_PREFETCH(p + i + 1); 1653| 2.52M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1654| 2.52M| .visit(v, args...); 1655| 2.52M| s = relaxed_->d.sizes[i]; 1656| 2.52M| assert(s); 1657| 2.52M| } 1658| 7.33M| } else { 1659| 7.33M| auto ss = shift_ - B; 1660| 53.0M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1660:34): [True: 45.7M, False: 7.33M] ------------------ 1661| 45.7M| visit_maybe_relaxed_sub( 1662| 45.7M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1663| 45.7M| s = relaxed_->d.sizes[i]; 1664| 45.7M| assert(s); 1665| 45.7M| } 1666| 7.33M| } 1667| 7.98M| } _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_: 1830| 78.9M|{ 1831| 78.9M| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 78.9M| if (relaxed) { ------------------ | Branch (1833:9): [True: 75.8M, False: 3.09M] ------------------ 1834| 75.8M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 75.8M| .visit(v, std::forward(args)...); 1837| 75.8M| } else { 1838| 3.09M| return make_regular_sub_pos(node, shift, size) 1839| 3.09M| .visit(v, std::forward(args)...); 1840| 3.09M| } 1841| 78.9M|} _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_: 745| 6.44k| { 746| 6.44k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 747| 6.44k| } _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_: 143| 6.44k| { 144| 6.44k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 6.44k| } _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_: 1766| 6.44k| { 1767| 6.44k| assert(shift_ == BL); 1768| 0| auto child = node_->inner()[0]; 1769| 6.44k| auto child_size = relaxed_->d.sizes[0]; 1770| 6.44k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1771| 6.44k| } _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_: 1028| 2.62k| { 1029| 2.62k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 2.62k| } _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_: 1830| 957k|{ 1831| 957k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 957k| if (relaxed) { ------------------ | Branch (1833:9): [True: 940k, False: 16.9k] ------------------ 1834| 940k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 940k| .visit(v, std::forward(args)...); 1837| 940k| } else { 1838| 16.9k| return make_regular_sub_pos(node, shift, size) 1839| 16.9k| .visit(v, std::forward(args)...); 1840| 16.9k| } 1841| 957k|} _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_: 1805| 940k| { 1806| 940k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 940k| } _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_: 1830| 940k|{ 1831| 940k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 940k| if (relaxed) { ------------------ | Branch (1833:9): [True: 925k, False: 15.0k] ------------------ 1834| 925k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 925k| .visit(v, std::forward(args)...); 1837| 925k| } else { 1838| 15.0k| return make_regular_sub_pos(node, shift, size) 1839| 15.0k| .visit(v, std::forward(args)...); 1840| 15.0k| } 1841| 940k|} _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_: 1805| 925k| { 1806| 925k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 925k| } _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_: 1742| 2.65M| { 1743| 2.65M| auto offset = relaxed_->d.count - 1; 1744| 2.65M| auto child = node_->inner()[offset]; 1745| 2.65M| auto child_size = size(offset); 1746| 2.65M| auto is_leaf = shift_ == BL; 1747| 2.65M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1747:16): [True: 0, False: 2.65M] ------------------ 1748| 2.65M| : visit_maybe_relaxed_sub( 1749| 2.65M| child, shift_ - B, child_size, v, args...); 1750| 2.65M| } _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_: 1830| 2.65M|{ 1831| 2.65M| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 2.65M| if (relaxed) { ------------------ | Branch (1833:9): [True: 2.65M, False: 2.04k] ------------------ 1834| 2.65M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 2.65M| .visit(v, std::forward(args)...); 1837| 2.65M| } else { 1838| 2.04k| return make_regular_sub_pos(node, shift, size) 1839| 2.04k| .visit(v, std::forward(args)...); 1840| 2.04k| } 1841| 2.65M|} _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_: 1805| 2.65M| { 1806| 2.65M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 2.65M| } _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_: 1028| 4.74k| { 1029| 4.74k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 4.74k| } _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_: 950| 2.70k| { 951| 2.70k| auto offset = count() - 1; 952| 2.70k| auto child = node_->inner()[offset]; 953| 2.70k| auto is_leaf = shift_ == BL; 954| 2.70k| auto lsize = size_ - (size_t{offset} << shift_); 955| 2.70k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (955:16): [True: 0, False: 2.70k] ------------------ 956| 2.70k| : make_regular_sub_pos(child, shift_ - B, lsize) 957| 2.70k| .visit(v, args...); 958| 2.70k| } _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_: 905| 1.22M| { 906| 1.22M| each_left(v, count() - 1, args...); 907| 1.22M| } _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_: 865| 1.22M| { 866| 1.22M| return each_left_regular(*this, v, last, args...); 867| 1.22M| } _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_: 573| 1.22M|{ 574| 1.22M| constexpr auto B = bits; 575| 1.22M| constexpr auto BL = bits_leaf; 576| 1.22M| assert(last < p.count()); 577| 1.22M| if (p.shift() == BL) { ------------------ | Branch (577:9): [True: 725k, False: 500k] ------------------ 578| 725k| auto n = p.node()->inner(); 579| 725k| auto e = n + last; 580| 3.67M| for (; n != e; ++n) { ------------------ | Branch (580:16): [True: 2.94M, False: 725k] ------------------ 581| 2.94M| IMMER_PREFETCH(n + 1); 582| 2.94M| make_full_leaf_pos(*n).visit(v, args...); 583| 2.94M| } 584| 725k| } else { 585| 500k| auto n = p.node()->inner(); 586| 500k| auto e = n + last; 587| 500k| auto ss = p.shift() - B; 588| 886k| for (; n != e; ++n) ------------------ | Branch (588:16): [True: 386k, False: 500k] ------------------ 589| 386k| make_full_pos(*n, ss).visit(v, args...); 590| 500k| } 591| 1.22M|} _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_: 905| 1.22M| { 906| 1.22M| each_left(v, count() - 1, args...); 907| 1.22M| } _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_: 865| 1.22M| { 866| 1.22M| return each_left_regular(*this, v, last, args...); 867| 1.22M| } _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_: 573| 1.22M|{ 574| 1.22M| constexpr auto B = bits; 575| 1.22M| constexpr auto BL = bits_leaf; 576| 1.22M| assert(last < p.count()); 577| 1.22M| if (p.shift() == BL) { ------------------ | Branch (577:9): [True: 725k, False: 500k] ------------------ 578| 725k| auto n = p.node()->inner(); 579| 725k| auto e = n + last; 580| 3.67M| for (; n != e; ++n) { ------------------ | Branch (580:16): [True: 2.94M, False: 725k] ------------------ 581| 2.94M| IMMER_PREFETCH(n + 1); 582| 2.94M| make_full_leaf_pos(*n).visit(v, args...); 583| 2.94M| } 584| 725k| } else { 585| 500k| auto n = p.node()->inner(); 586| 500k| auto e = n + last; 587| 500k| auto ss = p.shift() - B; 588| 886k| for (; n != e; ++n) ------------------ | Branch (588:16): [True: 386k, False: 500k] ------------------ 589| 386k| make_full_pos(*n, ss).visit(v, args...); 590| 500k| } 591| 1.22M|} _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_: 1754| 1.17M| { 1755| 1.17M| auto child = node_->inner()[0]; 1756| 1.17M| auto child_size = relaxed_->d.sizes[0]; 1757| 1.17M| auto is_leaf = shift_ == BL; 1758| 1.17M| assert(child_size); 1759| 1.17M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1759:16): [True: 0, False: 1.17M] ------------------ 1760| 1.17M| : visit_maybe_relaxed_sub( 1761| 1.17M| child, shift_ - B, child_size, v, args...); 1762| 1.17M| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 105| 957k| 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_: 1830| 1.17M|{ 1831| 1.17M| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 1.17M| if (relaxed) { ------------------ | Branch (1833:9): [True: 887k, False: 286k] ------------------ 1834| 887k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 887k| .visit(v, std::forward(args)...); 1837| 887k| } else { 1838| 286k| return make_regular_sub_pos(node, shift, size) 1839| 286k| .visit(v, std::forward(args)...); 1840| 286k| } 1841| 1.17M|} _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_: 1805| 887k| { 1806| 887k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 887k| } _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_: 1028| 286k| { 1029| 286k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 286k| } _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_: 950| 973| { 951| 973| auto offset = count() - 1; 952| 973| auto child = node_->inner()[offset]; 953| 973| auto is_leaf = shift_ == BL; 954| 973| auto lsize = size_ - (size_t{offset} << shift_); 955| 973| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (955:16): [True: 0, False: 973] ------------------ 956| 973| : make_regular_sub_pos(child, shift_ - B, lsize) 957| 973| .visit(v, args...); 958| 973| } _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_: 1028| 1.37k| { 1029| 1.37k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 1.37k| } _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_: 962| 26.0k| { 963| 26.0k| auto is_leaf = shift_ == BL; 964| 26.0k| auto child = node_->inner()[0]; 965| 26.0k| auto is_full = size_ >= (size_t{1} << shift_); 966| 26.0k| return is_full ------------------ | Branch (966:16): [True: 26.0k, False: 0] ------------------ 967| 26.0k| ? (is_leaf ------------------ | Branch (967:23): [True: 0, False: 26.0k] ------------------ 968| 26.0k| ? make_full_leaf_pos(child).visit(v, args...) 969| 26.0k| : make_full_pos(child, shift_ - B).visit(v, args...)) 970| 26.0k| : (is_leaf ------------------ | Branch (970:23): [True: 0, False: 0] ------------------ 971| 0| ? make_leaf_sub_pos(child, size_).visit(v, args...) 972| 0| : make_regular_sub_pos(child, shift_ - B, size_) 973| 0| .visit(v, args...)); 974| 26.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_: 1397| 37.4k| { 1398| 37.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 37.4k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1353| 11.3k| { 1354| 11.3k| auto is_leaf = shift_ == BL; 1355| 11.3k| auto child = node_->inner()[0]; 1356| 11.3k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1356:16): [True: 0, False: 11.3k] ------------------ 1357| 11.3k| : make_full_pos(child, shift_ - B).visit(v, args...); 1358| 11.3k| } _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_: 950| 37.2k| { 951| 37.2k| auto offset = count() - 1; 952| 37.2k| auto child = node_->inner()[offset]; 953| 37.2k| auto is_leaf = shift_ == BL; 954| 37.2k| auto lsize = size_ - (size_t{offset} << shift_); 955| 37.2k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (955:16): [True: 26.3k, False: 10.9k] ------------------ 956| 37.2k| : make_regular_sub_pos(child, shift_ - B, lsize) 957| 10.9k| .visit(v, args...); 958| 37.2k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 143| 27.6k| { 144| 27.6k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 27.6k| } _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_: 1362| 27.6k| { 1363| 27.6k| assert(shift_ == BL); 1364| 0| auto child = node_->inner()[0]; 1365| 27.6k| return make_full_leaf_pos(child).visit(v, args...); 1366| 27.6k| } _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_: 205| 312k| { 206| 312k| return Visitor::visit_leaf(*this, std::forward(args)...); 207| 312k| } _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_: 1028| 11.1k| { 1029| 11.1k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 11.1k| } _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_: 950| 296k| { 951| 296k| auto offset = count() - 1; 952| 296k| auto child = node_->inner()[offset]; 953| 296k| auto is_leaf = shift_ == BL; 954| 296k| auto lsize = size_ - (size_t{offset} << shift_); 955| 296k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (955:16): [True: 280k, False: 15.4k] ------------------ 956| 296k| : make_regular_sub_pos(child, shift_ - B, lsize) 957| 15.4k| .visit(v, args...); 958| 296k| } _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_: 143| 285k| { 144| 285k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 285k| } _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_: 978| 285k| { 979| 285k| assert(shift_ == BL); 980| 0| auto child = node_->inner()[0]; 981| 285k| auto is_full = size_ >= branches; 982| 285k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (982:16): [True: 285k, False: 0] ------------------ 983| 285k| : make_leaf_sub_pos(child, size_).visit(v, args...); 984| 285k| } _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_: 143| 644k| { 144| 644k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 644k| } _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_: 1028| 25.6k| { 1029| 25.6k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 25.6k| } _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_: 950| 889k| { 951| 889k| auto offset = count() - 1; 952| 889k| auto child = node_->inner()[offset]; 953| 889k| auto is_leaf = shift_ == BL; 954| 889k| auto lsize = size_ - (size_t{offset} << shift_); 955| 889k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (955:16): [True: 418k, False: 470k] ------------------ 956| 889k| : make_regular_sub_pos(child, shift_ - B, lsize) 957| 470k| .visit(v, args...); 958| 889k| } _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_: 143| 644k| { 144| 644k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 644k| } _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_: 1766| 644k| { 1767| 644k| assert(shift_ == BL); 1768| 0| auto child = node_->inner()[0]; 1769| 644k| auto child_size = relaxed_->d.sizes[0]; 1770| 644k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1771| 644k| } _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_: 1028| 1.16M| { 1029| 1.16M| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 1.16M| } _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_: 1609| 9.72M| { 1610| 9.72M| each_left(v, relaxed_->d.count - 1, args...); 1611| 9.72M| } _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_: 1615| 9.72M| { 1616| 9.72M| auto p = node_->inner(); 1617| 9.72M| auto s = size_t{}; 1618| 9.72M| if (shift_ == BL) { ------------------ | Branch (1618:13): [True: 231k, False: 9.49M] ------------------ 1619| 1.47M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1619:39): [True: 1.24M, False: 231k] ------------------ 1620| 1.24M| IMMER_PREFETCH(p + i + 1); 1621| 1.24M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1622| 1.24M| .visit(v, args...); 1623| 1.24M| s = relaxed_->d.sizes[i]; 1624| 1.24M| assert(s); 1625| 1.24M| } 1626| 9.49M| } else { 1627| 9.49M| auto ss = shift_ - B; 1628| 42.6M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1628:39): [True: 33.2M, False: 9.49M] ------------------ 1629| 33.2M| visit_maybe_relaxed_sub( 1630| 33.2M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1631| 33.2M| s = relaxed_->d.sizes[i]; 1632| 33.2M| assert(s); 1633| 33.2M| } 1634| 9.49M| } 1635| 9.72M| } _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_: 1609| 9.72M| { 1610| 9.72M| each_left(v, relaxed_->d.count - 1, args...); 1611| 9.72M| } _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_: 1615| 9.72M| { 1616| 9.72M| auto p = node_->inner(); 1617| 9.72M| auto s = size_t{}; 1618| 9.72M| if (shift_ == BL) { ------------------ | Branch (1618:13): [True: 231k, False: 9.49M] ------------------ 1619| 1.47M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1619:39): [True: 1.24M, False: 231k] ------------------ 1620| 1.24M| IMMER_PREFETCH(p + i + 1); 1621| 1.24M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1622| 1.24M| .visit(v, args...); 1623| 1.24M| s = relaxed_->d.sizes[i]; 1624| 1.24M| assert(s); 1625| 1.24M| } 1626| 9.49M| } else { 1627| 9.49M| auto ss = shift_ - B; 1628| 42.6M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1628:39): [True: 33.2M, False: 9.49M] ------------------ 1629| 33.2M| visit_maybe_relaxed_sub( 1630| 33.2M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1631| 33.2M| s = relaxed_->d.sizes[i]; 1632| 33.2M| assert(s); 1633| 33.2M| } 1634| 9.49M| } 1635| 9.72M| } _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_: 1754| 6.14M| { 1755| 6.14M| auto child = node_->inner()[0]; 1756| 6.14M| auto child_size = relaxed_->d.sizes[0]; 1757| 6.14M| auto is_leaf = shift_ == BL; 1758| 6.14M| assert(child_size); 1759| 6.14M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1759:16): [True: 0, False: 6.14M] ------------------ 1760| 6.14M| : visit_maybe_relaxed_sub( 1761| 6.14M| child, shift_ - B, child_size, v, args...); 1762| 6.14M| } _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_: 1830| 6.14M|{ 1831| 6.14M| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 6.14M| if (relaxed) { ------------------ | Branch (1833:9): [True: 6.13M, False: 1.42k] ------------------ 1834| 6.13M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 6.13M| .visit(v, std::forward(args)...); 1837| 6.13M| } else { 1838| 1.42k| return make_regular_sub_pos(node, shift, size) 1839| 1.42k| .visit(v, std::forward(args)...); 1840| 1.42k| } 1841| 6.14M|} _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_: 1805| 6.13M| { 1806| 6.13M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 6.13M| } _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_: 1028| 1.42k| { 1029| 1.42k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 1.42k| } _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_: 1742| 33.0k| { 1743| 33.0k| auto offset = relaxed_->d.count - 1; 1744| 33.0k| auto child = node_->inner()[offset]; 1745| 33.0k| auto child_size = size(offset); 1746| 33.0k| auto is_leaf = shift_ == BL; 1747| 33.0k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1747:16): [True: 0, False: 33.0k] ------------------ 1748| 33.0k| : visit_maybe_relaxed_sub( 1749| 33.0k| child, shift_ - B, child_size, v, args...); 1750| 33.0k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcPT_jmT0_DpOT1_: 1830| 33.0k|{ 1831| 33.0k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 33.0k| if (relaxed) { ------------------ | Branch (1833:9): [True: 32.6k, False: 406] ------------------ 1834| 32.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 32.6k| .visit(v, std::forward(args)...); 1837| 32.6k| } else { 1838| 406| return make_regular_sub_pos(node, shift, size) 1839| 406| .visit(v, std::forward(args)...); 1840| 406| } 1841| 33.0k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1805| 32.6k| { 1806| 32.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 32.6k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 962| 1.57k| { 963| 1.57k| auto is_leaf = shift_ == BL; 964| 1.57k| auto child = node_->inner()[0]; 965| 1.57k| auto is_full = size_ >= (size_t{1} << shift_); 966| 1.57k| return is_full ------------------ | Branch (966:16): [True: 1.57k, False: 0] ------------------ 967| 1.57k| ? (is_leaf ------------------ | Branch (967:23): [True: 0, False: 1.57k] ------------------ 968| 1.57k| ? make_full_leaf_pos(child).visit(v, args...) 969| 1.57k| : make_full_pos(child, shift_ - B).visit(v, args...)) 970| 1.57k| : (is_leaf ------------------ | Branch (970:23): [True: 0, False: 0] ------------------ 971| 0| ? make_leaf_sub_pos(child, size_).visit(v, args...) 972| 0| : make_regular_sub_pos(child, shift_ - B, size_) 973| 0| .visit(v, args...)); 974| 1.57k| } _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_: 1397| 1.98k| { 1398| 1.98k| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 1.98k| } _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_: 1353| 411| { 1354| 411| auto is_leaf = shift_ == BL; 1355| 411| auto child = node_->inner()[0]; 1356| 411| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1356:16): [True: 0, False: 411] ------------------ 1357| 411| : make_full_pos(child, shift_ - B).visit(v, args...); 1358| 411| } _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_: 1742| 1.78k| { 1743| 1.78k| auto offset = relaxed_->d.count - 1; 1744| 1.78k| auto child = node_->inner()[offset]; 1745| 1.78k| auto child_size = size(offset); 1746| 1.78k| auto is_leaf = shift_ == BL; 1747| 1.78k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1747:16): [True: 1.35k, False: 426] ------------------ 1748| 1.78k| : visit_maybe_relaxed_sub( 1749| 426| child, shift_ - B, child_size, v, args...); 1750| 1.78k| } _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_: 1830| 426|{ 1831| 426| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 426| if (relaxed) { ------------------ | Branch (1833:9): [True: 209, False: 217] ------------------ 1834| 209| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 209| .visit(v, std::forward(args)...); 1837| 217| } else { 1838| 217| return make_regular_sub_pos(node, shift, size) 1839| 217| .visit(v, std::forward(args)...); 1840| 217| } 1841| 426|} _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_: 1805| 209| { 1806| 209| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 209| } _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_: 1742| 15.3k| { 1743| 15.3k| auto offset = relaxed_->d.count - 1; 1744| 15.3k| auto child = node_->inner()[offset]; 1745| 15.3k| auto child_size = size(offset); 1746| 15.3k| auto is_leaf = shift_ == BL; 1747| 15.3k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1747:16): [True: 4.29k, False: 11.0k] ------------------ 1748| 15.3k| : visit_maybe_relaxed_sub( 1749| 11.0k| child, shift_ - B, child_size, v, args...); 1750| 15.3k| } _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_: 1830| 11.0k|{ 1831| 11.0k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 11.0k| if (relaxed) { ------------------ | Branch (1833:9): [True: 829, False: 10.1k] ------------------ 1834| 829| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 829| .visit(v, std::forward(args)...); 1837| 10.1k| } else { 1838| 10.1k| return make_regular_sub_pos(node, shift, size) 1839| 10.1k| .visit(v, std::forward(args)...); 1840| 10.1k| } 1841| 11.0k|} _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_: 1805| 829| { 1806| 829| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 829| } _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_: 1742| 7.02M| { 1743| 7.02M| auto offset = relaxed_->d.count - 1; 1744| 7.02M| auto child = node_->inner()[offset]; 1745| 7.02M| auto child_size = size(offset); 1746| 7.02M| auto is_leaf = shift_ == BL; 1747| 7.02M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1747:16): [True: 226k, False: 6.79M] ------------------ 1748| 7.02M| : visit_maybe_relaxed_sub( 1749| 6.79M| child, shift_ - B, child_size, v, args...); 1750| 7.02M| } _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_: 1830| 6.79M|{ 1831| 6.79M| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 6.79M| if (relaxed) { ------------------ | Branch (1833:9): [True: 6.10M, False: 695k] ------------------ 1834| 6.10M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 6.10M| .visit(v, std::forward(args)...); 1837| 6.10M| } else { 1838| 695k| return make_regular_sub_pos(node, shift, size) 1839| 695k| .visit(v, std::forward(args)...); 1840| 695k| } 1841| 6.79M|} _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_: 1805| 6.10M| { 1806| 6.10M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 6.10M| } _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_: 1028| 15.0k| { 1029| 15.0k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 15.0k| } _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_: 1028| 16.9k| { 1029| 16.9k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 16.9k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_26concat_trees_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1830| 16.9k|{ 1831| 16.9k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 16.9k| if (relaxed) { ------------------ | Branch (1833:9): [True: 6.79k, False: 10.1k] ------------------ 1834| 6.79k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 6.79k| .visit(v, std::forward(args)...); 1837| 10.1k| } else { 1838| 10.1k| return make_regular_sub_pos(node, shift, size) 1839| 10.1k| .visit(v, std::forward(args)...); 1840| 10.1k| } 1841| 16.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1805| 6.79k| { 1806| 6.79k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 6.79k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1028| 10.1k| { 1029| 10.1k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 10.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_: 1805| 289k| { 1806| 289k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 289k| } _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_: 1729| 283k| { 1730| 283k| assert(offset_hint == count() - 1); 1731| 0| assert(child_size_hint == size(offset_hint)); 1732| 0| auto child = node_->inner()[offset_hint]; 1733| 283k| auto is_leaf = shift_ == BL; 1734| 283k| return is_leaf ------------------ | Branch (1734:16): [True: 0, False: 283k] ------------------ 1735| 283k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1736| 283k| : visit_maybe_relaxed_sub( 1737| 283k| child, shift_ - B, child_size_hint, v, args...); 1738| 283k| } _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_: 1830| 283k|{ 1831| 283k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 283k| if (relaxed) { ------------------ | Branch (1833:9): [True: 69.3k, False: 214k] ------------------ 1834| 69.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 69.3k| .visit(v, std::forward(args)...); 1837| 214k| } else { 1838| 214k| return make_regular_sub_pos(node, shift, size) 1839| 214k| .visit(v, std::forward(args)...); 1840| 214k| } 1841| 283k|} _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_: 1028| 214k| { 1029| 214k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 214k| } _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_: 944| 620k| { 945| 620k| return last_oh_regular(*this, v, offset_hint, args...); 946| 620k| } _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_: 675| 620k|{ 676| 620k| assert(offset_hint == p.count() - 1); 677| 0| constexpr auto B = bits; 678| 620k| constexpr auto BL = bits_leaf; 679| 620k| auto child = p.node()->inner()[offset_hint]; 680| 620k| auto is_leaf = p.shift() == BL; 681| 620k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (681:12): [True: 0, False: 620k] ------------------ 682| 620k| : make_regular_pos(child, p.shift() - B, p.size()) 683| 620k| .visit(v, args...); 684| 620k|} _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_: 334| 1.85M| { 335| 1.85M| return Visitor::visit_regular(*this, std::forward(args)...); 336| 1.85M| } _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_: 328| 1.23M| { 329| 1.23M| return last_oh_regular(*this, v, offset_hint, args...); 330| 1.23M| } _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_: 675| 1.23M|{ 676| 1.23M| assert(offset_hint == p.count() - 1); 677| 0| constexpr auto B = bits; 678| 1.23M| constexpr auto BL = bits_leaf; 679| 1.23M| auto child = p.node()->inner()[offset_hint]; 680| 1.23M| auto is_leaf = p.shift() == BL; 681| 1.23M| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (681:12): [True: 0, False: 1.23M] ------------------ 682| 1.23M| : make_regular_pos(child, p.shift() - B, p.size()) 683| 1.23M| .visit(v, args...); 684| 1.23M|} _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_: 328| 2.37k| { 329| 2.37k| return last_oh_regular(*this, v, offset_hint, args...); 330| 2.37k| } _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_: 675| 2.37k|{ 676| 2.37k| assert(offset_hint == p.count() - 1); 677| 0| constexpr auto B = bits; 678| 2.37k| constexpr auto BL = bits_leaf; 679| 2.37k| auto child = p.node()->inner()[offset_hint]; 680| 2.37k| auto is_leaf = p.shift() == BL; 681| 2.37k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (681:12): [True: 0, False: 2.37k] ------------------ 682| 2.37k| : make_regular_pos(child, p.shift() - B, p.size()) 683| 2.37k| .visit(v, args...); 684| 2.37k|} _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_: 334| 3.89k| { 335| 3.89k| return Visitor::visit_regular(*this, std::forward(args)...); 336| 3.89k| } _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_: 944| 1.52k| { 945| 1.52k| return last_oh_regular(*this, v, offset_hint, args...); 946| 1.52k| } _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_: 675| 1.52k|{ 676| 1.52k| assert(offset_hint == p.count() - 1); 677| 0| constexpr auto B = bits; 678| 1.52k| constexpr auto BL = bits_leaf; 679| 1.52k| auto child = p.node()->inner()[offset_hint]; 680| 1.52k| auto is_leaf = p.shift() == BL; 681| 1.52k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (681:12): [True: 0, False: 1.52k] ------------------ 682| 1.52k| : make_regular_pos(child, p.shift() - B, p.size()) 683| 1.52k| .visit(v, args...); 684| 1.52k|} _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_: 1729| 10.9k| { 1730| 10.9k| assert(offset_hint == count() - 1); 1731| 0| assert(child_size_hint == size(offset_hint)); 1732| 0| auto child = node_->inner()[offset_hint]; 1733| 10.9k| auto is_leaf = shift_ == BL; 1734| 10.9k| return is_leaf ------------------ | Branch (1734:16): [True: 0, False: 10.9k] ------------------ 1735| 10.9k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1736| 10.9k| : visit_maybe_relaxed_sub( 1737| 10.9k| child, shift_ - B, child_size_hint, v, args...); 1738| 10.9k| } _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_: 1830| 10.9k|{ 1831| 10.9k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 10.9k| if (relaxed) { ------------------ | Branch (1833:9): [True: 9.78k, False: 1.13k] ------------------ 1834| 9.78k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 9.78k| .visit(v, std::forward(args)...); 1837| 9.78k| } else { 1838| 1.13k| return make_regular_sub_pos(node, shift, size) 1839| 1.13k| .visit(v, std::forward(args)...); 1840| 1.13k| } 1841| 10.9k|} _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_: 1805| 9.78k| { 1806| 9.78k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 9.78k| } _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_: 1028| 1.13k| { 1029| 1.13k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 1.13k| } _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_: 1028| 422k| { 1029| 422k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 422k| } _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_: 1830| 17.3k|{ 1831| 17.3k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 17.3k| if (relaxed) { ------------------ | Branch (1833:9): [True: 14.8k, False: 2.45k] ------------------ 1834| 14.8k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 14.8k| .visit(v, std::forward(args)...); 1837| 14.8k| } else { 1838| 2.45k| return make_regular_sub_pos(node, shift, size) 1839| 2.45k| .visit(v, std::forward(args)...); 1840| 2.45k| } 1841| 17.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_: 1805| 14.8k| { 1806| 14.8k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 14.8k| } _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_: 1678| 84.7k| { 1679| 84.7k| assert(offset_hint == index(idx)); 1680| 84.7k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1680:26): [True: 18.3k, False: 66.3k] ------------------ 1681| 84.7k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1682| 84.7k| } _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_: 1690| 84.7k| { 1691| 84.7k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1692| 84.7k| } _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_: 1709| 84.7k| { 1710| 84.7k| assert(offset_hint == index(idx)); 1711| 0| assert(left_size_hint == 1712| 84.7k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1713| 0| auto child = node_->inner()[offset_hint]; 1714| 84.7k| auto is_leaf = shift_ == BL; 1715| 84.7k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1716| 84.7k| auto next_idx = idx - left_size_hint; 1717| 84.7k| return is_leaf ------------------ | Branch (1717:16): [True: 13.0k, False: 71.7k] ------------------ 1718| 84.7k| ? make_leaf_sub_pos(child, next_size) 1719| 13.0k| .visit(v, next_idx, args...) 1720| 84.7k| : visit_maybe_relaxed_sub( 1721| 71.7k| child, shift_ - B, next_size, v, next_idx, args...); 1722| 84.7k| } _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_: 143| 13.0k| { 144| 13.0k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 13.0k| } _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_: 1830| 71.7k|{ 1831| 71.7k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 71.7k| if (relaxed) { ------------------ | Branch (1833:9): [True: 69.8k, False: 1.86k] ------------------ 1834| 69.8k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 69.8k| .visit(v, std::forward(args)...); 1837| 69.8k| } else { 1838| 1.86k| return make_regular_sub_pos(node, shift, size) 1839| 1.86k| .visit(v, std::forward(args)...); 1840| 1.86k| } 1841| 71.7k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1805| 69.8k| { 1806| 69.8k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 69.8k| } _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_: 1028| 1.86k| { 1029| 1.86k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 1.86k| } _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_: 930| 4.32k| { 931| 4.32k| return towards_oh_ch_regular( 932| 4.32k| *this, v, idx, offset_hint, count(), args...); 933| 4.32k| } _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_: 630| 4.32k|{ 631| 4.32k| constexpr auto B = bits; 632| 4.32k| constexpr auto BL = bits_leaf; 633| 4.32k| assert(offset_hint == p.index(idx)); 634| 0| assert(count_hint == p.count()); 635| 0| auto is_leaf = p.shift() == BL; 636| 4.32k| auto child = p.node()->inner()[offset_hint]; 637| 4.32k| auto is_full = offset_hint + 1 != count_hint; 638| 4.32k| return is_full ------------------ | Branch (638:12): [True: 2.34k, False: 1.97k] ------------------ 639| 4.32k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (639:19): [True: 988, False: 1.35k] ------------------ 640| 2.34k| : make_full_pos(child, p.shift() - B) 641| 1.35k| .visit(v, idx, args...)) 642| 4.32k| : (is_leaf ------------------ | Branch (642:19): [True: 698, False: 1.28k] ------------------ 643| 1.97k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 644| 1.97k| : make_regular_pos(child, p.shift() - B, p.size()) 645| 1.28k| .visit(v, idx, args...)); 646| 4.32k|} _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_: 205| 3.02k| { 206| 3.02k| return Visitor::visit_leaf(*this, std::forward(args)...); 207| 3.02k| } _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_: 1397| 2.45k| { 1398| 2.45k| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 2.45k| } _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_: 1321| 2.45k| { 1322| 2.45k| return towards_oh(v, idx, offset_hint, args...); 1323| 2.45k| } _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_: 1328| 2.45k| { 1329| 2.45k| assert(offset_hint == index(idx)); 1330| 0| auto is_leaf = shift_ == BL; 1331| 2.45k| auto child = node_->inner()[offset_hint]; 1332| 2.45k| return is_leaf ------------------ | Branch (1332:16): [True: 1.63k, False: 825] ------------------ 1333| 2.45k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1334| 2.45k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1335| 2.45k| } _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_: 111| 1.29k| { 112| 1.29k| return Visitor::visit_leaf(*this, std::forward(args)...); 113| 1.29k| } _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_: 334| 1.82k| { 335| 1.82k| return Visitor::visit_regular(*this, std::forward(args)...); 336| 1.82k| } _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_: 314| 1.82k| { 315| 1.82k| return towards_oh_ch_regular( 316| 1.82k| *this, v, idx, offset_hint, count(), args...); 317| 1.82k| } _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_: 630| 1.82k|{ 631| 1.82k| constexpr auto B = bits; 632| 1.82k| constexpr auto BL = bits_leaf; 633| 1.82k| assert(offset_hint == p.index(idx)); 634| 0| assert(count_hint == p.count()); 635| 0| auto is_leaf = p.shift() == BL; 636| 1.82k| auto child = p.node()->inner()[offset_hint]; 637| 1.82k| auto is_full = offset_hint + 1 != count_hint; 638| 1.82k| return is_full ------------------ | Branch (638:12): [True: 686, False: 1.14k] ------------------ 639| 1.82k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (639:19): [True: 408, False: 278] ------------------ 640| 686| : make_full_pos(child, p.shift() - B) 641| 278| .visit(v, idx, args...)) 642| 1.82k| : (is_leaf ------------------ | Branch (642:19): [True: 594, False: 546] ------------------ 643| 1.14k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 644| 1.14k| : make_regular_pos(child, p.shift() - B, p.size()) 645| 546| .visit(v, idx, args...)); 646| 1.82k|} _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_: 1028| 2.45k| { 1029| 2.45k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 2.45k| } _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_: 1830| 47.5k|{ 1831| 47.5k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 47.5k| if (relaxed) { ------------------ | Branch (1833:9): [True: 35.1k, False: 12.4k] ------------------ 1834| 35.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 35.1k| .visit(v, std::forward(args)...); 1837| 35.1k| } else { 1838| 12.4k| return make_regular_sub_pos(node, shift, size) 1839| 12.4k| .visit(v, std::forward(args)...); 1840| 12.4k| } 1841| 47.5k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1805| 35.1k| { 1806| 35.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 35.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_: 1678| 16.9k| { 1679| 16.9k| assert(offset_hint == index(idx)); 1680| 16.9k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1680:26): [True: 0, False: 16.9k] ------------------ 1681| 16.9k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1682| 16.9k| } _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_: 1690| 16.9k| { 1691| 16.9k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1692| 16.9k| } _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_: 1709| 16.9k| { 1710| 16.9k| assert(offset_hint == index(idx)); 1711| 0| assert(left_size_hint == 1712| 16.9k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1713| 0| auto child = node_->inner()[offset_hint]; 1714| 16.9k| auto is_leaf = shift_ == BL; 1715| 16.9k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1716| 16.9k| auto next_idx = idx - left_size_hint; 1717| 16.9k| return is_leaf ------------------ | Branch (1717:16): [True: 944, False: 15.9k] ------------------ 1718| 16.9k| ? make_leaf_sub_pos(child, next_size) 1719| 944| .visit(v, next_idx, args...) 1720| 16.9k| : visit_maybe_relaxed_sub( 1721| 15.9k| child, shift_ - B, next_size, v, next_idx, args...); 1722| 16.9k| } _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_: 143| 944| { 144| 944| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 944| } _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_: 1678| 26.2k| { 1679| 26.2k| assert(offset_hint == index(idx)); 1680| 26.2k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1680:26): [True: 0, False: 26.2k] ------------------ 1681| 26.2k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1682| 26.2k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1690| 26.2k| { 1691| 26.2k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1692| 26.2k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1709| 26.2k| { 1710| 26.2k| assert(offset_hint == index(idx)); 1711| 0| assert(left_size_hint == 1712| 26.2k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1713| 0| auto child = node_->inner()[offset_hint]; 1714| 26.2k| auto is_leaf = shift_ == BL; 1715| 26.2k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1716| 26.2k| auto next_idx = idx - left_size_hint; 1717| 26.2k| return is_leaf ------------------ | Branch (1717:16): [True: 1.22k, False: 25.0k] ------------------ 1718| 26.2k| ? make_leaf_sub_pos(child, next_size) 1719| 1.22k| .visit(v, next_idx, args...) 1720| 26.2k| : visit_maybe_relaxed_sub( 1721| 25.0k| child, shift_ - B, next_size, v, next_idx, args...); 1722| 26.2k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 143| 1.22k| { 144| 1.22k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 1.22k| } _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_: 1830| 25.0k|{ 1831| 25.0k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 25.0k| if (relaxed) { ------------------ | Branch (1833:9): [True: 23.8k, False: 1.23k] ------------------ 1834| 23.8k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 23.8k| .visit(v, std::forward(args)...); 1837| 23.8k| } else { 1838| 1.23k| return make_regular_sub_pos(node, shift, size) 1839| 1.23k| .visit(v, std::forward(args)...); 1840| 1.23k| } 1841| 25.0k|} _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_: 1805| 23.8k| { 1806| 23.8k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 23.8k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1028| 1.23k| { 1029| 1.23k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 1.23k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 919| 2.21k| { 920| 2.21k| return towards_oh_ch_regular( 921| 2.21k| *this, v, idx, offset_hint, count(), args...); 922| 2.21k| } _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_: 630| 2.21k|{ 631| 2.21k| constexpr auto B = bits; 632| 2.21k| constexpr auto BL = bits_leaf; 633| 2.21k| assert(offset_hint == p.index(idx)); 634| 0| assert(count_hint == p.count()); 635| 0| auto is_leaf = p.shift() == BL; 636| 2.21k| auto child = p.node()->inner()[offset_hint]; 637| 2.21k| auto is_full = offset_hint + 1 != count_hint; 638| 2.21k| return is_full ------------------ | Branch (638:12): [True: 1.76k, False: 454] ------------------ 639| 2.21k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (639:19): [True: 695, False: 1.06k] ------------------ 640| 1.76k| : make_full_pos(child, p.shift() - B) 641| 1.06k| .visit(v, idx, args...)) 642| 2.21k| : (is_leaf ------------------ | Branch (642:19): [True: 454, False: 0] ------------------ 643| 454| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 644| 454| : make_regular_pos(child, p.shift() - B, p.size()) 645| 0| .visit(v, idx, args...)); 646| 2.21k|} _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_: 205| 1.39k| { 206| 1.39k| return Visitor::visit_leaf(*this, std::forward(args)...); 207| 1.39k| } _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_: 1397| 1.42k| { 1398| 1.42k| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 1.42k| } _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_: 1328| 1.05k| { 1329| 1.05k| assert(offset_hint == index(idx)); 1330| 0| auto is_leaf = shift_ == BL; 1331| 1.05k| auto child = node_->inner()[offset_hint]; 1332| 1.05k| return is_leaf ------------------ | Branch (1332:16): [True: 698, False: 354] ------------------ 1333| 1.05k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1334| 1.05k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1335| 1.05k| } _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_: 1328| 2.13k| { 1329| 2.13k| assert(offset_hint == index(idx)); 1330| 0| auto is_leaf = shift_ == BL; 1331| 2.13k| auto child = node_->inner()[offset_hint]; 1332| 2.13k| return is_leaf ------------------ | Branch (1332:16): [True: 1.25k, False: 882] ------------------ 1333| 2.13k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1334| 2.13k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1335| 2.13k| } _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_: 205| 3.18k| { 206| 3.18k| return Visitor::visit_leaf(*this, std::forward(args)...); 207| 3.18k| } _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_: 1397| 3.77k| { 1398| 3.77k| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 3.77k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1397| 3.46k| { 1398| 3.46k| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 3.46k| } _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_: 1328| 10.4k| { 1329| 10.4k| assert(offset_hint == index(idx)); 1330| 0| auto is_leaf = shift_ == BL; 1331| 10.4k| auto child = node_->inner()[offset_hint]; 1332| 10.4k| return is_leaf ------------------ | Branch (1332:16): [True: 7.89k, False: 2.51k] ------------------ 1333| 10.4k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1334| 10.4k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1335| 10.4k| } _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_: 205| 10.6k| { 206| 10.6k| return Visitor::visit_leaf(*this, std::forward(args)...); 207| 10.6k| } _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_: 1397| 5.74k| { 1398| 5.74k| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 5.74k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1302| 3.37k| { 1303| 3.37k| each_i(v, start, branches, args...); 1304| 3.37k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE6each_iINS1_11dec_visitorEJEEEvT_jjDpOT0_: 1255| 3.37k| { 1256| 3.37k| auto p = node_->inner() + i; 1257| 3.37k| auto e = node_->inner() + n; 1258| 3.37k| if (shift_ == BL) { ------------------ | Branch (1258:13): [True: 1.95k, False: 1.41k] ------------------ 1259| 9.80k| for (; p != e; ++p) { ------------------ | Branch (1259:20): [True: 7.84k, False: 1.95k] ------------------ 1260| 7.84k| IMMER_PREFETCH(p + 1); 1261| 7.84k| make_full_leaf_pos(*p).visit(v, args...); 1262| 7.84k| } 1263| 1.95k| } else { 1264| 1.41k| auto ss = shift_ - B; 1265| 10.8k| for (; p != e; ++p) ------------------ | Branch (1265:20): [True: 9.45k, False: 1.41k] ------------------ 1266| 9.45k| make_full_pos(*p, ss).visit(v, args...); 1267| 1.41k| } 1268| 3.37k| } _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_: 111| 454| { 112| 454| return Visitor::visit_leaf(*this, std::forward(args)...); 113| 454| } _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_: 303| 3.00k| { 304| 3.00k| return towards_oh_ch_regular( 305| 3.00k| *this, v, idx, offset_hint, count(), args...); 306| 3.00k| } _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_: 630| 3.00k|{ 631| 3.00k| constexpr auto B = bits; 632| 3.00k| constexpr auto BL = bits_leaf; 633| 3.00k| assert(offset_hint == p.index(idx)); 634| 0| assert(count_hint == p.count()); 635| 0| auto is_leaf = p.shift() == BL; 636| 3.00k| auto child = p.node()->inner()[offset_hint]; 637| 3.00k| auto is_full = offset_hint + 1 != count_hint; 638| 3.00k| return is_full ------------------ | Branch (638:12): [True: 2.05k, False: 949] ------------------ 639| 3.00k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (639:19): [True: 1.15k, False: 897] ------------------ 640| 2.05k| : make_full_pos(child, p.shift() - B) 641| 897| .visit(v, idx, args...)) 642| 3.00k| : (is_leaf ------------------ | Branch (642:19): [True: 560, False: 389] ------------------ 643| 949| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 644| 949| : make_regular_pos(child, p.shift() - B, p.size()) 645| 389| .visit(v, idx, args...)); 646| 3.00k|} _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_: 111| 1.38k| { 112| 1.38k| return Visitor::visit_leaf(*this, std::forward(args)...); 113| 1.38k| } _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_: 334| 3.93k| { 335| 3.93k| return Visitor::visit_regular(*this, std::forward(args)...); 336| 3.93k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 334| 1.59k| { 335| 1.59k| return Visitor::visit_regular(*this, std::forward(args)...); 336| 1.59k| } _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_: 303| 4.51k| { 304| 4.51k| return towards_oh_ch_regular( 305| 4.51k| *this, v, idx, offset_hint, count(), args...); 306| 4.51k| } _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_: 630| 4.51k|{ 631| 4.51k| constexpr auto B = bits; 632| 4.51k| constexpr auto BL = bits_leaf; 633| 4.51k| assert(offset_hint == p.index(idx)); 634| 0| assert(count_hint == p.count()); 635| 0| auto is_leaf = p.shift() == BL; 636| 4.51k| auto child = p.node()->inner()[offset_hint]; 637| 4.51k| auto is_full = offset_hint + 1 != count_hint; 638| 4.51k| return is_full ------------------ | Branch (638:12): [True: 1.90k, False: 2.60k] ------------------ 639| 4.51k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (639:19): [True: 828, False: 1.07k] ------------------ 640| 1.90k| : make_full_pos(child, p.shift() - B) 641| 1.07k| .visit(v, idx, args...)) 642| 4.51k| : (is_leaf ------------------ | Branch (642:19): [True: 1.77k, False: 833] ------------------ 643| 2.60k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 644| 2.60k| : make_regular_pos(child, p.shift() - B, p.size()) 645| 833| .visit(v, idx, args...)); 646| 4.51k|} _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_: 111| 2.68k| { 112| 2.68k| return Visitor::visit_leaf(*this, std::forward(args)...); 113| 2.68k| } _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_: 334| 3.58k| { 335| 3.58k| return Visitor::visit_regular(*this, std::forward(args)...); 336| 3.58k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 283| 3.00k| { 284| 3.00k| return each_right_regular(*this, v, start, args...); 285| 3.00k| } _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_: 595| 3.00k|{ 596| 3.00k| constexpr auto B = bits; 597| 3.00k| constexpr auto BL = bits_leaf; 598| | 599| 3.00k| if (p.shift() == BL) { ------------------ | Branch (599:9): [True: 1.71k, False: 1.28k] ------------------ 600| 1.71k| auto n = p.node()->inner() + start; 601| 1.71k| auto last = p.count() - 1; 602| 1.71k| auto e = p.node()->inner() + last; 603| 1.71k| if (n <= e) { ------------------ | Branch (603:13): [True: 1.15k, False: 560] ------------------ 604| 3.97k| for (; n != e; ++n) { ------------------ | Branch (604:20): [True: 2.82k, False: 1.15k] ------------------ 605| 2.82k| IMMER_PREFETCH(n + 1); 606| 2.82k| make_full_leaf_pos(*n).visit(v, args...); 607| 2.82k| } 608| 1.15k| make_leaf_pos(*n, p.size()).visit(v, args...); 609| 1.15k| } 610| 1.71k| } else { 611| 1.28k| auto n = p.node()->inner() + start; 612| 1.28k| auto last = p.count() - 1; 613| 1.28k| auto e = p.node()->inner() + last; 614| 1.28k| auto ss = p.shift() - B; 615| 1.28k| if (n <= e) { ------------------ | Branch (615:13): [True: 897, False: 389] ------------------ 616| 1.73k| for (; n != e; ++n) ------------------ | Branch (616:20): [True: 836, False: 897] ------------------ 617| 836| make_full_pos(*n, ss).visit(v, args...); 618| 897| make_regular_pos(*n, ss, p.size()).visit(v, args...); 619| 897| } 620| 1.28k| } 621| 3.00k|} _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_: 919| 7.14k| { 920| 7.14k| return towards_oh_ch_regular( 921| 7.14k| *this, v, idx, offset_hint, count(), args...); 922| 7.14k| } _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_: 630| 7.14k|{ 631| 7.14k| constexpr auto B = bits; 632| 7.14k| constexpr auto BL = bits_leaf; 633| 7.14k| assert(offset_hint == p.index(idx)); 634| 0| assert(count_hint == p.count()); 635| 0| auto is_leaf = p.shift() == BL; 636| 7.14k| auto child = p.node()->inner()[offset_hint]; 637| 7.14k| auto is_full = offset_hint + 1 != count_hint; 638| 7.14k| return is_full ------------------ | Branch (638:12): [True: 2.77k, False: 4.37k] ------------------ 639| 7.14k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (639:19): [True: 772, False: 1.99k] ------------------ 640| 2.77k| : make_full_pos(child, p.shift() - B) 641| 1.99k| .visit(v, idx, args...)) 642| 7.14k| : (is_leaf ------------------ | Branch (642:19): [True: 829, False: 3.54k] ------------------ 643| 4.37k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 644| 4.37k| : make_regular_pos(child, p.shift() - B, p.size()) 645| 3.54k| .visit(v, idx, args...)); 646| 7.14k|} _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_: 919| 7.76k| { 920| 7.76k| return towards_oh_ch_regular( 921| 7.76k| *this, v, idx, offset_hint, count(), args...); 922| 7.76k| } _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_: 630| 7.76k|{ 631| 7.76k| constexpr auto B = bits; 632| 7.76k| constexpr auto BL = bits_leaf; 633| 7.76k| assert(offset_hint == p.index(idx)); 634| 0| assert(count_hint == p.count()); 635| 0| auto is_leaf = p.shift() == BL; 636| 7.76k| auto child = p.node()->inner()[offset_hint]; 637| 7.76k| auto is_full = offset_hint + 1 != count_hint; 638| 7.76k| return is_full ------------------ | Branch (638:12): [True: 4.10k, False: 3.66k] ------------------ 639| 7.76k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (639:19): [True: 1.94k, False: 2.16k] ------------------ 640| 4.10k| : make_full_pos(child, p.shift() - B) 641| 2.16k| .visit(v, idx, args...)) 642| 7.76k| : (is_leaf ------------------ | Branch (642:19): [True: 913, False: 2.74k] ------------------ 643| 3.66k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 644| 3.66k| : make_regular_pos(child, p.shift() - B, p.size()) 645| 2.74k| .visit(v, idx, args...)); 646| 7.76k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 859| 12.3k| { 860| 12.3k| return each_right_regular(*this, v, start, args...); 861| 12.3k| } _ZN5immer6detail4rbts18each_right_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_11dec_visitorEJEEEvOT_T0_jDpOT1_: 595| 12.3k|{ 596| 12.3k| constexpr auto B = bits; 597| 12.3k| constexpr auto BL = bits_leaf; 598| | 599| 12.3k| if (p.shift() == BL) { ------------------ | Branch (599:9): [True: 3.48k, False: 8.89k] ------------------ 600| 3.48k| auto n = p.node()->inner() + start; 601| 3.48k| auto last = p.count() - 1; 602| 3.48k| auto e = p.node()->inner() + last; 603| 3.48k| if (n <= e) { ------------------ | Branch (603:13): [True: 1.78k, False: 1.70k] ------------------ 604| 3.10k| for (; n != e; ++n) { ------------------ | Branch (604:20): [True: 1.32k, False: 1.78k] ------------------ 605| 1.32k| IMMER_PREFETCH(n + 1); 606| 1.32k| make_full_leaf_pos(*n).visit(v, args...); 607| 1.32k| } 608| 1.78k| make_leaf_pos(*n, p.size()).visit(v, args...); 609| 1.78k| } 610| 8.89k| } else { 611| 8.89k| auto n = p.node()->inner() + start; 612| 8.89k| auto last = p.count() - 1; 613| 8.89k| auto e = p.node()->inner() + last; 614| 8.89k| auto ss = p.shift() - B; 615| 8.89k| if (n <= e) { ------------------ | Branch (615:13): [True: 5.35k, False: 3.54k] ------------------ 616| 6.47k| for (; n != e; ++n) ------------------ | Branch (616:20): [True: 1.12k, False: 5.35k] ------------------ 617| 1.12k| make_full_pos(*n, ss).visit(v, args...); 618| 5.35k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 619| 5.35k| } 620| 8.89k| } 621| 12.3k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1805| 25.4k| { 1806| 25.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 25.4k| } _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_: 1678| 9.83k| { 1679| 9.83k| assert(offset_hint == index(idx)); 1680| 9.83k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1680:26): [True: 9.21k, False: 617] ------------------ 1681| 9.83k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1682| 9.83k| } _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_: 1690| 9.83k| { 1691| 9.83k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1692| 9.83k| } _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_: 1709| 9.83k| { 1710| 9.83k| assert(offset_hint == index(idx)); 1711| 0| assert(left_size_hint == 1712| 9.83k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1713| 0| auto child = node_->inner()[offset_hint]; 1714| 9.83k| auto is_leaf = shift_ == BL; 1715| 9.83k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1716| 9.83k| auto next_idx = idx - left_size_hint; 1717| 9.83k| return is_leaf ------------------ | Branch (1717:16): [True: 1.90k, False: 7.93k] ------------------ 1718| 9.83k| ? make_leaf_sub_pos(child, next_size) 1719| 1.90k| .visit(v, next_idx, args...) 1720| 9.83k| : visit_maybe_relaxed_sub( 1721| 7.93k| child, shift_ - B, next_size, v, next_idx, args...); 1722| 9.83k| } _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_: 143| 1.90k| { 144| 1.90k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 1.90k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1830| 7.93k|{ 1831| 7.93k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 7.93k| if (relaxed) { ------------------ | Branch (1833:9): [True: 2.91k, False: 5.01k] ------------------ 1834| 2.91k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 2.91k| .visit(v, std::forward(args)...); 1837| 5.01k| } else { 1838| 5.01k| return make_regular_sub_pos(node, shift, size) 1839| 5.01k| .visit(v, std::forward(args)...); 1840| 5.01k| } 1841| 7.93k|} _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_: 1805| 2.91k| { 1806| 2.91k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 2.91k| } _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_: 1028| 5.01k| { 1029| 5.01k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 5.01k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1028| 10.5k| { 1029| 10.5k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 10.5k| } _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_: 1678| 12.9k| { 1679| 12.9k| assert(offset_hint == index(idx)); 1680| 12.9k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1680:26): [True: 10.8k, False: 2.13k] ------------------ 1681| 12.9k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1682| 12.9k| } _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_: 1690| 12.9k| { 1691| 12.9k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1692| 12.9k| } _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_: 1709| 12.9k| { 1710| 12.9k| assert(offset_hint == index(idx)); 1711| 0| assert(left_size_hint == 1712| 12.9k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1713| 0| auto child = node_->inner()[offset_hint]; 1714| 12.9k| auto is_leaf = shift_ == BL; 1715| 12.9k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1716| 12.9k| auto next_idx = idx - left_size_hint; 1717| 12.9k| return is_leaf ------------------ | Branch (1717:16): [True: 5.13k, False: 7.82k] ------------------ 1718| 12.9k| ? make_leaf_sub_pos(child, next_size) 1719| 5.13k| .visit(v, next_idx, args...) 1720| 12.9k| : visit_maybe_relaxed_sub( 1721| 7.82k| child, shift_ - B, next_size, v, next_idx, args...); 1722| 12.9k| } _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_: 143| 5.13k| { 144| 5.13k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 5.13k| } _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_: 1830| 7.82k|{ 1831| 7.82k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 7.82k| if (relaxed) { ------------------ | Branch (1833:9): [True: 4.10k, False: 3.71k] ------------------ 1834| 4.10k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 4.10k| .visit(v, std::forward(args)...); 1837| 4.10k| } else { 1838| 3.71k| return make_regular_sub_pos(node, shift, size) 1839| 3.71k| .visit(v, std::forward(args)...); 1840| 3.71k| } 1841| 7.82k|} _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_: 1805| 4.10k| { 1806| 4.10k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 4.10k| } _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_: 1028| 3.71k| { 1029| 3.71k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 3.71k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1645| 26.7k| { 1646| 26.7k| assert(start > 0); 1647| 0| assert(start <= relaxed_->d.count); 1648| 0| auto s = relaxed_->d.sizes[start - 1]; 1649| 26.7k| auto p = node_->inner(); 1650| 26.7k| if (shift_ == BL) { ------------------ | Branch (1650:13): [True: 2.84k, False: 23.9k] ------------------ 1651| 10.4k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1651:34): [True: 7.65k, False: 2.84k] ------------------ 1652| 7.65k| IMMER_PREFETCH(p + i + 1); 1653| 7.65k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1654| 7.65k| .visit(v, args...); 1655| 7.65k| s = relaxed_->d.sizes[i]; 1656| 7.65k| assert(s); 1657| 7.65k| } 1658| 23.9k| } else { 1659| 23.9k| auto ss = shift_ - B; 1660| 131k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1660:34): [True: 107k, False: 23.9k] ------------------ 1661| 107k| visit_maybe_relaxed_sub( 1662| 107k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1663| 107k| s = relaxed_->d.sizes[i]; 1664| 107k| assert(s); 1665| 107k| } 1666| 23.9k| } 1667| 26.7k| } _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_: 1028| 12.4k| { 1029| 12.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 12.4k| } _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_: 919| 5.23k| { 920| 5.23k| return towards_oh_ch_regular( 921| 5.23k| *this, v, idx, offset_hint, count(), args...); 922| 5.23k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb1ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 630| 5.23k|{ 631| 5.23k| constexpr auto B = bits; 632| 5.23k| constexpr auto BL = bits_leaf; 633| 5.23k| assert(offset_hint == p.index(idx)); 634| 0| assert(count_hint == p.count()); 635| 0| auto is_leaf = p.shift() == BL; 636| 5.23k| auto child = p.node()->inner()[offset_hint]; 637| 5.23k| auto is_full = offset_hint + 1 != count_hint; 638| 5.23k| return is_full ------------------ | Branch (638:12): [True: 4.36k, False: 871] ------------------ 639| 5.23k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (639:19): [True: 1.01k, False: 3.35k] ------------------ 640| 4.36k| : make_full_pos(child, p.shift() - B) 641| 3.35k| .visit(v, idx, args...)) 642| 5.23k| : (is_leaf ------------------ | Branch (642:19): [True: 871, False: 0] ------------------ 643| 871| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 644| 871| : make_regular_pos(child, p.shift() - B, p.size()) 645| 0| .visit(v, idx, args...)); 646| 5.23k|} _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_: 205| 1.71k| { 206| 1.71k| return Visitor::visit_leaf(*this, std::forward(args)...); 207| 1.71k| } _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_: 1397| 3.88k| { 1398| 3.88k| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 3.88k| } _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_: 1328| 1.23k| { 1329| 1.23k| assert(offset_hint == index(idx)); 1330| 0| auto is_leaf = shift_ == BL; 1331| 1.23k| auto child = node_->inner()[offset_hint]; 1332| 1.23k| return is_leaf ------------------ | Branch (1332:16): [True: 706, False: 529] ------------------ 1333| 1.23k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1334| 1.23k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1335| 1.23k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 111| 871| { 112| 871| return Visitor::visit_leaf(*this, std::forward(args)...); 113| 871| } _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_: 143| 932| { 144| 932| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 932| } _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_: 1830| 53.6k|{ 1831| 53.6k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 53.6k| if (relaxed) { ------------------ | Branch (1833:9): [True: 50.7k, False: 2.97k] ------------------ 1834| 50.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 50.7k| .visit(v, std::forward(args)...); 1837| 50.7k| } else { 1838| 2.97k| return make_regular_sub_pos(node, shift, size) 1839| 2.97k| .visit(v, std::forward(args)...); 1840| 2.97k| } 1841| 53.6k|} _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_: 1805| 50.7k| { 1806| 50.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 50.7k| } _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_: 1697| 1.52k| { 1698| 1.52k| assert(offset_hint == index(idx)); 1699| 1.52k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1699:26): [True: 1.14k, False: 382] ------------------ 1700| 1.52k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1701| 1.52k| } _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_: 1709| 1.52k| { 1710| 1.52k| assert(offset_hint == index(idx)); 1711| 0| assert(left_size_hint == 1712| 1.52k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1713| 0| auto child = node_->inner()[offset_hint]; 1714| 1.52k| auto is_leaf = shift_ == BL; 1715| 1.52k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1716| 1.52k| auto next_idx = idx - left_size_hint; 1717| 1.52k| return is_leaf ------------------ | Branch (1717:16): [True: 0, False: 1.52k] ------------------ 1718| 1.52k| ? make_leaf_sub_pos(child, next_size) 1719| 0| .visit(v, next_idx, args...) 1720| 1.52k| : visit_maybe_relaxed_sub( 1721| 1.52k| child, shift_ - B, next_size, v, next_idx, args...); 1722| 1.52k| } _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_: 1697| 3.75k| { 1698| 3.75k| assert(offset_hint == index(idx)); 1699| 3.75k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1699:26): [True: 3.25k, False: 505] ------------------ 1700| 3.75k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1701| 3.75k| } _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_: 1709| 3.75k| { 1710| 3.75k| assert(offset_hint == index(idx)); 1711| 0| assert(left_size_hint == 1712| 3.75k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1713| 0| auto child = node_->inner()[offset_hint]; 1714| 3.75k| auto is_leaf = shift_ == BL; 1715| 3.75k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1716| 3.75k| auto next_idx = idx - left_size_hint; 1717| 3.75k| return is_leaf ------------------ | Branch (1717:16): [True: 0, False: 3.75k] ------------------ 1718| 3.75k| ? make_leaf_sub_pos(child, next_size) 1719| 0| .visit(v, next_idx, args...) 1720| 3.75k| : visit_maybe_relaxed_sub( 1721| 3.75k| child, shift_ - B, next_size, v, next_idx, args...); 1722| 3.75k| } _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_: 1830| 3.75k|{ 1831| 3.75k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 3.75k| if (relaxed) { ------------------ | Branch (1833:9): [True: 2.52k, False: 1.22k] ------------------ 1834| 2.52k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 2.52k| .visit(v, std::forward(args)...); 1837| 2.52k| } else { 1838| 1.22k| return make_regular_sub_pos(node, shift, size) 1839| 1.22k| .visit(v, std::forward(args)...); 1840| 1.22k| } 1841| 3.75k|} _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_: 1805| 2.52k| { 1806| 2.52k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 2.52k| } _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_: 1028| 1.22k| { 1029| 1.22k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 1.22k| } _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_: 938| 1.67k| { 939| 1.67k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 940| 1.67k| } _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_: 651| 1.67k|{ 652| 1.67k| constexpr auto B = bits; 653| 1.67k| constexpr auto BL = bits_leaf; 654| 1.67k| assert(offset_hint == p.index(idx)); 655| 0| auto is_leaf = p.shift() == BL; 656| 1.67k| auto child = p.node()->inner()[offset_hint]; 657| 1.67k| auto lsize = offset_hint << p.shift(); 658| 1.67k| auto size = p.this_size(); 659| 1.67k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 660| 1.67k| return is_full ------------------ | Branch (660:12): [True: 633, False: 1.04k] ------------------ 661| 1.67k| ? (is_leaf ------------------ | Branch (661:19): [True: 0, False: 633] ------------------ 662| 633| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 663| 633| : make_full_pos(child, p.shift() - B) 664| 633| .visit(v, idx - lsize, args...)) 665| 1.67k| : (is_leaf ------------------ | Branch (665:19): [True: 0, False: 1.04k] ------------------ 666| 1.04k| ? make_leaf_sub_pos(child, size - lsize) 667| 0| .visit(v, idx - lsize, args...) 668| 1.04k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 669| 1.04k| .visit(v, idx - lsize, args...)); 670| 1.67k|} _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_: 1397| 633| { 1398| 633| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 633| } _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_: 1340| 2.47k| { 1341| 2.47k| assert(offset_hint == index(idx)); 1342| 0| auto is_leaf = shift_ == BL; 1343| 2.47k| auto child = node_->inner()[offset_hint]; 1344| 2.47k| auto lsize = size_t{offset_hint} << shift_; 1345| 2.47k| return is_leaf ------------------ | Branch (1345:16): [True: 1.76k, False: 704] ------------------ 1346| 2.47k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1347| 2.47k| : make_full_pos(child, shift_ - B) 1348| 704| .visit(v, idx - lsize, args...); 1349| 2.47k| } _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_: 205| 7.28k| { 206| 7.28k| return Visitor::visit_leaf(*this, std::forward(args)...); 207| 7.28k| } _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_: 1397| 1.83k| { 1398| 1.83k| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 1.83k| } _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_: 1028| 1.04k| { 1029| 1.04k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 1.04k| } _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_: 938| 6.65k| { 939| 6.65k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 940| 6.65k| } _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_: 651| 6.65k|{ 652| 6.65k| constexpr auto B = bits; 653| 6.65k| constexpr auto BL = bits_leaf; 654| 6.65k| assert(offset_hint == p.index(idx)); 655| 0| auto is_leaf = p.shift() == BL; 656| 6.65k| auto child = p.node()->inner()[offset_hint]; 657| 6.65k| auto lsize = offset_hint << p.shift(); 658| 6.65k| auto size = p.this_size(); 659| 6.65k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 660| 6.65k| return is_full ------------------ | Branch (660:12): [True: 6.65k, False: 0] ------------------ 661| 6.65k| ? (is_leaf ------------------ | Branch (661:19): [True: 5.51k, False: 1.13k] ------------------ 662| 6.65k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 663| 6.65k| : make_full_pos(child, p.shift() - B) 664| 1.13k| .visit(v, idx - lsize, args...)) 665| 6.65k| : (is_leaf ------------------ | Branch (665:19): [True: 0, False: 0] ------------------ 666| 0| ? make_leaf_sub_pos(child, size - lsize) 667| 0| .visit(v, idx - lsize, args...) 668| 0| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 669| 0| .visit(v, idx - lsize, args...)); 670| 6.65k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1805| 1.52k| { 1806| 1.52k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 1.52k| } _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_: 1697| 180k| { 1698| 180k| assert(offset_hint == index(idx)); 1699| 180k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1699:26): [True: 39.3k, False: 141k] ------------------ 1700| 180k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1701| 180k| } _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_: 1709| 180k| { 1710| 180k| assert(offset_hint == index(idx)); 1711| 0| assert(left_size_hint == 1712| 180k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1713| 0| auto child = node_->inner()[offset_hint]; 1714| 180k| auto is_leaf = shift_ == BL; 1715| 180k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1716| 180k| auto next_idx = idx - left_size_hint; 1717| 180k| return is_leaf ------------------ | Branch (1717:16): [True: 4.49k, False: 176k] ------------------ 1718| 180k| ? make_leaf_sub_pos(child, next_size) 1719| 4.49k| .visit(v, next_idx, args...) 1720| 180k| : visit_maybe_relaxed_sub( 1721| 176k| child, shift_ - B, next_size, v, next_idx, args...); 1722| 180k| } _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_: 143| 4.49k| { 144| 4.49k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 4.49k| } _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_: 1830| 176k|{ 1831| 176k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 176k| if (relaxed) { ------------------ | Branch (1833:9): [True: 174k, False: 1.61k] ------------------ 1834| 174k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 174k| .visit(v, std::forward(args)...); 1837| 174k| } else { 1838| 1.61k| return make_regular_sub_pos(node, shift, size) 1839| 1.61k| .visit(v, std::forward(args)...); 1840| 1.61k| } 1841| 176k|} _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_: 1805| 174k| { 1806| 174k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 174k| } _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_: 1028| 1.61k| { 1029| 1.61k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 1.61k| } _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_: 1697| 85.9k| { 1698| 85.9k| assert(offset_hint == index(idx)); 1699| 85.9k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1699:26): [True: 53.5k, False: 32.3k] ------------------ 1700| 85.9k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1701| 85.9k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1709| 85.9k| { 1710| 85.9k| assert(offset_hint == index(idx)); 1711| 0| assert(left_size_hint == 1712| 85.9k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1713| 0| auto child = node_->inner()[offset_hint]; 1714| 85.9k| auto is_leaf = shift_ == BL; 1715| 85.9k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1716| 85.9k| auto next_idx = idx - left_size_hint; 1717| 85.9k| return is_leaf ------------------ | Branch (1717:16): [True: 40.3k, False: 45.5k] ------------------ 1718| 85.9k| ? make_leaf_sub_pos(child, next_size) 1719| 40.3k| .visit(v, next_idx, args...) 1720| 85.9k| : visit_maybe_relaxed_sub( 1721| 45.5k| child, shift_ - B, next_size, v, next_idx, args...); 1722| 85.9k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 143| 40.3k| { 144| 40.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 40.3k| } _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_: 1830| 45.5k|{ 1831| 45.5k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 45.5k| if (relaxed) { ------------------ | Branch (1833:9): [True: 44.0k, False: 1.47k] ------------------ 1834| 44.0k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 44.0k| .visit(v, std::forward(args)...); 1837| 44.0k| } else { 1838| 1.47k| return make_regular_sub_pos(node, shift, size) 1839| 1.47k| .visit(v, std::forward(args)...); 1840| 1.47k| } 1841| 45.5k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1805| 44.0k| { 1806| 44.0k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 44.0k| } _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_: 1028| 1.47k| { 1029| 1.47k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 1.47k| } _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_: 1028| 2.97k| { 1029| 2.97k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 2.97k| } _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_: 1830| 23.1k|{ 1831| 23.1k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 23.1k| if (relaxed) { ------------------ | Branch (1833:9): [True: 13.0k, False: 10.0k] ------------------ 1834| 13.0k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 13.0k| .visit(v, std::forward(args)...); 1837| 13.0k| } else { 1838| 10.0k| return make_regular_sub_pos(node, shift, size) 1839| 10.0k| .visit(v, std::forward(args)...); 1840| 10.0k| } 1841| 23.1k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor3rrbEJNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERKPSC_RKjRmEEEDcT_DpOT0_: 1805| 13.0k| { 1806| 13.0k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 13.0k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcPT_jmT0_DpOT1_: 1830| 13.0k|{ 1831| 13.0k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 13.0k| if (relaxed) { ------------------ | Branch (1833:9): [True: 9.46k, False: 3.60k] ------------------ 1834| 9.46k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 9.46k| .visit(v, std::forward(args)...); 1837| 9.46k| } else { 1838| 3.60k| return make_regular_sub_pos(node, shift, size) 1839| 3.60k| .visit(v, std::forward(args)...); 1840| 3.60k| } 1841| 13.0k|} _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_: 1805| 9.46k| { 1806| 9.46k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 9.46k| } _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_: 1785| 45.9k| { 1786| 45.9k| auto child = node_->inner()[offset]; 1787| 45.9k| auto child_size = size(offset); 1788| 45.9k| auto is_leaf = shift_ == BL; 1789| 45.9k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1789:16): [True: 21.2k, False: 24.7k] ------------------ 1790| 45.9k| : visit_maybe_relaxed_sub( 1791| 24.7k| child, shift_ - B, child_size, v, args...); 1792| 45.9k| } _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_: 143| 21.7k| { 144| 21.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 21.7k| } _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_: 1796| 21.7k| { 1797| 21.7k| assert(shift_ == BL); 1798| 0| auto child = node_->inner()[offset]; 1799| 21.7k| auto child_size = size(offset); 1800| 21.7k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1801| 21.7k| } _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_: 143| 22.8k| { 144| 22.8k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 22.8k| } _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_: 1830| 24.7k|{ 1831| 24.7k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 24.7k| if (relaxed) { ------------------ | Branch (1833:9): [True: 22.6k, False: 2.07k] ------------------ 1834| 22.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 22.6k| .visit(v, std::forward(args)...); 1837| 22.6k| } else { 1838| 2.07k| return make_regular_sub_pos(node, shift, size) 1839| 2.07k| .visit(v, std::forward(args)...); 1840| 2.07k| } 1841| 24.7k|} _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_: 1805| 22.6k| { 1806| 22.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 22.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_: 1785| 22.6k| { 1786| 22.6k| auto child = node_->inner()[offset]; 1787| 22.6k| auto child_size = size(offset); 1788| 22.6k| auto is_leaf = shift_ == BL; 1789| 22.6k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1789:16): [True: 0, False: 22.6k] ------------------ 1790| 22.6k| : visit_maybe_relaxed_sub( 1791| 22.6k| child, shift_ - B, child_size, v, args...); 1792| 22.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_: 1830| 22.6k|{ 1831| 22.6k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 22.6k| if (relaxed) { ------------------ | Branch (1833:9): [True: 21.7k, False: 924] ------------------ 1834| 21.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 21.7k| .visit(v, std::forward(args)...); 1837| 21.7k| } else { 1838| 924| return make_regular_sub_pos(node, shift, size) 1839| 924| .visit(v, std::forward(args)...); 1840| 924| } 1841| 22.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_: 1805| 21.7k| { 1806| 21.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 21.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_: 1028| 1.24k| { 1029| 1.24k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 1.24k| } _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_: 1785| 9.45k| { 1786| 9.45k| auto child = node_->inner()[offset]; 1787| 9.45k| auto child_size = size(offset); 1788| 9.45k| auto is_leaf = shift_ == BL; 1789| 9.45k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1789:16): [True: 6.31k, False: 3.13k] ------------------ 1790| 9.45k| : visit_maybe_relaxed_sub( 1791| 3.13k| child, shift_ - B, child_size, v, args...); 1792| 9.45k| } _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_: 143| 6.31k| { 144| 6.31k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 6.31k| } _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_: 1017| 6.31k| { 1018| 6.31k| assert(shift_ == BL); 1019| 0| auto child = node_->inner()[idx]; 1020| 6.31k| auto lsize = size(idx); 1021| 6.31k| auto is_full = idx + 1 < count(); 1022| 6.31k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1022:16): [True: 5.26k, False: 1.05k] ------------------ 1023| 6.31k| : make_leaf_sub_pos(child, lsize).visit(v, args...); 1024| 6.31k| } _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_: 205| 13.2k| { 206| 13.2k| return Visitor::visit_leaf(*this, std::forward(args)...); 207| 13.2k| } _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_: 1830| 3.13k|{ 1831| 3.13k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 3.13k| if (relaxed) { ------------------ | Branch (1833:9): [True: 2.14k, False: 990] ------------------ 1834| 2.14k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 2.14k| .visit(v, std::forward(args)...); 1837| 2.14k| } else { 1838| 990| return make_regular_sub_pos(node, shift, size) 1839| 990| .visit(v, std::forward(args)...); 1840| 990| } 1841| 3.13k|} _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_: 1805| 2.14k| { 1806| 2.14k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 2.14k| } _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_: 999| 2.14k| { 1000| 2.14k| assert(idx < count()); 1001| 0| auto is_leaf = shift_ == BL; 1002| 2.14k| auto child = node_->inner()[idx]; 1003| 2.14k| auto lsize = size(idx); 1004| 2.14k| auto is_full = idx + 1 < count(); 1005| 2.14k| return is_full ------------------ | Branch (1005:16): [True: 1.81k, False: 323] ------------------ 1006| 2.14k| ? (is_leaf ------------------ | Branch (1006:23): [True: 0, False: 1.81k] ------------------ 1007| 1.81k| ? make_full_leaf_pos(child).visit(v, args...) 1008| 1.81k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1009| 2.14k| : (is_leaf ------------------ | Branch (1009:23): [True: 0, False: 323] ------------------ 1010| 323| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1011| 323| : make_regular_sub_pos(child, shift_ - B, lsize) 1012| 323| .visit(v, args...)); 1013| 2.14k| } _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_: 1397| 2.29k| { 1398| 2.29k| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 2.29k| } _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_: 1785| 9.25k| { 1786| 9.25k| auto child = node_->inner()[offset]; 1787| 9.25k| auto child_size = size(offset); 1788| 9.25k| auto is_leaf = shift_ == BL; 1789| 9.25k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1789:16): [True: 7.94k, False: 1.31k] ------------------ 1790| 9.25k| : visit_maybe_relaxed_sub( 1791| 1.31k| child, shift_ - B, child_size, v, args...); 1792| 9.25k| } _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_: 143| 7.94k| { 144| 7.94k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 7.94k| } _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_: 1388| 7.94k| { 1389| 7.94k| assert(shift_ == BL); 1390| 0| assert(idx < count()); 1391| 0| auto child = node_->inner()[idx]; 1392| 7.94k| return make_full_leaf_pos(child).visit(v, args...); 1393| 7.94k| } _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_: 1830| 1.31k|{ 1831| 1.31k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 1.31k| if (relaxed) { ------------------ | Branch (1833:9): [True: 473, False: 838] ------------------ 1834| 473| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 473| .visit(v, std::forward(args)...); 1837| 838| } else { 1838| 838| return make_regular_sub_pos(node, shift, size) 1839| 838| .visit(v, std::forward(args)...); 1840| 838| } 1841| 1.31k|} _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_: 1805| 473| { 1806| 473| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 473| } _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_: 1378| 473| { 1379| 473| assert(idx < count()); 1380| 0| auto is_leaf = shift_ == BL; 1381| 473| auto child = node_->inner()[idx]; 1382| 473| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1382:16): [True: 0, False: 473] ------------------ 1383| 473| : make_full_pos(child, shift_ - B).visit(v, args...); 1384| 473| } _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_: 1028| 838| { 1029| 838| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 838| } _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_: 1378| 838| { 1379| 838| assert(idx < count()); 1380| 0| auto is_leaf = shift_ == BL; 1381| 838| auto child = node_->inner()[idx]; 1382| 838| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1382:16): [True: 0, False: 838] ------------------ 1383| 838| : make_full_pos(child, shift_ - B).visit(v, args...); 1384| 838| } _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_: 1397| 1.82k| { 1398| 1.82k| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 1.82k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_pred_zipINS1_14equals_visitorEJEEEbT_PSC_DpOT0_: 1214| 3.26k| { 1215| 3.26k| auto p = node_->inner(); 1216| 3.26k| auto p2 = other->inner(); 1217| 3.26k| auto e = p + branches; 1218| 3.26k| if (shift_ == BL) { ------------------ | Branch (1218:13): [True: 2.46k, False: 804] ------------------ 1219| 13.8k| for (; p != e; ++p, ++p2) { ------------------ | Branch (1219:20): [True: 12.7k, False: 1.06k] ------------------ 1220| 12.7k| IMMER_PREFETCH(p + 1); 1221| 12.7k| if (!make_full_leaf_pos(*p).visit(v, *p2, args...)) ------------------ | Branch (1221:21): [True: 1.39k, False: 11.3k] ------------------ 1222| 1.39k| return false; 1223| 12.7k| } 1224| 2.46k| } else { 1225| 804| auto ss = shift_ - B; 1226| 5.35k| for (; p != e; ++p, ++p2) ------------------ | Branch (1226:20): [True: 4.85k, False: 493] ------------------ 1227| 4.85k| if (!make_full_pos(*p, ss).visit(v, *p2, args...)) ------------------ | Branch (1227:21): [True: 311, False: 4.54k] ------------------ 1228| 311| return false; 1229| 804| } 1230| 1.56k| return true; 1231| 3.26k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 205| 19.5k| { 206| 19.5k| return Visitor::visit_leaf(*this, std::forward(args)...); 207| 19.5k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 1397| 11.1k| { 1398| 11.1k| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 11.1k| } _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_: 829| 6.46k| { 830| 6.46k| return each_pred_zip_regular(*this, v, other, args...); 831| 6.46k| } _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_: 390| 6.46k|{ 391| 6.46k| constexpr auto B = bits; 392| 6.46k| constexpr auto BL = bits_leaf; 393| | 394| 6.46k| auto n = p.node()->inner(); 395| 6.46k| auto n2 = other->inner(); 396| 6.46k| auto last = p.count() - 1; 397| 6.46k| auto e = n + last; 398| 6.46k| if (p.shift() == BL) { ------------------ | Branch (398:9): [True: 2.07k, False: 4.39k] ------------------ 399| 5.73k| for (; n != e; ++n, ++n2) { ------------------ | Branch (399:16): [True: 4.40k, False: 1.32k] ------------------ 400| 4.40k| IMMER_PREFETCH(n + 1); 401| 4.40k| IMMER_PREFETCH(n2 + 1); 402| 4.40k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (402:17): [True: 749, False: 3.65k] ------------------ 403| 749| return false; 404| 4.40k| } 405| 1.32k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 406| 4.39k| } else { 407| 4.39k| auto ss = p.shift() - B; 408| 8.74k| for (; n != e; ++n, ++n2) ------------------ | Branch (408:16): [True: 5.28k, False: 3.45k] ------------------ 409| 5.28k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (409:17): [True: 937, False: 4.35k] ------------------ 410| 937| return false; 411| 3.45k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 412| 4.39k| } 413| 6.46k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 111| 3.84k| { 112| 3.84k| return Visitor::visit_leaf(*this, std::forward(args)...); 113| 3.84k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 334| 4.12k| { 335| 4.12k| return Visitor::visit_regular(*this, std::forward(args)...); 336| 4.12k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_pred_zipINS1_14equals_visitorEJEEEbT_PSC_DpOT0_: 253| 3.79k| { 254| 3.79k| return each_pred_zip_regular(*this, v, other, args...); 255| 3.79k| } _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_: 390| 3.79k|{ 391| 3.79k| constexpr auto B = bits; 392| 3.79k| constexpr auto BL = bits_leaf; 393| | 394| 3.79k| auto n = p.node()->inner(); 395| 3.79k| auto n2 = other->inner(); 396| 3.79k| auto last = p.count() - 1; 397| 3.79k| auto e = n + last; 398| 3.79k| if (p.shift() == BL) { ------------------ | Branch (398:9): [True: 2.92k, False: 865] ------------------ 399| 4.84k| for (; n != e; ++n, ++n2) { ------------------ | Branch (399:16): [True: 2.32k, False: 2.51k] ------------------ 400| 2.32k| IMMER_PREFETCH(n + 1); 401| 2.32k| IMMER_PREFETCH(n2 + 1); 402| 2.32k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (402:17): [True: 410, False: 1.91k] ------------------ 403| 410| return false; 404| 2.32k| } 405| 2.51k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 406| 2.92k| } else { 407| 865| auto ss = p.shift() - B; 408| 1.68k| for (; n != e; ++n, ++n2) ------------------ | Branch (408:16): [True: 1.01k, False: 671] ------------------ 409| 1.01k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (409:17): [True: 194, False: 817] ------------------ 410| 194| return false; 411| 671| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 412| 865| } 413| 3.79k|} _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_: 1378| 6.23k| { 1379| 6.23k| assert(idx < count()); 1380| 0| auto is_leaf = shift_ == BL; 1381| 6.23k| auto child = node_->inner()[idx]; 1382| 6.23k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1382:16): [True: 5.32k, False: 908] ------------------ 1383| 6.23k| : make_full_pos(child, shift_ - B).visit(v, args...); 1384| 6.23k| } _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_: 205| 279k| { 206| 279k| return Visitor::visit_leaf(*this, std::forward(args)...); 207| 279k| } _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_: 1830| 5.87M|{ 1831| 5.87M| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 5.87M| if (relaxed) { ------------------ | Branch (1833:9): [True: 5.55M, False: 310k] ------------------ 1834| 5.55M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 5.55M| .visit(v, std::forward(args)...); 1837| 5.55M| } else { 1838| 310k| return make_regular_sub_pos(node, shift, size) 1839| 310k| .visit(v, std::forward(args)...); 1840| 310k| } 1841| 5.87M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1805| 5.55M| { 1806| 5.55M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 5.55M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1671| 5.55M| { 1672| 5.55M| return towards_oh(v, idx, subindex(idx), args...); 1673| 5.55M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_18region_for_visitorIiEEJEEEDcT_mjDpOT0_: 1678| 5.55M| { 1679| 5.55M| assert(offset_hint == index(idx)); 1680| 5.55M| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1680:26): [True: 3.98M, False: 1.57M] ------------------ 1681| 5.55M| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1682| 5.55M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_18region_for_visitorIiEEJEEEDcT_mjmDpOT0_: 1690| 5.55M| { 1691| 5.55M| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1692| 5.55M| } _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_: 1709| 5.55M| { 1710| 5.55M| assert(offset_hint == index(idx)); 1711| 0| assert(left_size_hint == 1712| 5.55M| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1713| 0| auto child = node_->inner()[offset_hint]; 1714| 5.55M| auto is_leaf = shift_ == BL; 1715| 5.55M| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1716| 5.55M| auto next_idx = idx - left_size_hint; 1717| 5.55M| return is_leaf ------------------ | Branch (1717:16): [True: 1.18M, False: 4.37M] ------------------ 1718| 5.55M| ? make_leaf_sub_pos(child, next_size) 1719| 1.18M| .visit(v, next_idx, args...) 1720| 5.55M| : visit_maybe_relaxed_sub( 1721| 4.37M| child, shift_ - B, next_size, v, next_idx, args...); 1722| 5.55M| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 143| 1.18M| { 144| 1.18M| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 1.18M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1028| 310k| { 1029| 310k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 310k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 911| 310k| { 912| 310k| return towards_oh_ch_regular( 913| 310k| *this, v, idx, index(idx), count(), args...); 914| 310k| } _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_: 630| 310k|{ 631| 310k| constexpr auto B = bits; 632| 310k| constexpr auto BL = bits_leaf; 633| 310k| assert(offset_hint == p.index(idx)); 634| 0| assert(count_hint == p.count()); 635| 0| auto is_leaf = p.shift() == BL; 636| 310k| auto child = p.node()->inner()[offset_hint]; 637| 310k| auto is_full = offset_hint + 1 != count_hint; 638| 310k| return is_full ------------------ | Branch (638:12): [True: 254k, False: 56.2k] ------------------ 639| 310k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (639:19): [True: 111k, False: 142k] ------------------ 640| 254k| : make_full_pos(child, p.shift() - B) 641| 142k| .visit(v, idx, args...)) 642| 310k| : (is_leaf ------------------ | Branch (642:19): [True: 19.7k, False: 36.4k] ------------------ 643| 56.2k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 644| 56.2k| : make_regular_pos(child, p.shift() - B, p.size()) 645| 36.4k| .visit(v, idx, args...)); 646| 310k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 205| 286k| { 206| 286k| return Visitor::visit_leaf(*this, std::forward(args)...); 207| 286k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1397| 343k| { 1398| 343k| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 343k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1314| 343k| { 1315| 343k| return towards_oh(v, idx, index(idx), args...); 1316| 343k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_18region_for_visitorIiEEJEEEDcT_mjDpOT0_: 1328| 343k| { 1329| 343k| assert(offset_hint == index(idx)); 1330| 0| auto is_leaf = shift_ == BL; 1331| 343k| auto child = node_->inner()[offset_hint]; 1332| 343k| return is_leaf ------------------ | Branch (1332:16): [True: 167k, False: 176k] ------------------ 1333| 343k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1334| 343k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1335| 343k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 111| 24.1k| { 112| 24.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 113| 24.1k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 334| 41.8k| { 335| 41.8k| return Visitor::visit_regular(*this, std::forward(args)...); 336| 41.8k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 295| 41.8k| { 296| 41.8k| return towards_oh_ch_regular( 297| 41.8k| *this, v, idx, index(idx), count(), args...); 298| 41.8k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_18region_for_visitorIiEEJEEEDcOT_T0_mjjDpOT1_: 630| 41.8k|{ 631| 41.8k| constexpr auto B = bits; 632| 41.8k| constexpr auto BL = bits_leaf; 633| 41.8k| assert(offset_hint == p.index(idx)); 634| 0| assert(count_hint == p.count()); 635| 0| auto is_leaf = p.shift() == BL; 636| 41.8k| auto child = p.node()->inner()[offset_hint]; 637| 41.8k| auto is_full = offset_hint + 1 != count_hint; 638| 41.8k| return is_full ------------------ | Branch (638:12): [True: 32.0k, False: 9.74k] ------------------ 639| 41.8k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (639:19): [True: 7.54k, False: 24.5k] ------------------ 640| 32.0k| : make_full_pos(child, p.shift() - B) 641| 24.5k| .visit(v, idx, args...)) 642| 41.8k| : (is_leaf ------------------ | Branch (642:19): [True: 4.39k, False: 5.35k] ------------------ 643| 9.74k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 644| 9.74k| : make_regular_pos(child, p.shift() - B, p.size()) 645| 5.35k| .visit(v, idx, args...)); 646| 41.8k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 1397| 24.1k| { 1398| 24.1k| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 24.1k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 1194| 24.1k| { 1195| 24.1k| auto p = node_->inner(); 1196| 24.1k| auto e = p + branches; 1197| 24.1k| if (shift_ == BL) { ------------------ | Branch (1197:13): [True: 21.6k, False: 2.49k] ------------------ 1198| 190k| for (; p != e; ++p) { ------------------ | Branch (1198:20): [True: 169k, False: 20.8k] ------------------ 1199| 169k| IMMER_PREFETCH(p + 1); 1200| 169k| if (!make_full_leaf_pos(*p).visit(v, args...)) ------------------ | Branch (1200:21): [True: 804, False: 168k] ------------------ 1201| 804| return false; 1202| 169k| } 1203| 21.6k| } else { 1204| 2.49k| auto ss = shift_ - B; 1205| 21.0k| for (; p != e; ++p) ------------------ | Branch (1205:20): [True: 18.8k, False: 2.26k] ------------------ 1206| 18.8k| if (!make_full_pos(*p, ss).visit(v, args...)) ------------------ | Branch (1206:21): [True: 234, False: 18.5k] ------------------ 1207| 234| return false; 1208| 2.49k| } 1209| 23.0k| return true; 1210| 24.1k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1028| 990| { 1029| 990| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 990| } _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_: 999| 990| { 1000| 990| assert(idx < count()); 1001| 0| auto is_leaf = shift_ == BL; 1002| 990| auto child = node_->inner()[idx]; 1003| 990| auto lsize = size(idx); 1004| 990| auto is_full = idx + 1 < count(); 1005| 990| return is_full ------------------ | Branch (1005:16): [True: 990, False: 0] ------------------ 1006| 990| ? (is_leaf ------------------ | Branch (1006:23): [True: 0, False: 990] ------------------ 1007| 990| ? make_full_leaf_pos(child).visit(v, args...) 1008| 990| : make_full_pos(child, shift_ - B).visit(v, args...)) 1009| 990| : (is_leaf ------------------ | Branch (1009:23): [True: 0, False: 0] ------------------ 1010| 0| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1011| 0| : make_regular_sub_pos(child, shift_ - B, lsize) 1012| 0| .visit(v, args...)); 1013| 990| } _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_: 1028| 1.47k| { 1029| 1.47k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 1.47k| } _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_: 999| 5.23k| { 1000| 5.23k| assert(idx < count()); 1001| 0| auto is_leaf = shift_ == BL; 1002| 5.23k| auto child = node_->inner()[idx]; 1003| 5.23k| auto lsize = size(idx); 1004| 5.23k| auto is_full = idx + 1 < count(); 1005| 5.23k| return is_full ------------------ | Branch (1005:16): [True: 3.29k, False: 1.94k] ------------------ 1006| 5.23k| ? (is_leaf ------------------ | Branch (1006:23): [True: 2.76k, False: 536] ------------------ 1007| 3.29k| ? make_full_leaf_pos(child).visit(v, args...) 1008| 3.29k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1009| 5.23k| : (is_leaf ------------------ | Branch (1009:23): [True: 1.21k, False: 723] ------------------ 1010| 1.94k| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1011| 1.94k| : make_regular_sub_pos(child, shift_ - B, lsize) 1012| 723| .visit(v, args...)); 1013| 5.23k| } _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_: 143| 1.13M| { 144| 1.13M| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 1.13M| } _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_: 1028| 18.5k| { 1029| 18.5k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 18.5k| } _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_: 823| 18.5k| { 824| 18.5k| return each_pred_regular(*this, v, args...); 825| 18.5k| } _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_: 363| 18.5k|{ 364| 18.5k| constexpr auto B = bits; 365| 18.5k| constexpr auto BL = bits_leaf; 366| 18.5k| auto n = p.node()->inner(); 367| 18.5k| auto last = p.count() - 1; 368| 18.5k| auto e = n + last; 369| 18.5k| if (p.shift() == BL) { ------------------ | Branch (369:9): [True: 15.7k, False: 2.87k] ------------------ 370| 114k| for (; n != e; ++n) { ------------------ | Branch (370:16): [True: 99.5k, False: 15.2k] ------------------ 371| 99.5k| IMMER_PREFETCH(n + 1); 372| 99.5k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (372:17): [True: 473, False: 99.1k] ------------------ 373| 473| return false; 374| 99.5k| } 375| 15.2k| return make_leaf_pos(*n, p.size()).visit(v, args...); 376| 15.7k| } else { 377| 2.87k| auto ss = p.shift() - B; 378| 5.27k| for (; n != e; ++n) ------------------ | Branch (378:16): [True: 2.81k, False: 2.45k] ------------------ 379| 2.81k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (379:17): [True: 412, False: 2.40k] ------------------ 380| 412| return false; 381| 2.45k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 382| 2.87k| } 383| 18.5k|} _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_: 111| 17.3k| { 112| 17.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 113| 17.3k| } _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_: 334| 3.40k| { 335| 3.40k| return Visitor::visit_regular(*this, std::forward(args)...); 336| 3.40k| } _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_: 247| 3.40k| { 248| 3.40k| return each_pred_regular(*this, v, args...); 249| 3.40k| } _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_: 363| 3.40k|{ 364| 3.40k| constexpr auto B = bits; 365| 3.40k| constexpr auto BL = bits_leaf; 366| 3.40k| auto n = p.node()->inner(); 367| 3.40k| auto last = p.count() - 1; 368| 3.40k| auto e = n + last; 369| 3.40k| if (p.shift() == BL) { ------------------ | Branch (369:9): [True: 2.25k, False: 1.14k] ------------------ 370| 4.87k| for (; n != e; ++n) { ------------------ | Branch (370:16): [True: 2.82k, False: 2.05k] ------------------ 371| 2.82k| IMMER_PREFETCH(n + 1); 372| 2.82k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (372:17): [True: 206, False: 2.62k] ------------------ 373| 206| return false; 374| 2.82k| } 375| 2.05k| return make_leaf_pos(*n, p.size()).visit(v, args...); 376| 2.25k| } else { 377| 1.14k| auto ss = p.shift() - B; 378| 1.98k| for (; n != e; ++n) ------------------ | Branch (378:16): [True: 1.04k, False: 946] ------------------ 379| 1.04k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (379:17): [True: 200, False: 842] ------------------ 380| 200| return false; 381| 946| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 382| 1.14k| } 383| 3.40k|} _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_: 1028| 2.07k| { 1029| 2.07k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 2.07k| } _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_: 1785| 2.07k| { 1786| 2.07k| auto child = node_->inner()[offset]; 1787| 2.07k| auto child_size = size(offset); 1788| 2.07k| auto is_leaf = shift_ == BL; 1789| 2.07k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1789:16): [True: 0, False: 2.07k] ------------------ 1790| 2.07k| : visit_maybe_relaxed_sub( 1791| 2.07k| child, shift_ - B, child_size, v, args...); 1792| 2.07k| } _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_: 1830| 2.07k|{ 1831| 2.07k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 2.07k| if (relaxed) { ------------------ | Branch (1833:9): [True: 591, False: 1.47k] ------------------ 1834| 591| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 591| .visit(v, std::forward(args)...); 1837| 1.47k| } else { 1838| 1.47k| return make_regular_sub_pos(node, shift, size) 1839| 1.47k| .visit(v, std::forward(args)...); 1840| 1.47k| } 1841| 2.07k|} _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_: 1805| 591| { 1806| 591| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 591| } _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_: 999| 6.15k| { 1000| 6.15k| assert(idx < count()); 1001| 0| auto is_leaf = shift_ == BL; 1002| 6.15k| auto child = node_->inner()[idx]; 1003| 6.15k| auto lsize = size(idx); 1004| 6.15k| auto is_full = idx + 1 < count(); 1005| 6.15k| return is_full ------------------ | Branch (1005:16): [True: 5.59k, False: 555] ------------------ 1006| 6.15k| ? (is_leaf ------------------ | Branch (1006:23): [True: 3.83k, False: 1.76k] ------------------ 1007| 5.59k| ? make_full_leaf_pos(child).visit(v, args...) 1008| 5.59k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1009| 6.15k| : (is_leaf ------------------ | Branch (1009:23): [True: 555, False: 0] ------------------ 1010| 555| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1011| 555| : make_regular_sub_pos(child, shift_ - B, lsize) 1012| 0| .visit(v, args...)); 1013| 6.15k| } _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_: 205| 8.16k| { 206| 8.16k| return Visitor::visit_leaf(*this, std::forward(args)...); 207| 8.16k| } _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_: 1796| 8.16k| { 1797| 8.16k| assert(shift_ == BL); 1798| 0| auto child = node_->inner()[offset]; 1799| 8.16k| auto child_size = size(offset); 1800| 8.16k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1801| 8.16k| } _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_: 143| 8.16k| { 144| 8.16k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 8.16k| } _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_: 1397| 2.11k| { 1398| 2.11k| return Visitor::visit_regular(*this, std::forward(args)...); 1399| 2.11k| } _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_: 1785| 2.11k| { 1786| 2.11k| auto child = node_->inner()[offset]; 1787| 2.11k| auto child_size = size(offset); 1788| 2.11k| auto is_leaf = shift_ == BL; 1789| 2.11k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1789:16): [True: 0, False: 2.11k] ------------------ 1790| 2.11k| : visit_maybe_relaxed_sub( 1791| 2.11k| child, shift_ - B, child_size, v, args...); 1792| 2.11k| } _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_: 1830| 2.11k|{ 1831| 2.11k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 2.11k| if (relaxed) { ------------------ | Branch (1833:9): [True: 1.06k, False: 1.05k] ------------------ 1834| 1.06k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 1.06k| .visit(v, std::forward(args)...); 1837| 1.06k| } else { 1838| 1.05k| return make_regular_sub_pos(node, shift, size) 1839| 1.05k| .visit(v, std::forward(args)...); 1840| 1.05k| } 1841| 2.11k|} _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_: 1805| 1.06k| { 1806| 1.06k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 1.06k| } _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_: 1378| 4.68k| { 1379| 4.68k| assert(idx < count()); 1380| 0| auto is_leaf = shift_ == BL; 1381| 4.68k| auto child = node_->inner()[idx]; 1382| 4.68k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1382:16): [True: 4.33k, False: 353] ------------------ 1383| 4.68k| : make_full_pos(child, shift_ - B).visit(v, args...); 1384| 4.68k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1028| 1.05k| { 1029| 1.05k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 1.05k| } _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_: 1785| 58.4k| { 1786| 58.4k| auto child = node_->inner()[offset]; 1787| 58.4k| auto child_size = size(offset); 1788| 58.4k| auto is_leaf = shift_ == BL; 1789| 58.4k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1789:16): [True: 23.3k, False: 35.0k] ------------------ 1790| 58.4k| : visit_maybe_relaxed_sub( 1791| 35.0k| child, shift_ - B, child_size, v, args...); 1792| 58.4k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSI_T0_E_EEEDcPSI_jmSK_DpOT1_: 1830| 188k|{ 1831| 188k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 188k| if (relaxed) { ------------------ | Branch (1833:9): [True: 170k, False: 17.8k] ------------------ 1834| 170k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 170k| .visit(v, std::forward(args)...); 1837| 170k| } else { 1838| 17.8k| return make_regular_sub_pos(node, shift, size) 1839| 17.8k| .visit(v, std::forward(args)...); 1840| 17.8k| } 1841| 188k|} _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_: 1805| 170k| { 1806| 170k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 170k| } _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_: 1474| 170k| { 1475| 170k| auto p = node_->inner(); 1476| 170k| auto s = size_t{}; 1477| 170k| auto n = count(); 1478| 170k| if (shift_ == BL) { ------------------ | Branch (1478:13): [True: 148k, False: 22.1k] ------------------ 1479| 1.26M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1479:39): [True: 1.11M, False: 147k] ------------------ 1480| 1.11M| IMMER_PREFETCH(p + i + 1); 1481| 1.11M| if (!make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) ------------------ | Branch (1481:21): [True: 568, False: 1.11M] ------------------ 1482| 1.11M| .visit(v, args...)) 1483| 568| return false; 1484| 1.11M| s = relaxed_->d.sizes[i]; 1485| 1.11M| } 1486| 148k| } else { 1487| 22.1k| auto ss = shift_ - B; 1488| 174k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1488:39): [True: 153k, False: 21.0k] ------------------ 1489| 153k| if (!visit_maybe_relaxed_sub( ------------------ | Branch (1489:21): [True: 1.13k, False: 152k] ------------------ 1490| 153k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...)) 1491| 1.13k| return false; 1492| 152k| s = relaxed_->d.sizes[i]; 1493| 152k| } 1494| 22.1k| } 1495| 168k| return true; 1496| 170k| } _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_: 1028| 3.60k| { 1029| 3.60k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 3.60k| } _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_: 1775| 1.13k| { 1776| 1.13k| assert(shift_ > BL); 1777| 0| auto child = node_->inner()[0]; 1778| 1.13k| auto child_size = relaxed_->d.sizes[0]; 1779| 1.13k| return visit_maybe_relaxed_sub( 1780| 1.13k| child, shift_ - B, child_size, v, args...); 1781| 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_: 1830| 1.13k|{ 1831| 1.13k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 1.13k| if (relaxed) { ------------------ | Branch (1833:9): [True: 1.13k, False: 0] ------------------ 1834| 1.13k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 1.13k| .visit(v, std::forward(args)...); 1837| 1.13k| } else { 1838| 0| return make_regular_sub_pos(node, shift, size) 1839| 0| .visit(v, std::forward(args)...); 1840| 0| } 1841| 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_: 1805| 1.13k| { 1806| 1.13k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 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_: 1830| 10.0k|{ 1831| 10.0k| assert(node); 1832| 0| auto relaxed = node->relaxed(); 1833| 10.0k| if (relaxed) { ------------------ | Branch (1833:9): [True: 2.36k, False: 7.70k] ------------------ 1834| 2.36k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); 1835| 0| return make_relaxed_pos(node, shift, relaxed) 1836| 2.36k| .visit(v, std::forward(args)...); 1837| 7.70k| } else { 1838| 7.70k| return make_regular_sub_pos(node, shift, size) 1839| 7.70k| .visit(v, std::forward(args)...); 1840| 7.70k| } 1841| 10.0k|} _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_: 1805| 2.36k| { 1806| 2.36k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1807| 2.36k| } _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_: 1028| 7.70k| { 1029| 7.70k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 7.70k| } _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_: 1028| 10.0k| { 1029| 10.0k| return Visitor::visit_regular(*this, std::forward(args)...); 1030| 10.0k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRKPSC_EEEDcT_DpOT0_: 143| 9.05k| { 144| 9.05k| return Visitor::visit_leaf(*this, std::forward(args)...); 145| 9.05k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2Ev: 106| 1.27M| { 107| 1.27M| assert(check_tree()); 108| 1.27M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10empty_rootEv: 51| 1.29M| { 52| 1.29M| static const auto empty_ = []{ 53| 1.29M| constexpr auto size = node_t::sizeof_inner_n(0); 54| 1.29M| static std::aligned_storage_t storage; 55| 1.29M| return node_t::make_inner_n_into(&storage, size, 0u); 56| 1.29M| }(); 57| 1.29M| return empty_->inc(); 58| 1.29M| } _ZZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10empty_rootEvENKUlvE_clEv: 52| 1| static const auto empty_ = []{ 53| 1| constexpr auto size = node_t::sizeof_inner_n(0); 54| 1| static std::aligned_storage_t storage; 55| 1| return node_t::make_inner_n_into(&storage, size, 0u); 56| 1| }(); _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10empty_tailEv: 61| 1.27M| { 62| 1.27M| static const auto empty_ = []{ 63| 1.27M| constexpr auto size = node_t::sizeof_leaf_n(0); 64| 1.27M| static std::aligned_storage_t storage; 65| 1.27M| return node_t::make_leaf_n_into(&storage, size, 0u); 66| 1.27M| }(); 67| 1.27M| return empty_->inc(); 68| 1.27M| } _ZZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10empty_tailEvENKUlvE_clEv: 62| 1| static const auto empty_ = []{ 63| 1| constexpr auto size = node_t::sizeof_leaf_n(0); 64| 1| static std::aligned_storage_t storage; 65| 1| return node_t::make_leaf_n_into(&storage, size, 0u); 66| 1| }(); _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10check_treeEv: 1341| 3.13M| { 1342| 3.13M| assert(shift <= sizeof(size_t) * 8 - BL); 1343| 0| assert(shift >= BL); 1344| 0| assert(tail_offset() <= size); 1345| 0| assert(tail_size() <= branches); 1346| |#if IMMER_DEBUG_DEEP_CHECK 1347| | assert(check_root()); 1348| | assert(check_tail()); 1349| |#endif 1350| 0| return true; 1351| 3.13M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11tail_offsetEv: 166| 17.7M| { 167| 17.7M| auto r = root->relaxed(); 168| 17.7M| assert(r == nullptr || r->d.count); 169| 17.7M| return r ? r->d.sizes[r->d.count - 1] ------------------ | Branch (169:16): [True: 10.1M, False: 7.59M] ------------------ 170| 17.7M| : size ? (size - 1) & ~mask ------------------ | Branch (170:18): [True: 3.73M, False: 3.85M] ------------------ 171| | /* otherwise */ 172| 7.59M| : 0; 173| 17.7M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9tail_sizeEv: 163| 3.45M| auto tail_size() const { return size - tail_offset(); } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EED2Ev: 153| 3.13M| ~rrbtree() { dec(); } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3decEv: 161| 3.13M| 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_: 177| 3.13M| { 178| 3.13M| auto tail_off = tail_offset(); 179| 3.13M| auto tail_size = size - tail_off; 180| | 181| 3.13M| if (tail_off) ------------------ | Branch (181:13): [True: 1.53M, False: 1.60M] ------------------ 182| 1.53M| visit_maybe_relaxed_sub(root, shift, tail_off, v, args...); 183| 1.60M| else 184| 1.60M| make_empty_regular_pos(root).visit(v, args...); 185| | 186| 3.13M| if (tail_size) ------------------ | Branch (186:13): [True: 1.85M, False: 1.27M] ------------------ 187| 1.85M| make_leaf_sub_pos(tail, tail_size).visit(v, args...); 188| 1.27M| else 189| 1.27M| make_empty_leaf_pos(tail).visit(v, args...); 190| 3.13M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_backEi: 469| 274k| { 470| 274k| auto ts = tail_size(); 471| 274k| if (ts < branches) { ------------------ | Branch (471:13): [True: 231k, False: 43.2k] ------------------ 472| 231k| auto new_tail = 473| 231k| node_t::copy_leaf_emplace(tail, ts, std::move(value)); 474| 231k| return {size + 1, shift, root->inc(), new_tail}; 475| 231k| } else { 476| 43.2k| using std::get; 477| 43.2k| auto new_tail = node_t::make_leaf_n(1u, std::move(value)); 478| 43.2k| auto tail_off = tail_offset(); 479| 43.2k| IMMER_TRY { ------------------ | | 41| 43.2k|#define IMMER_TRY try ------------------ 480| 43.2k| auto new_root = 481| 43.2k| push_tail(root, shift, tail_off, tail, size - tail_off); 482| 43.2k| tail->inc(); 483| 43.2k| return {size + 1, get<0>(new_root), get<1>(new_root), new_tail}; 484| 43.2k| } 485| 43.2k| IMMER_CATCH (...) { 486| 0| node_t::delete_leaf(new_tail, 1u); 487| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 488| 0| } 489| 43.2k| } 490| 274k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2EmjPNS1_4nodeIiSA_Lj3ELj3EEESE_: 115| 1.86M| { 116| 1.86M| assert(check_tree()); 117| 1.86M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_tailEPNS1_4nodeIiSA_Lj3ELj3EEEjmSE_j: 338| 220k| { 339| 220k| if (auto r = root->relaxed()) { ------------------ | Branch (339:18): [True: 57.4k, False: 162k] ------------------ 340| 57.4k| auto new_root = 341| 57.4k| make_relaxed_pos(root, shift, r) 342| 57.4k| .visit(push_tail_visitor{}, tail, tail_size); 343| 57.4k| if (new_root) ------------------ | Branch (343:17): [True: 55.2k, False: 2.26k] ------------------ 344| 55.2k| return std::make_tuple(shift, new_root); 345| 2.26k| else { 346| 2.26k| auto new_root = node_t::make_inner_r_n(2); 347| 2.26k| IMMER_TRY { ------------------ | | 41| 2.26k|#define IMMER_TRY try ------------------ 348| 2.26k| auto new_path = node_t::make_path(shift, tail); 349| 2.26k| new_root->inner()[0] = root->inc(); 350| 2.26k| new_root->inner()[1] = new_path; 351| 2.26k| new_root->relaxed()->d.sizes[0] = size; 352| 2.26k| new_root->relaxed()->d.sizes[1] = size + tail_size; 353| 2.26k| assert(size); 354| 0| assert(tail_size); 355| 0| new_root->relaxed()->d.count = 2u; 356| 2.26k| } 357| 2.26k| IMMER_CATCH (...) { 358| 0| node_t::delete_inner_r(new_root, 2); 359| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 360| 0| } 361| 2.26k| return std::make_tuple(shift + B, new_root); 362| 2.26k| } 363| 162k| } else if (size == size_t{branches} << shift) { ------------------ | Branch (363:20): [True: 4.10k, False: 158k] ------------------ 364| 4.10k| auto new_root = node_t::make_inner_n(2); 365| 4.10k| IMMER_TRY { ------------------ | | 41| 4.10k|#define IMMER_TRY try ------------------ 366| 4.10k| auto new_path = node_t::make_path(shift, tail); 367| 4.10k| new_root->inner()[0] = root->inc(); 368| 4.10k| new_root->inner()[1] = new_path; 369| 4.10k| } 370| 4.10k| IMMER_CATCH (...) { 371| 0| node_t::delete_inner(new_root, 2); 372| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 373| 0| } 374| 4.10k| return std::make_tuple(shift + B, new_root); 375| 158k| } else if (size) { ------------------ | Branch (375:20): [True: 144k, False: 14.0k] ------------------ 376| 144k| auto new_root = make_regular_sub_pos(root, shift, size) 377| 144k| .visit(push_tail_visitor{}, tail); 378| 144k| return std::make_tuple(shift, new_root); 379| 144k| } else { 380| 14.0k| return std::make_tuple(shift, node_t::make_path(shift, tail)); 381| 14.0k| } 382| 220k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2EOSB_: 127| 1.17M| { 128| 1.17M| swap(*this, other); 129| 1.17M| } _ZN5immer6detail4rbts4swapERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEESC_: 145| 4.53M| { 146| 4.53M| using std::swap; 147| 4.53M| swap(x.size, y.size); 148| 4.53M| swap(x.shift, y.shift); 149| 4.53M| swap(x.root, y.root); 150| 4.53M| swap(x.tail, y.tail); 151| 4.53M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEaSEOSB_: 139| 3.35M| { 140| 3.35M| swap(*this, other); 141| 3.35M| return *this; 142| 3.35M| } flex-vector-bo.cpp:_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6updateIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSG_E_EESB_mOSG_: 549| 363k| { 550| 363k| auto tail_off = tail_offset(); 551| 363k| if (idx >= tail_off) { ------------------ | Branch (551:13): [True: 301k, False: 62.2k] ------------------ 552| 301k| auto tail_size = size - tail_off; 553| 301k| auto new_tail = 554| 301k| make_leaf_sub_pos(tail, tail_size) 555| 301k| .visit(update_visitor{}, idx - tail_off, fn); 556| 301k| return {size, shift, root->inc(), new_tail}; 557| 301k| } else { 558| 62.2k| auto new_root = visit_maybe_relaxed_sub( 559| 62.2k| root, shift, tail_off, update_visitor{}, idx, fn); 560| 62.2k| return {size, shift, new_root, tail->inc()}; 561| 62.2k| } 562| 363k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4takeEm: 616| 24.0k| { 617| 24.0k| auto tail_off = tail_offset(); 618| 24.0k| if (new_size == 0) { ------------------ | Branch (618:13): [True: 4.34k, False: 19.7k] ------------------ 619| 4.34k| return {}; 620| 19.7k| } else if (new_size >= size) { ------------------ | Branch (620:20): [True: 1.17k, False: 18.5k] ------------------ 621| 1.17k| return *this; 622| 18.5k| } else if (new_size > tail_off) { ------------------ | Branch (622:20): [True: 1.59k, False: 16.9k] ------------------ 623| 1.59k| auto new_tail = node_t::copy_leaf(tail, new_size - tail_off); 624| 1.59k| return {new_size, shift, root->inc(), new_tail}; 625| 16.9k| } else { 626| 16.9k| using std::get; 627| 16.9k| auto l = new_size - 1; 628| 16.9k| auto v = slice_right_visitor(); 629| 16.9k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l); 630| 16.9k| auto new_shift = get<0>(r); 631| 16.9k| auto new_root = get<1>(r); 632| 16.9k| auto new_tail = get<3>(r); 633| 16.9k| if (new_root) { ------------------ | Branch (633:17): [True: 12.6k, False: 4.33k] ------------------ 634| 12.6k| IMMER_ASSERT_TAGGED(new_root->compute_shift() == get<0>(r)); ------------------ | | 60| 12.6k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 635| 0| assert(new_root->check(new_shift, new_size - get<2>(r))); 636| 0| return {new_size, new_shift, new_root, new_tail}; 637| 12.6k| } else { 638| 4.33k| return {new_size, BL, empty_root(), new_tail}; 639| 4.33k| } 640| 16.9k| } 641| 24.0k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2ERKSB_: 121| 10.4k| { 122| 10.4k| inc(); 123| 10.4k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3incEv: 156| 10.4k| { 157| 10.4k| root->inc(); 158| 10.4k| tail->inc(); 159| 10.4k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4dropEm: 680| 34.0k| { 681| 34.0k| if (elems == 0) { ------------------ | Branch (681:13): [True: 3.24k, False: 30.8k] ------------------ 682| 3.24k| return *this; 683| 30.8k| } else if (elems >= size) { ------------------ | Branch (683:20): [True: 1.85k, False: 28.9k] ------------------ 684| 1.85k| return {}; 685| 28.9k| } else if (elems == tail_offset()) { ------------------ | Branch (685:20): [True: 1.87k, False: 27.0k] ------------------ 686| 1.87k| return {size - elems, BL, empty_root(), tail->inc()}; 687| 27.0k| } else if (elems > tail_offset()) { ------------------ | Branch (687:20): [True: 1.67k, False: 25.4k] ------------------ 688| 1.67k| auto tail_off = tail_offset(); 689| 1.67k| auto new_tail = 690| 1.67k| node_t::copy_leaf(tail, elems - tail_off, size - tail_off); 691| 1.67k| return {size - elems, BL, empty_root(), new_tail}; 692| 25.4k| } else { 693| 25.4k| using std::get; 694| 25.4k| auto v = slice_left_visitor(); 695| 25.4k| auto r = 696| 25.4k| visit_maybe_relaxed_sub(root, shift, tail_offset(), v, elems); 697| 25.4k| auto new_root = get<1>(r); 698| 25.4k| auto new_shift = get<0>(r); 699| 25.4k| return {size - elems, new_shift, new_root, tail->inc()}; 700| 25.4k| } 701| 34.0k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8max_sizeEv: 44| 2.29M| { 45| 2.29M| auto S = sizeof(size_t) * 8; 46| 2.29M| return ((size_t{1} << BL) - std::min(size_t{BL}, size_t{2})) * 47| 2.29M| ipow((size_t{1} << B) - 2, (S - BL) / B); 48| 2.29M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6concatERKSB_: 704| 445k| { 705| 445k| assert(r.size + size <= max_size()); 706| 0| using std::get; 707| 445k| if (size == 0) ------------------ | Branch (707:13): [True: 1.78k, False: 443k] ------------------ 708| 1.78k| return r; 709| 443k| else if (r.size == 0) ------------------ | Branch (709:18): [True: 1.02k, False: 442k] ------------------ 710| 1.02k| return *this; 711| 442k| else if (r.tail_offset() == 0) { ------------------ | Branch (711:18): [True: 196k, False: 246k] ------------------ 712| | // just concat the tail, similar to push_back 713| 196k| auto tail_offst = tail_offset(); 714| 196k| auto tail_size = size - tail_offst; 715| 196k| if (tail_size == branches) { ------------------ | Branch (715:17): [True: 61.1k, False: 135k] ------------------ 716| 61.1k| auto new_root = 717| 61.1k| push_tail(root, shift, tail_offst, tail, tail_size); 718| 61.1k| tail->inc(); 719| 61.1k| return {size + r.size, 720| 61.1k| get<0>(new_root), 721| 61.1k| get<1>(new_root), 722| 61.1k| r.tail->inc()}; 723| 135k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (723:24): [True: 20.6k, False: 114k] ------------------ 724| 20.6k| auto new_tail = 725| 20.6k| node_t::copy_leaf(tail, tail_size, r.tail, r.size); 726| 20.6k| return {size + r.size, shift, root->inc(), new_tail}; 727| 114k| } else { 728| 114k| auto remaining = branches - tail_size; 729| 114k| auto add_tail = 730| 114k| node_t::copy_leaf(tail, tail_size, r.tail, remaining); 731| 114k| IMMER_TRY { ------------------ | | 41| 114k|#define IMMER_TRY try ------------------ 732| 114k| auto new_tail = 733| 114k| node_t::copy_leaf(r.tail, remaining, r.size); 734| 114k| IMMER_TRY { ------------------ | | 41| 114k|#define IMMER_TRY try ------------------ 735| 114k| auto new_root = push_tail( 736| 114k| root, shift, tail_offst, add_tail, branches); 737| 114k| return {size + r.size, 738| 114k| get<0>(new_root), 739| 114k| get<1>(new_root), 740| 114k| new_tail}; 741| 114k| } 742| 114k| IMMER_CATCH (...) { 743| 0| node_t::delete_leaf(new_tail, r.size - remaining); 744| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 745| 0| } 746| 114k| } 747| 114k| IMMER_CATCH (...) { 748| 0| node_t::delete_leaf(add_tail, branches); 749| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 750| 0| } 751| 114k| } 752| 246k| } else if (tail_offset() == 0) { ------------------ | Branch (752:20): [True: 3.93k, False: 242k] ------------------ 753| 3.93k| auto tail_offst = tail_offset(); 754| 3.93k| auto tail_size = size - tail_offst; 755| 3.93k| auto concated = 756| 3.93k| concat_trees(tail, tail_size, r.root, r.shift, r.tail_offset()); 757| 3.93k| auto new_shift = concated.shift(); 758| 3.93k| auto new_root = concated.node(); 759| 3.93k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 60| 3.93k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 760| 0| assert(new_root->check(new_shift, size + r.tail_offset())); 761| 0| return {size + r.size, new_shift, new_root, r.tail->inc()}; 762| 242k| } else { 763| 242k| auto tail_offst = tail_offset(); 764| 242k| auto tail_size = size - tail_offst; 765| 242k| auto concated = concat_trees(root, 766| 242k| shift, 767| 242k| tail_offst, 768| 242k| tail, 769| 242k| tail_size, 770| 242k| r.root, 771| 242k| r.shift, 772| 242k| r.tail_offset()); 773| 242k| auto new_shift = concated.shift(); 774| 242k| auto new_root = concated.node(); 775| 242k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 60| 242k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 776| 0| assert(new_root->check(new_shift, size + r.tail_offset())); 777| 0| return {size + r.size, new_shift, new_root, r.tail->inc()}; 778| 242k| } 779| 445k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13push_back_mutENS9_5applyIS6_E4type4editEi: 447| 39.7k| { 448| 39.7k| auto ts = tail_size(); 449| 39.7k| if (ts < branches) { ------------------ | Branch (449:13): [True: 31.1k, False: 8.55k] ------------------ 450| 31.1k| ensure_mutable_tail(e, ts); 451| 31.1k| new (&tail->leaf()[ts]) T{std::move(value)}; 452| 31.1k| } else { 453| 8.55k| using std::get; 454| 8.55k| auto new_tail = node_t::make_leaf_e(e, std::move(value)); 455| 8.55k| auto tail_off = tail_offset(); 456| 8.55k| IMMER_TRY { ------------------ | | 41| 8.55k|#define IMMER_TRY try ------------------ 457| 8.55k| push_tail_mut(e, tail_off, tail, ts); 458| 8.55k| tail = new_tail; 459| 8.55k| } 460| 8.55k| IMMER_CATCH (...) { 461| 0| node_t::delete_leaf(new_tail, 1u); 462| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 463| 0| } 464| 8.55k| } 465| 39.7k| ++size; 466| 39.7k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE19ensure_mutable_tailENS9_5applyIS6_E4type4editEj: 438| 596k| { 439| 596k| if (!tail->can_mutate(e)) { ------------------ | Branch (439:13): [True: 9.04k, False: 587k] ------------------ 440| 9.04k| auto new_tail = node_t::copy_leaf_e(e, tail, n); 441| 9.04k| dec_leaf(tail, n); 442| 9.04k| tail = new_tail; 443| 9.04k| } 444| 596k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13push_tail_mutENS9_5applyIS6_E4type4editEmPNS1_4nodeIiSA_Lj3ELj3EEEj: 386| 647k| { 387| 647k| if (auto r = root->relaxed()) { ------------------ | Branch (387:18): [True: 220k, False: 427k] ------------------ 388| 220k| auto new_root = 389| 220k| make_relaxed_pos(root, shift, r) 390| 220k| .visit(push_tail_mut_visitor{}, e, tail, tail_size); 391| 220k| if (new_root) { ------------------ | Branch (391:17): [True: 219k, False: 822] ------------------ 392| 219k| root = new_root; 393| 219k| } else { 394| 822| auto new_root = node_t::make_inner_r_e(e); 395| 822| IMMER_TRY { ------------------ | | 41| 822|#define IMMER_TRY try ------------------ 396| 822| auto new_path = node_t::make_path_e(e, shift, tail); 397| 822| new_root->inner()[0] = root; 398| 822| new_root->inner()[1] = new_path; 399| 822| new_root->relaxed()->d.sizes[0] = tail_off; 400| 822| new_root->relaxed()->d.sizes[1] = tail_off + tail_size; 401| 822| assert(tail_off); 402| 0| assert(tail_size); 403| 0| new_root->relaxed()->d.count = 2u; 404| 822| root = new_root; 405| 822| shift += B; 406| 822| } 407| 822| IMMER_CATCH (...) { 408| 0| node_t::delete_inner_r_e(new_root); 409| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 410| 0| } 411| 822| } 412| 427k| } else if (tail_off == size_t{branches} << shift) { ------------------ | Branch (412:20): [True: 2.53k, False: 425k] ------------------ 413| 2.53k| auto new_root = node_t::make_inner_e(e); 414| 2.53k| IMMER_TRY { ------------------ | | 41| 2.53k|#define IMMER_TRY try ------------------ 415| 2.53k| auto new_path = node_t::make_path_e(e, shift, tail); 416| 2.53k| new_root->inner()[0] = root; 417| 2.53k| new_root->inner()[1] = new_path; 418| 2.53k| root = new_root; 419| 2.53k| shift += B; 420| 2.53k| } 421| 2.53k| IMMER_CATCH (...) { 422| 0| node_t::delete_inner_e(new_root); 423| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 424| 0| } 425| 425k| } else if (tail_off) { ------------------ | Branch (425:20): [True: 422k, False: 2.71k] ------------------ 426| 422k| auto new_root = 427| 422k| make_regular_sub_pos(root, shift, tail_off) 428| 422k| .visit(push_tail_mut_visitor{}, e, tail); 429| 422k| root = new_root; 430| 422k| } else { 431| 2.71k| auto new_root = node_t::make_path_e(e, shift, tail); 432| 2.71k| dec_empty_regular(root); 433| 2.71k| root = new_root; 434| 2.71k| } 435| 647k| } 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_: 542| 24.9k| { 543| 24.9k| auto& elem = get_mut(e, idx); 544| 24.9k| elem = std::forward(fn)(std::move(elem)); 545| 24.9k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7get_mutENS9_5applyIS6_E4type4editEm: 508| 24.9k| { 509| 24.9k| auto tail_off = tail_offset(); 510| 24.9k| if (idx >= tail_off) { ------------------ | Branch (510:13): [True: 7.59k, False: 17.3k] ------------------ 511| 7.59k| ensure_mutable_tail(e, size - tail_off); 512| 7.59k| return tail->leaf()[(idx - tail_off) & mask]; 513| 17.3k| } else { 514| 17.3k| return visit_maybe_relaxed_sub(root, 515| 17.3k| shift, 516| 17.3k| tail_off, 517| 17.3k| get_mut_visitor{}, 518| 17.3k| idx, 519| 17.3k| e, 520| 17.3k| &root); 521| 17.3k| } 522| 24.9k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8take_mutENS9_5applyIS6_E4type4editEm: 575| 33.5k| { 576| 33.5k| auto tail_off = tail_offset(); 577| 33.5k| if (new_size == 0) { ------------------ | Branch (577:13): [True: 855, False: 32.7k] ------------------ 578| 855| *this = {}; 579| 32.7k| } else if (new_size >= size) { ------------------ | Branch (579:20): [True: 485, False: 32.2k] ------------------ 580| 485| return; 581| 32.2k| } else if (new_size > tail_off) { ------------------ | Branch (581:20): [True: 689, False: 31.5k] ------------------ 582| 689| auto ts = size - tail_off; 583| 689| auto newts = new_size - tail_off; 584| 689| if (tail->can_mutate(e)) { ------------------ | Branch (584:17): [True: 425, False: 264] ------------------ 585| 425| detail::destroy_n(tail->leaf() + newts, ts - newts); 586| 425| } else { 587| 264| auto new_tail = node_t::copy_leaf_e(e, tail, newts); 588| 264| dec_leaf(tail, ts); 589| 264| tail = new_tail; 590| 264| } 591| 689| size = new_size; 592| 689| return; 593| 31.5k| } else { 594| 31.5k| using std::get; 595| 31.5k| auto l = new_size - 1; 596| 31.5k| auto v = slice_right_mut_visitor(); 597| 31.5k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l, e); 598| 31.5k| auto new_shift = get<0>(r); 599| 31.5k| auto new_root = get<1>(r); 600| 31.5k| auto new_tail = get<3>(r); 601| 31.5k| if (new_root) { ------------------ | Branch (601:17): [True: 24.9k, False: 6.60k] ------------------ 602| 24.9k| root = new_root; 603| 24.9k| shift = new_shift; 604| 24.9k| } else { 605| 6.60k| root = empty_root(); 606| 6.60k| shift = BL; 607| 6.60k| } 608| 31.5k| dec_leaf(tail, size - tail_off); 609| 31.5k| size = new_size; 610| 31.5k| tail = new_tail; 611| 31.5k| return; 612| 31.5k| } 613| 33.5k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8drop_mutENS9_5applyIS6_E4type4editEm: 644| 58.1k| { 645| 58.1k| using std::get; 646| 58.1k| auto tail_off = tail_offset(); 647| 58.1k| if (elems == 0) { ------------------ | Branch (647:13): [True: 4.56k, False: 53.5k] ------------------ 648| 4.56k| return; 649| 53.5k| } else if (elems >= size) { ------------------ | Branch (649:20): [True: 282, False: 53.3k] ------------------ 650| 282| *this = {}; 651| 53.3k| } else if (elems == tail_off) { ------------------ | Branch (651:20): [True: 218, False: 53.0k] ------------------ 652| 218| dec_inner(root, shift, tail_off); 653| 218| shift = BL; 654| 218| root = empty_root(); 655| 218| size -= elems; 656| 218| return; 657| 53.0k| } else if (elems > tail_off) { ------------------ | Branch (657:20): [True: 932, False: 52.1k] ------------------ 658| 932| auto v = slice_left_mut_visitor(); 659| 932| tail = get<1>(make_leaf_sub_pos(tail, size - tail_off) 660| 932| .visit(v, elems - tail_off, e)); 661| 932| if (tail_off) { ------------------ | Branch (661:17): [True: 228, False: 704] ------------------ 662| 228| dec_inner(root, shift, tail_off); 663| 228| shift = BL; 664| 228| root = empty_root(); 665| 228| } 666| 932| size -= elems; 667| 932| return; 668| 52.1k| } else { 669| 52.1k| auto v = slice_left_mut_visitor(); 670| 52.1k| auto r = 671| 52.1k| visit_maybe_relaxed_sub(root, shift, tail_off, v, elems, e); 672| 52.1k| shift = get<0>(r); 673| 52.1k| root = get<1>(r); 674| 52.1k| size -= elems; 675| 52.1k| return; 676| 52.1k| } 677| 58.1k| } _ZN5immer6detail4rbts12concat_mut_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS9_5applyIS6_E4type4editERKSB_: 785| 266k| { 786| 266k| assert(&l != &r); 787| 0| assert(r.size < (std::numeric_limits::max() - l.size)); 788| 0| using std::get; 789| 266k| if (l.size == 0) ------------------ | Branch (789:13): [True: 556, False: 266k] ------------------ 790| 556| l = r; 791| 266k| else if (r.size == 0) ------------------ | Branch (791:18): [True: 1.33k, False: 264k] ------------------ 792| 1.33k| return; 793| 264k| else if (r.tail_offset() == 0) { ------------------ | Branch (793:18): [True: 126k, False: 138k] ------------------ 794| | // just concat the tail, similar to push_back 795| 126k| auto tail_offst = l.tail_offset(); 796| 126k| auto tail_size = l.size - tail_offst; 797| 126k| if (tail_size == branches) { ------------------ | Branch (797:17): [True: 19.8k, False: 106k] ------------------ 798| 19.8k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 799| 19.8k| l.tail = r.tail->inc(); 800| 19.8k| l.size += r.size; 801| 19.8k| return; 802| 106k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (802:24): [True: 1.19k, False: 105k] ------------------ 803| 1.19k| l.ensure_mutable_tail(el, tail_size); 804| 1.19k| detail::uninitialized_copy(r.tail->leaf(), 805| 1.19k| r.tail->leaf() + r.size, 806| 1.19k| l.tail->leaf() + tail_size); 807| 1.19k| l.size += r.size; 808| 1.19k| return; 809| 105k| } else { 810| 105k| auto remaining = branches - tail_size; 811| 105k| l.ensure_mutable_tail(el, tail_size); 812| 105k| detail::uninitialized_copy(r.tail->leaf(), 813| 105k| r.tail->leaf() + remaining, 814| 105k| l.tail->leaf() + tail_size); 815| 105k| IMMER_TRY { ------------------ | | 41| 105k|#define IMMER_TRY try ------------------ 816| 105k| auto new_tail = 817| 105k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 818| 105k| IMMER_TRY { ------------------ | | 41| 105k|#define IMMER_TRY try ------------------ 819| 105k| l.push_tail_mut(el, tail_offst, l.tail, branches); 820| 105k| l.tail = new_tail; 821| 105k| l.size += r.size; 822| 105k| return; 823| 105k| } 824| 105k| IMMER_CATCH (...) { 825| 0| node_t::delete_leaf(new_tail, r.size - remaining); 826| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 827| 0| } 828| 105k| } 829| 105k| IMMER_CATCH (...) { 830| 0| detail::destroy_n(r.tail->leaf() + tail_size, remaining); 831| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 832| 0| } 833| 105k| } 834| 138k| } else if (l.tail_offset() == 0) { ------------------ | Branch (834:20): [True: 639, False: 137k] ------------------ 835| 639| if (supports_transient_concat) { ------------------ | Branch (835:17): [Folded - Ignored] ------------------ 836| 0| auto tail_offst = l.tail_offset(); 837| 0| auto tail_size = l.size - tail_offst; 838| 0| auto concated = 839| 0| concat_trees_mut(el, 840| 0| el, 841| 0| l.tail, 842| 0| tail_size, 843| 0| MemoryPolicy::transience_t::noone, 844| 0| r.root, 845| 0| r.shift, 846| 0| r.tail_offset()); 847| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 60| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 848| 0| concated.node()->compute_shift()); 849| 0| l.size += r.size; 850| 0| l.shift = concated.shift(); 851| 0| l.root = concated.node(); 852| 0| l.tail = r.tail; 853| 0| assert(l.check_tree()); 854| 639| } else { 855| 639| auto tail_offst = l.tail_offset(); 856| 639| auto tail_size = l.size - tail_offst; 857| 639| auto concated = concat_trees( 858| 639| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 859| 639| l = {l.size + r.size, 860| 639| concated.shift(), 861| 639| concated.node(), 862| 639| r.tail->inc()}; 863| 639| assert(l.check_tree()); 864| 0| return; 865| 639| } 866| 137k| } else { 867| 137k| if (supports_transient_concat) { ------------------ | Branch (867:17): [Folded - Ignored] ------------------ 868| 0| auto tail_offst = l.tail_offset(); 869| 0| auto tail_size = l.size - tail_offst; 870| 0| assert(l.check_tree()); 871| 0| assert(r.check_tree()); 872| 0| auto concated = 873| 0| concat_trees_mut(el, 874| 0| el, 875| 0| l.root, 876| 0| l.shift, 877| 0| tail_offst, 878| 0| l.tail, 879| 0| tail_size, 880| 0| MemoryPolicy::transience_t::noone, 881| 0| r.root, 882| 0| r.shift, 883| 0| r.tail_offset()); 884| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 60| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 885| 0| concated.node()->compute_shift()); 886| 0| l.size += r.size; 887| 0| l.shift = concated.shift(); 888| 0| l.root = concated.node(); 889| 0| l.tail = r.tail; 890| 0| assert(l.check_tree()); 891| 137k| } else { 892| 137k| auto tail_offst = l.tail_offset(); 893| 137k| auto tail_size = l.size - tail_offst; 894| 137k| auto concated = concat_trees(l.root, 895| 137k| l.shift, 896| 137k| tail_offst, 897| 137k| l.tail, 898| 137k| tail_size, 899| 137k| r.root, 900| 137k| r.shift, 901| 137k| r.tail_offset()); 902| 137k| l = {l.size + r.size, 903| 137k| concated.shift(), 904| 137k| concated.node(), 905| 137k| r.tail->inc()}; 906| 137k| } 907| 137k| } 908| 266k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEaSERKSB_: 132| 3.21k| { 133| 3.21k| auto next{other}; 134| 3.21k| swap(*this, next); 135| 3.21k| return *this; 136| 3.21k| } _ZN5immer6detail4rbts12concat_mut_rERKNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERSB_NS9_5applyIS6_E4type4editE: 911| 4.74k| { 912| 4.74k| assert(&l != &r); 913| 0| assert(r.size < (std::numeric_limits::max() - l.size)); 914| 0| using std::get; 915| 4.74k| if (r.size == 0) ------------------ | Branch (915:13): [True: 284, False: 4.46k] ------------------ 916| 284| r = std::move(l); 917| 4.46k| else if (l.size == 0) ------------------ | Branch (917:18): [True: 206, False: 4.25k] ------------------ 918| 206| return; 919| 4.25k| else if (r.tail_offset() == 0) { ------------------ | Branch (919:18): [True: 1.29k, False: 2.96k] ------------------ 920| | // just concat the tail, similar to push_back 921| 1.29k| auto tail_offst = l.tail_offset(); 922| 1.29k| auto tail_size = l.size - tail_offst; 923| 1.29k| if (tail_size == branches) { ------------------ | Branch (923:17): [True: 313, False: 980] ------------------ 924| | // this could be improved by making sure that the 925| | // newly created nodes as part of the `push_tail()` 926| | // are tagged with `er` 927| 313| auto res = 928| 313| l.push_tail(l.root, l.shift, tail_offst, l.tail, tail_size); 929| 313| l.tail->inc(); // note: leak if mutably concatenated 930| | // with itself, but this is forbidden 931| | // by the interface 932| 313| r = {l.size + r.size, get<0>(res), get<1>(res), r.tail->inc()}; 933| 313| return; 934| 980| } else if (tail_size + r.size <= branches) { ------------------ | Branch (934:24): [True: 388, False: 592] ------------------ 935| | // doing this in a exception way mutating way is very 936| | // tricky while potential performance gains are 937| | // minimal (we need to move every element of the right 938| | // tail anyways to make space for the left tail) 939| | // 940| | // we could however improve this by at least moving the 941| | // elements of the right tail... 942| 388| auto new_tail = 943| 388| node_t::copy_leaf(l.tail, tail_size, r.tail, r.size); 944| 388| r = {l.size + r.size, l.shift, l.root->inc(), new_tail}; 945| 388| return; 946| 592| } else { 947| | // like the immutable version 948| 592| auto remaining = branches - tail_size; 949| 592| auto add_tail = node_t::copy_leaf_e( 950| 592| er, l.tail, tail_size, r.tail, remaining); 951| 592| IMMER_TRY { ------------------ | | 41| 592|#define IMMER_TRY try ------------------ 952| 592| auto new_tail = 953| 592| node_t::copy_leaf_e(er, r.tail, remaining, r.size); 954| 592| IMMER_TRY { ------------------ | | 41| 592|#define IMMER_TRY try ------------------ 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| 592| auto new_root = l.push_tail(l.root, 959| 592| l.shift, 960| 592| tail_offst, 961| 592| add_tail, 962| 592| branches); 963| 592| r = {l.size + r.size, 964| 592| get<0>(new_root), 965| 592| get<1>(new_root), 966| 592| new_tail}; 967| 592| return; 968| 592| } 969| 592| IMMER_CATCH (...) { 970| 0| node_t::delete_leaf(new_tail, r.size - remaining); 971| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 972| 0| } 973| 592| } 974| 592| IMMER_CATCH (...) { 975| 0| node_t::delete_leaf(add_tail, branches); 976| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 977| 0| } 978| 592| } 979| 2.96k| } else if (l.tail_offset() == 0) { ------------------ | Branch (979:20): [True: 656, False: 2.30k] ------------------ 980| 656| if (supports_transient_concat) { ------------------ | Branch (980:17): [Folded - Ignored] ------------------ 981| 0| auto tail_offst = l.tail_offset(); 982| 0| auto tail_size = l.size - tail_offst; 983| 0| auto concated = 984| 0| concat_trees_mut(er, 985| 0| MemoryPolicy::transience_t::noone, 986| 0| l.tail, 987| 0| tail_size, 988| 0| er, 989| 0| r.root, 990| 0| r.shift, 991| 0| r.tail_offset()); 992| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 60| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 993| 0| concated.node()->compute_shift()); 994| 0| r.size += l.size; 995| 0| r.shift = concated.shift(); 996| 0| r.root = concated.node(); 997| 0| assert(r.check_tree()); 998| 656| } else { 999| 656| auto tail_offst = l.tail_offset(); 1000| 656| auto tail_size = l.size - tail_offst; 1001| 656| auto concated = concat_trees( 1002| 656| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1003| 656| r = {l.size + r.size, 1004| 656| concated.shift(), 1005| 656| concated.node(), 1006| 656| r.tail->inc()}; 1007| 656| return; 1008| 656| } 1009| 2.30k| } else { 1010| 2.30k| if (supports_transient_concat) { ------------------ | Branch (1010:17): [Folded - Ignored] ------------------ 1011| 0| auto tail_offst = l.tail_offset(); 1012| 0| auto tail_size = l.size - tail_offst; 1013| 0| auto concated = 1014| 0| concat_trees_mut(er, 1015| 0| MemoryPolicy::transience_t::noone, 1016| 0| l.root, 1017| 0| l.shift, 1018| 0| tail_offst, 1019| 0| l.tail, 1020| 0| tail_size, 1021| 0| er, 1022| 0| r.root, 1023| 0| r.shift, 1024| 0| r.tail_offset()); 1025| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 60| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 1026| 0| concated.node()->compute_shift()); 1027| 0| r.size += l.size; 1028| 0| r.shift = concated.shift(); 1029| 0| r.root = concated.node(); 1030| 0| assert(r.check_tree()); 1031| 0| return; 1032| 2.30k| } else { 1033| 2.30k| auto tail_offst = l.tail_offset(); 1034| 2.30k| auto tail_size = l.size - tail_offst; 1035| 2.30k| auto concated = concat_trees(l.root, 1036| 2.30k| l.shift, 1037| 2.30k| tail_offst, 1038| 2.30k| l.tail, 1039| 2.30k| tail_size, 1040| 2.30k| r.root, 1041| 2.30k| r.shift, 1042| 2.30k| r.tail_offset()); 1043| 2.30k| r = {l.size + r.size, 1044| 2.30k| concated.shift(), 1045| 2.30k| concated.node(), 1046| 2.30k| r.tail->inc()}; 1047| 2.30k| return; 1048| 2.30k| } 1049| 2.30k| } 1050| 4.74k| } _ZN5immer6detail4rbts15concat_mut_lr_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS9_5applyIS6_E4type4editESC_SG_: 1053| 1.10M| { 1054| 1.10M| assert(&l != &r); 1055| 0| assert(r.size < (std::numeric_limits::max() - l.size)); 1056| 0| using std::get; 1057| 1.10M| if (l.size == 0) ------------------ | Branch (1057:13): [True: 2.37k, False: 1.10M] ------------------ 1058| 2.37k| l = r; 1059| 1.10M| else if (r.size == 0) ------------------ | Branch (1059:18): [True: 4.52k, False: 1.09M] ------------------ 1060| 4.52k| return; 1061| 1.09M| else if (r.tail_offset() == 0) { ------------------ | Branch (1061:18): [True: 518k, False: 579k] ------------------ 1062| | // just concat the tail, similar to push_back 1063| 518k| auto tail_offst = l.tail_offset(); 1064| 518k| auto tail_size = l.size - tail_offst; 1065| 518k| if (tail_size == branches) { ------------------ | Branch (1065:17): [True: 67.9k, False: 451k] ------------------ 1066| 67.9k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 1067| 67.9k| l.tail = r.tail->inc(); 1068| 67.9k| l.size += r.size; 1069| 67.9k| return; 1070| 451k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (1070:24): [True: 5.29k, False: 445k] ------------------ 1071| 5.29k| l.ensure_mutable_tail(el, tail_size); 1072| 5.29k| if (r.tail->can_mutate(er)) ------------------ | Branch (1072:21): [True: 3.70k, False: 1.58k] ------------------ 1073| 3.70k| detail::uninitialized_move(r.tail->leaf(), 1074| 3.70k| r.tail->leaf() + r.size, 1075| 3.70k| l.tail->leaf() + tail_size); 1076| 1.58k| else 1077| 1.58k| detail::uninitialized_copy(r.tail->leaf(), 1078| 1.58k| r.tail->leaf() + r.size, 1079| 1.58k| l.tail->leaf() + tail_size); 1080| 5.29k| l.size += r.size; 1081| 5.29k| return; 1082| 445k| } else { 1083| 445k| auto remaining = branches - tail_size; 1084| 445k| l.ensure_mutable_tail(el, tail_size); 1085| 445k| if (r.tail->can_mutate(er)) ------------------ | Branch (1085:21): [True: 130k, False: 315k] ------------------ 1086| 130k| detail::uninitialized_move(r.tail->leaf(), 1087| 130k| r.tail->leaf() + remaining, 1088| 130k| l.tail->leaf() + tail_size); 1089| 315k| else 1090| 315k| detail::uninitialized_copy(r.tail->leaf(), 1091| 315k| r.tail->leaf() + remaining, 1092| 315k| l.tail->leaf() + tail_size); 1093| 445k| IMMER_TRY { ------------------ | | 41| 445k|#define IMMER_TRY try ------------------ 1094| 445k| auto new_tail = 1095| 445k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 1096| 445k| IMMER_TRY { ------------------ | | 41| 445k|#define IMMER_TRY try ------------------ 1097| 445k| l.push_tail_mut(el, tail_offst, l.tail, branches); 1098| 445k| l.tail = new_tail; 1099| 445k| l.size += r.size; 1100| 445k| return; 1101| 445k| } 1102| 445k| IMMER_CATCH (...) { 1103| 0| node_t::delete_leaf(new_tail, r.size - remaining); 1104| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1105| 0| } 1106| 445k| } 1107| 445k| IMMER_CATCH (...) { 1108| 0| detail::destroy_n(r.tail->leaf() + tail_size, remaining); 1109| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 1110| 0| } 1111| 445k| } 1112| 579k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1112:20): [True: 4.14k, False: 574k] ------------------ 1113| 4.14k| if (supports_transient_concat) { ------------------ | Branch (1113:17): [Folded - Ignored] ------------------ 1114| 0| auto tail_offst = l.tail_offset(); 1115| 0| auto tail_size = l.size - tail_offst; 1116| 0| auto concated = concat_trees_mut(el, 1117| 0| el, 1118| 0| l.tail, 1119| 0| tail_size, 1120| 0| er, 1121| 0| r.root, 1122| 0| r.shift, 1123| 0| r.tail_offset()); 1124| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 60| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 1125| 0| concated.node()->compute_shift()); 1126| 0| l.size += r.size; 1127| 0| l.shift = concated.shift(); 1128| 0| l.root = concated.node(); 1129| 0| l.tail = r.tail; 1130| 0| assert(l.check_tree()); 1131| 0| r.hard_reset(); 1132| 0| return; 1133| 4.14k| } else { 1134| 4.14k| auto tail_offst = l.tail_offset(); 1135| 4.14k| auto tail_size = l.size - tail_offst; 1136| 4.14k| auto concated = concat_trees( 1137| 4.14k| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1138| 4.14k| l = {l.size + r.size, 1139| 4.14k| concated.shift(), 1140| 4.14k| concated.node(), 1141| 4.14k| r.tail->inc()}; 1142| 4.14k| return; 1143| 4.14k| } 1144| 574k| } else { 1145| 574k| if (supports_transient_concat) { ------------------ | Branch (1145:17): [Folded - Ignored] ------------------ 1146| 0| auto tail_offst = l.tail_offset(); 1147| 0| auto tail_size = l.size - tail_offst; 1148| 0| auto concated = concat_trees_mut(el, 1149| 0| el, 1150| 0| l.root, 1151| 0| l.shift, 1152| 0| tail_offst, 1153| 0| l.tail, 1154| 0| tail_size, 1155| 0| er, 1156| 0| r.root, 1157| 0| r.shift, 1158| 0| r.tail_offset()); 1159| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 60| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ 1160| 0| concated.node()->compute_shift()); 1161| 0| l.size += r.size; 1162| 0| l.shift = concated.shift(); 1163| 0| l.root = concated.node(); 1164| 0| l.tail = r.tail; 1165| 0| assert(l.check_tree()); 1166| 0| r.hard_reset(); 1167| 0| return; 1168| 574k| } else { 1169| 574k| auto tail_offst = l.tail_offset(); 1170| 574k| auto tail_size = l.size - tail_offst; 1171| 574k| auto concated = concat_trees(l.root, 1172| 574k| l.shift, 1173| 574k| tail_offst, 1174| 574k| l.tail, 1175| 574k| tail_size, 1176| 574k| r.root, 1177| 574k| r.shift, 1178| 574k| r.tail_offset()); 1179| 574k| l = {l.size + r.size, 1180| 574k| concated.shift(), 1181| 574k| concated.node(), 1182| 574k| r.tail->inc()}; 1183| 574k| return; 1184| 574k| } 1185| 574k| } 1186| 1.10M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6equalsERKSB_: 284| 37.3k| { 285| 37.3k| using iter_t = rrbtree_iterator; 286| 37.3k| if (size != other.size) ------------------ | Branch (286:13): [True: 12.3k, False: 24.9k] ------------------ 287| 12.3k| return false; 288| 24.9k| if (size == 0) ------------------ | Branch (288:13): [True: 220, False: 24.7k] ------------------ 289| 220| return true; 290| 24.7k| auto tail_off = tail_offset(); 291| 24.7k| auto tail_off_other = other.tail_offset(); 292| | // compare trees 293| 24.7k| if (tail_off > 0 && tail_off_other > 0) { ------------------ | Branch (293:13): [True: 23.4k, False: 1.30k] | Branch (293:29): [True: 23.1k, False: 288] ------------------ 294| | // other.shift != shift is a theoretical possibility for 295| | // relaxed trees that sadly we haven't managed to exercise 296| | // in tests yet... 297| 23.1k| if (other.shift >= shift) { ------------------ | Branch (297:17): [True: 22.4k, False: 716] ------------------ 298| 22.4k| if (!visit_maybe_relaxed_sub(other.root, ------------------ | Branch (298:21): [True: 10.1k, False: 12.2k] ------------------ 299| 22.4k| other.shift, 300| 22.4k| tail_off_other, 301| 22.4k| equals_visitor::rrb{}, 302| 22.4k| iter_t{other}, 303| 22.4k| root, 304| 22.4k| shift, 305| 22.4k| tail_off)) 306| 10.1k| return false; 307| 22.4k| } else { 308| 716| if (!visit_maybe_relaxed_sub(root, ------------------ | Branch (308:21): [True: 310, False: 406] ------------------ 309| 716| shift, 310| 716| tail_off, 311| 716| equals_visitor::rrb{}, 312| 716| iter_t{*this}, 313| 716| other.root, 314| 716| other.shift, 315| 716| tail_off_other)) 316| 310| return false; 317| 716| } 318| 23.1k| } 319| 14.2k| return tail_off == tail_off_other ------------------ | Branch (319:16): [True: 9.05k, False: 5.18k] ------------------ 320| 14.2k| ? make_leaf_sub_pos(tail, tail_size()) 321| 9.05k| .visit(equals_visitor{}, other.tail) 322| 14.2k| : tail_off > tail_off_other ------------------ | Branch (322:18): [True: 2.46k, False: 2.71k] ------------------ 323| 5.18k| ? std::equal(tail->leaf(), 324| 2.46k| tail->leaf() + (size - tail_off), 325| 2.46k| other.tail->leaf() + 326| 2.46k| (tail_off - tail_off_other)) 327| | /* otherwise */ 328| 5.18k| : std::equal(tail->leaf(), 329| 2.71k| tail->leaf() + (size - tail_off), 330| 2.71k| iter_t{other} + tail_off); 331| 24.7k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10region_forEm: 493| 1.50M| { 494| 1.50M| using std::get; 495| 1.50M| auto tail_off = tail_offset(); 496| 1.50M| if (idx >= tail_off) { ------------------ | Branch (496:13): [True: 5.02k, False: 1.49M] ------------------ 497| 5.02k| return std::make_tuple(tail->leaf(), tail_off, size); 498| 1.49M| } else { 499| 1.49M| auto subs = visit_maybe_relaxed_sub( 500| 1.49M| root, shift, tail_off, region_for_visitor(), idx); 501| 1.49M| auto first = idx - get<1>(subs); 502| 1.49M| auto end = first + get<2>(subs); 503| 1.49M| return std::make_tuple(get<0>(subs), first, end); 504| 1.49M| } 505| 1.50M| } _ZNK5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11dereferenceEv: 88| 10.8M| { 89| 10.8M| using std::get; 90| 10.8M| if (i_ < get<1>(curr_) || i_ >= get<2>(curr_)) ------------------ | Branch (90:13): [True: 77.8k, False: 10.7M] | Branch (90:35): [True: 1.42M, False: 9.31M] ------------------ 91| 1.50M| curr_ = v_->region_for(i_); 92| 10.8M| return get<0>(curr_)[i_ - get<1>(curr_)]; 93| 10.8M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7advanceEl: 72| 295k| { 73| 295k| using std::get; 74| 295k| assert(n <= 0 || i_ + static_cast(n) <= v_->size); 75| 0| assert(n >= 0 || static_cast(-n) <= i_); 76| 0| i_ += n; 77| 295k| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9incrementEv: 58| 9.37M| { 59| 9.37M| using std::get; 60| 9.37M| assert(i_ < v_->size); 61| 0| ++i_; 62| 9.37M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2ERKNS1_7rrbtreeIiSA_Lj3ELj3EEE: 42| 25.8k| {} _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| 21.0k| { 32| 21.0k| return Deriv::visit_inner(std::forward(args)...); 33| 21.0k| } _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| 80.0k| { 32| 80.0k| return Deriv::visit_inner(std::forward(args)...); 33| 80.0k| } _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.30k| { 38| 1.30k| return Deriv::visit_inner(std::forward(args)...); 39| 1.30k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EEEE13visit_regularIJRNS1_8full_posISD_EEmEEEDcDpOT_: 37| 6.32k| { 38| 6.32k| return Deriv::visit_inner(std::forward(args)...); 39| 6.32k| } _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.19k| { 38| 8.19k| return Deriv::visit_inner(std::forward(args)...); 39| 8.19k| } _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| 784| { 38| 784| return Deriv::visit_inner(std::forward(args)...); 39| 784| } _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.96k| { 38| 1.96k| return Deriv::visit_inner(std::forward(args)...); 39| 1.96k| } _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| 9.37k| { 38| 9.37k| return Deriv::visit_inner(std::forward(args)...); 39| 9.37k| } _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| 9.37k| { 44| 9.37k| return Deriv::visit_node(std::forward(args)...); 45| 9.37k| } _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| 6.74k| { 32| 6.74k| return Deriv::visit_inner(std::forward(args)...); 33| 6.74k| } _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| 6.74k| { 44| 6.74k| return Deriv::visit_node(std::forward(args)...); 45| 6.74k| } _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| 6.93M| { 50| 6.93M| return Deriv::visit_node(std::forward(args)...); 51| 6.93M| } _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| 93.0M| { 32| 93.0M| return Deriv::visit_inner(std::forward(args)...); 33| 93.0M| } _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| 93.0M| { 44| 93.0M| return Deriv::visit_node(std::forward(args)...); 45| 93.0M| } _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| 93.0M| { 32| 93.0M| return Deriv::visit_inner(std::forward(args)...); 33| 93.0M| } _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| 22.8k| { 32| 22.8k| return Deriv::visit_inner(std::forward(args)...); 33| 22.8k| } _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| 304| { 38| 304| return Deriv::visit_inner(std::forward(args)...); 39| 304| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_8full_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 37| 1.08k| { 38| 1.08k| return Deriv::visit_inner(std::forward(args)...); 39| 1.08k| } _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.79M| { 50| 4.79M| return Deriv::visit_node(std::forward(args)...); 51| 4.79M| } _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| 584k| { 38| 584k| return Deriv::visit_inner(std::forward(args)...); 39| 584k| } _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| 584k| { 44| 584k| return Deriv::visit_node(std::forward(args)...); 45| 584k| } _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| 584k| { 38| 584k| return Deriv::visit_inner(std::forward(args)...); 39| 584k| } _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.12M| { 38| 3.12M| return Deriv::visit_inner(std::forward(args)...); 39| 3.12M| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE11visit_innerIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 43| 3.12M| { 44| 3.12M| return Deriv::visit_node(std::forward(args)...); 45| 3.12M| } _ZN5immer6detail4rbts12visitor_baseINS1_21concat_merger_visitorEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_13concat_mergerISG_EEEEEDcDpOT_: 37| 3.12M| { 38| 3.12M| return Deriv::visit_inner(std::forward(args)...); 39| 3.12M| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 37| 2.62k| { 38| 2.62k| return Deriv::visit_inner(std::forward(args)...); 39| 2.62k| } _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.62k| { 44| 2.62k| return Deriv::visit_node(std::forward(args)...); 45| 2.62k| } _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| 940k| { 32| 940k| return Deriv::visit_inner(std::forward(args)...); 33| 940k| } _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| 940k| { 44| 940k| return Deriv::visit_node(std::forward(args)...); 45| 940k| } _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| 925k| { 32| 925k| return Deriv::visit_inner(std::forward(args)...); 33| 925k| } _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| 925k| { 44| 925k| return Deriv::visit_node(std::forward(args)...); 45| 925k| } _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.65M| { 32| 2.65M| return Deriv::visit_inner(std::forward(args)...); 33| 2.65M| } _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.74k| { 38| 4.74k| return Deriv::visit_inner(std::forward(args)...); 39| 4.74k| } _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| 887k| { 32| 887k| return Deriv::visit_inner(std::forward(args)...); 33| 887k| } _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| 286k| { 38| 286k| return Deriv::visit_inner(std::forward(args)...); 39| 286k| } _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.37k| { 38| 1.37k| return Deriv::visit_inner(std::forward(args)...); 39| 1.37k| } _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| 37.4k| { 38| 37.4k| return Deriv::visit_inner(std::forward(args)...); 39| 37.4k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EERNS1_8full_posISD_EEEEEDcDpOT_: 37| 11.1k| { 38| 11.1k| return Deriv::visit_inner(std::forward(args)...); 39| 11.1k| } _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| 25.6k| { 38| 25.6k| return Deriv::visit_inner(std::forward(args)...); 39| 25.6k| } _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.16M| { 38| 1.16M| return Deriv::visit_inner(std::forward(args)...); 39| 1.16M| } _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.13M| { 32| 6.13M| return Deriv::visit_inner(std::forward(args)...); 33| 6.13M| } _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.42k| { 38| 1.42k| return Deriv::visit_inner(std::forward(args)...); 39| 1.42k| } _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| 32.6k| { 32| 32.6k| return Deriv::visit_inner(std::forward(args)...); 33| 32.6k| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_8full_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 1.98k| { 38| 1.98k| return Deriv::visit_inner(std::forward(args)...); 39| 1.98k| } _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| 209| { 32| 209| return Deriv::visit_inner(std::forward(args)...); 33| 209| } _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| 829| { 32| 829| return Deriv::visit_inner(std::forward(args)...); 33| 829| } _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.10M| { 32| 6.10M| return Deriv::visit_inner(std::forward(args)...); 33| 6.10M| } _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| 15.0k| { 38| 15.0k| return Deriv::visit_inner(std::forward(args)...); 39| 15.0k| } _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| 15.0k| { 44| 15.0k| return Deriv::visit_node(std::forward(args)...); 45| 15.0k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 37| 16.9k| { 38| 16.9k| return Deriv::visit_inner(std::forward(args)...); 39| 16.9k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 43| 16.9k| { 44| 16.9k| return Deriv::visit_node(std::forward(args)...); 45| 16.9k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 31| 6.79k| { 32| 6.79k| return Deriv::visit_inner(std::forward(args)...); 33| 6.79k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 6.79k| { 44| 6.79k| return Deriv::visit_node(std::forward(args)...); 45| 6.79k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 10.1k| { 38| 10.1k| return Deriv::visit_inner(std::forward(args)...); 39| 10.1k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 10.1k| { 44| 10.1k| return Deriv::visit_node(std::forward(args)...); 45| 10.1k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERKPSH_RKjRmEEEDcDpOT_: 31| 13.0k| { 32| 13.0k| return Deriv::visit_inner(std::forward(args)...); 33| 13.0k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE11visit_innerIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERKPSH_RKjRmEEEDcDpOT_: 43| 13.0k| { 44| 13.0k| return Deriv::visit_node(std::forward(args)...); 45| 13.0k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERjSJ_RNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 31| 22.6k| { 32| 22.6k| return Deriv::visit_inner(std::forward(args)...); 33| 22.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| 2.14k| { 32| 2.14k| return Deriv::visit_inner(std::forward(args)...); 33| 2.14k| } _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| 473| { 32| 473| return Deriv::visit_inner(std::forward(args)...); 33| 473| } _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| 838| { 38| 838| return Deriv::visit_inner(std::forward(args)...); 39| 838| } _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| 5.55M| { 32| 5.55M| return Deriv::visit_inner(std::forward(args)...); 33| 5.55M| } _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| 310k| { 38| 310k| return Deriv::visit_inner(std::forward(args)...); 39| 310k| } _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| 343k| { 38| 343k| return Deriv::visit_inner(std::forward(args)...); 39| 343k| } _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| 41.8k| { 38| 41.8k| return Deriv::visit_inner(std::forward(args)...); 39| 41.8k| } _ZN5immer6detail4rbts12visitor_baseINS1_24for_each_chunk_p_visitorEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSF_Lj3ELj3EEEEEDaOT_EUlSN_T0_E_EEEDcDpOT_: 37| 24.1k| { 38| 24.1k| return Deriv::visit_inner(std::forward(args)...); 39| 24.1k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERjSJ_RNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 37| 990| { 38| 990| return Deriv::visit_inner(std::forward(args)...); 39| 990| } _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| 18.5k| { 38| 18.5k| return Deriv::visit_inner(std::forward(args)...); 39| 18.5k| } _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.40k| { 38| 3.40k| return Deriv::visit_inner(std::forward(args)...); 39| 3.40k| } _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| 2.07k| { 38| 2.07k| return Deriv::visit_inner(std::forward(args)...); 39| 2.07k| } _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| 2.11k| { 38| 2.11k| return Deriv::visit_inner(std::forward(args)...); 39| 2.11k| } _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| 170k| { 32| 170k| return Deriv::visit_inner(std::forward(args)...); 33| 170k| } _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| 10.0k| { 38| 10.0k| return Deriv::visit_inner(std::forward(args)...); 39| 10.0k| } _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| 10.0k| { 44| 10.0k| return Deriv::visit_node(std::forward(args)...); 45| 10.0k| } _ZN5immer6detail15auto_const_castINS_22unsafe_refcount_policyEEERT_RKS3_: 45| 388M|{ 46| 388M| return const_cast(x); 47| 388M|} _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_: 236| 27.9M|{} _ZN5immer6detail9destroy_nIPijEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 90| 1.72M|{ 91| 1.72M| return first + n; 92| 1.72M|} _ZN5immer6detail18uninitialized_copyIPiS2_S2_EENSt3__19enable_ifIX18can_trivially_copyIT_T1_EES6_E4typeES5_T0_S6_: 138| 2.37M|{ 139| 2.37M| return std::copy(first, last, out); 140| 2.37M|} _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_: 240| 88.7k|{ 241| 88.7k| return std::forward(f1)(empty_t{}); 242| 88.7k|} _ZN5immer6detail4ipowImEET_S2_j: 225| 48.2M|{ 226| 48.2M| return pow == 0 ? 1 : num * ipow(num, pow - 1); ------------------ | Branch (226:12): [True: 2.29M, False: 45.9M] ------------------ 227| 48.2M|} _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_: 240| 293k|{ 241| 293k| return std::forward(f1)(empty_t{}); 242| 293k|} _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_: 236| 143k|{} _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_: 240| 25.9k|{ 241| 25.9k| return std::forward(f1)(empty_t{}); 242| 25.9k|} _ZN5immer6detail9destroy_nIPimEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 90| 425|{ 91| 425| return first + n; 92| 425|} _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_: 240| 180k|{ 241| 180k| return std::forward(f1)(empty_t{}); 242| 180k|} _ZN5immer6detail18uninitialized_moveIPiS2_EENSt3__19enable_ifIX18can_trivially_copyIT_T0_EES6_E4typeES5_S5_S6_: 112| 134k|{ 113| 134k| return std::copy(first, last, out); 114| 134k|} _ZN5immer6detail8as_constIiEEPKT_PS2_: 29| 1.43M|{ 30| 1.43M| return x; 31| 1.43M|} _ZN5immer6detail4makeINS_15debug_size_heapINS_8cpp_heapEEENS_3boxIiNS_13memory_policyINS_21free_list_heap_policyIS3_Lm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderEJiEEEPT0_DpOT1_: 162| 17.7k|{ 163| 17.7k| auto ptr = Heap::allocate(sizeof(T)); 164| 17.7k| IMMER_TRY { ------------------ | | 41| 17.7k|#define IMMER_TRY try ------------------ 165| 17.7k| return new (ptr) T{std::forward(args)...}; 166| 17.7k| } 167| 17.7k| IMMER_CATCH (...) { 168| 0| Heap::deallocate(sizeof(T), ptr); 169| 0| IMMER_RETHROW; ------------------ | | 44| 0|#define IMMER_RETHROW throw ------------------ 170| 0| } 171| 17.7k|} _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2Ev: 96| 94.1k| flex_vector() = default; _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_backEi: 242| 274k| { 243| 274k| return impl_.push_back(std::move(value)); 244| 274k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2ENS_6detail4rbts7rrbtreeIiS8_Lj3ELj3EEE: 532| 1.14M| { 533| |#if IMMER_DEBUG_PRINT 534| | // force the compiler to generate debug_print, so we can call 535| | // it from a debugger 536| | [](volatile auto) {}(&flex_vector::debug_print); 537| |#endif 538| 1.14M| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4sizeEv: 177| 4.31M| 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_: 319| 363k| { 320| 363k| return impl_.update(index, std::forward(fn)); 321| 363k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4takeEm: 346| 24.0k| { 347| 24.0k| return impl_.take(elems); 348| 24.0k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4dropEm: 372| 34.0k| { 373| 34.0k| return impl_.drop(elems); 374| 34.0k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8max_sizeEv: 90| 1.85M| 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_: 399| 445k| { 400| 445k| return l.impl_.concat(r.impl_); 401| 445k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_backEi: 247| 39.7k| { 248| 39.7k| return push_back_move(move_t{}, std::move(value)); 249| 39.7k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14push_back_moveENSt3__117integral_constantIbLb1EEEi: 541| 39.7k| { 542| 39.7k| impl_.push_back_mut({}, std::move(value)); 543| 39.7k| return std::move(*this); 544| 39.7k| } 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_: 325| 24.9k| { 326| 24.9k| return update_move(move_t{}, index, std::forward(fn)); 327| 24.9k| } 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_: 562| 24.9k| { 563| 24.9k| impl_.update_mut({}, index, std::forward(fn)); 564| 24.9k| return std::move(*this); 565| 24.9k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4takeEm: 351| 33.5k| { 352| 33.5k| return take_move(move_t{}, elems); 353| 33.5k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9take_moveENSt3__117integral_constantIbLb1EEEm: 573| 33.5k| { 574| 33.5k| impl_.take_mut({}, elems); 575| 33.5k| return std::move(*this); 576| 33.5k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4dropEm: 377| 58.1k| { 378| 58.1k| return drop_move(move_t{}, elems); 379| 58.1k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9drop_moveENSt3__117integral_constantIbLb1EEEm: 583| 58.1k| { 584| 58.1k| impl_.drop_mut({}, elems); 585| 58.1k| return std::move(*this); 586| 58.1k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERKS9_: 405| 266k| { 406| 266k| return concat_move(move_t{}, std::move(l), r); 407| 266k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_RKS9_: 594| 266k| { 595| 266k| concat_mut_l(l.impl_, {}, r.impl_); 596| 266k| return std::move(l); 597| 266k| } _ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEOS9_: 411| 4.74k| { 412| 4.74k| return concat_move(move_t{}, l, std::move(r)); 413| 4.74k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEERKS9_OS9_: 600| 4.74k| { 601| 4.74k| concat_mut_r(l.impl_, r.impl_, {}); 602| 4.74k| return std::move(r); 603| 4.74k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEESA_: 417| 1.10M| { 418| 1.10M| return concat_move(move_t{}, std::move(l), std::move(r)); 419| 1.10M| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_SD_: 606| 1.10M| { 607| 1.10M| concat_mut_lr_l(l.impl_, {}, r.impl_, {}); 608| 1.10M| return std::move(l); 609| 1.10M| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEeqERKS9_: 218| 37.3k| { 219| 37.3k| return impl_.equals(other.impl_); 220| 37.3k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5eraseEm: 476| 4.78k| { 477| 4.78k| return take(pos) + drop(pos + 1); 478| 4.78k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6insertEmi: 438| 17.7k| { 439| 17.7k| return take(pos).push_back(std::move(value)) + drop(pos); 440| 17.7k| } _ZN5immer8cpp_heap10deallocateEmPv: 37| 30.6M| { 38| 30.6M| ::operator delete(data); 39| 30.6M| } _ZN5immer8cpp_heap8allocateIJEEEPvmDpT_: 27| 30.6M| { 28| 30.6M| return ::operator new(size); 29| 30.6M| } _ZN5immer15debug_size_heapINS_8cpp_heapEE8allocateIJEEEPvmDpT_: 47| 17.7k| { 48| 17.7k| auto p = (std::size_t*) Base::allocate(size + extra_size, tags...); 49| 17.7k| new (p) std::size_t{size}; 50| 17.7k| return ((char*) p) + extra_size; 51| 17.7k| } _ZN5immer15debug_size_heapINS_8cpp_heapEE10deallocateIJEEEvmPvDpT_: 55| 17.7k| { 56| 17.7k| auto p = (std::size_t*) (((char*) data) - extra_size); 57| 17.7k| assert(*p == size); 58| 0| Base::deallocate(size + extra_size, p, tags...); 59| 17.7k| } _ZN5immer15refcount_policyC2Ev: 28| 17.7k| : refcount{1} {}; _ZN5immer15refcount_policy3decEv: 35| 17.7k| bool dec() { return 1 == refcount.fetch_sub(1, std::memory_order_acq_rel); } _ZN5immer22unsafe_refcount_policyC2Ev: 27| 30.6M| : refcount{1} {}; _ZN5immer22unsafe_refcount_policy3incEv: 32| 176M| void inc() { ++refcount; } _ZN5immer22unsafe_refcount_policy3decEv: 33| 207M| bool dec() { return --refcount == 0; } _ZN5immer22unsafe_refcount_policy6uniqueEv: 34| 4.24M| bool unique() { return refcount == 1; } _ZNK5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5ownee5ownedEv: 36| 30.6M| bool owned() const { return false; } _ZNK5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5ownee10can_mutateENS6_4editE: 35| 450k| bool can_mutate(edit) const { return false; } _ZN5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeaSENS6_4editE: 34| 924k| ownee& operator=(edit) { return *this; };