LLVMFuzzerTestOneInput: 18| 8.83k|{ 19| 8.83k| constexpr auto var_count = 8; 20| 8.83k| constexpr auto bits = 2; 21| | 22| 8.83k| using vector_t = 23| 8.83k| immer::flex_vector; 24| 8.83k| using size_t = std::uint8_t; 25| | 26| 8.83k| auto vars = std::array{}; 27| | 28| 8.83k| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; 29| 8.83k| auto is_valid_var_neq = [](auto other) { 30| 8.83k| return [=](auto idx) { 31| 8.83k| return idx >= 0 && idx < var_count && idx != other; 32| 8.83k| }; 33| 8.83k| }; 34| 8.83k| auto is_valid_index = [](auto& v) { 35| 8.83k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 36| 8.83k| }; 37| 8.83k| auto is_valid_size = [](auto& v) { 38| 8.83k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 39| 8.83k| }; 40| 8.83k| auto can_concat = [](auto&& v1, auto&& v2) { 41| 8.83k| return v1.size() + v2.size() < vector_t::max_size(); 42| 8.83k| }; 43| 8.83k| auto can_compare = [](auto&& v) { 44| | // avoid comparing vectors that are too big, and hence, slow to compare 45| 8.83k| return v.size() < (1 << 15); 46| 8.83k| }; 47| 8.83k| return fuzzer_input{data, size}.run([&](auto& in) { 48| 8.83k| enum ops 49| 8.83k| { 50| 8.83k| op_push_back, 51| 8.83k| op_update, 52| 8.83k| op_take, 53| 8.83k| op_drop, 54| 8.83k| op_concat, 55| 8.83k| op_push_back_move, 56| 8.83k| op_update_move, 57| 8.83k| op_take_move, 58| 8.83k| op_drop_move, 59| 8.83k| op_concat_move_l, 60| 8.83k| op_concat_move_r, 61| 8.83k| op_concat_move_lr, 62| 8.83k| op_insert, 63| 8.83k| op_erase, 64| 8.83k| op_compare, 65| 8.83k| }; 66| 8.83k| auto src = read(in, is_valid_var); 67| 8.83k| auto dst = read(in, is_valid_var); 68| 8.83k| switch (read(in)) { 69| 8.83k| case op_push_back: { 70| 8.83k| vars[dst] = vars[src].push_back(42); 71| 8.83k| break; 72| 8.83k| } 73| 8.83k| case op_update: { 74| 8.83k| auto idx = read(in, is_valid_index(vars[src])); 75| 8.83k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 76| 8.83k| break; 77| 8.83k| } 78| 8.83k| case op_take: { 79| 8.83k| auto idx = read(in, is_valid_size(vars[src])); 80| 8.83k| vars[dst] = vars[src].take(idx); 81| 8.83k| break; 82| 8.83k| } 83| 8.83k| case op_drop: { 84| 8.83k| auto idx = read(in, is_valid_size(vars[src])); 85| 8.83k| vars[dst] = vars[src].drop(idx); 86| 8.83k| break; 87| 8.83k| } 88| 8.83k| case op_concat: { 89| 8.83k| auto src2 = read(in, is_valid_var); 90| 8.83k| if (can_concat(vars[src], vars[src2])) 91| 8.83k| vars[dst] = vars[src] + vars[src2]; 92| 8.83k| break; 93| 8.83k| } 94| 8.83k| case op_push_back_move: { 95| 8.83k| vars[dst] = std::move(vars[src]).push_back(21); 96| 8.83k| break; 97| 8.83k| } 98| 8.83k| case op_update_move: { 99| 8.83k| auto idx = read(in, is_valid_index(vars[src])); 100| 8.83k| vars[dst] = 101| 8.83k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 102| 8.83k| break; 103| 8.83k| } 104| 8.83k| case op_take_move: { 105| 8.83k| auto idx = read(in, is_valid_size(vars[src])); 106| 8.83k| vars[dst] = std::move(vars[src]).take(idx); 107| 8.83k| break; 108| 8.83k| } 109| 8.83k| case op_drop_move: { 110| 8.83k| auto idx = read(in, is_valid_size(vars[src])); 111| 8.83k| vars[dst] = std::move(vars[src]).drop(idx); 112| 8.83k| break; 113| 8.83k| } 114| 8.83k| case op_concat_move_l: { 115| 8.83k| auto src2 = read(in, is_valid_var_neq(src)); 116| 8.83k| if (can_concat(vars[src], vars[src2])) 117| 8.83k| vars[dst] = std::move(vars[src]) + vars[src2]; 118| 8.83k| break; 119| 8.83k| } 120| 8.83k| case op_concat_move_r: { 121| 8.83k| auto src2 = read(in, is_valid_var_neq(src)); 122| 8.83k| if (can_concat(vars[src], vars[src2])) 123| 8.83k| vars[dst] = vars[src] + std::move(vars[src2]); 124| 8.83k| break; 125| 8.83k| } 126| 8.83k| case op_concat_move_lr: { 127| 8.83k| auto src2 = read(in, is_valid_var_neq(src)); 128| 8.83k| if (can_concat(vars[src], vars[src2])) 129| 8.83k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 130| 8.83k| break; 131| 8.83k| } 132| 8.83k| case op_compare: { 133| 8.83k| using std::swap; 134| 8.83k| if (can_compare(vars[src]) && vars[src] == vars[dst]) 135| 8.83k| swap(vars[src], vars[dst]); 136| 8.83k| break; 137| 8.83k| } 138| 8.83k| case op_erase: { 139| 8.83k| auto idx = read(in, is_valid_index(vars[src])); 140| 8.83k| vars[dst] = vars[src].erase(idx); 141| 8.83k| break; 142| 8.83k| } 143| 8.83k| case op_insert: { 144| 8.83k| auto idx = read(in, is_valid_size(vars[src])); 145| 8.83k| vars[dst] = vars[src].insert(idx, immer::box{42}); 146| 8.83k| break; 147| 8.83k| } 148| 8.83k| default: 149| 8.83k| break; 150| 8.83k| }; 151| 8.83k| return true; 152| 8.83k| }); 153| 8.83k|} flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_: 47| 2.07M| return fuzzer_input{data, size}.run([&](auto& in) { 48| 2.07M| enum ops 49| 2.07M| { 50| 2.07M| op_push_back, 51| 2.07M| op_update, 52| 2.07M| op_take, 53| 2.07M| op_drop, 54| 2.07M| op_concat, 55| 2.07M| op_push_back_move, 56| 2.07M| op_update_move, 57| 2.07M| op_take_move, 58| 2.07M| op_drop_move, 59| 2.07M| op_concat_move_l, 60| 2.07M| op_concat_move_r, 61| 2.07M| op_concat_move_lr, 62| 2.07M| op_insert, 63| 2.07M| op_erase, 64| 2.07M| op_compare, 65| 2.07M| }; 66| 2.07M| auto src = read(in, is_valid_var); 67| 2.07M| auto dst = read(in, is_valid_var); 68| 2.07M| switch (read(in)) { 69| 444k| case op_push_back: { ------------------ | Branch (69:9): [True: 444k, False: 1.62M] ------------------ 70| 444k| vars[dst] = vars[src].push_back(42); 71| 444k| break; 72| 0| } 73| 109k| case op_update: { ------------------ | Branch (73:9): [True: 109k, False: 1.96M] ------------------ 74| 109k| auto idx = read(in, is_valid_index(vars[src])); 75| 109k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 76| 109k| break; 77| 0| } 78| 1.73k| case op_take: { ------------------ | Branch (78:9): [True: 1.73k, False: 2.06M] ------------------ 79| 1.73k| auto idx = read(in, is_valid_size(vars[src])); 80| 1.73k| vars[dst] = vars[src].take(idx); 81| 1.73k| break; 82| 0| } 83| 3.43k| case op_drop: { ------------------ | Branch (83:9): [True: 3.43k, False: 2.06M] ------------------ 84| 3.43k| auto idx = read(in, is_valid_size(vars[src])); 85| 3.43k| vars[dst] = vars[src].drop(idx); 86| 3.43k| break; 87| 0| } 88| 964k| case op_concat: { ------------------ | Branch (88:9): [True: 964k, False: 1.10M] ------------------ 89| 964k| auto src2 = read(in, is_valid_var); 90| 964k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (90:17): [True: 908k, False: 56.0k] ------------------ 91| 908k| vars[dst] = vars[src] + vars[src2]; 92| 964k| break; 93| 0| } 94| 13.2k| case op_push_back_move: { ------------------ | Branch (94:9): [True: 13.2k, False: 2.05M] ------------------ 95| 13.2k| vars[dst] = std::move(vars[src]).push_back(21); 96| 13.2k| break; 97| 0| } 98| 77.7k| case op_update_move: { ------------------ | Branch (98:9): [True: 77.7k, False: 1.99M] ------------------ 99| 77.7k| auto idx = read(in, is_valid_index(vars[src])); 100| 77.7k| vars[dst] = 101| 77.7k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 102| 77.7k| break; 103| 0| } 104| 38.4k| case op_take_move: { ------------------ | Branch (104:9): [True: 38.4k, False: 2.03M] ------------------ 105| 38.4k| auto idx = read(in, is_valid_size(vars[src])); 106| 38.4k| vars[dst] = std::move(vars[src]).take(idx); 107| 38.4k| break; 108| 0| } 109| 42.4k| case op_drop_move: { ------------------ | Branch (109:9): [True: 42.4k, False: 2.02M] ------------------ 110| 42.4k| auto idx = read(in, is_valid_size(vars[src])); 111| 42.4k| vars[dst] = std::move(vars[src]).drop(idx); 112| 42.4k| break; 113| 0| } 114| 276k| case op_concat_move_l: { ------------------ | Branch (114:9): [True: 276k, False: 1.79M] ------------------ 115| 276k| auto src2 = read(in, is_valid_var_neq(src)); 116| 276k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (116:17): [True: 271k, False: 5.00k] ------------------ 117| 271k| vars[dst] = std::move(vars[src]) + vars[src2]; 118| 276k| break; 119| 0| } 120| 3.89k| case op_concat_move_r: { ------------------ | Branch (120:9): [True: 3.89k, False: 2.06M] ------------------ 121| 3.89k| auto src2 = read(in, is_valid_var_neq(src)); 122| 3.89k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (122:17): [True: 3.35k, False: 543] ------------------ 123| 3.35k| vars[dst] = vars[src] + std::move(vars[src2]); 124| 3.89k| break; 125| 0| } 126| 2.36k| case op_concat_move_lr: { ------------------ | Branch (126:9): [True: 2.36k, False: 2.06M] ------------------ 127| 2.36k| auto src2 = read(in, is_valid_var_neq(src)); 128| 2.36k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (128:17): [True: 1.65k, False: 712] ------------------ 129| 1.65k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 130| 2.36k| break; 131| 0| } 132| 32.3k| case op_compare: { ------------------ | Branch (132:9): [True: 32.3k, False: 2.03M] ------------------ 133| 32.3k| using std::swap; 134| 32.3k| if (can_compare(vars[src]) && vars[src] == vars[dst]) ------------------ | Branch (134:17): [True: 28.8k, False: 3.46k] | Branch (134:43): [True: 6.84k, False: 22.0k] ------------------ 135| 6.84k| swap(vars[src], vars[dst]); 136| 32.3k| break; 137| 0| } 138| 3.53k| case op_erase: { ------------------ | Branch (138:9): [True: 3.53k, False: 2.06M] ------------------ 139| 3.53k| auto idx = read(in, is_valid_index(vars[src])); 140| 3.53k| vars[dst] = vars[src].erase(idx); 141| 3.53k| break; 142| 0| } 143| 19.3k| case op_insert: { ------------------ | Branch (143:9): [True: 19.3k, False: 2.05M] ------------------ 144| 19.3k| auto idx = read(in, is_valid_size(vars[src])); 145| 19.3k| vars[dst] = vars[src].insert(idx, immer::box{42}); 146| 19.3k| break; 147| 0| } 148| 29.3k| default: ------------------ | Branch (148:9): [True: 29.3k, False: 2.04M] ------------------ 149| 29.3k| break; 150| 2.07M| }; 151| 2.06M| return true; 152| 2.07M| }); flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_0clIcEEDaT_: 28| 5.45M| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; ------------------ | Branch (28:48): [True: 5.27M, False: 178k] | Branch (28:60): [True: 5.09M, False: 181k] ------------------ flex-vector.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaRT_ENKUlSC_E_clIhEEDaSC_: 35| 213k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; ------------------ | Branch (35:39): [True: 213k, False: 0] | Branch (35:51): [True: 190k, False: 23.4k] ------------------ flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaRT_: 34| 190k| auto is_valid_index = [](auto& v) { 35| 190k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 36| 190k| }; flex-vector.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E_clIiEEDaS2_: 75| 109k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); flex-vector.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaRT_ENKUlSC_E_clIhEEDaSC_: 38| 116k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; ------------------ | Branch (38:39): [True: 116k, False: 0] | Branch (38:51): [True: 105k, False: 11.7k] ------------------ flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaRT_: 37| 105k| auto is_valid_size = [](auto& v) { 38| 105k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 39| 105k| }; flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_4clIRN5immer11flex_vectorIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEELj2ELj2EEESC_EEDaOT_OT0_: 40| 1.24M| auto can_concat = [](auto&& v1, auto&& v2) { 41| 1.24M| return v1.size() + v2.size() < vector_t::max_size(); 42| 1.24M| }; flex-vector.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E0_clIiEEDaS2_: 101| 77.7k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); flex-vector.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_ENKUlS1_E_clIcEEDaS1_: 30| 324k| return [=](auto idx) { 31| 324k| return idx >= 0 && idx < var_count && idx != other; ------------------ | Branch (31:20): [True: 319k, False: 5.10k] | Branch (31:32): [True: 307k, False: 11.0k] | Branch (31:51): [True: 282k, False: 25.8k] ------------------ 32| 324k| }; flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_: 29| 282k| auto is_valid_var_neq = [](auto other) { 30| 282k| return [=](auto idx) { 31| 282k| return idx >= 0 && idx < var_count && idx != other; 32| 282k| }; 33| 282k| }; flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_5clIRN5immer11flex_vectorIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaOT_: 43| 32.3k| auto can_compare = [](auto&& v) { 44| | // avoid comparing vectors that are too big, and hence, slow to compare 45| 32.3k| return v.size() < (1 << 15); 46| 32.3k| }; flex-vector.cpp:_ZN12fuzzer_input3runIZ22LLVMFuzzerTestOneInputE3$_6EEiT_: 50| 8.83k| { 51| 8.83k| if (size_ > fuzzer_input_max_size) ------------------ | Branch (51:13): [True: 8, False: 8.82k] ------------------ 52| 8| return 0; 53| 8.82k| try { 54| 2.07M| while (step(*this)) ------------------ | Branch (54:20): [True: 2.06M, False: 8.82k] ------------------ 55| 2.06M| continue; 56| 8.82k| } catch (const no_more_input&) { 57| 8.82k| }; 58| 8.82k| return 0; 59| 8.82k| } flex-vector.cpp:_Z4readIcZ22LLVMFuzzerTestOneInputE3$_0ET_R12fuzzer_inputT0_: 70| 5.09M|{ 71| 5.09M| auto x = read(fz); 72| 5.45M| while (!cond(x)) ------------------ | Branch (72:12): [True: 360k, False: 5.09M] ------------------ 73| 360k| x = read(fz); 74| 5.09M| return x; 75| 5.09M|} _Z4readIcERKT_R12fuzzer_input: 64| 7.84M|{ 65| 7.84M| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 7.84M|} _ZN12fuzzer_input4nextEmm: 40| 8.17M| { 41| 8.17M| auto& p = const_cast(reinterpret_cast(data_)); 42| 8.17M| auto r = std::align(align, size, p, size_); 43| 8.17M| if (r == nullptr) ------------------ | Branch (43:13): [True: 8.82k, False: 8.16M] ------------------ 44| 8.82k| throw no_more_input{}; 45| 8.16M| return next(size); 46| 8.17M| } _ZN12fuzzer_input4nextEm: 30| 8.16M| { 31| 8.16M| if (size_ < size) ------------------ | Branch (31:13): [True: 0, False: 8.16M] ------------------ 32| 0| throw no_more_input{}; 33| 8.16M| auto r = data_; 34| 8.16M| data_ += size; 35| 8.16M| size_ -= size; 36| 8.16M| return r; 37| 8.16M| } flex-vector.cpp:_Z4readIhZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS2_13memory_policyINS2_21free_list_heap_policyINS2_8cpp_heapELm1024EEENS2_15refcount_policyENS2_15spinlock_policyENS2_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaRT_EUlSD_E_ESD_R12fuzzer_inputT0_: 70| 190k|{ 71| 190k| auto x = read(fz); 72| 213k| while (!cond(x)) ------------------ | Branch (72:12): [True: 23.4k, False: 190k] ------------------ 73| 23.4k| x = read(fz); 74| 190k| return x; 75| 190k|} _Z4readIhERKT_R12fuzzer_input: 64| 331k|{ 65| 331k| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 331k|} flex-vector.cpp:_Z4readIhZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS2_13memory_policyINS2_21free_list_heap_policyINS2_8cpp_heapELm1024EEENS2_15refcount_policyENS2_15spinlock_policyENS2_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaRT_EUlSD_E_ESD_R12fuzzer_inputT0_: 70| 105k|{ 71| 105k| auto x = read(fz); 72| 117k| while (!cond(x)) ------------------ | Branch (72:12): [True: 11.7k, False: 105k] ------------------ 73| 11.7k| x = read(fz); 74| 105k| return x; 75| 105k|} flex-vector.cpp:_Z4readIcZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_EUlS2_E_ES2_R12fuzzer_inputT0_: 70| 282k|{ 71| 282k| auto x = read(fz); 72| 324k| while (!cond(x)) ------------------ | Branch (72:12): [True: 41.9k, False: 282k] ------------------ 73| 41.9k| x = read(fz); 74| 282k| return x; 75| 282k|} _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2IiviEEOT_: 85| 19.3k| : impl_{detail::make(std::forward(arg))} 86| 19.3k| { 87| 19.3k| } _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderC2IJiEEEDpOT_: 47| 19.3k| : value(std::forward(args)...) 48| 19.3k| { 49| 19.3k| } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEcvRKiEv: 142| 19.3k| operator const T&() const { return get(); } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE3getEv: 139| 19.3k| 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| 19.3k| { 132| 19.3k| if (impl_ && impl_->dec()) { ------------------ | Branch (132:13): [True: 19.3k, False: 0] | Branch (132:22): [True: 19.3k, False: 0] ------------------ 133| 19.3k| impl_->~holder(); 134| 19.3k| heap::deallocate(sizeof(holder), impl_); 135| 19.3k| } 136| 19.3k| } _ZN5immer6detail3csl3getINS_15refcount_policyEEEDcRKNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEES3_NS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11impl_data_tENS1_6memberIS3_NS1_7inheritINSC_5applyISA_E4type5owneeEvE4typeEE4typeEE4typeE: 170| 110M| { 171| 110M| return x.get_(type_t{}); 172| 110M| } _ZNK5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11impl_data_tENS1_6memberIS9_NS1_7inheritINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_IS9_EEDcNS1_6type_tIT_EE: 184| 110M| { 185| 110M| return n.get_(t); 186| 110M| } _ZNK5immer6detail3csl6memberINS_15refcount_policyENS1_7inheritINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEvE4typeEE4type4get_ENS1_6type_tIS3_EE: 128| 123M| const T& get_(type_t) const { return d; } _ZN5immer6detail3csl3getINS_15refcount_policyEEEDcRKNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEES3_NS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14relaxed_data_tENS1_6memberIS3_NS1_7inheritINSC_5applyISA_E4type5owneeEvE4typeEE4typeEE4typeE: 170| 13.1M| { 171| 13.1M| return x.get_(type_t{}); 172| 13.1M| } _ZNK5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14relaxed_data_tENS1_6memberIS9_NS1_7inheritINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_IS9_EEDcNS1_6type_tIT_EE: 184| 13.1M| { 185| 13.1M| return n.get_(t); 186| 13.1M| } _ZN5immer6detail3csl3getINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEEEDcRNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyIS7_NS_15refcount_policyENS_15spinlock_policyES3_Lb0ELb1EEELj2ELj2EE14relaxed_data_tENS1_6memberISF_NS1_7inheritISA_vE4typeEE4typeEE4typeE: 165| 12.4M| { 166| 12.4M| return x.get_(type_t{}); 167| 12.4M| } _ZN5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14relaxed_data_tENS1_6memberIS9_NS1_7inheritINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_ISK_EEDcNS1_6type_tIT_EE: 179| 12.4M| { 180| 12.4M| return n.get_(t); 181| 12.4M| } _ZN5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 102| 29.9M| T& get_(type_t) { return *this; } _ZN5immer6detail3csl3getINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEEEDcRNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyIS7_NS_15refcount_policyENS_15spinlock_policyES3_Lb0ELb1EEELj2ELj2EE11impl_data_tENS1_6memberISF_NS1_7inheritISA_vE4typeEE4typeEE4typeE: 165| 17.5M| { 166| 17.5M| return x.get_(type_t{}); 167| 17.5M| } _ZN5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11impl_data_tENS1_6memberIS9_NS1_7inheritINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_ISK_EEDcNS1_6type_tIT_EE: 179| 17.5M| { 180| 17.5M| return n.get_(t); 181| 17.5M| } _ZN5immer6detail3csl3getINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEEEDcRKNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyIS7_NS_15refcount_policyENS_15spinlock_policyES3_Lb0ELb1EEELj2ELj2EE11impl_data_tENS1_6memberISF_NS1_7inheritISA_vE4typeEE4typeEE4typeE: 170| 97.4k| { 171| 97.4k| return x.get_(type_t{}); 172| 97.4k| } _ZNK5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11impl_data_tENS1_6memberIS9_NS1_7inheritINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_ISK_EEDcNS1_6type_tIT_EE: 184| 97.4k| { 185| 97.4k| return n.get_(t); 186| 97.4k| } _ZNK5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 103| 97.4k| const T& get_(type_t) const { return *this; } _ZNK5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENSt3__126random_access_iterator_tagEiRKilPSF_EdeEv: 99| 5.95M| ReferenceT operator*() const { return access_t::dereference(derived()); } _ZN5immer6detail20iterator_core_access11dereferenceIRKNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDcOT_: 22| 5.95M| { 23| 5.95M| return x.dereference(); 24| 5.95M| } _ZNK5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENSt3__126random_access_iterator_tagEiRKilPSF_E7derivedEv: 86| 5.99M| { 87| 5.99M| static_assert(std::is_base_of::value, 88| 5.99M| "must pass a derived thing"); 89| 5.99M| return *static_cast(this); 90| 5.99M| } _ZN5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENSt3__126random_access_iterator_tagEiRKilPSF_EpLEl: 151| 219k| { 152| 219k| access_t::advance(derived(), n); 153| 219k| return derived(); 154| 219k| } _ZN5immer6detail20iterator_core_access7advanceIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEElEEDcOT_T0_: 46| 219k| { 47| 219k| return x.advance(d); 48| 219k| } _ZN5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENSt3__126random_access_iterator_tagEiRKilPSF_E7derivedEv: 92| 9.46M| { 93| 9.46M| static_assert(std::is_base_of::value, 94| 9.46M| "must pass a derived thing"); 95| 9.46M| return *static_cast(this); 96| 9.46M| } _ZN5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENSt3__126random_access_iterator_tagEiRKilPSF_EppEv: 119| 4.51M| { 120| 4.51M| access_t::increment(derived()); 121| 4.51M| return derived(); 122| 4.51M| } _ZN5immer6detail20iterator_core_access9incrementIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDcOT_: 28| 4.51M| { 29| 4.51M| return x.increment(); 30| 4.51M| } _ZNK5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENSt3__126random_access_iterator_tagEiRKilPSF_EplISI_TnNSD_9enable_ifIXsrT_16is_random_accessEbE4typeELb1EEESC_l: 164| 41.8k| { 165| 41.8k| auto tmp = derived(); 166| 41.8k| return tmp += n; 167| 41.8k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE17make_inner_n_intoEPvmj: 213| 2.99M| { 214| 2.99M| assert(n <= branches); ------------------ | Branch (214:9): [True: 2.99M, False: 0] ------------------ 215| 2.99M| assert(size >= sizeof_inner_n(n)); ------------------ | Branch (215:9): [True: 2.99M, False: 0] ------------------ 216| 2.99M| auto p = new (buffer) node_t; 217| 2.99M| p->impl.d.data.inner.relaxed = nullptr; 218| 2.99M|#if IMMER_TAGGED_NODE 219| 2.99M| p->impl.d.kind = node_t::kind_t::inner; 220| 2.99M|#endif 221| 2.99M| return p; 222| 2.99M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14sizeof_inner_nEj: 145| 12.0M| { 146| 12.0M| return keep_headroom ? max_sizeof_inner : sizeof_packed_inner_n(n); ------------------ | Branch (146:16): [True: 12.0M, Folded] ------------------ 147| 12.0M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE3incEv: 956| 29.4M| { 957| 29.4M| refs(this).inc(); 958| 29.4M| return this; 959| 29.4M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4refsEPKSB_: 203| 110M| { 204| 110M| return auto_const_cast(get(x->impl)); 205| 110M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE16make_leaf_n_intoEPvmj: 330| 1.25M| { 331| 1.25M| assert(n <= branches); ------------------ | Branch (331:9): [True: 1.25M, False: 0] ------------------ 332| 1.25M| assert(size >= sizeof_leaf_n(n)); ------------------ | Branch (332:9): [True: 1.25M, False: 0] ------------------ 333| 1.25M| auto p = new (buffer) node_t; 334| 1.25M|#if IMMER_TAGGED_NODE 335| 1.25M| p->impl.d.kind = node_t::kind_t::leaf; 336| 1.25M|#endif 337| 1.25M| return p; 338| 1.25M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13sizeof_leaf_nEj: 160| 5.23M| { 161| 5.23M| return keep_headroom ? max_sizeof_leaf : sizeof_packed_leaf_n(n); ------------------ | Branch (161:16): [True: 5.23M, Folded] ------------------ 162| 5.23M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7relaxedEv: 172| 178M| { 173| 178M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 178M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (173:9): [True: 178M, False: 0] ------------------ 174| 178M| return impl.d.data.inner.relaxed; 175| 178M| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4kindEv: 168| 338M| kind_t kind() const { return impl.d.kind; } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE3decEv: 967| 62.9M| bool dec() const { return refs(this).dec(); } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5innerEv: 184| 116M| { 185| 116M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 116M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (185:9): [True: 116M, False: 0] ------------------ 186| 116M| return impl.d.data.inner.get_storage_ptr(); 187| 116M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14delete_inner_rEPSB_j: 832| 12.5M| { 833| 12.5M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 12.5M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (833:9): [True: 12.5M, False: 0] ------------------ 834| 12.5M| auto r = p->relaxed(); 835| 12.5M| assert(r); ------------------ | Branch (835:9): [True: 12.5M, False: 0] ------------------ 836| 12.5M| static_if([&](auto) { 837| 12.5M| if (node_t::refs(r).dec()) 838| 12.5M| heap::deallocate(node_t::ownee(r).owned() 839| 12.5M| ? node_t::max_sizeof_relaxed 840| 12.5M| : node_t::sizeof_relaxed_n(n), 841| 12.5M| r); 842| 12.5M| }); 843| 12.5M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner_r ------------------ | Branch (843:26): [True: 0, False: 12.5M] ------------------ 844| 12.5M| : node_t::sizeof_inner_r_n(n), 845| 12.5M| p); 846| 12.5M| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14delete_inner_rEPSB_jENKUlT_E_clINS0_7empty_tEEEDaSD_: 836| 12.5M| static_if([&](auto) { 837| 12.5M| if (node_t::refs(r).dec()) ------------------ | Branch (837:17): [True: 12.2M, False: 265k] ------------------ 838| 12.2M| heap::deallocate(node_t::ownee(r).owned() ------------------ | Branch (838:34): [True: 0, False: 12.2M] ------------------ 839| 12.2M| ? node_t::max_sizeof_relaxed 840| 12.2M| : node_t::sizeof_relaxed_n(n), 841| 12.2M| r); 842| 12.5M| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4refsEPKNS0_3csl10member_twoINSB_14relaxed_data_tENSC_6memberIS7_NSC_7inheritINS9_5applyIS6_E4type5owneeEvE4typeEE4typeEE4typeE: 196| 13.1M| { 197| 13.1M| return auto_const_cast(get(*x)); 198| 13.1M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5owneeEPNS0_3csl10member_twoINSB_14relaxed_data_tENSC_6memberIS7_NSC_7inheritINS9_5applyIS6_E4type5owneeEvE4typeEE4typeEE4typeE: 200| 12.4M| static ownee_t& ownee(relaxed_t* x) { return get(*x); } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE16sizeof_relaxed_nEj: 155| 24.4M| { 156| 24.4M| return keep_headroom ? max_sizeof_relaxed : sizeof_packed_relaxed_n(n); ------------------ | Branch (156:16): [True: 24.4M, Folded] ------------------ 157| 24.4M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5owneeEPSB_: 210| 17.5M| static ownee_t& ownee(node_t* x) { return get(x->impl); } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE16sizeof_inner_r_nEj: 150| 25.0M| { 151| 25.0M| return keep_headroom ? max_sizeof_inner_r : sizeof_packed_inner_r_n(n); ------------------ | Branch (151:16): [True: 25.0M, Folded] ------------------ 152| 25.0M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11delete_leafEPSB_j: 861| 1.46M| { 862| 1.46M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::leaf); ------------------ | | 68| 1.46M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (862:9): [True: 1.46M, False: 0] ------------------ 863| 1.46M| detail::destroy_n(p->leaf(), n); 864| 1.46M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_leaf ------------------ | Branch (864:26): [True: 0, False: 1.46M] ------------------ 865| 1.46M| : node_t::sizeof_leaf_n(n), 866| 1.46M| p); 867| 1.46M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4leafEv: 190| 10.6M| { 191| 10.6M| IMMER_ASSERT_TAGGED(kind() == kind_t::leaf); ------------------ | | 68| 10.6M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (191:9): [True: 10.6M, False: 0] ------------------ 192| 10.6M| return impl.d.data.leaf.get_storage_ptr(); 193| 10.6M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12delete_innerEPSB_j: 808| 3.09M| { 809| 3.09M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 3.09M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (809:9): [True: 3.09M, False: 0] ------------------ 810| 3.09M| assert(!p->relaxed()); ------------------ | Branch (810:9): [True: 3.09M, False: 0] ------------------ 811| 3.09M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner ------------------ | Branch (811:26): [True: 0, False: 3.09M] ------------------ 812| 3.09M| : node_t::sizeof_inner_n(n), 813| 3.09M| p); 814| 3.09M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE17copy_leaf_emplaceIiEEPSB_SD_jOT_: 794| 325k| { 795| 325k| auto dst = copy_leaf_n(n + 1, src, n); 796| 325k| IMMER_TRY { ------------------ | | 49| 325k|#define IMMER_TRY try ------------------ 797| 325k| new (dst->leaf() + n) T(std::forward(x)); 798| 325k| } 799| 325k| 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| 325k| return dst; 805| 325k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11copy_leaf_nEjPSB_j: 696| 325k| { 697| 325k| assert(allocn >= n); ------------------ | Branch (697:9): [True: 325k, False: 0] ------------------ 698| 325k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 325k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (698:9): [True: 325k, False: 0] ------------------ 699| 325k| auto dst = make_leaf_n(allocn); 700| 325k| IMMER_TRY { ------------------ | | 49| 325k|#define IMMER_TRY try ------------------ 701| 325k| detail::uninitialized_copy( 702| 325k| src->leaf(), src->leaf() + n, dst->leaf()); 703| 325k| } 704| 325k| 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| 325k| return dst; 709| 325k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_nEj: 341| 1.25M| { 342| 1.25M| assert(n <= branches); ------------------ | Branch (342:9): [True: 1.25M, False: 0] ------------------ 343| 1.25M| auto m = heap::allocate(sizeof_leaf_n(n)); 344| 1.25M| return make_leaf_n_into(m, sizeof_leaf_n(n), n); 345| 1.25M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_nIiEEPSB_jOT_: 470| 119k| { 471| 119k| assert(n >= 1); ------------------ | Branch (471:9): [True: 119k, False: 0] ------------------ 472| 119k| auto p = make_leaf_n(n); 473| 119k| IMMER_TRY { ------------------ | | 49| 119k|#define IMMER_TRY try ------------------ 474| 119k| new (p->leaf()) T(std::forward(x)); 475| 119k| } 476| 119k| 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| 119k| return p; 481| 119k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13do_copy_innerEPSB_SC_j: 558| 2.76M| { 559| 2.76M| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 2.76M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (559:9): [True: 2.76M, False: 0] ------------------ 560| 2.76M| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 2.76M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (560:9): [True: 2.76M, False: 0] ------------------ 561| 2.76M| auto p = src->inner(); 562| 2.76M| inc_nodes(p, n); 563| 2.76M| std::copy(p, p + n, dst->inner()); 564| 2.76M| return dst; 565| 2.76M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9inc_nodesEPPSB_j: 970| 9.62M| { 971| 26.0M| for (auto i = p, e = i + n; i != e; ++i) ------------------ | Branch (971:37): [True: 16.3M, False: 9.62M] ------------------ 972| 16.3M| refs(*i).inc(); 973| 9.62M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14copy_inner_r_nEjPSB_j: 588| 533k| { 589| 533k| assert(allocn >= n); ------------------ | Branch (589:9): [True: 533k, False: 0] ------------------ 590| 533k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 533k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (590:9): [True: 533k, False: 0] ------------------ 591| 533k| auto dst = make_inner_r_n(allocn); 592| 533k| return do_copy_inner_r(dst, src, n); 593| 533k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE15do_copy_inner_rEPSB_SC_j: 610| 555k| { 611| 555k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 555k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (611:9): [True: 555k, False: 0] ------------------ 612| 555k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 555k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (612:9): [True: 555k, False: 0] ------------------ 613| 555k| auto src_r = src->relaxed(); 614| 555k| auto dst_r = dst->relaxed(); 615| 555k| inc_nodes(src->inner(), n); 616| 555k| std::copy(src->inner(), src->inner() + n, dst->inner()); 617| 555k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 618| 555k| dst_r->d.count = n; 619| 555k| return dst; 620| 555k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14make_inner_r_nEj: 243| 12.1M| { 244| 12.1M| assert(n <= branches); ------------------ | Branch (244:9): [True: 12.1M, False: 0] ------------------ 245| 12.1M| auto mp = heap::allocate(sizeof_inner_r_n(n)); 246| 12.1M| auto mr = static_cast(nullptr); 247| 12.1M| if (embed_relaxed) { ------------------ | Branch (247:13): [Folded, False: 12.1M] ------------------ 248| 0| mr = reinterpret_cast(mp) + sizeof_inner_n(n); 249| 12.1M| } else { 250| 12.1M| IMMER_TRY { ------------------ | | 49| 12.1M|#define IMMER_TRY try ------------------ 251| 12.1M| mr = heap::allocate(sizeof_relaxed_n(n), norefs_tag{}); 252| 12.1M| } 253| 12.1M| 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| 12.1M| } 258| 12.1M| auto p = new (mp) node_t; 259| 12.1M| auto r = new (mr) relaxed_t; 260| 12.1M| r->d.count = 0; 261| 12.1M| p->impl.d.data.inner.relaxed = r; 262| 12.1M|#if IMMER_TAGGED_NODE 263| 12.1M| p->impl.d.kind = node_t::kind_t::inner; 264| 12.1M|#endif 265| 12.1M| return p; 266| 12.1M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9make_pathEjPSB_: 498| 764k| { 499| 764k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 764k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (499:9): [True: 764k, False: 0] ------------------ 500| 764k| if (shift == endshift) ------------------ | Branch (500:13): [True: 565k, False: 199k] ------------------ 501| 565k| return node; 502| 199k| else { 503| 199k| auto n = node_t::make_inner_n(1); 504| 199k| IMMER_TRY { ------------------ | | 49| 199k|#define IMMER_TRY try ------------------ 505| 199k| n->inner()[0] = make_path(shift - B, node); 506| 199k| } 507| 199k| 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| 199k| return n; 512| 199k| } 513| 764k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12make_inner_nEj: 224| 2.99M| { 225| 2.99M| assert(n <= branches); ------------------ | Branch (225:9): [True: 2.99M, False: 0] ------------------ 226| 2.99M| auto m = heap::allocate(sizeof_inner_n(n)); 227| 2.99M| return make_inner_n_into(m, sizeof_inner_n(n), n); 228| 2.99M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9copy_leafEPSB_j: 666| 119k| { 667| 119k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 119k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (667:9): [True: 119k, False: 0] ------------------ 668| 119k| auto dst = make_leaf_n(n); 669| 119k| IMMER_TRY { ------------------ | | 49| 119k|#define IMMER_TRY try ------------------ 670| 119k| detail::uninitialized_copy( 671| 119k| src->leaf(), src->leaf() + n, dst->leaf()); 672| 119k| } 673| 119k| 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| 119k| return dst; 678| 119k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE15make_inner_sr_nEjPNS0_3csl10member_twoINSB_14relaxed_data_tENSC_6memberIS7_NSC_7inheritINS9_5applyIS6_E4type5owneeEvE4typeEE4typeEE4typeE: 269| 274k| { 270| 274k| return static_if( 271| 274k| [&](auto) { return node_t::make_inner_r_n(n); }, 272| 274k| [&](auto) { 273| 274k| auto p = 274| 274k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 274k| assert(r->d.count >= n); 276| 274k| node_t::refs(r).inc(); 277| 274k| p->impl.d.data.inner.relaxed = r; 278| 274k|#if IMMER_TAGGED_NODE 279| 274k| p->impl.d.kind = node_t::kind_t::inner; 280| 274k|#endif 281| 274k| return p; 282| 274k| }); 283| 274k| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE15make_inner_sr_nEjPNS0_3csl10member_twoINSB_14relaxed_data_tENSC_6memberIS7_NSC_7inheritINS9_5applyIS6_E4type5owneeEvE4typeEE4typeEE4typeEENKUlT_E0_clINS0_7empty_tEEEDaSS_: 272| 274k| [&](auto) { 273| 274k| auto p = 274| 274k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 274k| assert(r->d.count >= n); ------------------ | Branch (275:17): [True: 274k, False: 0] ------------------ 276| 274k| node_t::refs(r).inc(); 277| 274k| p->impl.d.data.inner.relaxed = r; 278| 274k|#if IMMER_TAGGED_NODE 279| 274k| p->impl.d.kind = node_t::kind_t::inner; 280| 274k|#endif 281| 274k| return p; 282| 274k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE24do_copy_inner_replace_srEPSB_SC_jjSC_: 652| 274k| { 653| 274k| if (embed_relaxed) ------------------ | Branch (653:13): [Folded, False: 274k] ------------------ 654| 0| return do_copy_inner_replace_r(dst, src, n, offset, child); 655| 274k| else { 656| 274k| auto p = src->inner(); 657| 274k| inc_nodes(p, offset); 658| 274k| inc_nodes(p + offset + 1, n - offset - 1); 659| 274k| std::copy(p, p + n, dst->inner()); 660| 274k| dst->inner()[offset] = child; 661| 274k| return dst; 662| 274k| } 663| 274k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE21do_copy_inner_replaceEPSB_SC_jjSC_: 569| 49.0k| { 570| 49.0k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 49.0k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (570:9): [True: 49.0k, False: 0] ------------------ 571| 49.0k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 49.0k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (571:9): [True: 49.0k, False: 0] ------------------ 572| 49.0k| auto p = src->inner(); 573| 49.0k| inc_nodes(p, offset); 574| 49.0k| inc_nodes(p + offset + 1, n - offset - 1); 575| 49.0k| std::copy(p, p + n, dst->inner()); 576| 49.0k| dst->inner()[offset] = child; 577| 49.0k| return dst; 578| 49.0k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12copy_inner_nEjPSB_j: 543| 9.09k| { 544| 9.09k| assert(allocn >= n); ------------------ | Branch (544:9): [True: 9.09k, False: 0] ------------------ 545| 9.09k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 9.09k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (545:9): [True: 9.09k, False: 0] ------------------ 546| 9.09k| auto dst = make_inner_n(allocn); 547| 9.09k| return do_copy_inner(dst, src, n); 548| 9.09k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12copy_inner_rEPSB_j: 581| 4.88k| { 582| 4.88k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 4.88k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (582:9): [True: 4.88k, False: 0] ------------------ 583| 4.88k| auto dst = make_inner_r_n(n); 584| 4.88k| return do_copy_inner_r(dst, src, n); 585| 4.88k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13compute_shiftEv: 977| 5.45M| { 978| 5.45M| if (kind() == kind_t::leaf) ------------------ | Branch (978:13): [True: 463k, False: 4.99M] ------------------ 979| 463k| return endshift; 980| 4.99M| else 981| 4.99M| return B + inner()[0]->compute_shift(); 982| 5.45M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5checkEjm: 986| 463k| { 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| 463k| return true; 1023| 463k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9copy_leafEPSB_jj: 778| 338k| { 779| 338k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 338k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (779:9): [True: 338k, False: 0] ------------------ 780| 338k| auto dst = make_leaf_n(last - idx); 781| 338k| IMMER_TRY { ------------------ | | 49| 338k|#define IMMER_TRY try ------------------ 782| 338k| detail::uninitialized_copy( 783| 338k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 784| 338k| } 785| 338k| 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| 338k| return dst; 790| 338k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9copy_leafEPSB_jSC_j: 712| 327k| { 713| 327k| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 327k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (713:9): [True: 327k, False: 0] ------------------ 714| 327k| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 327k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (714:9): [True: 327k, False: 0] ------------------ 715| 327k| auto dst = make_leaf_n(n1 + n2); 716| 327k| IMMER_TRY { ------------------ | | 49| 327k|#define IMMER_TRY try ------------------ 717| 327k| detail::uninitialized_copy( 718| 327k| src1->leaf(), src1->leaf() + n1, dst->leaf()); 719| 327k| } 720| 327k| 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| 327k| IMMER_TRY { ------------------ | | 49| 327k|#define IMMER_TRY try ------------------ 725| 327k| detail::uninitialized_copy( 726| 327k| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 727| 327k| } 728| 327k| 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| 327k| return dst; 734| 327k| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10can_mutateENS9_5applyIS6_E4type4editE: 870| 1.90M| { 871| 1.90M| return refs(this).unique() || ownee(this).can_mutate(e); ------------------ | Branch (871:16): [True: 1.80M, False: 97.4k] | Branch (871:39): [True: 0, False: 97.4k] ------------------ 872| 1.90M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5owneeEPKSB_: 207| 97.4k| { 208| 97.4k| return get(x->impl); 209| 97.4k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_j: 681| 32.0k| { 682| 32.0k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 32.0k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (682:9): [True: 32.0k, False: 0] ------------------ 683| 32.0k| auto dst = make_leaf_e(e); 684| 32.0k| IMMER_TRY { ------------------ | | 49| 32.0k|#define IMMER_TRY try ------------------ 685| 32.0k| detail::uninitialized_copy( 686| 32.0k| src->leaf(), src->leaf() + n, dst->leaf()); 687| 32.0k| } 688| 32.0k| 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| 32.0k| return dst; 693| 32.0k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_eENS9_5applyIS6_E4type4editE: 348| 215k| { 349| 215k| auto p = new (heap::allocate(max_sizeof_leaf)) node_t; 350| 215k| ownee(p) = e; 351| 215k|#if IMMER_TAGGED_NODE 352| 215k| p->impl.d.kind = node_t::kind_t::leaf; 353| 215k|#endif 354| 215k| return p; 355| 215k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_eIiEEPSB_NS9_5applyIS6_E4type4editEOT_: 485| 13.2k| { 486| 13.2k| auto p = make_leaf_e(e); 487| 13.2k| IMMER_TRY { ------------------ | | 49| 13.2k|#define IMMER_TRY try ------------------ 488| 13.2k| new (p->leaf()) T(std::forward(x)); 489| 13.2k| } 490| 13.2k| 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| 13.2k| return p; 495| 13.2k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEj: 930| 69.1k| { 931| 69.1k| auto src_r = relaxed(); 932| 69.1k| return static_if( 933| 69.1k| [&](auto) { return src_r; }, 934| 69.1k| [&](auto) { 935| 69.1k| if (node_t::refs(src_r).unique() || 936| 69.1k| node_t::ownee(src_r).can_mutate(e)) 937| 69.1k| return src_r; 938| 69.1k| else { 939| 69.1k| auto dst_r = 940| 69.1k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 69.1k| if (src_r) { 942| 69.1k| std::copy( 943| 69.1k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 69.1k| if (node_t::refs(src_r).dec()) 945| 69.1k| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 69.1k| src_r); 947| 69.1k| } 948| 69.1k| dst_r->d.count = n; 949| 69.1k| node_t::ownee(dst_r) = e; 950| 69.1k| return impl.d.data.inner.relaxed = dst_r; 951| 69.1k| } 952| 69.1k| }); 953| 69.1k| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEjENKUlT_E0_clINS0_7empty_tEEEDaSG_: 934| 69.1k| [&](auto) { 935| 69.1k| if (node_t::refs(src_r).unique() || ------------------ | Branch (935:21): [True: 55.5k, False: 13.5k] ------------------ 936| 13.5k| node_t::ownee(src_r).can_mutate(e)) ------------------ | Branch (936:21): [True: 0, False: 13.5k] ------------------ 937| 55.5k| return src_r; 938| 13.5k| else { 939| 13.5k| auto dst_r = 940| 13.5k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 13.5k| if (src_r) { ------------------ | Branch (941:25): [True: 13.5k, False: 0] ------------------ 942| 13.5k| std::copy( 943| 13.5k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 13.5k| if (node_t::refs(src_r).dec()) ------------------ | Branch (944:29): [True: 0, False: 13.5k] ------------------ 945| 0| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 0| src_r); 947| 13.5k| } 948| 13.5k| dst_r->d.count = n; 949| 13.5k| node_t::ownee(dst_r) = e; 950| 13.5k| return impl.d.data.inner.relaxed = dst_r; 951| 13.5k| } 952| 69.1k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14copy_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_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14make_inner_r_eENS9_5applyIS6_E4type4editE: 286| 98.7k| { 287| 98.7k| auto mp = heap::allocate(max_sizeof_inner_r); 288| 98.7k| auto mr = static_cast(nullptr); 289| 98.7k| if (embed_relaxed) { ------------------ | Branch (289:13): [Folded, False: 98.7k] ------------------ 290| 0| mr = reinterpret_cast(mp) + max_sizeof_inner; 291| 98.7k| } else { 292| 98.7k| IMMER_TRY { ------------------ | | 49| 98.7k|#define IMMER_TRY try ------------------ 293| 98.7k| mr = heap::allocate(max_sizeof_relaxed, norefs_tag{}); 294| 98.7k| } 295| 98.7k| IMMER_CATCH (...) { 296| 0| heap::deallocate(max_sizeof_inner_r, mp); 297| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 298| 0| } 299| 98.7k| } 300| 98.7k| auto p = new (mp) node_t; 301| 98.7k| auto r = new (mr) relaxed_t; 302| 98.7k| ownee(p) = e; 303| 98.7k| static_if([&](auto) { node_t::ownee(r) = e; }); 304| 98.7k| r->d.count = 0; 305| 98.7k| p->impl.d.data.inner.relaxed = r; 306| 98.7k|#if IMMER_TAGGED_NODE 307| 98.7k| p->impl.d.kind = node_t::kind_t::inner; 308| 98.7k|#endif 309| 98.7k| return p; 310| 98.7k| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14make_inner_r_eENS9_5applyIS6_E4type4editEENKUlT_E_clINS0_7empty_tEEEDaSG_: 303| 98.7k| static_if([&](auto) { node_t::ownee(r) = e; }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_path_eENS9_5applyIS6_E4type4editEjPSB_: 516| 288k| { 517| 288k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 288k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (517:9): [True: 288k, False: 0] ------------------ 518| 288k| if (shift == endshift) ------------------ | Branch (518:13): [True: 215k, False: 72.9k] ------------------ 519| 215k| return node; 520| 72.9k| else { 521| 72.9k| auto n = node_t::make_inner_e(e); 522| 72.9k| IMMER_TRY { ------------------ | | 49| 72.9k|#define IMMER_TRY try ------------------ 523| 72.9k| n->inner()[0] = make_path_e(e, shift - B, node); 524| 72.9k| } 525| 72.9k| 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| 72.9k| return n; 530| 72.9k| } 531| 288k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12make_inner_eENS9_5applyIS6_E4type4editE: 231| 97.9k| { 232| 97.9k| auto m = heap::allocate(max_sizeof_inner); 233| 97.9k| auto p = new (m) node_t; 234| 97.9k| ownee(p) = e; 235| 97.9k| p->impl.d.data.inner.relaxed = nullptr; 236| 97.9k|#if IMMER_TAGGED_NODE 237| 97.9k| p->impl.d.kind = node_t::kind_t::inner; 238| 97.9k|#endif 239| 97.9k| return p; 240| 97.9k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12copy_inner_eENS9_5applyIS6_E4type4editEPSB_j: 551| 16.2k| { 552| 16.2k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 16.2k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (552:9): [True: 16.2k, False: 0] ------------------ 553| 16.2k| auto dst = make_inner_e(e); 554| 16.2k| return do_copy_inner(dst, src, n); 555| 16.2k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE15copy_inner_sr_eENS9_5applyIS6_E4type4editEPSB_j: 603| 13.0k| { 604| 13.0k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 13.0k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (604:9): [True: 13.0k, False: 0] ------------------ 605| 13.0k| auto dst = make_inner_sr_e(e, src->relaxed()); 606| 13.0k| return do_copy_inner_sr(dst, src, n); 607| 13.0k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE15make_inner_sr_eENS9_5applyIS6_E4type4editEPNS0_3csl10member_twoINSB_14relaxed_data_tENSG_6memberIS7_NSG_7inheritINSE_5owneeEvE4typeEE4typeEE4typeE: 313| 13.0k| { 314| 13.0k| return static_if( 315| 13.0k| [&](auto) { return node_t::make_inner_r_e(e); }, 316| 13.0k| [&](auto) { 317| 13.0k| auto p = 318| 13.0k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 13.0k| node_t::refs(r).inc(); 320| 13.0k| p->impl.d.data.inner.relaxed = r; 321| 13.0k| node_t::ownee(p) = e; 322| 13.0k|#if IMMER_TAGGED_NODE 323| 13.0k| p->impl.d.kind = node_t::kind_t::inner; 324| 13.0k|#endif 325| 13.0k| return p; 326| 13.0k| }); 327| 13.0k| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE15make_inner_sr_eENS9_5applyIS6_E4type4editEPNS0_3csl10member_twoINSB_14relaxed_data_tENSG_6memberIS7_NSG_7inheritINSE_5owneeEvE4typeEE4typeEE4typeEENKUlT_E0_clINS0_7empty_tEEEDaST_: 316| 13.0k| [&](auto) { 317| 13.0k| auto p = 318| 13.0k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 13.0k| node_t::refs(r).inc(); 320| 13.0k| p->impl.d.data.inner.relaxed = r; 321| 13.0k| node_t::ownee(p) = e; 322| 13.0k|#if IMMER_TAGGED_NODE 323| 13.0k| p->impl.d.kind = node_t::kind_t::inner; 324| 13.0k|#endif 325| 13.0k| return p; 326| 13.0k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE16do_copy_inner_srEPSB_SC_j: 640| 13.0k| { 641| 13.0k| if (embed_relaxed) ------------------ | Branch (641:13): [Folded, False: 13.0k] ------------------ 642| 0| return do_copy_inner_r(dst, src, n); 643| 13.0k| else { 644| 13.0k| inc_nodes(src->inner(), n); 645| 13.0k| std::copy(src->inner(), src->inner() + n, dst->inner()); 646| 13.0k| return dst; 647| 13.0k| } 648| 13.0k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jj: 763| 170k| { 764| 170k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 170k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (764:9): [True: 170k, False: 0] ------------------ 765| 170k| auto dst = make_leaf_e(e); 766| 170k| IMMER_TRY { ------------------ | | 49| 170k|#define IMMER_TRY try ------------------ 767| 170k| detail::uninitialized_copy( 768| 170k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 769| 170k| } 770| 170k| IMMER_CATCH (...) { 771| 0| heap::deallocate(max_sizeof_leaf, dst); 772| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 773| 0| } 774| 170k| return dst; 775| 170k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE22ensure_mutable_relaxedENS9_5applyIS6_E4type4editE: 877| 201k| { 878| 201k| auto src_r = relaxed(); 879| 201k| return static_if( 880| 201k| [&](auto) { return src_r; }, 881| 201k| [&](auto) { 882| 201k| if (node_t::refs(src_r).unique() || 883| 201k| node_t::ownee(src_r).can_mutate(e)) 884| 201k| return src_r; 885| 201k| else { 886| 201k| auto dst_r = impl.d.data.inner.relaxed = 887| 201k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 201k| if (src_r) { 889| 201k| auto n = dst_r->d.count = src_r->d.count; 890| 201k| std::copy( 891| 201k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 201k| if (node_t::refs(src_r).dec()) 893| 201k| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 201k| src_r); 895| 201k| } 896| 201k| node_t::ownee(dst_r) = e; 897| 201k| return dst_r; 898| 201k| } 899| 201k| }); 900| 201k| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE22ensure_mutable_relaxedENS9_5applyIS6_E4type4editEENKUlT_E0_clINS0_7empty_tEEEDaSG_: 881| 201k| [&](auto) { 882| 201k| if (node_t::refs(src_r).unique() || ------------------ | Branch (882:21): [True: 193k, False: 8.42k] ------------------ 883| 8.42k| node_t::ownee(src_r).can_mutate(e)) ------------------ | Branch (883:21): [True: 0, False: 8.42k] ------------------ 884| 193k| return src_r; 885| 8.42k| else { 886| 8.42k| auto dst_r = impl.d.data.inner.relaxed = 887| 8.42k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 8.42k| if (src_r) { ------------------ | Branch (888:25): [True: 8.42k, False: 0] ------------------ 889| 8.42k| auto n = dst_r->d.count = src_r->d.count; 890| 8.42k| std::copy( 891| 8.42k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 8.42k| if (node_t::refs(src_r).dec()) ------------------ | Branch (892:29): [True: 0, False: 8.42k] ------------------ 893| 0| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 0| src_r); 895| 8.42k| } 896| 8.42k| node_t::ownee(dst_r) = e; 897| 8.42k| return dst_r; 898| 8.42k| } 899| 201k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jSG_j: 738| 268| { 739| 268| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 268|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (739:9): [True: 268, False: 0] ------------------ 740| 268| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 268|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (740:9): [True: 268, False: 0] ------------------ 741| 268| auto dst = make_leaf_e(e); 742| 268| IMMER_TRY { ------------------ | | 49| 268|#define IMMER_TRY try ------------------ 743| 268| detail::uninitialized_copy( 744| 268| src1->leaf(), src1->leaf() + n1, dst->leaf()); 745| 268| } 746| 268| IMMER_CATCH (...) { 747| 0| heap::deallocate(max_sizeof_leaf, dst); 748| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 749| 0| } 750| 268| IMMER_TRY { ------------------ | | 49| 268|#define IMMER_TRY try ------------------ 751| 268| detail::uninitialized_copy( 752| 268| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 753| 268| } 754| 268| 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| 268| return dst; 760| 268| } _ZN5immer6detail4rbts11dec_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 523| 38.2M| { 524| 38.2M| using node_t = node_type; 525| 38.2M| auto node = p.node(); 526| 38.2M| if (node->dec()) { ------------------ | Branch (526:13): [True: 12.5M, False: 25.7M] ------------------ 527| 12.5M| p.each(this_t{}); 528| 12.5M| node_t::delete_inner_r(node, p.count()); 529| 12.5M| } 530| 38.2M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 534| 2.68M| { 535| 2.68M| using node_t = node_type; 536| 2.68M| auto node = p.node(); 537| 2.68M| if (node->dec()) { ------------------ | Branch (537:13): [True: 596k, False: 2.09M] ------------------ 538| 596k| p.each(this_t{}); 539| 596k| node_t::delete_inner(node, p.count()); 540| 596k| } 541| 2.68M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 545| 1.22M| { 546| 1.22M| using node_t = node_type; 547| 1.22M| auto node = p.node(); 548| 1.22M| if (node->dec()) { ------------------ | Branch (548:13): [True: 550k, False: 674k] ------------------ 549| 550k| node_t::delete_leaf(node, p.count()); 550| 550k| } 551| 1.22M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 545| 474k| { 546| 474k| using node_t = node_type; 547| 474k| auto node = p.node(); 548| 474k| if (node->dec()) { ------------------ | Branch (548:13): [True: 21.0k, False: 453k] ------------------ 549| 21.0k| node_t::delete_leaf(node, p.count()); 550| 21.0k| } 551| 474k| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 534| 3.44M| { 535| 3.44M| using node_t = node_type; 536| 3.44M| auto node = p.node(); 537| 3.44M| if (node->dec()) { ------------------ | Branch (537:13): [True: 237k, False: 3.20M] ------------------ 538| 237k| p.each(this_t{}); 539| 237k| node_t::delete_inner(node, p.count()); 540| 237k| } 541| 3.44M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 534| 2.37M| { 535| 2.37M| using node_t = node_type; 536| 2.37M| auto node = p.node(); 537| 2.37M| if (node->dec()) { ------------------ | Branch (537:13): [True: 2.24M, False: 137k] ------------------ 538| 2.24M| p.each(this_t{}); 539| 2.24M| node_t::delete_inner(node, p.count()); 540| 2.24M| } 541| 2.37M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 534| 1.71M| { 535| 1.71M| using node_t = node_type; 536| 1.71M| auto node = p.node(); 537| 1.71M| if (node->dec()) { ------------------ | Branch (537:13): [True: 0, False: 1.71M] ------------------ 538| 0| p.each(this_t{}); 539| 0| node_t::delete_inner(node, p.count()); 540| 0| } 541| 1.71M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 545| 11.0M| { 546| 11.0M| using node_t = node_type; 547| 11.0M| auto node = p.node(); 548| 11.0M| if (node->dec()) { ------------------ | Branch (548:13): [True: 898k, False: 10.1M] ------------------ 549| 898k| node_t::delete_leaf(node, p.count()); 550| 898k| } 551| 11.0M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 545| 1.62M| { 546| 1.62M| using node_t = node_type; 547| 1.62M| auto node = p.node(); 548| 1.62M| if (node->dec()) { ------------------ | Branch (548:13): [True: 0, False: 1.62M] ------------------ 549| 0| node_t::delete_leaf(node, p.count()); 550| 0| } 551| 1.62M| } _ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_relaxedIRNS1_11relaxed_posISC_EEEEPSC_OT_SI_j: 791| 528k| { 792| 528k| auto level = pos.shift(); 793| 528k| auto idx = pos.count() - 1; 794| 528k| auto children = pos.size(idx); 795| 528k| auto new_idx = 796| 528k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (796:13): [True: 13.5k, False: 514k] | Branch (796:47): [True: 767, False: 514k] ------------------ 797| 528k| auto new_child = static_cast(nullptr); 798| 528k| if (new_idx >= branches) ------------------ | Branch (798:13): [True: 4.68k, False: 523k] ------------------ 799| 4.68k| return nullptr; 800| 523k| else if (idx == new_idx) { ------------------ | Branch (800:18): [True: 514k, False: 9.62k] ------------------ 801| 514k| new_child = pos.last_oh_csh(this_t{}, idx, children, tail, ts); 802| 514k| if (!new_child) { ------------------ | Branch (802:17): [True: 3.80k, False: 510k] ------------------ 803| 3.80k| if (++new_idx < branches) ------------------ | Branch (803:21): [True: 2.65k, False: 1.15k] ------------------ 804| 2.65k| new_child = node_t::make_path(level - B, tail); 805| 1.15k| else 806| 1.15k| return nullptr; 807| 3.80k| } 808| 514k| } else 809| 9.62k| new_child = node_t::make_path(level - B, tail); 810| 522k| IMMER_TRY { ------------------ | | 49| 522k|#define IMMER_TRY try ------------------ 811| 522k| auto count = new_idx + 1; 812| 522k| auto new_parent = 813| 522k| node_t::copy_inner_r_n(count, pos.node(), new_idx); 814| 522k| auto new_relaxed = new_parent->relaxed(); 815| 522k| new_parent->inner()[new_idx] = new_child; 816| 522k| new_relaxed->d.sizes[new_idx] = pos.size() + ts; 817| 522k| new_relaxed->d.count = count; 818| 522k| assert(new_relaxed->d.sizes[new_idx]); ------------------ | Branch (818:13): [True: 522k, False: 0] ------------------ 819| 522k| return new_parent; 820| 522k| } 821| 522k| 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| 522k| } _ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_regularIRNS1_15regular_sub_posISC_EEJRjEEEPSC_OT_SJ_DpOT0_: 834| 216k| { 835| 216k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 216k, False: 0] ------------------ 836| 216k| auto idx = pos.index(pos.size() - 1); 837| 216k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 216k| auto count = new_idx + 1; 839| 216k| auto new_parent = node_t::make_inner_n(count); 840| 216k| IMMER_TRY { ------------------ | | 49| 216k|#define IMMER_TRY try ------------------ 841| 216k| new_parent->inner()[new_idx] = 842| 216k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 207k, False: 8.57k] ------------------ 843| | /* otherwise */ 844| 216k| : node_t::make_path(pos.shift() - B, tail); 845| 216k| } 846| 216k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 216k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 216k| } _ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_regularIRNS1_11regular_posISC_EEJEEEPSC_OT_SI_DpOT0_: 834| 2.20M| { 835| 2.20M| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 2.20M, False: 0] ------------------ 836| 2.20M| auto idx = pos.index(pos.size() - 1); 837| 2.20M| auto new_idx = pos.index(pos.size() + branches - 1); 838| 2.20M| auto count = new_idx + 1; 839| 2.20M| auto new_parent = node_t::make_inner_n(count); 840| 2.20M| IMMER_TRY { ------------------ | | 49| 2.20M|#define IMMER_TRY try ------------------ 841| 2.20M| new_parent->inner()[new_idx] = 842| 2.20M| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 1.68M, False: 511k] ------------------ 843| | /* otherwise */ 844| 2.20M| : node_t::make_path(pos.shift() - B, tail); 845| 2.20M| } 846| 2.20M| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 2.20M| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 2.20M| } _ZN5immer6detail4rbts9dec_innerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEvPT_jm: 562| 526|{ 563| 526| visit_maybe_relaxed_sub(node, shift, size, dec_visitor()); 564| 526|} _ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_regularIRNS1_15regular_sub_posISC_EEJEEEPSC_OT_SI_DpOT0_: 834| 318k| { 835| 318k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 318k, False: 0] ------------------ 836| 318k| auto idx = pos.index(pos.size() - 1); 837| 318k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 318k| auto count = new_idx + 1; 839| 318k| auto new_parent = node_t::make_inner_n(count); 840| 318k| IMMER_TRY { ------------------ | | 49| 318k|#define IMMER_TRY try ------------------ 841| 318k| new_parent->inner()[new_idx] = 842| 318k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 303k, False: 15.4k] ------------------ 843| | /* otherwise */ 844| 318k| : node_t::make_path(pos.shift() - B, tail); 845| 318k| } 846| 318k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 318k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 318k| } flex-vector.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 502| 83.2k| { 503| 83.2k| auto offset = pos.index(idx); 504| 83.2k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 83.2k| IMMER_TRY { ------------------ | | 49| 83.2k|#define IMMER_TRY try ------------------ 506| 83.2k| node->leaf()[offset] = 507| 83.2k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 83.2k| return node; 509| 83.2k| } 510| 83.2k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 83.2k| } flex-vector.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_relaxedIRNS1_11relaxed_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 466| 274k| { 467| 274k| auto offset = pos.index(idx); 468| 274k| auto count = pos.count(); 469| 274k| auto node = node_t::make_inner_sr_n(count, pos.relaxed()); 470| 274k| IMMER_TRY { ------------------ | | 49| 274k|#define IMMER_TRY try ------------------ 471| 274k| auto child = pos.towards_oh(this_t{}, idx, offset, fn); 472| 274k| node_t::do_copy_inner_replace_sr( 473| 274k| node, pos.node(), count, offset, child); 474| 274k| return node; 475| 274k| } 476| 274k| IMMER_CATCH (...) { 477| 0| node_t::delete_inner_r(node, count); 478| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 479| 0| } 480| 274k| } flex-vector.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_regularIRNS1_15regular_sub_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 484| 25.9k| { 485| 25.9k| auto offset = pos.index(idx); 486| 25.9k| auto count = pos.count(); 487| 25.9k| auto node = node_t::make_inner_n(count); 488| 25.9k| IMMER_TRY { ------------------ | | 49| 25.9k|#define IMMER_TRY try ------------------ 489| 25.9k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 25.9k| node_t::do_copy_inner_replace( 491| 25.9k| node, pos.node(), count, offset, child); 492| 25.9k| return node; 493| 25.9k| } 494| 25.9k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 25.9k| } flex-vector.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_13full_leaf_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 502| 22.0k| { 503| 22.0k| auto offset = pos.index(idx); 504| 22.0k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 22.0k| IMMER_TRY { ------------------ | | 49| 22.0k|#define IMMER_TRY try ------------------ 506| 22.0k| node->leaf()[offset] = 507| 22.0k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 22.0k| return node; 509| 22.0k| } 510| 22.0k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 22.0k| } flex-vector.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_regularIRNS1_8full_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 484| 18.1k| { 485| 18.1k| auto offset = pos.index(idx); 486| 18.1k| auto count = pos.count(); 487| 18.1k| auto node = node_t::make_inner_n(count); 488| 18.1k| IMMER_TRY { ------------------ | | 49| 18.1k|#define IMMER_TRY try ------------------ 489| 18.1k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 18.1k| node_t::do_copy_inner_replace( 491| 18.1k| node, pos.node(), count, offset, child); 492| 18.1k| return node; 493| 18.1k| } 494| 18.1k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 18.1k| } flex-vector.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_8leaf_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 502| 3.94k| { 503| 3.94k| auto offset = pos.index(idx); 504| 3.94k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 3.94k| IMMER_TRY { ------------------ | | 49| 3.94k|#define IMMER_TRY try ------------------ 506| 3.94k| node->leaf()[offset] = 507| 3.94k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 3.94k| return node; 509| 3.94k| } 510| 3.94k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 3.94k| } flex-vector.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_regularIRNS1_11regular_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 484| 4.90k| { 485| 4.90k| auto offset = pos.index(idx); 486| 4.90k| auto count = pos.count(); 487| 4.90k| auto node = node_t::make_inner_n(count); 488| 4.90k| IMMER_TRY { ------------------ | | 49| 4.90k|#define IMMER_TRY try ------------------ 489| 4.90k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 4.90k| node_t::do_copy_inner_replace( 491| 4.90k| node, pos.node(), count, offset, child); 492| 4.90k| return node; 493| 4.90k| } 494| 4.90k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 4.90k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1096| 37.0k| { 1097| 37.0k| auto idx = pos.index(last); 1098| 37.0k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [True: 37.0k, Folded] | Branch (1098:25): [True: 28.0k, False: 8.98k] ------------------ 1099| 28.0k| return pos.towards_oh(this_t{}, last, idx); 1100| 28.0k| } else { 1101| 8.98k| using std::get; 1102| 8.98k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 8.98k| auto next = get<1>(subs); 1104| 8.98k| auto ts = get<2>(subs); 1105| 8.98k| auto tail = get<3>(subs); 1106| 8.98k| IMMER_TRY { ------------------ | | 49| 8.98k|#define IMMER_TRY try ------------------ 1107| 8.98k| if (next) { ------------------ | Branch (1107:21): [True: 5.18k, False: 3.80k] ------------------ 1108| 5.18k| auto count = idx + 1; 1109| 5.18k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 5.18k| auto newr = newn->relaxed(); 1111| 5.18k| newn->inner()[idx] = next; 1112| 5.18k| newr->d.sizes[idx] = last + 1 - ts; 1113| 5.18k| newr->d.count = count; 1114| 5.18k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 5.18k, False: 0] ------------------ 1115| 5.18k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 5.18k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 0, False: 3.80k] ------------------ 1117| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 3.80k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [True: 3.80k, Folded] | Branch (1118:40): [True: 2.83k, False: 968] | Branch (1118:52): [True: 1.91k, False: 922] ------------------ 1119| 1.91k| auto newn = pos.node()->inner()[0]; 1120| 1.91k| return std::make_tuple( 1121| 1.91k| pos.shift() - B, newn->inc(), ts, tail); 1122| 1.91k| } else { 1123| 1.89k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 1.89k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 1.89k| } 1126| 8.98k| } 1127| 8.98k| 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| 8.98k| } 1138| 37.0k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 2.27k| { 1182| 2.27k| auto old_tail_size = pos.count(); 1183| 2.27k| auto new_tail_size = pos.index(last) + 1; 1184| 2.27k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.04k, False: 1.23k] ------------------ 1185| 2.27k| ? pos.node()->inc() 1186| 2.27k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 2.27k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 2.27k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 5.23k| { 1182| 5.23k| auto old_tail_size = pos.count(); 1183| 5.23k| auto new_tail_size = pos.index(last) + 1; 1184| 5.23k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 2.13k, False: 3.09k] ------------------ 1185| 5.23k| ? pos.node()->inc() 1186| 5.23k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 5.23k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 5.23k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1096| 11.2k| { 1097| 11.2k| auto idx = pos.index(last); 1098| 11.2k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [Folded, False: 11.2k] | Branch (1098:25): [True: 0, False: 0] ------------------ 1099| 0| return pos.towards_oh(this_t{}, last, idx); 1100| 11.2k| } else { 1101| 11.2k| using std::get; 1102| 11.2k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 11.2k| auto next = get<1>(subs); 1104| 11.2k| auto ts = get<2>(subs); 1105| 11.2k| auto tail = get<3>(subs); 1106| 11.2k| IMMER_TRY { ------------------ | | 49| 11.2k|#define IMMER_TRY try ------------------ 1107| 11.2k| if (next) { ------------------ | Branch (1107:21): [True: 5.82k, False: 5.38k] ------------------ 1108| 5.82k| auto count = idx + 1; 1109| 5.82k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 5.82k| auto newr = newn->relaxed(); 1111| 5.82k| newn->inner()[idx] = next; 1112| 5.82k| newr->d.sizes[idx] = last + 1 - ts; 1113| 5.82k| newr->d.count = count; 1114| 5.82k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 5.82k, False: 0] ------------------ 1115| 5.82k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 5.82k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 2.39k, False: 2.99k] ------------------ 1117| 2.39k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 2.99k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [Folded, False: 2.99k] | 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| 2.99k| } else { 1123| 2.99k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 2.99k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 2.99k| } 1126| 11.2k| } 1127| 11.2k| 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| 11.2k| } 1138| 11.2k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 3.75k| { 1143| 3.75k| auto idx = pos.index(last); 1144| 3.75k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 3.75k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 3.75k| } else { 1147| 3.75k| using std::get; 1148| 3.75k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 3.75k| auto next = get<1>(subs); 1150| 3.75k| auto ts = get<2>(subs); 1151| 3.75k| auto tail = get<3>(subs); 1152| 3.75k| IMMER_TRY { ------------------ | | 49| 3.75k|#define IMMER_TRY try ------------------ 1153| 3.75k| if (next) { ------------------ | Branch (1153:21): [True: 1.56k, False: 2.19k] ------------------ 1154| 1.56k| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 1.56k| newn->inner()[idx] = next; 1156| 1.56k| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.19k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 1.56k, False: 633] ------------------ 1158| 1.56k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.56k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 633] | 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| 633| } else { 1164| 633| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 633| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 633| } 1167| 3.75k| } 1168| 3.75k| 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.75k| } 1177| 3.75k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 5.83k| { 1182| 5.83k| auto old_tail_size = pos.count(); 1183| 5.83k| auto new_tail_size = pos.index(last) + 1; 1184| 5.83k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 3.87k, False: 1.96k] ------------------ 1185| 5.83k| ? pos.node()->inc() 1186| 5.83k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 5.83k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 5.83k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 2.44k| { 1143| 2.44k| auto idx = pos.index(last); 1144| 2.44k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.44k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.44k| } else { 1147| 2.44k| using std::get; 1148| 2.44k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.44k| auto next = get<1>(subs); 1150| 2.44k| auto ts = get<2>(subs); 1151| 2.44k| auto tail = get<3>(subs); 1152| 2.44k| IMMER_TRY { ------------------ | | 49| 2.44k|#define IMMER_TRY try ------------------ 1153| 2.44k| if (next) { ------------------ | Branch (1153:21): [True: 348, False: 2.10k] ------------------ 1154| 348| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 348| newn->inner()[idx] = next; 1156| 348| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.10k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 1.12k, False: 980] ------------------ 1158| 1.12k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.12k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 980] | 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| 980| } else { 1164| 980| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 980| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 980| } 1167| 2.44k| } 1168| 2.44k| 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.44k| } 1177| 2.44k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 2.23k| { 1182| 2.23k| auto old_tail_size = pos.count(); 1183| 2.23k| auto new_tail_size = pos.index(last) + 1; 1184| 2.23k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.09k, False: 1.13k] ------------------ 1185| 2.23k| ? pos.node()->inc() 1186| 2.23k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 2.23k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 2.23k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE13visit_regularIRNS1_11regular_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 4.62k| { 1143| 4.62k| auto idx = pos.index(last); 1144| 4.62k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 4.62k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 4.62k| } else { 1147| 4.62k| using std::get; 1148| 4.62k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 4.62k| auto next = get<1>(subs); 1150| 4.62k| auto ts = get<2>(subs); 1151| 4.62k| auto tail = get<3>(subs); 1152| 4.62k| IMMER_TRY { ------------------ | | 49| 4.62k|#define IMMER_TRY try ------------------ 1153| 4.62k| if (next) { ------------------ | Branch (1153:21): [True: 1.18k, False: 3.43k] ------------------ 1154| 1.18k| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 1.18k| newn->inner()[idx] = next; 1156| 1.18k| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 3.43k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 1.72k, False: 1.71k] ------------------ 1158| 1.72k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.72k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 1.71k] | 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.71k| } else { 1164| 1.71k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.71k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.71k| } 1167| 4.62k| } 1168| 4.62k| 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| 4.62k| } 1177| 4.62k| } _ZN5immer6detail4rbts8dec_leafINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEvPT_j: 556| 40.7k|{ 557| 40.7k| make_leaf_sub_pos(node, n).visit(dec_visitor{}); 558| 40.7k|} _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 6.46k| { 1143| 6.46k| auto idx = pos.index(last); 1144| 6.46k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 6.46k, Folded] | Branch (1144:25): [True: 3.56k, False: 2.89k] ------------------ 1145| 3.56k| return pos.towards_oh(this_t{}, last, idx); 1146| 3.56k| } else { 1147| 2.89k| using std::get; 1148| 2.89k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.89k| auto next = get<1>(subs); 1150| 2.89k| auto ts = get<2>(subs); 1151| 2.89k| auto tail = get<3>(subs); 1152| 2.89k| IMMER_TRY { ------------------ | | 49| 2.89k|#define IMMER_TRY try ------------------ 1153| 2.89k| if (next) { ------------------ | Branch (1153:21): [True: 780, False: 2.11k] ------------------ 1154| 780| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 780| newn->inner()[idx] = next; 1156| 780| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.11k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 2.11k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 2.11k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 2.11k, Folded] | Branch (1159:40): [True: 1.72k, False: 398] | Branch (1159:52): [True: 1.31k, False: 406] ------------------ 1160| 1.31k| auto newn = pos.node()->inner()[0]; 1161| 1.31k| return std::make_tuple( 1162| 1.31k| pos.shift() - B, newn->inc(), ts, tail); 1163| 1.31k| } else { 1164| 804| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 804| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 804| } 1167| 2.89k| } 1168| 2.89k| 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.89k| } 1177| 6.46k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 1.49k| { 1182| 1.49k| auto old_tail_size = pos.count(); 1183| 1.49k| auto new_tail_size = pos.index(last) + 1; 1184| 1.49k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 517, False: 973] ------------------ 1185| 1.49k| ? pos.node()->inc() 1186| 1.49k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.49k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.49k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 2.62k| { 1143| 2.62k| auto idx = pos.index(last); 1144| 2.62k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 2.62k, Folded] | Branch (1144:25): [True: 1.20k, False: 1.41k] ------------------ 1145| 1.20k| return pos.towards_oh(this_t{}, last, idx); 1146| 1.41k| } else { 1147| 1.41k| using std::get; 1148| 1.41k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 1.41k| auto next = get<1>(subs); 1150| 1.41k| auto ts = get<2>(subs); 1151| 1.41k| auto tail = get<3>(subs); 1152| 1.41k| IMMER_TRY { ------------------ | | 49| 1.41k|#define IMMER_TRY try ------------------ 1153| 1.41k| if (next) { ------------------ | Branch (1153:21): [True: 355, False: 1.05k] ------------------ 1154| 355| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 355| newn->inner()[idx] = next; 1156| 355| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.05k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 1.05k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.05k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 1.05k, Folded] | Branch (1159:40): [True: 625, False: 431] | Branch (1159:52): [True: 319, False: 306] ------------------ 1160| 319| auto newn = pos.node()->inner()[0]; 1161| 319| return std::make_tuple( 1162| 319| pos.shift() - B, newn->inc(), ts, tail); 1163| 737| } else { 1164| 737| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 737| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 737| } 1167| 1.41k| } 1168| 1.41k| 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| 1.41k| } 1177| 2.62k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 665| { 1182| 665| auto old_tail_size = pos.count(); 1183| 665| auto new_tail_size = pos.index(last) + 1; 1184| 665| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 268, False: 397] ------------------ 1185| 665| ? pos.node()->inc() 1186| 665| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 665| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 665| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE11visit_innerIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 15.2k| { 1415| 15.2k| auto idx = pos.subindex(first); 1416| 15.2k| auto count = pos.count(); 1417| 15.2k| auto left_size = pos.size_before(idx); 1418| 15.2k| auto child_size = pos.size_sbh(idx, left_size); 1419| 15.2k| auto dropped_size = first; 1420| 15.2k| auto child_dropped_size = dropped_size - left_size; 1421| 15.2k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 15.2k, Folded] | Branch (1421:25): [True: 13.4k, False: 1.80k] | Branch (1421:45): [True: 4.39k, False: 9.04k] ------------------ 1422| 4.39k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 10.8k| } else { 1424| 10.8k| using std::get; 1425| 10.8k| auto n = pos.node(); 1426| 10.8k| auto newc = count - idx; 1427| 10.8k| auto newn = node_t::make_inner_r_n(newc); 1428| 10.8k| IMMER_TRY { ------------------ | | 49| 10.8k|#define IMMER_TRY try ------------------ 1429| 10.8k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 10.8k| auto newr = newn->relaxed(); 1431| 10.8k| newr->d.count = count - idx; 1432| 10.8k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 10.8k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 10.8k, False: 0] ------------------ 1434| 10.8k| pos.copy_sizes(idx + 1, 1435| 10.8k| newr->d.count - 1, 1436| 10.8k| newr->d.sizes[0], 1437| 10.8k| newr->d.sizes + 1); 1438| 10.8k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 10.8k, False: 0] ------------------ 1439| 10.8k| pos.size() - dropped_size); 1440| 10.8k| newn->inner()[0] = get<1>(subs); 1441| 10.8k| std::copy(n->inner() + idx + 1, 1442| 10.8k| n->inner() + count, 1443| 10.8k| newn->inner() + 1); 1444| 10.8k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 10.8k| return std::make_tuple(pos.shift(), newn); 1446| 10.8k| } 1447| 10.8k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 10.8k| } 1452| 15.2k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1456| 8.64k| { 1457| 8.64k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 8.64k| return std::make_tuple(0, n); 1459| 8.64k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE11visit_innerIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 44.6k| { 1415| 44.6k| auto idx = pos.subindex(first); 1416| 44.6k| auto count = pos.count(); 1417| 44.6k| auto left_size = pos.size_before(idx); 1418| 44.6k| auto child_size = pos.size_sbh(idx, left_size); 1419| 44.6k| auto dropped_size = first; 1420| 44.6k| auto child_dropped_size = dropped_size - left_size; 1421| 44.6k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 44.6k] | Branch (1421:25): [True: 0, False: 0] | Branch (1421:45): [True: 0, False: 0] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 44.6k| } else { 1424| 44.6k| using std::get; 1425| 44.6k| auto n = pos.node(); 1426| 44.6k| auto newc = count - idx; 1427| 44.6k| auto newn = node_t::make_inner_r_n(newc); 1428| 44.6k| IMMER_TRY { ------------------ | | 49| 44.6k|#define IMMER_TRY try ------------------ 1429| 44.6k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 44.6k| auto newr = newn->relaxed(); 1431| 44.6k| newr->d.count = count - idx; 1432| 44.6k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 44.6k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 44.6k, False: 0] ------------------ 1434| 44.6k| pos.copy_sizes(idx + 1, 1435| 44.6k| newr->d.count - 1, 1436| 44.6k| newr->d.sizes[0], 1437| 44.6k| newr->d.sizes + 1); 1438| 44.6k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 44.6k, False: 0] ------------------ 1439| 44.6k| pos.size() - dropped_size); 1440| 44.6k| newn->inner()[0] = get<1>(subs); 1441| 44.6k| std::copy(n->inner() + idx + 1, 1442| 44.6k| n->inner() + count, 1443| 44.6k| newn->inner() + 1); 1444| 44.6k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 44.6k| return std::make_tuple(pos.shift(), newn); 1446| 44.6k| } 1447| 44.6k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 44.6k| } 1452| 44.6k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE11visit_innerIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 2.21k| { 1415| 2.21k| auto idx = pos.subindex(first); 1416| 2.21k| auto count = pos.count(); 1417| 2.21k| auto left_size = pos.size_before(idx); 1418| 2.21k| auto child_size = pos.size_sbh(idx, left_size); 1419| 2.21k| auto dropped_size = first; 1420| 2.21k| auto child_dropped_size = dropped_size - left_size; 1421| 2.21k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 2.21k] | 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| 2.21k| } else { 1424| 2.21k| using std::get; 1425| 2.21k| auto n = pos.node(); 1426| 2.21k| auto newc = count - idx; 1427| 2.21k| auto newn = node_t::make_inner_r_n(newc); 1428| 2.21k| IMMER_TRY { ------------------ | | 49| 2.21k|#define IMMER_TRY try ------------------ 1429| 2.21k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 2.21k| auto newr = newn->relaxed(); 1431| 2.21k| newr->d.count = count - idx; 1432| 2.21k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 2.21k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 2.21k, False: 0] ------------------ 1434| 2.21k| pos.copy_sizes(idx + 1, 1435| 2.21k| newr->d.count - 1, 1436| 2.21k| newr->d.sizes[0], 1437| 2.21k| newr->d.sizes + 1); 1438| 2.21k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 2.21k, False: 0] ------------------ 1439| 2.21k| pos.size() - dropped_size); 1440| 2.21k| newn->inner()[0] = get<1>(subs); 1441| 2.21k| std::copy(n->inner() + idx + 1, 1442| 2.21k| n->inner() + count, 1443| 2.21k| newn->inner() + 1); 1444| 2.21k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 2.21k| return std::make_tuple(pos.shift(), newn); 1446| 2.21k| } 1447| 2.21k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 2.21k| } 1452| 2.21k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1456| 9.34k| { 1457| 9.34k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 9.34k| return std::make_tuple(0, n); 1459| 9.34k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE11visit_innerIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 5.89k| { 1415| 5.89k| auto idx = pos.subindex(first); 1416| 5.89k| auto count = pos.count(); 1417| 5.89k| auto left_size = pos.size_before(idx); 1418| 5.89k| auto child_size = pos.size_sbh(idx, left_size); 1419| 5.89k| auto dropped_size = first; 1420| 5.89k| auto child_dropped_size = dropped_size - left_size; 1421| 5.89k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 5.89k] | 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| 5.89k| } else { 1424| 5.89k| using std::get; 1425| 5.89k| auto n = pos.node(); 1426| 5.89k| auto newc = count - idx; 1427| 5.89k| auto newn = node_t::make_inner_r_n(newc); 1428| 5.89k| IMMER_TRY { ------------------ | | 49| 5.89k|#define IMMER_TRY try ------------------ 1429| 5.89k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 5.89k| auto newr = newn->relaxed(); 1431| 5.89k| newr->d.count = count - idx; 1432| 5.89k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 5.89k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 5.89k, False: 0] ------------------ 1434| 5.89k| pos.copy_sizes(idx + 1, 1435| 5.89k| newr->d.count - 1, 1436| 5.89k| newr->d.sizes[0], 1437| 5.89k| newr->d.sizes + 1); 1438| 5.89k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 5.89k, False: 0] ------------------ 1439| 5.89k| pos.size() - dropped_size); 1440| 5.89k| newn->inner()[0] = get<1>(subs); 1441| 5.89k| std::copy(n->inner() + idx + 1, 1442| 5.89k| n->inner() + count, 1443| 5.89k| newn->inner() + 1); 1444| 5.89k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 5.89k| return std::make_tuple(pos.shift(), newn); 1446| 5.89k| } 1447| 5.89k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 5.89k| } 1452| 5.89k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE11visit_innerIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 9.31k| { 1415| 9.31k| auto idx = pos.subindex(first); 1416| 9.31k| auto count = pos.count(); 1417| 9.31k| auto left_size = pos.size_before(idx); 1418| 9.31k| auto child_size = pos.size_sbh(idx, left_size); 1419| 9.31k| auto dropped_size = first; 1420| 9.31k| auto child_dropped_size = dropped_size - left_size; 1421| 9.31k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 9.31k, Folded] | Branch (1421:25): [True: 6.38k, False: 2.93k] | Branch (1421:45): [True: 3.52k, False: 2.85k] ------------------ 1422| 3.52k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 5.79k| } else { 1424| 5.79k| using std::get; 1425| 5.79k| auto n = pos.node(); 1426| 5.79k| auto newc = count - idx; 1427| 5.79k| auto newn = node_t::make_inner_r_n(newc); 1428| 5.79k| IMMER_TRY { ------------------ | | 49| 5.79k|#define IMMER_TRY try ------------------ 1429| 5.79k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 5.79k| auto newr = newn->relaxed(); 1431| 5.79k| newr->d.count = count - idx; 1432| 5.79k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 5.79k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 5.79k, False: 0] ------------------ 1434| 5.79k| pos.copy_sizes(idx + 1, 1435| 5.79k| newr->d.count - 1, 1436| 5.79k| newr->d.sizes[0], 1437| 5.79k| newr->d.sizes + 1); 1438| 5.79k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 5.79k, False: 0] ------------------ 1439| 5.79k| pos.size() - dropped_size); 1440| 5.79k| newn->inner()[0] = get<1>(subs); 1441| 5.79k| std::copy(n->inner() + idx + 1, 1442| 5.79k| n->inner() + count, 1443| 5.79k| newn->inner() + 1); 1444| 5.79k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 5.79k| return std::make_tuple(pos.shift(), newn); 1446| 5.79k| } 1447| 5.79k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 5.79k| } 1452| 9.31k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE11visit_innerIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 1.64k| { 1415| 1.64k| auto idx = pos.subindex(first); 1416| 1.64k| auto count = pos.count(); 1417| 1.64k| auto left_size = pos.size_before(idx); 1418| 1.64k| auto child_size = pos.size_sbh(idx, left_size); 1419| 1.64k| auto dropped_size = first; 1420| 1.64k| auto child_dropped_size = dropped_size - left_size; 1421| 1.64k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 1.64k, Folded] | Branch (1421:25): [True: 528, False: 1.11k] | Branch (1421:45): [True: 298, False: 230] ------------------ 1422| 298| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 1.34k| } else { 1424| 1.34k| using std::get; 1425| 1.34k| auto n = pos.node(); 1426| 1.34k| auto newc = count - idx; 1427| 1.34k| auto newn = node_t::make_inner_r_n(newc); 1428| 1.34k| IMMER_TRY { ------------------ | | 49| 1.34k|#define IMMER_TRY try ------------------ 1429| 1.34k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 1.34k| auto newr = newn->relaxed(); 1431| 1.34k| newr->d.count = count - idx; 1432| 1.34k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 1.34k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 1.34k, False: 0] ------------------ 1434| 1.34k| pos.copy_sizes(idx + 1, 1435| 1.34k| newr->d.count - 1, 1436| 1.34k| newr->d.sizes[0], 1437| 1.34k| newr->d.sizes + 1); 1438| 1.34k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 1.34k, False: 0] ------------------ 1439| 1.34k| pos.size() - dropped_size); 1440| 1.34k| newn->inner()[0] = get<1>(subs); 1441| 1.34k| std::copy(n->inner() + idx + 1, 1442| 1.34k| n->inner() + count, 1443| 1.34k| newn->inner() + 1); 1444| 1.34k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 1.34k| return std::make_tuple(pos.shift(), newn); 1446| 1.34k| } 1447| 1.34k| 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.34k| } 1452| 1.64k| } _ZN5immer6detail4rbts12concat_treesINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_11relaxed_posIT_EEPSE_jSG_jm: 2001| 8.12k|{ 2002| 8.12k| return make_singleton_regular_sub_pos(ltail, ltcount) 2003| 8.12k| .visit(concat_trees_left_visitor{}, 2004| 8.12k| empty_leaf_pos{}, 2005| 8.12k| rroot, 2006| 8.12k| rshift, 2007| 8.12k| rsize) 2008| 8.12k| .realize(); 2009| 8.12k|} _ZN5immer6detail4rbts25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_nodeIRNS1_25singleton_regular_sub_posISC_EENS1_14empty_leaf_posISC_EEJRPSC_RjRmEEENS1_17concat_center_posISC_EEOT_OT0_DpOT1_: 1971| 8.12k| { 1972| 8.12k| return visit_maybe_relaxed_sub( 1973| 8.12k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 8.12k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_nodeIRNS1_11relaxed_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 5.78k| { 1959| 5.78k| return concat_inners(lpos, tpos, rpos); 1960| 5.78k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 23.3k|{ 1873| 23.3k| auto lshift = lpos.shift(); 1874| 23.3k| auto rshift = rpos.shift(); 1875| 23.3k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 23.3k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 23.3k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 17.9k, False: 5.39k] ------------------ 1879| 17.9k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 17.9k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 17.9k| } else { 1882| 5.39k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 5.39k, False: 0] ------------------ 1883| 5.39k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 5.39k] | Branch (1883:9): [True: 5.39k, False: 0] | Branch (1883:9): [True: 5.39k, False: 0] ------------------ 1884| 5.39k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 5.39k| return concat_rebalance(lpos, cpos, rpos); 1886| 5.39k| } 1887| 23.3k|} _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8each_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_: 1512| 5.85M| { 1513| 5.85M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 538k, False: 5.31M] ------------------ 1514| 538k| auto s = size_t{}; 1515| 2.14M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 1.60M, False: 538k] ------------------ 1516| 1.60M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 1.60M| s = sizes_[i]; 1518| 1.60M| } 1519| 5.31M| } else { 1520| 13.5M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 8.20M, False: 5.31M] ------------------ 1521| 8.20M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 8.20M| .visit(v, args...); 1523| 5.31M| } 1524| 5.85M| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_21concat_rebalance_planILj2ELj2EEEEEvOT_RT0_: 1733| 2.47M| { 1734| 2.47M| auto count = p.count(); 1735| 2.47M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 2.47M, False: 0] ------------------ 1736| 2.47M| plan.counts[plan.n++] = count; 1737| 2.47M| plan.total += count; 1738| 2.47M| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_21concat_rebalance_planILj2ELj2EEEEEvOT_RT0_: 1733| 21.7M| { 1734| 21.7M| auto count = p.count(); 1735| 21.7M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 21.7M, False: 0] ------------------ 1736| 21.7M| plan.counts[plan.n++] = count; 1737| 21.7M| plan.total += count; 1738| 21.7M| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE7shuffleEj: 1762| 5.85M| { 1763| | // gcc seems to not really understand this code... :( 1764| 5.85M|#if !defined(_MSC_VER) 1765| 5.85M|#pragma GCC diagnostic push 1766| 5.85M|#pragma GCC diagnostic ignored "-Warray-bounds" 1767| 5.85M|#endif 1768| 5.85M| constexpr count_t rrb_extras = 2; 1769| 5.85M| constexpr count_t rrb_invariant = 1; 1770| 5.85M| const auto bits = shift == BL ? BL : B; ------------------ | Branch (1770:43): [True: 538k, False: 5.31M] ------------------ 1771| 5.85M| const auto branches = count_t{1} << bits; 1772| 5.85M| const auto optimal = ((total - 1) >> bits) + 1; 1773| 5.85M| count_t i = 0; 1774| 6.94M| while (n >= optimal + rrb_extras) { ------------------ | Branch (1774:16): [True: 1.09M, False: 5.85M] ------------------ 1775| | // skip ok nodes 1776| 1.74M| while (counts[i] > branches - rrb_invariant) ------------------ | Branch (1776:20): [True: 649k, False: 1.09M] ------------------ 1777| 649k| i++; 1778| 1.09M| assert(i < n); ------------------ | Branch (1778:13): [True: 1.09M, False: 0] ------------------ 1779| | // short node, redistribute 1780| 1.09M| auto remaining = counts[i]; 1781| 2.77M| do { 1782| 2.77M| auto next = counts[i + 1]; 1783| 2.77M| auto count = std::min(remaining + next, branches); 1784| 2.77M| counts[i] = count; 1785| 2.77M| assert(counts[i]); ------------------ | Branch (1785:17): [True: 2.77M, False: 0] ------------------ 1786| 2.77M| remaining += next - count; 1787| 2.77M| ++i; 1788| 2.77M| } while (remaining > 0); ------------------ | Branch (1788:22): [True: 1.68M, False: 1.09M] ------------------ 1789| | // remove node 1790| 1.09M| std::move(counts + i + 1, counts + n, counts + i); 1791| 1.09M| --n; 1792| 1.09M| --i; 1793| 1.09M| } 1794| 5.85M|#if !defined(_MSC_VER) 1795| 5.85M|#pragma GCC diagnostic pop 1796| 5.85M|#endif 1797| 5.85M| } _ZNK5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 1478| 11.7M| auto shift() const { return shift_; } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEC2EjPjj: 1577| 5.85M| : curr_{counts} 1578| 5.85M| , n_{n} 1579| 5.85M| , result_{ 1580| 5.85M| shift + B, node_t::make_inner_r_n(std::min(n_, branches)), 0} 1581| 5.85M| { 1582| 5.85M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEC2EjPSC_m: 1481| 5.85M| : shift_{s} 1482| 5.85M| , count_{1} 1483| 5.85M| , nodes_{n0} 1484| 5.85M| , sizes_{s0} 1485| 5.85M| { 1486| 5.85M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8each_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 1512| 5.85M| { 1513| 5.85M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 538k, False: 5.31M] ------------------ 1514| 538k| auto s = size_t{}; 1515| 2.14M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 1.60M, False: 538k] ------------------ 1516| 1.60M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 1.60M| s = sizes_[i]; 1518| 1.60M| } 1519| 5.31M| } else { 1520| 13.5M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 8.20M, False: 5.31M] ------------------ 1521| 8.20M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 8.20M| .visit(v, args...); 1523| 5.31M| } 1524| 5.85M| } _ZN5immer6detail4rbts21concat_merger_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1721| 2.47M| { 1722| 2.47M| merger.merge_leaf(p); 1723| 2.47M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10merge_leafIRNS1_12leaf_sub_posISC_EEEEvOT_: 1614| 2.47M| { 1615| 2.47M| auto from = p.node(); 1616| 2.47M| auto from_size = p.size(); 1617| 2.47M| auto from_count = p.count(); 1618| 2.47M| assert(from_size); ------------------ | Branch (1618:9): [True: 2.47M, False: 0] ------------------ 1619| 2.47M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 2.45M, False: 23.9k] | Branch (1619:21): [True: 2.43M, False: 14.2k] ------------------ 1620| 2.43M| add_child(from, from_size); 1621| 2.43M| from->inc(); 1622| 2.43M| } else { 1623| 38.2k| auto from_offset = count_t{}; 1624| 38.2k| auto from_data = from->leaf(); 1625| 47.4k| do { 1626| 47.4k| if (!to_) { ------------------ | Branch (1626:21): [True: 23.5k, False: 23.9k] ------------------ 1627| 23.5k| to_ = node_t::make_leaf_n(*curr_); 1628| 23.5k| to_offset_ = 0; 1629| 23.5k| } 1630| 47.4k| auto data = to_->leaf(); 1631| 47.4k| auto to_copy = 1632| 47.4k| std::min(from_count - from_offset, *curr_ - to_offset_); 1633| 47.4k| detail::uninitialized_copy(from_data + from_offset, 1634| 47.4k| from_data + from_offset + to_copy, 1635| 47.4k| data + to_offset_); 1636| 47.4k| to_offset_ += to_copy; 1637| 47.4k| from_offset += to_copy; 1638| 47.4k| if (*curr_ == to_offset_) { ------------------ | Branch (1638:21): [True: 23.5k, False: 23.9k] ------------------ 1639| 23.5k| add_child(to_, to_offset_); 1640| 23.5k| to_ = nullptr; 1641| 23.5k| } 1642| 47.4k| } while (from_offset != from_count); ------------------ | Branch (1642:22): [True: 9.28k, False: 38.2k] ------------------ 1643| 38.2k| } 1644| 2.47M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9add_childEPSC_m: 1589| 25.8M| { 1590| 25.8M| assert(size); ------------------ | Branch (1590:9): [True: 25.8M, False: 0] ------------------ 1591| 25.8M| ++curr_; 1592| 25.8M| auto parent = result_.nodes_[result_.count_ - 1]; 1593| 25.8M| auto relaxed = parent->relaxed(); 1594| 25.8M| if (relaxed->d.count == branches) { ------------------ | Branch (1594:13): [True: 2.92M, False: 22.9M] ------------------ 1595| 2.92M| assert(result_.count_ < result_t::max_children); ------------------ | Branch (1595:13): [True: 2.92M, False: 0] ------------------ 1596| 2.92M| n_ -= branches; 1597| 2.92M| parent = node_t::make_inner_r_n(std::min(n_, branches)); 1598| 2.92M| relaxed = parent->relaxed(); 1599| 2.92M| result_.nodes_[result_.count_] = parent; 1600| 2.92M| result_.sizes_[result_.count_] = result_.sizes_[result_.count_ - 1]; 1601| 2.92M| assert(result_.sizes_[result_.count_]); ------------------ | Branch (1601:13): [True: 2.92M, False: 0] ------------------ 1602| 2.92M| ++result_.count_; 1603| 2.92M| } 1604| 25.8M| auto idx = relaxed->d.count++; 1605| 25.8M| result_.sizes_[result_.count_ - 1] += size; 1606| 25.8M| assert(result_.sizes_[result_.count_ - 1]); ------------------ | Branch (1606:9): [True: 25.8M, False: 0] ------------------ 1607| 25.8M| relaxed->d.sizes[idx] = size + (idx ? relaxed->d.sizes[idx - 1] : 0); ------------------ | Branch (1607:41): [True: 17.0M, False: 8.77M] ------------------ 1608| 25.8M| assert(relaxed->d.sizes[idx]); ------------------ | Branch (1608:9): [True: 25.8M, False: 0] ------------------ 1609| 25.8M| parent->inner()[idx] = p; 1610| 25.8M| }; _ZN5immer6detail4rbts21concat_merger_visitor11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1715| 21.7M| { 1716| 21.7M| merger.merge_inner(p); 1717| 21.7M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11merge_innerIRNS1_11relaxed_posISC_EEEEvOT_: 1648| 21.7M| { 1649| 21.7M| auto from = p.node(); 1650| 21.7M| auto from_size = p.size(); 1651| 21.7M| auto from_count = p.count(); 1652| 21.7M| assert(from_size); ------------------ | Branch (1652:9): [True: 21.7M, False: 0] ------------------ 1653| 21.7M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 19.0M, False: 2.64M] | Branch (1653:21): [True: 18.0M, False: 1.06M] ------------------ 1654| 18.0M| add_child(from, from_size); 1655| 18.0M| from->inc(); 1656| 18.0M| } else { 1657| 3.70M| auto from_offset = count_t{}; 1658| 3.70M| auto from_data = from->inner(); 1659| 5.27M| do { 1660| 5.27M| if (!to_) { ------------------ | Branch (1660:21): [True: 2.63M, False: 2.64M] ------------------ 1661| 2.63M| to_ = node_t::make_inner_r_n(*curr_); 1662| 2.63M| to_offset_ = 0; 1663| 2.63M| to_size_ = 0; 1664| 2.63M| } 1665| 5.27M| auto data = to_->inner(); 1666| 5.27M| auto to_copy = 1667| 5.27M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 5.27M| std::copy(from_data + from_offset, 1669| 5.27M| from_data + from_offset + to_copy, 1670| 5.27M| data + to_offset_); 1671| 5.27M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 5.27M| auto sizes = to_->relaxed()->d.sizes; 1673| 5.27M| p.copy_sizes( 1674| 5.27M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 5.27M| to_offset_ += to_copy; 1676| 5.27M| from_offset += to_copy; 1677| 5.27M| to_size_ = sizes[to_offset_ - 1]; 1678| 5.27M| assert(to_size_); ------------------ | Branch (1678:17): [True: 5.27M, False: 0] ------------------ 1679| 5.27M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 2.63M, False: 2.64M] ------------------ 1680| 2.63M| to_->relaxed()->d.count = to_offset_; 1681| 2.63M| add_child(to_, to_size_); 1682| 2.63M| to_ = nullptr; 1683| 2.63M| } 1684| 5.27M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 1.56M, False: 3.70M] ------------------ 1685| 3.70M| } 1686| 21.7M| } _ZNK5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE6finishEv: 1689| 5.85M| { 1690| 5.85M| assert(!to_); ------------------ | Branch (1690:9): [True: 5.85M, False: 0] ------------------ 1691| 5.85M| return result_; 1692| 5.85M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8each_subINS1_11dec_visitorEJEEEvT_DpOT0_: 1512| 5.85M| { 1513| 5.85M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 538k, False: 5.31M] ------------------ 1514| 538k| auto s = size_t{}; 1515| 2.14M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 1.60M, False: 538k] ------------------ 1516| 1.60M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 1.60M| s = sizes_[i]; 1518| 1.60M| } 1519| 5.31M| } else { 1520| 13.5M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 8.20M, False: 5.31M] ------------------ 1521| 8.20M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 8.20M| .visit(v, args...); 1523| 5.31M| } 1524| 5.85M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEC2EjPSC_mSE_mSE_m: 1503| 530k| : shift_{s} 1504| 530k| , count_{3} 1505| 530k| , nodes_{n0, n1, n2} 1506| 530k| , sizes_{s0, s0 + s1, s0 + s1 + s2} 1507| 530k| { 1508| 530k| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEC2EjPSC_mSE_m: 1489| 8.12k| : shift_{s} 1490| 8.12k| , count_{2} 1491| 8.12k| , nodes_{n0, n1} 1492| 8.12k| , sizes_{s0, s0 + s1} 1493| 8.12k| { 1494| 8.12k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 17.5k| { 1918| 17.5k| return concat_inners(lpos, tpos, rpos); 1919| 17.5k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 391| { 1918| 391| return concat_inners(lpos, tpos, rpos); 1919| 391| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 2.73k|{ 1873| 2.73k| auto lshift = lpos.shift(); 1874| 2.73k| auto rshift = rpos.shift(); 1875| 2.73k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 2.73k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 2.73k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 735, False: 1.99k] ------------------ 1879| 735| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 735| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.99k| } else { 1882| 1.99k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.99k, False: 0] ------------------ 1883| 1.99k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.99k] | Branch (1883:9): [True: 1.99k, False: 0] | Branch (1883:9): [True: 1.99k, False: 0] ------------------ 1884| 1.99k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.99k| return concat_rebalance(lpos, cpos, rpos); 1886| 1.99k| } 1887| 2.73k|} _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_8full_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 1.14k| { 1918| 1.14k| return concat_inners(lpos, tpos, rpos); 1919| 1.14k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 1.14k|{ 1873| 1.14k| auto lshift = lpos.shift(); 1874| 1.14k| auto rshift = rpos.shift(); 1875| 1.14k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 1.14k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 1.14k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 406, False: 735] ------------------ 1879| 406| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 406| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 735| } else { 1882| 735| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 735, False: 0] ------------------ 1883| 735| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 735] | Branch (1883:9): [True: 735, False: 0] | Branch (1883:9): [True: 735, False: 0] ------------------ 1884| 735| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 735| return concat_rebalance(lpos, cpos, rpos); 1886| 735| } 1887| 1.14k|} _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_12null_sub_posERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSE_IT_EEOT0_OT1_OT2_: 1823| 982|{ 1824| 982| auto plan = concat_rebalance_plan{}; 1825| 982| plan.fill(lpos, cpos, rpos); 1826| 982| plan.shuffle(cpos.shift()); 1827| 982| IMMER_TRY { ------------------ | | 49| 982|#define IMMER_TRY try ------------------ 1828| 982| return plan.merge(lpos, cpos, rpos); 1829| 982| } 1830| 982| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 982|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_8full_posISH_EEEEvOT_OT0_OT1_: 1752| 982| { 1753| 982| assert(n == 0u); ------------------ | Branch (1753:9): [True: 982, False: 0] ------------------ 1754| 982| assert(total == 0u); ------------------ | Branch (1754:9): [True: 982, False: 0] ------------------ 1755| 982| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 982| lpos.each_left_sub(visitor_t{}, *this); 1757| 982| cpos.each_sub(visitor_t{}, *this); 1758| 982| rpos.each_right_sub(visitor_t{}, *this); 1759| 982| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_21concat_rebalance_planILj2ELj2EEEEEvOT_RT0_: 1733| 1.18M| { 1734| 1.18M| auto count = p.count(); 1735| 1.18M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 1.18M, False: 0] ------------------ 1736| 1.18M| plan.counts[plan.n++] = count; 1737| 1.18M| plan.total += count; 1738| 1.18M| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_21concat_rebalance_planILj2ELj2EEEEEvOT_RT0_: 1733| 851k| { 1734| 851k| auto count = p.count(); 1735| 851k| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 851k, False: 0] ------------------ 1736| 851k| plan.counts[plan.n++] = count; 1737| 851k| plan.total += count; 1738| 851k| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_8full_posISH_EEEENS7_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 982| { 1803| 982| using node_t = node_type; 1804| 982| using merger_t = concat_merger; 1805| 982| using visitor_t = concat_merger_visitor; 1806| 982| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 982| IMMER_TRY { ------------------ | | 49| 982|#define IMMER_TRY try ------------------ 1808| 982| lpos.each_left_sub(visitor_t{}, merger); 1809| 982| cpos.each_sub(visitor_t{}, merger); 1810| 982| rpos.each_right_sub(visitor_t{}, merger); 1811| 982| cpos.each_sub(dec_visitor{}); 1812| 982| return merger.finish(); 1813| 982| } 1814| 982| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 982| } _ZN5immer6detail4rbts21concat_merger_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1721| 1.18M| { 1722| 1.18M| merger.merge_leaf(p); 1723| 1.18M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10merge_leafIRNS1_13full_leaf_posISC_EEEEvOT_: 1614| 1.18M| { 1615| 1.18M| auto from = p.node(); 1616| 1.18M| auto from_size = p.size(); 1617| 1.18M| auto from_count = p.count(); 1618| 1.18M| assert(from_size); ------------------ | Branch (1618:9): [True: 1.18M, False: 0] ------------------ 1619| 1.18M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 1.18M, False: 0] | Branch (1619:21): [True: 1.18M, False: 0] ------------------ 1620| 1.18M| add_child(from, from_size); 1621| 1.18M| from->inc(); 1622| 1.18M| } 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| 1.18M| } _ZN5immer6detail4rbts21concat_merger_visitor11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1715| 851k| { 1716| 851k| merger.merge_inner(p); 1717| 851k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11merge_innerIRNS1_8full_posISC_EEEEvOT_: 1648| 851k| { 1649| 851k| auto from = p.node(); 1650| 851k| auto from_size = p.size(); 1651| 851k| auto from_count = p.count(); 1652| 851k| assert(from_size); ------------------ | Branch (1652:9): [True: 851k, False: 0] ------------------ 1653| 851k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 851k, False: 0] | Branch (1653:21): [True: 851k, False: 0] ------------------ 1654| 851k| add_child(from, from_size); 1655| 851k| from->inc(); 1656| 851k| } 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| 851k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 735| { 1945| 735| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 735| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_13full_leaf_posISC_EERNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1924| 2.73k| { 1925| 2.73k| return concat_leafs(lpos, tpos, rpos); 1926| 2.73k| } _ZN5immer6detail4rbts12concat_leafsINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_13full_leaf_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1838| 2.73k|{ 1839| 2.73k| static_assert(Node::bits >= 2, ""); 1840| 2.73k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 2.73k, False: 0] ------------------ 1841| 2.73k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 2.73k, False: 0] ------------------ 1842| 2.73k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 2.73k, False: 0] ------------------ 1843| 2.73k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 2.73k] ------------------ 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.73k| else 1854| 2.73k| return { 1855| 2.73k| Node::bits_leaf, 1856| 2.73k| lpos.node()->inc(), 1857| 2.73k| lpos.count(), 1858| 2.73k| rpos.node()->inc(), 1859| 2.73k| rpos.count(), 1860| 2.73k| }; 1861| 2.73k|} _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 735|{ 1824| 735| auto plan = concat_rebalance_plan{}; 1825| 735| plan.fill(lpos, cpos, rpos); 1826| 735| plan.shuffle(cpos.shift()); 1827| 735| IMMER_TRY { ------------------ | | 49| 735|#define IMMER_TRY try ------------------ 1828| 735| return plan.merge(lpos, cpos, rpos); 1829| 735| } 1830| 735| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 735|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEEvOT_OT0_OT1_: 1752| 735| { 1753| 735| assert(n == 0u); ------------------ | Branch (1753:9): [True: 735, False: 0] ------------------ 1754| 735| assert(total == 0u); ------------------ | Branch (1754:9): [True: 735, False: 0] ------------------ 1755| 735| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 735| lpos.each_left_sub(visitor_t{}, *this); 1757| 735| cpos.each_sub(visitor_t{}, *this); 1758| 735| rpos.each_right_sub(visitor_t{}, *this); 1759| 735| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 735| { 1803| 735| using node_t = node_type; 1804| 735| using merger_t = concat_merger; 1805| 735| using visitor_t = concat_merger_visitor; 1806| 735| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 735| IMMER_TRY { ------------------ | | 49| 735|#define IMMER_TRY try ------------------ 1808| 735| lpos.each_left_sub(visitor_t{}, merger); 1809| 735| cpos.each_sub(visitor_t{}, merger); 1810| 735| rpos.each_right_sub(visitor_t{}, merger); 1811| 735| cpos.each_sub(dec_visitor{}); 1812| 735| return merger.finish(); 1813| 735| } 1814| 735| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 735| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_12null_sub_posERNS1_17concat_center_posISC_EERNS1_15regular_sub_posISC_EEEENSE_IT_EEOT0_OT1_OT2_: 1823| 2.09k|{ 1824| 2.09k| auto plan = concat_rebalance_plan{}; 1825| 2.09k| plan.fill(lpos, cpos, rpos); 1826| 2.09k| plan.shuffle(cpos.shift()); 1827| 2.09k| IMMER_TRY { ------------------ | | 49| 2.09k|#define IMMER_TRY try ------------------ 1828| 2.09k| return plan.merge(lpos, cpos, rpos); 1829| 2.09k| } 1830| 2.09k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.09k|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_15regular_sub_posISH_EEEEvOT_OT0_OT1_: 1752| 2.09k| { 1753| 2.09k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.09k, False: 0] ------------------ 1754| 2.09k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.09k, False: 0] ------------------ 1755| 2.09k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.09k| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.09k| cpos.each_sub(visitor_t{}, *this); 1758| 2.09k| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.09k| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_21concat_rebalance_planILj2ELj2EEEEEvOT_RT0_: 1733| 716k| { 1734| 716k| auto count = p.count(); 1735| 716k| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 716k, False: 0] ------------------ 1736| 716k| plan.counts[plan.n++] = count; 1737| 716k| plan.total += count; 1738| 716k| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_15regular_sub_posISH_EEEENS7_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 2.09k| { 1803| 2.09k| using node_t = node_type; 1804| 2.09k| using merger_t = concat_merger; 1805| 2.09k| using visitor_t = concat_merger_visitor; 1806| 2.09k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.09k| IMMER_TRY { ------------------ | | 49| 2.09k|#define IMMER_TRY try ------------------ 1808| 2.09k| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.09k| cpos.each_sub(visitor_t{}, merger); 1810| 2.09k| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.09k| cpos.each_sub(dec_visitor{}); 1812| 2.09k| return merger.finish(); 1813| 2.09k| } 1814| 2.09k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.09k| } _ZN5immer6detail4rbts21concat_merger_visitor11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1715| 716k| { 1716| 716k| merger.merge_inner(p); 1717| 716k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11merge_innerIRNS1_15regular_sub_posISC_EEEEvOT_: 1648| 716k| { 1649| 716k| auto from = p.node(); 1650| 716k| auto from_size = p.size(); 1651| 716k| auto from_count = p.count(); 1652| 716k| assert(from_size); ------------------ | Branch (1652:9): [True: 716k, False: 0] ------------------ 1653| 716k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 607k, False: 109k] | Branch (1653:21): [True: 607k, False: 0] ------------------ 1654| 607k| add_child(from, from_size); 1655| 607k| from->inc(); 1656| 607k| } else { 1657| 109k| auto from_offset = count_t{}; 1658| 109k| auto from_data = from->inner(); 1659| 218k| do { 1660| 218k| if (!to_) { ------------------ | Branch (1660:21): [True: 109k, False: 109k] ------------------ 1661| 109k| to_ = node_t::make_inner_r_n(*curr_); 1662| 109k| to_offset_ = 0; 1663| 109k| to_size_ = 0; 1664| 109k| } 1665| 218k| auto data = to_->inner(); 1666| 218k| auto to_copy = 1667| 218k| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 218k| std::copy(from_data + from_offset, 1669| 218k| from_data + from_offset + to_copy, 1670| 218k| data + to_offset_); 1671| 218k| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 218k| auto sizes = to_->relaxed()->d.sizes; 1673| 218k| p.copy_sizes( 1674| 218k| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 218k| to_offset_ += to_copy; 1676| 218k| from_offset += to_copy; 1677| 218k| to_size_ = sizes[to_offset_ - 1]; 1678| 218k| assert(to_size_); ------------------ | Branch (1678:17): [True: 218k, False: 0] ------------------ 1679| 218k| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 109k, False: 109k] ------------------ 1680| 109k| to_->relaxed()->d.count = to_offset_; 1681| 109k| add_child(to_, to_size_); 1682| 109k| to_ = nullptr; 1683| 109k| } 1684| 218k| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 109k, False: 109k] ------------------ 1685| 109k| } 1686| 716k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 1.99k| { 1945| 1.99k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 1.99k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EESH_RNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1924| 5.39k| { 1925| 5.39k| return concat_leafs(lpos, tpos, rpos); 1926| 5.39k| } _ZN5immer6detail4rbts12concat_leafsINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EESF_EENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1838| 5.39k|{ 1839| 5.39k| static_assert(Node::bits >= 2, ""); 1840| 5.39k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 5.39k, False: 0] ------------------ 1841| 5.39k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 5.39k, False: 0] ------------------ 1842| 5.39k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 5.39k, False: 0] ------------------ 1843| 5.39k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 5.39k] ------------------ 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| 5.39k| else 1854| 5.39k| return { 1855| 5.39k| Node::bits_leaf, 1856| 5.39k| lpos.node()->inc(), 1857| 5.39k| lpos.count(), 1858| 5.39k| rpos.node()->inc(), 1859| 5.39k| rpos.count(), 1860| 5.39k| }; 1861| 5.39k|} _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_15regular_sub_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 1.99k|{ 1824| 1.99k| auto plan = concat_rebalance_plan{}; 1825| 1.99k| plan.fill(lpos, cpos, rpos); 1826| 1.99k| plan.shuffle(cpos.shift()); 1827| 1.99k| IMMER_TRY { ------------------ | | 49| 1.99k|#define IMMER_TRY try ------------------ 1828| 1.99k| return plan.merge(lpos, cpos, rpos); 1829| 1.99k| } 1830| 1.99k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.99k|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEEvOT_OT0_OT1_: 1752| 1.99k| { 1753| 1.99k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.99k, False: 0] ------------------ 1754| 1.99k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.99k, False: 0] ------------------ 1755| 1.99k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.99k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.99k| cpos.each_sub(visitor_t{}, *this); 1758| 1.99k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.99k| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 1.99k| { 1803| 1.99k| using node_t = node_type; 1804| 1.99k| using merger_t = concat_merger; 1805| 1.99k| using visitor_t = concat_merger_visitor; 1806| 1.99k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.99k| IMMER_TRY { ------------------ | | 49| 1.99k|#define IMMER_TRY try ------------------ 1808| 1.99k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.99k| cpos.each_sub(visitor_t{}, merger); 1810| 1.99k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.99k| cpos.each_sub(dec_visitor{}); 1812| 1.99k| return merger.finish(); 1813| 1.99k| } 1814| 1.99k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.99k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_12null_sub_posERNS1_17concat_center_posISC_EERNS1_11relaxed_posISC_EEEENSE_IT_EEOT0_OT1_OT2_: 1823| 107k|{ 1824| 107k| auto plan = concat_rebalance_plan{}; 1825| 107k| plan.fill(lpos, cpos, rpos); 1826| 107k| plan.shuffle(cpos.shift()); 1827| 107k| IMMER_TRY { ------------------ | | 49| 107k|#define IMMER_TRY try ------------------ 1828| 107k| return plan.merge(lpos, cpos, rpos); 1829| 107k| } 1830| 107k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 107k|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_11relaxed_posISH_EEEEvOT_OT0_OT1_: 1752| 107k| { 1753| 107k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 107k, False: 0] ------------------ 1754| 107k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 107k, False: 0] ------------------ 1755| 107k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 107k| lpos.each_left_sub(visitor_t{}, *this); 1757| 107k| cpos.each_sub(visitor_t{}, *this); 1758| 107k| rpos.each_right_sub(visitor_t{}, *this); 1759| 107k| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_11relaxed_posISH_EEEENS7_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 107k| { 1803| 107k| using node_t = node_type; 1804| 107k| using merger_t = concat_merger; 1805| 107k| using visitor_t = concat_merger_visitor; 1806| 107k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 107k| IMMER_TRY { ------------------ | | 49| 107k|#define IMMER_TRY try ------------------ 1808| 107k| lpos.each_left_sub(visitor_t{}, merger); 1809| 107k| cpos.each_sub(visitor_t{}, merger); 1810| 107k| rpos.each_right_sub(visitor_t{}, merger); 1811| 107k| cpos.each_sub(dec_visitor{}); 1812| 107k| return merger.finish(); 1813| 107k| } 1814| 107k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 107k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 5.39k| { 1945| 5.39k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 5.39k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_11relaxed_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 5.39k|{ 1824| 5.39k| auto plan = concat_rebalance_plan{}; 1825| 5.39k| plan.fill(lpos, cpos, rpos); 1826| 5.39k| plan.shuffle(cpos.shift()); 1827| 5.39k| IMMER_TRY { ------------------ | | 49| 5.39k|#define IMMER_TRY try ------------------ 1828| 5.39k| return plan.merge(lpos, cpos, rpos); 1829| 5.39k| } 1830| 5.39k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 5.39k|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEEvOT_OT0_OT1_: 1752| 5.39k| { 1753| 5.39k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 5.39k, False: 0] ------------------ 1754| 5.39k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 5.39k, False: 0] ------------------ 1755| 5.39k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 5.39k| lpos.each_left_sub(visitor_t{}, *this); 1757| 5.39k| cpos.each_sub(visitor_t{}, *this); 1758| 5.39k| rpos.each_right_sub(visitor_t{}, *this); 1759| 5.39k| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 5.39k| { 1803| 5.39k| using node_t = node_type; 1804| 5.39k| using merger_t = concat_merger; 1805| 5.39k| using visitor_t = concat_merger_visitor; 1806| 5.39k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 5.39k| IMMER_TRY { ------------------ | | 49| 5.39k|#define IMMER_TRY try ------------------ 1808| 5.39k| lpos.each_left_sub(visitor_t{}, merger); 1809| 5.39k| cpos.each_sub(visitor_t{}, merger); 1810| 5.39k| rpos.each_right_sub(visitor_t{}, merger); 1811| 5.39k| cpos.each_sub(dec_visitor{}); 1812| 5.39k| return merger.finish(); 1813| 5.39k| } 1814| 5.39k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 5.39k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_nodeIRNS1_15regular_sub_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 2.34k| { 1959| 2.34k| return concat_inners(lpos, tpos, rpos); 1960| 2.34k| } _ZNO5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7realizeEv: 1527| 538k| { 1528| 538k| if (count_ > 1) { ------------------ | Branch (1528:13): [True: 37.5k, False: 500k] ------------------ 1529| 37.5k| IMMER_TRY { ------------------ | | 49| 37.5k|#define IMMER_TRY try ------------------ 1530| 37.5k| auto result = node_t::make_inner_r_n(count_); 1531| 37.5k| auto r = result->relaxed(); 1532| 37.5k| r->d.count = count_; 1533| 37.5k| std::copy(nodes_, nodes_ + count_, result->inner()); 1534| 37.5k| std::copy(sizes_, sizes_ + count_, r->d.sizes); 1535| 37.5k| return {result, shift_, r}; 1536| 37.5k| } 1537| 37.5k| IMMER_CATCH (...) { 1538| 0| each_sub(dec_visitor{}); 1539| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1540| 0| } 1541| 500k| } else { 1542| 500k| assert(shift_ >= B + BL); ------------------ | Branch (1542:13): [True: 500k, False: 0] ------------------ 1543| 500k| return {nodes_[0], shift_ - B, nodes_[0]->relaxed()}; 1544| 500k| } 1545| 538k| } _ZN5immer6detail4rbts12concat_treesINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_11relaxed_posIT_EEPSE_jmSG_jSG_jm: 1986| 530k|{ 1987| 530k| return visit_maybe_relaxed_sub(lroot, 1988| 530k| lshift, 1989| 530k| lsize, 1990| 530k| concat_trees_left_visitor{}, 1991| 530k| make_leaf_pos(ltail, ltcount), 1992| 530k| rroot, 1993| 530k| rshift, 1994| 530k| rsize) 1995| 530k| .realize(); 1996| 530k|} _ZN5immer6detail4rbts25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_nodeIRNS1_11relaxed_posISC_EENS1_8leaf_posISC_EEJRPSC_RjRmEEENS1_17concat_center_posISC_EEOT_OT0_DpOT1_: 1971| 516k| { 1972| 516k| return visit_maybe_relaxed_sub( 1973| 516k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 516k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_nodeIRNS1_11relaxed_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 494k| { 1959| 494k| return concat_inners(lpos, tpos, rpos); 1960| 494k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESF_EENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 4.70M|{ 1873| 4.70M| auto lshift = lpos.shift(); 1874| 4.70M| auto rshift = rpos.shift(); 1875| 4.70M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 2.36M, False: 2.33M] ------------------ 1876| 2.36M| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 2.36M| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 2.36M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 78.4k, False: 2.25M] ------------------ 1879| 78.4k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 78.4k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 2.25M| } else { 1882| 2.25M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 2.25M, False: 0] ------------------ 1883| 2.25M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 2.25M] | Branch (1883:9): [True: 2.25M, False: 0] | Branch (1883:9): [True: 2.25M, False: 0] ------------------ 1884| 2.25M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 2.25M| return concat_rebalance(lpos, cpos, rpos); 1886| 2.25M| } 1887| 4.70M|} _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1897| 2.36M| { 1898| 2.36M| return concat_inners(lpos, tpos, rpos); 1899| 2.36M| } _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1897| 5.55k| { 1898| 5.55k| return concat_inners(lpos, tpos, rpos); 1899| 5.55k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 680k|{ 1873| 680k| auto lshift = lpos.shift(); 1874| 680k| auto rshift = rpos.shift(); 1875| 680k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 3.44k, False: 676k] ------------------ 1876| 3.44k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 3.44k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 676k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 11.1k, False: 665k] ------------------ 1879| 11.1k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 11.1k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 665k| } else { 1882| 665k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 665k, False: 0] ------------------ 1883| 665k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 665k] | Branch (1883:9): [True: 665k, False: 0] | Branch (1883:9): [True: 665k, False: 0] ------------------ 1884| 665k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 665k| return concat_rebalance(lpos, cpos, rpos); 1886| 665k| } 1887| 680k|} _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EENS1_12null_sub_posEEENSG_IT_EEOT0_OT1_OT2_: 1823| 4.37k|{ 1824| 4.37k| auto plan = concat_rebalance_plan{}; 1825| 4.37k| plan.fill(lpos, cpos, rpos); 1826| 4.37k| plan.shuffle(cpos.shift()); 1827| 4.37k| IMMER_TRY { ------------------ | | 49| 4.37k|#define IMMER_TRY try ------------------ 1828| 4.37k| return plan.merge(lpos, cpos, rpos); 1829| 4.37k| } 1830| 4.37k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 4.37k|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEEvOT_OT0_OT1_: 1752| 4.37k| { 1753| 4.37k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 4.37k, False: 0] ------------------ 1754| 4.37k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 4.37k, False: 0] ------------------ 1755| 4.37k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 4.37k| lpos.each_left_sub(visitor_t{}, *this); 1757| 4.37k| cpos.each_sub(visitor_t{}, *this); 1758| 4.37k| rpos.each_right_sub(visitor_t{}, *this); 1759| 4.37k| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 4.37k| { 1803| 4.37k| using node_t = node_type; 1804| 4.37k| using merger_t = concat_merger; 1805| 4.37k| using visitor_t = concat_merger_visitor; 1806| 4.37k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 4.37k| IMMER_TRY { ------------------ | | 49| 4.37k|#define IMMER_TRY try ------------------ 1808| 4.37k| lpos.each_left_sub(visitor_t{}, merger); 1809| 4.37k| cpos.each_sub(visitor_t{}, merger); 1810| 4.37k| rpos.each_right_sub(visitor_t{}, merger); 1811| 4.37k| cpos.each_sub(dec_visitor{}); 1812| 4.37k| return merger.finish(); 1813| 4.37k| } 1814| 4.37k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 4.37k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 668k| { 1918| 668k| return concat_inners(lpos, tpos, rpos); 1919| 668k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 126k| { 1918| 126k| return concat_inners(lpos, tpos, rpos); 1919| 126k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESF_EENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 136k|{ 1873| 136k| auto lshift = lpos.shift(); 1874| 136k| auto rshift = rpos.shift(); 1875| 136k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 929, False: 135k] ------------------ 1876| 929| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 929| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 135k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 647, False: 134k] ------------------ 1879| 647| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 647| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 134k| } else { 1882| 134k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 134k, False: 0] ------------------ 1883| 134k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 134k] | Branch (1883:9): [True: 134k, False: 0] | Branch (1883:9): [True: 134k, False: 0] ------------------ 1884| 134k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 134k| return concat_rebalance(lpos, cpos, rpos); 1886| 134k| } 1887| 136k|} _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1897| 1.33k| { 1898| 1.33k| return concat_inners(lpos, tpos, rpos); 1899| 1.33k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_8full_posISC_EERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 155k| { 1918| 155k| return concat_inners(lpos, tpos, rpos); 1919| 155k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 155k|{ 1873| 155k| auto lshift = lpos.shift(); 1874| 155k| auto rshift = rpos.shift(); 1875| 155k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 155k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 155k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 315, False: 155k] ------------------ 1879| 315| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 315| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 155k| } else { 1882| 155k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 155k, False: 0] ------------------ 1883| 155k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 155k] | Branch (1883:9): [True: 155k, False: 0] | Branch (1883:9): [True: 155k, False: 0] ------------------ 1884| 155k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 155k| return concat_rebalance(lpos, cpos, rpos); 1886| 155k| } 1887| 155k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 78.2k| { 1945| 78.2k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 78.2k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_13full_leaf_posISC_EERNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1924| 160k| { 1925| 160k| return concat_leafs(lpos, tpos, rpos); 1926| 160k| } _ZN5immer6detail4rbts12concat_leafsINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_13full_leaf_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1838| 160k|{ 1839| 160k| static_assert(Node::bits >= 2, ""); 1840| 160k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 160k, False: 0] ------------------ 1841| 160k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 160k, False: 0] ------------------ 1842| 160k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 160k, False: 0] ------------------ 1843| 160k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 160k, False: 0] ------------------ 1844| 160k| return { 1845| 160k| Node::bits_leaf, 1846| 160k| lpos.node()->inc(), 1847| 160k| lpos.count(), 1848| 160k| tpos.node()->inc(), 1849| 160k| tpos.count(), 1850| 160k| rpos.node()->inc(), 1851| 160k| rpos.count(), 1852| 160k| }; 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| 160k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 81.0k| { 1938| 81.0k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 81.0k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 155k|{ 1824| 155k| auto plan = concat_rebalance_plan{}; 1825| 155k| plan.fill(lpos, cpos, rpos); 1826| 155k| plan.shuffle(cpos.shift()); 1827| 155k| IMMER_TRY { ------------------ | | 49| 155k|#define IMMER_TRY try ------------------ 1828| 155k| return plan.merge(lpos, cpos, rpos); 1829| 155k| } 1830| 155k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 155k|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEEvOT_OT0_OT1_: 1752| 155k| { 1753| 155k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 155k, False: 0] ------------------ 1754| 155k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 155k, False: 0] ------------------ 1755| 155k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 155k| lpos.each_left_sub(visitor_t{}, *this); 1757| 155k| cpos.each_sub(visitor_t{}, *this); 1758| 155k| rpos.each_right_sub(visitor_t{}, *this); 1759| 155k| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 155k| { 1803| 155k| using node_t = node_type; 1804| 155k| using merger_t = concat_merger; 1805| 155k| using visitor_t = concat_merger_visitor; 1806| 155k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 155k| IMMER_TRY { ------------------ | | 49| 155k|#define IMMER_TRY try ------------------ 1808| 155k| lpos.each_left_sub(visitor_t{}, merger); 1809| 155k| cpos.each_sub(visitor_t{}, merger); 1810| 155k| rpos.each_right_sub(visitor_t{}, merger); 1811| 155k| cpos.each_sub(dec_visitor{}); 1812| 155k| return merger.finish(); 1813| 155k| } 1814| 155k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 155k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 82.0k| { 1945| 82.0k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 82.0k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1924| 370k| { 1925| 370k| return concat_leafs(lpos, tpos, rpos); 1926| 370k| } _ZN5immer6detail4rbts12concat_leafsINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EESF_EENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1838| 370k|{ 1839| 370k| static_assert(Node::bits >= 2, ""); 1840| 370k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 370k, False: 0] ------------------ 1841| 370k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 370k, False: 0] ------------------ 1842| 370k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 370k, False: 0] ------------------ 1843| 370k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 370k, False: 0] ------------------ 1844| 370k| return { 1845| 370k| Node::bits_leaf, 1846| 370k| lpos.node()->inc(), 1847| 370k| lpos.count(), 1848| 370k| tpos.node()->inc(), 1849| 370k| tpos.count(), 1850| 370k| rpos.node()->inc(), 1851| 370k| rpos.count(), 1852| 370k| }; 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| 370k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 73.7k| { 1938| 73.7k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 73.7k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EESF_EENSG_IT_EEOT0_OT1_OT2_: 1823| 134k|{ 1824| 134k| auto plan = concat_rebalance_plan{}; 1825| 134k| plan.fill(lpos, cpos, rpos); 1826| 134k| plan.shuffle(cpos.shift()); 1827| 134k| IMMER_TRY { ------------------ | | 49| 134k|#define IMMER_TRY try ------------------ 1828| 134k| return plan.merge(lpos, cpos, rpos); 1829| 134k| } 1830| 134k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 134k|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EESH_EEvOT_OT0_OT1_: 1752| 134k| { 1753| 134k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 134k, False: 0] ------------------ 1754| 134k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 134k, False: 0] ------------------ 1755| 134k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 134k| lpos.each_left_sub(visitor_t{}, *this); 1757| 134k| cpos.each_sub(visitor_t{}, *this); 1758| 134k| rpos.each_right_sub(visitor_t{}, *this); 1759| 134k| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EESH_EENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSN_OT1_: 1802| 134k| { 1803| 134k| using node_t = node_type; 1804| 134k| using merger_t = concat_merger; 1805| 134k| using visitor_t = concat_merger_visitor; 1806| 134k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 134k| IMMER_TRY { ------------------ | | 49| 134k|#define IMMER_TRY try ------------------ 1808| 134k| lpos.each_left_sub(visitor_t{}, merger); 1809| 134k| cpos.each_sub(visitor_t{}, merger); 1810| 134k| rpos.each_right_sub(visitor_t{}, merger); 1811| 134k| cpos.each_sub(dec_visitor{}); 1812| 134k| return merger.finish(); 1813| 134k| } 1814| 134k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 134k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 370k| { 1945| 370k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 370k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 783k| { 1938| 783k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 783k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_11relaxed_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 665k|{ 1824| 665k| auto plan = concat_rebalance_plan{}; 1825| 665k| plan.fill(lpos, cpos, rpos); 1826| 665k| plan.shuffle(cpos.shift()); 1827| 665k| IMMER_TRY { ------------------ | | 49| 665k|#define IMMER_TRY try ------------------ 1828| 665k| return plan.merge(lpos, cpos, rpos); 1829| 665k| } 1830| 665k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 665k|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEEvOT_OT0_OT1_: 1752| 665k| { 1753| 665k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 665k, False: 0] ------------------ 1754| 665k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 665k, False: 0] ------------------ 1755| 665k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 665k| lpos.each_left_sub(visitor_t{}, *this); 1757| 665k| cpos.each_sub(visitor_t{}, *this); 1758| 665k| rpos.each_right_sub(visitor_t{}, *this); 1759| 665k| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 665k| { 1803| 665k| using node_t = node_type; 1804| 665k| using merger_t = concat_merger; 1805| 665k| using visitor_t = concat_merger_visitor; 1806| 665k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 665k| IMMER_TRY { ------------------ | | 49| 665k|#define IMMER_TRY try ------------------ 1808| 665k| lpos.each_left_sub(visitor_t{}, merger); 1809| 665k| cpos.each_sub(visitor_t{}, merger); 1810| 665k| rpos.each_right_sub(visitor_t{}, merger); 1811| 665k| cpos.each_sub(dec_visitor{}); 1812| 665k| return merger.finish(); 1813| 665k| } 1814| 665k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 665k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EENS1_12null_sub_posEEENSG_IT_EEOT0_OT1_OT2_: 1823| 2.48M|{ 1824| 2.48M| auto plan = concat_rebalance_plan{}; 1825| 2.48M| plan.fill(lpos, cpos, rpos); 1826| 2.48M| plan.shuffle(cpos.shift()); 1827| 2.48M| IMMER_TRY { ------------------ | | 49| 2.48M|#define IMMER_TRY try ------------------ 1828| 2.48M| return plan.merge(lpos, cpos, rpos); 1829| 2.48M| } 1830| 2.48M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.48M|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEEvOT_OT0_OT1_: 1752| 2.48M| { 1753| 2.48M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.48M, False: 0] ------------------ 1754| 2.48M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.48M, False: 0] ------------------ 1755| 2.48M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.48M| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.48M| cpos.each_sub(visitor_t{}, *this); 1758| 2.48M| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.48M| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 2.48M| { 1803| 2.48M| using node_t = node_type; 1804| 2.48M| using merger_t = concat_merger; 1805| 2.48M| using visitor_t = concat_merger_visitor; 1806| 2.48M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.48M| IMMER_TRY { ------------------ | | 49| 2.48M|#define IMMER_TRY try ------------------ 1808| 2.48M| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.48M| cpos.each_sub(visitor_t{}, merger); 1810| 2.48M| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.48M| cpos.each_sub(dec_visitor{}); 1812| 2.48M| return merger.finish(); 1813| 2.48M| } 1814| 2.48M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.48M| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 1.84M| { 1918| 1.84M| return concat_inners(lpos, tpos, rpos); 1919| 1.84M| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 4.00k| { 1918| 4.00k| return concat_inners(lpos, tpos, rpos); 1919| 4.00k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 139k|{ 1873| 139k| auto lshift = lpos.shift(); 1874| 139k| auto rshift = rpos.shift(); 1875| 139k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 114k, False: 25.1k] ------------------ 1876| 114k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 114k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 114k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 717, False: 24.4k] ------------------ 1879| 717| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 717| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 24.4k| } else { 1882| 24.4k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 24.4k, False: 0] ------------------ 1883| 24.4k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 24.4k] | Branch (1883:9): [True: 24.4k, False: 0] | Branch (1883:9): [True: 24.4k, False: 0] ------------------ 1884| 24.4k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 24.4k| return concat_rebalance(lpos, cpos, rpos); 1886| 24.4k| } 1887| 139k|} _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1897| 114k| { 1898| 114k| return concat_inners(lpos, tpos, rpos); 1899| 114k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_8full_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 6.16k| { 1918| 6.16k| return concat_inners(lpos, tpos, rpos); 1919| 6.16k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 6.16k|{ 1873| 6.16k| auto lshift = lpos.shift(); 1874| 6.16k| auto rshift = rpos.shift(); 1875| 6.16k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 6.16k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 6.16k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 261, False: 5.90k] ------------------ 1879| 261| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 261| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 5.90k| } else { 1882| 5.90k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 5.90k, False: 0] ------------------ 1883| 5.90k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 5.90k] | Branch (1883:9): [True: 5.90k, False: 0] | Branch (1883:9): [True: 5.90k, False: 0] ------------------ 1884| 5.90k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 5.90k| return concat_rebalance(lpos, cpos, rpos); 1886| 5.90k| } 1887| 6.16k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 2.01k| { 1938| 2.01k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 2.01k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 5.90k|{ 1824| 5.90k| auto plan = concat_rebalance_plan{}; 1825| 5.90k| plan.fill(lpos, cpos, rpos); 1826| 5.90k| plan.shuffle(cpos.shift()); 1827| 5.90k| IMMER_TRY { ------------------ | | 49| 5.90k|#define IMMER_TRY try ------------------ 1828| 5.90k| return plan.merge(lpos, cpos, rpos); 1829| 5.90k| } 1830| 5.90k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 5.90k|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEEvOT_OT0_OT1_: 1752| 5.90k| { 1753| 5.90k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 5.90k, False: 0] ------------------ 1754| 5.90k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 5.90k, False: 0] ------------------ 1755| 5.90k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 5.90k| lpos.each_left_sub(visitor_t{}, *this); 1757| 5.90k| cpos.each_sub(visitor_t{}, *this); 1758| 5.90k| rpos.each_right_sub(visitor_t{}, *this); 1759| 5.90k| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 5.90k| { 1803| 5.90k| using node_t = node_type; 1804| 5.90k| using merger_t = concat_merger; 1805| 5.90k| using visitor_t = concat_merger_visitor; 1806| 5.90k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 5.90k| IMMER_TRY { ------------------ | | 49| 5.90k|#define IMMER_TRY try ------------------ 1808| 5.90k| lpos.each_left_sub(visitor_t{}, merger); 1809| 5.90k| cpos.each_sub(visitor_t{}, merger); 1810| 5.90k| rpos.each_right_sub(visitor_t{}, merger); 1811| 5.90k| cpos.each_sub(dec_visitor{}); 1812| 5.90k| return merger.finish(); 1813| 5.90k| } 1814| 5.90k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 5.90k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 3.17k| { 1938| 3.17k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 3.17k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EERNS1_15regular_sub_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 24.4k|{ 1824| 24.4k| auto plan = concat_rebalance_plan{}; 1825| 24.4k| plan.fill(lpos, cpos, rpos); 1826| 24.4k| plan.shuffle(cpos.shift()); 1827| 24.4k| IMMER_TRY { ------------------ | | 49| 24.4k|#define IMMER_TRY try ------------------ 1828| 24.4k| return plan.merge(lpos, cpos, rpos); 1829| 24.4k| } 1830| 24.4k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 24.4k|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEEvOT_OT0_OT1_: 1752| 24.4k| { 1753| 24.4k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 24.4k, False: 0] ------------------ 1754| 24.4k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 24.4k, False: 0] ------------------ 1755| 24.4k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 24.4k| lpos.each_left_sub(visitor_t{}, *this); 1757| 24.4k| cpos.each_sub(visitor_t{}, *this); 1758| 24.4k| rpos.each_right_sub(visitor_t{}, *this); 1759| 24.4k| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 24.4k| { 1803| 24.4k| using node_t = node_type; 1804| 24.4k| using merger_t = concat_merger; 1805| 24.4k| using visitor_t = concat_merger_visitor; 1806| 24.4k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 24.4k| IMMER_TRY { ------------------ | | 49| 24.4k|#define IMMER_TRY try ------------------ 1808| 24.4k| lpos.each_left_sub(visitor_t{}, merger); 1809| 24.4k| cpos.each_sub(visitor_t{}, merger); 1810| 24.4k| rpos.each_right_sub(visitor_t{}, merger); 1811| 24.4k| cpos.each_sub(dec_visitor{}); 1812| 24.4k| return merger.finish(); 1813| 24.4k| } 1814| 24.4k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 24.4k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 1.76M| { 1938| 1.76M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 1.76M| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EESF_EENSG_IT_EEOT0_OT1_OT2_: 1823| 2.25M|{ 1824| 2.25M| auto plan = concat_rebalance_plan{}; 1825| 2.25M| plan.fill(lpos, cpos, rpos); 1826| 2.25M| plan.shuffle(cpos.shift()); 1827| 2.25M| IMMER_TRY { ------------------ | | 49| 2.25M|#define IMMER_TRY try ------------------ 1828| 2.25M| return plan.merge(lpos, cpos, rpos); 1829| 2.25M| } 1830| 2.25M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.25M|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EESH_EEvOT_OT0_OT1_: 1752| 2.25M| { 1753| 2.25M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.25M, False: 0] ------------------ 1754| 2.25M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.25M, False: 0] ------------------ 1755| 2.25M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.25M| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.25M| cpos.each_sub(visitor_t{}, *this); 1758| 2.25M| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.25M| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EESH_EENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSN_OT1_: 1802| 2.25M| { 1803| 2.25M| using node_t = node_type; 1804| 2.25M| using merger_t = concat_merger; 1805| 2.25M| using visitor_t = concat_merger_visitor; 1806| 2.25M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.25M| IMMER_TRY { ------------------ | | 49| 2.25M|#define IMMER_TRY try ------------------ 1808| 2.25M| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.25M| cpos.each_sub(visitor_t{}, merger); 1810| 2.25M| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.25M| cpos.each_sub(dec_visitor{}); 1812| 2.25M| return merger.finish(); 1813| 2.25M| } 1814| 2.25M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.25M| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_nodeIRNS1_15regular_sub_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 21.5k| { 1959| 21.5k| return concat_inners(lpos, tpos, rpos); 1960| 21.5k| } _ZN5immer6detail4rbts25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_nodeIRNS1_15regular_sub_posISC_EENS1_8leaf_posISC_EEJRPSC_RjRmEEENS1_17concat_center_posISC_EEOT_OT0_DpOT1_: 1971| 14.1k| { 1972| 14.1k| return visit_maybe_relaxed_sub( 1973| 14.1k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 14.1k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_nodeIRNS1_11relaxed_posISC_EERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 6.33k| { 1959| 6.33k| return concat_inners(lpos, tpos, rpos); 1960| 6.33k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_nodeIRNS1_15regular_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 7.85k| { 1959| 7.85k| return concat_inners(lpos, tpos, rpos); 1960| 7.85k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEEPSC_OT_NSA_5applyIS7_E4type4editESI_j: 680| 53.1k| { 681| 53.1k| auto node = pos.node(); 682| 53.1k| auto level = pos.shift(); 683| 53.1k| auto idx = pos.count() - 1; 684| 53.1k| auto children = pos.size(idx); 685| 53.1k| auto new_idx = 686| 53.1k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 2.15k, False: 51.0k] | Branch (686:47): [True: 502, False: 50.5k] ------------------ 687| 53.1k| auto new_child = static_cast(nullptr); 688| 53.1k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [True: 53.1k, Folded] | Branch (688:38): [True: 49.7k, False: 3.46k] ------------------ 689| | 690| 53.1k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 1.11k, False: 52.0k] ------------------ 691| 1.11k| return nullptr; 692| 52.0k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 50.5k, False: 1.55k] ------------------ 693| 50.5k| new_child = 694| 50.5k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 48.0k, False: 2.44k] ------------------ 695| 50.5k| : pos.last_oh_csh( 696| 2.44k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 50.5k| if (!new_child) { ------------------ | Branch (697:17): [True: 784, False: 49.7k] ------------------ 698| 784| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 423, False: 361] ------------------ 699| 423| new_child = node_t::make_path_e(e, level - B, tail); 700| 361| else 701| 361| return nullptr; 702| 784| } 703| 50.5k| } else 704| 1.55k| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 51.6k| if (mutate) { ------------------ | Branch (706:13): [True: 49.3k, False: 2.31k] ------------------ 707| 49.3k| auto count = new_idx + 1; 708| 49.3k| auto relaxed = node->ensure_mutable_relaxed_n(e, new_idx); 709| 49.3k| node->inner()[new_idx] = new_child; 710| 49.3k| relaxed->d.sizes[new_idx] = pos.size() + ts; 711| 49.3k| relaxed->d.count = count; 712| 49.3k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (712:13): [True: 49.3k, False: 0] ------------------ 713| 49.3k| return node; 714| 49.3k| } else { 715| 2.31k| IMMER_TRY { ------------------ | | 49| 2.31k|#define IMMER_TRY try ------------------ 716| 2.31k| auto count = new_idx + 1; 717| 2.31k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 2.31k| auto relaxed = new_node->relaxed(); 719| 2.31k| new_node->inner()[new_idx] = new_child; 720| 2.31k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 2.31k| relaxed->d.count = count; 722| 2.31k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 2.31k, False: 0] ------------------ 723| 2.31k| if (Mutating) ------------------ | Branch (723:21): [True: 2.31k, Folded] ------------------ 724| 2.31k| pos.visit(dec_visitor{}); 725| 2.31k| return new_node; 726| 2.31k| } 727| 2.31k| 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.31k| } 737| 51.6k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEJRjEEEPSC_OT_NSA_5applyIS7_E4type4editESJ_DpOT0_: 741| 39.1k| { 742| 39.1k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 39.1k, False: 0] ------------------ 743| 39.1k| auto node = pos.node(); 744| 39.1k| auto idx = pos.index(pos.size() - 1); 745| 39.1k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 39.1k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 39.1k, Folded] | Branch (746:36): [True: 38.4k, False: 681] ------------------ 747| 39.1k| if (mutate) { ------------------ | Branch (747:13): [True: 38.4k, False: 681] ------------------ 748| 38.4k| node->inner()[new_idx] = 749| 38.4k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 37.7k, False: 746] ------------------ 750| | /* otherwise */ 751| 38.4k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 38.4k| return node; 753| 38.4k| } else { 754| 681| auto new_parent = node_t::make_inner_e(e); 755| 681| IMMER_TRY { ------------------ | | 49| 681|#define IMMER_TRY try ------------------ 756| 681| new_parent->inner()[new_idx] = 757| 681| idx == new_idx ------------------ | Branch (757:21): [True: 345, False: 336] ------------------ 758| 681| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 681| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 681| node_t::do_copy_inner(new_parent, node, new_idx); 762| 681| if (Mutating) ------------------ | Branch (762:21): [True: 681, Folded] ------------------ 763| 681| pos.visit(dec_visitor{}); 764| 681| return new_parent; 765| 681| } 766| 681| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 681| } 771| 39.1k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE13visit_regularIRNS1_11regular_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_: 741| 911k| { 742| 911k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 911k, False: 0] ------------------ 743| 911k| auto node = pos.node(); 744| 911k| auto idx = pos.index(pos.size() - 1); 745| 911k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 911k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 911k, Folded] | Branch (746:36): [True: 910k, False: 760] ------------------ 747| 911k| if (mutate) { ------------------ | Branch (747:13): [True: 910k, False: 760] ------------------ 748| 910k| node->inner()[new_idx] = 749| 910k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 712k, False: 198k] ------------------ 750| | /* otherwise */ 751| 910k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 910k| return node; 753| 910k| } else { 754| 760| auto new_parent = node_t::make_inner_e(e); 755| 760| IMMER_TRY { ------------------ | | 49| 760|#define IMMER_TRY try ------------------ 756| 760| new_parent->inner()[new_idx] = 757| 760| idx == new_idx ------------------ | Branch (757:21): [True: 398, False: 362] ------------------ 758| 760| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 760| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 760| node_t::do_copy_inner(new_parent, node, new_idx); 762| 760| if (Mutating) ------------------ | Branch (762:21): [True: 760, Folded] ------------------ 763| 760| pos.visit(dec_visitor{}); 764| 760| return new_parent; 765| 760| } 766| 760| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 760| } 771| 911k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE13visit_regularIRNS1_11regular_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_: 741| 3.01k| { 742| 3.01k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 3.01k, False: 0] ------------------ 743| 3.01k| auto node = pos.node(); 744| 3.01k| auto idx = pos.index(pos.size() - 1); 745| 3.01k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 3.01k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 3.01k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 3.01k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 3.01k] ------------------ 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| 3.01k| } else { 754| 3.01k| auto new_parent = node_t::make_inner_e(e); 755| 3.01k| IMMER_TRY { ------------------ | | 49| 3.01k|#define IMMER_TRY try ------------------ 756| 3.01k| new_parent->inner()[new_idx] = 757| 3.01k| idx == new_idx ------------------ | Branch (757:21): [True: 1.22k, False: 1.79k] ------------------ 758| 3.01k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 3.01k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 3.01k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 3.01k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 3.01k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 3.01k| return new_parent; 765| 3.01k| } 766| 3.01k| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 3.01k| } 771| 3.01k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEEPSC_OT_NSA_5applyIS7_E4type4editESI_j: 680| 6.86k| { 681| 6.86k| auto node = pos.node(); 682| 6.86k| auto level = pos.shift(); 683| 6.86k| auto idx = pos.count() - 1; 684| 6.86k| auto children = pos.size(idx); 685| 6.86k| auto new_idx = 686| 6.86k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 981, False: 5.88k] | Branch (686:47): [True: 388, False: 5.49k] ------------------ 687| 6.86k| auto new_child = static_cast(nullptr); 688| 6.86k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [Folded, False: 6.86k] | Branch (688:38): [True: 0, False: 0] ------------------ 689| | 690| 6.86k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 587, False: 6.28k] ------------------ 691| 587| return nullptr; 692| 6.28k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 5.49k, False: 782] ------------------ 693| 5.49k| new_child = 694| 5.49k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 0, False: 5.49k] ------------------ 695| 5.49k| : pos.last_oh_csh( 696| 5.49k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 5.49k| if (!new_child) { ------------------ | Branch (697:17): [True: 645, False: 4.85k] ------------------ 698| 645| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 269, False: 376] ------------------ 699| 269| new_child = node_t::make_path_e(e, level - B, tail); 700| 376| else 701| 376| return nullptr; 702| 645| } 703| 5.49k| } else 704| 782| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 5.90k| if (mutate) { ------------------ | Branch (706:13): [True: 0, False: 5.90k] ------------------ 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.90k| } else { 715| 5.90k| IMMER_TRY { ------------------ | | 49| 5.90k|#define IMMER_TRY try ------------------ 716| 5.90k| auto count = new_idx + 1; 717| 5.90k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 5.90k| auto relaxed = new_node->relaxed(); 719| 5.90k| new_node->inner()[new_idx] = new_child; 720| 5.90k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 5.90k| relaxed->d.count = count; 722| 5.90k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 5.90k, False: 0] ------------------ 723| 5.90k| if (Mutating) ------------------ | Branch (723:21): [Folded, False: 5.90k] ------------------ 724| 0| pos.visit(dec_visitor{}); 725| 5.90k| return new_node; 726| 5.90k| } 727| 5.90k| 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.90k| } 737| 5.90k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEJRjEEEPSC_OT_NSA_5applyIS7_E4type4editESJ_DpOT0_: 741| 1.07k| { 742| 1.07k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 1.07k, False: 0] ------------------ 743| 1.07k| auto node = pos.node(); 744| 1.07k| auto idx = pos.index(pos.size() - 1); 745| 1.07k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 1.07k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 1.07k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 1.07k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 1.07k] ------------------ 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.07k| } else { 754| 1.07k| auto new_parent = node_t::make_inner_e(e); 755| 1.07k| IMMER_TRY { ------------------ | | 49| 1.07k|#define IMMER_TRY try ------------------ 756| 1.07k| new_parent->inner()[new_idx] = 757| 1.07k| idx == new_idx ------------------ | Branch (757:21): [True: 671, False: 400] ------------------ 758| 1.07k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 1.07k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 1.07k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 1.07k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 1.07k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 1.07k| return new_parent; 765| 1.07k| } 766| 1.07k| 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.07k| } 771| 1.07k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_: 741| 166k| { 742| 166k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 166k, False: 0] ------------------ 743| 166k| auto node = pos.node(); 744| 166k| auto idx = pos.index(pos.size() - 1); 745| 166k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 166k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 166k, Folded] | Branch (746:36): [True: 165k, False: 657] ------------------ 747| 166k| if (mutate) { ------------------ | Branch (747:13): [True: 165k, False: 657] ------------------ 748| 165k| node->inner()[new_idx] = 749| 165k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 161k, False: 4.03k] ------------------ 750| | /* otherwise */ 751| 165k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 165k| return node; 753| 165k| } else { 754| 657| auto new_parent = node_t::make_inner_e(e); 755| 657| IMMER_TRY { ------------------ | | 49| 657|#define IMMER_TRY try ------------------ 756| 657| new_parent->inner()[new_idx] = 757| 657| idx == new_idx ------------------ | Branch (757:21): [True: 379, False: 278] ------------------ 758| 657| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 657| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 657| node_t::do_copy_inner(new_parent, node, new_idx); 762| 657| if (Mutating) ------------------ | Branch (762:21): [True: 657, Folded] ------------------ 763| 657| pos.visit(dec_visitor{}); 764| 657| return new_parent; 765| 657| } 766| 657| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 657| } 771| 166k| } _ZN5immer6detail4rbts17dec_empty_regularINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEvPT_: 580| 2.12k|{ 581| 2.12k| make_empty_regular_pos(node).visit(dec_visitor()); 582| 2.12k|} _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_relaxedIRNS1_11relaxed_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 595| 100k| { 596| 100k| auto offset = pos.index(idx); 597| 100k| auto count = pos.count(); 598| 100k| auto node = pos.node(); 599| 100k| if (node->can_mutate(e)) { ------------------ | Branch (599:13): [True: 87.8k, False: 13.0k] ------------------ 600| 87.8k| return pos.towards_oh( 601| 87.8k| this_t{}, idx, offset, e, &node->inner()[offset]); 602| 87.8k| } else { 603| 13.0k| auto new_node = node_t::copy_inner_sr_e(e, node, count); 604| 13.0k| IMMER_TRY { ------------------ | | 49| 13.0k|#define IMMER_TRY try ------------------ 605| 13.0k| auto& res = pos.towards_oh( 606| 13.0k| this_t{}, idx, offset, e, &new_node->inner()[offset]); 607| 13.0k| pos.visit(dec_visitor{}); 608| 13.0k| *location = new_node; 609| 13.0k| return res; 610| 13.0k| } 611| 13.0k| IMMER_CATCH (...) { 612| 0| dec_relaxed(new_node, pos.shift()); 613| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 614| 0| } 615| 13.0k| } 616| 100k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 652| 35.3k| { 653| 35.3k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 35.3k, False: 0] ------------------ 654| 35.3k| auto node = pos.node(); 655| 35.3k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 32.7k, False: 2.62k] ------------------ 656| 32.7k| return node->leaf()[pos.index(idx)]; 657| 32.7k| } else { 658| 2.62k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 2.62k| pos.visit(dec_visitor{}); 660| 2.62k| *location = new_node; 661| 2.62k| return new_node->leaf()[pos.index(idx)]; 662| 2.62k| } 663| 35.3k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_regularIRNS1_15regular_sub_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 621| 8.42k| { 622| 8.42k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 8.42k, False: 0] ------------------ 623| 8.42k| auto offset = pos.index(idx); 624| 8.42k| auto count = pos.count(); 625| 8.42k| auto node = pos.node(); 626| 8.42k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 6.39k, False: 2.03k] ------------------ 627| 6.39k| return pos.towards_oh_ch( 628| 6.39k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 6.39k| } else { 630| 2.03k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 2.03k| IMMER_TRY { ------------------ | | 49| 2.03k|#define IMMER_TRY try ------------------ 632| 2.03k| auto& res = pos.towards_oh_ch(this_t{}, 633| 2.03k| idx, 634| 2.03k| offset, 635| 2.03k| count, 636| 2.03k| e, 637| 2.03k| &new_node->inner()[offset]); 638| 2.03k| pos.visit(dec_visitor{}); 639| 2.03k| *location = new_node; 640| 2.03k| return res; 641| 2.03k| } 642| 2.03k| IMMER_CATCH (...) { 643| 0| dec_regular(new_node, pos.shift(), pos.size()); 644| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 645| 0| } 646| 2.03k| } 647| 8.42k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_13full_leaf_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 652| 7.23k| { 653| 7.23k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 7.23k, False: 0] ------------------ 654| 7.23k| auto node = pos.node(); 655| 7.23k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 5.02k, False: 2.20k] ------------------ 656| 5.02k| return node->leaf()[pos.index(idx)]; 657| 5.02k| } else { 658| 2.20k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 2.20k| pos.visit(dec_visitor{}); 660| 2.20k| *location = new_node; 661| 2.20k| return new_node->leaf()[pos.index(idx)]; 662| 2.20k| } 663| 7.23k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_regularIRNS1_8full_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 621| 6.10k| { 622| 6.10k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 6.10k, False: 0] ------------------ 623| 6.10k| auto offset = pos.index(idx); 624| 6.10k| auto count = pos.count(); 625| 6.10k| auto node = pos.node(); 626| 6.10k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 4.21k, False: 1.88k] ------------------ 627| 4.21k| return pos.towards_oh_ch( 628| 4.21k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 4.21k| } else { 630| 1.88k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.88k| IMMER_TRY { ------------------ | | 49| 1.88k|#define IMMER_TRY try ------------------ 632| 1.88k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.88k| idx, 634| 1.88k| offset, 635| 1.88k| count, 636| 1.88k| e, 637| 1.88k| &new_node->inner()[offset]); 638| 1.88k| pos.visit(dec_visitor{}); 639| 1.88k| *location = new_node; 640| 1.88k| return res; 641| 1.88k| } 642| 1.88k| 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.88k| } 647| 6.10k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_8leaf_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 652| 1.19k| { 653| 1.19k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 1.19k, False: 0] ------------------ 654| 1.19k| auto node = pos.node(); 655| 1.19k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 682, False: 517] ------------------ 656| 682| return node->leaf()[pos.index(idx)]; 657| 682| } else { 658| 517| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 517| pos.visit(dec_visitor{}); 660| 517| *location = new_node; 661| 517| return new_node->leaf()[pos.index(idx)]; 662| 517| } 663| 1.19k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_regularIRNS1_11regular_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 621| 1.92k| { 622| 1.92k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 1.92k, False: 0] ------------------ 623| 1.92k| auto offset = pos.index(idx); 624| 1.92k| auto count = pos.count(); 625| 1.92k| auto node = pos.node(); 626| 1.92k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.63k, False: 291] ------------------ 627| 1.63k| return pos.towards_oh_ch( 628| 1.63k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.63k| } else { 630| 291| auto new_node = node_t::copy_inner_e(e, node, count); 631| 291| IMMER_TRY { ------------------ | | 49| 291|#define IMMER_TRY try ------------------ 632| 291| auto& res = pos.towards_oh_ch(this_t{}, 633| 291| idx, 634| 291| offset, 635| 291| count, 636| 291| e, 637| 291| &new_node->inner()[offset]); 638| 291| pos.visit(dec_visitor{}); 639| 291| *location = new_node; 640| 291| return res; 641| 291| } 642| 291| 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| 291| } 647| 1.92k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 913| 55.1k| { 914| 55.1k| auto idx = pos.index(last); 915| 55.1k| auto node = pos.node(); 916| 55.1k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 55.1k, Folded] | Branch (916:35): [True: 47.3k, False: 7.85k] ------------------ 917| 55.1k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 55.1k, Folded] | Branch (917:25): [True: 37.1k, False: 18.0k] ------------------ 918| 37.1k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 32.7k, False: 4.41k] ------------------ 919| 37.1k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 37.1k| if (Mutating) ------------------ | Branch (920:17): [True: 37.1k, Folded] ------------------ 921| 37.1k| pos.visit(dec_right_visitor{}, count_t{1}); 922| 37.1k| return res; 923| 37.1k| } else { 924| 18.0k| using std::get; 925| 18.0k| auto subs = 926| 18.0k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 14.5k, False: 3.43k] ------------------ 927| 18.0k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 18.0k| auto next = get<1>(subs); 929| 18.0k| auto ts = get<2>(subs); 930| 18.0k| auto tail = get<3>(subs); 931| 18.0k| IMMER_TRY { ------------------ | | 49| 18.0k|#define IMMER_TRY try ------------------ 932| 18.0k| if (next) { ------------------ | Branch (932:21): [True: 13.2k, False: 4.74k] ------------------ 933| 13.2k| if (mutate) { ------------------ | Branch (933:25): [True: 11.2k, False: 2.06k] ------------------ 934| 11.2k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 11.2k| pos.each_right(dec_visitor{}, idx + 1); 936| 11.2k| node->inner()[idx] = next; 937| 11.2k| nodr->d.sizes[idx] = last + 1 - ts; 938| 11.2k| nodr->d.count = idx + 1; 939| 11.2k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 11.2k, False: 0] ------------------ 940| 11.2k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 11.2k| } else { 942| 2.06k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 2.06k| auto newr = newn->relaxed(); 944| 2.06k| newn->inner()[idx] = next; 945| 2.06k| newr->d.sizes[idx] = last + 1 - ts; 946| 2.06k| newr->d.count = idx + 1; 947| 2.06k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 2.06k, False: 0] ------------------ 948| 2.06k| if (Mutating) ------------------ | Branch (948:29): [True: 2.06k, Folded] ------------------ 949| 2.06k| pos.visit(dec_visitor{}); 950| 2.06k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 2.06k| } 952| 13.2k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 4.74k] ------------------ 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| 4.74k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 4.74k, Folded] | Branch (956:40): [True: 3.36k, False: 1.38k] | Branch (956:52): [True: 2.79k, False: 571] ------------------ 957| 2.79k| auto newn = pos.node()->inner()[0]; 958| 2.79k| if (!mutate) ------------------ | Branch (958:25): [True: 796, False: 1.99k] ------------------ 959| 796| newn->inc(); 960| 2.79k| if (Mutating) ------------------ | Branch (960:25): [True: 2.79k, Folded] ------------------ 961| 2.79k| pos.visit(dec_right_visitor{}, count_t{2}); 962| 2.79k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 2.79k| } else { 964| 1.95k| if (mutate) { ------------------ | Branch (964:25): [True: 1.37k, False: 577] ------------------ 965| 1.37k| pos.each_right(dec_visitor{}, idx + 1); 966| 1.37k| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 1.37k| return std::make_tuple(pos.shift(), node, ts, tail); 968| 1.37k| } else { 969| 577| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 577| if (Mutating) ------------------ | Branch (970:29): [True: 577, Folded] ------------------ 971| 577| pos.visit(dec_visitor{}); 972| 577| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 577| } 974| 1.95k| } 975| 18.0k| } 976| 18.0k| 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| 18.0k| } 987| 55.1k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 1.14k| { 1060| 1.14k| auto old_tail_size = pos.count(); 1061| 1.14k| auto new_tail_size = pos.index(last) + 1; 1062| 1.14k| auto node = pos.node(); 1063| 1.14k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.14k, Folded] | Branch (1063:42): [True: 368, False: 777] ------------------ 1064| 1.14k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 365, False: 780] ------------------ 1065| 365| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 365] ------------------ 1066| 0| node->inc(); 1067| 365| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 780| } else if (mutate) { ------------------ | Branch (1068:20): [True: 286, False: 494] ------------------ 1069| 286| detail::destroy_n(node->leaf() + new_tail_size, 1070| 286| old_tail_size - new_tail_size); 1071| 286| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 494| } else { 1073| 494| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 494| if (Mutating) ------------------ | Branch (1074:17): [True: 494, Folded] ------------------ 1075| 494| pos.visit(dec_visitor{}); 1076| 494| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 494| } 1078| 1.14k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 960| { 1060| 960| auto old_tail_size = pos.count(); 1061| 960| auto new_tail_size = pos.index(last) + 1; 1062| 960| auto node = pos.node(); 1063| 960| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 960] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 960| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 662, False: 298] ------------------ 1065| 662| if (!Mutating) ------------------ | Branch (1065:17): [True: 662, Folded] ------------------ 1066| 662| node->inc(); 1067| 662| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 662| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 298] ------------------ 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| 298| } else { 1073| 298| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 298| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 298] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 298| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 298| } 1078| 960| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 913| 17.1k| { 914| 17.1k| auto idx = pos.index(last); 915| 17.1k| auto node = pos.node(); 916| 17.1k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 17.1k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 17.1k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 17.1k, Folded] | Branch (917:25): [True: 15.1k, False: 1.95k] ------------------ 918| 15.1k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 0, False: 15.1k] ------------------ 919| 15.1k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 15.1k| if (Mutating) ------------------ | Branch (920:17): [Folded, False: 15.1k] ------------------ 921| 0| pos.visit(dec_right_visitor{}, count_t{1}); 922| 15.1k| return res; 923| 15.1k| } else { 924| 1.95k| using std::get; 925| 1.95k| auto subs = 926| 1.95k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 1.95k] ------------------ 927| 1.95k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 1.95k| auto next = get<1>(subs); 929| 1.95k| auto ts = get<2>(subs); 930| 1.95k| auto tail = get<3>(subs); 931| 1.95k| IMMER_TRY { ------------------ | | 49| 1.95k|#define IMMER_TRY try ------------------ 932| 1.95k| if (next) { ------------------ | Branch (932:21): [True: 487, False: 1.46k] ------------------ 933| 487| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 487] ------------------ 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| 487| } else { 942| 487| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 487| auto newr = newn->relaxed(); 944| 487| newn->inner()[idx] = next; 945| 487| newr->d.sizes[idx] = last + 1 - ts; 946| 487| newr->d.count = idx + 1; 947| 487| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 487, False: 0] ------------------ 948| 487| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 487] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 487| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 487| } 952| 1.46k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 1.46k] ------------------ 953| 0| if (Mutating) ------------------ | Branch (953:25): [Folded, False: 0] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 1.46k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 1.46k, Folded] | Branch (956:40): [True: 671, False: 795] | Branch (956:52): [True: 429, False: 242] ------------------ 957| 429| auto newn = pos.node()->inner()[0]; 958| 429| if (!mutate) ------------------ | Branch (958:25): [True: 429, False: 0] ------------------ 959| 429| newn->inc(); 960| 429| if (Mutating) ------------------ | Branch (960:25): [Folded, False: 429] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 429| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 1.03k| } else { 964| 1.03k| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 1.03k] ------------------ 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.03k| } else { 969| 1.03k| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 1.03k| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 1.03k] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 1.03k| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 1.03k| } 974| 1.03k| } 975| 1.95k| } 976| 1.95k| 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.95k| } 987| 17.1k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 1.50k| { 992| 1.50k| auto idx = pos.index(last); 993| 1.50k| auto node = pos.node(); 994| 1.50k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.50k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.50k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.50k, Folded] | Branch (995:25): [True: 426, False: 1.07k] ------------------ 996| 426| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 426] ------------------ 997| 426| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 426| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 426] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 426| return res; 1001| 1.07k| } else { 1002| 1.07k| using std::get; 1003| 1.07k| auto subs = 1004| 1.07k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 1.07k] ------------------ 1005| 1.07k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.07k| auto next = get<1>(subs); 1007| 1.07k| auto ts = get<2>(subs); 1008| 1.07k| auto tail = get<3>(subs); 1009| 1.07k| IMMER_TRY { ------------------ | | 49| 1.07k|#define IMMER_TRY try ------------------ 1010| 1.07k| if (next) { ------------------ | Branch (1010:21): [True: 223, False: 851] ------------------ 1011| 223| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 223] ------------------ 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| 223| } else { 1016| 223| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 223| newn->inner()[idx] = next; 1018| 223| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 223] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 223| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 223| } 1022| 851| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 851] ------------------ 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| 851| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 851, Folded] | Branch (1026:40): [True: 596, False: 255] | Branch (1026:52): [True: 219, False: 377] ------------------ 1027| 219| auto newn = pos.node()->inner()[0]; 1028| 219| if (!mutate) ------------------ | Branch (1028:25): [True: 219, False: 0] ------------------ 1029| 219| newn->inc(); 1030| 219| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 219] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 219| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 632| } else { 1034| 632| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 632] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 632| } else { 1038| 632| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 632| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 632] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 632| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 632| } 1043| 632| } 1044| 1.07k| } 1045| 1.07k| 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.07k| } 1055| 1.50k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 1.47k| { 1060| 1.47k| auto old_tail_size = pos.count(); 1061| 1.47k| auto new_tail_size = pos.index(last) + 1; 1062| 1.47k| auto node = pos.node(); 1063| 1.47k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 1.47k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 1.47k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 709, False: 767] ------------------ 1065| 709| if (!Mutating) ------------------ | Branch (1065:17): [True: 709, Folded] ------------------ 1066| 709| node->inc(); 1067| 709| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 767| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 767] ------------------ 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| 767| } else { 1073| 767| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 767| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 767] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 767| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 767| } 1078| 1.47k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 1.80k| { 992| 1.80k| auto idx = pos.index(last); 993| 1.80k| auto node = pos.node(); 994| 1.80k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.80k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.80k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.80k, Folded] | Branch (995:25): [True: 654, False: 1.14k] ------------------ 996| 654| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 654] ------------------ 997| 654| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 654| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 654] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 654| return res; 1001| 1.14k| } else { 1002| 1.14k| using std::get; 1003| 1.14k| auto subs = 1004| 1.14k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 1.14k] ------------------ 1005| 1.14k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.14k| auto next = get<1>(subs); 1007| 1.14k| auto ts = get<2>(subs); 1008| 1.14k| auto tail = get<3>(subs); 1009| 1.14k| IMMER_TRY { ------------------ | | 49| 1.14k|#define IMMER_TRY try ------------------ 1010| 1.14k| if (next) { ------------------ | Branch (1010:21): [True: 262, False: 887] ------------------ 1011| 262| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 262] ------------------ 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| 262| } else { 1016| 262| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 262| newn->inner()[idx] = next; 1018| 262| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 262] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 262| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 262| } 1022| 887| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 887] ------------------ 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| 887| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 887, Folded] | Branch (1026:40): [True: 685, False: 202] | Branch (1026:52): [True: 214, False: 471] ------------------ 1027| 214| auto newn = pos.node()->inner()[0]; 1028| 214| if (!mutate) ------------------ | Branch (1028:25): [True: 214, False: 0] ------------------ 1029| 214| newn->inc(); 1030| 214| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 214] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 214| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 673| } else { 1034| 673| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 673] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 673| } else { 1038| 673| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 673| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 673] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 673| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 673| } 1043| 673| } 1044| 1.14k| } 1045| 1.14k| 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.14k| } 1055| 1.80k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb1EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 6.11k| { 1060| 6.11k| auto old_tail_size = pos.count(); 1061| 6.11k| auto new_tail_size = pos.index(last) + 1; 1062| 6.11k| auto node = pos.node(); 1063| 6.11k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 6.11k, Folded] | Branch (1063:42): [True: 1.06k, False: 5.05k] ------------------ 1064| 6.11k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.54k, False: 4.57k] ------------------ 1065| 1.54k| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 1.54k] ------------------ 1066| 0| node->inc(); 1067| 1.54k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 4.57k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 928, False: 3.65k] ------------------ 1069| 928| detail::destroy_n(node->leaf() + new_tail_size, 1070| 928| old_tail_size - new_tail_size); 1071| 928| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 3.65k| } else { 1073| 3.65k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 3.65k| if (Mutating) ------------------ | Branch (1074:17): [True: 3.65k, Folded] ------------------ 1075| 3.65k| pos.visit(dec_visitor{}); 1076| 3.65k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 3.65k| } 1078| 6.11k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 4.81k| { 992| 4.81k| auto idx = pos.index(last); 993| 4.81k| auto node = pos.node(); 994| 4.81k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 4.81k, Folded] | Branch (994:35): [True: 2.76k, False: 2.05k] ------------------ 995| 4.81k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 4.81k] | 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.81k| } else { 1002| 4.81k| using std::get; 1003| 4.81k| auto subs = 1004| 4.81k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 2.76k, False: 2.05k] ------------------ 1005| 4.81k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 4.81k| auto next = get<1>(subs); 1007| 4.81k| auto ts = get<2>(subs); 1008| 4.81k| auto tail = get<3>(subs); 1009| 4.81k| IMMER_TRY { ------------------ | | 49| 4.81k|#define IMMER_TRY try ------------------ 1010| 4.81k| if (next) { ------------------ | Branch (1010:21): [True: 958, False: 3.86k] ------------------ 1011| 958| if (mutate) { ------------------ | Branch (1011:25): [True: 668, False: 290] ------------------ 1012| 668| node->inner()[idx] = next; 1013| 668| pos.each_right(dec_visitor{}, idx + 1); 1014| 668| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 668| } else { 1016| 290| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 290| newn->inner()[idx] = next; 1018| 290| if (Mutating) ------------------ | Branch (1018:29): [True: 290, Folded] ------------------ 1019| 290| pos.visit(dec_visitor{}); 1020| 290| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 290| } 1022| 3.86k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.36k, False: 2.49k] ------------------ 1023| 1.36k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.36k, Folded] ------------------ 1024| 1.36k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.36k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 2.49k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 2.49k] | 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| 2.49k| } else { 1034| 2.49k| if (mutate) { ------------------ | Branch (1034:25): [True: 1.55k, False: 936] ------------------ 1035| 1.55k| pos.each_right(dec_visitor{}, idx + 1); 1036| 1.55k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.55k| } else { 1038| 936| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 936| if (Mutating) ------------------ | Branch (1039:29): [True: 936, Folded] ------------------ 1040| 936| pos.visit(dec_visitor{}); 1041| 936| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 936| } 1043| 2.49k| } 1044| 4.81k| } 1045| 4.81k| 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.81k| } 1055| 4.81k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_j: 878| 3.31k| { 879| 3.31k| using node_t = node_type; 880| 3.31k| auto node = p.node(); 881| 3.31k| if (node->dec()) { ------------------ | Branch (881:13): [True: 1.67k, False: 1.64k] ------------------ 882| 1.67k| p.each_right(dec_t{}, idx); 883| 1.67k| node_t::delete_inner(node, p.count()); 884| 1.67k| } 885| 3.31k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 9.77k| { 1060| 9.77k| auto old_tail_size = pos.count(); 1061| 9.77k| auto new_tail_size = pos.index(last) + 1; 1062| 9.77k| auto node = pos.node(); 1063| 9.77k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 9.77k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 9.77k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 2.80k, False: 6.96k] ------------------ 1065| 2.80k| if (!Mutating) ------------------ | Branch (1065:17): [True: 2.80k, Folded] ------------------ 1066| 2.80k| node->inc(); 1067| 2.80k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 6.96k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 6.96k] ------------------ 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| 6.96k| } else { 1073| 6.96k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 6.96k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 6.96k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 6.96k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 6.96k| } 1078| 9.77k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 3.41k| { 992| 3.41k| auto idx = pos.index(last); 993| 3.41k| auto node = pos.node(); 994| 3.41k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.41k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.41k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.41k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 0] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 3.41k| } else { 1002| 3.41k| using std::get; 1003| 3.41k| auto subs = 1004| 3.41k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.41k] ------------------ 1005| 3.41k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.41k| auto next = get<1>(subs); 1007| 3.41k| auto ts = get<2>(subs); 1008| 3.41k| auto tail = get<3>(subs); 1009| 3.41k| IMMER_TRY { ------------------ | | 49| 3.41k|#define IMMER_TRY try ------------------ 1010| 3.41k| if (next) { ------------------ | Branch (1010:21): [True: 314, False: 3.09k] ------------------ 1011| 314| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 314] ------------------ 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| 314| } else { 1016| 314| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 314| newn->inner()[idx] = next; 1018| 314| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 314] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 314| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 314| } 1022| 3.09k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.18k, False: 1.91k] ------------------ 1023| 1.18k| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 1.18k] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.18k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.91k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.91k] | 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.91k| } else { 1034| 1.91k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 1.91k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.91k| } else { 1038| 1.91k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.91k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 1.91k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 1.91k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.91k| } 1043| 1.91k| } 1044| 3.41k| } 1045| 3.41k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 3.41k| } 1055| 3.41k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb0EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 480| { 1060| 480| auto old_tail_size = pos.count(); 1061| 480| auto new_tail_size = pos.index(last) + 1; 1062| 480| auto node = pos.node(); 1063| 480| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 480] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 480| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 203, False: 277] ------------------ 1065| 203| if (!Mutating) ------------------ | Branch (1065:17): [True: 203, Folded] ------------------ 1066| 203| node->inc(); 1067| 203| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 277| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 277] ------------------ 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| 277| } else { 1073| 277| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 277| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 277] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 277| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 277| } 1078| 480| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb1EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 2.23k| { 1060| 2.23k| auto old_tail_size = pos.count(); 1061| 2.23k| auto new_tail_size = pos.index(last) + 1; 1062| 2.23k| auto node = pos.node(); 1063| 2.23k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 2.23k, Folded] | Branch (1063:42): [True: 321, False: 1.91k] ------------------ 1064| 2.23k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 246, False: 1.99k] ------------------ 1065| 246| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 246] ------------------ 1066| 0| node->inc(); 1067| 246| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.99k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 303, False: 1.69k] ------------------ 1069| 303| detail::destroy_n(node->leaf() + new_tail_size, 1070| 303| old_tail_size - new_tail_size); 1071| 303| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.69k| } else { 1073| 1.69k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.69k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.69k, Folded] ------------------ 1075| 1.69k| pos.visit(dec_visitor{}); 1076| 1.69k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.69k| } 1078| 2.23k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb1EE13visit_regularIRNS1_11regular_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 6.00k| { 992| 6.00k| auto idx = pos.index(last); 993| 6.00k| auto node = pos.node(); 994| 6.00k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 6.00k, Folded] | Branch (994:35): [True: 5.38k, False: 622] ------------------ 995| 6.00k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 6.00k] | 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| 6.00k| } else { 1002| 6.00k| using std::get; 1003| 6.00k| auto subs = 1004| 6.00k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 5.38k, False: 622] ------------------ 1005| 6.00k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 6.00k| auto next = get<1>(subs); 1007| 6.00k| auto ts = get<2>(subs); 1008| 6.00k| auto tail = get<3>(subs); 1009| 6.00k| IMMER_TRY { ------------------ | | 49| 6.00k|#define IMMER_TRY try ------------------ 1010| 6.00k| if (next) { ------------------ | Branch (1010:21): [True: 1.54k, False: 4.46k] ------------------ 1011| 1.54k| if (mutate) { ------------------ | Branch (1011:25): [True: 1.34k, False: 204] ------------------ 1012| 1.34k| node->inner()[idx] = next; 1013| 1.34k| pos.each_right(dec_visitor{}, idx + 1); 1014| 1.34k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 1.34k| } else { 1016| 204| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 204| newn->inner()[idx] = next; 1018| 204| if (Mutating) ------------------ | Branch (1018:29): [True: 204, Folded] ------------------ 1019| 204| pos.visit(dec_visitor{}); 1020| 204| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 204| } 1022| 4.46k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 3.71k, False: 747] ------------------ 1023| 3.71k| if (Mutating) ------------------ | Branch (1023:25): [True: 3.71k, Folded] ------------------ 1024| 3.71k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 3.71k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 3.71k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 747] | 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| 747| } else { 1034| 747| if (mutate) { ------------------ | Branch (1034:25): [True: 536, False: 211] ------------------ 1035| 536| pos.each_right(dec_visitor{}, idx + 1); 1036| 536| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 536| } else { 1038| 211| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 211| if (Mutating) ------------------ | Branch (1039:29): [True: 211, Folded] ------------------ 1040| 211| pos.visit(dec_visitor{}); 1041| 211| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 211| } 1043| 747| } 1044| 6.00k| } 1045| 6.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| 6.00k| } 1055| 6.00k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_j: 878| 3.71k| { 879| 3.71k| using node_t = node_type; 880| 3.71k| auto node = p.node(); 881| 3.71k| if (node->dec()) { ------------------ | Branch (881:13): [True: 3.50k, False: 207] ------------------ 882| 3.50k| p.each_right(dec_t{}, idx); 883| 3.50k| node_t::delete_inner(node, p.count()); 884| 3.50k| } 885| 3.71k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 2.39k| { 1060| 2.39k| auto old_tail_size = pos.count(); 1061| 2.39k| auto new_tail_size = pos.index(last) + 1; 1062| 2.39k| auto node = pos.node(); 1063| 2.39k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 2.39k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 2.39k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 693, False: 1.69k] ------------------ 1065| 693| if (!Mutating) ------------------ | Branch (1065:17): [True: 693, Folded] ------------------ 1066| 693| node->inc(); 1067| 693| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.69k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 1.69k] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.69k| } else { 1073| 1.69k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.69k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 1.69k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 1.69k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.69k| } 1078| 2.39k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE13visit_regularIRNS1_11regular_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 3.08k| { 992| 3.08k| auto idx = pos.index(last); 993| 3.08k| auto node = pos.node(); 994| 3.08k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.08k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.08k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.08k] | 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.08k| } else { 1002| 3.08k| using std::get; 1003| 3.08k| auto subs = 1004| 3.08k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.08k] ------------------ 1005| 3.08k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.08k| auto next = get<1>(subs); 1007| 3.08k| auto ts = get<2>(subs); 1008| 3.08k| auto tail = get<3>(subs); 1009| 3.08k| IMMER_TRY { ------------------ | | 49| 3.08k|#define IMMER_TRY try ------------------ 1010| 3.08k| if (next) { ------------------ | Branch (1010:21): [True: 394, False: 2.69k] ------------------ 1011| 394| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 394] ------------------ 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| 394| } else { 1016| 394| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 394| newn->inner()[idx] = next; 1018| 394| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 394] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 394| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 394| } 1022| 2.69k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.97k, False: 718] ------------------ 1023| 1.97k| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 1.97k] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.97k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.97k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 718] | 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| 718| } else { 1034| 718| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 718] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 718| } else { 1038| 718| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 718| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 718] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 718| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 718| } 1043| 718| } 1044| 3.08k| } 1045| 3.08k| 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.08k| } 1055| 3.08k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_j: 867| 42.1k| { 868| 42.1k| using node_t = node_type; 869| 42.1k| auto node = p.node(); 870| 42.1k| if (node->dec()) { ------------------ | Branch (870:13): [True: 36.3k, False: 5.83k] ------------------ 871| 36.3k| p.each_right(dec_t{}, idx); 872| 36.3k| node_t::delete_inner_r(node, p.count()); 873| 36.3k| } 874| 42.1k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 4.01k| { 1060| 4.01k| auto old_tail_size = pos.count(); 1061| 4.01k| auto new_tail_size = pos.index(last) + 1; 1062| 4.01k| auto node = pos.node(); 1063| 4.01k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 4.01k, Folded] | Branch (1063:42): [True: 1.16k, False: 2.85k] ------------------ 1064| 4.01k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.33k, False: 2.68k] ------------------ 1065| 1.33k| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 1.33k] ------------------ 1066| 0| node->inc(); 1067| 1.33k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 2.68k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 1.08k, False: 1.59k] ------------------ 1069| 1.08k| detail::destroy_n(node->leaf() + new_tail_size, 1070| 1.08k| old_tail_size - new_tail_size); 1071| 1.08k| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.59k| } else { 1073| 1.59k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.59k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.59k, Folded] ------------------ 1075| 1.59k| pos.visit(dec_visitor{}); 1076| 1.59k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.59k| } 1078| 4.01k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 913| 11.5k| { 914| 11.5k| auto idx = pos.index(last); 915| 11.5k| auto node = pos.node(); 916| 11.5k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 11.5k, Folded] | Branch (916:35): [True: 8.74k, False: 2.78k] ------------------ 917| 11.5k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 11.5k] | 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| 11.5k| } else { 924| 11.5k| using std::get; 925| 11.5k| auto subs = 926| 11.5k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 8.74k, False: 2.78k] ------------------ 927| 11.5k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 11.5k| auto next = get<1>(subs); 929| 11.5k| auto ts = get<2>(subs); 930| 11.5k| auto tail = get<3>(subs); 931| 11.5k| IMMER_TRY { ------------------ | | 49| 11.5k|#define IMMER_TRY try ------------------ 932| 11.5k| if (next) { ------------------ | Branch (932:21): [True: 6.14k, False: 5.39k] ------------------ 933| 6.14k| if (mutate) { ------------------ | Branch (933:25): [True: 4.64k, False: 1.49k] ------------------ 934| 4.64k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 4.64k| pos.each_right(dec_visitor{}, idx + 1); 936| 4.64k| node->inner()[idx] = next; 937| 4.64k| nodr->d.sizes[idx] = last + 1 - ts; 938| 4.64k| nodr->d.count = idx + 1; 939| 4.64k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 4.64k, False: 0] ------------------ 940| 4.64k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 4.64k| } else { 942| 1.49k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 1.49k| auto newr = newn->relaxed(); 944| 1.49k| newn->inner()[idx] = next; 945| 1.49k| newr->d.sizes[idx] = last + 1 - ts; 946| 1.49k| newr->d.count = idx + 1; 947| 1.49k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 1.49k, False: 0] ------------------ 948| 1.49k| if (Mutating) ------------------ | Branch (948:29): [True: 1.49k, Folded] ------------------ 949| 1.49k| pos.visit(dec_visitor{}); 950| 1.49k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 1.49k| } 952| 6.14k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 2.20k, False: 3.19k] ------------------ 953| 2.20k| if (Mutating) ------------------ | Branch (953:25): [True: 2.20k, Folded] ------------------ 954| 2.20k| pos.visit(dec_right_visitor{}, count_t{1}); 955| 2.20k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 3.19k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 3.19k] | 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| 3.19k| } else { 964| 3.19k| if (mutate) { ------------------ | Branch (964:25): [True: 2.53k, False: 656] ------------------ 965| 2.53k| pos.each_right(dec_visitor{}, idx + 1); 966| 2.53k| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 2.53k| return std::make_tuple(pos.shift(), node, ts, tail); 968| 2.53k| } else { 969| 656| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 656| if (Mutating) ------------------ | Branch (970:29): [True: 656, Folded] ------------------ 971| 656| pos.visit(dec_visitor{}); 972| 656| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 656| } 974| 3.19k| } 975| 11.5k| } 976| 11.5k| 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| 11.5k| } 987| 11.5k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 7.78k| { 992| 7.78k| auto idx = pos.index(last); 993| 7.78k| auto node = pos.node(); 994| 7.78k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 7.78k, Folded] | Branch (994:35): [True: 6.72k, False: 1.06k] ------------------ 995| 7.78k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 7.78k] | 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| 7.78k| } else { 1002| 7.78k| using std::get; 1003| 7.78k| auto subs = 1004| 7.78k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 6.72k, False: 1.06k] ------------------ 1005| 7.78k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 7.78k| auto next = get<1>(subs); 1007| 7.78k| auto ts = get<2>(subs); 1008| 7.78k| auto tail = get<3>(subs); 1009| 7.78k| IMMER_TRY { ------------------ | | 49| 7.78k|#define IMMER_TRY try ------------------ 1010| 7.78k| if (next) { ------------------ | Branch (1010:21): [True: 2.94k, False: 4.84k] ------------------ 1011| 2.94k| if (mutate) { ------------------ | Branch (1011:25): [True: 2.63k, False: 305] ------------------ 1012| 2.63k| node->inner()[idx] = next; 1013| 2.63k| pos.each_right(dec_visitor{}, idx + 1); 1014| 2.63k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 2.63k| } else { 1016| 305| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 305| newn->inner()[idx] = next; 1018| 305| if (Mutating) ------------------ | Branch (1018:29): [True: 305, Folded] ------------------ 1019| 305| pos.visit(dec_visitor{}); 1020| 305| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 305| } 1022| 4.84k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.26k, False: 3.58k] ------------------ 1023| 1.26k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.26k, Folded] ------------------ 1024| 1.26k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.26k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 3.58k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 3.58k] | Branch (1026:40): [True: 0, False: 0] | Branch (1026:52): [True: 0, False: 0] ------------------ 1027| 0| auto newn = pos.node()->inner()[0]; 1028| 0| if (!mutate) ------------------ | Branch (1028:25): [True: 0, False: 0] ------------------ 1029| 0| newn->inc(); 1030| 0| if (Mutating) ------------------ | Branch (1030:25): [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| 3.58k| } else { 1034| 3.58k| if (mutate) { ------------------ | Branch (1034:25): [True: 3.21k, False: 373] ------------------ 1035| 3.21k| pos.each_right(dec_visitor{}, idx + 1); 1036| 3.21k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 3.21k| } else { 1038| 373| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 373| if (Mutating) ------------------ | Branch (1039:29): [True: 373, Folded] ------------------ 1040| 373| pos.visit(dec_visitor{}); 1041| 373| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 373| } 1043| 3.58k| } 1044| 7.78k| } 1045| 7.78k| 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| 7.78k| } 1055| 7.78k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_j: 878| 10.8k| { 879| 10.8k| using node_t = node_type; 880| 10.8k| auto node = p.node(); 881| 10.8k| if (node->dec()) { ------------------ | Branch (881:13): [True: 7.64k, False: 3.20k] ------------------ 882| 7.64k| p.each_right(dec_t{}, idx); 883| 7.64k| node_t::delete_inner(node, p.count()); 884| 7.64k| } 885| 10.8k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 5.04k| { 1060| 5.04k| auto old_tail_size = pos.count(); 1061| 5.04k| auto new_tail_size = pos.index(last) + 1; 1062| 5.04k| auto node = pos.node(); 1063| 5.04k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 5.04k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 5.04k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.32k, False: 3.71k] ------------------ 1065| 1.32k| if (!Mutating) ------------------ | Branch (1065:17): [True: 1.32k, Folded] ------------------ 1066| 1.32k| node->inc(); 1067| 1.32k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 3.71k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 3.71k] ------------------ 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.71k| } else { 1073| 3.71k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 3.71k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 3.71k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 3.71k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 3.71k| } 1078| 5.04k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 913| 6.33k| { 914| 6.33k| auto idx = pos.index(last); 915| 6.33k| auto node = pos.node(); 916| 6.33k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 6.33k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 6.33k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 6.33k] | 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| 6.33k| } else { 924| 6.33k| using std::get; 925| 6.33k| auto subs = 926| 6.33k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 6.33k] ------------------ 927| 6.33k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 6.33k| auto next = get<1>(subs); 929| 6.33k| auto ts = get<2>(subs); 930| 6.33k| auto tail = get<3>(subs); 931| 6.33k| IMMER_TRY { ------------------ | | 49| 6.33k|#define IMMER_TRY try ------------------ 932| 6.33k| if (next) { ------------------ | Branch (932:21): [True: 1.02k, False: 5.30k] ------------------ 933| 1.02k| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 1.02k] ------------------ 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| 1.02k| } else { 942| 1.02k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 1.02k| auto newr = newn->relaxed(); 944| 1.02k| newn->inner()[idx] = next; 945| 1.02k| newr->d.sizes[idx] = last + 1 - ts; 946| 1.02k| newr->d.count = idx + 1; 947| 1.02k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 1.02k, False: 0] ------------------ 948| 1.02k| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 1.02k] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 1.02k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 1.02k| } 952| 5.30k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 3.73k, False: 1.57k] ------------------ 953| 3.73k| if (Mutating) ------------------ | Branch (953:25): [Folded, False: 3.73k] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 3.73k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 3.73k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 1.57k] | 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.57k| } else { 964| 1.57k| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 1.57k] ------------------ 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.57k| } else { 969| 1.57k| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 1.57k| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 1.57k] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 1.57k| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 1.57k| } 974| 1.57k| } 975| 6.33k| } 976| 6.33k| 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| 6.33k| } 987| 6.33k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 3.13k| { 992| 3.13k| auto idx = pos.index(last); 993| 3.13k| auto node = pos.node(); 994| 3.13k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.13k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.13k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.13k] | 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.13k| } else { 1002| 3.13k| using std::get; 1003| 3.13k| auto subs = 1004| 3.13k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.13k] ------------------ 1005| 3.13k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.13k| auto next = get<1>(subs); 1007| 3.13k| auto ts = get<2>(subs); 1008| 3.13k| auto tail = get<3>(subs); 1009| 3.13k| IMMER_TRY { ------------------ | | 49| 3.13k|#define IMMER_TRY try ------------------ 1010| 3.13k| if (next) { ------------------ | Branch (1010:21): [True: 810, False: 2.32k] ------------------ 1011| 810| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 810] ------------------ 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| 810| } else { 1016| 810| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 810| newn->inner()[idx] = next; 1018| 810| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 810] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 810| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 810| } 1022| 2.32k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 657, False: 1.66k] ------------------ 1023| 657| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 657] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 657| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.66k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.66k] | 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.66k| } else { 1034| 1.66k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 1.66k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.66k| } else { 1038| 1.66k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.66k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 1.66k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 1.66k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.66k| } 1043| 1.66k| } 1044| 3.13k| } 1045| 3.13k| 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.13k| } 1055| 3.13k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 12.2k| { 992| 12.2k| auto idx = pos.index(last); 993| 12.2k| auto node = pos.node(); 994| 12.2k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 12.2k, Folded] | Branch (994:35): [True: 8.66k, False: 3.61k] ------------------ 995| 12.2k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 12.2k, Folded] | Branch (995:25): [True: 7.22k, False: 5.04k] ------------------ 996| 7.22k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 5.16k, False: 2.06k] ------------------ 997| 7.22k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 7.22k| if (Mutating) ------------------ | Branch (998:17): [True: 7.22k, Folded] ------------------ 999| 7.22k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 7.22k| return res; 1001| 7.22k| } else { 1002| 5.04k| using std::get; 1003| 5.04k| auto subs = 1004| 5.04k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.49k, False: 1.54k] ------------------ 1005| 5.04k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 5.04k| auto next = get<1>(subs); 1007| 5.04k| auto ts = get<2>(subs); 1008| 5.04k| auto tail = get<3>(subs); 1009| 5.04k| IMMER_TRY { ------------------ | | 49| 5.04k|#define IMMER_TRY try ------------------ 1010| 5.04k| if (next) { ------------------ | Branch (1010:21): [True: 1.04k, False: 4.00k] ------------------ 1011| 1.04k| if (mutate) { ------------------ | Branch (1011:25): [True: 772, False: 274] ------------------ 1012| 772| node->inner()[idx] = next; 1013| 772| pos.each_right(dec_visitor{}, idx + 1); 1014| 772| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 772| } else { 1016| 274| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 274| newn->inner()[idx] = next; 1018| 274| if (Mutating) ------------------ | Branch (1018:29): [True: 274, Folded] ------------------ 1019| 274| pos.visit(dec_visitor{}); 1020| 274| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 274| } 1022| 4.00k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 4.00k] ------------------ 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.00k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 4.00k, Folded] | Branch (1026:40): [True: 3.51k, False: 483] | Branch (1026:52): [True: 2.36k, False: 1.15k] ------------------ 1027| 2.36k| auto newn = pos.node()->inner()[0]; 1028| 2.36k| if (!mutate) ------------------ | Branch (1028:25): [True: 760, False: 1.60k] ------------------ 1029| 760| newn->inc(); 1030| 2.36k| if (Mutating) ------------------ | Branch (1030:25): [True: 2.36k, Folded] ------------------ 1031| 2.36k| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 2.36k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 2.36k| } else { 1034| 1.63k| if (mutate) { ------------------ | Branch (1034:25): [True: 1.12k, False: 514] ------------------ 1035| 1.12k| pos.each_right(dec_visitor{}, idx + 1); 1036| 1.12k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.12k| } else { 1038| 514| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 514| if (Mutating) ------------------ | Branch (1039:29): [True: 514, Folded] ------------------ 1040| 514| pos.visit(dec_visitor{}); 1041| 514| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 514| } 1043| 1.63k| } 1044| 5.04k| } 1045| 5.04k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 5.04k| } 1055| 12.2k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb1EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 1.55k| { 1060| 1.55k| auto old_tail_size = pos.count(); 1061| 1.55k| auto new_tail_size = pos.index(last) + 1; 1062| 1.55k| auto node = pos.node(); 1063| 1.55k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.55k, Folded] | Branch (1063:42): [True: 635, False: 921] ------------------ 1064| 1.55k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 565, False: 991] ------------------ 1065| 565| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 565] ------------------ 1066| 0| node->inc(); 1067| 565| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 991| } else if (mutate) { ------------------ | Branch (1068:20): [True: 561, False: 430] ------------------ 1069| 561| detail::destroy_n(node->leaf() + new_tail_size, 1070| 561| old_tail_size - new_tail_size); 1071| 561| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 561| } else { 1073| 430| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 430| if (Mutating) ------------------ | Branch (1074:17): [True: 430, Folded] ------------------ 1075| 430| pos.visit(dec_visitor{}); 1076| 430| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 430| } 1078| 1.55k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 3.82k| { 992| 3.82k| auto idx = pos.index(last); 993| 3.82k| auto node = pos.node(); 994| 3.82k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.82k, Folded] | Branch (994:35): [True: 1.68k, False: 2.13k] ------------------ 995| 3.82k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 3.82k, Folded] | Branch (995:25): [True: 1.49k, False: 2.33k] ------------------ 996| 1.49k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 874, False: 616] ------------------ 997| 1.49k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 1.49k| if (Mutating) ------------------ | Branch (998:17): [True: 1.49k, Folded] ------------------ 999| 1.49k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 1.49k| return res; 1001| 2.33k| } else { 1002| 2.33k| using std::get; 1003| 2.33k| auto subs = 1004| 2.33k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 809, False: 1.52k] ------------------ 1005| 2.33k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 2.33k| auto next = get<1>(subs); 1007| 2.33k| auto ts = get<2>(subs); 1008| 2.33k| auto tail = get<3>(subs); 1009| 2.33k| IMMER_TRY { ------------------ | | 49| 2.33k|#define IMMER_TRY try ------------------ 1010| 2.33k| if (next) { ------------------ | Branch (1010:21): [True: 581, False: 1.75k] ------------------ 1011| 581| if (mutate) { ------------------ | Branch (1011:25): [True: 321, False: 260] ------------------ 1012| 321| node->inner()[idx] = next; 1013| 321| pos.each_right(dec_visitor{}, idx + 1); 1014| 321| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 321| } else { 1016| 260| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 260| newn->inner()[idx] = next; 1018| 260| if (Mutating) ------------------ | Branch (1018:29): [True: 260, Folded] ------------------ 1019| 260| pos.visit(dec_visitor{}); 1020| 260| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 260| } 1022| 1.75k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 1.75k] ------------------ 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.75k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 1.75k, Folded] | Branch (1026:40): [True: 1.25k, False: 501] | Branch (1026:52): [True: 458, False: 792] ------------------ 1027| 458| auto newn = pos.node()->inner()[0]; 1028| 458| if (!mutate) ------------------ | Branch (1028:25): [True: 201, False: 257] ------------------ 1029| 201| newn->inc(); 1030| 458| if (Mutating) ------------------ | Branch (1030:25): [True: 458, Folded] ------------------ 1031| 458| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 458| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 1.29k| } else { 1034| 1.29k| if (mutate) { ------------------ | Branch (1034:25): [True: 231, False: 1.06k] ------------------ 1035| 231| pos.each_right(dec_visitor{}, idx + 1); 1036| 231| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.06k| } else { 1038| 1.06k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.06k| if (Mutating) ------------------ | Branch (1039:29): [True: 1.06k, Folded] ------------------ 1040| 1.06k| pos.visit(dec_visitor{}); 1041| 1.06k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.06k| } 1043| 1.29k| } 1044| 2.33k| } 1045| 2.33k| 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| 2.33k| } 1055| 3.82k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb1EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 658| { 1060| 658| auto old_tail_size = pos.count(); 1061| 658| auto new_tail_size = pos.index(last) + 1; 1062| 658| auto node = pos.node(); 1063| 658| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 658, Folded] | Branch (1063:42): [True: 202, False: 456] ------------------ 1064| 658| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 227, False: 431] ------------------ 1065| 227| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 227] ------------------ 1066| 0| node->inc(); 1067| 227| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 431| } else if (mutate) { ------------------ | Branch (1068:20): [True: 195, False: 236] ------------------ 1069| 195| detail::destroy_n(node->leaf() + new_tail_size, 1070| 195| old_tail_size - new_tail_size); 1071| 195| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 236| } else { 1073| 236| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 236| if (Mutating) ------------------ | Branch (1074:17): [True: 236, Folded] ------------------ 1075| 236| pos.visit(dec_visitor{}); 1076| 236| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 236| } 1078| 658| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 695| { 1378| 695| auto node = pos.node(); 1379| 695| auto idx = pos.index(first); 1380| 695| auto count = pos.count(); 1381| 695| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 695| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 446, False: 249] ------------------ 1384| 695| if (mutate) { ------------------ | Branch (1384:13): [True: 446, False: 249] ------------------ 1385| 446| auto data = node->leaf(); 1386| 446| auto newcount = count - idx; 1387| 446| std::move(data + idx, data + count, data); 1388| 446| detail::destroy_n(data + newcount, idx); 1389| 446| return std::make_tuple(0, node); 1390| 446| } else { 1391| 249| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 249| if (Mutating) ------------------ | Branch (1392:17): [True: 249, Folded] ------------------ 1393| 249| pos.visit(dec_visitor{}); 1394| 249| return std::make_tuple(0, newn); 1395| 249| } 1396| 695| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1246| 36.4k| { 1247| 36.4k| auto idx = pos.subindex(first); 1248| 36.4k| auto count = pos.count(); 1249| 36.4k| auto node = pos.node(); 1250| 36.4k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 36.4k, Folded] | Branch (1250:47): [True: 26.7k, False: 9.71k] ------------------ 1251| 36.4k| auto left_size = pos.size_before(idx); 1252| 36.4k| auto child_size = pos.size_sbh(idx, left_size); 1253| 36.4k| auto dropped_size = first; 1254| 36.4k| auto child_dropped_size = dropped_size - left_size; 1255| 36.4k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 36.4k, Folded] | Branch (1255:25): [True: 35.0k, False: 1.45k] | Branch (1255:45): [True: 8.72k, False: 26.3k] ------------------ 1256| 8.72k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 5.30k, False: 3.41k] ------------------ 1257| 8.72k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 8.72k| if (mutate) ------------------ | Branch (1258:17): [True: 5.30k, False: 3.41k] ------------------ 1259| 5.30k| pos.visit(dec_left_visitor{}, idx); 1260| 3.41k| else if (Mutating) ------------------ | Branch (1260:22): [True: 3.41k, Folded] ------------------ 1261| 3.41k| pos.visit(dec_visitor{}); 1262| 8.72k| return r; 1263| 27.7k| } else { 1264| 27.7k| using std::get; 1265| 27.7k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 21.4k, False: 6.29k] ------------------ 1266| 27.7k| : node_t::make_inner_r_e(e); 1267| 27.7k| auto newr = newn->relaxed(); 1268| 27.7k| auto newcount = count - idx; 1269| 27.7k| auto new_child_size = child_size - child_dropped_size; 1270| 27.7k| IMMER_TRY { ------------------ | | 49| 27.7k|#define IMMER_TRY try ------------------ 1271| 27.7k| auto subs = 1272| 27.7k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 21.4k, False: 6.29k] ------------------ 1273| 27.7k| : pos.towards_sub_oh( 1274| 6.29k| no_collapse_no_mut_t{}, first, idx, e); 1275| 27.7k| if (mutate) ------------------ | Branch (1275:21): [True: 21.4k, False: 6.29k] ------------------ 1276| 21.4k| pos.each_left(dec_visitor{}, idx); 1277| 27.7k| pos.copy_sizes( 1278| 27.7k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 27.7k| std::copy(node->inner() + idx + 1, 1280| 27.7k| node->inner() + count, 1281| 27.7k| newn->inner() + 1); 1282| 27.7k| newn->inner()[0] = get<1>(subs); 1283| 27.7k| newr->d.sizes[0] = new_child_size; 1284| 27.7k| newr->d.count = newcount; 1285| 27.7k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 27.7k, False: 0] ------------------ 1286| 27.7k| if (!mutate) { ------------------ | Branch (1286:21): [True: 6.29k, False: 21.4k] ------------------ 1287| 6.29k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 6.29k| if (Mutating) ------------------ | Branch (1288:25): [True: 6.29k, Folded] ------------------ 1289| 6.29k| pos.visit(dec_visitor{}); 1290| 6.29k| } 1291| 27.7k| return std::make_tuple(pos.shift(), newn); 1292| 27.7k| } 1293| 27.7k| 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| 27.7k| } 1299| 36.4k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1246| 2.72k| { 1247| 2.72k| auto idx = pos.subindex(first); 1248| 2.72k| auto count = pos.count(); 1249| 2.72k| auto node = pos.node(); 1250| 2.72k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 2.72k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 2.72k| auto left_size = pos.size_before(idx); 1252| 2.72k| auto child_size = pos.size_sbh(idx, left_size); 1253| 2.72k| auto dropped_size = first; 1254| 2.72k| auto child_dropped_size = dropped_size - left_size; 1255| 2.72k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 2.72k, Folded] | Branch (1255:25): [True: 1.48k, False: 1.24k] | Branch (1255:45): [True: 1.04k, False: 444] ------------------ 1256| 1.04k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 1.04k] ------------------ 1257| 1.04k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 1.04k| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 1.04k] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 1.04k| else if (Mutating) ------------------ | Branch (1260:22): [Folded, False: 1.04k] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 1.04k| return r; 1263| 1.68k| } else { 1264| 1.68k| using std::get; 1265| 1.68k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 1.68k] ------------------ 1266| 1.68k| : node_t::make_inner_r_e(e); 1267| 1.68k| auto newr = newn->relaxed(); 1268| 1.68k| auto newcount = count - idx; 1269| 1.68k| auto new_child_size = child_size - child_dropped_size; 1270| 1.68k| IMMER_TRY { ------------------ | | 49| 1.68k|#define IMMER_TRY try ------------------ 1271| 1.68k| auto subs = 1272| 1.68k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 1.68k] ------------------ 1273| 1.68k| : pos.towards_sub_oh( 1274| 1.68k| no_collapse_no_mut_t{}, first, idx, e); 1275| 1.68k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 1.68k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 1.68k| pos.copy_sizes( 1278| 1.68k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 1.68k| std::copy(node->inner() + idx + 1, 1280| 1.68k| node->inner() + count, 1281| 1.68k| newn->inner() + 1); 1282| 1.68k| newn->inner()[0] = get<1>(subs); 1283| 1.68k| newr->d.sizes[0] = new_child_size; 1284| 1.68k| newr->d.count = newcount; 1285| 1.68k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 1.68k, False: 0] ------------------ 1286| 1.68k| if (!mutate) { ------------------ | Branch (1286:21): [True: 1.68k, False: 0] ------------------ 1287| 1.68k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 1.68k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 1.68k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 1.68k| } 1291| 1.68k| return std::make_tuple(pos.shift(), newn); 1292| 1.68k| } 1293| 1.68k| 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.68k| } 1299| 2.72k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 2.66k| { 1304| 2.66k| auto idx = pos.subindex(first); 1305| 2.66k| auto count = pos.count(); 1306| 2.66k| auto node = pos.node(); 1307| 2.66k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.66k] ------------------ 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): [True: 0, Folded] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 2.66k| auto left_size = pos.size_before(idx); 1313| 2.66k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.66k| auto dropped_size = first; 1315| 2.66k| auto child_dropped_size = dropped_size - left_size; 1316| 2.66k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 2.66k, Folded] | Branch (1316:25): [True: 1.50k, False: 1.15k] | Branch (1316:45): [True: 1.09k, False: 411] ------------------ 1317| 1.09k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 1.09k] ------------------ 1318| 1.09k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 1.09k| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 1.09k] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 1.09k| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 1.09k] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 1.09k| return r; 1324| 1.56k| } else { 1325| 1.56k| 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.56k| auto newcount = count - idx; 1330| 1.56k| auto newn = 1331| 1.56k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.56k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.56k| : node_t::make_inner_r_e(e); 1336| 1.56k| auto newr = newn->relaxed(); 1337| 1.56k| IMMER_TRY { ------------------ | | 49| 1.56k|#define IMMER_TRY try ------------------ 1338| 1.56k| auto subs = 1339| 1.56k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.56k] ------------------ 1340| 1.56k| : pos.towards_sub_oh( 1341| 1.56k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.56k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.56k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.56k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.56k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.56k, False: 0] ------------------ 1346| 1.56k| pos.copy_sizes( 1347| 1.56k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.56k| newr->d.count = newcount; 1349| 1.56k| newn->inner()[0] = get<1>(subs); 1350| 1.56k| std::copy(node->inner() + idx + 1, 1351| 1.56k| node->inner() + count, 1352| 1.56k| newn->inner() + 1); 1353| 1.56k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.56k, False: 0] ------------------ 1354| 1.56k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.56k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.56k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.56k| } 1358| 1.56k| return std::make_tuple(pos.shift(), newn); 1359| 1.56k| } 1360| 1.56k| 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.56k| } 1373| 2.66k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 2.78k| { 1304| 2.78k| auto idx = pos.subindex(first); 1305| 2.78k| auto count = pos.count(); 1306| 2.78k| auto node = pos.node(); 1307| 2.78k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.78k] ------------------ 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): [True: 0, Folded] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 2.78k| auto left_size = pos.size_before(idx); 1313| 2.78k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.78k| auto dropped_size = first; 1315| 2.78k| auto child_dropped_size = dropped_size - left_size; 1316| 2.78k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 2.78k, Folded] | Branch (1316:25): [True: 582, False: 2.20k] | Branch (1316:45): [True: 368, False: 214] ------------------ 1317| 368| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 368] ------------------ 1318| 368| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 368| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 368] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 368| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 368] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 368| return r; 1324| 2.41k| } else { 1325| 2.41k| 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.41k| auto newcount = count - idx; 1330| 2.41k| auto newn = 1331| 2.41k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 2.41k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 2.41k| : node_t::make_inner_r_e(e); 1336| 2.41k| auto newr = newn->relaxed(); 1337| 2.41k| IMMER_TRY { ------------------ | | 49| 2.41k|#define IMMER_TRY try ------------------ 1338| 2.41k| auto subs = 1339| 2.41k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 2.41k] ------------------ 1340| 2.41k| : pos.towards_sub_oh( 1341| 2.41k| no_collapse_no_mut_t{}, first, idx, e); 1342| 2.41k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 2.41k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 2.41k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 2.41k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 2.41k, False: 0] ------------------ 1346| 2.41k| pos.copy_sizes( 1347| 2.41k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 2.41k| newr->d.count = newcount; 1349| 2.41k| newn->inner()[0] = get<1>(subs); 1350| 2.41k| std::copy(node->inner() + idx + 1, 1351| 2.41k| node->inner() + count, 1352| 2.41k| newn->inner() + 1); 1353| 2.41k| if (!mutate) { ------------------ | Branch (1353:21): [True: 2.41k, False: 0] ------------------ 1354| 2.41k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 2.41k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 2.41k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 2.41k| } 1358| 2.41k| return std::make_tuple(pos.shift(), newn); 1359| 2.41k| } 1360| 2.41k| 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.41k| } 1373| 2.78k| } _ZN5immer6detail4rbts16dec_left_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_j: 1209| 312| { 1210| 312| using node_t = node_type; 1211| 312| auto node = p.node(); 1212| 312| if (node->dec()) { ------------------ | Branch (1212:13): [True: 312, False: 0] ------------------ 1213| 312| p.each_left(dec_t{}, idx); 1214| 312| node_t::delete_inner(node, p.count()); 1215| 312| } 1216| 312| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb1EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 3.18k| { 1378| 3.18k| auto node = pos.node(); 1379| 3.18k| auto idx = pos.index(first); 1380| 3.18k| auto count = pos.count(); 1381| 3.18k| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 3.18k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 528, False: 2.65k] ------------------ 1384| 3.18k| if (mutate) { ------------------ | Branch (1384:13): [True: 528, False: 2.65k] ------------------ 1385| 528| auto data = node->leaf(); 1386| 528| auto newcount = count - idx; 1387| 528| std::move(data + idx, data + count, data); 1388| 528| detail::destroy_n(data + newcount, idx); 1389| 528| return std::make_tuple(0, node); 1390| 2.65k| } else { 1391| 2.65k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 2.65k| if (Mutating) ------------------ | Branch (1392:17): [True: 2.65k, Folded] ------------------ 1393| 2.65k| pos.visit(dec_visitor{}); 1394| 2.65k| return std::make_tuple(0, newn); 1395| 2.65k| } 1396| 3.18k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 1.99k| { 1304| 1.99k| auto idx = pos.subindex(first); 1305| 1.99k| auto count = pos.count(); 1306| 1.99k| auto node = pos.node(); 1307| 1.99k| 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| 1.99k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 692, False: 1.30k] ------------------ 1312| 1.99k| auto left_size = pos.size_before(idx); 1313| 1.99k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.99k| auto dropped_size = first; 1315| 1.99k| auto child_dropped_size = dropped_size - left_size; 1316| 1.99k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.99k] | 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.99k| } else { 1325| 1.99k| 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.99k| auto newcount = count - idx; 1330| 1.99k| auto newn = 1331| 1.99k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 692, False: 1.30k] ------------------ 1332| 692| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 692| norefs_tag{})) relaxed_t, 1334| 692| node) 1335| 1.99k| : node_t::make_inner_r_e(e); 1336| 1.99k| auto newr = newn->relaxed(); 1337| 1.99k| IMMER_TRY { ------------------ | | 49| 1.99k|#define IMMER_TRY try ------------------ 1338| 1.99k| auto subs = 1339| 1.99k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 692, False: 1.30k] ------------------ 1340| 1.99k| : pos.towards_sub_oh( 1341| 1.30k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.99k| if (mutate) ------------------ | Branch (1342:21): [True: 692, False: 1.30k] ------------------ 1343| 692| pos.each_left(dec_visitor{}, idx); 1344| 1.99k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.99k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.99k, False: 0] ------------------ 1346| 1.99k| pos.copy_sizes( 1347| 1.99k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.99k| newr->d.count = newcount; 1349| 1.99k| newn->inner()[0] = get<1>(subs); 1350| 1.99k| std::copy(node->inner() + idx + 1, 1351| 1.99k| node->inner() + count, 1352| 1.99k| newn->inner() + 1); 1353| 1.99k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.30k, False: 692] ------------------ 1354| 1.30k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.30k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.30k, Folded] ------------------ 1356| 1.30k| pos.visit(dec_visitor{}); 1357| 1.30k| } 1358| 1.99k| return std::make_tuple(pos.shift(), newn); 1359| 1.99k| } 1360| 1.99k| 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.99k| } 1373| 1.99k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 10.1k| { 1378| 10.1k| auto node = pos.node(); 1379| 10.1k| auto idx = pos.index(first); 1380| 10.1k| auto count = pos.count(); 1381| 10.1k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 10.1k] ------------------ 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| 10.1k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 10.1k] ------------------ 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| 10.1k| } else { 1391| 10.1k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 10.1k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 10.1k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 10.1k| return std::make_tuple(0, newn); 1395| 10.1k| } 1396| 10.1k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 3.41k| { 1304| 3.41k| auto idx = pos.subindex(first); 1305| 3.41k| auto count = pos.count(); 1306| 3.41k| auto node = pos.node(); 1307| 3.41k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 3.41k] ------------------ 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): [True: 0, Folded] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 3.41k| auto left_size = pos.size_before(idx); 1313| 3.41k| auto child_size = pos.size_sbh(idx, left_size); 1314| 3.41k| auto dropped_size = first; 1315| 3.41k| auto child_dropped_size = dropped_size - left_size; 1316| 3.41k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 3.41k] | 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| 3.41k| } else { 1325| 3.41k| 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| 3.41k| auto newcount = count - idx; 1330| 3.41k| auto newn = 1331| 3.41k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 3.41k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 3.41k| : node_t::make_inner_r_e(e); 1336| 3.41k| auto newr = newn->relaxed(); 1337| 3.41k| IMMER_TRY { ------------------ | | 49| 3.41k|#define IMMER_TRY try ------------------ 1338| 3.41k| auto subs = 1339| 3.41k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 3.41k] ------------------ 1340| 3.41k| : pos.towards_sub_oh( 1341| 3.41k| no_collapse_no_mut_t{}, first, idx, e); 1342| 3.41k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 3.41k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 3.41k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 3.41k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 3.41k, False: 0] ------------------ 1346| 3.41k| pos.copy_sizes( 1347| 3.41k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 3.41k| newr->d.count = newcount; 1349| 3.41k| newn->inner()[0] = get<1>(subs); 1350| 3.41k| std::copy(node->inner() + idx + 1, 1351| 3.41k| node->inner() + count, 1352| 3.41k| newn->inner() + 1); 1353| 3.41k| if (!mutate) { ------------------ | Branch (1353:21): [True: 3.41k, False: 0] ------------------ 1354| 3.41k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 3.41k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 3.41k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 3.41k| } 1358| 3.41k| return std::make_tuple(pos.shift(), newn); 1359| 3.41k| } 1360| 3.41k| 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| 3.41k| } 1373| 3.41k| } _ZN5immer6detail4rbts16dec_left_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_j: 1209| 4.15k| { 1210| 4.15k| using node_t = node_type; 1211| 4.15k| auto node = p.node(); 1212| 4.15k| if (node->dec()) { ------------------ | Branch (1212:13): [True: 4.15k, False: 0] ------------------ 1213| 4.15k| p.each_left(dec_t{}, idx); 1214| 4.15k| node_t::delete_inner(node, p.count()); 1215| 4.15k| } 1216| 4.15k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 12.5k| { 1378| 12.5k| auto node = pos.node(); 1379| 12.5k| auto idx = pos.index(first); 1380| 12.5k| auto count = pos.count(); 1381| 12.5k| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 12.5k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 8.70k, False: 3.86k] ------------------ 1384| 12.5k| if (mutate) { ------------------ | Branch (1384:13): [True: 8.70k, False: 3.86k] ------------------ 1385| 8.70k| auto data = node->leaf(); 1386| 8.70k| auto newcount = count - idx; 1387| 8.70k| std::move(data + idx, data + count, data); 1388| 8.70k| detail::destroy_n(data + newcount, idx); 1389| 8.70k| return std::make_tuple(0, node); 1390| 8.70k| } else { 1391| 3.86k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 3.86k| if (Mutating) ------------------ | Branch (1392:17): [True: 3.86k, Folded] ------------------ 1393| 3.86k| pos.visit(dec_visitor{}); 1394| 3.86k| return std::make_tuple(0, newn); 1395| 3.86k| } 1396| 12.5k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 1.50k| { 1304| 1.50k| auto idx = pos.subindex(first); 1305| 1.50k| auto count = pos.count(); 1306| 1.50k| auto node = pos.node(); 1307| 1.50k| 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| 1.50k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 511, False: 991] ------------------ 1312| 1.50k| auto left_size = pos.size_before(idx); 1313| 1.50k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.50k| auto dropped_size = first; 1315| 1.50k| auto child_dropped_size = dropped_size - left_size; 1316| 1.50k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.50k] | 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.50k| } else { 1325| 1.50k| 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.50k| auto newcount = count - idx; 1330| 1.50k| auto newn = 1331| 1.50k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 511, False: 991] ------------------ 1332| 511| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 511| norefs_tag{})) relaxed_t, 1334| 511| node) 1335| 1.50k| : node_t::make_inner_r_e(e); 1336| 1.50k| auto newr = newn->relaxed(); 1337| 1.50k| IMMER_TRY { ------------------ | | 49| 1.50k|#define IMMER_TRY try ------------------ 1338| 1.50k| auto subs = 1339| 1.50k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 511, False: 991] ------------------ 1340| 1.50k| : pos.towards_sub_oh( 1341| 991| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.50k| if (mutate) ------------------ | Branch (1342:21): [True: 511, False: 991] ------------------ 1343| 511| pos.each_left(dec_visitor{}, idx); 1344| 1.50k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.50k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.50k, False: 0] ------------------ 1346| 1.50k| pos.copy_sizes( 1347| 1.50k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.50k| newr->d.count = newcount; 1349| 1.50k| newn->inner()[0] = get<1>(subs); 1350| 1.50k| std::copy(node->inner() + idx + 1, 1351| 1.50k| node->inner() + count, 1352| 1.50k| newn->inner() + 1); 1353| 1.50k| if (!mutate) { ------------------ | Branch (1353:21): [True: 991, False: 511] ------------------ 1354| 991| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 991| if (Mutating) ------------------ | Branch (1355:25): [True: 991, Folded] ------------------ 1356| 991| pos.visit(dec_visitor{}); 1357| 991| } 1358| 1.50k| return std::make_tuple(pos.shift(), newn); 1359| 1.50k| } 1360| 1.50k| 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.50k| } 1373| 1.50k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 13.1k| { 1378| 13.1k| auto node = pos.node(); 1379| 13.1k| auto idx = pos.index(first); 1380| 13.1k| auto count = pos.count(); 1381| 13.1k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 13.1k] ------------------ 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| 13.1k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 13.1k] ------------------ 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| 13.1k| } else { 1391| 13.1k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 13.1k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 13.1k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 13.1k| return std::make_tuple(0, newn); 1395| 13.1k| } 1396| 13.1k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 2.23k| { 1304| 2.23k| auto idx = pos.subindex(first); 1305| 2.23k| auto count = pos.count(); 1306| 2.23k| auto node = pos.node(); 1307| 2.23k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.23k] ------------------ 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): [True: 0, Folded] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 2.23k| auto left_size = pos.size_before(idx); 1313| 2.23k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.23k| auto dropped_size = first; 1315| 2.23k| auto child_dropped_size = dropped_size - left_size; 1316| 2.23k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 2.23k] | 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.23k| } else { 1325| 2.23k| 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.23k| auto newcount = count - idx; 1330| 2.23k| auto newn = 1331| 2.23k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 2.23k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 2.23k| : node_t::make_inner_r_e(e); 1336| 2.23k| auto newr = newn->relaxed(); 1337| 2.23k| IMMER_TRY { ------------------ | | 49| 2.23k|#define IMMER_TRY try ------------------ 1338| 2.23k| auto subs = 1339| 2.23k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 2.23k] ------------------ 1340| 2.23k| : pos.towards_sub_oh( 1341| 2.23k| no_collapse_no_mut_t{}, first, idx, e); 1342| 2.23k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 2.23k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 2.23k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 2.23k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 2.23k, False: 0] ------------------ 1346| 2.23k| pos.copy_sizes( 1347| 2.23k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 2.23k| newr->d.count = newcount; 1349| 2.23k| newn->inner()[0] = get<1>(subs); 1350| 2.23k| std::copy(node->inner() + idx + 1, 1351| 2.23k| node->inner() + count, 1352| 2.23k| newn->inner() + 1); 1353| 2.23k| if (!mutate) { ------------------ | Branch (1353:21): [True: 2.23k, False: 0] ------------------ 1354| 2.23k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 2.23k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 2.23k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 2.23k| } 1358| 2.23k| return std::make_tuple(pos.shift(), newn); 1359| 2.23k| } 1360| 2.23k| 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.23k| } 1373| 2.23k| } _ZN5immer6detail4rbts16dec_left_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_j: 1198| 5.30k| { 1199| 5.30k| using node_t = node_type; 1200| 5.30k| auto node = p.node(); 1201| 5.30k| if (node->dec()) { ------------------ | Branch (1201:13): [True: 5.30k, False: 0] ------------------ 1202| 5.30k| p.each_left(dec_t{}, idx); 1203| 5.30k| node_t::delete_inner_r(node, p.count()); 1204| 5.30k| } 1205| 5.30k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1246| 187k| { 1247| 187k| auto idx = pos.subindex(first); 1248| 187k| auto count = pos.count(); 1249| 187k| auto node = pos.node(); 1250| 187k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 187k, Folded] | Branch (1250:47): [True: 180k, False: 7.39k] ------------------ 1251| 187k| auto left_size = pos.size_before(idx); 1252| 187k| auto child_size = pos.size_sbh(idx, left_size); 1253| 187k| auto dropped_size = first; 1254| 187k| auto child_dropped_size = dropped_size - left_size; 1255| 187k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 187k] | 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| 187k| } else { 1264| 187k| using std::get; 1265| 187k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 180k, False: 7.39k] ------------------ 1266| 187k| : node_t::make_inner_r_e(e); 1267| 187k| auto newr = newn->relaxed(); 1268| 187k| auto newcount = count - idx; 1269| 187k| auto new_child_size = child_size - child_dropped_size; 1270| 187k| IMMER_TRY { ------------------ | | 49| 187k|#define IMMER_TRY try ------------------ 1271| 187k| auto subs = 1272| 187k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 180k, False: 7.39k] ------------------ 1273| 187k| : pos.towards_sub_oh( 1274| 7.39k| no_collapse_no_mut_t{}, first, idx, e); 1275| 187k| if (mutate) ------------------ | Branch (1275:21): [True: 180k, False: 7.39k] ------------------ 1276| 180k| pos.each_left(dec_visitor{}, idx); 1277| 187k| pos.copy_sizes( 1278| 187k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 187k| std::copy(node->inner() + idx + 1, 1280| 187k| node->inner() + count, 1281| 187k| newn->inner() + 1); 1282| 187k| newn->inner()[0] = get<1>(subs); 1283| 187k| newr->d.sizes[0] = new_child_size; 1284| 187k| newr->d.count = newcount; 1285| 187k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 187k, False: 0] ------------------ 1286| 187k| if (!mutate) { ------------------ | Branch (1286:21): [True: 7.39k, False: 180k] ------------------ 1287| 7.39k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 7.39k| if (Mutating) ------------------ | Branch (1288:25): [True: 7.39k, Folded] ------------------ 1289| 7.39k| pos.visit(dec_visitor{}); 1290| 7.39k| } 1291| 187k| return std::make_tuple(pos.shift(), newn); 1292| 187k| } 1293| 187k| 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| 187k| } 1299| 187k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1246| 51.6k| { 1247| 51.6k| auto idx = pos.subindex(first); 1248| 51.6k| auto count = pos.count(); 1249| 51.6k| auto node = pos.node(); 1250| 51.6k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 51.6k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 51.6k| auto left_size = pos.size_before(idx); 1252| 51.6k| auto child_size = pos.size_sbh(idx, left_size); 1253| 51.6k| auto dropped_size = first; 1254| 51.6k| auto child_dropped_size = dropped_size - left_size; 1255| 51.6k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 51.6k] | Branch (1255:25): [True: 0, False: 0] | Branch (1255:45): [True: 0, False: 0] ------------------ 1256| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 0] ------------------ 1257| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 0| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 0] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 0| else if (Mutating) ------------------ | Branch (1260:22): [Folded, False: 0] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 0| return r; 1263| 51.6k| } else { 1264| 51.6k| using std::get; 1265| 51.6k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 51.6k] ------------------ 1266| 51.6k| : node_t::make_inner_r_e(e); 1267| 51.6k| auto newr = newn->relaxed(); 1268| 51.6k| auto newcount = count - idx; 1269| 51.6k| auto new_child_size = child_size - child_dropped_size; 1270| 51.6k| IMMER_TRY { ------------------ | | 49| 51.6k|#define IMMER_TRY try ------------------ 1271| 51.6k| auto subs = 1272| 51.6k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 51.6k] ------------------ 1273| 51.6k| : pos.towards_sub_oh( 1274| 51.6k| no_collapse_no_mut_t{}, first, idx, e); 1275| 51.6k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 51.6k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 51.6k| pos.copy_sizes( 1278| 51.6k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 51.6k| std::copy(node->inner() + idx + 1, 1280| 51.6k| node->inner() + count, 1281| 51.6k| newn->inner() + 1); 1282| 51.6k| newn->inner()[0] = get<1>(subs); 1283| 51.6k| newr->d.sizes[0] = new_child_size; 1284| 51.6k| newr->d.count = newcount; 1285| 51.6k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 51.6k, False: 0] ------------------ 1286| 51.6k| if (!mutate) { ------------------ | Branch (1286:21): [True: 51.6k, False: 0] ------------------ 1287| 51.6k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 51.6k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 51.6k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 51.6k| } 1291| 51.6k| return std::make_tuple(pos.shift(), newn); 1292| 51.6k| } 1293| 51.6k| IMMER_CATCH (...) { 1294| 0| if (!mutate) ------------------ | Branch (1294:21): [True: 0, False: 0] ------------------ 1295| 0| node_t::delete_inner_r_e(newn); 1296| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1297| 0| } 1298| 51.6k| } 1299| 51.6k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 8.93k| { 1304| 8.93k| auto idx = pos.subindex(first); 1305| 8.93k| auto count = pos.count(); 1306| 8.93k| auto node = pos.node(); 1307| 8.93k| 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| 8.93k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 6.98k, False: 1.95k] ------------------ 1312| 8.93k| auto left_size = pos.size_before(idx); 1313| 8.93k| auto child_size = pos.size_sbh(idx, left_size); 1314| 8.93k| auto dropped_size = first; 1315| 8.93k| auto child_dropped_size = dropped_size - left_size; 1316| 8.93k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 8.93k, Folded] | Branch (1316:25): [True: 6.78k, False: 2.15k] | Branch (1316:45): [True: 5.10k, False: 1.67k] ------------------ 1317| 5.10k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 4.15k, False: 955] ------------------ 1318| 5.10k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 5.10k| if (mutate) ------------------ | Branch (1319:17): [True: 4.15k, False: 955] ------------------ 1320| 4.15k| pos.visit(dec_left_visitor{}, idx); 1321| 955| else if (Mutating) ------------------ | Branch (1321:22): [True: 955, Folded] ------------------ 1322| 955| pos.visit(dec_visitor{}); 1323| 5.10k| return r; 1324| 5.10k| } else { 1325| 3.83k| 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| 3.83k| auto newcount = count - idx; 1330| 3.83k| auto newn = 1331| 3.83k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 2.83k, False: 1.00k] ------------------ 1332| 2.83k| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 2.83k| norefs_tag{})) relaxed_t, 1334| 2.83k| node) 1335| 3.83k| : node_t::make_inner_r_e(e); 1336| 3.83k| auto newr = newn->relaxed(); 1337| 3.83k| IMMER_TRY { ------------------ | | 49| 3.83k|#define IMMER_TRY try ------------------ 1338| 3.83k| auto subs = 1339| 3.83k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 2.83k, False: 1.00k] ------------------ 1340| 3.83k| : pos.towards_sub_oh( 1341| 1.00k| no_collapse_no_mut_t{}, first, idx, e); 1342| 3.83k| if (mutate) ------------------ | Branch (1342:21): [True: 2.83k, False: 1.00k] ------------------ 1343| 2.83k| pos.each_left(dec_visitor{}, idx); 1344| 3.83k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 3.83k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 3.83k, False: 0] ------------------ 1346| 3.83k| pos.copy_sizes( 1347| 3.83k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 3.83k| newr->d.count = newcount; 1349| 3.83k| newn->inner()[0] = get<1>(subs); 1350| 3.83k| std::copy(node->inner() + idx + 1, 1351| 3.83k| node->inner() + count, 1352| 3.83k| newn->inner() + 1); 1353| 3.83k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.00k, False: 2.83k] ------------------ 1354| 1.00k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.00k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.00k, Folded] ------------------ 1356| 1.00k| pos.visit(dec_visitor{}); 1357| 1.00k| } 1358| 3.83k| return std::make_tuple(pos.shift(), newn); 1359| 3.83k| } 1360| 3.83k| 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| 3.83k| } 1373| 8.93k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 3.37k| { 1304| 3.37k| auto idx = pos.subindex(first); 1305| 3.37k| auto count = pos.count(); 1306| 3.37k| auto node = pos.node(); 1307| 3.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| 3.37k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 1.45k, False: 1.91k] ------------------ 1312| 3.37k| auto left_size = pos.size_before(idx); 1313| 3.37k| auto child_size = pos.size_sbh(idx, left_size); 1314| 3.37k| auto dropped_size = first; 1315| 3.37k| auto child_dropped_size = dropped_size - left_size; 1316| 3.37k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 3.37k, Folded] | Branch (1316:25): [True: 1.85k, False: 1.51k] | Branch (1316:45): [True: 1.60k, False: 251] ------------------ 1317| 1.60k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 312, False: 1.29k] ------------------ 1318| 1.60k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 1.60k| if (mutate) ------------------ | Branch (1319:17): [True: 312, False: 1.29k] ------------------ 1320| 312| pos.visit(dec_left_visitor{}, idx); 1321| 1.29k| else if (Mutating) ------------------ | Branch (1321:22): [True: 1.29k, Folded] ------------------ 1322| 1.29k| pos.visit(dec_visitor{}); 1323| 1.60k| return r; 1324| 1.76k| } else { 1325| 1.76k| 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.76k| auto newcount = count - idx; 1330| 1.76k| auto newn = 1331| 1.76k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 1.14k, False: 622] ------------------ 1332| 1.14k| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 1.14k| norefs_tag{})) relaxed_t, 1334| 1.14k| node) 1335| 1.76k| : node_t::make_inner_r_e(e); 1336| 1.76k| auto newr = newn->relaxed(); 1337| 1.76k| IMMER_TRY { ------------------ | | 49| 1.76k|#define IMMER_TRY try ------------------ 1338| 1.76k| auto subs = 1339| 1.76k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 1.14k, False: 622] ------------------ 1340| 1.76k| : pos.towards_sub_oh( 1341| 622| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.76k| if (mutate) ------------------ | Branch (1342:21): [True: 1.14k, False: 622] ------------------ 1343| 1.14k| pos.each_left(dec_visitor{}, idx); 1344| 1.76k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.76k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.76k, False: 0] ------------------ 1346| 1.76k| pos.copy_sizes( 1347| 1.76k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.76k| newr->d.count = newcount; 1349| 1.76k| newn->inner()[0] = get<1>(subs); 1350| 1.76k| std::copy(node->inner() + idx + 1, 1351| 1.76k| node->inner() + count, 1352| 1.76k| newn->inner() + 1); 1353| 1.76k| if (!mutate) { ------------------ | Branch (1353:21): [True: 622, False: 1.14k] ------------------ 1354| 622| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 622| if (Mutating) ------------------ | Branch (1355:25): [True: 622, Folded] ------------------ 1356| 622| pos.visit(dec_visitor{}); 1357| 622| } 1358| 1.76k| return std::make_tuple(pos.shift(), newn); 1359| 1.76k| } 1360| 1.76k| 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.76k| } 1373| 3.37k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_16rrbtree_iteratorIiSE_Lj2ELj2EEESF_EEbOT_OT0_PT1_jm: 349| 11.6k| { 350| 11.6k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 11.6k, False: 0] ------------------ 351| 11.6k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 10.5k, False: 1.07k] ------------------ 352| 11.6k| ? visit_maybe_relaxed_sub(rootl, 353| 10.5k| shiftl, 354| 10.5k| sizel, 355| 10.5k| this_t{}, 356| 10.5k| posr, 357| 10.5k| first, 358| 10.5k| size_t{}) 359| 11.6k| : posr.first_sub_inner( 360| 1.07k| rrb{}, first, rootl, shiftl, sizel); 361| 11.6k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESG_RNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEbOT_OT0_OT1_m: 382| 27.3k| { 383| 27.3k| auto nl = posl.node(); 384| 27.3k| auto nr = posr.node(); 385| 27.3k| if (nl == nr) ------------------ | Branch (385:13): [True: 8.05k, False: 19.2k] ------------------ 386| 8.05k| return true; 387| 19.2k| auto cl = posl.count(); 388| 19.2k| auto cr = posr.count(); 389| 19.2k| assert(cr > 0); ------------------ | Branch (389:9): [True: 19.2k, False: 0] ------------------ 390| 19.2k| auto sbr = size_t{}; 391| 19.2k| auto i = count_t{}; 392| 19.2k| auto j = count_t{}; 393| 60.4k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 49.7k, False: 10.6k] ------------------ 394| 49.7k| auto sbl = posl.size_before(i); 395| 78.7k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 63.2k, False: 15.4k] | Branch (395:34): [True: 28.9k, False: 34.3k] ------------------ 396| 28.9k| ; 397| 49.7k| auto res = 398| 49.7k| sbl == sbr ------------------ | Branch (398:17): [True: 31.1k, False: 18.6k] ------------------ 399| 49.7k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 49.7k| : posl.nth_sub(i, 401| 18.6k| for_each_chunk_p_visitor{}, 402| 18.6k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 49.7k| if (!res) ------------------ | Branch (403:17): [True: 8.61k, False: 41.1k] ------------------ 404| 8.61k| return false; 405| 49.7k| } 406| 10.6k| return true; 407| 19.2k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 336| 8.92k| { 337| 8.92k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 8.92k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESG_RNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEbOT_OT0_OT1_m: 427| 9.66k| { 428| 9.66k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 4.68k, False: 4.98k] ------------------ 429| 4.68k| return true; 430| 4.98k| auto cl = posl.count(); 431| 4.98k| auto cr = posr.count(); 432| 4.98k| auto mp = std::min(cl, cr); 433| 4.98k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 3.42k, False: 1.55k] ------------------ 434| 4.98k| posl.node()->leaf() + mp, 435| 4.98k| posr.node()->leaf()) && 436| 3.42k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 2.99k, False: 432] ------------------ 437| 3.42k| posl.node()->leaf() + posl.count(), 438| 3.42k| first + (idx + mp)); 439| 9.66k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESH_RNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 329| 19.9k| { 330| 19.9k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 19.9k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_11relaxed_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEENSt3__19enable_ifIX12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 412| 4.68k| { 413| 4.68k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 4.68k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_11relaxed_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEbOT_OT0_OT1_m: 382| 4.68k| { 383| 4.68k| auto nl = posl.node(); 384| 4.68k| auto nr = posr.node(); 385| 4.68k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 4.68k] ------------------ 386| 0| return true; 387| 4.68k| auto cl = posl.count(); 388| 4.68k| auto cr = posr.count(); 389| 4.68k| assert(cr > 0); ------------------ | Branch (389:9): [True: 4.68k, False: 0] ------------------ 390| 4.68k| auto sbr = size_t{}; 391| 4.68k| auto i = count_t{}; 392| 4.68k| auto j = count_t{}; 393| 13.4k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 11.1k, False: 2.32k] ------------------ 394| 11.1k| auto sbl = posl.size_before(i); 395| 17.2k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 12.9k, False: 4.34k] | Branch (395:34): [True: 6.18k, False: 6.76k] ------------------ 396| 6.18k| ; 397| 11.1k| auto res = 398| 11.1k| sbl == sbr ------------------ | Branch (398:17): [True: 6.93k, False: 4.16k] ------------------ 399| 11.1k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 11.1k| : posl.nth_sub(i, 401| 4.16k| for_each_chunk_p_visitor{}, 402| 4.16k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 11.1k| if (!res) ------------------ | Branch (403:17): [True: 2.36k, False: 8.74k] ------------------ 404| 2.36k| return false; 405| 11.1k| } 406| 2.32k| return true; 407| 4.68k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_15regular_sub_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 336| 3.92k| { 337| 3.92k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 3.92k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_12leaf_sub_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEbOT_OT0_OT1_m: 427| 6.91k| { 428| 6.91k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 4.08k, False: 2.83k] ------------------ 429| 4.08k| return true; 430| 2.83k| auto cl = posl.count(); 431| 2.83k| auto cr = posr.count(); 432| 2.83k| auto mp = std::min(cl, cr); 433| 2.83k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 2.58k, False: 247] ------------------ 434| 2.83k| posl.node()->leaf() + mp, 435| 2.83k| posr.node()->leaf()) && 436| 2.58k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 2.32k, False: 262] ------------------ 437| 2.58k| posl.node()->leaf() + posl.count(), 438| 2.58k| first + (idx + mp)); 439| 6.91k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_15regular_sub_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 329| 2.26k| { 330| 2.26k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.26k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_11relaxed_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEENSt3__19enable_ifIX12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 412| 2.75k| { 413| 2.75k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 2.75k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_11relaxed_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEbOT_OT0_OT1_m: 382| 2.75k| { 383| 2.75k| auto nl = posl.node(); 384| 2.75k| auto nr = posr.node(); 385| 2.75k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.75k] ------------------ 386| 0| return true; 387| 2.75k| auto cl = posl.count(); 388| 2.75k| auto cr = posr.count(); 389| 2.75k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.75k, False: 0] ------------------ 390| 2.75k| auto sbr = size_t{}; 391| 2.75k| auto i = count_t{}; 392| 2.75k| auto j = count_t{}; 393| 12.7k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 10.3k, False: 2.38k] ------------------ 394| 10.3k| auto sbl = posl.size_before(i); 395| 17.7k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 13.6k, False: 4.08k] | Branch (395:34): [True: 7.35k, False: 6.29k] ------------------ 396| 7.35k| ; 397| 10.3k| auto res = 398| 10.3k| sbl == sbr ------------------ | Branch (398:17): [True: 5.76k, False: 4.61k] ------------------ 399| 10.3k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 10.3k| : posl.nth_sub(i, 401| 4.61k| for_each_chunk_p_visitor{}, 402| 4.61k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 10.3k| if (!res) ------------------ | Branch (403:17): [True: 370, False: 10.0k] ------------------ 404| 370| return false; 405| 10.3k| } 406| 2.38k| return true; 407| 2.75k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_8full_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 336| 3.73k| { 337| 3.73k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 3.73k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_8full_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 329| 892| { 330| 892| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 892| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_8full_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 329| 1.13k| { 330| 1.13k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 1.13k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_15regular_sub_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEENSt3__19enable_ifIXnt12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 419| 1.89k| { 420| 1.89k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 1.89k, False: 0] ------------------ 421| 1.89k| ? this_t::visit_regular(posl, posr.node()) 422| 1.89k| : this_t::visit_regular(posr, posl.node()); 423| 1.89k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESE_EEbOT_PT0_: 443| 10.7k| { 444| 10.7k| auto node = pos.node(); 445| 10.7k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 6.98k, False: 3.74k] | Branch (445:33): [True: 1.95k, False: 1.78k] ------------------ 446| 10.7k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESE_EEbOT_PT0_: 450| 14.7k| { 451| 14.7k| auto node = pos.node(); 452| 14.7k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 9.48k, False: 5.31k] | Branch (452:33): [True: 3.34k, False: 1.97k] ------------------ 453| 5.31k| node->leaf() + pos.count(), 454| 5.31k| other->leaf()); 455| 14.7k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESE_EEbOT_PT0_: 443| 8.12k| { 444| 8.12k| auto node = pos.node(); 445| 8.12k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 2.66k, False: 5.46k] | Branch (445:33): [True: 2.94k, False: 2.51k] ------------------ 446| 8.12k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESE_EEbOT_PT0_: 450| 3.23k| { 451| 3.23k| auto node = pos.node(); 452| 3.23k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.65k, False: 1.58k] | Branch (452:33): [True: 810, False: 771] ------------------ 453| 1.58k| node->leaf() + pos.count(), 454| 1.58k| other->leaf()); 455| 3.23k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESE_EEbOT_PT0_: 443| 4.21k| { 444| 4.21k| auto node = pos.node(); 445| 4.21k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 477, False: 3.73k] | Branch (445:33): [True: 2.47k, False: 1.26k] ------------------ 446| 4.21k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 112| 359k| { 113| 359k| auto data = as_const(pos.node()->leaf()); 114| 359k| return fn(data, data + pos.count()); 115| 359k| } _ZZN5immer6detail4rbts14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaOT_ENUlSE_T0_E_clIPKiSK_EEDaSE_SG_: 367| 1.43M| return [iter](auto f, auto e) mutable { 368| 1.43M| if (f == &*iter) { ------------------ | Branch (368:17): [True: 177k, False: 1.25M] ------------------ 369| 177k| iter += e - f; 370| 177k| return true; 371| 177k| } 372| 5.75M| for (; f != e; ++f, ++iter) ------------------ | Branch (372:20): [True: 4.50M, False: 1.25M] ------------------ 373| 4.50M| if (*f != *iter) ------------------ | Branch (373:21): [True: 3.34k, False: 4.50M] ------------------ 374| 3.34k| return false; 375| 1.25M| return true; 376| 1.25M| }; _ZN5immer6detail4rbts18region_for_visitorIiE11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEENSt3__15tupleIJPimmEEEOT_m: 53| 9.81M| { 54| 9.81M| return pos.towards(this_t{}, idx); 55| 9.81M| } _ZN5immer6detail4rbts18region_for_visitorIiE10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEENSt3__15tupleIJPimmEEEOT_m: 59| 1.07M| { 60| 1.07M| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 1.07M| } _ZN5immer6detail4rbts18region_for_visitorIiE11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEENSt3__15tupleIJPimmEEEOT_m: 53| 386k| { 54| 386k| return pos.towards(this_t{}, idx); 55| 386k| } _ZN5immer6detail4rbts18region_for_visitorIiE10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEENSt3__15tupleIJPimmEEEOT_m: 59| 362k| { 60| 362k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 362k| } _ZN5immer6detail4rbts18region_for_visitorIiE11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEENSt3__15tupleIJPimmEEEOT_m: 53| 1.05M| { 54| 1.05M| return pos.towards(this_t{}, idx); 55| 1.05M| } _ZN5immer6detail4rbts18region_for_visitorIiE10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEENSt3__15tupleIJPimmEEEOT_m: 59| 23.5k| { 60| 23.5k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 23.5k| } _ZN5immer6detail4rbts18region_for_visitorIiE11visit_innerIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEENSt3__15tupleIJPimmEEEOT_m: 53| 112k| { 54| 112k| return pos.towards(this_t{}, idx); 55| 112k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 97.6k| { 107| 97.6k| return pos.each_pred(this_t{}, fn); 108| 97.6k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESH_RNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 329| 753| { 330| 753| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 753| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESG_RNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEENSt3__19enable_ifIXnt12is_relaxed_vIT0_EEbE4typeEOT_OSM_OT1_m: 419| 6.95k| { 420| 6.95k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 6.95k, False: 0] ------------------ 421| 6.95k| ? this_t::visit_regular(posl, posr.node()) 422| 6.95k| : this_t::visit_regular(posr, posl.node()); 423| 6.95k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 112| 1.05M| { 113| 1.05M| auto data = as_const(pos.node()->leaf()); 114| 1.05M| return fn(data, data + pos.count()); 115| 1.05M| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 20.1k| { 107| 20.1k| return pos.each_pred(this_t{}, fn); 108| 20.1k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 112| 18.8k| { 113| 18.8k| auto data = as_const(pos.node()->leaf()); 114| 18.8k| return fn(data, data + pos.count()); 115| 18.8k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 6.69k| { 107| 6.69k| return pos.each_pred(this_t{}, fn); 108| 6.69k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 329| 2.55k| { 330| 2.55k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.55k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_15regular_sub_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEbOT_OT0_OT1_m: 382| 2.41k| { 383| 2.41k| auto nl = posl.node(); 384| 2.41k| auto nr = posr.node(); 385| 2.41k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.41k] ------------------ 386| 0| return true; 387| 2.41k| auto cl = posl.count(); 388| 2.41k| auto cr = posr.count(); 389| 2.41k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.41k, False: 0] ------------------ 390| 2.41k| auto sbr = size_t{}; 391| 2.41k| auto i = count_t{}; 392| 2.41k| auto j = count_t{}; 393| 8.07k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 6.47k, False: 1.60k] ------------------ 394| 6.47k| auto sbl = posl.size_before(i); 395| 10.0k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 7.97k, False: 2.07k] | Branch (395:34): [True: 3.57k, False: 4.40k] ------------------ 396| 3.57k| ; 397| 6.47k| auto res = 398| 6.47k| sbl == sbr ------------------ | Branch (398:17): [True: 4.11k, False: 2.35k] ------------------ 399| 6.47k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 6.47k| : posl.nth_sub(i, 401| 2.35k| for_each_chunk_p_visitor{}, 402| 2.35k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 6.47k| if (!res) ------------------ | Branch (403:17): [True: 818, False: 5.65k] ------------------ 404| 818| return false; 405| 6.47k| } 406| 1.60k| return true; 407| 2.41k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 336| 4.71k| { 337| 4.71k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 4.71k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_13full_leaf_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEbOT_OT0_OT1_m: 427| 4.71k| { 428| 4.71k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 2.78k, False: 1.92k] ------------------ 429| 2.78k| return true; 430| 1.92k| auto cl = posl.count(); 431| 1.92k| auto cr = posr.count(); 432| 1.92k| auto mp = std::min(cl, cr); 433| 1.92k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 1.52k, False: 403] ------------------ 434| 1.92k| posl.node()->leaf() + mp, 435| 1.92k| posr.node()->leaf()) && 436| 1.52k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 1.52k, False: 0] ------------------ 437| 1.52k| posl.node()->leaf() + posl.count(), 438| 1.52k| first + (idx + mp)); 439| 4.71k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 329| 2.81k| { 330| 2.81k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.81k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_8full_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEbOT_OT0_OT1_m: 382| 1.64k| { 383| 1.64k| auto nl = posl.node(); 384| 1.64k| auto nr = posr.node(); 385| 1.64k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 1.64k] ------------------ 386| 0| return true; 387| 1.64k| auto cl = posl.count(); 388| 1.64k| auto cr = posr.count(); 389| 1.64k| assert(cr > 0); ------------------ | Branch (389:9): [True: 1.64k, False: 0] ------------------ 390| 1.64k| auto sbr = size_t{}; 391| 1.64k| auto i = count_t{}; 392| 1.64k| auto j = count_t{}; 393| 7.23k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 5.98k, False: 1.24k] ------------------ 394| 5.98k| auto sbl = posl.size_before(i); 395| 10.2k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 9.05k, False: 1.21k] | Branch (395:34): [True: 4.28k, False: 4.77k] ------------------ 396| 4.28k| ; 397| 5.98k| auto res = 398| 5.98k| sbl == sbr ------------------ | Branch (398:17): [True: 3.72k, False: 2.25k] ------------------ 399| 5.98k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 5.98k| : posl.nth_sub(i, 401| 2.25k| for_each_chunk_p_visitor{}, 402| 2.25k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 5.98k| if (!res) ------------------ | Branch (403:17): [True: 401, False: 5.58k] ------------------ 404| 401| return false; 405| 5.98k| } 406| 1.24k| return true; 407| 1.64k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_8full_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEENSt3__19enable_ifIXnt12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 419| 1.16k| { 420| 1.16k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 1.16k, False: 0] ------------------ 421| 1.16k| ? this_t::visit_regular(posl, posr.node()) 422| 1.16k| : this_t::visit_regular(posr, posl.node()); 423| 1.16k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 616k| { 107| 616k| return pos.each_pred(this_t{}, fn); 108| 616k| } _ZN5immer6detail4rbts14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaOT_: 366| 32.0k| { 367| 32.0k| return [iter](auto f, auto e) mutable { 368| 32.0k| if (f == &*iter) { 369| 32.0k| iter += e - f; 370| 32.0k| return true; 371| 32.0k| } 372| 32.0k| for (; f != e; ++f, ++iter) 373| 32.0k| if (*f != *iter) 374| 32.0k| return false; 375| 32.0k| return true; 376| 32.0k| }; 377| 32.0k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEESF_EEbOT_OT0_PT1_jm: 349| 1.40k| { 350| 1.40k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 1.40k, False: 0] ------------------ 351| 1.40k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 1.07k, False: 330] ------------------ 352| 1.40k| ? visit_maybe_relaxed_sub(rootl, 353| 1.07k| shiftl, 354| 1.07k| sizel, 355| 1.07k| this_t{}, 356| 1.07k| posr, 357| 1.07k| first, 358| 1.07k| size_t{}) 359| 1.40k| : posr.first_sub_inner( 360| 330| rrb{}, first, rootl, shiftl, sizel); 361| 1.40k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_16rrbtree_iteratorIiSE_Lj2ELj2EEESF_EEbOT_OT0_PT1_jm: 349| 6.82k| { 350| 6.82k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 6.82k, False: 0] ------------------ 351| 6.82k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 6.82k, False: 0] ------------------ 352| 6.82k| ? visit_maybe_relaxed_sub(rootl, 353| 6.82k| shiftl, 354| 6.82k| sizel, 355| 6.82k| this_t{}, 356| 6.82k| posr, 357| 6.82k| first, 358| 6.82k| size_t{}) 359| 6.82k| : posr.first_sub_inner( 360| 0| rrb{}, first, rootl, shiftl, sizel); 361| 6.82k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESE_EEbOT_PT0_: 450| 6.67k| { 451| 6.67k| auto node = pos.node(); 452| 6.67k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 3.73k, False: 2.93k] | Branch (452:33): [True: 998, False: 1.94k] ------------------ 453| 2.93k| node->leaf() + pos.count(), 454| 2.93k| other->leaf()); 455| 6.67k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_11dec_visitorEJEEEDcPT_jmT0_DpOT1_: 1838| 32.7M|{ 1839| 32.7M| assert(node); ------------------ | Branch (1839:5): [True: 32.7M, False: 0] ------------------ 1840| 32.7M| auto relaxed = node->relaxed(); 1841| 32.7M| if (relaxed) { ------------------ | Branch (1841:9): [True: 30.0M, False: 2.67M] ------------------ 1842| 30.0M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 30.0M, False: 0] ------------------ 1843| 30.0M| return make_relaxed_pos(node, shift, relaxed) 1844| 30.0M| .visit(v, std::forward(args)...); 1845| 30.0M| } else { 1846| 2.67M| return make_regular_sub_pos(node, shift, size) 1847| 2.67M| .visit(v, std::forward(args)...); 1848| 2.67M| } 1849| 32.7M|} _ZN5immer6detail4rbts16make_relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_11relaxed_posIT_EEPSE_jPNSE_9relaxed_tE: 1828| 101M|{ 1829| 101M| assert(node); ------------------ | Branch (1829:5): [True: 101M, False: 0] ------------------ 1830| 101M| assert(relaxed); ------------------ | Branch (1830:5): [True: 101M, False: 0] ------------------ 1831| 101M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1831:5): [True: 101M, False: 0] ------------------ 1832| 101M| return {node, shift, relaxed}; 1833| 101M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1813| 38.2M| { 1814| 38.2M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 38.2M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 1431| 62.0M| node_t* node() const { return node_; } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 1476| 12.5M| { 1477| 12.5M| each_left(v, relaxed_->d.count, args...); 1478| 12.5M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1623| 12.7M| { 1624| 12.7M| auto p = node_->inner(); 1625| 12.7M| auto s = size_t{}; 1626| 12.7M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 2.28M, False: 10.4M] ------------------ 1627| 10.0M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 7.78M, False: 2.28M] ------------------ 1628| 7.78M| IMMER_PREFETCH(p + i + 1); 1629| 7.78M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 7.78M| .visit(v, args...); 1631| 7.78M| s = relaxed_->d.sizes[i]; 1632| 7.78M| assert(s); ------------------ | Branch (1632:17): [True: 7.78M, False: 0] ------------------ 1633| 7.78M| } 1634| 10.4M| } else { 1635| 10.4M| auto ss = shift_ - B; 1636| 41.5M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 31.1M, False: 10.4M] ------------------ 1637| 31.1M| visit_maybe_relaxed_sub( 1638| 31.1M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 31.1M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 31.1M, False: 0] ------------------ 1641| 31.1M| } 1642| 10.4M| } 1643| 12.7M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5countEv: 1430| 58.5M| count_t count() const { return relaxed_->d.count; } _ZN5immer6detail4rbts20make_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_15regular_sub_posIT_EEPSE_jm: 1044| 6.50M|{ 1045| 6.50M| assert(node); ------------------ | Branch (1045:5): [True: 6.50M, False: 0] ------------------ 1046| 6.50M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1046:5): [True: 6.50M, False: 0] ------------------ 1047| 6.50M| assert(size > 0); ------------------ | Branch (1047:5): [True: 6.50M, False: 0] ------------------ 1048| 6.50M| assert(size <= (branches << shift)); ------------------ | Branch (1048:5): [True: 6.50M, False: 0] ------------------ 1049| 6.50M| return {node, shift, size}; 1050| 6.50M|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1036| 2.68M| { 1037| 2.68M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.68M| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 785| 8.64M| node_t* node() const { return node_; } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 825| 596k| { 826| 596k| return each_regular(*this, v, args...); 827| 596k| } _ZN5immer6detail4rbts12each_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_11dec_visitorEJEEEvOT_T0_DpOT1_: 343| 596k|{ 344| 596k| constexpr auto B = bits; 345| 596k| constexpr auto BL = bits_leaf; 346| 596k| auto n = p.node()->inner(); 347| 596k| auto last = p.count() - 1; 348| 596k| auto e = n + last; 349| 596k| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 49.0k, False: 547k] ------------------ 350| 98.8k| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 49.7k, False: 49.0k] ------------------ 351| 49.7k| IMMER_PREFETCH(n + 1); 352| 49.7k| make_full_leaf_pos(*n).visit(v, args...); 353| 49.7k| } 354| 49.0k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 547k| } else { 356| 547k| auto ss = p.shift() - B; 357| 1.28M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 735k, False: 547k] ------------------ 358| 735k| make_full_pos(*n, ss).visit(v, args...); 359| 547k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 547k| } 361| 596k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 787| 8.15M| shift_t shift() const { return shift_; } _ZN5immer6detail4rbts18make_full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_13full_leaf_posIT_EEPSE_: 214| 4.57M|{ 215| 4.57M| assert(node); ------------------ | Branch (215:5): [True: 4.57M, False: 0] ------------------ 216| 4.57M| return {node}; 217| 4.57M|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 207| 1.22M| { 208| 1.22M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.22M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 199| 3.41M| node_t* node() const { return node_; } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5countEv: 198| 3.88M| count_t count() const { return branches; } _ZN5immer6detail4rbts13make_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_8leaf_posIT_EEPSE_m: 119| 1.06M|{ 120| 1.06M| assert(node); ------------------ | Branch (120:5): [True: 1.06M, False: 0] ------------------ 121| 1.06M| assert(size > 0); ------------------ | Branch (121:5): [True: 1.06M, False: 0] ------------------ 122| 1.06M| return {node, size}; 123| 1.06M|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 786| 4.41M| size_t size() const { return size_; } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 112| 474k| { 113| 474k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 474k| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 104| 1.06M| node_t* node() const { return node_; } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5countEv: 103| 1.13M| count_t count() const { return index(size_ - 1) + 1; } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 107| 1.17M| count_t index(size_t idx) const { return idx & mask; } _ZN5immer6detail4rbts13make_full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_8full_posIT_EEPSE_j: 1412| 6.53M|{ 1413| 6.53M| assert(node); ------------------ | Branch (1413:5): [True: 6.53M, False: 0] ------------------ 1414| 6.53M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1414:5): [True: 6.53M, False: 0] ------------------ 1415| 6.53M| return {node, shift}; 1416| 6.53M|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1405| 3.44M| { 1406| 3.44M| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.44M| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 1159| 4.38M| node_t* node() const { return node_; } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 1185| 237k| { 1186| 237k| auto p = node_->inner(); 1187| 237k| auto e = p + branches; 1188| 237k| if (shift_ == BL) { ------------------ | Branch (1188:13): [True: 181k, False: 55.4k] ------------------ 1189| 909k| for (; p != e; ++p) { ------------------ | Branch (1189:20): [True: 727k, False: 181k] ------------------ 1190| 727k| IMMER_PREFETCH(p + 1); 1191| 727k| make_full_leaf_pos(*p).visit(v, args...); 1192| 727k| } 1193| 181k| } else { 1194| 55.4k| auto ss = shift_ - B; 1195| 277k| for (; p != e; ++p) ------------------ | Branch (1195:20): [True: 221k, False: 55.4k] ------------------ 1196| 221k| make_full_pos(*p, ss).visit(v, args...); 1197| 55.4k| } 1198| 237k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5countEv: 1158| 2.01M| count_t count() const { return branches; } _ZN5immer6detail4rbts16make_regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_11regular_posIT_EEPSE_jm: 690| 5.63M|{ 691| 5.63M| assert(node); ------------------ | Branch (691:5): [True: 5.63M, False: 0] ------------------ 692| 5.63M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (692:5): [True: 5.63M, False: 0] ------------------ 693| 5.63M| assert(size > 0); ------------------ | Branch (693:5): [True: 5.63M, False: 0] ------------------ 694| 5.63M| return {node, shift, size}; 695| 5.63M|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 336| 2.37M| { 337| 2.37M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.37M| } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 231| 10.3M| node_t* node() const { return node_; } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 243| 2.24M| { 244| 2.24M| return each_regular(*this, v, args...); 245| 2.24M| } _ZN5immer6detail4rbts12each_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_11dec_visitorEJEEEvOT_T0_DpOT1_: 343| 2.24M|{ 344| 2.24M| constexpr auto B = bits; 345| 2.24M| constexpr auto BL = bits_leaf; 346| 2.24M| auto n = p.node()->inner(); 347| 2.24M| auto last = p.count() - 1; 348| 2.24M| auto e = n + last; 349| 2.24M| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 417k, False: 1.82M] ------------------ 350| 842k| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 424k, False: 417k] ------------------ 351| 424k| IMMER_PREFETCH(n + 1); 352| 424k| make_full_leaf_pos(*n).visit(v, args...); 353| 424k| } 354| 417k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 1.82M| } else { 356| 1.82M| auto ss = p.shift() - B; 357| 4.28M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 2.46M, False: 1.82M] ------------------ 358| 2.46M| make_full_pos(*n, ss).visit(v, args...); 359| 1.82M| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 1.82M| } 361| 2.24M|} _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 233| 9.85M| shift_t shift() const { return shift_; } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 232| 14.0M| size_t size() const { return size_; } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5countEv: 230| 7.17M| count_t count() const { return index(size_ - 1) + 1; } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 234| 13.6M| count_t index(size_t idx) const { return (idx >> shift_) & mask; } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5countEv: 784| 9.85M| count_t count() const { return subindex(size_ - 1) + 1; } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8subindexEm: 789| 10.1M| count_t subindex(size_t idx) const { return idx >> shift_; } _ZN5immer6detail4rbts22make_empty_regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_17empty_regular_posIT_EEPSE_: 64| 1.71M|{ 65| 1.71M| return {node}; 66| 1.71M|} _ZN5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 57| 1.71M| { 58| 1.71M| return Visitor::visit_regular(*this, std::forward(args)...); 59| 1.71M| } _ZNK5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 41| 1.71M| node_t* node() const { return node_; } _ZN5immer6detail4rbts17make_leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_12leaf_sub_posIT_EEPSE_j: 151| 19.2M|{ 152| 19.2M| assert(node); ------------------ | Branch (152:5): [True: 19.2M, False: 0] ------------------ 153| 19.2M| assert(count <= branches); ------------------ | Branch (153:5): [True: 19.2M, False: 0] ------------------ 154| 19.2M| return {node, count}; 155| 19.2M|} _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 144| 11.0M| { 145| 11.0M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 11.0M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 136| 16.8M| node_t* node() const { return node_; } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5countEv: 135| 9.04M| count_t count() const { return count_; } _ZN5immer6detail4rbts19make_empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_14empty_leaf_posIT_EEPSE_: 88| 1.62M|{ 89| 1.62M| assert(node); ------------------ | Branch (89:5): [True: 1.62M, False: 0] ------------------ 90| 1.62M| return {node}; 91| 1.62M|} _ZN5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 81| 1.62M| { 82| 1.62M| return Visitor::visit_leaf(*this, std::forward(args)...); 83| 1.62M| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 75| 1.62M| node_t* node() const { return node_; } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5countEv: 74| 8.12k| count_t count() const { return 0; } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcT_DpOT0_: 1813| 528k| { 1814| 528k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 528k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 1433| 11.8M| shift_t shift() const { return shift_; } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEj: 1443| 6.03M| { 1444| 6.03M| return size_sbh(offset, size_before(offset)); 1445| 6.03M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8size_sbhEjm: 1448| 6.37M| { 1449| 6.37M| assert(size_before_hint == size_before(offset)); ------------------ | Branch (1449:9): [True: 6.37M, False: 0] ------------------ 1450| 6.37M| return relaxed_->d.sizes[offset] - size_before_hint; 1451| 6.37M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11size_beforeEj: 1438| 18.5M| { 1439| 18.5M| return offset ? relaxed_->d.sizes[offset - 1] : 0; ------------------ | Branch (1439:16): [True: 11.6M, False: 6.83M] ------------------ 1440| 18.5M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11last_oh_cshINS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcT_jmDpOT0_: 1737| 514k| { 1738| 514k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 514k, False: 0] ------------------ 1739| 514k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 514k, False: 0] ------------------ 1740| 514k| auto child = node_->inner()[offset_hint]; 1741| 514k| auto is_leaf = shift_ == BL; 1742| 514k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 514k] ------------------ 1743| 514k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 514k| : visit_maybe_relaxed_sub( 1745| 514k| child, shift_ - B, child_size_hint, v, args...); 1746| 514k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcPT_jmT0_DpOT1_: 1838| 514k|{ 1839| 514k| assert(node); ------------------ | Branch (1839:5): [True: 514k, False: 0] ------------------ 1840| 514k| auto relaxed = node->relaxed(); 1841| 514k| if (relaxed) { ------------------ | Branch (1841:9): [True: 297k, False: 216k] ------------------ 1842| 297k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 297k, False: 0] ------------------ 1843| 297k| return make_relaxed_pos(node, shift, relaxed) 1844| 297k| .visit(v, std::forward(args)...); 1845| 297k| } else { 1846| 216k| return make_regular_sub_pos(node, shift, size) 1847| 216k| .visit(v, std::forward(args)...); 1848| 216k| } 1849| 514k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcT_DpOT0_: 1036| 216k| { 1037| 216k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 216k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 788| 2.42M| count_t index(size_t idx) const { return (idx >> shift_) & mask; } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7last_ohINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_jDpOT0_: 952| 511k| { 953| 511k| return last_oh_regular(*this, v, offset_hint, args...); 954| 511k| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_17push_tail_visitorISD_EEJRPSD_EEEDcOT_T0_jDpOT1_: 677| 511k|{ 678| 511k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 511k, False: 0] ------------------ 679| 511k| constexpr auto B = bits; 680| 511k| constexpr auto BL = bits_leaf; 681| 511k| auto child = p.node()->inner()[offset_hint]; 682| 511k| auto is_leaf = p.shift() == BL; 683| 511k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 511k] ------------------ 684| 511k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 511k| .visit(v, args...); 686| 511k|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_DpOT0_: 336| 2.20M| { 337| 2.20M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.20M| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7last_ohINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_jDpOT0_: 330| 1.68M| { 331| 1.68M| return last_oh_regular(*this, v, offset_hint, args...); 332| 1.68M| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_17push_tail_visitorISD_EEJRPSD_EEEDcOT_T0_jDpOT1_: 677| 1.68M|{ 678| 1.68M| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.68M, False: 0] ------------------ 679| 1.68M| constexpr auto B = bits; 680| 1.68M| constexpr auto BL = bits_leaf; 681| 1.68M| auto child = p.node()->inner()[offset_hint]; 682| 1.68M| auto is_leaf = p.shift() == BL; 683| 1.68M| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.68M] ------------------ 684| 1.68M| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.68M| .visit(v, args...); 686| 1.68M|} _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 1432| 22.3M| size_t size() const { return relaxed_->d.sizes[relaxed_->d.count - 1]; } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_DpOT0_: 1036| 318k| { 1037| 318k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 318k| } flex-vector.cpp:_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_DpOT0_: 144| 40.5k| { 145| 40.5k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 40.5k| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 139| 1.24M| count_t index(size_t idx) const { return idx & mask; } flex-vector.cpp:_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSJ_E_EEEDcPSJ_jmT0_DpOT1_: 1838| 300k|{ 1839| 300k| assert(node); ------------------ | Branch (1839:5): [True: 300k, False: 0] ------------------ 1840| 300k| auto relaxed = node->relaxed(); 1841| 300k| if (relaxed) { ------------------ | Branch (1841:9): [True: 274k, False: 25.9k] ------------------ 1842| 274k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 274k, False: 0] ------------------ 1843| 274k| return make_relaxed_pos(node, shift, relaxed) 1844| 274k| .visit(v, std::forward(args)...); 1845| 274k| } else { 1846| 25.9k| return make_regular_sub_pos(node, shift, size) 1847| 25.9k| .visit(v, std::forward(args)...); 1848| 25.9k| } 1849| 300k|} flex-vector.cpp:_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 1813| 274k| { 1814| 274k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 274k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 1454| 31.9M| { 1455| 31.9M| auto offset = idx >> shift_; 1456| 43.4M| while (relaxed_->d.sizes[offset] <= idx) ------------------ | Branch (1456:16): [True: 11.4M, False: 31.9M] ------------------ 1457| 11.4M| ++offset; 1458| 31.9M| return offset; 1459| 31.9M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7relaxedEv: 1435| 274k| relaxed_t* relaxed() const { return relaxed_; } flex-vector.cpp:_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjDpOT0_: 1686| 274k| { 1687| 274k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 274k, False: 0] ------------------ 1688| 274k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 51.2k, False: 222k] ------------------ 1689| 274k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 274k| } flex-vector.cpp:_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjmDpOT0_: 1698| 274k| { 1699| 274k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 274k| } flex-vector.cpp:_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjmDpOT0_: 1717| 274k| { 1718| 274k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 274k, False: 0] ------------------ 1719| 274k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 51.2k, False: 222k] | Branch (1719:9): [True: 274k, False: 0] ------------------ 1720| 274k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 274k| auto child = node_->inner()[offset_hint]; 1722| 274k| auto is_leaf = shift_ == BL; 1723| 274k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 274k| auto next_idx = idx - left_size_hint; 1725| 274k| return is_leaf ------------------ | Branch (1725:16): [True: 42.6k, False: 231k] ------------------ 1726| 274k| ? make_leaf_sub_pos(child, next_size) 1727| 42.6k| .visit(v, next_idx, args...) 1728| 274k| : visit_maybe_relaxed_sub( 1729| 231k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 274k| } flex-vector.cpp:_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 144| 42.6k| { 145| 42.6k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 42.6k| } flex-vector.cpp:_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 1036| 25.9k| { 1037| 25.9k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 25.9k| } flex-vector.cpp:_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_: 938| 25.9k| { 939| 25.9k| return towards_oh_ch_regular( 940| 25.9k| *this, v, idx, offset_hint, count(), args...); 941| 25.9k| } flex-vector.cpp:_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_14update_visitorISD_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcOSL_T0_mjjDpOT1_: 632| 25.9k|{ 633| 25.9k| constexpr auto B = bits; 634| 25.9k| constexpr auto BL = bits_leaf; 635| 25.9k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 25.9k, False: 0] ------------------ 636| 25.9k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 25.9k, False: 0] ------------------ 637| 25.9k| auto is_leaf = p.shift() == BL; 638| 25.9k| auto child = p.node()->inner()[offset_hint]; 639| 25.9k| auto is_full = offset_hint + 1 != count_hint; 640| 25.9k| return is_full ------------------ | Branch (640:12): [True: 18.2k, False: 7.71k] ------------------ 641| 25.9k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 6.91k, False: 11.3k] ------------------ 642| 18.2k| : make_full_pos(child, p.shift() - B) 643| 11.3k| .visit(v, idx, args...)) 644| 25.9k| : (is_leaf ------------------ | Branch (644:19): [True: 3.22k, False: 4.49k] ------------------ 645| 7.71k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 7.71k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 4.49k| .visit(v, idx, args...)); 648| 25.9k|} flex-vector.cpp:_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 207| 22.0k| { 208| 22.0k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 22.0k| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 202| 440k| count_t index(size_t idx) const { return idx & mask; } flex-vector.cpp:_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 1405| 18.1k| { 1406| 18.1k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 18.1k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 1162| 2.21M| count_t index(size_t idx) const { return (idx >> shift_) & mask; } flex-vector.cpp:_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_: 1329| 18.1k| { 1330| 18.1k| return towards_oh(v, idx, offset_hint, args...); 1331| 18.1k| } flex-vector.cpp:_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjDpOT0_: 1336| 18.1k| { 1337| 18.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 18.1k, False: 0] ------------------ 1338| 18.1k| auto is_leaf = shift_ == BL; 1339| 18.1k| auto child = node_->inner()[offset_hint]; 1340| 18.1k| return is_leaf ------------------ | Branch (1340:16): [True: 12.1k, False: 5.98k] ------------------ 1341| 18.1k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 18.1k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 18.1k| } flex-vector.cpp:_ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 112| 3.94k| { 113| 3.94k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 3.94k| } flex-vector.cpp:_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 336| 4.90k| { 337| 4.90k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.90k| } flex-vector.cpp:_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_: 316| 4.90k| { 317| 4.90k| return towards_oh_ch_regular( 318| 4.90k| *this, v, idx, offset_hint, count(), args...); 319| 4.90k| } flex-vector.cpp:_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_14update_visitorISD_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcOSL_T0_mjjDpOT1_: 632| 4.90k|{ 633| 4.90k| constexpr auto B = bits; 634| 4.90k| constexpr auto BL = bits_leaf; 635| 4.90k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.90k, False: 0] ------------------ 636| 4.90k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.90k, False: 0] ------------------ 637| 4.90k| auto is_leaf = p.shift() == BL; 638| 4.90k| auto child = p.node()->inner()[offset_hint]; 639| 4.90k| auto is_full = offset_hint + 1 != count_hint; 640| 4.90k| return is_full ------------------ | Branch (640:12): [True: 3.77k, False: 1.13k] ------------------ 641| 4.90k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 2.91k, False: 856] ------------------ 642| 3.77k| : make_full_pos(child, p.shift() - B) 643| 856| .visit(v, idx, args...)) 644| 4.90k| : (is_leaf ------------------ | Branch (644:19): [True: 721, False: 417] ------------------ 645| 1.13k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.13k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 417| .visit(v, idx, args...)); 648| 4.90k|} _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 43.5k|{ 1839| 43.5k| assert(node); ------------------ | Branch (1839:5): [True: 43.5k, False: 0] ------------------ 1840| 43.5k| auto relaxed = node->relaxed(); 1841| 43.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 37.0k, False: 6.46k] ------------------ 1842| 37.0k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 37.0k, False: 0] ------------------ 1843| 37.0k| return make_relaxed_pos(node, shift, relaxed) 1844| 37.0k| .visit(v, std::forward(args)...); 1845| 37.0k| } else { 1846| 6.46k| return make_regular_sub_pos(node, shift, size) 1847| 6.46k| .visit(v, std::forward(args)...); 1848| 6.46k| } 1849| 43.5k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 37.0k| { 1814| 37.0k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 37.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 1686| 28.0k| { 1687| 28.0k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 28.0k, False: 0] ------------------ 1688| 28.0k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 28.0k] ------------------ 1689| 28.0k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 28.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1698| 28.0k| { 1699| 28.0k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 28.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1717| 28.0k| { 1718| 28.0k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 28.0k, False: 0] ------------------ 1719| 28.0k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 28.0k] | Branch (1719:9): [True: 28.0k, False: 0] ------------------ 1720| 28.0k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 28.0k| auto child = node_->inner()[offset_hint]; 1722| 28.0k| auto is_leaf = shift_ == BL; 1723| 28.0k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 28.0k| auto next_idx = idx - left_size_hint; 1725| 28.0k| return is_leaf ------------------ | Branch (1725:16): [True: 2.27k, False: 25.7k] ------------------ 1726| 28.0k| ? make_leaf_sub_pos(child, next_size) 1727| 2.27k| .visit(v, next_idx, args...) 1728| 28.0k| : visit_maybe_relaxed_sub( 1729| 25.7k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 28.0k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 144| 2.27k| { 145| 2.27k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.27k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1686| 20.1k| { 1687| 20.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 20.1k, False: 0] ------------------ 1688| 20.1k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 13.7k, False: 6.45k] ------------------ 1689| 20.1k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 20.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1698| 20.1k| { 1699| 20.1k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 20.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1717| 20.1k| { 1718| 20.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 20.1k, False: 0] ------------------ 1719| 20.1k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 13.7k, False: 6.45k] | Branch (1719:9): [True: 20.1k, False: 0] ------------------ 1720| 20.1k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 20.1k| auto child = node_->inner()[offset_hint]; 1722| 20.1k| auto is_leaf = shift_ == BL; 1723| 20.1k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 20.1k| auto next_idx = idx - left_size_hint; 1725| 20.1k| return is_leaf ------------------ | Branch (1725:16): [True: 5.23k, False: 14.9k] ------------------ 1726| 20.1k| ? make_leaf_sub_pos(child, next_size) 1727| 5.23k| .visit(v, next_idx, args...) 1728| 20.1k| : visit_maybe_relaxed_sub( 1729| 14.9k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 20.1k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 144| 5.23k| { 145| 5.23k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.23k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 14.9k|{ 1839| 14.9k| assert(node); ------------------ | Branch (1839:5): [True: 14.9k, False: 0] ------------------ 1840| 14.9k| auto relaxed = node->relaxed(); 1841| 14.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 11.2k, False: 3.75k] ------------------ 1842| 11.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 11.2k, False: 0] ------------------ 1843| 11.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 11.2k| .visit(v, std::forward(args)...); 1845| 11.2k| } else { 1846| 3.75k| return make_regular_sub_pos(node, shift, size) 1847| 3.75k| .visit(v, std::forward(args)...); 1848| 3.75k| } 1849| 14.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1813| 11.2k| { 1814| 11.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 11.2k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1036| 3.75k| { 1037| 3.75k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.75k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 927| 6.65k| { 928| 6.65k| return towards_oh_ch_regular( 929| 6.65k| *this, v, idx, offset_hint, count(), args...); 930| 6.65k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_19slice_right_visitorISD_Lb0EEEJEEEDcOT_T0_mjjDpOT1_: 632| 6.65k|{ 633| 6.65k| constexpr auto B = bits; 634| 6.65k| constexpr auto BL = bits_leaf; 635| 6.65k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.65k, False: 0] ------------------ 636| 6.65k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.65k, False: 0] ------------------ 637| 6.65k| auto is_leaf = p.shift() == BL; 638| 6.65k| auto child = p.node()->inner()[offset_hint]; 639| 6.65k| auto is_full = offset_hint + 1 != count_hint; 640| 6.65k| return is_full ------------------ | Branch (640:12): [True: 2.45k, False: 4.19k] ------------------ 641| 6.65k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.57k, False: 885] ------------------ 642| 2.45k| : make_full_pos(child, p.shift() - B) 643| 885| .visit(v, idx, args...)) 644| 6.65k| : (is_leaf ------------------ | Branch (644:19): [True: 1.00k, False: 3.18k] ------------------ 645| 4.19k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 4.19k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.18k| .visit(v, idx, args...)); 648| 6.65k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 207| 5.83k| { 208| 5.83k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.83k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1405| 2.44k| { 1406| 2.44k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.44k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1336| 3.86k| { 1337| 3.86k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 3.86k, False: 0] ------------------ 1338| 3.86k| auto is_leaf = shift_ == BL; 1339| 3.86k| auto child = node_->inner()[offset_hint]; 1340| 3.86k| return is_leaf ------------------ | Branch (1340:16): [True: 2.71k, False: 1.14k] ------------------ 1341| 3.86k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 3.86k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 3.86k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 1161| 205k| shift_t shift() const { return shift_; } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 112| 2.23k| { 113| 2.23k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.23k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 336| 4.62k| { 337| 4.62k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.62k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 305| 4.62k| { 306| 4.62k| return towards_oh_ch_regular( 307| 4.62k| *this, v, idx, offset_hint, count(), args...); 308| 4.62k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_19slice_right_visitorISD_Lb0EEEJEEEDcOT_T0_mjjDpOT1_: 632| 4.62k|{ 633| 4.62k| constexpr auto B = bits; 634| 4.62k| constexpr auto BL = bits_leaf; 635| 4.62k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.62k, False: 0] ------------------ 636| 4.62k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.62k, False: 0] ------------------ 637| 4.62k| auto is_leaf = p.shift() == BL; 638| 4.62k| auto child = p.node()->inner()[offset_hint]; 639| 4.62k| auto is_full = offset_hint + 1 != count_hint; 640| 4.62k| return is_full ------------------ | Branch (640:12): [True: 1.96k, False: 2.65k] ------------------ 641| 4.62k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.55k, False: 415] ------------------ 642| 1.96k| : make_full_pos(child, p.shift() - B) 643| 415| .visit(v, idx, args...)) 644| 4.62k| : (is_leaf ------------------ | Branch (644:19): [True: 1.22k, False: 1.43k] ------------------ 645| 2.65k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.65k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.43k| .visit(v, idx, args...)); 648| 4.62k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1036| 6.46k| { 1037| 6.46k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.46k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 927| 3.56k| { 928| 3.56k| return towards_oh_ch_regular( 929| 3.56k| *this, v, idx, offset_hint, count(), args...); 930| 3.56k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_19slice_right_visitorISD_Lb1EEEJEEEDcOT_T0_mjjDpOT1_: 632| 3.56k|{ 633| 3.56k| constexpr auto B = bits; 634| 3.56k| constexpr auto BL = bits_leaf; 635| 3.56k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.56k, False: 0] ------------------ 636| 3.56k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.56k, False: 0] ------------------ 637| 3.56k| auto is_leaf = p.shift() == BL; 638| 3.56k| auto child = p.node()->inner()[offset_hint]; 639| 3.56k| auto is_full = offset_hint + 1 != count_hint; 640| 3.56k| return is_full ------------------ | Branch (640:12): [True: 2.90k, False: 665] ------------------ 641| 3.56k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 856, False: 2.04k] ------------------ 642| 2.90k| : make_full_pos(child, p.shift() - B) 643| 2.04k| .visit(v, idx, args...)) 644| 3.56k| : (is_leaf ------------------ | Branch (644:19): [True: 665, False: 0] ------------------ 645| 665| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 665| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 3.56k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 207| 1.49k| { 208| 1.49k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.49k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1405| 2.62k| { 1406| 2.62k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.62k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 1336| 1.20k| { 1337| 1.20k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.20k, False: 0] ------------------ 1338| 1.20k| auto is_leaf = shift_ == BL; 1339| 1.20k| auto child = node_->inner()[offset_hint]; 1340| 1.20k| return is_leaf ------------------ | Branch (1340:16): [True: 634, False: 575] ------------------ 1341| 1.20k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.20k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.20k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 112| 665| { 113| 665| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 665| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 22.3k|{ 1839| 22.3k| assert(node); ------------------ | Branch (1839:5): [True: 22.3k, False: 0] ------------------ 1840| 22.3k| auto relaxed = node->relaxed(); 1841| 22.3k| if (relaxed) { ------------------ | Branch (1841:9): [True: 15.2k, False: 7.13k] ------------------ 1842| 15.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 15.2k, False: 0] ------------------ 1843| 15.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 15.2k| .visit(v, std::forward(args)...); 1845| 15.2k| } else { 1846| 7.13k| return make_regular_sub_pos(node, shift, size) 1847| 7.13k| .visit(v, std::forward(args)...); 1848| 7.13k| } 1849| 22.3k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 15.2k| { 1814| 15.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 15.2k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8subindexEm: 1434| 10.1M| count_t subindex(size_t idx) const { return index(idx); } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 1705| 4.39k| { 1706| 4.39k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 4.39k, False: 0] ------------------ 1707| 4.39k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 3.76k, False: 629] ------------------ 1708| 4.39k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 4.39k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_18slice_left_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1717| 4.39k| { 1718| 4.39k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 4.39k, False: 0] ------------------ 1719| 4.39k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.76k, False: 629] | Branch (1719:9): [True: 4.39k, False: 0] ------------------ 1720| 4.39k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 4.39k| auto child = node_->inner()[offset_hint]; 1722| 4.39k| auto is_leaf = shift_ == BL; 1723| 4.39k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 4.39k| auto next_idx = idx - left_size_hint; 1725| 4.39k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 4.39k] ------------------ 1726| 4.39k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 4.39k| : visit_maybe_relaxed_sub( 1729| 4.39k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 4.39k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1705| 55.5k| { 1706| 55.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 55.5k, False: 0] ------------------ 1707| 55.5k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 15.4k, False: 40.1k] ------------------ 1708| 55.5k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 55.5k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1717| 55.5k| { 1718| 55.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 55.5k, False: 0] ------------------ 1719| 55.5k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 15.4k, False: 40.1k] | Branch (1719:9): [True: 55.5k, False: 0] ------------------ 1720| 55.5k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 55.5k| auto child = node_->inner()[offset_hint]; 1722| 55.5k| auto is_leaf = shift_ == BL; 1723| 55.5k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 55.5k| auto next_idx = idx - left_size_hint; 1725| 55.5k| return is_leaf ------------------ | Branch (1725:16): [True: 8.64k, False: 46.9k] ------------------ 1726| 55.5k| ? make_leaf_sub_pos(child, next_size) 1727| 8.64k| .visit(v, next_idx, args...) 1728| 55.5k| : visit_maybe_relaxed_sub( 1729| 46.9k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 55.5k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 144| 8.64k| { 145| 8.64k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 8.64k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 46.9k|{ 1839| 46.9k| assert(node); ------------------ | Branch (1839:5): [True: 46.9k, False: 0] ------------------ 1840| 46.9k| auto relaxed = node->relaxed(); 1841| 46.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 44.6k, False: 2.21k] ------------------ 1842| 44.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 44.6k, False: 0] ------------------ 1843| 44.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 44.6k| .visit(v, std::forward(args)...); 1845| 44.6k| } else { 1846| 2.21k| return make_regular_sub_pos(node, shift, size) 1847| 2.21k| .visit(v, std::forward(args)...); 1848| 2.21k| } 1849| 46.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1813| 44.6k| { 1814| 44.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 44.6k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1036| 2.21k| { 1037| 2.21k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.21k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11size_beforeEj: 791| 197k| { 792| 197k| return size_t{offset} << shift_; 793| 197k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8size_sbhEjm: 803| 26.8k| { 804| 26.8k| assert(size_before_hint == size_before(offset)); ------------------ | Branch (804:9): [True: 26.8k, False: 0] ------------------ 805| 26.8k| return offset == subindex(size_ - 1) ? size_ - size_before_hint ------------------ | Branch (805:16): [True: 15.0k, False: 11.8k] ------------------ 806| 26.8k| : size_t{1} << shift_; 807| 26.8k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 946| 8.00k| { 947| 8.00k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 8.00k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_18slice_left_visitorISD_Lb0EEEJEEEDcOT_T0_mjDpOT1_: 653| 8.00k|{ 654| 8.00k| constexpr auto B = bits; 655| 8.00k| constexpr auto BL = bits_leaf; 656| 8.00k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 8.00k, False: 0] ------------------ 657| 8.00k| auto is_leaf = p.shift() == BL; 658| 8.00k| auto child = p.node()->inner()[offset_hint]; 659| 8.00k| auto lsize = offset_hint << p.shift(); 660| 8.00k| auto size = p.this_size(); 661| 8.00k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 8.00k| return is_full ------------------ | Branch (662:12): [True: 8.00k, False: 0] ------------------ 663| 8.00k| ? (is_leaf ------------------ | Branch (663:19): [True: 4.35k, False: 3.65k] ------------------ 664| 8.00k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 8.00k| : make_full_pos(child, p.shift() - B) 666| 3.65k| .visit(v, idx - lsize, args...)) 667| 8.00k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 0] ------------------ 668| 0| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 0| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 0| .visit(v, idx - lsize, args...)); 672| 8.00k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9this_sizeEv: 794| 26.8k| size_t this_size() const { return size_; } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJmEEEDcT_DpOT0_: 207| 9.34k| { 208| 9.34k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 9.34k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJmEEEDcT_DpOT0_: 1405| 5.89k| { 1406| 5.89k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 5.89k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8subindexEm: 1163| 19.0k| count_t subindex(size_t idx) const { return idx >> shift_; } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11size_beforeEj: 1170| 38.5k| { 1171| 38.5k| return size_t{offset} << shift_; 1172| 38.5k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8size_sbhEjm: 1166| 19.0k| { 1167| 19.0k| return size_t{1} << shift_; 1168| 19.0k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1348| 7.23k| { 1349| 7.23k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 7.23k, False: 0] ------------------ 1350| 7.23k| auto is_leaf = shift_ == BL; 1351| 7.23k| auto child = node_->inner()[offset_hint]; 1352| 7.23k| auto lsize = size_t{offset_hint} << shift_; 1353| 7.23k| return is_leaf ------------------ | Branch (1353:16): [True: 4.99k, False: 2.23k] ------------------ 1354| 7.23k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 7.23k| : make_full_pos(child, shift_ - B) 1356| 2.23k| .visit(v, idx - lsize, args...); 1357| 7.23k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10copy_sizesEjjmPm: 1175| 16.8k| { 1176| 16.8k| auto e = sizes + n; 1177| 42.4k| for (; sizes != e; ++sizes) { ------------------ | Branch (1177:16): [True: 25.6k, False: 16.8k] ------------------ 1178| 25.6k| init = *sizes = init + (size_t{1} << shift_); 1179| | assert(init); ------------------ | Branch (1179:13): [True: 25.6k, False: 0] ------------------ 1180| 25.6k| } 1181| 16.8k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 1160| 858k| size_t size() const { return branches << shift_; } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10copy_sizesEjjmPm: 810| 235k| { 811| 235k| if (n) { ------------------ | Branch (811:13): [True: 230k, False: 5.32k] ------------------ 812| 230k| auto last = offset + n - 1; 813| 230k| auto e = sizes + n - 1; 814| 458k| for (; sizes != e; ++sizes) { ------------------ | Branch (814:20): [True: 228k, False: 230k] ------------------ 815| 228k| init = *sizes = init + (size_t{1} << shift_); 816| 228k| assert(init); ------------------ | Branch (816:17): [True: 228k, False: 0] ------------------ 817| 228k| } 818| 230k| *sizes = init + size(last); 819| | assert(*sizes); ------------------ | Branch (819:13): [True: 230k, False: 0] ------------------ 820| 230k| } 821| 235k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEj: 797| 245k| { 798| 245k| return offset == subindex(size_ - 1) ? size_ - size_before(offset) ------------------ | Branch (798:16): [True: 125k, False: 120k] ------------------ 799| 245k| : size_t{1} << shift_; 800| 245k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10copy_sizesEjjmPm: 1462| 5.59M| { 1463| 5.59M| auto e = sizes + n; 1464| 5.59M| auto prev = size_before(offset); 1465| 5.59M| auto these = relaxed_->d.sizes + offset; 1466| 16.0M| for (; sizes != e; ++sizes, ++these) { ------------------ | Branch (1466:16): [True: 10.4M, False: 5.59M] ------------------ 1467| 10.4M| auto this_size = *these; 1468| 10.4M| init = *sizes = init + (this_size - prev); 1469| 10.4M| assert(init); ------------------ | Branch (1469:13): [True: 10.4M, False: 0] ------------------ 1470| 10.4M| prev = this_size; 1471| 10.4M| } 1472| 5.59M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1036| 7.13k| { 1037| 7.13k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 7.13k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 946| 3.52k| { 947| 3.52k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 3.52k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_18slice_left_visitorISD_Lb1EEEJEEEDcOT_T0_mjDpOT1_: 653| 3.52k|{ 654| 3.52k| constexpr auto B = bits; 655| 3.52k| constexpr auto BL = bits_leaf; 656| 3.52k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 3.52k, False: 0] ------------------ 657| 3.52k| auto is_leaf = p.shift() == BL; 658| 3.52k| auto child = p.node()->inner()[offset_hint]; 659| 3.52k| auto lsize = offset_hint << p.shift(); 660| 3.52k| auto size = p.this_size(); 661| 3.52k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 3.52k| return is_full ------------------ | Branch (662:12): [True: 1.34k, False: 2.18k] ------------------ 663| 3.52k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 1.34k] ------------------ 664| 1.34k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 1.34k| : make_full_pos(child, p.shift() - B) 666| 1.34k| .visit(v, idx - lsize, args...)) 667| 3.52k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 2.18k] ------------------ 668| 2.18k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 2.18k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 2.18k| .visit(v, idx - lsize, args...)); 672| 3.52k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_: 1405| 1.64k| { 1406| 1.64k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.64k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 1348| 298| { 1349| 298| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 298, False: 0] ------------------ 1350| 298| auto is_leaf = shift_ == BL; 1351| 298| auto child = node_->inner()[offset_hint]; 1352| 298| auto lsize = size_t{offset_hint} << shift_; 1353| 298| return is_leaf ------------------ | Branch (1353:16): [True: 0, False: 298] ------------------ 1354| 298| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 298| : make_full_pos(child, shift_ - B) 1356| 298| .visit(v, idx - lsize, args...); 1357| 298| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_: 1036| 2.18k| { 1037| 2.18k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.18k| } _ZN5immer6detail4rbts30make_singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaPT_j: 766| 8.12k|{ 767| 8.12k| assert(leaf); ------------------ | Branch (767:5): [True: 8.12k, False: 0] ------------------ 768| 8.12k| IMMER_ASSERT_TAGGED(leaf->kind() == NodeT::kind_t::leaf); ------------------ | | 68| 8.12k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (768:5): [True: 8.12k, False: 0] ------------------ 769| 8.12k| assert(count > 0); ------------------ | Branch (769:5): [True: 8.12k, False: 0] ------------------ 770| 8.12k| return singleton_regular_sub_pos{leaf, count}; 771| 8.12k|} _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_25concat_trees_left_visitorISC_EEJNS1_14empty_leaf_posISC_EERPSC_RjRmEEEDcT_DpOT0_: 759| 8.12k| { 760| 8.12k| return Visitor::visit_regular(*this, std::forward(args)...); 761| 8.12k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_26concat_trees_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 8.12k|{ 1839| 8.12k| assert(node); ------------------ | Branch (1839:5): [True: 8.12k, False: 0] ------------------ 1840| 8.12k| auto relaxed = node->relaxed(); 1841| 8.12k| if (relaxed) { ------------------ | Branch (1841:9): [True: 5.78k, False: 2.34k] ------------------ 1842| 5.78k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 5.78k, False: 0] ------------------ 1843| 5.78k| return make_relaxed_pos(node, shift, relaxed) 1844| 5.78k| .visit(v, std::forward(args)...); 1845| 5.78k| } else { 1846| 2.34k| return make_regular_sub_pos(node, shift, size) 1847| 2.34k| .visit(v, std::forward(args)...); 1848| 2.34k| } 1849| 8.12k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1813| 5.78k| { 1814| 5.78k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 5.78k| } _ZNK5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 735| 27.2k| shift_t shift() const { return BL; } _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_: 744| 8.12k| { 745| 8.12k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEDcT_DpOT0_: 144| 2.47M| { 145| 2.47M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.47M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEDcT_DpOT0_: 1813| 21.7M| { 1814| 21.7M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 21.7M| } _ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_: 707| 2.48M| { 708| 2.48M| } _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13each_left_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 744| 8.12k| { 745| 8.12k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 144| 2.47M| { 145| 2.47M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.47M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 137| 2.47M| size_t size() const { return count_; } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 1813| 21.7M| { 1814| 21.7M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 21.7M| } _ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEEvT_DpOT0_: 707| 2.48M| { 708| 2.48M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1762| 17.9k| { 1763| 17.9k| auto child = node_->inner()[0]; 1764| 17.9k| auto child_size = relaxed_->d.sizes[0]; 1765| 17.9k| auto is_leaf = shift_ == BL; 1766| 17.9k| assert(child_size); ------------------ | Branch (1766:9): [True: 17.9k, False: 0] ------------------ 1767| 17.9k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 17.9k] ------------------ 1768| 17.9k| : visit_maybe_relaxed_sub( 1769| 17.9k| child, shift_ - B, child_size, v, args...); 1770| 17.9k| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 76| 8.12k| shift_t shift() const { return 0; } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 138| 1.99M| shift_t shift() const { return 0; } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 17.9k|{ 1839| 17.9k| assert(node); ------------------ | Branch (1839:5): [True: 17.9k, False: 0] ------------------ 1840| 17.9k| auto relaxed = node->relaxed(); 1841| 17.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 17.5k, False: 391] ------------------ 1842| 17.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 17.5k, False: 0] ------------------ 1843| 17.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 17.5k| .visit(v, std::forward(args)...); 1845| 17.5k| } else { 1846| 391| return make_regular_sub_pos(node, shift, size) 1847| 391| .visit(v, std::forward(args)...); 1848| 391| } 1849| 17.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1813| 17.5k| { 1814| 17.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 17.5k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1036| 391| { 1037| 391| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 391| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 970| 735| { 971| 735| auto is_leaf = shift_ == BL; 972| 735| auto child = node_->inner()[0]; 973| 735| auto is_full = size_ >= (size_t{1} << shift_); 974| 735| return is_full ------------------ | Branch (974:16): [True: 735, False: 0] ------------------ 975| 735| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 735] ------------------ 976| 735| ? make_full_leaf_pos(child).visit(v, args...) 977| 735| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 735| : (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| 735| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 201| 163k| shift_t shift() const { return 0; } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1405| 1.14k| { 1406| 1.14k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.14k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1361| 406| { 1362| 406| auto is_leaf = shift_ == BL; 1363| 406| auto child = node_->inner()[0]; 1364| 406| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 406] ------------------ 1365| 406| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 406| } _ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_: 711| 110k| { 712| 110k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_: 1304| 163k| { 1305| 163k| each_i(v, 1, branches, args...); 1306| 163k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE6each_iINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_jjDpOT0_: 1263| 163k| { 1264| 163k| auto p = node_->inner() + i; 1265| 163k| auto e = node_->inner() + n; 1266| 163k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 79.0k, False: 84.0k] ------------------ 1267| 316k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 237k, False: 79.0k] ------------------ 1268| 237k| IMMER_PREFETCH(p + 1); 1269| 237k| make_full_leaf_pos(*p).visit(v, args...); 1270| 237k| } 1271| 84.0k| } else { 1272| 84.0k| auto ss = shift_ - B; 1273| 336k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 252k, False: 84.0k] ------------------ 1274| 252k| make_full_pos(*p, ss).visit(v, args...); 1275| 84.0k| } 1276| 163k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEDcT_DpOT0_: 207| 1.18M| { 208| 1.18M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.18M| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEDcT_DpOT0_: 1405| 851k| { 1406| 851k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 851k| } _ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEEvT_DpOT0_: 711| 110k| { 712| 110k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 1304| 163k| { 1305| 163k| each_i(v, 1, branches, args...); 1306| 163k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE6each_iINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jjDpOT0_: 1263| 163k| { 1264| 163k| auto p = node_->inner() + i; 1265| 163k| auto e = node_->inner() + n; 1266| 163k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 79.0k, False: 84.0k] ------------------ 1267| 316k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 237k, False: 79.0k] ------------------ 1268| 237k| IMMER_PREFETCH(p + 1); 1269| 237k| make_full_leaf_pos(*p).visit(v, args...); 1270| 237k| } 1271| 84.0k| } else { 1272| 84.0k| auto ss = shift_ - B; 1273| 336k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 252k, False: 84.0k] ------------------ 1274| 252k| make_full_pos(*p, ss).visit(v, args...); 1275| 84.0k| } 1276| 163k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 207| 1.18M| { 208| 1.18M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.18M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 200| 1.18M| size_t size() const { return branches; } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 1405| 851k| { 1406| 851k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 851k| } _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 753| 735| { 754| 735| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 735| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 144| 735| { 145| 735| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 735| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1370| 735| { 1371| 735| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 735, False: 0] ------------------ 1372| 735| auto child = node_->inner()[0]; 1373| 735| return make_full_leaf_pos(child).visit(v, args...); 1374| 735| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 207| 2.73k| { 208| 2.73k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 2.73k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_: 906| 163k| { 907| 163k| if (count() > 1) ------------------ | Branch (907:13): [True: 147k, False: 15.6k] ------------------ 908| 147k| each_right_sub_(v, 1, args...); 909| 163k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE15each_right_sub_INS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_jDpOT0_: 879| 147k| { 880| 147k| auto last = count() - 1; 881| 147k| auto lsize = size_ - (last << shift_); 882| 147k| auto n = node()->inner() + i; 883| 147k| auto e = node()->inner() + last; 884| 147k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 68.3k, False: 79.0k] ------------------ 885| 202k| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 133k, False: 68.3k] ------------------ 886| 133k| IMMER_PREFETCH(n + 1); 887| 133k| make_full_leaf_pos(*n).visit(v, args...); 888| 133k| } 889| 68.3k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 79.0k| } else { 891| 79.0k| auto ss = shift_ - B; 892| 213k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 134k, False: 79.0k] ------------------ 893| 134k| make_full_pos(*n, ss).visit(v, args...); 894| 79.0k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 79.0k| } 896| 147k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEDcT_DpOT0_: 1036| 716k| { 1037| 716k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 716k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 906| 163k| { 907| 163k| if (count() > 1) ------------------ | Branch (907:13): [True: 147k, False: 15.6k] ------------------ 908| 147k| each_right_sub_(v, 1, args...); 909| 163k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE15each_right_sub_INS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_: 879| 147k| { 880| 147k| auto last = count() - 1; 881| 147k| auto lsize = size_ - (last << shift_); 882| 147k| auto n = node()->inner() + i; 883| 147k| auto e = node()->inner() + last; 884| 147k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 68.3k, False: 79.0k] ------------------ 885| 202k| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 133k, False: 68.3k] ------------------ 886| 133k| IMMER_PREFETCH(n + 1); 887| 133k| make_full_leaf_pos(*n).visit(v, args...); 888| 133k| } 889| 68.3k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 79.0k| } else { 891| 79.0k| auto ss = shift_ - B; 892| 213k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 134k, False: 79.0k] ------------------ 893| 134k| make_full_pos(*n, ss).visit(v, args...); 894| 79.0k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 79.0k| } 896| 147k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 1036| 716k| { 1037| 716k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 716k| } _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 753| 1.99k| { 754| 1.99k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 1.99k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 144| 1.99k| { 145| 1.99k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.99k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 986| 1.99k| { 987| 1.99k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 1.99k, False: 0] ------------------ 988| 1.99k| auto child = node_->inner()[0]; 989| 1.99k| auto is_full = size_ >= branches; 990| 1.99k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 1.99k, False: 0] ------------------ 991| 1.99k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 1.99k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 144| 5.39k| { 145| 5.39k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.39k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_: 1647| 3.03M| { 1648| 3.03M| each_right(v, 1, std::forward(args)...); 1649| 3.03M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10each_rightINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_jDpOT0_: 1653| 3.03M| { 1654| 3.03M| assert(start > 0); ------------------ | Branch (1654:9): [True: 3.03M, False: 0] ------------------ 1655| 3.03M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 3.03M, False: 0] ------------------ 1656| 3.03M| auto s = relaxed_->d.sizes[start - 1]; 1657| 3.03M| auto p = node_->inner(); 1658| 3.03M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 375k, False: 2.66M] ------------------ 1659| 1.02M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 648k, False: 375k] ------------------ 1660| 648k| IMMER_PREFETCH(p + i + 1); 1661| 648k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 648k| .visit(v, args...); 1663| 648k| s = relaxed_->d.sizes[i]; 1664| 648k| assert(s); ------------------ | Branch (1664:17): [True: 648k, False: 0] ------------------ 1665| 648k| } 1666| 2.66M| } else { 1667| 2.66M| auto ss = shift_ - B; 1668| 9.45M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 6.79M, False: 2.66M] ------------------ 1669| 6.79M| visit_maybe_relaxed_sub( 1670| 6.79M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 6.79M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 6.79M, False: 0] ------------------ 1673| 6.79M| } 1674| 2.66M| } 1675| 3.03M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEDcPT_jmT0_DpOT1_: 1838| 14.1M|{ 1839| 14.1M| assert(node); ------------------ | Branch (1839:5): [True: 14.1M, False: 0] ------------------ 1840| 14.1M| auto relaxed = node->relaxed(); 1841| 14.1M| if (relaxed) { ------------------ | Branch (1841:9): [True: 13.5M, False: 637k] ------------------ 1842| 13.5M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 13.5M, False: 0] ------------------ 1843| 13.5M| return make_relaxed_pos(node, shift, relaxed) 1844| 13.5M| .visit(v, std::forward(args)...); 1845| 13.5M| } else { 1846| 637k| return make_regular_sub_pos(node, shift, size) 1847| 637k| .visit(v, std::forward(args)...); 1848| 637k| } 1849| 14.1M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 1647| 3.03M| { 1648| 3.03M| each_right(v, 1, std::forward(args)...); 1649| 3.03M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10each_rightINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_: 1653| 3.03M| { 1654| 3.03M| assert(start > 0); ------------------ | Branch (1654:9): [True: 3.03M, False: 0] ------------------ 1655| 3.03M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 3.03M, False: 0] ------------------ 1656| 3.03M| auto s = relaxed_->d.sizes[start - 1]; 1657| 3.03M| auto p = node_->inner(); 1658| 3.03M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 375k, False: 2.66M] ------------------ 1659| 1.02M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 648k, False: 375k] ------------------ 1660| 648k| IMMER_PREFETCH(p + i + 1); 1661| 648k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 648k| .visit(v, args...); 1663| 648k| s = relaxed_->d.sizes[i]; 1664| 648k| assert(s); ------------------ | Branch (1664:17): [True: 648k, False: 0] ------------------ 1665| 648k| } 1666| 2.66M| } else { 1667| 2.66M| auto ss = shift_ - B; 1668| 9.45M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 6.79M, False: 2.66M] ------------------ 1669| 6.79M| visit_maybe_relaxed_sub( 1670| 6.79M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 6.79M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 6.79M, False: 0] ------------------ 1673| 6.79M| } 1674| 2.66M| } 1675| 3.03M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 14.1M|{ 1839| 14.1M| assert(node); ------------------ | Branch (1839:5): [True: 14.1M, False: 0] ------------------ 1840| 14.1M| auto relaxed = node->relaxed(); 1841| 14.1M| if (relaxed) { ------------------ | Branch (1841:9): [True: 13.5M, False: 637k] ------------------ 1842| 13.5M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 13.5M, False: 0] ------------------ 1843| 13.5M| return make_relaxed_pos(node, shift, relaxed) 1844| 13.5M| .visit(v, std::forward(args)...); 1845| 13.5M| } else { 1846| 637k| return make_regular_sub_pos(node, shift, size) 1847| 637k| .visit(v, std::forward(args)...); 1848| 637k| } 1849| 14.1M|} _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 753| 5.39k| { 754| 5.39k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 5.39k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 144| 5.39k| { 145| 5.39k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.39k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1774| 5.39k| { 1775| 5.39k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 5.39k, False: 0] ------------------ 1776| 5.39k| auto child = node_->inner()[0]; 1777| 5.39k| auto child_size = relaxed_->d.sizes[0]; 1778| 5.39k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 5.39k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1036| 2.34k| { 1037| 2.34k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.34k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_25concat_trees_left_visitorISC_EEJNS1_8leaf_posISC_EERPSC_RjRmEEEDcPT_jmT0_DpOT1_: 1838| 530k|{ 1839| 530k| assert(node); ------------------ | Branch (1839:5): [True: 530k, False: 0] ------------------ 1840| 530k| auto relaxed = node->relaxed(); 1841| 530k| if (relaxed) { ------------------ | Branch (1841:9): [True: 516k, False: 14.1k] ------------------ 1842| 516k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 516k, False: 0] ------------------ 1843| 516k| return make_relaxed_pos(node, shift, relaxed) 1844| 516k| .visit(v, std::forward(args)...); 1845| 516k| } else { 1846| 14.1k| return make_regular_sub_pos(node, shift, size) 1847| 14.1k| .visit(v, std::forward(args)...); 1848| 14.1k| } 1849| 530k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_25concat_trees_left_visitorISC_EEJNS1_8leaf_posISC_EERPSC_RjRmEEEDcT_DpOT0_: 1813| 516k| { 1814| 516k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 516k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_26concat_trees_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 516k|{ 1839| 516k| assert(node); ------------------ | Branch (1839:5): [True: 516k, False: 0] ------------------ 1840| 516k| auto relaxed = node->relaxed(); 1841| 516k| if (relaxed) { ------------------ | Branch (1841:9): [True: 494k, False: 21.5k] ------------------ 1842| 494k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 494k, False: 0] ------------------ 1843| 494k| return make_relaxed_pos(node, shift, relaxed) 1844| 494k| .visit(v, std::forward(args)...); 1845| 494k| } else { 1846| 21.5k| return make_regular_sub_pos(node, shift, size) 1847| 21.5k| .visit(v, std::forward(args)...); 1848| 21.5k| } 1849| 516k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1813| 494k| { 1814| 494k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 494k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1750| 2.36M| { 1751| 2.36M| auto offset = relaxed_->d.count - 1; 1752| 2.36M| auto child = node_->inner()[offset]; 1753| 2.36M| auto child_size = size(offset); 1754| 2.36M| auto is_leaf = shift_ == BL; 1755| 2.36M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 2.36M] ------------------ 1756| 2.36M| : visit_maybe_relaxed_sub( 1757| 2.36M| child, shift_ - B, child_size, v, args...); 1758| 2.36M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 2.36M|{ 1839| 2.36M| assert(node); ------------------ | Branch (1839:5): [True: 2.36M, False: 0] ------------------ 1840| 2.36M| auto relaxed = node->relaxed(); 1841| 2.36M| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.36M, False: 2.10k] ------------------ 1842| 2.36M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.36M, False: 0] ------------------ 1843| 2.36M| return make_relaxed_pos(node, shift, relaxed) 1844| 2.36M| .visit(v, std::forward(args)...); 1845| 2.36M| } else { 1846| 2.10k| return make_regular_sub_pos(node, shift, size) 1847| 2.10k| .visit(v, std::forward(args)...); 1848| 2.10k| } 1849| 2.36M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1813| 2.36M| { 1814| 2.36M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.36M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 1036| 5.55k| { 1037| 5.55k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.55k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 958| 3.44k| { 959| 3.44k| auto offset = count() - 1; 960| 3.44k| auto child = node_->inner()[offset]; 961| 3.44k| auto is_leaf = shift_ == BL; 962| 3.44k| auto lsize = size_ - (size_t{offset} << shift_); 963| 3.44k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 3.44k] ------------------ 964| 3.44k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 3.44k| .visit(v, args...); 966| 3.44k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_: 913| 959k| { 914| 959k| each_left(v, count() - 1, args...); 915| 959k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_leftINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_jDpOT0_: 873| 959k| { 874| 959k| return each_left_regular(*this, v, last, args...); 875| 959k| } _ZN5immer6detail4rbts17each_left_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvOT_T0_jDpOT1_: 575| 959k|{ 576| 959k| constexpr auto B = bits; 577| 959k| constexpr auto BL = bits_leaf; 578| 959k| assert(last < p.count()); ------------------ | Branch (578:5): [True: 959k, False: 0] ------------------ 579| 959k| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 447k, False: 511k] ------------------ 580| 447k| auto n = p.node()->inner(); 581| 447k| auto e = n + last; 582| 1.25M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 811k, False: 447k] ------------------ 583| 811k| IMMER_PREFETCH(n + 1); 584| 811k| make_full_leaf_pos(*n).visit(v, args...); 585| 811k| } 586| 511k| } else { 587| 511k| auto n = p.node()->inner(); 588| 511k| auto e = n + last; 589| 511k| auto ss = p.shift() - B; 590| 977k| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 465k, False: 511k] ------------------ 591| 465k| make_full_pos(*n, ss).visit(v, args...); 592| 511k| } 593| 959k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13each_left_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 913| 959k| { 914| 959k| each_left(v, count() - 1, args...); 915| 959k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_leftINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_: 873| 959k| { 874| 959k| return each_left_regular(*this, v, last, args...); 875| 959k| } _ZN5immer6detail4rbts17each_left_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_21concat_merger_visitorEJRNS1_13concat_mergerISD_EEEEEvOT_T0_jDpOT1_: 575| 959k|{ 576| 959k| constexpr auto B = bits; 577| 959k| constexpr auto BL = bits_leaf; 578| 959k| assert(last < p.count()); ------------------ | Branch (578:5): [True: 959k, False: 0] ------------------ 579| 959k| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 447k, False: 511k] ------------------ 580| 447k| auto n = p.node()->inner(); 581| 447k| auto e = n + last; 582| 1.25M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 811k, False: 447k] ------------------ 583| 811k| IMMER_PREFETCH(n + 1); 584| 811k| make_full_leaf_pos(*n).visit(v, args...); 585| 811k| } 586| 511k| } else { 587| 511k| auto n = p.node()->inner(); 588| 511k| auto e = n + last; 589| 511k| auto ss = p.shift() - B; 590| 977k| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 465k, False: 511k] ------------------ 591| 465k| make_full_pos(*n, ss).visit(v, args...); 592| 511k| } 593| 959k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1762| 795k| { 1763| 795k| auto child = node_->inner()[0]; 1764| 795k| auto child_size = relaxed_->d.sizes[0]; 1765| 795k| auto is_leaf = shift_ == BL; 1766| 795k| assert(child_size); ------------------ | Branch (1766:9): [True: 795k, False: 0] ------------------ 1767| 795k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 795k] ------------------ 1768| 795k| : visit_maybe_relaxed_sub( 1769| 795k| child, shift_ - B, child_size, v, args...); 1770| 795k| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 106| 530k| shift_t shift() const { return 0; } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 795k|{ 1839| 795k| assert(node); ------------------ | Branch (1839:5): [True: 795k, False: 0] ------------------ 1840| 795k| auto relaxed = node->relaxed(); 1841| 795k| if (relaxed) { ------------------ | Branch (1841:9): [True: 668k, False: 126k] ------------------ 1842| 668k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 668k, False: 0] ------------------ 1843| 668k| return make_relaxed_pos(node, shift, relaxed) 1844| 668k| .visit(v, std::forward(args)...); 1845| 668k| } else { 1846| 126k| return make_regular_sub_pos(node, shift, size) 1847| 126k| .visit(v, std::forward(args)...); 1848| 126k| } 1849| 795k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1813| 668k| { 1814| 668k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 668k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 126k| { 1037| 126k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 126k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 958| 929| { 959| 929| auto offset = count() - 1; 960| 929| auto child = node_->inner()[offset]; 961| 929| auto is_leaf = shift_ == BL; 962| 929| auto lsize = size_ - (size_t{offset} << shift_); 963| 929| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 929] ------------------ 964| 929| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 929| .visit(v, args...); 966| 929| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1036| 1.33k| { 1037| 1.33k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.33k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 970| 74.3k| { 971| 74.3k| auto is_leaf = shift_ == BL; 972| 74.3k| auto child = node_->inner()[0]; 973| 74.3k| auto is_full = size_ >= (size_t{1} << shift_); 974| 74.3k| return is_full ------------------ | Branch (974:16): [True: 74.3k, False: 0] ------------------ 975| 74.3k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 74.3k] ------------------ 976| 74.3k| ? make_full_leaf_pos(child).visit(v, args...) 977| 74.3k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 74.3k| : (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| 74.3k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1405| 155k| { 1406| 155k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 155k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1361| 81.3k| { 1362| 81.3k| auto is_leaf = shift_ == BL; 1363| 81.3k| auto child = node_->inner()[0]; 1364| 81.3k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 81.3k] ------------------ 1365| 81.3k| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 81.3k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 958| 155k| { 959| 155k| auto offset = count() - 1; 960| 155k| auto child = node_->inner()[offset]; 961| 155k| auto is_leaf = shift_ == BL; 962| 155k| auto lsize = size_ - (size_t{offset} << shift_); 963| 155k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 75.5k, False: 79.8k] ------------------ 964| 155k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 79.8k| .visit(v, args...); 966| 155k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 144| 78.2k| { 145| 78.2k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 78.2k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1370| 78.2k| { 1371| 78.2k| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 78.2k, False: 0] ------------------ 1372| 78.2k| auto child = node_->inner()[0]; 1373| 78.2k| return make_full_leaf_pos(child).visit(v, args...); 1374| 78.2k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 207| 160k| { 208| 160k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 160k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 1036| 81.0k| { 1037| 81.0k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 81.0k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 958| 134k| { 959| 134k| auto offset = count() - 1; 960| 134k| auto child = node_->inner()[offset]; 961| 134k| auto is_leaf = shift_ == BL; 962| 134k| auto lsize = size_ - (size_t{offset} << shift_); 963| 134k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 71.4k, False: 63.0k] ------------------ 964| 134k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 63.0k| .visit(v, args...); 966| 134k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 144| 82.0k| { 145| 82.0k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 82.0k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 986| 82.0k| { 987| 82.0k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 82.0k, False: 0] ------------------ 988| 82.0k| auto child = node_->inner()[0]; 989| 82.0k| auto is_full = size_ >= branches; 990| 82.0k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 82.0k, False: 0] ------------------ 991| 82.0k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 82.0k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 144| 370k| { 145| 370k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 370k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1036| 73.7k| { 1037| 73.7k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 73.7k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 958| 665k| { 959| 665k| auto offset = count() - 1; 960| 665k| auto child = node_->inner()[offset]; 961| 665k| auto is_leaf = shift_ == BL; 962| 665k| auto lsize = size_ - (size_t{offset} << shift_); 963| 665k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 300k, False: 364k] ------------------ 964| 665k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 364k| .visit(v, args...); 966| 665k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 144| 370k| { 145| 370k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 370k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1774| 370k| { 1775| 370k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 370k, False: 0] ------------------ 1776| 370k| auto child = node_->inner()[0]; 1777| 370k| auto child_size = relaxed_->d.sizes[0]; 1778| 370k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 370k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 1036| 783k| { 1037| 783k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 783k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_: 1617| 4.77M| { 1618| 4.77M| each_left(v, relaxed_->d.count - 1, args...); 1619| 4.77M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_leftINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_jDpOT0_: 1623| 4.77M| { 1624| 4.77M| auto p = node_->inner(); 1625| 4.77M| auto s = size_t{}; 1626| 4.77M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 82.5k, False: 4.68M] ------------------ 1627| 233k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 150k, False: 82.5k] ------------------ 1628| 150k| IMMER_PREFETCH(p + i + 1); 1629| 150k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 150k| .visit(v, args...); 1631| 150k| s = relaxed_->d.sizes[i]; 1632| 150k| assert(s); ------------------ | Branch (1632:17): [True: 150k, False: 0] ------------------ 1633| 150k| } 1634| 4.68M| } else { 1635| 4.68M| auto ss = shift_ - B; 1636| 12.0M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 7.35M, False: 4.68M] ------------------ 1637| 7.35M| visit_maybe_relaxed_sub( 1638| 7.35M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 7.35M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 7.35M, False: 0] ------------------ 1641| 7.35M| } 1642| 4.68M| } 1643| 4.77M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13each_left_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 1617| 4.77M| { 1618| 4.77M| each_left(v, relaxed_->d.count - 1, args...); 1619| 4.77M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_leftINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_: 1623| 4.77M| { 1624| 4.77M| auto p = node_->inner(); 1625| 4.77M| auto s = size_t{}; 1626| 4.77M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 82.5k, False: 4.68M] ------------------ 1627| 233k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 150k, False: 82.5k] ------------------ 1628| 150k| IMMER_PREFETCH(p + i + 1); 1629| 150k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 150k| .visit(v, args...); 1631| 150k| s = relaxed_->d.sizes[i]; 1632| 150k| assert(s); ------------------ | Branch (1632:17): [True: 150k, False: 0] ------------------ 1633| 150k| } 1634| 4.68M| } else { 1635| 4.68M| auto ss = shift_ - B; 1636| 12.0M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 7.35M, False: 4.68M] ------------------ 1637| 7.35M| visit_maybe_relaxed_sub( 1638| 7.35M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 7.35M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 7.35M, False: 0] ------------------ 1641| 7.35M| } 1642| 4.68M| } 1643| 4.77M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1762| 1.84M| { 1763| 1.84M| auto child = node_->inner()[0]; 1764| 1.84M| auto child_size = relaxed_->d.sizes[0]; 1765| 1.84M| auto is_leaf = shift_ == BL; 1766| 1.84M| assert(child_size); ------------------ | Branch (1766:9): [True: 1.84M, False: 0] ------------------ 1767| 1.84M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 1.84M] ------------------ 1768| 1.84M| : visit_maybe_relaxed_sub( 1769| 1.84M| child, shift_ - B, child_size, v, args...); 1770| 1.84M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 1.84M|{ 1839| 1.84M| assert(node); ------------------ | Branch (1839:5): [True: 1.84M, False: 0] ------------------ 1840| 1.84M| auto relaxed = node->relaxed(); 1841| 1.84M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.84M, False: 4.00k] ------------------ 1842| 1.84M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.84M, False: 0] ------------------ 1843| 1.84M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.84M| .visit(v, std::forward(args)...); 1845| 1.84M| } else { 1846| 4.00k| return make_regular_sub_pos(node, shift, size) 1847| 4.00k| .visit(v, std::forward(args)...); 1848| 4.00k| } 1849| 1.84M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1813| 1.84M| { 1814| 1.84M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.84M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 4.00k| { 1037| 4.00k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.00k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1750| 114k| { 1751| 114k| auto offset = relaxed_->d.count - 1; 1752| 114k| auto child = node_->inner()[offset]; 1753| 114k| auto child_size = size(offset); 1754| 114k| auto is_leaf = shift_ == BL; 1755| 114k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 114k] ------------------ 1756| 114k| : visit_maybe_relaxed_sub( 1757| 114k| child, shift_ - B, child_size, v, args...); 1758| 114k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 114k|{ 1839| 114k| assert(node); ------------------ | Branch (1839:5): [True: 114k, False: 0] ------------------ 1840| 114k| auto relaxed = node->relaxed(); 1841| 114k| if (relaxed) { ------------------ | Branch (1841:9): [True: 114k, False: 404] ------------------ 1842| 114k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 114k, False: 0] ------------------ 1843| 114k| return make_relaxed_pos(node, shift, relaxed) 1844| 114k| .visit(v, std::forward(args)...); 1845| 114k| } else { 1846| 404| return make_regular_sub_pos(node, shift, size) 1847| 404| .visit(v, std::forward(args)...); 1848| 404| } 1849| 114k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1813| 114k| { 1814| 114k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 114k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 970| 3.88k| { 971| 3.88k| auto is_leaf = shift_ == BL; 972| 3.88k| auto child = node_->inner()[0]; 973| 3.88k| auto is_full = size_ >= (size_t{1} << shift_); 974| 3.88k| return is_full ------------------ | Branch (974:16): [True: 3.88k, False: 0] ------------------ 975| 3.88k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 3.88k] ------------------ 976| 3.88k| ? make_full_leaf_pos(child).visit(v, args...) 977| 3.88k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 3.88k| : (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| 3.88k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1405| 6.16k| { 1406| 6.16k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 6.16k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1361| 2.27k| { 1362| 2.27k| auto is_leaf = shift_ == BL; 1363| 2.27k| auto child = node_->inner()[0]; 1364| 2.27k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 2.27k] ------------------ 1365| 2.27k| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 2.27k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 1750| 5.90k| { 1751| 5.90k| auto offset = relaxed_->d.count - 1; 1752| 5.90k| auto child = node_->inner()[offset]; 1753| 5.90k| auto child_size = size(offset); 1754| 5.90k| auto is_leaf = shift_ == BL; 1755| 5.90k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 2.68k, False: 3.21k] ------------------ 1756| 5.90k| : visit_maybe_relaxed_sub( 1757| 3.21k| child, shift_ - B, child_size, v, args...); 1758| 5.90k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 3.21k|{ 1839| 3.21k| assert(node); ------------------ | Branch (1839:5): [True: 3.21k, False: 0] ------------------ 1840| 3.21k| auto relaxed = node->relaxed(); 1841| 3.21k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.01k, False: 1.20k] ------------------ 1842| 2.01k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.01k, False: 0] ------------------ 1843| 2.01k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.01k| .visit(v, std::forward(args)...); 1845| 2.01k| } else { 1846| 1.20k| return make_regular_sub_pos(node, shift, size) 1847| 1.20k| .visit(v, std::forward(args)...); 1848| 1.20k| } 1849| 3.21k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 1813| 2.01k| { 1814| 2.01k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.01k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1750| 24.4k| { 1751| 24.4k| auto offset = relaxed_->d.count - 1; 1752| 24.4k| auto child = node_->inner()[offset]; 1753| 24.4k| auto child_size = size(offset); 1754| 24.4k| auto is_leaf = shift_ == BL; 1755| 24.4k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 10.5k, False: 13.9k] ------------------ 1756| 24.4k| : visit_maybe_relaxed_sub( 1757| 13.9k| child, shift_ - B, child_size, v, args...); 1758| 24.4k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 13.9k|{ 1839| 13.9k| assert(node); ------------------ | Branch (1839:5): [True: 13.9k, False: 0] ------------------ 1840| 13.9k| auto relaxed = node->relaxed(); 1841| 13.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.17k, False: 10.7k] ------------------ 1842| 3.17k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.17k, False: 0] ------------------ 1843| 3.17k| return make_relaxed_pos(node, shift, relaxed) 1844| 3.17k| .visit(v, std::forward(args)...); 1845| 10.7k| } else { 1846| 10.7k| return make_regular_sub_pos(node, shift, size) 1847| 10.7k| .visit(v, std::forward(args)...); 1848| 10.7k| } 1849| 13.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1813| 3.17k| { 1814| 3.17k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.17k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1750| 2.25M| { 1751| 2.25M| auto offset = relaxed_->d.count - 1; 1752| 2.25M| auto child = node_->inner()[offset]; 1753| 2.25M| auto child_size = size(offset); 1754| 2.25M| auto is_leaf = shift_ == BL; 1755| 2.25M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 69.2k, False: 2.18M] ------------------ 1756| 2.25M| : visit_maybe_relaxed_sub( 1757| 2.18M| child, shift_ - B, child_size, v, args...); 1758| 2.25M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 2.18M|{ 1839| 2.18M| assert(node); ------------------ | Branch (1839:5): [True: 2.18M, False: 0] ------------------ 1840| 2.18M| auto relaxed = node->relaxed(); 1841| 2.18M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.76M, False: 419k] ------------------ 1842| 1.76M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.76M, False: 0] ------------------ 1843| 1.76M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.76M| .visit(v, std::forward(args)...); 1845| 1.76M| } else { 1846| 419k| return make_regular_sub_pos(node, shift, size) 1847| 419k| .visit(v, std::forward(args)...); 1848| 419k| } 1849| 2.18M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 1813| 1.76M| { 1814| 1.76M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.76M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 21.5k| { 1037| 21.5k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 21.5k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_25concat_trees_left_visitorISC_EEJNS1_8leaf_posISC_EERPSC_RjRmEEEDcT_DpOT0_: 1036| 14.1k| { 1037| 14.1k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 14.1k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_26concat_trees_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 14.1k|{ 1839| 14.1k| assert(node); ------------------ | Branch (1839:5): [True: 14.1k, False: 0] ------------------ 1840| 14.1k| auto relaxed = node->relaxed(); 1841| 14.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 6.33k, False: 7.85k] ------------------ 1842| 6.33k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 6.33k, False: 0] ------------------ 1843| 6.33k| return make_relaxed_pos(node, shift, relaxed) 1844| 6.33k| .visit(v, std::forward(args)...); 1845| 7.85k| } else { 1846| 7.85k| return make_regular_sub_pos(node, shift, size) 1847| 7.85k| .visit(v, std::forward(args)...); 1848| 7.85k| } 1849| 14.1k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1813| 6.33k| { 1814| 6.33k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 6.33k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 7.85k| { 1037| 7.85k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 7.85k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_: 1813| 53.1k| { 1814| 53.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 53.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11last_oh_cshINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_jmDpOT0_: 1737| 48.0k| { 1738| 48.0k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 48.0k, False: 0] ------------------ 1739| 48.0k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 48.0k, False: 0] ------------------ 1740| 48.0k| auto child = node_->inner()[offset_hint]; 1741| 48.0k| auto is_leaf = shift_ == BL; 1742| 48.0k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 48.0k] ------------------ 1743| 48.0k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 48.0k| : visit_maybe_relaxed_sub( 1745| 48.0k| child, shift_ - B, child_size_hint, v, args...); 1746| 48.0k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcPT_jmT0_DpOT1_: 1838| 48.0k|{ 1839| 48.0k| assert(node); ------------------ | Branch (1839:5): [True: 48.0k, False: 0] ------------------ 1840| 48.0k| auto relaxed = node->relaxed(); 1841| 48.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 8.89k, False: 39.1k] ------------------ 1842| 8.89k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 8.89k, False: 0] ------------------ 1843| 8.89k| return make_relaxed_pos(node, shift, relaxed) 1844| 8.89k| .visit(v, std::forward(args)...); 1845| 39.1k| } else { 1846| 39.1k| return make_regular_sub_pos(node, shift, size) 1847| 39.1k| .visit(v, std::forward(args)...); 1848| 39.1k| } 1849| 48.0k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_: 1036| 39.1k| { 1037| 39.1k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 39.1k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7last_ohINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_jDpOT0_: 952| 199k| { 953| 199k| return last_oh_regular(*this, v, offset_hint, args...); 954| 199k| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_21push_tail_mut_visitorISD_Lb1EEEJRNSB_5applyIS8_E4type4editERPSD_EEEDcOT_T0_jDpOT1_: 677| 199k|{ 678| 199k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 199k, False: 0] ------------------ 679| 199k| constexpr auto B = bits; 680| 199k| constexpr auto BL = bits_leaf; 681| 199k| auto child = p.node()->inner()[offset_hint]; 682| 199k| auto is_leaf = p.shift() == BL; 683| 199k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 199k] ------------------ 684| 199k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 199k| .visit(v, args...); 686| 199k|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_DpOT0_: 336| 911k| { 337| 911k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 911k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7last_ohINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_jDpOT0_: 330| 712k| { 331| 712k| return last_oh_regular(*this, v, offset_hint, args...); 332| 712k| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_21push_tail_mut_visitorISD_Lb1EEEJRNSB_5applyIS8_E4type4editERPSD_EEEDcOT_T0_jDpOT1_: 677| 712k|{ 678| 712k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 712k, False: 0] ------------------ 679| 712k| constexpr auto B = bits; 680| 712k| constexpr auto BL = bits_leaf; 681| 712k| auto child = p.node()->inner()[offset_hint]; 682| 712k| auto is_leaf = p.shift() == BL; 683| 712k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 712k] ------------------ 684| 712k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 712k| .visit(v, args...); 686| 712k|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7last_ohINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_jDpOT0_: 330| 1.62k| { 331| 1.62k| return last_oh_regular(*this, v, offset_hint, args...); 332| 1.62k| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_21push_tail_mut_visitorISD_Lb0EEEJRNSB_5applyIS8_E4type4editERPSD_EEEDcOT_T0_jDpOT1_: 677| 1.62k|{ 678| 1.62k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.62k, False: 0] ------------------ 679| 1.62k| constexpr auto B = bits; 680| 1.62k| constexpr auto BL = bits_leaf; 681| 1.62k| auto child = p.node()->inner()[offset_hint]; 682| 1.62k| auto is_leaf = p.shift() == BL; 683| 1.62k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.62k] ------------------ 684| 1.62k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.62k| .visit(v, args...); 686| 1.62k|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_DpOT0_: 336| 3.01k| { 337| 3.01k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.01k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7last_ohINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_jDpOT0_: 952| 1.39k| { 953| 1.39k| return last_oh_regular(*this, v, offset_hint, args...); 954| 1.39k| } _ZN5immer6detail4rbts15last_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_21push_tail_mut_visitorISD_Lb0EEEJRNSB_5applyIS8_E4type4editERPSD_EEEDcOT_T0_jDpOT1_: 677| 1.39k|{ 678| 1.39k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.39k, False: 0] ------------------ 679| 1.39k| constexpr auto B = bits; 680| 1.39k| constexpr auto BL = bits_leaf; 681| 1.39k| auto child = p.node()->inner()[offset_hint]; 682| 1.39k| auto is_leaf = p.shift() == BL; 683| 1.39k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.39k] ------------------ 684| 1.39k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.39k| .visit(v, args...); 686| 1.39k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11last_oh_cshINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_jmDpOT0_: 1737| 7.93k| { 1738| 7.93k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 7.93k, False: 0] ------------------ 1739| 7.93k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 7.93k, False: 0] ------------------ 1740| 7.93k| auto child = node_->inner()[offset_hint]; 1741| 7.93k| auto is_leaf = shift_ == BL; 1742| 7.93k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 7.93k] ------------------ 1743| 7.93k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 7.93k| : visit_maybe_relaxed_sub( 1745| 7.93k| child, shift_ - B, child_size_hint, v, args...); 1746| 7.93k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcPT_jmT0_DpOT1_: 1838| 7.93k|{ 1839| 7.93k| assert(node); ------------------ | Branch (1839:5): [True: 7.93k, False: 0] ------------------ 1840| 7.93k| auto relaxed = node->relaxed(); 1841| 7.93k| if (relaxed) { ------------------ | Branch (1841:9): [True: 6.86k, False: 1.07k] ------------------ 1842| 6.86k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 6.86k, False: 0] ------------------ 1843| 6.86k| return make_relaxed_pos(node, shift, relaxed) 1844| 6.86k| .visit(v, std::forward(args)...); 1845| 6.86k| } else { 1846| 1.07k| return make_regular_sub_pos(node, shift, size) 1847| 1.07k| .visit(v, std::forward(args)...); 1848| 1.07k| } 1849| 7.93k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_: 1813| 6.86k| { 1814| 6.86k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 6.86k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_: 1036| 1.07k| { 1037| 1.07k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.07k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_DpOT0_: 1036| 166k| { 1037| 166k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 166k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editEPPSC_EEEDcPT_jmT0_DpOT1_: 1838| 43.7k|{ 1839| 43.7k| assert(node); ------------------ | Branch (1839:5): [True: 43.7k, False: 0] ------------------ 1840| 43.7k| auto relaxed = node->relaxed(); 1841| 43.7k| if (relaxed) { ------------------ | Branch (1841:9): [True: 39.3k, False: 4.42k] ------------------ 1842| 39.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 39.3k, False: 0] ------------------ 1843| 39.3k| return make_relaxed_pos(node, shift, relaxed) 1844| 39.3k| .visit(v, std::forward(args)...); 1845| 39.3k| } else { 1846| 4.42k| return make_regular_sub_pos(node, shift, size) 1847| 4.42k| .visit(v, std::forward(args)...); 1848| 4.42k| } 1849| 43.7k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_DpOT0_: 1813| 39.3k| { 1814| 39.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 39.3k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjDpOT0_: 1686| 100k| { 1687| 100k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 100k, False: 0] ------------------ 1688| 100k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 37.5k, False: 63.4k] ------------------ 1689| 100k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 100k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_mjmDpOT0_: 1698| 100k| { 1699| 100k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 100k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_mjmDpOT0_: 1717| 100k| { 1718| 100k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 100k, False: 0] ------------------ 1719| 100k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 37.5k, False: 63.4k] | Branch (1719:9): [True: 100k, False: 0] ------------------ 1720| 100k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 100k| auto child = node_->inner()[offset_hint]; 1722| 100k| auto is_leaf = shift_ == BL; 1723| 100k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 100k| auto next_idx = idx - left_size_hint; 1725| 100k| return is_leaf ------------------ | Branch (1725:16): [True: 35.3k, False: 65.5k] ------------------ 1726| 100k| ? make_leaf_sub_pos(child, next_size) 1727| 35.3k| .visit(v, next_idx, args...) 1728| 100k| : visit_maybe_relaxed_sub( 1729| 65.5k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 100k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 144| 35.3k| { 145| 35.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 35.3k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcPT_jmT0_DpOT1_: 1838| 65.5k|{ 1839| 65.5k| assert(node); ------------------ | Branch (1839:5): [True: 65.5k, False: 0] ------------------ 1840| 65.5k| auto relaxed = node->relaxed(); 1841| 65.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 61.5k, False: 4.00k] ------------------ 1842| 61.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 61.5k, False: 0] ------------------ 1843| 61.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 61.5k| .visit(v, std::forward(args)...); 1845| 61.5k| } else { 1846| 4.00k| return make_regular_sub_pos(node, shift, size) 1847| 4.00k| .visit(v, std::forward(args)...); 1848| 4.00k| } 1849| 65.5k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1813| 61.5k| { 1814| 61.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 61.5k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1036| 4.00k| { 1037| 4.00k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.00k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 938| 8.42k| { 939| 8.42k| return towards_oh_ch_regular( 940| 8.42k| *this, v, idx, offset_hint, count(), args...); 941| 8.42k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_15get_mut_visitorISD_EEJRNSB_5applyIS8_E4type4editERPPSD_EEEDcOT_T0_mjjDpOT1_: 632| 8.42k|{ 633| 8.42k| constexpr auto B = bits; 634| 8.42k| constexpr auto BL = bits_leaf; 635| 8.42k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 8.42k, False: 0] ------------------ 636| 8.42k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 8.42k, False: 0] ------------------ 637| 8.42k| auto is_leaf = p.shift() == BL; 638| 8.42k| auto child = p.node()->inner()[offset_hint]; 639| 8.42k| auto is_full = offset_hint + 1 != count_hint; 640| 8.42k| return is_full ------------------ | Branch (640:12): [True: 6.44k, False: 1.98k] ------------------ 641| 8.42k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.74k, False: 4.70k] ------------------ 642| 6.44k| : make_full_pos(child, p.shift() - B) 643| 4.70k| .visit(v, idx, args...)) 644| 8.42k| : (is_leaf ------------------ | Branch (644:19): [True: 639, False: 1.34k] ------------------ 645| 1.98k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.98k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.34k| .visit(v, idx, args...)); 648| 8.42k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 207| 7.23k| { 208| 7.23k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 7.23k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1405| 6.10k| { 1406| 6.10k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 6.10k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 1329| 6.10k| { 1330| 6.10k| return towards_oh(v, idx, offset_hint, args...); 1331| 6.10k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_mjDpOT0_: 1336| 6.10k| { 1337| 6.10k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 6.10k, False: 0] ------------------ 1338| 6.10k| auto is_leaf = shift_ == BL; 1339| 6.10k| auto child = node_->inner()[offset_hint]; 1340| 6.10k| return is_leaf ------------------ | Branch (1340:16): [True: 4.98k, False: 1.12k] ------------------ 1341| 6.10k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 6.10k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 6.10k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 112| 1.19k| { 113| 1.19k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.19k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 336| 1.92k| { 337| 1.92k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.92k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 316| 1.92k| { 317| 1.92k| return towards_oh_ch_regular( 318| 1.92k| *this, v, idx, offset_hint, count(), args...); 319| 1.92k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_15get_mut_visitorISD_EEJRNSB_5applyIS8_E4type4editERPPSD_EEEDcOT_T0_mjjDpOT1_: 632| 1.92k|{ 633| 1.92k| constexpr auto B = bits; 634| 1.92k| constexpr auto BL = bits_leaf; 635| 1.92k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 1.92k, False: 0] ------------------ 636| 1.92k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 1.92k, False: 0] ------------------ 637| 1.92k| auto is_leaf = p.shift() == BL; 638| 1.92k| auto child = p.node()->inner()[offset_hint]; 639| 1.92k| auto is_full = offset_hint + 1 != count_hint; 640| 1.92k| return is_full ------------------ | Branch (640:12): [True: 789, False: 1.13k] ------------------ 641| 1.92k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 503, False: 286] ------------------ 642| 789| : make_full_pos(child, p.shift() - B) 643| 286| .visit(v, idx, args...)) 644| 1.92k| : (is_leaf ------------------ | Branch (644:19): [True: 560, False: 575] ------------------ 645| 1.13k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.13k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 575| .visit(v, idx, args...)); 648| 1.92k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_DpOT0_: 1036| 4.42k| { 1037| 4.42k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.42k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 67.4k|{ 1839| 67.4k| assert(node); ------------------ | Branch (1839:5): [True: 67.4k, False: 0] ------------------ 1840| 67.4k| auto relaxed = node->relaxed(); 1841| 67.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 55.1k, False: 12.2k] ------------------ 1842| 55.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 55.1k, False: 0] ------------------ 1843| 55.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 55.1k| .visit(v, std::forward(args)...); 1845| 55.1k| } else { 1846| 12.2k| return make_regular_sub_pos(node, shift, size) 1847| 12.2k| .visit(v, std::forward(args)...); 1848| 12.2k| } 1849| 67.4k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 55.1k| { 1814| 55.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 55.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 32.7k| { 1687| 32.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 32.7k, False: 0] ------------------ 1688| 32.7k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 32.7k] ------------------ 1689| 32.7k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 32.7k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 32.7k| { 1699| 32.7k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 32.7k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 32.7k| { 1718| 32.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 32.7k, False: 0] ------------------ 1719| 32.7k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 32.7k] | Branch (1719:9): [True: 32.7k, False: 0] ------------------ 1720| 32.7k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 32.7k| auto child = node_->inner()[offset_hint]; 1722| 32.7k| auto is_leaf = shift_ == BL; 1723| 32.7k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 32.7k| auto next_idx = idx - left_size_hint; 1725| 32.7k| return is_leaf ------------------ | Branch (1725:16): [True: 1.14k, False: 31.5k] ------------------ 1726| 32.7k| ? make_leaf_sub_pos(child, next_size) 1727| 1.14k| .visit(v, next_idx, args...) 1728| 32.7k| : visit_maybe_relaxed_sub( 1729| 31.5k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 32.7k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 1.14k| { 145| 1.14k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.14k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 19.6k| { 1687| 19.6k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 19.6k, False: 0] ------------------ 1688| 19.6k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 19.6k] ------------------ 1689| 19.6k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 19.6k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 19.6k| { 1699| 19.6k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 19.6k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 19.6k| { 1718| 19.6k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 19.6k, False: 0] ------------------ 1719| 19.6k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 19.6k] | Branch (1719:9): [True: 19.6k, False: 0] ------------------ 1720| 19.6k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 19.6k| auto child = node_->inner()[offset_hint]; 1722| 19.6k| auto is_leaf = shift_ == BL; 1723| 19.6k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 19.6k| auto next_idx = idx - left_size_hint; 1725| 19.6k| return is_leaf ------------------ | Branch (1725:16): [True: 960, False: 18.6k] ------------------ 1726| 19.6k| ? make_leaf_sub_pos(child, next_size) 1727| 960| .visit(v, next_idx, args...) 1728| 19.6k| : visit_maybe_relaxed_sub( 1729| 18.6k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 19.6k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 960| { 145| 960| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 960| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 18.6k|{ 1839| 18.6k| assert(node); ------------------ | Branch (1839:5): [True: 18.6k, False: 0] ------------------ 1840| 18.6k| auto relaxed = node->relaxed(); 1841| 18.6k| if (relaxed) { ------------------ | Branch (1841:9): [True: 17.1k, False: 1.50k] ------------------ 1842| 17.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 17.1k, False: 0] ------------------ 1843| 17.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 17.1k| .visit(v, std::forward(args)...); 1845| 17.1k| } else { 1846| 1.50k| return make_regular_sub_pos(node, shift, size) 1847| 1.50k| .visit(v, std::forward(args)...); 1848| 1.50k| } 1849| 18.6k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 17.1k| { 1814| 17.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 17.1k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 1.50k| { 1037| 1.50k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.50k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 927| 2.48k| { 928| 2.48k| return towards_oh_ch_regular( 929| 2.48k| *this, v, idx, offset_hint, count(), args...); 930| 2.48k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_23slice_right_mut_visitorISD_Lb1ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 2.48k|{ 633| 2.48k| constexpr auto B = bits; 634| 2.48k| constexpr auto BL = bits_leaf; 635| 2.48k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.48k, False: 0] ------------------ 636| 2.48k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.48k, False: 0] ------------------ 637| 2.48k| auto is_leaf = p.shift() == BL; 638| 2.48k| auto child = p.node()->inner()[offset_hint]; 639| 2.48k| auto is_full = offset_hint + 1 != count_hint; 640| 2.48k| return is_full ------------------ | Branch (640:12): [True: 2.00k, False: 480] ------------------ 641| 2.48k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 718, False: 1.29k] ------------------ 642| 2.00k| : make_full_pos(child, p.shift() - B) 643| 1.29k| .visit(v, idx, args...)) 644| 2.48k| : (is_leaf ------------------ | Branch (644:19): [True: 480, False: 0] ------------------ 645| 480| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 480| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 2.48k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 1.47k| { 208| 1.47k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.47k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 1.80k| { 1406| 1.80k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.80k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 1.27k| { 1337| 1.27k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.27k, False: 0] ------------------ 1338| 1.27k| auto is_leaf = shift_ == BL; 1339| 1.27k| auto child = node_->inner()[offset_hint]; 1340| 1.27k| return is_leaf ------------------ | Branch (1340:16): [True: 758, False: 512] ------------------ 1341| 1.27k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.27k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.27k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 3.57k| { 1337| 3.57k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 3.57k, False: 0] ------------------ 1338| 3.57k| auto is_leaf = shift_ == BL; 1339| 3.57k| auto child = node_->inner()[offset_hint]; 1340| 3.57k| return is_leaf ------------------ | Branch (1340:16): [True: 2.17k, False: 1.39k] ------------------ 1341| 3.57k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 3.57k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 3.57k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 6.11k| { 208| 6.11k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 6.11k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 4.81k| { 1406| 4.81k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 4.81k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1405| 3.31k| { 1406| 3.31k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.31k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 8.13k| { 1337| 8.13k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 8.13k, False: 0] ------------------ 1338| 8.13k| auto is_leaf = shift_ == BL; 1339| 8.13k| auto child = node_->inner()[offset_hint]; 1340| 8.13k| return is_leaf ------------------ | Branch (1340:16): [True: 6.54k, False: 1.59k] ------------------ 1341| 8.13k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 8.13k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 8.13k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 9.77k| { 208| 9.77k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 9.77k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 3.41k| { 1406| 3.41k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.41k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1310| 4.44k| { 1311| 4.44k| each_i(v, start, branches, args...); 1312| 4.44k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE6each_iINS1_11dec_visitorEJEEEvT_jjDpOT0_: 1263| 6.59k| { 1264| 6.59k| auto p = node_->inner() + i; 1265| 6.59k| auto e = node_->inner() + n; 1266| 6.59k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 3.77k, False: 2.81k] ------------------ 1267| 11.1k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 7.33k, False: 3.77k] ------------------ 1268| 7.33k| IMMER_PREFETCH(p + 1); 1269| 7.33k| make_full_leaf_pos(*p).visit(v, args...); 1270| 7.33k| } 1271| 3.77k| } else { 1272| 2.81k| auto ss = shift_ - B; 1273| 8.78k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 5.97k, False: 2.81k] ------------------ 1274| 5.97k| make_full_pos(*p, ss).visit(v, args...); 1275| 2.81k| } 1276| 6.59k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 112| 480| { 113| 480| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 480| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 305| 5.38k| { 306| 5.38k| return towards_oh_ch_regular( 307| 5.38k| *this, v, idx, offset_hint, count(), args...); 308| 5.38k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 5.38k|{ 633| 5.38k| constexpr auto B = bits; 634| 5.38k| constexpr auto BL = bits_leaf; 635| 5.38k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.38k, False: 0] ------------------ 636| 5.38k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.38k, False: 0] ------------------ 637| 5.38k| auto is_leaf = p.shift() == BL; 638| 5.38k| auto child = p.node()->inner()[offset_hint]; 639| 5.38k| auto is_full = offset_hint + 1 != count_hint; 640| 5.38k| return is_full ------------------ | Branch (640:12): [True: 2.77k, False: 2.61k] ------------------ 641| 5.38k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.67k, False: 1.09k] ------------------ 642| 2.77k| : make_full_pos(child, p.shift() - B) 643| 1.09k| .visit(v, idx, args...)) 644| 5.38k| : (is_leaf ------------------ | Branch (644:19): [True: 1.15k, False: 1.46k] ------------------ 645| 2.61k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.61k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.46k| .visit(v, idx, args...)); 648| 5.38k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 112| 2.23k| { 113| 2.23k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.23k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 336| 6.00k| { 337| 6.00k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 6.00k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 336| 3.71k| { 337| 3.71k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.71k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 305| 3.70k| { 306| 3.70k| return towards_oh_ch_regular( 307| 3.70k| *this, v, idx, offset_hint, count(), args...); 308| 3.70k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 3.70k|{ 633| 3.70k| constexpr auto B = bits; 634| 3.70k| constexpr auto BL = bits_leaf; 635| 3.70k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.70k, False: 0] ------------------ 636| 3.70k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.70k, False: 0] ------------------ 637| 3.70k| auto is_leaf = p.shift() == BL; 638| 3.70k| auto child = p.node()->inner()[offset_hint]; 639| 3.70k| auto is_full = offset_hint + 1 != count_hint; 640| 3.70k| return is_full ------------------ | Branch (640:12): [True: 982, False: 2.72k] ------------------ 641| 3.70k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 674, False: 308] ------------------ 642| 982| : make_full_pos(child, p.shift() - B) 643| 308| .visit(v, idx, args...)) 644| 3.70k| : (is_leaf ------------------ | Branch (644:19): [True: 1.73k, False: 994] ------------------ 645| 2.72k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.72k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 994| .visit(v, idx, args...)); 648| 3.70k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 112| 2.39k| { 113| 2.39k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.39k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 336| 3.08k| { 337| 3.08k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.08k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 285| 5.38k| { 286| 5.38k| return each_right_regular(*this, v, start, args...); 287| 5.38k| } _ZN5immer6detail4rbts18each_right_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_11dec_visitorEJEEEvOT_T0_jDpOT1_: 597| 5.38k|{ 598| 5.38k| constexpr auto B = bits; 599| 5.38k| constexpr auto BL = bits_leaf; 600| | 601| 5.38k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 2.83k, False: 2.55k] ------------------ 602| 2.83k| auto n = p.node()->inner() + start; 603| 2.83k| auto last = p.count() - 1; 604| 2.83k| auto e = p.node()->inner() + last; 605| 2.83k| if (n <= e) { ------------------ | Branch (605:13): [True: 1.67k, False: 1.15k] ------------------ 606| 3.01k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 1.33k, False: 1.67k] ------------------ 607| 1.33k| IMMER_PREFETCH(n + 1); 608| 1.33k| make_full_leaf_pos(*n).visit(v, args...); 609| 1.33k| } 610| 1.67k| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 1.67k| } 612| 2.83k| } else { 613| 2.55k| auto n = p.node()->inner() + start; 614| 2.55k| auto last = p.count() - 1; 615| 2.55k| auto e = p.node()->inner() + last; 616| 2.55k| auto ss = p.shift() - B; 617| 2.55k| if (n <= e) { ------------------ | Branch (617:13): [True: 1.09k, False: 1.46k] ------------------ 618| 2.17k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 1.08k, False: 1.09k] ------------------ 619| 1.08k| make_full_pos(*n, ss).visit(v, args...); 620| 1.09k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 1.09k| } 622| 2.55k| } 623| 5.38k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 927| 10.2k| { 928| 10.2k| return towards_oh_ch_regular( 929| 10.2k| *this, v, idx, offset_hint, count(), args...); 930| 10.2k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 10.2k|{ 633| 10.2k| constexpr auto B = bits; 634| 10.2k| constexpr auto BL = bits_leaf; 635| 10.2k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 10.2k, False: 0] ------------------ 636| 10.2k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 10.2k, False: 0] ------------------ 637| 10.2k| auto is_leaf = p.shift() == BL; 638| 10.2k| auto child = p.node()->inner()[offset_hint]; 639| 10.2k| auto is_full = offset_hint + 1 != count_hint; 640| 10.2k| return is_full ------------------ | Branch (640:12): [True: 4.59k, False: 5.63k] ------------------ 641| 10.2k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 2.26k, False: 2.33k] ------------------ 642| 4.59k| : make_full_pos(child, p.shift() - B) 643| 2.33k| .visit(v, idx, args...)) 644| 10.2k| : (is_leaf ------------------ | Branch (644:19): [True: 1.08k, False: 4.54k] ------------------ 645| 5.63k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 5.63k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 4.54k| .visit(v, idx, args...)); 648| 10.2k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 927| 6.81k| { 928| 6.81k| return towards_oh_ch_regular( 929| 6.81k| *this, v, idx, offset_hint, count(), args...); 930| 6.81k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 6.81k|{ 633| 6.81k| constexpr auto B = bits; 634| 6.81k| constexpr auto BL = bits_leaf; 635| 6.81k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.81k, False: 0] ------------------ 636| 6.81k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.81k, False: 0] ------------------ 637| 6.81k| auto is_leaf = p.shift() == BL; 638| 6.81k| auto child = p.node()->inner()[offset_hint]; 639| 6.81k| auto is_full = offset_hint + 1 != count_hint; 640| 6.81k| return is_full ------------------ | Branch (640:12): [True: 4.06k, False: 2.75k] ------------------ 641| 6.81k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 2.55k, False: 1.50k] ------------------ 642| 4.06k| : make_full_pos(child, p.shift() - B) 643| 1.50k| .visit(v, idx, args...)) 644| 6.81k| : (is_leaf ------------------ | Branch (644:19): [True: 659, False: 2.09k] ------------------ 645| 2.75k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.75k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.09k| .visit(v, idx, args...)); 648| 6.81k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 867| 15.3k| { 868| 15.3k| return each_right_regular(*this, v, start, args...); 869| 15.3k| } _ZN5immer6detail4rbts18each_right_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_11dec_visitorEJEEEvOT_T0_jDpOT1_: 597| 15.3k|{ 598| 15.3k| constexpr auto B = bits; 599| 15.3k| constexpr auto BL = bits_leaf; 600| | 601| 15.3k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 5.11k, False: 10.2k] ------------------ 602| 5.11k| auto n = p.node()->inner() + start; 603| 5.11k| auto last = p.count() - 1; 604| 5.11k| auto e = p.node()->inner() + last; 605| 5.11k| if (n <= e) { ------------------ | Branch (605:13): [True: 3.37k, False: 1.74k] ------------------ 606| 6.27k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 2.89k, False: 3.37k] ------------------ 607| 2.89k| IMMER_PREFETCH(n + 1); 608| 2.89k| make_full_leaf_pos(*n).visit(v, args...); 609| 2.89k| } 610| 3.37k| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 3.37k| } 612| 10.2k| } else { 613| 10.2k| auto n = p.node()->inner() + start; 614| 10.2k| auto last = p.count() - 1; 615| 10.2k| auto e = p.node()->inner() + last; 616| 10.2k| auto ss = p.shift() - B; 617| 10.2k| if (n <= e) { ------------------ | Branch (617:13): [True: 5.72k, False: 4.54k] ------------------ 618| 9.11k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 3.38k, False: 5.72k] ------------------ 619| 3.38k| make_full_pos(*n, ss).visit(v, args...); 620| 5.72k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 5.72k| } 622| 10.2k| } 623| 15.3k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1813| 42.1k| { 1814| 42.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 42.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 23.3k| { 1687| 23.3k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 23.3k, False: 0] ------------------ 1688| 23.3k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 18.5k, False: 4.73k] ------------------ 1689| 23.3k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 23.3k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 23.3k| { 1699| 23.3k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 23.3k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 23.3k| { 1718| 23.3k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 23.3k, False: 0] ------------------ 1719| 23.3k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 18.5k, False: 4.73k] | Branch (1719:9): [True: 23.3k, False: 0] ------------------ 1720| 23.3k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 23.3k| auto child = node_->inner()[offset_hint]; 1722| 23.3k| auto is_leaf = shift_ == BL; 1723| 23.3k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 23.3k| auto next_idx = idx - left_size_hint; 1725| 23.3k| return is_leaf ------------------ | Branch (1725:16): [True: 4.01k, False: 19.3k] ------------------ 1726| 23.3k| ? make_leaf_sub_pos(child, next_size) 1727| 4.01k| .visit(v, next_idx, args...) 1728| 23.3k| : visit_maybe_relaxed_sub( 1729| 19.3k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 23.3k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 4.01k| { 145| 4.01k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.01k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 19.3k|{ 1839| 19.3k| assert(node); ------------------ | Branch (1839:5): [True: 19.3k, False: 0] ------------------ 1840| 19.3k| auto relaxed = node->relaxed(); 1841| 19.3k| if (relaxed) { ------------------ | Branch (1841:9): [True: 11.5k, False: 7.78k] ------------------ 1842| 11.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 11.5k, False: 0] ------------------ 1843| 11.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 11.5k| .visit(v, std::forward(args)...); 1845| 11.5k| } else { 1846| 7.78k| return make_regular_sub_pos(node, shift, size) 1847| 7.78k| .visit(v, std::forward(args)...); 1848| 7.78k| } 1849| 19.3k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 11.5k| { 1814| 11.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 11.5k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 7.78k| { 1037| 7.78k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 7.78k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1036| 10.8k| { 1037| 10.8k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 10.8k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 14.5k| { 1687| 14.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 14.5k, False: 0] ------------------ 1688| 14.5k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 8.41k, False: 6.09k] ------------------ 1689| 14.5k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 14.5k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 14.5k| { 1699| 14.5k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 14.5k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 14.5k| { 1718| 14.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 14.5k, False: 0] ------------------ 1719| 14.5k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 8.41k, False: 6.09k] | Branch (1719:9): [True: 14.5k, False: 0] ------------------ 1720| 14.5k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 14.5k| auto child = node_->inner()[offset_hint]; 1722| 14.5k| auto is_leaf = shift_ == BL; 1723| 14.5k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 14.5k| auto next_idx = idx - left_size_hint; 1725| 14.5k| return is_leaf ------------------ | Branch (1725:16): [True: 5.04k, False: 9.47k] ------------------ 1726| 14.5k| ? make_leaf_sub_pos(child, next_size) 1727| 5.04k| .visit(v, next_idx, args...) 1728| 14.5k| : visit_maybe_relaxed_sub( 1729| 9.47k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 14.5k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 5.04k| { 145| 5.04k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.04k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 9.47k|{ 1839| 9.47k| assert(node); ------------------ | Branch (1839:5): [True: 9.47k, False: 0] ------------------ 1840| 9.47k| auto relaxed = node->relaxed(); 1841| 9.47k| if (relaxed) { ------------------ | Branch (1841:9): [True: 6.33k, False: 3.13k] ------------------ 1842| 6.33k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 6.33k, False: 0] ------------------ 1843| 6.33k| return make_relaxed_pos(node, shift, relaxed) 1844| 6.33k| .visit(v, std::forward(args)...); 1845| 6.33k| } else { 1846| 3.13k| return make_regular_sub_pos(node, shift, size) 1847| 3.13k| .visit(v, std::forward(args)...); 1848| 3.13k| } 1849| 9.47k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 6.33k| { 1814| 6.33k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 6.33k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 3.13k| { 1037| 3.13k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.13k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1653| 56.0k| { 1654| 56.0k| assert(start > 0); ------------------ | Branch (1654:9): [True: 56.0k, False: 0] ------------------ 1655| 56.0k| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 56.0k, False: 0] ------------------ 1656| 56.0k| auto s = relaxed_->d.sizes[start - 1]; 1657| 56.0k| auto p = node_->inner(); 1658| 56.0k| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 5.16k, False: 50.9k] ------------------ 1659| 12.9k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 7.77k, False: 5.16k] ------------------ 1660| 7.77k| IMMER_PREFETCH(p + i + 1); 1661| 7.77k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 7.77k| .visit(v, args...); 1663| 7.77k| s = relaxed_->d.sizes[i]; 1664| 7.77k| assert(s); ------------------ | Branch (1664:17): [True: 7.77k, False: 0] ------------------ 1665| 7.77k| } 1666| 50.9k| } else { 1667| 50.9k| auto ss = shift_ - B; 1668| 155k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 105k, False: 50.9k] ------------------ 1669| 105k| visit_maybe_relaxed_sub( 1670| 105k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 105k| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 105k, False: 0] ------------------ 1673| 105k| } 1674| 50.9k| } 1675| 56.0k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 12.2k| { 1037| 12.2k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 12.2k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 927| 5.16k| { 928| 5.16k| return towards_oh_ch_regular( 929| 5.16k| *this, v, idx, offset_hint, count(), args...); 930| 5.16k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_23slice_right_mut_visitorISD_Lb1ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 5.16k|{ 633| 5.16k| constexpr auto B = bits; 634| 5.16k| constexpr auto BL = bits_leaf; 635| 5.16k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.16k, False: 0] ------------------ 636| 5.16k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.16k, False: 0] ------------------ 637| 5.16k| auto is_leaf = p.shift() == BL; 638| 5.16k| auto child = p.node()->inner()[offset_hint]; 639| 5.16k| auto is_full = offset_hint + 1 != count_hint; 640| 5.16k| return is_full ------------------ | Branch (640:12): [True: 4.50k, False: 658] ------------------ 641| 5.16k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.10k, False: 3.39k] ------------------ 642| 4.50k| : make_full_pos(child, p.shift() - B) 643| 3.39k| .visit(v, idx, args...)) 644| 5.16k| : (is_leaf ------------------ | Branch (644:19): [True: 658, False: 0] ------------------ 645| 658| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 658| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 5.16k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 1.55k| { 208| 1.55k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.55k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 3.82k| { 1406| 3.82k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.82k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 874| { 1337| 874| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 874, False: 0] ------------------ 1338| 874| auto is_leaf = shift_ == BL; 1339| 874| auto child = node_->inner()[offset_hint]; 1340| 874| return is_leaf ------------------ | Branch (1340:16): [True: 448, False: 426] ------------------ 1341| 874| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 874| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 874| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 112| 658| { 113| 658| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 658| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 695| { 145| 695| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 695| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 44.3k|{ 1839| 44.3k| assert(node); ------------------ | Branch (1839:5): [True: 44.3k, False: 0] ------------------ 1840| 44.3k| auto relaxed = node->relaxed(); 1841| 44.3k| if (relaxed) { ------------------ | Branch (1841:9): [True: 36.4k, False: 7.84k] ------------------ 1842| 36.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 36.4k, False: 0] ------------------ 1843| 36.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 36.4k| .visit(v, std::forward(args)...); 1845| 36.4k| } else { 1846| 7.84k| return make_regular_sub_pos(node, shift, size) 1847| 7.84k| .visit(v, std::forward(args)...); 1848| 7.84k| } 1849| 44.3k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 36.4k| { 1814| 36.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 36.4k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1705| 5.30k| { 1706| 5.30k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 5.30k, False: 0] ------------------ 1707| 5.30k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 4.58k, False: 720] ------------------ 1708| 5.30k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 5.30k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 5.30k| { 1718| 5.30k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 5.30k, False: 0] ------------------ 1719| 5.30k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 4.58k, False: 720] | Branch (1719:9): [True: 5.30k, False: 0] ------------------ 1720| 5.30k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 5.30k| auto child = node_->inner()[offset_hint]; 1722| 5.30k| auto is_leaf = shift_ == BL; 1723| 5.30k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 5.30k| auto next_idx = idx - left_size_hint; 1725| 5.30k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 5.30k] ------------------ 1726| 5.30k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 5.30k| : visit_maybe_relaxed_sub( 1729| 5.30k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 5.30k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1705| 4.45k| { 1706| 4.45k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 4.45k, False: 0] ------------------ 1707| 4.45k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 3.79k, False: 662] ------------------ 1708| 4.45k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 4.45k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 4.45k| { 1718| 4.45k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 4.45k, False: 0] ------------------ 1719| 4.45k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.79k, False: 662] | Branch (1719:9): [True: 4.45k, False: 0] ------------------ 1720| 4.45k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 4.45k| auto child = node_->inner()[offset_hint]; 1722| 4.45k| auto is_leaf = shift_ == BL; 1723| 4.45k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 4.45k| auto next_idx = idx - left_size_hint; 1725| 4.45k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 4.45k] ------------------ 1726| 4.45k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 4.45k| : visit_maybe_relaxed_sub( 1729| 4.45k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 4.45k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 4.45k|{ 1839| 4.45k| assert(node); ------------------ | Branch (1839:5): [True: 4.45k, False: 0] ------------------ 1840| 4.45k| auto relaxed = node->relaxed(); 1841| 4.45k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.72k, False: 1.72k] ------------------ 1842| 2.72k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.72k, False: 0] ------------------ 1843| 2.72k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.72k| .visit(v, std::forward(args)...); 1845| 2.72k| } else { 1846| 1.72k| return make_regular_sub_pos(node, shift, size) 1847| 1.72k| .visit(v, std::forward(args)...); 1848| 1.72k| } 1849| 4.45k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 2.72k| { 1814| 2.72k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.72k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 1.72k| { 1037| 1.72k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.72k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 946| 2.05k| { 947| 2.05k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 2.05k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_22slice_left_mut_visitorISD_Lb1ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjDpOT1_: 653| 2.05k|{ 654| 2.05k| constexpr auto B = bits; 655| 2.05k| constexpr auto BL = bits_leaf; 656| 2.05k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 2.05k, False: 0] ------------------ 657| 2.05k| auto is_leaf = p.shift() == BL; 658| 2.05k| auto child = p.node()->inner()[offset_hint]; 659| 2.05k| auto lsize = offset_hint << p.shift(); 660| 2.05k| auto size = p.this_size(); 661| 2.05k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 2.05k| return is_full ------------------ | Branch (662:12): [True: 1.11k, False: 933] ------------------ 663| 2.05k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 1.11k] ------------------ 664| 1.11k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 1.11k| : make_full_pos(child, p.shift() - B) 666| 1.11k| .visit(v, idx - lsize, args...)) 667| 2.05k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 933] ------------------ 668| 933| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 933| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 933| .visit(v, idx - lsize, args...)); 672| 2.05k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 2.78k| { 1406| 2.78k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.78k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1348| 1.66k| { 1349| 1.66k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 1.66k, False: 0] ------------------ 1350| 1.66k| auto is_leaf = shift_ == BL; 1351| 1.66k| auto child = node_->inner()[offset_hint]; 1352| 1.66k| auto lsize = size_t{offset_hint} << shift_; 1353| 1.66k| return is_leaf ------------------ | Branch (1353:16): [True: 0, False: 1.66k] ------------------ 1354| 1.66k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 1.66k| : make_full_pos(child, shift_ - B) 1356| 1.66k| .visit(v, idx - lsize, args...); 1357| 1.66k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1405| 312| { 1406| 312| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 312| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1348| 1.83k| { 1349| 1.83k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 1.83k, False: 0] ------------------ 1350| 1.83k| auto is_leaf = shift_ == BL; 1351| 1.83k| auto child = node_->inner()[offset_hint]; 1352| 1.83k| auto lsize = size_t{offset_hint} << shift_; 1353| 1.83k| return is_leaf ------------------ | Branch (1353:16): [True: 1.15k, False: 680] ------------------ 1354| 1.83k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 1.83k| : make_full_pos(child, shift_ - B) 1356| 680| .visit(v, idx - lsize, args...); 1357| 1.83k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 3.18k| { 208| 3.18k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.18k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 1.99k| { 1406| 1.99k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.99k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1348| 7.75k| { 1349| 7.75k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 7.75k, False: 0] ------------------ 1350| 7.75k| auto is_leaf = shift_ == BL; 1351| 7.75k| auto child = node_->inner()[offset_hint]; 1352| 7.75k| auto lsize = size_t{offset_hint} << shift_; 1353| 7.75k| return is_leaf ------------------ | Branch (1353:16): [True: 6.05k, False: 1.69k] ------------------ 1354| 7.75k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 7.75k| : make_full_pos(child, shift_ - B) 1356| 1.69k| .visit(v, idx - lsize, args...); 1357| 7.75k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 10.1k| { 208| 10.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 10.1k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 3.41k| { 1406| 3.41k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.41k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1316| 2.14k| { 1317| 2.14k| each_i(v, 0, last, args...); 1318| 2.14k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 933| { 1037| 933| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 933| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1036| 4.15k| { 1037| 4.15k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.15k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 946| 3.34k| { 947| 3.34k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 3.34k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_22slice_left_mut_visitorISD_Lb0ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjDpOT1_: 653| 3.34k|{ 654| 3.34k| constexpr auto B = bits; 655| 3.34k| constexpr auto BL = bits_leaf; 656| 3.34k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 3.34k, False: 0] ------------------ 657| 3.34k| auto is_leaf = p.shift() == BL; 658| 3.34k| auto child = p.node()->inner()[offset_hint]; 659| 3.34k| auto lsize = offset_hint << p.shift(); 660| 3.34k| auto size = p.this_size(); 661| 3.34k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 3.34k| return is_full ------------------ | Branch (662:12): [True: 3.34k, False: 0] ------------------ 663| 3.34k| ? (is_leaf ------------------ | Branch (663:19): [True: 2.02k, False: 1.31k] ------------------ 664| 3.34k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 3.34k| : make_full_pos(child, p.shift() - B) 666| 1.31k| .visit(v, idx - lsize, args...)) 667| 3.34k| : (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| 3.34k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 946| 5.78k| { 947| 5.78k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 5.78k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_22slice_left_mut_visitorISD_Lb0ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjDpOT1_: 653| 5.78k|{ 654| 5.78k| constexpr auto B = bits; 655| 5.78k| constexpr auto BL = bits_leaf; 656| 5.78k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 5.78k, False: 0] ------------------ 657| 5.78k| auto is_leaf = p.shift() == BL; 658| 5.78k| auto child = p.node()->inner()[offset_hint]; 659| 5.78k| auto lsize = offset_hint << p.shift(); 660| 5.78k| auto size = p.this_size(); 661| 5.78k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 5.78k| return is_full ------------------ | Branch (662:12): [True: 5.78k, False: 0] ------------------ 663| 5.78k| ? (is_leaf ------------------ | Branch (663:19): [True: 4.07k, False: 1.71k] ------------------ 664| 5.78k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 5.78k| : make_full_pos(child, p.shift() - B) 666| 1.71k| .visit(v, idx - lsize, args...)) 667| 5.78k| : (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| 5.78k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 873| 7.49k| { 874| 7.49k| return each_left_regular(*this, v, last, args...); 875| 7.49k| } _ZN5immer6detail4rbts17each_left_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_11dec_visitorEJEEEvOT_T0_jDpOT1_: 575| 7.49k|{ 576| 7.49k| constexpr auto B = bits; 577| 7.49k| constexpr auto BL = bits_leaf; 578| 7.49k| assert(last < p.count()); ------------------ | Branch (578:5): [True: 7.49k, False: 0] ------------------ 579| 7.49k| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 2.02k, False: 5.46k] ------------------ 580| 2.02k| auto n = p.node()->inner(); 581| 2.02k| auto e = n + last; 582| 4.30k| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 2.27k, False: 2.02k] ------------------ 583| 2.27k| IMMER_PREFETCH(n + 1); 584| 2.27k| make_full_leaf_pos(*n).visit(v, args...); 585| 2.27k| } 586| 5.46k| } else { 587| 5.46k| auto n = p.node()->inner(); 588| 5.46k| auto e = n + last; 589| 5.46k| auto ss = p.shift() - B; 590| 7.72k| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 2.26k, False: 5.46k] ------------------ 591| 2.26k| make_full_pos(*n, ss).visit(v, args...); 592| 5.46k| } 593| 7.49k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1813| 5.30k| { 1814| 5.30k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 5.30k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1705| 201k| { 1706| 201k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 201k, False: 0] ------------------ 1707| 201k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 8.46k, False: 193k] ------------------ 1708| 201k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 201k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 201k| { 1718| 201k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 201k, False: 0] ------------------ 1719| 201k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 8.46k, False: 193k] | Branch (1719:9): [True: 201k, False: 0] ------------------ 1720| 201k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 201k| auto child = node_->inner()[offset_hint]; 1722| 201k| auto is_leaf = shift_ == BL; 1723| 201k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 201k| auto next_idx = idx - left_size_hint; 1725| 201k| return is_leaf ------------------ | Branch (1725:16): [True: 12.5k, False: 189k] ------------------ 1726| 201k| ? make_leaf_sub_pos(child, next_size) 1727| 12.5k| .visit(v, next_idx, args...) 1728| 201k| : visit_maybe_relaxed_sub( 1729| 189k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 201k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 12.5k| { 145| 12.5k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 12.5k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 189k|{ 1839| 189k| assert(node); ------------------ | Branch (1839:5): [True: 189k, False: 0] ------------------ 1840| 189k| auto relaxed = node->relaxed(); 1841| 189k| if (relaxed) { ------------------ | Branch (1841:9): [True: 187k, False: 1.50k] ------------------ 1842| 187k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 187k, False: 0] ------------------ 1843| 187k| return make_relaxed_pos(node, shift, relaxed) 1844| 187k| .visit(v, std::forward(args)...); 1845| 187k| } else { 1846| 1.50k| return make_regular_sub_pos(node, shift, size) 1847| 1.50k| .visit(v, std::forward(args)...); 1848| 1.50k| } 1849| 189k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 187k| { 1814| 187k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 187k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 1.50k| { 1037| 1.50k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.50k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1705| 67.0k| { 1706| 67.0k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 67.0k, False: 0] ------------------ 1707| 67.0k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 22.0k, False: 44.9k] ------------------ 1708| 67.0k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 67.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 67.0k| { 1718| 67.0k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 67.0k, False: 0] ------------------ 1719| 67.0k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 22.0k, False: 44.9k] | Branch (1719:9): [True: 67.0k, False: 0] ------------------ 1720| 67.0k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 67.0k| auto child = node_->inner()[offset_hint]; 1722| 67.0k| auto is_leaf = shift_ == BL; 1723| 67.0k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 67.0k| auto next_idx = idx - left_size_hint; 1725| 67.0k| return is_leaf ------------------ | Branch (1725:16): [True: 13.1k, False: 53.8k] ------------------ 1726| 67.0k| ? make_leaf_sub_pos(child, next_size) 1727| 13.1k| .visit(v, next_idx, args...) 1728| 67.0k| : visit_maybe_relaxed_sub( 1729| 53.8k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 67.0k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 13.1k| { 145| 13.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 13.1k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 53.8k|{ 1839| 53.8k| assert(node); ------------------ | Branch (1839:5): [True: 53.8k, False: 0] ------------------ 1840| 53.8k| auto relaxed = node->relaxed(); 1841| 53.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 51.6k, False: 2.23k] ------------------ 1842| 51.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 51.6k, False: 0] ------------------ 1843| 51.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 51.6k| .visit(v, std::forward(args)...); 1845| 51.6k| } else { 1846| 2.23k| return make_regular_sub_pos(node, shift, size) 1847| 2.23k| .visit(v, std::forward(args)...); 1848| 2.23k| } 1849| 53.8k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 51.6k| { 1814| 51.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 51.6k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 2.23k| { 1037| 2.23k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.23k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 7.84k| { 1037| 7.84k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 7.84k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 946| 4.15k| { 947| 4.15k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 4.15k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_22slice_left_mut_visitorISD_Lb1ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjDpOT1_: 653| 4.15k|{ 654| 4.15k| constexpr auto B = bits; 655| 4.15k| constexpr auto BL = bits_leaf; 656| 4.15k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 4.15k, False: 0] ------------------ 657| 4.15k| auto is_leaf = p.shift() == BL; 658| 4.15k| auto child = p.node()->inner()[offset_hint]; 659| 4.15k| auto lsize = offset_hint << p.shift(); 660| 4.15k| auto size = p.this_size(); 661| 4.15k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 4.15k| return is_full ------------------ | Branch (662:12): [True: 3.05k, False: 1.09k] ------------------ 663| 4.15k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 3.05k] ------------------ 664| 3.05k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 3.05k| : make_full_pos(child, p.shift() - B) 666| 3.05k| .visit(v, idx - lsize, args...)) 667| 4.15k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 1.09k] ------------------ 668| 1.09k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 1.09k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 1.09k| .visit(v, idx - lsize, args...)); 672| 4.15k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJmRNSA_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_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1348| 312| { 1349| 312| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 312, False: 0] ------------------ 1350| 312| auto is_leaf = shift_ == BL; 1351| 312| auto child = node_->inner()[offset_hint]; 1352| 312| auto lsize = size_t{offset_hint} << shift_; 1353| 312| return is_leaf ------------------ | Branch (1353:16): [True: 0, False: 312] ------------------ 1354| 312| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 312| : make_full_pos(child, shift_ - B) 1356| 312| .visit(v, idx - lsize, args...); 1357| 312| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 1.09k| { 1037| 1.09k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.09k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitor3rrbEJNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERKPSC_RKjRmEEEDcPT_jmT0_DpOT1_: 1838| 18.4k|{ 1839| 18.4k| assert(node); ------------------ | Branch (1839:5): [True: 18.4k, False: 0] ------------------ 1840| 18.4k| auto relaxed = node->relaxed(); 1841| 18.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 11.6k, False: 6.82k] ------------------ 1842| 11.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 11.6k, False: 0] ------------------ 1843| 11.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 11.6k| .visit(v, std::forward(args)...); 1845| 11.6k| } else { 1846| 6.82k| return make_regular_sub_pos(node, shift, size) 1847| 6.82k| .visit(v, std::forward(args)...); 1848| 6.82k| } 1849| 18.4k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor3rrbEJNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERKPSC_RKjRmEEEDcT_DpOT0_: 1813| 11.6k| { 1814| 11.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 11.6k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcPT_jmT0_DpOT1_: 1838| 11.6k|{ 1839| 11.6k| assert(node); ------------------ | Branch (1839:5): [True: 11.6k, False: 0] ------------------ 1840| 11.6k| auto relaxed = node->relaxed(); 1841| 11.6k| if (relaxed) { ------------------ | Branch (1841:9): [True: 8.38k, False: 3.25k] ------------------ 1842| 8.38k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 8.38k, False: 0] ------------------ 1843| 8.38k| return make_relaxed_pos(node, shift, relaxed) 1844| 8.38k| .visit(v, std::forward(args)...); 1845| 8.38k| } else { 1846| 3.25k| return make_regular_sub_pos(node, shift, size) 1847| 3.25k| .visit(v, std::forward(args)...); 1848| 3.25k| } 1849| 11.6k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcT_DpOT0_: 1813| 8.38k| { 1814| 8.38k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 8.38k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcjT_DpOT0_: 1793| 31.1k| { 1794| 31.1k| auto child = node_->inner()[offset]; 1795| 31.1k| auto child_size = size(offset); 1796| 31.1k| auto is_leaf = shift_ == BL; 1797| 31.1k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 8.60k, False: 22.5k] ------------------ 1798| 31.1k| : visit_maybe_relaxed_sub( 1799| 22.5k| child, shift_ - B, child_size, v, args...); 1800| 31.1k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 144| 8.92k| { 145| 8.92k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 8.92k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcjT_DpOT0_: 1804| 8.92k| { 1805| 8.92k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 8.92k, False: 0] ------------------ 1806| 8.92k| auto child = node_->inner()[offset]; 1807| 8.92k| auto child_size = size(offset); 1808| 8.92k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 8.92k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 144| 9.66k| { 145| 9.66k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 9.66k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcPT_jmT0_DpOT1_: 1838| 22.5k|{ 1839| 22.5k| assert(node); ------------------ | Branch (1839:5): [True: 22.5k, False: 0] ------------------ 1840| 22.5k| auto relaxed = node->relaxed(); 1841| 22.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 19.9k, False: 2.55k] ------------------ 1842| 19.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 19.9k, False: 0] ------------------ 1843| 19.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 19.9k| .visit(v, std::forward(args)...); 1845| 19.9k| } else { 1846| 2.55k| return make_regular_sub_pos(node, shift, size) 1847| 2.55k| .visit(v, std::forward(args)...); 1848| 2.55k| } 1849| 22.5k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1813| 19.9k| { 1814| 19.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 19.9k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcjT_DpOT0_: 1793| 19.9k| { 1794| 19.9k| auto child = node_->inner()[offset]; 1795| 19.9k| auto child_size = size(offset); 1796| 19.9k| auto is_leaf = shift_ == BL; 1797| 19.9k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 19.9k] ------------------ 1798| 19.9k| : visit_maybe_relaxed_sub( 1799| 19.9k| child, shift_ - B, child_size, v, args...); 1800| 19.9k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcPT_jmT0_DpOT1_: 1838| 19.9k|{ 1839| 19.9k| assert(node); ------------------ | Branch (1839:5): [True: 19.9k, False: 0] ------------------ 1840| 19.9k| auto relaxed = node->relaxed(); 1841| 19.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 18.9k, False: 1.02k] ------------------ 1842| 18.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 18.9k, False: 0] ------------------ 1843| 18.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 18.9k| .visit(v, std::forward(args)...); 1845| 18.9k| } else { 1846| 1.02k| return make_regular_sub_pos(node, shift, size) 1847| 1.02k| .visit(v, std::forward(args)...); 1848| 1.02k| } 1849| 19.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1813| 18.9k| { 1814| 18.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 18.9k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1036| 1.42k| { 1037| 1.42k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.42k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcjT_DpOT0_: 1793| 6.93k| { 1794| 6.93k| auto child = node_->inner()[offset]; 1795| 6.93k| auto child_size = size(offset); 1796| 6.93k| auto is_leaf = shift_ == BL; 1797| 6.93k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 3.92k, False: 3.01k] ------------------ 1798| 6.93k| : visit_maybe_relaxed_sub( 1799| 3.01k| child, shift_ - B, child_size, v, args...); 1800| 6.93k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 144| 3.92k| { 145| 3.92k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 3.92k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcjT_DpOT0_: 1025| 3.92k| { 1026| 3.92k| assert(shift_ == BL); ------------------ | Branch (1026:9): [True: 3.92k, False: 0] ------------------ 1027| 3.92k| auto child = node_->inner()[idx]; 1028| 3.92k| auto lsize = size(idx); 1029| 3.92k| auto is_full = idx + 1 < count(); 1030| 3.92k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1030:16): [True: 3.18k, False: 742] ------------------ 1031| 3.92k| : make_leaf_sub_pos(child, lsize).visit(v, args...); 1032| 3.92k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 207| 6.91k| { 208| 6.91k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 6.91k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitor10this_aux_tEJRjRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcPT_jmT0_DpOT1_: 1838| 3.01k|{ 1839| 3.01k| assert(node); ------------------ | Branch (1839:5): [True: 3.01k, False: 0] ------------------ 1840| 3.01k| auto relaxed = node->relaxed(); 1841| 3.01k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.26k, False: 753] ------------------ 1842| 2.26k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.26k, False: 0] ------------------ 1843| 2.26k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.26k| .visit(v, std::forward(args)...); 1845| 2.26k| } else { 1846| 753| return make_regular_sub_pos(node, shift, size) 1847| 753| .visit(v, std::forward(args)...); 1848| 753| } 1849| 3.01k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1813| 2.26k| { 1814| 2.26k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.26k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcjT_DpOT0_: 1007| 2.26k| { 1008| 2.26k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 2.26k, False: 0] ------------------ 1009| 2.26k| auto is_leaf = shift_ == BL; 1010| 2.26k| auto child = node_->inner()[idx]; 1011| 2.26k| auto lsize = size(idx); 1012| 2.26k| auto is_full = idx + 1 < count(); 1013| 2.26k| return is_full ------------------ | Branch (1013:16): [True: 1.86k, False: 402] ------------------ 1014| 2.26k| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 1.86k] ------------------ 1015| 1.86k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.86k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 2.26k| : (is_leaf ------------------ | Branch (1017:23): [True: 0, False: 402] ------------------ 1018| 402| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 402| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 402| .visit(v, args...)); 1021| 2.26k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1405| 2.75k| { 1406| 2.75k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.75k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcjT_DpOT0_: 1793| 5.76k| { 1794| 5.76k| auto child = node_->inner()[offset]; 1795| 5.76k| auto child_size = size(offset); 1796| 5.76k| auto is_leaf = shift_ == BL; 1797| 5.76k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 3.73k, False: 2.03k] ------------------ 1798| 5.76k| : visit_maybe_relaxed_sub( 1799| 2.03k| child, shift_ - B, child_size, v, args...); 1800| 5.76k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 144| 3.73k| { 145| 3.73k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 3.73k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcjT_DpOT0_: 1396| 3.73k| { 1397| 3.73k| assert(shift_ == BL); ------------------ | Branch (1397:9): [True: 3.73k, False: 0] ------------------ 1398| 3.73k| assert(idx < count()); ------------------ | Branch (1398:9): [True: 3.73k, False: 0] ------------------ 1399| 3.73k| auto child = node_->inner()[idx]; 1400| 3.73k| return make_full_leaf_pos(child).visit(v, args...); 1401| 3.73k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcPT_jmT0_DpOT1_: 1838| 2.03k|{ 1839| 2.03k| assert(node); ------------------ | Branch (1839:5): [True: 2.03k, False: 0] ------------------ 1840| 2.03k| auto relaxed = node->relaxed(); 1841| 2.03k| if (relaxed) { ------------------ | Branch (1841:9): [True: 892, False: 1.13k] ------------------ 1842| 892| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 892, False: 0] ------------------ 1843| 892| return make_relaxed_pos(node, shift, relaxed) 1844| 892| .visit(v, std::forward(args)...); 1845| 1.13k| } else { 1846| 1.13k| return make_regular_sub_pos(node, shift, size) 1847| 1.13k| .visit(v, std::forward(args)...); 1848| 1.13k| } 1849| 2.03k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1813| 892| { 1814| 892| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 892| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcjT_DpOT0_: 1386| 892| { 1387| 892| assert(idx < count()); ------------------ | Branch (1387:9): [True: 892, False: 0] ------------------ 1388| 892| auto is_leaf = shift_ == BL; 1389| 892| auto child = node_->inner()[idx]; 1390| 892| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 892] ------------------ 1391| 892| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 892| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1036| 1.13k| { 1037| 1.13k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.13k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcjT_DpOT0_: 1386| 1.13k| { 1387| 1.13k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 1.13k, False: 0] ------------------ 1388| 1.13k| auto is_leaf = shift_ == BL; 1389| 1.13k| auto child = node_->inner()[idx]; 1390| 1.13k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 1.13k] ------------------ 1391| 1.13k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 1.13k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1405| 1.89k| { 1406| 1.89k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.89k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13each_pred_zipINS1_14equals_visitorEJEEEbT_PSC_DpOT0_: 1222| 3.74k| { 1223| 3.74k| auto p = node_->inner(); 1224| 3.74k| auto p2 = other->inner(); 1225| 3.74k| auto e = p + branches; 1226| 3.74k| if (shift_ == BL) { ------------------ | Branch (1226:13): [True: 2.90k, False: 835] ------------------ 1227| 11.4k| for (; p != e; ++p, ++p2) { ------------------ | Branch (1227:20): [True: 9.81k, False: 1.60k] ------------------ 1228| 9.81k| IMMER_PREFETCH(p + 1); 1229| 9.81k| if (!make_full_leaf_pos(*p).visit(v, *p2, args...)) ------------------ | Branch (1229:21): [True: 1.29k, False: 8.51k] ------------------ 1230| 1.29k| return false; 1231| 9.81k| } 1232| 2.90k| } else { 1233| 835| auto ss = shift_ - B; 1234| 3.04k| for (; p != e; ++p, ++p2) ------------------ | Branch (1234:20): [True: 2.69k, False: 346] ------------------ 1235| 2.69k| if (!make_full_pos(*p, ss).visit(v, *p2, args...)) ------------------ | Branch (1235:21): [True: 489, False: 2.20k] ------------------ 1236| 489| return false; 1237| 835| } 1238| 1.95k| return true; 1239| 3.74k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 207| 14.7k| { 208| 14.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 14.7k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 1405| 8.83k| { 1406| 8.83k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 8.83k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13each_pred_zipINS1_14equals_visitorEJEEEbT_PSC_DpOT0_: 837| 5.46k| { 838| 5.46k| return each_pred_zip_regular(*this, v, other, args...); 839| 5.46k| } _ZN5immer6detail4rbts21each_pred_zip_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_14equals_visitorEJEEEbOT_T0_PNSt3__15decayISH_E4type6node_tEDpOT1_: 392| 5.46k|{ 393| 5.46k| constexpr auto B = bits; 394| 5.46k| constexpr auto BL = bits_leaf; 395| | 396| 5.46k| auto n = p.node()->inner(); 397| 5.46k| auto n2 = other->inner(); 398| 5.46k| auto last = p.count() - 1; 399| 5.46k| auto e = n + last; 400| 5.46k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 1.72k, False: 3.73k] ------------------ 401| 4.51k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 3.15k, False: 1.35k] ------------------ 402| 3.15k| IMMER_PREFETCH(n + 1); 403| 3.15k| IMMER_PREFETCH(n2 + 1); 404| 3.15k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 370, False: 2.78k] ------------------ 405| 370| return false; 406| 3.15k| } 407| 1.35k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 3.73k| } else { 409| 3.73k| auto ss = p.shift() - B; 410| 7.29k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 4.41k, False: 2.87k] ------------------ 411| 4.41k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 855, False: 3.56k] ------------------ 412| 855| return false; 413| 2.87k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 3.73k| } 415| 5.46k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 112| 3.23k| { 113| 3.23k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 3.23k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 336| 4.21k| { 337| 4.21k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.21k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13each_pred_zipINS1_14equals_visitorEJEEEbT_PSC_DpOT0_: 255| 3.73k| { 256| 3.73k| return each_pred_zip_regular(*this, v, other, args...); 257| 3.73k| } _ZN5immer6detail4rbts21each_pred_zip_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_14equals_visitorEJEEEbOT_T0_PNSt3__15decayISH_E4type6node_tEDpOT1_: 392| 3.73k|{ 393| 3.73k| constexpr auto B = bits; 394| 3.73k| constexpr auto BL = bits_leaf; 395| | 396| 3.73k| auto n = p.node()->inner(); 397| 3.73k| auto n2 = other->inner(); 398| 3.73k| auto last = p.count() - 1; 399| 3.73k| auto e = n + last; 400| 3.73k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 2.18k, False: 1.55k] ------------------ 401| 3.70k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 1.82k, False: 1.87k] ------------------ 402| 1.82k| IMMER_PREFETCH(n + 1); 403| 1.82k| IMMER_PREFETCH(n2 + 1); 404| 1.82k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 306, False: 1.51k] ------------------ 405| 306| return false; 406| 1.82k| } 407| 1.87k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 2.18k| } else { 409| 1.55k| auto ss = p.shift() - B; 410| 3.05k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 1.71k, False: 1.33k] ------------------ 411| 1.71k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 215, False: 1.50k] ------------------ 412| 215| return false; 413| 1.33k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 1.55k| } 415| 3.73k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_24for_each_chunk_p_visitorEJZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEDcjSK_DpOT0_: 1386| 4.61k| { 1387| 4.61k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 4.61k, False: 0] ------------------ 1388| 4.61k| auto is_leaf = shift_ == BL; 1389| 4.61k| auto child = node_->inner()[idx]; 1390| 4.61k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 3.17k, False: 1.44k] ------------------ 1391| 4.61k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 4.61k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 207| 359k| { 208| 359k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 359k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_18region_for_visitorIiEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 10.1M|{ 1839| 10.1M| assert(node); ------------------ | Branch (1839:5): [True: 10.1M, False: 0] ------------------ 1840| 10.1M| auto relaxed = node->relaxed(); 1841| 10.1M| if (relaxed) { ------------------ | Branch (1841:9): [True: 9.81M, False: 386k] ------------------ 1842| 9.81M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 9.81M, False: 0] ------------------ 1843| 9.81M| return make_relaxed_pos(node, shift, relaxed) 1844| 9.81M| .visit(v, std::forward(args)...); 1845| 9.81M| } else { 1846| 386k| return make_regular_sub_pos(node, shift, size) 1847| 386k| .visit(v, std::forward(args)...); 1848| 386k| } 1849| 10.1M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1813| 9.81M| { 1814| 9.81M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 9.81M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1679| 9.81M| { 1680| 9.81M| return towards_oh(v, idx, subindex(idx), args...); 1681| 9.81M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_18region_for_visitorIiEEJEEEDcT_mjDpOT0_: 1686| 9.81M| { 1687| 9.81M| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 9.81M, False: 0] ------------------ 1688| 9.81M| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 5.37M, False: 4.43M] ------------------ 1689| 9.81M| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 9.81M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_18region_for_visitorIiEEJEEEDcT_mjmDpOT0_: 1698| 9.81M| { 1699| 9.81M| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 9.81M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_18region_for_visitorIiEEJEEEDcT_mjmDpOT0_: 1717| 9.81M| { 1718| 9.81M| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 9.81M, False: 0] ------------------ 1719| 9.81M| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 5.37M, False: 4.43M] | Branch (1719:9): [True: 9.81M, False: 0] ------------------ 1720| 9.81M| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 9.81M| auto child = node_->inner()[offset_hint]; 1722| 9.81M| auto is_leaf = shift_ == BL; 1723| 9.81M| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 9.81M| auto next_idx = idx - left_size_hint; 1725| 9.81M| return is_leaf ------------------ | Branch (1725:16): [True: 1.07M, False: 8.74M] ------------------ 1726| 9.81M| ? make_leaf_sub_pos(child, next_size) 1727| 1.07M| .visit(v, next_idx, args...) 1728| 9.81M| : visit_maybe_relaxed_sub( 1729| 8.74M| child, shift_ - B, next_size, v, next_idx, args...); 1730| 9.81M| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 144| 1.07M| { 145| 1.07M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.07M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1036| 386k| { 1037| 386k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 386k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 919| 386k| { 920| 386k| return towards_oh_ch_regular( 921| 386k| *this, v, idx, index(idx), count(), args...); 922| 386k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_18region_for_visitorIiEEJEEEDcOT_T0_mjjDpOT1_: 632| 386k|{ 633| 386k| constexpr auto B = bits; 634| 386k| constexpr auto BL = bits_leaf; 635| 386k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 386k, False: 0] ------------------ 636| 386k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 386k, False: 0] ------------------ 637| 386k| auto is_leaf = p.shift() == BL; 638| 386k| auto child = p.node()->inner()[offset_hint]; 639| 386k| auto is_full = offset_hint + 1 != count_hint; 640| 386k| return is_full ------------------ | Branch (640:12): [True: 283k, False: 102k] ------------------ 641| 386k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 46.1k, False: 237k] ------------------ 642| 283k| : make_full_pos(child, p.shift() - B) 643| 237k| .visit(v, idx, args...)) 644| 386k| : (is_leaf ------------------ | Branch (644:19): [True: 17.4k, False: 84.9k] ------------------ 645| 102k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 102k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 84.9k| .visit(v, idx, args...)); 648| 386k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 207| 362k| { 208| 362k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 362k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1405| 1.05M| { 1406| 1.05M| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.05M| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1322| 1.05M| { 1323| 1.05M| return towards_oh(v, idx, index(idx), args...); 1324| 1.05M| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_18region_for_visitorIiEEJEEEDcT_mjDpOT0_: 1336| 1.05M| { 1337| 1.05M| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.05M, False: 0] ------------------ 1338| 1.05M| auto is_leaf = shift_ == BL; 1339| 1.05M| auto child = node_->inner()[offset_hint]; 1340| 1.05M| return is_leaf ------------------ | Branch (1340:16): [True: 306k, False: 748k] ------------------ 1341| 1.05M| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.05M| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.05M| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 112| 23.5k| { 113| 23.5k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 23.5k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 336| 112k| { 337| 112k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 112k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 297| 112k| { 298| 112k| return towards_oh_ch_regular( 299| 112k| *this, v, idx, index(idx), count(), args...); 300| 112k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_18region_for_visitorIiEEJEEEDcOT_T0_mjjDpOT1_: 632| 112k|{ 633| 112k| constexpr auto B = bits; 634| 112k| constexpr auto BL = bits_leaf; 635| 112k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 112k, False: 0] ------------------ 636| 112k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 112k, False: 0] ------------------ 637| 112k| auto is_leaf = p.shift() == BL; 638| 112k| auto child = p.node()->inner()[offset_hint]; 639| 112k| auto is_full = offset_hint + 1 != count_hint; 640| 112k| return is_full ------------------ | Branch (640:12): [True: 78.8k, False: 33.5k] ------------------ 641| 112k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 10.1k, False: 68.7k] ------------------ 642| 78.8k| : make_full_pos(child, p.shift() - B) 643| 68.7k| .visit(v, idx, args...)) 644| 112k| : (is_leaf ------------------ | Branch (644:19): [True: 6.11k, False: 27.4k] ------------------ 645| 33.5k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 33.5k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 27.4k| .visit(v, idx, args...)); 648| 112k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 1405| 97.6k| { 1406| 97.6k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 97.6k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 1202| 97.6k| { 1203| 97.6k| auto p = node_->inner(); 1204| 97.6k| auto e = p + branches; 1205| 97.6k| if (shift_ == BL) { ------------------ | Branch (1205:13): [True: 76.6k, False: 20.9k] ------------------ 1206| 381k| for (; p != e; ++p) { ------------------ | Branch (1206:20): [True: 305k, False: 75.8k] ------------------ 1207| 305k| IMMER_PREFETCH(p + 1); 1208| 305k| if (!make_full_leaf_pos(*p).visit(v, args...)) ------------------ | Branch (1208:21): [True: 852, False: 304k] ------------------ 1209| 852| return false; 1210| 305k| } 1211| 76.6k| } else { 1212| 20.9k| auto ss = shift_ - B; 1213| 103k| for (; p != e; ++p) ------------------ | Branch (1213:20): [True: 82.9k, False: 20.5k] ------------------ 1214| 82.9k| if (!make_full_pos(*p, ss).visit(v, args...)) ------------------ | Branch (1214:21): [True: 473, False: 82.4k] ------------------ 1215| 473| return false; 1216| 20.9k| } 1217| 96.3k| return true; 1218| 97.6k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1036| 753| { 1037| 753| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 753| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcjT_DpOT0_: 1007| 753| { 1008| 753| assert(idx < count()); ------------------ | Branch (1008:9): [True: 753, False: 0] ------------------ 1009| 753| auto is_leaf = shift_ == BL; 1010| 753| auto child = node_->inner()[idx]; 1011| 753| auto lsize = size(idx); 1012| 753| auto is_full = idx + 1 < count(); 1013| 753| return is_full ------------------ | Branch (1013:16): [True: 753, False: 0] ------------------ 1014| 753| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 753] ------------------ 1015| 753| ? make_full_leaf_pos(child).visit(v, args...) 1016| 753| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 753| : (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| 753| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1036| 1.76k| { 1037| 1.76k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.76k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_24for_each_chunk_p_visitorEJZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEDcjSK_DpOT0_: 1007| 4.16k| { 1008| 4.16k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 4.16k, False: 0] ------------------ 1009| 4.16k| auto is_leaf = shift_ == BL; 1010| 4.16k| auto child = node_->inner()[idx]; 1011| 4.16k| auto lsize = size(idx); 1012| 4.16k| auto is_full = idx + 1 < count(); 1013| 4.16k| return is_full ------------------ | Branch (1013:16): [True: 1.47k, False: 2.69k] ------------------ 1014| 4.16k| ? (is_leaf ------------------ | Branch (1014:23): [True: 857, False: 616] ------------------ 1015| 1.47k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.47k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 4.16k| : (is_leaf ------------------ | Branch (1017:23): [True: 1.40k, False: 1.29k] ------------------ 1018| 2.69k| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 2.69k| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 1.29k| .visit(v, args...)); 1021| 4.16k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 144| 1.05M| { 145| 1.05M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.05M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 1036| 20.1k| { 1037| 20.1k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 20.1k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 831| 20.1k| { 832| 20.1k| return each_pred_regular(*this, v, args...); 833| 20.1k| } _ZN5immer6detail4rbts17each_pred_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSC_Lj2ELj2EEEEEDaOT_EUlSL_T0_E_EEEbSM_SN_DpOT1_: 365| 20.1k|{ 366| 20.1k| constexpr auto B = bits; 367| 20.1k| constexpr auto BL = bits_leaf; 368| 20.1k| auto n = p.node()->inner(); 369| 20.1k| auto last = p.count() - 1; 370| 20.1k| auto e = n + last; 371| 20.1k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 14.9k, False: 5.15k] ------------------ 372| 55.9k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 41.1k, False: 14.7k] ------------------ 373| 41.1k| IMMER_PREFETCH(n + 1); 374| 41.1k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 204, False: 40.9k] ------------------ 375| 204| return false; 376| 41.1k| } 377| 14.7k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 14.9k| } else { 379| 5.15k| auto ss = p.shift() - B; 380| 13.3k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 8.73k, False: 4.57k] ------------------ 381| 8.73k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 583, False: 8.15k] ------------------ 382| 583| return false; 383| 4.57k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 5.15k| } 385| 20.1k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 112| 18.8k| { 113| 18.8k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 18.8k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 336| 6.69k| { 337| 6.69k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 6.69k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 249| 6.69k| { 250| 6.69k| return each_pred_regular(*this, v, args...); 251| 6.69k| } _ZN5immer6detail4rbts17each_pred_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSC_Lj2ELj2EEEEEDaOT_EUlSL_T0_E_EEEbSM_SN_DpOT1_: 365| 6.69k|{ 366| 6.69k| constexpr auto B = bits; 367| 6.69k| constexpr auto BL = bits_leaf; 368| 6.69k| auto n = p.node()->inner(); 369| 6.69k| auto last = p.count() - 1; 370| 6.69k| auto e = n + last; 371| 6.69k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 4.32k, False: 2.36k] ------------------ 372| 12.9k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 8.87k, False: 4.09k] ------------------ 373| 8.87k| IMMER_PREFETCH(n + 1); 374| 8.87k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 234, False: 8.64k] ------------------ 375| 234| return false; 376| 8.87k| } 377| 4.09k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 4.32k| } else { 379| 2.36k| auto ss = p.shift() - B; 380| 6.02k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 3.90k, False: 2.12k] ------------------ 381| 3.90k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 241, False: 3.66k] ------------------ 382| 241| return false; 383| 2.12k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 2.36k| } 385| 6.69k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1036| 2.55k| { 1037| 2.55k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.55k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcjT_DpOT0_: 1793| 2.55k| { 1794| 2.55k| auto child = node_->inner()[offset]; 1795| 2.55k| auto child_size = size(offset); 1796| 2.55k| auto is_leaf = shift_ == BL; 1797| 2.55k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 2.55k] ------------------ 1798| 2.55k| : visit_maybe_relaxed_sub( 1799| 2.55k| child, shift_ - B, child_size, v, args...); 1800| 2.55k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcPT_jmT0_DpOT1_: 1838| 2.55k|{ 1839| 2.55k| assert(node); ------------------ | Branch (1839:5): [True: 2.55k, False: 0] ------------------ 1840| 2.55k| auto relaxed = node->relaxed(); 1841| 2.55k| if (relaxed) { ------------------ | Branch (1841:9): [True: 793, False: 1.76k] ------------------ 1842| 793| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 793, False: 0] ------------------ 1843| 793| return make_relaxed_pos(node, shift, relaxed) 1844| 793| .visit(v, std::forward(args)...); 1845| 1.76k| } else { 1846| 1.76k| return make_regular_sub_pos(node, shift, size) 1847| 1.76k| .visit(v, std::forward(args)...); 1848| 1.76k| } 1849| 2.55k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1813| 793| { 1814| 793| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 793| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcjT_DpOT0_: 1007| 4.11k| { 1008| 4.11k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 4.11k, False: 0] ------------------ 1009| 4.11k| auto is_leaf = shift_ == BL; 1010| 4.11k| auto child = node_->inner()[idx]; 1011| 4.11k| auto lsize = size(idx); 1012| 4.11k| auto is_full = idx + 1 < count(); 1013| 4.11k| return is_full ------------------ | Branch (1013:16): [True: 3.80k, False: 312] ------------------ 1014| 4.11k| ? (is_leaf ------------------ | Branch (1014:23): [True: 2.25k, False: 1.55k] ------------------ 1015| 3.80k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 3.80k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 4.11k| : (is_leaf ------------------ | Branch (1017:23): [True: 312, False: 0] ------------------ 1018| 312| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 312| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 0| .visit(v, args...)); 1021| 4.11k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 207| 4.71k| { 208| 4.71k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 4.71k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_13full_leaf_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcjT_DpOT0_: 1804| 4.71k| { 1805| 4.71k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 4.71k, False: 0] ------------------ 1806| 4.71k| auto child = node_->inner()[offset]; 1807| 4.71k| auto child_size = size(offset); 1808| 4.71k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 4.71k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRNS1_13full_leaf_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 144| 4.71k| { 145| 4.71k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.71k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1405| 2.81k| { 1406| 2.81k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.81k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcjT_DpOT0_: 1793| 2.81k| { 1794| 2.81k| auto child = node_->inner()[offset]; 1795| 2.81k| auto child_size = size(offset); 1796| 2.81k| auto is_leaf = shift_ == BL; 1797| 2.81k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 2.81k] ------------------ 1798| 2.81k| : visit_maybe_relaxed_sub( 1799| 2.81k| child, shift_ - B, child_size, v, args...); 1800| 2.81k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcPT_jmT0_DpOT1_: 1838| 2.81k|{ 1839| 2.81k| assert(node); ------------------ | Branch (1839:5): [True: 2.81k, False: 0] ------------------ 1840| 2.81k| auto relaxed = node->relaxed(); 1841| 2.81k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.64k, False: 1.16k] ------------------ 1842| 1.64k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.64k, False: 0] ------------------ 1843| 1.64k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.64k| .visit(v, std::forward(args)...); 1845| 1.64k| } else { 1846| 1.16k| return make_regular_sub_pos(node, shift, size) 1847| 1.16k| .visit(v, std::forward(args)...); 1848| 1.16k| } 1849| 2.81k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1813| 1.64k| { 1814| 1.64k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.64k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcjT_DpOT0_: 1386| 3.72k| { 1387| 3.72k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 3.72k, False: 0] ------------------ 1388| 3.72k| auto is_leaf = shift_ == BL; 1389| 3.72k| auto child = node_->inner()[idx]; 1390| 3.72k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 2.46k, False: 1.26k] ------------------ 1391| 3.72k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 3.72k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1036| 1.16k| { 1037| 1.16k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.16k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_24for_each_chunk_p_visitorEJZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEDcjSK_DpOT0_: 1793| 23.2k| { 1794| 23.2k| auto child = node_->inner()[offset]; 1795| 23.2k| auto child_size = size(offset); 1796| 23.2k| auto is_leaf = shift_ == BL; 1797| 23.2k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 7.91k, False: 15.3k] ------------------ 1798| 23.2k| : visit_maybe_relaxed_sub( 1799| 15.3k| child, shift_ - B, child_size, v, args...); 1800| 23.2k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSI_T0_E_EEEDcPSI_jmSK_DpOT1_: 1838| 635k|{ 1839| 635k| assert(node); ------------------ | Branch (1839:5): [True: 635k, False: 0] ------------------ 1840| 635k| auto relaxed = node->relaxed(); 1841| 635k| if (relaxed) { ------------------ | Branch (1841:9): [True: 616k, False: 18.8k] ------------------ 1842| 616k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 616k, False: 0] ------------------ 1843| 616k| return make_relaxed_pos(node, shift, relaxed) 1844| 616k| .visit(v, std::forward(args)...); 1845| 616k| } else { 1846| 18.8k| return make_regular_sub_pos(node, shift, size) 1847| 18.8k| .visit(v, std::forward(args)...); 1848| 18.8k| } 1849| 635k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 1813| 616k| { 1814| 616k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 616k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 1482| 616k| { 1483| 616k| auto p = node_->inner(); 1484| 616k| auto s = size_t{}; 1485| 616k| auto n = count(); 1486| 616k| if (shift_ == BL) { ------------------ | Branch (1486:13): [True: 307k, False: 309k] ------------------ 1487| 1.35M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1487:39): [True: 1.04M, False: 306k] ------------------ 1488| 1.04M| IMMER_PREFETCH(p + i + 1); 1489| 1.04M| if (!make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) ------------------ | Branch (1489:21): [True: 384, False: 1.04M] ------------------ 1490| 1.04M| .visit(v, args...)) 1491| 384| return false; 1492| 1.04M| s = relaxed_->d.sizes[i]; 1493| 1.04M| } 1494| 309k| } else { 1495| 309k| auto ss = shift_ - B; 1496| 929k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1496:39): [True: 620k, False: 309k] ------------------ 1497| 620k| if (!visit_maybe_relaxed_sub( ------------------ | Branch (1497:21): [True: 461, False: 620k] ------------------ 1498| 620k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...)) 1499| 461| return false; 1500| 620k| s = relaxed_->d.sizes[i]; 1501| 620k| } 1502| 309k| } 1503| 616k| return true; 1504| 616k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcT_DpOT0_: 1036| 3.25k| { 1037| 3.25k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.25k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE15first_sub_innerINS1_14equals_visitor3rrbEJRNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERPSC_RjRmEEEDcT_DpOT0_: 1783| 1.40k| { 1784| 1.40k| assert(shift_ > BL); ------------------ | Branch (1784:9): [True: 1.40k, False: 0] ------------------ 1785| 1.40k| auto child = node_->inner()[0]; 1786| 1.40k| auto child_size = relaxed_->d.sizes[0]; 1787| 1.40k| return visit_maybe_relaxed_sub( 1788| 1.40k| child, shift_ - B, child_size, v, args...); 1789| 1.40k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitor3rrbEJRNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERPSC_RjRmEEEDcPT_jmT0_DpOT1_: 1838| 1.40k|{ 1839| 1.40k| assert(node); ------------------ | Branch (1839:5): [True: 1.40k, False: 0] ------------------ 1840| 1.40k| auto relaxed = node->relaxed(); 1841| 1.40k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.40k, False: 0] ------------------ 1842| 1.40k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.40k, False: 0] ------------------ 1843| 1.40k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.40k| .visit(v, std::forward(args)...); 1845| 1.40k| } else { 1846| 0| return make_regular_sub_pos(node, shift, size) 1847| 0| .visit(v, std::forward(args)...); 1848| 0| } 1849| 1.40k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor3rrbEJRNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERPSC_RjRmEEEDcT_DpOT0_: 1813| 1.40k| { 1814| 1.40k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.40k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcPT_jmT0_DpOT1_: 1838| 6.82k|{ 1839| 6.82k| assert(node); ------------------ | Branch (1839:5): [True: 6.82k, False: 0] ------------------ 1840| 6.82k| auto relaxed = node->relaxed(); 1841| 6.82k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.62k, False: 5.19k] ------------------ 1842| 1.62k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.62k, False: 0] ------------------ 1843| 1.62k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.62k| .visit(v, std::forward(args)...); 1845| 5.19k| } else { 1846| 5.19k| return make_regular_sub_pos(node, shift, size) 1847| 5.19k| .visit(v, std::forward(args)...); 1848| 5.19k| } 1849| 6.82k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcT_DpOT0_: 1813| 1.62k| { 1814| 1.62k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.62k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcT_DpOT0_: 1036| 5.19k| { 1037| 5.19k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.19k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor3rrbEJNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERKPSC_RKjRmEEEDcT_DpOT0_: 1036| 6.82k| { 1037| 6.82k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.82k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRKPSC_EEEDcT_DpOT0_: 144| 6.67k| { 145| 6.67k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 6.67k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2Ev: 114| 1.62M| : size{0} 115| 1.62M| , shift{BL} 116| 1.62M| , root{empty_root()} 117| 1.62M| , tail{empty_tail()} 118| 1.62M| { 119| | assert(check_tree()); ------------------ | Branch (119:9): [True: 1.62M, False: 0] ------------------ 120| 1.62M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10empty_rootEv: 61| 1.63M| { 62| 1.63M| static const auto empty_ = [] { 63| 1.63M| constexpr auto size = node_t::sizeof_inner_n(0); 64| 1.63M| static std::aligned_storage_t 65| 1.63M| storage; 66| 1.63M| return node_t::make_inner_n_into(&storage, size, 0u); 67| 1.63M| }(); 68| 1.63M| return empty_->inc(); 69| 1.63M| } _ZZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10empty_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_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10empty_tailEv: 72| 1.62M| { 73| 1.62M| static const auto empty_ = [] { 74| 1.62M| constexpr auto size = node_t::sizeof_leaf_n(0); 75| 1.62M| static std::aligned_storage_t 76| 1.62M| storage; 77| 1.62M| return node_t::make_leaf_n_into(&storage, size, 0u); 78| 1.62M| }(); 79| 1.62M| return empty_->inc(); 80| 1.62M| } _ZZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10empty_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_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10check_treeEv: 1372| 3.21M| { 1373| 3.21M| IMMER_INVALID_STATE_ASSERT(shift <= sizeof(size_t) * 8 - BL); ------------------ | | 32| 3.21M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.21M] | | ------------------ | | 33| 3.21M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1374| 3.21M| IMMER_INVALID_STATE_ASSERT(shift >= BL); ------------------ | | 32| 3.21M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.21M] | | ------------------ | | 33| 3.21M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1375| 3.21M| IMMER_INVALID_STATE_ASSERT(tail_offset() <= size); ------------------ | | 32| 3.21M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.21M] | | ------------------ | | 33| 3.21M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1376| 3.21M| IMMER_INVALID_STATE_ASSERT(tail_size() <= branches); ------------------ | | 32| 3.21M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.21M] | | ------------------ | | 33| 3.21M| 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.21M| return true; 1382| 3.21M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11tail_offsetEv: 197| 16.0M| { 198| 16.0M| auto r = root->relaxed(); 199| 16.0M| assert(r == nullptr || r->d.count); ------------------ | Branch (199:9): [True: 7.91M, False: 8.13M] | Branch (199:9): [True: 8.13M, False: 0] | Branch (199:9): [True: 16.0M, False: 0] ------------------ 200| 16.0M| return r ? r->d.sizes[r->d.count - 1] ------------------ | Branch (200:16): [True: 8.13M, False: 7.91M] ------------------ 201| 16.0M| : size ? (size - 1) & ~mask ------------------ | Branch (201:18): [True: 3.03M, False: 4.88M] ------------------ 202| | /* otherwise */ 203| 7.91M| : 0; 204| 16.0M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9tail_sizeEv: 194| 3.70M| auto tail_size() const { return size - tail_offset(); } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EED2Ev: 184| 3.21M| ~rrbtree() { dec(); } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE3decEv: 192| 3.21M| void dec() const { traverse(dec_visitor()); } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8traverseINS1_11dec_visitorEJEEEvT_DpOT0_: 208| 3.21M| { 209| 3.21M| auto tail_off = tail_offset(); 210| 3.21M| auto tail_size = size - tail_off; 211| | 212| 3.21M| if (tail_off) ------------------ | Branch (212:13): [True: 1.50M, False: 1.71M] ------------------ 213| 1.50M| visit_maybe_relaxed_sub(root, shift, tail_off, v, args...); 214| 1.71M| else 215| 1.71M| make_empty_regular_pos(root).visit(v, args...); 216| | 217| 3.21M| if (tail_size) ------------------ | Branch (217:13): [True: 1.59M, False: 1.62M] ------------------ 218| 1.59M| make_leaf_sub_pos(tail, tail_size).visit(v, args...); 219| 1.62M| else 220| 1.62M| make_empty_leaf_pos(tail).visit(v, args...); 221| 3.21M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9push_backEi: 500| 444k| { 501| 444k| auto ts = tail_size(); 502| 444k| if (ts < branches) { ------------------ | Branch (502:13): [True: 325k, False: 119k] ------------------ 503| 325k| auto new_tail = 504| 325k| node_t::copy_leaf_emplace(tail, ts, std::move(value)); 505| 325k| return {size + 1, shift, root->inc(), new_tail}; 506| 325k| } else { 507| 119k| using std::get; 508| 119k| auto new_tail = node_t::make_leaf_n(1u, std::move(value)); 509| 119k| auto tail_off = tail_offset(); 510| 119k| IMMER_TRY { ------------------ | | 49| 119k|#define IMMER_TRY try ------------------ 511| 119k| auto new_root = 512| 119k| push_tail(root, shift, tail_off, tail, size - tail_off); 513| 119k| tail->inc(); 514| 119k| return {size + 1, get<0>(new_root), get<1>(new_root), new_tail}; 515| 119k| } 516| 119k| IMMER_CATCH (...) { 517| 0| node_t::delete_leaf(new_tail, 1u); 518| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 519| 0| } 520| 119k| } 521| 444k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2EmjPNS1_4nodeIiSA_Lj2ELj2EEESE_: 127| 1.59M| : size{sz} 128| 1.59M| , shift{sh} 129| 1.59M| , root{r} 130| 1.59M| , tail{t} 131| 1.59M| { 132| 1.59M|#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.59M| try { 137| 1.59M| check_tree(); 138| 1.59M| } 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.59M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9push_tailEPNS1_4nodeIiSA_Lj2ELj2EEEjmSE_j: 369| 565k| { 370| 565k| if (auto r = root->relaxed()) { ------------------ | Branch (370:18): [True: 230k, False: 334k] ------------------ 371| 230k| auto new_root = 372| 230k| make_relaxed_pos(root, shift, r) 373| 230k| .visit(push_tail_visitor{}, tail, tail_size); 374| 230k| if (new_root) ------------------ | Branch (374:17): [True: 228k, False: 2.02k] ------------------ 375| 228k| return std::make_tuple(shift, new_root); 376| 2.02k| else { 377| 2.02k| auto new_root = node_t::make_inner_r_n(2); 378| 2.02k| IMMER_TRY { ------------------ | | 49| 2.02k|#define IMMER_TRY try ------------------ 379| 2.02k| auto new_path = node_t::make_path(shift, tail); 380| 2.02k| new_root->inner()[0] = root->inc(); 381| 2.02k| new_root->inner()[1] = new_path; 382| 2.02k| new_root->relaxed()->d.sizes[0] = size; 383| 2.02k| new_root->relaxed()->d.sizes[1] = size + tail_size; 384| 2.02k| assert(size); ------------------ | Branch (384:21): [True: 2.02k, False: 0] ------------------ 385| 2.02k| assert(tail_size); ------------------ | Branch (385:21): [True: 2.02k, False: 0] ------------------ 386| 2.02k| new_root->relaxed()->d.count = 2u; 387| 2.02k| } 388| 2.02k| 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| 2.02k| return std::make_tuple(shift + B, new_root); 393| 2.02k| } 394| 334k| } else if (size == size_t{branches} << shift) { ------------------ | Branch (394:20): [True: 5.02k, False: 329k] ------------------ 395| 5.02k| auto new_root = node_t::make_inner_n(2); 396| 5.02k| IMMER_TRY { ------------------ | | 49| 5.02k|#define IMMER_TRY try ------------------ 397| 5.02k| auto new_path = node_t::make_path(shift, tail); 398| 5.02k| new_root->inner()[0] = root->inc(); 399| 5.02k| new_root->inner()[1] = new_path; 400| 5.02k| } 401| 5.02k| IMMER_CATCH (...) { 402| 0| node_t::delete_inner(new_root, 2); 403| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 404| 0| } 405| 5.02k| return std::make_tuple(shift + B, new_root); 406| 329k| } else if (size) { ------------------ | Branch (406:20): [True: 318k, False: 10.4k] ------------------ 407| 318k| auto new_root = make_regular_sub_pos(root, shift, size) 408| 318k| .visit(push_tail_visitor{}, tail); 409| 318k| return std::make_tuple(shift, new_root); 410| 318k| } else { 411| 10.4k| return std::make_tuple(shift, node_t::make_path(shift, tail)); 412| 10.4k| } 413| 565k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2EOSB_: 157| 1.54M| : rrbtree{} 158| 1.54M| { 159| 1.54M| swap(*this, other); 160| 1.54M| } _ZN5immer6detail4rbts4swapERNS1_7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEESC_: 176| 3.58M| { 177| 3.58M| using std::swap; 178| 3.58M| swap(x.size, y.size); 179| 3.58M| swap(x.shift, y.shift); 180| 3.58M| swap(x.root, y.root); 181| 3.58M| swap(x.tail, y.tail); 182| 3.58M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEaSEOSB_: 170| 2.04M| { 171| 2.04M| swap(*this, other); 172| 2.04M| return *this; 173| 2.04M| } flex-vector.cpp:_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6updateIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSG_E_EESB_mOSG_: 580| 109k| { 581| 109k| auto tail_off = tail_offset(); 582| 109k| if (idx >= tail_off) { ------------------ | Branch (582:13): [True: 40.5k, False: 68.6k] ------------------ 583| 40.5k| auto tail_size = size - tail_off; 584| 40.5k| auto new_tail = 585| 40.5k| make_leaf_sub_pos(tail, tail_size) 586| 40.5k| .visit(update_visitor{}, idx - tail_off, fn); 587| 40.5k| return {size, shift, root->inc(), new_tail}; 588| 68.6k| } else { 589| 68.6k| auto new_root = visit_maybe_relaxed_sub( 590| 68.6k| root, shift, tail_off, update_visitor{}, idx, fn); 591| 68.6k| return {size, shift, new_root, tail->inc()}; 592| 68.6k| } 593| 109k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4takeEm: 647| 24.5k| { 648| 24.5k| auto tail_off = tail_offset(); 649| 24.5k| if (new_size == 0) { ------------------ | Branch (649:13): [True: 3.65k, False: 20.8k] ------------------ 650| 3.65k| return {}; 651| 20.8k| } else if (new_size >= size) { ------------------ | Branch (651:20): [True: 1.20k, False: 19.6k] ------------------ 652| 1.20k| return *this; 653| 19.6k| } else if (new_size > tail_off) { ------------------ | Branch (653:20): [True: 1.94k, False: 17.7k] ------------------ 654| 1.94k| auto new_tail = node_t::copy_leaf(tail, new_size - tail_off); 655| 1.94k| return {new_size, shift, root->inc(), new_tail}; 656| 17.7k| } else { 657| 17.7k| using std::get; 658| 17.7k| auto l = new_size - 1; 659| 17.7k| auto v = slice_right_visitor(); 660| 17.7k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l); 661| 17.7k| auto new_shift = get<0>(r); 662| 17.7k| auto new_root = get<1>(r); 663| 17.7k| auto new_tail = get<3>(r); 664| 17.7k| if (new_root) { ------------------ | Branch (664:17): [True: 13.2k, False: 4.43k] ------------------ 665| 13.2k| IMMER_ASSERT_TAGGED(new_root->compute_shift() == get<0>(r)); ------------------ | | 68| 13.2k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (665:17): [True: 13.2k, False: 0] ------------------ 666| 13.2k| assert(new_root->check(new_shift, new_size - get<2>(r))); ------------------ | Branch (666:17): [True: 13.2k, False: 0] ------------------ 667| 13.2k| return {new_size, new_shift, new_root, new_tail}; 668| 13.2k| } else { 669| 4.43k| return {new_size, BL, empty_root(), new_tail}; 670| 4.43k| } 671| 17.7k| } 672| 24.5k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2ERKSB_: 151| 10.3k| : rrbtree{other.size, other.shift, other.root, other.tail} 152| 10.3k| { 153| 10.3k| inc(); 154| 10.3k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE3incEv: 187| 10.3k| { 188| 10.3k| root->inc(); 189| 10.3k| tail->inc(); 190| 10.3k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4dropEm: 711| 26.2k| { 712| 26.2k| if (elems == 0) { ------------------ | Branch (712:13): [True: 2.43k, False: 23.7k] ------------------ 713| 2.43k| return *this; 714| 23.7k| } else if (elems >= size) { ------------------ | Branch (714:20): [True: 2.14k, False: 21.6k] ------------------ 715| 2.14k| return {}; 716| 21.6k| } else if (elems == tail_offset()) { ------------------ | Branch (716:20): [True: 1.62k, False: 20.0k] ------------------ 717| 1.62k| return {size - elems, BL, empty_root(), tail->inc()}; 718| 20.0k| } else if (elems > tail_offset()) { ------------------ | Branch (718:20): [True: 2.03k, False: 17.9k] ------------------ 719| 2.03k| auto tail_off = tail_offset(); 720| 2.03k| auto new_tail = 721| 2.03k| node_t::copy_leaf(tail, elems - tail_off, size - tail_off); 722| 2.03k| return {size - elems, BL, empty_root(), new_tail}; 723| 17.9k| } else { 724| 17.9k| using std::get; 725| 17.9k| auto v = slice_left_visitor(); 726| 17.9k| auto r = 727| 17.9k| visit_maybe_relaxed_sub(root, shift, tail_offset(), v, elems); 728| 17.9k| auto new_root = get<1>(r); 729| 17.9k| auto new_shift = get<0>(r); 730| 17.9k| return {size - elems, new_shift, new_root, tail->inc()}; 731| 17.9k| } 732| 26.2k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8max_sizeEv: 54| 2.15M| { 55| 2.15M| auto S = sizeof(size_t) * 8; 56| 2.15M| return ((size_t{1} << BL) - std::min(size_t{BL}, size_t{2})) * 57| 2.15M| ipow((size_t{1} << B) - 2, (S - BL) / B); 58| 2.15M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6concatERKSB_: 735| 908k| { 736| 908k| assert(r.size + size <= max_size()); ------------------ | Branch (736:9): [True: 908k, False: 0] ------------------ 737| 908k| using std::get; 738| 908k| if (size == 0) ------------------ | Branch (738:13): [True: 2.59k, False: 906k] ------------------ 739| 2.59k| return r; 740| 906k| else if (r.size == 0) ------------------ | Branch (740:18): [True: 1.65k, False: 904k] ------------------ 741| 1.65k| return *this; 742| 904k| else if (r.tail_offset() == 0) { ------------------ | Branch (742:18): [True: 454k, False: 449k] ------------------ 743| | // just concat the tail, similar to push_back 744| 454k| auto tail_offst = tail_offset(); 745| 454k| auto tail_size = size - tail_offst; 746| 454k| if (tail_size == branches) { ------------------ | Branch (746:17): [True: 126k, False: 327k] ------------------ 747| 126k| auto new_root = 748| 126k| push_tail(root, shift, tail_offst, tail, tail_size); 749| 126k| tail->inc(); 750| 126k| return {size + r.size, 751| 126k| get<0>(new_root), 752| 126k| get<1>(new_root), 753| 126k| r.tail->inc()}; 754| 327k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (754:24): [True: 9.25k, False: 318k] ------------------ 755| 9.25k| auto new_tail = 756| 9.25k| node_t::copy_leaf(tail, tail_size, r.tail, r.size); 757| 9.25k| return {size + r.size, shift, root->inc(), new_tail}; 758| 318k| } else { 759| 318k| auto remaining = branches - tail_size; 760| 318k| auto add_tail = 761| 318k| node_t::copy_leaf(tail, tail_size, r.tail, remaining); 762| 318k| IMMER_TRY { ------------------ | | 49| 318k|#define IMMER_TRY try ------------------ 763| 318k| auto new_tail = 764| 318k| node_t::copy_leaf(r.tail, remaining, r.size); 765| 318k| IMMER_TRY { ------------------ | | 49| 318k|#define IMMER_TRY try ------------------ 766| 318k| auto new_root = push_tail( 767| 318k| root, shift, tail_offst, add_tail, branches); 768| 318k| return {size + r.size, 769| 318k| get<0>(new_root), 770| 318k| get<1>(new_root), 771| 318k| new_tail}; 772| 318k| } 773| 318k| 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| 318k| } 778| 318k| IMMER_CATCH (...) { 779| 0| node_t::delete_leaf(add_tail, branches); 780| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 781| 0| } 782| 318k| } 783| 454k| } else if (tail_offset() == 0) { ------------------ | Branch (783:20): [True: 3.43k, False: 446k] ------------------ 784| 3.43k| auto tail_offst = tail_offset(); 785| 3.43k| auto tail_size = size - tail_offst; 786| 3.43k| auto concated = 787| 3.43k| concat_trees(tail, tail_size, r.root, r.shift, r.tail_offset()); 788| 3.43k| auto new_shift = concated.shift(); 789| 3.43k| auto new_root = concated.node(); 790| 3.43k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 3.43k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (790:13): [True: 3.43k, False: 0] ------------------ 791| 3.43k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (791:13): [True: 3.43k, False: 0] ------------------ 792| 3.43k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 793| 446k| } else { 794| 446k| auto tail_offst = tail_offset(); 795| 446k| auto tail_size = size - tail_offst; 796| 446k| auto concated = concat_trees(root, 797| 446k| shift, 798| 446k| tail_offst, 799| 446k| tail, 800| 446k| tail_size, 801| 446k| r.root, 802| 446k| r.shift, 803| 446k| r.tail_offset()); 804| 446k| auto new_shift = concated.shift(); 805| 446k| auto new_root = concated.node(); 806| 446k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 446k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (806:13): [True: 446k, False: 0] ------------------ 807| 446k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (807:13): [True: 446k, False: 0] ------------------ 808| 446k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 809| 446k| } 810| 908k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13push_back_mutENS9_5applyIS6_E4type4editEi: 478| 32.5k| { 479| 32.5k| auto ts = tail_size(); 480| 32.5k| if (ts < branches) { ------------------ | Branch (480:13): [True: 19.3k, False: 13.2k] ------------------ 481| 19.3k| ensure_mutable_tail(e, ts); 482| 19.3k| new (&tail->leaf()[ts]) T(std::move(value)); 483| 19.3k| } else { 484| 13.2k| using std::get; 485| 13.2k| auto new_tail = node_t::make_leaf_e(e, std::move(value)); 486| 13.2k| auto tail_off = tail_offset(); 487| 13.2k| IMMER_TRY { ------------------ | | 49| 13.2k|#define IMMER_TRY try ------------------ 488| 13.2k| push_tail_mut(e, tail_off, tail, ts); 489| 13.2k| tail = new_tail; 490| 13.2k| } 491| 13.2k| IMMER_CATCH (...) { 492| 0| node_t::delete_leaf(new_tail, 1u); 493| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 494| 0| } 495| 13.2k| } 496| 32.5k| ++size; 497| 32.5k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE19ensure_mutable_tailENS9_5applyIS6_E4type4editEj: 469| 195k| { 470| 195k| if (!tail->can_mutate(e)) { ------------------ | Branch (470:13): [True: 4.60k, False: 191k] ------------------ 471| 4.60k| auto new_tail = node_t::copy_leaf_e(e, tail, n); 472| 4.60k| dec_leaf(tail, n); 473| 4.60k| tail = new_tail; 474| 4.60k| } 475| 195k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13push_tail_mutENS9_5applyIS6_E4type4editEmPNS1_4nodeIiSA_Lj2ELj2EEEj: 417| 215k| { 418| 215k| if (auto r = root->relaxed()) { ------------------ | Branch (418:18): [True: 44.2k, False: 170k] ------------------ 419| 44.2k| auto new_root = 420| 44.2k| make_relaxed_pos(root, shift, r) 421| 44.2k| .visit(push_tail_mut_visitor{}, e, tail, tail_size); 422| 44.2k| if (new_root) { ------------------ | Branch (422:17): [True: 43.2k, False: 1.00k] ------------------ 423| 43.2k| root = new_root; 424| 43.2k| } else { 425| 1.00k| auto new_root = node_t::make_inner_r_e(e); 426| 1.00k| IMMER_TRY { ------------------ | | 49| 1.00k|#define IMMER_TRY try ------------------ 427| 1.00k| auto new_path = node_t::make_path_e(e, shift, tail); 428| 1.00k| new_root->inner()[0] = root; 429| 1.00k| new_root->inner()[1] = new_path; 430| 1.00k| new_root->relaxed()->d.sizes[0] = tail_off; 431| 1.00k| new_root->relaxed()->d.sizes[1] = tail_off + tail_size; 432| 1.00k| assert(tail_off); ------------------ | Branch (432:21): [True: 1.00k, False: 0] ------------------ 433| 1.00k| assert(tail_size); ------------------ | Branch (433:21): [True: 1.00k, False: 0] ------------------ 434| 1.00k| new_root->relaxed()->d.count = 2u; 435| 1.00k| root = new_root; 436| 1.00k| shift += B; 437| 1.00k| } 438| 1.00k| 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| 1.00k| } 443| 170k| } else if (tail_off == size_t{branches} << shift) { ------------------ | Branch (443:20): [True: 2.59k, False: 168k] ------------------ 444| 2.59k| auto new_root = node_t::make_inner_e(e); 445| 2.59k| IMMER_TRY { ------------------ | | 49| 2.59k|#define IMMER_TRY try ------------------ 446| 2.59k| auto new_path = node_t::make_path_e(e, shift, tail); 447| 2.59k| new_root->inner()[0] = root; 448| 2.59k| new_root->inner()[1] = new_path; 449| 2.59k| root = new_root; 450| 2.59k| shift += B; 451| 2.59k| } 452| 2.59k| IMMER_CATCH (...) { 453| 0| node_t::delete_inner_e(new_root); 454| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 455| 0| } 456| 168k| } else if (tail_off) { ------------------ | Branch (456:20): [True: 166k, False: 2.12k] ------------------ 457| 166k| auto new_root = 458| 166k| make_regular_sub_pos(root, shift, tail_off) 459| 166k| .visit(push_tail_mut_visitor{}, e, tail); 460| 166k| root = new_root; 461| 166k| } else { 462| 2.12k| auto new_root = node_t::make_path_e(e, shift, tail); 463| 2.12k| dec_empty_regular(root); 464| 2.12k| root = new_root; 465| 2.12k| } 466| 215k| } flex-vector.cpp:_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10update_mutIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSG_E0_EEvNS9_5applyIS6_E4type4editEmOSG_: 573| 77.7k| { 574| 77.7k| auto& elem = get_mut(e, idx); 575| 77.7k| elem = std::forward(fn)(std::move(elem)); 576| 77.7k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7get_mutENS9_5applyIS6_E4type4editEm: 539| 77.7k| { 540| 77.7k| auto tail_off = tail_offset(); 541| 77.7k| if (idx >= tail_off) { ------------------ | Branch (541:13): [True: 33.9k, False: 43.7k] ------------------ 542| 33.9k| ensure_mutable_tail(e, size - tail_off); 543| 33.9k| return tail->leaf()[(idx - tail_off) & mask]; 544| 43.7k| } else { 545| 43.7k| return visit_maybe_relaxed_sub(root, 546| 43.7k| shift, 547| 43.7k| tail_off, 548| 43.7k| get_mut_visitor{}, 549| 43.7k| idx, 550| 43.7k| e, 551| 43.7k| &root); 552| 43.7k| } 553| 77.7k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8take_mutENS9_5applyIS6_E4type4editEm: 606| 38.4k| { 607| 38.4k| auto tail_off = tail_offset(); 608| 38.4k| if (new_size == 0) { ------------------ | Branch (608:13): [True: 619, False: 37.7k] ------------------ 609| 619| *this = {}; 610| 37.7k| } else if (new_size >= size) { ------------------ | Branch (610:20): [True: 1.13k, False: 36.6k] ------------------ 611| 1.13k| return; 612| 36.6k| } else if (new_size > tail_off) { ------------------ | Branch (612:20): [True: 802, False: 35.8k] ------------------ 613| 802| auto ts = size - tail_off; 614| 802| auto newts = new_size - tail_off; 615| 802| if (tail->can_mutate(e)) { ------------------ | Branch (615:17): [True: 483, False: 319] ------------------ 616| 483| detail::destroy_n(tail->leaf() + newts, ts - newts); 617| 483| } else { 618| 319| auto new_tail = node_t::copy_leaf_e(e, tail, newts); 619| 319| dec_leaf(tail, ts); 620| 319| tail = new_tail; 621| 319| } 622| 802| size = new_size; 623| 802| return; 624| 35.8k| } else { 625| 35.8k| using std::get; 626| 35.8k| auto l = new_size - 1; 627| 35.8k| auto v = slice_right_mut_visitor(); 628| 35.8k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l, e); 629| 35.8k| auto new_shift = get<0>(r); 630| 35.8k| auto new_root = get<1>(r); 631| 35.8k| auto new_tail = get<3>(r); 632| 35.8k| if (new_root) { ------------------ | Branch (632:17): [True: 29.5k, False: 6.27k] ------------------ 633| 29.5k| root = new_root; 634| 29.5k| shift = new_shift; 635| 29.5k| } else { 636| 6.27k| root = empty_root(); 637| 6.27k| shift = BL; 638| 6.27k| } 639| 35.8k| dec_leaf(tail, size - tail_off); 640| 35.8k| size = new_size; 641| 35.8k| tail = new_tail; 642| 35.8k| return; 643| 35.8k| } 644| 38.4k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8drop_mutENS9_5applyIS6_E4type4editEm: 675| 42.4k| { 676| 42.4k| using std::get; 677| 42.4k| auto tail_off = tail_offset(); 678| 42.4k| if (elems == 0) { ------------------ | Branch (678:13): [True: 2.13k, False: 40.2k] ------------------ 679| 2.13k| return; 680| 40.2k| } else if (elems >= size) { ------------------ | Branch (680:20): [True: 276, False: 39.9k] ------------------ 681| 276| *this = {}; 682| 39.9k| } else if (elems == tail_off) { ------------------ | Branch (682:20): [True: 274, False: 39.7k] ------------------ 683| 274| dec_inner(root, shift, tail_off); 684| 274| shift = BL; 685| 274| root = empty_root(); 686| 274| size -= elems; 687| 274| return; 688| 39.7k| } else if (elems > tail_off) { ------------------ | Branch (688:20): [True: 695, False: 39.0k] ------------------ 689| 695| auto v = slice_left_mut_visitor(); 690| 695| tail = get<1>(make_leaf_sub_pos(tail, size - tail_off) 691| 695| .visit(v, elems - tail_off, e)); 692| 695| if (tail_off) { ------------------ | Branch (692:17): [True: 252, False: 443] ------------------ 693| 252| dec_inner(root, shift, tail_off); 694| 252| shift = BL; 695| 252| root = empty_root(); 696| 252| } 697| 695| size -= elems; 698| 695| return; 699| 39.0k| } else { 700| 39.0k| auto v = slice_left_mut_visitor(); 701| 39.0k| auto r = 702| 39.0k| visit_maybe_relaxed_sub(root, shift, tail_off, v, elems, e); 703| 39.0k| shift = get<0>(r); 704| 39.0k| root = get<1>(r); 705| 39.0k| size -= elems; 706| 39.0k| return; 707| 39.0k| } 708| 42.4k| } _ZN5immer6detail4rbts12concat_mut_lERNS1_7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS9_5applyIS6_E4type4editERKSB_: 816| 271k| { 817| 271k| assert(&l != &r); ------------------ | Branch (817:9): [True: 271k, False: 0] ------------------ 818| 271k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (818:9): [True: 271k, False: 0] ------------------ 819| 271k| using std::get; 820| 271k| if (l.size == 0) ------------------ | Branch (820:13): [True: 657, False: 270k] ------------------ 821| 657| l = r; 822| 270k| else if (r.size == 0) ------------------ | Branch (822:18): [True: 569, False: 269k] ------------------ 823| 569| return; 824| 269k| else if (r.tail_offset() == 0) { ------------------ | Branch (824:18): [True: 199k, False: 69.8k] ------------------ 825| | // just concat the tail, similar to push_back 826| 199k| auto tail_offst = l.tail_offset(); 827| 199k| auto tail_size = l.size - tail_offst; 828| 199k| if (tail_size == branches) { ------------------ | Branch (828:17): [True: 61.2k, False: 138k] ------------------ 829| 61.2k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 830| 61.2k| l.tail = r.tail->inc(); 831| 61.2k| l.size += r.size; 832| 61.2k| return; 833| 138k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (833:24): [True: 993, False: 137k] ------------------ 834| 993| l.ensure_mutable_tail(el, tail_size); 835| 993| detail::uninitialized_copy(r.tail->leaf(), 836| 993| r.tail->leaf() + r.size, 837| 993| l.tail->leaf() + tail_size); 838| 993| l.size += r.size; 839| 993| return; 840| 137k| } else { 841| 137k| auto remaining = branches - tail_size; 842| 137k| l.ensure_mutable_tail(el, tail_size); 843| 137k| detail::uninitialized_copy(r.tail->leaf(), 844| 137k| r.tail->leaf() + remaining, 845| 137k| l.tail->leaf() + tail_size); 846| 137k| IMMER_TRY { ------------------ | | 49| 137k|#define IMMER_TRY try ------------------ 847| 137k| auto new_tail = 848| 137k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 849| 137k| IMMER_TRY { ------------------ | | 49| 137k|#define IMMER_TRY try ------------------ 850| 137k| l.push_tail_mut(el, tail_offst, l.tail, branches); 851| 137k| l.tail = new_tail; 852| 137k| l.size += r.size; 853| 137k| return; 854| 137k| } 855| 137k| 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| 137k| } 860| 137k| 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| 137k| } 865| 199k| } else if (l.tail_offset() == 0) { ------------------ | Branch (865:20): [True: 460, False: 69.4k] ------------------ 866| 460| if (supports_transient_concat) { ------------------ | Branch (866:17): [Folded, False: 460] ------------------ 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| 460| } else { 886| 460| auto tail_offst = l.tail_offset(); 887| 460| auto tail_size = l.size - tail_offst; 888| 460| auto concated = concat_trees( 889| 460| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 890| 460| l = {l.size + r.size, 891| 460| concated.shift(), 892| 460| concated.node(), 893| 460| r.tail->inc()}; 894| 460| assert(l.check_tree()); ------------------ | Branch (894:17): [True: 460, False: 0] ------------------ 895| 460| return; 896| 460| } 897| 69.4k| } else { 898| 69.4k| if (supports_transient_concat) { ------------------ | Branch (898:17): [Folded, False: 69.4k] ------------------ 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| 69.4k| } else { 923| 69.4k| auto tail_offst = l.tail_offset(); 924| 69.4k| auto tail_size = l.size - tail_offst; 925| 69.4k| auto concated = concat_trees(l.root, 926| 69.4k| l.shift, 927| 69.4k| tail_offst, 928| 69.4k| l.tail, 929| 69.4k| tail_size, 930| 69.4k| r.root, 931| 69.4k| r.shift, 932| 69.4k| r.tail_offset()); 933| 69.4k| l = {l.size + r.size, 934| 69.4k| concated.shift(), 935| 69.4k| concated.node(), 936| 69.4k| r.tail->inc()}; 937| 69.4k| } 938| 69.4k| } 939| 271k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEaSERKSB_: 163| 2.44k| { 164| 2.44k| auto next{other}; 165| 2.44k| swap(*this, next); 166| 2.44k| return *this; 167| 2.44k| } _ZN5immer6detail4rbts12concat_mut_rERKNS1_7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERSB_NS9_5applyIS6_E4type4editE: 942| 3.35k| { 943| 3.35k| assert(&l != &r); ------------------ | Branch (943:9): [True: 3.35k, False: 0] ------------------ 944| 3.35k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (944:9): [True: 3.35k, False: 0] ------------------ 945| 3.35k| using std::get; 946| 3.35k| if (r.size == 0) ------------------ | Branch (946:13): [True: 296, False: 3.05k] ------------------ 947| 296| r = std::move(l); 948| 3.05k| else if (l.size == 0) ------------------ | Branch (948:18): [True: 232, False: 2.82k] ------------------ 949| 232| return; 950| 2.82k| else if (r.tail_offset() == 0) { ------------------ | Branch (950:18): [True: 779, False: 2.04k] ------------------ 951| | // just concat the tail, similar to push_back 952| 779| auto tail_offst = l.tail_offset(); 953| 779| auto tail_size = l.size - tail_offst; 954| 779| if (tail_size == branches) { ------------------ | Branch (954:17): [True: 262, False: 517] ------------------ 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| 262| auto res = 959| 262| l.push_tail(l.root, l.shift, tail_offst, l.tail, tail_size); 960| 262| l.tail->inc(); // note: leak if mutably concatenated 961| | // with itself, but this is forbidden 962| | // by the interface 963| 262| r = {l.size + r.size, get<0>(res), get<1>(res), r.tail->inc()}; 964| 262| return; 965| 517| } else if (tail_size + r.size <= branches) { ------------------ | Branch (965:24): [True: 249, False: 268] ------------------ 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| 249| auto new_tail = 974| 249| node_t::copy_leaf(l.tail, tail_size, r.tail, r.size); 975| 249| r = {l.size + r.size, l.shift, l.root->inc(), new_tail}; 976| 249| return; 977| 268| } else { 978| | // like the immutable version 979| 268| auto remaining = branches - tail_size; 980| 268| auto add_tail = node_t::copy_leaf_e( 981| 268| er, l.tail, tail_size, r.tail, remaining); 982| 268| IMMER_TRY { ------------------ | | 49| 268|#define IMMER_TRY try ------------------ 983| 268| auto new_tail = 984| 268| node_t::copy_leaf_e(er, r.tail, remaining, r.size); 985| 268| IMMER_TRY { ------------------ | | 49| 268|#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| 268| auto new_root = l.push_tail(l.root, 990| 268| l.shift, 991| 268| tail_offst, 992| 268| add_tail, 993| 268| branches); 994| 268| r = {l.size + r.size, 995| 268| get<0>(new_root), 996| 268| get<1>(new_root), 997| 268| new_tail}; 998| 268| return; 999| 268| } 1000| 268| 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| 268| } 1005| 268| IMMER_CATCH (...) { 1006| 0| node_t::delete_leaf(add_tail, branches); 1007| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1008| 0| } 1009| 268| } 1010| 2.04k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1010:20): [True: 640, False: 1.40k] ------------------ 1011| 640| if (supports_transient_concat) { ------------------ | Branch (1011:17): [Folded, False: 640] ------------------ 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| 640| } else { 1030| 640| auto tail_offst = l.tail_offset(); 1031| 640| auto tail_size = l.size - tail_offst; 1032| 640| auto concated = concat_trees( 1033| 640| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1034| 640| r = {l.size + r.size, 1035| 640| concated.shift(), 1036| 640| concated.node(), 1037| 640| r.tail->inc()}; 1038| 640| return; 1039| 640| } 1040| 1.40k| } else { 1041| 1.40k| if (supports_transient_concat) { ------------------ | Branch (1041:17): [Folded, False: 1.40k] ------------------ 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.40k| } else { 1064| 1.40k| auto tail_offst = l.tail_offset(); 1065| 1.40k| auto tail_size = l.size - tail_offst; 1066| 1.40k| auto concated = concat_trees(l.root, 1067| 1.40k| l.shift, 1068| 1.40k| tail_offst, 1069| 1.40k| l.tail, 1070| 1.40k| tail_size, 1071| 1.40k| r.root, 1072| 1.40k| r.shift, 1073| 1.40k| r.tail_offset()); 1074| 1.40k| r = {l.size + r.size, 1075| 1.40k| concated.shift(), 1076| 1.40k| concated.node(), 1077| 1.40k| r.tail->inc()}; 1078| 1.40k| return; 1079| 1.40k| } 1080| 1.40k| } 1081| 3.35k| } _ZN5immer6detail4rbts15concat_mut_lr_lERNS1_7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS9_5applyIS6_E4type4editESC_SG_: 1084| 24.4k| { 1085| 24.4k| assert(&l != &r); ------------------ | Branch (1085:9): [True: 24.4k, False: 0] ------------------ 1086| 24.4k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (1086:9): [True: 24.4k, False: 0] ------------------ 1087| 24.4k| using std::get; 1088| 24.4k| if (l.size == 0) ------------------ | Branch (1088:13): [True: 1.49k, False: 22.9k] ------------------ 1089| 1.49k| l = r; 1090| 22.9k| else if (r.size == 0) ------------------ | Branch (1090:18): [True: 1.62k, False: 21.3k] ------------------ 1091| 1.62k| return; 1092| 21.3k| else if (r.tail_offset() == 0) { ------------------ | Branch (1092:18): [True: 4.65k, False: 16.6k] ------------------ 1093| | // just concat the tail, similar to push_back 1094| 4.65k| auto tail_offst = l.tail_offset(); 1095| 4.65k| auto tail_size = l.size - tail_offst; 1096| 4.65k| if (tail_size == branches) { ------------------ | Branch (1096:17): [True: 804, False: 3.85k] ------------------ 1097| 804| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 1098| 804| l.tail = r.tail->inc(); 1099| 804| l.size += r.size; 1100| 804| return; 1101| 3.85k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (1101:24): [True: 1.55k, False: 2.29k] ------------------ 1102| 1.55k| l.ensure_mutable_tail(el, tail_size); 1103| 1.55k| if (r.tail->can_mutate(er)) ------------------ | Branch (1103:21): [True: 593, False: 964] ------------------ 1104| 593| detail::uninitialized_move(r.tail->leaf(), 1105| 593| r.tail->leaf() + r.size, 1106| 593| l.tail->leaf() + tail_size); 1107| 964| else 1108| 964| detail::uninitialized_copy(r.tail->leaf(), 1109| 964| r.tail->leaf() + r.size, 1110| 964| l.tail->leaf() + tail_size); 1111| 1.55k| l.size += r.size; 1112| 1.55k| return; 1113| 2.29k| } else { 1114| 2.29k| auto remaining = branches - tail_size; 1115| 2.29k| l.ensure_mutable_tail(el, tail_size); 1116| 2.29k| if (r.tail->can_mutate(er)) ------------------ | Branch (1116:21): [True: 1.10k, False: 1.19k] ------------------ 1117| 1.10k| detail::uninitialized_move(r.tail->leaf(), 1118| 1.10k| r.tail->leaf() + remaining, 1119| 1.10k| l.tail->leaf() + tail_size); 1120| 1.19k| else 1121| 1.19k| detail::uninitialized_copy(r.tail->leaf(), 1122| 1.19k| r.tail->leaf() + remaining, 1123| 1.19k| l.tail->leaf() + tail_size); 1124| 2.29k| IMMER_TRY { ------------------ | | 49| 2.29k|#define IMMER_TRY try ------------------ 1125| 2.29k| auto new_tail = 1126| 2.29k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 1127| 2.29k| IMMER_TRY { ------------------ | | 49| 2.29k|#define IMMER_TRY try ------------------ 1128| 2.29k| l.push_tail_mut(el, tail_offst, l.tail, branches); 1129| 2.29k| l.tail = new_tail; 1130| 2.29k| l.size += r.size; 1131| 2.29k| return; 1132| 2.29k| } 1133| 2.29k| 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| 2.29k| } 1138| 2.29k| 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| 2.29k| } 1143| 16.6k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1143:20): [True: 3.59k, False: 13.0k] ------------------ 1144| 3.59k| if (supports_transient_concat) { ------------------ | Branch (1144:17): [Folded, False: 3.59k] ------------------ 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.59k| } else { 1165| 3.59k| auto tail_offst = l.tail_offset(); 1166| 3.59k| auto tail_size = l.size - tail_offst; 1167| 3.59k| auto concated = concat_trees( 1168| 3.59k| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1169| 3.59k| l = {l.size + r.size, 1170| 3.59k| concated.shift(), 1171| 3.59k| concated.node(), 1172| 3.59k| r.tail->inc()}; 1173| 3.59k| return; 1174| 3.59k| } 1175| 13.0k| } else { 1176| 13.0k| if (supports_transient_concat) { ------------------ | Branch (1176:17): [Folded, False: 13.0k] ------------------ 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| 13.0k| } else { 1200| 13.0k| auto tail_offst = l.tail_offset(); 1201| 13.0k| auto tail_size = l.size - tail_offst; 1202| 13.0k| auto concated = concat_trees(l.root, 1203| 13.0k| l.shift, 1204| 13.0k| tail_offst, 1205| 13.0k| l.tail, 1206| 13.0k| tail_size, 1207| 13.0k| r.root, 1208| 13.0k| r.shift, 1209| 13.0k| r.tail_offset()); 1210| 13.0k| l = {l.size + r.size, 1211| 13.0k| concated.shift(), 1212| 13.0k| concated.node(), 1213| 13.0k| r.tail->inc()}; 1214| 13.0k| return; 1215| 13.0k| } 1216| 13.0k| } 1217| 24.4k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6equalsERKSB_: 315| 28.8k| { 316| 28.8k| using iter_t = rrbtree_iterator; 317| 28.8k| if (size != other.size) ------------------ | Branch (317:13): [True: 9.04k, False: 19.7k] ------------------ 318| 9.04k| return false; 319| 19.7k| if (size == 0) ------------------ | Branch (319:13): [True: 212, False: 19.5k] ------------------ 320| 212| return true; 321| 19.5k| auto tail_off = tail_offset(); 322| 19.5k| auto tail_off_other = other.tail_offset(); 323| | // compare trees 324| 19.5k| if (tail_off > 0 && tail_off_other > 0) { ------------------ | Branch (324:13): [True: 18.6k, False: 921] | Branch (324:29): [True: 18.4k, False: 197] ------------------ 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| 18.4k| if (other.shift >= shift) { ------------------ | Branch (328:17): [True: 17.7k, False: 736] ------------------ 329| 17.7k| if (!visit_maybe_relaxed_sub(other.root, ------------------ | Branch (329:21): [True: 8.59k, False: 9.13k] ------------------ 330| 17.7k| other.shift, 331| 17.7k| tail_off_other, 332| 17.7k| equals_visitor::rrb{}, 333| 17.7k| iter_t{other}, 334| 17.7k| root, 335| 17.7k| shift, 336| 17.7k| tail_off)) 337| 8.59k| return false; 338| 17.7k| } else { 339| 736| if (!visit_maybe_relaxed_sub(root, ------------------ | Branch (339:21): [True: 393, False: 343] ------------------ 340| 736| shift, 341| 736| tail_off, 342| 736| equals_visitor::rrb{}, 343| 736| iter_t{*this}, 344| 736| other.root, 345| 736| other.shift, 346| 736| tail_off_other)) 347| 393| return false; 348| 736| } 349| 18.4k| } 350| 10.5k| return tail_off == tail_off_other ------------------ | Branch (350:16): [True: 6.67k, False: 3.92k] ------------------ 351| 10.5k| ? make_leaf_sub_pos(tail, tail_size()) 352| 6.67k| .visit(equals_visitor{}, other.tail) 353| 10.5k| : tail_off > tail_off_other ------------------ | Branch (353:18): [True: 1.63k, False: 2.28k] ------------------ 354| 3.92k| ? std::equal(tail->leaf(), 355| 1.63k| tail->leaf() + (size - tail_off), 356| 1.63k| other.tail->leaf() + 357| 1.63k| (tail_off - tail_off_other)) 358| | /* otherwise */ 359| 3.92k| : std::equal(tail->leaf(), 360| 2.28k| tail->leaf() + (size - tail_off), 361| 2.28k| iter_t{other} + tail_off); 362| 19.5k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10region_forEm: 524| 1.46M| { 525| 1.46M| using std::get; 526| 1.46M| auto tail_off = tail_offset(); 527| 1.46M| if (idx >= tail_off) { ------------------ | Branch (527:13): [True: 4.02k, False: 1.45M] ------------------ 528| 4.02k| return std::make_tuple(tail->leaf(), tail_off, size); 529| 1.45M| } else { 530| 1.45M| auto subs = visit_maybe_relaxed_sub( 531| 1.45M| root, shift, tail_off, region_for_visitor(), idx); 532| 1.45M| auto first = idx - get<1>(subs); 533| 1.45M| auto end = first + get<2>(subs); 534| 1.45M| return std::make_tuple(get<0>(subs), first, end); 535| 1.45M| } 536| 1.46M| } _ZNK5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11dereferenceEv: 90| 5.95M| { 91| 5.95M| using std::get; 92| 5.95M| if (i_ < get<1>(curr_) || i_ >= get<2>(curr_)) ------------------ | Branch (92:13): [True: 37.7k, False: 5.91M] | Branch (92:35): [True: 1.42M, False: 4.49M] ------------------ 93| 1.46M| curr_ = v_->region_for(i_); 94| 5.95M| return get<0>(curr_)[i_ - get<1>(curr_)]; 95| 5.95M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7advanceEl: 74| 219k| { 75| 219k| using std::get; 76| 219k| assert(n <= 0 || i_ + static_cast(n) <= v_->size); ------------------ | Branch (76:9): [True: 414, False: 219k] | Branch (76:9): [True: 219k, False: 0] | Branch (76:9): [True: 219k, False: 0] ------------------ 77| 219k| assert(n >= 0 || static_cast(-n) <= i_); ------------------ | Branch (77:9): [True: 219k, False: 0] | Branch (77:9): [True: 0, False: 0] | Branch (77:9): [True: 219k, False: 0] ------------------ 78| 219k| i_ += n; 79| 219k| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9incrementEv: 60| 4.51M| { 61| 4.51M| using std::get; 62| 4.51M| assert(i_ < v_->size); ------------------ | Branch (62:9): [True: 4.51M, False: 0] ------------------ 63| 4.51M| ++i_; 64| 4.51M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2ERKNS1_7rrbtreeIiSA_Lj2ELj2EEE: 39| 20.7k| : v_{&v} 40| 20.7k| , i_{0} 41| 20.7k| , curr_{nullptr, ~size_t{}, ~size_t{}} 42| 20.7k| { 43| 20.7k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERmEEEDcDpOT_: 31| 15.2k| { 32| 15.2k| return Deriv::visit_inner(std::forward(args)...); 33| 15.2k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERmEEEDcDpOT_: 31| 44.6k| { 32| 44.6k| return Deriv::visit_inner(std::forward(args)...); 33| 44.6k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EEEE13visit_regularIJRNS1_15regular_sub_posISD_EERmEEEDcDpOT_: 37| 2.21k| { 38| 2.21k| return Deriv::visit_inner(std::forward(args)...); 39| 2.21k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EEEE13visit_regularIJRNS1_8full_posISD_EEmEEEDcDpOT_: 37| 5.89k| { 38| 5.89k| return Deriv::visit_inner(std::forward(args)...); 39| 5.89k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EEEE13visit_regularIJRNS1_15regular_sub_posISD_EERmEEEDcDpOT_: 37| 7.13k| { 38| 7.13k| return Deriv::visit_inner(std::forward(args)...); 39| 7.13k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EEEE13visit_regularIJRNS1_8full_posISD_EEmEEEDcDpOT_: 37| 1.64k| { 38| 1.64k| return Deriv::visit_inner(std::forward(args)...); 39| 1.64k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EEEE13visit_regularIJRNS1_15regular_sub_posISD_EEmEEEDcDpOT_: 37| 2.18k| { 38| 2.18k| return Deriv::visit_inner(std::forward(args)...); 39| 2.18k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_25singleton_regular_sub_posISD_EENS1_14empty_leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 37| 8.12k| { 38| 8.12k| return Deriv::visit_inner(std::forward(args)...); 39| 8.12k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE11visit_innerIJRNS1_25singleton_regular_sub_posISD_EENS1_14empty_leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 43| 8.12k| { 44| 8.12k| return Deriv::visit_node(std::forward(args)...); 45| 8.12k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 31| 5.78k| { 32| 5.78k| return Deriv::visit_inner(std::forward(args)...); 33| 5.78k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 43| 5.78k| { 44| 5.78k| return Deriv::visit_node(std::forward(args)...); 45| 5.78k| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE10visit_leafIJRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_21concat_rebalance_planILj2ELj2EEEEEEDcDpOT_: 49| 2.47M| { 50| 2.47M| return Deriv::visit_node(std::forward(args)...); 51| 2.47M| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_21concat_rebalance_planILj2ELj2EEEEEEDcDpOT_: 31| 21.7M| { 32| 21.7M| return Deriv::visit_inner(std::forward(args)...); 33| 21.7M| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE11visit_innerIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_21concat_rebalance_planILj2ELj2EEEEEEDcDpOT_: 43| 21.7M| { 44| 21.7M| return Deriv::visit_node(std::forward(args)...); 45| 21.7M| } _ZN5immer6detail4rbts12visitor_baseINS1_21concat_merger_visitorEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_13concat_mergerISG_EEEEEDcDpOT_: 31| 21.7M| { 32| 21.7M| return Deriv::visit_inner(std::forward(args)...); 33| 21.7M| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 31| 17.5k| { 32| 17.5k| return Deriv::visit_inner(std::forward(args)...); 33| 17.5k| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 37| 391| { 38| 391| return Deriv::visit_inner(std::forward(args)...); 39| 391| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_8full_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 37| 1.14k| { 38| 1.14k| return Deriv::visit_inner(std::forward(args)...); 39| 1.14k| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE10visit_leafIJRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_21concat_rebalance_planILj2ELj2EEEEEEDcDpOT_: 49| 1.18M| { 50| 1.18M| return Deriv::visit_node(std::forward(args)...); 51| 1.18M| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_21concat_rebalance_planILj2ELj2EEEEEEDcDpOT_: 37| 851k| { 38| 851k| return Deriv::visit_inner(std::forward(args)...); 39| 851k| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE11visit_innerIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_21concat_rebalance_planILj2ELj2EEEEEEDcDpOT_: 43| 851k| { 44| 851k| return Deriv::visit_node(std::forward(args)...); 45| 851k| } _ZN5immer6detail4rbts12visitor_baseINS1_21concat_merger_visitorEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_13concat_mergerISG_EEEEEDcDpOT_: 37| 851k| { 38| 851k| return Deriv::visit_inner(std::forward(args)...); 39| 851k| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_21concat_rebalance_planILj2ELj2EEEEEEDcDpOT_: 37| 716k| { 38| 716k| return Deriv::visit_inner(std::forward(args)...); 39| 716k| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE11visit_innerIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_21concat_rebalance_planILj2ELj2EEEEEEDcDpOT_: 43| 716k| { 44| 716k| return Deriv::visit_node(std::forward(args)...); 45| 716k| } _ZN5immer6detail4rbts12visitor_baseINS1_21concat_merger_visitorEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_13concat_mergerISG_EEEEEDcDpOT_: 37| 716k| { 38| 716k| return Deriv::visit_inner(std::forward(args)...); 39| 716k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 37| 2.34k| { 38| 2.34k| return Deriv::visit_inner(std::forward(args)...); 39| 2.34k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 43| 2.34k| { 44| 2.34k| return Deriv::visit_node(std::forward(args)...); 45| 2.34k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 31| 516k| { 32| 516k| return Deriv::visit_inner(std::forward(args)...); 33| 516k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 43| 516k| { 44| 516k| return Deriv::visit_node(std::forward(args)...); 45| 516k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 31| 494k| { 32| 494k| return Deriv::visit_inner(std::forward(args)...); 33| 494k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 494k| { 44| 494k| return Deriv::visit_node(std::forward(args)...); 45| 494k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_: 31| 2.36M| { 32| 2.36M| return Deriv::visit_inner(std::forward(args)...); 33| 2.36M| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EERNS1_11relaxed_posISD_EEEEEDcDpOT_: 37| 5.55k| { 38| 5.55k| return Deriv::visit_inner(std::forward(args)...); 39| 5.55k| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 31| 668k| { 32| 668k| return Deriv::visit_inner(std::forward(args)...); 33| 668k| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 126k| { 38| 126k| return Deriv::visit_inner(std::forward(args)...); 39| 126k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_: 37| 1.33k| { 38| 1.33k| return Deriv::visit_inner(std::forward(args)...); 39| 1.33k| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_8full_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 155k| { 38| 155k| return Deriv::visit_inner(std::forward(args)...); 39| 155k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EERNS1_8full_posISD_EEEEEDcDpOT_: 37| 81.0k| { 38| 81.0k| return Deriv::visit_inner(std::forward(args)...); 39| 81.0k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_: 37| 73.7k| { 38| 73.7k| return Deriv::visit_inner(std::forward(args)...); 39| 73.7k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EERNS1_11relaxed_posISD_EEEEEDcDpOT_: 37| 783k| { 38| 783k| return Deriv::visit_inner(std::forward(args)...); 39| 783k| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 31| 1.84M| { 32| 1.84M| return Deriv::visit_inner(std::forward(args)...); 33| 1.84M| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 4.00k| { 38| 4.00k| return Deriv::visit_inner(std::forward(args)...); 39| 4.00k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EERNS1_15regular_sub_posISD_EEEEEDcDpOT_: 31| 114k| { 32| 114k| return Deriv::visit_inner(std::forward(args)...); 33| 114k| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_8full_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 6.16k| { 38| 6.16k| return Deriv::visit_inner(std::forward(args)...); 39| 6.16k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EERNS1_8full_posISD_EEEEEDcDpOT_: 31| 2.01k| { 32| 2.01k| return Deriv::visit_inner(std::forward(args)...); 33| 2.01k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EERNS1_15regular_sub_posISD_EEEEEDcDpOT_: 31| 3.17k| { 32| 3.17k| return Deriv::visit_inner(std::forward(args)...); 33| 3.17k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_: 31| 1.76M| { 32| 1.76M| return Deriv::visit_inner(std::forward(args)...); 33| 1.76M| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 21.5k| { 38| 21.5k| return Deriv::visit_inner(std::forward(args)...); 39| 21.5k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 21.5k| { 44| 21.5k| return Deriv::visit_node(std::forward(args)...); 45| 21.5k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 37| 14.1k| { 38| 14.1k| return Deriv::visit_inner(std::forward(args)...); 39| 14.1k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 43| 14.1k| { 44| 14.1k| return Deriv::visit_node(std::forward(args)...); 45| 14.1k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 31| 6.33k| { 32| 6.33k| return Deriv::visit_inner(std::forward(args)...); 33| 6.33k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 6.33k| { 44| 6.33k| return Deriv::visit_node(std::forward(args)...); 45| 6.33k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 7.85k| { 38| 7.85k| return Deriv::visit_inner(std::forward(args)...); 39| 7.85k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 7.85k| { 44| 7.85k| return Deriv::visit_node(std::forward(args)...); 45| 7.85k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERKPSH_RKjRmEEEDcDpOT_: 31| 11.6k| { 32| 11.6k| return Deriv::visit_inner(std::forward(args)...); 33| 11.6k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE11visit_innerIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERKPSH_RKjRmEEEDcDpOT_: 43| 11.6k| { 44| 11.6k| return Deriv::visit_node(std::forward(args)...); 45| 11.6k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERjSJ_RNS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERmEEEDcDpOT_: 31| 19.9k| { 32| 19.9k| return Deriv::visit_inner(std::forward(args)...); 33| 19.9k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERjRNS1_15regular_sub_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERmEEEDcDpOT_: 31| 2.26k| { 32| 2.26k| return Deriv::visit_inner(std::forward(args)...); 33| 2.26k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERjRNS1_8full_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERmEEEDcDpOT_: 31| 892| { 32| 892| return Deriv::visit_inner(std::forward(args)...); 33| 892| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERjRNS1_8full_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERmEEEDcDpOT_: 37| 1.13k| { 38| 1.13k| return Deriv::visit_inner(std::forward(args)...); 39| 1.13k| } _ZN5immer6detail4rbts12visitor_baseINS1_18region_for_visitorIiEEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERmEEEDcDpOT_: 31| 9.81M| { 32| 9.81M| return Deriv::visit_inner(std::forward(args)...); 33| 9.81M| } _ZN5immer6detail4rbts12visitor_baseINS1_18region_for_visitorIiEEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERmEEEDcDpOT_: 37| 386k| { 38| 386k| return Deriv::visit_inner(std::forward(args)...); 39| 386k| } _ZN5immer6detail4rbts12visitor_baseINS1_18region_for_visitorIiEEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERmEEEDcDpOT_: 37| 1.05M| { 38| 1.05M| return Deriv::visit_inner(std::forward(args)...); 39| 1.05M| } _ZN5immer6detail4rbts12visitor_baseINS1_18region_for_visitorIiEEE13visit_regularIJRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERmEEEDcDpOT_: 37| 112k| { 38| 112k| return Deriv::visit_inner(std::forward(args)...); 39| 112k| } _ZN5immer6detail4rbts12visitor_baseINS1_24for_each_chunk_p_visitorEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSF_Lj2ELj2EEEEEDaOT_EUlSN_T0_E_EEEDcDpOT_: 37| 97.6k| { 38| 97.6k| return Deriv::visit_inner(std::forward(args)...); 39| 97.6k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERjSJ_RNS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERmEEEDcDpOT_: 37| 753| { 38| 753| return Deriv::visit_inner(std::forward(args)...); 39| 753| } _ZN5immer6detail4rbts12visitor_baseINS1_24for_each_chunk_p_visitorEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSF_Lj2ELj2EEEEEDaOT_EUlSN_T0_E_EEEDcDpOT_: 37| 20.1k| { 38| 20.1k| return Deriv::visit_inner(std::forward(args)...); 39| 20.1k| } _ZN5immer6detail4rbts12visitor_baseINS1_24for_each_chunk_p_visitorEE13visit_regularIJRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSF_Lj2ELj2EEEEEDaOT_EUlSN_T0_E_EEEDcDpOT_: 37| 6.69k| { 38| 6.69k| return Deriv::visit_inner(std::forward(args)...); 39| 6.69k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERjRNS1_11relaxed_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERmEEEDcDpOT_: 37| 2.55k| { 38| 2.55k| return Deriv::visit_inner(std::forward(args)...); 39| 2.55k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERjRNS1_11relaxed_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERmEEEDcDpOT_: 37| 2.81k| { 38| 2.81k| return Deriv::visit_inner(std::forward(args)...); 39| 2.81k| } _ZN5immer6detail4rbts12visitor_baseINS1_24for_each_chunk_p_visitorEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSF_Lj2ELj2EEEEEDaOT_EUlSN_T0_E_EEEDcDpOT_: 31| 616k| { 32| 616k| return Deriv::visit_inner(std::forward(args)...); 33| 616k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERPSH_RjRmEEEDcDpOT_: 31| 1.40k| { 32| 1.40k| return Deriv::visit_inner(std::forward(args)...); 33| 1.40k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE11visit_innerIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERPSH_RjRmEEEDcDpOT_: 43| 1.40k| { 44| 1.40k| return Deriv::visit_node(std::forward(args)...); 45| 1.40k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERKPSH_RKjRmEEEDcDpOT_: 37| 6.82k| { 38| 6.82k| return Deriv::visit_inner(std::forward(args)...); 39| 6.82k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE11visit_innerIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERKPSH_RKjRmEEEDcDpOT_: 43| 6.82k| { 44| 6.82k| return Deriv::visit_node(std::forward(args)...); 45| 6.82k| } _ZN5immer6detail15auto_const_castINS_15refcount_policyEEERT_RKS3_: 143| 123M|{ 144| 123M| return const_cast(x); 145| 123M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7inner_tEPSC_Lb0EE15get_storage_ptrEv: 113| 116M| { 114| 116M| check_base(); 115| 116M| auto* base = static_cast(this); 116| 116M| return reinterpret_cast(base + 1); 117| 116M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7inner_tEPSC_Lb0EE10check_baseEv: 134| 116M| { 135| 116M| static_assert(std::is_standard_layout::value && 136| 116M| !std::is_empty::value, 137| 116M| "Please add 'true' if the derived class is emtpy"); 138| 116M| } _ZN5immer6detail9static_ifILb1EZNS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14delete_inner_rEPSC_jEUlT_E_EENSt3__19enable_ifIXT_EvE4typeEOT0_: 329| 12.5M|{ 330| 12.5M| std::forward(f)(empty_t{}); 331| 12.5M|} _ZN5immer6detail9destroy_nIPijEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 1.48M|{ 189| 1.48M| return first + n; 190| 1.48M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6leaf_tEiLb1EE15get_storage_ptrEv: 75| 10.6M| { 76| 10.6M| check_base(); 77| 10.6M| return reinterpret_cast(this); 78| 10.6M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6leaf_tEiLb1EE10check_baseEv: 94| 10.6M| { 95| | // is_standard_layout requires that only one class in the hierarchy 96| | // contains non-static data members. Since this class contains one 97| | // member, the static_assert will only hold when the derived class is 98| | // empty. 99| 10.6M| static_assert(std::is_standard_layout::value, 100| 10.6M| "Please remove 'true' if the derived class is non emtpy"); 101| 10.6M| } _ZN5immer6detail18uninitialized_copyIPiS2_S2_EENSt3__19enable_ifIX18can_trivially_copyIT_T1_EES6_E4typeES5_T0_S6_: 236| 1.83M|{ 237| 1.83M| return std::copy(first, last, out); 238| 1.83M|} _ZN5immer6detail9static_ifILb0EPNS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEZNSC_15make_inner_sr_nEjPNS0_3csl10member_twoINSC_14relaxed_data_tENSE_6memberIS8_NSE_7inheritINSA_5applyIS7_E4type5owneeEvE4typeEE4typeEE4typeEEUlT_E_ZNSC_15make_inner_sr_nEjST_EUlSU_E0_EENSt3__19enable_ifIXntT_ET0_E4typeEOT1_OT2_: 344| 274k|{ 345| 274k| return std::forward(f2)(empty_t{}); 346| 274k|} _ZN5immer6detail4ipowImEET_S2_j: 323| 68.9M|{ 324| 68.9M| return pow == 0 ? 1 : num * ipow(num, pow - 1); ------------------ | Branch (324:12): [True: 2.15M, False: 66.8M] ------------------ 325| 68.9M|} _ZN5immer6detail9static_ifILb0EPNS0_3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14relaxed_data_tENS2_6memberISA_NS2_7inheritINSC_5applyIS9_E4type5owneeEvE4typeEE4typeEE4typeEZNSE_24ensure_mutable_relaxed_nENSK_4editEjEUlT_E_ZNSE_24ensure_mutable_relaxed_nEST_jEUlSU_E0_EENSt3__19enable_ifIXntT_ET0_E4typeEOT1_OT2_: 344| 69.1k|{ 345| 69.1k| return std::forward(f2)(empty_t{}); 346| 69.1k|} _ZN5immer6detail9static_ifILb1EZNS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14make_inner_r_eENSA_5applyIS7_E4type4editEEUlT_E_EENSt3__19enable_ifIXT_EvE4typeEOT0_: 329| 98.7k|{ 330| 98.7k| std::forward(f)(empty_t{}); 331| 98.7k|} _ZN5immer6detail9static_ifILb0EPNS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEZNSC_15make_inner_sr_eENSA_5applyIS7_E4type4editEPNS0_3csl10member_twoINSC_14relaxed_data_tENSI_6memberIS8_NSI_7inheritINSG_5owneeEvE4typeEE4typeEE4typeEEUlT_E_ZNSC_15make_inner_sr_eESH_SU_EUlSV_E0_EENSt3__19enable_ifIXntT_ET0_E4typeEOT1_OT2_: 344| 13.0k|{ 345| 13.0k| return std::forward(f2)(empty_t{}); 346| 13.0k|} _ZN5immer6detail9destroy_nIPimEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 483|{ 189| 483| return first + n; 190| 483|} _ZN5immer6detail9static_ifILb0EPNS0_3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14relaxed_data_tENS2_6memberISA_NS2_7inheritINSC_5applyIS9_E4type5owneeEvE4typeEE4typeEE4typeEZNSE_22ensure_mutable_relaxedENSK_4editEEUlT_E_ZNSE_22ensure_mutable_relaxedEST_EUlSU_E0_EENSt3__19enable_ifIXntT_ET0_E4typeEOT1_OT2_: 344| 201k|{ 345| 201k| return std::forward(f2)(empty_t{}); 346| 201k|} _ZN5immer6detail18uninitialized_moveIPiS2_EENSt3__19enable_ifIX18can_trivially_copyIT_T0_EES6_E4typeES5_S5_S6_: 210| 1.69k|{ 211| 1.69k| return std::copy(first, last, out); 212| 1.69k|} _ZN5immer6detail8as_constIiEEPKT_PS2_: 29| 1.43M|{ 30| 1.43M| return x; 31| 1.43M|} _ZN5immer6detail4makeINS_15debug_size_heapINS_8cpp_heapEEENS_3boxIiNS_13memory_policyINS_21free_list_heap_policyIS3_Lm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderEJiEEEPT0_DpOT1_: 260| 19.3k|{ 261| 19.3k| auto ptr = Heap::allocate(sizeof(T)); 262| 19.3k| IMMER_TRY { ------------------ | | 49| 19.3k|#define IMMER_TRY try ------------------ 263| 19.3k| return new (ptr) T(std::forward(args)...); 264| 19.3k| } 265| 19.3k| IMMER_CATCH (...) { 266| 0| Heap::deallocate(sizeof(T), ptr); 267| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 268| 0| } 269| 19.3k|} _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2Ev: 96| 70.6k| flex_vector() = default; _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9push_backEi: 246| 444k| { 247| 444k| return impl_.push_back(std::move(value)); 248| 444k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2ENS_6detail4rbts7rrbtreeIiS8_Lj2ELj2EEE: 536| 1.51M| : impl_(std::move(impl)) 537| 1.51M| { 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.51M| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4sizeEv: 181| 2.85M| IMMER_NODISCARD size_type size() const { return impl_.size; } flex-vector.cpp:_ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6updateIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSE_E_EES9_mOSE_: 323| 109k| { 324| 109k| return impl_.update(index, std::forward(fn)); 325| 109k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4takeEm: 350| 24.5k| { 351| 24.5k| return impl_.take(elems); 352| 24.5k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4dropEm: 376| 26.2k| { 377| 26.2k| return impl_.drop(elems); 378| 26.2k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8max_sizeEv: 90| 1.24M| constexpr static size_type max_size() { return impl_t::max_size(); } _ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEESB_: 403| 908k| { 404| 908k| return l.impl_.concat(r.impl_); 405| 908k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9push_backEi: 251| 32.5k| { 252| 32.5k| return push_back_move(move_t{}, std::move(value)); 253| 32.5k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14push_back_moveENSt3__117integral_constantIbLb1EEEi: 547| 32.5k| { 548| 32.5k| impl_.push_back_mut({}, std::move(value)); 549| 32.5k| return std::move(*this); 550| 32.5k| } flex-vector.cpp:_ZNO5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6updateIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSE_E0_EEDcmOSE_: 329| 77.7k| { 330| 77.7k| return update_move(move_t{}, index, std::forward(fn)); 331| 77.7k| } flex-vector.cpp:_ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11update_moveIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSE_E0_EEOS9_NSt3__117integral_constantIbLb1EEEmOSE_: 568| 77.7k| { 569| 77.7k| impl_.update_mut({}, index, std::forward(fn)); 570| 77.7k| return std::move(*this); 571| 77.7k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4takeEm: 355| 38.4k| { 356| 38.4k| return take_move(move_t{}, elems); 357| 38.4k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9take_moveENSt3__117integral_constantIbLb1EEEm: 579| 38.4k| { 580| 38.4k| impl_.take_mut({}, elems); 581| 38.4k| return std::move(*this); 582| 38.4k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4dropEm: 381| 42.4k| { 382| 42.4k| return drop_move(move_t{}, elems); 383| 42.4k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9drop_moveENSt3__117integral_constantIbLb1EEEm: 589| 42.4k| { 590| 42.4k| impl_.drop_mut({}, elems); 591| 42.4k| return std::move(*this); 592| 42.4k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERKS9_: 409| 271k| { 410| 271k| return concat_move(move_t{}, std::move(l), r); 411| 271k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_RKS9_: 600| 271k| { 601| 271k| concat_mut_l(l.impl_, {}, r.impl_); 602| 271k| return std::move(l); 603| 271k| } _ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEOS9_: 415| 3.35k| { 416| 3.35k| return concat_move(move_t{}, l, std::move(r)); 417| 3.35k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11concat_moveENSt3__117integral_constantIbLb1EEERKS9_OS9_: 606| 3.35k| { 607| 3.35k| concat_mut_r(l.impl_, r.impl_, {}); 608| 3.35k| return std::move(r); 609| 3.35k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEESA_: 421| 24.4k| { 422| 24.4k| return concat_move(move_t{}, std::move(l), std::move(r)); 423| 24.4k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_SD_: 612| 24.4k| { 613| 24.4k| concat_mut_lr_l(l.impl_, {}, r.impl_, {}); 614| 24.4k| return std::move(l); 615| 24.4k| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEeqERKS9_: 222| 28.8k| { 223| 28.8k| return impl_.equals(other.impl_); 224| 28.8k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5eraseEm: 480| 3.50k| { 481| 3.50k| return take(pos) + drop(pos + 1); 482| 3.50k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6insertEmi: 442| 19.3k| { 443| 19.3k| return take(pos).push_back(std::move(value)) + drop(pos); 444| 19.3k| } _ZN5immer8cpp_heap10deallocateEmPv: 36| 11.3M| static void deallocate(std::size_t, void* data) { ::operator delete(data); } _ZN5immer8cpp_heap8allocateIJEEEPvmDpT_: 27| 11.3M| { 28| 11.3M| return ::operator new(size); 29| 11.3M| } _ZN5immer15debug_size_heapINS_8cpp_heapEE10deallocateIJEEEvmPvDpT_: 57| 11.3M| { 58| 11.3M| auto p = (std::size_t*) (((char*) data) - extra_size); 59| 11.3M| assert(*p == size); ------------------ | Branch (59:9): [True: 11.3M, False: 0] ------------------ 60| 11.3M| Base::deallocate(size + extra_size, p, tags...); 61| 11.3M| } _ZN5immer15debug_size_heapINS_8cpp_heapEE8allocateIJEEEPvmDpT_: 49| 11.3M| { 50| 11.3M| auto p = (std::size_t*) Base::allocate(size + extra_size, tags...); 51| 11.3M| new (p) std::size_t{size}; 52| 11.3M| return ((char*) p) + extra_size; 53| 11.3M| } _ZN5immer14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEE10deallocateIJEEEvmPvDpT_: 56| 11.8M| { 57| 11.8M| assert(size <= Size); ------------------ | Branch (57:9): [True: 11.8M, False: 0] ------------------ 58| | 59| | // we use relaxed, because we are fine with temporarily having 60| | // a few more/less buffers in free list 61| 11.8M| if (head().count.load(std::memory_order_relaxed) >= Limit) { ------------------ | Branch (61:13): [True: 11.2M, False: 583k] ------------------ 62| 11.2M| base_t::deallocate(Size, data); 63| 11.2M| } else { 64| 583k| auto n = static_cast(data); 65| 583k| do { 66| 583k| n->next = head().data; 67| 583k| } while (!head().data.compare_exchange_weak(n->next, n)); ------------------ | Branch (67:22): [True: 0, False: 583k] ------------------ 68| 583k| head().count.fetch_add(1u, std::memory_order_relaxed); 69| 583k| } 70| 11.8M| } _ZN5immer14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEE4headEv: 80| 26.6M| { 81| 26.6M| static head_t head_{{nullptr}, {0}}; 82| 26.6M| return head_; 83| 26.6M| } _ZN5immer14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEE8allocateIJEEEPvmDpT_: 39| 11.8M| { 40| 11.8M| assert(size <= Size); ------------------ | Branch (40:9): [True: 11.8M, False: 0] ------------------ 41| | 42| 11.8M| node_t* n; 43| 11.8M| do { 44| 11.8M| n = head().data; 45| 11.8M| if (!n) { ------------------ | Branch (45:17): [True: 11.2M, False: 582k] ------------------ 46| 11.2M| auto p = base_t::allocate(Size); 47| 11.2M| return p; 48| 11.2M| } 49| 11.8M| } while (!head().data.compare_exchange_weak(n, n->next)); ------------------ | Branch (49:18): [True: 0, False: 582k] ------------------ 50| 582k| head().count.fetch_sub(1u, std::memory_order_relaxed); 51| 582k| return n; 52| 11.8M| } _ZN5immer10split_heapILm56ENS_27thread_local_free_list_heapILm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEEES5_E10deallocateIJEEEvmPvDpT_: 33| 29.4M| { 34| 29.4M| if (size <= Size) ------------------ | Branch (34:13): [True: 29.4M, False: 0] ------------------ 35| 29.4M| SmallHeap::deallocate(size, data, tags...); 36| 0| else 37| 0| BigHeap::deallocate(size, data, tags...); 38| 29.4M| } _ZN5immer10split_heapILm56ENS_27thread_local_free_list_heapILm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEEES5_E8allocateIJEEEPvmDpT_: 26| 17.1M| { 27| 17.1M| return size <= Size ? SmallHeap::allocate(size, tags...) ------------------ | Branch (27:16): [True: 17.1M, False: 0] ------------------ 28| 17.1M| : BigHeap::allocate(size, tags...); 29| 17.1M| } _ZN5immer10split_heapILm56ENS_27thread_local_free_list_heapILm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEEES5_E8allocateIJNS_10norefs_tagEEEEPvmDpT_: 26| 12.2M| { 27| 12.2M| return size <= Size ? SmallHeap::allocate(size, tags...) ------------------ | Branch (27:16): [True: 12.2M, False: 0] ------------------ 28| 12.2M| : BigHeap::allocate(size, tags...); 29| 12.2M| } _ZN5immer6detail30thread_local_free_list_storageINS0_26unsafe_free_list_heap_implIS1_Lm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEEEE4headEv: 35| 146M| { 36| 146M| thread_local static head_t head_{nullptr, 0}; 37| 146M| return head_; 38| 146M| } _ZN5immer6detail30thread_local_free_list_storageINS0_26unsafe_free_list_heap_implIS1_Lm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEEEE6head_tD2Ev: 31| 1| ~head_t() { Heap::clear(); } _ZN5immer6detail26unsafe_free_list_heap_implINS0_30thread_local_free_list_storageELm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEE10deallocateIJEEEvmPvDpT_: 72| 29.4M| { 73| 29.4M| assert(size <= Size); ------------------ | Branch (73:9): [True: 29.4M, False: 0] ------------------ 74| | 75| 29.4M| if (storage::head().count >= Limit) ------------------ | Branch (75:13): [True: 11.8M, False: 17.5M] ------------------ 76| 11.8M| base_t::deallocate(Size, data); 77| 17.5M| else { 78| 17.5M| auto n = static_cast(data); 79| 17.5M| n->next = storage::head().data; 80| 17.5M| storage::head().data = n; 81| 17.5M| ++storage::head().count; 82| 17.5M| } 83| 29.4M| } _ZN5immer6detail26unsafe_free_list_heap_implINS0_30thread_local_free_list_storageELm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEE5clearEv: 86| 1| { 87| 1.02k| while (storage::head().data) { ------------------ | Branch (87:16): [True: 1.02k, False: 1] ------------------ 88| 1.02k| auto n = storage::head().data->next; 89| 1.02k| base_t::deallocate(Size, storage::head().data); 90| 1.02k| storage::head().data = n; 91| 1.02k| --storage::head().count; 92| 1.02k| } 93| 1| } _ZN5immer6detail26unsafe_free_list_heap_implINS0_30thread_local_free_list_storageELm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEE8allocateIJEEEPvmDpT_: 57| 17.1M| { 58| 17.1M| assert(size <= Size); ------------------ | Branch (58:9): [True: 17.1M, False: 0] ------------------ 59| | 60| 17.1M| auto n = storage::head().data; 61| 17.1M| if (!n) { ------------------ | Branch (61:13): [True: 6.07M, False: 11.0M] ------------------ 62| 6.07M| auto p = base_t::allocate(Size); 63| 6.07M| return p; 64| 6.07M| } 65| 11.0M| --storage::head().count; 66| 11.0M| storage::head().data = n->next; 67| 11.0M| return n; 68| 17.1M| } _ZN5immer6detail26unsafe_free_list_heap_implINS0_30thread_local_free_list_storageELm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEE8allocateIJNS_10norefs_tagEEEEPvmDpT_: 57| 12.2M| { 58| 12.2M| assert(size <= Size); ------------------ | Branch (58:9): [True: 12.2M, False: 0] ------------------ 59| | 60| 12.2M| auto n = storage::head().data; 61| 12.2M| if (!n) { ------------------ | Branch (61:13): [True: 5.80M, False: 6.47M] ------------------ 62| 5.80M| auto p = base_t::allocate(Size); 63| 5.80M| return p; 64| 5.80M| } 65| 6.47M| --storage::head().count; 66| 6.47M| storage::head().data = n->next; 67| 6.47M| return n; 68| 12.2M| } _ZN5immer15refcount_policyC2Ev: 28| 29.4M| : refcount{1} {}; _ZN5immer15refcount_policy3incEv: 34| 46.1M| void inc() { refcount.fetch_add(1, std::memory_order_relaxed); } _ZN5immer15refcount_policy3decEv: 36| 75.5M| bool dec() { return 1 == refcount.fetch_sub(1, std::memory_order_acq_rel); } _ZN5immer15refcount_policy6uniqueEv: 38| 2.17M| bool unique() { return refcount == 1; } _ZNK5immer20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5ownee5ownedEv: 36| 29.4M| bool owned() const { return false; } _ZNK5immer20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5ownee10can_mutateENS6_4editE: 35| 119k| bool can_mutate(edit) const { return false; } _ZN5immer20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeaSENS6_4editE: 34| 546k| ownee& operator=(edit) { return *this; };