LLVMFuzzerTestOneInput: 24| 10.6k|{ 25| 10.6k| constexpr auto var_count = 8; 26| 10.6k| constexpr auto bits = 3; 27| | 28| 10.6k| using vector_t = immer::flex_vector; 29| 10.6k| using size_t = std::uint8_t; 30| | 31| 10.6k| auto vars = std::array{}; 32| | 33| 10.6k| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; 34| 10.6k| auto is_valid_var_neq = [](auto other) { 35| 10.6k| return [=](auto idx) { 36| 10.6k| return idx >= 0 && idx < var_count && idx != other; 37| 10.6k| }; 38| 10.6k| }; 39| 10.6k| auto is_valid_index = [](auto& v) { 40| 10.6k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 41| 10.6k| }; 42| 10.6k| auto is_valid_size = [](auto& v) { 43| 10.6k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 44| 10.6k| }; 45| 10.6k| auto can_concat = [](auto&& v1, auto&& v2) { 46| 10.6k| return v1.size() + v2.size() < vector_t::max_size(); 47| 10.6k| }; 48| 10.6k| auto can_compare = [](auto&& v) { 49| | // avoid comparing vectors that are too big, and hence, slow to compare 50| 10.6k| return v.size() < (1 << 15); 51| 10.6k| }; 52| 10.6k| return fuzzer_input{data, size}.run([&](auto& in) { 53| 10.6k| enum ops 54| 10.6k| { 55| 10.6k| op_push_back, 56| 10.6k| op_update, 57| 10.6k| op_take, 58| 10.6k| op_drop, 59| 10.6k| op_concat, 60| 10.6k| op_push_back_move, 61| 10.6k| op_update_move, 62| 10.6k| op_take_move, 63| 10.6k| op_drop_move, 64| 10.6k| op_concat_move_l, 65| 10.6k| op_concat_move_r, 66| 10.6k| op_concat_move_lr, 67| 10.6k| op_insert, 68| 10.6k| op_erase, 69| 10.6k| op_compare, 70| 10.6k| }; 71| 10.6k| auto src = read(in, is_valid_var); 72| 10.6k| auto dst = read(in, is_valid_var); 73| 10.6k| switch (read(in)) { 74| 10.6k| case op_push_back: { 75| 10.6k| vars[dst] = vars[src].push_back(42); 76| 10.6k| break; 77| 10.6k| } 78| 10.6k| case op_update: { 79| 10.6k| auto idx = read(in, is_valid_index(vars[src])); 80| 10.6k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 81| 10.6k| break; 82| 10.6k| } 83| 10.6k| case op_take: { 84| 10.6k| auto idx = read(in, is_valid_size(vars[src])); 85| 10.6k| vars[dst] = vars[src].take(idx); 86| 10.6k| break; 87| 10.6k| } 88| 10.6k| case op_drop: { 89| 10.6k| auto idx = read(in, is_valid_size(vars[src])); 90| 10.6k| vars[dst] = vars[src].drop(idx); 91| 10.6k| break; 92| 10.6k| } 93| 10.6k| case op_concat: { 94| 10.6k| auto src2 = read(in, is_valid_var); 95| 10.6k| if (can_concat(vars[src], vars[src2])) 96| 10.6k| vars[dst] = vars[src] + vars[src2]; 97| 10.6k| break; 98| 10.6k| } 99| 10.6k| case op_push_back_move: { 100| 10.6k| vars[dst] = std::move(vars[src]).push_back(21); 101| 10.6k| break; 102| 10.6k| } 103| 10.6k| case op_update_move: { 104| 10.6k| auto idx = read(in, is_valid_index(vars[src])); 105| 10.6k| vars[dst] = 106| 10.6k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 107| 10.6k| break; 108| 10.6k| } 109| 10.6k| case op_take_move: { 110| 10.6k| auto idx = read(in, is_valid_size(vars[src])); 111| 10.6k| vars[dst] = std::move(vars[src]).take(idx); 112| 10.6k| break; 113| 10.6k| } 114| 10.6k| case op_drop_move: { 115| 10.6k| auto idx = read(in, is_valid_size(vars[src])); 116| 10.6k| vars[dst] = std::move(vars[src]).drop(idx); 117| 10.6k| break; 118| 10.6k| } 119| 10.6k| case op_concat_move_l: { 120| 10.6k| auto src2 = read(in, is_valid_var_neq(src)); 121| 10.6k| if (can_concat(vars[src], vars[src2])) 122| 10.6k| vars[dst] = std::move(vars[src]) + vars[src2]; 123| 10.6k| break; 124| 10.6k| } 125| 10.6k| case op_concat_move_r: { 126| 10.6k| auto src2 = read(in, is_valid_var_neq(src)); 127| 10.6k| if (can_concat(vars[src], vars[src2])) 128| 10.6k| vars[dst] = vars[src] + std::move(vars[src2]); 129| 10.6k| break; 130| 10.6k| } 131| 10.6k| case op_concat_move_lr: { 132| 10.6k| auto src2 = read(in, is_valid_var_neq(src)); 133| 10.6k| if (can_concat(vars[src], vars[src2])) 134| 10.6k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 135| 10.6k| break; 136| 10.6k| } 137| 10.6k| case op_compare: { 138| 10.6k| using std::swap; 139| 10.6k| if (can_compare(vars[src]) && vars[src] == vars[dst]) 140| 10.6k| swap(vars[src], vars[dst]); 141| 10.6k| break; 142| 10.6k| } 143| 10.6k| case op_erase: { 144| 10.6k| auto idx = read(in, is_valid_index(vars[src])); 145| 10.6k| vars[dst] = vars[src].erase(idx); 146| 10.6k| break; 147| 10.6k| } 148| 10.6k| case op_insert: { 149| 10.6k| auto idx = read(in, is_valid_size(vars[src])); 150| 10.6k| vars[dst] = vars[src].insert(idx, immer::box{42}); 151| 10.6k| break; 152| 10.6k| } 153| 10.6k| default: 154| 10.6k| break; 155| 10.6k| }; 156| 10.6k| return true; 157| 10.6k| }); 158| 10.6k|} flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_: 52| 2.59M| return fuzzer_input{data, size}.run([&](auto& in) { 53| 2.59M| enum ops 54| 2.59M| { 55| 2.59M| op_push_back, 56| 2.59M| op_update, 57| 2.59M| op_take, 58| 2.59M| op_drop, 59| 2.59M| op_concat, 60| 2.59M| op_push_back_move, 61| 2.59M| op_update_move, 62| 2.59M| op_take_move, 63| 2.59M| op_drop_move, 64| 2.59M| op_concat_move_l, 65| 2.59M| op_concat_move_r, 66| 2.59M| op_concat_move_lr, 67| 2.59M| op_insert, 68| 2.59M| op_erase, 69| 2.59M| op_compare, 70| 2.59M| }; 71| 2.59M| auto src = read(in, is_valid_var); 72| 2.59M| auto dst = read(in, is_valid_var); 73| 2.59M| switch (read(in)) { 74| 324k| case op_push_back: { ------------------ | Branch (74:9): [True: 324k, False: 2.27M] ------------------ 75| 324k| vars[dst] = vars[src].push_back(42); 76| 324k| break; 77| 0| } 78| 169k| case op_update: { ------------------ | Branch (78:9): [True: 169k, False: 2.42M] ------------------ 79| 169k| auto idx = read(in, is_valid_index(vars[src])); 80| 169k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 81| 169k| break; 82| 0| } 83| 1.81k| case op_take: { ------------------ | Branch (83:9): [True: 1.81k, False: 2.59M] ------------------ 84| 1.81k| auto idx = read(in, is_valid_size(vars[src])); 85| 1.81k| vars[dst] = vars[src].take(idx); 86| 1.81k| break; 87| 0| } 88| 13.1k| case op_drop: { ------------------ | Branch (88:9): [True: 13.1k, False: 2.58M] ------------------ 89| 13.1k| auto idx = read(in, is_valid_size(vars[src])); 90| 13.1k| vars[dst] = vars[src].drop(idx); 91| 13.1k| break; 92| 0| } 93| 674k| case op_concat: { ------------------ | Branch (93:9): [True: 674k, False: 1.92M] ------------------ 94| 674k| auto src2 = read(in, is_valid_var); 95| 674k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (95:17): [True: 643k, False: 31.5k] ------------------ 96| 643k| vars[dst] = vars[src] + vars[src2]; 97| 674k| break; 98| 0| } 99| 24.2k| case op_push_back_move: { ------------------ | Branch (99:9): [True: 24.2k, False: 2.57M] ------------------ 100| 24.2k| vars[dst] = std::move(vars[src]).push_back(21); 101| 24.2k| break; 102| 0| } 103| 30.8k| case op_update_move: { ------------------ | Branch (103:9): [True: 30.8k, False: 2.56M] ------------------ 104| 30.8k| auto idx = read(in, is_valid_index(vars[src])); 105| 30.8k| vars[dst] = 106| 30.8k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 107| 30.8k| break; 108| 0| } 109| 31.6k| case op_take_move: { ------------------ | Branch (109:9): [True: 31.6k, False: 2.56M] ------------------ 110| 31.6k| auto idx = read(in, is_valid_size(vars[src])); 111| 31.6k| vars[dst] = std::move(vars[src]).take(idx); 112| 31.6k| break; 113| 0| } 114| 57.1k| case op_drop_move: { ------------------ | Branch (114:9): [True: 57.1k, False: 2.54M] ------------------ 115| 57.1k| auto idx = read(in, is_valid_size(vars[src])); 116| 57.1k| vars[dst] = std::move(vars[src]).drop(idx); 117| 57.1k| break; 118| 0| } 119| 213k| case op_concat_move_l: { ------------------ | Branch (119:9): [True: 213k, False: 2.38M] ------------------ 120| 213k| auto src2 = read(in, is_valid_var_neq(src)); 121| 213k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (121:17): [True: 209k, False: 3.57k] ------------------ 122| 209k| vars[dst] = std::move(vars[src]) + vars[src2]; 123| 213k| break; 124| 0| } 125| 4.44k| case op_concat_move_r: { ------------------ | Branch (125:9): [True: 4.44k, False: 2.59M] ------------------ 126| 4.44k| auto src2 = read(in, is_valid_var_neq(src)); 127| 4.44k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (127:17): [True: 3.98k, False: 467] ------------------ 128| 3.98k| vars[dst] = vars[src] + std::move(vars[src2]); 129| 4.44k| break; 130| 0| } 131| 907k| case op_concat_move_lr: { ------------------ | Branch (131:9): [True: 907k, False: 1.69M] ------------------ 132| 907k| auto src2 = read(in, is_valid_var_neq(src)); 133| 907k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (133:17): [True: 897k, False: 9.63k] ------------------ 134| 897k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 135| 907k| break; 136| 0| } 137| 91.3k| case op_compare: { ------------------ | Branch (137:9): [True: 91.3k, False: 2.50M] ------------------ 138| 91.3k| using std::swap; 139| 91.3k| if (can_compare(vars[src]) && vars[src] == vars[dst]) ------------------ | Branch (139:17): [True: 80.8k, False: 10.5k] | Branch (139:43): [True: 5.66k, False: 75.1k] ------------------ 140| 5.66k| swap(vars[src], vars[dst]); 141| 91.3k| break; 142| 0| } 143| 7.17k| case op_erase: { ------------------ | Branch (143:9): [True: 7.17k, False: 2.59M] ------------------ 144| 7.17k| auto idx = read(in, is_valid_index(vars[src])); 145| 7.17k| vars[dst] = vars[src].erase(idx); 146| 7.17k| break; 147| 0| } 148| 15.7k| case op_insert: { ------------------ | Branch (148:9): [True: 15.7k, False: 2.58M] ------------------ 149| 15.7k| auto idx = read(in, is_valid_size(vars[src])); 150| 15.7k| vars[dst] = vars[src].insert(idx, immer::box{42}); 151| 15.7k| break; 152| 0| } 153| 19.6k| default: ------------------ | Branch (153:9): [True: 19.6k, False: 2.57M] ------------------ 154| 19.6k| break; 155| 2.59M| }; 156| 2.58M| return true; 157| 2.59M| }); flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_0clIcEEDaT_: 33| 6.21M| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; ------------------ | Branch (33:48): [True: 6.04M, False: 168k] | Branch (33:60): [True: 5.85M, False: 196k] ------------------ 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| 242k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; ------------------ | Branch (40:39): [True: 242k, False: 0] | Branch (40:51): [True: 207k, False: 35.2k] ------------------ flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaRT_: 39| 207k| auto is_valid_index = [](auto& v) { 40| 207k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 41| 207k| }; flex-vector-bo.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E_clIiEEDaS2_: 80| 169k| 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| 130k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; ------------------ | Branch (43:39): [True: 130k, False: 0] | Branch (43:51): [True: 119k, False: 10.9k] ------------------ flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaRT_: 42| 119k| auto is_valid_size = [](auto& v) { 43| 119k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 44| 119k| }; 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.79M| auto can_concat = [](auto&& v1, auto&& v2) { 46| 1.79M| return v1.size() + v2.size() < vector_t::max_size(); 47| 1.79M| }; flex-vector-bo.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E0_clIiEEDaS2_: 106| 30.8k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); flex-vector-bo.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_ENKUlS1_E_clIcEEDaS1_: 35| 1.18M| return [=](auto idx) { 36| 1.18M| return idx >= 0 && idx < var_count && idx != other; ------------------ | Branch (36:20): [True: 1.17M, False: 10.5k] | Branch (36:32): [True: 1.15M, False: 18.9k] | Branch (36:51): [True: 1.12M, False: 27.1k] ------------------ 37| 1.18M| }; flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_: 34| 1.12M| auto is_valid_var_neq = [](auto other) { 35| 1.12M| return [=](auto idx) { 36| 1.12M| return idx >= 0 && idx < var_count && idx != other; 37| 1.12M| }; 38| 1.12M| }; flex-vector-bo.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_5clIRN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_8cpp_heapEEENS1_22unsafe_refcount_policyENS1_14no_lock_policyENS1_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaOT_: 48| 91.3k| auto can_compare = [](auto&& v) { 49| | // avoid comparing vectors that are too big, and hence, slow to compare 50| 91.3k| return v.size() < (1 << 15); 51| 91.3k| }; flex-vector-bo.cpp:_ZN12fuzzer_input3runIZ22LLVMFuzzerTestOneInputE3$_6EEiT_: 50| 10.6k| { 51| 10.6k| if (size_ > fuzzer_input_max_size) ------------------ | Branch (51:13): [True: 6, False: 10.6k] ------------------ 52| 6| return 0; 53| 10.6k| try { 54| 2.59M| while (step(*this)) ------------------ | Branch (54:20): [True: 2.58M, False: 10.6k] ------------------ 55| 2.58M| continue; 56| 10.6k| } catch (const no_more_input&) { 57| 10.6k| }; 58| 10.6k| return 0; 59| 10.6k| } flex-vector-bo.cpp:_Z4readIcZ22LLVMFuzzerTestOneInputE3$_0ET_R12fuzzer_inputT0_: 70| 5.86M|{ 71| 5.86M| auto x = read(fz); 72| 6.22M| while (!cond(x)) ------------------ | Branch (72:12): [True: 365k, False: 5.86M] ------------------ 73| 365k| x = read(fz); 74| 5.86M| return x; 75| 5.86M|} _Z4readIcERKT_R12fuzzer_input: 64| 9.99M|{ 65| 9.99M| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 9.99M|} _ZN12fuzzer_input4nextEmm: 40| 10.3M| { 41| 10.3M| auto& p = const_cast(reinterpret_cast(data_)); 42| 10.3M| auto r = std::align(align, size, p, size_); 43| 10.3M| if (r == nullptr) ------------------ | Branch (43:13): [True: 10.6k, False: 10.3M] ------------------ 44| 10.6k| throw no_more_input{}; 45| 10.3M| return next(size); 46| 10.3M| } _ZN12fuzzer_input4nextEm: 30| 10.3M| { 31| 10.3M| if (size_ < size) ------------------ | Branch (31:13): [True: 0, False: 10.3M] ------------------ 32| 0| throw no_more_input{}; 33| 10.3M| auto r = data_; 34| 10.3M| data_ += size; 35| 10.3M| size_ -= size; 36| 10.3M| return r; 37| 10.3M| } flex-vector-bo.cpp:_Z4readIhZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS2_13memory_policyINS2_11heap_policyINS2_8cpp_heapEEENS2_22unsafe_refcount_policyENS2_14no_lock_policyENS2_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaRT_EUlSD_E_ESD_R12fuzzer_inputT0_: 70| 207k|{ 71| 207k| auto x = read(fz); 72| 242k| while (!cond(x)) ------------------ | Branch (72:12): [True: 35.2k, False: 207k] ------------------ 73| 35.2k| x = read(fz); 74| 207k| return x; 75| 207k|} _Z4readIhERKT_R12fuzzer_input: 64| 373k|{ 65| 373k| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 373k|} flex-vector-bo.cpp:_Z4readIhZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS2_13memory_policyINS2_11heap_policyINS2_8cpp_heapEEENS2_22unsafe_refcount_policyENS2_14no_lock_policyENS2_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaRT_EUlSD_E_ESD_R12fuzzer_inputT0_: 70| 119k|{ 71| 119k| auto x = read(fz); 72| 130k| while (!cond(x)) ------------------ | Branch (72:12): [True: 10.9k, False: 119k] ------------------ 73| 10.9k| x = read(fz); 74| 119k| return x; 75| 119k|} flex-vector-bo.cpp:_Z4readIcZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_EUlS2_E_ES2_R12fuzzer_inputT0_: 70| 1.12M|{ 71| 1.12M| auto x = read(fz); 72| 1.18M| while (!cond(x)) ------------------ | Branch (72:12): [True: 56.6k, False: 1.12M] ------------------ 73| 56.6k| x = read(fz); 74| 1.12M| return x; 75| 1.12M|} _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2IiviEEOT_: 85| 15.7k| : impl_{detail::make(std::forward(arg))} 86| 15.7k| { 87| 15.7k| } _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderC2IJiEEEDpOT_: 47| 15.7k| : value(std::forward(args)...) 48| 15.7k| { 49| 15.7k| } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEcvRKiEv: 142| 15.7k| operator const T&() const { return get(); } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE3getEv: 139| 15.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: 131| 15.7k| { 132| 15.7k| if (impl_ && impl_->dec()) { ------------------ | Branch (132:13): [True: 15.7k, False: 0] | Branch (132:22): [True: 15.7k, False: 0] ------------------ 133| 15.7k| impl_->~holder(); 134| 15.7k| heap::deallocate(sizeof(holder), impl_); 135| 15.7k| } 136| 15.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| 466M| { 171| 466M| return x.get_(type_t{}); 172| 466M| } _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| 466M| { 185| 466M| return n.get_(t); 186| 466M| } _ZNK5immer6detail3csl6memberINS_22unsafe_refcount_policyENS1_7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4typeEE4type4get_ENS1_6type_tIS3_EE: 128| 466M| const T& get_(type_t) const { return d; } _ZN5immer6detail3csl3getINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEEEDcRNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyIS7_NS_22unsafe_refcount_policyENS_14no_lock_policyES3_Lb1ELb1EEELj3ELj3EE11impl_data_tENS1_6memberISF_NS1_7inheritISA_vE4typeEE4typeEE4typeE: 165| 37.4M| { 166| 37.4M| return x.get_(type_t{}); 167| 37.4M| } _ZN5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11impl_data_tENS1_6memberIS9_NS1_7inheritINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_ISK_EEDcNS1_6type_tIT_EE: 179| 37.4M| { 180| 37.4M| return n.get_(t); 181| 37.4M| } _ZN5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 102| 37.4M| 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| 267k| { 171| 267k| return x.get_(type_t{}); 172| 267k| } _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| 267k| { 185| 267k| return n.get_(t); 186| 267k| } _ZNK5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 103| 267k| const T& get_(type_t) const { return *this; } _ZNK5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_EdeEv: 99| 8.79M| 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| 8.79M| { 23| 8.79M| return x.dereference(); 24| 8.79M| } _ZNK5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_E7derivedEv: 86| 8.88M| { 87| 8.88M| static_assert(std::is_base_of::value, 88| 8.88M| "must pass a derived thing"); 89| 8.88M| return *static_cast(this); 90| 8.88M| } _ZN5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_EpLEl: 151| 190k| { 152| 190k| access_t::advance(derived(), n); 153| 190k| return derived(); 154| 190k| } _ZN5immer6detail20iterator_core_access7advanceIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEElEEDcOT_T0_: 46| 190k| { 47| 190k| return x.advance(d); 48| 190k| } _ZN5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_E7derivedEv: 92| 15.7M| { 93| 15.7M| static_assert(std::is_base_of::value, 94| 15.7M| "must pass a derived thing"); 95| 15.7M| return *static_cast(this); 96| 15.7M| } _ZN5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_EppEv: 119| 7.67M| { 120| 7.67M| access_t::increment(derived()); 121| 7.67M| return derived(); 122| 7.67M| } _ZN5immer6detail20iterator_core_access9incrementIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDcOT_: 28| 7.67M| { 29| 7.67M| return x.increment(); 30| 7.67M| } _ZNK5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENSt3__126random_access_iterator_tagEiRKilPSF_EplISI_TnNSD_9enable_ifIXsrT_16is_random_accessEbE4typeELb1EEESC_l: 164| 93.0k| { 165| 93.0k| auto tmp = derived(); 166| 93.0k| return tmp += n; 167| 93.0k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE17make_inner_n_intoEPvmj: 213| 1.36M| { 214| 1.36M| assert(n <= branches); ------------------ | Branch (214:9): [True: 1.36M, False: 0] ------------------ 215| 1.36M| assert(size >= sizeof_inner_n(n)); ------------------ | Branch (215:9): [True: 1.36M, False: 0] ------------------ 216| 1.36M| auto p = new (buffer) node_t; 217| 1.36M| p->impl.d.data.inner.relaxed = nullptr; 218| 1.36M|#if IMMER_TAGGED_NODE 219| 1.36M| p->impl.d.kind = node_t::kind_t::inner; 220| 1.36M|#endif 221| 1.36M| return p; 222| 1.36M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14sizeof_inner_nEj: 145| 39.2M| { 146| 39.2M| return keep_headroom ? max_sizeof_inner : sizeof_packed_inner_n(n); ------------------ | Branch (146:16): [True: 39.2M, Folded] ------------------ 147| 39.2M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3incEv: 956| 122M| { 957| 122M| refs(this).inc(); 958| 122M| return this; 959| 122M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4refsEPKSB_: 203| 466M| { 204| 466M| return auto_const_cast(get(x->impl)); 205| 466M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE16make_leaf_n_intoEPvmj: 330| 1.19M| { 331| 1.19M| assert(n <= branches); ------------------ | Branch (331:9): [True: 1.19M, False: 0] ------------------ 332| 1.19M| assert(size >= sizeof_leaf_n(n)); ------------------ | Branch (332:9): [True: 1.19M, False: 0] ------------------ 333| 1.19M| auto p = new (buffer) node_t; 334| 1.19M|#if IMMER_TAGGED_NODE 335| 1.19M| p->impl.d.kind = node_t::kind_t::leaf; 336| 1.19M|#endif 337| 1.19M| return p; 338| 1.19M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13sizeof_leaf_nEj: 160| 5.18M| { 161| 5.18M| return keep_headroom ? max_sizeof_leaf : sizeof_packed_leaf_n(n); ------------------ | Branch (161:16): [True: 5.18M, Folded] ------------------ 162| 5.18M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7relaxedEv: 172| 667M| { 173| 667M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 667M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (173:9): [True: 667M, False: 0] ------------------ 174| 667M| return impl.d.data.inner.relaxed; 175| 667M| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4kindEv: 168| 1.01G| kind_t kind() const { return impl.d.kind; } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3decEv: 967| 250M| bool dec() const { return refs(this).dec(); } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5innerEv: 184| 290M| { 185| 290M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 290M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (185:9): [True: 290M, False: 0] ------------------ 186| 290M| return impl.d.data.inner.get_storage_ptr(); 187| 290M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14delete_inner_rEPSB_j: 832| 33.8M| { 833| 33.8M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 33.8M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (833:9): [True: 33.8M, False: 0] ------------------ 834| 33.8M| auto r = p->relaxed(); 835| 33.8M| assert(r); ------------------ | Branch (835:9): [True: 33.8M, False: 0] ------------------ 836| 33.8M| static_if([&](auto) { 837| 33.8M| if (node_t::refs(r).dec()) 838| 33.8M| heap::deallocate(node_t::ownee(r).owned() 839| 33.8M| ? node_t::max_sizeof_relaxed 840| 33.8M| : node_t::sizeof_relaxed_n(n), 841| 33.8M| r); 842| 33.8M| }); 843| 33.8M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner_r ------------------ | Branch (843:26): [True: 0, False: 33.8M] ------------------ 844| 33.8M| : node_t::sizeof_inner_r_n(n), 845| 33.8M| p); 846| 33.8M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5owneeEPSB_: 210| 37.4M| static ownee_t& ownee(node_t* x) { return get(x->impl); } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE16sizeof_inner_r_nEj: 150| 67.4M| { 151| 67.4M| return keep_headroom ? max_sizeof_inner_r : sizeof_packed_inner_r_n(n); ------------------ | Branch (151:16): [True: 67.4M, Folded] ------------------ 152| 67.4M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11delete_leafEPSB_j: 861| 1.59M| { 862| 1.59M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::leaf); ------------------ | | 68| 1.59M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (862:9): [True: 1.59M, False: 0] ------------------ 863| 1.59M| detail::destroy_n(p->leaf(), n); 864| 1.59M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_leaf ------------------ | Branch (864:26): [True: 0, False: 1.59M] ------------------ 865| 1.59M| : node_t::sizeof_leaf_n(n), 866| 1.59M| p); 867| 1.59M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4leafEv: 190| 11.1M| { 191| 11.1M| IMMER_ASSERT_TAGGED(kind() == kind_t::leaf); ------------------ | | 68| 11.1M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (191:9): [True: 11.1M, False: 0] ------------------ 192| 11.1M| return impl.d.data.leaf.get_storage_ptr(); 193| 11.1M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12delete_innerEPSB_j: 808| 1.45M| { 809| 1.45M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 1.45M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (809:9): [True: 1.45M, False: 0] ------------------ 810| 1.45M| assert(!p->relaxed()); ------------------ | Branch (810:9): [True: 1.45M, False: 0] ------------------ 811| 1.45M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner ------------------ | Branch (811:26): [True: 0, False: 1.45M] ------------------ 812| 1.45M| : node_t::sizeof_inner_n(n), 813| 1.45M| p); 814| 1.45M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE17copy_leaf_emplaceIiEEPSB_SD_jOT_: 794| 274k| { 795| 274k| auto dst = copy_leaf_n(n + 1, src, n); 796| 274k| IMMER_TRY { ------------------ | | 49| 274k|#define IMMER_TRY try ------------------ 797| 274k| new (dst->leaf() + n) T(std::forward(x)); 798| 274k| } 799| 274k| IMMER_CATCH (...) { 800| 0| detail::destroy_n(dst->leaf(), n); 801| 0| heap::deallocate(node_t::sizeof_leaf_n(n + 1), dst); 802| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 803| 0| } 804| 274k| return dst; 805| 274k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11copy_leaf_nEjPSB_j: 696| 274k| { 697| 274k| assert(allocn >= n); ------------------ | Branch (697:9): [True: 274k, False: 0] ------------------ 698| 274k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 274k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (698:9): [True: 274k, False: 0] ------------------ 699| 274k| auto dst = make_leaf_n(allocn); 700| 274k| IMMER_TRY { ------------------ | | 49| 274k|#define IMMER_TRY try ------------------ 701| 274k| detail::uninitialized_copy( 702| 274k| src->leaf(), src->leaf() + n, dst->leaf()); 703| 274k| } 704| 274k| IMMER_CATCH (...) { 705| 0| heap::deallocate(node_t::sizeof_leaf_n(allocn), dst); 706| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 707| 0| } 708| 274k| return dst; 709| 274k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_nEj: 341| 1.19M| { 342| 1.19M| assert(n <= branches); ------------------ | Branch (342:9): [True: 1.19M, False: 0] ------------------ 343| 1.19M| auto m = heap::allocate(sizeof_leaf_n(n)); 344| 1.19M| return make_leaf_n_into(m, sizeof_leaf_n(n), n); 345| 1.19M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_nIiEEPSB_jOT_: 470| 50.2k| { 471| 50.2k| assert(n >= 1); ------------------ | Branch (471:9): [True: 50.2k, False: 0] ------------------ 472| 50.2k| auto p = make_leaf_n(n); 473| 50.2k| IMMER_TRY { ------------------ | | 49| 50.2k|#define IMMER_TRY try ------------------ 474| 50.2k| new (p->leaf()) T(std::forward(x)); 475| 50.2k| } 476| 50.2k| IMMER_CATCH (...) { 477| 0| heap::deallocate(node_t::sizeof_leaf_n(n), p); 478| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 479| 0| } 480| 50.2k| return p; 481| 50.2k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13do_copy_innerEPSB_SC_j: 558| 1.24M| { 559| 1.24M| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 1.24M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (559:9): [True: 1.24M, False: 0] ------------------ 560| 1.24M| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 1.24M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (560:9): [True: 1.24M, False: 0] ------------------ 561| 1.24M| auto p = src->inner(); 562| 1.24M| inc_nodes(p, n); 563| 1.24M| std::copy(p, p + n, dst->inner()); 564| 1.24M| return dst; 565| 1.24M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9inc_nodesEPPSB_j: 970| 25.4M| { 971| 117M| for (auto i = p, e = i + n; i != e; ++i) ------------------ | Branch (971:37): [True: 91.5M, False: 25.4M] ------------------ 972| 91.5M| refs(*i).inc(); 973| 25.4M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14copy_inner_r_nEjPSB_j: 588| 214k| { 589| 214k| assert(allocn >= n); ------------------ | Branch (589:9): [True: 214k, False: 0] ------------------ 590| 214k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 214k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (590:9): [True: 214k, False: 0] ------------------ 591| 214k| auto dst = make_inner_r_n(allocn); 592| 214k| return do_copy_inner_r(dst, src, n); 593| 214k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15do_copy_inner_rEPSB_SC_j: 610| 260k| { 611| 260k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 260k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (611:9): [True: 260k, False: 0] ------------------ 612| 260k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 260k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (612:9): [True: 260k, False: 0] ------------------ 613| 260k| auto src_r = src->relaxed(); 614| 260k| auto dst_r = dst->relaxed(); 615| 260k| inc_nodes(src->inner(), n); 616| 260k| std::copy(src->inner(), src->inner() + n, dst->inner()); 617| 260k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 618| 260k| dst_r->d.count = n; 619| 260k| return dst; 620| 260k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14make_inner_r_nEj: 243| 33.6M| { 244| 33.6M| assert(n <= branches); ------------------ | Branch (244:9): [True: 33.6M, False: 0] ------------------ 245| 33.6M| auto mp = heap::allocate(sizeof_inner_r_n(n)); 246| 33.6M| auto mr = static_cast(nullptr); 247| 33.6M| if (embed_relaxed) { ------------------ | Branch (247:13): [True: 33.6M, Folded] ------------------ 248| 33.6M| mr = reinterpret_cast(mp) + sizeof_inner_n(n); 249| 33.6M| } else { 250| 0| IMMER_TRY { ------------------ | | 49| 0|#define IMMER_TRY try ------------------ 251| 0| mr = heap::allocate(sizeof_relaxed_n(n), norefs_tag{}); 252| 0| } 253| 0| IMMER_CATCH (...) { 254| 0| heap::deallocate(sizeof_inner_r_n(n), mp); 255| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 256| 0| } 257| 0| } 258| 33.6M| auto p = new (mp) node_t; 259| 33.6M| auto r = new (mr) relaxed_t; 260| 33.6M| r->d.count = 0; 261| 33.6M| p->impl.d.data.inner.relaxed = r; 262| 33.6M|#if IMMER_TAGGED_NODE 263| 33.6M| p->impl.d.kind = node_t::kind_t::inner; 264| 33.6M|#endif 265| 33.6M| return p; 266| 33.6M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9make_pathEjPSB_: 498| 437k| { 499| 437k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 437k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (499:9): [True: 437k, False: 0] ------------------ 500| 437k| if (shift == endshift) ------------------ | Branch (500:13): [True: 363k, False: 73.9k] ------------------ 501| 363k| return node; 502| 73.9k| else { 503| 73.9k| auto n = node_t::make_inner_n(1); 504| 73.9k| IMMER_TRY { ------------------ | | 49| 73.9k|#define IMMER_TRY try ------------------ 505| 73.9k| n->inner()[0] = make_path(shift - B, node); 506| 73.9k| } 507| 73.9k| IMMER_CATCH (...) { 508| 0| heap::deallocate(node_t::sizeof_inner_n(1), n); 509| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 510| 0| } 511| 73.9k| return n; 512| 73.9k| } 513| 437k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12make_inner_nEj: 224| 1.36M| { 225| 1.36M| assert(n <= branches); ------------------ | Branch (225:9): [True: 1.36M, False: 0] ------------------ 226| 1.36M| auto m = heap::allocate(sizeof_inner_n(n)); 227| 1.36M| return make_inner_n_into(m, sizeof_inner_n(n), n); 228| 1.36M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9copy_leafEPSB_j: 666| 182k| { 667| 182k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 182k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (667:9): [True: 182k, False: 0] ------------------ 668| 182k| auto dst = make_leaf_n(n); 669| 182k| IMMER_TRY { ------------------ | | 49| 182k|#define IMMER_TRY try ------------------ 670| 182k| detail::uninitialized_copy( 671| 182k| src->leaf(), src->leaf() + n, dst->leaf()); 672| 182k| } 673| 182k| IMMER_CATCH (...) { 674| 0| heap::deallocate(node_t::sizeof_leaf_n(n), dst); 675| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 676| 0| } 677| 182k| return dst; 678| 182k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15make_inner_sr_nEjPNS0_3csl6memberINSB_14relaxed_data_tEvE4typeE: 269| 198k| { 270| 198k| return static_if( 271| 198k| [&](auto) { return node_t::make_inner_r_n(n); }, 272| 198k| [&](auto) { 273| 198k| auto p = 274| 198k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 198k| assert(r->d.count >= n); 276| 198k| node_t::refs(r).inc(); 277| 198k| p->impl.d.data.inner.relaxed = r; 278| 198k|#if IMMER_TAGGED_NODE 279| 198k| p->impl.d.kind = node_t::kind_t::inner; 280| 198k|#endif 281| 198k| return p; 282| 198k| }); 283| 198k| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15make_inner_sr_nEjPNS0_3csl6memberINSB_14relaxed_data_tEvE4typeEENKUlT_E_clINS0_7empty_tEEEDaSI_: 271| 198k| [&](auto) { return node_t::make_inner_r_n(n); }, _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE24do_copy_inner_replace_srEPSB_SC_jjSC_: 652| 198k| { 653| 198k| if (embed_relaxed) ------------------ | Branch (653:13): [True: 198k, Folded] ------------------ 654| 198k| return do_copy_inner_replace_r(dst, src, n, offset, child); 655| 0| else { 656| 0| auto p = src->inner(); 657| 0| inc_nodes(p, offset); 658| 0| inc_nodes(p + offset + 1, n - offset - 1); 659| 0| std::copy(p, p + n, dst->inner()); 660| 0| dst->inner()[offset] = child; 661| 0| return dst; 662| 0| } 663| 198k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE23do_copy_inner_replace_rEPSB_SC_jjSC_: 624| 198k| { 625| 198k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 198k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (625:9): [True: 198k, False: 0] ------------------ 626| 198k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 198k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (626:9): [True: 198k, False: 0] ------------------ 627| 198k| auto src_r = src->relaxed(); 628| 198k| auto dst_r = dst->relaxed(); 629| 198k| auto p = src->inner(); 630| 198k| inc_nodes(p, offset); 631| 198k| inc_nodes(p + offset + 1, n - offset - 1); 632| 198k| std::copy(src->inner(), src->inner() + n, dst->inner()); 633| 198k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 634| 198k| dst_r->d.count = n; 635| 198k| dst->inner()[offset] = child; 636| 198k| return dst; 637| 198k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE21do_copy_inner_replaceEPSB_SC_jjSC_: 569| 71.7k| { 570| 71.7k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 71.7k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (570:9): [True: 71.7k, False: 0] ------------------ 571| 71.7k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 71.7k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (571:9): [True: 71.7k, False: 0] ------------------ 572| 71.7k| auto p = src->inner(); 573| 71.7k| inc_nodes(p, offset); 574| 71.7k| inc_nodes(p + offset + 1, n - offset - 1); 575| 71.7k| std::copy(p, p + n, dst->inner()); 576| 71.7k| dst->inner()[offset] = child; 577| 71.7k| return dst; 578| 71.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12copy_inner_nEjPSB_j: 543| 11.8k| { 544| 11.8k| assert(allocn >= n); ------------------ | Branch (544:9): [True: 11.8k, False: 0] ------------------ 545| 11.8k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 11.8k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (545:9): [True: 11.8k, False: 0] ------------------ 546| 11.8k| auto dst = make_inner_n(allocn); 547| 11.8k| return do_copy_inner(dst, src, n); 548| 11.8k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12copy_inner_rEPSB_j: 581| 4.03k| { 582| 4.03k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 4.03k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (582:9): [True: 4.03k, False: 0] ------------------ 583| 4.03k| auto dst = make_inner_r_n(n); 584| 4.03k| return do_copy_inner_r(dst, src, n); 585| 4.03k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13compute_shiftEv: 977| 3.47M| { 978| 3.47M| if (kind() == kind_t::leaf) ------------------ | Branch (978:13): [True: 323k, False: 3.15M] ------------------ 979| 323k| return endshift; 980| 3.15M| else 981| 3.15M| return B + inner()[0]->compute_shift(); 982| 3.47M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5checkEjm: 986| 323k| { 987| |#if IMMER_DEBUG_DEEP_CHECK 988| | assert(size > 0); 989| | if (shift == endshift) { 990| | IMMER_ASSERT_TAGGED(kind() == kind_t::leaf); 991| | assert(size <= branches); 992| | } else if (auto r = relaxed()) { 993| | auto count = r->d.count; 994| | assert(count > 0); 995| | assert(count <= branches); 996| | if (r->d.sizes[count - 1] != size) { 997| | IMMER_TRACE_F("check"); 998| | IMMER_TRACE_E(r->d.sizes[count - 1]); 999| | IMMER_TRACE_E(size); 1000| | } 1001| | assert(r->d.sizes[count - 1] == size); 1002| | for (auto i = 1u; i < count; ++i) 1003| | assert(r->d.sizes[i - 1] < r->d.sizes[i]); 1004| | auto last_size = size_t{}; 1005| | for (auto i = 0u; i < count; ++i) { 1006| | assert(inner()[i]->check(shift - B, r->d.sizes[i] - last_size)); 1007| | last_size = r->d.sizes[i]; 1008| | } 1009| | } else { 1010| | assert(size <= branches << shift); 1011| | auto count = 1012| | (size >> shift) + (size - ((size >> shift) << shift) > 0); 1013| | assert(count <= branches); 1014| | if (count) { 1015| | for (auto i = 1u; i < count - 1; ++i) 1016| | assert(inner()[i]->check(shift - B, 1 << shift)); 1017| | assert(inner()[count - 1]->check( 1018| | shift - B, size - ((count - 1) << shift))); 1019| | } 1020| | } 1021| |#endif // IMMER_DEBUG_DEEP_CHECK 1022| 323k| return true; 1023| 323k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9copy_leafEPSB_jj: 778| 276k| { 779| 276k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 276k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (779:9): [True: 276k, False: 0] ------------------ 780| 276k| auto dst = make_leaf_n(last - idx); 781| 276k| IMMER_TRY { ------------------ | | 49| 276k|#define IMMER_TRY try ------------------ 782| 276k| detail::uninitialized_copy( 783| 276k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 784| 276k| } 785| 276k| IMMER_CATCH (...) { 786| 0| heap::deallocate(node_t::sizeof_leaf_n(last - idx), dst); 787| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 788| 0| } 789| 276k| return dst; 790| 276k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9copy_leafEPSB_jSC_j: 712| 266k| { 713| 266k| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 266k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (713:9): [True: 266k, False: 0] ------------------ 714| 266k| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 266k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (714:9): [True: 266k, False: 0] ------------------ 715| 266k| auto dst = make_leaf_n(n1 + n2); 716| 266k| IMMER_TRY { ------------------ | | 49| 266k|#define IMMER_TRY try ------------------ 717| 266k| detail::uninitialized_copy( 718| 266k| src1->leaf(), src1->leaf() + n1, dst->leaf()); 719| 266k| } 720| 266k| IMMER_CATCH (...) { 721| 0| heap::deallocate(node_t::sizeof_leaf_n(n1 + n2), dst); 722| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 723| 0| } 724| 266k| IMMER_TRY { ------------------ | | 49| 266k|#define IMMER_TRY try ------------------ 725| 266k| detail::uninitialized_copy( 726| 266k| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 727| 266k| } 728| 266k| IMMER_CATCH (...) { 729| 0| detail::destroy_n(dst->leaf(), n1); 730| 0| heap::deallocate(node_t::sizeof_leaf_n(n1 + n2), dst); 731| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 732| 0| } 733| 266k| return dst; 734| 266k| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10can_mutateENS9_5applyIS6_E4type4editE: 870| 2.54M| { 871| 2.54M| return refs(this).unique() || ownee(this).can_mutate(e); ------------------ | Branch (871:16): [True: 2.28M, False: 267k] | Branch (871:39): [True: 0, False: 267k] ------------------ 872| 2.54M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5owneeEPKSB_: 207| 267k| { 208| 267k| return get(x->impl); 209| 267k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_j: 681| 43.9k| { 682| 43.9k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 43.9k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (682:9): [True: 43.9k, False: 0] ------------------ 683| 43.9k| auto dst = make_leaf_e(e); 684| 43.9k| IMMER_TRY { ------------------ | | 49| 43.9k|#define IMMER_TRY try ------------------ 685| 43.9k| detail::uninitialized_copy( 686| 43.9k| src->leaf(), src->leaf() + n, dst->leaf()); 687| 43.9k| } 688| 43.9k| IMMER_CATCH (...) { 689| 0| heap::deallocate(node_t::max_sizeof_leaf, dst); 690| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 691| 0| } 692| 43.9k| return dst; 693| 43.9k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_eENS9_5applyIS6_E4type4editE: 348| 396k| { 349| 396k| auto p = new (heap::allocate(max_sizeof_leaf)) node_t; 350| 396k| ownee(p) = e; 351| 396k|#if IMMER_TAGGED_NODE 352| 396k| p->impl.d.kind = node_t::kind_t::leaf; 353| 396k|#endif 354| 396k| return p; 355| 396k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_leaf_eIiEEPSB_NS9_5applyIS6_E4type4editEOT_: 485| 9.90k| { 486| 9.90k| auto p = make_leaf_e(e); 487| 9.90k| IMMER_TRY { ------------------ | | 49| 9.90k|#define IMMER_TRY try ------------------ 488| 9.90k| new (p->leaf()) T(std::forward(x)); 489| 9.90k| } 490| 9.90k| IMMER_CATCH (...) { 491| 0| heap::deallocate(node_t::max_sizeof_leaf, p); 492| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 493| 0| } 494| 9.90k| return p; 495| 9.90k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEj: 930| 181k| { 931| 181k| auto src_r = relaxed(); 932| 181k| return static_if( 933| 181k| [&](auto) { return src_r; }, 934| 181k| [&](auto) { 935| 181k| if (node_t::refs(src_r).unique() || 936| 181k| node_t::ownee(src_r).can_mutate(e)) 937| 181k| return src_r; 938| 181k| else { 939| 181k| auto dst_r = 940| 181k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 181k| if (src_r) { 942| 181k| std::copy( 943| 181k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 181k| if (node_t::refs(src_r).dec()) 945| 181k| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 181k| src_r); 947| 181k| } 948| 181k| dst_r->d.count = n; 949| 181k| node_t::ownee(dst_r) = e; 950| 181k| return impl.d.data.inner.relaxed = dst_r; 951| 181k| } 952| 181k| }); 953| 181k| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEjENKUlT_E_clINS0_7empty_tEEEDaSG_: 933| 181k| [&](auto) { return src_r; }, _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14copy_inner_r_eENS9_5applyIS6_E4type4editEPSB_j: 596| 17.1k| { 597| 17.1k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 17.1k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (597:9): [True: 17.1k, False: 0] ------------------ 598| 17.1k| auto dst = make_inner_r_e(e); 599| 17.1k| return do_copy_inner_r(dst, src, n); 600| 17.1k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14make_inner_r_eENS9_5applyIS6_E4type4editE: 286| 136k| { 287| 136k| auto mp = heap::allocate(max_sizeof_inner_r); 288| 136k| auto mr = static_cast(nullptr); 289| 136k| if (embed_relaxed) { ------------------ | Branch (289:13): [True: 136k, Folded] ------------------ 290| 136k| mr = reinterpret_cast(mp) + max_sizeof_inner; 291| 136k| } else { 292| 0| IMMER_TRY { ------------------ | | 49| 0|#define IMMER_TRY try ------------------ 293| 0| mr = heap::allocate(max_sizeof_relaxed, norefs_tag{}); 294| 0| } 295| 0| IMMER_CATCH (...) { 296| 0| heap::deallocate(max_sizeof_inner_r, mp); 297| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 298| 0| } 299| 0| } 300| 136k| auto p = new (mp) node_t; 301| 136k| auto r = new (mr) relaxed_t; 302| 136k| ownee(p) = e; 303| 136k| static_if([&](auto) { node_t::ownee(r) = e; }); 304| 136k| r->d.count = 0; 305| 136k| p->impl.d.data.inner.relaxed = r; 306| 136k|#if IMMER_TAGGED_NODE 307| 136k| p->impl.d.kind = node_t::kind_t::inner; 308| 136k|#endif 309| 136k| return p; 310| 136k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11make_path_eENS9_5applyIS6_E4type4editEjPSB_: 516| 403k| { 517| 403k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 403k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (517:9): [True: 403k, False: 0] ------------------ 518| 403k| if (shift == endshift) ------------------ | Branch (518:13): [True: 349k, False: 53.7k] ------------------ 519| 349k| return node; 520| 53.7k| else { 521| 53.7k| auto n = node_t::make_inner_e(e); 522| 53.7k| IMMER_TRY { ------------------ | | 49| 53.7k|#define IMMER_TRY try ------------------ 523| 53.7k| n->inner()[0] = make_path_e(e, shift - B, node); 524| 53.7k| } 525| 53.7k| IMMER_CATCH (...) { 526| 0| heap::deallocate(node_t::max_sizeof_inner, n); 527| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 528| 0| } 529| 53.7k| return n; 530| 53.7k| } 531| 403k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12make_inner_eENS9_5applyIS6_E4type4editE: 231| 85.7k| { 232| 85.7k| auto m = heap::allocate(max_sizeof_inner); 233| 85.7k| auto p = new (m) node_t; 234| 85.7k| ownee(p) = e; 235| 85.7k| p->impl.d.data.inner.relaxed = nullptr; 236| 85.7k|#if IMMER_TAGGED_NODE 237| 85.7k| p->impl.d.kind = node_t::kind_t::inner; 238| 85.7k|#endif 239| 85.7k| return p; 240| 85.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE12copy_inner_eENS9_5applyIS6_E4type4editEPSB_j: 551| 18.6k| { 552| 18.6k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 18.6k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (552:9): [True: 18.6k, False: 0] ------------------ 553| 18.6k| auto dst = make_inner_e(e); 554| 18.6k| return do_copy_inner(dst, src, n); 555| 18.6k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15copy_inner_sr_eENS9_5applyIS6_E4type4editEPSB_j: 603| 25.5k| { 604| 25.5k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 25.5k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (604:9): [True: 25.5k, False: 0] ------------------ 605| 25.5k| auto dst = make_inner_sr_e(e, src->relaxed()); 606| 25.5k| return do_copy_inner_sr(dst, src, n); 607| 25.5k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15make_inner_sr_eENS9_5applyIS6_E4type4editEPNS0_3csl6memberINSB_14relaxed_data_tEvE4typeE: 313| 25.5k| { 314| 25.5k| return static_if( 315| 25.5k| [&](auto) { return node_t::make_inner_r_e(e); }, 316| 25.5k| [&](auto) { 317| 25.5k| auto p = 318| 25.5k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 25.5k| node_t::refs(r).inc(); 320| 25.5k| p->impl.d.data.inner.relaxed = r; 321| 25.5k| node_t::ownee(p) = e; 322| 25.5k|#if IMMER_TAGGED_NODE 323| 25.5k| p->impl.d.kind = node_t::kind_t::inner; 324| 25.5k|#endif 325| 25.5k| return p; 326| 25.5k| }); 327| 25.5k| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE15make_inner_sr_eENS9_5applyIS6_E4type4editEPNS0_3csl6memberINSB_14relaxed_data_tEvE4typeEENKUlT_E_clINS0_7empty_tEEEDaSM_: 315| 25.5k| [&](auto) { return node_t::make_inner_r_e(e); }, _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE16do_copy_inner_srEPSB_SC_j: 640| 25.5k| { 641| 25.5k| if (embed_relaxed) ------------------ | Branch (641:13): [True: 25.5k, Folded] ------------------ 642| 25.5k| return do_copy_inner_r(dst, src, n); 643| 0| else { 644| 0| inc_nodes(src->inner(), n); 645| 0| std::copy(src->inner(), src->inner() + n, dst->inner()); 646| 0| return dst; 647| 0| } 648| 25.5k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jj: 763| 342k| { 764| 342k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 342k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (764:9): [True: 342k, False: 0] ------------------ 765| 342k| auto dst = make_leaf_e(e); 766| 342k| IMMER_TRY { ------------------ | | 49| 342k|#define IMMER_TRY try ------------------ 767| 342k| detail::uninitialized_copy( 768| 342k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 769| 342k| } 770| 342k| IMMER_CATCH (...) { 771| 0| heap::deallocate(max_sizeof_leaf, dst); 772| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 773| 0| } 774| 342k| return dst; 775| 342k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE22ensure_mutable_relaxedENS9_5applyIS6_E4type4editE: 877| 162k| { 878| 162k| auto src_r = relaxed(); 879| 162k| return static_if( 880| 162k| [&](auto) { return src_r; }, 881| 162k| [&](auto) { 882| 162k| if (node_t::refs(src_r).unique() || 883| 162k| node_t::ownee(src_r).can_mutate(e)) 884| 162k| return src_r; 885| 162k| else { 886| 162k| auto dst_r = impl.d.data.inner.relaxed = 887| 162k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 162k| if (src_r) { 889| 162k| auto n = dst_r->d.count = src_r->d.count; 890| 162k| std::copy( 891| 162k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 162k| if (node_t::refs(src_r).dec()) 893| 162k| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 162k| src_r); 895| 162k| } 896| 162k| node_t::ownee(dst_r) = e; 897| 162k| return dst_r; 898| 162k| } 899| 162k| }); 900| 162k| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE22ensure_mutable_relaxedENS9_5applyIS6_E4type4editEENKUlT_E_clINS0_7empty_tEEEDaSG_: 880| 162k| [&](auto) { return src_r; }, _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jSG_j: 738| 655| { 739| 655| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 655|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (739:9): [True: 655, False: 0] ------------------ 740| 655| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 655|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (740:9): [True: 655, False: 0] ------------------ 741| 655| auto dst = make_leaf_e(e); 742| 655| IMMER_TRY { ------------------ | | 49| 655|#define IMMER_TRY try ------------------ 743| 655| detail::uninitialized_copy( 744| 655| src1->leaf(), src1->leaf() + n1, dst->leaf()); 745| 655| } 746| 655| IMMER_CATCH (...) { 747| 0| heap::deallocate(max_sizeof_leaf, dst); 748| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 749| 0| } 750| 655| IMMER_TRY { ------------------ | | 49| 655|#define IMMER_TRY try ------------------ 751| 655| detail::uninitialized_copy( 752| 655| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 753| 655| } 754| 655| IMMER_CATCH (...) { 755| 0| detail::destroy_n(dst->leaf(), n1); 756| 0| heap::deallocate(max_sizeof_leaf, dst); 757| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 758| 0| } 759| 655| return dst; 760| 655| } _ZN5immer6detail4rbts11dec_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 523| 168M| { 524| 168M| using node_t = node_type; 525| 168M| auto node = p.node(); 526| 168M| if (node->dec()) { ------------------ | Branch (526:13): [True: 33.7M, False: 134M] ------------------ 527| 33.7M| p.each(this_t{}); 528| 33.7M| node_t::delete_inner_r(node, p.count()); 529| 33.7M| } 530| 168M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 14.7M| { 535| 14.7M| using node_t = node_type; 536| 14.7M| auto node = p.node(); 537| 14.7M| if (node->dec()) { ------------------ | Branch (537:13): [True: 432k, False: 14.2M] ------------------ 538| 432k| p.each(this_t{}); 539| 432k| node_t::delete_inner(node, p.count()); 540| 432k| } 541| 14.7M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 1.66M| { 546| 1.66M| using node_t = node_type; 547| 1.66M| auto node = p.node(); 548| 1.66M| if (node->dec()) { ------------------ | Branch (548:13): [True: 557k, False: 1.11M] ------------------ 549| 557k| node_t::delete_leaf(node, p.count()); 550| 557k| } 551| 1.66M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 397k| { 546| 397k| using node_t = node_type; 547| 397k| auto node = p.node(); 548| 397k| if (node->dec()) { ------------------ | Branch (548:13): [True: 56.2k, False: 341k] ------------------ 549| 56.2k| node_t::delete_leaf(node, p.count()); 550| 56.2k| } 551| 397k| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 2.85M| { 535| 2.85M| using node_t = node_type; 536| 2.85M| auto node = p.node(); 537| 2.85M| if (node->dec()) { ------------------ | Branch (537:13): [True: 94.8k, False: 2.76M] ------------------ 538| 94.8k| p.each(this_t{}); 539| 94.8k| node_t::delete_inner(node, p.count()); 540| 94.8k| } 541| 2.85M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 962k| { 535| 962k| using node_t = node_type; 536| 962k| auto node = p.node(); 537| 962k| if (node->dec()) { ------------------ | Branch (537:13): [True: 914k, False: 48.9k] ------------------ 538| 914k| p.each(this_t{}); 539| 914k| node_t::delete_inner(node, p.count()); 540| 914k| } 541| 962k| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 534| 1.46M| { 535| 1.46M| using node_t = node_type; 536| 1.46M| auto node = p.node(); 537| 1.46M| if (node->dec()) { ------------------ | Branch (537:13): [True: 0, False: 1.46M] ------------------ 538| 0| p.each(this_t{}); 539| 0| node_t::delete_inner(node, p.count()); 540| 0| } 541| 1.46M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 58.5M| { 546| 58.5M| using node_t = node_type; 547| 58.5M| auto node = p.node(); 548| 58.5M| if (node->dec()) { ------------------ | Branch (548:13): [True: 979k, False: 57.5M] ------------------ 549| 979k| node_t::delete_leaf(node, p.count()); 550| 979k| } 551| 58.5M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_: 545| 1.32M| { 546| 1.32M| using node_t = node_type; 547| 1.32M| auto node = p.node(); 548| 1.32M| if (node->dec()) { ------------------ | Branch (548:13): [True: 0, False: 1.32M] ------------------ 549| 0| node_t::delete_leaf(node, p.count()); 550| 0| } 551| 1.32M| } _ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_relaxedIRNS1_11relaxed_posISC_EEEEPSC_OT_SI_j: 791| 215k| { 792| 215k| auto level = pos.shift(); 793| 215k| auto idx = pos.count() - 1; 794| 215k| auto children = pos.size(idx); 795| 215k| auto new_idx = 796| 215k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (796:13): [True: 13.7k, False: 201k] | Branch (796:47): [True: 682, False: 200k] ------------------ 797| 215k| auto new_child = static_cast(nullptr); 798| 215k| if (new_idx >= branches) ------------------ | Branch (798:13): [True: 4.06k, False: 211k] ------------------ 799| 4.06k| return nullptr; 800| 211k| else if (idx == new_idx) { ------------------ | Branch (800:18): [True: 200k, False: 10.3k] ------------------ 801| 200k| new_child = pos.last_oh_csh(this_t{}, idx, children, tail, ts); 802| 200k| if (!new_child) { ------------------ | Branch (802:17): [True: 4.75k, False: 196k] ------------------ 803| 4.75k| if (++new_idx < branches) ------------------ | Branch (803:21): [True: 2.14k, False: 2.61k] ------------------ 804| 2.14k| new_child = node_t::make_path(level - B, tail); 805| 2.61k| else 806| 2.61k| return nullptr; 807| 4.75k| } 808| 200k| } else 809| 10.3k| new_child = node_t::make_path(level - B, tail); 810| 208k| IMMER_TRY { ------------------ | | 49| 208k|#define IMMER_TRY try ------------------ 811| 208k| auto count = new_idx + 1; 812| 208k| auto new_parent = 813| 208k| node_t::copy_inner_r_n(count, pos.node(), new_idx); 814| 208k| auto new_relaxed = new_parent->relaxed(); 815| 208k| new_parent->inner()[new_idx] = new_child; 816| 208k| new_relaxed->d.sizes[new_idx] = pos.size() + ts; 817| 208k| new_relaxed->d.count = count; 818| 208k| assert(new_relaxed->d.sizes[new_idx]); ------------------ | Branch (818:13): [True: 208k, False: 0] ------------------ 819| 208k| return new_parent; 820| 208k| } 821| 208k| IMMER_CATCH (...) { 822| 0| auto shift = pos.shift(); 823| 0| auto size = new_idx == idx ? children + ts : ts; ------------------ | Branch (823:26): [True: 0, False: 0] ------------------ 824| 0| if (shift > BL) { ------------------ | Branch (824:17): [True: 0, False: 0] ------------------ 825| 0| tail->inc(); 826| 0| dec_inner(new_child, shift - B, size); 827| 0| } 828| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 829| 0| } 830| 208k| } _ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_regularIRNS1_15regular_sub_posISC_EEJRjEEEPSC_OT_SJ_DpOT0_: 834| 46.1k| { 835| 46.1k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 46.1k, False: 0] ------------------ 836| 46.1k| auto idx = pos.index(pos.size() - 1); 837| 46.1k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 46.1k| auto count = new_idx + 1; 839| 46.1k| auto new_parent = node_t::make_inner_n(count); 840| 46.1k| IMMER_TRY { ------------------ | | 49| 46.1k|#define IMMER_TRY try ------------------ 841| 46.1k| new_parent->inner()[new_idx] = 842| 46.1k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 36.4k, False: 9.65k] ------------------ 843| | /* otherwise */ 844| 46.1k| : node_t::make_path(pos.shift() - B, tail); 845| 46.1k| } 846| 46.1k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 46.1k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 46.1k| } _ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_regularIRNS1_11regular_posISC_EEJEEEPSC_OT_SI_DpOT0_: 834| 872k| { 835| 872k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 872k, False: 0] ------------------ 836| 872k| auto idx = pos.index(pos.size() - 1); 837| 872k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 872k| auto count = new_idx + 1; 839| 872k| auto new_parent = node_t::make_inner_n(count); 840| 872k| IMMER_TRY { ------------------ | | 49| 872k|#define IMMER_TRY try ------------------ 841| 872k| new_parent->inner()[new_idx] = 842| 872k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 570k, False: 302k] ------------------ 843| | /* otherwise */ 844| 872k| : node_t::make_path(pos.shift() - B, tail); 845| 872k| } 846| 872k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 872k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 872k| } _ZN5immer6detail4rbts9dec_innerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEvPT_jm: 562| 441|{ 563| 441| visit_maybe_relaxed_sub(node, shift, size, dec_visitor()); 564| 441|} _ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_regularIRNS1_15regular_sub_posISC_EEJEEEPSC_OT_SI_DpOT0_: 834| 286k| { 835| 286k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 286k, False: 0] ------------------ 836| 286k| auto idx = pos.index(pos.size() - 1); 837| 286k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 286k| auto count = new_idx + 1; 839| 286k| auto new_parent = node_t::make_inner_n(count); 840| 286k| IMMER_TRY { ------------------ | | 49| 286k|#define IMMER_TRY try ------------------ 841| 286k| new_parent->inner()[new_idx] = 842| 286k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 265k, False: 20.3k] ------------------ 843| | /* otherwise */ 844| 286k| : node_t::make_path(pos.shift() - B, tail); 845| 286k| } 846| 286k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 286k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 286k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 502| 114k| { 503| 114k| auto offset = pos.index(idx); 504| 114k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 114k| IMMER_TRY { ------------------ | | 49| 114k|#define IMMER_TRY try ------------------ 506| 114k| node->leaf()[offset] = 507| 114k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 114k| return node; 509| 114k| } 510| 114k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 114k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_relaxedIRNS1_11relaxed_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 466| 198k| { 467| 198k| auto offset = pos.index(idx); 468| 198k| auto count = pos.count(); 469| 198k| auto node = node_t::make_inner_sr_n(count, pos.relaxed()); 470| 198k| IMMER_TRY { ------------------ | | 49| 198k|#define IMMER_TRY try ------------------ 471| 198k| auto child = pos.towards_oh(this_t{}, idx, offset, fn); 472| 198k| node_t::do_copy_inner_replace_sr( 473| 198k| node, pos.node(), count, offset, child); 474| 198k| return node; 475| 198k| } 476| 198k| IMMER_CATCH (...) { 477| 0| node_t::delete_inner_r(node, count); 478| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 479| 0| } 480| 198k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_regularIRNS1_15regular_sub_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 484| 55.1k| { 485| 55.1k| auto offset = pos.index(idx); 486| 55.1k| auto count = pos.count(); 487| 55.1k| auto node = node_t::make_inner_n(count); 488| 55.1k| IMMER_TRY { ------------------ | | 49| 55.1k|#define IMMER_TRY try ------------------ 489| 55.1k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 55.1k| node_t::do_copy_inner_replace( 491| 55.1k| node, pos.node(), count, offset, child); 492| 55.1k| return node; 493| 55.1k| } 494| 55.1k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 55.1k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_13full_leaf_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 502| 12.6k| { 503| 12.6k| auto offset = pos.index(idx); 504| 12.6k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 12.6k| IMMER_TRY { ------------------ | | 49| 12.6k|#define IMMER_TRY try ------------------ 506| 12.6k| node->leaf()[offset] = 507| 12.6k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 12.6k| return node; 509| 12.6k| } 510| 12.6k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 12.6k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_regularIRNS1_8full_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 484| 12.4k| { 485| 12.4k| auto offset = pos.index(idx); 486| 12.4k| auto count = pos.count(); 487| 12.4k| auto node = node_t::make_inner_n(count); 488| 12.4k| IMMER_TRY { ------------------ | | 49| 12.4k|#define IMMER_TRY try ------------------ 489| 12.4k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 12.4k| node_t::do_copy_inner_replace( 491| 12.4k| node, pos.node(), count, offset, child); 492| 12.4k| return node; 493| 12.4k| } 494| 12.4k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 12.4k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_8leaf_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 502| 42.5k| { 503| 42.5k| auto offset = pos.index(idx); 504| 42.5k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 42.5k| IMMER_TRY { ------------------ | | 49| 42.5k|#define IMMER_TRY try ------------------ 506| 42.5k| node->leaf()[offset] = 507| 42.5k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 42.5k| return node; 509| 42.5k| } 510| 42.5k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 42.5k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_regularIRNS1_11regular_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 484| 4.16k| { 485| 4.16k| auto offset = pos.index(idx); 486| 4.16k| auto count = pos.count(); 487| 4.16k| auto node = node_t::make_inner_n(count); 488| 4.16k| IMMER_TRY { ------------------ | | 49| 4.16k|#define IMMER_TRY try ------------------ 489| 4.16k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 4.16k| node_t::do_copy_inner_replace( 491| 4.16k| node, pos.node(), count, offset, child); 492| 4.16k| return node; 493| 4.16k| } 494| 4.16k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 4.16k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1096| 34.9k| { 1097| 34.9k| auto idx = pos.index(last); 1098| 34.9k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [True: 34.9k, Folded] | Branch (1098:25): [True: 27.0k, False: 7.89k] ------------------ 1099| 27.0k| return pos.towards_oh(this_t{}, last, idx); 1100| 27.0k| } else { 1101| 7.89k| using std::get; 1102| 7.89k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 7.89k| auto next = get<1>(subs); 1104| 7.89k| auto ts = get<2>(subs); 1105| 7.89k| auto tail = get<3>(subs); 1106| 7.89k| IMMER_TRY { ------------------ | | 49| 7.89k|#define IMMER_TRY try ------------------ 1107| 7.89k| if (next) { ------------------ | Branch (1107:21): [True: 4.53k, False: 3.35k] ------------------ 1108| 4.53k| auto count = idx + 1; 1109| 4.53k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 4.53k| auto newr = newn->relaxed(); 1111| 4.53k| newn->inner()[idx] = next; 1112| 4.53k| newr->d.sizes[idx] = last + 1 - ts; 1113| 4.53k| newr->d.count = count; 1114| 4.53k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 4.53k, False: 0] ------------------ 1115| 4.53k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 4.53k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 0, False: 3.35k] ------------------ 1117| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 3.35k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [True: 3.35k, Folded] | Branch (1118:40): [True: 1.60k, False: 1.75k] | Branch (1118:52): [True: 1.01k, False: 589] ------------------ 1119| 1.01k| auto newn = pos.node()->inner()[0]; 1120| 1.01k| return std::make_tuple( 1121| 1.01k| pos.shift() - B, newn->inc(), ts, tail); 1122| 2.33k| } else { 1123| 2.33k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 2.33k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 2.33k| } 1126| 7.89k| } 1127| 7.89k| IMMER_CATCH (...) { 1128| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1128:17): [True: 0, False: 0] | Branch (1128:17): [True: 0, False: 0] | Branch (1128:17): [True: 0, False: 0] ------------------ 1129| 0| if (next) ------------------ | Branch (1129:21): [True: 0, False: 0] ------------------ 1130| 0| dec_inner(next, 1131| 0| pos.shift() - B, 1132| 0| last + 1 - ts - pos.size_before(idx)); 1133| 0| if (tail) ------------------ | Branch (1133:21): [True: 0, False: 0] ------------------ 1134| 0| dec_leaf(tail, ts); 1135| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1136| 0| } 1137| 7.89k| } 1138| 34.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: 1181| 1.77k| { 1182| 1.77k| auto old_tail_size = pos.count(); 1183| 1.77k| auto new_tail_size = pos.index(last) + 1; 1184| 1.77k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 507, False: 1.26k] ------------------ 1185| 1.77k| ? pos.node()->inc() 1186| 1.77k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.77k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.77k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 4.45k| { 1182| 4.45k| auto old_tail_size = pos.count(); 1183| 4.45k| auto new_tail_size = pos.index(last) + 1; 1184| 4.45k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.51k, False: 2.93k] ------------------ 1185| 4.45k| ? pos.node()->inc() 1186| 4.45k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 4.45k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 4.45k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1096| 3.84k| { 1097| 3.84k| auto idx = pos.index(last); 1098| 3.84k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [Folded, False: 3.84k] | Branch (1098:25): [True: 0, False: 0] ------------------ 1099| 0| return pos.towards_oh(this_t{}, last, idx); 1100| 3.84k| } else { 1101| 3.84k| using std::get; 1102| 3.84k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 3.84k| auto next = get<1>(subs); 1104| 3.84k| auto ts = get<2>(subs); 1105| 3.84k| auto tail = get<3>(subs); 1106| 3.84k| IMMER_TRY { ------------------ | | 49| 3.84k|#define IMMER_TRY try ------------------ 1107| 3.84k| if (next) { ------------------ | Branch (1107:21): [True: 948, False: 2.89k] ------------------ 1108| 948| auto count = idx + 1; 1109| 948| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 948| auto newr = newn->relaxed(); 1111| 948| newn->inner()[idx] = next; 1112| 948| newr->d.sizes[idx] = last + 1 - ts; 1113| 948| newr->d.count = count; 1114| 948| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 948, False: 0] ------------------ 1115| 948| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 2.89k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 1.20k, False: 1.69k] ------------------ 1117| 1.20k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 1.69k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [Folded, False: 1.69k] | Branch (1118:40): [True: 0, False: 0] | Branch (1118:52): [True: 0, False: 0] ------------------ 1119| 0| auto newn = pos.node()->inner()[0]; 1120| 0| return std::make_tuple( 1121| 0| pos.shift() - B, newn->inc(), ts, tail); 1122| 1.69k| } else { 1123| 1.69k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 1.69k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 1.69k| } 1126| 3.84k| } 1127| 3.84k| IMMER_CATCH (...) { 1128| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1128:17): [True: 0, False: 0] | Branch (1128:17): [True: 0, False: 0] | Branch (1128:17): [True: 0, False: 0] ------------------ 1129| 0| if (next) ------------------ | Branch (1129:21): [True: 0, False: 0] ------------------ 1130| 0| dec_inner(next, 1131| 0| pos.shift() - B, 1132| 0| last + 1 - ts - pos.size_before(idx)); 1133| 0| if (tail) ------------------ | Branch (1133:21): [True: 0, False: 0] ------------------ 1134| 0| dec_leaf(tail, ts); 1135| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1136| 0| } 1137| 3.84k| } 1138| 3.84k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 3.43k| { 1143| 3.43k| auto idx = pos.index(last); 1144| 3.43k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 3.43k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 3.43k| } else { 1147| 3.43k| using std::get; 1148| 3.43k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 3.43k| auto next = get<1>(subs); 1150| 3.43k| auto ts = get<2>(subs); 1151| 3.43k| auto tail = get<3>(subs); 1152| 3.43k| IMMER_TRY { ------------------ | | 49| 3.43k|#define IMMER_TRY try ------------------ 1153| 3.43k| if (next) { ------------------ | Branch (1153:21): [True: 1.84k, False: 1.58k] ------------------ 1154| 1.84k| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 1.84k| newn->inner()[idx] = next; 1156| 1.84k| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.84k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 591, False: 998] ------------------ 1158| 591| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 998| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 998] | Branch (1159:40): [True: 0, False: 0] | Branch (1159:52): [True: 0, False: 0] ------------------ 1160| 0| auto newn = pos.node()->inner()[0]; 1161| 0| return std::make_tuple( 1162| 0| pos.shift() - B, newn->inc(), ts, tail); 1163| 998| } else { 1164| 998| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 998| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 998| } 1167| 3.43k| } 1168| 3.43k| IMMER_CATCH (...) { 1169| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] ------------------ 1170| 0| assert(tail); ------------------ | Branch (1170:17): [True: 0, False: 0] ------------------ 1171| 0| if (next) ------------------ | Branch (1171:21): [True: 0, False: 0] ------------------ 1172| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1173| 0| dec_leaf(tail, ts); 1174| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1175| 0| } 1176| 3.43k| } 1177| 3.43k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 6.63k| { 1182| 6.63k| auto old_tail_size = pos.count(); 1183| 6.63k| auto new_tail_size = pos.index(last) + 1; 1184| 6.63k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.91k, False: 4.72k] ------------------ 1185| 6.63k| ? pos.node()->inc() 1186| 6.63k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 6.63k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 6.63k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 2.37k| { 1143| 2.37k| auto idx = pos.index(last); 1144| 2.37k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.37k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.37k| } else { 1147| 2.37k| using std::get; 1148| 2.37k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.37k| auto next = get<1>(subs); 1150| 2.37k| auto ts = get<2>(subs); 1151| 2.37k| auto tail = get<3>(subs); 1152| 2.37k| IMMER_TRY { ------------------ | | 49| 2.37k|#define IMMER_TRY try ------------------ 1153| 2.37k| if (next) { ------------------ | Branch (1153:21): [True: 263, False: 2.10k] ------------------ 1154| 263| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 263| newn->inner()[idx] = next; 1156| 263| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.10k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 431, False: 1.67k] ------------------ 1158| 431| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.67k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 1.67k] | Branch (1159:40): [True: 0, False: 0] | Branch (1159:52): [True: 0, False: 0] ------------------ 1160| 0| auto newn = pos.node()->inner()[0]; 1161| 0| return std::make_tuple( 1162| 0| pos.shift() - B, newn->inc(), ts, tail); 1163| 1.67k| } else { 1164| 1.67k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.67k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.67k| } 1167| 2.37k| } 1168| 2.37k| IMMER_CATCH (...) { 1169| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] ------------------ 1170| 0| assert(tail); ------------------ | Branch (1170:17): [True: 0, False: 0] ------------------ 1171| 0| if (next) ------------------ | Branch (1171:21): [True: 0, False: 0] ------------------ 1172| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1173| 0| dec_leaf(tail, ts); 1174| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1175| 0| } 1176| 2.37k| } 1177| 2.37k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 2.59k| { 1182| 2.59k| auto old_tail_size = pos.count(); 1183| 2.59k| auto new_tail_size = pos.index(last) + 1; 1184| 2.59k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.11k, False: 1.48k] ------------------ 1185| 2.59k| ? pos.node()->inc() 1186| 2.59k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 2.59k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 2.59k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE13visit_regularIRNS1_11regular_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 3.21k| { 1143| 3.21k| auto idx = pos.index(last); 1144| 3.21k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 3.21k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 3.21k| } else { 1147| 3.21k| using std::get; 1148| 3.21k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 3.21k| auto next = get<1>(subs); 1150| 3.21k| auto ts = get<2>(subs); 1151| 3.21k| auto tail = get<3>(subs); 1152| 3.21k| IMMER_TRY { ------------------ | | 49| 3.21k|#define IMMER_TRY try ------------------ 1153| 3.21k| if (next) { ------------------ | Branch (1153:21): [True: 968, False: 2.24k] ------------------ 1154| 968| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 968| newn->inner()[idx] = next; 1156| 968| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.24k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 946, False: 1.29k] ------------------ 1158| 946| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.29k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 1.29k] | Branch (1159:40): [True: 0, False: 0] | Branch (1159:52): [True: 0, False: 0] ------------------ 1160| 0| auto newn = pos.node()->inner()[0]; 1161| 0| return std::make_tuple( 1162| 0| pos.shift() - B, newn->inc(), ts, tail); 1163| 1.29k| } else { 1164| 1.29k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.29k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.29k| } 1167| 3.21k| } 1168| 3.21k| IMMER_CATCH (...) { 1169| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] ------------------ 1170| 0| assert(tail); ------------------ | Branch (1170:17): [True: 0, False: 0] ------------------ 1171| 0| if (next) ------------------ | Branch (1171:21): [True: 0, False: 0] ------------------ 1172| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1173| 0| dec_leaf(tail, ts); 1174| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1175| 0| } 1176| 3.21k| } 1177| 3.21k| } _ZN5immer6detail4rbts8dec_leafINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEvPT_j: 556| 40.1k|{ 557| 40.1k| make_leaf_sub_pos(node, n).visit(dec_visitor{}); 558| 40.1k|} _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 8.31k| { 1143| 8.31k| auto idx = pos.index(last); 1144| 8.31k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 8.31k, Folded] | Branch (1144:25): [True: 5.53k, False: 2.77k] ------------------ 1145| 5.53k| return pos.towards_oh(this_t{}, last, idx); 1146| 5.53k| } else { 1147| 2.77k| using std::get; 1148| 2.77k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.77k| auto next = get<1>(subs); 1150| 2.77k| auto ts = get<2>(subs); 1151| 2.77k| auto tail = get<3>(subs); 1152| 2.77k| IMMER_TRY { ------------------ | | 49| 2.77k|#define IMMER_TRY try ------------------ 1153| 2.77k| if (next) { ------------------ | Branch (1153:21): [True: 728, False: 2.05k] ------------------ 1154| 728| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 728| newn->inner()[idx] = next; 1156| 728| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.05k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 2.05k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 2.05k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 2.05k, Folded] | Branch (1159:40): [True: 1.45k, False: 599] | Branch (1159:52): [True: 798, False: 653] ------------------ 1160| 798| auto newn = pos.node()->inner()[0]; 1161| 798| return std::make_tuple( 1162| 798| pos.shift() - B, newn->inc(), ts, tail); 1163| 1.25k| } else { 1164| 1.25k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.25k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.25k| } 1167| 2.77k| } 1168| 2.77k| IMMER_CATCH (...) { 1169| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] ------------------ 1170| 0| assert(tail); ------------------ | Branch (1170:17): [True: 0, False: 0] ------------------ 1171| 0| if (next) ------------------ | Branch (1171:21): [True: 0, False: 0] ------------------ 1172| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1173| 0| dec_leaf(tail, ts); 1174| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1175| 0| } 1176| 2.77k| } 1177| 8.31k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 1.77k| { 1182| 1.77k| auto old_tail_size = pos.count(); 1183| 1.77k| auto new_tail_size = pos.index(last) + 1; 1184| 1.77k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 597, False: 1.17k] ------------------ 1185| 1.77k| ? pos.node()->inc() 1186| 1.77k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.77k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.77k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 6.09k| { 1143| 6.09k| auto idx = pos.index(last); 1144| 6.09k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 6.09k, Folded] | Branch (1144:25): [True: 3.07k, False: 3.01k] ------------------ 1145| 3.07k| return pos.towards_oh(this_t{}, last, idx); 1146| 3.07k| } else { 1147| 3.01k| using std::get; 1148| 3.01k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 3.01k| auto next = get<1>(subs); 1150| 3.01k| auto ts = get<2>(subs); 1151| 3.01k| auto tail = get<3>(subs); 1152| 3.01k| IMMER_TRY { ------------------ | | 49| 3.01k|#define IMMER_TRY try ------------------ 1153| 3.01k| if (next) { ------------------ | Branch (1153:21): [True: 399, False: 2.61k] ------------------ 1154| 399| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 399| newn->inner()[idx] = next; 1156| 399| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.61k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 2.61k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 2.61k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 2.61k, Folded] | Branch (1159:40): [True: 660, False: 1.95k] | Branch (1159:52): [True: 204, False: 456] ------------------ 1160| 204| auto newn = pos.node()->inner()[0]; 1161| 204| return std::make_tuple( 1162| 204| pos.shift() - B, newn->inc(), ts, tail); 1163| 2.41k| } else { 1164| 2.41k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 2.41k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 2.41k| } 1167| 3.01k| } 1168| 3.01k| IMMER_CATCH (...) { 1169| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] ------------------ 1170| 0| assert(tail); ------------------ | Branch (1170:17): [True: 0, False: 0] ------------------ 1171| 0| if (next) ------------------ | Branch (1171:21): [True: 0, False: 0] ------------------ 1172| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1173| 0| dec_leaf(tail, ts); 1174| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1175| 0| } 1176| 3.01k| } 1177| 6.09k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 740| { 1182| 740| auto old_tail_size = pos.count(); 1183| 740| auto new_tail_size = pos.index(last) + 1; 1184| 740| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 332, False: 408] ------------------ 1185| 740| ? pos.node()->inc() 1186| 740| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 740| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 740| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE11visit_innerIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 23.3k| { 1415| 23.3k| auto idx = pos.subindex(first); 1416| 23.3k| auto count = pos.count(); 1417| 23.3k| auto left_size = pos.size_before(idx); 1418| 23.3k| auto child_size = pos.size_sbh(idx, left_size); 1419| 23.3k| auto dropped_size = first; 1420| 23.3k| auto child_dropped_size = dropped_size - left_size; 1421| 23.3k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 23.3k, Folded] | Branch (1421:25): [True: 21.3k, False: 1.94k] | Branch (1421:45): [True: 4.12k, False: 17.2k] ------------------ 1422| 4.12k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 19.1k| } else { 1424| 19.1k| using std::get; 1425| 19.1k| auto n = pos.node(); 1426| 19.1k| auto newc = count - idx; 1427| 19.1k| auto newn = node_t::make_inner_r_n(newc); 1428| 19.1k| IMMER_TRY { ------------------ | | 49| 19.1k|#define IMMER_TRY try ------------------ 1429| 19.1k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 19.1k| auto newr = newn->relaxed(); 1431| 19.1k| newr->d.count = count - idx; 1432| 19.1k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 19.1k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 19.1k, False: 0] ------------------ 1434| 19.1k| pos.copy_sizes(idx + 1, 1435| 19.1k| newr->d.count - 1, 1436| 19.1k| newr->d.sizes[0], 1437| 19.1k| newr->d.sizes + 1); 1438| 19.1k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 19.1k, False: 0] ------------------ 1439| 19.1k| pos.size() - dropped_size); 1440| 19.1k| newn->inner()[0] = get<1>(subs); 1441| 19.1k| std::copy(n->inner() + idx + 1, 1442| 19.1k| n->inner() + count, 1443| 19.1k| newn->inner() + 1); 1444| 19.1k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 19.1k| return std::make_tuple(pos.shift(), newn); 1446| 19.1k| } 1447| 19.1k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 19.1k| } 1452| 23.3k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1456| 17.3k| { 1457| 17.3k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 17.3k| return std::make_tuple(0, n); 1459| 17.3k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE11visit_innerIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 86.0k| { 1415| 86.0k| auto idx = pos.subindex(first); 1416| 86.0k| auto count = pos.count(); 1417| 86.0k| auto left_size = pos.size_before(idx); 1418| 86.0k| auto child_size = pos.size_sbh(idx, left_size); 1419| 86.0k| auto dropped_size = first; 1420| 86.0k| auto child_dropped_size = dropped_size - left_size; 1421| 86.0k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 86.0k] | Branch (1421:25): [True: 0, False: 0] | Branch (1421:45): [True: 0, False: 0] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 86.0k| } else { 1424| 86.0k| using std::get; 1425| 86.0k| auto n = pos.node(); 1426| 86.0k| auto newc = count - idx; 1427| 86.0k| auto newn = node_t::make_inner_r_n(newc); 1428| 86.0k| IMMER_TRY { ------------------ | | 49| 86.0k|#define IMMER_TRY try ------------------ 1429| 86.0k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 86.0k| auto newr = newn->relaxed(); 1431| 86.0k| newr->d.count = count - idx; 1432| 86.0k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 86.0k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 86.0k, False: 0] ------------------ 1434| 86.0k| pos.copy_sizes(idx + 1, 1435| 86.0k| newr->d.count - 1, 1436| 86.0k| newr->d.sizes[0], 1437| 86.0k| newr->d.sizes + 1); 1438| 86.0k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 86.0k, False: 0] ------------------ 1439| 86.0k| pos.size() - dropped_size); 1440| 86.0k| newn->inner()[0] = get<1>(subs); 1441| 86.0k| std::copy(n->inner() + idx + 1, 1442| 86.0k| n->inner() + count, 1443| 86.0k| newn->inner() + 1); 1444| 86.0k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 86.0k| return std::make_tuple(pos.shift(), newn); 1446| 86.0k| } 1447| 86.0k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 86.0k| } 1452| 86.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: 1414| 1.84k| { 1415| 1.84k| auto idx = pos.subindex(first); 1416| 1.84k| auto count = pos.count(); 1417| 1.84k| auto left_size = pos.size_before(idx); 1418| 1.84k| auto child_size = pos.size_sbh(idx, left_size); 1419| 1.84k| auto dropped_size = first; 1420| 1.84k| auto child_dropped_size = dropped_size - left_size; 1421| 1.84k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 1.84k] | Branch (1421:25): [True: 0, False: 0] | Branch (1421:45): [True: 0, False: 0] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 1.84k| } else { 1424| 1.84k| using std::get; 1425| 1.84k| auto n = pos.node(); 1426| 1.84k| auto newc = count - idx; 1427| 1.84k| auto newn = node_t::make_inner_r_n(newc); 1428| 1.84k| IMMER_TRY { ------------------ | | 49| 1.84k|#define IMMER_TRY try ------------------ 1429| 1.84k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 1.84k| auto newr = newn->relaxed(); 1431| 1.84k| newr->d.count = count - idx; 1432| 1.84k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 1.84k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 1.84k, False: 0] ------------------ 1434| 1.84k| pos.copy_sizes(idx + 1, 1435| 1.84k| newr->d.count - 1, 1436| 1.84k| newr->d.sizes[0], 1437| 1.84k| newr->d.sizes + 1); 1438| 1.84k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 1.84k, False: 0] ------------------ 1439| 1.84k| pos.size() - dropped_size); 1440| 1.84k| newn->inner()[0] = get<1>(subs); 1441| 1.84k| std::copy(n->inner() + idx + 1, 1442| 1.84k| n->inner() + count, 1443| 1.84k| newn->inner() + 1); 1444| 1.84k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 1.84k| return std::make_tuple(pos.shift(), newn); 1446| 1.84k| } 1447| 1.84k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 1.84k| } 1452| 1.84k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1456| 10.7k| { 1457| 10.7k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 10.7k| return std::make_tuple(0, n); 1459| 10.7k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE11visit_innerIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 8.19k| { 1415| 8.19k| auto idx = pos.subindex(first); 1416| 8.19k| auto count = pos.count(); 1417| 8.19k| auto left_size = pos.size_before(idx); 1418| 8.19k| auto child_size = pos.size_sbh(idx, left_size); 1419| 8.19k| auto dropped_size = first; 1420| 8.19k| auto child_dropped_size = dropped_size - left_size; 1421| 8.19k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 8.19k] | Branch (1421:25): [True: 0, False: 0] | Branch (1421:45): [True: 0, False: 0] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 8.19k| } else { 1424| 8.19k| using std::get; 1425| 8.19k| auto n = pos.node(); 1426| 8.19k| auto newc = count - idx; 1427| 8.19k| auto newn = node_t::make_inner_r_n(newc); 1428| 8.19k| IMMER_TRY { ------------------ | | 49| 8.19k|#define IMMER_TRY try ------------------ 1429| 8.19k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 8.19k| auto newr = newn->relaxed(); 1431| 8.19k| newr->d.count = count - idx; 1432| 8.19k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 8.19k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 8.19k, False: 0] ------------------ 1434| 8.19k| pos.copy_sizes(idx + 1, 1435| 8.19k| newr->d.count - 1, 1436| 8.19k| newr->d.sizes[0], 1437| 8.19k| newr->d.sizes + 1); 1438| 8.19k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 8.19k, False: 0] ------------------ 1439| 8.19k| pos.size() - dropped_size); 1440| 8.19k| newn->inner()[0] = get<1>(subs); 1441| 8.19k| std::copy(n->inner() + idx + 1, 1442| 8.19k| n->inner() + count, 1443| 8.19k| newn->inner() + 1); 1444| 8.19k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 8.19k| return std::make_tuple(pos.shift(), newn); 1446| 8.19k| } 1447| 8.19k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 8.19k| } 1452| 8.19k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE11visit_innerIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 10.6k| { 1415| 10.6k| auto idx = pos.subindex(first); 1416| 10.6k| auto count = pos.count(); 1417| 10.6k| auto left_size = pos.size_before(idx); 1418| 10.6k| auto child_size = pos.size_sbh(idx, left_size); 1419| 10.6k| auto dropped_size = first; 1420| 10.6k| auto child_dropped_size = dropped_size - left_size; 1421| 10.6k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 10.6k, Folded] | Branch (1421:25): [True: 7.42k, False: 3.26k] | Branch (1421:45): [True: 2.71k, False: 4.70k] ------------------ 1422| 2.71k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 7.97k| } else { 1424| 7.97k| using std::get; 1425| 7.97k| auto n = pos.node(); 1426| 7.97k| auto newc = count - idx; 1427| 7.97k| auto newn = node_t::make_inner_r_n(newc); 1428| 7.97k| IMMER_TRY { ------------------ | | 49| 7.97k|#define IMMER_TRY try ------------------ 1429| 7.97k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 7.97k| auto newr = newn->relaxed(); 1431| 7.97k| newr->d.count = count - idx; 1432| 7.97k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 7.97k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 7.97k, False: 0] ------------------ 1434| 7.97k| pos.copy_sizes(idx + 1, 1435| 7.97k| newr->d.count - 1, 1436| 7.97k| newr->d.sizes[0], 1437| 7.97k| newr->d.sizes + 1); 1438| 7.97k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 7.97k, False: 0] ------------------ 1439| 7.97k| pos.size() - dropped_size); 1440| 7.97k| newn->inner()[0] = get<1>(subs); 1441| 7.97k| std::copy(n->inner() + idx + 1, 1442| 7.97k| n->inner() + count, 1443| 7.97k| newn->inner() + 1); 1444| 7.97k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 7.97k| return std::make_tuple(pos.shift(), newn); 1446| 7.97k| } 1447| 7.97k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 7.97k| } 1452| 10.6k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE11visit_innerIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 949| { 1415| 949| auto idx = pos.subindex(first); 1416| 949| auto count = pos.count(); 1417| 949| auto left_size = pos.size_before(idx); 1418| 949| auto child_size = pos.size_sbh(idx, left_size); 1419| 949| auto dropped_size = first; 1420| 949| auto child_dropped_size = dropped_size - left_size; 1421| 949| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 949, Folded] | Branch (1421:25): [True: 272, False: 677] | Branch (1421:45): [True: 0, False: 272] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 949| } else { 1424| 949| using std::get; 1425| 949| auto n = pos.node(); 1426| 949| auto newc = count - idx; 1427| 949| auto newn = node_t::make_inner_r_n(newc); 1428| 949| IMMER_TRY { ------------------ | | 49| 949|#define IMMER_TRY try ------------------ 1429| 949| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 949| auto newr = newn->relaxed(); 1431| 949| newr->d.count = count - idx; 1432| 949| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 949| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 949, False: 0] ------------------ 1434| 949| pos.copy_sizes(idx + 1, 1435| 949| newr->d.count - 1, 1436| 949| newr->d.sizes[0], 1437| 949| newr->d.sizes + 1); 1438| 949| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 949, False: 0] ------------------ 1439| 949| pos.size() - dropped_size); 1440| 949| newn->inner()[0] = get<1>(subs); 1441| 949| std::copy(n->inner() + idx + 1, 1442| 949| n->inner() + count, 1443| 949| newn->inner() + 1); 1444| 949| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 949| return std::make_tuple(pos.shift(), newn); 1446| 949| } 1447| 949| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 949| } 1452| 949| } _ZN5immer6detail4rbts12concat_treesINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_11relaxed_posIT_EEPSE_jSG_jm: 2001| 7.29k|{ 2002| 7.29k| return make_singleton_regular_sub_pos(ltail, ltcount) 2003| 7.29k| .visit(concat_trees_left_visitor{}, 2004| 7.29k| empty_leaf_pos{}, 2005| 7.29k| rroot, 2006| 7.29k| rshift, 2007| 7.29k| rsize) 2008| 7.29k| .realize(); 2009| 7.29k|} _ZN5immer6detail4rbts25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_25singleton_regular_sub_posISC_EENS1_14empty_leaf_posISC_EEJRPSC_RjRmEEENS1_17concat_center_posISC_EEOT_OT0_DpOT1_: 1971| 7.29k| { 1972| 7.29k| return visit_maybe_relaxed_sub( 1973| 7.29k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 7.29k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_11relaxed_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 4.97k| { 1959| 4.97k| return concat_inners(lpos, tpos, rpos); 1960| 4.97k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 21.4k|{ 1873| 21.4k| auto lshift = lpos.shift(); 1874| 21.4k| auto rshift = rpos.shift(); 1875| 21.4k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 21.4k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 21.4k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 16.8k, False: 4.68k] ------------------ 1879| 16.8k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 16.8k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 16.8k| } else { 1882| 4.68k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 4.68k, False: 0] ------------------ 1883| 4.68k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 4.68k] | Branch (1883:9): [True: 4.68k, False: 0] | Branch (1883:9): [True: 4.68k, False: 0] ------------------ 1884| 4.68k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 4.68k| return concat_rebalance(lpos, cpos, rpos); 1886| 4.68k| } 1887| 21.4k|} _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8each_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 1512| 13.2M| { 1513| 13.2M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.09M, False: 12.1M] ------------------ 1514| 1.09M| auto s = size_t{}; 1515| 4.36M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 3.26M, False: 1.09M] ------------------ 1516| 3.26M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 3.26M| s = sizes_[i]; 1518| 3.26M| } 1519| 12.1M| } else { 1520| 32.7M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 20.6M, False: 12.1M] ------------------ 1521| 20.6M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 20.6M| .visit(v, args...); 1523| 12.1M| } 1524| 13.2M| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21concat_rebalance_planILj3ELj3EEEEEvOT_RT0_: 1733| 7.68M| { 1734| 7.68M| auto count = p.count(); 1735| 7.68M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 7.68M, False: 0] ------------------ 1736| 7.68M| plan.counts[plan.n++] = count; 1737| 7.68M| plan.total += count; 1738| 7.68M| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21concat_rebalance_planILj3ELj3EEEEEvOT_RT0_: 1733| 110M| { 1734| 110M| auto count = p.count(); 1735| 110M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 110M, False: 0] ------------------ 1736| 110M| plan.counts[plan.n++] = count; 1737| 110M| plan.total += count; 1738| 110M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE7shuffleEj: 1762| 13.2M| { 1763| | // gcc seems to not really understand this code... :( 1764| 13.2M|#if !defined(_MSC_VER) 1765| 13.2M|#pragma GCC diagnostic push 1766| 13.2M|#pragma GCC diagnostic ignored "-Warray-bounds" 1767| 13.2M|#endif 1768| 13.2M| constexpr count_t rrb_extras = 2; 1769| 13.2M| constexpr count_t rrb_invariant = 1; 1770| 13.2M| const auto bits = shift == BL ? BL : B; ------------------ | Branch (1770:43): [True: 1.09M, False: 12.1M] ------------------ 1771| 13.2M| const auto branches = count_t{1} << bits; 1772| 13.2M| const auto optimal = ((total - 1) >> bits) + 1; 1773| 13.2M| count_t i = 0; 1774| 16.4M| while (n >= optimal + rrb_extras) { ------------------ | Branch (1774:16): [True: 3.26M, False: 13.2M] ------------------ 1775| | // skip ok nodes 1776| 7.16M| while (counts[i] > branches - rrb_invariant) ------------------ | Branch (1776:20): [True: 3.90M, False: 3.26M] ------------------ 1777| 3.90M| i++; 1778| 3.26M| assert(i < n); ------------------ | Branch (1778:13): [True: 3.26M, False: 0] ------------------ 1779| | // short node, redistribute 1780| 3.26M| auto remaining = counts[i]; 1781| 12.0M| do { 1782| 12.0M| auto next = counts[i + 1]; 1783| 12.0M| auto count = std::min(remaining + next, branches); 1784| 12.0M| counts[i] = count; 1785| 12.0M| assert(counts[i]); ------------------ | Branch (1785:17): [True: 12.0M, False: 0] ------------------ 1786| 12.0M| remaining += next - count; 1787| 12.0M| ++i; 1788| 12.0M| } while (remaining > 0); ------------------ | Branch (1788:22): [True: 8.79M, False: 3.26M] ------------------ 1789| | // remove node 1790| 3.26M| std::move(counts + i + 1, counts + n, counts + i); 1791| 3.26M| --n; 1792| 3.26M| --i; 1793| 3.26M| } 1794| 13.2M|#if !defined(_MSC_VER) 1795| 13.2M|#pragma GCC diagnostic pop 1796| 13.2M|#endif 1797| 13.2M| } _ZNK5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 1478| 26.4M| auto shift() const { return shift_; } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPjj: 1577| 13.2M| : curr_{counts} 1578| 13.2M| , n_{n} 1579| 13.2M| , result_{ 1580| 13.2M| shift + B, node_t::make_inner_r_n(std::min(n_, branches)), 0} 1581| 13.2M| { 1582| 13.2M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPSC_m: 1481| 13.2M| : shift_{s} 1482| 13.2M| , count_{1} 1483| 13.2M| , nodes_{n0} 1484| 13.2M| , sizes_{s0} 1485| 13.2M| { 1486| 13.2M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8each_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 1512| 13.2M| { 1513| 13.2M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.09M, False: 12.1M] ------------------ 1514| 1.09M| auto s = size_t{}; 1515| 4.36M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 3.26M, False: 1.09M] ------------------ 1516| 3.26M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 3.26M| s = sizes_[i]; 1518| 3.26M| } 1519| 12.1M| } else { 1520| 32.7M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 20.6M, False: 12.1M] ------------------ 1521| 20.6M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 20.6M| .visit(v, args...); 1523| 12.1M| } 1524| 13.2M| } _ZN5immer6detail4rbts21concat_merger_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1721| 7.68M| { 1722| 7.68M| merger.merge_leaf(p); 1723| 7.68M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10merge_leafIRNS1_12leaf_sub_posISC_EEEEvOT_: 1614| 7.68M| { 1615| 7.68M| auto from = p.node(); 1616| 7.68M| auto from_size = p.size(); 1617| 7.68M| auto from_count = p.count(); 1618| 7.68M| assert(from_size); ------------------ | Branch (1618:9): [True: 7.68M, False: 0] ------------------ 1619| 7.68M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 7.53M, False: 147k] | Branch (1619:21): [True: 7.46M, False: 71.9k] ------------------ 1620| 7.46M| add_child(from, from_size); 1621| 7.46M| from->inc(); 1622| 7.46M| } else { 1623| 219k| auto from_offset = count_t{}; 1624| 219k| auto from_data = from->leaf(); 1625| 292k| do { 1626| 292k| if (!to_) { ------------------ | Branch (1626:21): [True: 144k, False: 147k] ------------------ 1627| 144k| to_ = node_t::make_leaf_n(*curr_); 1628| 144k| to_offset_ = 0; 1629| 144k| } 1630| 292k| auto data = to_->leaf(); 1631| 292k| auto to_copy = 1632| 292k| std::min(from_count - from_offset, *curr_ - to_offset_); 1633| 292k| detail::uninitialized_copy(from_data + from_offset, 1634| 292k| from_data + from_offset + to_copy, 1635| 292k| data + to_offset_); 1636| 292k| to_offset_ += to_copy; 1637| 292k| from_offset += to_copy; 1638| 292k| if (*curr_ == to_offset_) { ------------------ | Branch (1638:21): [True: 144k, False: 147k] ------------------ 1639| 144k| add_child(to_, to_offset_); 1640| 144k| to_ = nullptr; 1641| 144k| } 1642| 292k| } while (from_offset != from_count); ------------------ | Branch (1642:22): [True: 72.7k, False: 219k] ------------------ 1643| 219k| } 1644| 7.68M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9add_childEPSC_m: 1589| 125M| { 1590| 125M| assert(size); ------------------ | Branch (1590:9): [True: 125M, False: 0] ------------------ 1591| 125M| ++curr_; 1592| 125M| auto parent = result_.nodes_[result_.count_ - 1]; 1593| 125M| auto relaxed = parent->relaxed(); 1594| 125M| if (relaxed->d.count == branches) { ------------------ | Branch (1594:13): [True: 8.53M, False: 117M] ------------------ 1595| 8.53M| assert(result_.count_ < result_t::max_children); ------------------ | Branch (1595:13): [True: 8.53M, False: 0] ------------------ 1596| 8.53M| n_ -= branches; 1597| 8.53M| parent = node_t::make_inner_r_n(std::min(n_, branches)); 1598| 8.53M| relaxed = parent->relaxed(); 1599| 8.53M| result_.nodes_[result_.count_] = parent; 1600| 8.53M| result_.sizes_[result_.count_] = result_.sizes_[result_.count_ - 1]; 1601| 8.53M| assert(result_.sizes_[result_.count_]); ------------------ | Branch (1601:13): [True: 8.53M, False: 0] ------------------ 1602| 8.53M| ++result_.count_; 1603| 8.53M| } 1604| 125M| auto idx = relaxed->d.count++; 1605| 125M| result_.sizes_[result_.count_ - 1] += size; 1606| 125M| assert(result_.sizes_[result_.count_ - 1]); ------------------ | Branch (1606:9): [True: 125M, False: 0] ------------------ 1607| 125M| relaxed->d.sizes[idx] = size + (idx ? relaxed->d.sizes[idx - 1] : 0); ------------------ | Branch (1607:41): [True: 104M, False: 21.7M] ------------------ 1608| 125M| assert(relaxed->d.sizes[idx]); ------------------ | Branch (1608:9): [True: 125M, False: 0] ------------------ 1609| 125M| parent->inner()[idx] = p; 1610| 125M| }; _ZN5immer6detail4rbts21concat_merger_visitor11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1715| 110M| { 1716| 110M| merger.merge_inner(p); 1717| 110M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11merge_innerIRNS1_11relaxed_posISC_EEEEvOT_: 1648| 110M| { 1649| 110M| auto from = p.node(); 1650| 110M| auto from_size = p.size(); 1651| 110M| auto from_count = p.count(); 1652| 110M| assert(from_size); ------------------ | Branch (1652:9): [True: 110M, False: 0] ------------------ 1653| 110M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 100M, False: 10.1M] | Branch (1653:21): [True: 98.1M, False: 2.59M] ------------------ 1654| 98.1M| add_child(from, from_size); 1655| 98.1M| from->inc(); 1656| 98.1M| } else { 1657| 12.7M| auto from_offset = count_t{}; 1658| 12.7M| auto from_data = from->inner(); 1659| 19.7M| do { 1660| 19.7M| if (!to_) { ------------------ | Branch (1660:21): [True: 9.55M, False: 10.1M] ------------------ 1661| 9.55M| to_ = node_t::make_inner_r_n(*curr_); 1662| 9.55M| to_offset_ = 0; 1663| 9.55M| to_size_ = 0; 1664| 9.55M| } 1665| 19.7M| auto data = to_->inner(); 1666| 19.7M| auto to_copy = 1667| 19.7M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 19.7M| std::copy(from_data + from_offset, 1669| 19.7M| from_data + from_offset + to_copy, 1670| 19.7M| data + to_offset_); 1671| 19.7M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 19.7M| auto sizes = to_->relaxed()->d.sizes; 1673| 19.7M| p.copy_sizes( 1674| 19.7M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 19.7M| to_offset_ += to_copy; 1676| 19.7M| from_offset += to_copy; 1677| 19.7M| to_size_ = sizes[to_offset_ - 1]; 1678| 19.7M| assert(to_size_); ------------------ | Branch (1678:17): [True: 19.7M, False: 0] ------------------ 1679| 19.7M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 9.55M, False: 10.1M] ------------------ 1680| 9.55M| to_->relaxed()->d.count = to_offset_; 1681| 9.55M| add_child(to_, to_size_); 1682| 9.55M| to_ = nullptr; 1683| 9.55M| } 1684| 19.7M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 6.96M, False: 12.7M] ------------------ 1685| 12.7M| } 1686| 110M| } _ZNK5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE6finishEv: 1689| 13.2M| { 1690| 13.2M| assert(!to_); ------------------ | Branch (1690:9): [True: 13.2M, False: 0] ------------------ 1691| 13.2M| return result_; 1692| 13.2M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8each_subINS1_11dec_visitorEJEEEvT_DpOT0_: 1512| 13.2M| { 1513| 13.2M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 1.09M, False: 12.1M] ------------------ 1514| 1.09M| auto s = size_t{}; 1515| 4.36M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 3.26M, False: 1.09M] ------------------ 1516| 3.26M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 3.26M| s = sizes_[i]; 1518| 3.26M| } 1519| 12.1M| } else { 1520| 32.7M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 20.6M, False: 12.1M] ------------------ 1521| 20.6M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 20.6M| .visit(v, args...); 1523| 12.1M| } 1524| 13.2M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPSC_mSE_mSE_m: 1503| 1.08M| : shift_{s} 1504| 1.08M| , count_{3} 1505| 1.08M| , nodes_{n0, n1, n2} 1506| 1.08M| , sizes_{s0, s0 + s1, s0 + s1 + s2} 1507| 1.08M| { 1508| 1.08M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEC2EjPSC_mSE_m: 1489| 7.29k| : shift_{s} 1490| 7.29k| , count_{2} 1491| 7.29k| , nodes_{n0, n1} 1492| 7.29k| , sizes_{s0, s0 + s1} 1493| 7.29k| { 1494| 7.29k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 16.5k| { 1918| 16.5k| return concat_inners(lpos, tpos, rpos); 1919| 16.5k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 291| { 1918| 291| return concat_inners(lpos, tpos, rpos); 1919| 291| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 2.61k|{ 1873| 2.61k| auto lshift = lpos.shift(); 1874| 2.61k| auto rshift = rpos.shift(); 1875| 2.61k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 2.61k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 2.61k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 723, False: 1.88k] ------------------ 1879| 723| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 723| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.88k| } else { 1882| 1.88k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.88k, False: 0] ------------------ 1883| 1.88k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.88k] | Branch (1883:9): [True: 1.88k, False: 0] | Branch (1883:9): [True: 1.88k, False: 0] ------------------ 1884| 1.88k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.88k| return concat_rebalance(lpos, cpos, rpos); 1886| 1.88k| } 1887| 2.61k|} _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_8full_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 1.04k| { 1918| 1.04k| return concat_inners(lpos, tpos, rpos); 1919| 1.04k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 1.04k|{ 1873| 1.04k| auto lshift = lpos.shift(); 1874| 1.04k| auto rshift = rpos.shift(); 1875| 1.04k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 1.04k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 1.04k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 320, False: 723] ------------------ 1879| 320| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 320| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 723| } else { 1882| 723| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 723, False: 0] ------------------ 1883| 723| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 723] | Branch (1883:9): [True: 723, False: 0] | Branch (1883:9): [True: 723, False: 0] ------------------ 1884| 723| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 723| return concat_rebalance(lpos, cpos, rpos); 1886| 723| } 1887| 1.04k|} _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_12null_sub_posERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSE_IT_EEOT0_OT1_OT2_: 1823| 717|{ 1824| 717| auto plan = concat_rebalance_plan{}; 1825| 717| plan.fill(lpos, cpos, rpos); 1826| 717| plan.shuffle(cpos.shift()); 1827| 717| IMMER_TRY { ------------------ | | 49| 717|#define IMMER_TRY try ------------------ 1828| 717| return plan.merge(lpos, cpos, rpos); 1829| 717| } 1830| 717| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 717|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_8full_posISH_EEEEvOT_OT0_OT1_: 1752| 717| { 1753| 717| assert(n == 0u); ------------------ | Branch (1753:9): [True: 717, False: 0] ------------------ 1754| 717| assert(total == 0u); ------------------ | Branch (1754:9): [True: 717, False: 0] ------------------ 1755| 717| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 717| lpos.each_left_sub(visitor_t{}, *this); 1757| 717| cpos.each_sub(visitor_t{}, *this); 1758| 717| rpos.each_right_sub(visitor_t{}, *this); 1759| 717| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21concat_rebalance_planILj3ELj3EEEEEvOT_RT0_: 1733| 5.83M| { 1734| 5.83M| auto count = p.count(); 1735| 5.83M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 5.83M, False: 0] ------------------ 1736| 5.83M| plan.counts[plan.n++] = count; 1737| 5.83M| plan.total += count; 1738| 5.83M| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21concat_rebalance_planILj3ELj3EEEEEvOT_RT0_: 1733| 580k| { 1734| 580k| auto count = p.count(); 1735| 580k| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 580k, False: 0] ------------------ 1736| 580k| plan.counts[plan.n++] = count; 1737| 580k| plan.total += count; 1738| 580k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_8full_posISH_EEEENS7_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 717| { 1803| 717| using node_t = node_type; 1804| 717| using merger_t = concat_merger; 1805| 717| using visitor_t = concat_merger_visitor; 1806| 717| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 717| IMMER_TRY { ------------------ | | 49| 717|#define IMMER_TRY try ------------------ 1808| 717| lpos.each_left_sub(visitor_t{}, merger); 1809| 717| cpos.each_sub(visitor_t{}, merger); 1810| 717| rpos.each_right_sub(visitor_t{}, merger); 1811| 717| cpos.each_sub(dec_visitor{}); 1812| 717| return merger.finish(); 1813| 717| } 1814| 717| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 717| } _ZN5immer6detail4rbts21concat_merger_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1721| 5.83M| { 1722| 5.83M| merger.merge_leaf(p); 1723| 5.83M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10merge_leafIRNS1_13full_leaf_posISC_EEEEvOT_: 1614| 5.83M| { 1615| 5.83M| auto from = p.node(); 1616| 5.83M| auto from_size = p.size(); 1617| 5.83M| auto from_count = p.count(); 1618| 5.83M| assert(from_size); ------------------ | Branch (1618:9): [True: 5.83M, False: 0] ------------------ 1619| 5.83M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 5.83M, False: 0] | Branch (1619:21): [True: 5.83M, False: 0] ------------------ 1620| 5.83M| add_child(from, from_size); 1621| 5.83M| from->inc(); 1622| 5.83M| } else { 1623| 0| auto from_offset = count_t{}; 1624| 0| auto from_data = from->leaf(); 1625| 0| do { 1626| 0| if (!to_) { ------------------ | Branch (1626:21): [True: 0, False: 0] ------------------ 1627| 0| to_ = node_t::make_leaf_n(*curr_); 1628| 0| to_offset_ = 0; 1629| 0| } 1630| 0| auto data = to_->leaf(); 1631| 0| auto to_copy = 1632| 0| std::min(from_count - from_offset, *curr_ - to_offset_); 1633| 0| detail::uninitialized_copy(from_data + from_offset, 1634| 0| from_data + from_offset + to_copy, 1635| 0| data + to_offset_); 1636| 0| to_offset_ += to_copy; 1637| 0| from_offset += to_copy; 1638| 0| if (*curr_ == to_offset_) { ------------------ | Branch (1638:21): [True: 0, False: 0] ------------------ 1639| 0| add_child(to_, to_offset_); 1640| 0| to_ = nullptr; 1641| 0| } 1642| 0| } while (from_offset != from_count); ------------------ | Branch (1642:22): [True: 0, False: 0] ------------------ 1643| 0| } 1644| 5.83M| } _ZN5immer6detail4rbts21concat_merger_visitor11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1715| 580k| { 1716| 580k| merger.merge_inner(p); 1717| 580k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11merge_innerIRNS1_8full_posISC_EEEEvOT_: 1648| 580k| { 1649| 580k| auto from = p.node(); 1650| 580k| auto from_size = p.size(); 1651| 580k| auto from_count = p.count(); 1652| 580k| assert(from_size); ------------------ | Branch (1652:9): [True: 580k, False: 0] ------------------ 1653| 580k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 580k, False: 0] | Branch (1653:21): [True: 580k, False: 0] ------------------ 1654| 580k| add_child(from, from_size); 1655| 580k| from->inc(); 1656| 580k| } else { 1657| 0| auto from_offset = count_t{}; 1658| 0| auto from_data = from->inner(); 1659| 0| do { 1660| 0| if (!to_) { ------------------ | Branch (1660:21): [True: 0, False: 0] ------------------ 1661| 0| to_ = node_t::make_inner_r_n(*curr_); 1662| 0| to_offset_ = 0; 1663| 0| to_size_ = 0; 1664| 0| } 1665| 0| auto data = to_->inner(); 1666| 0| auto to_copy = 1667| 0| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 0| std::copy(from_data + from_offset, 1669| 0| from_data + from_offset + to_copy, 1670| 0| data + to_offset_); 1671| 0| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 0| auto sizes = to_->relaxed()->d.sizes; 1673| 0| p.copy_sizes( 1674| 0| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 0| to_offset_ += to_copy; 1676| 0| from_offset += to_copy; 1677| 0| to_size_ = sizes[to_offset_ - 1]; 1678| 0| assert(to_size_); ------------------ | Branch (1678:17): [True: 0, False: 0] ------------------ 1679| 0| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 0, False: 0] ------------------ 1680| 0| to_->relaxed()->d.count = to_offset_; 1681| 0| add_child(to_, to_size_); 1682| 0| to_ = nullptr; 1683| 0| } 1684| 0| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 0, False: 0] ------------------ 1685| 0| } 1686| 580k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 723| { 1945| 723| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 723| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_13full_leaf_posISC_EERNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1924| 2.61k| { 1925| 2.61k| return concat_leafs(lpos, tpos, rpos); 1926| 2.61k| } _ZN5immer6detail4rbts12concat_leafsINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_13full_leaf_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1838| 2.61k|{ 1839| 2.61k| static_assert(Node::bits >= 2, ""); 1840| 2.61k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 2.61k, False: 0] ------------------ 1841| 2.61k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 2.61k, False: 0] ------------------ 1842| 2.61k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 2.61k, False: 0] ------------------ 1843| 2.61k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 2.61k] ------------------ 1844| 0| return { 1845| 0| Node::bits_leaf, 1846| 0| lpos.node()->inc(), 1847| 0| lpos.count(), 1848| 0| tpos.node()->inc(), 1849| 0| tpos.count(), 1850| 0| rpos.node()->inc(), 1851| 0| rpos.count(), 1852| 0| }; 1853| 2.61k| else 1854| 2.61k| return { 1855| 2.61k| Node::bits_leaf, 1856| 2.61k| lpos.node()->inc(), 1857| 2.61k| lpos.count(), 1858| 2.61k| rpos.node()->inc(), 1859| 2.61k| rpos.count(), 1860| 2.61k| }; 1861| 2.61k|} _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_25singleton_regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 723|{ 1824| 723| auto plan = concat_rebalance_plan{}; 1825| 723| plan.fill(lpos, cpos, rpos); 1826| 723| plan.shuffle(cpos.shift()); 1827| 723| IMMER_TRY { ------------------ | | 49| 723|#define IMMER_TRY try ------------------ 1828| 723| return plan.merge(lpos, cpos, rpos); 1829| 723| } 1830| 723| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 723|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEEvOT_OT0_OT1_: 1752| 723| { 1753| 723| assert(n == 0u); ------------------ | Branch (1753:9): [True: 723, False: 0] ------------------ 1754| 723| assert(total == 0u); ------------------ | Branch (1754:9): [True: 723, False: 0] ------------------ 1755| 723| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 723| lpos.each_left_sub(visitor_t{}, *this); 1757| 723| cpos.each_sub(visitor_t{}, *this); 1758| 723| rpos.each_right_sub(visitor_t{}, *this); 1759| 723| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 723| { 1803| 723| using node_t = node_type; 1804| 723| using merger_t = concat_merger; 1805| 723| using visitor_t = concat_merger_visitor; 1806| 723| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 723| IMMER_TRY { ------------------ | | 49| 723|#define IMMER_TRY try ------------------ 1808| 723| lpos.each_left_sub(visitor_t{}, merger); 1809| 723| cpos.each_sub(visitor_t{}, merger); 1810| 723| rpos.each_right_sub(visitor_t{}, merger); 1811| 723| cpos.each_sub(dec_visitor{}); 1812| 723| return merger.finish(); 1813| 723| } 1814| 723| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 723| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_12null_sub_posERNS1_17concat_center_posISC_EERNS1_15regular_sub_posISC_EEEENSE_IT_EEOT0_OT1_OT2_: 1823| 1.74k|{ 1824| 1.74k| auto plan = concat_rebalance_plan{}; 1825| 1.74k| plan.fill(lpos, cpos, rpos); 1826| 1.74k| plan.shuffle(cpos.shift()); 1827| 1.74k| IMMER_TRY { ------------------ | | 49| 1.74k|#define IMMER_TRY try ------------------ 1828| 1.74k| return plan.merge(lpos, cpos, rpos); 1829| 1.74k| } 1830| 1.74k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.74k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_15regular_sub_posISH_EEEEvOT_OT0_OT1_: 1752| 1.74k| { 1753| 1.74k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.74k, False: 0] ------------------ 1754| 1.74k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.74k, False: 0] ------------------ 1755| 1.74k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.74k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.74k| cpos.each_sub(visitor_t{}, *this); 1758| 1.74k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.74k| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21concat_rebalance_planILj3ELj3EEEEEvOT_RT0_: 1733| 4.10M| { 1734| 4.10M| auto count = p.count(); 1735| 4.10M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 4.10M, False: 0] ------------------ 1736| 4.10M| plan.counts[plan.n++] = count; 1737| 4.10M| plan.total += count; 1738| 4.10M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_15regular_sub_posISH_EEEENS7_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 1.74k| { 1803| 1.74k| using node_t = node_type; 1804| 1.74k| using merger_t = concat_merger; 1805| 1.74k| using visitor_t = concat_merger_visitor; 1806| 1.74k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.74k| IMMER_TRY { ------------------ | | 49| 1.74k|#define IMMER_TRY try ------------------ 1808| 1.74k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.74k| cpos.each_sub(visitor_t{}, merger); 1810| 1.74k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.74k| cpos.each_sub(dec_visitor{}); 1812| 1.74k| return merger.finish(); 1813| 1.74k| } 1814| 1.74k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.74k| } _ZN5immer6detail4rbts21concat_merger_visitor11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1715| 4.10M| { 1716| 4.10M| merger.merge_inner(p); 1717| 4.10M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11merge_innerIRNS1_15regular_sub_posISC_EEEEvOT_: 1648| 4.10M| { 1649| 4.10M| auto from = p.node(); 1650| 4.10M| auto from_size = p.size(); 1651| 4.10M| auto from_count = p.count(); 1652| 4.10M| assert(from_size); ------------------ | Branch (1652:9): [True: 4.10M, False: 0] ------------------ 1653| 4.10M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 2.34M, False: 1.75M] | Branch (1653:21): [True: 2.34M, False: 0] ------------------ 1654| 2.34M| add_child(from, from_size); 1655| 2.34M| from->inc(); 1656| 2.34M| } else { 1657| 1.75M| auto from_offset = count_t{}; 1658| 1.75M| auto from_data = from->inner(); 1659| 3.51M| do { 1660| 3.51M| if (!to_) { ------------------ | Branch (1660:21): [True: 1.75M, False: 1.75M] ------------------ 1661| 1.75M| to_ = node_t::make_inner_r_n(*curr_); 1662| 1.75M| to_offset_ = 0; 1663| 1.75M| to_size_ = 0; 1664| 1.75M| } 1665| 3.51M| auto data = to_->inner(); 1666| 3.51M| auto to_copy = 1667| 3.51M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 3.51M| std::copy(from_data + from_offset, 1669| 3.51M| from_data + from_offset + to_copy, 1670| 3.51M| data + to_offset_); 1671| 3.51M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 3.51M| auto sizes = to_->relaxed()->d.sizes; 1673| 3.51M| p.copy_sizes( 1674| 3.51M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 3.51M| to_offset_ += to_copy; 1676| 3.51M| from_offset += to_copy; 1677| 3.51M| to_size_ = sizes[to_offset_ - 1]; 1678| 3.51M| assert(to_size_); ------------------ | Branch (1678:17): [True: 3.51M, False: 0] ------------------ 1679| 3.51M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 1.75M, False: 1.75M] ------------------ 1680| 1.75M| to_->relaxed()->d.count = to_offset_; 1681| 1.75M| add_child(to_, to_size_); 1682| 1.75M| to_ = nullptr; 1683| 1.75M| } 1684| 3.51M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 1.75M, False: 1.75M] ------------------ 1685| 1.75M| } 1686| 4.10M| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 1.88k| { 1945| 1.88k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 1.88k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EESH_RNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1924| 4.68k| { 1925| 4.68k| return concat_leafs(lpos, tpos, rpos); 1926| 4.68k| } _ZN5immer6detail4rbts12concat_leafsINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EESF_EENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1838| 4.68k|{ 1839| 4.68k| static_assert(Node::bits >= 2, ""); 1840| 4.68k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 4.68k, False: 0] ------------------ 1841| 4.68k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 4.68k, False: 0] ------------------ 1842| 4.68k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 4.68k, False: 0] ------------------ 1843| 4.68k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 4.68k] ------------------ 1844| 0| return { 1845| 0| Node::bits_leaf, 1846| 0| lpos.node()->inc(), 1847| 0| lpos.count(), 1848| 0| tpos.node()->inc(), 1849| 0| tpos.count(), 1850| 0| rpos.node()->inc(), 1851| 0| rpos.count(), 1852| 0| }; 1853| 4.68k| else 1854| 4.68k| return { 1855| 4.68k| Node::bits_leaf, 1856| 4.68k| lpos.node()->inc(), 1857| 4.68k| lpos.count(), 1858| 4.68k| rpos.node()->inc(), 1859| 4.68k| rpos.count(), 1860| 4.68k| }; 1861| 4.68k|} _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_25singleton_regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_15regular_sub_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 1.88k|{ 1824| 1.88k| auto plan = concat_rebalance_plan{}; 1825| 1.88k| plan.fill(lpos, cpos, rpos); 1826| 1.88k| plan.shuffle(cpos.shift()); 1827| 1.88k| IMMER_TRY { ------------------ | | 49| 1.88k|#define IMMER_TRY try ------------------ 1828| 1.88k| return plan.merge(lpos, cpos, rpos); 1829| 1.88k| } 1830| 1.88k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.88k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEEvOT_OT0_OT1_: 1752| 1.88k| { 1753| 1.88k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.88k, False: 0] ------------------ 1754| 1.88k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.88k, False: 0] ------------------ 1755| 1.88k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.88k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.88k| cpos.each_sub(visitor_t{}, *this); 1758| 1.88k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.88k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 1.88k| { 1803| 1.88k| using node_t = node_type; 1804| 1.88k| using merger_t = concat_merger; 1805| 1.88k| using visitor_t = concat_merger_visitor; 1806| 1.88k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.88k| IMMER_TRY { ------------------ | | 49| 1.88k|#define IMMER_TRY try ------------------ 1808| 1.88k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.88k| cpos.each_sub(visitor_t{}, merger); 1810| 1.88k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.88k| cpos.each_sub(dec_visitor{}); 1812| 1.88k| return merger.finish(); 1813| 1.88k| } 1814| 1.88k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.88k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_12null_sub_posERNS1_17concat_center_posISC_EERNS1_11relaxed_posISC_EEEENSE_IT_EEOT0_OT1_OT2_: 1823| 66.0k|{ 1824| 66.0k| auto plan = concat_rebalance_plan{}; 1825| 66.0k| plan.fill(lpos, cpos, rpos); 1826| 66.0k| plan.shuffle(cpos.shift()); 1827| 66.0k| IMMER_TRY { ------------------ | | 49| 66.0k|#define IMMER_TRY try ------------------ 1828| 66.0k| return plan.merge(lpos, cpos, rpos); 1829| 66.0k| } 1830| 66.0k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 66.0k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISH_EEEEvOT_OT0_OT1_: 1752| 66.0k| { 1753| 66.0k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 66.0k, False: 0] ------------------ 1754| 66.0k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 66.0k, False: 0] ------------------ 1755| 66.0k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 66.0k| lpos.each_left_sub(visitor_t{}, *this); 1757| 66.0k| cpos.each_sub(visitor_t{}, *this); 1758| 66.0k| rpos.each_right_sub(visitor_t{}, *this); 1759| 66.0k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISH_EEEENS7_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 66.0k| { 1803| 66.0k| using node_t = node_type; 1804| 66.0k| using merger_t = concat_merger; 1805| 66.0k| using visitor_t = concat_merger_visitor; 1806| 66.0k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 66.0k| IMMER_TRY { ------------------ | | 49| 66.0k|#define IMMER_TRY try ------------------ 1808| 66.0k| lpos.each_left_sub(visitor_t{}, merger); 1809| 66.0k| cpos.each_sub(visitor_t{}, merger); 1810| 66.0k| rpos.each_right_sub(visitor_t{}, merger); 1811| 66.0k| cpos.each_sub(dec_visitor{}); 1812| 66.0k| return merger.finish(); 1813| 66.0k| } 1814| 66.0k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 66.0k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 4.68k| { 1945| 4.68k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 4.68k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_25singleton_regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_11relaxed_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 4.68k|{ 1824| 4.68k| auto plan = concat_rebalance_plan{}; 1825| 4.68k| plan.fill(lpos, cpos, rpos); 1826| 4.68k| plan.shuffle(cpos.shift()); 1827| 4.68k| IMMER_TRY { ------------------ | | 49| 4.68k|#define IMMER_TRY try ------------------ 1828| 4.68k| return plan.merge(lpos, cpos, rpos); 1829| 4.68k| } 1830| 4.68k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 4.68k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEEvOT_OT0_OT1_: 1752| 4.68k| { 1753| 4.68k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 4.68k, False: 0] ------------------ 1754| 4.68k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 4.68k, False: 0] ------------------ 1755| 4.68k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 4.68k| lpos.each_left_sub(visitor_t{}, *this); 1757| 4.68k| cpos.each_sub(visitor_t{}, *this); 1758| 4.68k| rpos.each_right_sub(visitor_t{}, *this); 1759| 4.68k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 4.68k| { 1803| 4.68k| using node_t = node_type; 1804| 4.68k| using merger_t = concat_merger; 1805| 4.68k| using visitor_t = concat_merger_visitor; 1806| 4.68k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 4.68k| IMMER_TRY { ------------------ | | 49| 4.68k|#define IMMER_TRY try ------------------ 1808| 4.68k| lpos.each_left_sub(visitor_t{}, merger); 1809| 4.68k| cpos.each_sub(visitor_t{}, merger); 1810| 4.68k| rpos.each_right_sub(visitor_t{}, merger); 1811| 4.68k| cpos.each_sub(dec_visitor{}); 1812| 4.68k| return merger.finish(); 1813| 4.68k| } 1814| 4.68k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 4.68k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_15regular_sub_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 2.32k| { 1959| 2.32k| return concat_inners(lpos, tpos, rpos); 1960| 2.32k| } _ZNO5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7realizeEv: 1527| 1.09M| { 1528| 1.09M| if (count_ > 1) { ------------------ | Branch (1528:13): [True: 47.2k, False: 1.04M] ------------------ 1529| 47.2k| IMMER_TRY { ------------------ | | 49| 47.2k|#define IMMER_TRY try ------------------ 1530| 47.2k| auto result = node_t::make_inner_r_n(count_); 1531| 47.2k| auto r = result->relaxed(); 1532| 47.2k| r->d.count = count_; 1533| 47.2k| std::copy(nodes_, nodes_ + count_, result->inner()); 1534| 47.2k| std::copy(sizes_, sizes_ + count_, r->d.sizes); 1535| 47.2k| return {result, shift_, r}; 1536| 47.2k| } 1537| 47.2k| IMMER_CATCH (...) { 1538| 0| each_sub(dec_visitor{}); 1539| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1540| 0| } 1541| 1.04M| } else { 1542| 1.04M| assert(shift_ >= B + BL); ------------------ | Branch (1542:13): [True: 1.04M, False: 0] ------------------ 1543| 1.04M| return {nodes_[0], shift_ - B, nodes_[0]->relaxed()}; 1544| 1.04M| } 1545| 1.09M| } _ZN5immer6detail4rbts12concat_treesINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_11relaxed_posIT_EEPSE_jmSG_jSG_jm: 1986| 1.08M|{ 1987| 1.08M| return visit_maybe_relaxed_sub(lroot, 1988| 1.08M| lshift, 1989| 1.08M| lsize, 1990| 1.08M| concat_trees_left_visitor{}, 1991| 1.08M| make_leaf_pos(ltail, ltcount), 1992| 1.08M| rroot, 1993| 1.08M| rshift, 1994| 1.08M| rsize) 1995| 1.08M| .realize(); 1996| 1.08M|} _ZN5immer6detail4rbts25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_11relaxed_posISC_EENS1_8leaf_posISC_EEJRPSC_RjRmEEENS1_17concat_center_posISC_EEOT_OT0_DpOT1_: 1971| 1.06M| { 1972| 1.06M| return visit_maybe_relaxed_sub( 1973| 1.06M| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 1.06M| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_11relaxed_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 1.06M| { 1959| 1.06M| return concat_inners(lpos, tpos, rpos); 1960| 1.06M| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESF_EENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 11.6M|{ 1873| 11.6M| auto lshift = lpos.shift(); 1874| 11.6M| auto rshift = rpos.shift(); 1875| 11.6M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 3.29M, False: 8.33M] ------------------ 1876| 3.29M| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 3.29M| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 8.33M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 40.7k, False: 8.28M] ------------------ 1879| 40.7k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 40.7k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 8.28M| } else { 1882| 8.28M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 8.28M, False: 0] ------------------ 1883| 8.28M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 8.28M] | Branch (1883:9): [True: 8.28M, False: 0] | Branch (1883:9): [True: 8.28M, False: 0] ------------------ 1884| 8.28M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 8.28M| return concat_rebalance(lpos, cpos, rpos); 1886| 8.28M| } 1887| 11.6M|} _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1897| 3.29M| { 1898| 3.29M| return concat_inners(lpos, tpos, rpos); 1899| 3.29M| } _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1897| 5.01k| { 1898| 5.01k| return concat_inners(lpos, tpos, rpos); 1899| 5.01k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 1.14M|{ 1873| 1.14M| auto lshift = lpos.shift(); 1874| 1.14M| auto rshift = rpos.shift(); 1875| 1.14M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 2.65k, False: 1.13M] ------------------ 1876| 2.65k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 2.65k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 1.13M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 8.53k, False: 1.12M] ------------------ 1879| 8.53k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 8.53k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.12M| } else { 1882| 1.12M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.12M, False: 0] ------------------ 1883| 1.12M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.12M] | Branch (1883:9): [True: 1.12M, False: 0] | Branch (1883:9): [True: 1.12M, False: 0] ------------------ 1884| 1.12M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.12M| return concat_rebalance(lpos, cpos, rpos); 1886| 1.12M| } 1887| 1.14M|} _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EENS1_12null_sub_posEEENSG_IT_EEOT0_OT1_OT2_: 1823| 3.53k|{ 1824| 3.53k| auto plan = concat_rebalance_plan{}; 1825| 3.53k| plan.fill(lpos, cpos, rpos); 1826| 3.53k| plan.shuffle(cpos.shift()); 1827| 3.53k| IMMER_TRY { ------------------ | | 49| 3.53k|#define IMMER_TRY try ------------------ 1828| 3.53k| return plan.merge(lpos, cpos, rpos); 1829| 3.53k| } 1830| 3.53k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 3.53k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEEvOT_OT0_OT1_: 1752| 3.53k| { 1753| 3.53k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 3.53k, False: 0] ------------------ 1754| 3.53k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 3.53k, False: 0] ------------------ 1755| 3.53k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 3.53k| lpos.each_left_sub(visitor_t{}, *this); 1757| 3.53k| cpos.each_sub(visitor_t{}, *this); 1758| 3.53k| rpos.each_right_sub(visitor_t{}, *this); 1759| 3.53k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 3.53k| { 1803| 3.53k| using node_t = node_type; 1804| 3.53k| using merger_t = concat_merger; 1805| 3.53k| using visitor_t = concat_merger_visitor; 1806| 3.53k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 3.53k| IMMER_TRY { ------------------ | | 49| 3.53k|#define IMMER_TRY try ------------------ 1808| 3.53k| lpos.each_left_sub(visitor_t{}, merger); 1809| 3.53k| cpos.each_sub(visitor_t{}, merger); 1810| 3.53k| rpos.each_right_sub(visitor_t{}, merger); 1811| 3.53k| cpos.each_sub(dec_visitor{}); 1812| 3.53k| return merger.finish(); 1813| 3.53k| } 1814| 3.53k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 3.53k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 1.12M| { 1918| 1.12M| return concat_inners(lpos, tpos, rpos); 1919| 1.12M| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 383k| { 1918| 383k| return concat_inners(lpos, tpos, rpos); 1919| 383k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESF_EENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 393k|{ 1873| 393k| auto lshift = lpos.shift(); 1874| 393k| auto rshift = rpos.shift(); 1875| 393k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 878, False: 392k] ------------------ 1876| 878| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 878| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 392k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 448, False: 392k] ------------------ 1879| 448| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 448| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 392k| } else { 1882| 392k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 392k, False: 0] ------------------ 1883| 392k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 392k] | Branch (1883:9): [True: 392k, False: 0] | Branch (1883:9): [True: 392k, False: 0] ------------------ 1884| 392k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 392k| return concat_rebalance(lpos, cpos, rpos); 1886| 392k| } 1887| 393k|} _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1897| 1.26k| { 1898| 1.26k| return concat_inners(lpos, tpos, rpos); 1899| 1.26k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_8full_posISC_EERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 21.7k| { 1918| 21.7k| return concat_inners(lpos, tpos, rpos); 1919| 21.7k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 21.7k|{ 1873| 21.7k| auto lshift = lpos.shift(); 1874| 21.7k| auto rshift = rpos.shift(); 1875| 21.7k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 21.7k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 21.7k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 202, False: 21.5k] ------------------ 1879| 202| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 202| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 21.5k| } else { 1882| 21.5k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 21.5k, False: 0] ------------------ 1883| 21.5k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 21.5k] | Branch (1883:9): [True: 21.5k, False: 0] | Branch (1883:9): [True: 21.5k, False: 0] ------------------ 1884| 21.5k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 21.5k| return concat_rebalance(lpos, cpos, rpos); 1886| 21.5k| } 1887| 21.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_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 16.9k| { 1945| 16.9k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 16.9k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_13full_leaf_posISC_EERNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1924| 400k| { 1925| 400k| return concat_leafs(lpos, tpos, rpos); 1926| 400k| } _ZN5immer6detail4rbts12concat_leafsINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_13full_leaf_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1838| 400k|{ 1839| 400k| static_assert(Node::bits >= 2, ""); 1840| 400k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 400k, False: 0] ------------------ 1841| 400k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 400k, False: 0] ------------------ 1842| 400k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 400k, False: 0] ------------------ 1843| 400k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 400k, False: 0] ------------------ 1844| 400k| return { 1845| 400k| Node::bits_leaf, 1846| 400k| lpos.node()->inc(), 1847| 400k| lpos.count(), 1848| 400k| tpos.node()->inc(), 1849| 400k| tpos.count(), 1850| 400k| rpos.node()->inc(), 1851| 400k| rpos.count(), 1852| 400k| }; 1853| 0| else 1854| 0| return { 1855| 0| Node::bits_leaf, 1856| 0| lpos.node()->inc(), 1857| 0| lpos.count(), 1858| 0| rpos.node()->inc(), 1859| 0| rpos.count(), 1860| 0| }; 1861| 400k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 5.63k| { 1938| 5.63k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 5.63k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 21.5k|{ 1824| 21.5k| auto plan = concat_rebalance_plan{}; 1825| 21.5k| plan.fill(lpos, cpos, rpos); 1826| 21.5k| plan.shuffle(cpos.shift()); 1827| 21.5k| IMMER_TRY { ------------------ | | 49| 21.5k|#define IMMER_TRY try ------------------ 1828| 21.5k| return plan.merge(lpos, cpos, rpos); 1829| 21.5k| } 1830| 21.5k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 21.5k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEEvOT_OT0_OT1_: 1752| 21.5k| { 1753| 21.5k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 21.5k, False: 0] ------------------ 1754| 21.5k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 21.5k, False: 0] ------------------ 1755| 21.5k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 21.5k| lpos.each_left_sub(visitor_t{}, *this); 1757| 21.5k| cpos.each_sub(visitor_t{}, *this); 1758| 21.5k| rpos.each_right_sub(visitor_t{}, *this); 1759| 21.5k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 21.5k| { 1803| 21.5k| using node_t = node_type; 1804| 21.5k| using merger_t = concat_merger; 1805| 21.5k| using visitor_t = concat_merger_visitor; 1806| 21.5k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 21.5k| IMMER_TRY { ------------------ | | 49| 21.5k|#define IMMER_TRY try ------------------ 1808| 21.5k| lpos.each_left_sub(visitor_t{}, merger); 1809| 21.5k| cpos.each_sub(visitor_t{}, merger); 1810| 21.5k| rpos.each_right_sub(visitor_t{}, merger); 1811| 21.5k| cpos.each_sub(dec_visitor{}); 1812| 21.5k| return merger.finish(); 1813| 21.5k| } 1814| 21.5k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 21.5k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 383k| { 1945| 383k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 383k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1924| 684k| { 1925| 684k| return concat_leafs(lpos, tpos, rpos); 1926| 684k| } _ZN5immer6detail4rbts12concat_leafsINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EESF_EENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1838| 684k|{ 1839| 684k| static_assert(Node::bits >= 2, ""); 1840| 684k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 684k, False: 0] ------------------ 1841| 684k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 684k, False: 0] ------------------ 1842| 684k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 684k, False: 0] ------------------ 1843| 684k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 684k, False: 0] ------------------ 1844| 684k| return { 1845| 684k| Node::bits_leaf, 1846| 684k| lpos.node()->inc(), 1847| 684k| lpos.count(), 1848| 684k| tpos.node()->inc(), 1849| 684k| tpos.count(), 1850| 684k| rpos.node()->inc(), 1851| 684k| rpos.count(), 1852| 684k| }; 1853| 0| else 1854| 0| return { 1855| 0| Node::bits_leaf, 1856| 0| lpos.node()->inc(), 1857| 0| lpos.count(), 1858| 0| rpos.node()->inc(), 1859| 0| rpos.count(), 1860| 0| }; 1861| 684k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 15.4k| { 1938| 15.4k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 15.4k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EESF_EENSG_IT_EEOT0_OT1_OT2_: 1823| 392k|{ 1824| 392k| auto plan = concat_rebalance_plan{}; 1825| 392k| plan.fill(lpos, cpos, rpos); 1826| 392k| plan.shuffle(cpos.shift()); 1827| 392k| IMMER_TRY { ------------------ | | 49| 392k|#define IMMER_TRY try ------------------ 1828| 392k| return plan.merge(lpos, cpos, rpos); 1829| 392k| } 1830| 392k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 392k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EESH_EEvOT_OT0_OT1_: 1752| 392k| { 1753| 392k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 392k, False: 0] ------------------ 1754| 392k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 392k, False: 0] ------------------ 1755| 392k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 392k| lpos.each_left_sub(visitor_t{}, *this); 1757| 392k| cpos.each_sub(visitor_t{}, *this); 1758| 392k| rpos.each_right_sub(visitor_t{}, *this); 1759| 392k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EESH_EENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSN_OT1_: 1802| 392k| { 1803| 392k| using node_t = node_type; 1804| 392k| using merger_t = concat_merger; 1805| 392k| using visitor_t = concat_merger_visitor; 1806| 392k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 392k| IMMER_TRY { ------------------ | | 49| 392k|#define IMMER_TRY try ------------------ 1808| 392k| lpos.each_left_sub(visitor_t{}, merger); 1809| 392k| cpos.each_sub(visitor_t{}, merger); 1810| 392k| rpos.each_right_sub(visitor_t{}, merger); 1811| 392k| cpos.each_sub(dec_visitor{}); 1812| 392k| return merger.finish(); 1813| 392k| } 1814| 392k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 392k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 684k| { 1945| 684k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 684k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 1.50M| { 1938| 1.50M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 1.50M| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_11relaxed_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 1.12M|{ 1824| 1.12M| auto plan = concat_rebalance_plan{}; 1825| 1.12M| plan.fill(lpos, cpos, rpos); 1826| 1.12M| plan.shuffle(cpos.shift()); 1827| 1.12M| IMMER_TRY { ------------------ | | 49| 1.12M|#define IMMER_TRY try ------------------ 1828| 1.12M| return plan.merge(lpos, cpos, rpos); 1829| 1.12M| } 1830| 1.12M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.12M|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEEvOT_OT0_OT1_: 1752| 1.12M| { 1753| 1.12M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.12M, False: 0] ------------------ 1754| 1.12M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.12M, False: 0] ------------------ 1755| 1.12M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.12M| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.12M| cpos.each_sub(visitor_t{}, *this); 1758| 1.12M| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.12M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 1.12M| { 1803| 1.12M| using node_t = node_type; 1804| 1.12M| using merger_t = concat_merger; 1805| 1.12M| using visitor_t = concat_merger_visitor; 1806| 1.12M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.12M| IMMER_TRY { ------------------ | | 49| 1.12M|#define IMMER_TRY try ------------------ 1808| 1.12M| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.12M| cpos.each_sub(visitor_t{}, merger); 1810| 1.12M| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.12M| cpos.each_sub(dec_visitor{}); 1812| 1.12M| return merger.finish(); 1813| 1.12M| } 1814| 1.12M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.12M| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EENS1_12null_sub_posEEENSG_IT_EEOT0_OT1_OT2_: 1823| 3.30M|{ 1824| 3.30M| auto plan = concat_rebalance_plan{}; 1825| 3.30M| plan.fill(lpos, cpos, rpos); 1826| 3.30M| plan.shuffle(cpos.shift()); 1827| 3.30M| IMMER_TRY { ------------------ | | 49| 3.30M|#define IMMER_TRY try ------------------ 1828| 3.30M| return plan.merge(lpos, cpos, rpos); 1829| 3.30M| } 1830| 3.30M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 3.30M|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEEvOT_OT0_OT1_: 1752| 3.30M| { 1753| 3.30M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 3.30M, False: 0] ------------------ 1754| 3.30M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 3.30M, False: 0] ------------------ 1755| 3.30M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 3.30M| lpos.each_left_sub(visitor_t{}, *this); 1757| 3.30M| cpos.each_sub(visitor_t{}, *this); 1758| 3.30M| rpos.each_right_sub(visitor_t{}, *this); 1759| 3.30M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 3.30M| { 1803| 3.30M| using node_t = node_type; 1804| 3.30M| using merger_t = concat_merger; 1805| 3.30M| using visitor_t = concat_merger_visitor; 1806| 3.30M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 3.30M| IMMER_TRY { ------------------ | | 49| 3.30M|#define IMMER_TRY try ------------------ 1808| 3.30M| lpos.each_left_sub(visitor_t{}, merger); 1809| 3.30M| cpos.each_sub(visitor_t{}, merger); 1810| 3.30M| rpos.each_right_sub(visitor_t{}, merger); 1811| 3.30M| cpos.each_sub(dec_visitor{}); 1812| 3.30M| return merger.finish(); 1813| 3.30M| } 1814| 3.30M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 3.30M| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 7.27M| { 1918| 7.27M| return concat_inners(lpos, tpos, rpos); 1919| 7.27M| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 750| { 1918| 750| return concat_inners(lpos, tpos, rpos); 1919| 750| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 18.0k|{ 1873| 18.0k| auto lshift = lpos.shift(); 1874| 18.0k| auto rshift = rpos.shift(); 1875| 18.0k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 10.5k, False: 7.52k] ------------------ 1876| 10.5k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 10.5k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 10.5k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 575, False: 6.94k] ------------------ 1879| 575| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 575| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 6.94k| } else { 1882| 6.94k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 6.94k, False: 0] ------------------ 1883| 6.94k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 6.94k] | Branch (1883:9): [True: 6.94k, False: 0] | Branch (1883:9): [True: 6.94k, False: 0] ------------------ 1884| 6.94k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 6.94k| return concat_rebalance(lpos, cpos, rpos); 1886| 6.94k| } 1887| 18.0k|} _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1897| 10.1k| { 1898| 10.1k| return concat_inners(lpos, tpos, rpos); 1899| 10.1k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_8full_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 1.44k| { 1918| 1.44k| return concat_inners(lpos, tpos, rpos); 1919| 1.44k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 1.44k|{ 1873| 1.44k| auto lshift = lpos.shift(); 1874| 1.44k| auto rshift = rpos.shift(); 1875| 1.44k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 1.44k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 1.44k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 195, False: 1.24k] ------------------ 1879| 195| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 195| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.24k| } else { 1882| 1.24k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.24k, False: 0] ------------------ 1883| 1.24k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.24k] | Branch (1883:9): [True: 1.24k, False: 0] | Branch (1883:9): [True: 1.24k, False: 0] ------------------ 1884| 1.24k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.24k| return concat_rebalance(lpos, cpos, rpos); 1886| 1.24k| } 1887| 1.44k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 219| { 1938| 219| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 219| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 1.24k|{ 1824| 1.24k| auto plan = concat_rebalance_plan{}; 1825| 1.24k| plan.fill(lpos, cpos, rpos); 1826| 1.24k| plan.shuffle(cpos.shift()); 1827| 1.24k| IMMER_TRY { ------------------ | | 49| 1.24k|#define IMMER_TRY try ------------------ 1828| 1.24k| return plan.merge(lpos, cpos, rpos); 1829| 1.24k| } 1830| 1.24k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.24k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEEvOT_OT0_OT1_: 1752| 1.24k| { 1753| 1.24k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.24k, False: 0] ------------------ 1754| 1.24k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.24k, False: 0] ------------------ 1755| 1.24k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.24k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.24k| cpos.each_sub(visitor_t{}, *this); 1758| 1.24k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.24k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 1.24k| { 1803| 1.24k| using node_t = node_type; 1804| 1.24k| using merger_t = concat_merger; 1805| 1.24k| using visitor_t = concat_merger_visitor; 1806| 1.24k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.24k| IMMER_TRY { ------------------ | | 49| 1.24k|#define IMMER_TRY try ------------------ 1808| 1.24k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.24k| cpos.each_sub(visitor_t{}, merger); 1810| 1.24k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.24k| cpos.each_sub(dec_visitor{}); 1812| 1.24k| return merger.finish(); 1813| 1.24k| } 1814| 1.24k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.24k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 455| { 1938| 455| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 455| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EERNS1_15regular_sub_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 6.94k|{ 1824| 6.94k| auto plan = concat_rebalance_plan{}; 1825| 6.94k| plan.fill(lpos, cpos, rpos); 1826| 6.94k| plan.shuffle(cpos.shift()); 1827| 6.94k| IMMER_TRY { ------------------ | | 49| 6.94k|#define IMMER_TRY try ------------------ 1828| 6.94k| return plan.merge(lpos, cpos, rpos); 1829| 6.94k| } 1830| 6.94k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 6.94k|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEEvOT_OT0_OT1_: 1752| 6.94k| { 1753| 6.94k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 6.94k, False: 0] ------------------ 1754| 6.94k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 6.94k, False: 0] ------------------ 1755| 6.94k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 6.94k| lpos.each_left_sub(visitor_t{}, *this); 1757| 6.94k| cpos.each_sub(visitor_t{}, *this); 1758| 6.94k| rpos.each_right_sub(visitor_t{}, *this); 1759| 6.94k| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 6.94k| { 1803| 6.94k| using node_t = node_type; 1804| 6.94k| using merger_t = concat_merger; 1805| 6.94k| using visitor_t = concat_merger_visitor; 1806| 6.94k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 6.94k| IMMER_TRY { ------------------ | | 49| 6.94k|#define IMMER_TRY try ------------------ 1808| 6.94k| lpos.each_left_sub(visitor_t{}, merger); 1809| 6.94k| cpos.each_sub(visitor_t{}, merger); 1810| 6.94k| rpos.each_right_sub(visitor_t{}, merger); 1811| 6.94k| cpos.each_sub(dec_visitor{}); 1812| 6.94k| return merger.finish(); 1813| 6.94k| } 1814| 6.94k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 6.94k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 7.23M| { 1938| 7.23M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 7.23M| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EESF_EENSG_IT_EEOT0_OT1_OT2_: 1823| 8.28M|{ 1824| 8.28M| auto plan = concat_rebalance_plan{}; 1825| 8.28M| plan.fill(lpos, cpos, rpos); 1826| 8.28M| plan.shuffle(cpos.shift()); 1827| 8.28M| IMMER_TRY { ------------------ | | 49| 8.28M|#define IMMER_TRY try ------------------ 1828| 8.28M| return plan.merge(lpos, cpos, rpos); 1829| 8.28M| } 1830| 8.28M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 8.28M|} _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EESH_EEvOT_OT0_OT1_: 1752| 8.28M| { 1753| 8.28M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 8.28M, False: 0] ------------------ 1754| 8.28M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 8.28M, False: 0] ------------------ 1755| 8.28M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 8.28M| lpos.each_left_sub(visitor_t{}, *this); 1757| 8.28M| cpos.each_sub(visitor_t{}, *this); 1758| 8.28M| rpos.each_right_sub(visitor_t{}, *this); 1759| 8.28M| } _ZN5immer6detail4rbts21concat_rebalance_planILj3ELj3EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_17concat_center_posISF_EESH_EENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSN_OT1_: 1802| 8.28M| { 1803| 8.28M| using node_t = node_type; 1804| 8.28M| using merger_t = concat_merger; 1805| 8.28M| using visitor_t = concat_merger_visitor; 1806| 8.28M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 8.28M| IMMER_TRY { ------------------ | | 49| 8.28M|#define IMMER_TRY try ------------------ 1808| 8.28M| lpos.each_left_sub(visitor_t{}, merger); 1809| 8.28M| cpos.each_sub(visitor_t{}, merger); 1810| 8.28M| rpos.each_right_sub(visitor_t{}, merger); 1811| 8.28M| cpos.each_sub(dec_visitor{}); 1812| 8.28M| return merger.finish(); 1813| 8.28M| } 1814| 8.28M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 8.28M| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_15regular_sub_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 7.16k| { 1959| 7.16k| return concat_inners(lpos, tpos, rpos); 1960| 7.16k| } _ZN5immer6detail4rbts25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_15regular_sub_posISC_EENS1_8leaf_posISC_EEJRPSC_RjRmEEENS1_17concat_center_posISC_EEOT_OT0_DpOT1_: 1971| 15.9k| { 1972| 15.9k| return visit_maybe_relaxed_sub( 1973| 15.9k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 15.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_: 1958| 6.82k| { 1959| 6.82k| return concat_inners(lpos, tpos, rpos); 1960| 6.82k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_nodeIRNS1_15regular_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 9.08k| { 1959| 9.08k| return concat_inners(lpos, tpos, rpos); 1960| 9.08k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEEPSC_OT_NSA_5applyIS7_E4type4editESI_j: 680| 176k| { 681| 176k| auto node = pos.node(); 682| 176k| auto level = pos.shift(); 683| 176k| auto idx = pos.count() - 1; 684| 176k| auto children = pos.size(idx); 685| 176k| auto new_idx = 686| 176k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 2.74k, False: 174k] | Branch (686:47): [True: 303, False: 173k] ------------------ 687| 176k| auto new_child = static_cast(nullptr); 688| 176k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [True: 176k, Folded] | Branch (688:38): [True: 173k, False: 3.13k] ------------------ 689| | 690| 176k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 749, False: 176k] ------------------ 691| 749| return nullptr; 692| 176k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 173k, False: 2.29k] ------------------ 693| 173k| new_child = 694| 173k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 171k, False: 2.68k] ------------------ 695| 173k| : pos.last_oh_csh( 696| 2.68k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 173k| if (!new_child) { ------------------ | Branch (697:17): [True: 1.02k, False: 172k] ------------------ 698| 1.02k| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 324, False: 705] ------------------ 699| 324| new_child = node_t::make_path_e(e, level - B, tail); 700| 705| else 701| 705| return nullptr; 702| 1.02k| } 703| 173k| } else 704| 2.29k| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 175k| if (mutate) { ------------------ | Branch (706:13): [True: 172k, False: 2.81k] ------------------ 707| 172k| auto count = new_idx + 1; 708| 172k| auto relaxed = node->ensure_mutable_relaxed_n(e, new_idx); 709| 172k| node->inner()[new_idx] = new_child; 710| 172k| relaxed->d.sizes[new_idx] = pos.size() + ts; 711| 172k| relaxed->d.count = count; 712| 172k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (712:13): [True: 172k, False: 0] ------------------ 713| 172k| return node; 714| 172k| } else { 715| 2.81k| IMMER_TRY { ------------------ | | 49| 2.81k|#define IMMER_TRY try ------------------ 716| 2.81k| auto count = new_idx + 1; 717| 2.81k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 2.81k| auto relaxed = new_node->relaxed(); 719| 2.81k| new_node->inner()[new_idx] = new_child; 720| 2.81k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 2.81k| relaxed->d.count = count; 722| 2.81k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 2.81k, False: 0] ------------------ 723| 2.81k| if (Mutating) ------------------ | Branch (723:21): [True: 2.81k, Folded] ------------------ 724| 2.81k| pos.visit(dec_visitor{}); 725| 2.81k| return new_node; 726| 2.81k| } 727| 2.81k| IMMER_CATCH (...) { 728| 0| auto shift = pos.shift(); 729| 0| auto size = new_idx == idx ? children + ts : ts; ------------------ | Branch (729:30): [True: 0, False: 0] ------------------ 730| 0| if (shift > BL) { ------------------ | Branch (730:21): [True: 0, False: 0] ------------------ 731| 0| tail->inc(); 732| 0| dec_inner(new_child, shift - B, size); 733| 0| } 734| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 735| 0| } 736| 2.81k| } 737| 175k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEJRjEEEPSC_OT_NSA_5applyIS7_E4type4editESJ_DpOT0_: 741| 157k| { 742| 157k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 157k, False: 0] ------------------ 743| 157k| auto node = pos.node(); 744| 157k| auto idx = pos.index(pos.size() - 1); 745| 157k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 157k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 157k, Folded] | Branch (746:36): [True: 155k, False: 1.37k] ------------------ 747| 157k| if (mutate) { ------------------ | Branch (747:13): [True: 155k, False: 1.37k] ------------------ 748| 155k| node->inner()[new_idx] = 749| 155k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 153k, False: 2.66k] ------------------ 750| | /* otherwise */ 751| 155k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 155k| return node; 753| 155k| } else { 754| 1.37k| auto new_parent = node_t::make_inner_e(e); 755| 1.37k| IMMER_TRY { ------------------ | | 49| 1.37k|#define IMMER_TRY try ------------------ 756| 1.37k| new_parent->inner()[new_idx] = 757| 1.37k| idx == new_idx ------------------ | Branch (757:21): [True: 1.01k, False: 360] ------------------ 758| 1.37k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 1.37k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 1.37k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 1.37k| if (Mutating) ------------------ | Branch (762:21): [True: 1.37k, Folded] ------------------ 763| 1.37k| pos.visit(dec_visitor{}); 764| 1.37k| return new_parent; 765| 1.37k| } 766| 1.37k| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 1.37k| } 771| 157k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE13visit_regularIRNS1_11regular_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_: 741| 1.03M| { 742| 1.03M| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 1.03M, False: 0] ------------------ 743| 1.03M| auto node = pos.node(); 744| 1.03M| auto idx = pos.index(pos.size() - 1); 745| 1.03M| auto new_idx = pos.index(pos.size() + branches - 1); 746| 1.03M| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 1.03M, Folded] | Branch (746:36): [True: 1.03M, False: 2.10k] ------------------ 747| 1.03M| if (mutate) { ------------------ | Branch (747:13): [True: 1.03M, False: 2.10k] ------------------ 748| 1.03M| node->inner()[new_idx] = 749| 1.03M| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 709k, False: 324k] ------------------ 750| | /* otherwise */ 751| 1.03M| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 1.03M| return node; 753| 1.03M| } else { 754| 2.10k| auto new_parent = node_t::make_inner_e(e); 755| 2.10k| IMMER_TRY { ------------------ | | 49| 2.10k|#define IMMER_TRY try ------------------ 756| 2.10k| new_parent->inner()[new_idx] = 757| 2.10k| idx == new_idx ------------------ | Branch (757:21): [True: 1.45k, False: 651] ------------------ 758| 2.10k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 2.10k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 2.10k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 2.10k| if (Mutating) ------------------ | Branch (762:21): [True: 2.10k, Folded] ------------------ 763| 2.10k| pos.visit(dec_visitor{}); 764| 2.10k| return new_parent; 765| 2.10k| } 766| 2.10k| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 2.10k| } 771| 1.03M| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE13visit_regularIRNS1_11regular_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_: 741| 6.10k| { 742| 6.10k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 6.10k, False: 0] ------------------ 743| 6.10k| auto node = pos.node(); 744| 6.10k| auto idx = pos.index(pos.size() - 1); 745| 6.10k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 6.10k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 6.10k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 6.10k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 6.10k] ------------------ 748| 0| node->inner()[new_idx] = 749| 0| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 0, False: 0] ------------------ 750| | /* otherwise */ 751| 0| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 0| return node; 753| 6.10k| } else { 754| 6.10k| auto new_parent = node_t::make_inner_e(e); 755| 6.10k| IMMER_TRY { ------------------ | | 49| 6.10k|#define IMMER_TRY try ------------------ 756| 6.10k| new_parent->inner()[new_idx] = 757| 6.10k| idx == new_idx ------------------ | Branch (757:21): [True: 2.57k, False: 3.52k] ------------------ 758| 6.10k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 6.10k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 6.10k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 6.10k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 6.10k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 6.10k| return new_parent; 765| 6.10k| } 766| 6.10k| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 6.10k| } 771| 6.10k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEEPSC_OT_NSA_5applyIS7_E4type4editESI_j: 680| 7.04k| { 681| 7.04k| auto node = pos.node(); 682| 7.04k| auto level = pos.shift(); 683| 7.04k| auto idx = pos.count() - 1; 684| 7.04k| auto children = pos.size(idx); 685| 7.04k| auto new_idx = 686| 7.04k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 815, False: 6.23k] | Branch (686:47): [True: 685, False: 5.54k] ------------------ 687| 7.04k| auto new_child = static_cast(nullptr); 688| 7.04k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [Folded, False: 7.04k] | Branch (688:38): [True: 0, False: 0] ------------------ 689| | 690| 7.04k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 633, False: 6.41k] ------------------ 691| 633| return nullptr; 692| 6.41k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 5.54k, False: 867] ------------------ 693| 5.54k| new_child = 694| 5.54k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 0, False: 5.54k] ------------------ 695| 5.54k| : pos.last_oh_csh( 696| 5.54k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 5.54k| if (!new_child) { ------------------ | Branch (697:17): [True: 775, False: 4.77k] ------------------ 698| 775| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 332, False: 443] ------------------ 699| 332| new_child = node_t::make_path_e(e, level - B, tail); 700| 443| else 701| 443| return nullptr; 702| 775| } 703| 5.54k| } else 704| 867| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 5.97k| if (mutate) { ------------------ | Branch (706:13): [True: 0, False: 5.97k] ------------------ 707| 0| auto count = new_idx + 1; 708| 0| auto relaxed = node->ensure_mutable_relaxed_n(e, new_idx); 709| 0| node->inner()[new_idx] = new_child; 710| 0| relaxed->d.sizes[new_idx] = pos.size() + ts; 711| 0| relaxed->d.count = count; 712| 0| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (712:13): [True: 0, False: 0] ------------------ 713| 0| return node; 714| 5.97k| } else { 715| 5.97k| IMMER_TRY { ------------------ | | 49| 5.97k|#define IMMER_TRY try ------------------ 716| 5.97k| auto count = new_idx + 1; 717| 5.97k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 5.97k| auto relaxed = new_node->relaxed(); 719| 5.97k| new_node->inner()[new_idx] = new_child; 720| 5.97k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 5.97k| relaxed->d.count = count; 722| 5.97k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 5.97k, False: 0] ------------------ 723| 5.97k| if (Mutating) ------------------ | Branch (723:21): [Folded, False: 5.97k] ------------------ 724| 0| pos.visit(dec_visitor{}); 725| 5.97k| return new_node; 726| 5.97k| } 727| 5.97k| IMMER_CATCH (...) { 728| 0| auto shift = pos.shift(); 729| 0| auto size = new_idx == idx ? children + ts : ts; ------------------ | Branch (729:30): [True: 0, False: 0] ------------------ 730| 0| if (shift > BL) { ------------------ | Branch (730:21): [True: 0, False: 0] ------------------ 731| 0| tail->inc(); 732| 0| dec_inner(new_child, shift - B, size); 733| 0| } 734| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 735| 0| } 736| 5.97k| } 737| 5.97k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEJRjEEEPSC_OT_NSA_5applyIS7_E4type4editESJ_DpOT0_: 741| 1.18k| { 742| 1.18k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 1.18k, False: 0] ------------------ 743| 1.18k| auto node = pos.node(); 744| 1.18k| auto idx = pos.index(pos.size() - 1); 745| 1.18k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 1.18k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 1.18k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 1.18k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 1.18k] ------------------ 748| 0| node->inner()[new_idx] = 749| 0| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 0, False: 0] ------------------ 750| | /* otherwise */ 751| 0| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 0| return node; 753| 1.18k| } else { 754| 1.18k| auto new_parent = node_t::make_inner_e(e); 755| 1.18k| IMMER_TRY { ------------------ | | 49| 1.18k|#define IMMER_TRY try ------------------ 756| 1.18k| new_parent->inner()[new_idx] = 757| 1.18k| idx == new_idx ------------------ | Branch (757:21): [True: 749, False: 433] ------------------ 758| 1.18k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 1.18k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 1.18k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 1.18k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 1.18k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 1.18k| return new_parent; 765| 1.18k| } 766| 1.18k| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 1.18k| } 771| 1.18k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_: 741| 182k| { 742| 182k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 182k, False: 0] ------------------ 743| 182k| auto node = pos.node(); 744| 182k| auto idx = pos.index(pos.size() - 1); 745| 182k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 182k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 182k, Folded] | Branch (746:36): [True: 182k, False: 612] ------------------ 747| 182k| if (mutate) { ------------------ | Branch (747:13): [True: 182k, False: 612] ------------------ 748| 182k| node->inner()[new_idx] = 749| 182k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 173k, False: 8.39k] ------------------ 750| | /* otherwise */ 751| 182k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 182k| return node; 753| 182k| } else { 754| 612| auto new_parent = node_t::make_inner_e(e); 755| 612| IMMER_TRY { ------------------ | | 49| 612|#define IMMER_TRY try ------------------ 756| 612| new_parent->inner()[new_idx] = 757| 612| idx == new_idx ------------------ | Branch (757:21): [True: 307, False: 305] ------------------ 758| 612| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 612| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 612| node_t::do_copy_inner(new_parent, node, new_idx); 762| 612| if (Mutating) ------------------ | Branch (762:21): [True: 612, Folded] ------------------ 763| 612| pos.visit(dec_visitor{}); 764| 612| return new_parent; 765| 612| } 766| 612| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 612| } 771| 182k| } _ZN5immer6detail4rbts17dec_empty_regularINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEvPT_: 580| 2.16k|{ 581| 2.16k| make_empty_regular_pos(node).visit(dec_visitor()); 582| 2.16k|} _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_relaxedIRNS1_11relaxed_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 595| 97.6k| { 596| 97.6k| auto offset = pos.index(idx); 597| 97.6k| auto count = pos.count(); 598| 97.6k| auto node = pos.node(); 599| 97.6k| if (node->can_mutate(e)) { ------------------ | Branch (599:13): [True: 72.1k, False: 25.5k] ------------------ 600| 72.1k| return pos.towards_oh( 601| 72.1k| this_t{}, idx, offset, e, &node->inner()[offset]); 602| 72.1k| } else { 603| 25.5k| auto new_node = node_t::copy_inner_sr_e(e, node, count); 604| 25.5k| IMMER_TRY { ------------------ | | 49| 25.5k|#define IMMER_TRY try ------------------ 605| 25.5k| auto& res = pos.towards_oh( 606| 25.5k| this_t{}, idx, offset, e, &new_node->inner()[offset]); 607| 25.5k| pos.visit(dec_visitor{}); 608| 25.5k| *location = new_node; 609| 25.5k| return res; 610| 25.5k| } 611| 25.5k| IMMER_CATCH (...) { 612| 0| dec_relaxed(new_node, pos.shift()); 613| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 614| 0| } 615| 25.5k| } 616| 97.6k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_12leaf_sub_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 652| 14.8k| { 653| 14.8k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 14.8k, False: 0] ------------------ 654| 14.8k| auto node = pos.node(); 655| 14.8k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 1.73k, False: 13.1k] ------------------ 656| 1.73k| return node->leaf()[pos.index(idx)]; 657| 13.1k| } else { 658| 13.1k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 13.1k| pos.visit(dec_visitor{}); 660| 13.1k| *location = new_node; 661| 13.1k| return new_node->leaf()[pos.index(idx)]; 662| 13.1k| } 663| 14.8k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_regularIRNS1_15regular_sub_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 621| 4.66k| { 622| 4.66k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 4.66k, False: 0] ------------------ 623| 4.66k| auto offset = pos.index(idx); 624| 4.66k| auto count = pos.count(); 625| 4.66k| auto node = pos.node(); 626| 4.66k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 3.07k, False: 1.59k] ------------------ 627| 3.07k| return pos.towards_oh_ch( 628| 3.07k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 3.07k| } else { 630| 1.59k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.59k| IMMER_TRY { ------------------ | | 49| 1.59k|#define IMMER_TRY try ------------------ 632| 1.59k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.59k| idx, 634| 1.59k| offset, 635| 1.59k| count, 636| 1.59k| e, 637| 1.59k| &new_node->inner()[offset]); 638| 1.59k| pos.visit(dec_visitor{}); 639| 1.59k| *location = new_node; 640| 1.59k| return res; 641| 1.59k| } 642| 1.59k| IMMER_CATCH (...) { 643| 0| dec_regular(new_node, pos.shift(), pos.size()); 644| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 645| 0| } 646| 1.59k| } 647| 4.66k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_13full_leaf_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 652| 2.72k| { 653| 2.72k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 2.72k, False: 0] ------------------ 654| 2.72k| auto node = pos.node(); 655| 2.72k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 1.23k, False: 1.48k] ------------------ 656| 1.23k| return node->leaf()[pos.index(idx)]; 657| 1.48k| } else { 658| 1.48k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 1.48k| pos.visit(dec_visitor{}); 660| 1.48k| *location = new_node; 661| 1.48k| return new_node->leaf()[pos.index(idx)]; 662| 1.48k| } 663| 2.72k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_regularIRNS1_8full_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 621| 2.01k| { 622| 2.01k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 2.01k, False: 0] ------------------ 623| 2.01k| auto offset = pos.index(idx); 624| 2.01k| auto count = pos.count(); 625| 2.01k| auto node = pos.node(); 626| 2.01k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.11k, False: 901] ------------------ 627| 1.11k| return pos.towards_oh_ch( 628| 1.11k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.11k| } else { 630| 901| auto new_node = node_t::copy_inner_e(e, node, count); 631| 901| IMMER_TRY { ------------------ | | 49| 901|#define IMMER_TRY try ------------------ 632| 901| auto& res = pos.towards_oh_ch(this_t{}, 633| 901| idx, 634| 901| offset, 635| 901| count, 636| 901| e, 637| 901| &new_node->inner()[offset]); 638| 901| pos.visit(dec_visitor{}); 639| 901| *location = new_node; 640| 901| return res; 641| 901| } 642| 901| IMMER_CATCH (...) { 643| 0| dec_regular(new_node, pos.shift(), pos.size()); 644| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 645| 0| } 646| 901| } 647| 2.01k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10visit_leafIRNS1_8leaf_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 652| 1.94k| { 653| 1.94k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 1.94k, False: 0] ------------------ 654| 1.94k| auto node = pos.node(); 655| 1.94k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 1.38k, False: 557] ------------------ 656| 1.38k| return node->leaf()[pos.index(idx)]; 657| 1.38k| } else { 658| 557| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 557| pos.visit(dec_visitor{}); 660| 557| *location = new_node; 661| 557| return new_node->leaf()[pos.index(idx)]; 662| 557| } 663| 1.94k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13visit_regularIRNS1_11regular_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 621| 1.60k| { 622| 1.60k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 1.60k, False: 0] ------------------ 623| 1.60k| auto offset = pos.index(idx); 624| 1.60k| auto count = pos.count(); 625| 1.60k| auto node = pos.node(); 626| 1.60k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.39k, False: 207] ------------------ 627| 1.39k| return pos.towards_oh_ch( 628| 1.39k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.39k| } else { 630| 207| auto new_node = node_t::copy_inner_e(e, node, count); 631| 207| IMMER_TRY { ------------------ | | 49| 207|#define IMMER_TRY try ------------------ 632| 207| auto& res = pos.towards_oh_ch(this_t{}, 633| 207| idx, 634| 207| offset, 635| 207| count, 636| 207| e, 637| 207| &new_node->inner()[offset]); 638| 207| pos.visit(dec_visitor{}); 639| 207| *location = new_node; 640| 207| return res; 641| 207| } 642| 207| IMMER_CATCH (...) { 643| 0| dec_regular(new_node, pos.shift(), pos.size()); 644| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 645| 0| } 646| 207| } 647| 1.60k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 913| 37.5k| { 914| 37.5k| auto idx = pos.index(last); 915| 37.5k| auto node = pos.node(); 916| 37.5k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 37.5k, Folded] | Branch (916:35): [True: 29.4k, False: 8.12k] ------------------ 917| 37.5k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 37.5k, Folded] | Branch (917:25): [True: 24.6k, False: 12.9k] ------------------ 918| 24.6k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 21.0k, False: 3.52k] ------------------ 919| 24.6k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 24.6k| if (Mutating) ------------------ | Branch (920:17): [True: 24.6k, Folded] ------------------ 921| 24.6k| pos.visit(dec_right_visitor{}, count_t{1}); 922| 24.6k| return res; 923| 24.6k| } else { 924| 12.9k| using std::get; 925| 12.9k| auto subs = 926| 12.9k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 8.31k, False: 4.59k] ------------------ 927| 12.9k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 12.9k| auto next = get<1>(subs); 929| 12.9k| auto ts = get<2>(subs); 930| 12.9k| auto tail = get<3>(subs); 931| 12.9k| IMMER_TRY { ------------------ | | 49| 12.9k|#define IMMER_TRY try ------------------ 932| 12.9k| if (next) { ------------------ | Branch (932:21): [True: 9.25k, False: 3.66k] ------------------ 933| 9.25k| if (mutate) { ------------------ | Branch (933:25): [True: 6.01k, False: 3.24k] ------------------ 934| 6.01k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 6.01k| pos.each_right(dec_visitor{}, idx + 1); 936| 6.01k| node->inner()[idx] = next; 937| 6.01k| nodr->d.sizes[idx] = last + 1 - ts; 938| 6.01k| nodr->d.count = idx + 1; 939| 6.01k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 6.01k, False: 0] ------------------ 940| 6.01k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 6.01k| } else { 942| 3.24k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 3.24k| auto newr = newn->relaxed(); 944| 3.24k| newn->inner()[idx] = next; 945| 3.24k| newr->d.sizes[idx] = last + 1 - ts; 946| 3.24k| newr->d.count = idx + 1; 947| 3.24k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 3.24k, False: 0] ------------------ 948| 3.24k| if (Mutating) ------------------ | Branch (948:29): [True: 3.24k, Folded] ------------------ 949| 3.24k| pos.visit(dec_visitor{}); 950| 3.24k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 3.24k| } 952| 9.25k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 3.66k] ------------------ 953| 0| if (Mutating) ------------------ | Branch (953:25): [True: 0, Folded] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 3.66k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 3.66k, Folded] | Branch (956:40): [True: 2.75k, False: 910] | Branch (956:52): [True: 2.12k, False: 636] ------------------ 957| 2.12k| auto newn = pos.node()->inner()[0]; 958| 2.12k| if (!mutate) ------------------ | Branch (958:25): [True: 891, False: 1.22k] ------------------ 959| 891| newn->inc(); 960| 2.12k| if (Mutating) ------------------ | Branch (960:25): [True: 2.12k, Folded] ------------------ 961| 2.12k| pos.visit(dec_right_visitor{}, count_t{2}); 962| 2.12k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 2.12k| } else { 964| 1.54k| if (mutate) { ------------------ | Branch (964:25): [True: 1.07k, False: 467] ------------------ 965| 1.07k| pos.each_right(dec_visitor{}, idx + 1); 966| 1.07k| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 1.07k| return std::make_tuple(pos.shift(), node, ts, tail); 968| 1.07k| } else { 969| 467| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 467| if (Mutating) ------------------ | Branch (970:29): [True: 467, Folded] ------------------ 971| 467| pos.visit(dec_visitor{}); 972| 467| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 467| } 974| 1.54k| } 975| 12.9k| } 976| 12.9k| IMMER_CATCH (...) { 977| 0| assert(!mutate); ------------------ | Branch (977:17): [True: 0, False: 0] ------------------ 978| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] ------------------ 979| 0| if (next) ------------------ | Branch (979:21): [True: 0, False: 0] ------------------ 980| 0| dec_inner(next, 981| 0| pos.shift() - B, 982| 0| last + 1 - ts - pos.size_before(idx)); 983| 0| dec_leaf(tail, ts); 984| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 985| 0| } 986| 12.9k| } 987| 37.5k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 983| { 1060| 983| auto old_tail_size = pos.count(); 1061| 983| auto new_tail_size = pos.index(last) + 1; 1062| 983| auto node = pos.node(); 1063| 983| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 983, Folded] | Branch (1063:42): [True: 336, False: 647] ------------------ 1064| 983| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 220, False: 763] ------------------ 1065| 220| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 220] ------------------ 1066| 0| node->inc(); 1067| 220| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 763| } else if (mutate) { ------------------ | Branch (1068:20): [True: 320, False: 443] ------------------ 1069| 320| detail::destroy_n(node->leaf() + new_tail_size, 1070| 320| old_tail_size - new_tail_size); 1071| 320| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 443| } else { 1073| 443| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 443| if (Mutating) ------------------ | Branch (1074:17): [True: 443, Folded] ------------------ 1075| 443| pos.visit(dec_visitor{}); 1076| 443| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 443| } 1078| 983| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 751| { 1060| 751| auto old_tail_size = pos.count(); 1061| 751| auto new_tail_size = pos.index(last) + 1; 1062| 751| auto node = pos.node(); 1063| 751| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 751] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 751| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 356, False: 395] ------------------ 1065| 356| if (!Mutating) ------------------ | Branch (1065:17): [True: 356, Folded] ------------------ 1066| 356| node->inc(); 1067| 356| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 395| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 395] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 395| } else { 1073| 395| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 395| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 395] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 395| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 395| } 1078| 751| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 913| 9.23k| { 914| 9.23k| auto idx = pos.index(last); 915| 9.23k| auto node = pos.node(); 916| 9.23k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 9.23k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 9.23k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 9.23k, Folded] | Branch (917:25): [True: 7.76k, False: 1.47k] ------------------ 918| 7.76k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 0, False: 7.76k] ------------------ 919| 7.76k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 7.76k| if (Mutating) ------------------ | Branch (920:17): [Folded, False: 7.76k] ------------------ 921| 0| pos.visit(dec_right_visitor{}, count_t{1}); 922| 7.76k| return res; 923| 7.76k| } else { 924| 1.47k| using std::get; 925| 1.47k| auto subs = 926| 1.47k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 1.47k] ------------------ 927| 1.47k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 1.47k| auto next = get<1>(subs); 929| 1.47k| auto ts = get<2>(subs); 930| 1.47k| auto tail = get<3>(subs); 931| 1.47k| IMMER_TRY { ------------------ | | 49| 1.47k|#define IMMER_TRY try ------------------ 932| 1.47k| if (next) { ------------------ | Branch (932:21): [True: 520, False: 957] ------------------ 933| 520| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 520] ------------------ 934| 0| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 0| pos.each_right(dec_visitor{}, idx + 1); 936| 0| node->inner()[idx] = next; 937| 0| nodr->d.sizes[idx] = last + 1 - ts; 938| 0| nodr->d.count = idx + 1; 939| 0| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 0, False: 0] ------------------ 940| 0| return std::make_tuple(pos.shift(), node, ts, tail); 941| 520| } else { 942| 520| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 520| auto newr = newn->relaxed(); 944| 520| newn->inner()[idx] = next; 945| 520| newr->d.sizes[idx] = last + 1 - ts; 946| 520| newr->d.count = idx + 1; 947| 520| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 520, False: 0] ------------------ 948| 520| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 520] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 520| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 520| } 952| 957| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 957] ------------------ 953| 0| if (Mutating) ------------------ | Branch (953:25): [Folded, False: 0] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 957| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 957, Folded] | Branch (956:40): [True: 593, False: 364] | Branch (956:52): [True: 296, False: 297] ------------------ 957| 296| auto newn = pos.node()->inner()[0]; 958| 296| if (!mutate) ------------------ | Branch (958:25): [True: 296, False: 0] ------------------ 959| 296| newn->inc(); 960| 296| if (Mutating) ------------------ | Branch (960:25): [Folded, False: 296] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 296| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 661| } else { 964| 661| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 661] ------------------ 965| 0| pos.each_right(dec_visitor{}, idx + 1); 966| 0| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 0| return std::make_tuple(pos.shift(), node, ts, tail); 968| 661| } else { 969| 661| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 661| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 661] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 661| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 661| } 974| 661| } 975| 1.47k| } 976| 1.47k| IMMER_CATCH (...) { 977| 0| assert(!mutate); ------------------ | Branch (977:17): [True: 0, False: 0] ------------------ 978| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] ------------------ 979| 0| if (next) ------------------ | Branch (979:21): [True: 0, False: 0] ------------------ 980| 0| dec_inner(next, 981| 0| pos.shift() - B, 982| 0| last + 1 - ts - pos.size_before(idx)); 983| 0| dec_leaf(tail, ts); 984| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 985| 0| } 986| 1.47k| } 987| 9.23k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 1.29k| { 992| 1.29k| auto idx = pos.index(last); 993| 1.29k| auto node = pos.node(); 994| 1.29k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.29k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.29k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.29k, Folded] | Branch (995:25): [True: 388, False: 911] ------------------ 996| 388| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 388] ------------------ 997| 388| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 388| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 388] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 388| return res; 1001| 911| } else { 1002| 911| using std::get; 1003| 911| auto subs = 1004| 911| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 911] ------------------ 1005| 911| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 911| auto next = get<1>(subs); 1007| 911| auto ts = get<2>(subs); 1008| 911| auto tail = get<3>(subs); 1009| 911| IMMER_TRY { ------------------ | | 49| 911|#define IMMER_TRY try ------------------ 1010| 911| if (next) { ------------------ | Branch (1010:21): [True: 264, False: 647] ------------------ 1011| 264| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 264] ------------------ 1012| 0| node->inner()[idx] = next; 1013| 0| pos.each_right(dec_visitor{}, idx + 1); 1014| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 264| } else { 1016| 264| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 264| newn->inner()[idx] = next; 1018| 264| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 264] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 264| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 264| } 1022| 647| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 647] ------------------ 1023| 0| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 0] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 647| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 647, Folded] | Branch (1026:40): [True: 391, False: 256] | Branch (1026:52): [True: 194, False: 197] ------------------ 1027| 194| auto newn = pos.node()->inner()[0]; 1028| 194| if (!mutate) ------------------ | Branch (1028:25): [True: 194, False: 0] ------------------ 1029| 194| newn->inc(); 1030| 194| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 194] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 194| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 453| } else { 1034| 453| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 453] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 453| } else { 1038| 453| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 453| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 453] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 453| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 453| } 1043| 453| } 1044| 911| } 1045| 911| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 911| } 1055| 1.29k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 1.99k| { 1060| 1.99k| auto old_tail_size = pos.count(); 1061| 1.99k| auto new_tail_size = pos.index(last) + 1; 1062| 1.99k| auto node = pos.node(); 1063| 1.99k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 1.99k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 1.99k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.31k, False: 676] ------------------ 1065| 1.31k| if (!Mutating) ------------------ | Branch (1065:17): [True: 1.31k, Folded] ------------------ 1066| 1.31k| node->inc(); 1067| 1.31k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.31k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 676] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 676| } else { 1073| 676| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 676| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 676] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 676| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 676| } 1078| 1.99k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 1.75k| { 992| 1.75k| auto idx = pos.index(last); 993| 1.75k| auto node = pos.node(); 994| 1.75k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.75k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.75k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.75k, Folded] | Branch (995:25): [True: 831, False: 926] ------------------ 996| 831| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 831] ------------------ 997| 831| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 831| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 831] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 831| return res; 1001| 926| } else { 1002| 926| using std::get; 1003| 926| auto subs = 1004| 926| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 926] ------------------ 1005| 926| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 926| auto next = get<1>(subs); 1007| 926| auto ts = get<2>(subs); 1008| 926| auto tail = get<3>(subs); 1009| 926| IMMER_TRY { ------------------ | | 49| 926|#define IMMER_TRY try ------------------ 1010| 926| if (next) { ------------------ | Branch (1010:21): [True: 268, False: 658] ------------------ 1011| 268| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 268] ------------------ 1012| 0| node->inner()[idx] = next; 1013| 0| pos.each_right(dec_visitor{}, idx + 1); 1014| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 268| } else { 1016| 268| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 268| newn->inner()[idx] = next; 1018| 268| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 268] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 268| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 268| } 1022| 658| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 658] ------------------ 1023| 0| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 0] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 658| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 658, Folded] | Branch (1026:40): [True: 396, False: 262] | Branch (1026:52): [True: 201, False: 195] ------------------ 1027| 201| auto newn = pos.node()->inner()[0]; 1028| 201| if (!mutate) ------------------ | Branch (1028:25): [True: 201, False: 0] ------------------ 1029| 201| newn->inc(); 1030| 201| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 201] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 201| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 457| } else { 1034| 457| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 457] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 457| } else { 1038| 457| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 457| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 457] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 457| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 457| } 1043| 457| } 1044| 926| } 1045| 926| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 926| } 1055| 1.75k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 3.24k| { 1060| 3.24k| auto old_tail_size = pos.count(); 1061| 3.24k| auto new_tail_size = pos.index(last) + 1; 1062| 3.24k| auto node = pos.node(); 1063| 3.24k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 3.24k, Folded] | Branch (1063:42): [True: 266, False: 2.98k] ------------------ 1064| 3.24k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.49k, False: 1.75k] ------------------ 1065| 1.49k| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 1.49k] ------------------ 1066| 0| node->inc(); 1067| 1.49k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.75k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 262, False: 1.49k] ------------------ 1069| 262| detail::destroy_n(node->leaf() + new_tail_size, 1070| 262| old_tail_size - new_tail_size); 1071| 262| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.49k| } else { 1073| 1.49k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.49k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.49k, Folded] ------------------ 1075| 1.49k| pos.visit(dec_visitor{}); 1076| 1.49k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.49k| } 1078| 3.24k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 3.37k| { 992| 3.37k| auto idx = pos.index(last); 993| 3.37k| auto node = pos.node(); 994| 3.37k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.37k, Folded] | Branch (994:35): [True: 1.39k, False: 1.97k] ------------------ 995| 3.37k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.37k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [True: 0, Folded] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 3.37k| } else { 1002| 3.37k| using std::get; 1003| 3.37k| auto subs = 1004| 3.37k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 1.39k, False: 1.97k] ------------------ 1005| 3.37k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.37k| auto next = get<1>(subs); 1007| 3.37k| auto ts = get<2>(subs); 1008| 3.37k| auto tail = get<3>(subs); 1009| 3.37k| IMMER_TRY { ------------------ | | 49| 3.37k|#define IMMER_TRY try ------------------ 1010| 3.37k| if (next) { ------------------ | Branch (1010:21): [True: 927, False: 2.45k] ------------------ 1011| 927| if (mutate) { ------------------ | Branch (1011:25): [True: 398, False: 529] ------------------ 1012| 398| node->inner()[idx] = next; 1013| 398| pos.each_right(dec_visitor{}, idx + 1); 1014| 398| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 529| } else { 1016| 529| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 529| newn->inner()[idx] = next; 1018| 529| if (Mutating) ------------------ | Branch (1018:29): [True: 529, Folded] ------------------ 1019| 529| pos.visit(dec_visitor{}); 1020| 529| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 529| } 1022| 2.45k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 871, False: 1.57k] ------------------ 1023| 871| if (Mutating) ------------------ | Branch (1023:25): [True: 871, Folded] ------------------ 1024| 871| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 871| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.57k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.57k] | Branch (1026:40): [True: 0, False: 0] | Branch (1026:52): [True: 0, False: 0] ------------------ 1027| 0| auto newn = pos.node()->inner()[0]; 1028| 0| if (!mutate) ------------------ | Branch (1028:25): [True: 0, False: 0] ------------------ 1029| 0| newn->inc(); 1030| 0| if (Mutating) ------------------ | Branch (1030:25): [True: 0, Folded] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 1.57k| } else { 1034| 1.57k| if (mutate) { ------------------ | Branch (1034:25): [True: 380, False: 1.19k] ------------------ 1035| 380| pos.each_right(dec_visitor{}, idx + 1); 1036| 380| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.19k| } else { 1038| 1.19k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.19k| if (Mutating) ------------------ | Branch (1039:29): [True: 1.19k, Folded] ------------------ 1040| 1.19k| pos.visit(dec_visitor{}); 1041| 1.19k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.19k| } 1043| 1.57k| } 1044| 3.37k| } 1045| 3.37k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 3.37k| } 1055| 3.37k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 878| 3.32k| { 879| 3.32k| using node_t = node_type; 880| 3.32k| auto node = p.node(); 881| 3.32k| if (node->dec()) { ------------------ | Branch (881:13): [True: 2.05k, False: 1.27k] ------------------ 882| 2.05k| p.each_right(dec_t{}, idx); 883| 2.05k| node_t::delete_inner(node, p.count()); 884| 2.05k| } 885| 3.32k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 9.34k| { 1060| 9.34k| auto old_tail_size = pos.count(); 1061| 9.34k| auto new_tail_size = pos.index(last) + 1; 1062| 9.34k| auto node = pos.node(); 1063| 9.34k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 9.34k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 9.34k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 3.39k, False: 5.95k] ------------------ 1065| 3.39k| if (!Mutating) ------------------ | Branch (1065:17): [True: 3.39k, Folded] ------------------ 1066| 3.39k| node->inc(); 1067| 3.39k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 5.95k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 5.95k] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 5.95k| } else { 1073| 5.95k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 5.95k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 5.95k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 5.95k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 5.95k| } 1078| 9.34k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 5.25k| { 992| 5.25k| auto idx = pos.index(last); 993| 5.25k| auto node = pos.node(); 994| 5.25k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 5.25k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 5.25k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 5.25k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 0] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 5.25k| } else { 1002| 5.25k| using std::get; 1003| 5.25k| auto subs = 1004| 5.25k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 5.25k] ------------------ 1005| 5.25k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 5.25k| auto next = get<1>(subs); 1007| 5.25k| auto ts = get<2>(subs); 1008| 5.25k| auto tail = get<3>(subs); 1009| 5.25k| IMMER_TRY { ------------------ | | 49| 5.25k|#define IMMER_TRY try ------------------ 1010| 5.25k| if (next) { ------------------ | Branch (1010:21): [True: 697, False: 4.55k] ------------------ 1011| 697| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 697] ------------------ 1012| 0| node->inner()[idx] = next; 1013| 0| pos.each_right(dec_visitor{}, idx + 1); 1014| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 697| } else { 1016| 697| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 697| newn->inner()[idx] = next; 1018| 697| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 697] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 697| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 697| } 1022| 4.55k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 932, False: 3.62k] ------------------ 1023| 932| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 932] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 932| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 3.62k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 3.62k] | Branch (1026:40): [True: 0, False: 0] | Branch (1026:52): [True: 0, False: 0] ------------------ 1027| 0| auto newn = pos.node()->inner()[0]; 1028| 0| if (!mutate) ------------------ | Branch (1028:25): [True: 0, False: 0] ------------------ 1029| 0| newn->inc(); 1030| 0| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 0] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 3.62k| } else { 1034| 3.62k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 3.62k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 3.62k| } else { 1038| 3.62k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 3.62k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 3.62k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 3.62k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 3.62k| } 1043| 3.62k| } 1044| 5.25k| } 1045| 5.25k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 5.25k| } 1055| 5.25k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb0EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 412| { 1060| 412| auto old_tail_size = pos.count(); 1061| 412| auto new_tail_size = pos.index(last) + 1; 1062| 412| auto node = pos.node(); 1063| 412| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 412] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 412| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 194, False: 218] ------------------ 1065| 194| if (!Mutating) ------------------ | Branch (1065:17): [True: 194, Folded] ------------------ 1066| 194| node->inc(); 1067| 194| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 218| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 218] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 218| } else { 1073| 218| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 218| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 218] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 218| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 218| } 1078| 412| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 1.54k| { 1060| 1.54k| auto old_tail_size = pos.count(); 1061| 1.54k| auto new_tail_size = pos.index(last) + 1; 1062| 1.54k| auto node = pos.node(); 1063| 1.54k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.54k, Folded] | Branch (1063:42): [True: 218, False: 1.32k] ------------------ 1064| 1.54k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 380, False: 1.16k] ------------------ 1065| 380| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 380] ------------------ 1066| 0| node->inc(); 1067| 380| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.16k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 218, False: 946] ------------------ 1069| 218| detail::destroy_n(node->leaf() + new_tail_size, 1070| 218| old_tail_size - new_tail_size); 1071| 218| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 946| } else { 1073| 946| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 946| if (Mutating) ------------------ | Branch (1074:17): [True: 946, Folded] ------------------ 1075| 946| pos.visit(dec_visitor{}); 1076| 946| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 946| } 1078| 1.54k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE13visit_regularIRNS1_11regular_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 3.49k| { 992| 3.49k| auto idx = pos.index(last); 993| 3.49k| auto node = pos.node(); 994| 3.49k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.49k, Folded] | Branch (994:35): [True: 2.58k, False: 917] ------------------ 995| 3.49k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.49k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [True: 0, Folded] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 3.49k| } else { 1002| 3.49k| using std::get; 1003| 3.49k| auto subs = 1004| 3.49k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 2.58k, False: 917] ------------------ 1005| 3.49k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.49k| auto next = get<1>(subs); 1007| 3.49k| auto ts = get<2>(subs); 1008| 3.49k| auto tail = get<3>(subs); 1009| 3.49k| IMMER_TRY { ------------------ | | 49| 3.49k|#define IMMER_TRY try ------------------ 1010| 3.49k| if (next) { ------------------ | Branch (1010:21): [True: 1.40k, False: 2.09k] ------------------ 1011| 1.40k| if (mutate) { ------------------ | Branch (1011:25): [True: 943, False: 459] ------------------ 1012| 943| node->inner()[idx] = next; 1013| 943| pos.each_right(dec_visitor{}, idx + 1); 1014| 943| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 943| } else { 1016| 459| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 459| newn->inner()[idx] = next; 1018| 459| if (Mutating) ------------------ | Branch (1018:29): [True: 459, Folded] ------------------ 1019| 459| pos.visit(dec_visitor{}); 1020| 459| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 459| } 1022| 2.09k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.46k, False: 635] ------------------ 1023| 1.46k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.46k, Folded] ------------------ 1024| 1.46k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.46k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.46k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 635] | Branch (1026:40): [True: 0, False: 0] | Branch (1026:52): [True: 0, False: 0] ------------------ 1027| 0| auto newn = pos.node()->inner()[0]; 1028| 0| if (!mutate) ------------------ | Branch (1028:25): [True: 0, False: 0] ------------------ 1029| 0| newn->inc(); 1030| 0| if (Mutating) ------------------ | Branch (1030:25): [True: 0, Folded] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 635| } else { 1034| 635| if (mutate) { ------------------ | Branch (1034:25): [True: 380, False: 255] ------------------ 1035| 380| pos.each_right(dec_visitor{}, idx + 1); 1036| 380| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 380| } else { 1038| 255| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 255| if (Mutating) ------------------ | Branch (1039:29): [True: 255, Folded] ------------------ 1040| 255| pos.visit(dec_visitor{}); 1041| 255| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 255| } 1043| 635| } 1044| 3.49k| } 1045| 3.49k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 3.49k| } 1055| 3.49k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 878| 1.46k| { 879| 1.46k| using node_t = node_type; 880| 1.46k| auto node = p.node(); 881| 1.46k| if (node->dec()) { ------------------ | Branch (881:13): [True: 1.25k, False: 203] ------------------ 882| 1.25k| p.each_right(dec_t{}, idx); 883| 1.25k| node_t::delete_inner(node, p.count()); 884| 1.25k| } 885| 1.46k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 2.59k| { 1060| 2.59k| auto old_tail_size = pos.count(); 1061| 2.59k| auto new_tail_size = pos.index(last) + 1; 1062| 2.59k| auto node = pos.node(); 1063| 2.59k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 2.59k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 2.59k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 539, False: 2.05k] ------------------ 1065| 539| if (!Mutating) ------------------ | Branch (1065:17): [True: 539, Folded] ------------------ 1066| 539| node->inc(); 1067| 539| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 2.05k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 2.05k] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 2.05k| } else { 1073| 2.05k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 2.05k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 2.05k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 2.05k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 2.05k| } 1078| 2.59k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE13visit_regularIRNS1_11regular_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 3.29k| { 992| 3.29k| auto idx = pos.index(last); 993| 3.29k| auto node = pos.node(); 994| 3.29k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.29k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.29k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.29k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 0] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 3.29k| } else { 1002| 3.29k| using std::get; 1003| 3.29k| auto subs = 1004| 3.29k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.29k] ------------------ 1005| 3.29k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.29k| auto next = get<1>(subs); 1007| 3.29k| auto ts = get<2>(subs); 1008| 3.29k| auto tail = get<3>(subs); 1009| 3.29k| IMMER_TRY { ------------------ | | 49| 3.29k|#define IMMER_TRY try ------------------ 1010| 3.29k| if (next) { ------------------ | Branch (1010:21): [True: 912, False: 2.38k] ------------------ 1011| 912| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 912] ------------------ 1012| 0| node->inner()[idx] = next; 1013| 0| pos.each_right(dec_visitor{}, idx + 1); 1014| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 912| } else { 1016| 912| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 912| newn->inner()[idx] = next; 1018| 912| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 912] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 912| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 912| } 1022| 2.38k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 836, False: 1.54k] ------------------ 1023| 836| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 836] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 836| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.54k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.54k] | Branch (1026:40): [True: 0, False: 0] | Branch (1026:52): [True: 0, False: 0] ------------------ 1027| 0| auto newn = pos.node()->inner()[0]; 1028| 0| if (!mutate) ------------------ | Branch (1028:25): [True: 0, False: 0] ------------------ 1029| 0| newn->inc(); 1030| 0| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 0] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 1.54k| } else { 1034| 1.54k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 1.54k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.54k| } else { 1038| 1.54k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.54k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 1.54k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 1.54k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.54k| } 1043| 1.54k| } 1044| 3.29k| } 1045| 3.29k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 3.29k| } 1055| 3.29k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 867| 27.3k| { 868| 27.3k| using node_t = node_type; 869| 27.3k| auto node = p.node(); 870| 27.3k| if (node->dec()) { ------------------ | Branch (870:13): [True: 22.5k, False: 4.74k] ------------------ 871| 22.5k| p.each_right(dec_t{}, idx); 872| 22.5k| node_t::delete_inner_r(node, p.count()); 873| 22.5k| } 874| 27.3k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 1.98k| { 1060| 1.98k| auto old_tail_size = pos.count(); 1061| 1.98k| auto new_tail_size = pos.index(last) + 1; 1062| 1.98k| auto node = pos.node(); 1063| 1.98k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.98k, Folded] | Branch (1063:42): [True: 334, False: 1.65k] ------------------ 1064| 1.98k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 482, False: 1.50k] ------------------ 1065| 482| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 482] ------------------ 1066| 0| node->inc(); 1067| 482| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.50k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 301, False: 1.20k] ------------------ 1069| 301| detail::destroy_n(node->leaf() + new_tail_size, 1070| 301| old_tail_size - new_tail_size); 1071| 301| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.20k| } else { 1073| 1.20k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.20k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.20k, Folded] ------------------ 1075| 1.20k| pos.visit(dec_visitor{}); 1076| 1.20k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.20k| } 1078| 1.98k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 913| 3.06k| { 914| 3.06k| auto idx = pos.index(last); 915| 3.06k| auto node = pos.node(); 916| 3.06k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 3.06k, Folded] | Branch (916:35): [True: 1.66k, False: 1.40k] ------------------ 917| 3.06k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 3.06k] | Branch (917:25): [True: 0, False: 0] ------------------ 918| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 0, False: 0] ------------------ 919| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 0| if (Mutating) ------------------ | Branch (920:17): [True: 0, Folded] ------------------ 921| 0| pos.visit(dec_right_visitor{}, count_t{1}); 922| 0| return res; 923| 3.06k| } else { 924| 3.06k| using std::get; 925| 3.06k| auto subs = 926| 3.06k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 1.66k, False: 1.40k] ------------------ 927| 3.06k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 3.06k| auto next = get<1>(subs); 929| 3.06k| auto ts = get<2>(subs); 930| 3.06k| auto tail = get<3>(subs); 931| 3.06k| IMMER_TRY { ------------------ | | 49| 3.06k|#define IMMER_TRY try ------------------ 932| 3.06k| if (next) { ------------------ | Branch (932:21): [True: 910, False: 2.15k] ------------------ 933| 910| if (mutate) { ------------------ | Branch (933:25): [True: 459, False: 451] ------------------ 934| 459| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 459| pos.each_right(dec_visitor{}, idx + 1); 936| 459| node->inner()[idx] = next; 937| 459| nodr->d.sizes[idx] = last + 1 - ts; 938| 459| nodr->d.count = idx + 1; 939| 459| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 459, False: 0] ------------------ 940| 459| return std::make_tuple(pos.shift(), node, ts, tail); 941| 459| } else { 942| 451| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 451| auto newr = newn->relaxed(); 944| 451| newn->inner()[idx] = next; 945| 451| newr->d.sizes[idx] = last + 1 - ts; 946| 451| newr->d.count = idx + 1; 947| 451| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 451, False: 0] ------------------ 948| 451| if (Mutating) ------------------ | Branch (948:29): [True: 451, Folded] ------------------ 949| 451| pos.visit(dec_visitor{}); 950| 451| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 451| } 952| 2.15k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 603, False: 1.55k] ------------------ 953| 603| if (Mutating) ------------------ | Branch (953:25): [True: 603, Folded] ------------------ 954| 603| pos.visit(dec_right_visitor{}, count_t{1}); 955| 603| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 1.55k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 1.55k] | Branch (956:40): [True: 0, False: 0] | Branch (956:52): [True: 0, False: 0] ------------------ 957| 0| auto newn = pos.node()->inner()[0]; 958| 0| if (!mutate) ------------------ | Branch (958:25): [True: 0, False: 0] ------------------ 959| 0| newn->inc(); 960| 0| if (Mutating) ------------------ | Branch (960:25): [True: 0, Folded] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 1.55k| } else { 964| 1.55k| if (mutate) { ------------------ | Branch (964:25): [True: 934, False: 621] ------------------ 965| 934| pos.each_right(dec_visitor{}, idx + 1); 966| 934| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 934| return std::make_tuple(pos.shift(), node, ts, tail); 968| 934| } else { 969| 621| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 621| if (Mutating) ------------------ | Branch (970:29): [True: 621, Folded] ------------------ 971| 621| pos.visit(dec_visitor{}); 972| 621| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 621| } 974| 1.55k| } 975| 3.06k| } 976| 3.06k| IMMER_CATCH (...) { 977| 0| assert(!mutate); ------------------ | Branch (977:17): [True: 0, False: 0] ------------------ 978| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] ------------------ 979| 0| if (next) ------------------ | Branch (979:21): [True: 0, False: 0] ------------------ 980| 0| dec_inner(next, 981| 0| pos.shift() - B, 982| 0| last + 1 - ts - pos.size_before(idx)); 983| 0| dec_leaf(tail, ts); 984| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 985| 0| } 986| 3.06k| } 987| 3.06k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 4.93k| { 992| 4.93k| auto idx = pos.index(last); 993| 4.93k| auto node = pos.node(); 994| 4.93k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 4.93k, Folded] | Branch (994:35): [True: 3.61k, False: 1.31k] ------------------ 995| 4.93k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 4.93k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [True: 0, Folded] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 4.93k| } else { 1002| 4.93k| using std::get; 1003| 4.93k| auto subs = 1004| 4.93k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.61k, False: 1.31k] ------------------ 1005| 4.93k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 4.93k| auto next = get<1>(subs); 1007| 4.93k| auto ts = get<2>(subs); 1008| 4.93k| auto tail = get<3>(subs); 1009| 4.93k| IMMER_TRY { ------------------ | | 49| 4.93k|#define IMMER_TRY try ------------------ 1010| 4.93k| if (next) { ------------------ | Branch (1010:21): [True: 3.30k, False: 1.62k] ------------------ 1011| 3.30k| if (mutate) { ------------------ | Branch (1011:25): [True: 2.61k, False: 689] ------------------ 1012| 2.61k| node->inner()[idx] = next; 1013| 2.61k| pos.each_right(dec_visitor{}, idx + 1); 1014| 2.61k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 2.61k| } else { 1016| 689| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 689| newn->inner()[idx] = next; 1018| 689| if (Mutating) ------------------ | Branch (1018:29): [True: 689, Folded] ------------------ 1019| 689| pos.visit(dec_visitor{}); 1020| 689| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 689| } 1022| 3.30k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 927, False: 701] ------------------ 1023| 927| if (Mutating) ------------------ | Branch (1023:25): [True: 927, Folded] ------------------ 1024| 927| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 927| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 927| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 701] | Branch (1026:40): [True: 0, False: 0] | Branch (1026:52): [True: 0, False: 0] ------------------ 1027| 0| auto newn = pos.node()->inner()[0]; 1028| 0| if (!mutate) ------------------ | Branch (1028:25): [True: 0, False: 0] ------------------ 1029| 0| newn->inc(); 1030| 0| if (Mutating) ------------------ | Branch (1030:25): [True: 0, Folded] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 701| } else { 1034| 701| if (mutate) { ------------------ | Branch (1034:25): [True: 337, False: 364] ------------------ 1035| 337| pos.each_right(dec_visitor{}, idx + 1); 1036| 337| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 364| } else { 1038| 364| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 364| if (Mutating) ------------------ | Branch (1039:29): [True: 364, Folded] ------------------ 1040| 364| pos.visit(dec_visitor{}); 1041| 364| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 364| } 1043| 701| } 1044| 4.93k| } 1045| 4.93k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 4.93k| } 1055| 4.93k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 878| 10.5k| { 879| 10.5k| using node_t = node_type; 880| 10.5k| auto node = p.node(); 881| 10.5k| if (node->dec()) { ------------------ | Branch (881:13): [True: 7.41k, False: 3.15k] ------------------ 882| 7.41k| p.each_right(dec_t{}, idx); 883| 7.41k| node_t::delete_inner(node, p.count()); 884| 7.41k| } 885| 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: 1059| 4.31k| { 1060| 4.31k| auto old_tail_size = pos.count(); 1061| 4.31k| auto new_tail_size = pos.index(last) + 1; 1062| 4.31k| auto node = pos.node(); 1063| 4.31k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 4.31k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 4.31k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 458, False: 3.85k] ------------------ 1065| 458| if (!Mutating) ------------------ | Branch (1065:17): [True: 458, Folded] ------------------ 1066| 458| node->inc(); 1067| 458| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 3.85k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 3.85k] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 3.85k| } else { 1073| 3.85k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 3.85k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 3.85k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 3.85k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 3.85k| } 1078| 4.31k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 913| 3.38k| { 914| 3.38k| auto idx = pos.index(last); 915| 3.38k| auto node = pos.node(); 916| 3.38k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 3.38k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 3.38k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 3.38k] | Branch (917:25): [True: 0, False: 0] ------------------ 918| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 0, False: 0] ------------------ 919| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 0| if (Mutating) ------------------ | Branch (920:17): [Folded, False: 0] ------------------ 921| 0| pos.visit(dec_right_visitor{}, count_t{1}); 922| 0| return res; 923| 3.38k| } else { 924| 3.38k| using std::get; 925| 3.38k| auto subs = 926| 3.38k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 3.38k] ------------------ 927| 3.38k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 3.38k| auto next = get<1>(subs); 929| 3.38k| auto ts = get<2>(subs); 930| 3.38k| auto tail = get<3>(subs); 931| 3.38k| IMMER_TRY { ------------------ | | 49| 3.38k|#define IMMER_TRY try ------------------ 932| 3.38k| if (next) { ------------------ | Branch (932:21): [True: 649, False: 2.73k] ------------------ 933| 649| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 649] ------------------ 934| 0| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 0| pos.each_right(dec_visitor{}, idx + 1); 936| 0| node->inner()[idx] = next; 937| 0| nodr->d.sizes[idx] = last + 1 - ts; 938| 0| nodr->d.count = idx + 1; 939| 0| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 0, False: 0] ------------------ 940| 0| return std::make_tuple(pos.shift(), node, ts, tail); 941| 649| } else { 942| 649| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 649| auto newr = newn->relaxed(); 944| 649| newn->inner()[idx] = next; 945| 649| newr->d.sizes[idx] = last + 1 - ts; 946| 649| newr->d.count = idx + 1; 947| 649| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 649, False: 0] ------------------ 948| 649| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 649] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 649| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 649| } 952| 2.73k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 1.01k, False: 1.71k] ------------------ 953| 1.01k| if (Mutating) ------------------ | Branch (953:25): [Folded, False: 1.01k] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 1.01k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 1.71k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 1.71k] | Branch (956:40): [True: 0, False: 0] | Branch (956:52): [True: 0, False: 0] ------------------ 957| 0| auto newn = pos.node()->inner()[0]; 958| 0| if (!mutate) ------------------ | Branch (958:25): [True: 0, False: 0] ------------------ 959| 0| newn->inc(); 960| 0| if (Mutating) ------------------ | Branch (960:25): [Folded, False: 0] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 1.71k| } else { 964| 1.71k| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 1.71k] ------------------ 965| 0| pos.each_right(dec_visitor{}, idx + 1); 966| 0| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 0| return std::make_tuple(pos.shift(), node, ts, tail); 968| 1.71k| } else { 969| 1.71k| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 1.71k| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 1.71k] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 1.71k| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 1.71k| } 974| 1.71k| } 975| 3.38k| } 976| 3.38k| IMMER_CATCH (...) { 977| 0| assert(!mutate); ------------------ | Branch (977:17): [True: 0, False: 0] ------------------ 978| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] ------------------ 979| 0| if (next) ------------------ | Branch (979:21): [True: 0, False: 0] ------------------ 980| 0| dec_inner(next, 981| 0| pos.shift() - B, 982| 0| last + 1 - ts - pos.size_before(idx)); 983| 0| dec_leaf(tail, ts); 984| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 985| 0| } 986| 3.38k| } 987| 3.38k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 3.16k| { 992| 3.16k| auto idx = pos.index(last); 993| 3.16k| auto node = pos.node(); 994| 3.16k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.16k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.16k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.16k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 0] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 3.16k| } else { 1002| 3.16k| using std::get; 1003| 3.16k| auto subs = 1004| 3.16k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.16k] ------------------ 1005| 3.16k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.16k| auto next = get<1>(subs); 1007| 3.16k| auto ts = get<2>(subs); 1008| 3.16k| auto tail = get<3>(subs); 1009| 3.16k| IMMER_TRY { ------------------ | | 49| 3.16k|#define IMMER_TRY try ------------------ 1010| 3.16k| if (next) { ------------------ | Branch (1010:21): [True: 2.18k, False: 976] ------------------ 1011| 2.18k| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 2.18k] ------------------ 1012| 0| node->inner()[idx] = next; 1013| 0| pos.each_right(dec_visitor{}, idx + 1); 1014| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 2.18k| } else { 1016| 2.18k| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 2.18k| newn->inner()[idx] = next; 1018| 2.18k| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 2.18k] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 2.18k| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 2.18k| } 1022| 2.18k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 666, False: 310] ------------------ 1023| 666| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 666] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 666| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 666| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 310] | Branch (1026:40): [True: 0, False: 0] | Branch (1026:52): [True: 0, False: 0] ------------------ 1027| 0| auto newn = pos.node()->inner()[0]; 1028| 0| if (!mutate) ------------------ | Branch (1028:25): [True: 0, False: 0] ------------------ 1029| 0| newn->inc(); 1030| 0| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 0] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 310| } else { 1034| 310| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 310] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 310| } else { 1038| 310| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 310| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 310] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 310| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 310| } 1043| 310| } 1044| 3.16k| } 1045| 3.16k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 3.16k| } 1055| 3.16k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 12.4k| { 992| 12.4k| auto idx = pos.index(last); 993| 12.4k| auto node = pos.node(); 994| 12.4k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 12.4k, Folded] | Branch (994:35): [True: 8.54k, False: 3.87k] ------------------ 995| 12.4k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 12.4k, Folded] | Branch (995:25): [True: 7.42k, False: 5.00k] ------------------ 996| 7.42k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 5.24k, False: 2.17k] ------------------ 997| 7.42k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 7.42k| if (Mutating) ------------------ | Branch (998:17): [True: 7.42k, Folded] ------------------ 999| 7.42k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 7.42k| return res; 1001| 7.42k| } else { 1002| 5.00k| using std::get; 1003| 5.00k| auto subs = 1004| 5.00k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.30k, False: 1.69k] ------------------ 1005| 5.00k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 5.00k| auto next = get<1>(subs); 1007| 5.00k| auto ts = get<2>(subs); 1008| 5.00k| auto tail = get<3>(subs); 1009| 5.00k| IMMER_TRY { ------------------ | | 49| 5.00k|#define IMMER_TRY try ------------------ 1010| 5.00k| if (next) { ------------------ | Branch (1010:21): [True: 915, False: 4.08k] ------------------ 1011| 915| if (mutate) { ------------------ | Branch (1011:25): [True: 406, False: 509] ------------------ 1012| 406| node->inner()[idx] = next; 1013| 406| pos.each_right(dec_visitor{}, idx + 1); 1014| 406| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 509| } else { 1016| 509| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 509| newn->inner()[idx] = next; 1018| 509| if (Mutating) ------------------ | Branch (1018:29): [True: 509, Folded] ------------------ 1019| 509| pos.visit(dec_visitor{}); 1020| 509| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 509| } 1022| 4.08k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 4.08k] ------------------ 1023| 0| if (Mutating) ------------------ | Branch (1023:25): [True: 0, Folded] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 4.08k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 4.08k, Folded] | Branch (1026:40): [True: 3.47k, False: 610] | Branch (1026:52): [True: 2.22k, False: 1.25k] ------------------ 1027| 2.22k| auto newn = pos.node()->inner()[0]; 1028| 2.22k| if (!mutate) ------------------ | Branch (1028:25): [True: 710, False: 1.51k] ------------------ 1029| 710| newn->inc(); 1030| 2.22k| if (Mutating) ------------------ | Branch (1030:25): [True: 2.22k, Folded] ------------------ 1031| 2.22k| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 2.22k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 2.22k| } else { 1034| 1.86k| if (mutate) { ------------------ | Branch (1034:25): [True: 1.38k, False: 477] ------------------ 1035| 1.38k| pos.each_right(dec_visitor{}, idx + 1); 1036| 1.38k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.38k| } else { 1038| 477| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 477| if (Mutating) ------------------ | Branch (1039:29): [True: 477, Folded] ------------------ 1040| 477| pos.visit(dec_visitor{}); 1041| 477| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 477| } 1043| 1.86k| } 1044| 5.00k| } 1045| 5.00k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 5.00k| } 1055| 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: 1059| 1.90k| { 1060| 1.90k| auto old_tail_size = pos.count(); 1061| 1.90k| auto new_tail_size = pos.index(last) + 1; 1062| 1.90k| auto node = pos.node(); 1063| 1.90k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.90k, Folded] | Branch (1063:42): [True: 674, False: 1.23k] ------------------ 1064| 1.90k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 372, False: 1.53k] ------------------ 1065| 372| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 372] ------------------ 1066| 0| node->inc(); 1067| 372| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.53k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 673, False: 864] ------------------ 1069| 673| detail::destroy_n(node->leaf() + new_tail_size, 1070| 673| old_tail_size - new_tail_size); 1071| 673| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 864| } else { 1073| 864| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 864| if (Mutating) ------------------ | Branch (1074:17): [True: 864, Folded] ------------------ 1075| 864| pos.visit(dec_visitor{}); 1076| 864| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 864| } 1078| 1.90k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 3.74k| { 992| 3.74k| auto idx = pos.index(last); 993| 3.74k| auto node = pos.node(); 994| 3.74k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.74k, Folded] | Branch (994:35): [True: 1.94k, False: 1.79k] ------------------ 995| 3.74k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 3.74k, Folded] | Branch (995:25): [True: 1.93k, False: 1.80k] ------------------ 996| 1.93k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 1.17k, False: 765] ------------------ 997| 1.93k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 1.93k| if (Mutating) ------------------ | Branch (998:17): [True: 1.93k, Folded] ------------------ 999| 1.93k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 1.93k| return res; 1001| 1.93k| } else { 1002| 1.80k| using std::get; 1003| 1.80k| auto subs = 1004| 1.80k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 769, False: 1.03k] ------------------ 1005| 1.80k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.80k| auto next = get<1>(subs); 1007| 1.80k| auto ts = get<2>(subs); 1008| 1.80k| auto tail = get<3>(subs); 1009| 1.80k| IMMER_TRY { ------------------ | | 49| 1.80k|#define IMMER_TRY try ------------------ 1010| 1.80k| if (next) { ------------------ | Branch (1010:21): [True: 447, False: 1.35k] ------------------ 1011| 447| if (mutate) { ------------------ | Branch (1011:25): [True: 182, False: 265] ------------------ 1012| 182| node->inner()[idx] = next; 1013| 182| pos.each_right(dec_visitor{}, idx + 1); 1014| 182| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 265| } else { 1016| 265| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 265| newn->inner()[idx] = next; 1018| 265| if (Mutating) ------------------ | Branch (1018:29): [True: 265, Folded] ------------------ 1019| 265| pos.visit(dec_visitor{}); 1020| 265| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 265| } 1022| 1.35k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 1.35k] ------------------ 1023| 0| if (Mutating) ------------------ | Branch (1023:25): [True: 0, Folded] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.35k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 1.35k, Folded] | Branch (1026:40): [True: 740, False: 616] | Branch (1026:52): [True: 521, False: 219] ------------------ 1027| 521| auto newn = pos.node()->inner()[0]; 1028| 521| if (!mutate) ------------------ | Branch (1028:25): [True: 259, False: 262] ------------------ 1029| 259| newn->inc(); 1030| 521| if (Mutating) ------------------ | Branch (1030:25): [True: 521, Folded] ------------------ 1031| 521| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 521| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 835| } else { 1034| 835| if (mutate) { ------------------ | Branch (1034:25): [True: 325, False: 510] ------------------ 1035| 325| pos.each_right(dec_visitor{}, idx + 1); 1036| 325| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 510| } else { 1038| 510| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 510| if (Mutating) ------------------ | Branch (1039:29): [True: 510, Folded] ------------------ 1040| 510| pos.visit(dec_visitor{}); 1041| 510| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 510| } 1043| 835| } 1044| 1.80k| } 1045| 1.80k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 1.80k| } 1055| 3.74k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb1EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 765| { 1060| 765| auto old_tail_size = pos.count(); 1061| 765| auto new_tail_size = pos.index(last) + 1; 1062| 765| auto node = pos.node(); 1063| 765| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 765, Folded] | Branch (1063:42): [True: 244, False: 521] ------------------ 1064| 765| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 199, False: 566] ------------------ 1065| 199| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 199] ------------------ 1066| 0| node->inc(); 1067| 199| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 566| } else if (mutate) { ------------------ | Branch (1068:20): [True: 243, False: 323] ------------------ 1069| 243| detail::destroy_n(node->leaf() + new_tail_size, 1070| 243| old_tail_size - new_tail_size); 1071| 243| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 323| } else { 1073| 323| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 323| if (Mutating) ------------------ | Branch (1074:17): [True: 323, Folded] ------------------ 1075| 323| pos.visit(dec_visitor{}); 1076| 323| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 323| } 1078| 765| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 855| { 1378| 855| auto node = pos.node(); 1379| 855| auto idx = pos.index(first); 1380| 855| auto count = pos.count(); 1381| 855| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 855| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 602, False: 253] ------------------ 1384| 855| if (mutate) { ------------------ | Branch (1384:13): [True: 602, False: 253] ------------------ 1385| 602| auto data = node->leaf(); 1386| 602| auto newcount = count - idx; 1387| 602| std::move(data + idx, data + count, data); 1388| 602| detail::destroy_n(data + newcount, idx); 1389| 602| return std::make_tuple(0, node); 1390| 602| } else { 1391| 253| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 253| if (Mutating) ------------------ | Branch (1392:17): [True: 253, Folded] ------------------ 1393| 253| pos.visit(dec_visitor{}); 1394| 253| return std::make_tuple(0, newn); 1395| 253| } 1396| 855| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1246| 49.7k| { 1247| 49.7k| auto idx = pos.subindex(first); 1248| 49.7k| auto count = pos.count(); 1249| 49.7k| auto node = pos.node(); 1250| 49.7k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 49.7k, Folded] | Branch (1250:47): [True: 41.8k, False: 7.82k] ------------------ 1251| 49.7k| auto left_size = pos.size_before(idx); 1252| 49.7k| auto child_size = pos.size_sbh(idx, left_size); 1253| 49.7k| auto dropped_size = first; 1254| 49.7k| auto child_dropped_size = dropped_size - left_size; 1255| 49.7k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 49.7k, Folded] | Branch (1255:25): [True: 47.4k, False: 2.24k] | Branch (1255:45): [True: 4.86k, False: 42.5k] ------------------ 1256| 4.86k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 1.83k, False: 3.03k] ------------------ 1257| 4.86k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 4.86k| if (mutate) ------------------ | Branch (1258:17): [True: 1.83k, False: 3.03k] ------------------ 1259| 1.83k| pos.visit(dec_left_visitor{}, idx); 1260| 3.03k| else if (Mutating) ------------------ | Branch (1260:22): [True: 3.03k, Folded] ------------------ 1261| 3.03k| pos.visit(dec_visitor{}); 1262| 4.86k| return r; 1263| 44.8k| } else { 1264| 44.8k| using std::get; 1265| 44.8k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 40.0k, False: 4.78k] ------------------ 1266| 44.8k| : node_t::make_inner_r_e(e); 1267| 44.8k| auto newr = newn->relaxed(); 1268| 44.8k| auto newcount = count - idx; 1269| 44.8k| auto new_child_size = child_size - child_dropped_size; 1270| 44.8k| IMMER_TRY { ------------------ | | 49| 44.8k|#define IMMER_TRY try ------------------ 1271| 44.8k| auto subs = 1272| 44.8k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 40.0k, False: 4.78k] ------------------ 1273| 44.8k| : pos.towards_sub_oh( 1274| 4.78k| no_collapse_no_mut_t{}, first, idx, e); 1275| 44.8k| if (mutate) ------------------ | Branch (1275:21): [True: 40.0k, False: 4.78k] ------------------ 1276| 40.0k| pos.each_left(dec_visitor{}, idx); 1277| 44.8k| pos.copy_sizes( 1278| 44.8k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 44.8k| std::copy(node->inner() + idx + 1, 1280| 44.8k| node->inner() + count, 1281| 44.8k| newn->inner() + 1); 1282| 44.8k| newn->inner()[0] = get<1>(subs); 1283| 44.8k| newr->d.sizes[0] = new_child_size; 1284| 44.8k| newr->d.count = newcount; 1285| 44.8k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 44.8k, False: 0] ------------------ 1286| 44.8k| if (!mutate) { ------------------ | Branch (1286:21): [True: 4.78k, False: 40.0k] ------------------ 1287| 4.78k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 4.78k| if (Mutating) ------------------ | Branch (1288:25): [True: 4.78k, Folded] ------------------ 1289| 4.78k| pos.visit(dec_visitor{}); 1290| 4.78k| } 1291| 44.8k| return std::make_tuple(pos.shift(), newn); 1292| 44.8k| } 1293| 44.8k| IMMER_CATCH (...) { 1294| 0| if (!mutate) ------------------ | Branch (1294:21): [True: 0, False: 0] ------------------ 1295| 0| node_t::delete_inner_r_e(newn); 1296| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1297| 0| } 1298| 44.8k| } 1299| 49.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: 1246| 2.36k| { 1247| 2.36k| auto idx = pos.subindex(first); 1248| 2.36k| auto count = pos.count(); 1249| 2.36k| auto node = pos.node(); 1250| 2.36k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 2.36k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 2.36k| auto left_size = pos.size_before(idx); 1252| 2.36k| auto child_size = pos.size_sbh(idx, left_size); 1253| 2.36k| auto dropped_size = first; 1254| 2.36k| auto child_dropped_size = dropped_size - left_size; 1255| 2.36k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 2.36k, Folded] | Branch (1255:25): [True: 983, False: 1.38k] | Branch (1255:45): [True: 764, False: 219] ------------------ 1256| 764| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 764] ------------------ 1257| 764| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 764| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 764] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 764| else if (Mutating) ------------------ | Branch (1260:22): [Folded, False: 764] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 764| return r; 1263| 1.59k| } else { 1264| 1.59k| using std::get; 1265| 1.59k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 1.59k] ------------------ 1266| 1.59k| : node_t::make_inner_r_e(e); 1267| 1.59k| auto newr = newn->relaxed(); 1268| 1.59k| auto newcount = count - idx; 1269| 1.59k| auto new_child_size = child_size - child_dropped_size; 1270| 1.59k| IMMER_TRY { ------------------ | | 49| 1.59k|#define IMMER_TRY try ------------------ 1271| 1.59k| auto subs = 1272| 1.59k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 1.59k] ------------------ 1273| 1.59k| : pos.towards_sub_oh( 1274| 1.59k| no_collapse_no_mut_t{}, first, idx, e); 1275| 1.59k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 1.59k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 1.59k| pos.copy_sizes( 1278| 1.59k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 1.59k| std::copy(node->inner() + idx + 1, 1280| 1.59k| node->inner() + count, 1281| 1.59k| newn->inner() + 1); 1282| 1.59k| newn->inner()[0] = get<1>(subs); 1283| 1.59k| newr->d.sizes[0] = new_child_size; 1284| 1.59k| newr->d.count = newcount; 1285| 1.59k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 1.59k, False: 0] ------------------ 1286| 1.59k| if (!mutate) { ------------------ | Branch (1286:21): [True: 1.59k, False: 0] ------------------ 1287| 1.59k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 1.59k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 1.59k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 1.59k| } 1291| 1.59k| return std::make_tuple(pos.shift(), newn); 1292| 1.59k| } 1293| 1.59k| IMMER_CATCH (...) { 1294| 0| if (!mutate) ------------------ | Branch (1294:21): [True: 0, False: 0] ------------------ 1295| 0| node_t::delete_inner_r_e(newn); 1296| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1297| 0| } 1298| 1.59k| } 1299| 2.36k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 2.31k| { 1304| 2.31k| auto idx = pos.subindex(first); 1305| 2.31k| auto count = pos.count(); 1306| 2.31k| auto node = pos.node(); 1307| 2.31k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.31k] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 0| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [Folded, False: 0] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 2.31k| auto left_size = pos.size_before(idx); 1313| 2.31k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.31k| auto dropped_size = first; 1315| 2.31k| auto child_dropped_size = dropped_size - left_size; 1316| 2.31k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 2.31k, Folded] | Branch (1316:25): [True: 998, False: 1.32k] | Branch (1316:45): [True: 623, False: 375] ------------------ 1317| 623| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 623] ------------------ 1318| 623| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 623| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 623] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 623| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 623] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 623| return r; 1324| 1.69k| } else { 1325| 1.69k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 1.69k| auto newcount = count - idx; 1330| 1.69k| auto newn = 1331| 1.69k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.69k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.69k| : node_t::make_inner_r_e(e); 1336| 1.69k| auto newr = newn->relaxed(); 1337| 1.69k| IMMER_TRY { ------------------ | | 49| 1.69k|#define IMMER_TRY try ------------------ 1338| 1.69k| auto subs = 1339| 1.69k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.69k] ------------------ 1340| 1.69k| : pos.towards_sub_oh( 1341| 1.69k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.69k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.69k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.69k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.69k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.69k, False: 0] ------------------ 1346| 1.69k| pos.copy_sizes( 1347| 1.69k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.69k| newr->d.count = newcount; 1349| 1.69k| newn->inner()[0] = get<1>(subs); 1350| 1.69k| std::copy(node->inner() + idx + 1, 1351| 1.69k| node->inner() + count, 1352| 1.69k| newn->inner() + 1); 1353| 1.69k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.69k, False: 0] ------------------ 1354| 1.69k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.69k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.69k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.69k| } 1358| 1.69k| return std::make_tuple(pos.shift(), newn); 1359| 1.69k| } 1360| 1.69k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 1.69k| } 1373| 2.31k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 641| { 1304| 641| auto idx = pos.subindex(first); 1305| 641| auto count = pos.count(); 1306| 641| auto node = pos.node(); 1307| 641| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 641] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 0| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [Folded, False: 0] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 641| auto left_size = pos.size_before(idx); 1313| 641| auto child_size = pos.size_sbh(idx, left_size); 1314| 641| auto dropped_size = first; 1315| 641| auto child_dropped_size = dropped_size - left_size; 1316| 641| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 641, Folded] | Branch (1316:25): [True: 207, False: 434] | Branch (1316:45): [True: 0, False: 207] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 0] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 641| } else { 1325| 641| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 641| auto newcount = count - idx; 1330| 641| auto newn = 1331| 641| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 641] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 641| : node_t::make_inner_r_e(e); 1336| 641| auto newr = newn->relaxed(); 1337| 641| IMMER_TRY { ------------------ | | 49| 641|#define IMMER_TRY try ------------------ 1338| 641| auto subs = 1339| 641| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 641] ------------------ 1340| 641| : pos.towards_sub_oh( 1341| 641| no_collapse_no_mut_t{}, first, idx, e); 1342| 641| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 641] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 641| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 641| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 641, False: 0] ------------------ 1346| 641| pos.copy_sizes( 1347| 641| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 641| newr->d.count = newcount; 1349| 641| newn->inner()[0] = get<1>(subs); 1350| 641| std::copy(node->inner() + idx + 1, 1351| 641| node->inner() + count, 1352| 641| newn->inner() + 1); 1353| 641| if (!mutate) { ------------------ | Branch (1353:21): [True: 641, False: 0] ------------------ 1354| 641| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 641| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 641] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 641| } 1358| 641| return std::make_tuple(pos.shift(), newn); 1359| 641| } 1360| 641| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 641| } 1373| 641| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 8.10k| { 1378| 8.10k| auto node = pos.node(); 1379| 8.10k| auto idx = pos.index(first); 1380| 8.10k| auto count = pos.count(); 1381| 8.10k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 8.10k] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 0| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 0, False: 0] ------------------ 1384| 8.10k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 8.10k] ------------------ 1385| 0| auto data = node->leaf(); 1386| 0| auto newcount = count - idx; 1387| 0| std::move(data + idx, data + count, data); 1388| 0| detail::destroy_n(data + newcount, idx); 1389| 0| return std::make_tuple(0, node); 1390| 8.10k| } else { 1391| 8.10k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 8.10k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 8.10k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 8.10k| return std::make_tuple(0, newn); 1395| 8.10k| } 1396| 8.10k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 1.80k| { 1304| 1.80k| auto idx = pos.subindex(first); 1305| 1.80k| auto count = pos.count(); 1306| 1.80k| auto node = pos.node(); 1307| 1.80k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 1.80k] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 0| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [Folded, False: 0] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 1.80k| auto left_size = pos.size_before(idx); 1313| 1.80k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.80k| auto dropped_size = first; 1315| 1.80k| auto child_dropped_size = dropped_size - left_size; 1316| 1.80k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.80k] | Branch (1316:25): [True: 0, False: 0] | Branch (1316:45): [True: 0, False: 0] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 0] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 1.80k| } else { 1325| 1.80k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 1.80k| auto newcount = count - idx; 1330| 1.80k| auto newn = 1331| 1.80k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.80k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.80k| : node_t::make_inner_r_e(e); 1336| 1.80k| auto newr = newn->relaxed(); 1337| 1.80k| IMMER_TRY { ------------------ | | 49| 1.80k|#define IMMER_TRY try ------------------ 1338| 1.80k| auto subs = 1339| 1.80k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.80k] ------------------ 1340| 1.80k| : pos.towards_sub_oh( 1341| 1.80k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.80k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.80k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.80k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.80k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.80k, False: 0] ------------------ 1346| 1.80k| pos.copy_sizes( 1347| 1.80k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.80k| newr->d.count = newcount; 1349| 1.80k| newn->inner()[0] = get<1>(subs); 1350| 1.80k| std::copy(node->inner() + idx + 1, 1351| 1.80k| node->inner() + count, 1352| 1.80k| newn->inner() + 1); 1353| 1.80k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.80k, False: 0] ------------------ 1354| 1.80k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.80k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.80k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.80k| } 1358| 1.80k| return std::make_tuple(pos.shift(), newn); 1359| 1.80k| } 1360| 1.80k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 1.80k| } 1373| 1.80k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 4.34k| { 1378| 4.34k| auto node = pos.node(); 1379| 4.34k| auto idx = pos.index(first); 1380| 4.34k| auto count = pos.count(); 1381| 4.34k| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 4.34k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 1.95k, False: 2.39k] ------------------ 1384| 4.34k| if (mutate) { ------------------ | Branch (1384:13): [True: 1.95k, False: 2.39k] ------------------ 1385| 1.95k| auto data = node->leaf(); 1386| 1.95k| auto newcount = count - idx; 1387| 1.95k| std::move(data + idx, data + count, data); 1388| 1.95k| detail::destroy_n(data + newcount, idx); 1389| 1.95k| return std::make_tuple(0, node); 1390| 2.39k| } else { 1391| 2.39k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 2.39k| if (Mutating) ------------------ | Branch (1392:17): [True: 2.39k, Folded] ------------------ 1393| 2.39k| pos.visit(dec_visitor{}); 1394| 2.39k| return std::make_tuple(0, newn); 1395| 2.39k| } 1396| 4.34k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 1.95k| { 1304| 1.95k| auto idx = pos.subindex(first); 1305| 1.95k| auto count = pos.count(); 1306| 1.95k| auto node = pos.node(); 1307| 1.95k| auto mutate = Mutating ------------------ | Branch (1307:23): [True: 0, Folded] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 0| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [Folded, False: 0] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 1.95k| auto left_size = pos.size_before(idx); 1313| 1.95k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.95k| auto dropped_size = first; 1315| 1.95k| auto child_dropped_size = dropped_size - left_size; 1316| 1.95k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.95k] | Branch (1316:25): [True: 0, False: 0] | Branch (1316:45): [True: 0, False: 0] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [True: 0, Folded] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 1.95k| } else { 1325| 1.95k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 1.95k| auto newcount = count - idx; 1330| 1.95k| auto newn = 1331| 1.95k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.95k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.95k| : node_t::make_inner_r_e(e); 1336| 1.95k| auto newr = newn->relaxed(); 1337| 1.95k| IMMER_TRY { ------------------ | | 49| 1.95k|#define IMMER_TRY try ------------------ 1338| 1.95k| auto subs = 1339| 1.95k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.95k] ------------------ 1340| 1.95k| : pos.towards_sub_oh( 1341| 1.95k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.95k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.95k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.95k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.95k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.95k, False: 0] ------------------ 1346| 1.95k| pos.copy_sizes( 1347| 1.95k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.95k| newr->d.count = newcount; 1349| 1.95k| newn->inner()[0] = get<1>(subs); 1350| 1.95k| std::copy(node->inner() + idx + 1, 1351| 1.95k| node->inner() + count, 1352| 1.95k| newn->inner() + 1); 1353| 1.95k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.95k, False: 0] ------------------ 1354| 1.95k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.95k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.95k, Folded] ------------------ 1356| 1.95k| pos.visit(dec_visitor{}); 1357| 1.95k| } 1358| 1.95k| return std::make_tuple(pos.shift(), newn); 1359| 1.95k| } 1360| 1.95k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 1.95k| } 1373| 1.95k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 37.7k| { 1378| 37.7k| auto node = pos.node(); 1379| 37.7k| auto idx = pos.index(first); 1380| 37.7k| auto count = pos.count(); 1381| 37.7k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 37.7k] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 0| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 0, False: 0] ------------------ 1384| 37.7k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 37.7k] ------------------ 1385| 0| auto data = node->leaf(); 1386| 0| auto newcount = count - idx; 1387| 0| std::move(data + idx, data + count, data); 1388| 0| detail::destroy_n(data + newcount, idx); 1389| 0| return std::make_tuple(0, node); 1390| 37.7k| } else { 1391| 37.7k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 37.7k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 37.7k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 37.7k| return std::make_tuple(0, newn); 1395| 37.7k| } 1396| 37.7k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 2.35k| { 1304| 2.35k| auto idx = pos.subindex(first); 1305| 2.35k| auto count = pos.count(); 1306| 2.35k| auto node = pos.node(); 1307| 2.35k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.35k] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 0| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [Folded, False: 0] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 2.35k| auto left_size = pos.size_before(idx); 1313| 2.35k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.35k| auto dropped_size = first; 1315| 2.35k| auto child_dropped_size = dropped_size - left_size; 1316| 2.35k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 2.35k] | Branch (1316:25): [True: 0, False: 0] | Branch (1316:45): [True: 0, False: 0] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 0] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 2.35k| } else { 1325| 2.35k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 2.35k| auto newcount = count - idx; 1330| 2.35k| auto newn = 1331| 2.35k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 2.35k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 2.35k| : node_t::make_inner_r_e(e); 1336| 2.35k| auto newr = newn->relaxed(); 1337| 2.35k| IMMER_TRY { ------------------ | | 49| 2.35k|#define IMMER_TRY try ------------------ 1338| 2.35k| auto subs = 1339| 2.35k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 2.35k] ------------------ 1340| 2.35k| : pos.towards_sub_oh( 1341| 2.35k| no_collapse_no_mut_t{}, first, idx, e); 1342| 2.35k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 2.35k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 2.35k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 2.35k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 2.35k, False: 0] ------------------ 1346| 2.35k| pos.copy_sizes( 1347| 2.35k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 2.35k| newr->d.count = newcount; 1349| 2.35k| newn->inner()[0] = get<1>(subs); 1350| 2.35k| std::copy(node->inner() + idx + 1, 1351| 2.35k| node->inner() + count, 1352| 2.35k| newn->inner() + 1); 1353| 2.35k| if (!mutate) { ------------------ | Branch (1353:21): [True: 2.35k, False: 0] ------------------ 1354| 2.35k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 2.35k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 2.35k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 2.35k| } 1358| 2.35k| return std::make_tuple(pos.shift(), newn); 1359| 2.35k| } 1360| 2.35k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 2.35k| } 1373| 2.35k| } _ZN5immer6detail4rbts16dec_left_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEvOT_j: 1198| 1.83k| { 1199| 1.83k| using node_t = node_type; 1200| 1.83k| auto node = p.node(); 1201| 1.83k| if (node->dec()) { ------------------ | Branch (1201:13): [True: 1.83k, False: 0] ------------------ 1202| 1.83k| p.each_left(dec_t{}, idx); 1203| 1.83k| node_t::delete_inner_r(node, p.count()); 1204| 1.83k| } 1205| 1.83k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1246| 156k| { 1247| 156k| auto idx = pos.subindex(first); 1248| 156k| auto count = pos.count(); 1249| 156k| auto node = pos.node(); 1250| 156k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 156k, Folded] | Branch (1250:47): [True: 122k, False: 33.7k] ------------------ 1251| 156k| auto left_size = pos.size_before(idx); 1252| 156k| auto child_size = pos.size_sbh(idx, left_size); 1253| 156k| auto dropped_size = first; 1254| 156k| auto child_dropped_size = dropped_size - left_size; 1255| 156k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 156k] | Branch (1255:25): [True: 0, False: 0] | Branch (1255:45): [True: 0, False: 0] ------------------ 1256| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 0] ------------------ 1257| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 0| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 0] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 0| else if (Mutating) ------------------ | Branch (1260:22): [True: 0, Folded] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 0| return r; 1263| 156k| } else { 1264| 156k| using std::get; 1265| 156k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 122k, False: 33.7k] ------------------ 1266| 156k| : node_t::make_inner_r_e(e); 1267| 156k| auto newr = newn->relaxed(); 1268| 156k| auto newcount = count - idx; 1269| 156k| auto new_child_size = child_size - child_dropped_size; 1270| 156k| IMMER_TRY { ------------------ | | 49| 156k|#define IMMER_TRY try ------------------ 1271| 156k| auto subs = 1272| 156k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 122k, False: 33.7k] ------------------ 1273| 156k| : pos.towards_sub_oh( 1274| 33.7k| no_collapse_no_mut_t{}, first, idx, e); 1275| 156k| if (mutate) ------------------ | Branch (1275:21): [True: 122k, False: 33.7k] ------------------ 1276| 122k| pos.each_left(dec_visitor{}, idx); 1277| 156k| pos.copy_sizes( 1278| 156k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 156k| std::copy(node->inner() + idx + 1, 1280| 156k| node->inner() + count, 1281| 156k| newn->inner() + 1); 1282| 156k| newn->inner()[0] = get<1>(subs); 1283| 156k| newr->d.sizes[0] = new_child_size; 1284| 156k| newr->d.count = newcount; 1285| 156k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 156k, False: 0] ------------------ 1286| 156k| if (!mutate) { ------------------ | Branch (1286:21): [True: 33.7k, False: 122k] ------------------ 1287| 33.7k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 33.7k| if (Mutating) ------------------ | Branch (1288:25): [True: 33.7k, Folded] ------------------ 1289| 33.7k| pos.visit(dec_visitor{}); 1290| 33.7k| } 1291| 156k| return std::make_tuple(pos.shift(), newn); 1292| 156k| } 1293| 156k| IMMER_CATCH (...) { 1294| 0| if (!mutate) ------------------ | Branch (1294:21): [True: 0, False: 0] ------------------ 1295| 0| node_t::delete_inner_r_e(newn); 1296| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1297| 0| } 1298| 156k| } 1299| 156k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb0ELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1246| 43.5k| { 1247| 43.5k| auto idx = pos.subindex(first); 1248| 43.5k| auto count = pos.count(); 1249| 43.5k| auto node = pos.node(); 1250| 43.5k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 43.5k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 43.5k| auto left_size = pos.size_before(idx); 1252| 43.5k| auto child_size = pos.size_sbh(idx, left_size); 1253| 43.5k| auto dropped_size = first; 1254| 43.5k| auto child_dropped_size = dropped_size - left_size; 1255| 43.5k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 43.5k] | Branch (1255:25): [True: 0, False: 0] | Branch (1255:45): [True: 0, False: 0] ------------------ 1256| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 0] ------------------ 1257| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 0| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 0] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 0| else if (Mutating) ------------------ | Branch (1260:22): [Folded, False: 0] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 0| return r; 1263| 43.5k| } else { 1264| 43.5k| using std::get; 1265| 43.5k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 43.5k] ------------------ 1266| 43.5k| : node_t::make_inner_r_e(e); 1267| 43.5k| auto newr = newn->relaxed(); 1268| 43.5k| auto newcount = count - idx; 1269| 43.5k| auto new_child_size = child_size - child_dropped_size; 1270| 43.5k| IMMER_TRY { ------------------ | | 49| 43.5k|#define IMMER_TRY try ------------------ 1271| 43.5k| auto subs = 1272| 43.5k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 43.5k] ------------------ 1273| 43.5k| : pos.towards_sub_oh( 1274| 43.5k| no_collapse_no_mut_t{}, first, idx, e); 1275| 43.5k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 43.5k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 43.5k| pos.copy_sizes( 1278| 43.5k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 43.5k| std::copy(node->inner() + idx + 1, 1280| 43.5k| node->inner() + count, 1281| 43.5k| newn->inner() + 1); 1282| 43.5k| newn->inner()[0] = get<1>(subs); 1283| 43.5k| newr->d.sizes[0] = new_child_size; 1284| 43.5k| newr->d.count = newcount; 1285| 43.5k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 43.5k, False: 0] ------------------ 1286| 43.5k| if (!mutate) { ------------------ | Branch (1286:21): [True: 43.5k, False: 0] ------------------ 1287| 43.5k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 43.5k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 43.5k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 43.5k| } 1291| 43.5k| return std::make_tuple(pos.shift(), newn); 1292| 43.5k| } 1293| 43.5k| IMMER_CATCH (...) { 1294| 0| if (!mutate) ------------------ | Branch (1294:21): [True: 0, False: 0] ------------------ 1295| 0| node_t::delete_inner_r_e(newn); 1296| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1297| 0| } 1298| 43.5k| } 1299| 43.5k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 2.37k| { 1304| 2.37k| auto idx = pos.subindex(first); 1305| 2.37k| auto count = pos.count(); 1306| 2.37k| auto node = pos.node(); 1307| 2.37k| auto mutate = Mutating ------------------ | Branch (1307:23): [True: 0, Folded] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 0| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [Folded, False: 0] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 2.37k| auto left_size = pos.size_before(idx); 1313| 2.37k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.37k| auto dropped_size = first; 1315| 2.37k| auto child_dropped_size = dropped_size - left_size; 1316| 2.37k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 2.37k, Folded] | Branch (1316:25): [True: 1.55k, False: 815] | Branch (1316:45): [True: 903, False: 653] ------------------ 1317| 903| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 903] ------------------ 1318| 903| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 903| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 903] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 903| else if (Mutating) ------------------ | Branch (1321:22): [True: 903, Folded] ------------------ 1322| 903| pos.visit(dec_visitor{}); 1323| 903| return r; 1324| 1.46k| } else { 1325| 1.46k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 1.46k| auto newcount = count - idx; 1330| 1.46k| auto newn = 1331| 1.46k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.46k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.46k| : node_t::make_inner_r_e(e); 1336| 1.46k| auto newr = newn->relaxed(); 1337| 1.46k| IMMER_TRY { ------------------ | | 49| 1.46k|#define IMMER_TRY try ------------------ 1338| 1.46k| auto subs = 1339| 1.46k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.46k] ------------------ 1340| 1.46k| : pos.towards_sub_oh( 1341| 1.46k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.46k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.46k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.46k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.46k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.46k, False: 0] ------------------ 1346| 1.46k| pos.copy_sizes( 1347| 1.46k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.46k| newr->d.count = newcount; 1349| 1.46k| newn->inner()[0] = get<1>(subs); 1350| 1.46k| std::copy(node->inner() + idx + 1, 1351| 1.46k| node->inner() + count, 1352| 1.46k| newn->inner() + 1); 1353| 1.46k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.46k, False: 0] ------------------ 1354| 1.46k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.46k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.46k, Folded] ------------------ 1356| 1.46k| pos.visit(dec_visitor{}); 1357| 1.46k| } 1358| 1.46k| return std::make_tuple(pos.shift(), newn); 1359| 1.46k| } 1360| 1.46k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 1.46k| } 1373| 2.37k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSE_Lj3ELj3EEESF_EEbOT_OT0_PT1_jm: 349| 15.1k| { 350| 15.1k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 15.1k, False: 0] ------------------ 351| 15.1k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 14.1k, False: 987] ------------------ 352| 15.1k| ? visit_maybe_relaxed_sub(rootl, 353| 14.1k| shiftl, 354| 14.1k| sizel, 355| 14.1k| this_t{}, 356| 14.1k| posr, 357| 14.1k| first, 358| 14.1k| size_t{}) 359| 15.1k| : posr.first_sub_inner( 360| 987| rrb{}, first, rootl, shiftl, sizel); 361| 15.1k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESG_RNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 382| 41.9k| { 383| 41.9k| auto nl = posl.node(); 384| 41.9k| auto nr = posr.node(); 385| 41.9k| if (nl == nr) ------------------ | Branch (385:13): [True: 13.3k, False: 28.6k] ------------------ 386| 13.3k| return true; 387| 28.6k| auto cl = posl.count(); 388| 28.6k| auto cr = posr.count(); 389| 28.6k| assert(cr > 0); ------------------ | Branch (389:9): [True: 28.6k, False: 0] ------------------ 390| 28.6k| auto sbr = size_t{}; 391| 28.6k| auto i = count_t{}; 392| 28.6k| auto j = count_t{}; 393| 129k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 116k, False: 13.2k] ------------------ 394| 116k| auto sbl = posl.size_before(i); 395| 202k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 179k, False: 22.3k] | Branch (395:34): [True: 85.8k, False: 94.0k] ------------------ 396| 85.8k| ; 397| 116k| auto res = 398| 116k| sbl == sbr ------------------ | Branch (398:17): [True: 60.0k, False: 56.3k] ------------------ 399| 116k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 116k| : posl.nth_sub(i, 401| 56.3k| for_each_chunk_p_visitor{}, 402| 56.3k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 116k| if (!res) ------------------ | Branch (403:17): [True: 15.3k, False: 101k] ------------------ 404| 15.3k| return false; 405| 116k| } 406| 13.2k| return true; 407| 28.6k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 336| 25.4k| { 337| 25.4k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 25.4k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESG_RNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 427| 26.0k| { 428| 26.0k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 16.4k, False: 9.57k] ------------------ 429| 16.4k| return true; 430| 9.57k| auto cl = posl.count(); 431| 9.57k| auto cr = posr.count(); 432| 9.57k| auto mp = std::min(cl, cr); 433| 9.57k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 7.63k, False: 1.94k] ------------------ 434| 9.57k| posl.node()->leaf() + mp, 435| 9.57k| posr.node()->leaf()) && 436| 7.63k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 7.15k, False: 481] ------------------ 437| 7.63k| posl.node()->leaf() + posl.count(), 438| 7.63k| first + (idx + mp)); 439| 26.0k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESH_RNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 30.8k| { 330| 30.8k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 30.8k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEENSt3__19enable_ifIX12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 412| 4.44k| { 413| 4.44k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 4.44k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 382| 4.44k| { 383| 4.44k| auto nl = posl.node(); 384| 4.44k| auto nr = posr.node(); 385| 4.44k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 4.44k] ------------------ 386| 0| return true; 387| 4.44k| auto cl = posl.count(); 388| 4.44k| auto cr = posr.count(); 389| 4.44k| assert(cr > 0); ------------------ | Branch (389:9): [True: 4.44k, False: 0] ------------------ 390| 4.44k| auto sbr = size_t{}; 391| 4.44k| auto i = count_t{}; 392| 4.44k| auto j = count_t{}; 393| 15.6k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 13.7k, False: 1.95k] ------------------ 394| 13.7k| auto sbl = posl.size_before(i); 395| 22.9k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 19.0k, False: 3.87k] | Branch (395:34): [True: 9.22k, False: 9.86k] ------------------ 396| 9.22k| ; 397| 13.7k| auto res = 398| 13.7k| sbl == sbr ------------------ | Branch (398:17): [True: 8.63k, False: 5.10k] ------------------ 399| 13.7k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 13.7k| : posl.nth_sub(i, 401| 5.10k| for_each_chunk_p_visitor{}, 402| 5.10k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 13.7k| if (!res) ------------------ | Branch (403:17): [True: 2.49k, False: 11.2k] ------------------ 404| 2.49k| return false; 405| 13.7k| } 406| 1.95k| return true; 407| 4.44k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_15regular_sub_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 336| 5.69k| { 337| 5.69k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 5.69k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_12leaf_sub_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 427| 12.0k| { 428| 12.0k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 8.19k, False: 3.83k] ------------------ 429| 8.19k| return true; 430| 3.83k| auto cl = posl.count(); 431| 3.83k| auto cr = posr.count(); 432| 3.83k| auto mp = std::min(cl, cr); 433| 3.83k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 3.46k, False: 362] ------------------ 434| 3.83k| posl.node()->leaf() + mp, 435| 3.83k| posr.node()->leaf()) && 436| 3.46k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 3.06k, False: 400] ------------------ 437| 3.46k| posl.node()->leaf() + posl.count(), 438| 3.46k| first + (idx + mp)); 439| 12.0k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_15regular_sub_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 2.11k| { 330| 2.11k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.11k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEENSt3__19enable_ifIX12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 412| 2.27k| { 413| 2.27k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 2.27k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 382| 2.27k| { 383| 2.27k| auto nl = posl.node(); 384| 2.27k| auto nr = posr.node(); 385| 2.27k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.27k] ------------------ 386| 0| return true; 387| 2.27k| auto cl = posl.count(); 388| 2.27k| auto cr = posr.count(); 389| 2.27k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.27k, False: 0] ------------------ 390| 2.27k| auto sbr = size_t{}; 391| 2.27k| auto i = count_t{}; 392| 2.27k| auto j = count_t{}; 393| 15.8k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 14.4k, False: 1.48k] ------------------ 394| 14.4k| auto sbl = posl.size_before(i); 395| 25.3k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 21.6k, False: 3.66k] | Branch (395:34): [True: 10.9k, False: 10.7k] ------------------ 396| 10.9k| ; 397| 14.4k| auto res = 398| 14.4k| sbl == sbr ------------------ | Branch (398:17): [True: 8.33k, False: 6.06k] ------------------ 399| 14.4k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 14.4k| : posl.nth_sub(i, 401| 6.06k| for_each_chunk_p_visitor{}, 402| 6.06k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 14.4k| if (!res) ------------------ | Branch (403:17): [True: 787, False: 13.6k] ------------------ 404| 787| return false; 405| 14.4k| } 406| 1.48k| return true; 407| 2.27k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_8full_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 336| 7.00k| { 337| 7.00k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 7.00k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_8full_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 475| { 330| 475| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 475| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_8full_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 857| { 330| 857| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 857| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_15regular_sub_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEENSt3__19enable_ifIXnt12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 419| 1.68k| { 420| 1.68k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 1.68k, False: 0] ------------------ 421| 1.68k| ? this_t::visit_regular(posl, posr.node()) 422| 1.68k| : this_t::visit_regular(posr, posl.node()); 423| 1.68k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 443| 12.5k| { 444| 12.5k| auto node = pos.node(); 445| 12.5k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 9.08k, False: 3.43k] | Branch (445:33): [True: 1.98k, False: 1.45k] ------------------ 446| 12.5k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 450| 22.9k| { 451| 22.9k| auto node = pos.node(); 452| 22.9k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 17.5k, False: 5.44k] | Branch (452:33): [True: 3.14k, False: 2.30k] ------------------ 453| 5.44k| node->leaf() + pos.count(), 454| 5.44k| other->leaf()); 455| 22.9k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 443| 10.3k| { 444| 10.3k| auto node = pos.node(); 445| 10.3k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 5.18k, False: 5.20k] | Branch (445:33): [True: 2.31k, False: 2.88k] ------------------ 446| 10.3k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 450| 3.00k| { 451| 3.00k| auto node = pos.node(); 452| 3.00k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.50k, False: 1.49k] | Branch (452:33): [True: 529, False: 968] ------------------ 453| 1.49k| node->leaf() + pos.count(), 454| 1.49k| other->leaf()); 455| 3.00k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 443| 3.21k| { 444| 3.21k| auto node = pos.node(); 445| 3.21k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 282, False: 2.93k] | Branch (445:33): [True: 1.59k, False: 1.33k] ------------------ 446| 3.21k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 112| 202k| { 113| 202k| auto data = as_const(pos.node()->leaf()); 114| 202k| return fn(data, data + pos.count()); 115| 202k| } _ZZN5immer6detail4rbts14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaOT_ENUlSE_T0_E_clIPKiSK_EEDaSE_SG_: 367| 1.11M| return [iter](auto f, auto e) mutable { 368| 1.11M| if (f == &*iter) { ------------------ | Branch (368:17): [True: 96.9k, False: 1.01M] ------------------ 369| 96.9k| iter += e - f; 370| 96.9k| return true; 371| 96.9k| } 372| 8.65M| for (; f != e; ++f, ++iter) ------------------ | Branch (372:20): [True: 7.64M, False: 1.00M] ------------------ 373| 7.64M| if (*f != *iter) ------------------ | Branch (373:21): [True: 5.95k, False: 7.64M] ------------------ 374| 5.95k| return false; 375| 1.00M| return true; 376| 1.01M| }; _ZN5immer6detail4rbts18region_for_visitorIiE11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 53| 4.26M| { 54| 4.26M| return pos.towards(this_t{}, idx); 55| 4.26M| } _ZN5immer6detail4rbts18region_for_visitorIiE10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 59| 944k| { 60| 944k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 944k| } _ZN5immer6detail4rbts18region_for_visitorIiE11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 53| 235k| { 54| 235k| return pos.towards(this_t{}, idx); 55| 235k| } _ZN5immer6detail4rbts18region_for_visitorIiE10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 59| 217k| { 60| 217k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 217k| } _ZN5immer6detail4rbts18region_for_visitorIiE11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 53| 233k| { 54| 233k| return pos.towards(this_t{}, idx); 55| 233k| } _ZN5immer6detail4rbts18region_for_visitorIiE10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 59| 18.4k| { 60| 18.4k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 18.4k| } _ZN5immer6detail4rbts18region_for_visitorIiE11visit_innerIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEENSt3__15tupleIJPimmEEEOT_m: 53| 32.5k| { 54| 32.5k| return pos.towards(this_t{}, idx); 55| 32.5k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 16.5k| { 107| 16.5k| return pos.each_pred(this_t{}, fn); 108| 16.5k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESH_RNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 826| { 330| 826| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 826| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESG_RNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEENSt3__19enable_ifIXnt12is_relaxed_vIT0_EEbE4typeEOT_OSM_OT1_m: 419| 8.88k| { 420| 8.88k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 8.88k, False: 0] ------------------ 421| 8.88k| ? this_t::visit_regular(posl, posr.node()) 422| 8.88k| : this_t::visit_regular(posr, posl.node()); 423| 8.88k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 112| 896k| { 113| 896k| auto data = as_const(pos.node()->leaf()); 114| 896k| return fn(data, data + pos.count()); 115| 896k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 15.2k| { 107| 15.2k| return pos.each_pred(this_t{}, fn); 108| 15.2k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 112| 13.0k| { 113| 13.0k| auto data = as_const(pos.node()->leaf()); 114| 13.0k| return fn(data, data + pos.count()); 115| 13.0k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 3.55k| { 107| 3.55k| return pos.each_pred(this_t{}, fn); 108| 3.55k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 4.37k| { 330| 4.37k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 4.37k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_15regular_sub_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 382| 3.80k| { 383| 3.80k| auto nl = posl.node(); 384| 3.80k| auto nr = posr.node(); 385| 3.80k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 3.80k] ------------------ 386| 0| return true; 387| 3.80k| auto cl = posl.count(); 388| 3.80k| auto cr = posr.count(); 389| 3.80k| assert(cr > 0); ------------------ | Branch (389:9): [True: 3.80k, False: 0] ------------------ 390| 3.80k| auto sbr = size_t{}; 391| 3.80k| auto i = count_t{}; 392| 3.80k| auto j = count_t{}; 393| 16.2k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 14.5k, False: 1.69k] ------------------ 394| 14.5k| auto sbl = posl.size_before(i); 395| 23.9k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 21.1k, False: 2.79k] | Branch (395:34): [True: 9.32k, False: 11.7k] ------------------ 396| 9.32k| ; 397| 14.5k| auto res = 398| 14.5k| sbl == sbr ------------------ | Branch (398:17): [True: 9.28k, False: 5.30k] ------------------ 399| 14.5k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 14.5k| : posl.nth_sub(i, 401| 5.30k| for_each_chunk_p_visitor{}, 402| 5.30k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 14.5k| if (!res) ------------------ | Branch (403:17): [True: 2.11k, False: 12.4k] ------------------ 404| 2.11k| return false; 405| 14.5k| } 406| 1.69k| return true; 407| 3.80k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 336| 11.7k| { 337| 11.7k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 11.7k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_13full_leaf_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 427| 11.7k| { 428| 11.7k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 8.61k, False: 3.11k] ------------------ 429| 8.61k| return true; 430| 3.11k| auto cl = posl.count(); 431| 3.11k| auto cr = posr.count(); 432| 3.11k| auto mp = std::min(cl, cr); 433| 3.11k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 2.53k, False: 577] ------------------ 434| 3.11k| posl.node()->leaf() + mp, 435| 3.11k| posr.node()->leaf()) && 436| 2.53k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 2.53k, False: 0] ------------------ 437| 2.53k| posl.node()->leaf() + posl.count(), 438| 2.53k| first + (idx + mp)); 439| 11.7k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEEEEbOT_jOT0_OT1_m: 329| 3.06k| { 330| 3.06k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 3.06k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_8full_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEbOT_OT0_OT1_m: 382| 1.55k| { 383| 1.55k| auto nl = posl.node(); 384| 1.55k| auto nr = posr.node(); 385| 1.55k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 1.55k] ------------------ 386| 0| return true; 387| 1.55k| auto cl = posl.count(); 388| 1.55k| auto cr = posr.count(); 389| 1.55k| assert(cr > 0); ------------------ | Branch (389:9): [True: 1.55k, False: 0] ------------------ 390| 1.55k| auto sbr = size_t{}; 391| 1.55k| auto i = count_t{}; 392| 1.55k| auto j = count_t{}; 393| 11.0k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 10.0k, False: 999] ------------------ 394| 10.0k| auto sbl = posl.size_before(i); 395| 18.2k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 17.4k, False: 759] | Branch (395:34): [True: 8.17k, False: 9.32k] ------------------ 396| 8.17k| ; 397| 10.0k| auto res = 398| 10.0k| sbl == sbr ------------------ | Branch (398:17): [True: 6.06k, False: 4.02k] ------------------ 399| 10.0k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 10.0k| : posl.nth_sub(i, 401| 4.02k| for_each_chunk_p_visitor{}, 402| 4.02k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 10.0k| if (!res) ------------------ | Branch (403:17): [True: 558, False: 9.52k] ------------------ 404| 558| return false; 405| 10.0k| } 406| 999| return true; 407| 1.55k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_8full_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEENSt3__19enable_ifIXnt12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 419| 1.50k| { 420| 1.50k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 1.50k, False: 0] ------------------ 421| 1.50k| ? this_t::visit_regular(posl, posr.node()) 422| 1.50k| : this_t::visit_regular(posr, posl.node()); 423| 1.50k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 136k| { 107| 136k| return pos.each_pred(this_t{}, fn); 108| 136k| } _ZN5immer6detail4rbts14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaOT_: 366| 76.8k| { 367| 76.8k| return [iter](auto f, auto e) mutable { 368| 76.8k| if (f == &*iter) { 369| 76.8k| iter += e - f; 370| 76.8k| return true; 371| 76.8k| } 372| 76.8k| for (; f != e; ++f, ++iter) 373| 76.8k| if (*f != *iter) 374| 76.8k| return false; 375| 76.8k| return true; 376| 76.8k| }; 377| 76.8k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_16rrbtree_iteratorIiSE_Lj3ELj3EEESF_EEbOT_OT0_PT1_jm: 349| 1.24k| { 350| 1.24k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 1.24k, False: 0] ------------------ 351| 1.24k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 987, False: 261] ------------------ 352| 1.24k| ? visit_maybe_relaxed_sub(rootl, 353| 987| shiftl, 354| 987| sizel, 355| 987| this_t{}, 356| 987| posr, 357| 987| first, 358| 987| size_t{}) 359| 1.24k| : posr.first_sub_inner( 360| 261| rrb{}, first, rootl, shiftl, sizel); 361| 1.24k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSE_Lj3ELj3EEESF_EEbOT_OT0_PT1_jm: 349| 8.31k| { 350| 8.31k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 8.31k, False: 0] ------------------ 351| 8.31k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 8.31k, False: 0] ------------------ 352| 8.31k| ? visit_maybe_relaxed_sub(rootl, 353| 8.31k| shiftl, 354| 8.31k| sizel, 355| 8.31k| this_t{}, 356| 8.31k| posr, 357| 8.31k| first, 358| 8.31k| size_t{}) 359| 8.31k| : posr.first_sub_inner( 360| 0| rrb{}, first, rootl, shiftl, sizel); 361| 8.31k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEESE_EEbOT_PT0_: 450| 6.92k| { 451| 6.92k| auto node = pos.node(); 452| 6.92k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.78k, False: 5.13k] | Branch (452:33): [True: 2.17k, False: 2.96k] ------------------ 453| 5.13k| node->leaf() + pos.count(), 454| 5.13k| other->leaf()); 455| 6.92k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_11dec_visitorEJEEEDcPT_jmT0_DpOT1_: 1838| 162M|{ 1839| 162M| assert(node); ------------------ | Branch (1839:5): [True: 162M, False: 0] ------------------ 1840| 162M| auto relaxed = node->relaxed(); 1841| 162M| if (relaxed) { ------------------ | Branch (1841:9): [True: 147M, False: 14.7M] ------------------ 1842| 147M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 147M, False: 0] ------------------ 1843| 147M| return make_relaxed_pos(node, shift, relaxed) 1844| 147M| .visit(v, std::forward(args)...); 1845| 147M| } else { 1846| 14.7M| return make_regular_sub_pos(node, shift, size) 1847| 14.7M| .visit(v, std::forward(args)...); 1848| 14.7M| } 1849| 162M|} _ZN5immer6detail4rbts16make_relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_11relaxed_posIT_EEPSE_jPNSE_9relaxed_tE: 1828| 417M|{ 1829| 417M| assert(node); ------------------ | Branch (1829:5): [True: 417M, False: 0] ------------------ 1830| 417M| assert(relaxed); ------------------ | Branch (1830:5): [True: 417M, False: 0] ------------------ 1831| 417M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1831:5): [True: 417M, False: 0] ------------------ 1832| 417M| return {node, shift, relaxed}; 1833| 417M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1813| 168M| { 1814| 168M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 168M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 1431| 281M| node_t* node() const { return node_; } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 1476| 33.7M| { 1477| 33.7M| each_left(v, relaxed_->d.count, args...); 1478| 33.7M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1623| 33.9M| { 1624| 33.9M| auto p = node_->inner(); 1625| 33.9M| auto s = size_t{}; 1626| 33.9M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 7.43M, False: 26.5M] ------------------ 1627| 60.6M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 53.2M, False: 7.43M] ------------------ 1628| 53.2M| IMMER_PREFETCH(p + i + 1); 1629| 53.2M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 53.2M| .visit(v, args...); 1631| 53.2M| s = relaxed_->d.sizes[i]; 1632| 53.2M| assert(s); ------------------ | Branch (1632:17): [True: 53.2M, False: 0] ------------------ 1633| 53.2M| } 1634| 26.5M| } else { 1635| 26.5M| auto ss = shift_ - B; 1636| 187M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 160M, False: 26.5M] ------------------ 1637| 160M| visit_maybe_relaxed_sub( 1638| 160M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 160M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 160M, False: 0] ------------------ 1641| 160M| } 1642| 26.5M| } 1643| 33.9M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 1430| 257M| count_t count() const { return relaxed_->d.count; } _ZN5immer6detail4rbts20make_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_15regular_sub_posIT_EEPSE_jm: 1044| 25.9M|{ 1045| 25.9M| assert(node); ------------------ | Branch (1045:5): [True: 25.9M, False: 0] ------------------ 1046| 25.9M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1046:5): [True: 25.9M, False: 0] ------------------ 1047| 25.9M| assert(size > 0); ------------------ | Branch (1047:5): [True: 25.9M, False: 0] ------------------ 1048| 25.9M| assert(size <= (branches << shift)); ------------------ | Branch (1048:5): [True: 25.9M, False: 0] ------------------ 1049| 25.9M| return {node, shift, size}; 1050| 25.9M|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1036| 14.7M| { 1037| 14.7M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 14.7M| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 785| 25.7M| node_t* node() const { return node_; } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 825| 432k| { 826| 432k| return each_regular(*this, v, args...); 827| 432k| } _ZN5immer6detail4rbts12each_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_11dec_visitorEJEEEvOT_T0_DpOT1_: 343| 432k|{ 344| 432k| constexpr auto B = bits; 345| 432k| constexpr auto BL = bits_leaf; 346| 432k| auto n = p.node()->inner(); 347| 432k| auto last = p.count() - 1; 348| 432k| auto e = n + last; 349| 432k| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 96.4k, False: 336k] ------------------ 350| 230k| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 133k, False: 96.4k] ------------------ 351| 133k| IMMER_PREFETCH(n + 1); 352| 133k| make_full_leaf_pos(*n).visit(v, args...); 353| 133k| } 354| 96.4k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 336k| } else { 356| 336k| auto ss = p.shift() - B; 357| 1.21M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 876k, False: 336k] ------------------ 358| 876k| make_full_pos(*n, ss).visit(v, args...); 359| 336k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 336k| } 361| 432k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 787| 10.0M| shift_t shift() const { return shift_; } _ZN5immer6detail4rbts18make_full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_13full_leaf_posIT_EEPSE_: 214| 14.2M|{ 215| 14.2M| assert(node); ------------------ | Branch (215:5): [True: 14.2M, False: 0] ------------------ 216| 14.2M| return {node}; 217| 14.2M|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 207| 1.66M| { 208| 1.66M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.66M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 199| 8.45M| node_t* node() const { return node_; } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 198| 13.1M| count_t count() const { return branches; } _ZN5immer6detail4rbts13make_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_8leaf_posIT_EEPSE_m: 119| 1.56M|{ 120| 1.56M| assert(node); ------------------ | Branch (120:5): [True: 1.56M, False: 0] ------------------ 121| 1.56M| assert(size > 0); ------------------ | Branch (121:5): [True: 1.56M, False: 0] ------------------ 122| 1.56M| return {node, size}; 123| 1.56M|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 786| 7.32M| size_t size() const { return size_; } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 112| 397k| { 113| 397k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 397k| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 104| 1.57M| node_t* node() const { return node_; } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 103| 2.31M| count_t count() const { return index(size_ - 1) + 1; } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 107| 2.38M| count_t index(size_t idx) const { return idx & mask; } _ZN5immer6detail4rbts13make_full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_8full_posIT_EEPSE_j: 1412| 4.35M|{ 1413| 4.35M| assert(node); ------------------ | Branch (1413:5): [True: 4.35M, False: 0] ------------------ 1414| 4.35M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1414:5): [True: 4.35M, False: 0] ------------------ 1415| 4.35M| return {node, shift}; 1416| 4.35M|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1405| 2.85M| { 1406| 2.85M| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.85M| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 1159| 3.50M| node_t* node() const { return node_; } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 1185| 94.8k| { 1186| 94.8k| auto p = node_->inner(); 1187| 94.8k| auto e = p + branches; 1188| 94.8k| if (shift_ == BL) { ------------------ | Branch (1188:13): [True: 82.5k, False: 12.2k] ------------------ 1189| 743k| for (; p != e; ++p) { ------------------ | Branch (1189:20): [True: 660k, False: 82.5k] ------------------ 1190| 660k| IMMER_PREFETCH(p + 1); 1191| 660k| make_full_leaf_pos(*p).visit(v, args...); 1192| 660k| } 1193| 82.5k| } else { 1194| 12.2k| auto ss = shift_ - B; 1195| 110k| for (; p != e; ++p) ------------------ | Branch (1195:20): [True: 97.8k, False: 12.2k] ------------------ 1196| 97.8k| make_full_pos(*p, ss).visit(v, args...); 1197| 12.2k| } 1198| 94.8k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 1158| 1.31M| count_t count() const { return branches; } _ZN5immer6detail4rbts16make_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_11regular_posIT_EEPSE_jm: 690| 2.93M|{ 691| 2.93M| assert(node); ------------------ | Branch (691:5): [True: 2.93M, False: 0] ------------------ 692| 2.93M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (692:5): [True: 2.93M, False: 0] ------------------ 693| 2.93M| assert(size > 0); ------------------ | Branch (693:5): [True: 2.93M, False: 0] ------------------ 694| 2.93M| return {node, shift, size}; 695| 2.93M|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 336| 962k| { 337| 962k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 962k| } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 231| 5.15M| node_t* node() const { return node_; } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 243| 914k| { 244| 914k| return each_regular(*this, v, args...); 245| 914k| } _ZN5immer6detail4rbts12each_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_11dec_visitorEJEEEvOT_T0_DpOT1_: 343| 914k|{ 344| 914k| constexpr auto B = bits; 345| 914k| constexpr auto BL = bits_leaf; 346| 914k| auto n = p.node()->inner(); 347| 914k| auto last = p.count() - 1; 348| 914k| auto e = n + last; 349| 914k| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 296k, False: 617k] ------------------ 350| 1.15M| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 854k, False: 296k] ------------------ 351| 854k| IMMER_PREFETCH(n + 1); 352| 854k| make_full_leaf_pos(*n).visit(v, args...); 353| 854k| } 354| 296k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 617k| } else { 356| 617k| auto ss = p.shift() - B; 357| 2.48M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 1.86M, False: 617k] ------------------ 358| 1.86M| make_full_pos(*n, ss).visit(v, args...); 359| 617k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 617k| } 361| 914k|} _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 233| 4.83M| shift_t shift() const { return shift_; } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 232| 7.96M| size_t size() const { return size_; } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 230| 3.22M| count_t count() const { return index(size_ - 1) + 1; } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 234| 7.15M| count_t index(size_t idx) const { return (idx >> shift_) & mask; } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 784| 19.8M| count_t count() const { return subindex(size_ - 1) + 1; } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8subindexEm: 789| 23.4M| count_t subindex(size_t idx) const { return idx >> shift_; } _ZN5immer6detail4rbts22make_empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_17empty_regular_posIT_EEPSE_: 64| 1.46M|{ 65| 1.46M| return {node}; 66| 1.46M|} _ZN5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 57| 1.46M| { 58| 1.46M| return Visitor::visit_regular(*this, std::forward(args)...); 59| 1.46M| } _ZNK5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 41| 1.46M| node_t* node() const { return node_; } _ZN5immer6detail4rbts17make_leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_12leaf_sub_posIT_EEPSE_j: 151| 77.7M|{ 152| 77.7M| assert(node); ------------------ | Branch (152:5): [True: 77.7M, False: 0] ------------------ 153| 77.7M| assert(count <= branches); ------------------ | Branch (153:5): [True: 77.7M, False: 0] ------------------ 154| 77.7M| return {node, count}; 155| 77.7M|} _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 144| 58.5M| { 145| 58.5M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 58.5M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 136| 70.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: 135| 20.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_: 88| 1.32M|{ 89| 1.32M| assert(node); ------------------ | Branch (89:5): [True: 1.32M, False: 0] ------------------ 90| 1.32M| return {node}; 91| 1.32M|} _ZN5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 81| 1.32M| { 82| 1.32M| return Visitor::visit_leaf(*this, std::forward(args)...); 83| 1.32M| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4nodeEv: 75| 1.32M| node_t* node() const { return node_; } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5countEv: 74| 7.29k| count_t count() const { return 0; } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcT_DpOT0_: 1813| 215k| { 1814| 215k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 215k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 1433| 26.4M| shift_t shift() const { return shift_; } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEj: 1443| 12.6M| { 1444| 12.6M| return size_sbh(offset, size_before(offset)); 1445| 12.6M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8size_sbhEjm: 1448| 12.9M| { 1449| 12.9M| assert(size_before_hint == size_before(offset)); ------------------ | Branch (1449:9): [True: 12.9M, False: 0] ------------------ 1450| 12.9M| return relaxed_->d.sizes[offset] - size_before_hint; 1451| 12.9M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11size_beforeEj: 1438| 46.3M| { 1439| 46.3M| return offset ? relaxed_->d.sizes[offset - 1] : 0; ------------------ | Branch (1439:16): [True: 30.3M, False: 15.9M] ------------------ 1440| 46.3M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11last_oh_cshINS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcT_jmDpOT0_: 1737| 200k| { 1738| 200k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 200k, False: 0] ------------------ 1739| 200k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 200k, False: 0] ------------------ 1740| 200k| auto child = node_->inner()[offset_hint]; 1741| 200k| auto is_leaf = shift_ == BL; 1742| 200k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 200k] ------------------ 1743| 200k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 200k| : visit_maybe_relaxed_sub( 1745| 200k| child, shift_ - B, child_size_hint, v, args...); 1746| 200k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcPT_jmT0_DpOT1_: 1838| 200k|{ 1839| 200k| assert(node); ------------------ | Branch (1839:5): [True: 200k, False: 0] ------------------ 1840| 200k| auto relaxed = node->relaxed(); 1841| 200k| if (relaxed) { ------------------ | Branch (1841:9): [True: 154k, False: 46.1k] ------------------ 1842| 154k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 154k, False: 0] ------------------ 1843| 154k| return make_relaxed_pos(node, shift, relaxed) 1844| 154k| .visit(v, std::forward(args)...); 1845| 154k| } else { 1846| 46.1k| return make_regular_sub_pos(node, shift, size) 1847| 46.1k| .visit(v, std::forward(args)...); 1848| 46.1k| } 1849| 200k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcT_DpOT0_: 1036| 46.1k| { 1037| 46.1k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 46.1k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 788| 2.02M| count_t index(size_t idx) const { return (idx >> shift_) & mask; } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7last_ohINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_jDpOT0_: 952| 302k| { 953| 302k| return last_oh_regular(*this, v, offset_hint, args...); 954| 302k| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_17push_tail_visitorISD_EEJRPSD_EEEDcOT_T0_jDpOT1_: 677| 302k|{ 678| 302k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 302k, False: 0] ------------------ 679| 302k| constexpr auto B = bits; 680| 302k| constexpr auto BL = bits_leaf; 681| 302k| auto child = p.node()->inner()[offset_hint]; 682| 302k| auto is_leaf = p.shift() == BL; 683| 302k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 302k] ------------------ 684| 302k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 302k| .visit(v, args...); 686| 302k|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_DpOT0_: 336| 872k| { 337| 872k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 872k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7last_ohINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_jDpOT0_: 330| 570k| { 331| 570k| return last_oh_regular(*this, v, offset_hint, args...); 332| 570k| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_17push_tail_visitorISD_EEJRPSD_EEEDcOT_T0_jDpOT1_: 677| 570k|{ 678| 570k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 570k, False: 0] ------------------ 679| 570k| constexpr auto B = bits; 680| 570k| constexpr auto BL = bits_leaf; 681| 570k| auto child = p.node()->inner()[offset_hint]; 682| 570k| auto is_leaf = p.shift() == BL; 683| 570k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 570k] ------------------ 684| 570k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 570k| .visit(v, args...); 686| 570k|} _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 1432| 111M| size_t size() const { return relaxed_->d.sizes[relaxed_->d.count - 1]; } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_DpOT0_: 1036| 286k| { 1037| 286k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 286k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_DpOT0_: 144| 70.3k| { 145| 70.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 70.3k| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 139| 1.14M| count_t index(size_t idx) const { return idx & mask; } flex-vector-bo.cpp:_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSJ_E_EEEDcPSJ_jmT0_DpOT1_: 1838| 253k|{ 1839| 253k| assert(node); ------------------ | Branch (1839:5): [True: 253k, False: 0] ------------------ 1840| 253k| auto relaxed = node->relaxed(); 1841| 253k| if (relaxed) { ------------------ | Branch (1841:9): [True: 198k, False: 55.1k] ------------------ 1842| 198k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 198k, False: 0] ------------------ 1843| 198k| return make_relaxed_pos(node, shift, relaxed) 1844| 198k| .visit(v, std::forward(args)...); 1845| 198k| } else { 1846| 55.1k| return make_regular_sub_pos(node, shift, size) 1847| 55.1k| .visit(v, std::forward(args)...); 1848| 55.1k| } 1849| 253k|} flex-vector-bo.cpp:_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 1813| 198k| { 1814| 198k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 198k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 1454| 15.0M| { 1455| 15.0M| auto offset = idx >> shift_; 1456| 21.1M| while (relaxed_->d.sizes[offset] <= idx) ------------------ | Branch (1456:16): [True: 6.07M, False: 15.0M] ------------------ 1457| 6.07M| ++offset; 1458| 15.0M| return offset; 1459| 15.0M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7relaxedEv: 1435| 198k| relaxed_t* relaxed() const { return relaxed_; } flex-vector-bo.cpp:_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjDpOT0_: 1686| 198k| { 1687| 198k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 198k, False: 0] ------------------ 1688| 198k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 24.0k, False: 174k] ------------------ 1689| 198k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 198k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjmDpOT0_: 1698| 198k| { 1699| 198k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 198k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjmDpOT0_: 1717| 198k| { 1718| 198k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 198k, False: 0] ------------------ 1719| 198k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 24.0k, False: 174k] | Branch (1719:9): [True: 198k, False: 0] ------------------ 1720| 198k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 198k| auto child = node_->inner()[offset_hint]; 1722| 198k| auto is_leaf = shift_ == BL; 1723| 198k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 198k| auto next_idx = idx - left_size_hint; 1725| 198k| return is_leaf ------------------ | Branch (1725:16): [True: 43.9k, False: 154k] ------------------ 1726| 198k| ? make_leaf_sub_pos(child, next_size) 1727| 43.9k| .visit(v, next_idx, args...) 1728| 198k| : visit_maybe_relaxed_sub( 1729| 154k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 198k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 144| 43.9k| { 145| 43.9k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 43.9k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 1036| 55.1k| { 1037| 55.1k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 55.1k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_: 938| 55.1k| { 939| 55.1k| return towards_oh_ch_regular( 940| 55.1k| *this, v, idx, offset_hint, count(), args...); 941| 55.1k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_14update_visitorISD_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcOSL_T0_mjjDpOT1_: 632| 55.1k|{ 633| 55.1k| constexpr auto B = bits; 634| 55.1k| constexpr auto BL = bits_leaf; 635| 55.1k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 55.1k, False: 0] ------------------ 636| 55.1k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 55.1k, False: 0] ------------------ 637| 55.1k| auto is_leaf = p.shift() == BL; 638| 55.1k| auto child = p.node()->inner()[offset_hint]; 639| 55.1k| auto is_full = offset_hint + 1 != count_hint; 640| 55.1k| return is_full ------------------ | Branch (640:12): [True: 10.2k, False: 44.8k] ------------------ 641| 55.1k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 3.15k, False: 7.14k] ------------------ 642| 10.2k| : make_full_pos(child, p.shift() - B) 643| 7.14k| .visit(v, idx, args...)) 644| 55.1k| : (is_leaf ------------------ | Branch (644:19): [True: 41.1k, False: 3.68k] ------------------ 645| 44.8k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 44.8k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.68k| .visit(v, idx, args...)); 648| 55.1k|} flex-vector-bo.cpp:_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 207| 12.6k| { 208| 12.6k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 12.6k| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 202| 276k| count_t index(size_t idx) const { return idx & mask; } flex-vector-bo.cpp:_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 1405| 12.4k| { 1406| 12.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 12.4k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5indexEm: 1162| 553k| count_t index(size_t idx) const { return (idx >> shift_) & mask; } flex-vector-bo.cpp:_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_: 1329| 12.4k| { 1330| 12.4k| return towards_oh(v, idx, offset_hint, args...); 1331| 12.4k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjDpOT0_: 1336| 12.4k| { 1337| 12.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 12.4k, False: 0] ------------------ 1338| 12.4k| auto is_leaf = shift_ == BL; 1339| 12.4k| auto child = node_->inner()[offset_hint]; 1340| 12.4k| return is_leaf ------------------ | Branch (1340:16): [True: 8.40k, False: 4.00k] ------------------ 1341| 12.4k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 12.4k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 12.4k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 112| 42.5k| { 113| 42.5k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 42.5k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 336| 4.16k| { 337| 4.16k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.16k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_: 316| 4.16k| { 317| 4.16k| return towards_oh_ch_regular( 318| 4.16k| *this, v, idx, offset_hint, count(), args...); 319| 4.16k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_14update_visitorISD_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcOSL_T0_mjjDpOT1_: 632| 4.16k|{ 633| 4.16k| constexpr auto B = bits; 634| 4.16k| constexpr auto BL = bits_leaf; 635| 4.16k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.16k, False: 0] ------------------ 636| 4.16k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.16k, False: 0] ------------------ 637| 4.16k| auto is_leaf = p.shift() == BL; 638| 4.16k| auto child = p.node()->inner()[offset_hint]; 639| 4.16k| auto is_full = offset_hint + 1 != count_hint; 640| 4.16k| return is_full ------------------ | Branch (640:12): [True: 2.33k, False: 1.82k] ------------------ 641| 4.16k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.07k, False: 1.26k] ------------------ 642| 2.33k| : make_full_pos(child, p.shift() - B) 643| 1.26k| .visit(v, idx, args...)) 644| 4.16k| : (is_leaf ------------------ | Branch (644:19): [True: 1.34k, False: 481] ------------------ 645| 1.82k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.82k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 481| .visit(v, idx, args...)); 648| 4.16k|} _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 43.2k|{ 1839| 43.2k| assert(node); ------------------ | Branch (1839:5): [True: 43.2k, False: 0] ------------------ 1840| 43.2k| auto relaxed = node->relaxed(); 1841| 43.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 34.9k, False: 8.31k] ------------------ 1842| 34.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 34.9k, False: 0] ------------------ 1843| 34.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 34.9k| .visit(v, std::forward(args)...); 1845| 34.9k| } else { 1846| 8.31k| return make_regular_sub_pos(node, shift, size) 1847| 8.31k| .visit(v, std::forward(args)...); 1848| 8.31k| } 1849| 43.2k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 34.9k| { 1814| 34.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 34.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_: 1686| 27.0k| { 1687| 27.0k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 27.0k, False: 0] ------------------ 1688| 27.0k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 27.0k] ------------------ 1689| 27.0k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 27.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1698| 27.0k| { 1699| 27.0k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 27.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1717| 27.0k| { 1718| 27.0k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 27.0k, False: 0] ------------------ 1719| 27.0k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 27.0k] | Branch (1719:9): [True: 27.0k, False: 0] ------------------ 1720| 27.0k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 27.0k| auto child = node_->inner()[offset_hint]; 1722| 27.0k| auto is_leaf = shift_ == BL; 1723| 27.0k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 27.0k| auto next_idx = idx - left_size_hint; 1725| 27.0k| return is_leaf ------------------ | Branch (1725:16): [True: 1.77k, False: 25.2k] ------------------ 1726| 27.0k| ? make_leaf_sub_pos(child, next_size) 1727| 1.77k| .visit(v, next_idx, args...) 1728| 27.0k| : visit_maybe_relaxed_sub( 1729| 25.2k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 27.0k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 144| 1.77k| { 145| 1.77k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.77k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1686| 11.7k| { 1687| 11.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 11.7k, False: 0] ------------------ 1688| 11.7k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 10.0k, False: 1.73k] ------------------ 1689| 11.7k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 11.7k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1698| 11.7k| { 1699| 11.7k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 11.7k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1717| 11.7k| { 1718| 11.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 11.7k, False: 0] ------------------ 1719| 11.7k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 10.0k, False: 1.73k] | Branch (1719:9): [True: 11.7k, False: 0] ------------------ 1720| 11.7k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 11.7k| auto child = node_->inner()[offset_hint]; 1722| 11.7k| auto is_leaf = shift_ == BL; 1723| 11.7k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 11.7k| auto next_idx = idx - left_size_hint; 1725| 11.7k| return is_leaf ------------------ | Branch (1725:16): [True: 4.45k, False: 7.28k] ------------------ 1726| 11.7k| ? make_leaf_sub_pos(child, next_size) 1727| 4.45k| .visit(v, next_idx, args...) 1728| 11.7k| : visit_maybe_relaxed_sub( 1729| 7.28k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 11.7k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 144| 4.45k| { 145| 4.45k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.45k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 7.28k|{ 1839| 7.28k| assert(node); ------------------ | Branch (1839:5): [True: 7.28k, False: 0] ------------------ 1840| 7.28k| auto relaxed = node->relaxed(); 1841| 7.28k| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.84k, False: 3.43k] ------------------ 1842| 3.84k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.84k, False: 0] ------------------ 1843| 3.84k| return make_relaxed_pos(node, shift, relaxed) 1844| 3.84k| .visit(v, std::forward(args)...); 1845| 3.84k| } else { 1846| 3.43k| return make_regular_sub_pos(node, shift, size) 1847| 3.43k| .visit(v, std::forward(args)...); 1848| 3.43k| } 1849| 7.28k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1813| 3.84k| { 1814| 3.84k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.84k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1036| 3.43k| { 1037| 3.43k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.43k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 927| 6.21k| { 928| 6.21k| return towards_oh_ch_regular( 929| 6.21k| *this, v, idx, offset_hint, count(), args...); 930| 6.21k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_19slice_right_visitorISD_Lb0EEEJEEEDcOT_T0_mjjDpOT1_: 632| 6.21k|{ 633| 6.21k| constexpr auto B = bits; 634| 6.21k| constexpr auto BL = bits_leaf; 635| 6.21k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.21k, False: 0] ------------------ 636| 6.21k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.21k, False: 0] ------------------ 637| 6.21k| auto is_leaf = p.shift() == BL; 638| 6.21k| auto child = p.node()->inner()[offset_hint]; 639| 6.21k| auto is_full = offset_hint + 1 != count_hint; 640| 6.21k| return is_full ------------------ | Branch (640:12): [True: 2.44k, False: 3.76k] ------------------ 641| 6.21k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.49k, False: 957] ------------------ 642| 2.44k| : make_full_pos(child, p.shift() - B) 643| 957| .visit(v, idx, args...)) 644| 6.21k| : (is_leaf ------------------ | Branch (644:19): [True: 1.12k, False: 2.64k] ------------------ 645| 3.76k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.76k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.64k| .visit(v, idx, args...)); 648| 6.21k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 207| 6.63k| { 208| 6.63k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 6.63k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1405| 2.37k| { 1406| 2.37k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.37k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1336| 5.38k| { 1337| 5.38k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 5.38k, False: 0] ------------------ 1338| 5.38k| auto is_leaf = shift_ == BL; 1339| 5.38k| auto child = node_->inner()[offset_hint]; 1340| 5.38k| return is_leaf ------------------ | Branch (1340:16): [True: 4.51k, False: 871] ------------------ 1341| 5.38k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 5.38k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 5.38k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 1161| 55.9k| shift_t shift() const { return shift_; } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 112| 2.59k| { 113| 2.59k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.59k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 336| 3.21k| { 337| 3.21k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.21k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 305| 3.21k| { 306| 3.21k| return towards_oh_ch_regular( 307| 3.21k| *this, v, idx, offset_hint, count(), args...); 308| 3.21k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_19slice_right_visitorISD_Lb0EEEJEEEDcOT_T0_mjjDpOT1_: 632| 3.21k|{ 633| 3.21k| constexpr auto B = bits; 634| 3.21k| constexpr auto BL = bits_leaf; 635| 3.21k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.21k, False: 0] ------------------ 636| 3.21k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.21k, False: 0] ------------------ 637| 3.21k| auto is_leaf = p.shift() == BL; 638| 3.21k| auto child = p.node()->inner()[offset_hint]; 639| 3.21k| auto is_full = offset_hint + 1 != count_hint; 640| 3.21k| return is_full ------------------ | Branch (640:12): [True: 1.17k, False: 2.04k] ------------------ 641| 3.21k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 629, False: 543] ------------------ 642| 1.17k| : make_full_pos(child, p.shift() - B) 643| 543| .visit(v, idx, args...)) 644| 3.21k| : (is_leaf ------------------ | Branch (644:19): [True: 1.47k, False: 566] ------------------ 645| 2.04k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.04k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 566| .visit(v, idx, args...)); 648| 3.21k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1036| 8.31k| { 1037| 8.31k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.31k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 927| 5.53k| { 928| 5.53k| return towards_oh_ch_regular( 929| 5.53k| *this, v, idx, offset_hint, count(), args...); 930| 5.53k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_19slice_right_visitorISD_Lb1EEEJEEEDcOT_T0_mjjDpOT1_: 632| 5.53k|{ 633| 5.53k| constexpr auto B = bits; 634| 5.53k| constexpr auto BL = bits_leaf; 635| 5.53k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.53k, False: 0] ------------------ 636| 5.53k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.53k, False: 0] ------------------ 637| 5.53k| auto is_leaf = p.shift() == BL; 638| 5.53k| auto child = p.node()->inner()[offset_hint]; 639| 5.53k| auto is_full = offset_hint + 1 != count_hint; 640| 5.53k| return is_full ------------------ | Branch (640:12): [True: 4.79k, False: 740] ------------------ 641| 5.53k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 995, False: 3.79k] ------------------ 642| 4.79k| : make_full_pos(child, p.shift() - B) 643| 3.79k| .visit(v, idx, args...)) 644| 5.53k| : (is_leaf ------------------ | Branch (644:19): [True: 740, False: 0] ------------------ 645| 740| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 740| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 5.53k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 207| 1.77k| { 208| 1.77k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.77k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1405| 6.09k| { 1406| 6.09k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 6.09k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 1336| 3.07k| { 1337| 3.07k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 3.07k, False: 0] ------------------ 1338| 3.07k| auto is_leaf = shift_ == BL; 1339| 3.07k| auto child = node_->inner()[offset_hint]; 1340| 3.07k| return is_leaf ------------------ | Branch (1340:16): [True: 780, False: 2.29k] ------------------ 1341| 3.07k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 3.07k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 3.07k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 112| 740| { 113| 740| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 740| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 32.2k|{ 1839| 32.2k| assert(node); ------------------ | Branch (1839:5): [True: 32.2k, False: 0] ------------------ 1840| 32.2k| auto relaxed = node->relaxed(); 1841| 32.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 23.3k, False: 8.92k] ------------------ 1842| 23.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 23.3k, False: 0] ------------------ 1843| 23.3k| return make_relaxed_pos(node, shift, relaxed) 1844| 23.3k| .visit(v, std::forward(args)...); 1845| 23.3k| } else { 1846| 8.92k| return make_regular_sub_pos(node, shift, size) 1847| 8.92k| .visit(v, std::forward(args)...); 1848| 8.92k| } 1849| 32.2k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 23.3k| { 1814| 23.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 23.3k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8subindexEm: 1434| 4.62M| count_t subindex(size_t idx) const { return index(idx); } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 1705| 4.12k| { 1706| 4.12k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 4.12k, False: 0] ------------------ 1707| 4.12k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 3.81k, False: 311] ------------------ 1708| 4.12k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 4.12k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_18slice_left_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1717| 4.12k| { 1718| 4.12k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 4.12k, False: 0] ------------------ 1719| 4.12k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.81k, False: 311] | Branch (1719:9): [True: 4.12k, False: 0] ------------------ 1720| 4.12k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 4.12k| auto child = node_->inner()[offset_hint]; 1722| 4.12k| auto is_leaf = shift_ == BL; 1723| 4.12k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 4.12k| auto next_idx = idx - left_size_hint; 1725| 4.12k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 4.12k] ------------------ 1726| 4.12k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 4.12k| : visit_maybe_relaxed_sub( 1729| 4.12k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 4.12k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1705| 105k| { 1706| 105k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 105k, False: 0] ------------------ 1707| 105k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 31.1k, False: 74.0k] ------------------ 1708| 105k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 105k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1717| 105k| { 1718| 105k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 105k, False: 0] ------------------ 1719| 105k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 31.1k, False: 74.0k] | Branch (1719:9): [True: 105k, False: 0] ------------------ 1720| 105k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 105k| auto child = node_->inner()[offset_hint]; 1722| 105k| auto is_leaf = shift_ == BL; 1723| 105k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 105k| auto next_idx = idx - left_size_hint; 1725| 105k| return is_leaf ------------------ | Branch (1725:16): [True: 17.3k, False: 87.8k] ------------------ 1726| 105k| ? make_leaf_sub_pos(child, next_size) 1727| 17.3k| .visit(v, next_idx, args...) 1728| 105k| : visit_maybe_relaxed_sub( 1729| 87.8k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 105k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 144| 17.3k| { 145| 17.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 17.3k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 87.8k|{ 1839| 87.8k| assert(node); ------------------ | Branch (1839:5): [True: 87.8k, False: 0] ------------------ 1840| 87.8k| auto relaxed = node->relaxed(); 1841| 87.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 86.0k, False: 1.84k] ------------------ 1842| 86.0k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 86.0k, False: 0] ------------------ 1843| 86.0k| return make_relaxed_pos(node, shift, relaxed) 1844| 86.0k| .visit(v, std::forward(args)...); 1845| 86.0k| } else { 1846| 1.84k| return make_regular_sub_pos(node, shift, size) 1847| 1.84k| .visit(v, std::forward(args)...); 1848| 1.84k| } 1849| 87.8k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1813| 86.0k| { 1814| 86.0k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 86.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_: 1036| 1.84k| { 1037| 1.84k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.84k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11size_beforeEj: 791| 1.85M| { 792| 1.85M| return size_t{offset} << shift_; 793| 1.85M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8size_sbhEjm: 803| 21.5k| { 804| 21.5k| assert(size_before_hint == size_before(offset)); ------------------ | Branch (804:9): [True: 21.5k, False: 0] ------------------ 805| 21.5k| return offset == subindex(size_ - 1) ? size_ - size_before_hint ------------------ | Branch (805:16): [True: 8.84k, False: 12.6k] ------------------ 806| 21.5k| : size_t{1} << shift_; 807| 21.5k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 946| 9.81k| { 947| 9.81k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 9.81k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_18slice_left_visitorISD_Lb0EEEJEEEDcOT_T0_mjDpOT1_: 653| 9.81k|{ 654| 9.81k| constexpr auto B = bits; 655| 9.81k| constexpr auto BL = bits_leaf; 656| 9.81k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 9.81k, False: 0] ------------------ 657| 9.81k| auto is_leaf = p.shift() == BL; 658| 9.81k| auto child = p.node()->inner()[offset_hint]; 659| 9.81k| auto lsize = offset_hint << p.shift(); 660| 9.81k| auto size = p.this_size(); 661| 9.81k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 9.81k| return is_full ------------------ | Branch (662:12): [True: 9.81k, False: 0] ------------------ 663| 9.81k| ? (is_leaf ------------------ | Branch (663:19): [True: 4.96k, False: 4.84k] ------------------ 664| 9.81k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 9.81k| : make_full_pos(child, p.shift() - B) 666| 4.84k| .visit(v, idx - lsize, args...)) 667| 9.81k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 0] ------------------ 668| 0| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 0| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 0| .visit(v, idx - lsize, args...)); 672| 9.81k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9this_sizeEv: 794| 21.5k| size_t this_size() const { return size_; } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJmEEEDcT_DpOT0_: 207| 10.7k| { 208| 10.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 10.7k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJmEEEDcT_DpOT0_: 1405| 8.19k| { 1406| 8.19k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 8.19k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8subindexEm: 1163| 11.5k| count_t subindex(size_t idx) const { return idx >> shift_; } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11size_beforeEj: 1170| 43.4k| { 1171| 43.4k| return size_t{offset} << shift_; 1172| 43.4k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8size_sbhEjm: 1166| 11.5k| { 1167| 11.5k| return size_t{1} << shift_; 1168| 11.5k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1348| 9.14k| { 1349| 9.14k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 9.14k, False: 0] ------------------ 1350| 9.14k| auto is_leaf = shift_ == BL; 1351| 9.14k| auto child = node_->inner()[offset_hint]; 1352| 9.14k| auto lsize = size_t{offset_hint} << shift_; 1353| 9.14k| return is_leaf ------------------ | Branch (1353:16): [True: 5.79k, False: 3.35k] ------------------ 1354| 9.14k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 9.14k| : make_full_pos(child, shift_ - B) 1356| 3.35k| .visit(v, idx - lsize, args...); 1357| 9.14k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 1175| 11.5k| { 1176| 11.5k| auto e = sizes + n; 1177| 66.7k| for (; sizes != e; ++sizes) { ------------------ | Branch (1177:16): [True: 55.1k, False: 11.5k] ------------------ 1178| 55.1k| init = *sizes = init + (size_t{1} << shift_); 1179| | assert(init); ------------------ | Branch (1179:13): [True: 55.1k, False: 0] ------------------ 1180| 55.1k| } 1181| 11.5k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 1160| 589k| size_t size() const { return branches << shift_; } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 810| 3.53M| { 811| 3.53M| if (n) { ------------------ | Branch (811:13): [True: 3.53M, False: 4.60k] ------------------ 812| 3.53M| auto last = offset + n - 1; 813| 3.53M| auto e = sizes + n - 1; 814| 14.1M| for (; sizes != e; ++sizes) { ------------------ | Branch (814:20): [True: 10.5M, False: 3.53M] ------------------ 815| 10.5M| init = *sizes = init + (size_t{1} << shift_); 816| 10.5M| assert(init); ------------------ | Branch (816:17): [True: 10.5M, False: 0] ------------------ 817| 10.5M| } 818| 3.53M| *sizes = init + size(last); 819| | assert(*sizes); ------------------ | Branch (819:13): [True: 3.53M, False: 0] ------------------ 820| 3.53M| } 821| 3.53M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEj: 797| 3.55M| { 798| 3.55M| return offset == subindex(size_ - 1) ? size_ - size_before(offset) ------------------ | Branch (798:16): [True: 1.77M, False: 1.77M] ------------------ 799| 3.55M| : size_t{1} << shift_; 800| 3.55M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10copy_sizesEjjmPm: 1462| 20.0M| { 1463| 20.0M| auto e = sizes + n; 1464| 20.0M| auto prev = size_before(offset); 1465| 20.0M| auto these = relaxed_->d.sizes + offset; 1466| 92.1M| for (; sizes != e; ++sizes, ++these) { ------------------ | Branch (1466:16): [True: 72.1M, False: 20.0M] ------------------ 1467| 72.1M| auto this_size = *these; 1468| 72.1M| init = *sizes = init + (this_size - prev); 1469| 72.1M| assert(init); ------------------ | Branch (1469:13): [True: 72.1M, False: 0] ------------------ 1470| 72.1M| prev = this_size; 1471| 72.1M| } 1472| 20.0M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1036| 8.92k| { 1037| 8.92k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.92k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 946| 2.71k| { 947| 2.71k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 2.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_Lb1EEEJEEEDcOT_T0_mjDpOT1_: 653| 2.71k|{ 654| 2.71k| constexpr auto B = bits; 655| 2.71k| constexpr auto BL = bits_leaf; 656| 2.71k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 2.71k, False: 0] ------------------ 657| 2.71k| auto is_leaf = p.shift() == BL; 658| 2.71k| auto child = p.node()->inner()[offset_hint]; 659| 2.71k| auto lsize = offset_hint << p.shift(); 660| 2.71k| auto size = p.this_size(); 661| 2.71k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 2.71k| return is_full ------------------ | Branch (662:12): [True: 949, False: 1.76k] ------------------ 663| 2.71k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 949] ------------------ 664| 949| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 949| : make_full_pos(child, p.shift() - B) 666| 949| .visit(v, idx - lsize, args...)) 667| 2.71k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 1.76k] ------------------ 668| 1.76k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 1.76k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 1.76k| .visit(v, idx - lsize, args...)); 672| 2.71k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_: 1405| 949| { 1406| 949| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 949| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_: 1036| 1.76k| { 1037| 1.76k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.76k| } _ZN5immer6detail4rbts30make_singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEDaPT_j: 766| 7.29k|{ 767| 7.29k| assert(leaf); ------------------ | Branch (767:5): [True: 7.29k, False: 0] ------------------ 768| 7.29k| IMMER_ASSERT_TAGGED(leaf->kind() == NodeT::kind_t::leaf); ------------------ | | 68| 7.29k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (768:5): [True: 7.29k, False: 0] ------------------ 769| 7.29k| assert(count > 0); ------------------ | Branch (769:5): [True: 7.29k, False: 0] ------------------ 770| 7.29k| return singleton_regular_sub_pos{leaf, count}; 771| 7.29k|} _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_25concat_trees_left_visitorISC_EEJNS1_14empty_leaf_posISC_EERPSC_RjRmEEEDcT_DpOT0_: 759| 7.29k| { 760| 7.29k| return Visitor::visit_regular(*this, std::forward(args)...); 761| 7.29k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_26concat_trees_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 7.29k|{ 1839| 7.29k| assert(node); ------------------ | Branch (1839:5): [True: 7.29k, False: 0] ------------------ 1840| 7.29k| auto relaxed = node->relaxed(); 1841| 7.29k| if (relaxed) { ------------------ | Branch (1841:9): [True: 4.97k, False: 2.32k] ------------------ 1842| 4.97k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 4.97k, False: 0] ------------------ 1843| 4.97k| return make_relaxed_pos(node, shift, relaxed) 1844| 4.97k| .visit(v, std::forward(args)...); 1845| 4.97k| } else { 1846| 2.32k| return make_regular_sub_pos(node, shift, size) 1847| 2.32k| .visit(v, std::forward(args)...); 1848| 2.32k| } 1849| 7.29k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1813| 4.97k| { 1814| 4.97k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 4.97k| } _ZNK5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 735| 25.1k| shift_t shift() const { return BL; } _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 744| 7.29k| { 745| 7.29k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcT_DpOT0_: 144| 7.68M| { 145| 7.68M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.68M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcT_DpOT0_: 1813| 110M| { 1814| 110M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 110M| } _ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 707| 3.30M| { 708| 3.30M| } _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_left_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 744| 7.29k| { 745| 7.29k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 144| 7.68M| { 145| 7.68M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.68M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 137| 7.68M| size_t size() const { return count_; } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 1813| 110M| { 1814| 110M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 110M| } _ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEEvT_DpOT0_: 707| 3.30M| { 708| 3.30M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1762| 16.8k| { 1763| 16.8k| auto child = node_->inner()[0]; 1764| 16.8k| auto child_size = relaxed_->d.sizes[0]; 1765| 16.8k| auto is_leaf = shift_ == BL; 1766| 16.8k| assert(child_size); ------------------ | Branch (1766:9): [True: 16.8k, False: 0] ------------------ 1767| 16.8k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 16.8k] ------------------ 1768| 16.8k| : visit_maybe_relaxed_sub( 1769| 16.8k| child, shift_ - B, child_size, v, args...); 1770| 16.8k| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 76| 7.29k| shift_t shift() const { return 0; } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 138| 3.96M| shift_t shift() const { return 0; } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 16.8k|{ 1839| 16.8k| assert(node); ------------------ | Branch (1839:5): [True: 16.8k, False: 0] ------------------ 1840| 16.8k| auto relaxed = node->relaxed(); 1841| 16.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 16.5k, False: 291] ------------------ 1842| 16.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 16.5k, False: 0] ------------------ 1843| 16.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 16.5k| .visit(v, std::forward(args)...); 1845| 16.5k| } else { 1846| 291| return make_regular_sub_pos(node, shift, size) 1847| 291| .visit(v, std::forward(args)...); 1848| 291| } 1849| 16.8k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1813| 16.5k| { 1814| 16.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 16.5k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1036| 291| { 1037| 291| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 291| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 970| 723| { 971| 723| auto is_leaf = shift_ == BL; 972| 723| auto child = node_->inner()[0]; 973| 723| auto is_full = size_ >= (size_t{1} << shift_); 974| 723| return is_full ------------------ | Branch (974:16): [True: 723, False: 0] ------------------ 975| 723| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 723] ------------------ 976| 723| ? make_full_leaf_pos(child).visit(v, args...) 977| 723| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 723| : (is_leaf ------------------ | Branch (978:23): [True: 0, False: 0] ------------------ 979| 0| ? make_leaf_sub_pos(child, size_).visit(v, args...) 980| 0| : make_regular_sub_pos(child, shift_ - B, size_) 981| 0| .visit(v, args...)); 982| 723| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 201| 402k| shift_t shift() const { return 0; } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1405| 1.04k| { 1406| 1.04k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.04k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1361| 320| { 1362| 320| auto is_leaf = shift_ == BL; 1363| 320| auto child = node_->inner()[0]; 1364| 320| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 320] ------------------ 1365| 320| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 320| } _ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 711| 68.5k| { 712| 68.5k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 1304| 24.2k| { 1305| 24.2k| each_i(v, 1, branches, args...); 1306| 24.2k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE6each_iINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_jjDpOT0_: 1263| 24.2k| { 1264| 24.2k| auto p = node_->inner() + i; 1265| 24.2k| auto e = node_->inner() + n; 1266| 24.2k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 17.6k, False: 6.56k] ------------------ 1267| 141k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 123k, False: 17.6k] ------------------ 1268| 123k| IMMER_PREFETCH(p + 1); 1269| 123k| make_full_leaf_pos(*p).visit(v, args...); 1270| 123k| } 1271| 17.6k| } else { 1272| 6.56k| auto ss = shift_ - B; 1273| 52.5k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 45.9k, False: 6.56k] ------------------ 1274| 45.9k| make_full_pos(*p, ss).visit(v, args...); 1275| 6.56k| } 1276| 24.2k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcT_DpOT0_: 207| 5.83M| { 208| 5.83M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.83M| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcT_DpOT0_: 1405| 580k| { 1406| 580k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 580k| } _ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEEEEvT_DpOT0_: 711| 68.5k| { 712| 68.5k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 1304| 24.2k| { 1305| 24.2k| each_i(v, 1, branches, args...); 1306| 24.2k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE6each_iINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jjDpOT0_: 1263| 24.2k| { 1264| 24.2k| auto p = node_->inner() + i; 1265| 24.2k| auto e = node_->inner() + n; 1266| 24.2k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 17.6k, False: 6.56k] ------------------ 1267| 141k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 123k, False: 17.6k] ------------------ 1268| 123k| IMMER_PREFETCH(p + 1); 1269| 123k| make_full_leaf_pos(*p).visit(v, args...); 1270| 123k| } 1271| 17.6k| } else { 1272| 6.56k| auto ss = shift_ - B; 1273| 52.5k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 45.9k, False: 6.56k] ------------------ 1274| 45.9k| make_full_pos(*p, ss).visit(v, args...); 1275| 6.56k| } 1276| 24.2k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 207| 5.83M| { 208| 5.83M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.83M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE4sizeEv: 200| 5.83M| size_t size() const { return branches; } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 1405| 580k| { 1406| 580k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 580k| } _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 753| 723| { 754| 723| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 723| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 144| 723| { 145| 723| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 723| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1370| 723| { 1371| 723| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 723, False: 0] ------------------ 1372| 723| auto child = node_->inner()[0]; 1373| 723| return make_full_leaf_pos(child).visit(v, args...); 1374| 723| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 207| 2.61k| { 208| 2.61k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 2.61k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 906| 402k| { 907| 402k| if (count() > 1) ------------------ | Branch (907:13): [True: 393k, False: 9.53k] ------------------ 908| 393k| each_right_sub_(v, 1, args...); 909| 402k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE15each_right_sub_INS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_jDpOT0_: 879| 393k| { 880| 393k| auto last = count() - 1; 881| 393k| auto lsize = size_ - (last << shift_); 882| 393k| auto n = node()->inner() + i; 883| 393k| auto e = node()->inner() + last; 884| 393k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 375k, False: 17.6k] ------------------ 885| 2.62M| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 2.24M, False: 375k] ------------------ 886| 2.24M| IMMER_PREFETCH(n + 1); 887| 2.24M| make_full_leaf_pos(*n).visit(v, args...); 888| 2.24M| } 889| 375k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 375k| } else { 891| 17.6k| auto ss = shift_ - B; 892| 87.6k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 70.0k, False: 17.6k] ------------------ 893| 70.0k| make_full_pos(*n, ss).visit(v, args...); 894| 17.6k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 17.6k| } 896| 393k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcT_DpOT0_: 1036| 4.10M| { 1037| 4.10M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.10M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 906| 402k| { 907| 402k| if (count() > 1) ------------------ | Branch (907:13): [True: 393k, False: 9.53k] ------------------ 908| 393k| each_right_sub_(v, 1, args...); 909| 402k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE15each_right_sub_INS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_: 879| 393k| { 880| 393k| auto last = count() - 1; 881| 393k| auto lsize = size_ - (last << shift_); 882| 393k| auto n = node()->inner() + i; 883| 393k| auto e = node()->inner() + last; 884| 393k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 375k, False: 17.6k] ------------------ 885| 2.62M| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 2.24M, False: 375k] ------------------ 886| 2.24M| IMMER_PREFETCH(n + 1); 887| 2.24M| make_full_leaf_pos(*n).visit(v, args...); 888| 2.24M| } 889| 375k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 375k| } else { 891| 17.6k| auto ss = shift_ - B; 892| 87.6k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 70.0k, False: 17.6k] ------------------ 893| 70.0k| make_full_pos(*n, ss).visit(v, args...); 894| 17.6k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 17.6k| } 896| 393k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 1036| 4.10M| { 1037| 4.10M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.10M| } _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 753| 1.88k| { 754| 1.88k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 1.88k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 144| 1.88k| { 145| 1.88k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.88k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 986| 1.88k| { 987| 1.88k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 1.88k, False: 0] ------------------ 988| 1.88k| auto child = node_->inner()[0]; 989| 1.88k| auto is_full = size_ >= branches; 990| 1.88k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 1.88k, False: 0] ------------------ 991| 1.88k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 1.88k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 144| 4.68k| { 145| 4.68k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.68k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 1647| 9.49M| { 1648| 9.49M| each_right(v, 1, std::forward(args)...); 1649| 9.49M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_jDpOT0_: 1653| 9.49M| { 1654| 9.49M| assert(start > 0); ------------------ | Branch (1654:9): [True: 9.49M, False: 0] ------------------ 1655| 9.49M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 9.49M, False: 0] ------------------ 1656| 9.49M| auto s = relaxed_->d.sizes[start - 1]; 1657| 9.49M| auto p = node_->inner(); 1658| 9.49M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 688k, False: 8.80M] ------------------ 1659| 3.30M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 2.61M, False: 688k] ------------------ 1660| 2.61M| IMMER_PREFETCH(p + i + 1); 1661| 2.61M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 2.61M| .visit(v, args...); 1663| 2.61M| s = relaxed_->d.sizes[i]; 1664| 2.61M| assert(s); ------------------ | Branch (1664:17): [True: 2.61M, False: 0] ------------------ 1665| 2.61M| } 1666| 8.80M| } else { 1667| 8.80M| auto ss = shift_ - B; 1668| 63.6M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 54.8M, False: 8.80M] ------------------ 1669| 54.8M| visit_maybe_relaxed_sub( 1670| 54.8M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 54.8M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 54.8M, False: 0] ------------------ 1673| 54.8M| } 1674| 8.80M| } 1675| 9.49M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEDcPT_jmT0_DpOT1_: 1838| 94.3M|{ 1839| 94.3M| assert(node); ------------------ | Branch (1839:5): [True: 94.3M, False: 0] ------------------ 1840| 94.3M| auto relaxed = node->relaxed(); 1841| 94.3M| if (relaxed) { ------------------ | Branch (1841:9): [True: 90.3M, False: 4.08M] ------------------ 1842| 90.3M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 90.3M, False: 0] ------------------ 1843| 90.3M| return make_relaxed_pos(node, shift, relaxed) 1844| 90.3M| .visit(v, std::forward(args)...); 1845| 90.3M| } else { 1846| 4.08M| return make_regular_sub_pos(node, shift, size) 1847| 4.08M| .visit(v, std::forward(args)...); 1848| 4.08M| } 1849| 94.3M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 1647| 9.49M| { 1648| 9.49M| each_right(v, 1, std::forward(args)...); 1649| 9.49M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_: 1653| 9.49M| { 1654| 9.49M| assert(start > 0); ------------------ | Branch (1654:9): [True: 9.49M, False: 0] ------------------ 1655| 9.49M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 9.49M, False: 0] ------------------ 1656| 9.49M| auto s = relaxed_->d.sizes[start - 1]; 1657| 9.49M| auto p = node_->inner(); 1658| 9.49M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 688k, False: 8.80M] ------------------ 1659| 3.30M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 2.61M, False: 688k] ------------------ 1660| 2.61M| IMMER_PREFETCH(p + i + 1); 1661| 2.61M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 2.61M| .visit(v, args...); 1663| 2.61M| s = relaxed_->d.sizes[i]; 1664| 2.61M| assert(s); ------------------ | Branch (1664:17): [True: 2.61M, False: 0] ------------------ 1665| 2.61M| } 1666| 8.80M| } else { 1667| 8.80M| auto ss = shift_ - B; 1668| 63.6M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 54.8M, False: 8.80M] ------------------ 1669| 54.8M| visit_maybe_relaxed_sub( 1670| 54.8M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 54.8M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 54.8M, False: 0] ------------------ 1673| 54.8M| } 1674| 8.80M| } 1675| 9.49M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 94.3M|{ 1839| 94.3M| assert(node); ------------------ | Branch (1839:5): [True: 94.3M, False: 0] ------------------ 1840| 94.3M| auto relaxed = node->relaxed(); 1841| 94.3M| if (relaxed) { ------------------ | Branch (1841:9): [True: 90.3M, False: 4.08M] ------------------ 1842| 90.3M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 90.3M, False: 0] ------------------ 1843| 90.3M| return make_relaxed_pos(node, shift, relaxed) 1844| 90.3M| .visit(v, std::forward(args)...); 1845| 90.3M| } else { 1846| 4.08M| return make_regular_sub_pos(node, shift, size) 1847| 4.08M| .visit(v, std::forward(args)...); 1848| 4.08M| } 1849| 94.3M|} _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 753| 4.68k| { 754| 4.68k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 4.68k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 144| 4.68k| { 145| 4.68k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.68k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1774| 4.68k| { 1775| 4.68k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 4.68k, False: 0] ------------------ 1776| 4.68k| auto child = node_->inner()[0]; 1777| 4.68k| auto child_size = relaxed_->d.sizes[0]; 1778| 4.68k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 4.68k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1036| 2.32k| { 1037| 2.32k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.32k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_25concat_trees_left_visitorISC_EEJNS1_8leaf_posISC_EERPSC_RjRmEEEDcPT_jmT0_DpOT1_: 1838| 1.08M|{ 1839| 1.08M| assert(node); ------------------ | Branch (1839:5): [True: 1.08M, False: 0] ------------------ 1840| 1.08M| auto relaxed = node->relaxed(); 1841| 1.08M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.06M, False: 15.9k] ------------------ 1842| 1.06M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.06M, False: 0] ------------------ 1843| 1.06M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.06M| .visit(v, std::forward(args)...); 1845| 1.06M| } else { 1846| 15.9k| return make_regular_sub_pos(node, shift, size) 1847| 15.9k| .visit(v, std::forward(args)...); 1848| 15.9k| } 1849| 1.08M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_25concat_trees_left_visitorISC_EEJNS1_8leaf_posISC_EERPSC_RjRmEEEDcT_DpOT0_: 1813| 1.06M| { 1814| 1.06M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.06M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_26concat_trees_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 1.06M|{ 1839| 1.06M| assert(node); ------------------ | Branch (1839:5): [True: 1.06M, False: 0] ------------------ 1840| 1.06M| auto relaxed = node->relaxed(); 1841| 1.06M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.06M, False: 7.16k] ------------------ 1842| 1.06M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.06M, False: 0] ------------------ 1843| 1.06M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.06M| .visit(v, std::forward(args)...); 1845| 1.06M| } else { 1846| 7.16k| return make_regular_sub_pos(node, shift, size) 1847| 7.16k| .visit(v, std::forward(args)...); 1848| 7.16k| } 1849| 1.06M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1813| 1.06M| { 1814| 1.06M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.06M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1750| 3.29M| { 1751| 3.29M| auto offset = relaxed_->d.count - 1; 1752| 3.29M| auto child = node_->inner()[offset]; 1753| 3.29M| auto child_size = size(offset); 1754| 3.29M| auto is_leaf = shift_ == BL; 1755| 3.29M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 3.29M] ------------------ 1756| 3.29M| : visit_maybe_relaxed_sub( 1757| 3.29M| child, shift_ - B, child_size, v, args...); 1758| 3.29M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 3.29M|{ 1839| 3.29M| assert(node); ------------------ | Branch (1839:5): [True: 3.29M, False: 0] ------------------ 1840| 3.29M| auto relaxed = node->relaxed(); 1841| 3.29M| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.29M, False: 2.36k] ------------------ 1842| 3.29M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.29M, False: 0] ------------------ 1843| 3.29M| return make_relaxed_pos(node, shift, relaxed) 1844| 3.29M| .visit(v, std::forward(args)...); 1845| 3.29M| } else { 1846| 2.36k| return make_regular_sub_pos(node, shift, size) 1847| 2.36k| .visit(v, std::forward(args)...); 1848| 2.36k| } 1849| 3.29M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1813| 3.29M| { 1814| 3.29M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.29M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 1036| 5.01k| { 1037| 5.01k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.01k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 958| 2.65k| { 959| 2.65k| auto offset = count() - 1; 960| 2.65k| auto child = node_->inner()[offset]; 961| 2.65k| auto is_leaf = shift_ == BL; 962| 2.65k| auto lsize = size_ - (size_t{offset} << shift_); 963| 2.65k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 2.65k] ------------------ 964| 2.65k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 2.65k| .visit(v, args...); 966| 2.65k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 913| 1.54M| { 914| 1.54M| each_left(v, count() - 1, args...); 915| 1.54M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_leftINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_jDpOT0_: 873| 1.54M| { 874| 1.54M| return each_left_regular(*this, v, last, args...); 875| 1.54M| } _ZN5immer6detail4rbts17each_left_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvOT_T0_jDpOT1_: 575| 1.54M|{ 576| 1.54M| constexpr auto B = bits; 577| 1.54M| constexpr auto BL = bits_leaf; 578| 1.54M| assert(last < p.count()); ------------------ | Branch (578:5): [True: 1.54M, False: 0] ------------------ 579| 1.54M| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 842k, False: 705k] ------------------ 580| 842k| auto n = p.node()->inner(); 581| 842k| auto e = n + last; 582| 4.30M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 3.46M, False: 842k] ------------------ 583| 3.46M| IMMER_PREFETCH(n + 1); 584| 3.46M| make_full_leaf_pos(*n).visit(v, args...); 585| 3.46M| } 586| 842k| } else { 587| 705k| auto n = p.node()->inner(); 588| 705k| auto e = n + last; 589| 705k| auto ss = p.shift() - B; 590| 1.16M| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 464k, False: 705k] ------------------ 591| 464k| make_full_pos(*n, ss).visit(v, args...); 592| 705k| } 593| 1.54M|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_left_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 913| 1.54M| { 914| 1.54M| each_left(v, count() - 1, args...); 915| 1.54M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_leftINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_: 873| 1.54M| { 874| 1.54M| return each_left_regular(*this, v, last, args...); 875| 1.54M| } _ZN5immer6detail4rbts17each_left_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21concat_merger_visitorEJRNS1_13concat_mergerISD_EEEEEvOT_T0_jDpOT1_: 575| 1.54M|{ 576| 1.54M| constexpr auto B = bits; 577| 1.54M| constexpr auto BL = bits_leaf; 578| 1.54M| assert(last < p.count()); ------------------ | Branch (578:5): [True: 1.54M, False: 0] ------------------ 579| 1.54M| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 842k, False: 705k] ------------------ 580| 842k| auto n = p.node()->inner(); 581| 842k| auto e = n + last; 582| 4.30M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 3.46M, False: 842k] ------------------ 583| 3.46M| IMMER_PREFETCH(n + 1); 584| 3.46M| make_full_leaf_pos(*n).visit(v, args...); 585| 3.46M| } 586| 842k| } else { 587| 705k| auto n = p.node()->inner(); 588| 705k| auto e = n + last; 589| 705k| auto ss = p.shift() - B; 590| 1.16M| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 464k, False: 705k] ------------------ 591| 464k| make_full_pos(*n, ss).visit(v, args...); 592| 705k| } 593| 1.54M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1762| 1.51M| { 1763| 1.51M| auto child = node_->inner()[0]; 1764| 1.51M| auto child_size = relaxed_->d.sizes[0]; 1765| 1.51M| auto is_leaf = shift_ == BL; 1766| 1.51M| assert(child_size); ------------------ | Branch (1766:9): [True: 1.51M, False: 0] ------------------ 1767| 1.51M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 1.51M] ------------------ 1768| 1.51M| : visit_maybe_relaxed_sub( 1769| 1.51M| child, shift_ - B, child_size, v, args...); 1770| 1.51M| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5shiftEv: 106| 1.08M| shift_t shift() const { return 0; } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 1.51M|{ 1839| 1.51M| assert(node); ------------------ | Branch (1839:5): [True: 1.51M, False: 0] ------------------ 1840| 1.51M| auto relaxed = node->relaxed(); 1841| 1.51M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.12M, False: 383k] ------------------ 1842| 1.12M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.12M, False: 0] ------------------ 1843| 1.12M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.12M| .visit(v, std::forward(args)...); 1845| 1.12M| } else { 1846| 383k| return make_regular_sub_pos(node, shift, size) 1847| 383k| .visit(v, std::forward(args)...); 1848| 383k| } 1849| 1.51M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1813| 1.12M| { 1814| 1.12M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.12M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 383k| { 1037| 383k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 383k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 958| 878| { 959| 878| auto offset = count() - 1; 960| 878| auto child = node_->inner()[offset]; 961| 878| auto is_leaf = shift_ == BL; 962| 878| auto lsize = size_ - (size_t{offset} << shift_); 963| 878| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 878] ------------------ 964| 878| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 878| .visit(v, args...); 966| 878| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1036| 1.26k| { 1037| 1.26k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.26k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 970| 15.8k| { 971| 15.8k| auto is_leaf = shift_ == BL; 972| 15.8k| auto child = node_->inner()[0]; 973| 15.8k| auto is_full = size_ >= (size_t{1} << shift_); 974| 15.8k| return is_full ------------------ | Branch (974:16): [True: 15.8k, False: 0] ------------------ 975| 15.8k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 15.8k] ------------------ 976| 15.8k| ? make_full_leaf_pos(child).visit(v, args...) 977| 15.8k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 15.8k| : (is_leaf ------------------ | Branch (978:23): [True: 0, False: 0] ------------------ 979| 0| ? make_leaf_sub_pos(child, size_).visit(v, args...) 980| 0| : make_regular_sub_pos(child, shift_ - B, size_) 981| 0| .visit(v, args...)); 982| 15.8k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1405| 21.7k| { 1406| 21.7k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 21.7k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1361| 5.83k| { 1362| 5.83k| auto is_leaf = shift_ == BL; 1363| 5.83k| auto child = node_->inner()[0]; 1364| 5.83k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 5.83k] ------------------ 1365| 5.83k| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 5.83k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 958| 21.5k| { 959| 21.5k| auto offset = count() - 1; 960| 21.5k| auto child = node_->inner()[offset]; 961| 21.5k| auto is_leaf = shift_ == BL; 962| 21.5k| auto lsize = size_ - (size_t{offset} << shift_); 963| 21.5k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 16.0k, False: 5.42k] ------------------ 964| 21.5k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 5.42k| .visit(v, args...); 966| 21.5k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 144| 16.9k| { 145| 16.9k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 16.9k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1370| 16.9k| { 1371| 16.9k| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 16.9k, False: 0] ------------------ 1372| 16.9k| auto child = node_->inner()[0]; 1373| 16.9k| return make_full_leaf_pos(child).visit(v, args...); 1374| 16.9k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 207| 400k| { 208| 400k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 400k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 1036| 5.63k| { 1037| 5.63k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.63k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 958| 392k| { 959| 392k| auto offset = count() - 1; 960| 392k| auto child = node_->inner()[offset]; 961| 392k| auto is_leaf = shift_ == BL; 962| 392k| auto lsize = size_ - (size_t{offset} << shift_); 963| 392k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 380k, False: 11.8k] ------------------ 964| 392k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 11.8k| .visit(v, args...); 966| 392k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 144| 383k| { 145| 383k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 383k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 986| 383k| { 987| 383k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 383k, False: 0] ------------------ 988| 383k| auto child = node_->inner()[0]; 989| 383k| auto is_full = size_ >= branches; 990| 383k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 383k, False: 0] ------------------ 991| 383k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 383k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 144| 684k| { 145| 684k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 684k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1036| 15.4k| { 1037| 15.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 15.4k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 958| 1.12M| { 959| 1.12M| auto offset = count() - 1; 960| 1.12M| auto child = node_->inner()[offset]; 961| 1.12M| auto is_leaf = shift_ == BL; 962| 1.12M| auto lsize = size_ - (size_t{offset} << shift_); 963| 1.12M| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 445k, False: 684k] ------------------ 964| 1.12M| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 684k| .visit(v, args...); 966| 1.12M| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 144| 684k| { 145| 684k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 684k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1774| 684k| { 1775| 684k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 684k, False: 0] ------------------ 1776| 684k| auto child = node_->inner()[0]; 1777| 684k| auto child_size = relaxed_->d.sizes[0]; 1778| 684k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 684k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 1036| 1.50M| { 1037| 1.50M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.50M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_DpOT0_: 1617| 11.6M| { 1618| 11.6M| each_left(v, relaxed_->d.count - 1, args...); 1619| 11.6M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_leftINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj3ELj3EEEEEEvT_jDpOT0_: 1623| 11.6M| { 1624| 11.6M| auto p = node_->inner(); 1625| 11.6M| auto s = size_t{}; 1626| 11.6M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 242k, False: 11.3M] ------------------ 1627| 1.66M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 1.42M, False: 242k] ------------------ 1628| 1.42M| IMMER_PREFETCH(p + i + 1); 1629| 1.42M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 1.42M| .visit(v, args...); 1631| 1.42M| s = relaxed_->d.sizes[i]; 1632| 1.42M| assert(s); ------------------ | Branch (1632:17): [True: 1.42M, False: 0] ------------------ 1633| 1.42M| } 1634| 11.3M| } else { 1635| 11.3M| auto ss = shift_ - B; 1636| 50.9M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 39.5M, False: 11.3M] ------------------ 1637| 39.5M| visit_maybe_relaxed_sub( 1638| 39.5M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 39.5M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 39.5M, False: 0] ------------------ 1641| 39.5M| } 1642| 11.3M| } 1643| 11.6M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_left_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 1617| 11.6M| { 1618| 11.6M| each_left(v, relaxed_->d.count - 1, args...); 1619| 11.6M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_leftINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_: 1623| 11.6M| { 1624| 11.6M| auto p = node_->inner(); 1625| 11.6M| auto s = size_t{}; 1626| 11.6M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 242k, False: 11.3M] ------------------ 1627| 1.66M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 1.42M, False: 242k] ------------------ 1628| 1.42M| IMMER_PREFETCH(p + i + 1); 1629| 1.42M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 1.42M| .visit(v, args...); 1631| 1.42M| s = relaxed_->d.sizes[i]; 1632| 1.42M| assert(s); ------------------ | Branch (1632:17): [True: 1.42M, False: 0] ------------------ 1633| 1.42M| } 1634| 11.3M| } else { 1635| 11.3M| auto ss = shift_ - B; 1636| 50.9M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 39.5M, False: 11.3M] ------------------ 1637| 39.5M| visit_maybe_relaxed_sub( 1638| 39.5M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 39.5M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 39.5M, False: 0] ------------------ 1641| 39.5M| } 1642| 11.3M| } 1643| 11.6M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1762| 7.27M| { 1763| 7.27M| auto child = node_->inner()[0]; 1764| 7.27M| auto child_size = relaxed_->d.sizes[0]; 1765| 7.27M| auto is_leaf = shift_ == BL; 1766| 7.27M| assert(child_size); ------------------ | Branch (1766:9): [True: 7.27M, False: 0] ------------------ 1767| 7.27M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 7.27M] ------------------ 1768| 7.27M| : visit_maybe_relaxed_sub( 1769| 7.27M| child, shift_ - B, child_size, v, args...); 1770| 7.27M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 7.27M|{ 1839| 7.27M| assert(node); ------------------ | Branch (1839:5): [True: 7.27M, False: 0] ------------------ 1840| 7.27M| auto relaxed = node->relaxed(); 1841| 7.27M| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.27M, False: 750] ------------------ 1842| 7.27M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.27M, False: 0] ------------------ 1843| 7.27M| return make_relaxed_pos(node, shift, relaxed) 1844| 7.27M| .visit(v, std::forward(args)...); 1845| 7.27M| } else { 1846| 750| return make_regular_sub_pos(node, shift, size) 1847| 750| .visit(v, std::forward(args)...); 1848| 750| } 1849| 7.27M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1813| 7.27M| { 1814| 7.27M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.27M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 750| { 1037| 750| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 750| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1750| 10.5k| { 1751| 10.5k| auto offset = relaxed_->d.count - 1; 1752| 10.5k| auto child = node_->inner()[offset]; 1753| 10.5k| auto child_size = size(offset); 1754| 10.5k| auto is_leaf = shift_ == BL; 1755| 10.5k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 10.5k] ------------------ 1756| 10.5k| : visit_maybe_relaxed_sub( 1757| 10.5k| child, shift_ - B, child_size, v, args...); 1758| 10.5k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 10.5k|{ 1839| 10.5k| assert(node); ------------------ | Branch (1839:5): [True: 10.5k, False: 0] ------------------ 1840| 10.5k| auto relaxed = node->relaxed(); 1841| 10.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 10.1k, False: 387] ------------------ 1842| 10.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 10.1k, False: 0] ------------------ 1843| 10.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 10.1k| .visit(v, std::forward(args)...); 1845| 10.1k| } else { 1846| 387| return make_regular_sub_pos(node, shift, size) 1847| 387| .visit(v, std::forward(args)...); 1848| 387| } 1849| 10.5k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1813| 10.1k| { 1814| 10.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 10.1k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 970| 1.03k| { 971| 1.03k| auto is_leaf = shift_ == BL; 972| 1.03k| auto child = node_->inner()[0]; 973| 1.03k| auto is_full = size_ >= (size_t{1} << shift_); 974| 1.03k| return is_full ------------------ | Branch (974:16): [True: 1.03k, False: 0] ------------------ 975| 1.03k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 1.03k] ------------------ 976| 1.03k| ? make_full_leaf_pos(child).visit(v, args...) 977| 1.03k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 1.03k| : (is_leaf ------------------ | Branch (978:23): [True: 0, False: 0] ------------------ 979| 0| ? make_leaf_sub_pos(child, size_).visit(v, args...) 980| 0| : make_regular_sub_pos(child, shift_ - B, size_) 981| 0| .visit(v, args...)); 982| 1.03k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1405| 1.44k| { 1406| 1.44k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.44k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1361| 414| { 1362| 414| auto is_leaf = shift_ == BL; 1363| 414| auto child = node_->inner()[0]; 1364| 414| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 414] ------------------ 1365| 414| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 414| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 1750| 1.24k| { 1751| 1.24k| auto offset = relaxed_->d.count - 1; 1752| 1.24k| auto child = node_->inner()[offset]; 1753| 1.24k| auto child_size = size(offset); 1754| 1.24k| auto is_leaf = shift_ == BL; 1755| 1.24k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 821, False: 428] ------------------ 1756| 1.24k| : visit_maybe_relaxed_sub( 1757| 428| child, shift_ - B, child_size, v, args...); 1758| 1.24k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 428|{ 1839| 428| assert(node); ------------------ | Branch (1839:5): [True: 428, False: 0] ------------------ 1840| 428| auto relaxed = node->relaxed(); 1841| 428| if (relaxed) { ------------------ | Branch (1841:9): [True: 219, False: 209] ------------------ 1842| 219| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 219, False: 0] ------------------ 1843| 219| return make_relaxed_pos(node, shift, relaxed) 1844| 219| .visit(v, std::forward(args)...); 1845| 219| } else { 1846| 209| return make_regular_sub_pos(node, shift, size) 1847| 209| .visit(v, std::forward(args)...); 1848| 209| } 1849| 428|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 1813| 219| { 1814| 219| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 219| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1750| 6.94k| { 1751| 6.94k| auto offset = relaxed_->d.count - 1; 1752| 6.94k| auto child = node_->inner()[offset]; 1753| 6.94k| auto child_size = size(offset); 1754| 6.94k| auto is_leaf = shift_ == BL; 1755| 6.94k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 2.86k, False: 4.08k] ------------------ 1756| 6.94k| : visit_maybe_relaxed_sub( 1757| 4.08k| child, shift_ - B, child_size, v, args...); 1758| 6.94k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 4.08k|{ 1839| 4.08k| assert(node); ------------------ | Branch (1839:5): [True: 4.08k, False: 0] ------------------ 1840| 4.08k| auto relaxed = node->relaxed(); 1841| 4.08k| if (relaxed) { ------------------ | Branch (1841:9): [True: 455, False: 3.62k] ------------------ 1842| 455| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 455, False: 0] ------------------ 1843| 455| return make_relaxed_pos(node, shift, relaxed) 1844| 455| .visit(v, std::forward(args)...); 1845| 3.62k| } else { 1846| 3.62k| return make_regular_sub_pos(node, shift, size) 1847| 3.62k| .visit(v, std::forward(args)...); 1848| 3.62k| } 1849| 4.08k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1813| 455| { 1814| 455| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 455| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1750| 8.28M| { 1751| 8.28M| auto offset = relaxed_->d.count - 1; 1752| 8.28M| auto child = node_->inner()[offset]; 1753| 8.28M| auto child_size = size(offset); 1754| 8.28M| auto is_leaf = shift_ == BL; 1755| 8.28M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 238k, False: 8.05M] ------------------ 1756| 8.28M| : visit_maybe_relaxed_sub( 1757| 8.05M| child, shift_ - B, child_size, v, args...); 1758| 8.28M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 8.05M|{ 1839| 8.05M| assert(node); ------------------ | Branch (1839:5): [True: 8.05M, False: 0] ------------------ 1840| 8.05M| auto relaxed = node->relaxed(); 1841| 8.05M| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.23M, False: 819k] ------------------ 1842| 7.23M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.23M, False: 0] ------------------ 1843| 7.23M| return make_relaxed_pos(node, shift, relaxed) 1844| 7.23M| .visit(v, std::forward(args)...); 1845| 7.23M| } else { 1846| 819k| return make_regular_sub_pos(node, shift, size) 1847| 819k| .visit(v, std::forward(args)...); 1848| 819k| } 1849| 8.05M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1813| 7.23M| { 1814| 7.23M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.23M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 7.16k| { 1037| 7.16k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 7.16k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_25concat_trees_left_visitorISC_EEJNS1_8leaf_posISC_EERPSC_RjRmEEEDcT_DpOT0_: 1036| 15.9k| { 1037| 15.9k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 15.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_: 1838| 15.9k|{ 1839| 15.9k| assert(node); ------------------ | Branch (1839:5): [True: 15.9k, False: 0] ------------------ 1840| 15.9k| auto relaxed = node->relaxed(); 1841| 15.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 6.82k, False: 9.08k] ------------------ 1842| 6.82k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 6.82k, False: 0] ------------------ 1843| 6.82k| return make_relaxed_pos(node, shift, relaxed) 1844| 6.82k| .visit(v, std::forward(args)...); 1845| 9.08k| } else { 1846| 9.08k| return make_regular_sub_pos(node, shift, size) 1847| 9.08k| .visit(v, std::forward(args)...); 1848| 9.08k| } 1849| 15.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_: 1813| 6.82k| { 1814| 6.82k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 6.82k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 9.08k| { 1037| 9.08k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 9.08k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_: 1813| 176k| { 1814| 176k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 176k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11last_oh_cshINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_jmDpOT0_: 1737| 171k| { 1738| 171k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 171k, False: 0] ------------------ 1739| 171k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 171k, False: 0] ------------------ 1740| 171k| auto child = node_->inner()[offset_hint]; 1741| 171k| auto is_leaf = shift_ == BL; 1742| 171k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 171k] ------------------ 1743| 171k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 171k| : visit_maybe_relaxed_sub( 1745| 171k| child, shift_ - B, child_size_hint, v, args...); 1746| 171k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcPT_jmT0_DpOT1_: 1838| 171k|{ 1839| 171k| assert(node); ------------------ | Branch (1839:5): [True: 171k, False: 0] ------------------ 1840| 171k| auto relaxed = node->relaxed(); 1841| 171k| if (relaxed) { ------------------ | Branch (1841:9): [True: 13.8k, False: 157k] ------------------ 1842| 13.8k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 13.8k, False: 0] ------------------ 1843| 13.8k| return make_relaxed_pos(node, shift, relaxed) 1844| 13.8k| .visit(v, std::forward(args)...); 1845| 157k| } else { 1846| 157k| return make_regular_sub_pos(node, shift, size) 1847| 157k| .visit(v, std::forward(args)...); 1848| 157k| } 1849| 171k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_: 1036| 157k| { 1037| 157k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 157k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7last_ohINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_jDpOT0_: 952| 327k| { 953| 327k| return last_oh_regular(*this, v, offset_hint, args...); 954| 327k| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21push_tail_mut_visitorISD_Lb1EEEJRNSB_5applyIS8_E4type4editERPSD_EEEDcOT_T0_jDpOT1_: 677| 327k|{ 678| 327k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 327k, False: 0] ------------------ 679| 327k| constexpr auto B = bits; 680| 327k| constexpr auto BL = bits_leaf; 681| 327k| auto child = p.node()->inner()[offset_hint]; 682| 327k| auto is_leaf = p.shift() == BL; 683| 327k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 327k] ------------------ 684| 327k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 327k| .visit(v, args...); 686| 327k|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_DpOT0_: 336| 1.03M| { 337| 1.03M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.03M| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7last_ohINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_jDpOT0_: 330| 709k| { 331| 709k| return last_oh_regular(*this, v, offset_hint, args...); 332| 709k| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21push_tail_mut_visitorISD_Lb1EEEJRNSB_5applyIS8_E4type4editERPSD_EEEDcOT_T0_jDpOT1_: 677| 709k|{ 678| 709k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 709k, False: 0] ------------------ 679| 709k| constexpr auto B = bits; 680| 709k| constexpr auto BL = bits_leaf; 681| 709k| auto child = p.node()->inner()[offset_hint]; 682| 709k| auto is_leaf = p.shift() == BL; 683| 709k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 709k] ------------------ 684| 709k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 709k| .visit(v, args...); 686| 709k|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7last_ohINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_jDpOT0_: 330| 4.03k| { 331| 4.03k| return last_oh_regular(*this, v, offset_hint, args...); 332| 4.03k| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21push_tail_mut_visitorISD_Lb0EEEJRNSB_5applyIS8_E4type4editERPSD_EEEDcOT_T0_jDpOT1_: 677| 4.03k|{ 678| 4.03k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 4.03k, False: 0] ------------------ 679| 4.03k| constexpr auto B = bits; 680| 4.03k| constexpr auto BL = bits_leaf; 681| 4.03k| auto child = p.node()->inner()[offset_hint]; 682| 4.03k| auto is_leaf = p.shift() == BL; 683| 4.03k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 4.03k] ------------------ 684| 4.03k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 4.03k| .visit(v, args...); 686| 4.03k|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_DpOT0_: 336| 6.10k| { 337| 6.10k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 6.10k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7last_ohINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_jDpOT0_: 952| 2.07k| { 953| 2.07k| return last_oh_regular(*this, v, offset_hint, args...); 954| 2.07k| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_21push_tail_mut_visitorISD_Lb0EEEJRNSB_5applyIS8_E4type4editERPSD_EEEDcOT_T0_jDpOT1_: 677| 2.07k|{ 678| 2.07k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 2.07k, False: 0] ------------------ 679| 2.07k| constexpr auto B = bits; 680| 2.07k| constexpr auto BL = bits_leaf; 681| 2.07k| auto child = p.node()->inner()[offset_hint]; 682| 2.07k| auto is_leaf = p.shift() == BL; 683| 2.07k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 2.07k] ------------------ 684| 2.07k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 2.07k| .visit(v, args...); 686| 2.07k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE11last_oh_cshINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_jmDpOT0_: 1737| 8.22k| { 1738| 8.22k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 8.22k, False: 0] ------------------ 1739| 8.22k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 8.22k, False: 0] ------------------ 1740| 8.22k| auto child = node_->inner()[offset_hint]; 1741| 8.22k| auto is_leaf = shift_ == BL; 1742| 8.22k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 8.22k] ------------------ 1743| 8.22k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 8.22k| : visit_maybe_relaxed_sub( 1745| 8.22k| child, shift_ - B, child_size_hint, v, args...); 1746| 8.22k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcPT_jmT0_DpOT1_: 1838| 8.22k|{ 1839| 8.22k| assert(node); ------------------ | Branch (1839:5): [True: 8.22k, False: 0] ------------------ 1840| 8.22k| auto relaxed = node->relaxed(); 1841| 8.22k| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.04k, False: 1.18k] ------------------ 1842| 7.04k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.04k, False: 0] ------------------ 1843| 7.04k| return make_relaxed_pos(node, shift, relaxed) 1844| 7.04k| .visit(v, std::forward(args)...); 1845| 7.04k| } else { 1846| 1.18k| return make_regular_sub_pos(node, shift, size) 1847| 1.18k| .visit(v, std::forward(args)...); 1848| 1.18k| } 1849| 8.22k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_: 1813| 7.04k| { 1814| 7.04k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.04k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_: 1036| 1.18k| { 1037| 1.18k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.18k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_DpOT0_: 1036| 182k| { 1037| 182k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 182k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editEPPSC_EEEDcPT_jmT0_DpOT1_: 1838| 19.5k|{ 1839| 19.5k| assert(node); ------------------ | Branch (1839:5): [True: 19.5k, False: 0] ------------------ 1840| 19.5k| auto relaxed = node->relaxed(); 1841| 19.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 16.7k, False: 2.81k] ------------------ 1842| 16.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 16.7k, False: 0] ------------------ 1843| 16.7k| return make_relaxed_pos(node, shift, relaxed) 1844| 16.7k| .visit(v, std::forward(args)...); 1845| 16.7k| } else { 1846| 2.81k| return make_regular_sub_pos(node, shift, size) 1847| 2.81k| .visit(v, std::forward(args)...); 1848| 2.81k| } 1849| 19.5k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_DpOT0_: 1813| 16.7k| { 1814| 16.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 16.7k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjDpOT0_: 1686| 97.6k| { 1687| 97.6k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 97.6k, False: 0] ------------------ 1688| 97.6k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 20.6k, False: 76.9k] ------------------ 1689| 97.6k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 97.6k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_mjmDpOT0_: 1698| 97.6k| { 1699| 97.6k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 97.6k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_mjmDpOT0_: 1717| 97.6k| { 1718| 97.6k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 97.6k, False: 0] ------------------ 1719| 97.6k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 20.6k, False: 76.9k] | Branch (1719:9): [True: 97.6k, False: 0] ------------------ 1720| 97.6k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 97.6k| auto child = node_->inner()[offset_hint]; 1722| 97.6k| auto is_leaf = shift_ == BL; 1723| 97.6k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 97.6k| auto next_idx = idx - left_size_hint; 1725| 97.6k| return is_leaf ------------------ | Branch (1725:16): [True: 14.8k, False: 82.7k] ------------------ 1726| 97.6k| ? make_leaf_sub_pos(child, next_size) 1727| 14.8k| .visit(v, next_idx, args...) 1728| 97.6k| : visit_maybe_relaxed_sub( 1729| 82.7k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 97.6k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 144| 14.8k| { 145| 14.8k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 14.8k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcPT_jmT0_DpOT1_: 1838| 82.7k|{ 1839| 82.7k| assert(node); ------------------ | Branch (1839:5): [True: 82.7k, False: 0] ------------------ 1840| 82.7k| auto relaxed = node->relaxed(); 1841| 82.7k| if (relaxed) { ------------------ | Branch (1841:9): [True: 80.9k, False: 1.85k] ------------------ 1842| 80.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 80.9k, False: 0] ------------------ 1843| 80.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 80.9k| .visit(v, std::forward(args)...); 1845| 80.9k| } else { 1846| 1.85k| return make_regular_sub_pos(node, shift, size) 1847| 1.85k| .visit(v, std::forward(args)...); 1848| 1.85k| } 1849| 82.7k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1813| 80.9k| { 1814| 80.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 80.9k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1036| 1.85k| { 1037| 1.85k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.85k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 938| 4.66k| { 939| 4.66k| return towards_oh_ch_regular( 940| 4.66k| *this, v, idx, offset_hint, count(), args...); 941| 4.66k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_15get_mut_visitorISD_EEJRNSB_5applyIS8_E4type4editERPPSD_EEEDcOT_T0_mjjDpOT1_: 632| 4.66k|{ 633| 4.66k| constexpr auto B = bits; 634| 4.66k| constexpr auto BL = bits_leaf; 635| 4.66k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.66k, False: 0] ------------------ 636| 4.66k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.66k, False: 0] ------------------ 637| 4.66k| auto is_leaf = p.shift() == BL; 638| 4.66k| auto child = p.node()->inner()[offset_hint]; 639| 4.66k| auto is_full = offset_hint + 1 != count_hint; 640| 4.66k| return is_full ------------------ | Branch (640:12): [True: 2.13k, False: 2.53k] ------------------ 641| 4.66k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.04k, False: 1.09k] ------------------ 642| 2.13k| : make_full_pos(child, p.shift() - B) 643| 1.09k| .visit(v, idx, args...)) 644| 4.66k| : (is_leaf ------------------ | Branch (644:19): [True: 1.34k, False: 1.18k] ------------------ 645| 2.53k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.53k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.18k| .visit(v, idx, args...)); 648| 4.66k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 207| 2.72k| { 208| 2.72k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 2.72k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1405| 2.01k| { 1406| 2.01k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.01k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 1329| 2.01k| { 1330| 2.01k| return towards_oh(v, idx, offset_hint, args...); 1331| 2.01k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_mjDpOT0_: 1336| 2.01k| { 1337| 2.01k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.01k, False: 0] ------------------ 1338| 2.01k| auto is_leaf = shift_ == BL; 1339| 2.01k| auto child = node_->inner()[offset_hint]; 1340| 2.01k| return is_leaf ------------------ | Branch (1340:16): [True: 1.35k, False: 661] ------------------ 1341| 2.01k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.01k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.01k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 112| 1.94k| { 113| 1.94k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.94k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 336| 1.60k| { 337| 1.60k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.60k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 316| 1.60k| { 317| 1.60k| return towards_oh_ch_regular( 318| 1.60k| *this, v, idx, offset_hint, count(), args...); 319| 1.60k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_15get_mut_visitorISD_EEJRNSB_5applyIS8_E4type4editERPPSD_EEEDcOT_T0_mjjDpOT1_: 632| 1.60k|{ 633| 1.60k| constexpr auto B = bits; 634| 1.60k| constexpr auto BL = bits_leaf; 635| 1.60k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 1.60k, False: 0] ------------------ 636| 1.60k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 1.60k, False: 0] ------------------ 637| 1.60k| auto is_leaf = p.shift() == BL; 638| 1.60k| auto child = p.node()->inner()[offset_hint]; 639| 1.60k| auto is_full = offset_hint + 1 != count_hint; 640| 1.60k| return is_full ------------------ | Branch (640:12): [True: 594, False: 1.00k] ------------------ 641| 1.60k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 326, False: 268] ------------------ 642| 594| : make_full_pos(child, p.shift() - B) 643| 268| .visit(v, idx, args...)) 644| 1.60k| : (is_leaf ------------------ | Branch (644:19): [True: 593, False: 413] ------------------ 645| 1.00k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.00k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 413| .visit(v, idx, args...)); 648| 1.60k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_DpOT0_: 1036| 2.81k| { 1037| 2.81k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.81k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 49.9k|{ 1839| 49.9k| assert(node); ------------------ | Branch (1839:5): [True: 49.9k, False: 0] ------------------ 1840| 49.9k| auto relaxed = node->relaxed(); 1841| 49.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 37.5k, False: 12.4k] ------------------ 1842| 37.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 37.5k, False: 0] ------------------ 1843| 37.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 37.5k| .visit(v, std::forward(args)...); 1845| 37.5k| } else { 1846| 12.4k| return make_regular_sub_pos(node, shift, size) 1847| 12.4k| .visit(v, std::forward(args)...); 1848| 12.4k| } 1849| 49.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 37.5k| { 1814| 37.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 37.5k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 21.0k| { 1687| 21.0k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 21.0k, False: 0] ------------------ 1688| 21.0k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 21.0k] ------------------ 1689| 21.0k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 21.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 21.0k| { 1699| 21.0k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 21.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 21.0k| { 1718| 21.0k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 21.0k, False: 0] ------------------ 1719| 21.0k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 21.0k] | Branch (1719:9): [True: 21.0k, False: 0] ------------------ 1720| 21.0k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 21.0k| auto child = node_->inner()[offset_hint]; 1722| 21.0k| auto is_leaf = shift_ == BL; 1723| 21.0k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 21.0k| auto next_idx = idx - left_size_hint; 1725| 21.0k| return is_leaf ------------------ | Branch (1725:16): [True: 983, False: 20.1k] ------------------ 1726| 21.0k| ? make_leaf_sub_pos(child, next_size) 1727| 983| .visit(v, next_idx, args...) 1728| 21.0k| : visit_maybe_relaxed_sub( 1729| 20.1k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 21.0k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 983| { 145| 983| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 983| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 11.2k| { 1687| 11.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 11.2k, False: 0] ------------------ 1688| 11.2k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 11.2k] ------------------ 1689| 11.2k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 11.2k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 11.2k| { 1699| 11.2k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 11.2k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 11.2k| { 1718| 11.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 11.2k, False: 0] ------------------ 1719| 11.2k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 11.2k] | Branch (1719:9): [True: 11.2k, False: 0] ------------------ 1720| 11.2k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 11.2k| auto child = node_->inner()[offset_hint]; 1722| 11.2k| auto is_leaf = shift_ == BL; 1723| 11.2k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 11.2k| auto next_idx = idx - left_size_hint; 1725| 11.2k| return is_leaf ------------------ | Branch (1725:16): [True: 751, False: 10.5k] ------------------ 1726| 11.2k| ? make_leaf_sub_pos(child, next_size) 1727| 751| .visit(v, next_idx, args...) 1728| 11.2k| : visit_maybe_relaxed_sub( 1729| 10.5k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 11.2k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 751| { 145| 751| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 751| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 10.5k|{ 1839| 10.5k| assert(node); ------------------ | Branch (1839:5): [True: 10.5k, False: 0] ------------------ 1840| 10.5k| auto relaxed = node->relaxed(); 1841| 10.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 9.23k, False: 1.29k] ------------------ 1842| 9.23k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 9.23k, False: 0] ------------------ 1843| 9.23k| return make_relaxed_pos(node, shift, relaxed) 1844| 9.23k| .visit(v, std::forward(args)...); 1845| 9.23k| } else { 1846| 1.29k| return make_regular_sub_pos(node, shift, size) 1847| 1.29k| .visit(v, std::forward(args)...); 1848| 1.29k| } 1849| 10.5k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 9.23k| { 1814| 9.23k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 9.23k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 1.29k| { 1037| 1.29k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.29k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 927| 2.56k| { 928| 2.56k| return towards_oh_ch_regular( 929| 2.56k| *this, v, idx, offset_hint, count(), args...); 930| 2.56k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb1ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 2.56k|{ 633| 2.56k| constexpr auto B = bits; 634| 2.56k| constexpr auto BL = bits_leaf; 635| 2.56k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.56k, False: 0] ------------------ 636| 2.56k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.56k, False: 0] ------------------ 637| 2.56k| auto is_leaf = p.shift() == BL; 638| 2.56k| auto child = p.node()->inner()[offset_hint]; 639| 2.56k| auto is_full = offset_hint + 1 != count_hint; 640| 2.56k| return is_full ------------------ | Branch (640:12): [True: 2.15k, False: 412] ------------------ 641| 2.56k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 689, False: 1.46k] ------------------ 642| 2.15k| : make_full_pos(child, p.shift() - B) 643| 1.46k| .visit(v, idx, args...)) 644| 2.56k| : (is_leaf ------------------ | Branch (644:19): [True: 412, False: 0] ------------------ 645| 412| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 412| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 2.56k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 1.99k| { 208| 1.99k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.99k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 1.75k| { 1406| 1.75k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.75k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 1.59k| { 1337| 1.59k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.59k, False: 0] ------------------ 1338| 1.59k| auto is_leaf = shift_ == BL; 1339| 1.59k| auto child = node_->inner()[offset_hint]; 1340| 1.59k| return is_leaf ------------------ | Branch (1340:16): [True: 1.30k, False: 291] ------------------ 1341| 1.59k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.59k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.59k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 2.16k| { 1337| 2.16k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.16k, False: 0] ------------------ 1338| 2.16k| auto is_leaf = shift_ == BL; 1339| 2.16k| auto child = node_->inner()[offset_hint]; 1340| 2.16k| return is_leaf ------------------ | Branch (1340:16): [True: 1.32k, False: 842] ------------------ 1341| 2.16k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.16k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.16k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 3.24k| { 208| 3.24k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.24k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 3.37k| { 1406| 3.37k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.37k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1405| 3.32k| { 1406| 3.32k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.32k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 9.19k| { 1337| 9.19k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 9.19k, False: 0] ------------------ 1338| 9.19k| auto is_leaf = shift_ == BL; 1339| 9.19k| auto child = node_->inner()[offset_hint]; 1340| 9.19k| return is_leaf ------------------ | Branch (1340:16): [True: 6.95k, False: 2.23k] ------------------ 1341| 9.19k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 9.19k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 9.19k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 9.34k| { 208| 9.34k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 9.34k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 5.25k| { 1406| 5.25k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 5.25k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1310| 3.34k| { 1311| 3.34k| each_i(v, start, branches, args...); 1312| 3.34k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE6each_iINS1_11dec_visitorEJEEEvT_jjDpOT0_: 1263| 3.34k| { 1264| 3.34k| auto p = node_->inner() + i; 1265| 3.34k| auto e = node_->inner() + n; 1266| 3.34k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 2.00k, False: 1.33k] ------------------ 1267| 13.2k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 11.1k, False: 2.00k] ------------------ 1268| 11.1k| IMMER_PREFETCH(p + 1); 1269| 11.1k| make_full_leaf_pos(*p).visit(v, args...); 1270| 11.1k| } 1271| 2.00k| } else { 1272| 1.33k| auto ss = shift_ - B; 1273| 10.2k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 8.89k, False: 1.33k] ------------------ 1274| 8.89k| make_full_pos(*p, ss).visit(v, args...); 1275| 1.33k| } 1276| 3.34k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 112| 412| { 113| 412| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 412| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 305| 2.58k| { 306| 2.58k| return towards_oh_ch_regular( 307| 2.58k| *this, v, idx, offset_hint, count(), args...); 308| 2.58k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 2.58k|{ 633| 2.58k| constexpr auto B = bits; 634| 2.58k| constexpr auto BL = bits_leaf; 635| 2.58k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.58k, False: 0] ------------------ 636| 2.58k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.58k, False: 0] ------------------ 637| 2.58k| auto is_leaf = p.shift() == BL; 638| 2.58k| auto child = p.node()->inner()[offset_hint]; 639| 2.58k| auto is_full = offset_hint + 1 != count_hint; 640| 2.58k| return is_full ------------------ | Branch (640:12): [True: 1.67k, False: 906] ------------------ 641| 2.58k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 942, False: 733] ------------------ 642| 1.67k| : make_full_pos(child, p.shift() - B) 643| 733| .visit(v, idx, args...)) 644| 2.58k| : (is_leaf ------------------ | Branch (644:19): [True: 420, False: 486] ------------------ 645| 906| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 906| : make_regular_pos(child, p.shift() - B, p.size()) 647| 486| .visit(v, idx, args...)); 648| 2.58k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 112| 1.54k| { 113| 1.54k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.54k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 336| 3.49k| { 337| 3.49k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.49k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 336| 1.46k| { 337| 1.46k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.46k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 305| 4.20k| { 306| 4.20k| return towards_oh_ch_regular( 307| 4.20k| *this, v, idx, offset_hint, count(), args...); 308| 4.20k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 4.20k|{ 633| 4.20k| constexpr auto B = bits; 634| 4.20k| constexpr auto BL = bits_leaf; 635| 4.20k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.20k, False: 0] ------------------ 636| 4.20k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.20k, False: 0] ------------------ 637| 4.20k| auto is_leaf = p.shift() == BL; 638| 4.20k| auto child = p.node()->inner()[offset_hint]; 639| 4.20k| auto is_full = offset_hint + 1 != count_hint; 640| 4.20k| return is_full ------------------ | Branch (640:12): [True: 1.83k, False: 2.37k] ------------------ 641| 4.20k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 905, False: 930] ------------------ 642| 1.83k| : make_full_pos(child, p.shift() - B) 643| 930| .visit(v, idx, args...)) 644| 4.20k| : (is_leaf ------------------ | Branch (644:19): [True: 1.74k, False: 633] ------------------ 645| 2.37k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.37k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 633| .visit(v, idx, args...)); 648| 4.20k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 112| 2.59k| { 113| 2.59k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.59k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 336| 3.29k| { 337| 3.29k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.29k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 285| 2.58k| { 286| 2.58k| return each_right_regular(*this, v, start, args...); 287| 2.58k| } _ZN5immer6detail4rbts18each_right_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_11dec_visitorEJEEEvOT_T0_jDpOT1_: 597| 2.58k|{ 598| 2.58k| constexpr auto B = bits; 599| 2.58k| constexpr auto BL = bits_leaf; 600| | 601| 2.58k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 1.36k, False: 1.21k] ------------------ 602| 1.36k| auto n = p.node()->inner() + start; 603| 1.36k| auto last = p.count() - 1; 604| 1.36k| auto e = p.node()->inner() + last; 605| 1.36k| if (n <= e) { ------------------ | Branch (605:13): [True: 942, False: 420] ------------------ 606| 3.63k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 2.69k, False: 942] ------------------ 607| 2.69k| IMMER_PREFETCH(n + 1); 608| 2.69k| make_full_leaf_pos(*n).visit(v, args...); 609| 2.69k| } 610| 942| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 942| } 612| 1.36k| } else { 613| 1.21k| auto n = p.node()->inner() + start; 614| 1.21k| auto last = p.count() - 1; 615| 1.21k| auto e = p.node()->inner() + last; 616| 1.21k| auto ss = p.shift() - B; 617| 1.21k| if (n <= e) { ------------------ | Branch (617:13): [True: 733, False: 486] ------------------ 618| 1.90k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 1.17k, False: 733] ------------------ 619| 1.17k| make_full_pos(*n, ss).visit(v, args...); 620| 733| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 733| } 622| 1.21k| } 623| 2.58k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 927| 6.91k| { 928| 6.91k| return towards_oh_ch_regular( 929| 6.91k| *this, v, idx, offset_hint, count(), args...); 930| 6.91k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 6.91k|{ 633| 6.91k| constexpr auto B = bits; 634| 6.91k| constexpr auto BL = bits_leaf; 635| 6.91k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.91k, False: 0] ------------------ 636| 6.91k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.91k, False: 0] ------------------ 637| 6.91k| auto is_leaf = p.shift() == BL; 638| 6.91k| auto child = p.node()->inner()[offset_hint]; 639| 6.91k| auto is_full = offset_hint + 1 != count_hint; 640| 6.91k| return is_full ------------------ | Branch (640:12): [True: 2.78k, False: 4.13k] ------------------ 641| 6.91k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 981, False: 1.80k] ------------------ 642| 2.78k| : make_full_pos(child, p.shift() - B) 643| 1.80k| .visit(v, idx, args...)) 644| 6.91k| : (is_leaf ------------------ | Branch (644:19): [True: 1.12k, False: 3.01k] ------------------ 645| 4.13k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 4.13k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.01k| .visit(v, idx, args...)); 648| 6.91k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 927| 7.08k| { 928| 7.08k| return towards_oh_ch_regular( 929| 7.08k| *this, v, idx, offset_hint, count(), args...); 930| 7.08k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 7.08k|{ 633| 7.08k| constexpr auto B = bits; 634| 7.08k| constexpr auto BL = bits_leaf; 635| 7.08k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 7.08k, False: 0] ------------------ 636| 7.08k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 7.08k, False: 0] ------------------ 637| 7.08k| auto is_leaf = p.shift() == BL; 638| 7.08k| auto child = p.node()->inner()[offset_hint]; 639| 7.08k| auto is_full = offset_hint + 1 != count_hint; 640| 7.08k| return is_full ------------------ | Branch (640:12): [True: 3.57k, False: 3.51k] ------------------ 641| 7.08k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.48k, False: 2.08k] ------------------ 642| 3.57k| : make_full_pos(child, p.shift() - B) 643| 2.08k| .visit(v, idx, args...)) 644| 7.08k| : (is_leaf ------------------ | Branch (644:19): [True: 852, False: 2.65k] ------------------ 645| 3.51k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.51k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.65k| .visit(v, idx, args...)); 648| 7.08k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 867| 12.1k| { 868| 12.1k| return each_right_regular(*this, v, start, args...); 869| 12.1k| } _ZN5immer6detail4rbts18each_right_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_11dec_visitorEJEEEvOT_T0_jDpOT1_: 597| 12.1k|{ 598| 12.1k| constexpr auto B = bits; 599| 12.1k| constexpr auto BL = bits_leaf; 600| | 601| 12.1k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 4.10k, False: 8.06k] ------------------ 602| 4.10k| auto n = p.node()->inner() + start; 603| 4.10k| auto last = p.count() - 1; 604| 4.10k| auto e = p.node()->inner() + last; 605| 4.10k| if (n <= e) { ------------------ | Branch (605:13): [True: 2.21k, False: 1.88k] ------------------ 606| 4.19k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 1.98k, False: 2.21k] ------------------ 607| 1.98k| IMMER_PREFETCH(n + 1); 608| 1.98k| make_full_leaf_pos(*n).visit(v, args...); 609| 1.98k| } 610| 2.21k| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 2.21k| } 612| 8.06k| } else { 613| 8.06k| auto n = p.node()->inner() + start; 614| 8.06k| auto last = p.count() - 1; 615| 8.06k| auto e = p.node()->inner() + last; 616| 8.06k| auto ss = p.shift() - B; 617| 8.06k| if (n <= e) { ------------------ | Branch (617:13): [True: 5.04k, False: 3.01k] ------------------ 618| 6.07k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 1.02k, False: 5.04k] ------------------ 619| 1.02k| make_full_pos(*n, ss).visit(v, args...); 620| 5.04k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 5.04k| } 622| 8.06k| } 623| 12.1k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1813| 27.3k| { 1814| 27.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 27.3k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 9.98k| { 1687| 9.98k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 9.98k, False: 0] ------------------ 1688| 9.98k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 9.60k, False: 377] ------------------ 1689| 9.98k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 9.98k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 9.98k| { 1699| 9.98k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 9.98k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 9.98k| { 1718| 9.98k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 9.98k, False: 0] ------------------ 1719| 9.98k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 9.60k, False: 377] | Branch (1719:9): [True: 9.98k, False: 0] ------------------ 1720| 9.98k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 9.98k| auto child = node_->inner()[offset_hint]; 1722| 9.98k| auto is_leaf = shift_ == BL; 1723| 9.98k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 9.98k| auto next_idx = idx - left_size_hint; 1725| 9.98k| return is_leaf ------------------ | Branch (1725:16): [True: 1.98k, False: 7.99k] ------------------ 1726| 9.98k| ? make_leaf_sub_pos(child, next_size) 1727| 1.98k| .visit(v, next_idx, args...) 1728| 9.98k| : visit_maybe_relaxed_sub( 1729| 7.99k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 9.98k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 1.98k| { 145| 1.98k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.98k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 7.99k|{ 1839| 7.99k| assert(node); ------------------ | Branch (1839:5): [True: 7.99k, False: 0] ------------------ 1840| 7.99k| auto relaxed = node->relaxed(); 1841| 7.99k| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.06k, False: 4.93k] ------------------ 1842| 3.06k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.06k, False: 0] ------------------ 1843| 3.06k| return make_relaxed_pos(node, shift, relaxed) 1844| 3.06k| .visit(v, std::forward(args)...); 1845| 4.93k| } else { 1846| 4.93k| return make_regular_sub_pos(node, shift, size) 1847| 4.93k| .visit(v, std::forward(args)...); 1848| 4.93k| } 1849| 7.99k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 3.06k| { 1814| 3.06k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.06k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 4.93k| { 1037| 4.93k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.93k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1036| 10.5k| { 1037| 10.5k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 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_: 1686| 10.8k| { 1687| 10.8k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 10.8k, False: 0] ------------------ 1688| 10.8k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 8.98k, False: 1.87k] ------------------ 1689| 10.8k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 10.8k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 10.8k| { 1699| 10.8k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 10.8k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 10.8k| { 1718| 10.8k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 10.8k, False: 0] ------------------ 1719| 10.8k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 8.98k, False: 1.87k] | Branch (1719:9): [True: 10.8k, False: 0] ------------------ 1720| 10.8k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 10.8k| auto child = node_->inner()[offset_hint]; 1722| 10.8k| auto is_leaf = shift_ == BL; 1723| 10.8k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 10.8k| auto next_idx = idx - left_size_hint; 1725| 10.8k| return is_leaf ------------------ | Branch (1725:16): [True: 4.31k, False: 6.54k] ------------------ 1726| 10.8k| ? make_leaf_sub_pos(child, next_size) 1727| 4.31k| .visit(v, next_idx, args...) 1728| 10.8k| : visit_maybe_relaxed_sub( 1729| 6.54k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 10.8k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 4.31k| { 145| 4.31k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.31k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 6.54k|{ 1839| 6.54k| assert(node); ------------------ | Branch (1839:5): [True: 6.54k, False: 0] ------------------ 1840| 6.54k| auto relaxed = node->relaxed(); 1841| 6.54k| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.38k, False: 3.16k] ------------------ 1842| 3.38k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.38k, False: 0] ------------------ 1843| 3.38k| return make_relaxed_pos(node, shift, relaxed) 1844| 3.38k| .visit(v, std::forward(args)...); 1845| 3.38k| } else { 1846| 3.16k| return make_regular_sub_pos(node, shift, size) 1847| 3.16k| .visit(v, std::forward(args)...); 1848| 3.16k| } 1849| 6.54k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 3.38k| { 1814| 3.38k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.38k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 3.16k| { 1037| 3.16k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.16k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1653| 31.0k| { 1654| 31.0k| assert(start > 0); ------------------ | Branch (1654:9): [True: 31.0k, False: 0] ------------------ 1655| 31.0k| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 31.0k, False: 0] ------------------ 1656| 31.0k| auto s = relaxed_->d.sizes[start - 1]; 1657| 31.0k| auto p = node_->inner(); 1658| 31.0k| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 2.96k, False: 28.1k] ------------------ 1659| 10.0k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 7.10k, False: 2.96k] ------------------ 1660| 7.10k| IMMER_PREFETCH(p + i + 1); 1661| 7.10k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 7.10k| .visit(v, args...); 1663| 7.10k| s = relaxed_->d.sizes[i]; 1664| 7.10k| assert(s); ------------------ | Branch (1664:17): [True: 7.10k, False: 0] ------------------ 1665| 7.10k| } 1666| 28.1k| } else { 1667| 28.1k| auto ss = shift_ - B; 1668| 162k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 134k, False: 28.1k] ------------------ 1669| 134k| visit_maybe_relaxed_sub( 1670| 134k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 134k| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 134k, False: 0] ------------------ 1673| 134k| } 1674| 28.1k| } 1675| 31.0k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 12.4k| { 1037| 12.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 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_: 927| 5.24k| { 928| 5.24k| return towards_oh_ch_regular( 929| 5.24k| *this, v, idx, offset_hint, count(), args...); 930| 5.24k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_23slice_right_mut_visitorISD_Lb1ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 5.24k|{ 633| 5.24k| constexpr auto B = bits; 634| 5.24k| constexpr auto BL = bits_leaf; 635| 5.24k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.24k, False: 0] ------------------ 636| 5.24k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.24k, False: 0] ------------------ 637| 5.24k| auto is_leaf = p.shift() == BL; 638| 5.24k| auto child = p.node()->inner()[offset_hint]; 639| 5.24k| auto is_full = offset_hint + 1 != count_hint; 640| 5.24k| return is_full ------------------ | Branch (640:12): [True: 4.47k, False: 765] ------------------ 641| 5.24k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.23k, False: 3.24k] ------------------ 642| 4.47k| : make_full_pos(child, p.shift() - B) 643| 3.24k| .visit(v, idx, args...)) 644| 5.24k| : (is_leaf ------------------ | Branch (644:19): [True: 765, False: 0] ------------------ 645| 765| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 765| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 5.24k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 1.90k| { 208| 1.90k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.90k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 3.74k| { 1406| 3.74k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.74k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 1.17k| { 1337| 1.17k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.17k, False: 0] ------------------ 1338| 1.17k| auto is_leaf = shift_ == BL; 1339| 1.17k| auto child = node_->inner()[offset_hint]; 1340| 1.17k| return is_leaf ------------------ | Branch (1340:16): [True: 679, False: 493] ------------------ 1341| 1.17k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.17k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.17k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 112| 765| { 113| 765| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 765| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 855| { 145| 855| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 855| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 52.0k|{ 1839| 52.0k| assert(node); ------------------ | Branch (1839:5): [True: 52.0k, False: 0] ------------------ 1840| 52.0k| auto relaxed = node->relaxed(); 1841| 52.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 49.7k, False: 2.37k] ------------------ 1842| 49.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 49.7k, False: 0] ------------------ 1843| 49.7k| return make_relaxed_pos(node, shift, relaxed) 1844| 49.7k| .visit(v, std::forward(args)...); 1845| 49.7k| } else { 1846| 2.37k| return make_regular_sub_pos(node, shift, size) 1847| 2.37k| .visit(v, std::forward(args)...); 1848| 2.37k| } 1849| 52.0k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 49.7k| { 1814| 49.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 49.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_: 1705| 1.83k| { 1706| 1.83k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 1.83k, False: 0] ------------------ 1707| 1.83k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 1.39k, False: 435] ------------------ 1708| 1.83k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 1.83k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 1.83k| { 1718| 1.83k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 1.83k, False: 0] ------------------ 1719| 1.83k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 1.39k, False: 435] | Branch (1719:9): [True: 1.83k, False: 0] ------------------ 1720| 1.83k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 1.83k| auto child = node_->inner()[offset_hint]; 1722| 1.83k| auto is_leaf = shift_ == BL; 1723| 1.83k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 1.83k| auto next_idx = idx - left_size_hint; 1725| 1.83k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 1.83k] ------------------ 1726| 1.83k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 1.83k| : visit_maybe_relaxed_sub( 1729| 1.83k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 1.83k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1705| 3.79k| { 1706| 3.79k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 3.79k, False: 0] ------------------ 1707| 3.79k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 3.28k, False: 515] ------------------ 1708| 3.79k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 3.79k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 3.79k| { 1718| 3.79k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 3.79k, False: 0] ------------------ 1719| 3.79k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.28k, False: 515] | Branch (1719:9): [True: 3.79k, False: 0] ------------------ 1720| 3.79k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 3.79k| auto child = node_->inner()[offset_hint]; 1722| 3.79k| auto is_leaf = shift_ == BL; 1723| 3.79k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 3.79k| auto next_idx = idx - left_size_hint; 1725| 3.79k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 3.79k] ------------------ 1726| 3.79k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 3.79k| : visit_maybe_relaxed_sub( 1729| 3.79k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 3.79k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 3.79k|{ 1839| 3.79k| assert(node); ------------------ | Branch (1839:5): [True: 3.79k, False: 0] ------------------ 1840| 3.79k| auto relaxed = node->relaxed(); 1841| 3.79k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.36k, False: 1.43k] ------------------ 1842| 2.36k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.36k, False: 0] ------------------ 1843| 2.36k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.36k| .visit(v, std::forward(args)...); 1845| 2.36k| } else { 1846| 1.43k| return make_regular_sub_pos(node, shift, size) 1847| 1.43k| .visit(v, std::forward(args)...); 1848| 1.43k| } 1849| 3.79k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 2.36k| { 1814| 2.36k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.36k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 1.43k| { 1037| 1.43k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.43k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 946| 1.52k| { 947| 1.52k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 1.52k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_22slice_left_mut_visitorISD_Lb1ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjDpOT1_: 653| 1.52k|{ 654| 1.52k| constexpr auto B = bits; 655| 1.52k| constexpr auto BL = bits_leaf; 656| 1.52k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 1.52k, False: 0] ------------------ 657| 1.52k| auto is_leaf = p.shift() == BL; 658| 1.52k| auto child = p.node()->inner()[offset_hint]; 659| 1.52k| auto lsize = offset_hint << p.shift(); 660| 1.52k| auto size = p.this_size(); 661| 1.52k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 1.52k| return is_full ------------------ | Branch (662:12): [True: 641, False: 885] ------------------ 663| 1.52k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 641] ------------------ 664| 641| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 641| : make_full_pos(child, p.shift() - B) 666| 641| .visit(v, idx - lsize, args...)) 667| 1.52k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 885] ------------------ 668| 885| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 885| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 885| .visit(v, idx - lsize, args...)); 672| 1.52k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 641| { 1406| 641| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 641| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1348| 2.45k| { 1349| 2.45k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 2.45k, False: 0] ------------------ 1350| 2.45k| auto is_leaf = shift_ == BL; 1351| 2.45k| auto child = node_->inner()[offset_hint]; 1352| 2.45k| auto lsize = size_t{offset_hint} << shift_; 1353| 2.45k| return is_leaf ------------------ | Branch (1353:16): [True: 1.85k, False: 598] ------------------ 1354| 2.45k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 2.45k| : make_full_pos(child, shift_ - B) 1356| 598| .visit(v, idx - lsize, args...); 1357| 2.45k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 8.10k| { 208| 8.10k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 8.10k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 1.80k| { 1406| 1.80k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.80k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 885| { 1037| 885| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 885| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 946| 7.46k| { 947| 7.46k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 7.46k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_22slice_left_mut_visitorISD_Lb0ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjDpOT1_: 653| 7.46k|{ 654| 7.46k| constexpr auto B = bits; 655| 7.46k| constexpr auto BL = bits_leaf; 656| 7.46k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 7.46k, False: 0] ------------------ 657| 7.46k| auto is_leaf = p.shift() == BL; 658| 7.46k| auto child = p.node()->inner()[offset_hint]; 659| 7.46k| auto lsize = offset_hint << p.shift(); 660| 7.46k| auto size = p.this_size(); 661| 7.46k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 7.46k| return is_full ------------------ | Branch (662:12): [True: 7.46k, False: 0] ------------------ 663| 7.46k| ? (is_leaf ------------------ | Branch (663:19): [True: 6.25k, False: 1.21k] ------------------ 664| 7.46k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 7.46k| : make_full_pos(child, p.shift() - B) 666| 1.21k| .visit(v, idx - lsize, args...)) 667| 7.46k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 0] ------------------ 668| 0| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 0| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 0| .visit(v, idx - lsize, args...)); 672| 7.46k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1813| 1.83k| { 1814| 1.83k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.83k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1705| 162k| { 1706| 162k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 162k, False: 0] ------------------ 1707| 162k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 37.8k, False: 124k] ------------------ 1708| 162k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 162k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 162k| { 1718| 162k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 162k, False: 0] ------------------ 1719| 162k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 37.8k, False: 124k] | Branch (1719:9): [True: 162k, False: 0] ------------------ 1720| 162k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 162k| auto child = node_->inner()[offset_hint]; 1722| 162k| auto is_leaf = shift_ == BL; 1723| 162k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 162k| auto next_idx = idx - left_size_hint; 1725| 162k| return is_leaf ------------------ | Branch (1725:16): [True: 4.34k, False: 158k] ------------------ 1726| 162k| ? make_leaf_sub_pos(child, next_size) 1727| 4.34k| .visit(v, next_idx, args...) 1728| 162k| : visit_maybe_relaxed_sub( 1729| 158k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 162k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 4.34k| { 145| 4.34k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.34k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 158k|{ 1839| 158k| assert(node); ------------------ | Branch (1839:5): [True: 158k, False: 0] ------------------ 1840| 158k| auto relaxed = node->relaxed(); 1841| 158k| if (relaxed) { ------------------ | Branch (1841:9): [True: 156k, False: 1.95k] ------------------ 1842| 156k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 156k, False: 0] ------------------ 1843| 156k| return make_relaxed_pos(node, shift, relaxed) 1844| 156k| .visit(v, std::forward(args)...); 1845| 156k| } else { 1846| 1.95k| return make_regular_sub_pos(node, shift, size) 1847| 1.95k| .visit(v, std::forward(args)...); 1848| 1.95k| } 1849| 158k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 156k| { 1814| 156k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 156k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 1.95k| { 1037| 1.95k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.95k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1705| 83.7k| { 1706| 83.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 83.7k, False: 0] ------------------ 1707| 83.7k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 50.1k, False: 33.5k] ------------------ 1708| 83.7k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 83.7k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 83.7k| { 1718| 83.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 83.7k, False: 0] ------------------ 1719| 83.7k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 50.1k, False: 33.5k] | Branch (1719:9): [True: 83.7k, False: 0] ------------------ 1720| 83.7k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 83.7k| auto child = node_->inner()[offset_hint]; 1722| 83.7k| auto is_leaf = shift_ == BL; 1723| 83.7k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 83.7k| auto next_idx = idx - left_size_hint; 1725| 83.7k| return is_leaf ------------------ | Branch (1725:16): [True: 37.7k, False: 45.9k] ------------------ 1726| 83.7k| ? make_leaf_sub_pos(child, next_size) 1727| 37.7k| .visit(v, next_idx, args...) 1728| 83.7k| : visit_maybe_relaxed_sub( 1729| 45.9k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 83.7k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 37.7k| { 145| 37.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 37.7k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 45.9k|{ 1839| 45.9k| assert(node); ------------------ | Branch (1839:5): [True: 45.9k, False: 0] ------------------ 1840| 45.9k| auto relaxed = node->relaxed(); 1841| 45.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 43.5k, False: 2.35k] ------------------ 1842| 43.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 43.5k, False: 0] ------------------ 1843| 43.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 43.5k| .visit(v, std::forward(args)...); 1845| 43.5k| } else { 1846| 2.35k| return make_regular_sub_pos(node, shift, size) 1847| 2.35k| .visit(v, std::forward(args)...); 1848| 2.35k| } 1849| 45.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 43.5k| { 1814| 43.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 43.5k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 2.35k| { 1037| 2.35k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.35k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 2.37k| { 1037| 2.37k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.37k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitor3rrbEJNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERKPSC_RKjRmEEEDcPT_jmT0_DpOT1_: 1838| 23.4k|{ 1839| 23.4k| assert(node); ------------------ | Branch (1839:5): [True: 23.4k, False: 0] ------------------ 1840| 23.4k| auto relaxed = node->relaxed(); 1841| 23.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 15.1k, False: 8.31k] ------------------ 1842| 15.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 15.1k, False: 0] ------------------ 1843| 15.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 15.1k| .visit(v, std::forward(args)...); 1845| 15.1k| } else { 1846| 8.31k| return make_regular_sub_pos(node, shift, size) 1847| 8.31k| .visit(v, std::forward(args)...); 1848| 8.31k| } 1849| 23.4k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor3rrbEJNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERKPSC_RKjRmEEEDcT_DpOT0_: 1813| 15.1k| { 1814| 15.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 15.1k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcPT_jmT0_DpOT1_: 1838| 15.1k|{ 1839| 15.1k| assert(node); ------------------ | Branch (1839:5): [True: 15.1k, False: 0] ------------------ 1840| 15.1k| auto relaxed = node->relaxed(); 1841| 15.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 12.0k, False: 3.16k] ------------------ 1842| 12.0k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 12.0k, False: 0] ------------------ 1843| 12.0k| return make_relaxed_pos(node, shift, relaxed) 1844| 12.0k| .visit(v, std::forward(args)...); 1845| 12.0k| } else { 1846| 3.16k| return make_regular_sub_pos(node, shift, size) 1847| 3.16k| .visit(v, std::forward(args)...); 1848| 3.16k| } 1849| 15.1k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcT_DpOT0_: 1813| 12.0k| { 1814| 12.0k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 12.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcjT_DpOT0_: 1793| 60.0k| { 1794| 60.0k| auto child = node_->inner()[offset]; 1795| 60.0k| auto child_size = size(offset); 1796| 60.0k| auto is_leaf = shift_ == BL; 1797| 60.0k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 24.8k, False: 35.2k] ------------------ 1798| 60.0k| : visit_maybe_relaxed_sub( 1799| 35.2k| child, shift_ - B, child_size, v, args...); 1800| 60.0k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 144| 25.4k| { 145| 25.4k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 25.4k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1804| 25.4k| { 1805| 25.4k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 25.4k, False: 0] ------------------ 1806| 25.4k| auto child = node_->inner()[offset]; 1807| 25.4k| auto child_size = size(offset); 1808| 25.4k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 25.4k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 144| 26.0k| { 145| 26.0k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 26.0k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 35.2k|{ 1839| 35.2k| assert(node); ------------------ | Branch (1839:5): [True: 35.2k, False: 0] ------------------ 1840| 35.2k| auto relaxed = node->relaxed(); 1841| 35.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 30.8k, False: 4.37k] ------------------ 1842| 30.8k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 30.8k, False: 0] ------------------ 1843| 30.8k| return make_relaxed_pos(node, shift, relaxed) 1844| 30.8k| .visit(v, std::forward(args)...); 1845| 30.8k| } else { 1846| 4.37k| return make_regular_sub_pos(node, shift, size) 1847| 4.37k| .visit(v, std::forward(args)...); 1848| 4.37k| } 1849| 35.2k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1813| 30.8k| { 1814| 30.8k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 30.8k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1793| 30.8k| { 1794| 30.8k| auto child = node_->inner()[offset]; 1795| 30.8k| auto child_size = size(offset); 1796| 30.8k| auto is_leaf = shift_ == BL; 1797| 30.8k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 30.8k] ------------------ 1798| 30.8k| : visit_maybe_relaxed_sub( 1799| 30.8k| child, shift_ - B, child_size, v, args...); 1800| 30.8k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 30.8k|{ 1839| 30.8k| assert(node); ------------------ | Branch (1839:5): [True: 30.8k, False: 0] ------------------ 1840| 30.8k| auto relaxed = node->relaxed(); 1841| 30.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 29.9k, False: 955] ------------------ 1842| 29.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 29.9k, False: 0] ------------------ 1843| 29.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 29.9k| .visit(v, std::forward(args)...); 1845| 29.9k| } else { 1846| 955| return make_regular_sub_pos(node, shift, size) 1847| 955| .visit(v, std::forward(args)...); 1848| 955| } 1849| 30.8k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1813| 29.9k| { 1814| 29.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 29.9k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 1.27k| { 1037| 1.27k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.27k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcjT_DpOT0_: 1793| 8.63k| { 1794| 8.63k| auto child = node_->inner()[offset]; 1795| 8.63k| auto child_size = size(offset); 1796| 8.63k| auto is_leaf = shift_ == BL; 1797| 8.63k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 5.69k, False: 2.94k] ------------------ 1798| 8.63k| : visit_maybe_relaxed_sub( 1799| 2.94k| child, shift_ - B, child_size, v, args...); 1800| 8.63k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 144| 5.69k| { 145| 5.69k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.69k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1025| 5.69k| { 1026| 5.69k| assert(shift_ == BL); ------------------ | Branch (1026:9): [True: 5.69k, False: 0] ------------------ 1027| 5.69k| auto child = node_->inner()[idx]; 1028| 5.69k| auto lsize = size(idx); 1029| 5.69k| auto is_full = idx + 1 < count(); 1030| 5.69k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1030:16): [True: 5.02k, False: 667] ------------------ 1031| 5.69k| : make_leaf_sub_pos(child, lsize).visit(v, args...); 1032| 5.69k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 207| 12.0k| { 208| 12.0k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 12.0k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitor10this_aux_tEJRjRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 2.94k|{ 1839| 2.94k| assert(node); ------------------ | Branch (1839:5): [True: 2.94k, False: 0] ------------------ 1840| 2.94k| auto relaxed = node->relaxed(); 1841| 2.94k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.11k, False: 826] ------------------ 1842| 2.11k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.11k, False: 0] ------------------ 1843| 2.11k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.11k| .visit(v, std::forward(args)...); 1845| 2.11k| } else { 1846| 826| return make_regular_sub_pos(node, shift, size) 1847| 826| .visit(v, std::forward(args)...); 1848| 826| } 1849| 2.94k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1813| 2.11k| { 1814| 2.11k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.11k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1007| 2.11k| { 1008| 2.11k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 2.11k, False: 0] ------------------ 1009| 2.11k| auto is_leaf = shift_ == BL; 1010| 2.11k| auto child = node_->inner()[idx]; 1011| 2.11k| auto lsize = size(idx); 1012| 2.11k| auto is_full = idx + 1 < count(); 1013| 2.11k| return is_full ------------------ | Branch (1013:16): [True: 1.79k, False: 324] ------------------ 1014| 2.11k| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 1.79k] ------------------ 1015| 1.79k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.79k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 2.11k| : (is_leaf ------------------ | Branch (1017:23): [True: 0, False: 324] ------------------ 1018| 324| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 324| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 324| .visit(v, args...)); 1021| 2.11k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1405| 2.27k| { 1406| 2.27k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.27k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcjT_DpOT0_: 1793| 8.33k| { 1794| 8.33k| auto child = node_->inner()[offset]; 1795| 8.33k| auto child_size = size(offset); 1796| 8.33k| auto is_leaf = shift_ == BL; 1797| 8.33k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 7.00k, False: 1.33k] ------------------ 1798| 8.33k| : visit_maybe_relaxed_sub( 1799| 1.33k| child, shift_ - B, child_size, v, args...); 1800| 8.33k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 144| 7.00k| { 145| 7.00k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.00k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1396| 7.00k| { 1397| 7.00k| assert(shift_ == BL); ------------------ | Branch (1397:9): [True: 7.00k, False: 0] ------------------ 1398| 7.00k| assert(idx < count()); ------------------ | Branch (1398:9): [True: 7.00k, False: 0] ------------------ 1399| 7.00k| auto child = node_->inner()[idx]; 1400| 7.00k| return make_full_leaf_pos(child).visit(v, args...); 1401| 7.00k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 1.33k|{ 1839| 1.33k| assert(node); ------------------ | Branch (1839:5): [True: 1.33k, False: 0] ------------------ 1840| 1.33k| auto relaxed = node->relaxed(); 1841| 1.33k| if (relaxed) { ------------------ | Branch (1841:9): [True: 475, False: 857] ------------------ 1842| 475| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 475, False: 0] ------------------ 1843| 475| return make_relaxed_pos(node, shift, relaxed) 1844| 475| .visit(v, std::forward(args)...); 1845| 857| } else { 1846| 857| return make_regular_sub_pos(node, shift, size) 1847| 857| .visit(v, std::forward(args)...); 1848| 857| } 1849| 1.33k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1813| 475| { 1814| 475| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 475| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1386| 475| { 1387| 475| assert(idx < count()); ------------------ | Branch (1387:9): [True: 475, False: 0] ------------------ 1388| 475| auto is_leaf = shift_ == BL; 1389| 475| auto child = node_->inner()[idx]; 1390| 475| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 475] ------------------ 1391| 475| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 475| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 857| { 1037| 857| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 857| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1386| 857| { 1387| 857| assert(idx < count()); ------------------ | Branch (1387:9): [True: 857, False: 0] ------------------ 1388| 857| auto is_leaf = shift_ == BL; 1389| 857| auto child = node_->inner()[idx]; 1390| 857| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 857] ------------------ 1391| 857| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 857| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1405| 1.68k| { 1406| 1.68k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.68k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_pred_zipINS1_14equals_visitorEJEEEbT_PSC_DpOT0_: 1222| 3.43k| { 1223| 3.43k| auto p = node_->inner(); 1224| 3.43k| auto p2 = other->inner(); 1225| 3.43k| auto e = p + branches; 1226| 3.43k| if (shift_ == BL) { ------------------ | Branch (1226:13): [True: 2.57k, False: 865] ------------------ 1227| 16.8k| for (; p != e; ++p, ++p2) { ------------------ | Branch (1227:20): [True: 15.4k, False: 1.38k] ------------------ 1228| 15.4k| IMMER_PREFETCH(p + 1); 1229| 15.4k| if (!make_full_leaf_pos(*p).visit(v, *p2, args...)) ------------------ | Branch (1229:21): [True: 1.19k, False: 14.3k] ------------------ 1230| 1.19k| return false; 1231| 15.4k| } 1232| 2.57k| } else { 1233| 865| auto ss = shift_ - B; 1234| 5.98k| for (; p != e; ++p, ++p2) ------------------ | Branch (1234:20): [True: 5.38k, False: 607] ------------------ 1235| 5.38k| if (!make_full_pos(*p, ss).visit(v, *p2, args...)) ------------------ | Branch (1235:21): [True: 258, False: 5.12k] ------------------ 1236| 258| return false; 1237| 865| } 1238| 1.98k| return true; 1239| 3.43k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 207| 22.9k| { 208| 22.9k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 22.9k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 1405| 10.8k| { 1406| 10.8k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 10.8k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_pred_zipINS1_14equals_visitorEJEEEbT_PSC_DpOT0_: 837| 5.20k| { 838| 5.20k| return each_pred_zip_regular(*this, v, other, args...); 839| 5.20k| } _ZN5immer6detail4rbts21each_pred_zip_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_14equals_visitorEJEEEbOT_T0_PNSt3__15decayISH_E4type6node_tEDpOT1_: 392| 5.20k|{ 393| 5.20k| constexpr auto B = bits; 394| 5.20k| constexpr auto BL = bits_leaf; 395| | 396| 5.20k| auto n = p.node()->inner(); 397| 5.20k| auto n2 = other->inner(); 398| 5.20k| auto last = p.count() - 1; 399| 5.20k| auto e = n + last; 400| 5.20k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 2.11k, False: 3.09k] ------------------ 401| 6.70k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 5.49k, False: 1.20k] ------------------ 402| 5.49k| IMMER_PREFETCH(n + 1); 403| 5.49k| IMMER_PREFETCH(n2 + 1); 404| 5.49k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 904, False: 4.59k] ------------------ 405| 904| return false; 406| 5.49k| } 407| 1.20k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 3.09k| } else { 409| 3.09k| auto ss = p.shift() - B; 410| 6.85k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 4.34k, False: 2.51k] ------------------ 411| 4.34k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 579, False: 3.76k] ------------------ 412| 579| return false; 413| 2.51k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 3.09k| } 415| 5.20k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 112| 3.00k| { 113| 3.00k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 3.00k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 336| 3.21k| { 337| 3.21k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.21k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE13each_pred_zipINS1_14equals_visitorEJEEEbT_PSC_DpOT0_: 255| 2.93k| { 256| 2.93k| return each_pred_zip_regular(*this, v, other, args...); 257| 2.93k| } _ZN5immer6detail4rbts21each_pred_zip_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_14equals_visitorEJEEEbOT_T0_PNSt3__15decayISH_E4type6node_tEDpOT1_: 392| 2.93k|{ 393| 2.93k| constexpr auto B = bits; 394| 2.93k| constexpr auto BL = bits_leaf; 395| | 396| 2.93k| auto n = p.node()->inner(); 397| 2.93k| auto n2 = other->inner(); 398| 2.93k| auto last = p.count() - 1; 399| 2.93k| auto e = n + last; 400| 2.93k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 2.00k, False: 930] ------------------ 401| 3.79k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 1.99k, False: 1.79k] ------------------ 402| 1.99k| IMMER_PREFETCH(n + 1); 403| 1.99k| IMMER_PREFETCH(n2 + 1); 404| 1.99k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 208, False: 1.78k] ------------------ 405| 208| return false; 406| 1.99k| } 407| 1.79k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 2.00k| } else { 409| 930| auto ss = p.shift() - B; 410| 1.82k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 1.11k, False: 704] ------------------ 411| 1.11k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 226, False: 890] ------------------ 412| 226| return false; 413| 704| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 930| } 415| 2.93k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_24for_each_chunk_p_visitorEJZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcjSK_DpOT0_: 1386| 6.06k| { 1387| 6.06k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 6.06k, False: 0] ------------------ 1388| 6.06k| auto is_leaf = shift_ == BL; 1389| 6.06k| auto child = node_->inner()[idx]; 1390| 6.06k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 5.30k, False: 763] ------------------ 1391| 6.06k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 6.06k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 207| 202k| { 208| 202k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 202k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_18region_for_visitorIiEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 4.50M|{ 1839| 4.50M| assert(node); ------------------ | Branch (1839:5): [True: 4.50M, False: 0] ------------------ 1840| 4.50M| auto relaxed = node->relaxed(); 1841| 4.50M| if (relaxed) { ------------------ | Branch (1841:9): [True: 4.26M, False: 235k] ------------------ 1842| 4.26M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 4.26M, False: 0] ------------------ 1843| 4.26M| return make_relaxed_pos(node, shift, relaxed) 1844| 4.26M| .visit(v, std::forward(args)...); 1845| 4.26M| } else { 1846| 235k| return make_regular_sub_pos(node, shift, size) 1847| 235k| .visit(v, std::forward(args)...); 1848| 235k| } 1849| 4.50M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1813| 4.26M| { 1814| 4.26M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 4.26M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1679| 4.26M| { 1680| 4.26M| return towards_oh(v, idx, subindex(idx), args...); 1681| 4.26M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_18region_for_visitorIiEEJEEEDcT_mjDpOT0_: 1686| 4.26M| { 1687| 4.26M| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 4.26M, False: 0] ------------------ 1688| 4.26M| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 2.92M, False: 1.34M] ------------------ 1689| 4.26M| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 4.26M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE14towards_oh_sbhINS1_18region_for_visitorIiEEJEEEDcT_mjmDpOT0_: 1698| 4.26M| { 1699| 4.26M| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 4.26M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE18towards_sub_oh_sbhINS1_18region_for_visitorIiEEJEEEDcT_mjmDpOT0_: 1717| 4.26M| { 1718| 4.26M| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 4.26M, False: 0] ------------------ 1719| 4.26M| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 2.92M, False: 1.34M] | Branch (1719:9): [True: 4.26M, False: 0] ------------------ 1720| 4.26M| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 4.26M| auto child = node_->inner()[offset_hint]; 1722| 4.26M| auto is_leaf = shift_ == BL; 1723| 4.26M| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 4.26M| auto next_idx = idx - left_size_hint; 1725| 4.26M| return is_leaf ------------------ | Branch (1725:16): [True: 944k, False: 3.32M] ------------------ 1726| 4.26M| ? make_leaf_sub_pos(child, next_size) 1727| 944k| .visit(v, next_idx, args...) 1728| 4.26M| : visit_maybe_relaxed_sub( 1729| 3.32M| child, shift_ - B, next_size, v, next_idx, args...); 1730| 4.26M| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 144| 944k| { 145| 944k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 944k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1036| 235k| { 1037| 235k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 235k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 919| 235k| { 920| 235k| return towards_oh_ch_regular( 921| 235k| *this, v, idx, index(idx), count(), args...); 922| 235k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_18region_for_visitorIiEEJEEEDcOT_T0_mjjDpOT1_: 632| 235k|{ 633| 235k| constexpr auto B = bits; 634| 235k| constexpr auto BL = bits_leaf; 635| 235k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 235k, False: 0] ------------------ 636| 235k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 235k, False: 0] ------------------ 637| 235k| auto is_leaf = p.shift() == BL; 638| 235k| auto child = p.node()->inner()[offset_hint]; 639| 235k| auto is_full = offset_hint + 1 != count_hint; 640| 235k| return is_full ------------------ | Branch (640:12): [True: 193k, False: 42.4k] ------------------ 641| 235k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 80.4k, False: 112k] ------------------ 642| 193k| : make_full_pos(child, p.shift() - B) 643| 112k| .visit(v, idx, args...)) 644| 235k| : (is_leaf ------------------ | Branch (644:19): [True: 14.7k, False: 27.7k] ------------------ 645| 42.4k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 42.4k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 27.7k| .visit(v, idx, args...)); 648| 235k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 207| 217k| { 208| 217k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 217k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1405| 233k| { 1406| 233k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 233k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1322| 233k| { 1323| 233k| return towards_oh(v, idx, index(idx), args...); 1324| 233k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE10towards_ohINS1_18region_for_visitorIiEEJEEEDcT_mjDpOT0_: 1336| 233k| { 1337| 233k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 233k, False: 0] ------------------ 1338| 233k| auto is_leaf = shift_ == BL; 1339| 233k| auto child = node_->inner()[offset_hint]; 1340| 233k| return is_leaf ------------------ | Branch (1340:16): [True: 130k, False: 103k] ------------------ 1341| 233k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 233k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 233k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 112| 18.4k| { 113| 18.4k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 18.4k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 336| 32.5k| { 337| 32.5k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 32.5k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 297| 32.5k| { 298| 32.5k| return towards_oh_ch_regular( 299| 32.5k| *this, v, idx, index(idx), count(), args...); 300| 32.5k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_18region_for_visitorIiEEJEEEDcOT_T0_mjjDpOT1_: 632| 32.5k|{ 633| 32.5k| constexpr auto B = bits; 634| 32.5k| constexpr auto BL = bits_leaf; 635| 32.5k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 32.5k, False: 0] ------------------ 636| 32.5k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 32.5k, False: 0] ------------------ 637| 32.5k| auto is_leaf = p.shift() == BL; 638| 32.5k| auto child = p.node()->inner()[offset_hint]; 639| 32.5k| auto is_full = offset_hint + 1 != count_hint; 640| 32.5k| return is_full ------------------ | Branch (640:12): [True: 24.0k, False: 8.58k] ------------------ 641| 32.5k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 6.10k, False: 17.8k] ------------------ 642| 24.0k| : make_full_pos(child, p.shift() - B) 643| 17.8k| .visit(v, idx, args...)) 644| 32.5k| : (is_leaf ------------------ | Branch (644:19): [True: 3.70k, False: 4.88k] ------------------ 645| 8.58k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 8.58k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 4.88k| .visit(v, idx, args...)); 648| 32.5k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 1405| 16.5k| { 1406| 16.5k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 16.5k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 1202| 16.5k| { 1203| 16.5k| auto p = node_->inner(); 1204| 16.5k| auto e = p + branches; 1205| 16.5k| if (shift_ == BL) { ------------------ | Branch (1205:13): [True: 15.2k, False: 1.29k] ------------------ 1206| 130k| for (; p != e; ++p) { ------------------ | Branch (1206:20): [True: 116k, False: 14.0k] ------------------ 1207| 116k| IMMER_PREFETCH(p + 1); 1208| 116k| if (!make_full_leaf_pos(*p).visit(v, args...)) ------------------ | Branch (1208:21): [True: 1.21k, False: 115k] ------------------ 1209| 1.21k| return false; 1210| 116k| } 1211| 15.2k| } else { 1212| 1.29k| auto ss = shift_ - B; 1213| 10.1k| for (; p != e; ++p) ------------------ | Branch (1213:20): [True: 9.22k, False: 971] ------------------ 1214| 9.22k| if (!make_full_pos(*p, ss).visit(v, args...)) ------------------ | Branch (1214:21): [True: 325, False: 8.89k] ------------------ 1215| 325| return false; 1216| 1.29k| } 1217| 15.0k| return true; 1218| 16.5k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 826| { 1037| 826| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 826| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1007| 826| { 1008| 826| assert(idx < count()); ------------------ | Branch (1008:9): [True: 826, False: 0] ------------------ 1009| 826| auto is_leaf = shift_ == BL; 1010| 826| auto child = node_->inner()[idx]; 1011| 826| auto lsize = size(idx); 1012| 826| auto is_full = idx + 1 < count(); 1013| 826| return is_full ------------------ | Branch (1013:16): [True: 826, False: 0] ------------------ 1014| 826| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 826] ------------------ 1015| 826| ? make_full_leaf_pos(child).visit(v, args...) 1016| 826| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 826| : (is_leaf ------------------ | Branch (1017:23): [True: 0, False: 0] ------------------ 1018| 0| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 0| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 0| .visit(v, args...)); 1021| 826| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 3.22k| { 1037| 3.22k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.22k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_24for_each_chunk_p_visitorEJZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcjSK_DpOT0_: 1007| 5.10k| { 1008| 5.10k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 5.10k, False: 0] ------------------ 1009| 5.10k| auto is_leaf = shift_ == BL; 1010| 5.10k| auto child = node_->inner()[idx]; 1011| 5.10k| auto lsize = size(idx); 1012| 5.10k| auto is_full = idx + 1 < count(); 1013| 5.10k| return is_full ------------------ | Branch (1013:16): [True: 3.16k, False: 1.94k] ------------------ 1014| 5.10k| ? (is_leaf ------------------ | Branch (1014:23): [True: 2.71k, False: 444] ------------------ 1015| 3.16k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 3.16k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 5.10k| : (is_leaf ------------------ | Branch (1017:23): [True: 1.15k, False: 786] ------------------ 1018| 1.94k| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 1.94k| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 786| .visit(v, args...)); 1021| 5.10k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 144| 896k| { 145| 896k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 896k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 1036| 15.2k| { 1037| 15.2k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 15.2k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 831| 15.2k| { 832| 15.2k| return each_pred_regular(*this, v, args...); 833| 15.2k| } _ZN5immer6detail4rbts17each_pred_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSC_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEEbSM_SN_DpOT1_: 365| 15.2k|{ 366| 15.2k| constexpr auto B = bits; 367| 15.2k| constexpr auto BL = bits_leaf; 368| 15.2k| auto n = p.node()->inner(); 369| 15.2k| auto last = p.count() - 1; 370| 15.2k| auto e = n + last; 371| 15.2k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 12.0k, False: 3.17k] ------------------ 372| 84.5k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 73.4k, False: 11.0k] ------------------ 373| 73.4k| IMMER_PREFETCH(n + 1); 374| 73.4k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 1.02k, False: 72.4k] ------------------ 375| 1.02k| return false; 376| 73.4k| } 377| 11.0k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 12.0k| } else { 379| 3.17k| auto ss = p.shift() - B; 380| 7.45k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 4.93k, False: 2.51k] ------------------ 381| 4.93k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 662, False: 4.27k] ------------------ 382| 662| return false; 383| 2.51k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 3.17k| } 385| 15.2k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 112| 13.0k| { 113| 13.0k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 13.0k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 336| 3.55k| { 337| 3.55k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.55k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 249| 3.55k| { 250| 3.55k| return each_pred_regular(*this, v, args...); 251| 3.55k| } _ZN5immer6detail4rbts17each_pred_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSC_Lj3ELj3EEEEEDaOT_EUlSL_T0_E_EEEbSM_SN_DpOT1_: 365| 3.55k|{ 366| 3.55k| constexpr auto B = bits; 367| 3.55k| constexpr auto BL = bits_leaf; 368| 3.55k| auto n = p.node()->inner(); 369| 3.55k| auto last = p.count() - 1; 370| 3.55k| auto e = n + last; 371| 3.55k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 2.21k, False: 1.33k] ------------------ 372| 5.79k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 3.81k, False: 1.97k] ------------------ 373| 3.81k| IMMER_PREFETCH(n + 1); 374| 3.81k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 239, False: 3.57k] ------------------ 375| 239| return false; 376| 3.81k| } 377| 1.97k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 2.21k| } else { 379| 1.33k| auto ss = p.shift() - B; 380| 2.23k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 1.19k, False: 1.03k] ------------------ 381| 1.19k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 301, False: 898] ------------------ 382| 301| return false; 383| 1.03k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 1.33k| } 385| 3.55k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 4.37k| { 1037| 4.37k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.37k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1793| 4.37k| { 1794| 4.37k| auto child = node_->inner()[offset]; 1795| 4.37k| auto child_size = size(offset); 1796| 4.37k| auto is_leaf = shift_ == BL; 1797| 4.37k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 4.37k] ------------------ 1798| 4.37k| : visit_maybe_relaxed_sub( 1799| 4.37k| child, shift_ - B, child_size, v, args...); 1800| 4.37k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 4.37k|{ 1839| 4.37k| assert(node); ------------------ | Branch (1839:5): [True: 4.37k, False: 0] ------------------ 1840| 4.37k| auto relaxed = node->relaxed(); 1841| 4.37k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.15k, False: 3.22k] ------------------ 1842| 1.15k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.15k, False: 0] ------------------ 1843| 1.15k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.15k| .visit(v, std::forward(args)...); 1845| 3.22k| } else { 1846| 3.22k| return make_regular_sub_pos(node, shift, size) 1847| 3.22k| .visit(v, std::forward(args)...); 1848| 3.22k| } 1849| 4.37k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1813| 1.15k| { 1814| 1.15k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.15k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcjT_DpOT0_: 1007| 9.28k| { 1008| 9.28k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 9.28k, False: 0] ------------------ 1009| 9.28k| auto is_leaf = shift_ == BL; 1010| 9.28k| auto child = node_->inner()[idx]; 1011| 9.28k| auto lsize = size(idx); 1012| 9.28k| auto is_full = idx + 1 < count(); 1013| 9.28k| return is_full ------------------ | Branch (1013:16): [True: 8.72k, False: 563] ------------------ 1014| 9.28k| ? (is_leaf ------------------ | Branch (1014:23): [True: 6.50k, False: 2.22k] ------------------ 1015| 8.72k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 8.72k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 9.28k| : (is_leaf ------------------ | Branch (1017:23): [True: 563, False: 0] ------------------ 1018| 563| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 563| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 0| .visit(v, args...)); 1021| 9.28k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 207| 11.7k| { 208| 11.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 11.7k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_13full_leaf_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1804| 11.7k| { 1805| 11.7k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 11.7k, False: 0] ------------------ 1806| 11.7k| auto child = node_->inner()[offset]; 1807| 11.7k| auto child_size = size(offset); 1808| 11.7k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 11.7k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_13full_leaf_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 144| 11.7k| { 145| 11.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 11.7k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1405| 3.06k| { 1406| 3.06k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.06k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcjT_DpOT0_: 1793| 3.06k| { 1794| 3.06k| auto child = node_->inner()[offset]; 1795| 3.06k| auto child_size = size(offset); 1796| 3.06k| auto is_leaf = shift_ == BL; 1797| 3.06k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 3.06k] ------------------ 1798| 3.06k| : visit_maybe_relaxed_sub( 1799| 3.06k| child, shift_ - B, child_size, v, args...); 1800| 3.06k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcPT_jmT0_DpOT1_: 1838| 3.06k|{ 1839| 3.06k| assert(node); ------------------ | Branch (1839:5): [True: 3.06k, False: 0] ------------------ 1840| 3.06k| auto relaxed = node->relaxed(); 1841| 3.06k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.55k, False: 1.50k] ------------------ 1842| 1.55k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.55k, False: 0] ------------------ 1843| 1.55k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.55k| .visit(v, std::forward(args)...); 1845| 1.55k| } else { 1846| 1.50k| return make_regular_sub_pos(node, shift, size) 1847| 1.50k| .visit(v, std::forward(args)...); 1848| 1.50k| } 1849| 3.06k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1813| 1.55k| { 1814| 1.55k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.55k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcjT_DpOT0_: 1386| 6.06k| { 1387| 6.06k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 6.06k, False: 0] ------------------ 1388| 6.06k| auto is_leaf = shift_ == BL; 1389| 6.06k| auto child = node_->inner()[idx]; 1390| 6.06k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 5.22k, False: 838] ------------------ 1391| 6.06k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 6.06k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERmEEEDcT_DpOT0_: 1036| 1.50k| { 1037| 1.50k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.50k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE7nth_subINS1_24for_each_chunk_p_visitorEJZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcjSK_DpOT0_: 1793| 65.6k| { 1794| 65.6k| auto child = node_->inner()[offset]; 1795| 65.6k| auto child_size = size(offset); 1796| 65.6k| auto is_leaf = shift_ == BL; 1797| 65.6k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 30.3k, False: 35.2k] ------------------ 1798| 65.6k| : visit_maybe_relaxed_sub( 1799| 35.2k| child, shift_ - B, child_size, v, args...); 1800| 65.6k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSI_T0_E_EEEDcPSI_jmSK_DpOT1_: 1838| 150k|{ 1839| 150k| assert(node); ------------------ | Branch (1839:5): [True: 150k, False: 0] ------------------ 1840| 150k| auto relaxed = node->relaxed(); 1841| 150k| if (relaxed) { ------------------ | Branch (1841:9): [True: 136k, False: 14.4k] ------------------ 1842| 136k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 136k, False: 0] ------------------ 1843| 136k| return make_relaxed_pos(node, shift, relaxed) 1844| 136k| .visit(v, std::forward(args)...); 1845| 136k| } else { 1846| 14.4k| return make_regular_sub_pos(node, shift, size) 1847| 14.4k| .visit(v, std::forward(args)...); 1848| 14.4k| } 1849| 150k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 1813| 136k| { 1814| 136k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 136k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 1482| 136k| { 1483| 136k| auto p = node_->inner(); 1484| 136k| auto s = size_t{}; 1485| 136k| auto n = count(); 1486| 136k| if (shift_ == BL) { ------------------ | Branch (1486:13): [True: 118k, False: 18.0k] ------------------ 1487| 980k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1487:39): [True: 864k, False: 116k] ------------------ 1488| 864k| IMMER_PREFETCH(p + i + 1); 1489| 864k| if (!make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) ------------------ | Branch (1489:21): [True: 1.83k, False: 862k] ------------------ 1490| 864k| .visit(v, args...)) 1491| 1.83k| return false; 1492| 862k| s = relaxed_->d.sizes[i]; 1493| 862k| } 1494| 118k| } else { 1495| 18.0k| auto ss = shift_ - B; 1496| 130k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1496:39): [True: 115k, False: 15.4k] ------------------ 1497| 115k| if (!visit_maybe_relaxed_sub( ------------------ | Branch (1497:21): [True: 2.66k, False: 112k] ------------------ 1498| 115k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...)) 1499| 2.66k| return false; 1500| 112k| s = relaxed_->d.sizes[i]; 1501| 112k| } 1502| 18.0k| } 1503| 131k| return true; 1504| 136k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcT_DpOT0_: 1036| 3.16k| { 1037| 3.16k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.16k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE15first_sub_innerINS1_14equals_visitor3rrbEJRNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERPSC_RjRmEEEDcT_DpOT0_: 1783| 1.24k| { 1784| 1.24k| assert(shift_ > BL); ------------------ | Branch (1784:9): [True: 1.24k, False: 0] ------------------ 1785| 1.24k| auto child = node_->inner()[0]; 1786| 1.24k| auto child_size = relaxed_->d.sizes[0]; 1787| 1.24k| return visit_maybe_relaxed_sub( 1788| 1.24k| child, shift_ - B, child_size, v, args...); 1789| 1.24k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitor3rrbEJRNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERPSC_RjRmEEEDcPT_jmT0_DpOT1_: 1838| 1.24k|{ 1839| 1.24k| assert(node); ------------------ | Branch (1839:5): [True: 1.24k, False: 0] ------------------ 1840| 1.24k| auto relaxed = node->relaxed(); 1841| 1.24k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.24k, False: 0] ------------------ 1842| 1.24k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.24k, False: 0] ------------------ 1843| 1.24k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.24k| .visit(v, std::forward(args)...); 1845| 1.24k| } else { 1846| 0| return make_regular_sub_pos(node, shift, size) 1847| 0| .visit(v, std::forward(args)...); 1848| 0| } 1849| 1.24k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor3rrbEJRNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERPSC_RjRmEEEDcT_DpOT0_: 1813| 1.24k| { 1814| 1.24k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.24k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcPT_jmT0_DpOT1_: 1838| 8.31k|{ 1839| 8.31k| assert(node); ------------------ | Branch (1839:5): [True: 8.31k, False: 0] ------------------ 1840| 8.31k| auto relaxed = node->relaxed(); 1841| 8.31k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.65k, False: 5.65k] ------------------ 1842| 2.65k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.65k, False: 0] ------------------ 1843| 2.65k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.65k| .visit(v, std::forward(args)...); 1845| 5.65k| } else { 1846| 5.65k| return make_regular_sub_pos(node, shift, size) 1847| 5.65k| .visit(v, std::forward(args)...); 1848| 5.65k| } 1849| 8.31k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcT_DpOT0_: 1813| 2.65k| { 1814| 2.65k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.65k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEEmEEEDcT_DpOT0_: 1036| 5.65k| { 1037| 5.65k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.65k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitor3rrbEJNS1_16rrbtree_iteratorIiSB_Lj3ELj3EEERKPSC_RKjRmEEEDcT_DpOT0_: 1036| 8.31k| { 1037| 8.31k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.31k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEE5visitINS1_14equals_visitorEJRKPSC_EEEDcT_DpOT0_: 144| 6.92k| { 145| 6.92k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 6.92k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2Ev: 114| 1.31M| : size{0} 115| 1.31M| , shift{BL} 116| 1.31M| , root{empty_root()} 117| 1.31M| , tail{empty_tail()} 118| 1.31M| { 119| | assert(check_tree()); ------------------ | Branch (119:9): [True: 1.31M, False: 0] ------------------ 120| 1.31M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10empty_rootEv: 61| 1.33M| { 62| 1.33M| static const auto empty_ = [] { 63| 1.33M| constexpr auto size = node_t::sizeof_inner_n(0); 64| 1.33M| static std::aligned_storage_t 65| 1.33M| storage; 66| 1.33M| return node_t::make_inner_n_into(&storage, size, 0u); 67| 1.33M| }(); 68| 1.33M| return empty_->inc(); 69| 1.33M| } _ZZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10empty_rootEvENKUlvE_clEv: 62| 1| static const auto empty_ = [] { 63| 1| constexpr auto size = node_t::sizeof_inner_n(0); 64| 1| static std::aligned_storage_t 65| 1| storage; 66| 1| return node_t::make_inner_n_into(&storage, size, 0u); 67| 1| }(); _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10empty_tailEv: 72| 1.31M| { 73| 1.31M| static const auto empty_ = [] { 74| 1.31M| constexpr auto size = node_t::sizeof_leaf_n(0); 75| 1.31M| static std::aligned_storage_t 76| 1.31M| storage; 77| 1.31M| return node_t::make_leaf_n_into(&storage, size, 0u); 78| 1.31M| }(); 79| 1.31M| return empty_->inc(); 80| 1.31M| } _ZZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10empty_tailEvENKUlvE_clEv: 73| 1| static const auto empty_ = [] { 74| 1| constexpr auto size = node_t::sizeof_leaf_n(0); 75| 1| static std::aligned_storage_t 76| 1| storage; 77| 1| return node_t::make_leaf_n_into(&storage, size, 0u); 78| 1| }(); _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10check_treeEv: 1372| 3.29M| { 1373| 3.29M| IMMER_INVALID_STATE_ASSERT(shift <= sizeof(size_t) * 8 - BL); ------------------ | | 32| 3.29M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.29M] | | ------------------ | | 33| 3.29M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1374| 3.29M| IMMER_INVALID_STATE_ASSERT(shift >= BL); ------------------ | | 32| 3.29M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.29M] | | ------------------ | | 33| 3.29M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1375| 3.29M| IMMER_INVALID_STATE_ASSERT(tail_offset() <= size); ------------------ | | 32| 3.29M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.29M] | | ------------------ | | 33| 3.29M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1376| 3.29M| IMMER_INVALID_STATE_ASSERT(tail_size() <= branches); ------------------ | | 32| 3.29M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.29M] | | ------------------ | | 33| 3.29M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1377| |#if IMMER_DEBUG_DEEP_CHECK 1378| | IMMER_INVALID_STATE_ASSERT(check_root()); 1379| | IMMER_INVALID_STATE_ASSERT(check_tail()); 1380| |#endif 1381| 3.29M| return true; 1382| 3.29M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11tail_offsetEv: 197| 17.9M| { 198| 17.9M| auto r = root->relaxed(); 199| 17.9M| assert(r == nullptr || r->d.count); ------------------ | Branch (199:9): [True: 7.23M, False: 10.7M] | Branch (199:9): [True: 10.7M, False: 0] | Branch (199:9): [True: 17.9M, False: 0] ------------------ 200| 17.9M| return r ? r->d.sizes[r->d.count - 1] ------------------ | Branch (200:16): [True: 10.7M, False: 7.23M] ------------------ 201| 17.9M| : size ? (size - 1) & ~mask ------------------ | Branch (201:18): [True: 3.24M, False: 3.98M] ------------------ 202| | /* otherwise */ 203| 7.23M| : 0; 204| 17.9M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9tail_sizeEv: 194| 3.67M| auto tail_size() const { return size - tail_offset(); } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EED2Ev: 184| 3.29M| ~rrbtree() { dec(); } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3decEv: 192| 3.29M| void dec() const { traverse(dec_visitor()); } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8traverseINS1_11dec_visitorEJEEEvT_DpOT0_: 208| 3.29M| { 209| 3.29M| auto tail_off = tail_offset(); 210| 3.29M| auto tail_size = size - tail_off; 211| | 212| 3.29M| if (tail_off) ------------------ | Branch (212:13): [True: 1.83M, False: 1.46M] ------------------ 213| 1.83M| visit_maybe_relaxed_sub(root, shift, tail_off, v, args...); 214| 1.46M| else 215| 1.46M| make_empty_regular_pos(root).visit(v, args...); 216| | 217| 3.29M| if (tail_size) ------------------ | Branch (217:13): [True: 1.97M, False: 1.32M] ------------------ 218| 1.97M| make_leaf_sub_pos(tail, tail_size).visit(v, args...); 219| 1.32M| else 220| 1.32M| make_empty_leaf_pos(tail).visit(v, args...); 221| 3.29M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_backEi: 500| 324k| { 501| 324k| auto ts = tail_size(); 502| 324k| if (ts < branches) { ------------------ | Branch (502:13): [True: 274k, False: 50.2k] ------------------ 503| 274k| auto new_tail = 504| 274k| node_t::copy_leaf_emplace(tail, ts, std::move(value)); 505| 274k| return {size + 1, shift, root->inc(), new_tail}; 506| 274k| } else { 507| 50.2k| using std::get; 508| 50.2k| auto new_tail = node_t::make_leaf_n(1u, std::move(value)); 509| 50.2k| auto tail_off = tail_offset(); 510| 50.2k| IMMER_TRY { ------------------ | | 49| 50.2k|#define IMMER_TRY try ------------------ 511| 50.2k| auto new_root = 512| 50.2k| push_tail(root, shift, tail_off, tail, size - tail_off); 513| 50.2k| tail->inc(); 514| 50.2k| return {size + 1, get<0>(new_root), get<1>(new_root), new_tail}; 515| 50.2k| } 516| 50.2k| IMMER_CATCH (...) { 517| 0| node_t::delete_leaf(new_tail, 1u); 518| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 519| 0| } 520| 50.2k| } 521| 324k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2EmjPNS1_4nodeIiSA_Lj3ELj3EEESE_: 127| 1.97M| : size{sz} 128| 1.97M| , shift{sh} 129| 1.97M| , root{r} 130| 1.97M| , tail{t} 131| 1.97M| { 132| 1.97M|#if IMMER_THROW_ON_INVALID_STATE 133| | // assert only happens in the Debug build, but when 134| | // IMMER_THROW_ON_INVALID_STATE is activated, we want to just check_tree 135| | // even in Release. 136| 1.97M| try { 137| 1.97M| check_tree(); 138| 1.97M| } catch (...) { 139| | // This not fully constructed rrbtree owns the nodes already, have 140| | // to dec them. 141| 0| if (r && t) ------------------ | Branch (141:17): [True: 0, False: 0] | Branch (141:22): [True: 0, False: 0] ------------------ 142| 0| dec(); 143| 0| throw; 144| 0| } 145| |#else 146| | assert(check_tree()); 147| |#endif 148| 1.97M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_tailEPNS1_4nodeIiSA_Lj3ELj3EEEjmSE_j: 369| 363k| { 370| 363k| if (auto r = root->relaxed()) { ------------------ | Branch (370:18): [True: 60.5k, False: 302k] ------------------ 371| 60.5k| auto new_root = 372| 60.5k| make_relaxed_pos(root, shift, r) 373| 60.5k| .visit(push_tail_visitor{}, tail, tail_size); 374| 60.5k| if (new_root) ------------------ | Branch (374:17): [True: 58.5k, False: 1.92k] ------------------ 375| 58.5k| return std::make_tuple(shift, new_root); 376| 1.92k| else { 377| 1.92k| auto new_root = node_t::make_inner_r_n(2); 378| 1.92k| IMMER_TRY { ------------------ | | 49| 1.92k|#define IMMER_TRY try ------------------ 379| 1.92k| auto new_path = node_t::make_path(shift, tail); 380| 1.92k| new_root->inner()[0] = root->inc(); 381| 1.92k| new_root->inner()[1] = new_path; 382| 1.92k| new_root->relaxed()->d.sizes[0] = size; 383| 1.92k| new_root->relaxed()->d.sizes[1] = size + tail_size; 384| 1.92k| assert(size); ------------------ | Branch (384:21): [True: 1.92k, False: 0] ------------------ 385| 1.92k| assert(tail_size); ------------------ | Branch (385:21): [True: 1.92k, False: 0] ------------------ 386| 1.92k| new_root->relaxed()->d.count = 2u; 387| 1.92k| } 388| 1.92k| IMMER_CATCH (...) { 389| 0| node_t::delete_inner_r(new_root, 2); 390| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 391| 0| } 392| 1.92k| return std::make_tuple(shift + B, new_root); 393| 1.92k| } 394| 302k| } else if (size == size_t{branches} << shift) { ------------------ | Branch (394:20): [True: 3.64k, False: 299k] ------------------ 395| 3.64k| auto new_root = node_t::make_inner_n(2); 396| 3.64k| IMMER_TRY { ------------------ | | 49| 3.64k|#define IMMER_TRY try ------------------ 397| 3.64k| auto new_path = node_t::make_path(shift, tail); 398| 3.64k| new_root->inner()[0] = root->inc(); 399| 3.64k| new_root->inner()[1] = new_path; 400| 3.64k| } 401| 3.64k| IMMER_CATCH (...) { 402| 0| node_t::delete_inner(new_root, 2); 403| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 404| 0| } 405| 3.64k| return std::make_tuple(shift + B, new_root); 406| 299k| } else if (size) { ------------------ | Branch (406:20): [True: 286k, False: 13.0k] ------------------ 407| 286k| auto new_root = make_regular_sub_pos(root, shift, size) 408| 286k| .visit(push_tail_visitor{}, tail); 409| 286k| return std::make_tuple(shift, new_root); 410| 286k| } else { 411| 13.0k| return std::make_tuple(shift, node_t::make_path(shift, tail)); 412| 13.0k| } 413| 363k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2EOSB_: 157| 1.22M| : rrbtree{} 158| 1.22M| { 159| 1.22M| swap(*this, other); 160| 1.22M| } _ZN5immer6detail4rbts4swapERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEESC_: 176| 4.45M| { 177| 4.45M| using std::swap; 178| 4.45M| swap(x.size, y.size); 179| 4.45M| swap(x.shift, y.shift); 180| 4.45M| swap(x.root, y.root); 181| 4.45M| swap(x.tail, y.tail); 182| 4.45M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEaSEOSB_: 170| 3.22M| { 171| 3.22M| swap(*this, other); 172| 3.22M| return *this; 173| 3.22M| } flex-vector-bo.cpp:_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6updateIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSG_E_EESB_mOSG_: 580| 169k| { 581| 169k| auto tail_off = tail_offset(); 582| 169k| if (idx >= tail_off) { ------------------ | Branch (582:13): [True: 70.3k, False: 99.0k] ------------------ 583| 70.3k| auto tail_size = size - tail_off; 584| 70.3k| auto new_tail = 585| 70.3k| make_leaf_sub_pos(tail, tail_size) 586| 70.3k| .visit(update_visitor{}, idx - tail_off, fn); 587| 70.3k| return {size, shift, root->inc(), new_tail}; 588| 99.0k| } else { 589| 99.0k| auto new_root = visit_maybe_relaxed_sub( 590| 99.0k| root, shift, tail_off, update_visitor{}, idx, fn); 591| 99.0k| return {size, shift, new_root, tail->inc()}; 592| 99.0k| } 593| 169k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4takeEm: 647| 24.6k| { 648| 24.6k| auto tail_off = tail_offset(); 649| 24.6k| if (new_size == 0) { ------------------ | Branch (649:13): [True: 4.08k, False: 20.6k] ------------------ 650| 4.08k| return {}; 651| 20.6k| } else if (new_size >= size) { ------------------ | Branch (651:20): [True: 1.43k, False: 19.1k] ------------------ 652| 1.43k| return *this; 653| 19.1k| } else if (new_size > tail_off) { ------------------ | Branch (653:20): [True: 1.19k, False: 17.9k] ------------------ 654| 1.19k| auto new_tail = node_t::copy_leaf(tail, new_size - tail_off); 655| 1.19k| return {new_size, shift, root->inc(), new_tail}; 656| 17.9k| } else { 657| 17.9k| using std::get; 658| 17.9k| auto l = new_size - 1; 659| 17.9k| auto v = slice_right_visitor(); 660| 17.9k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l); 661| 17.9k| auto new_shift = get<0>(r); 662| 17.9k| auto new_root = get<1>(r); 663| 17.9k| auto new_tail = get<3>(r); 664| 17.9k| if (new_root) { ------------------ | Branch (664:17): [True: 13.6k, False: 4.28k] ------------------ 665| 13.6k| IMMER_ASSERT_TAGGED(new_root->compute_shift() == get<0>(r)); ------------------ | | 68| 13.6k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (665:17): [True: 13.6k, False: 0] ------------------ 666| 13.6k| assert(new_root->check(new_shift, new_size - get<2>(r))); ------------------ | Branch (666:17): [True: 13.6k, False: 0] ------------------ 667| 13.6k| return {new_size, new_shift, new_root, new_tail}; 668| 13.6k| } else { 669| 4.28k| return {new_size, BL, empty_root(), new_tail}; 670| 4.28k| } 671| 17.9k| } 672| 24.6k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2ERKSB_: 151| 10.2k| : rrbtree{other.size, other.shift, other.root, other.tail} 152| 10.2k| { 153| 10.2k| inc(); 154| 10.2k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE3incEv: 187| 10.2k| { 188| 10.2k| root->inc(); 189| 10.2k| tail->inc(); 190| 10.2k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4dropEm: 711| 35.9k| { 712| 35.9k| if (elems == 0) { ------------------ | Branch (712:13): [True: 2.55k, False: 33.4k] ------------------ 713| 2.55k| return *this; 714| 33.4k| } else if (elems >= size) { ------------------ | Branch (714:20): [True: 2.20k, False: 31.2k] ------------------ 715| 2.20k| return {}; 716| 31.2k| } else if (elems == tail_offset()) { ------------------ | Branch (716:20): [True: 1.84k, False: 29.3k] ------------------ 717| 1.84k| return {size - elems, BL, empty_root(), tail->inc()}; 718| 29.3k| } else if (elems > tail_offset()) { ------------------ | Branch (718:20): [True: 1.28k, False: 28.1k] ------------------ 719| 1.28k| auto tail_off = tail_offset(); 720| 1.28k| auto new_tail = 721| 1.28k| node_t::copy_leaf(tail, elems - tail_off, size - tail_off); 722| 1.28k| return {size - elems, BL, empty_root(), new_tail}; 723| 28.1k| } else { 724| 28.1k| using std::get; 725| 28.1k| auto v = slice_left_visitor(); 726| 28.1k| auto r = 727| 28.1k| visit_maybe_relaxed_sub(root, shift, tail_offset(), v, elems); 728| 28.1k| auto new_root = get<1>(r); 729| 28.1k| auto new_shift = get<0>(r); 730| 28.1k| return {size - elems, new_shift, new_root, tail->inc()}; 731| 28.1k| } 732| 35.9k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8max_sizeEv: 54| 2.44M| { 55| 2.44M| auto S = sizeof(size_t) * 8; 56| 2.44M| return ((size_t{1} << BL) - std::min(size_t{BL}, size_t{2})) * 57| 2.44M| ipow((size_t{1} << B) - 2, (S - BL) / B); 58| 2.44M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6concatERKSB_: 735| 643k| { 736| 643k| assert(r.size + size <= max_size()); ------------------ | Branch (736:9): [True: 643k, False: 0] ------------------ 737| 643k| using std::get; 738| 643k| if (size == 0) ------------------ | Branch (738:13): [True: 1.45k, False: 642k] ------------------ 739| 1.45k| return r; 740| 642k| else if (r.size == 0) ------------------ | Branch (740:18): [True: 1.23k, False: 640k] ------------------ 741| 1.23k| return *this; 742| 640k| else if (r.tail_offset() == 0) { ------------------ | Branch (742:18): [True: 330k, False: 309k] ------------------ 743| | // just concat the tail, similar to push_back 744| 330k| auto tail_offst = tail_offset(); 745| 330k| auto tail_size = size - tail_offst; 746| 330k| if (tail_size == branches) { ------------------ | Branch (746:17): [True: 64.6k, False: 266k] ------------------ 747| 64.6k| auto new_root = 748| 64.6k| push_tail(root, shift, tail_offst, tail, tail_size); 749| 64.6k| tail->inc(); 750| 64.6k| return {size + r.size, 751| 64.6k| get<0>(new_root), 752| 64.6k| get<1>(new_root), 753| 64.6k| r.tail->inc()}; 754| 266k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (754:24): [True: 18.6k, False: 247k] ------------------ 755| 18.6k| auto new_tail = 756| 18.6k| node_t::copy_leaf(tail, tail_size, r.tail, r.size); 757| 18.6k| return {size + r.size, shift, root->inc(), new_tail}; 758| 247k| } else { 759| 247k| auto remaining = branches - tail_size; 760| 247k| auto add_tail = 761| 247k| node_t::copy_leaf(tail, tail_size, r.tail, remaining); 762| 247k| IMMER_TRY { ------------------ | | 49| 247k|#define IMMER_TRY try ------------------ 763| 247k| auto new_tail = 764| 247k| node_t::copy_leaf(r.tail, remaining, r.size); 765| 247k| IMMER_TRY { ------------------ | | 49| 247k|#define IMMER_TRY try ------------------ 766| 247k| auto new_root = push_tail( 767| 247k| root, shift, tail_offst, add_tail, branches); 768| 247k| return {size + r.size, 769| 247k| get<0>(new_root), 770| 247k| get<1>(new_root), 771| 247k| new_tail}; 772| 247k| } 773| 247k| IMMER_CATCH (...) { 774| 0| node_t::delete_leaf(new_tail, r.size - remaining); 775| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 776| 0| } 777| 247k| } 778| 247k| IMMER_CATCH (...) { 779| 0| node_t::delete_leaf(add_tail, branches); 780| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 781| 0| } 782| 247k| } 783| 330k| } else if (tail_offset() == 0) { ------------------ | Branch (783:20): [True: 2.65k, False: 307k] ------------------ 784| 2.65k| auto tail_offst = tail_offset(); 785| 2.65k| auto tail_size = size - tail_offst; 786| 2.65k| auto concated = 787| 2.65k| concat_trees(tail, tail_size, r.root, r.shift, r.tail_offset()); 788| 2.65k| auto new_shift = concated.shift(); 789| 2.65k| auto new_root = concated.node(); 790| 2.65k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 2.65k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (790:13): [True: 2.65k, False: 0] ------------------ 791| 2.65k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (791:13): [True: 2.65k, False: 0] ------------------ 792| 2.65k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 793| 307k| } else { 794| 307k| auto tail_offst = tail_offset(); 795| 307k| auto tail_size = size - tail_offst; 796| 307k| auto concated = concat_trees(root, 797| 307k| shift, 798| 307k| tail_offst, 799| 307k| tail, 800| 307k| tail_size, 801| 307k| r.root, 802| 307k| r.shift, 803| 307k| r.tail_offset()); 804| 307k| auto new_shift = concated.shift(); 805| 307k| auto new_root = concated.node(); 806| 307k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 307k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (806:13): [True: 307k, False: 0] ------------------ 807| 307k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (807:13): [True: 307k, False: 0] ------------------ 808| 307k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 809| 307k| } 810| 643k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13push_back_mutENS9_5applyIS6_E4type4editEi: 478| 40.0k| { 479| 40.0k| auto ts = tail_size(); 480| 40.0k| if (ts < branches) { ------------------ | Branch (480:13): [True: 30.1k, False: 9.90k] ------------------ 481| 30.1k| ensure_mutable_tail(e, ts); 482| 30.1k| new (&tail->leaf()[ts]) T(std::move(value)); 483| 30.1k| } else { 484| 9.90k| using std::get; 485| 9.90k| auto new_tail = node_t::make_leaf_e(e, std::move(value)); 486| 9.90k| auto tail_off = tail_offset(); 487| 9.90k| IMMER_TRY { ------------------ | | 49| 9.90k|#define IMMER_TRY try ------------------ 488| 9.90k| push_tail_mut(e, tail_off, tail, ts); 489| 9.90k| tail = new_tail; 490| 9.90k| } 491| 9.90k| IMMER_CATCH (...) { 492| 0| node_t::delete_leaf(new_tail, 1u); 493| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 494| 0| } 495| 9.90k| } 496| 40.0k| ++size; 497| 40.0k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE19ensure_mutable_tailENS9_5applyIS6_E4type4editEj: 469| 338k| { 470| 338k| if (!tail->can_mutate(e)) { ------------------ | Branch (470:13): [True: 10.0k, False: 328k] ------------------ 471| 10.0k| auto new_tail = node_t::copy_leaf_e(e, tail, n); 472| 10.0k| dec_leaf(tail, n); 473| 10.0k| tail = new_tail; 474| 10.0k| } 475| 338k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE13push_tail_mutENS9_5applyIS6_E4type4editEmPNS1_4nodeIiSA_Lj3ELj3EEEj: 417| 349k| { 418| 349k| if (auto r = root->relaxed()) { ------------------ | Branch (418:18): [True: 162k, False: 187k] ------------------ 419| 162k| auto new_root = 420| 162k| make_relaxed_pos(root, shift, r) 421| 162k| .visit(push_tail_mut_visitor{}, e, tail, tail_size); 422| 162k| if (new_root) { ------------------ | Branch (422:17): [True: 162k, False: 726] ------------------ 423| 162k| root = new_root; 424| 162k| } else { 425| 726| auto new_root = node_t::make_inner_r_e(e); 426| 726| IMMER_TRY { ------------------ | | 49| 726|#define IMMER_TRY try ------------------ 427| 726| auto new_path = node_t::make_path_e(e, shift, tail); 428| 726| new_root->inner()[0] = root; 429| 726| new_root->inner()[1] = new_path; 430| 726| new_root->relaxed()->d.sizes[0] = tail_off; 431| 726| new_root->relaxed()->d.sizes[1] = tail_off + tail_size; 432| 726| assert(tail_off); ------------------ | Branch (432:21): [True: 726, False: 0] ------------------ 433| 726| assert(tail_size); ------------------ | Branch (433:21): [True: 726, False: 0] ------------------ 434| 726| new_root->relaxed()->d.count = 2u; 435| 726| root = new_root; 436| 726| shift += B; 437| 726| } 438| 726| IMMER_CATCH (...) { 439| 0| node_t::delete_inner_r_e(new_root); 440| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 441| 0| } 442| 726| } 443| 187k| } else if (tail_off == size_t{branches} << shift) { ------------------ | Branch (443:20): [True: 1.92k, False: 185k] ------------------ 444| 1.92k| auto new_root = node_t::make_inner_e(e); 445| 1.92k| IMMER_TRY { ------------------ | | 49| 1.92k|#define IMMER_TRY try ------------------ 446| 1.92k| auto new_path = node_t::make_path_e(e, shift, tail); 447| 1.92k| new_root->inner()[0] = root; 448| 1.92k| new_root->inner()[1] = new_path; 449| 1.92k| root = new_root; 450| 1.92k| shift += B; 451| 1.92k| } 452| 1.92k| IMMER_CATCH (...) { 453| 0| node_t::delete_inner_e(new_root); 454| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 455| 0| } 456| 185k| } else if (tail_off) { ------------------ | Branch (456:20): [True: 182k, False: 2.16k] ------------------ 457| 182k| auto new_root = 458| 182k| make_regular_sub_pos(root, shift, tail_off) 459| 182k| .visit(push_tail_mut_visitor{}, e, tail); 460| 182k| root = new_root; 461| 182k| } else { 462| 2.16k| auto new_root = node_t::make_path_e(e, shift, tail); 463| 2.16k| dec_empty_regular(root); 464| 2.16k| root = new_root; 465| 2.16k| } 466| 349k| } flex-vector-bo.cpp:_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10update_mutIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSG_E0_EEvNS9_5applyIS6_E4type4editEmOSG_: 573| 30.8k| { 574| 30.8k| auto& elem = get_mut(e, idx); 575| 30.8k| elem = std::forward(fn)(std::move(elem)); 576| 30.8k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7get_mutENS9_5applyIS6_E4type4editEm: 539| 30.8k| { 540| 30.8k| auto tail_off = tail_offset(); 541| 30.8k| if (idx >= tail_off) { ------------------ | Branch (541:13): [True: 11.3k, False: 19.5k] ------------------ 542| 11.3k| ensure_mutable_tail(e, size - tail_off); 543| 11.3k| return tail->leaf()[(idx - tail_off) & mask]; 544| 19.5k| } else { 545| 19.5k| return visit_maybe_relaxed_sub(root, 546| 19.5k| shift, 547| 19.5k| tail_off, 548| 19.5k| get_mut_visitor{}, 549| 19.5k| idx, 550| 19.5k| e, 551| 19.5k| &root); 552| 19.5k| } 553| 30.8k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8take_mutENS9_5applyIS6_E4type4editEm: 606| 31.6k| { 607| 31.6k| auto tail_off = tail_offset(); 608| 31.6k| if (new_size == 0) { ------------------ | Branch (608:13): [True: 728, False: 30.8k] ------------------ 609| 728| *this = {}; 610| 30.8k| } else if (new_size >= size) { ------------------ | Branch (610:20): [True: 447, False: 30.4k] ------------------ 611| 447| return; 612| 30.4k| } else if (new_size > tail_off) { ------------------ | Branch (612:20): [True: 593, False: 29.8k] ------------------ 613| 593| auto ts = size - tail_off; 614| 593| auto newts = new_size - tail_off; 615| 593| if (tail->can_mutate(e)) { ------------------ | Branch (615:17): [True: 328, False: 265] ------------------ 616| 328| detail::destroy_n(tail->leaf() + newts, ts - newts); 617| 328| } else { 618| 265| auto new_tail = node_t::copy_leaf_e(e, tail, newts); 619| 265| dec_leaf(tail, ts); 620| 265| tail = new_tail; 621| 265| } 622| 593| size = new_size; 623| 593| return; 624| 29.8k| } else { 625| 29.8k| using std::get; 626| 29.8k| auto l = new_size - 1; 627| 29.8k| auto v = slice_right_mut_visitor(); 628| 29.8k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l, e); 629| 29.8k| auto new_shift = get<0>(r); 630| 29.8k| auto new_root = get<1>(r); 631| 29.8k| auto new_tail = get<3>(r); 632| 29.8k| if (new_root) { ------------------ | Branch (632:17): [True: 23.0k, False: 6.81k] ------------------ 633| 23.0k| root = new_root; 634| 23.0k| shift = new_shift; 635| 23.0k| } else { 636| 6.81k| root = empty_root(); 637| 6.81k| shift = BL; 638| 6.81k| } 639| 29.8k| dec_leaf(tail, size - tail_off); 640| 29.8k| size = new_size; 641| 29.8k| tail = new_tail; 642| 29.8k| return; 643| 29.8k| } 644| 31.6k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8drop_mutENS9_5applyIS6_E4type4editEm: 675| 57.0k| { 676| 57.0k| using std::get; 677| 57.0k| auto tail_off = tail_offset(); 678| 57.0k| if (elems == 0) { ------------------ | Branch (678:13): [True: 5.52k, False: 51.5k] ------------------ 679| 5.52k| return; 680| 51.5k| } else if (elems >= size) { ------------------ | Branch (680:20): [True: 256, False: 51.3k] ------------------ 681| 256| *this = {}; 682| 51.3k| } else if (elems == tail_off) { ------------------ | Branch (682:20): [True: 215, False: 51.1k] ------------------ 683| 215| dec_inner(root, shift, tail_off); 684| 215| shift = BL; 685| 215| root = empty_root(); 686| 215| size -= elems; 687| 215| return; 688| 51.1k| } else if (elems > tail_off) { ------------------ | Branch (688:20): [True: 855, False: 50.2k] ------------------ 689| 855| auto v = slice_left_mut_visitor(); 690| 855| tail = get<1>(make_leaf_sub_pos(tail, size - tail_off) 691| 855| .visit(v, elems - tail_off, e)); 692| 855| if (tail_off) { ------------------ | Branch (692:17): [True: 226, False: 629] ------------------ 693| 226| dec_inner(root, shift, tail_off); 694| 226| shift = BL; 695| 226| root = empty_root(); 696| 226| } 697| 855| size -= elems; 698| 855| return; 699| 50.2k| } else { 700| 50.2k| auto v = slice_left_mut_visitor(); 701| 50.2k| auto r = 702| 50.2k| visit_maybe_relaxed_sub(root, shift, tail_off, v, elems, e); 703| 50.2k| shift = get<0>(r); 704| 50.2k| root = get<1>(r); 705| 50.2k| size -= elems; 706| 50.2k| return; 707| 50.2k| } 708| 57.0k| } _ZN5immer6detail4rbts12concat_mut_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS9_5applyIS6_E4type4editERKSB_: 816| 209k| { 817| 209k| assert(&l != &r); ------------------ | Branch (817:9): [True: 209k, False: 0] ------------------ 818| 209k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (818:9): [True: 209k, False: 0] ------------------ 819| 209k| using std::get; 820| 209k| if (l.size == 0) ------------------ | Branch (820:13): [True: 639, False: 209k] ------------------ 821| 639| l = r; 822| 209k| else if (r.size == 0) ------------------ | Branch (822:18): [True: 695, False: 208k] ------------------ 823| 695| return; 824| 208k| else if (r.tail_offset() == 0) { ------------------ | Branch (824:18): [True: 65.6k, False: 142k] ------------------ 825| | // just concat the tail, similar to push_back 826| 65.6k| auto tail_offst = l.tail_offset(); 827| 65.6k| auto tail_size = l.size - tail_offst; 828| 65.6k| if (tail_size == branches) { ------------------ | Branch (828:17): [True: 10.3k, False: 55.3k] ------------------ 829| 10.3k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 830| 10.3k| l.tail = r.tail->inc(); 831| 10.3k| l.size += r.size; 832| 10.3k| return; 833| 55.3k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (833:24): [True: 605, False: 54.7k] ------------------ 834| 605| l.ensure_mutable_tail(el, tail_size); 835| 605| detail::uninitialized_copy(r.tail->leaf(), 836| 605| r.tail->leaf() + r.size, 837| 605| l.tail->leaf() + tail_size); 838| 605| l.size += r.size; 839| 605| return; 840| 54.7k| } else { 841| 54.7k| auto remaining = branches - tail_size; 842| 54.7k| l.ensure_mutable_tail(el, tail_size); 843| 54.7k| detail::uninitialized_copy(r.tail->leaf(), 844| 54.7k| r.tail->leaf() + remaining, 845| 54.7k| l.tail->leaf() + tail_size); 846| 54.7k| IMMER_TRY { ------------------ | | 49| 54.7k|#define IMMER_TRY try ------------------ 847| 54.7k| auto new_tail = 848| 54.7k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 849| 54.7k| IMMER_TRY { ------------------ | | 49| 54.7k|#define IMMER_TRY try ------------------ 850| 54.7k| l.push_tail_mut(el, tail_offst, l.tail, branches); 851| 54.7k| l.tail = new_tail; 852| 54.7k| l.size += r.size; 853| 54.7k| return; 854| 54.7k| } 855| 54.7k| IMMER_CATCH (...) { 856| 0| node_t::delete_leaf(new_tail, r.size - remaining); 857| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 858| 0| } 859| 54.7k| } 860| 54.7k| IMMER_CATCH (...) { 861| 0| detail::destroy_n(r.tail->leaf() + tail_size, remaining); 862| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 863| 0| } 864| 54.7k| } 865| 142k| } else if (l.tail_offset() == 0) { ------------------ | Branch (865:20): [True: 433, False: 142k] ------------------ 866| 433| if (supports_transient_concat) { ------------------ | Branch (866:17): [Folded, False: 433] ------------------ 867| 0| auto tail_offst = l.tail_offset(); 868| 0| auto tail_size = l.size - tail_offst; 869| 0| auto concated = 870| 0| concat_trees_mut(el, 871| 0| el, 872| 0| l.tail, 873| 0| tail_size, 874| 0| MemoryPolicy::transience_t::noone, 875| 0| r.root, 876| 0| r.shift, 877| 0| r.tail_offset()); 878| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 68| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (878:17): [True: 0, False: 0] ------------------ 879| 0| concated.node()->compute_shift()); 880| 0| l.size += r.size; 881| 0| l.shift = concated.shift(); 882| 0| l.root = concated.node(); 883| 0| l.tail = r.tail; 884| 0| assert(l.check_tree()); ------------------ | Branch (884:17): [True: 0, False: 0] ------------------ 885| 433| } else { 886| 433| auto tail_offst = l.tail_offset(); 887| 433| auto tail_size = l.size - tail_offst; 888| 433| auto concated = concat_trees( 889| 433| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 890| 433| l = {l.size + r.size, 891| 433| concated.shift(), 892| 433| concated.node(), 893| 433| r.tail->inc()}; 894| 433| assert(l.check_tree()); ------------------ | Branch (894:17): [True: 433, False: 0] ------------------ 895| 433| return; 896| 433| } 897| 142k| } else { 898| 142k| if (supports_transient_concat) { ------------------ | Branch (898:17): [Folded, False: 142k] ------------------ 899| 0| auto tail_offst = l.tail_offset(); 900| 0| auto tail_size = l.size - tail_offst; 901| 0| assert(l.check_tree()); ------------------ | Branch (901:17): [True: 0, False: 0] ------------------ 902| 0| assert(r.check_tree()); ------------------ | Branch (902:17): [True: 0, False: 0] ------------------ 903| 0| auto concated = 904| 0| concat_trees_mut(el, 905| 0| el, 906| 0| l.root, 907| 0| l.shift, 908| 0| tail_offst, 909| 0| l.tail, 910| 0| tail_size, 911| 0| MemoryPolicy::transience_t::noone, 912| 0| r.root, 913| 0| r.shift, 914| 0| r.tail_offset()); 915| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 68| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (915:17): [True: 0, False: 0] ------------------ 916| 0| concated.node()->compute_shift()); 917| 0| l.size += r.size; 918| 0| l.shift = concated.shift(); 919| 0| l.root = concated.node(); 920| 0| l.tail = r.tail; 921| 0| assert(l.check_tree()); ------------------ | Branch (921:17): [True: 0, False: 0] ------------------ 922| 142k| } else { 923| 142k| auto tail_offst = l.tail_offset(); 924| 142k| auto tail_size = l.size - tail_offst; 925| 142k| auto concated = concat_trees(l.root, 926| 142k| l.shift, 927| 142k| tail_offst, 928| 142k| l.tail, 929| 142k| tail_size, 930| 142k| r.root, 931| 142k| r.shift, 932| 142k| r.tail_offset()); 933| 142k| l = {l.size + r.size, 934| 142k| concated.shift(), 935| 142k| concated.node(), 936| 142k| r.tail->inc()}; 937| 142k| } 938| 142k| } 939| 209k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEaSERKSB_: 163| 3.53k| { 164| 3.53k| auto next{other}; 165| 3.53k| swap(*this, next); 166| 3.53k| return *this; 167| 3.53k| } _ZN5immer6detail4rbts12concat_mut_rERKNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERSB_NS9_5applyIS6_E4type4editE: 942| 3.98k| { 943| 3.98k| assert(&l != &r); ------------------ | Branch (943:9): [True: 3.98k, False: 0] ------------------ 944| 3.98k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (944:9): [True: 3.98k, False: 0] ------------------ 945| 3.98k| using std::get; 946| 3.98k| if (r.size == 0) ------------------ | Branch (946:13): [True: 246, False: 3.73k] ------------------ 947| 246| r = std::move(l); 948| 3.73k| else if (l.size == 0) ------------------ | Branch (948:18): [True: 199, False: 3.53k] ------------------ 949| 199| return; 950| 3.53k| else if (r.tail_offset() == 0) { ------------------ | Branch (950:18): [True: 1.37k, False: 2.15k] ------------------ 951| | // just concat the tail, similar to push_back 952| 1.37k| auto tail_offst = l.tail_offset(); 953| 1.37k| auto tail_size = l.size - tail_offst; 954| 1.37k| if (tail_size == branches) { ------------------ | Branch (954:17): [True: 334, False: 1.04k] ------------------ 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| 334| auto res = 959| 334| l.push_tail(l.root, l.shift, tail_offst, l.tail, tail_size); 960| 334| l.tail->inc(); // note: leak if mutably concatenated 961| | // with itself, but this is forbidden 962| | // by the interface 963| 334| r = {l.size + r.size, get<0>(res), get<1>(res), r.tail->inc()}; 964| 334| return; 965| 1.04k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (965:24): [True: 388, False: 655] ------------------ 966| | // doing this in a exception way mutating way is very 967| | // tricky while potential performance gains are 968| | // minimal (we need to move every element of the right 969| | // tail anyways to make space for the left tail) 970| | // 971| | // we could however improve this by at least moving the 972| | // elements of the right tail... 973| 388| auto new_tail = 974| 388| node_t::copy_leaf(l.tail, tail_size, r.tail, r.size); 975| 388| r = {l.size + r.size, l.shift, l.root->inc(), new_tail}; 976| 388| return; 977| 655| } else { 978| | // like the immutable version 979| 655| auto remaining = branches - tail_size; 980| 655| auto add_tail = node_t::copy_leaf_e( 981| 655| er, l.tail, tail_size, r.tail, remaining); 982| 655| IMMER_TRY { ------------------ | | 49| 655|#define IMMER_TRY try ------------------ 983| 655| auto new_tail = 984| 655| node_t::copy_leaf_e(er, r.tail, remaining, r.size); 985| 655| IMMER_TRY { ------------------ | | 49| 655|#define IMMER_TRY try ------------------ 986| | // this could be improved by making sure that the 987| | // newly created nodes as part of the `push_tail()` 988| | // are tagged with `er` 989| 655| auto new_root = l.push_tail(l.root, 990| 655| l.shift, 991| 655| tail_offst, 992| 655| add_tail, 993| 655| branches); 994| 655| r = {l.size + r.size, 995| 655| get<0>(new_root), 996| 655| get<1>(new_root), 997| 655| new_tail}; 998| 655| return; 999| 655| } 1000| 655| IMMER_CATCH (...) { 1001| 0| node_t::delete_leaf(new_tail, r.size - remaining); 1002| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1003| 0| } 1004| 655| } 1005| 655| IMMER_CATCH (...) { 1006| 0| node_t::delete_leaf(add_tail, branches); 1007| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1008| 0| } 1009| 655| } 1010| 2.15k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1010:20): [True: 607, False: 1.55k] ------------------ 1011| 607| if (supports_transient_concat) { ------------------ | Branch (1011:17): [Folded, False: 607] ------------------ 1012| 0| auto tail_offst = l.tail_offset(); 1013| 0| auto tail_size = l.size - tail_offst; 1014| 0| auto concated = 1015| 0| concat_trees_mut(er, 1016| 0| MemoryPolicy::transience_t::noone, 1017| 0| l.tail, 1018| 0| tail_size, 1019| 0| er, 1020| 0| r.root, 1021| 0| r.shift, 1022| 0| r.tail_offset()); 1023| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 68| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (1023:17): [True: 0, False: 0] ------------------ 1024| 0| concated.node()->compute_shift()); 1025| 0| r.size += l.size; 1026| 0| r.shift = concated.shift(); 1027| 0| r.root = concated.node(); 1028| 0| assert(r.check_tree()); ------------------ | Branch (1028:17): [True: 0, False: 0] ------------------ 1029| 607| } else { 1030| 607| auto tail_offst = l.tail_offset(); 1031| 607| auto tail_size = l.size - tail_offst; 1032| 607| auto concated = concat_trees( 1033| 607| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1034| 607| r = {l.size + r.size, 1035| 607| concated.shift(), 1036| 607| concated.node(), 1037| 607| r.tail->inc()}; 1038| 607| return; 1039| 607| } 1040| 1.55k| } else { 1041| 1.55k| if (supports_transient_concat) { ------------------ | Branch (1041:17): [Folded, False: 1.55k] ------------------ 1042| 0| auto tail_offst = l.tail_offset(); 1043| 0| auto tail_size = l.size - tail_offst; 1044| 0| auto concated = 1045| 0| concat_trees_mut(er, 1046| 0| MemoryPolicy::transience_t::noone, 1047| 0| l.root, 1048| 0| l.shift, 1049| 0| tail_offst, 1050| 0| l.tail, 1051| 0| tail_size, 1052| 0| er, 1053| 0| r.root, 1054| 0| r.shift, 1055| 0| r.tail_offset()); 1056| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 68| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (1056:17): [True: 0, False: 0] ------------------ 1057| 0| concated.node()->compute_shift()); 1058| 0| r.size += l.size; 1059| 0| r.shift = concated.shift(); 1060| 0| r.root = concated.node(); 1061| 0| assert(r.check_tree()); ------------------ | Branch (1061:17): [True: 0, False: 0] ------------------ 1062| 0| return; 1063| 1.55k| } else { 1064| 1.55k| auto tail_offst = l.tail_offset(); 1065| 1.55k| auto tail_size = l.size - tail_offst; 1066| 1.55k| auto concated = concat_trees(l.root, 1067| 1.55k| l.shift, 1068| 1.55k| tail_offst, 1069| 1.55k| l.tail, 1070| 1.55k| tail_size, 1071| 1.55k| r.root, 1072| 1.55k| r.shift, 1073| 1.55k| r.tail_offset()); 1074| 1.55k| r = {l.size + r.size, 1075| 1.55k| concated.shift(), 1076| 1.55k| concated.node(), 1077| 1.55k| r.tail->inc()}; 1078| 1.55k| return; 1079| 1.55k| } 1080| 1.55k| } 1081| 3.98k| } _ZN5immer6detail4rbts15concat_mut_lr_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEENS9_5applyIS6_E4type4editESC_SG_: 1084| 920k| { 1085| 920k| assert(&l != &r); ------------------ | Branch (1085:9): [True: 920k, False: 0] ------------------ 1086| 920k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (1086:9): [True: 920k, False: 0] ------------------ 1087| 920k| using std::get; 1088| 920k| if (l.size == 0) ------------------ | Branch (1088:13): [True: 2.64k, False: 917k] ------------------ 1089| 2.64k| l = r; 1090| 917k| else if (r.size == 0) ------------------ | Branch (1090:18): [True: 2.71k, False: 914k] ------------------ 1091| 2.71k| return; 1092| 914k| else if (r.tail_offset() == 0) { ------------------ | Branch (1092:18): [True: 278k, False: 636k] ------------------ 1093| | // just concat the tail, similar to push_back 1094| 278k| auto tail_offst = l.tail_offset(); 1095| 278k| auto tail_size = l.size - tail_offst; 1096| 278k| if (tail_size == branches) { ------------------ | Branch (1096:17): [True: 36.4k, False: 241k] ------------------ 1097| 36.4k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 1098| 36.4k| l.tail = r.tail->inc(); 1099| 36.4k| l.size += r.size; 1100| 36.4k| return; 1101| 241k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (1101:24): [True: 3.08k, False: 238k] ------------------ 1102| 3.08k| l.ensure_mutable_tail(el, tail_size); 1103| 3.08k| if (r.tail->can_mutate(er)) ------------------ | Branch (1103:21): [True: 1.51k, False: 1.56k] ------------------ 1104| 1.51k| detail::uninitialized_move(r.tail->leaf(), 1105| 1.51k| r.tail->leaf() + r.size, 1106| 1.51k| l.tail->leaf() + tail_size); 1107| 1.56k| else 1108| 1.56k| detail::uninitialized_copy(r.tail->leaf(), 1109| 1.56k| r.tail->leaf() + r.size, 1110| 1.56k| l.tail->leaf() + tail_size); 1111| 3.08k| l.size += r.size; 1112| 3.08k| return; 1113| 238k| } else { 1114| 238k| auto remaining = branches - tail_size; 1115| 238k| l.ensure_mutable_tail(el, tail_size); 1116| 238k| if (r.tail->can_mutate(er)) ------------------ | Branch (1116:21): [True: 105k, False: 133k] ------------------ 1117| 105k| detail::uninitialized_move(r.tail->leaf(), 1118| 105k| r.tail->leaf() + remaining, 1119| 105k| l.tail->leaf() + tail_size); 1120| 133k| else 1121| 133k| detail::uninitialized_copy(r.tail->leaf(), 1122| 133k| r.tail->leaf() + remaining, 1123| 133k| l.tail->leaf() + tail_size); 1124| 238k| IMMER_TRY { ------------------ | | 49| 238k|#define IMMER_TRY try ------------------ 1125| 238k| auto new_tail = 1126| 238k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 1127| 238k| IMMER_TRY { ------------------ | | 49| 238k|#define IMMER_TRY try ------------------ 1128| 238k| l.push_tail_mut(el, tail_offst, l.tail, branches); 1129| 238k| l.tail = new_tail; 1130| 238k| l.size += r.size; 1131| 238k| return; 1132| 238k| } 1133| 238k| IMMER_CATCH (...) { 1134| 0| node_t::delete_leaf(new_tail, r.size - remaining); 1135| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1136| 0| } 1137| 238k| } 1138| 238k| IMMER_CATCH (...) { 1139| 0| detail::destroy_n(r.tail->leaf() + tail_size, remaining); 1140| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1141| 0| } 1142| 238k| } 1143| 636k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1143:20): [True: 3.60k, False: 633k] ------------------ 1144| 3.60k| if (supports_transient_concat) { ------------------ | Branch (1144:17): [Folded, False: 3.60k] ------------------ 1145| 0| auto tail_offst = l.tail_offset(); 1146| 0| auto tail_size = l.size - tail_offst; 1147| 0| auto concated = concat_trees_mut(el, 1148| 0| el, 1149| 0| l.tail, 1150| 0| tail_size, 1151| 0| er, 1152| 0| r.root, 1153| 0| r.shift, 1154| 0| r.tail_offset()); 1155| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 68| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (1155:17): [True: 0, False: 0] ------------------ 1156| 0| concated.node()->compute_shift()); 1157| 0| l.size += r.size; 1158| 0| l.shift = concated.shift(); 1159| 0| l.root = concated.node(); 1160| 0| l.tail = r.tail; 1161| 0| assert(l.check_tree()); ------------------ | Branch (1161:17): [True: 0, False: 0] ------------------ 1162| 0| r.hard_reset(); 1163| 0| return; 1164| 3.60k| } else { 1165| 3.60k| auto tail_offst = l.tail_offset(); 1166| 3.60k| auto tail_size = l.size - tail_offst; 1167| 3.60k| auto concated = concat_trees( 1168| 3.60k| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1169| 3.60k| l = {l.size + r.size, 1170| 3.60k| concated.shift(), 1171| 3.60k| concated.node(), 1172| 3.60k| r.tail->inc()}; 1173| 3.60k| return; 1174| 3.60k| } 1175| 633k| } else { 1176| 633k| if (supports_transient_concat) { ------------------ | Branch (1176:17): [Folded, False: 633k] ------------------ 1177| 0| auto tail_offst = l.tail_offset(); 1178| 0| auto tail_size = l.size - tail_offst; 1179| 0| auto concated = concat_trees_mut(el, 1180| 0| el, 1181| 0| l.root, 1182| 0| l.shift, 1183| 0| tail_offst, 1184| 0| l.tail, 1185| 0| tail_size, 1186| 0| er, 1187| 0| r.root, 1188| 0| r.shift, 1189| 0| r.tail_offset()); 1190| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 68| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (1190:17): [True: 0, False: 0] ------------------ 1191| 0| concated.node()->compute_shift()); 1192| 0| l.size += r.size; 1193| 0| l.shift = concated.shift(); 1194| 0| l.root = concated.node(); 1195| 0| l.tail = r.tail; 1196| 0| assert(l.check_tree()); ------------------ | Branch (1196:17): [True: 0, False: 0] ------------------ 1197| 0| r.hard_reset(); 1198| 0| return; 1199| 633k| } else { 1200| 633k| auto tail_offst = l.tail_offset(); 1201| 633k| auto tail_size = l.size - tail_offst; 1202| 633k| auto concated = concat_trees(l.root, 1203| 633k| l.shift, 1204| 633k| tail_offst, 1205| 633k| l.tail, 1206| 633k| tail_size, 1207| 633k| r.root, 1208| 633k| r.shift, 1209| 633k| r.tail_offset()); 1210| 633k| l = {l.size + r.size, 1211| 633k| concated.shift(), 1212| 633k| concated.node(), 1213| 633k| r.tail->inc()}; 1214| 633k| return; 1215| 633k| } 1216| 633k| } 1217| 920k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6equalsERKSB_: 315| 80.8k| { 316| 80.8k| using iter_t = rrbtree_iterator; 317| 80.8k| if (size != other.size) ------------------ | Branch (317:13): [True: 56.1k, False: 24.7k] ------------------ 318| 56.1k| return false; 319| 24.7k| if (size == 0) ------------------ | Branch (319:13): [True: 197, False: 24.5k] ------------------ 320| 197| return true; 321| 24.5k| auto tail_off = tail_offset(); 322| 24.5k| auto tail_off_other = other.tail_offset(); 323| | // compare trees 324| 24.5k| if (tail_off > 0 && tail_off_other > 0) { ------------------ | Branch (324:13): [True: 23.6k, False: 861] | Branch (324:29): [True: 23.4k, False: 195] ------------------ 325| | // other.shift != shift is a theoretical possibility for 326| | // relaxed trees that sadly we haven't managed to exercise 327| | // in tests yet... 328| 23.4k| if (other.shift >= shift) { ------------------ | Branch (328:17): [True: 22.8k, False: 632] ------------------ 329| 22.8k| if (!visit_maybe_relaxed_sub(other.root, ------------------ | Branch (329:21): [True: 12.7k, False: 10.0k] ------------------ 330| 22.8k| other.shift, 331| 22.8k| tail_off_other, 332| 22.8k| equals_visitor::rrb{}, 333| 22.8k| iter_t{other}, 334| 22.8k| root, 335| 22.8k| shift, 336| 22.8k| tail_off)) 337| 12.7k| return false; 338| 22.8k| } else { 339| 632| if (!visit_maybe_relaxed_sub(root, ------------------ | Branch (339:21): [True: 227, False: 405] ------------------ 340| 632| shift, 341| 632| tail_off, 342| 632| equals_visitor::rrb{}, 343| 632| iter_t{*this}, 344| 632| other.root, 345| 632| other.shift, 346| 632| tail_off_other)) 347| 227| return false; 348| 632| } 349| 23.4k| } 350| 11.5k| return tail_off == tail_off_other ------------------ | Branch (350:16): [True: 6.92k, False: 4.62k] ------------------ 351| 11.5k| ? make_leaf_sub_pos(tail, tail_size()) 352| 6.92k| .visit(equals_visitor{}, other.tail) 353| 11.5k| : tail_off > tail_off_other ------------------ | Branch (353:18): [True: 2.07k, False: 2.55k] ------------------ 354| 4.62k| ? std::equal(tail->leaf(), 355| 2.07k| tail->leaf() + (size - tail_off), 356| 2.07k| other.tail->leaf() + 357| 2.07k| (tail_off - tail_off_other)) 358| | /* otherwise */ 359| 4.62k| : std::equal(tail->leaf(), 360| 2.55k| tail->leaf() + (size - tail_off), 361| 2.55k| iter_t{other} + tail_off); 362| 24.5k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE10region_forEm: 524| 1.18M| { 525| 1.18M| using std::get; 526| 1.18M| auto tail_off = tail_offset(); 527| 1.18M| if (idx >= tail_off) { ------------------ | Branch (527:13): [True: 4.32k, False: 1.18M] ------------------ 528| 4.32k| return std::make_tuple(tail->leaf(), tail_off, size); 529| 1.18M| } else { 530| 1.18M| auto subs = visit_maybe_relaxed_sub( 531| 1.18M| root, shift, tail_off, region_for_visitor(), idx); 532| 1.18M| auto first = idx - get<1>(subs); 533| 1.18M| auto end = first + get<2>(subs); 534| 1.18M| return std::make_tuple(get<0>(subs), first, end); 535| 1.18M| } 536| 1.18M| } _ZNK5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11dereferenceEv: 90| 8.79M| { 91| 8.79M| using std::get; 92| 8.79M| if (i_ < get<1>(curr_) || i_ >= get<2>(curr_)) ------------------ | Branch (92:13): [True: 84.5k, False: 8.70M] | Branch (92:35): [True: 1.10M, False: 7.60M] ------------------ 93| 1.18M| curr_ = v_->region_for(i_); 94| 8.79M| return get<0>(curr_)[i_ - get<1>(curr_)]; 95| 8.79M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7advanceEl: 74| 190k| { 75| 190k| using std::get; 76| 190k| assert(n <= 0 || i_ + static_cast(n) <= v_->size); ------------------ | Branch (76:9): [True: 301, False: 189k] | Branch (76:9): [True: 189k, False: 0] | Branch (76:9): [True: 190k, False: 0] ------------------ 77| 190k| assert(n >= 0 || static_cast(-n) <= i_); ------------------ | Branch (77:9): [True: 190k, False: 0] | Branch (77:9): [True: 0, False: 0] | Branch (77:9): [True: 190k, False: 0] ------------------ 78| 190k| i_ += n; 79| 190k| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9incrementEv: 60| 7.67M| { 61| 7.67M| using std::get; 62| 7.67M| assert(i_ < v_->size); ------------------ | Branch (62:9): [True: 7.67M, False: 0] ------------------ 63| 7.67M| ++i_; 64| 7.67M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2ERKNS1_7rrbtreeIiSA_Lj3ELj3EEE: 39| 26.0k| : v_{&v} 40| 26.0k| , i_{0} 41| 26.0k| , curr_{nullptr, ~size_t{}, ~size_t{}} 42| 26.0k| { 43| 26.0k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEELb1EEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERmEEEDcDpOT_: 31| 23.3k| { 32| 23.3k| return Deriv::visit_inner(std::forward(args)...); 33| 23.3k| } _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| 86.0k| { 32| 86.0k| return Deriv::visit_inner(std::forward(args)...); 33| 86.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.84k| { 38| 1.84k| return Deriv::visit_inner(std::forward(args)...); 39| 1.84k| } _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| 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_15regular_sub_posISD_EERmEEEDcDpOT_: 37| 8.92k| { 38| 8.92k| return Deriv::visit_inner(std::forward(args)...); 39| 8.92k| } _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| 949| { 38| 949| return Deriv::visit_inner(std::forward(args)...); 39| 949| } _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.76k| { 38| 1.76k| return Deriv::visit_inner(std::forward(args)...); 39| 1.76k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_25singleton_regular_sub_posISD_EENS1_14empty_leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 37| 7.29k| { 38| 7.29k| return Deriv::visit_inner(std::forward(args)...); 39| 7.29k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_25singleton_regular_sub_posISD_EENS1_14empty_leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 43| 7.29k| { 44| 7.29k| return Deriv::visit_node(std::forward(args)...); 45| 7.29k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 31| 4.97k| { 32| 4.97k| return Deriv::visit_inner(std::forward(args)...); 33| 4.97k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 43| 4.97k| { 44| 4.97k| return Deriv::visit_node(std::forward(args)...); 45| 4.97k| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE10visit_leafIJRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 49| 7.68M| { 50| 7.68M| return Deriv::visit_node(std::forward(args)...); 51| 7.68M| } _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| 110M| { 32| 110M| return Deriv::visit_inner(std::forward(args)...); 33| 110M| } _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| 110M| { 44| 110M| return Deriv::visit_node(std::forward(args)...); 45| 110M| } _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| 110M| { 32| 110M| return Deriv::visit_inner(std::forward(args)...); 33| 110M| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 31| 16.5k| { 32| 16.5k| return Deriv::visit_inner(std::forward(args)...); 33| 16.5k| } _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| 291| { 38| 291| return Deriv::visit_inner(std::forward(args)...); 39| 291| } _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.04k| { 38| 1.04k| return Deriv::visit_inner(std::forward(args)...); 39| 1.04k| } _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| 5.83M| { 50| 5.83M| return Deriv::visit_node(std::forward(args)...); 51| 5.83M| } _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| 580k| { 38| 580k| return Deriv::visit_inner(std::forward(args)...); 39| 580k| } _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| 580k| { 44| 580k| return Deriv::visit_node(std::forward(args)...); 45| 580k| } _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| 580k| { 38| 580k| return Deriv::visit_inner(std::forward(args)...); 39| 580k| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 37| 4.10M| { 38| 4.10M| return Deriv::visit_inner(std::forward(args)...); 39| 4.10M| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE11visit_innerIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_21concat_rebalance_planILj3ELj3EEEEEEDcDpOT_: 43| 4.10M| { 44| 4.10M| return Deriv::visit_node(std::forward(args)...); 45| 4.10M| } _ZN5immer6detail4rbts12visitor_baseINS1_21concat_merger_visitorEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERNS1_13concat_mergerISG_EEEEEDcDpOT_: 37| 4.10M| { 38| 4.10M| return Deriv::visit_inner(std::forward(args)...); 39| 4.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_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 37| 2.32k| { 38| 2.32k| return Deriv::visit_inner(std::forward(args)...); 39| 2.32k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 43| 2.32k| { 44| 2.32k| return Deriv::visit_node(std::forward(args)...); 45| 2.32k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 31| 1.06M| { 32| 1.06M| return Deriv::visit_inner(std::forward(args)...); 33| 1.06M| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 43| 1.06M| { 44| 1.06M| return Deriv::visit_node(std::forward(args)...); 45| 1.06M| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 31| 1.06M| { 32| 1.06M| return Deriv::visit_inner(std::forward(args)...); 33| 1.06M| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 1.06M| { 44| 1.06M| return Deriv::visit_node(std::forward(args)...); 45| 1.06M| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_: 31| 3.29M| { 32| 3.29M| return Deriv::visit_inner(std::forward(args)...); 33| 3.29M| } _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| 5.01k| { 38| 5.01k| return Deriv::visit_inner(std::forward(args)...); 39| 5.01k| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 31| 1.12M| { 32| 1.12M| return Deriv::visit_inner(std::forward(args)...); 33| 1.12M| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 383k| { 38| 383k| return Deriv::visit_inner(std::forward(args)...); 39| 383k| } _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.26k| { 38| 1.26k| return Deriv::visit_inner(std::forward(args)...); 39| 1.26k| } _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| 21.7k| { 38| 21.7k| return Deriv::visit_inner(std::forward(args)...); 39| 21.7k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EERNS1_8full_posISD_EEEEEDcDpOT_: 37| 5.63k| { 38| 5.63k| return Deriv::visit_inner(std::forward(args)...); 39| 5.63k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_: 37| 15.4k| { 38| 15.4k| return Deriv::visit_inner(std::forward(args)...); 39| 15.4k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EERNS1_11relaxed_posISD_EEEEEDcDpOT_: 37| 1.50M| { 38| 1.50M| return Deriv::visit_inner(std::forward(args)...); 39| 1.50M| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 31| 7.27M| { 32| 7.27M| return Deriv::visit_inner(std::forward(args)...); 33| 7.27M| } _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| 750| { 38| 750| return Deriv::visit_inner(std::forward(args)...); 39| 750| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EERNS1_15regular_sub_posISD_EEEEEDcDpOT_: 31| 10.1k| { 32| 10.1k| return Deriv::visit_inner(std::forward(args)...); 33| 10.1k| } _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.44k| { 38| 1.44k| return Deriv::visit_inner(std::forward(args)...); 39| 1.44k| } _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| 219| { 32| 219| return Deriv::visit_inner(std::forward(args)...); 33| 219| } _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| 455| { 32| 455| return Deriv::visit_inner(std::forward(args)...); 33| 455| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_: 31| 7.23M| { 32| 7.23M| return Deriv::visit_inner(std::forward(args)...); 33| 7.23M| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 7.16k| { 38| 7.16k| return Deriv::visit_inner(std::forward(args)...); 39| 7.16k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 7.16k| { 44| 7.16k| return Deriv::visit_node(std::forward(args)...); 45| 7.16k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 37| 15.9k| { 38| 15.9k| return Deriv::visit_inner(std::forward(args)...); 39| 15.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| 15.9k| { 44| 15.9k| return Deriv::visit_node(std::forward(args)...); 45| 15.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.82k| { 32| 6.82k| return Deriv::visit_inner(std::forward(args)...); 33| 6.82k| } _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.82k| { 44| 6.82k| return Deriv::visit_node(std::forward(args)...); 45| 6.82k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 9.08k| { 38| 9.08k| return Deriv::visit_inner(std::forward(args)...); 39| 9.08k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 9.08k| { 44| 9.08k| return Deriv::visit_node(std::forward(args)...); 45| 9.08k| } _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| 15.1k| { 32| 15.1k| return Deriv::visit_inner(std::forward(args)...); 33| 15.1k| } _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| 15.1k| { 44| 15.1k| return Deriv::visit_node(std::forward(args)...); 45| 15.1k| } _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| 30.8k| { 32| 30.8k| return Deriv::visit_inner(std::forward(args)...); 33| 30.8k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERjRNS1_15regular_sub_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 31| 2.11k| { 32| 2.11k| return Deriv::visit_inner(std::forward(args)...); 33| 2.11k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERjRNS1_8full_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 31| 475| { 32| 475| return Deriv::visit_inner(std::forward(args)...); 33| 475| } _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| 857| { 38| 857| return Deriv::visit_inner(std::forward(args)...); 39| 857| } _ZN5immer6detail4rbts12visitor_baseINS1_18region_for_visitorIiEEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERmEEEDcDpOT_: 31| 4.26M| { 32| 4.26M| return Deriv::visit_inner(std::forward(args)...); 33| 4.26M| } _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| 235k| { 38| 235k| return Deriv::visit_inner(std::forward(args)...); 39| 235k| } _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| 233k| { 38| 233k| return Deriv::visit_inner(std::forward(args)...); 39| 233k| } _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| 32.5k| { 38| 32.5k| return Deriv::visit_inner(std::forward(args)...); 39| 32.5k| } _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| 16.5k| { 38| 16.5k| return Deriv::visit_inner(std::forward(args)...); 39| 16.5k| } _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| 826| { 38| 826| return Deriv::visit_inner(std::forward(args)...); 39| 826| } _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| 15.2k| { 38| 15.2k| return Deriv::visit_inner(std::forward(args)...); 39| 15.2k| } _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.55k| { 38| 3.55k| return Deriv::visit_inner(std::forward(args)...); 39| 3.55k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERjRNS1_11relaxed_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 37| 4.37k| { 38| 4.37k| return Deriv::visit_inner(std::forward(args)...); 39| 4.37k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEERjRNS1_11relaxed_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERmEEEDcDpOT_: 37| 3.06k| { 38| 3.06k| return Deriv::visit_inner(std::forward(args)...); 39| 3.06k| } _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| 136k| { 32| 136k| return Deriv::visit_inner(std::forward(args)...); 33| 136k| } _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.24k| { 32| 1.24k| return Deriv::visit_inner(std::forward(args)...); 33| 1.24k| } _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.24k| { 44| 1.24k| return Deriv::visit_node(std::forward(args)...); 45| 1.24k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERKPSH_RKjRmEEEDcDpOT_: 37| 8.31k| { 38| 8.31k| return Deriv::visit_inner(std::forward(args)...); 39| 8.31k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE11visit_innerIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEEENS1_16rrbtree_iteratorIiSG_Lj3ELj3EEERKPSH_RKjRmEEEDcDpOT_: 43| 8.31k| { 44| 8.31k| return Deriv::visit_node(std::forward(args)...); 45| 8.31k| } _ZN5immer6detail15auto_const_castINS_22unsafe_refcount_policyEEERT_RKS3_: 143| 466M|{ 144| 466M| return const_cast(x); 145| 466M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7inner_tEPSC_Lb0EE15get_storage_ptrEv: 113| 290M| { 114| 290M| check_base(); 115| 290M| auto* base = static_cast(this); 116| 290M| return reinterpret_cast(base + 1); 117| 290M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE7inner_tEPSC_Lb0EE10check_baseEv: 134| 290M| { 135| 290M| static_assert(std::is_standard_layout::value && 136| 290M| !std::is_empty::value, 137| 290M| "Please add 'true' if the derived class is emtpy"); 138| 290M| } _ZN5immer6detail9static_ifILb0EZNS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14delete_inner_rEPSC_jEUlT_E_EENSt3__19enable_ifIXntT_EvE4typeEOT0_: 334| 33.8M|{ 335| 33.8M|} _ZN5immer6detail9destroy_nIPijEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 1.59M|{ 189| 1.59M| return first + n; 190| 1.59M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6leaf_tEiLb1EE15get_storage_ptrEv: 75| 11.1M| { 76| 11.1M| check_base(); 77| 11.1M| return reinterpret_cast(this); 78| 11.1M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6leaf_tEiLb1EE10check_baseEv: 94| 11.1M| { 95| | // is_standard_layout requires that only one class in the hierarchy 96| | // contains non-static data members. Since this class contains one 97| | // member, the static_assert will only hold when the derived class is 98| | // empty. 99| 11.1M| static_assert(std::is_standard_layout::value, 100| 11.1M| "Please remove 'true' if the derived class is non emtpy"); 101| 11.1M| } _ZN5immer6detail18uninitialized_copyIPiS2_S2_EENSt3__19enable_ifIX18can_trivially_copyIT_T1_EES6_E4typeES5_T0_S6_: 236| 2.13M|{ 237| 2.13M| return std::copy(first, last, out); 238| 2.13M|} _ZN5immer6detail9static_ifILb1EPNS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEZNSC_15make_inner_sr_nEjPNS0_3csl6memberINSC_14relaxed_data_tEvE4typeEEUlT_E_ZNSC_15make_inner_sr_nEjSJ_EUlSK_E0_EENSt3__19enable_ifIXT_ET0_E4typeEOT1_OT2_: 339| 198k|{ 340| 198k| return std::forward(f1)(empty_t{}); 341| 198k|} _ZN5immer6detail4ipowImEET_S2_j: 323| 51.3M|{ 324| 51.3M| return pow == 0 ? 1 : num * ipow(num, pow - 1); ------------------ | Branch (324:12): [True: 2.44M, False: 48.8M] ------------------ 325| 51.3M|} _ZN5immer6detail9static_ifILb1EPNS0_3csl6memberINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14relaxed_data_tEvE4typeEZNSE_24ensure_mutable_relaxed_nENSC_5applyIS9_E4type4editEjEUlT_E_ZNSE_24ensure_mutable_relaxed_nESM_jEUlSN_E0_EENSt3__19enable_ifIXT_ET0_E4typeEOT1_OT2_: 339| 181k|{ 340| 181k| return std::forward(f1)(empty_t{}); 341| 181k|} _ZN5immer6detail9static_ifILb0EZNS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14make_inner_r_eENSA_5applyIS7_E4type4editEEUlT_E_EENSt3__19enable_ifIXntT_EvE4typeEOT0_: 334| 136k|{ 335| 136k|} _ZN5immer6detail9static_ifILb1EPNS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEZNSC_15make_inner_sr_eENSA_5applyIS7_E4type4editEPNS0_3csl6memberINSC_14relaxed_data_tEvE4typeEEUlT_E_ZNSC_15make_inner_sr_eESH_SN_EUlSO_E0_EENSt3__19enable_ifIXT_ET0_E4typeEOT1_OT2_: 339| 25.5k|{ 340| 25.5k| return std::forward(f1)(empty_t{}); 341| 25.5k|} _ZN5immer6detail9destroy_nIPimEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 328|{ 189| 328| return first + n; 190| 328|} _ZN5immer6detail9static_ifILb1EPNS0_3csl6memberINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14relaxed_data_tEvE4typeEZNSE_22ensure_mutable_relaxedENSC_5applyIS9_E4type4editEEUlT_E_ZNSE_22ensure_mutable_relaxedESM_EUlSN_E0_EENSt3__19enable_ifIXT_ET0_E4typeEOT1_OT2_: 339| 162k|{ 340| 162k| return std::forward(f1)(empty_t{}); 341| 162k|} _ZN5immer6detail18uninitialized_moveIPiS2_EENSt3__19enable_ifIX18can_trivially_copyIT_T0_EES6_E4typeES5_S5_S6_: 210| 106k|{ 211| 106k| return std::copy(first, last, out); 212| 106k|} _ZN5immer6detail8as_constIiEEPKT_PS2_: 29| 1.11M|{ 30| 1.11M| return x; 31| 1.11M|} _ZN5immer6detail4makeINS_15debug_size_heapINS_8cpp_heapEEENS_3boxIiNS_13memory_policyINS_21free_list_heap_policyIS3_Lm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderEJiEEEPT0_DpOT1_: 260| 15.7k|{ 261| 15.7k| auto ptr = Heap::allocate(sizeof(T)); 262| 15.7k| IMMER_TRY { ------------------ | | 49| 15.7k|#define IMMER_TRY try ------------------ 263| 15.7k| return new (ptr) T(std::forward(args)...); 264| 15.7k| } 265| 15.7k| IMMER_CATCH (...) { 266| 0| Heap::deallocate(sizeof(T), ptr); 267| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 268| 0| } 269| 15.7k|} _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2Ev: 96| 85.2k| flex_vector() = default; _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_backEi: 246| 324k| { 247| 324k| return impl_.push_back(std::move(value)); 248| 324k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEC2ENS_6detail4rbts7rrbtreeIiS8_Lj3ELj3EEE: 536| 1.19M| : impl_(std::move(impl)) 537| 1.19M| { 538| |#if IMMER_DEBUG_PRINT 539| | // force the compiler to generate debug_print, so we can call 540| | // it from a debugger 541| | [](volatile auto) {}(&flex_vector::debug_print); 542| |#endif 543| 1.19M| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4sizeEv: 181| 4.06M| IMMER_NODISCARD size_type size() const { return impl_.size; } flex-vector-bo.cpp:_ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6updateIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSE_E_EES9_mOSE_: 323| 169k| { 324| 169k| return impl_.update(index, std::forward(fn)); 325| 169k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4takeEm: 350| 24.6k| { 351| 24.6k| return impl_.take(elems); 352| 24.6k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4dropEm: 376| 35.9k| { 377| 35.9k| return impl_.drop(elems); 378| 35.9k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE8max_sizeEv: 90| 1.79M| constexpr static size_type max_size() { return impl_t::max_size(); } _ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEESB_: 403| 643k| { 404| 643k| return l.impl_.concat(r.impl_); 405| 643k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9push_backEi: 251| 40.0k| { 252| 40.0k| return push_back_move(move_t{}, std::move(value)); 253| 40.0k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE14push_back_moveENSt3__117integral_constantIbLb1EEEi: 547| 40.0k| { 548| 40.0k| impl_.push_back_mut({}, std::move(value)); 549| 40.0k| return std::move(*this); 550| 40.0k| } flex-vector-bo.cpp:_ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6updateIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSE_E0_EEDcmOSE_: 329| 30.8k| { 330| 30.8k| return update_move(move_t{}, index, std::forward(fn)); 331| 30.8k| } flex-vector-bo.cpp:_ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11update_moveIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSE_E0_EEOS9_NSt3__117integral_constantIbLb1EEEmOSE_: 568| 30.8k| { 569| 30.8k| impl_.update_mut({}, index, std::forward(fn)); 570| 30.8k| return std::move(*this); 571| 30.8k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4takeEm: 355| 31.6k| { 356| 31.6k| return take_move(move_t{}, elems); 357| 31.6k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9take_moveENSt3__117integral_constantIbLb1EEEm: 579| 31.6k| { 580| 31.6k| impl_.take_mut({}, elems); 581| 31.6k| return std::move(*this); 582| 31.6k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE4dropEm: 381| 57.0k| { 382| 57.0k| return drop_move(move_t{}, elems); 383| 57.0k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE9drop_moveENSt3__117integral_constantIbLb1EEEm: 589| 57.0k| { 590| 57.0k| impl_.drop_mut({}, elems); 591| 57.0k| return std::move(*this); 592| 57.0k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEERKS9_: 409| 209k| { 410| 209k| return concat_move(move_t{}, std::move(l), r); 411| 209k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_RKS9_: 600| 209k| { 601| 209k| concat_mut_l(l.impl_, {}, r.impl_); 602| 209k| return std::move(l); 603| 209k| } _ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEEOS9_: 415| 3.98k| { 416| 3.98k| return concat_move(move_t{}, l, std::move(r)); 417| 3.98k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEERKS9_OS9_: 606| 3.98k| { 607| 3.98k| concat_mut_r(l.impl_, r.impl_, {}); 608| 3.98k| return std::move(r); 609| 3.98k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEESA_: 421| 920k| { 422| 920k| return concat_move(move_t{}, std::move(l), std::move(r)); 423| 920k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_SD_: 612| 920k| { 613| 920k| concat_mut_lr_l(l.impl_, {}, r.impl_, {}); 614| 920k| return std::move(l); 615| 920k| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EEeqERKS9_: 222| 80.8k| { 223| 80.8k| return impl_.equals(other.impl_); 224| 80.8k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE5eraseEm: 480| 7.15k| { 481| 7.15k| return take(pos) + drop(pos + 1); 482| 7.15k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_8cpp_heapEEENS_22unsafe_refcount_policyENS_14no_lock_policyENS_20no_transience_policyELb1ELb1EEELj3ELj3EE6insertEmi: 442| 15.7k| { 443| 15.7k| return take(pos).push_back(std::move(value)) + drop(pos); 444| 15.7k| } _ZN5immer8cpp_heap10deallocateEmPv: 36| 36.8M| static void deallocate(std::size_t, void* data) { ::operator delete(data); } _ZN5immer8cpp_heap8allocateIJEEEPvmDpT_: 27| 36.8M| { 28| 36.8M| return ::operator new(size); 29| 36.8M| } _ZN5immer15debug_size_heapINS_8cpp_heapEE8allocateIJEEEPvmDpT_: 49| 15.7k| { 50| 15.7k| auto p = (std::size_t*) Base::allocate(size + extra_size, tags...); 51| 15.7k| new (p) std::size_t{size}; 52| 15.7k| return ((char*) p) + extra_size; 53| 15.7k| } _ZN5immer15debug_size_heapINS_8cpp_heapEE10deallocateIJEEEvmPvDpT_: 57| 15.7k| { 58| 15.7k| auto p = (std::size_t*) (((char*) data) - extra_size); 59| 15.7k| assert(*p == size); ------------------ | Branch (59:9): [True: 15.7k, False: 0] ------------------ 60| 15.7k| Base::deallocate(size + extra_size, p, tags...); 61| 15.7k| } _ZN5immer15refcount_policyC2Ev: 28| 15.7k| : refcount{1} {}; _ZN5immer15refcount_policy3decEv: 36| 15.7k| bool dec() { return 1 == refcount.fetch_sub(1, std::memory_order_acq_rel); } _ZN5immer22unsafe_refcount_policyC2Ev: 27| 36.8M| : refcount{1} {}; _ZN5immer22unsafe_refcount_policy3incEv: 33| 213M| void inc() { ++refcount; } _ZN5immer22unsafe_refcount_policy3decEv: 34| 250M| bool dec() { return --refcount == 0; } _ZN5immer22unsafe_refcount_policy6uniqueEv: 35| 2.54M| bool unique() { return refcount == 1; } _ZNK5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5ownee5ownedEv: 36| 36.8M| bool owned() const { return false; } _ZNK5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5ownee10can_mutateENS6_4editE: 35| 267k| bool can_mutate(edit) const { return false; } _ZN5immer20no_transience_policy5applyINS_11heap_policyINS_8cpp_heapEEEE4type5owneeaSENS6_4editE: 34| 619k| ownee& operator=(edit) { return *this; };