LLVMFuzzerTestOneInput: 18| 9.45k|{ 19| 9.45k| constexpr auto var_count = 8; 20| 9.45k| constexpr auto bits = 2; 21| | 22| 9.45k| using vector_t = 23| 9.45k| immer::flex_vector; 24| 9.45k| using size_t = std::uint8_t; 25| | 26| 9.45k| auto vars = std::array{}; 27| | 28| 9.45k| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; 29| 9.45k| auto is_valid_var_neq = [](auto other) { 30| 9.45k| return [=](auto idx) { 31| 9.45k| return idx >= 0 && idx < var_count && idx != other; 32| 9.45k| }; 33| 9.45k| }; 34| 9.45k| auto is_valid_index = [](auto& v) { 35| 9.45k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 36| 9.45k| }; 37| 9.45k| auto is_valid_size = [](auto& v) { 38| 9.45k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 39| 9.45k| }; 40| 9.45k| auto can_concat = [](auto&& v1, auto&& v2) { 41| 9.45k| return v1.size() + v2.size() < vector_t::max_size(); 42| 9.45k| }; 43| 9.45k| auto can_compare = [](auto&& v) { 44| | // avoid comparing vectors that are too big, and hence, slow to compare 45| 9.45k| return v.size() < (1 << 15); 46| 9.45k| }; 47| 9.45k| return fuzzer_input{data, size}.run([&](auto& in) { 48| 9.45k| enum ops 49| 9.45k| { 50| 9.45k| op_push_back, 51| 9.45k| op_update, 52| 9.45k| op_take, 53| 9.45k| op_drop, 54| 9.45k| op_concat, 55| 9.45k| op_push_back_move, 56| 9.45k| op_update_move, 57| 9.45k| op_take_move, 58| 9.45k| op_drop_move, 59| 9.45k| op_concat_move_l, 60| 9.45k| op_concat_move_r, 61| 9.45k| op_concat_move_lr, 62| 9.45k| op_insert, 63| 9.45k| op_erase, 64| 9.45k| op_compare, 65| 9.45k| }; 66| 9.45k| auto src = read(in, is_valid_var); 67| 9.45k| auto dst = read(in, is_valid_var); 68| 9.45k| switch (read(in)) { 69| 9.45k| case op_push_back: { 70| 9.45k| vars[dst] = vars[src].push_back(42); 71| 9.45k| break; 72| 9.45k| } 73| 9.45k| case op_update: { 74| 9.45k| auto idx = read(in, is_valid_index(vars[src])); 75| 9.45k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 76| 9.45k| break; 77| 9.45k| } 78| 9.45k| case op_take: { 79| 9.45k| auto idx = read(in, is_valid_size(vars[src])); 80| 9.45k| vars[dst] = vars[src].take(idx); 81| 9.45k| break; 82| 9.45k| } 83| 9.45k| case op_drop: { 84| 9.45k| auto idx = read(in, is_valid_size(vars[src])); 85| 9.45k| vars[dst] = vars[src].drop(idx); 86| 9.45k| break; 87| 9.45k| } 88| 9.45k| case op_concat: { 89| 9.45k| auto src2 = read(in, is_valid_var); 90| 9.45k| if (can_concat(vars[src], vars[src2])) 91| 9.45k| vars[dst] = vars[src] + vars[src2]; 92| 9.45k| break; 93| 9.45k| } 94| 9.45k| case op_push_back_move: { 95| 9.45k| vars[dst] = std::move(vars[src]).push_back(21); 96| 9.45k| break; 97| 9.45k| } 98| 9.45k| case op_update_move: { 99| 9.45k| auto idx = read(in, is_valid_index(vars[src])); 100| 9.45k| vars[dst] = 101| 9.45k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 102| 9.45k| break; 103| 9.45k| } 104| 9.45k| case op_take_move: { 105| 9.45k| auto idx = read(in, is_valid_size(vars[src])); 106| 9.45k| vars[dst] = std::move(vars[src]).take(idx); 107| 9.45k| break; 108| 9.45k| } 109| 9.45k| case op_drop_move: { 110| 9.45k| auto idx = read(in, is_valid_size(vars[src])); 111| 9.45k| vars[dst] = std::move(vars[src]).drop(idx); 112| 9.45k| break; 113| 9.45k| } 114| 9.45k| case op_concat_move_l: { 115| 9.45k| auto src2 = read(in, is_valid_var_neq(src)); 116| 9.45k| if (can_concat(vars[src], vars[src2])) 117| 9.45k| vars[dst] = std::move(vars[src]) + vars[src2]; 118| 9.45k| break; 119| 9.45k| } 120| 9.45k| case op_concat_move_r: { 121| 9.45k| auto src2 = read(in, is_valid_var_neq(src)); 122| 9.45k| if (can_concat(vars[src], vars[src2])) 123| 9.45k| vars[dst] = vars[src] + std::move(vars[src2]); 124| 9.45k| break; 125| 9.45k| } 126| 9.45k| case op_concat_move_lr: { 127| 9.45k| auto src2 = read(in, is_valid_var_neq(src)); 128| 9.45k| if (can_concat(vars[src], vars[src2])) 129| 9.45k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 130| 9.45k| break; 131| 9.45k| } 132| 9.45k| case op_compare: { 133| 9.45k| using std::swap; 134| 9.45k| if (can_compare(vars[src]) && vars[src] == vars[dst]) 135| 9.45k| swap(vars[src], vars[dst]); 136| 9.45k| break; 137| 9.45k| } 138| 9.45k| case op_erase: { 139| 9.45k| auto idx = read(in, is_valid_index(vars[src])); 140| 9.45k| vars[dst] = vars[src].erase(idx); 141| 9.45k| break; 142| 9.45k| } 143| 9.45k| case op_insert: { 144| 9.45k| auto idx = read(in, is_valid_size(vars[src])); 145| 9.45k| vars[dst] = vars[src].insert(idx, immer::box{42}); 146| 9.45k| break; 147| 9.45k| } 148| 9.45k| default: 149| 9.45k| break; 150| 9.45k| }; 151| 9.45k| return true; 152| 9.45k| }); 153| 9.45k|} flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_: 47| 2.06M| return fuzzer_input{data, size}.run([&](auto& in) { 48| 2.06M| enum ops 49| 2.06M| { 50| 2.06M| op_push_back, 51| 2.06M| op_update, 52| 2.06M| op_take, 53| 2.06M| op_drop, 54| 2.06M| op_concat, 55| 2.06M| op_push_back_move, 56| 2.06M| op_update_move, 57| 2.06M| op_take_move, 58| 2.06M| op_drop_move, 59| 2.06M| op_concat_move_l, 60| 2.06M| op_concat_move_r, 61| 2.06M| op_concat_move_lr, 62| 2.06M| op_insert, 63| 2.06M| op_erase, 64| 2.06M| op_compare, 65| 2.06M| }; 66| 2.06M| auto src = read(in, is_valid_var); 67| 2.06M| auto dst = read(in, is_valid_var); 68| 2.06M| switch (read(in)) { 69| 433k| case op_push_back: { ------------------ | Branch (69:9): [True: 433k, False: 1.63M] ------------------ 70| 433k| vars[dst] = vars[src].push_back(42); 71| 433k| break; 72| 0| } 73| 121k| case op_update: { ------------------ | Branch (73:9): [True: 121k, False: 1.94M] ------------------ 74| 121k| auto idx = read(in, is_valid_index(vars[src])); 75| 121k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 76| 121k| break; 77| 0| } 78| 1.61k| case op_take: { ------------------ | Branch (78:9): [True: 1.61k, False: 2.06M] ------------------ 79| 1.61k| auto idx = read(in, is_valid_size(vars[src])); 80| 1.61k| vars[dst] = vars[src].take(idx); 81| 1.61k| break; 82| 0| } 83| 3.18k| case op_drop: { ------------------ | Branch (83:9): [True: 3.18k, False: 2.06M] ------------------ 84| 3.18k| auto idx = read(in, is_valid_size(vars[src])); 85| 3.18k| vars[dst] = vars[src].drop(idx); 86| 3.18k| 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: 924k, False: 40.3k] ------------------ 91| 924k| vars[dst] = vars[src] + vars[src2]; 92| 964k| break; 93| 0| } 94| 12.8k| case op_push_back_move: { ------------------ | Branch (94:9): [True: 12.8k, False: 2.05M] ------------------ 95| 12.8k| vars[dst] = std::move(vars[src]).push_back(21); 96| 12.8k| break; 97| 0| } 98| 58.1k| case op_update_move: { ------------------ | Branch (98:9): [True: 58.1k, False: 2.01M] ------------------ 99| 58.1k| auto idx = read(in, is_valid_index(vars[src])); 100| 58.1k| vars[dst] = 101| 58.1k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 102| 58.1k| break; 103| 0| } 104| 37.6k| case op_take_move: { ------------------ | Branch (104:9): [True: 37.6k, False: 2.03M] ------------------ 105| 37.6k| auto idx = read(in, is_valid_size(vars[src])); 106| 37.6k| vars[dst] = std::move(vars[src]).take(idx); 107| 37.6k| break; 108| 0| } 109| 41.2k| case op_drop_move: { ------------------ | Branch (109:9): [True: 41.2k, False: 2.02M] ------------------ 110| 41.2k| auto idx = read(in, is_valid_size(vars[src])); 111| 41.2k| vars[dst] = std::move(vars[src]).drop(idx); 112| 41.2k| break; 113| 0| } 114| 293k| case op_concat_move_l: { ------------------ | Branch (114:9): [True: 293k, False: 1.77M] ------------------ 115| 293k| auto src2 = read(in, is_valid_var_neq(src)); 116| 293k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (116:17): [True: 283k, False: 9.78k] ------------------ 117| 283k| vars[dst] = std::move(vars[src]) + vars[src2]; 118| 293k| break; 119| 0| } 120| 3.99k| case op_concat_move_r: { ------------------ | Branch (120:9): [True: 3.99k, False: 2.06M] ------------------ 121| 3.99k| auto src2 = read(in, is_valid_var_neq(src)); 122| 3.99k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (122:17): [True: 3.59k, False: 395] ------------------ 123| 3.59k| vars[dst] = vars[src] + std::move(vars[src2]); 124| 3.99k| break; 125| 0| } 126| 2.25k| case op_concat_move_lr: { ------------------ | Branch (126:9): [True: 2.25k, False: 2.06M] ------------------ 127| 2.25k| auto src2 = read(in, is_valid_var_neq(src)); 128| 2.25k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (128:17): [True: 1.62k, False: 631] ------------------ 129| 1.62k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 130| 2.25k| break; 131| 0| } 132| 34.0k| case op_compare: { ------------------ | Branch (132:9): [True: 34.0k, False: 2.03M] ------------------ 133| 34.0k| using std::swap; 134| 34.0k| if (can_compare(vars[src]) && vars[src] == vars[dst]) ------------------ | Branch (134:17): [True: 29.4k, False: 4.59k] | Branch (134:43): [True: 7.01k, False: 22.4k] ------------------ 135| 7.01k| swap(vars[src], vars[dst]); 136| 34.0k| break; 137| 0| } 138| 3.59k| case op_erase: { ------------------ | Branch (138:9): [True: 3.59k, False: 2.06M] ------------------ 139| 3.59k| auto idx = read(in, is_valid_index(vars[src])); 140| 3.59k| vars[dst] = vars[src].erase(idx); 141| 3.59k| break; 142| 0| } 143| 19.3k| case op_insert: { ------------------ | Branch (143:9): [True: 19.3k, False: 2.04M] ------------------ 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.4k| default: ------------------ | Branch (148:9): [True: 29.4k, False: 2.03M] ------------------ 149| 29.4k| break; 150| 2.06M| }; 151| 2.05M| return true; 152| 2.06M| }); flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_0clIcEEDaT_: 28| 5.43M| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; ------------------ | Branch (28:48): [True: 5.26M, False: 169k] | Branch (28:60): [True: 5.08M, 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| 277k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; ------------------ | Branch (35:39): [True: 277k, False: 0] | Branch (35:51): [True: 183k, False: 93.6k] ------------------ flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaRT_: 34| 183k| auto is_valid_index = [](auto& v) { 35| 183k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 36| 183k| }; flex-vector.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E_clIiEEDaS2_: 75| 121k| 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| 113k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; ------------------ | Branch (38:39): [True: 113k, False: 0] | Branch (38:51): [True: 102k, False: 10.4k] ------------------ flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaRT_: 37| 102k| auto is_valid_size = [](auto& v) { 38| 102k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 39| 102k| }; 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.26M| auto can_concat = [](auto&& v1, auto&& v2) { 41| 1.26M| return v1.size() + v2.size() < vector_t::max_size(); 42| 1.26M| }; flex-vector.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E0_clIiEEDaS2_: 101| 58.0k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); flex-vector.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_ENKUlS1_E_clIcEEDaS1_: 30| 340k| return [=](auto idx) { 31| 340k| return idx >= 0 && idx < var_count && idx != other; ------------------ | Branch (31:20): [True: 334k, False: 6.36k] | Branch (31:32): [True: 323k, False: 10.9k] | Branch (31:51): [True: 299k, False: 23.9k] ------------------ 32| 340k| }; flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_: 29| 299k| auto is_valid_var_neq = [](auto other) { 30| 299k| return [=](auto idx) { 31| 299k| return idx >= 0 && idx < var_count && idx != other; 32| 299k| }; 33| 299k| }; flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_5clIRN5immer11flex_vectorIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaOT_: 43| 34.0k| auto can_compare = [](auto&& v) { 44| | // avoid comparing vectors that are too big, and hence, slow to compare 45| 34.0k| return v.size() < (1 << 15); 46| 34.0k| }; flex-vector.cpp:_ZN12fuzzer_input3runIZ22LLVMFuzzerTestOneInputE3$_6EEiT_: 50| 9.45k| { 51| 9.45k| if (size_ > fuzzer_input_max_size) ------------------ | Branch (51:13): [True: 8, False: 9.44k] ------------------ 52| 8| return 0; 53| 9.44k| try { 54| 2.06M| while (step(*this)) ------------------ | Branch (54:20): [True: 2.05M, False: 9.44k] ------------------ 55| 2.05M| continue; 56| 9.44k| } catch (const no_more_input&) { 57| 9.44k| }; 58| 9.44k| return 0; 59| 9.44k| } flex-vector.cpp:_Z4readIcZ22LLVMFuzzerTestOneInputE3$_0ET_R12fuzzer_inputT0_: 70| 5.09M|{ 71| 5.09M| auto x = read(fz); 72| 5.44M| while (!cond(x)) ------------------ | Branch (72:12): [True: 350k, False: 5.09M] ------------------ 73| 350k| 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.23M| { 41| 8.23M| auto& p = const_cast(reinterpret_cast(data_)); 42| 8.23M| auto r = std::align(align, size, p, size_); 43| 8.23M| if (r == nullptr) ------------------ | Branch (43:13): [True: 9.44k, False: 8.22M] ------------------ 44| 9.44k| throw no_more_input{}; 45| 8.22M| return next(size); 46| 8.23M| } _ZN12fuzzer_input4nextEm: 30| 8.22M| { 31| 8.22M| if (size_ < size) ------------------ | Branch (31:13): [True: 0, False: 8.22M] ------------------ 32| 0| throw no_more_input{}; 33| 8.22M| auto r = data_; 34| 8.22M| data_ += size; 35| 8.22M| size_ -= size; 36| 8.22M| return r; 37| 8.22M| } 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| 183k|{ 71| 183k| auto x = read(fz); 72| 277k| while (!cond(x)) ------------------ | Branch (72:12): [True: 93.6k, False: 183k] ------------------ 73| 93.6k| x = read(fz); 74| 183k| return x; 75| 183k|} _Z4readIhERKT_R12fuzzer_input: 64| 390k|{ 65| 390k| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 390k|} 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| 102k|{ 71| 102k| auto x = read(fz); 72| 113k| while (!cond(x)) ------------------ | Branch (72:12): [True: 10.4k, False: 102k] ------------------ 73| 10.4k| x = read(fz); 74| 102k| return x; 75| 102k|} flex-vector.cpp:_Z4readIcZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_EUlS2_E_ES2_R12fuzzer_inputT0_: 70| 299k|{ 71| 299k| auto x = read(fz); 72| 340k| while (!cond(x)) ------------------ | Branch (72:12): [True: 41.2k, False: 299k] ------------------ 73| 41.2k| x = read(fz); 74| 299k| return x; 75| 299k|} _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2IiviEEOT_: 85| 19.2k| : impl_{detail::make(std::forward(arg))} 86| 19.2k| { 87| 19.2k| } _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderC2IJiEEEDpOT_: 47| 19.2k| : value(std::forward(args)...) 48| 19.2k| { 49| 19.2k| } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEcvRKiEv: 142| 19.2k| operator const T&() const { return get(); } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE3getEv: 139| 19.2k| 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.2k| { 132| 19.2k| if (impl_ && impl_->dec()) { ------------------ | Branch (132:13): [True: 19.2k, False: 0] | Branch (132:22): [True: 19.2k, False: 0] ------------------ 133| 19.2k| impl_->~holder(); 134| 19.2k| heap::deallocate(sizeof(holder), impl_); 135| 19.2k| } 136| 19.2k| } _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| 106M| { 171| 106M| return x.get_(type_t{}); 172| 106M| } _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| 106M| { 185| 106M| return n.get_(t); 186| 106M| } _ZNK5immer6detail3csl6memberINS_15refcount_policyENS1_7inheritINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEvE4typeEE4type4get_ENS1_6type_tIS3_EE: 128| 118M| 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| 12.3M| { 171| 12.3M| return x.get_(type_t{}); 172| 12.3M| } _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| 12.3M| { 185| 12.3M| return n.get_(t); 186| 12.3M| } _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| 11.6M| { 166| 11.6M| return x.get_(type_t{}); 167| 11.6M| } _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| 11.6M| { 180| 11.6M| return n.get_(t); 181| 11.6M| } _ZN5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 102| 28.8M| 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.1M| { 166| 17.1M| return x.get_(type_t{}); 167| 17.1M| } _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.1M| { 180| 17.1M| return n.get_(t); 181| 17.1M| } _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| 93.6k| { 171| 93.6k| return x.get_(type_t{}); 172| 93.6k| } _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| 93.6k| { 185| 93.6k| return n.get_(t); 186| 93.6k| } _ZNK5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 103| 93.6k| 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.51M| 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.51M| { 23| 5.51M| return x.dereference(); 24| 5.51M| } _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.56M| { 87| 5.56M| static_assert(std::is_base_of::value, 88| 5.56M| "must pass a derived thing"); 89| 5.56M| return *static_cast(this); 90| 5.56M| } _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| 237k| { 152| 237k| access_t::advance(derived(), n); 153| 237k| return derived(); 154| 237k| } _ZN5immer6detail20iterator_core_access7advanceIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEElEEDcOT_T0_: 46| 237k| { 47| 237k| return x.advance(d); 48| 237k| } _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| 8.78M| { 93| 8.78M| static_assert(std::is_base_of::value, 94| 8.78M| "must pass a derived thing"); 95| 8.78M| return *static_cast(this); 96| 8.78M| } _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.15M| { 120| 4.15M| access_t::increment(derived()); 121| 4.15M| return derived(); 122| 4.15M| } _ZN5immer6detail20iterator_core_access9incrementIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDcOT_: 28| 4.15M| { 29| 4.15M| return x.increment(); 30| 4.15M| } _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| 42.7k| { 165| 42.7k| auto tmp = derived(); 166| 42.7k| return tmp += n; 167| 42.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE17make_inner_n_intoEPvmj: 213| 3.24M| { 214| 3.24M| assert(n <= branches); ------------------ | Branch (214:9): [True: 3.24M, False: 0] ------------------ 215| 3.24M| assert(size >= sizeof_inner_n(n)); ------------------ | Branch (215:9): [True: 3.24M, False: 0] ------------------ 216| 3.24M| auto p = new (buffer) node_t; 217| 3.24M| p->impl.d.data.inner.relaxed = nullptr; 218| 3.24M|#if IMMER_TAGGED_NODE 219| 3.24M| p->impl.d.kind = node_t::kind_t::inner; 220| 3.24M|#endif 221| 3.24M| return p; 222| 3.24M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14sizeof_inner_nEj: 145| 13.0M| { 146| 13.0M| return keep_headroom ? max_sizeof_inner : sizeof_packed_inner_n(n); ------------------ | Branch (146:16): [True: 13.0M, Folded] ------------------ 147| 13.0M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE3incEv: 956| 28.5M| { 957| 28.5M| refs(this).inc(); 958| 28.5M| return this; 959| 28.5M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4refsEPKSB_: 203| 106M| { 204| 106M| return auto_const_cast(get(x->impl)); 205| 106M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE16make_leaf_n_intoEPvmj: 330| 1.33M| { 331| 1.33M| assert(n <= branches); ------------------ | Branch (331:9): [True: 1.33M, False: 0] ------------------ 332| 1.33M| assert(size >= sizeof_leaf_n(n)); ------------------ | Branch (332:9): [True: 1.33M, False: 0] ------------------ 333| 1.33M| auto p = new (buffer) node_t; 334| 1.33M|#if IMMER_TAGGED_NODE 335| 1.33M| p->impl.d.kind = node_t::kind_t::leaf; 336| 1.33M|#endif 337| 1.33M| return p; 338| 1.33M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13sizeof_leaf_nEj: 160| 5.58M| { 161| 5.58M| return keep_headroom ? max_sizeof_leaf : sizeof_packed_leaf_n(n); ------------------ | Branch (161:16): [True: 5.58M, Folded] ------------------ 162| 5.58M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7relaxedEv: 172| 170M| { 173| 170M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 170M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (173:9): [True: 170M, False: 0] ------------------ 174| 170M| return impl.d.data.inner.relaxed; 175| 170M| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4kindEv: 168| 326M| 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| 60.6M| bool dec() const { return refs(this).dec(); } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5innerEv: 184| 112M| { 185| 112M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 112M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (185:9): [True: 112M, False: 0] ------------------ 186| 112M| return impl.d.data.inner.get_storage_ptr(); 187| 112M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14delete_inner_rEPSB_j: 832| 11.8M| { 833| 11.8M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 11.8M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (833:9): [True: 11.8M, False: 0] ------------------ 834| 11.8M| auto r = p->relaxed(); 835| 11.8M| assert(r); ------------------ | Branch (835:9): [True: 11.8M, False: 0] ------------------ 836| 11.8M| static_if([&](auto) { 837| 11.8M| if (node_t::refs(r).dec()) 838| 11.8M| heap::deallocate(node_t::ownee(r).owned() 839| 11.8M| ? node_t::max_sizeof_relaxed 840| 11.8M| : node_t::sizeof_relaxed_n(n), 841| 11.8M| r); 842| 11.8M| }); 843| 11.8M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner_r ------------------ | Branch (843:26): [True: 0, False: 11.8M] ------------------ 844| 11.8M| : node_t::sizeof_inner_r_n(n), 845| 11.8M| p); 846| 11.8M| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14delete_inner_rEPSB_jENKUlT_E_clINS0_7empty_tEEEDaSD_: 836| 11.8M| static_if([&](auto) { 837| 11.8M| if (node_t::refs(r).dec()) ------------------ | Branch (837:17): [True: 11.5M, False: 300k] ------------------ 838| 11.5M| heap::deallocate(node_t::ownee(r).owned() ------------------ | Branch (838:34): [True: 0, False: 11.5M] ------------------ 839| 11.5M| ? node_t::max_sizeof_relaxed 840| 11.5M| : node_t::sizeof_relaxed_n(n), 841| 11.5M| r); 842| 11.8M| }); _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| 12.3M| { 197| 12.3M| return auto_const_cast(get(*x)); 198| 12.3M| } _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| 11.6M| 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| 22.8M| { 156| 22.8M| return keep_headroom ? max_sizeof_relaxed : sizeof_packed_relaxed_n(n); ------------------ | Branch (156:16): [True: 22.8M, Folded] ------------------ 157| 22.8M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5owneeEPSB_: 210| 17.1M| 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| 23.4M| { 151| 23.4M| return keep_headroom ? max_sizeof_inner_r : sizeof_packed_inner_r_n(n); ------------------ | Branch (151:16): [True: 23.4M, Folded] ------------------ 152| 23.4M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11delete_leafEPSB_j: 861| 1.56M| { 862| 1.56M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::leaf); ------------------ | | 68| 1.56M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (862:9): [True: 1.56M, False: 0] ------------------ 863| 1.56M| detail::destroy_n(p->leaf(), n); 864| 1.56M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_leaf ------------------ | Branch (864:26): [True: 0, False: 1.56M] ------------------ 865| 1.56M| : node_t::sizeof_leaf_n(n), 866| 1.56M| p); 867| 1.56M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4leafEv: 190| 11.0M| { 191| 11.0M| IMMER_ASSERT_TAGGED(kind() == kind_t::leaf); ------------------ | | 68| 11.0M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (191:9): [True: 11.0M, False: 0] ------------------ 192| 11.0M| return impl.d.data.leaf.get_storage_ptr(); 193| 11.0M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12delete_innerEPSB_j: 808| 3.34M| { 809| 3.34M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 3.34M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (809:9): [True: 3.34M, False: 0] ------------------ 810| 3.34M| assert(!p->relaxed()); ------------------ | Branch (810:9): [True: 3.34M, False: 0] ------------------ 811| 3.34M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner ------------------ | Branch (811:26): [True: 0, False: 3.34M] ------------------ 812| 3.34M| : node_t::sizeof_inner_n(n), 813| 3.34M| p); 814| 3.34M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE17copy_leaf_emplaceIiEEPSB_SD_jOT_: 794| 316k| { 795| 316k| auto dst = copy_leaf_n(n + 1, src, n); 796| 316k| IMMER_TRY { ------------------ | | 49| 316k|#define IMMER_TRY try ------------------ 797| 316k| new (dst->leaf() + n) T(std::forward(x)); 798| 316k| } 799| 316k| 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| 316k| return dst; 805| 316k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11copy_leaf_nEjPSB_j: 696| 316k| { 697| 316k| assert(allocn >= n); ------------------ | Branch (697:9): [True: 316k, False: 0] ------------------ 698| 316k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 316k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (698:9): [True: 316k, False: 0] ------------------ 699| 316k| auto dst = make_leaf_n(allocn); 700| 316k| IMMER_TRY { ------------------ | | 49| 316k|#define IMMER_TRY try ------------------ 701| 316k| detail::uninitialized_copy( 702| 316k| src->leaf(), src->leaf() + n, dst->leaf()); 703| 316k| } 704| 316k| 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| 316k| return dst; 709| 316k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_nEj: 341| 1.33M| { 342| 1.33M| assert(n <= branches); ------------------ | Branch (342:9): [True: 1.33M, False: 0] ------------------ 343| 1.33M| auto m = heap::allocate(sizeof_leaf_n(n)); 344| 1.33M| return make_leaf_n_into(m, sizeof_leaf_n(n), n); 345| 1.33M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_nIiEEPSB_jOT_: 470| 116k| { 471| 116k| assert(n >= 1); ------------------ | Branch (471:9): [True: 116k, False: 0] ------------------ 472| 116k| auto p = make_leaf_n(n); 473| 116k| IMMER_TRY { ------------------ | | 49| 116k|#define IMMER_TRY try ------------------ 474| 116k| new (p->leaf()) T(std::forward(x)); 475| 116k| } 476| 116k| 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| 116k| return p; 481| 116k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13do_copy_innerEPSB_SC_j: 558| 3.00M| { 559| 3.00M| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 3.00M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (559:9): [True: 3.00M, False: 0] ------------------ 560| 3.00M| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 3.00M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (560:9): [True: 3.00M, False: 0] ------------------ 561| 3.00M| auto p = src->inner(); 562| 3.00M| inc_nodes(p, n); 563| 3.00M| std::copy(p, p + n, dst->inner()); 564| 3.00M| return dst; 565| 3.00M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9inc_nodesEPPSB_j: 970| 9.16M| { 971| 24.4M| for (auto i = p, e = i + n; i != e; ++i) ------------------ | Branch (971:37): [True: 15.3M, False: 9.16M] ------------------ 972| 15.3M| refs(*i).inc(); 973| 9.16M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14copy_inner_r_nEjPSB_j: 588| 565k| { 589| 565k| assert(allocn >= n); ------------------ | Branch (589:9): [True: 565k, False: 0] ------------------ 590| 565k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 565k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (590:9): [True: 565k, False: 0] ------------------ 591| 565k| auto dst = make_inner_r_n(allocn); 592| 565k| return do_copy_inner_r(dst, src, n); 593| 565k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE15do_copy_inner_rEPSB_SC_j: 610| 589k| { 611| 589k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 589k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (611:9): [True: 589k, False: 0] ------------------ 612| 589k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 589k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (612:9): [True: 589k, False: 0] ------------------ 613| 589k| auto src_r = src->relaxed(); 614| 589k| auto dst_r = dst->relaxed(); 615| 589k| inc_nodes(src->inner(), n); 616| 589k| std::copy(src->inner(), src->inner() + n, dst->inner()); 617| 589k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 618| 589k| dst_r->d.count = n; 619| 589k| return dst; 620| 589k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14make_inner_r_nEj: 243| 11.3M| { 244| 11.3M| assert(n <= branches); ------------------ | Branch (244:9): [True: 11.3M, False: 0] ------------------ 245| 11.3M| auto mp = heap::allocate(sizeof_inner_r_n(n)); 246| 11.3M| auto mr = static_cast(nullptr); 247| 11.3M| if (embed_relaxed) { ------------------ | Branch (247:13): [Folded, False: 11.3M] ------------------ 248| 0| mr = reinterpret_cast(mp) + sizeof_inner_n(n); 249| 11.3M| } else { 250| 11.3M| IMMER_TRY { ------------------ | | 49| 11.3M|#define IMMER_TRY try ------------------ 251| 11.3M| mr = heap::allocate(sizeof_relaxed_n(n), norefs_tag{}); 252| 11.3M| } 253| 11.3M| 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| 11.3M| } 258| 11.3M| auto p = new (mp) node_t; 259| 11.3M| auto r = new (mr) relaxed_t; 260| 11.3M| r->d.count = 0; 261| 11.3M| p->impl.d.data.inner.relaxed = r; 262| 11.3M|#if IMMER_TAGGED_NODE 263| 11.3M| p->impl.d.kind = node_t::kind_t::inner; 264| 11.3M|#endif 265| 11.3M| return p; 266| 11.3M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9make_pathEjPSB_: 498| 814k| { 499| 814k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 814k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (499:9): [True: 814k, False: 0] ------------------ 500| 814k| if (shift == endshift) ------------------ | Branch (500:13): [True: 601k, False: 212k] ------------------ 501| 601k| return node; 502| 212k| else { 503| 212k| auto n = node_t::make_inner_n(1); 504| 212k| IMMER_TRY { ------------------ | | 49| 212k|#define IMMER_TRY try ------------------ 505| 212k| n->inner()[0] = make_path(shift - B, node); 506| 212k| } 507| 212k| 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| 212k| return n; 512| 212k| } 513| 814k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12make_inner_nEj: 224| 3.24M| { 225| 3.24M| assert(n <= branches); ------------------ | Branch (225:9): [True: 3.24M, False: 0] ------------------ 226| 3.24M| auto m = heap::allocate(sizeof_inner_n(n)); 227| 3.24M| return make_inner_n_into(m, sizeof_inner_n(n), n); 228| 3.24M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9copy_leafEPSB_j: 666| 131k| { 667| 131k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 131k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (667:9): [True: 131k, False: 0] ------------------ 668| 131k| auto dst = make_leaf_n(n); 669| 131k| IMMER_TRY { ------------------ | | 49| 131k|#define IMMER_TRY try ------------------ 670| 131k| detail::uninitialized_copy( 671| 131k| src->leaf(), src->leaf() + n, dst->leaf()); 672| 131k| } 673| 131k| 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| 131k| return dst; 678| 131k| } _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| 314k| { 270| 314k| return static_if( 271| 314k| [&](auto) { return node_t::make_inner_r_n(n); }, 272| 314k| [&](auto) { 273| 314k| auto p = 274| 314k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 314k| assert(r->d.count >= n); 276| 314k| node_t::refs(r).inc(); 277| 314k| p->impl.d.data.inner.relaxed = r; 278| 314k|#if IMMER_TAGGED_NODE 279| 314k| p->impl.d.kind = node_t::kind_t::inner; 280| 314k|#endif 281| 314k| return p; 282| 314k| }); 283| 314k| } _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| 314k| [&](auto) { 273| 314k| auto p = 274| 314k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 314k| assert(r->d.count >= n); ------------------ | Branch (275:17): [True: 314k, False: 0] ------------------ 276| 314k| node_t::refs(r).inc(); 277| 314k| p->impl.d.data.inner.relaxed = r; 278| 314k|#if IMMER_TAGGED_NODE 279| 314k| p->impl.d.kind = node_t::kind_t::inner; 280| 314k|#endif 281| 314k| return p; 282| 314k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE24do_copy_inner_replace_srEPSB_SC_jjSC_: 652| 314k| { 653| 314k| if (embed_relaxed) ------------------ | Branch (653:13): [Folded, False: 314k] ------------------ 654| 0| return do_copy_inner_replace_r(dst, src, n, offset, child); 655| 314k| else { 656| 314k| auto p = src->inner(); 657| 314k| inc_nodes(p, offset); 658| 314k| inc_nodes(p + offset + 1, n - offset - 1); 659| 314k| std::copy(p, p + n, dst->inner()); 660| 314k| dst->inner()[offset] = child; 661| 314k| return dst; 662| 314k| } 663| 314k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE21do_copy_inner_replaceEPSB_SC_jjSC_: 569| 49.3k| { 570| 49.3k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 49.3k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (570:9): [True: 49.3k, False: 0] ------------------ 571| 49.3k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 49.3k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (571:9): [True: 49.3k, False: 0] ------------------ 572| 49.3k| auto p = src->inner(); 573| 49.3k| inc_nodes(p, offset); 574| 49.3k| inc_nodes(p + offset + 1, n - offset - 1); 575| 49.3k| std::copy(p, p + n, dst->inner()); 576| 49.3k| dst->inner()[offset] = child; 577| 49.3k| return dst; 578| 49.3k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12copy_inner_nEjPSB_j: 543| 8.72k| { 544| 8.72k| assert(allocn >= n); ------------------ | Branch (544:9): [True: 8.72k, False: 0] ------------------ 545| 8.72k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 8.72k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (545:9): [True: 8.72k, False: 0] ------------------ 546| 8.72k| auto dst = make_inner_n(allocn); 547| 8.72k| return do_copy_inner(dst, src, n); 548| 8.72k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12copy_inner_rEPSB_j: 581| 4.56k| { 582| 4.56k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 4.56k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (582:9): [True: 4.56k, False: 0] ------------------ 583| 4.56k| auto dst = make_inner_r_n(n); 584| 4.56k| return do_copy_inner_r(dst, src, n); 585| 4.56k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13compute_shiftEv: 977| 5.00M| { 978| 5.00M| if (kind() == kind_t::leaf) ------------------ | Branch (978:13): [True: 439k, False: 4.56M] ------------------ 979| 439k| return endshift; 980| 4.56M| else 981| 4.56M| return B + inner()[0]->compute_shift(); 982| 5.00M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5checkEjm: 986| 439k| { 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| 439k| return true; 1023| 439k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9copy_leafEPSB_jj: 778| 365k| { 779| 365k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 365k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (779:9): [True: 365k, False: 0] ------------------ 780| 365k| auto dst = make_leaf_n(last - idx); 781| 365k| IMMER_TRY { ------------------ | | 49| 365k|#define IMMER_TRY try ------------------ 782| 365k| detail::uninitialized_copy( 783| 365k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 784| 365k| } 785| 365k| 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| 365k| return dst; 790| 365k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9copy_leafEPSB_jSC_j: 712| 355k| { 713| 355k| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 355k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (713:9): [True: 355k, False: 0] ------------------ 714| 355k| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 355k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (714:9): [True: 355k, False: 0] ------------------ 715| 355k| auto dst = make_leaf_n(n1 + n2); 716| 355k| IMMER_TRY { ------------------ | | 49| 355k|#define IMMER_TRY try ------------------ 717| 355k| detail::uninitialized_copy( 718| 355k| src1->leaf(), src1->leaf() + n1, dst->leaf()); 719| 355k| } 720| 355k| 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| 355k| IMMER_TRY { ------------------ | | 49| 355k|#define IMMER_TRY try ------------------ 725| 355k| detail::uninitialized_copy( 726| 355k| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 727| 355k| } 728| 355k| 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| 355k| return dst; 734| 355k| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10can_mutateENS9_5applyIS6_E4type4editE: 870| 1.84M| { 871| 1.84M| return refs(this).unique() || ownee(this).can_mutate(e); ------------------ | Branch (871:16): [True: 1.75M, False: 93.6k] | Branch (871:39): [True: 0, False: 93.6k] ------------------ 872| 1.84M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5owneeEPKSB_: 207| 93.6k| { 208| 93.6k| return get(x->impl); 209| 93.6k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_j: 681| 30.5k| { 682| 30.5k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 30.5k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (682:9): [True: 30.5k, False: 0] ------------------ 683| 30.5k| auto dst = make_leaf_e(e); 684| 30.5k| IMMER_TRY { ------------------ | | 49| 30.5k|#define IMMER_TRY try ------------------ 685| 30.5k| detail::uninitialized_copy( 686| 30.5k| src->leaf(), src->leaf() + n, dst->leaf()); 687| 30.5k| } 688| 30.5k| 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| 30.5k| return dst; 693| 30.5k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_eENS9_5applyIS6_E4type4editE: 348| 225k| { 349| 225k| auto p = new (heap::allocate(max_sizeof_leaf)) node_t; 350| 225k| ownee(p) = e; 351| 225k|#if IMMER_TAGGED_NODE 352| 225k| p->impl.d.kind = node_t::kind_t::leaf; 353| 225k|#endif 354| 225k| return p; 355| 225k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_eIiEEPSB_NS9_5applyIS6_E4type4editEOT_: 485| 14.0k| { 486| 14.0k| auto p = make_leaf_e(e); 487| 14.0k| IMMER_TRY { ------------------ | | 49| 14.0k|#define IMMER_TRY try ------------------ 488| 14.0k| new (p->leaf()) T(std::forward(x)); 489| 14.0k| } 490| 14.0k| 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| 14.0k| return p; 495| 14.0k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEj: 930| 83.0k| { 931| 83.0k| auto src_r = relaxed(); 932| 83.0k| return static_if( 933| 83.0k| [&](auto) { return src_r; }, 934| 83.0k| [&](auto) { 935| 83.0k| if (node_t::refs(src_r).unique() || 936| 83.0k| node_t::ownee(src_r).can_mutate(e)) 937| 83.0k| return src_r; 938| 83.0k| else { 939| 83.0k| auto dst_r = 940| 83.0k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 83.0k| if (src_r) { 942| 83.0k| std::copy( 943| 83.0k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 83.0k| if (node_t::refs(src_r).dec()) 945| 83.0k| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 83.0k| src_r); 947| 83.0k| } 948| 83.0k| dst_r->d.count = n; 949| 83.0k| node_t::ownee(dst_r) = e; 950| 83.0k| return impl.d.data.inner.relaxed = dst_r; 951| 83.0k| } 952| 83.0k| }); 953| 83.0k| } _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| 83.0k| [&](auto) { 935| 83.0k| if (node_t::refs(src_r).unique() || ------------------ | Branch (935:21): [True: 70.7k, False: 12.2k] ------------------ 936| 12.2k| node_t::ownee(src_r).can_mutate(e)) ------------------ | Branch (936:21): [True: 0, False: 12.2k] ------------------ 937| 70.7k| return src_r; 938| 12.2k| else { 939| 12.2k| auto dst_r = 940| 12.2k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 12.2k| if (src_r) { ------------------ | Branch (941:25): [True: 12.2k, False: 0] ------------------ 942| 12.2k| std::copy( 943| 12.2k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 12.2k| if (node_t::refs(src_r).dec()) ------------------ | Branch (944:29): [True: 0, False: 12.2k] ------------------ 945| 0| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 0| src_r); 947| 12.2k| } 948| 12.2k| dst_r->d.count = n; 949| 12.2k| node_t::ownee(dst_r) = e; 950| 12.2k| return impl.d.data.inner.relaxed = dst_r; 951| 12.2k| } 952| 83.0k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14copy_inner_r_eENS9_5applyIS6_E4type4editEPSB_j: 596| 19.0k| { 597| 19.0k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 19.0k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (597:9): [True: 19.0k, False: 0] ------------------ 598| 19.0k| auto dst = make_inner_r_e(e); 599| 19.0k| return do_copy_inner_r(dst, src, n); 600| 19.0k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14make_inner_r_eENS9_5applyIS6_E4type4editE: 286| 119k| { 287| 119k| auto mp = heap::allocate(max_sizeof_inner_r); 288| 119k| auto mr = static_cast(nullptr); 289| 119k| if (embed_relaxed) { ------------------ | Branch (289:13): [Folded, False: 119k] ------------------ 290| 0| mr = reinterpret_cast(mp) + max_sizeof_inner; 291| 119k| } else { 292| 119k| IMMER_TRY { ------------------ | | 49| 119k|#define IMMER_TRY try ------------------ 293| 119k| mr = heap::allocate(max_sizeof_relaxed, norefs_tag{}); 294| 119k| } 295| 119k| IMMER_CATCH (...) { 296| 0| heap::deallocate(max_sizeof_inner_r, mp); 297| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 298| 0| } 299| 119k| } 300| 119k| auto p = new (mp) node_t; 301| 119k| auto r = new (mr) relaxed_t; 302| 119k| ownee(p) = e; 303| 119k| static_if([&](auto) { node_t::ownee(r) = e; }); 304| 119k| r->d.count = 0; 305| 119k| p->impl.d.data.inner.relaxed = r; 306| 119k|#if IMMER_TAGGED_NODE 307| 119k| p->impl.d.kind = node_t::kind_t::inner; 308| 119k|#endif 309| 119k| return p; 310| 119k| } _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| 119k| 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| 293k| { 517| 293k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 293k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (517:9): [True: 293k, False: 0] ------------------ 518| 293k| if (shift == endshift) ------------------ | Branch (518:13): [True: 218k, False: 74.2k] ------------------ 519| 218k| return node; 520| 74.2k| else { 521| 74.2k| auto n = node_t::make_inner_e(e); 522| 74.2k| IMMER_TRY { ------------------ | | 49| 74.2k|#define IMMER_TRY try ------------------ 523| 74.2k| n->inner()[0] = make_path_e(e, shift - B, node); 524| 74.2k| } 525| 74.2k| IMMER_CATCH (...) { 526| 0| heap::deallocate(node_t::max_sizeof_inner, n); 527| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 528| 0| } 529| 74.2k| return n; 530| 74.2k| } 531| 293k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12make_inner_eENS9_5applyIS6_E4type4editE: 231| 99.0k| { 232| 99.0k| auto m = heap::allocate(max_sizeof_inner); 233| 99.0k| auto p = new (m) node_t; 234| 99.0k| ownee(p) = e; 235| 99.0k| p->impl.d.data.inner.relaxed = nullptr; 236| 99.0k|#if IMMER_TAGGED_NODE 237| 99.0k| p->impl.d.kind = node_t::kind_t::inner; 238| 99.0k|#endif 239| 99.0k| return p; 240| 99.0k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12copy_inner_eENS9_5applyIS6_E4type4editEPSB_j: 551| 15.5k| { 552| 15.5k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 15.5k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (552:9): [True: 15.5k, False: 0] ------------------ 553| 15.5k| auto dst = make_inner_e(e); 554| 15.5k| return do_copy_inner(dst, src, n); 555| 15.5k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE15copy_inner_sr_eENS9_5applyIS6_E4type4editEPSB_j: 603| 9.75k| { 604| 9.75k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 9.75k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (604:9): [True: 9.75k, False: 0] ------------------ 605| 9.75k| auto dst = make_inner_sr_e(e, src->relaxed()); 606| 9.75k| return do_copy_inner_sr(dst, src, n); 607| 9.75k| } _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| 9.75k| { 314| 9.75k| return static_if( 315| 9.75k| [&](auto) { return node_t::make_inner_r_e(e); }, 316| 9.75k| [&](auto) { 317| 9.75k| auto p = 318| 9.75k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 9.75k| node_t::refs(r).inc(); 320| 9.75k| p->impl.d.data.inner.relaxed = r; 321| 9.75k| node_t::ownee(p) = e; 322| 9.75k|#if IMMER_TAGGED_NODE 323| 9.75k| p->impl.d.kind = node_t::kind_t::inner; 324| 9.75k|#endif 325| 9.75k| return p; 326| 9.75k| }); 327| 9.75k| } _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| 9.75k| [&](auto) { 317| 9.75k| auto p = 318| 9.75k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 9.75k| node_t::refs(r).inc(); 320| 9.75k| p->impl.d.data.inner.relaxed = r; 321| 9.75k| node_t::ownee(p) = e; 322| 9.75k|#if IMMER_TAGGED_NODE 323| 9.75k| p->impl.d.kind = node_t::kind_t::inner; 324| 9.75k|#endif 325| 9.75k| return p; 326| 9.75k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE16do_copy_inner_srEPSB_SC_j: 640| 9.75k| { 641| 9.75k| if (embed_relaxed) ------------------ | Branch (641:13): [Folded, False: 9.75k] ------------------ 642| 0| return do_copy_inner_r(dst, src, n); 643| 9.75k| else { 644| 9.75k| inc_nodes(src->inner(), n); 645| 9.75k| std::copy(src->inner(), src->inner() + n, dst->inner()); 646| 9.75k| return dst; 647| 9.75k| } 648| 9.75k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jj: 763| 180k| { 764| 180k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 180k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (764:9): [True: 180k, False: 0] ------------------ 765| 180k| auto dst = make_leaf_e(e); 766| 180k| IMMER_TRY { ------------------ | | 49| 180k|#define IMMER_TRY try ------------------ 767| 180k| detail::uninitialized_copy( 768| 180k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 769| 180k| } 770| 180k| IMMER_CATCH (...) { 771| 0| heap::deallocate(max_sizeof_leaf, dst); 772| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 773| 0| } 774| 180k| return dst; 775| 180k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE22ensure_mutable_relaxedENS9_5applyIS6_E4type4editE: 877| 144k| { 878| 144k| auto src_r = relaxed(); 879| 144k| return static_if( 880| 144k| [&](auto) { return src_r; }, 881| 144k| [&](auto) { 882| 144k| if (node_t::refs(src_r).unique() || 883| 144k| node_t::ownee(src_r).can_mutate(e)) 884| 144k| return src_r; 885| 144k| else { 886| 144k| auto dst_r = impl.d.data.inner.relaxed = 887| 144k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 144k| if (src_r) { 889| 144k| auto n = dst_r->d.count = src_r->d.count; 890| 144k| std::copy( 891| 144k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 144k| if (node_t::refs(src_r).dec()) 893| 144k| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 144k| src_r); 895| 144k| } 896| 144k| node_t::ownee(dst_r) = e; 897| 144k| return dst_r; 898| 144k| } 899| 144k| }); 900| 144k| } _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| 144k| [&](auto) { 882| 144k| if (node_t::refs(src_r).unique() || ------------------ | Branch (882:21): [True: 133k, False: 11.3k] ------------------ 883| 11.3k| node_t::ownee(src_r).can_mutate(e)) ------------------ | Branch (883:21): [True: 0, False: 11.3k] ------------------ 884| 133k| return src_r; 885| 11.3k| else { 886| 11.3k| auto dst_r = impl.d.data.inner.relaxed = 887| 11.3k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 11.3k| if (src_r) { ------------------ | Branch (888:25): [True: 11.3k, False: 0] ------------------ 889| 11.3k| auto n = dst_r->d.count = src_r->d.count; 890| 11.3k| std::copy( 891| 11.3k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 11.3k| if (node_t::refs(src_r).dec()) ------------------ | Branch (892:29): [True: 0, False: 11.3k] ------------------ 893| 0| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 0| src_r); 895| 11.3k| } 896| 11.3k| node_t::ownee(dst_r) = e; 897| 11.3k| return dst_r; 898| 11.3k| } 899| 144k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jSG_j: 738| 381| { 739| 381| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 381|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (739:9): [True: 381, False: 0] ------------------ 740| 381| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 381|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (740:9): [True: 381, False: 0] ------------------ 741| 381| auto dst = make_leaf_e(e); 742| 381| IMMER_TRY { ------------------ | | 49| 381|#define IMMER_TRY try ------------------ 743| 381| detail::uninitialized_copy( 744| 381| src1->leaf(), src1->leaf() + n1, dst->leaf()); 745| 381| } 746| 381| IMMER_CATCH (...) { 747| 0| heap::deallocate(max_sizeof_leaf, dst); 748| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 749| 0| } 750| 381| IMMER_TRY { ------------------ | | 49| 381|#define IMMER_TRY try ------------------ 751| 381| detail::uninitialized_copy( 752| 381| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 753| 381| } 754| 381| 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| 381| return dst; 760| 381| } _ZN5immer6detail4rbts11dec_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 523| 36.0M| { 524| 36.0M| using node_t = node_type; 525| 36.0M| auto node = p.node(); 526| 36.0M| if (node->dec()) { ------------------ | Branch (526:13): [True: 11.7M, False: 24.3M] ------------------ 527| 11.7M| p.each(this_t{}); 528| 11.7M| node_t::delete_inner_r(node, p.count()); 529| 11.7M| } 530| 36.0M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 534| 2.51M| { 535| 2.51M| using node_t = node_type; 536| 2.51M| auto node = p.node(); 537| 2.51M| if (node->dec()) { ------------------ | Branch (537:13): [True: 639k, False: 1.87M] ------------------ 538| 639k| p.each(this_t{}); 539| 639k| node_t::delete_inner(node, p.count()); 540| 639k| } 541| 2.51M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 545| 1.29M| { 546| 1.29M| using node_t = node_type; 547| 1.29M| auto node = p.node(); 548| 1.29M| if (node->dec()) { ------------------ | Branch (548:13): [True: 588k, False: 709k] ------------------ 549| 588k| node_t::delete_leaf(node, p.count()); 550| 588k| } 551| 1.29M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 545| 508k| { 546| 508k| using node_t = node_type; 547| 508k| auto node = p.node(); 548| 508k| if (node->dec()) { ------------------ | Branch (548:13): [True: 20.8k, False: 487k] ------------------ 549| 20.8k| node_t::delete_leaf(node, p.count()); 550| 20.8k| } 551| 508k| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 534| 3.75M| { 535| 3.75M| using node_t = node_type; 536| 3.75M| auto node = p.node(); 537| 3.75M| if (node->dec()) { ------------------ | Branch (537:13): [True: 248k, False: 3.51M] ------------------ 538| 248k| p.each(this_t{}); 539| 248k| node_t::delete_inner(node, p.count()); 540| 248k| } 541| 3.75M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 534| 2.58M| { 535| 2.58M| using node_t = node_type; 536| 2.58M| auto node = p.node(); 537| 2.58M| if (node->dec()) { ------------------ | Branch (537:13): [True: 2.43M, False: 145k] ------------------ 538| 2.43M| p.each(this_t{}); 539| 2.43M| node_t::delete_inner(node, p.count()); 540| 2.43M| } 541| 2.58M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 534| 1.73M| { 535| 1.73M| using node_t = node_type; 536| 1.73M| auto node = p.node(); 537| 1.73M| if (node->dec()) { ------------------ | Branch (537:13): [True: 0, False: 1.73M] ------------------ 538| 0| p.each(this_t{}); 539| 0| node_t::delete_inner(node, p.count()); 540| 0| } 541| 1.73M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 545| 10.4M| { 546| 10.4M| using node_t = node_type; 547| 10.4M| auto node = p.node(); 548| 10.4M| if (node->dec()) { ------------------ | Branch (548:13): [True: 955k, False: 9.46M] ------------------ 549| 955k| node_t::delete_leaf(node, p.count()); 550| 955k| } 551| 10.4M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 545| 1.64M| { 546| 1.64M| using node_t = node_type; 547| 1.64M| auto node = p.node(); 548| 1.64M| if (node->dec()) { ------------------ | Branch (548:13): [True: 0, False: 1.64M] ------------------ 549| 0| node_t::delete_leaf(node, p.count()); 550| 0| } 551| 1.64M| } _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| 560k| { 792| 560k| auto level = pos.shift(); 793| 560k| auto idx = pos.count() - 1; 794| 560k| auto children = pos.size(idx); 795| 560k| auto new_idx = 796| 560k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (796:13): [True: 13.4k, False: 547k] | Branch (796:47): [True: 636, False: 546k] ------------------ 797| 560k| auto new_child = static_cast(nullptr); 798| 560k| if (new_idx >= branches) ------------------ | Branch (798:13): [True: 4.99k, False: 555k] ------------------ 799| 4.99k| return nullptr; 800| 555k| else if (idx == new_idx) { ------------------ | Branch (800:18): [True: 546k, False: 9.08k] ------------------ 801| 546k| new_child = pos.last_oh_csh(this_t{}, idx, children, tail, ts); 802| 546k| if (!new_child) { ------------------ | Branch (802:17): [True: 4.23k, False: 542k] ------------------ 803| 4.23k| if (++new_idx < branches) ------------------ | Branch (803:21): [True: 3.05k, False: 1.17k] ------------------ 804| 3.05k| new_child = node_t::make_path(level - B, tail); 805| 1.17k| else 806| 1.17k| return nullptr; 807| 4.23k| } 808| 546k| } else 809| 9.08k| new_child = node_t::make_path(level - B, tail); 810| 554k| IMMER_TRY { ------------------ | | 49| 554k|#define IMMER_TRY try ------------------ 811| 554k| auto count = new_idx + 1; 812| 554k| auto new_parent = 813| 554k| node_t::copy_inner_r_n(count, pos.node(), new_idx); 814| 554k| auto new_relaxed = new_parent->relaxed(); 815| 554k| new_parent->inner()[new_idx] = new_child; 816| 554k| new_relaxed->d.sizes[new_idx] = pos.size() + ts; 817| 554k| new_relaxed->d.count = count; 818| 554k| assert(new_relaxed->d.sizes[new_idx]); ------------------ | Branch (818:13): [True: 554k, False: 0] ------------------ 819| 554k| return new_parent; 820| 554k| } 821| 554k| 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| 554k| } _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| 201k| { 835| 201k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 201k, False: 0] ------------------ 836| 201k| auto idx = pos.index(pos.size() - 1); 837| 201k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 201k| auto count = new_idx + 1; 839| 201k| auto new_parent = node_t::make_inner_n(count); 840| 201k| IMMER_TRY { ------------------ | | 49| 201k|#define IMMER_TRY try ------------------ 841| 201k| new_parent->inner()[new_idx] = 842| 201k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 193k, False: 7.73k] ------------------ 843| | /* otherwise */ 844| 201k| : node_t::make_path(pos.shift() - B, tail); 845| 201k| } 846| 201k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 201k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 201k| } _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.40M| { 835| 2.40M| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 2.40M, False: 0] ------------------ 836| 2.40M| auto idx = pos.index(pos.size() - 1); 837| 2.40M| auto new_idx = pos.index(pos.size() + branches - 1); 838| 2.40M| auto count = new_idx + 1; 839| 2.40M| auto new_parent = node_t::make_inner_n(count); 840| 2.40M| IMMER_TRY { ------------------ | | 49| 2.40M|#define IMMER_TRY try ------------------ 841| 2.40M| new_parent->inner()[new_idx] = 842| 2.40M| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 1.85M, False: 548k] ------------------ 843| | /* otherwise */ 844| 2.40M| : node_t::make_path(pos.shift() - B, tail); 845| 2.40M| } 846| 2.40M| 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.40M| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 2.40M| } _ZN5immer6detail4rbts9dec_innerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEvPT_jm: 562| 514|{ 563| 514| visit_maybe_relaxed_sub(node, shift, size, dec_visitor()); 564| 514|} _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| 370k| { 835| 370k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 370k, False: 0] ------------------ 836| 370k| auto idx = pos.index(pos.size() - 1); 837| 370k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 370k| auto count = new_idx + 1; 839| 370k| auto new_parent = node_t::make_inner_n(count); 840| 370k| IMMER_TRY { ------------------ | | 49| 370k|#define IMMER_TRY try ------------------ 841| 370k| new_parent->inner()[new_idx] = 842| 370k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 355k, False: 15.1k] ------------------ 843| | /* otherwise */ 844| 370k| : node_t::make_path(pos.shift() - B, tail); 845| 370k| } 846| 370k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 370k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 370k| } 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| 91.0k| { 503| 91.0k| auto offset = pos.index(idx); 504| 91.0k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 91.0k| IMMER_TRY { ------------------ | | 49| 91.0k|#define IMMER_TRY try ------------------ 506| 91.0k| node->leaf()[offset] = 507| 91.0k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 91.0k| return node; 509| 91.0k| } 510| 91.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| 91.0k| } 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| 314k| { 467| 314k| auto offset = pos.index(idx); 468| 314k| auto count = pos.count(); 469| 314k| auto node = node_t::make_inner_sr_n(count, pos.relaxed()); 470| 314k| IMMER_TRY { ------------------ | | 49| 314k|#define IMMER_TRY try ------------------ 471| 314k| auto child = pos.towards_oh(this_t{}, idx, offset, fn); 472| 314k| node_t::do_copy_inner_replace_sr( 473| 314k| node, pos.node(), count, offset, child); 474| 314k| return node; 475| 314k| } 476| 314k| IMMER_CATCH (...) { 477| 0| node_t::delete_inner_r(node, count); 478| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 479| 0| } 480| 314k| } 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| 30.8k| { 485| 30.8k| auto offset = pos.index(idx); 486| 30.8k| auto count = pos.count(); 487| 30.8k| auto node = node_t::make_inner_n(count); 488| 30.8k| IMMER_TRY { ------------------ | | 49| 30.8k|#define IMMER_TRY try ------------------ 489| 30.8k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 30.8k| node_t::do_copy_inner_replace( 491| 30.8k| node, pos.node(), count, offset, child); 492| 30.8k| return node; 493| 30.8k| } 494| 30.8k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 30.8k| } 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| 25.9k| { 503| 25.9k| auto offset = pos.index(idx); 504| 25.9k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 25.9k| IMMER_TRY { ------------------ | | 49| 25.9k|#define IMMER_TRY try ------------------ 506| 25.9k| node->leaf()[offset] = 507| 25.9k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 25.9k| return node; 509| 25.9k| } 510| 25.9k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 25.9k| } 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| 15.5k| { 485| 15.5k| auto offset = pos.index(idx); 486| 15.5k| auto count = pos.count(); 487| 15.5k| auto node = node_t::make_inner_n(count); 488| 15.5k| IMMER_TRY { ------------------ | | 49| 15.5k|#define IMMER_TRY try ------------------ 489| 15.5k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 15.5k| node_t::do_copy_inner_replace( 491| 15.5k| node, pos.node(), count, offset, child); 492| 15.5k| return node; 493| 15.5k| } 494| 15.5k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 15.5k| } 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| 4.89k| { 503| 4.89k| auto offset = pos.index(idx); 504| 4.89k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 4.89k| IMMER_TRY { ------------------ | | 49| 4.89k|#define IMMER_TRY try ------------------ 506| 4.89k| node->leaf()[offset] = 507| 4.89k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 4.89k| return node; 509| 4.89k| } 510| 4.89k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 4.89k| } 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| 2.91k| { 485| 2.91k| auto offset = pos.index(idx); 486| 2.91k| auto count = pos.count(); 487| 2.91k| auto node = node_t::make_inner_n(count); 488| 2.91k| IMMER_TRY { ------------------ | | 49| 2.91k|#define IMMER_TRY try ------------------ 489| 2.91k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 2.91k| node_t::do_copy_inner_replace( 491| 2.91k| node, pos.node(), count, offset, child); 492| 2.91k| return node; 493| 2.91k| } 494| 2.91k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 2.91k| } _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| 31.2k| { 1097| 31.2k| auto idx = pos.index(last); 1098| 31.2k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [True: 31.2k, Folded] | Branch (1098:25): [True: 22.1k, False: 9.14k] ------------------ 1099| 22.1k| return pos.towards_oh(this_t{}, last, idx); 1100| 22.1k| } else { 1101| 9.14k| using std::get; 1102| 9.14k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 9.14k| auto next = get<1>(subs); 1104| 9.14k| auto ts = get<2>(subs); 1105| 9.14k| auto tail = get<3>(subs); 1106| 9.14k| IMMER_TRY { ------------------ | | 49| 9.14k|#define IMMER_TRY try ------------------ 1107| 9.14k| if (next) { ------------------ | Branch (1107:21): [True: 4.70k, False: 4.43k] ------------------ 1108| 4.70k| auto count = idx + 1; 1109| 4.70k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 4.70k| auto newr = newn->relaxed(); 1111| 4.70k| newn->inner()[idx] = next; 1112| 4.70k| newr->d.sizes[idx] = last + 1 - ts; 1113| 4.70k| newr->d.count = count; 1114| 4.70k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 4.70k, False: 0] ------------------ 1115| 4.70k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 4.70k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 0, False: 4.43k] ------------------ 1117| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 4.43k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [True: 4.43k, Folded] | Branch (1118:40): [True: 3.30k, False: 1.13k] | Branch (1118:52): [True: 2.54k, False: 753] ------------------ 1119| 2.54k| auto newn = pos.node()->inner()[0]; 1120| 2.54k| return std::make_tuple( 1121| 2.54k| pos.shift() - B, newn->inc(), ts, tail); 1122| 2.54k| } else { 1123| 1.88k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 1.88k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 1.88k| } 1126| 9.14k| } 1127| 9.14k| 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| 9.14k| } 1138| 31.2k| } _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| 1.92k| { 1182| 1.92k| auto old_tail_size = pos.count(); 1183| 1.92k| auto new_tail_size = pos.index(last) + 1; 1184| 1.92k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 961, False: 964] ------------------ 1185| 1.92k| ? pos.node()->inc() 1186| 1.92k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.92k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.92k| } _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.03k| { 1182| 5.03k| auto old_tail_size = pos.count(); 1183| 5.03k| auto new_tail_size = pos.index(last) + 1; 1184| 5.03k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 2.44k, False: 2.59k] ------------------ 1185| 5.03k| ? pos.node()->inc() 1186| 5.03k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 5.03k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 5.03k| } _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.9k| { 1097| 11.9k| auto idx = pos.index(last); 1098| 11.9k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [Folded, False: 11.9k] | Branch (1098:25): [True: 0, False: 0] ------------------ 1099| 0| return pos.towards_oh(this_t{}, last, idx); 1100| 11.9k| } else { 1101| 11.9k| using std::get; 1102| 11.9k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 11.9k| auto next = get<1>(subs); 1104| 11.9k| auto ts = get<2>(subs); 1105| 11.9k| auto tail = get<3>(subs); 1106| 11.9k| IMMER_TRY { ------------------ | | 49| 11.9k|#define IMMER_TRY try ------------------ 1107| 11.9k| if (next) { ------------------ | Branch (1107:21): [True: 6.45k, False: 5.48k] ------------------ 1108| 6.45k| auto count = idx + 1; 1109| 6.45k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 6.45k| auto newr = newn->relaxed(); 1111| 6.45k| newn->inner()[idx] = next; 1112| 6.45k| newr->d.sizes[idx] = last + 1 - ts; 1113| 6.45k| newr->d.count = count; 1114| 6.45k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 6.45k, False: 0] ------------------ 1115| 6.45k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 6.45k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 2.80k, False: 2.68k] ------------------ 1117| 2.80k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 2.80k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [Folded, False: 2.68k] | 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.68k| } else { 1123| 2.68k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 2.68k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 2.68k| } 1126| 11.9k| } 1127| 11.9k| 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.9k| } 1138| 11.9k| } _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| 4.10k| { 1143| 4.10k| auto idx = pos.index(last); 1144| 4.10k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 4.10k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 4.10k| } else { 1147| 4.10k| using std::get; 1148| 4.10k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 4.10k| auto next = get<1>(subs); 1150| 4.10k| auto ts = get<2>(subs); 1151| 4.10k| auto tail = get<3>(subs); 1152| 4.10k| IMMER_TRY { ------------------ | | 49| 4.10k|#define IMMER_TRY try ------------------ 1153| 4.10k| if (next) { ------------------ | Branch (1153:21): [True: 1.33k, False: 2.77k] ------------------ 1154| 1.33k| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 1.33k| newn->inner()[idx] = next; 1156| 1.33k| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.77k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 2.08k, False: 692] ------------------ 1158| 2.08k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 2.08k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 692] | 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| 692| } else { 1164| 692| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 692| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 692| } 1167| 4.10k| } 1168| 4.10k| 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.10k| } 1177| 4.10k| } _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| 6.44k| { 1182| 6.44k| auto old_tail_size = pos.count(); 1183| 6.44k| auto new_tail_size = pos.index(last) + 1; 1184| 6.44k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 4.18k, False: 2.25k] ------------------ 1185| 6.44k| ? pos.node()->inc() 1186| 6.44k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 6.44k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 6.44k| } _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.47k| { 1143| 2.47k| auto idx = pos.index(last); 1144| 2.47k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.47k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.47k| } else { 1147| 2.47k| using std::get; 1148| 2.47k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.47k| auto next = get<1>(subs); 1150| 2.47k| auto ts = get<2>(subs); 1151| 2.47k| auto tail = get<3>(subs); 1152| 2.47k| IMMER_TRY { ------------------ | | 49| 2.47k|#define IMMER_TRY try ------------------ 1153| 2.47k| if (next) { ------------------ | Branch (1153:21): [True: 313, False: 2.16k] ------------------ 1154| 313| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 313| newn->inner()[idx] = next; 1156| 313| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.16k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 1.35k, False: 815] ------------------ 1158| 1.35k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.35k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 815] | 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| 815| } else { 1164| 815| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 815| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 815| } 1167| 2.47k| } 1168| 2.47k| 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.47k| } 1177| 2.47k| } _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.44k| { 1182| 2.44k| auto old_tail_size = pos.count(); 1183| 2.44k| auto new_tail_size = pos.index(last) + 1; 1184| 2.44k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.39k, False: 1.05k] ------------------ 1185| 2.44k| ? pos.node()->inc() 1186| 2.44k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 2.44k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 2.44k| } _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.96k| { 1143| 4.96k| auto idx = pos.index(last); 1144| 4.96k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 4.96k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 4.96k| } else { 1147| 4.96k| using std::get; 1148| 4.96k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 4.96k| auto next = get<1>(subs); 1150| 4.96k| auto ts = get<2>(subs); 1151| 4.96k| auto tail = get<3>(subs); 1152| 4.96k| IMMER_TRY { ------------------ | | 49| 4.96k|#define IMMER_TRY try ------------------ 1153| 4.96k| if (next) { ------------------ | Branch (1153:21): [True: 1.00k, False: 3.96k] ------------------ 1154| 1.00k| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 1.00k| newn->inner()[idx] = next; 1156| 1.00k| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 3.96k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 2.18k, False: 1.77k] ------------------ 1158| 2.18k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 2.18k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 1.77k] | 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.77k| } else { 1164| 1.77k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.77k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.77k| } 1167| 4.96k| } 1168| 4.96k| 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.96k| } 1177| 4.96k| } _ZN5immer6detail4rbts8dec_leafINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEvPT_j: 556| 39.8k|{ 557| 39.8k| make_leaf_sub_pos(node, n).visit(dec_visitor{}); 558| 39.8k|} _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.85k| { 1143| 6.85k| auto idx = pos.index(last); 1144| 6.85k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 6.85k, Folded] | Branch (1144:25): [True: 3.43k, False: 3.42k] ------------------ 1145| 3.43k| return pos.towards_oh(this_t{}, last, idx); 1146| 3.43k| } else { 1147| 3.42k| using std::get; 1148| 3.42k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 3.42k| auto next = get<1>(subs); 1150| 3.42k| auto ts = get<2>(subs); 1151| 3.42k| auto tail = get<3>(subs); 1152| 3.42k| IMMER_TRY { ------------------ | | 49| 3.42k|#define IMMER_TRY try ------------------ 1153| 3.42k| if (next) { ------------------ | Branch (1153:21): [True: 931, False: 2.49k] ------------------ 1154| 931| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 931| newn->inner()[idx] = next; 1156| 931| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.49k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 2.49k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 2.49k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 2.49k, Folded] | Branch (1159:40): [True: 2.12k, False: 368] | Branch (1159:52): [True: 1.68k, False: 439] ------------------ 1160| 1.68k| auto newn = pos.node()->inner()[0]; 1161| 1.68k| return std::make_tuple( 1162| 1.68k| pos.shift() - B, newn->inc(), ts, tail); 1163| 1.68k| } else { 1164| 807| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 807| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 807| } 1167| 3.42k| } 1168| 3.42k| 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.42k| } 1177| 6.85k| } _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.35k| { 1182| 1.35k| auto old_tail_size = pos.count(); 1183| 1.35k| auto new_tail_size = pos.index(last) + 1; 1184| 1.35k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 524, False: 834] ------------------ 1185| 1.35k| ? pos.node()->inc() 1186| 1.35k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.35k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.35k| } _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.54k| { 1143| 2.54k| auto idx = pos.index(last); 1144| 2.54k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 2.54k, Folded] | Branch (1144:25): [True: 1.18k, False: 1.36k] ------------------ 1145| 1.18k| return pos.towards_oh(this_t{}, last, idx); 1146| 1.36k| } else { 1147| 1.36k| using std::get; 1148| 1.36k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 1.36k| auto next = get<1>(subs); 1150| 1.36k| auto ts = get<2>(subs); 1151| 1.36k| auto tail = get<3>(subs); 1152| 1.36k| IMMER_TRY { ------------------ | | 49| 1.36k|#define IMMER_TRY try ------------------ 1153| 1.36k| if (next) { ------------------ | Branch (1153:21): [True: 330, False: 1.03k] ------------------ 1154| 330| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 330| newn->inner()[idx] = next; 1156| 330| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.03k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 1.03k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.03k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 1.03k, Folded] | Branch (1159:40): [True: 636, False: 394] | Branch (1159:52): [True: 309, False: 327] ------------------ 1160| 309| auto newn = pos.node()->inner()[0]; 1161| 309| return std::make_tuple( 1162| 309| pos.shift() - B, newn->inc(), ts, tail); 1163| 721| } else { 1164| 721| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 721| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 721| } 1167| 1.36k| } 1168| 1.36k| 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.36k| } 1177| 2.54k| } _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| 712| { 1182| 712| auto old_tail_size = pos.count(); 1183| 712| auto new_tail_size = pos.index(last) + 1; 1184| 712| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 272, False: 440] ------------------ 1185| 712| ? pos.node()->inc() 1186| 712| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 712| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 712| } _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| 14.5k| { 1415| 14.5k| auto idx = pos.subindex(first); 1416| 14.5k| auto count = pos.count(); 1417| 14.5k| auto left_size = pos.size_before(idx); 1418| 14.5k| auto child_size = pos.size_sbh(idx, left_size); 1419| 14.5k| auto dropped_size = first; 1420| 14.5k| auto child_dropped_size = dropped_size - left_size; 1421| 14.5k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 14.5k, Folded] | Branch (1421:25): [True: 12.6k, False: 1.88k] | Branch (1421:45): [True: 4.46k, False: 8.17k] ------------------ 1422| 4.46k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 10.0k| } else { 1424| 10.0k| using std::get; 1425| 10.0k| auto n = pos.node(); 1426| 10.0k| auto newc = count - idx; 1427| 10.0k| auto newn = node_t::make_inner_r_n(newc); 1428| 10.0k| IMMER_TRY { ------------------ | | 49| 10.0k|#define IMMER_TRY try ------------------ 1429| 10.0k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 10.0k| auto newr = newn->relaxed(); 1431| 10.0k| newr->d.count = count - idx; 1432| 10.0k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 10.0k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 10.0k, False: 0] ------------------ 1434| 10.0k| pos.copy_sizes(idx + 1, 1435| 10.0k| newr->d.count - 1, 1436| 10.0k| newr->d.sizes[0], 1437| 10.0k| newr->d.sizes + 1); 1438| 10.0k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 10.0k, False: 0] ------------------ 1439| 10.0k| pos.size() - dropped_size); 1440| 10.0k| newn->inner()[0] = get<1>(subs); 1441| 10.0k| std::copy(n->inner() + idx + 1, 1442| 10.0k| n->inner() + count, 1443| 10.0k| newn->inner() + 1); 1444| 10.0k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 10.0k| return std::make_tuple(pos.shift(), newn); 1446| 10.0k| } 1447| 10.0k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 10.0k| } 1452| 14.5k| } _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| 7.93k| { 1457| 7.93k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 7.93k| return std::make_tuple(0, n); 1459| 7.93k| } _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| 40.4k| { 1415| 40.4k| auto idx = pos.subindex(first); 1416| 40.4k| auto count = pos.count(); 1417| 40.4k| auto left_size = pos.size_before(idx); 1418| 40.4k| auto child_size = pos.size_sbh(idx, left_size); 1419| 40.4k| auto dropped_size = first; 1420| 40.4k| auto child_dropped_size = dropped_size - left_size; 1421| 40.4k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 40.4k] | 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| 40.4k| } else { 1424| 40.4k| using std::get; 1425| 40.4k| auto n = pos.node(); 1426| 40.4k| auto newc = count - idx; 1427| 40.4k| auto newn = node_t::make_inner_r_n(newc); 1428| 40.4k| IMMER_TRY { ------------------ | | 49| 40.4k|#define IMMER_TRY try ------------------ 1429| 40.4k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 40.4k| auto newr = newn->relaxed(); 1431| 40.4k| newr->d.count = count - idx; 1432| 40.4k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 40.4k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 40.4k, False: 0] ------------------ 1434| 40.4k| pos.copy_sizes(idx + 1, 1435| 40.4k| newr->d.count - 1, 1436| 40.4k| newr->d.sizes[0], 1437| 40.4k| newr->d.sizes + 1); 1438| 40.4k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 40.4k, False: 0] ------------------ 1439| 40.4k| pos.size() - dropped_size); 1440| 40.4k| newn->inner()[0] = get<1>(subs); 1441| 40.4k| std::copy(n->inner() + idx + 1, 1442| 40.4k| n->inner() + count, 1443| 40.4k| newn->inner() + 1); 1444| 40.4k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 40.4k| return std::make_tuple(pos.shift(), newn); 1446| 40.4k| } 1447| 40.4k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 40.4k| } 1452| 40.4k| } _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.12k| { 1415| 2.12k| auto idx = pos.subindex(first); 1416| 2.12k| auto count = pos.count(); 1417| 2.12k| auto left_size = pos.size_before(idx); 1418| 2.12k| auto child_size = pos.size_sbh(idx, left_size); 1419| 2.12k| auto dropped_size = first; 1420| 2.12k| auto child_dropped_size = dropped_size - left_size; 1421| 2.12k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 2.12k] | 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.12k| } else { 1424| 2.12k| using std::get; 1425| 2.12k| auto n = pos.node(); 1426| 2.12k| auto newc = count - idx; 1427| 2.12k| auto newn = node_t::make_inner_r_n(newc); 1428| 2.12k| IMMER_TRY { ------------------ | | 49| 2.12k|#define IMMER_TRY try ------------------ 1429| 2.12k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 2.12k| auto newr = newn->relaxed(); 1431| 2.12k| newr->d.count = count - idx; 1432| 2.12k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 2.12k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 2.12k, False: 0] ------------------ 1434| 2.12k| pos.copy_sizes(idx + 1, 1435| 2.12k| newr->d.count - 1, 1436| 2.12k| newr->d.sizes[0], 1437| 2.12k| newr->d.sizes + 1); 1438| 2.12k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 2.12k, False: 0] ------------------ 1439| 2.12k| pos.size() - dropped_size); 1440| 2.12k| newn->inner()[0] = get<1>(subs); 1441| 2.12k| std::copy(n->inner() + idx + 1, 1442| 2.12k| n->inner() + count, 1443| 2.12k| newn->inner() + 1); 1444| 2.12k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 2.12k| return std::make_tuple(pos.shift(), newn); 1446| 2.12k| } 1447| 2.12k| 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.12k| } 1452| 2.12k| } _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.58k| { 1457| 9.58k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 9.58k| return std::make_tuple(0, n); 1459| 9.58k| } _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.60k| { 1415| 5.60k| auto idx = pos.subindex(first); 1416| 5.60k| auto count = pos.count(); 1417| 5.60k| auto left_size = pos.size_before(idx); 1418| 5.60k| auto child_size = pos.size_sbh(idx, left_size); 1419| 5.60k| auto dropped_size = first; 1420| 5.60k| auto child_dropped_size = dropped_size - left_size; 1421| 5.60k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 5.60k] | 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.60k| } else { 1424| 5.60k| using std::get; 1425| 5.60k| auto n = pos.node(); 1426| 5.60k| auto newc = count - idx; 1427| 5.60k| auto newn = node_t::make_inner_r_n(newc); 1428| 5.60k| IMMER_TRY { ------------------ | | 49| 5.60k|#define IMMER_TRY try ------------------ 1429| 5.60k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 5.60k| auto newr = newn->relaxed(); 1431| 5.60k| newr->d.count = count - idx; 1432| 5.60k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 5.60k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 5.60k, False: 0] ------------------ 1434| 5.60k| pos.copy_sizes(idx + 1, 1435| 5.60k| newr->d.count - 1, 1436| 5.60k| newr->d.sizes[0], 1437| 5.60k| newr->d.sizes + 1); 1438| 5.60k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 5.60k, False: 0] ------------------ 1439| 5.60k| pos.size() - dropped_size); 1440| 5.60k| newn->inner()[0] = get<1>(subs); 1441| 5.60k| std::copy(n->inner() + idx + 1, 1442| 5.60k| n->inner() + count, 1443| 5.60k| newn->inner() + 1); 1444| 5.60k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 5.60k| return std::make_tuple(pos.shift(), newn); 1446| 5.60k| } 1447| 5.60k| 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.60k| } 1452| 5.60k| } _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.60k| { 1415| 9.60k| auto idx = pos.subindex(first); 1416| 9.60k| auto count = pos.count(); 1417| 9.60k| auto left_size = pos.size_before(idx); 1418| 9.60k| auto child_size = pos.size_sbh(idx, left_size); 1419| 9.60k| auto dropped_size = first; 1420| 9.60k| auto child_dropped_size = dropped_size - left_size; 1421| 9.60k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 9.60k, Folded] | Branch (1421:25): [True: 6.28k, False: 3.31k] | Branch (1421:45): [True: 3.39k, False: 2.89k] ------------------ 1422| 3.39k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 6.20k| } else { 1424| 6.20k| using std::get; 1425| 6.20k| auto n = pos.node(); 1426| 6.20k| auto newc = count - idx; 1427| 6.20k| auto newn = node_t::make_inner_r_n(newc); 1428| 6.20k| IMMER_TRY { ------------------ | | 49| 6.20k|#define IMMER_TRY try ------------------ 1429| 6.20k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 6.20k| auto newr = newn->relaxed(); 1431| 6.20k| newr->d.count = count - idx; 1432| 6.20k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 6.20k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 6.20k, False: 0] ------------------ 1434| 6.20k| pos.copy_sizes(idx + 1, 1435| 6.20k| newr->d.count - 1, 1436| 6.20k| newr->d.sizes[0], 1437| 6.20k| newr->d.sizes + 1); 1438| 6.20k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 6.20k, False: 0] ------------------ 1439| 6.20k| pos.size() - dropped_size); 1440| 6.20k| newn->inner()[0] = get<1>(subs); 1441| 6.20k| std::copy(n->inner() + idx + 1, 1442| 6.20k| n->inner() + count, 1443| 6.20k| newn->inner() + 1); 1444| 6.20k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 6.20k| return std::make_tuple(pos.shift(), newn); 1446| 6.20k| } 1447| 6.20k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 6.20k| } 1452| 9.60k| } _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.55k| { 1415| 1.55k| auto idx = pos.subindex(first); 1416| 1.55k| auto count = pos.count(); 1417| 1.55k| auto left_size = pos.size_before(idx); 1418| 1.55k| auto child_size = pos.size_sbh(idx, left_size); 1419| 1.55k| auto dropped_size = first; 1420| 1.55k| auto child_dropped_size = dropped_size - left_size; 1421| 1.55k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 1.55k, Folded] | Branch (1421:25): [True: 507, False: 1.05k] | Branch (1421:45): [True: 304, False: 203] ------------------ 1422| 304| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 1.25k| } else { 1424| 1.25k| using std::get; 1425| 1.25k| auto n = pos.node(); 1426| 1.25k| auto newc = count - idx; 1427| 1.25k| auto newn = node_t::make_inner_r_n(newc); 1428| 1.25k| IMMER_TRY { ------------------ | | 49| 1.25k|#define IMMER_TRY try ------------------ 1429| 1.25k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 1.25k| auto newr = newn->relaxed(); 1431| 1.25k| newr->d.count = count - idx; 1432| 1.25k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 1.25k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 1.25k, False: 0] ------------------ 1434| 1.25k| pos.copy_sizes(idx + 1, 1435| 1.25k| newr->d.count - 1, 1436| 1.25k| newr->d.sizes[0], 1437| 1.25k| newr->d.sizes + 1); 1438| 1.25k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 1.25k, False: 0] ------------------ 1439| 1.25k| pos.size() - dropped_size); 1440| 1.25k| newn->inner()[0] = get<1>(subs); 1441| 1.25k| std::copy(n->inner() + idx + 1, 1442| 1.25k| n->inner() + count, 1443| 1.25k| newn->inner() + 1); 1444| 1.25k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 1.25k| return std::make_tuple(pos.shift(), newn); 1446| 1.25k| } 1447| 1.25k| 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.25k| } 1452| 1.55k| } _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.15k|{ 2002| 8.15k| return make_singleton_regular_sub_pos(ltail, ltcount) 2003| 8.15k| .visit(concat_trees_left_visitor{}, 2004| 8.15k| empty_leaf_pos{}, 2005| 8.15k| rroot, 2006| 8.15k| rshift, 2007| 8.15k| rsize) 2008| 8.15k| .realize(); 2009| 8.15k|} _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.15k| { 1972| 8.15k| return visit_maybe_relaxed_sub( 1973| 8.15k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 8.15k| } _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.69k| { 1959| 5.69k| return concat_inners(lpos, tpos, rpos); 1960| 5.69k| } _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| 24.1k|{ 1873| 24.1k| auto lshift = lpos.shift(); 1874| 24.1k| auto rshift = rpos.shift(); 1875| 24.1k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 24.1k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 24.1k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 18.8k, False: 5.29k] ------------------ 1879| 18.8k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 18.8k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 18.8k| } else { 1882| 5.29k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 5.29k, False: 0] ------------------ 1883| 5.29k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 5.29k] | Branch (1883:9): [True: 5.29k, False: 0] | Branch (1883:9): [True: 5.29k, False: 0] ------------------ 1884| 5.29k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 5.29k| return concat_rebalance(lpos, cpos, rpos); 1886| 5.29k| } 1887| 24.1k|} _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.58M| { 1513| 5.58M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 524k, False: 5.05M] ------------------ 1514| 524k| auto s = size_t{}; 1515| 2.08M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 1.56M, False: 524k] ------------------ 1516| 1.56M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 1.56M| s = sizes_[i]; 1518| 1.56M| } 1519| 5.05M| } else { 1520| 12.8M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 7.79M, False: 5.05M] ------------------ 1521| 7.79M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 7.79M| .visit(v, args...); 1523| 5.05M| } 1524| 5.58M| } _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.40M| { 1734| 2.40M| auto count = p.count(); 1735| 2.40M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 2.40M, False: 0] ------------------ 1736| 2.40M| plan.counts[plan.n++] = count; 1737| 2.40M| plan.total += count; 1738| 2.40M| } _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| 20.6M| { 1734| 20.6M| auto count = p.count(); 1735| 20.6M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 20.6M, False: 0] ------------------ 1736| 20.6M| plan.counts[plan.n++] = count; 1737| 20.6M| plan.total += count; 1738| 20.6M| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE7shuffleEj: 1762| 5.58M| { 1763| | // gcc seems to not really understand this code... :( 1764| 5.58M|#if !defined(_MSC_VER) 1765| 5.58M|#pragma GCC diagnostic push 1766| 5.58M|#pragma GCC diagnostic ignored "-Warray-bounds" 1767| 5.58M|#endif 1768| 5.58M| constexpr count_t rrb_extras = 2; 1769| 5.58M| constexpr count_t rrb_invariant = 1; 1770| 5.58M| const auto bits = shift == BL ? BL : B; ------------------ | Branch (1770:43): [True: 524k, False: 5.05M] ------------------ 1771| 5.58M| const auto branches = count_t{1} << bits; 1772| 5.58M| const auto optimal = ((total - 1) >> bits) + 1; 1773| 5.58M| count_t i = 0; 1774| 6.56M| while (n >= optimal + rrb_extras) { ------------------ | Branch (1774:16): [True: 980k, False: 5.58M] ------------------ 1775| | // skip ok nodes 1776| 1.63M| while (counts[i] > branches - rrb_invariant) ------------------ | Branch (1776:20): [True: 659k, False: 980k] ------------------ 1777| 659k| i++; 1778| 980k| assert(i < n); ------------------ | Branch (1778:13): [True: 980k, False: 0] ------------------ 1779| | // short node, redistribute 1780| 980k| auto remaining = counts[i]; 1781| 2.39M| do { 1782| 2.39M| auto next = counts[i + 1]; 1783| 2.39M| auto count = std::min(remaining + next, branches); 1784| 2.39M| counts[i] = count; 1785| 2.39M| assert(counts[i]); ------------------ | Branch (1785:17): [True: 2.39M, False: 0] ------------------ 1786| 2.39M| remaining += next - count; 1787| 2.39M| ++i; 1788| 2.39M| } while (remaining > 0); ------------------ | Branch (1788:22): [True: 1.41M, False: 980k] ------------------ 1789| | // remove node 1790| 980k| std::move(counts + i + 1, counts + n, counts + i); 1791| 980k| --n; 1792| 980k| --i; 1793| 980k| } 1794| 5.58M|#if !defined(_MSC_VER) 1795| 5.58M|#pragma GCC diagnostic pop 1796| 5.58M|#endif 1797| 5.58M| } _ZNK5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 1478| 11.1M| 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.58M| : curr_{counts} 1578| 5.58M| , n_{n} 1579| 5.58M| , result_{ 1580| 5.58M| shift + B, node_t::make_inner_r_n(std::min(n_, branches)), 0} 1581| 5.58M| { 1582| 5.58M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEC2EjPSC_m: 1481| 5.58M| : shift_{s} 1482| 5.58M| , count_{1} 1483| 5.58M| , nodes_{n0} 1484| 5.58M| , sizes_{s0} 1485| 5.58M| { 1486| 5.58M| } _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.58M| { 1513| 5.58M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 524k, False: 5.05M] ------------------ 1514| 524k| auto s = size_t{}; 1515| 2.08M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 1.56M, False: 524k] ------------------ 1516| 1.56M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 1.56M| s = sizes_[i]; 1518| 1.56M| } 1519| 5.05M| } else { 1520| 12.8M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 7.79M, False: 5.05M] ------------------ 1521| 7.79M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 7.79M| .visit(v, args...); 1523| 5.05M| } 1524| 5.58M| } _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.40M| { 1722| 2.40M| merger.merge_leaf(p); 1723| 2.40M| } _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.40M| { 1615| 2.40M| auto from = p.node(); 1616| 2.40M| auto from_size = p.size(); 1617| 2.40M| auto from_count = p.count(); 1618| 2.40M| assert(from_size); ------------------ | Branch (1618:9): [True: 2.40M, False: 0] ------------------ 1619| 2.40M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 2.35M, False: 54.0k] | Branch (1619:21): [True: 2.32M, False: 25.4k] ------------------ 1620| 2.32M| add_child(from, from_size); 1621| 2.32M| from->inc(); 1622| 2.32M| } else { 1623| 79.4k| auto from_offset = count_t{}; 1624| 79.4k| auto from_data = from->leaf(); 1625| 106k| do { 1626| 106k| if (!to_) { ------------------ | Branch (1626:21): [True: 52.9k, False: 54.0k] ------------------ 1627| 52.9k| to_ = node_t::make_leaf_n(*curr_); 1628| 52.9k| to_offset_ = 0; 1629| 52.9k| } 1630| 106k| auto data = to_->leaf(); 1631| 106k| auto to_copy = 1632| 106k| std::min(from_count - from_offset, *curr_ - to_offset_); 1633| 106k| detail::uninitialized_copy(from_data + from_offset, 1634| 106k| from_data + from_offset + to_copy, 1635| 106k| data + to_offset_); 1636| 106k| to_offset_ += to_copy; 1637| 106k| from_offset += to_copy; 1638| 106k| if (*curr_ == to_offset_) { ------------------ | Branch (1638:21): [True: 52.9k, False: 54.0k] ------------------ 1639| 52.9k| add_child(to_, to_offset_); 1640| 52.9k| to_ = nullptr; 1641| 52.9k| } 1642| 106k| } while (from_offset != from_count); ------------------ | Branch (1642:22): [True: 27.5k, False: 79.4k] ------------------ 1643| 79.4k| } 1644| 2.40M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9add_childEPSC_m: 1589| 24.5M| { 1590| 24.5M| assert(size); ------------------ | Branch (1590:9): [True: 24.5M, False: 0] ------------------ 1591| 24.5M| ++curr_; 1592| 24.5M| auto parent = result_.nodes_[result_.count_ - 1]; 1593| 24.5M| auto relaxed = parent->relaxed(); 1594| 24.5M| if (relaxed->d.count == branches) { ------------------ | Branch (1594:13): [True: 2.77M, False: 21.7M] ------------------ 1595| 2.77M| assert(result_.count_ < result_t::max_children); ------------------ | Branch (1595:13): [True: 2.77M, False: 0] ------------------ 1596| 2.77M| n_ -= branches; 1597| 2.77M| parent = node_t::make_inner_r_n(std::min(n_, branches)); 1598| 2.77M| relaxed = parent->relaxed(); 1599| 2.77M| result_.nodes_[result_.count_] = parent; 1600| 2.77M| result_.sizes_[result_.count_] = result_.sizes_[result_.count_ - 1]; 1601| 2.77M| assert(result_.sizes_[result_.count_]); ------------------ | Branch (1601:13): [True: 2.77M, False: 0] ------------------ 1602| 2.77M| ++result_.count_; 1603| 2.77M| } 1604| 24.5M| auto idx = relaxed->d.count++; 1605| 24.5M| result_.sizes_[result_.count_ - 1] += size; 1606| 24.5M| assert(result_.sizes_[result_.count_ - 1]); ------------------ | Branch (1606:9): [True: 24.5M, False: 0] ------------------ 1607| 24.5M| relaxed->d.sizes[idx] = size + (idx ? relaxed->d.sizes[idx - 1] : 0); ------------------ | Branch (1607:41): [True: 16.2M, False: 8.35M] ------------------ 1608| 24.5M| assert(relaxed->d.sizes[idx]); ------------------ | Branch (1608:9): [True: 24.5M, False: 0] ------------------ 1609| 24.5M| parent->inner()[idx] = p; 1610| 24.5M| }; _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| 20.6M| { 1716| 20.6M| merger.merge_inner(p); 1717| 20.6M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11merge_innerIRNS1_11relaxed_posISC_EEEEvOT_: 1648| 20.6M| { 1649| 20.6M| auto from = p.node(); 1650| 20.6M| auto from_size = p.size(); 1651| 20.6M| auto from_count = p.count(); 1652| 20.6M| assert(from_size); ------------------ | Branch (1652:9): [True: 20.6M, False: 0] ------------------ 1653| 20.6M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 18.4M, False: 2.20M] | Branch (1653:21): [True: 17.5M, False: 938k] ------------------ 1654| 17.5M| add_child(from, from_size); 1655| 17.5M| from->inc(); 1656| 17.5M| } else { 1657| 3.14M| auto from_offset = count_t{}; 1658| 3.14M| auto from_data = from->inner(); 1659| 4.39M| do { 1660| 4.39M| if (!to_) { ------------------ | Branch (1660:21): [True: 2.19M, False: 2.20M] ------------------ 1661| 2.19M| to_ = node_t::make_inner_r_n(*curr_); 1662| 2.19M| to_offset_ = 0; 1663| 2.19M| to_size_ = 0; 1664| 2.19M| } 1665| 4.39M| auto data = to_->inner(); 1666| 4.39M| auto to_copy = 1667| 4.39M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 4.39M| std::copy(from_data + from_offset, 1669| 4.39M| from_data + from_offset + to_copy, 1670| 4.39M| data + to_offset_); 1671| 4.39M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 4.39M| auto sizes = to_->relaxed()->d.sizes; 1673| 4.39M| p.copy_sizes( 1674| 4.39M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 4.39M| to_offset_ += to_copy; 1676| 4.39M| from_offset += to_copy; 1677| 4.39M| to_size_ = sizes[to_offset_ - 1]; 1678| 4.39M| assert(to_size_); ------------------ | Branch (1678:17): [True: 4.39M, False: 0] ------------------ 1679| 4.39M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 2.19M, False: 2.20M] ------------------ 1680| 2.19M| to_->relaxed()->d.count = to_offset_; 1681| 2.19M| add_child(to_, to_size_); 1682| 2.19M| to_ = nullptr; 1683| 2.19M| } 1684| 4.39M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 1.25M, False: 3.14M] ------------------ 1685| 3.14M| } 1686| 20.6M| } _ZNK5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE6finishEv: 1689| 5.58M| { 1690| 5.58M| assert(!to_); ------------------ | Branch (1690:9): [True: 5.58M, False: 0] ------------------ 1691| 5.58M| return result_; 1692| 5.58M| } _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.58M| { 1513| 5.58M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 524k, False: 5.05M] ------------------ 1514| 524k| auto s = size_t{}; 1515| 2.08M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 1.56M, False: 524k] ------------------ 1516| 1.56M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 1.56M| s = sizes_[i]; 1518| 1.56M| } 1519| 5.05M| } else { 1520| 12.8M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 7.79M, False: 5.05M] ------------------ 1521| 7.79M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 7.79M| .visit(v, args...); 1523| 5.05M| } 1524| 5.58M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEC2EjPSC_mSE_mSE_m: 1503| 516k| : shift_{s} 1504| 516k| , count_{3} 1505| 516k| , nodes_{n0, n1, n2} 1506| 516k| , sizes_{s0, s0 + s1, s0 + s1 + s2} 1507| 516k| { 1508| 516k| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEC2EjPSC_mSE_m: 1489| 8.15k| : shift_{s} 1490| 8.15k| , count_{2} 1491| 8.15k| , nodes_{n0, n1} 1492| 8.15k| , sizes_{s0, s0 + s1} 1493| 8.15k| { 1494| 8.15k| } _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| 18.4k| { 1918| 18.4k| return concat_inners(lpos, tpos, rpos); 1919| 18.4k| } _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| 398| { 1918| 398| return concat_inners(lpos, tpos, rpos); 1919| 398| } _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.86k|{ 1873| 2.86k| auto lshift = lpos.shift(); 1874| 2.86k| auto rshift = rpos.shift(); 1875| 2.86k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 2.86k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 2.86k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 666, False: 2.19k] ------------------ 1879| 666| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 666| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 2.19k| } else { 1882| 2.19k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 2.19k, False: 0] ------------------ 1883| 2.19k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 2.19k] | Branch (1883:9): [True: 2.19k, False: 0] | Branch (1883:9): [True: 2.19k, False: 0] ------------------ 1884| 2.19k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 2.19k| return concat_rebalance(lpos, cpos, rpos); 1886| 2.19k| } 1887| 2.86k|} _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.03k| { 1918| 1.03k| return concat_inners(lpos, tpos, rpos); 1919| 1.03k| } _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.03k|{ 1873| 1.03k| auto lshift = lpos.shift(); 1874| 1.03k| auto rshift = rpos.shift(); 1875| 1.03k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 1.03k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 1.03k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 372, False: 666] ------------------ 1879| 372| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 372| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 666| } else { 1882| 666| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 666, False: 0] ------------------ 1883| 666| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 666] | Branch (1883:9): [True: 666, False: 0] | Branch (1883:9): [True: 666, False: 0] ------------------ 1884| 666| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 666| return concat_rebalance(lpos, cpos, rpos); 1886| 666| } 1887| 1.03k|} _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| 967|{ 1824| 967| auto plan = concat_rebalance_plan{}; 1825| 967| plan.fill(lpos, cpos, rpos); 1826| 967| plan.shuffle(cpos.shift()); 1827| 967| IMMER_TRY { ------------------ | | 49| 967|#define IMMER_TRY try ------------------ 1828| 967| return plan.merge(lpos, cpos, rpos); 1829| 967| } 1830| 967| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 967|} _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| 967| { 1753| 967| assert(n == 0u); ------------------ | Branch (1753:9): [True: 967, False: 0] ------------------ 1754| 967| assert(total == 0u); ------------------ | Branch (1754:9): [True: 967, False: 0] ------------------ 1755| 967| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 967| lpos.each_left_sub(visitor_t{}, *this); 1757| 967| cpos.each_sub(visitor_t{}, *this); 1758| 967| rpos.each_right_sub(visitor_t{}, *this); 1759| 967| } _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.07M| { 1734| 1.07M| auto count = p.count(); 1735| 1.07M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 1.07M, False: 0] ------------------ 1736| 1.07M| plan.counts[plan.n++] = count; 1737| 1.07M| plan.total += count; 1738| 1.07M| } _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| 715k| { 1734| 715k| auto count = p.count(); 1735| 715k| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 715k, False: 0] ------------------ 1736| 715k| plan.counts[plan.n++] = count; 1737| 715k| plan.total += count; 1738| 715k| } _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| 967| { 1803| 967| using node_t = node_type; 1804| 967| using merger_t = concat_merger; 1805| 967| using visitor_t = concat_merger_visitor; 1806| 967| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 967| IMMER_TRY { ------------------ | | 49| 967|#define IMMER_TRY try ------------------ 1808| 967| lpos.each_left_sub(visitor_t{}, merger); 1809| 967| cpos.each_sub(visitor_t{}, merger); 1810| 967| rpos.each_right_sub(visitor_t{}, merger); 1811| 967| cpos.each_sub(dec_visitor{}); 1812| 967| return merger.finish(); 1813| 967| } 1814| 967| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 967| } _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.07M| { 1722| 1.07M| merger.merge_leaf(p); 1723| 1.07M| } _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.07M| { 1615| 1.07M| auto from = p.node(); 1616| 1.07M| auto from_size = p.size(); 1617| 1.07M| auto from_count = p.count(); 1618| 1.07M| assert(from_size); ------------------ | Branch (1618:9): [True: 1.07M, False: 0] ------------------ 1619| 1.07M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 1.07M, False: 0] | Branch (1619:21): [True: 1.07M, False: 0] ------------------ 1620| 1.07M| add_child(from, from_size); 1621| 1.07M| from->inc(); 1622| 1.07M| } 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.07M| } _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| 715k| { 1716| 715k| merger.merge_inner(p); 1717| 715k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11merge_innerIRNS1_8full_posISC_EEEEvOT_: 1648| 715k| { 1649| 715k| auto from = p.node(); 1650| 715k| auto from_size = p.size(); 1651| 715k| auto from_count = p.count(); 1652| 715k| assert(from_size); ------------------ | Branch (1652:9): [True: 715k, False: 0] ------------------ 1653| 715k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 715k, False: 0] | Branch (1653:21): [True: 715k, False: 0] ------------------ 1654| 715k| add_child(from, from_size); 1655| 715k| from->inc(); 1656| 715k| } 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| 715k| } _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| 666| { 1945| 666| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 666| } _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.86k| { 1925| 2.86k| return concat_leafs(lpos, tpos, rpos); 1926| 2.86k| } _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.86k|{ 1839| 2.86k| static_assert(Node::bits >= 2, ""); 1840| 2.86k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 2.86k, False: 0] ------------------ 1841| 2.86k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 2.86k, False: 0] ------------------ 1842| 2.86k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 2.86k, False: 0] ------------------ 1843| 2.86k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 2.86k] ------------------ 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.86k| else 1854| 2.86k| return { 1855| 2.86k| Node::bits_leaf, 1856| 2.86k| lpos.node()->inc(), 1857| 2.86k| lpos.count(), 1858| 2.86k| rpos.node()->inc(), 1859| 2.86k| rpos.count(), 1860| 2.86k| }; 1861| 2.86k|} _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| 666|{ 1824| 666| auto plan = concat_rebalance_plan{}; 1825| 666| plan.fill(lpos, cpos, rpos); 1826| 666| plan.shuffle(cpos.shift()); 1827| 666| IMMER_TRY { ------------------ | | 49| 666|#define IMMER_TRY try ------------------ 1828| 666| return plan.merge(lpos, cpos, rpos); 1829| 666| } 1830| 666| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 666|} _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| 666| { 1753| 666| assert(n == 0u); ------------------ | Branch (1753:9): [True: 666, False: 0] ------------------ 1754| 666| assert(total == 0u); ------------------ | Branch (1754:9): [True: 666, False: 0] ------------------ 1755| 666| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 666| lpos.each_left_sub(visitor_t{}, *this); 1757| 666| cpos.each_sub(visitor_t{}, *this); 1758| 666| rpos.each_right_sub(visitor_t{}, *this); 1759| 666| } _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| 666| { 1803| 666| using node_t = node_type; 1804| 666| using merger_t = concat_merger; 1805| 666| using visitor_t = concat_merger_visitor; 1806| 666| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 666| IMMER_TRY { ------------------ | | 49| 666|#define IMMER_TRY try ------------------ 1808| 666| lpos.each_left_sub(visitor_t{}, merger); 1809| 666| cpos.each_sub(visitor_t{}, merger); 1810| 666| rpos.each_right_sub(visitor_t{}, merger); 1811| 666| cpos.each_sub(dec_visitor{}); 1812| 666| return merger.finish(); 1813| 666| } 1814| 666| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 666| } _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.07k|{ 1824| 2.07k| auto plan = concat_rebalance_plan{}; 1825| 2.07k| plan.fill(lpos, cpos, rpos); 1826| 2.07k| plan.shuffle(cpos.shift()); 1827| 2.07k| IMMER_TRY { ------------------ | | 49| 2.07k|#define IMMER_TRY try ------------------ 1828| 2.07k| return plan.merge(lpos, cpos, rpos); 1829| 2.07k| } 1830| 2.07k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.07k|} _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.07k| { 1753| 2.07k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.07k, False: 0] ------------------ 1754| 2.07k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.07k, False: 0] ------------------ 1755| 2.07k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.07k| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.07k| cpos.each_sub(visitor_t{}, *this); 1758| 2.07k| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.07k| } _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| 691k| { 1734| 691k| auto count = p.count(); 1735| 691k| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 691k, False: 0] ------------------ 1736| 691k| plan.counts[plan.n++] = count; 1737| 691k| plan.total += count; 1738| 691k| } _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.07k| { 1803| 2.07k| using node_t = node_type; 1804| 2.07k| using merger_t = concat_merger; 1805| 2.07k| using visitor_t = concat_merger_visitor; 1806| 2.07k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.07k| IMMER_TRY { ------------------ | | 49| 2.07k|#define IMMER_TRY try ------------------ 1808| 2.07k| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.07k| cpos.each_sub(visitor_t{}, merger); 1810| 2.07k| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.07k| cpos.each_sub(dec_visitor{}); 1812| 2.07k| return merger.finish(); 1813| 2.07k| } 1814| 2.07k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.07k| } _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| 691k| { 1716| 691k| merger.merge_inner(p); 1717| 691k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11merge_innerIRNS1_15regular_sub_posISC_EEEEvOT_: 1648| 691k| { 1649| 691k| auto from = p.node(); 1650| 691k| auto from_size = p.size(); 1651| 691k| auto from_count = p.count(); 1652| 691k| assert(from_size); ------------------ | Branch (1652:9): [True: 691k, False: 0] ------------------ 1653| 691k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 557k, False: 134k] | Branch (1653:21): [True: 557k, False: 0] ------------------ 1654| 557k| add_child(from, from_size); 1655| 557k| from->inc(); 1656| 557k| } else { 1657| 134k| auto from_offset = count_t{}; 1658| 134k| auto from_data = from->inner(); 1659| 268k| do { 1660| 268k| if (!to_) { ------------------ | Branch (1660:21): [True: 134k, False: 134k] ------------------ 1661| 134k| to_ = node_t::make_inner_r_n(*curr_); 1662| 134k| to_offset_ = 0; 1663| 134k| to_size_ = 0; 1664| 134k| } 1665| 268k| auto data = to_->inner(); 1666| 268k| auto to_copy = 1667| 268k| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 268k| std::copy(from_data + from_offset, 1669| 268k| from_data + from_offset + to_copy, 1670| 268k| data + to_offset_); 1671| 268k| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 268k| auto sizes = to_->relaxed()->d.sizes; 1673| 268k| p.copy_sizes( 1674| 268k| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 268k| to_offset_ += to_copy; 1676| 268k| from_offset += to_copy; 1677| 268k| to_size_ = sizes[to_offset_ - 1]; 1678| 268k| assert(to_size_); ------------------ | Branch (1678:17): [True: 268k, False: 0] ------------------ 1679| 268k| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 134k, False: 134k] ------------------ 1680| 134k| to_->relaxed()->d.count = to_offset_; 1681| 134k| add_child(to_, to_size_); 1682| 134k| to_ = nullptr; 1683| 134k| } 1684| 268k| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 134k, False: 134k] ------------------ 1685| 134k| } 1686| 691k| } _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| 2.19k| { 1945| 2.19k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 2.19k| } _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.29k| { 1925| 5.29k| return concat_leafs(lpos, tpos, rpos); 1926| 5.29k| } _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.29k|{ 1839| 5.29k| static_assert(Node::bits >= 2, ""); 1840| 5.29k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 5.29k, False: 0] ------------------ 1841| 5.29k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 5.29k, False: 0] ------------------ 1842| 5.29k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 5.29k, False: 0] ------------------ 1843| 5.29k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 5.29k] ------------------ 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.29k| else 1854| 5.29k| return { 1855| 5.29k| Node::bits_leaf, 1856| 5.29k| lpos.node()->inc(), 1857| 5.29k| lpos.count(), 1858| 5.29k| rpos.node()->inc(), 1859| 5.29k| rpos.count(), 1860| 5.29k| }; 1861| 5.29k|} _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| 2.19k|{ 1824| 2.19k| auto plan = concat_rebalance_plan{}; 1825| 2.19k| plan.fill(lpos, cpos, rpos); 1826| 2.19k| plan.shuffle(cpos.shift()); 1827| 2.19k| IMMER_TRY { ------------------ | | 49| 2.19k|#define IMMER_TRY try ------------------ 1828| 2.19k| return plan.merge(lpos, cpos, rpos); 1829| 2.19k| } 1830| 2.19k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.19k|} _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| 2.19k| { 1753| 2.19k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.19k, False: 0] ------------------ 1754| 2.19k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.19k, False: 0] ------------------ 1755| 2.19k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.19k| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.19k| cpos.each_sub(visitor_t{}, *this); 1758| 2.19k| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.19k| } _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| 2.19k| { 1803| 2.19k| using node_t = node_type; 1804| 2.19k| using merger_t = concat_merger; 1805| 2.19k| using visitor_t = concat_merger_visitor; 1806| 2.19k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.19k| IMMER_TRY { ------------------ | | 49| 2.19k|#define IMMER_TRY try ------------------ 1808| 2.19k| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.19k| cpos.each_sub(visitor_t{}, merger); 1810| 2.19k| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.19k| cpos.each_sub(dec_visitor{}); 1812| 2.19k| return merger.finish(); 1813| 2.19k| } 1814| 2.19k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.19k| } _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| 122k|{ 1824| 122k| auto plan = concat_rebalance_plan{}; 1825| 122k| plan.fill(lpos, cpos, rpos); 1826| 122k| plan.shuffle(cpos.shift()); 1827| 122k| IMMER_TRY { ------------------ | | 49| 122k|#define IMMER_TRY try ------------------ 1828| 122k| return plan.merge(lpos, cpos, rpos); 1829| 122k| } 1830| 122k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 122k|} _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| 122k| { 1753| 122k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 122k, False: 0] ------------------ 1754| 122k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 122k, False: 0] ------------------ 1755| 122k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 122k| lpos.each_left_sub(visitor_t{}, *this); 1757| 122k| cpos.each_sub(visitor_t{}, *this); 1758| 122k| rpos.each_right_sub(visitor_t{}, *this); 1759| 122k| } _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| 122k| { 1803| 122k| using node_t = node_type; 1804| 122k| using merger_t = concat_merger; 1805| 122k| using visitor_t = concat_merger_visitor; 1806| 122k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 122k| IMMER_TRY { ------------------ | | 49| 122k|#define IMMER_TRY try ------------------ 1808| 122k| lpos.each_left_sub(visitor_t{}, merger); 1809| 122k| cpos.each_sub(visitor_t{}, merger); 1810| 122k| rpos.each_right_sub(visitor_t{}, merger); 1811| 122k| cpos.each_sub(dec_visitor{}); 1812| 122k| return merger.finish(); 1813| 122k| } 1814| 122k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 122k| } _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.29k| { 1945| 5.29k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 5.29k| } _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.29k|{ 1824| 5.29k| auto plan = concat_rebalance_plan{}; 1825| 5.29k| plan.fill(lpos, cpos, rpos); 1826| 5.29k| plan.shuffle(cpos.shift()); 1827| 5.29k| IMMER_TRY { ------------------ | | 49| 5.29k|#define IMMER_TRY try ------------------ 1828| 5.29k| return plan.merge(lpos, cpos, rpos); 1829| 5.29k| } 1830| 5.29k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 5.29k|} _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.29k| { 1753| 5.29k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 5.29k, False: 0] ------------------ 1754| 5.29k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 5.29k, False: 0] ------------------ 1755| 5.29k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 5.29k| lpos.each_left_sub(visitor_t{}, *this); 1757| 5.29k| cpos.each_sub(visitor_t{}, *this); 1758| 5.29k| rpos.each_right_sub(visitor_t{}, *this); 1759| 5.29k| } _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.29k| { 1803| 5.29k| using node_t = node_type; 1804| 5.29k| using merger_t = concat_merger; 1805| 5.29k| using visitor_t = concat_merger_visitor; 1806| 5.29k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 5.29k| IMMER_TRY { ------------------ | | 49| 5.29k|#define IMMER_TRY try ------------------ 1808| 5.29k| lpos.each_left_sub(visitor_t{}, merger); 1809| 5.29k| cpos.each_sub(visitor_t{}, merger); 1810| 5.29k| rpos.each_right_sub(visitor_t{}, merger); 1811| 5.29k| cpos.each_sub(dec_visitor{}); 1812| 5.29k| return merger.finish(); 1813| 5.29k| } 1814| 5.29k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 5.29k| } _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.46k| { 1959| 2.46k| return concat_inners(lpos, tpos, rpos); 1960| 2.46k| } _ZNO5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7realizeEv: 1527| 524k| { 1528| 524k| if (count_ > 1) { ------------------ | Branch (1528:13): [True: 39.2k, False: 485k] ------------------ 1529| 39.2k| IMMER_TRY { ------------------ | | 49| 39.2k|#define IMMER_TRY try ------------------ 1530| 39.2k| auto result = node_t::make_inner_r_n(count_); 1531| 39.2k| auto r = result->relaxed(); 1532| 39.2k| r->d.count = count_; 1533| 39.2k| std::copy(nodes_, nodes_ + count_, result->inner()); 1534| 39.2k| std::copy(sizes_, sizes_ + count_, r->d.sizes); 1535| 39.2k| return {result, shift_, r}; 1536| 39.2k| } 1537| 39.2k| IMMER_CATCH (...) { 1538| 0| each_sub(dec_visitor{}); 1539| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1540| 0| } 1541| 485k| } else { 1542| 485k| assert(shift_ >= B + BL); ------------------ | Branch (1542:13): [True: 485k, False: 0] ------------------ 1543| 485k| return {nodes_[0], shift_ - B, nodes_[0]->relaxed()}; 1544| 485k| } 1545| 524k| } _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| 516k|{ 1987| 516k| return visit_maybe_relaxed_sub(lroot, 1988| 516k| lshift, 1989| 516k| lsize, 1990| 516k| concat_trees_left_visitor{}, 1991| 516k| make_leaf_pos(ltail, ltcount), 1992| 516k| rroot, 1993| 516k| rshift, 1994| 516k| rsize) 1995| 516k| .realize(); 1996| 516k|} _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| 501k| { 1972| 501k| return visit_maybe_relaxed_sub( 1973| 501k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 501k| } _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| 485k| { 1959| 485k| return concat_inners(lpos, tpos, rpos); 1960| 485k| } _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.53M|{ 1873| 4.53M| auto lshift = lpos.shift(); 1874| 4.53M| auto rshift = rpos.shift(); 1875| 4.53M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 2.22M, False: 2.30M] ------------------ 1876| 2.22M| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 2.22M| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 2.30M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 92.4k, False: 2.21M] ------------------ 1879| 92.4k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 92.4k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 2.21M| } else { 1882| 2.21M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 2.21M, False: 0] ------------------ 1883| 2.21M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 2.21M] | Branch (1883:9): [True: 2.21M, False: 0] | Branch (1883:9): [True: 2.21M, False: 0] ------------------ 1884| 2.21M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 2.21M| return concat_rebalance(lpos, cpos, rpos); 1886| 2.21M| } 1887| 4.53M|} _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.22M| { 1898| 2.22M| return concat_inners(lpos, tpos, rpos); 1899| 2.22M| } _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| 4.65k| { 1898| 4.65k| return concat_inners(lpos, tpos, rpos); 1899| 4.65k| } _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| 671k|{ 1873| 671k| auto lshift = lpos.shift(); 1874| 671k| auto rshift = rpos.shift(); 1875| 671k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 2.81k, False: 668k] ------------------ 1876| 2.81k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 2.81k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 668k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 11.3k, False: 656k] ------------------ 1879| 11.3k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 11.3k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 656k| } else { 1882| 656k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 656k, False: 0] ------------------ 1883| 656k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 656k] | Branch (1883:9): [True: 656k, False: 0] | Branch (1883:9): [True: 656k, False: 0] ------------------ 1884| 656k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 656k| return concat_rebalance(lpos, cpos, rpos); 1886| 656k| } 1887| 671k|} _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| 3.57k|{ 1824| 3.57k| auto plan = concat_rebalance_plan{}; 1825| 3.57k| plan.fill(lpos, cpos, rpos); 1826| 3.57k| plan.shuffle(cpos.shift()); 1827| 3.57k| IMMER_TRY { ------------------ | | 49| 3.57k|#define IMMER_TRY try ------------------ 1828| 3.57k| return plan.merge(lpos, cpos, rpos); 1829| 3.57k| } 1830| 3.57k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 3.57k|} _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| 3.57k| { 1753| 3.57k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 3.57k, False: 0] ------------------ 1754| 3.57k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 3.57k, False: 0] ------------------ 1755| 3.57k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 3.57k| lpos.each_left_sub(visitor_t{}, *this); 1757| 3.57k| cpos.each_sub(visitor_t{}, *this); 1758| 3.57k| rpos.each_right_sub(visitor_t{}, *this); 1759| 3.57k| } _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| 3.57k| { 1803| 3.57k| using node_t = node_type; 1804| 3.57k| using merger_t = concat_merger; 1805| 3.57k| using visitor_t = concat_merger_visitor; 1806| 3.57k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 3.57k| IMMER_TRY { ------------------ | | 49| 3.57k|#define IMMER_TRY try ------------------ 1808| 3.57k| lpos.each_left_sub(visitor_t{}, merger); 1809| 3.57k| cpos.each_sub(visitor_t{}, merger); 1810| 3.57k| rpos.each_right_sub(visitor_t{}, merger); 1811| 3.57k| cpos.each_sub(dec_visitor{}); 1812| 3.57k| return merger.finish(); 1813| 3.57k| } 1814| 3.57k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 3.57k| } _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| 659k| { 1918| 659k| return concat_inners(lpos, tpos, rpos); 1919| 659k| } _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| 122k| { 1918| 122k| return concat_inners(lpos, tpos, rpos); 1919| 122k| } _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| 131k|{ 1873| 131k| auto lshift = lpos.shift(); 1874| 131k| auto rshift = rpos.shift(); 1875| 131k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 757, False: 130k] ------------------ 1876| 757| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 757| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 130k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 568, False: 130k] ------------------ 1879| 568| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 568| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 130k| } else { 1882| 130k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 130k, False: 0] ------------------ 1883| 130k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 130k] | Branch (1883:9): [True: 130k, False: 0] | Branch (1883:9): [True: 130k, False: 0] ------------------ 1884| 130k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 130k| return concat_rebalance(lpos, cpos, rpos); 1886| 130k| } 1887| 131k|} _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.13k| { 1898| 1.13k| return concat_inners(lpos, tpos, rpos); 1899| 1.13k| } _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| 123k| { 1918| 123k| return concat_inners(lpos, tpos, rpos); 1919| 123k| } _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| 123k|{ 1873| 123k| auto lshift = lpos.shift(); 1874| 123k| auto rshift = rpos.shift(); 1875| 123k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 123k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 123k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 293, False: 122k] ------------------ 1879| 293| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 293| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 122k| } else { 1882| 122k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 122k, False: 0] ------------------ 1883| 122k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 122k] | Branch (1883:9): [True: 122k, False: 0] | Branch (1883:9): [True: 122k, False: 0] ------------------ 1884| 122k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 122k| return concat_rebalance(lpos, cpos, rpos); 1886| 122k| } 1887| 123k|} _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| 60.2k| { 1945| 60.2k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 60.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| 147k| { 1925| 147k| return concat_leafs(lpos, tpos, rpos); 1926| 147k| } _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| 147k|{ 1839| 147k| static_assert(Node::bits >= 2, ""); 1840| 147k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 147k, False: 0] ------------------ 1841| 147k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 147k, False: 0] ------------------ 1842| 147k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 147k, False: 0] ------------------ 1843| 147k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 147k, False: 0] ------------------ 1844| 147k| return { 1845| 147k| Node::bits_leaf, 1846| 147k| lpos.node()->inc(), 1847| 147k| lpos.count(), 1848| 147k| tpos.node()->inc(), 1849| 147k| tpos.count(), 1850| 147k| rpos.node()->inc(), 1851| 147k| rpos.count(), 1852| 147k| }; 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| 147k|} _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| 63.9k| { 1938| 63.9k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 63.9k| } _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| 122k|{ 1824| 122k| auto plan = concat_rebalance_plan{}; 1825| 122k| plan.fill(lpos, cpos, rpos); 1826| 122k| plan.shuffle(cpos.shift()); 1827| 122k| IMMER_TRY { ------------------ | | 49| 122k|#define IMMER_TRY try ------------------ 1828| 122k| return plan.merge(lpos, cpos, rpos); 1829| 122k| } 1830| 122k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 122k|} _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| 122k| { 1753| 122k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 122k, False: 0] ------------------ 1754| 122k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 122k, False: 0] ------------------ 1755| 122k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 122k| lpos.each_left_sub(visitor_t{}, *this); 1757| 122k| cpos.each_sub(visitor_t{}, *this); 1758| 122k| rpos.each_right_sub(visitor_t{}, *this); 1759| 122k| } _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| 122k| { 1803| 122k| using node_t = node_type; 1804| 122k| using merger_t = concat_merger; 1805| 122k| using visitor_t = concat_merger_visitor; 1806| 122k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 122k| IMMER_TRY { ------------------ | | 49| 122k|#define IMMER_TRY try ------------------ 1808| 122k| lpos.each_left_sub(visitor_t{}, merger); 1809| 122k| cpos.each_sub(visitor_t{}, merger); 1810| 122k| rpos.each_right_sub(visitor_t{}, merger); 1811| 122k| cpos.each_sub(dec_visitor{}); 1812| 122k| return merger.finish(); 1813| 122k| } 1814| 122k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 122k| } _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| 87.3k| { 1945| 87.3k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 87.3k| } _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| 368k| { 1925| 368k| return concat_leafs(lpos, tpos, rpos); 1926| 368k| } _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| 368k|{ 1839| 368k| static_assert(Node::bits >= 2, ""); 1840| 368k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 368k, False: 0] ------------------ 1841| 368k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 368k, False: 0] ------------------ 1842| 368k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 368k, False: 0] ------------------ 1843| 368k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 368k, False: 0] ------------------ 1844| 368k| return { 1845| 368k| Node::bits_leaf, 1846| 368k| lpos.node()->inc(), 1847| 368k| lpos.count(), 1848| 368k| tpos.node()->inc(), 1849| 368k| tpos.count(), 1850| 368k| rpos.node()->inc(), 1851| 368k| rpos.count(), 1852| 368k| }; 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| 368k|} _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| 58.2k| { 1938| 58.2k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 58.2k| } _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| 130k|{ 1824| 130k| auto plan = concat_rebalance_plan{}; 1825| 130k| plan.fill(lpos, cpos, rpos); 1826| 130k| plan.shuffle(cpos.shift()); 1827| 130k| IMMER_TRY { ------------------ | | 49| 130k|#define IMMER_TRY try ------------------ 1828| 130k| return plan.merge(lpos, cpos, rpos); 1829| 130k| } 1830| 130k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 130k|} _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| 130k| { 1753| 130k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 130k, False: 0] ------------------ 1754| 130k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 130k, False: 0] ------------------ 1755| 130k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 130k| lpos.each_left_sub(visitor_t{}, *this); 1757| 130k| cpos.each_sub(visitor_t{}, *this); 1758| 130k| rpos.each_right_sub(visitor_t{}, *this); 1759| 130k| } _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| 130k| { 1803| 130k| using node_t = node_type; 1804| 130k| using merger_t = concat_merger; 1805| 130k| using visitor_t = concat_merger_visitor; 1806| 130k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 130k| IMMER_TRY { ------------------ | | 49| 130k|#define IMMER_TRY try ------------------ 1808| 130k| lpos.each_left_sub(visitor_t{}, merger); 1809| 130k| cpos.each_sub(visitor_t{}, merger); 1810| 130k| rpos.each_right_sub(visitor_t{}, merger); 1811| 130k| cpos.each_sub(dec_visitor{}); 1812| 130k| return merger.finish(); 1813| 130k| } 1814| 130k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 130k| } _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| 368k| { 1945| 368k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 368k| } _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| 771k| { 1938| 771k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 771k| } _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| 656k|{ 1824| 656k| auto plan = concat_rebalance_plan{}; 1825| 656k| plan.fill(lpos, cpos, rpos); 1826| 656k| plan.shuffle(cpos.shift()); 1827| 656k| IMMER_TRY { ------------------ | | 49| 656k|#define IMMER_TRY try ------------------ 1828| 656k| return plan.merge(lpos, cpos, rpos); 1829| 656k| } 1830| 656k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 656k|} _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| 656k| { 1753| 656k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 656k, False: 0] ------------------ 1754| 656k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 656k, False: 0] ------------------ 1755| 656k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 656k| lpos.each_left_sub(visitor_t{}, *this); 1757| 656k| cpos.each_sub(visitor_t{}, *this); 1758| 656k| rpos.each_right_sub(visitor_t{}, *this); 1759| 656k| } _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| 656k| { 1803| 656k| using node_t = node_type; 1804| 656k| using merger_t = concat_merger; 1805| 656k| using visitor_t = concat_merger_visitor; 1806| 656k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 656k| IMMER_TRY { ------------------ | | 49| 656k|#define IMMER_TRY try ------------------ 1808| 656k| lpos.each_left_sub(visitor_t{}, merger); 1809| 656k| cpos.each_sub(visitor_t{}, merger); 1810| 656k| rpos.each_right_sub(visitor_t{}, merger); 1811| 656k| cpos.each_sub(dec_visitor{}); 1812| 656k| return merger.finish(); 1813| 656k| } 1814| 656k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 656k| } _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.29M|{ 1824| 2.29M| auto plan = concat_rebalance_plan{}; 1825| 2.29M| plan.fill(lpos, cpos, rpos); 1826| 2.29M| plan.shuffle(cpos.shift()); 1827| 2.29M| IMMER_TRY { ------------------ | | 49| 2.29M|#define IMMER_TRY try ------------------ 1828| 2.29M| return plan.merge(lpos, cpos, rpos); 1829| 2.29M| } 1830| 2.29M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.29M|} _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.29M| { 1753| 2.29M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.29M, False: 0] ------------------ 1754| 2.29M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.29M, False: 0] ------------------ 1755| 2.29M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.29M| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.29M| cpos.each_sub(visitor_t{}, *this); 1758| 2.29M| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.29M| } _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.29M| { 1803| 2.29M| using node_t = node_type; 1804| 2.29M| using merger_t = concat_merger; 1805| 2.29M| using visitor_t = concat_merger_visitor; 1806| 2.29M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.29M| IMMER_TRY { ------------------ | | 49| 2.29M|#define IMMER_TRY try ------------------ 1808| 2.29M| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.29M| cpos.each_sub(visitor_t{}, merger); 1810| 2.29M| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.29M| cpos.each_sub(dec_visitor{}); 1812| 2.29M| return merger.finish(); 1813| 2.29M| } 1814| 2.29M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.29M| } _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.82M| { 1918| 1.82M| return concat_inners(lpos, tpos, rpos); 1919| 1.82M| } _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| 759| { 1918| 759| return concat_inners(lpos, tpos, rpos); 1919| 759| } _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| 87.1k|{ 1873| 87.1k| auto lshift = lpos.shift(); 1874| 87.1k| auto rshift = rpos.shift(); 1875| 87.1k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 70.4k, False: 16.7k] ------------------ 1876| 70.4k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 70.4k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 70.4k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 844, False: 15.8k] ------------------ 1879| 844| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 844| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 15.8k| } else { 1882| 15.8k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 15.8k, False: 0] ------------------ 1883| 15.8k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 15.8k] | Branch (1883:9): [True: 15.8k, False: 0] | Branch (1883:9): [True: 15.8k, False: 0] ------------------ 1884| 15.8k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 15.8k| return concat_rebalance(lpos, cpos, rpos); 1886| 15.8k| } 1887| 87.1k|} _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| 70.1k| { 1898| 70.1k| return concat_inners(lpos, tpos, rpos); 1899| 70.1k| } _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| 2.87k| { 1918| 2.87k| return concat_inners(lpos, tpos, rpos); 1919| 2.87k| } _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| 2.87k|{ 1873| 2.87k| auto lshift = lpos.shift(); 1874| 2.87k| auto rshift = rpos.shift(); 1875| 2.87k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 2.87k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 2.87k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 302, False: 2.57k] ------------------ 1879| 302| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 302| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 2.57k| } else { 1882| 2.57k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 2.57k, False: 0] ------------------ 1883| 2.57k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 2.57k] | Branch (1883:9): [True: 2.57k, False: 0] | Branch (1883:9): [True: 2.57k, False: 0] ------------------ 1884| 2.57k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 2.57k| return concat_rebalance(lpos, cpos, rpos); 1886| 2.57k| } 1887| 2.87k|} _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| 1.14k| { 1938| 1.14k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 1.14k| } _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| 2.57k|{ 1824| 2.57k| auto plan = concat_rebalance_plan{}; 1825| 2.57k| plan.fill(lpos, cpos, rpos); 1826| 2.57k| plan.shuffle(cpos.shift()); 1827| 2.57k| IMMER_TRY { ------------------ | | 49| 2.57k|#define IMMER_TRY try ------------------ 1828| 2.57k| return plan.merge(lpos, cpos, rpos); 1829| 2.57k| } 1830| 2.57k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.57k|} _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| 2.57k| { 1753| 2.57k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.57k, False: 0] ------------------ 1754| 2.57k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.57k, False: 0] ------------------ 1755| 2.57k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.57k| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.57k| cpos.each_sub(visitor_t{}, *this); 1758| 2.57k| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.57k| } _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| 2.57k| { 1803| 2.57k| using node_t = node_type; 1804| 2.57k| using merger_t = concat_merger; 1805| 2.57k| using visitor_t = concat_merger_visitor; 1806| 2.57k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.57k| IMMER_TRY { ------------------ | | 49| 2.57k|#define IMMER_TRY try ------------------ 1808| 2.57k| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.57k| cpos.each_sub(visitor_t{}, merger); 1810| 2.57k| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.57k| cpos.each_sub(dec_visitor{}); 1812| 2.57k| return merger.finish(); 1813| 2.57k| } 1814| 2.57k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.57k| } _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| 586| { 1938| 586| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 586| } _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| 15.8k|{ 1824| 15.8k| auto plan = concat_rebalance_plan{}; 1825| 15.8k| plan.fill(lpos, cpos, rpos); 1826| 15.8k| plan.shuffle(cpos.shift()); 1827| 15.8k| IMMER_TRY { ------------------ | | 49| 15.8k|#define IMMER_TRY try ------------------ 1828| 15.8k| return plan.merge(lpos, cpos, rpos); 1829| 15.8k| } 1830| 15.8k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 15.8k|} _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| 15.8k| { 1753| 15.8k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 15.8k, False: 0] ------------------ 1754| 15.8k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 15.8k, False: 0] ------------------ 1755| 15.8k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 15.8k| lpos.each_left_sub(visitor_t{}, *this); 1757| 15.8k| cpos.each_sub(visitor_t{}, *this); 1758| 15.8k| rpos.each_right_sub(visitor_t{}, *this); 1759| 15.8k| } _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| 15.8k| { 1803| 15.8k| using node_t = node_type; 1804| 15.8k| using merger_t = concat_merger; 1805| 15.8k| using visitor_t = concat_merger_visitor; 1806| 15.8k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 15.8k| IMMER_TRY { ------------------ | | 49| 15.8k|#define IMMER_TRY try ------------------ 1808| 15.8k| lpos.each_left_sub(visitor_t{}, merger); 1809| 15.8k| cpos.each_sub(visitor_t{}, merger); 1810| 15.8k| rpos.each_right_sub(visitor_t{}, merger); 1811| 15.8k| cpos.each_sub(dec_visitor{}); 1812| 15.8k| return merger.finish(); 1813| 15.8k| } 1814| 15.8k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 15.8k| } _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.73M| { 1938| 1.73M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 1.73M| } _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.21M|{ 1824| 2.21M| auto plan = concat_rebalance_plan{}; 1825| 2.21M| plan.fill(lpos, cpos, rpos); 1826| 2.21M| plan.shuffle(cpos.shift()); 1827| 2.21M| IMMER_TRY { ------------------ | | 49| 2.21M|#define IMMER_TRY try ------------------ 1828| 2.21M| return plan.merge(lpos, cpos, rpos); 1829| 2.21M| } 1830| 2.21M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.21M|} _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.21M| { 1753| 2.21M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.21M, False: 0] ------------------ 1754| 2.21M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.21M, False: 0] ------------------ 1755| 2.21M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.21M| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.21M| cpos.each_sub(visitor_t{}, *this); 1758| 2.21M| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.21M| } _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.21M| { 1803| 2.21M| using node_t = node_type; 1804| 2.21M| using merger_t = concat_merger; 1805| 2.21M| using visitor_t = concat_merger_visitor; 1806| 2.21M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.21M| IMMER_TRY { ------------------ | | 49| 2.21M|#define IMMER_TRY try ------------------ 1808| 2.21M| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.21M| cpos.each_sub(visitor_t{}, merger); 1810| 2.21M| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.21M| cpos.each_sub(dec_visitor{}); 1812| 2.21M| return merger.finish(); 1813| 2.21M| } 1814| 2.21M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.21M| } _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| 16.3k| { 1959| 16.3k| return concat_inners(lpos, tpos, rpos); 1960| 16.3k| } _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.4k| { 1972| 14.4k| return visit_maybe_relaxed_sub( 1973| 14.4k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 14.4k| } _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.92k| { 1959| 6.92k| return concat_inners(lpos, tpos, rpos); 1960| 6.92k| } _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.55k| { 1959| 7.55k| return concat_inners(lpos, tpos, rpos); 1960| 7.55k| } _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| 68.3k| { 681| 68.3k| auto node = pos.node(); 682| 68.3k| auto level = pos.shift(); 683| 68.3k| auto idx = pos.count() - 1; 684| 68.3k| auto children = pos.size(idx); 685| 68.3k| auto new_idx = 686| 68.3k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 2.27k, False: 66.0k] | Branch (686:47): [True: 510, False: 65.5k] ------------------ 687| 68.3k| auto new_child = static_cast(nullptr); 688| 68.3k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [True: 68.3k, Folded] | Branch (688:38): [True: 64.5k, False: 3.78k] ------------------ 689| | 690| 68.3k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 1.14k, False: 67.1k] ------------------ 691| 1.14k| return nullptr; 692| 67.1k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 65.5k, False: 1.64k] ------------------ 693| 65.5k| new_child = 694| 65.5k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 62.8k, False: 2.72k] ------------------ 695| 65.5k| : pos.last_oh_csh( 696| 2.72k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 65.5k| if (!new_child) { ------------------ | Branch (697:17): [True: 629, False: 64.9k] ------------------ 698| 629| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 296, False: 333] ------------------ 699| 296| new_child = node_t::make_path_e(e, level - B, tail); 700| 333| else 701| 333| return nullptr; 702| 629| } 703| 65.5k| } else 704| 1.64k| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 66.8k| if (mutate) { ------------------ | Branch (706:13): [True: 64.2k, False: 2.60k] ------------------ 707| 64.2k| auto count = new_idx + 1; 708| 64.2k| auto relaxed = node->ensure_mutable_relaxed_n(e, new_idx); 709| 64.2k| node->inner()[new_idx] = new_child; 710| 64.2k| relaxed->d.sizes[new_idx] = pos.size() + ts; 711| 64.2k| relaxed->d.count = count; 712| 64.2k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (712:13): [True: 64.2k, False: 0] ------------------ 713| 64.2k| return node; 714| 64.2k| } else { 715| 2.60k| IMMER_TRY { ------------------ | | 49| 2.60k|#define IMMER_TRY try ------------------ 716| 2.60k| auto count = new_idx + 1; 717| 2.60k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 2.60k| auto relaxed = new_node->relaxed(); 719| 2.60k| new_node->inner()[new_idx] = new_child; 720| 2.60k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 2.60k| relaxed->d.count = count; 722| 2.60k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 2.60k, False: 0] ------------------ 723| 2.60k| if (Mutating) ------------------ | Branch (723:21): [True: 2.60k, Folded] ------------------ 724| 2.60k| pos.visit(dec_visitor{}); 725| 2.60k| return new_node; 726| 2.60k| } 727| 2.60k| 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.60k| } 737| 66.8k| } _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| 53.2k| { 742| 53.2k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 53.2k, False: 0] ------------------ 743| 53.2k| auto node = pos.node(); 744| 53.2k| auto idx = pos.index(pos.size() - 1); 745| 53.2k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 53.2k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 53.2k, Folded] | Branch (746:36): [True: 52.6k, False: 676] ------------------ 747| 53.2k| if (mutate) { ------------------ | Branch (747:13): [True: 52.6k, False: 676] ------------------ 748| 52.6k| node->inner()[new_idx] = 749| 52.6k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 51.7k, False: 878] ------------------ 750| | /* otherwise */ 751| 52.6k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 52.6k| return node; 753| 52.6k| } else { 754| 676| auto new_parent = node_t::make_inner_e(e); 755| 676| IMMER_TRY { ------------------ | | 49| 676|#define IMMER_TRY try ------------------ 756| 676| new_parent->inner()[new_idx] = 757| 676| idx == new_idx ------------------ | Branch (757:21): [True: 359, False: 317] ------------------ 758| 676| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 676| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 676| node_t::do_copy_inner(new_parent, node, new_idx); 762| 676| if (Mutating) ------------------ | Branch (762:21): [True: 676, Folded] ------------------ 763| 676| pos.visit(dec_visitor{}); 764| 676| return new_parent; 765| 676| } 766| 676| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 676| } 771| 53.2k| } _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| 954k| { 742| 954k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 954k, False: 0] ------------------ 743| 954k| auto node = pos.node(); 744| 954k| auto idx = pos.index(pos.size() - 1); 745| 954k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 954k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 954k, Folded] | Branch (746:36): [True: 953k, False: 547] ------------------ 747| 954k| if (mutate) { ------------------ | Branch (747:13): [True: 953k, False: 547] ------------------ 748| 953k| node->inner()[new_idx] = 749| 953k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 751k, False: 201k] ------------------ 750| | /* otherwise */ 751| 953k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 953k| return node; 753| 953k| } else { 754| 547| auto new_parent = node_t::make_inner_e(e); 755| 547| IMMER_TRY { ------------------ | | 49| 547|#define IMMER_TRY try ------------------ 756| 547| new_parent->inner()[new_idx] = 757| 547| idx == new_idx ------------------ | Branch (757:21): [True: 246, False: 301] ------------------ 758| 547| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 547| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 547| node_t::do_copy_inner(new_parent, node, new_idx); 762| 547| if (Mutating) ------------------ | Branch (762:21): [True: 547, Folded] ------------------ 763| 547| pos.visit(dec_visitor{}); 764| 547| return new_parent; 765| 547| } 766| 547| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 547| } 771| 954k| } _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.28k| { 742| 3.28k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 3.28k, False: 0] ------------------ 743| 3.28k| auto node = pos.node(); 744| 3.28k| auto idx = pos.index(pos.size() - 1); 745| 3.28k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 3.28k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 3.28k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 3.28k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 3.28k] ------------------ 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.28k| } else { 754| 3.28k| auto new_parent = node_t::make_inner_e(e); 755| 3.28k| IMMER_TRY { ------------------ | | 49| 3.28k|#define IMMER_TRY try ------------------ 756| 3.28k| new_parent->inner()[new_idx] = 757| 3.28k| idx == new_idx ------------------ | Branch (757:21): [True: 1.53k, False: 1.75k] ------------------ 758| 3.28k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 3.28k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 3.28k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 3.28k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 3.28k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 3.28k| return new_parent; 765| 3.28k| } 766| 3.28k| 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.28k| } 771| 3.28k| } _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| 7.99k| { 681| 7.99k| auto node = pos.node(); 682| 7.99k| auto level = pos.shift(); 683| 7.99k| auto idx = pos.count() - 1; 684| 7.99k| auto children = pos.size(idx); 685| 7.99k| auto new_idx = 686| 7.99k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 1.15k, False: 6.84k] | Branch (686:47): [True: 457, False: 6.38k] ------------------ 687| 7.99k| auto new_child = static_cast(nullptr); 688| 7.99k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [Folded, False: 7.99k] | Branch (688:38): [True: 0, False: 0] ------------------ 689| | 690| 7.99k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 607, False: 7.39k] ------------------ 691| 607| return nullptr; 692| 7.39k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 6.38k, False: 1.00k] ------------------ 693| 6.38k| new_child = 694| 6.38k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 0, False: 6.38k] ------------------ 695| 6.38k| : pos.last_oh_csh( 696| 6.38k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 6.38k| if (!new_child) { ------------------ | Branch (697:17): [True: 602, False: 5.78k] ------------------ 698| 602| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 283, False: 319] ------------------ 699| 283| new_child = node_t::make_path_e(e, level - B, tail); 700| 319| else 701| 319| return nullptr; 702| 602| } 703| 6.38k| } else 704| 1.00k| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 7.07k| if (mutate) { ------------------ | Branch (706:13): [True: 0, False: 7.07k] ------------------ 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| 7.07k| } else { 715| 7.07k| IMMER_TRY { ------------------ | | 49| 7.07k|#define IMMER_TRY try ------------------ 716| 7.07k| auto count = new_idx + 1; 717| 7.07k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 7.07k| auto relaxed = new_node->relaxed(); 719| 7.07k| new_node->inner()[new_idx] = new_child; 720| 7.07k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 7.07k| relaxed->d.count = count; 722| 7.07k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 7.07k, False: 0] ------------------ 723| 7.07k| if (Mutating) ------------------ | Branch (723:21): [Folded, False: 7.07k] ------------------ 724| 0| pos.visit(dec_visitor{}); 725| 7.07k| return new_node; 726| 7.07k| } 727| 7.07k| 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| 7.07k| } 737| 7.07k| } _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.12k| { 742| 1.12k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 1.12k, False: 0] ------------------ 743| 1.12k| auto node = pos.node(); 744| 1.12k| auto idx = pos.index(pos.size() - 1); 745| 1.12k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 1.12k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 1.12k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 1.12k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 1.12k] ------------------ 748| 0| node->inner()[new_idx] = 749| 0| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 0, False: 0] ------------------ 750| | /* otherwise */ 751| 0| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 0| return node; 753| 1.12k| } else { 754| 1.12k| auto new_parent = node_t::make_inner_e(e); 755| 1.12k| IMMER_TRY { ------------------ | | 49| 1.12k|#define IMMER_TRY try ------------------ 756| 1.12k| new_parent->inner()[new_idx] = 757| 1.12k| idx == new_idx ------------------ | Branch (757:21): [True: 719, False: 401] ------------------ 758| 1.12k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 1.12k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 1.12k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 1.12k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 1.12k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 1.12k| return new_parent; 765| 1.12k| } 766| 1.12k| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 1.12k| } 771| 1.12k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_: 741| 155k| { 742| 155k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 155k, False: 0] ------------------ 743| 155k| auto node = pos.node(); 744| 155k| auto idx = pos.index(pos.size() - 1); 745| 155k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 155k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 155k, Folded] | Branch (746:36): [True: 154k, False: 675] ------------------ 747| 155k| if (mutate) { ------------------ | Branch (747:13): [True: 154k, False: 675] ------------------ 748| 154k| node->inner()[new_idx] = 749| 154k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 150k, False: 3.86k] ------------------ 750| | /* otherwise */ 751| 154k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 154k| return node; 753| 154k| } else { 754| 675| auto new_parent = node_t::make_inner_e(e); 755| 675| IMMER_TRY { ------------------ | | 49| 675|#define IMMER_TRY try ------------------ 756| 675| new_parent->inner()[new_idx] = 757| 675| idx == new_idx ------------------ | Branch (757:21): [True: 429, False: 246] ------------------ 758| 675| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 675| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 675| node_t::do_copy_inner(new_parent, node, new_idx); 762| 675| if (Mutating) ------------------ | Branch (762:21): [True: 675, Folded] ------------------ 763| 675| pos.visit(dec_visitor{}); 764| 675| return new_parent; 765| 675| } 766| 675| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 675| } 771| 155k| } _ZN5immer6detail4rbts17dec_empty_regularINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEvPT_: 580| 1.97k|{ 581| 1.97k| make_empty_regular_pos(node).visit(dec_visitor()); 582| 1.97k|} _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| 53.0k| { 596| 53.0k| auto offset = pos.index(idx); 597| 53.0k| auto count = pos.count(); 598| 53.0k| auto node = pos.node(); 599| 53.0k| if (node->can_mutate(e)) { ------------------ | Branch (599:13): [True: 43.3k, False: 9.75k] ------------------ 600| 43.3k| return pos.towards_oh( 601| 43.3k| this_t{}, idx, offset, e, &node->inner()[offset]); 602| 43.3k| } else { 603| 9.75k| auto new_node = node_t::copy_inner_sr_e(e, node, count); 604| 9.75k| IMMER_TRY { ------------------ | | 49| 9.75k|#define IMMER_TRY try ------------------ 605| 9.75k| auto& res = pos.towards_oh( 606| 9.75k| this_t{}, idx, offset, e, &new_node->inner()[offset]); 607| 9.75k| pos.visit(dec_visitor{}); 608| 9.75k| *location = new_node; 609| 9.75k| return res; 610| 9.75k| } 611| 9.75k| IMMER_CATCH (...) { 612| 0| dec_relaxed(new_node, pos.shift()); 613| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 614| 0| } 615| 9.75k| } 616| 53.0k| } _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| 16.2k| { 653| 16.2k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 16.2k, False: 0] ------------------ 654| 16.2k| auto node = pos.node(); 655| 16.2k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 14.4k, False: 1.79k] ------------------ 656| 14.4k| return node->leaf()[pos.index(idx)]; 657| 14.4k| } else { 658| 1.79k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 1.79k| pos.visit(dec_visitor{}); 660| 1.79k| *location = new_node; 661| 1.79k| return new_node->leaf()[pos.index(idx)]; 662| 1.79k| } 663| 16.2k| } _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| 6.62k| { 622| 6.62k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 6.62k, False: 0] ------------------ 623| 6.62k| auto offset = pos.index(idx); 624| 6.62k| auto count = pos.count(); 625| 6.62k| auto node = pos.node(); 626| 6.62k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 5.01k, False: 1.61k] ------------------ 627| 5.01k| return pos.towards_oh_ch( 628| 5.01k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 5.01k| } else { 630| 1.61k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.61k| IMMER_TRY { ------------------ | | 49| 1.61k|#define IMMER_TRY try ------------------ 632| 1.61k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.61k| idx, 634| 1.61k| offset, 635| 1.61k| count, 636| 1.61k| e, 637| 1.61k| &new_node->inner()[offset]); 638| 1.61k| pos.visit(dec_visitor{}); 639| 1.61k| *location = new_node; 640| 1.61k| return res; 641| 1.61k| } 642| 1.61k| 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.61k| } 647| 6.62k| } _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| 5.53k| { 653| 5.53k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 5.53k, False: 0] ------------------ 654| 5.53k| auto node = pos.node(); 655| 5.53k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 3.75k, False: 1.77k] ------------------ 656| 3.75k| return node->leaf()[pos.index(idx)]; 657| 3.75k| } else { 658| 1.77k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 1.77k| pos.visit(dec_visitor{}); 660| 1.77k| *location = new_node; 661| 1.77k| return new_node->leaf()[pos.index(idx)]; 662| 1.77k| } 663| 5.53k| } _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| 4.85k| { 622| 4.85k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 4.85k, False: 0] ------------------ 623| 4.85k| auto offset = pos.index(idx); 624| 4.85k| auto count = pos.count(); 625| 4.85k| auto node = pos.node(); 626| 4.85k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 3.37k, False: 1.48k] ------------------ 627| 3.37k| return pos.towards_oh_ch( 628| 3.37k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 3.37k| } else { 630| 1.48k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.48k| IMMER_TRY { ------------------ | | 49| 1.48k|#define IMMER_TRY try ------------------ 632| 1.48k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.48k| idx, 634| 1.48k| offset, 635| 1.48k| count, 636| 1.48k| e, 637| 1.48k| &new_node->inner()[offset]); 638| 1.48k| pos.visit(dec_visitor{}); 639| 1.48k| *location = new_node; 640| 1.48k| return res; 641| 1.48k| } 642| 1.48k| 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.48k| } 647| 4.85k| } _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.09k| { 653| 1.09k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 1.09k, False: 0] ------------------ 654| 1.09k| auto node = pos.node(); 655| 1.09k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 756, False: 336] ------------------ 656| 756| return node->leaf()[pos.index(idx)]; 657| 756| } else { 658| 336| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 336| pos.visit(dec_visitor{}); 660| 336| *location = new_node; 661| 336| return new_node->leaf()[pos.index(idx)]; 662| 336| } 663| 1.09k| } _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| 2.41k| { 622| 2.41k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 2.41k, False: 0] ------------------ 623| 2.41k| auto offset = pos.index(idx); 624| 2.41k| auto count = pos.count(); 625| 2.41k| auto node = pos.node(); 626| 2.41k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.91k, False: 493] ------------------ 627| 1.91k| return pos.towards_oh_ch( 628| 1.91k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.91k| } else { 630| 493| auto new_node = node_t::copy_inner_e(e, node, count); 631| 493| IMMER_TRY { ------------------ | | 49| 493|#define IMMER_TRY try ------------------ 632| 493| auto& res = pos.towards_oh_ch(this_t{}, 633| 493| idx, 634| 493| offset, 635| 493| count, 636| 493| e, 637| 493| &new_node->inner()[offset]); 638| 493| pos.visit(dec_visitor{}); 639| 493| *location = new_node; 640| 493| return res; 641| 493| } 642| 493| 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| 493| } 647| 2.41k| } _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| 54.0k| { 914| 54.0k| auto idx = pos.index(last); 915| 54.0k| auto node = pos.node(); 916| 54.0k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 54.0k, Folded] | Branch (916:35): [True: 46.4k, False: 7.65k] ------------------ 917| 54.0k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 54.0k, Folded] | Branch (917:25): [True: 36.4k, False: 17.6k] ------------------ 918| 36.4k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 32.4k, False: 4.05k] ------------------ 919| 36.4k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 36.4k| if (Mutating) ------------------ | Branch (920:17): [True: 36.4k, Folded] ------------------ 921| 36.4k| pos.visit(dec_right_visitor{}, count_t{1}); 922| 36.4k| return res; 923| 36.4k| } else { 924| 17.6k| using std::get; 925| 17.6k| auto subs = 926| 17.6k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 14.0k, False: 3.60k] ------------------ 927| 17.6k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 17.6k| auto next = get<1>(subs); 929| 17.6k| auto ts = get<2>(subs); 930| 17.6k| auto tail = get<3>(subs); 931| 17.6k| IMMER_TRY { ------------------ | | 49| 17.6k|#define IMMER_TRY try ------------------ 932| 17.6k| if (next) { ------------------ | Branch (932:21): [True: 13.0k, False: 4.57k] ------------------ 933| 13.0k| if (mutate) { ------------------ | Branch (933:25): [True: 11.0k, False: 2.05k] ------------------ 934| 11.0k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 11.0k| pos.each_right(dec_visitor{}, idx + 1); 936| 11.0k| node->inner()[idx] = next; 937| 11.0k| nodr->d.sizes[idx] = last + 1 - ts; 938| 11.0k| nodr->d.count = idx + 1; 939| 11.0k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 11.0k, False: 0] ------------------ 940| 11.0k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 11.0k| } else { 942| 2.05k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 2.05k| auto newr = newn->relaxed(); 944| 2.05k| newn->inner()[idx] = next; 945| 2.05k| newr->d.sizes[idx] = last + 1 - ts; 946| 2.05k| newr->d.count = idx + 1; 947| 2.05k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 2.05k, False: 0] ------------------ 948| 2.05k| if (Mutating) ------------------ | Branch (948:29): [True: 2.05k, Folded] ------------------ 949| 2.05k| pos.visit(dec_visitor{}); 950| 2.05k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 2.05k| } 952| 13.0k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 4.57k] ------------------ 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.57k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 4.57k, Folded] | Branch (956:40): [True: 3.74k, False: 830] | Branch (956:52): [True: 2.92k, False: 812] ------------------ 957| 2.92k| auto newn = pos.node()->inner()[0]; 958| 2.92k| if (!mutate) ------------------ | Branch (958:25): [True: 961, False: 1.96k] ------------------ 959| 961| newn->inc(); 960| 2.92k| if (Mutating) ------------------ | Branch (960:25): [True: 2.92k, Folded] ------------------ 961| 2.92k| pos.visit(dec_right_visitor{}, count_t{2}); 962| 2.92k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 2.92k| } else { 964| 1.64k| if (mutate) { ------------------ | Branch (964:25): [True: 1.05k, False: 592] ------------------ 965| 1.05k| pos.each_right(dec_visitor{}, idx + 1); 966| 1.05k| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 1.05k| return std::make_tuple(pos.shift(), node, ts, tail); 968| 1.05k| } else { 969| 592| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 592| if (Mutating) ------------------ | Branch (970:29): [True: 592, Folded] ------------------ 971| 592| pos.visit(dec_visitor{}); 972| 592| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 592| } 974| 1.64k| } 975| 17.6k| } 976| 17.6k| 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| 17.6k| } 987| 54.0k| } _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| 997| { 1060| 997| auto old_tail_size = pos.count(); 1061| 997| auto new_tail_size = pos.index(last) + 1; 1062| 997| auto node = pos.node(); 1063| 997| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 997, Folded] | Branch (1063:42): [True: 266, False: 731] ------------------ 1064| 997| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 269, False: 728] ------------------ 1065| 269| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 269] ------------------ 1066| 0| node->inc(); 1067| 269| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 728| } else if (mutate) { ------------------ | Branch (1068:20): [True: 259, False: 469] ------------------ 1069| 259| detail::destroy_n(node->leaf() + new_tail_size, 1070| 259| old_tail_size - new_tail_size); 1071| 259| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 469| } else { 1073| 469| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 469| if (Mutating) ------------------ | Branch (1074:17): [True: 469, Folded] ------------------ 1075| 469| pos.visit(dec_visitor{}); 1076| 469| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 469| } 1078| 997| } _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| 580| { 1060| 580| auto old_tail_size = pos.count(); 1061| 580| auto new_tail_size = pos.index(last) + 1; 1062| 580| auto node = pos.node(); 1063| 580| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 580] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 580| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 313, False: 267] ------------------ 1065| 313| if (!Mutating) ------------------ | Branch (1065:17): [True: 313, Folded] ------------------ 1066| 313| node->inc(); 1067| 313| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 313| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 267] ------------------ 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| 267| } else { 1073| 267| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 267| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 267] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 267| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 267| } 1078| 580| } _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| 13.2k| { 914| 13.2k| auto idx = pos.index(last); 915| 13.2k| auto node = pos.node(); 916| 13.2k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 13.2k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 13.2k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 13.2k, Folded] | Branch (917:25): [True: 11.3k, False: 1.88k] ------------------ 918| 11.3k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 0, False: 11.3k] ------------------ 919| 11.3k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 11.3k| if (Mutating) ------------------ | Branch (920:17): [Folded, False: 11.3k] ------------------ 921| 0| pos.visit(dec_right_visitor{}, count_t{1}); 922| 11.3k| return res; 923| 11.3k| } else { 924| 1.88k| using std::get; 925| 1.88k| auto subs = 926| 1.88k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 1.88k] ------------------ 927| 1.88k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 1.88k| auto next = get<1>(subs); 929| 1.88k| auto ts = get<2>(subs); 930| 1.88k| auto tail = get<3>(subs); 931| 1.88k| IMMER_TRY { ------------------ | | 49| 1.88k|#define IMMER_TRY try ------------------ 932| 1.88k| if (next) { ------------------ | Branch (932:21): [True: 640, False: 1.24k] ------------------ 933| 640| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 640] ------------------ 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| 640| } else { 942| 640| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 640| auto newr = newn->relaxed(); 944| 640| newn->inner()[idx] = next; 945| 640| newr->d.sizes[idx] = last + 1 - ts; 946| 640| newr->d.count = idx + 1; 947| 640| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 640, False: 0] ------------------ 948| 640| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 640] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 640| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 640| } 952| 1.24k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 1.24k] ------------------ 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.24k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 1.24k, Folded] | Branch (956:40): [True: 689, False: 559] | Branch (956:52): [True: 377, False: 312] ------------------ 957| 377| auto newn = pos.node()->inner()[0]; 958| 377| if (!mutate) ------------------ | Branch (958:25): [True: 377, False: 0] ------------------ 959| 377| newn->inc(); 960| 377| if (Mutating) ------------------ | Branch (960:25): [Folded, False: 377] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 377| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 871| } else { 964| 871| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 871] ------------------ 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| 871| } else { 969| 871| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 871| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 871] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 871| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 871| } 974| 871| } 975| 1.88k| } 976| 1.88k| 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.88k| } 987| 13.2k| } _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.58k| { 992| 1.58k| auto idx = pos.index(last); 993| 1.58k| auto node = pos.node(); 994| 1.58k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.58k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.58k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.58k, Folded] | Branch (995:25): [True: 570, False: 1.01k] ------------------ 996| 570| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 570] ------------------ 997| 570| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 570| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 570] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 570| return res; 1001| 1.01k| } else { 1002| 1.01k| using std::get; 1003| 1.01k| auto subs = 1004| 1.01k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 1.01k] ------------------ 1005| 1.01k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.01k| auto next = get<1>(subs); 1007| 1.01k| auto ts = get<2>(subs); 1008| 1.01k| auto tail = get<3>(subs); 1009| 1.01k| IMMER_TRY { ------------------ | | 49| 1.01k|#define IMMER_TRY try ------------------ 1010| 1.01k| if (next) { ------------------ | Branch (1010:21): [True: 215, False: 801] ------------------ 1011| 215| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 215] ------------------ 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| 215| } else { 1016| 215| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 215| newn->inner()[idx] = next; 1018| 215| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 215] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 215| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 215| } 1022| 801| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 801] ------------------ 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| 801| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 801, Folded] | Branch (1026:40): [True: 554, False: 247] | Branch (1026:52): [True: 200, False: 354] ------------------ 1027| 200| auto newn = pos.node()->inner()[0]; 1028| 200| if (!mutate) ------------------ | Branch (1028:25): [True: 200, False: 0] ------------------ 1029| 200| newn->inc(); 1030| 200| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 200] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 200| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 601| } else { 1034| 601| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 601] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 601| } else { 1038| 601| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 601| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 601] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 601| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 601| } 1043| 601| } 1044| 1.01k| } 1045| 1.01k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 1.01k| } 1055| 1.58k| } _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.42k| { 1060| 1.42k| auto old_tail_size = pos.count(); 1061| 1.42k| auto new_tail_size = pos.index(last) + 1; 1062| 1.42k| auto node = pos.node(); 1063| 1.42k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 1.42k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 1.42k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 709, False: 719] ------------------ 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| 719| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 719] ------------------ 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| 719| } else { 1073| 719| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 719| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 719] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 719| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 719| } 1078| 1.42k| } _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.84k| { 992| 1.84k| auto idx = pos.index(last); 993| 1.84k| auto node = pos.node(); 994| 1.84k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.84k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.84k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.84k, Folded] | Branch (995:25): [True: 515, False: 1.32k] ------------------ 996| 515| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 515] ------------------ 997| 515| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 515| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 515] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 515| return res; 1001| 1.32k| } else { 1002| 1.32k| using std::get; 1003| 1.32k| auto subs = 1004| 1.32k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 1.32k] ------------------ 1005| 1.32k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.32k| auto next = get<1>(subs); 1007| 1.32k| auto ts = get<2>(subs); 1008| 1.32k| auto tail = get<3>(subs); 1009| 1.32k| IMMER_TRY { ------------------ | | 49| 1.32k|#define IMMER_TRY try ------------------ 1010| 1.32k| if (next) { ------------------ | Branch (1010:21): [True: 216, False: 1.11k] ------------------ 1011| 216| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 216] ------------------ 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| 216| } else { 1016| 216| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 216| newn->inner()[idx] = next; 1018| 216| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 216] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 216| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 216| } 1022| 1.11k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 1.11k] ------------------ 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| 1.11k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 1.11k, Folded] | Branch (1026:40): [True: 785, False: 328] | Branch (1026:52): [True: 283, False: 502] ------------------ 1027| 283| auto newn = pos.node()->inner()[0]; 1028| 283| if (!mutate) ------------------ | Branch (1028:25): [True: 283, False: 0] ------------------ 1029| 283| newn->inc(); 1030| 283| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 283] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 283| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 830| } else { 1034| 830| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 830] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 830| } else { 1038| 830| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 830| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 830] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 830| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 830| } 1043| 830| } 1044| 1.32k| } 1045| 1.32k| 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.32k| } 1055| 1.84k| } _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| 5.67k| { 1060| 5.67k| auto old_tail_size = pos.count(); 1061| 5.67k| auto new_tail_size = pos.index(last) + 1; 1062| 5.67k| auto node = pos.node(); 1063| 5.67k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 5.67k, Folded] | Branch (1063:42): [True: 973, False: 4.70k] ------------------ 1064| 5.67k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.06k, False: 4.61k] ------------------ 1065| 1.06k| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 1.06k] ------------------ 1066| 0| node->inc(); 1067| 1.06k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 4.61k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 927, False: 3.68k] ------------------ 1069| 927| detail::destroy_n(node->leaf() + new_tail_size, 1070| 927| old_tail_size - new_tail_size); 1071| 927| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 3.68k| } else { 1073| 3.68k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 3.68k| if (Mutating) ------------------ | Branch (1074:17): [True: 3.68k, Folded] ------------------ 1075| 3.68k| pos.visit(dec_visitor{}); 1076| 3.68k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 3.68k| } 1078| 5.67k| } _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.20k| { 992| 4.20k| auto idx = pos.index(last); 993| 4.20k| auto node = pos.node(); 994| 4.20k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 4.20k, Folded] | Branch (994:35): [True: 2.27k, False: 1.92k] ------------------ 995| 4.20k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 4.20k] | 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.20k| } else { 1002| 4.20k| using std::get; 1003| 4.20k| auto subs = 1004| 4.20k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 2.27k, False: 1.92k] ------------------ 1005| 4.20k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 4.20k| auto next = get<1>(subs); 1007| 4.20k| auto ts = get<2>(subs); 1008| 4.20k| auto tail = get<3>(subs); 1009| 4.20k| IMMER_TRY { ------------------ | | 49| 4.20k|#define IMMER_TRY try ------------------ 1010| 4.20k| if (next) { ------------------ | Branch (1010:21): [True: 767, False: 3.43k] ------------------ 1011| 767| if (mutate) { ------------------ | Branch (1011:25): [True: 551, False: 216] ------------------ 1012| 551| node->inner()[idx] = next; 1013| 551| pos.each_right(dec_visitor{}, idx + 1); 1014| 551| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 551| } else { 1016| 216| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 216| newn->inner()[idx] = next; 1018| 216| if (Mutating) ------------------ | Branch (1018:29): [True: 216, Folded] ------------------ 1019| 216| pos.visit(dec_visitor{}); 1020| 216| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 216| } 1022| 3.43k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.16k, False: 2.26k] ------------------ 1023| 1.16k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.16k, Folded] ------------------ 1024| 1.16k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.16k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 2.26k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 2.26k] | 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.26k| } else { 1034| 2.26k| if (mutate) { ------------------ | Branch (1034:25): [True: 1.19k, False: 1.07k] ------------------ 1035| 1.19k| pos.each_right(dec_visitor{}, idx + 1); 1036| 1.19k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.19k| } else { 1038| 1.07k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.07k| if (Mutating) ------------------ | Branch (1039:29): [True: 1.07k, Folded] ------------------ 1040| 1.07k| pos.visit(dec_visitor{}); 1041| 1.07k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.07k| } 1043| 2.26k| } 1044| 4.20k| } 1045| 4.20k| 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.20k| } 1055| 4.20k| } _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.26k| { 879| 3.26k| using node_t = node_type; 880| 3.26k| auto node = p.node(); 881| 3.26k| if (node->dec()) { ------------------ | Branch (881:13): [True: 1.67k, False: 1.58k] ------------------ 882| 1.67k| p.each_right(dec_t{}, idx); 883| 1.67k| node_t::delete_inner(node, p.count()); 884| 1.67k| } 885| 3.26k| } _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.70k| { 1060| 9.70k| auto old_tail_size = pos.count(); 1061| 9.70k| auto new_tail_size = pos.index(last) + 1; 1062| 9.70k| auto node = pos.node(); 1063| 9.70k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 9.70k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 9.70k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 2.74k, False: 6.95k] ------------------ 1065| 2.74k| if (!Mutating) ------------------ | Branch (1065:17): [True: 2.74k, Folded] ------------------ 1066| 2.74k| node->inc(); 1067| 2.74k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 6.95k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 6.95k] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 6.95k| } else { 1073| 6.95k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 6.95k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 6.95k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 6.95k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 6.95k| } 1078| 9.70k| } _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| 2.94k| { 992| 2.94k| auto idx = pos.index(last); 993| 2.94k| auto node = pos.node(); 994| 2.94k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 2.94k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 2.94k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 2.94k] | 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| 2.94k| } else { 1002| 2.94k| using std::get; 1003| 2.94k| auto subs = 1004| 2.94k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 2.94k] ------------------ 1005| 2.94k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 2.94k| auto next = get<1>(subs); 1007| 2.94k| auto ts = get<2>(subs); 1008| 2.94k| auto tail = get<3>(subs); 1009| 2.94k| IMMER_TRY { ------------------ | | 49| 2.94k|#define IMMER_TRY try ------------------ 1010| 2.94k| if (next) { ------------------ | Branch (1010:21): [True: 219, False: 2.72k] ------------------ 1011| 219| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 219] ------------------ 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| 219| } else { 1016| 219| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 219| newn->inner()[idx] = next; 1018| 219| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 219] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 219| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 219| } 1022| 2.72k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.23k, False: 1.49k] ------------------ 1023| 1.23k| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 1.23k] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.23k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.49k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.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): [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.49k| } else { 1034| 1.49k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 1.49k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.49k| } else { 1038| 1.49k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.49k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 1.49k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 1.49k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.49k| } 1043| 1.49k| } 1044| 2.94k| } 1045| 2.94k| 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.94k| } 1055| 2.94k| } _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| 406| { 1060| 406| auto old_tail_size = pos.count(); 1061| 406| auto new_tail_size = pos.index(last) + 1; 1062| 406| auto node = pos.node(); 1063| 406| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 406] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 406| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 202, False: 204] ------------------ 1065| 202| if (!Mutating) ------------------ | Branch (1065:17): [True: 202, Folded] ------------------ 1066| 202| node->inc(); 1067| 202| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 204| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 204] ------------------ 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| 204| } else { 1073| 204| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 204| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 204] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 204| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 204| } 1078| 406| } _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.68k| { 1060| 2.68k| auto old_tail_size = pos.count(); 1061| 2.68k| auto new_tail_size = pos.index(last) + 1; 1062| 2.68k| auto node = pos.node(); 1063| 2.68k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 2.68k, Folded] | Branch (1063:42): [True: 522, False: 2.16k] ------------------ 1064| 2.68k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 446, False: 2.24k] ------------------ 1065| 446| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 446] ------------------ 1066| 0| node->inc(); 1067| 446| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 2.24k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 286, False: 1.95k] ------------------ 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| 1.95k| } else { 1073| 1.95k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.95k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.95k, Folded] ------------------ 1075| 1.95k| pos.visit(dec_visitor{}); 1076| 1.95k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.95k| } 1078| 2.68k| } _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.09k| { 992| 6.09k| auto idx = pos.index(last); 993| 6.09k| auto node = pos.node(); 994| 6.09k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 6.09k, Folded] | Branch (994:35): [True: 5.48k, False: 610] ------------------ 995| 6.09k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 6.09k] | 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.09k| } else { 1002| 6.09k| using std::get; 1003| 6.09k| auto subs = 1004| 6.09k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 5.48k, False: 610] ------------------ 1005| 6.09k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 6.09k| auto next = get<1>(subs); 1007| 6.09k| auto ts = get<2>(subs); 1008| 6.09k| auto tail = get<3>(subs); 1009| 6.09k| IMMER_TRY { ------------------ | | 49| 6.09k|#define IMMER_TRY try ------------------ 1010| 6.09k| if (next) { ------------------ | Branch (1010:21): [True: 1.62k, False: 4.47k] ------------------ 1011| 1.62k| if (mutate) { ------------------ | Branch (1011:25): [True: 1.42k, False: 196] ------------------ 1012| 1.42k| node->inner()[idx] = next; 1013| 1.42k| pos.each_right(dec_visitor{}, idx + 1); 1014| 1.42k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 1.42k| } else { 1016| 196| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 196| newn->inner()[idx] = next; 1018| 196| if (Mutating) ------------------ | Branch (1018:29): [True: 196, Folded] ------------------ 1019| 196| pos.visit(dec_visitor{}); 1020| 196| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 196| } 1022| 4.47k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 3.75k, False: 714] ------------------ 1023| 3.75k| if (Mutating) ------------------ | Branch (1023:25): [True: 3.75k, Folded] ------------------ 1024| 3.75k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 3.75k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 3.75k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 714] | 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| 714| } else { 1034| 714| if (mutate) { ------------------ | Branch (1034:25): [True: 506, False: 208] ------------------ 1035| 506| pos.each_right(dec_visitor{}, idx + 1); 1036| 506| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 506| } else { 1038| 208| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 208| if (Mutating) ------------------ | Branch (1039:29): [True: 208, Folded] ------------------ 1040| 208| pos.visit(dec_visitor{}); 1041| 208| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 208| } 1043| 714| } 1044| 6.09k| } 1045| 6.09k| 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.09k| } 1055| 6.09k| } _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.75k| { 879| 3.75k| using node_t = node_type; 880| 3.75k| auto node = p.node(); 881| 3.75k| if (node->dec()) { ------------------ | Branch (881:13): [True: 3.55k, False: 206] ------------------ 882| 3.55k| p.each_right(dec_t{}, idx); 883| 3.55k| node_t::delete_inner(node, p.count()); 884| 3.55k| } 885| 3.75k| } _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.40k| { 1060| 2.40k| auto old_tail_size = pos.count(); 1061| 2.40k| auto new_tail_size = pos.index(last) + 1; 1062| 2.40k| auto node = pos.node(); 1063| 2.40k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 2.40k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 2.40k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 721, False: 1.68k] ------------------ 1065| 721| if (!Mutating) ------------------ | Branch (1065:17): [True: 721, Folded] ------------------ 1066| 721| node->inc(); 1067| 721| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.68k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 1.68k] ------------------ 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.68k| } else { 1073| 1.68k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.68k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 1.68k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 1.68k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.68k| } 1078| 2.40k| } _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.12k| { 992| 3.12k| auto idx = pos.index(last); 993| 3.12k| auto node = pos.node(); 994| 3.12k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.12k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.12k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.12k] | 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.12k| } else { 1002| 3.12k| using std::get; 1003| 3.12k| auto subs = 1004| 3.12k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.12k] ------------------ 1005| 3.12k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.12k| auto next = get<1>(subs); 1007| 3.12k| auto ts = get<2>(subs); 1008| 3.12k| auto tail = get<3>(subs); 1009| 3.12k| IMMER_TRY { ------------------ | | 49| 3.12k|#define IMMER_TRY try ------------------ 1010| 3.12k| if (next) { ------------------ | Branch (1010:21): [True: 410, False: 2.71k] ------------------ 1011| 410| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 410] ------------------ 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| 410| } else { 1016| 410| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 410| newn->inner()[idx] = next; 1018| 410| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 410] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 410| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 410| } 1022| 2.71k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.75k, False: 962] ------------------ 1023| 1.75k| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 1.75k] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.75k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.75k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 962] | 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| 962| } else { 1034| 962| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 962] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 962| } else { 1038| 962| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 962| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 962] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 962| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 962| } 1043| 962| } 1044| 3.12k| } 1045| 3.12k| 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.12k| } 1055| 3.12k| } _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.3k| { 868| 42.3k| using node_t = node_type; 869| 42.3k| auto node = p.node(); 870| 42.3k| if (node->dec()) { ------------------ | Branch (870:13): [True: 36.8k, False: 5.55k] ------------------ 871| 36.8k| p.each_right(dec_t{}, idx); 872| 36.8k| node_t::delete_inner_r(node, p.count()); 873| 36.8k| } 874| 42.3k| } _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| 3.72k| { 1060| 3.72k| auto old_tail_size = pos.count(); 1061| 3.72k| auto new_tail_size = pos.index(last) + 1; 1062| 3.72k| auto node = pos.node(); 1063| 3.72k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 3.72k, Folded] | Branch (1063:42): [True: 974, False: 2.75k] ------------------ 1064| 3.72k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.34k, False: 2.38k] ------------------ 1065| 1.34k| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 1.34k] ------------------ 1066| 0| node->inc(); 1067| 1.34k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 2.38k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 864, False: 1.51k] ------------------ 1069| 864| detail::destroy_n(node->leaf() + new_tail_size, 1070| 864| old_tail_size - new_tail_size); 1071| 864| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.51k| } else { 1073| 1.51k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.51k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.51k, Folded] ------------------ 1075| 1.51k| pos.visit(dec_visitor{}); 1076| 1.51k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.51k| } 1078| 3.72k| } _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.9k| { 914| 11.9k| auto idx = pos.index(last); 915| 11.9k| auto node = pos.node(); 916| 11.9k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 11.9k, Folded] | Branch (916:35): [True: 9.17k, False: 2.74k] ------------------ 917| 11.9k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 11.9k] | 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.9k| } else { 924| 11.9k| using std::get; 925| 11.9k| auto subs = 926| 11.9k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 9.17k, False: 2.74k] ------------------ 927| 11.9k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 11.9k| auto next = get<1>(subs); 929| 11.9k| auto ts = get<2>(subs); 930| 11.9k| auto tail = get<3>(subs); 931| 11.9k| IMMER_TRY { ------------------ | | 49| 11.9k|#define IMMER_TRY try ------------------ 932| 11.9k| if (next) { ------------------ | Branch (932:21): [True: 6.13k, False: 5.78k] ------------------ 933| 6.13k| if (mutate) { ------------------ | Branch (933:25): [True: 4.54k, False: 1.58k] ------------------ 934| 4.54k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 4.54k| pos.each_right(dec_visitor{}, idx + 1); 936| 4.54k| node->inner()[idx] = next; 937| 4.54k| nodr->d.sizes[idx] = last + 1 - ts; 938| 4.54k| nodr->d.count = idx + 1; 939| 4.54k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 4.54k, False: 0] ------------------ 940| 4.54k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 4.54k| } else { 942| 1.58k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 1.58k| auto newr = newn->relaxed(); 944| 1.58k| newn->inner()[idx] = next; 945| 1.58k| newr->d.sizes[idx] = last + 1 - ts; 946| 1.58k| newr->d.count = idx + 1; 947| 1.58k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 1.58k, False: 0] ------------------ 948| 1.58k| if (Mutating) ------------------ | Branch (948:29): [True: 1.58k, Folded] ------------------ 949| 1.58k| pos.visit(dec_visitor{}); 950| 1.58k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 1.58k| } 952| 6.13k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 2.98k, False: 2.79k] ------------------ 953| 2.98k| if (Mutating) ------------------ | Branch (953:25): [True: 2.98k, Folded] ------------------ 954| 2.98k| pos.visit(dec_right_visitor{}, count_t{1}); 955| 2.98k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 2.98k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 2.79k] | 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| 2.79k| } else { 964| 2.79k| if (mutate) { ------------------ | Branch (964:25): [True: 2.18k, False: 617] ------------------ 965| 2.18k| pos.each_right(dec_visitor{}, idx + 1); 966| 2.18k| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 2.18k| return std::make_tuple(pos.shift(), node, ts, tail); 968| 2.18k| } else { 969| 617| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 617| if (Mutating) ------------------ | Branch (970:29): [True: 617, Folded] ------------------ 971| 617| pos.visit(dec_visitor{}); 972| 617| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 617| } 974| 2.79k| } 975| 11.9k| } 976| 11.9k| IMMER_CATCH (...) { 977| 0| assert(!mutate); ------------------ | Branch (977:17): [True: 0, False: 0] ------------------ 978| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] ------------------ 979| 0| if (next) ------------------ | Branch (979:21): [True: 0, False: 0] ------------------ 980| 0| dec_inner(next, 981| 0| pos.shift() - B, 982| 0| last + 1 - ts - pos.size_before(idx)); 983| 0| dec_leaf(tail, ts); 984| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 985| 0| } 986| 11.9k| } 987| 11.9k| } _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.55k| { 992| 7.55k| auto idx = pos.index(last); 993| 7.55k| auto node = pos.node(); 994| 7.55k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 7.55k, Folded] | Branch (994:35): [True: 6.58k, False: 974] ------------------ 995| 7.55k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 7.55k] | 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.55k| } else { 1002| 7.55k| using std::get; 1003| 7.55k| auto subs = 1004| 7.55k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 6.58k, False: 974] ------------------ 1005| 7.55k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 7.55k| auto next = get<1>(subs); 1007| 7.55k| auto ts = get<2>(subs); 1008| 7.55k| auto tail = get<3>(subs); 1009| 7.55k| IMMER_TRY { ------------------ | | 49| 7.55k|#define IMMER_TRY try ------------------ 1010| 7.55k| if (next) { ------------------ | Branch (1010:21): [True: 2.67k, False: 4.88k] ------------------ 1011| 2.67k| if (mutate) { ------------------ | Branch (1011:25): [True: 2.39k, False: 279] ------------------ 1012| 2.39k| node->inner()[idx] = next; 1013| 2.39k| pos.each_right(dec_visitor{}, idx + 1); 1014| 2.39k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 2.39k| } else { 1016| 279| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 279| newn->inner()[idx] = next; 1018| 279| if (Mutating) ------------------ | Branch (1018:29): [True: 279, Folded] ------------------ 1019| 279| pos.visit(dec_visitor{}); 1020| 279| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 279| } 1022| 4.88k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 932, False: 3.95k] ------------------ 1023| 932| if (Mutating) ------------------ | Branch (1023:25): [True: 932, Folded] ------------------ 1024| 932| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 932| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 3.95k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 3.95k] | 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.95k| } else { 1034| 3.95k| if (mutate) { ------------------ | Branch (1034:25): [True: 3.59k, False: 359] ------------------ 1035| 3.59k| pos.each_right(dec_visitor{}, idx + 1); 1036| 3.59k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 3.59k| } else { 1038| 359| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 359| if (Mutating) ------------------ | Branch (1039:29): [True: 359, Folded] ------------------ 1040| 359| pos.visit(dec_visitor{}); 1041| 359| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 359| } 1043| 3.95k| } 1044| 7.55k| } 1045| 7.55k| 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.55k| } 1055| 7.55k| } _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.3k| { 879| 10.3k| using node_t = node_type; 880| 10.3k| auto node = p.node(); 881| 10.3k| if (node->dec()) { ------------------ | Branch (881:13): [True: 7.60k, False: 2.76k] ------------------ 882| 7.60k| p.each_right(dec_t{}, idx); 883| 7.60k| node_t::delete_inner(node, p.count()); 884| 7.60k| } 885| 10.3k| } _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.11k| { 1060| 5.11k| auto old_tail_size = pos.count(); 1061| 5.11k| auto new_tail_size = pos.index(last) + 1; 1062| 5.11k| auto node = pos.node(); 1063| 5.11k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 5.11k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 5.11k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.29k, False: 3.81k] ------------------ 1065| 1.29k| if (!Mutating) ------------------ | Branch (1065:17): [True: 1.29k, Folded] ------------------ 1066| 1.29k| node->inc(); 1067| 1.29k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 3.81k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 3.81k] ------------------ 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.81k| } else { 1073| 3.81k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 3.81k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 3.81k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 3.81k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 3.81k| } 1078| 5.11k| } _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| 7.00k| { 914| 7.00k| auto idx = pos.index(last); 915| 7.00k| auto node = pos.node(); 916| 7.00k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 7.00k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 7.00k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 7.00k] | 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| 7.00k| } else { 924| 7.00k| using std::get; 925| 7.00k| auto subs = 926| 7.00k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 7.00k] ------------------ 927| 7.00k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 7.00k| auto next = get<1>(subs); 929| 7.00k| auto ts = get<2>(subs); 930| 7.00k| auto tail = get<3>(subs); 931| 7.00k| IMMER_TRY { ------------------ | | 49| 7.00k|#define IMMER_TRY try ------------------ 932| 7.00k| if (next) { ------------------ | Branch (932:21): [True: 1.12k, False: 5.87k] ------------------ 933| 1.12k| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 1.12k] ------------------ 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.12k| } else { 942| 1.12k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 1.12k| auto newr = newn->relaxed(); 944| 1.12k| newn->inner()[idx] = next; 945| 1.12k| newr->d.sizes[idx] = last + 1 - ts; 946| 1.12k| newr->d.count = idx + 1; 947| 1.12k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 1.12k, False: 0] ------------------ 948| 1.12k| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 1.12k] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 1.12k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 1.12k| } 952| 5.87k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 3.95k, False: 1.92k] ------------------ 953| 3.95k| if (Mutating) ------------------ | Branch (953:25): [Folded, False: 3.95k] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 3.95k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 3.95k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 1.92k] | 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.92k| } else { 964| 1.92k| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 1.92k] ------------------ 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.92k| } else { 969| 1.92k| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 1.92k| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 1.92k] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 1.92k| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 1.92k| } 974| 1.92k| } 975| 7.00k| } 976| 7.00k| 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| 7.00k| } 987| 7.00k| } _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.12k| { 992| 3.12k| auto idx = pos.index(last); 993| 3.12k| auto node = pos.node(); 994| 3.12k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.12k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.12k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.12k] | 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.12k| } else { 1002| 3.12k| using std::get; 1003| 3.12k| auto subs = 1004| 3.12k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.12k] ------------------ 1005| 3.12k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.12k| auto next = get<1>(subs); 1007| 3.12k| auto ts = get<2>(subs); 1008| 3.12k| auto tail = get<3>(subs); 1009| 3.12k| IMMER_TRY { ------------------ | | 49| 3.12k|#define IMMER_TRY try ------------------ 1010| 3.12k| if (next) { ------------------ | Branch (1010:21): [True: 737, False: 2.39k] ------------------ 1011| 737| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 737] ------------------ 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| 737| } else { 1016| 737| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 737| newn->inner()[idx] = next; 1018| 737| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 737] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 737| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 737| } 1022| 2.39k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 775, False: 1.61k] ------------------ 1023| 775| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 775] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 775| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.61k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.61k] | 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.61k| } else { 1034| 1.61k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 1.61k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.61k| } else { 1038| 1.61k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.61k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 1.61k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 1.61k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.61k| } 1043| 1.61k| } 1044| 3.12k| } 1045| 3.12k| 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.12k| } 1055| 3.12k| } _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.4k| { 992| 12.4k| auto idx = pos.index(last); 993| 12.4k| auto node = pos.node(); 994| 12.4k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 12.4k, Folded] | Branch (994:35): [True: 8.89k, False: 3.52k] ------------------ 995| 12.4k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 12.4k, Folded] | Branch (995:25): [True: 7.14k, False: 5.27k] ------------------ 996| 7.14k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 5.29k, False: 1.84k] ------------------ 997| 7.14k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 7.14k| if (Mutating) ------------------ | Branch (998:17): [True: 7.14k, Folded] ------------------ 999| 7.14k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 7.14k| return res; 1001| 7.14k| } else { 1002| 5.27k| using std::get; 1003| 5.27k| auto subs = 1004| 5.27k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.59k, False: 1.67k] ------------------ 1005| 5.27k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 5.27k| auto next = get<1>(subs); 1007| 5.27k| auto ts = get<2>(subs); 1008| 5.27k| auto tail = get<3>(subs); 1009| 5.27k| IMMER_TRY { ------------------ | | 49| 5.27k|#define IMMER_TRY try ------------------ 1010| 5.27k| if (next) { ------------------ | Branch (1010:21): [True: 1.14k, False: 4.13k] ------------------ 1011| 1.14k| if (mutate) { ------------------ | Branch (1011:25): [True: 744, False: 397] ------------------ 1012| 744| node->inner()[idx] = next; 1013| 744| pos.each_right(dec_visitor{}, idx + 1); 1014| 744| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 744| } else { 1016| 397| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 397| newn->inner()[idx] = next; 1018| 397| if (Mutating) ------------------ | Branch (1018:29): [True: 397, Folded] ------------------ 1019| 397| pos.visit(dec_visitor{}); 1020| 397| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 397| } 1022| 4.13k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 4.13k] ------------------ 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.13k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 4.13k, Folded] | Branch (1026:40): [True: 3.43k, False: 696] | Branch (1026:52): [True: 2.29k, False: 1.14k] ------------------ 1027| 2.29k| auto newn = pos.node()->inner()[0]; 1028| 2.29k| if (!mutate) ------------------ | Branch (1028:25): [True: 588, False: 1.70k] ------------------ 1029| 588| newn->inc(); 1030| 2.29k| if (Mutating) ------------------ | Branch (1030:25): [True: 2.29k, Folded] ------------------ 1031| 2.29k| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 2.29k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 2.29k| } else { 1034| 1.83k| if (mutate) { ------------------ | Branch (1034:25): [True: 1.14k, False: 694] ------------------ 1035| 1.14k| pos.each_right(dec_visitor{}, idx + 1); 1036| 1.14k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.14k| } else { 1038| 694| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 694| if (Mutating) ------------------ | Branch (1039:29): [True: 694, Folded] ------------------ 1040| 694| pos.visit(dec_visitor{}); 1041| 694| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 694| } 1043| 1.83k| } 1044| 5.27k| } 1045| 5.27k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 5.27k| } 1055| 12.4k| } _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.73k| { 1060| 1.73k| auto old_tail_size = pos.count(); 1061| 1.73k| auto new_tail_size = pos.index(last) + 1; 1062| 1.73k| auto node = pos.node(); 1063| 1.73k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.73k, Folded] | Branch (1063:42): [True: 674, False: 1.06k] ------------------ 1064| 1.73k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 738, False: 1.00k] ------------------ 1065| 738| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 738] ------------------ 1066| 0| node->inc(); 1067| 738| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.00k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 595, False: 406] ------------------ 1069| 595| detail::destroy_n(node->leaf() + new_tail_size, 1070| 595| old_tail_size - new_tail_size); 1071| 595| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 595| } else { 1073| 406| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 406| if (Mutating) ------------------ | Branch (1074:17): [True: 406, Folded] ------------------ 1075| 406| pos.visit(dec_visitor{}); 1076| 406| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 406| } 1078| 1.73k| } _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.85k| { 992| 3.85k| auto idx = pos.index(last); 993| 3.85k| auto node = pos.node(); 994| 3.85k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.85k, Folded] | Branch (994:35): [True: 1.66k, False: 2.19k] ------------------ 995| 3.85k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 3.85k, Folded] | Branch (995:25): [True: 1.68k, False: 2.17k] ------------------ 996| 1.68k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 936, False: 750] ------------------ 997| 1.68k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 1.68k| if (Mutating) ------------------ | Branch (998:17): [True: 1.68k, Folded] ------------------ 999| 1.68k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 1.68k| return res; 1001| 2.17k| } else { 1002| 2.17k| using std::get; 1003| 2.17k| auto subs = 1004| 2.17k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 724, False: 1.44k] ------------------ 1005| 2.17k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 2.17k| auto next = get<1>(subs); 1007| 2.17k| auto ts = get<2>(subs); 1008| 2.17k| auto tail = get<3>(subs); 1009| 2.17k| IMMER_TRY { ------------------ | | 49| 2.17k|#define IMMER_TRY try ------------------ 1010| 2.17k| if (next) { ------------------ | Branch (1010:21): [True: 454, False: 1.71k] ------------------ 1011| 454| if (mutate) { ------------------ | Branch (1011:25): [True: 258, False: 196] ------------------ 1012| 258| node->inner()[idx] = next; 1013| 258| pos.each_right(dec_visitor{}, idx + 1); 1014| 258| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 258| } else { 1016| 196| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 196| newn->inner()[idx] = next; 1018| 196| if (Mutating) ------------------ | Branch (1018:29): [True: 196, Folded] ------------------ 1019| 196| pos.visit(dec_visitor{}); 1020| 196| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 196| } 1022| 1.71k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 1.71k] ------------------ 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.71k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 1.71k, Folded] | Branch (1026:40): [True: 1.15k, False: 567] | Branch (1026:52): [True: 412, False: 738] ------------------ 1027| 412| auto newn = pos.node()->inner()[0]; 1028| 412| if (!mutate) ------------------ | Branch (1028:25): [True: 195, False: 217] ------------------ 1029| 195| newn->inc(); 1030| 412| if (Mutating) ------------------ | Branch (1030:25): [True: 412, Folded] ------------------ 1031| 412| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 412| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 1.30k| } else { 1034| 1.30k| if (mutate) { ------------------ | Branch (1034:25): [True: 249, False: 1.05k] ------------------ 1035| 249| pos.each_right(dec_visitor{}, idx + 1); 1036| 249| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.05k| } else { 1038| 1.05k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.05k| if (Mutating) ------------------ | Branch (1039:29): [True: 1.05k, Folded] ------------------ 1040| 1.05k| pos.visit(dec_visitor{}); 1041| 1.05k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.05k| } 1043| 1.30k| } 1044| 2.17k| } 1045| 2.17k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 2.17k| } 1055| 3.85k| } _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| 637| { 1060| 637| auto old_tail_size = pos.count(); 1061| 637| auto new_tail_size = pos.index(last) + 1; 1062| 637| auto node = pos.node(); 1063| 637| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 637, Folded] | Branch (1063:42): [True: 201, False: 436] ------------------ 1064| 637| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 227, False: 410] ------------------ 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| 410| } else if (mutate) { ------------------ | Branch (1068:20): [True: 195, False: 215] ------------------ 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| 215| } else { 1073| 215| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 215| if (Mutating) ------------------ | Branch (1074:17): [True: 215, Folded] ------------------ 1075| 215| pos.visit(dec_visitor{}); 1076| 215| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 215| } 1078| 637| } _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| 687| { 1378| 687| auto node = pos.node(); 1379| 687| auto idx = pos.index(first); 1380| 687| auto count = pos.count(); 1381| 687| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 687| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 428, False: 259] ------------------ 1384| 687| if (mutate) { ------------------ | Branch (1384:13): [True: 428, False: 259] ------------------ 1385| 428| auto data = node->leaf(); 1386| 428| auto newcount = count - idx; 1387| 428| std::move(data + idx, data + count, data); 1388| 428| detail::destroy_n(data + newcount, idx); 1389| 428| return std::make_tuple(0, node); 1390| 428| } else { 1391| 259| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 259| if (Mutating) ------------------ | Branch (1392:17): [True: 259, Folded] ------------------ 1393| 259| pos.visit(dec_visitor{}); 1394| 259| return std::make_tuple(0, newn); 1395| 259| } 1396| 687| } _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| 34.9k| { 1247| 34.9k| auto idx = pos.subindex(first); 1248| 34.9k| auto count = pos.count(); 1249| 34.9k| auto node = pos.node(); 1250| 34.9k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 34.9k, Folded] | Branch (1250:47): [True: 25.3k, False: 9.56k] ------------------ 1251| 34.9k| auto left_size = pos.size_before(idx); 1252| 34.9k| auto child_size = pos.size_sbh(idx, left_size); 1253| 34.9k| auto dropped_size = first; 1254| 34.9k| auto child_dropped_size = dropped_size - left_size; 1255| 34.9k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 34.9k, Folded] | Branch (1255:25): [True: 33.4k, False: 1.48k] | Branch (1255:45): [True: 8.64k, False: 24.8k] ------------------ 1256| 8.64k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 5.28k, False: 3.35k] ------------------ 1257| 8.64k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 8.64k| if (mutate) ------------------ | Branch (1258:17): [True: 5.28k, False: 3.35k] ------------------ 1259| 5.28k| pos.visit(dec_left_visitor{}, idx); 1260| 3.35k| else if (Mutating) ------------------ | Branch (1260:22): [True: 3.35k, Folded] ------------------ 1261| 3.35k| pos.visit(dec_visitor{}); 1262| 8.64k| return r; 1263| 26.2k| } else { 1264| 26.2k| using std::get; 1265| 26.2k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 20.0k, False: 6.21k] ------------------ 1266| 26.2k| : node_t::make_inner_r_e(e); 1267| 26.2k| auto newr = newn->relaxed(); 1268| 26.2k| auto newcount = count - idx; 1269| 26.2k| auto new_child_size = child_size - child_dropped_size; 1270| 26.2k| IMMER_TRY { ------------------ | | 49| 26.2k|#define IMMER_TRY try ------------------ 1271| 26.2k| auto subs = 1272| 26.2k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 20.0k, False: 6.21k] ------------------ 1273| 26.2k| : pos.towards_sub_oh( 1274| 6.21k| no_collapse_no_mut_t{}, first, idx, e); 1275| 26.2k| if (mutate) ------------------ | Branch (1275:21): [True: 20.0k, False: 6.21k] ------------------ 1276| 20.0k| pos.each_left(dec_visitor{}, idx); 1277| 26.2k| pos.copy_sizes( 1278| 26.2k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 26.2k| std::copy(node->inner() + idx + 1, 1280| 26.2k| node->inner() + count, 1281| 26.2k| newn->inner() + 1); 1282| 26.2k| newn->inner()[0] = get<1>(subs); 1283| 26.2k| newr->d.sizes[0] = new_child_size; 1284| 26.2k| newr->d.count = newcount; 1285| 26.2k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 26.2k, False: 0] ------------------ 1286| 26.2k| if (!mutate) { ------------------ | Branch (1286:21): [True: 6.21k, False: 20.0k] ------------------ 1287| 6.21k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 6.21k| if (Mutating) ------------------ | Branch (1288:25): [True: 6.21k, Folded] ------------------ 1289| 6.21k| pos.visit(dec_visitor{}); 1290| 6.21k| } 1291| 26.2k| return std::make_tuple(pos.shift(), newn); 1292| 26.2k| } 1293| 26.2k| 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| 26.2k| } 1299| 34.9k| } _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.50k| { 1247| 2.50k| auto idx = pos.subindex(first); 1248| 2.50k| auto count = pos.count(); 1249| 2.50k| auto node = pos.node(); 1250| 2.50k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 2.50k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 2.50k| auto left_size = pos.size_before(idx); 1252| 2.50k| auto child_size = pos.size_sbh(idx, left_size); 1253| 2.50k| auto dropped_size = first; 1254| 2.50k| auto child_dropped_size = dropped_size - left_size; 1255| 2.50k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 2.50k, Folded] | Branch (1255:25): [True: 1.36k, False: 1.14k] | Branch (1255:45): [True: 880, False: 484] ------------------ 1256| 880| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 880] ------------------ 1257| 880| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 880| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 880] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 880| else if (Mutating) ------------------ | Branch (1260:22): [Folded, False: 880] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 880| return r; 1263| 1.62k| } else { 1264| 1.62k| using std::get; 1265| 1.62k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 1.62k] ------------------ 1266| 1.62k| : node_t::make_inner_r_e(e); 1267| 1.62k| auto newr = newn->relaxed(); 1268| 1.62k| auto newcount = count - idx; 1269| 1.62k| auto new_child_size = child_size - child_dropped_size; 1270| 1.62k| IMMER_TRY { ------------------ | | 49| 1.62k|#define IMMER_TRY try ------------------ 1271| 1.62k| auto subs = 1272| 1.62k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 1.62k] ------------------ 1273| 1.62k| : pos.towards_sub_oh( 1274| 1.62k| no_collapse_no_mut_t{}, first, idx, e); 1275| 1.62k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 1.62k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 1.62k| pos.copy_sizes( 1278| 1.62k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 1.62k| std::copy(node->inner() + idx + 1, 1280| 1.62k| node->inner() + count, 1281| 1.62k| newn->inner() + 1); 1282| 1.62k| newn->inner()[0] = get<1>(subs); 1283| 1.62k| newr->d.sizes[0] = new_child_size; 1284| 1.62k| newr->d.count = newcount; 1285| 1.62k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 1.62k, False: 0] ------------------ 1286| 1.62k| if (!mutate) { ------------------ | Branch (1286:21): [True: 1.62k, False: 0] ------------------ 1287| 1.62k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 1.62k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 1.62k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 1.62k| } 1291| 1.62k| return std::make_tuple(pos.shift(), newn); 1292| 1.62k| } 1293| 1.62k| 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.62k| } 1299| 2.50k| } _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.93k| { 1304| 2.93k| auto idx = pos.subindex(first); 1305| 2.93k| auto count = pos.count(); 1306| 2.93k| auto node = pos.node(); 1307| 2.93k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.93k] ------------------ 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.93k| auto left_size = pos.size_before(idx); 1313| 2.93k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.93k| auto dropped_size = first; 1315| 2.93k| auto child_dropped_size = dropped_size - left_size; 1316| 2.93k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 2.93k, Folded] | Branch (1316:25): [True: 1.79k, False: 1.13k] | Branch (1316:45): [True: 1.33k, False: 456] ------------------ 1317| 1.33k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 1.33k] ------------------ 1318| 1.33k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 1.33k| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 1.33k] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 1.33k| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 1.33k] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 1.33k| return r; 1324| 1.59k| } else { 1325| 1.59k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 1.59k| auto newcount = count - idx; 1330| 1.59k| auto newn = 1331| 1.59k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.59k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.59k| : node_t::make_inner_r_e(e); 1336| 1.59k| auto newr = newn->relaxed(); 1337| 1.59k| IMMER_TRY { ------------------ | | 49| 1.59k|#define IMMER_TRY try ------------------ 1338| 1.59k| auto subs = 1339| 1.59k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.59k] ------------------ 1340| 1.59k| : pos.towards_sub_oh( 1341| 1.59k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.59k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.59k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.59k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.59k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.59k, False: 0] ------------------ 1346| 1.59k| pos.copy_sizes( 1347| 1.59k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.59k| newr->d.count = newcount; 1349| 1.59k| newn->inner()[0] = get<1>(subs); 1350| 1.59k| std::copy(node->inner() + idx + 1, 1351| 1.59k| node->inner() + count, 1352| 1.59k| newn->inner() + 1); 1353| 1.59k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.59k, False: 0] ------------------ 1354| 1.59k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.59k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.59k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.59k| } 1358| 1.59k| return std::make_tuple(pos.shift(), newn); 1359| 1.59k| } 1360| 1.59k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 1.59k| } 1373| 2.93k| } _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.85k| { 1304| 2.85k| auto idx = pos.subindex(first); 1305| 2.85k| auto count = pos.count(); 1306| 2.85k| auto node = pos.node(); 1307| 2.85k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.85k] ------------------ 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.85k| auto left_size = pos.size_before(idx); 1313| 2.85k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.85k| auto dropped_size = first; 1315| 2.85k| auto child_dropped_size = dropped_size - left_size; 1316| 2.85k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 2.85k, Folded] | Branch (1316:25): [True: 529, False: 2.32k] | Branch (1316:45): [True: 311, False: 218] ------------------ 1317| 311| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 311] ------------------ 1318| 311| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 311| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 311] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 311| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 311] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 311| return r; 1324| 2.54k| } else { 1325| 2.54k| 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.54k| auto newcount = count - idx; 1330| 2.54k| auto newn = 1331| 2.54k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 2.54k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 2.54k| : node_t::make_inner_r_e(e); 1336| 2.54k| auto newr = newn->relaxed(); 1337| 2.54k| IMMER_TRY { ------------------ | | 49| 2.54k|#define IMMER_TRY try ------------------ 1338| 2.54k| auto subs = 1339| 2.54k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 2.54k] ------------------ 1340| 2.54k| : pos.towards_sub_oh( 1341| 2.54k| no_collapse_no_mut_t{}, first, idx, e); 1342| 2.54k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 2.54k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 2.54k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 2.54k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 2.54k, False: 0] ------------------ 1346| 2.54k| pos.copy_sizes( 1347| 2.54k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 2.54k| newr->d.count = newcount; 1349| 2.54k| newn->inner()[0] = get<1>(subs); 1350| 2.54k| std::copy(node->inner() + idx + 1, 1351| 2.54k| node->inner() + count, 1352| 2.54k| newn->inner() + 1); 1353| 2.54k| if (!mutate) { ------------------ | Branch (1353:21): [True: 2.54k, False: 0] ------------------ 1354| 2.54k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 2.54k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 2.54k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 2.54k| } 1358| 2.54k| return std::make_tuple(pos.shift(), newn); 1359| 2.54k| } 1360| 2.54k| 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.54k| } 1373| 2.85k| } _ZN5immer6detail4rbts16dec_left_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_j: 1209| 323| { 1210| 323| using node_t = node_type; 1211| 323| auto node = p.node(); 1212| 323| if (node->dec()) { ------------------ | Branch (1212:13): [True: 323, False: 0] ------------------ 1213| 323| p.each_left(dec_t{}, idx); 1214| 323| node_t::delete_inner(node, p.count()); 1215| 323| } 1216| 323| } _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.32k| { 1378| 3.32k| auto node = pos.node(); 1379| 3.32k| auto idx = pos.index(first); 1380| 3.32k| auto count = pos.count(); 1381| 3.32k| 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.32k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 728, False: 2.59k] ------------------ 1384| 3.32k| if (mutate) { ------------------ | Branch (1384:13): [True: 728, False: 2.59k] ------------------ 1385| 728| auto data = node->leaf(); 1386| 728| auto newcount = count - idx; 1387| 728| std::move(data + idx, data + count, data); 1388| 728| detail::destroy_n(data + newcount, idx); 1389| 728| return std::make_tuple(0, node); 1390| 2.59k| } else { 1391| 2.59k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 2.59k| if (Mutating) ------------------ | Branch (1392:17): [True: 2.59k, Folded] ------------------ 1393| 2.59k| pos.visit(dec_visitor{}); 1394| 2.59k| return std::make_tuple(0, newn); 1395| 2.59k| } 1396| 3.32k| } _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| 2.00k| { 1304| 2.00k| auto idx = pos.subindex(first); 1305| 2.00k| auto count = pos.count(); 1306| 2.00k| auto node = pos.node(); 1307| 2.00k| 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| 2.00k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 889, False: 1.11k] ------------------ 1312| 2.00k| auto left_size = pos.size_before(idx); 1313| 2.00k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.00k| auto dropped_size = first; 1315| 2.00k| auto child_dropped_size = dropped_size - left_size; 1316| 2.00k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 2.00k] | Branch (1316:25): [True: 0, False: 0] | Branch (1316:45): [True: 0, False: 0] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [True: 0, Folded] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 2.00k| } else { 1325| 2.00k| 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.00k| auto newcount = count - idx; 1330| 2.00k| auto newn = 1331| 2.00k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 889, False: 1.11k] ------------------ 1332| 889| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 889| norefs_tag{})) relaxed_t, 1334| 889| node) 1335| 2.00k| : node_t::make_inner_r_e(e); 1336| 2.00k| auto newr = newn->relaxed(); 1337| 2.00k| IMMER_TRY { ------------------ | | 49| 2.00k|#define IMMER_TRY try ------------------ 1338| 2.00k| auto subs = 1339| 2.00k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 889, False: 1.11k] ------------------ 1340| 2.00k| : pos.towards_sub_oh( 1341| 1.11k| no_collapse_no_mut_t{}, first, idx, e); 1342| 2.00k| if (mutate) ------------------ | Branch (1342:21): [True: 889, False: 1.11k] ------------------ 1343| 889| pos.each_left(dec_visitor{}, idx); 1344| 2.00k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 2.00k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 2.00k, False: 0] ------------------ 1346| 2.00k| pos.copy_sizes( 1347| 2.00k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 2.00k| newr->d.count = newcount; 1349| 2.00k| newn->inner()[0] = get<1>(subs); 1350| 2.00k| std::copy(node->inner() + idx + 1, 1351| 2.00k| node->inner() + count, 1352| 2.00k| newn->inner() + 1); 1353| 2.00k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.11k, False: 889] ------------------ 1354| 1.11k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.11k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.11k, Folded] ------------------ 1356| 1.11k| pos.visit(dec_visitor{}); 1357| 1.11k| } 1358| 2.00k| return std::make_tuple(pos.shift(), newn); 1359| 2.00k| } 1360| 2.00k| 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.00k| } 1373| 2.00k| } _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| 9.86k| { 1378| 9.86k| auto node = pos.node(); 1379| 9.86k| auto idx = pos.index(first); 1380| 9.86k| auto count = pos.count(); 1381| 9.86k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 9.86k] ------------------ 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| 9.86k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 9.86k] ------------------ 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| 9.86k| } else { 1391| 9.86k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 9.86k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 9.86k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 9.86k| return std::make_tuple(0, newn); 1395| 9.86k| } 1396| 9.86k| } _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.27k| { 1304| 3.27k| auto idx = pos.subindex(first); 1305| 3.27k| auto count = pos.count(); 1306| 3.27k| auto node = pos.node(); 1307| 3.27k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 3.27k] ------------------ 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.27k| auto left_size = pos.size_before(idx); 1313| 3.27k| auto child_size = pos.size_sbh(idx, left_size); 1314| 3.27k| auto dropped_size = first; 1315| 3.27k| auto child_dropped_size = dropped_size - left_size; 1316| 3.27k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 3.27k] | 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.27k| } else { 1325| 3.27k| 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.27k| auto newcount = count - idx; 1330| 3.27k| auto newn = 1331| 3.27k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 3.27k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 3.27k| : node_t::make_inner_r_e(e); 1336| 3.27k| auto newr = newn->relaxed(); 1337| 3.27k| IMMER_TRY { ------------------ | | 49| 3.27k|#define IMMER_TRY try ------------------ 1338| 3.27k| auto subs = 1339| 3.27k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 3.27k] ------------------ 1340| 3.27k| : pos.towards_sub_oh( 1341| 3.27k| no_collapse_no_mut_t{}, first, idx, e); 1342| 3.27k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 3.27k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 3.27k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 3.27k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 3.27k, False: 0] ------------------ 1346| 3.27k| pos.copy_sizes( 1347| 3.27k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 3.27k| newr->d.count = newcount; 1349| 3.27k| newn->inner()[0] = get<1>(subs); 1350| 3.27k| std::copy(node->inner() + idx + 1, 1351| 3.27k| node->inner() + count, 1352| 3.27k| newn->inner() + 1); 1353| 3.27k| if (!mutate) { ------------------ | Branch (1353:21): [True: 3.27k, False: 0] ------------------ 1354| 3.27k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 3.27k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 3.27k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 3.27k| } 1358| 3.27k| return std::make_tuple(pos.shift(), newn); 1359| 3.27k| } 1360| 3.27k| 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.27k| } 1373| 3.27k| } _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.29k| { 1210| 4.29k| using node_t = node_type; 1211| 4.29k| auto node = p.node(); 1212| 4.29k| if (node->dec()) { ------------------ | Branch (1212:13): [True: 4.29k, False: 0] ------------------ 1213| 4.29k| p.each_left(dec_t{}, idx); 1214| 4.29k| node_t::delete_inner(node, p.count()); 1215| 4.29k| } 1216| 4.29k| } _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| 8.78k| { 1378| 8.78k| auto node = pos.node(); 1379| 8.78k| auto idx = pos.index(first); 1380| 8.78k| auto count = pos.count(); 1381| 8.78k| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 8.78k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 5.67k, False: 3.11k] ------------------ 1384| 8.78k| if (mutate) { ------------------ | Branch (1384:13): [True: 5.67k, False: 3.11k] ------------------ 1385| 5.67k| auto data = node->leaf(); 1386| 5.67k| auto newcount = count - idx; 1387| 5.67k| std::move(data + idx, data + count, data); 1388| 5.67k| detail::destroy_n(data + newcount, idx); 1389| 5.67k| return std::make_tuple(0, node); 1390| 5.67k| } else { 1391| 3.11k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 3.11k| if (Mutating) ------------------ | Branch (1392:17): [True: 3.11k, Folded] ------------------ 1393| 3.11k| pos.visit(dec_visitor{}); 1394| 3.11k| return std::make_tuple(0, newn); 1395| 3.11k| } 1396| 8.78k| } _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.49k| { 1304| 1.49k| auto idx = pos.subindex(first); 1305| 1.49k| auto count = pos.count(); 1306| 1.49k| auto node = pos.node(); 1307| 1.49k| auto mutate = Mutating ------------------ | Branch (1307:23): [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.49k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 479, False: 1.01k] ------------------ 1312| 1.49k| auto left_size = pos.size_before(idx); 1313| 1.49k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.49k| auto dropped_size = first; 1315| 1.49k| auto child_dropped_size = dropped_size - left_size; 1316| 1.49k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.49k] | Branch (1316:25): [True: 0, False: 0] | Branch (1316:45): [True: 0, False: 0] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [True: 0, Folded] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 1.49k| } else { 1325| 1.49k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 1.49k| auto newcount = count - idx; 1330| 1.49k| auto newn = 1331| 1.49k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 479, False: 1.01k] ------------------ 1332| 479| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 479| norefs_tag{})) relaxed_t, 1334| 479| node) 1335| 1.49k| : node_t::make_inner_r_e(e); 1336| 1.49k| auto newr = newn->relaxed(); 1337| 1.49k| IMMER_TRY { ------------------ | | 49| 1.49k|#define IMMER_TRY try ------------------ 1338| 1.49k| auto subs = 1339| 1.49k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 479, False: 1.01k] ------------------ 1340| 1.49k| : pos.towards_sub_oh( 1341| 1.01k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.49k| if (mutate) ------------------ | Branch (1342:21): [True: 479, False: 1.01k] ------------------ 1343| 479| pos.each_left(dec_visitor{}, idx); 1344| 1.49k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.49k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.49k, False: 0] ------------------ 1346| 1.49k| pos.copy_sizes( 1347| 1.49k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.49k| newr->d.count = newcount; 1349| 1.49k| newn->inner()[0] = get<1>(subs); 1350| 1.49k| std::copy(node->inner() + idx + 1, 1351| 1.49k| node->inner() + count, 1352| 1.49k| newn->inner() + 1); 1353| 1.49k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.01k, False: 479] ------------------ 1354| 1.01k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.01k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.01k, Folded] ------------------ 1356| 1.01k| pos.visit(dec_visitor{}); 1357| 1.01k| } 1358| 1.49k| return std::make_tuple(pos.shift(), newn); 1359| 1.49k| } 1360| 1.49k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 1.49k| } 1373| 1.49k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 15.9k| { 1378| 15.9k| auto node = pos.node(); 1379| 15.9k| auto idx = pos.index(first); 1380| 15.9k| auto count = pos.count(); 1381| 15.9k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 15.9k] ------------------ 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| 15.9k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 15.9k] ------------------ 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| 15.9k| } else { 1391| 15.9k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 15.9k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 15.9k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 15.9k| return std::make_tuple(0, newn); 1395| 15.9k| } 1396| 15.9k| } _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| 1.68k| { 1304| 1.68k| auto idx = pos.subindex(first); 1305| 1.68k| auto count = pos.count(); 1306| 1.68k| auto node = pos.node(); 1307| 1.68k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 1.68k] ------------------ 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| 1.68k| auto left_size = pos.size_before(idx); 1313| 1.68k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.68k| auto dropped_size = first; 1315| 1.68k| auto child_dropped_size = dropped_size - left_size; 1316| 1.68k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.68k] | Branch (1316:25): [True: 0, False: 0] | Branch (1316:45): [True: 0, False: 0] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 0] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 1.68k| } else { 1325| 1.68k| 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.68k| auto newcount = count - idx; 1330| 1.68k| auto newn = 1331| 1.68k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.68k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.68k| : node_t::make_inner_r_e(e); 1336| 1.68k| auto newr = newn->relaxed(); 1337| 1.68k| IMMER_TRY { ------------------ | | 49| 1.68k|#define IMMER_TRY try ------------------ 1338| 1.68k| auto subs = 1339| 1.68k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.68k] ------------------ 1340| 1.68k| : pos.towards_sub_oh( 1341| 1.68k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.68k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.68k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.68k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.68k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.68k, False: 0] ------------------ 1346| 1.68k| pos.copy_sizes( 1347| 1.68k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.68k| newr->d.count = newcount; 1349| 1.68k| newn->inner()[0] = get<1>(subs); 1350| 1.68k| std::copy(node->inner() + idx + 1, 1351| 1.68k| node->inner() + count, 1352| 1.68k| newn->inner() + 1); 1353| 1.68k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.68k, False: 0] ------------------ 1354| 1.68k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.68k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.68k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.68k| } 1358| 1.68k| return std::make_tuple(pos.shift(), newn); 1359| 1.68k| } 1360| 1.68k| 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.68k| } 1373| 1.68k| } _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.28k| { 1199| 5.28k| using node_t = node_type; 1200| 5.28k| auto node = p.node(); 1201| 5.28k| if (node->dec()) { ------------------ | Branch (1201:13): [True: 5.28k, False: 0] ------------------ 1202| 5.28k| p.each_left(dec_t{}, idx); 1203| 5.28k| node_t::delete_inner_r(node, p.count()); 1204| 5.28k| } 1205| 5.28k| } _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| 134k| { 1247| 134k| auto idx = pos.subindex(first); 1248| 134k| auto count = pos.count(); 1249| 134k| auto node = pos.node(); 1250| 134k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 134k, Folded] | Branch (1250:47): [True: 124k, False: 9.80k] ------------------ 1251| 134k| auto left_size = pos.size_before(idx); 1252| 134k| auto child_size = pos.size_sbh(idx, left_size); 1253| 134k| auto dropped_size = first; 1254| 134k| auto child_dropped_size = dropped_size - left_size; 1255| 134k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 134k] | 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| 134k| } else { 1264| 134k| using std::get; 1265| 134k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 124k, False: 9.80k] ------------------ 1266| 134k| : node_t::make_inner_r_e(e); 1267| 134k| auto newr = newn->relaxed(); 1268| 134k| auto newcount = count - idx; 1269| 134k| auto new_child_size = child_size - child_dropped_size; 1270| 134k| IMMER_TRY { ------------------ | | 49| 134k|#define IMMER_TRY try ------------------ 1271| 134k| auto subs = 1272| 134k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 124k, False: 9.80k] ------------------ 1273| 134k| : pos.towards_sub_oh( 1274| 9.80k| no_collapse_no_mut_t{}, first, idx, e); 1275| 134k| if (mutate) ------------------ | Branch (1275:21): [True: 124k, False: 9.80k] ------------------ 1276| 124k| pos.each_left(dec_visitor{}, idx); 1277| 134k| pos.copy_sizes( 1278| 134k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 134k| std::copy(node->inner() + idx + 1, 1280| 134k| node->inner() + count, 1281| 134k| newn->inner() + 1); 1282| 134k| newn->inner()[0] = get<1>(subs); 1283| 134k| newr->d.sizes[0] = new_child_size; 1284| 134k| newr->d.count = newcount; 1285| 134k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 134k, False: 0] ------------------ 1286| 134k| if (!mutate) { ------------------ | Branch (1286:21): [True: 9.80k, False: 124k] ------------------ 1287| 9.80k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 9.80k| if (Mutating) ------------------ | Branch (1288:25): [True: 9.80k, Folded] ------------------ 1289| 9.80k| pos.visit(dec_visitor{}); 1290| 9.80k| } 1291| 134k| return std::make_tuple(pos.shift(), newn); 1292| 134k| } 1293| 134k| 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| 134k| } 1299| 134k| } _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| 68.5k| { 1247| 68.5k| auto idx = pos.subindex(first); 1248| 68.5k| auto count = pos.count(); 1249| 68.5k| auto node = pos.node(); 1250| 68.5k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 68.5k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 68.5k| auto left_size = pos.size_before(idx); 1252| 68.5k| auto child_size = pos.size_sbh(idx, left_size); 1253| 68.5k| auto dropped_size = first; 1254| 68.5k| auto child_dropped_size = dropped_size - left_size; 1255| 68.5k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 68.5k] | Branch (1255:25): [True: 0, False: 0] | Branch (1255:45): [True: 0, False: 0] ------------------ 1256| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 0] ------------------ 1257| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 0| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 0] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 0| else if (Mutating) ------------------ | Branch (1260:22): [Folded, False: 0] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 0| return r; 1263| 68.5k| } else { 1264| 68.5k| using std::get; 1265| 68.5k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 68.5k] ------------------ 1266| 68.5k| : node_t::make_inner_r_e(e); 1267| 68.5k| auto newr = newn->relaxed(); 1268| 68.5k| auto newcount = count - idx; 1269| 68.5k| auto new_child_size = child_size - child_dropped_size; 1270| 68.5k| IMMER_TRY { ------------------ | | 49| 68.5k|#define IMMER_TRY try ------------------ 1271| 68.5k| auto subs = 1272| 68.5k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 68.5k] ------------------ 1273| 68.5k| : pos.towards_sub_oh( 1274| 68.5k| no_collapse_no_mut_t{}, first, idx, e); 1275| 68.5k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 68.5k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 68.5k| pos.copy_sizes( 1278| 68.5k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 68.5k| std::copy(node->inner() + idx + 1, 1280| 68.5k| node->inner() + count, 1281| 68.5k| newn->inner() + 1); 1282| 68.5k| newn->inner()[0] = get<1>(subs); 1283| 68.5k| newr->d.sizes[0] = new_child_size; 1284| 68.5k| newr->d.count = newcount; 1285| 68.5k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 68.5k, False: 0] ------------------ 1286| 68.5k| if (!mutate) { ------------------ | Branch (1286:21): [True: 68.5k, False: 0] ------------------ 1287| 68.5k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 68.5k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 68.5k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 68.5k| } 1291| 68.5k| return std::make_tuple(pos.shift(), newn); 1292| 68.5k| } 1293| 68.5k| IMMER_CATCH (...) { 1294| 0| if (!mutate) ------------------ | Branch (1294:21): [True: 0, False: 0] ------------------ 1295| 0| node_t::delete_inner_r_e(newn); 1296| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1297| 0| } 1298| 68.5k| } 1299| 68.5k| } _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| 9.43k| { 1304| 9.43k| auto idx = pos.subindex(first); 1305| 9.43k| auto count = pos.count(); 1306| 9.43k| auto node = pos.node(); 1307| 9.43k| auto mutate = Mutating ------------------ | Branch (1307:23): [True: 0, Folded] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 9.43k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 7.04k, False: 2.39k] ------------------ 1312| 9.43k| auto left_size = pos.size_before(idx); 1313| 9.43k| auto child_size = pos.size_sbh(idx, left_size); 1314| 9.43k| auto dropped_size = first; 1315| 9.43k| auto child_dropped_size = dropped_size - left_size; 1316| 9.43k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 9.43k, Folded] | Branch (1316:25): [True: 7.41k, False: 2.02k] | Branch (1316:45): [True: 5.39k, False: 2.01k] ------------------ 1317| 5.39k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 4.29k, False: 1.10k] ------------------ 1318| 5.39k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 5.39k| if (mutate) ------------------ | Branch (1319:17): [True: 4.29k, False: 1.10k] ------------------ 1320| 4.29k| pos.visit(dec_left_visitor{}, idx); 1321| 1.10k| else if (Mutating) ------------------ | Branch (1321:22): [True: 1.10k, Folded] ------------------ 1322| 1.10k| pos.visit(dec_visitor{}); 1323| 5.39k| return r; 1324| 5.39k| } else { 1325| 4.04k| 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| 4.04k| auto newcount = count - idx; 1330| 4.04k| auto newn = 1331| 4.04k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 2.74k, False: 1.29k] ------------------ 1332| 2.74k| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 2.74k| norefs_tag{})) relaxed_t, 1334| 2.74k| node) 1335| 4.04k| : node_t::make_inner_r_e(e); 1336| 4.04k| auto newr = newn->relaxed(); 1337| 4.04k| IMMER_TRY { ------------------ | | 49| 4.04k|#define IMMER_TRY try ------------------ 1338| 4.04k| auto subs = 1339| 4.04k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 2.74k, False: 1.29k] ------------------ 1340| 4.04k| : pos.towards_sub_oh( 1341| 1.29k| no_collapse_no_mut_t{}, first, idx, e); 1342| 4.04k| if (mutate) ------------------ | Branch (1342:21): [True: 2.74k, False: 1.29k] ------------------ 1343| 2.74k| pos.each_left(dec_visitor{}, idx); 1344| 4.04k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 4.04k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 4.04k, False: 0] ------------------ 1346| 4.04k| pos.copy_sizes( 1347| 4.04k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 4.04k| newr->d.count = newcount; 1349| 4.04k| newn->inner()[0] = get<1>(subs); 1350| 4.04k| std::copy(node->inner() + idx + 1, 1351| 4.04k| node->inner() + count, 1352| 4.04k| newn->inner() + 1); 1353| 4.04k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.29k, False: 2.74k] ------------------ 1354| 1.29k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.29k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.29k, Folded] ------------------ 1356| 1.29k| pos.visit(dec_visitor{}); 1357| 1.29k| } 1358| 4.04k| return std::make_tuple(pos.shift(), newn); 1359| 4.04k| } 1360| 4.04k| 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| 4.04k| } 1373| 9.43k| } _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.45k| { 1304| 3.45k| auto idx = pos.subindex(first); 1305| 3.45k| auto count = pos.count(); 1306| 3.45k| auto node = pos.node(); 1307| 3.45k| 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.45k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 1.53k, False: 1.91k] ------------------ 1312| 3.45k| auto left_size = pos.size_before(idx); 1313| 3.45k| auto child_size = pos.size_sbh(idx, left_size); 1314| 3.45k| auto dropped_size = first; 1315| 3.45k| auto child_dropped_size = dropped_size - left_size; 1316| 3.45k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 3.45k, Folded] | Branch (1316:25): [True: 1.86k, False: 1.59k] | Branch (1316:45): [True: 1.63k, False: 228] ------------------ 1317| 1.63k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 323, False: 1.31k] ------------------ 1318| 1.63k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 1.63k| if (mutate) ------------------ | Branch (1319:17): [True: 323, False: 1.31k] ------------------ 1320| 323| pos.visit(dec_left_visitor{}, idx); 1321| 1.31k| else if (Mutating) ------------------ | Branch (1321:22): [True: 1.31k, Folded] ------------------ 1322| 1.31k| pos.visit(dec_visitor{}); 1323| 1.63k| return r; 1324| 1.81k| } else { 1325| 1.81k| 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.81k| auto newcount = count - idx; 1330| 1.81k| auto newn = 1331| 1.81k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 1.21k, False: 608] ------------------ 1332| 1.21k| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 1.21k| norefs_tag{})) relaxed_t, 1334| 1.21k| node) 1335| 1.81k| : node_t::make_inner_r_e(e); 1336| 1.81k| auto newr = newn->relaxed(); 1337| 1.81k| IMMER_TRY { ------------------ | | 49| 1.81k|#define IMMER_TRY try ------------------ 1338| 1.81k| auto subs = 1339| 1.81k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 1.21k, False: 608] ------------------ 1340| 1.81k| : pos.towards_sub_oh( 1341| 608| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.81k| if (mutate) ------------------ | Branch (1342:21): [True: 1.21k, False: 608] ------------------ 1343| 1.21k| pos.each_left(dec_visitor{}, idx); 1344| 1.81k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.81k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.81k, False: 0] ------------------ 1346| 1.81k| pos.copy_sizes( 1347| 1.81k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.81k| newr->d.count = newcount; 1349| 1.81k| newn->inner()[0] = get<1>(subs); 1350| 1.81k| std::copy(node->inner() + idx + 1, 1351| 1.81k| node->inner() + count, 1352| 1.81k| newn->inner() + 1); 1353| 1.81k| if (!mutate) { ------------------ | Branch (1353:21): [True: 608, False: 1.21k] ------------------ 1354| 608| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 608| if (Mutating) ------------------ | Branch (1355:25): [True: 608, Folded] ------------------ 1356| 608| pos.visit(dec_visitor{}); 1357| 608| } 1358| 1.81k| return std::make_tuple(pos.shift(), newn); 1359| 1.81k| } 1360| 1.81k| 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.81k| } 1373| 3.45k| } _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| 12.3k| { 350| 12.3k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 12.3k, False: 0] ------------------ 351| 12.3k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 11.2k, False: 1.10k] ------------------ 352| 12.3k| ? visit_maybe_relaxed_sub(rootl, 353| 11.2k| shiftl, 354| 11.2k| sizel, 355| 11.2k| this_t{}, 356| 11.2k| posr, 357| 11.2k| first, 358| 11.2k| size_t{}) 359| 12.3k| : posr.first_sub_inner( 360| 1.10k| rrb{}, first, rootl, shiftl, sizel); 361| 12.3k| } _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| 30.2k| { 383| 30.2k| auto nl = posl.node(); 384| 30.2k| auto nr = posr.node(); 385| 30.2k| if (nl == nr) ------------------ | Branch (385:13): [True: 9.69k, False: 20.5k] ------------------ 386| 9.69k| return true; 387| 20.5k| auto cl = posl.count(); 388| 20.5k| auto cr = posr.count(); 389| 20.5k| assert(cr > 0); ------------------ | Branch (389:9): [True: 20.5k, False: 0] ------------------ 390| 20.5k| auto sbr = size_t{}; 391| 20.5k| auto i = count_t{}; 392| 20.5k| auto j = count_t{}; 393| 64.1k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 52.9k, False: 11.1k] ------------------ 394| 52.9k| auto sbl = posl.size_before(i); 395| 83.8k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 67.7k, False: 16.0k] | Branch (395:34): [True: 30.8k, False: 36.9k] ------------------ 396| 30.8k| ; 397| 52.9k| auto res = 398| 52.9k| sbl == sbr ------------------ | Branch (398:17): [True: 33.5k, False: 19.4k] ------------------ 399| 52.9k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 52.9k| : posl.nth_sub(i, 401| 19.4k| for_each_chunk_p_visitor{}, 402| 19.4k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 52.9k| if (!res) ------------------ | Branch (403:17): [True: 9.40k, False: 43.5k] ------------------ 404| 9.40k| return false; 405| 52.9k| } 406| 11.1k| return true; 407| 20.5k| } _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| 9.22k| { 337| 9.22k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 9.22k| } _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.77k| { 428| 9.77k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 4.55k, False: 5.21k] ------------------ 429| 4.55k| return true; 430| 5.21k| auto cl = posl.count(); 431| 5.21k| auto cr = posr.count(); 432| 5.21k| auto mp = std::min(cl, cr); 433| 5.21k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 3.79k, False: 1.41k] ------------------ 434| 5.21k| posl.node()->leaf() + mp, 435| 5.21k| posr.node()->leaf()) && 436| 3.79k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 3.39k, False: 400] ------------------ 437| 3.79k| posl.node()->leaf() + posl.count(), 438| 3.79k| first + (idx + mp)); 439| 9.77k| } _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| 22.0k| { 330| 22.0k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 22.0k| } _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.50k| { 413| 4.50k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 4.50k| } _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.50k| { 383| 4.50k| auto nl = posl.node(); 384| 4.50k| auto nr = posr.node(); 385| 4.50k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 4.50k] ------------------ 386| 0| return true; 387| 4.50k| auto cl = posl.count(); 388| 4.50k| auto cr = posr.count(); 389| 4.50k| assert(cr > 0); ------------------ | Branch (389:9): [True: 4.50k, False: 0] ------------------ 390| 4.50k| auto sbr = size_t{}; 391| 4.50k| auto i = count_t{}; 392| 4.50k| auto j = count_t{}; 393| 12.8k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 10.7k, False: 2.10k] ------------------ 394| 10.7k| auto sbl = posl.size_before(i); 395| 16.7k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 12.4k, False: 4.35k] | Branch (395:34): [True: 6.00k, False: 6.40k] ------------------ 396| 6.00k| ; 397| 10.7k| auto res = 398| 10.7k| sbl == sbr ------------------ | Branch (398:17): [True: 6.57k, False: 4.18k] ------------------ 399| 10.7k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 10.7k| : posl.nth_sub(i, 401| 4.18k| for_each_chunk_p_visitor{}, 402| 4.18k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 10.7k| if (!res) ------------------ | Branch (403:17): [True: 2.39k, False: 8.36k] ------------------ 404| 2.39k| return false; 405| 10.7k| } 406| 2.10k| return true; 407| 4.50k| } _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.55k| { 337| 3.55k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 3.55k| } _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.78k| { 428| 6.78k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 3.97k, False: 2.80k] ------------------ 429| 3.97k| return true; 430| 2.80k| auto cl = posl.count(); 431| 2.80k| auto cr = posr.count(); 432| 2.80k| auto mp = std::min(cl, cr); 433| 2.80k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 2.58k, False: 227] ------------------ 434| 2.80k| posl.node()->leaf() + mp, 435| 2.80k| posr.node()->leaf()) && 436| 2.58k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 2.33k, False: 242] ------------------ 437| 2.58k| posl.node()->leaf() + posl.count(), 438| 2.58k| first + (idx + mp)); 439| 6.78k| } _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.28k| { 330| 2.28k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.28k| } _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.76k| { 413| 2.76k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 2.76k| } _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.76k| { 383| 2.76k| auto nl = posl.node(); 384| 2.76k| auto nr = posr.node(); 385| 2.76k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.76k] ------------------ 386| 0| return true; 387| 2.76k| auto cl = posl.count(); 388| 2.76k| auto cr = posr.count(); 389| 2.76k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.76k, False: 0] ------------------ 390| 2.76k| auto sbr = size_t{}; 391| 2.76k| auto i = count_t{}; 392| 2.76k| auto j = count_t{}; 393| 12.6k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 10.3k, False: 2.37k] ------------------ 394| 10.3k| auto sbl = posl.size_before(i); 395| 17.5k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 13.5k, False: 4.03k] | Branch (395:34): [True: 7.28k, False: 6.28k] ------------------ 396| 7.28k| ; 397| 10.3k| auto res = 398| 10.3k| sbl == sbr ------------------ | Branch (398:17): [True: 5.76k, False: 4.54k] ------------------ 399| 10.3k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 10.3k| : posl.nth_sub(i, 401| 4.54k| for_each_chunk_p_visitor{}, 402| 4.54k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 10.3k| if (!res) ------------------ | Branch (403:17): [True: 389, False: 9.92k] ------------------ 404| 389| return false; 405| 10.3k| } 406| 2.37k| return true; 407| 2.76k| } _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.78k| { 337| 3.78k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 3.78k| } _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| 868| { 330| 868| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 868| } _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.10k| { 330| 1.10k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 1.10k| } _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.84k| { 420| 1.84k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 1.84k, False: 0] ------------------ 421| 1.84k| ? this_t::visit_regular(posl, posr.node()) 422| 1.84k| : this_t::visit_regular(posr, posl.node()); 423| 1.84k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESE_EEbOT_PT0_: 443| 9.47k| { 444| 9.47k| auto node = pos.node(); 445| 9.47k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 6.41k, False: 3.05k] | Branch (445:33): [True: 1.59k, False: 1.45k] ------------------ 446| 9.47k| } _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| 12.3k| { 451| 12.3k| auto node = pos.node(); 452| 12.3k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 8.31k, False: 3.98k] | Branch (452:33): [True: 2.28k, False: 1.70k] ------------------ 453| 3.98k| node->leaf() + pos.count(), 454| 3.98k| other->leaf()); 455| 12.3k| } _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| 7.26k| { 444| 7.26k| auto node = pos.node(); 445| 7.26k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 2.46k, False: 4.79k] | Branch (445:33): [True: 2.68k, False: 2.11k] ------------------ 446| 7.26k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESE_EEbOT_PT0_: 450| 2.87k| { 451| 2.87k| auto node = pos.node(); 452| 2.87k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.58k, False: 1.28k] | Branch (452:33): [True: 627, False: 658] ------------------ 453| 1.28k| node->leaf() + pos.count(), 454| 1.28k| other->leaf()); 455| 2.87k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESE_EEbOT_PT0_: 443| 3.85k| { 444| 3.85k| auto node = pos.node(); 445| 3.85k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 468, False: 3.39k] | Branch (445:33): [True: 2.42k, False: 969] ------------------ 446| 3.85k| } _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| 346k| { 113| 346k| auto data = as_const(pos.node()->leaf()); 114| 346k| return fn(data, data + pos.count()); 115| 346k| } _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.35M| return [iter](auto f, auto e) mutable { 368| 1.35M| if (f == &*iter) { ------------------ | Branch (368:17): [True: 194k, False: 1.16M] ------------------ 369| 194k| iter += e - f; 370| 194k| return true; 371| 194k| } 372| 5.30M| for (; f != e; ++f, ++iter) ------------------ | Branch (372:20): [True: 4.14M, False: 1.15M] ------------------ 373| 4.14M| if (*f != *iter) ------------------ | Branch (373:21): [True: 3.60k, False: 4.14M] ------------------ 374| 3.60k| return false; 375| 1.15M| return true; 376| 1.16M| }; _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.38M| { 54| 9.38M| return pos.towards(this_t{}, idx); 55| 9.38M| } _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.00M| { 60| 1.00M| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 1.00M| } _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| 372k| { 54| 372k| return pos.towards(this_t{}, idx); 55| 372k| } _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| 348k| { 60| 348k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 348k| } _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.04M| { 54| 1.04M| return pos.towards(this_t{}, idx); 55| 1.04M| } _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| 24.1k| { 60| 24.1k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 24.1k| } _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| 109k| { 54| 109k| return pos.towards(this_t{}, idx); 55| 109k| } _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| 93.7k| { 107| 93.7k| return pos.each_pred(this_t{}, fn); 108| 93.7k| } _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| 740| { 330| 740| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 740| } _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.19k| { 420| 6.19k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 6.19k, False: 0] ------------------ 421| 6.19k| ? this_t::visit_regular(posl, posr.node()) 422| 6.19k| : this_t::visit_regular(posr, posl.node()); 423| 6.19k| } _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| 991k| { 113| 991k| auto data = as_const(pos.node()->leaf()); 114| 991k| return fn(data, data + pos.count()); 115| 991k| } _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.8k| { 107| 20.8k| return pos.each_pred(this_t{}, fn); 108| 20.8k| } _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| 19.3k| { 113| 19.3k| auto data = as_const(pos.node()->leaf()); 114| 19.3k| return fn(data, data + pos.count()); 115| 19.3k| } _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| 5.79k| { 107| 5.79k| return pos.each_pred(this_t{}, fn); 108| 5.79k| } _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.57k| { 330| 2.57k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.57k| } _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.33k| { 383| 2.33k| auto nl = posl.node(); 384| 2.33k| auto nr = posr.node(); 385| 2.33k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.33k] ------------------ 386| 0| return true; 387| 2.33k| auto cl = posl.count(); 388| 2.33k| auto cr = posr.count(); 389| 2.33k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.33k, False: 0] ------------------ 390| 2.33k| auto sbr = size_t{}; 391| 2.33k| auto i = count_t{}; 392| 2.33k| auto j = count_t{}; 393| 7.90k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 6.29k, False: 1.60k] ------------------ 394| 6.29k| auto sbl = posl.size_before(i); 395| 9.80k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 7.79k, False: 2.00k] | Branch (395:34): [True: 3.50k, False: 4.28k] ------------------ 396| 3.50k| ; 397| 6.29k| auto res = 398| 6.29k| sbl == sbr ------------------ | Branch (398:17): [True: 3.99k, False: 2.29k] ------------------ 399| 6.29k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 6.29k| : posl.nth_sub(i, 401| 2.29k| for_each_chunk_p_visitor{}, 402| 2.29k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 6.29k| if (!res) ------------------ | Branch (403:17): [True: 734, False: 5.56k] ------------------ 404| 734| return false; 405| 6.29k| } 406| 1.60k| return true; 407| 2.33k| } _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.65k| { 337| 4.65k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 4.65k| } _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.65k| { 428| 4.65k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 2.78k, False: 1.87k] ------------------ 429| 2.78k| return true; 430| 1.87k| auto cl = posl.count(); 431| 1.87k| auto cr = posr.count(); 432| 1.87k| auto mp = std::min(cl, cr); 433| 1.87k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 1.49k, False: 386] ------------------ 434| 1.87k| posl.node()->leaf() + mp, 435| 1.87k| posr.node()->leaf()) && 436| 1.49k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 1.49k, False: 0] ------------------ 437| 1.49k| posl.node()->leaf() + posl.count(), 438| 1.49k| first + (idx + mp)); 439| 4.65k| } _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.67k| { 330| 2.67k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.67k| } _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.60k| { 383| 1.60k| auto nl = posl.node(); 384| 1.60k| auto nr = posr.node(); 385| 1.60k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 1.60k] ------------------ 386| 0| return true; 387| 1.60k| auto cl = posl.count(); 388| 1.60k| auto cr = posr.count(); 389| 1.60k| assert(cr > 0); ------------------ | Branch (389:9): [True: 1.60k, False: 0] ------------------ 390| 1.60k| auto sbr = size_t{}; 391| 1.60k| auto i = count_t{}; 392| 1.60k| auto j = count_t{}; 393| 7.03k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 5.82k, False: 1.21k] ------------------ 394| 5.82k| auto sbl = posl.size_before(i); 395| 9.98k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 8.80k, False: 1.17k] | Branch (395:34): [True: 4.16k, False: 4.64k] ------------------ 396| 4.16k| ; 397| 5.82k| auto res = 398| 5.82k| sbl == sbr ------------------ | Branch (398:17): [True: 3.65k, False: 2.16k] ------------------ 399| 5.82k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 5.82k| : posl.nth_sub(i, 401| 2.16k| for_each_chunk_p_visitor{}, 402| 2.16k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 5.82k| if (!res) ------------------ | Branch (403:17): [True: 388, False: 5.43k] ------------------ 404| 388| return false; 405| 5.82k| } 406| 1.21k| return true; 407| 1.60k| } _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.07k| { 420| 1.07k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 1.07k, False: 0] ------------------ 421| 1.07k| ? this_t::visit_regular(posl, posr.node()) 422| 1.07k| : this_t::visit_regular(posr, posl.node()); 423| 1.07k| } _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| 609k| { 107| 609k| return pos.each_pred(this_t{}, fn); 108| 609k| } _ZN5immer6detail4rbts14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaOT_: 366| 32.6k| { 367| 32.6k| return [iter](auto f, auto e) mutable { 368| 32.6k| if (f == &*iter) { 369| 32.6k| iter += e - f; 370| 32.6k| return true; 371| 32.6k| } 372| 32.6k| for (; f != e; ++f, ++iter) 373| 32.6k| if (*f != *iter) 374| 32.6k| return false; 375| 32.6k| return true; 376| 32.6k| }; 377| 32.6k| } _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.43k| { 350| 1.43k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 1.43k, False: 0] ------------------ 351| 1.43k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 1.10k, False: 334] ------------------ 352| 1.43k| ? visit_maybe_relaxed_sub(rootl, 353| 1.10k| shiftl, 354| 1.10k| sizel, 355| 1.10k| this_t{}, 356| 1.10k| posr, 357| 1.10k| first, 358| 1.10k| size_t{}) 359| 1.43k| : posr.first_sub_inner( 360| 334| rrb{}, first, rootl, shiftl, sizel); 361| 1.43k| } _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| 5.95k| { 350| 5.95k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 5.95k, False: 0] ------------------ 351| 5.95k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 5.95k, False: 0] ------------------ 352| 5.95k| ? visit_maybe_relaxed_sub(rootl, 353| 5.95k| shiftl, 354| 5.95k| sizel, 355| 5.95k| this_t{}, 356| 5.95k| posr, 357| 5.95k| first, 358| 5.95k| size_t{}) 359| 5.95k| : posr.first_sub_inner( 360| 0| rrb{}, first, rootl, shiftl, sizel); 361| 5.95k| } _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.94k| { 451| 6.94k| auto node = pos.node(); 452| 6.94k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 3.81k, False: 3.13k] | Branch (452:33): [True: 1.10k, False: 2.03k] ------------------ 453| 3.13k| node->leaf() + pos.count(), 454| 3.13k| other->leaf()); 455| 6.94k| } _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| 30.7M|{ 1839| 30.7M| assert(node); ------------------ | Branch (1839:5): [True: 30.7M, False: 0] ------------------ 1840| 30.7M| auto relaxed = node->relaxed(); 1841| 30.7M| if (relaxed) { ------------------ | Branch (1841:9): [True: 28.2M, False: 2.50M] ------------------ 1842| 28.2M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 28.2M, False: 0] ------------------ 1843| 28.2M| return make_relaxed_pos(node, shift, relaxed) 1844| 28.2M| .visit(v, std::forward(args)...); 1845| 28.2M| } else { 1846| 2.50M| return make_regular_sub_pos(node, shift, size) 1847| 2.50M| .visit(v, std::forward(args)...); 1848| 2.50M| } 1849| 30.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| 96.4M|{ 1829| 96.4M| assert(node); ------------------ | Branch (1829:5): [True: 96.4M, False: 0] ------------------ 1830| 96.4M| assert(relaxed); ------------------ | Branch (1830:5): [True: 96.4M, False: 0] ------------------ 1831| 96.4M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1831:5): [True: 96.4M, False: 0] ------------------ 1832| 96.4M| return {node, shift, relaxed}; 1833| 96.4M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1813| 36.0M| { 1814| 36.0M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 36.0M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 1431| 58.7M| 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| 11.7M| { 1477| 11.7M| each_left(v, relaxed_->d.count, args...); 1478| 11.7M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1623| 11.9M| { 1624| 11.9M| auto p = node_->inner(); 1625| 11.9M| auto s = size_t{}; 1626| 11.9M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 2.12M, False: 9.78M] ------------------ 1627| 9.30M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 7.17M, False: 2.12M] ------------------ 1628| 7.17M| IMMER_PREFETCH(p + i + 1); 1629| 7.17M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 7.17M| .visit(v, args...); 1631| 7.17M| s = relaxed_->d.sizes[i]; 1632| 7.17M| assert(s); ------------------ | Branch (1632:17): [True: 7.17M, False: 0] ------------------ 1633| 7.17M| } 1634| 9.78M| } else { 1635| 9.78M| auto ss = shift_ - B; 1636| 38.8M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 29.1M, False: 9.78M] ------------------ 1637| 29.1M| visit_maybe_relaxed_sub( 1638| 29.1M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 29.1M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 29.1M, False: 0] ------------------ 1641| 29.1M| } 1642| 9.78M| } 1643| 11.9M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5countEv: 1430| 55.7M| 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.25M|{ 1045| 6.25M| assert(node); ------------------ | Branch (1045:5): [True: 6.25M, False: 0] ------------------ 1046| 6.25M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1046:5): [True: 6.25M, False: 0] ------------------ 1047| 6.25M| assert(size > 0); ------------------ | Branch (1047:5): [True: 6.25M, False: 0] ------------------ 1048| 6.25M| assert(size <= (branches << shift)); ------------------ | Branch (1048:5): [True: 6.25M, False: 0] ------------------ 1049| 6.25M| return {node, shift, size}; 1050| 6.25M|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1036| 2.51M| { 1037| 2.51M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.51M| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 785| 8.44M| 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| 639k| { 826| 639k| return each_regular(*this, v, args...); 827| 639k| } _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| 639k|{ 344| 639k| constexpr auto B = bits; 345| 639k| constexpr auto BL = bits_leaf; 346| 639k| auto n = p.node()->inner(); 347| 639k| auto last = p.count() - 1; 348| 639k| auto e = n + last; 349| 639k| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 57.3k, False: 581k] ------------------ 350| 124k| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 67.1k, False: 57.3k] ------------------ 351| 67.1k| IMMER_PREFETCH(n + 1); 352| 67.1k| make_full_leaf_pos(*n).visit(v, args...); 353| 67.1k| } 354| 57.3k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 581k| } else { 356| 581k| auto ss = p.shift() - B; 357| 1.36M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 787k, False: 581k] ------------------ 358| 787k| make_full_pos(*n, ss).visit(v, args...); 359| 581k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 581k| } 361| 639k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 787| 8.02M| 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.39M|{ 215| 4.39M| assert(node); ------------------ | Branch (215:5): [True: 4.39M, False: 0] ------------------ 216| 4.39M| return {node}; 217| 4.39M|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 207| 1.29M| { 208| 1.29M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.29M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 199| 3.34M| 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.67M| 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.08M|{ 120| 1.08M| assert(node); ------------------ | Branch (120:5): [True: 1.08M, False: 0] ------------------ 121| 1.08M| assert(size > 0); ------------------ | Branch (121:5): [True: 1.08M, False: 0] ------------------ 122| 1.08M| return {node, size}; 123| 1.08M|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 786| 4.59M| 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| 508k| { 113| 508k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 508k| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 104| 1.08M| 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.11M| 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.15M| 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.51M|{ 1413| 6.51M| assert(node); ------------------ | Branch (1413:5): [True: 6.51M, False: 0] ------------------ 1414| 6.51M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1414:5): [True: 6.51M, False: 0] ------------------ 1415| 6.51M| return {node, shift}; 1416| 6.51M|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1405| 3.75M| { 1406| 3.75M| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.75M| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 1159| 4.55M| 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| 248k| { 1186| 248k| auto p = node_->inner(); 1187| 248k| auto e = p + branches; 1188| 248k| if (shift_ == BL) { ------------------ | Branch (1188:13): [True: 190k, False: 57.8k] ------------------ 1189| 951k| for (; p != e; ++p) { ------------------ | Branch (1189:20): [True: 761k, False: 190k] ------------------ 1190| 761k| IMMER_PREFETCH(p + 1); 1191| 761k| make_full_leaf_pos(*p).visit(v, args...); 1192| 761k| } 1193| 190k| } else { 1194| 57.8k| auto ss = shift_ - B; 1195| 289k| for (; p != e; ++p) ------------------ | Branch (1195:20): [True: 231k, False: 57.8k] ------------------ 1196| 231k| make_full_pos(*p, ss).visit(v, args...); 1197| 57.8k| } 1198| 248k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5countEv: 1158| 1.74M| 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| 6.08M|{ 691| 6.08M| assert(node); ------------------ | Branch (691:5): [True: 6.08M, False: 0] ------------------ 692| 6.08M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (692:5): [True: 6.08M, False: 0] ------------------ 693| 6.08M| assert(size > 0); ------------------ | Branch (693:5): [True: 6.08M, False: 0] ------------------ 694| 6.08M| return {node, shift, size}; 695| 6.08M|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 336| 2.58M| { 337| 2.58M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.58M| } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 231| 11.1M| 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.43M| { 244| 2.43M| return each_regular(*this, v, args...); 245| 2.43M| } _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.43M|{ 344| 2.43M| constexpr auto B = bits; 345| 2.43M| constexpr auto BL = bits_leaf; 346| 2.43M| auto n = p.node()->inner(); 347| 2.43M| auto last = p.count() - 1; 348| 2.43M| auto e = n + last; 349| 2.43M| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 443k, False: 1.99M] ------------------ 350| 890k| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 446k, False: 443k] ------------------ 351| 446k| IMMER_PREFETCH(n + 1); 352| 446k| make_full_leaf_pos(*n).visit(v, args...); 353| 446k| } 354| 443k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 1.99M| } else { 356| 1.99M| auto ss = p.shift() - B; 357| 4.71M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 2.72M, False: 1.99M] ------------------ 358| 2.72M| make_full_pos(*n, ss).visit(v, args...); 359| 1.99M| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 1.99M| } 361| 2.43M|} _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 233| 10.6M| 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| 15.1M| 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.76M| 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| 14.7M| 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.64M| 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| 9.99M| 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.73M|{ 65| 1.73M| return {node}; 66| 1.73M|} _ZN5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 57| 1.73M| { 58| 1.73M| return Visitor::visit_regular(*this, std::forward(args)...); 59| 1.73M| } _ZNK5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 41| 1.73M| 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| 18.3M|{ 152| 18.3M| assert(node); ------------------ | Branch (152:5): [True: 18.3M, False: 0] ------------------ 153| 18.3M| assert(count <= branches); ------------------ | Branch (153:5): [True: 18.3M, False: 0] ------------------ 154| 18.3M| return {node, count}; 155| 18.3M|} _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 144| 10.4M| { 145| 10.4M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 10.4M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 136| 15.9M| 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| 8.82M| 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.64M|{ 89| 1.64M| assert(node); ------------------ | Branch (89:5): [True: 1.64M, False: 0] ------------------ 90| 1.64M| return {node}; 91| 1.64M|} _ZN5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 81| 1.64M| { 82| 1.64M| return Visitor::visit_leaf(*this, std::forward(args)...); 83| 1.64M| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 75| 1.64M| 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.15k| 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| 560k| { 1814| 560k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 560k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 1433| 11.4M| 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| 5.89M| { 1444| 5.89M| return size_sbh(offset, size_before(offset)); 1445| 5.89M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8size_sbhEjm: 1448| 6.19M| { 1449| 6.19M| assert(size_before_hint == size_before(offset)); ------------------ | Branch (1449:9): [True: 6.19M, False: 0] ------------------ 1450| 6.19M| return relaxed_->d.sizes[offset] - size_before_hint; 1451| 6.19M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11size_beforeEj: 1438| 17.2M| { 1439| 17.2M| return offset ? relaxed_->d.sizes[offset - 1] : 0; ------------------ | Branch (1439:16): [True: 11.0M, False: 6.14M] ------------------ 1440| 17.2M| } _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| 546k| { 1738| 546k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 546k, False: 0] ------------------ 1739| 546k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 546k, False: 0] ------------------ 1740| 546k| auto child = node_->inner()[offset_hint]; 1741| 546k| auto is_leaf = shift_ == BL; 1742| 546k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 546k] ------------------ 1743| 546k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 546k| : visit_maybe_relaxed_sub( 1745| 546k| child, shift_ - B, child_size_hint, v, args...); 1746| 546k| } _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| 546k|{ 1839| 546k| assert(node); ------------------ | Branch (1839:5): [True: 546k, False: 0] ------------------ 1840| 546k| auto relaxed = node->relaxed(); 1841| 546k| if (relaxed) { ------------------ | Branch (1841:9): [True: 345k, False: 201k] ------------------ 1842| 345k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 345k, False: 0] ------------------ 1843| 345k| return make_relaxed_pos(node, shift, relaxed) 1844| 345k| .visit(v, std::forward(args)...); 1845| 345k| } else { 1846| 201k| return make_regular_sub_pos(node, shift, size) 1847| 201k| .visit(v, std::forward(args)...); 1848| 201k| } 1849| 546k|} _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| 201k| { 1037| 201k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 201k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 788| 2.48M| 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| 548k| { 953| 548k| return last_oh_regular(*this, v, offset_hint, args...); 954| 548k| } _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| 548k|{ 678| 548k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 548k, False: 0] ------------------ 679| 548k| constexpr auto B = bits; 680| 548k| constexpr auto BL = bits_leaf; 681| 548k| auto child = p.node()->inner()[offset_hint]; 682| 548k| auto is_leaf = p.shift() == BL; 683| 548k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 548k] ------------------ 684| 548k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 548k| .visit(v, args...); 686| 548k|} _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.40M| { 337| 2.40M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.40M| } _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.85M| { 331| 1.85M| return last_oh_regular(*this, v, offset_hint, args...); 332| 1.85M| } _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.85M|{ 678| 1.85M| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.85M, False: 0] ------------------ 679| 1.85M| constexpr auto B = bits; 680| 1.85M| constexpr auto BL = bits_leaf; 681| 1.85M| auto child = p.node()->inner()[offset_hint]; 682| 1.85M| auto is_leaf = p.shift() == BL; 683| 1.85M| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.85M] ------------------ 684| 1.85M| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.85M| .visit(v, args...); 686| 1.85M|} _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 1432| 21.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| 370k| { 1037| 370k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 370k| } 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| 37.3k| { 145| 37.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 37.3k| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 139| 1.16M| 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| 345k|{ 1839| 345k| assert(node); ------------------ | Branch (1839:5): [True: 345k, False: 0] ------------------ 1840| 345k| auto relaxed = node->relaxed(); 1841| 345k| if (relaxed) { ------------------ | Branch (1841:9): [True: 314k, False: 30.8k] ------------------ 1842| 314k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 314k, False: 0] ------------------ 1843| 314k| return make_relaxed_pos(node, shift, relaxed) 1844| 314k| .visit(v, std::forward(args)...); 1845| 314k| } else { 1846| 30.8k| return make_regular_sub_pos(node, shift, size) 1847| 30.8k| .visit(v, std::forward(args)...); 1848| 30.8k| } 1849| 345k|} 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| 314k| { 1814| 314k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 314k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 1454| 30.5M| { 1455| 30.5M| auto offset = idx >> shift_; 1456| 41.7M| while (relaxed_->d.sizes[offset] <= idx) ------------------ | Branch (1456:16): [True: 11.1M, False: 30.5M] ------------------ 1457| 11.1M| ++offset; 1458| 30.5M| return offset; 1459| 30.5M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7relaxedEv: 1435| 314k| 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| 314k| { 1687| 314k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 314k, False: 0] ------------------ 1688| 314k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 71.4k, False: 243k] ------------------ 1689| 314k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 314k| } 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| 314k| { 1699| 314k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 314k| } 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| 314k| { 1718| 314k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 314k, False: 0] ------------------ 1719| 314k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 71.4k, False: 243k] | Branch (1719:9): [True: 314k, False: 0] ------------------ 1720| 314k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 314k| auto child = node_->inner()[offset_hint]; 1722| 314k| auto is_leaf = shift_ == BL; 1723| 314k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 314k| auto next_idx = idx - left_size_hint; 1725| 314k| return is_leaf ------------------ | Branch (1725:16): [True: 53.6k, False: 260k] ------------------ 1726| 314k| ? make_leaf_sub_pos(child, next_size) 1727| 53.6k| .visit(v, next_idx, args...) 1728| 314k| : visit_maybe_relaxed_sub( 1729| 260k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 314k| } 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| 53.6k| { 145| 53.6k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 53.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| 30.8k| { 1037| 30.8k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 30.8k| } 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| 30.8k| { 939| 30.8k| return towards_oh_ch_regular( 940| 30.8k| *this, v, idx, offset_hint, count(), args...); 941| 30.8k| } 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| 30.8k|{ 633| 30.8k| constexpr auto B = bits; 634| 30.8k| constexpr auto BL = bits_leaf; 635| 30.8k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 30.8k, False: 0] ------------------ 636| 30.8k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 30.8k, False: 0] ------------------ 637| 30.8k| auto is_leaf = p.shift() == BL; 638| 30.8k| auto child = p.node()->inner()[offset_hint]; 639| 30.8k| auto is_full = offset_hint + 1 != count_hint; 640| 30.8k| return is_full ------------------ | Branch (640:12): [True: 24.4k, False: 6.43k] ------------------ 641| 30.8k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 14.6k, False: 9.80k] ------------------ 642| 24.4k| : make_full_pos(child, p.shift() - B) 643| 9.80k| .visit(v, idx, args...)) 644| 30.8k| : (is_leaf ------------------ | Branch (644:19): [True: 3.90k, False: 2.53k] ------------------ 645| 6.43k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 6.43k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.53k| .visit(v, idx, args...)); 648| 30.8k|} 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| 25.9k| { 208| 25.9k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 25.9k| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 202| 429k| 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| 15.5k| { 1406| 15.5k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 15.5k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 1162| 2.17M| 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| 15.5k| { 1330| 15.5k| return towards_oh(v, idx, offset_hint, args...); 1331| 15.5k| } 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| 15.5k| { 1337| 15.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 15.5k, False: 0] ------------------ 1338| 15.5k| auto is_leaf = shift_ == BL; 1339| 15.5k| auto child = node_->inner()[offset_hint]; 1340| 15.5k| return is_leaf ------------------ | Branch (1340:16): [True: 10.7k, False: 4.84k] ------------------ 1341| 15.5k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 15.5k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 15.5k| } 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| 4.89k| { 113| 4.89k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 4.89k| } 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| 2.91k| { 337| 2.91k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.91k| } 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| 2.91k| { 317| 2.91k| return towards_oh_ch_regular( 318| 2.91k| *this, v, idx, offset_hint, count(), args...); 319| 2.91k| } 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| 2.91k|{ 633| 2.91k| constexpr auto B = bits; 634| 2.91k| constexpr auto BL = bits_leaf; 635| 2.91k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.91k, False: 0] ------------------ 636| 2.91k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.91k, False: 0] ------------------ 637| 2.91k| auto is_leaf = p.shift() == BL; 638| 2.91k| auto child = p.node()->inner()[offset_hint]; 639| 2.91k| auto is_full = offset_hint + 1 != count_hint; 640| 2.91k| return is_full ------------------ | Branch (640:12): [True: 1.53k, False: 1.37k] ------------------ 641| 2.91k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 643, False: 894] ------------------ 642| 1.53k| : make_full_pos(child, p.shift() - B) 643| 894| .visit(v, idx, args...)) 644| 2.91k| : (is_leaf ------------------ | Branch (644:19): [True: 996, False: 382] ------------------ 645| 1.37k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.37k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 382| .visit(v, idx, args...)); 648| 2.91k|} _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| 38.1k|{ 1839| 38.1k| assert(node); ------------------ | Branch (1839:5): [True: 38.1k, False: 0] ------------------ 1840| 38.1k| auto relaxed = node->relaxed(); 1841| 38.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 31.2k, False: 6.85k] ------------------ 1842| 31.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 31.2k, False: 0] ------------------ 1843| 31.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 31.2k| .visit(v, std::forward(args)...); 1845| 31.2k| } else { 1846| 6.85k| return make_regular_sub_pos(node, shift, size) 1847| 6.85k| .visit(v, std::forward(args)...); 1848| 6.85k| } 1849| 38.1k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 31.2k| { 1814| 31.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 31.2k| } _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| 22.1k| { 1687| 22.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 22.1k, False: 0] ------------------ 1688| 22.1k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 22.1k] ------------------ 1689| 22.1k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 22.1k| } _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| 22.1k| { 1699| 22.1k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 22.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_Lb1EEEJEEEDcT_mjmDpOT0_: 1717| 22.1k| { 1718| 22.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 22.1k, False: 0] ------------------ 1719| 22.1k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 22.1k] | Branch (1719:9): [True: 22.1k, False: 0] ------------------ 1720| 22.1k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 22.1k| auto child = node_->inner()[offset_hint]; 1722| 22.1k| auto is_leaf = shift_ == BL; 1723| 22.1k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 22.1k| auto next_idx = idx - left_size_hint; 1725| 22.1k| return is_leaf ------------------ | Branch (1725:16): [True: 1.92k, False: 20.1k] ------------------ 1726| 22.1k| ? make_leaf_sub_pos(child, next_size) 1727| 1.92k| .visit(v, next_idx, args...) 1728| 22.1k| : visit_maybe_relaxed_sub( 1729| 20.1k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 22.1k| } _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| 1.92k| { 145| 1.92k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.92k| } _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| 21.0k| { 1687| 21.0k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 21.0k, False: 0] ------------------ 1688| 21.0k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 13.6k, False: 7.39k] ------------------ 1689| 21.0k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 21.0k| } _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| 21.0k| { 1699| 21.0k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 21.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1717| 21.0k| { 1718| 21.0k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 21.0k, False: 0] ------------------ 1719| 21.0k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 13.6k, False: 7.39k] | Branch (1719:9): [True: 21.0k, False: 0] ------------------ 1720| 21.0k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 21.0k| auto child = node_->inner()[offset_hint]; 1722| 21.0k| auto is_leaf = shift_ == BL; 1723| 21.0k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 21.0k| auto next_idx = idx - left_size_hint; 1725| 21.0k| return is_leaf ------------------ | Branch (1725:16): [True: 5.03k, False: 16.0k] ------------------ 1726| 21.0k| ? make_leaf_sub_pos(child, next_size) 1727| 5.03k| .visit(v, next_idx, args...) 1728| 21.0k| : visit_maybe_relaxed_sub( 1729| 16.0k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 21.0k| } _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.03k| { 145| 5.03k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.03k| } _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| 16.0k|{ 1839| 16.0k| assert(node); ------------------ | Branch (1839:5): [True: 16.0k, False: 0] ------------------ 1840| 16.0k| auto relaxed = node->relaxed(); 1841| 16.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 11.9k, False: 4.10k] ------------------ 1842| 11.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 11.9k, False: 0] ------------------ 1843| 11.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 11.9k| .visit(v, std::forward(args)...); 1845| 11.9k| } else { 1846| 4.10k| return make_regular_sub_pos(node, shift, size) 1847| 4.10k| .visit(v, std::forward(args)...); 1848| 4.10k| } 1849| 16.0k|} _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.9k| { 1814| 11.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 11.9k| } _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| 4.10k| { 1037| 4.10k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.10k| } _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| 7.53k| { 928| 7.53k| return towards_oh_ch_regular( 929| 7.53k| *this, v, idx, offset_hint, count(), args...); 930| 7.53k| } _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| 7.53k|{ 633| 7.53k| constexpr auto B = bits; 634| 7.53k| constexpr auto BL = bits_leaf; 635| 7.53k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 7.53k, False: 0] ------------------ 636| 7.53k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 7.53k, False: 0] ------------------ 637| 7.53k| auto is_leaf = p.shift() == BL; 638| 7.53k| auto child = p.node()->inner()[offset_hint]; 639| 7.53k| auto is_full = offset_hint + 1 != count_hint; 640| 7.53k| return is_full ------------------ | Branch (640:12): [True: 2.95k, False: 4.57k] ------------------ 641| 7.53k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.98k, False: 972] ------------------ 642| 2.95k| : make_full_pos(child, p.shift() - B) 643| 972| .visit(v, idx, args...)) 644| 7.53k| : (is_leaf ------------------ | Branch (644:19): [True: 937, False: 3.63k] ------------------ 645| 4.57k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 4.57k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.63k| .visit(v, idx, args...)); 648| 7.53k|} _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| 6.44k| { 208| 6.44k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 6.44k| } _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.47k| { 1406| 2.47k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.47k| } _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.83k| { 1337| 3.83k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 3.83k, False: 0] ------------------ 1338| 3.83k| auto is_leaf = shift_ == BL; 1339| 3.83k| auto child = node_->inner()[offset_hint]; 1340| 3.83k| return is_leaf ------------------ | Branch (1340:16): [True: 2.75k, False: 1.08k] ------------------ 1341| 3.83k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 3.83k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 3.83k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 1161| 168k| 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.44k| { 113| 2.44k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.44k| } _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.96k| { 337| 4.96k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.96k| } _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.96k| { 306| 4.96k| return towards_oh_ch_regular( 307| 4.96k| *this, v, idx, offset_hint, count(), args...); 308| 4.96k| } _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.96k|{ 633| 4.96k| constexpr auto B = bits; 634| 4.96k| constexpr auto BL = bits_leaf; 635| 4.96k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.96k, False: 0] ------------------ 636| 4.96k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.96k, False: 0] ------------------ 637| 4.96k| auto is_leaf = p.shift() == BL; 638| 4.96k| auto child = p.node()->inner()[offset_hint]; 639| 4.96k| auto is_full = offset_hint + 1 != count_hint; 640| 4.96k| return is_full ------------------ | Branch (640:12): [True: 2.12k, False: 2.84k] ------------------ 641| 4.96k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.70k, False: 421] ------------------ 642| 2.12k| : make_full_pos(child, p.shift() - B) 643| 421| .visit(v, idx, args...)) 644| 4.96k| : (is_leaf ------------------ | Branch (644:19): [True: 1.51k, False: 1.33k] ------------------ 645| 2.84k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.84k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.33k| .visit(v, idx, args...)); 648| 4.96k|} _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.85k| { 1037| 6.85k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.85k| } _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.43k| { 928| 3.43k| return towards_oh_ch_regular( 929| 3.43k| *this, v, idx, offset_hint, count(), args...); 930| 3.43k| } _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.43k|{ 633| 3.43k| constexpr auto B = bits; 634| 3.43k| constexpr auto BL = bits_leaf; 635| 3.43k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.43k, False: 0] ------------------ 636| 3.43k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.43k, False: 0] ------------------ 637| 3.43k| auto is_leaf = p.shift() == BL; 638| 3.43k| auto child = p.node()->inner()[offset_hint]; 639| 3.43k| auto is_full = offset_hint + 1 != count_hint; 640| 3.43k| return is_full ------------------ | Branch (640:12): [True: 2.71k, False: 712] ------------------ 641| 3.43k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 751, False: 1.96k] ------------------ 642| 2.71k| : make_full_pos(child, p.shift() - B) 643| 1.96k| .visit(v, idx, args...)) 644| 3.43k| : (is_leaf ------------------ | Branch (644:19): [True: 712, False: 0] ------------------ 645| 712| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 712| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 3.43k|} _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.35k| { 208| 1.35k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.35k| } _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.54k| { 1406| 2.54k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.54k| } _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.18k| { 1337| 1.18k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.18k, False: 0] ------------------ 1338| 1.18k| auto is_leaf = shift_ == BL; 1339| 1.18k| auto child = node_->inner()[offset_hint]; 1340| 1.18k| return is_leaf ------------------ | Branch (1340:16): [True: 607, False: 577] ------------------ 1341| 1.18k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.18k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.18k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 112| 712| { 113| 712| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 712| } _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| 21.9k|{ 1839| 21.9k| assert(node); ------------------ | Branch (1839:5): [True: 21.9k, False: 0] ------------------ 1840| 21.9k| auto relaxed = node->relaxed(); 1841| 21.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 14.5k, False: 7.46k] ------------------ 1842| 14.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 14.5k, False: 0] ------------------ 1843| 14.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 14.5k| .visit(v, std::forward(args)...); 1845| 14.5k| } else { 1846| 7.46k| return make_regular_sub_pos(node, shift, size) 1847| 7.46k| .visit(v, std::forward(args)...); 1848| 7.46k| } 1849| 21.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 14.5k| { 1814| 14.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 14.5k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8subindexEm: 1434| 9.68M| 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.46k| { 1706| 4.46k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 4.46k, False: 0] ------------------ 1707| 4.46k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 3.71k, False: 748] ------------------ 1708| 4.46k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 4.46k| } _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.46k| { 1718| 4.46k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 4.46k, False: 0] ------------------ 1719| 4.46k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.71k, False: 748] | Branch (1719:9): [True: 4.46k, False: 0] ------------------ 1720| 4.46k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 4.46k| auto child = node_->inner()[offset_hint]; 1722| 4.46k| auto is_leaf = shift_ == BL; 1723| 4.46k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 4.46k| auto next_idx = idx - left_size_hint; 1725| 4.46k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 4.46k] ------------------ 1726| 4.46k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 4.46k| : visit_maybe_relaxed_sub( 1729| 4.46k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 4.46k| } _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| 50.4k| { 1706| 50.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 50.4k, False: 0] ------------------ 1707| 50.4k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 14.8k, False: 35.6k] ------------------ 1708| 50.4k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 50.4k| } _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| 50.4k| { 1718| 50.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 50.4k, False: 0] ------------------ 1719| 50.4k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 14.8k, False: 35.6k] | Branch (1719:9): [True: 50.4k, False: 0] ------------------ 1720| 50.4k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 50.4k| auto child = node_->inner()[offset_hint]; 1722| 50.4k| auto is_leaf = shift_ == BL; 1723| 50.4k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 50.4k| auto next_idx = idx - left_size_hint; 1725| 50.4k| return is_leaf ------------------ | Branch (1725:16): [True: 7.93k, False: 42.5k] ------------------ 1726| 50.4k| ? make_leaf_sub_pos(child, next_size) 1727| 7.93k| .visit(v, next_idx, args...) 1728| 50.4k| : visit_maybe_relaxed_sub( 1729| 42.5k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 50.4k| } _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| 7.93k| { 145| 7.93k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.93k| } _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| 42.5k|{ 1839| 42.5k| assert(node); ------------------ | Branch (1839:5): [True: 42.5k, False: 0] ------------------ 1840| 42.5k| auto relaxed = node->relaxed(); 1841| 42.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 40.4k, False: 2.12k] ------------------ 1842| 40.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 40.4k, False: 0] ------------------ 1843| 40.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 40.4k| .visit(v, std::forward(args)...); 1845| 40.4k| } else { 1846| 2.12k| return make_regular_sub_pos(node, shift, size) 1847| 2.12k| .visit(v, std::forward(args)...); 1848| 2.12k| } 1849| 42.5k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1813| 40.4k| { 1814| 40.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 40.4k| } _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.12k| { 1037| 2.12k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.12k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11size_beforeEj: 791| 223k| { 792| 223k| return size_t{offset} << shift_; 793| 223k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8size_sbhEjm: 803| 27.2k| { 804| 27.2k| assert(size_before_hint == size_before(offset)); ------------------ | Branch (804:9): [True: 27.2k, False: 0] ------------------ 805| 27.2k| return offset == subindex(size_ - 1) ? size_ - size_before_hint ------------------ | Branch (805:16): [True: 15.2k, False: 12.0k] ------------------ 806| 27.2k| : size_t{1} << shift_; 807| 27.2k| } _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.33k| { 947| 8.33k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 8.33k| } _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.33k|{ 654| 8.33k| constexpr auto B = bits; 655| 8.33k| constexpr auto BL = bits_leaf; 656| 8.33k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 8.33k, False: 0] ------------------ 657| 8.33k| auto is_leaf = p.shift() == BL; 658| 8.33k| auto child = p.node()->inner()[offset_hint]; 659| 8.33k| auto lsize = offset_hint << p.shift(); 660| 8.33k| auto size = p.this_size(); 661| 8.33k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 8.33k| return is_full ------------------ | Branch (662:12): [True: 8.33k, False: 0] ------------------ 663| 8.33k| ? (is_leaf ------------------ | Branch (663:19): [True: 4.81k, False: 3.52k] ------------------ 664| 8.33k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 8.33k| : make_full_pos(child, p.shift() - B) 666| 3.52k| .visit(v, idx - lsize, args...)) 667| 8.33k| : (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.33k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9this_sizeEv: 794| 27.2k| 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.58k| { 208| 9.58k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 9.58k| } _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.60k| { 1406| 5.60k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 5.60k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8subindexEm: 1163| 18.7k| 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| 37.8k| { 1171| 37.8k| return size_t{offset} << shift_; 1172| 37.8k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8size_sbhEjm: 1166| 18.7k| { 1167| 18.7k| return size_t{1} << shift_; 1168| 18.7k| } _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| 6.85k| { 1349| 6.85k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 6.85k, False: 0] ------------------ 1350| 6.85k| auto is_leaf = shift_ == BL; 1351| 6.85k| auto child = node_->inner()[offset_hint]; 1352| 6.85k| auto lsize = size_t{offset_hint} << shift_; 1353| 6.85k| return is_leaf ------------------ | Branch (1353:16): [True: 4.77k, False: 2.07k] ------------------ 1354| 6.85k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 6.85k| : make_full_pos(child, shift_ - B) 1356| 2.07k| .visit(v, idx - lsize, args...); 1357| 6.85k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10copy_sizesEjjmPm: 1175| 16.4k| { 1176| 16.4k| auto e = sizes + n; 1177| 41.3k| for (; sizes != e; ++sizes) { ------------------ | Branch (1177:16): [True: 24.8k, False: 16.4k] ------------------ 1178| 24.8k| init = *sizes = init + (size_t{1} << shift_); 1179| | assert(init); ------------------ | Branch (1179:13): [True: 24.8k, False: 0] ------------------ 1180| 24.8k| } 1181| 16.4k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 1160| 722k| 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| 285k| { 811| 285k| if (n) { ------------------ | Branch (811:13): [True: 280k, False: 5.11k] ------------------ 812| 280k| auto last = offset + n - 1; 813| 280k| auto e = sizes + n - 1; 814| 557k| for (; sizes != e; ++sizes) { ------------------ | Branch (814:20): [True: 277k, False: 280k] ------------------ 815| 277k| init = *sizes = init + (size_t{1} << shift_); 816| 277k| assert(init); ------------------ | Branch (816:17): [True: 277k, False: 0] ------------------ 817| 277k| } 818| 280k| *sizes = init + size(last); 819| | assert(*sizes); ------------------ | Branch (819:13): [True: 280k, False: 0] ------------------ 820| 280k| } 821| 285k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEj: 797| 295k| { 798| 295k| return offset == subindex(size_ - 1) ? size_ - size_before(offset) ------------------ | Branch (798:16): [True: 150k, False: 145k] ------------------ 799| 295k| : size_t{1} << shift_; 800| 295k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10copy_sizesEjjmPm: 1462| 4.67M| { 1463| 4.67M| auto e = sizes + n; 1464| 4.67M| auto prev = size_before(offset); 1465| 4.67M| auto these = relaxed_->d.sizes + offset; 1466| 13.3M| for (; sizes != e; ++sizes, ++these) { ------------------ | Branch (1466:16): [True: 8.65M, False: 4.67M] ------------------ 1467| 8.65M| auto this_size = *these; 1468| 8.65M| init = *sizes = init + (this_size - prev); 1469| 8.65M| assert(init); ------------------ | Branch (1469:13): [True: 8.65M, False: 0] ------------------ 1470| 8.65M| prev = this_size; 1471| 8.65M| } 1472| 4.67M| } _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.46k| { 1037| 7.46k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 7.46k| } _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.39k| { 947| 3.39k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 3.39k| } _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.39k|{ 654| 3.39k| constexpr auto B = bits; 655| 3.39k| constexpr auto BL = bits_leaf; 656| 3.39k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 3.39k, False: 0] ------------------ 657| 3.39k| auto is_leaf = p.shift() == BL; 658| 3.39k| auto child = p.node()->inner()[offset_hint]; 659| 3.39k| auto lsize = offset_hint << p.shift(); 660| 3.39k| auto size = p.this_size(); 661| 3.39k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 3.39k| return is_full ------------------ | Branch (662:12): [True: 1.25k, False: 2.14k] ------------------ 663| 3.39k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 1.25k] ------------------ 664| 1.25k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 1.25k| : make_full_pos(child, p.shift() - B) 666| 1.25k| .visit(v, idx - lsize, args...)) 667| 3.39k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 2.14k] ------------------ 668| 2.14k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 2.14k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 2.14k| .visit(v, idx - lsize, args...)); 672| 3.39k|} _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.55k| { 1406| 1.55k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.55k| } _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| 304| { 1349| 304| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 304, False: 0] ------------------ 1350| 304| auto is_leaf = shift_ == BL; 1351| 304| auto child = node_->inner()[offset_hint]; 1352| 304| auto lsize = size_t{offset_hint} << shift_; 1353| 304| return is_leaf ------------------ | Branch (1353:16): [True: 0, False: 304] ------------------ 1354| 304| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 304| : make_full_pos(child, shift_ - B) 1356| 304| .visit(v, idx - lsize, args...); 1357| 304| } _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.14k| { 1037| 2.14k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.14k| } _ZN5immer6detail4rbts30make_singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaPT_j: 766| 8.15k|{ 767| 8.15k| assert(leaf); ------------------ | Branch (767:5): [True: 8.15k, False: 0] ------------------ 768| 8.15k| IMMER_ASSERT_TAGGED(leaf->kind() == NodeT::kind_t::leaf); ------------------ | | 68| 8.15k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (768:5): [True: 8.15k, False: 0] ------------------ 769| 8.15k| assert(count > 0); ------------------ | Branch (769:5): [True: 8.15k, False: 0] ------------------ 770| 8.15k| return singleton_regular_sub_pos{leaf, count}; 771| 8.15k|} _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.15k| { 760| 8.15k| return Visitor::visit_regular(*this, std::forward(args)...); 761| 8.15k| } _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.15k|{ 1839| 8.15k| assert(node); ------------------ | Branch (1839:5): [True: 8.15k, False: 0] ------------------ 1840| 8.15k| auto relaxed = node->relaxed(); 1841| 8.15k| if (relaxed) { ------------------ | Branch (1841:9): [True: 5.69k, False: 2.46k] ------------------ 1842| 5.69k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 5.69k, False: 0] ------------------ 1843| 5.69k| return make_relaxed_pos(node, shift, relaxed) 1844| 5.69k| .visit(v, std::forward(args)...); 1845| 5.69k| } else { 1846| 2.46k| return make_regular_sub_pos(node, shift, size) 1847| 2.46k| .visit(v, std::forward(args)...); 1848| 2.46k| } 1849| 8.15k|} _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.69k| { 1814| 5.69k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 5.69k| } _ZNK5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 735| 28.0k| 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.15k| { 745| 8.15k| } _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.40M| { 145| 2.40M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.40M| } _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| 20.6M| { 1814| 20.6M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 20.6M| } _ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_: 707| 2.30M| { 708| 2.30M| } _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.15k| { 745| 8.15k| } _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.40M| { 145| 2.40M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.40M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 137| 2.40M| 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| 20.6M| { 1814| 20.6M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 20.6M| } _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.30M| { 708| 2.30M| } _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| 18.8k| { 1763| 18.8k| auto child = node_->inner()[0]; 1764| 18.8k| auto child_size = relaxed_->d.sizes[0]; 1765| 18.8k| auto is_leaf = shift_ == BL; 1766| 18.8k| assert(child_size); ------------------ | Branch (1766:9): [True: 18.8k, False: 0] ------------------ 1767| 18.8k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 18.8k] ------------------ 1768| 18.8k| : visit_maybe_relaxed_sub( 1769| 18.8k| child, shift_ - B, child_size, v, args...); 1770| 18.8k| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 76| 8.15k| 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.94M| 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| 18.8k|{ 1839| 18.8k| assert(node); ------------------ | Branch (1839:5): [True: 18.8k, False: 0] ------------------ 1840| 18.8k| auto relaxed = node->relaxed(); 1841| 18.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 18.4k, False: 398] ------------------ 1842| 18.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 18.4k, False: 0] ------------------ 1843| 18.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 18.4k| .visit(v, std::forward(args)...); 1845| 18.4k| } else { 1846| 398| return make_regular_sub_pos(node, shift, size) 1847| 398| .visit(v, std::forward(args)...); 1848| 398| } 1849| 18.8k|} _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| 18.4k| { 1814| 18.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 18.4k| } _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| 398| { 1037| 398| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 398| } _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| 666| { 971| 666| auto is_leaf = shift_ == BL; 972| 666| auto child = node_->inner()[0]; 973| 666| auto is_full = size_ >= (size_t{1} << shift_); 974| 666| return is_full ------------------ | Branch (974:16): [True: 666, False: 0] ------------------ 975| 666| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 666] ------------------ 976| 666| ? make_full_leaf_pos(child).visit(v, args...) 977| 666| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 666| : (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| 666| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 201| 150k| 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.03k| { 1406| 1.03k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.03k| } _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| 372| { 1362| 372| auto is_leaf = shift_ == BL; 1363| 372| auto child = node_->inner()[0]; 1364| 372| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 372] ------------------ 1365| 372| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 372| } _ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_: 711| 125k| { 712| 125k| } _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| 127k| { 1305| 127k| each_i(v, 1, branches, args...); 1306| 127k| } _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| 127k| { 1264| 127k| auto p = node_->inner() + i; 1265| 127k| auto e = node_->inner() + n; 1266| 127k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 60.9k, False: 66.0k] ------------------ 1267| 243k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 182k, False: 60.9k] ------------------ 1268| 182k| IMMER_PREFETCH(p + 1); 1269| 182k| make_full_leaf_pos(*p).visit(v, args...); 1270| 182k| } 1271| 66.0k| } else { 1272| 66.0k| auto ss = shift_ - B; 1273| 264k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 198k, False: 66.0k] ------------------ 1274| 198k| make_full_pos(*p, ss).visit(v, args...); 1275| 66.0k| } 1276| 127k| } _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.07M| { 208| 1.07M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.07M| } _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| 715k| { 1406| 715k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 715k| } _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| 125k| { 712| 125k| } _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| 127k| { 1305| 127k| each_i(v, 1, branches, args...); 1306| 127k| } _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| 127k| { 1264| 127k| auto p = node_->inner() + i; 1265| 127k| auto e = node_->inner() + n; 1266| 127k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 60.9k, False: 66.0k] ------------------ 1267| 243k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 182k, False: 60.9k] ------------------ 1268| 182k| IMMER_PREFETCH(p + 1); 1269| 182k| make_full_leaf_pos(*p).visit(v, args...); 1270| 182k| } 1271| 66.0k| } else { 1272| 66.0k| auto ss = shift_ - B; 1273| 264k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 198k, False: 66.0k] ------------------ 1274| 198k| make_full_pos(*p, ss).visit(v, args...); 1275| 66.0k| } 1276| 127k| } _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.07M| { 208| 1.07M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.07M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 200| 1.07M| 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| 715k| { 1406| 715k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 715k| } _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| 666| { 754| 666| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 666| } _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| 666| { 145| 666| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 666| } _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| 666| { 1371| 666| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 666, False: 0] ------------------ 1372| 666| auto child = node_->inner()[0]; 1373| 666| return make_full_leaf_pos(child).visit(v, args...); 1374| 666| } _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.86k| { 208| 2.86k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 2.86k| } _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| 150k| { 907| 150k| if (count() > 1) ------------------ | Branch (907:13): [True: 139k, False: 10.8k] ------------------ 908| 139k| each_right_sub_(v, 1, args...); 909| 150k| } _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| 139k| { 880| 139k| auto last = count() - 1; 881| 139k| auto lsize = size_ - (last << shift_); 882| 139k| auto n = node()->inner() + i; 883| 139k| auto e = node()->inner() + last; 884| 139k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 78.7k, False: 60.9k] ------------------ 885| 233k| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 154k, False: 78.7k] ------------------ 886| 154k| IMMER_PREFETCH(n + 1); 887| 154k| make_full_leaf_pos(*n).visit(v, args...); 888| 154k| } 889| 78.7k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 78.7k| } else { 891| 60.9k| auto ss = shift_ - B; 892| 159k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 98.1k, False: 60.9k] ------------------ 893| 98.1k| make_full_pos(*n, ss).visit(v, args...); 894| 60.9k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 60.9k| } 896| 139k| } _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| 691k| { 1037| 691k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 691k| } _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| 150k| { 907| 150k| if (count() > 1) ------------------ | Branch (907:13): [True: 139k, False: 10.8k] ------------------ 908| 139k| each_right_sub_(v, 1, args...); 909| 150k| } _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| 139k| { 880| 139k| auto last = count() - 1; 881| 139k| auto lsize = size_ - (last << shift_); 882| 139k| auto n = node()->inner() + i; 883| 139k| auto e = node()->inner() + last; 884| 139k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 78.7k, False: 60.9k] ------------------ 885| 233k| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 154k, False: 78.7k] ------------------ 886| 154k| IMMER_PREFETCH(n + 1); 887| 154k| make_full_leaf_pos(*n).visit(v, args...); 888| 154k| } 889| 78.7k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 78.7k| } else { 891| 60.9k| auto ss = shift_ - B; 892| 159k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 98.1k, False: 60.9k] ------------------ 893| 98.1k| make_full_pos(*n, ss).visit(v, args...); 894| 60.9k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 60.9k| } 896| 139k| } _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| 691k| { 1037| 691k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 691k| } _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| 2.19k| { 754| 2.19k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 2.19k| } _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| 2.19k| { 145| 2.19k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.19k| } _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| 2.19k| { 987| 2.19k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 2.19k, False: 0] ------------------ 988| 2.19k| auto child = node_->inner()[0]; 989| 2.19k| auto is_full = size_ >= branches; 990| 2.19k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 2.19k, False: 0] ------------------ 991| 2.19k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 2.19k| } _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.29k| { 145| 5.29k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.29k| } _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.00M| { 1648| 3.00M| each_right(v, 1, std::forward(args)...); 1649| 3.00M| } _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.00M| { 1654| 3.00M| assert(start > 0); ------------------ | Branch (1654:9): [True: 3.00M, False: 0] ------------------ 1655| 3.00M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 3.00M, False: 0] ------------------ 1656| 3.00M| auto s = relaxed_->d.sizes[start - 1]; 1657| 3.00M| auto p = node_->inner(); 1658| 3.00M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 373k, False: 2.62M] ------------------ 1659| 956k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 582k, False: 373k] ------------------ 1660| 582k| IMMER_PREFETCH(p + i + 1); 1661| 582k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 582k| .visit(v, args...); 1663| 582k| s = relaxed_->d.sizes[i]; 1664| 582k| assert(s); ------------------ | Branch (1664:17): [True: 582k, False: 0] ------------------ 1665| 582k| } 1666| 2.62M| } else { 1667| 2.62M| auto ss = shift_ - B; 1668| 9.20M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 6.57M, False: 2.62M] ------------------ 1669| 6.57M| visit_maybe_relaxed_sub( 1670| 6.57M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 6.57M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 6.57M, False: 0] ------------------ 1673| 6.57M| } 1674| 2.62M| } 1675| 3.00M| } _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| 13.5M|{ 1839| 13.5M| assert(node); ------------------ | Branch (1839:5): [True: 13.5M, False: 0] ------------------ 1840| 13.5M| auto relaxed = node->relaxed(); 1841| 13.5M| if (relaxed) { ------------------ | Branch (1841:9): [True: 12.8M, False: 630k] ------------------ 1842| 12.8M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 12.8M, False: 0] ------------------ 1843| 12.8M| return make_relaxed_pos(node, shift, relaxed) 1844| 12.8M| .visit(v, std::forward(args)...); 1845| 12.8M| } else { 1846| 630k| return make_regular_sub_pos(node, shift, size) 1847| 630k| .visit(v, std::forward(args)...); 1848| 630k| } 1849| 13.5M|} _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.00M| { 1648| 3.00M| each_right(v, 1, std::forward(args)...); 1649| 3.00M| } _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.00M| { 1654| 3.00M| assert(start > 0); ------------------ | Branch (1654:9): [True: 3.00M, False: 0] ------------------ 1655| 3.00M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 3.00M, False: 0] ------------------ 1656| 3.00M| auto s = relaxed_->d.sizes[start - 1]; 1657| 3.00M| auto p = node_->inner(); 1658| 3.00M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 373k, False: 2.62M] ------------------ 1659| 956k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 582k, False: 373k] ------------------ 1660| 582k| IMMER_PREFETCH(p + i + 1); 1661| 582k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 582k| .visit(v, args...); 1663| 582k| s = relaxed_->d.sizes[i]; 1664| 582k| assert(s); ------------------ | Branch (1664:17): [True: 582k, False: 0] ------------------ 1665| 582k| } 1666| 2.62M| } else { 1667| 2.62M| auto ss = shift_ - B; 1668| 9.20M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 6.57M, False: 2.62M] ------------------ 1669| 6.57M| visit_maybe_relaxed_sub( 1670| 6.57M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 6.57M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 6.57M, False: 0] ------------------ 1673| 6.57M| } 1674| 2.62M| } 1675| 3.00M| } _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| 13.5M|{ 1839| 13.5M| assert(node); ------------------ | Branch (1839:5): [True: 13.5M, False: 0] ------------------ 1840| 13.5M| auto relaxed = node->relaxed(); 1841| 13.5M| if (relaxed) { ------------------ | Branch (1841:9): [True: 12.8M, False: 630k] ------------------ 1842| 12.8M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 12.8M, False: 0] ------------------ 1843| 12.8M| return make_relaxed_pos(node, shift, relaxed) 1844| 12.8M| .visit(v, std::forward(args)...); 1845| 12.8M| } else { 1846| 630k| return make_regular_sub_pos(node, shift, size) 1847| 630k| .visit(v, std::forward(args)...); 1848| 630k| } 1849| 13.5M|} _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.29k| { 754| 5.29k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 5.29k| } _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.29k| { 145| 5.29k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.29k| } _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.29k| { 1775| 5.29k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 5.29k, False: 0] ------------------ 1776| 5.29k| auto child = node_->inner()[0]; 1777| 5.29k| auto child_size = relaxed_->d.sizes[0]; 1778| 5.29k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 5.29k| } _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.46k| { 1037| 2.46k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.46k| } _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| 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: 501k, False: 14.4k] ------------------ 1842| 501k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 501k, False: 0] ------------------ 1843| 501k| return make_relaxed_pos(node, shift, relaxed) 1844| 501k| .visit(v, std::forward(args)...); 1845| 501k| } else { 1846| 14.4k| return make_regular_sub_pos(node, shift, size) 1847| 14.4k| .visit(v, std::forward(args)...); 1848| 14.4k| } 1849| 516k|} _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| 501k| { 1814| 501k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 501k| } _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| 501k|{ 1839| 501k| assert(node); ------------------ | Branch (1839:5): [True: 501k, False: 0] ------------------ 1840| 501k| auto relaxed = node->relaxed(); 1841| 501k| if (relaxed) { ------------------ | Branch (1841:9): [True: 485k, False: 16.3k] ------------------ 1842| 485k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 485k, False: 0] ------------------ 1843| 485k| return make_relaxed_pos(node, shift, relaxed) 1844| 485k| .visit(v, std::forward(args)...); 1845| 485k| } else { 1846| 16.3k| return make_regular_sub_pos(node, shift, size) 1847| 16.3k| .visit(v, std::forward(args)...); 1848| 16.3k| } 1849| 501k|} _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| 485k| { 1814| 485k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 485k| } _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.22M| { 1751| 2.22M| auto offset = relaxed_->d.count - 1; 1752| 2.22M| auto child = node_->inner()[offset]; 1753| 2.22M| auto child_size = size(offset); 1754| 2.22M| auto is_leaf = shift_ == BL; 1755| 2.22M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 2.22M] ------------------ 1756| 2.22M| : visit_maybe_relaxed_sub( 1757| 2.22M| child, shift_ - B, child_size, v, args...); 1758| 2.22M| } _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.22M|{ 1839| 2.22M| assert(node); ------------------ | Branch (1839:5): [True: 2.22M, False: 0] ------------------ 1840| 2.22M| auto relaxed = node->relaxed(); 1841| 2.22M| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.22M, False: 1.84k] ------------------ 1842| 2.22M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.22M, False: 0] ------------------ 1843| 2.22M| return make_relaxed_pos(node, shift, relaxed) 1844| 2.22M| .visit(v, std::forward(args)...); 1845| 2.22M| } else { 1846| 1.84k| return make_regular_sub_pos(node, shift, size) 1847| 1.84k| .visit(v, std::forward(args)...); 1848| 1.84k| } 1849| 2.22M|} _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.22M| { 1814| 2.22M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.22M| } _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| 4.65k| { 1037| 4.65k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.65k| } _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| 2.81k| { 959| 2.81k| auto offset = count() - 1; 960| 2.81k| auto child = node_->inner()[offset]; 961| 2.81k| auto is_leaf = shift_ == BL; 962| 2.81k| auto lsize = size_ - (size_t{offset} << shift_); 963| 2.81k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 2.81k] ------------------ 964| 2.81k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 2.81k| .visit(v, args...); 966| 2.81k| } _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| 913k| { 914| 913k| each_left(v, count() - 1, args...); 915| 913k| } _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| 913k| { 874| 913k| return each_left_regular(*this, v, last, args...); 875| 913k| } _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| 913k|{ 576| 913k| constexpr auto B = bits; 577| 913k| constexpr auto BL = bits_leaf; 578| 913k| assert(last < p.count()); ------------------ | Branch (578:5): [True: 913k, False: 0] ------------------ 579| 913k| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 428k, False: 485k] ------------------ 580| 428k| auto n = p.node()->inner(); 581| 428k| auto e = n + last; 582| 1.16M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 740k, False: 428k] ------------------ 583| 740k| IMMER_PREFETCH(n + 1); 584| 740k| make_full_leaf_pos(*n).visit(v, args...); 585| 740k| } 586| 485k| } else { 587| 485k| auto n = p.node()->inner(); 588| 485k| auto e = n + last; 589| 485k| auto ss = p.shift() - B; 590| 904k| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 419k, False: 485k] ------------------ 591| 419k| make_full_pos(*n, ss).visit(v, args...); 592| 485k| } 593| 913k|} _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| 913k| { 914| 913k| each_left(v, count() - 1, args...); 915| 913k| } _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| 913k| { 874| 913k| return each_left_regular(*this, v, last, args...); 875| 913k| } _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| 913k|{ 576| 913k| constexpr auto B = bits; 577| 913k| constexpr auto BL = bits_leaf; 578| 913k| assert(last < p.count()); ------------------ | Branch (578:5): [True: 913k, False: 0] ------------------ 579| 913k| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 428k, False: 485k] ------------------ 580| 428k| auto n = p.node()->inner(); 581| 428k| auto e = n + last; 582| 1.16M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 740k, False: 428k] ------------------ 583| 740k| IMMER_PREFETCH(n + 1); 584| 740k| make_full_leaf_pos(*n).visit(v, args...); 585| 740k| } 586| 485k| } else { 587| 485k| auto n = p.node()->inner(); 588| 485k| auto e = n + last; 589| 485k| auto ss = p.shift() - B; 590| 904k| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 419k, False: 485k] ------------------ 591| 419k| make_full_pos(*n, ss).visit(v, args...); 592| 485k| } 593| 913k|} _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| 782k| { 1763| 782k| auto child = node_->inner()[0]; 1764| 782k| auto child_size = relaxed_->d.sizes[0]; 1765| 782k| auto is_leaf = shift_ == BL; 1766| 782k| assert(child_size); ------------------ | Branch (1766:9): [True: 782k, False: 0] ------------------ 1767| 782k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 782k] ------------------ 1768| 782k| : visit_maybe_relaxed_sub( 1769| 782k| child, shift_ - B, child_size, v, args...); 1770| 782k| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 106| 516k| 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| 782k|{ 1839| 782k| assert(node); ------------------ | Branch (1839:5): [True: 782k, False: 0] ------------------ 1840| 782k| auto relaxed = node->relaxed(); 1841| 782k| if (relaxed) { ------------------ | Branch (1841:9): [True: 659k, False: 122k] ------------------ 1842| 659k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 659k, False: 0] ------------------ 1843| 659k| return make_relaxed_pos(node, shift, relaxed) 1844| 659k| .visit(v, std::forward(args)...); 1845| 659k| } else { 1846| 122k| return make_regular_sub_pos(node, shift, size) 1847| 122k| .visit(v, std::forward(args)...); 1848| 122k| } 1849| 782k|} _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| 659k| { 1814| 659k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 659k| } _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| 122k| { 1037| 122k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 122k| } _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| 757| { 959| 757| auto offset = count() - 1; 960| 757| auto child = node_->inner()[offset]; 961| 757| auto is_leaf = shift_ == BL; 962| 757| auto lsize = size_ - (size_t{offset} << shift_); 963| 757| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 757] ------------------ 964| 757| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 757| .visit(v, args...); 966| 757| } _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.13k| { 1037| 1.13k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.13k| } _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| 58.8k| { 971| 58.8k| auto is_leaf = shift_ == BL; 972| 58.8k| auto child = node_->inner()[0]; 973| 58.8k| auto is_full = size_ >= (size_t{1} << shift_); 974| 58.8k| return is_full ------------------ | Branch (974:16): [True: 58.8k, False: 0] ------------------ 975| 58.8k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 58.8k] ------------------ 976| 58.8k| ? make_full_leaf_pos(child).visit(v, args...) 977| 58.8k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 58.8k| : (is_leaf ------------------ | Branch (978:23): [True: 0, False: 0] ------------------ 979| 0| ? make_leaf_sub_pos(child, size_).visit(v, args...) 980| 0| : make_regular_sub_pos(child, shift_ - B, size_) 981| 0| .visit(v, args...)); 982| 58.8k| } _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| 123k| { 1406| 123k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 123k| } _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| 64.2k| { 1362| 64.2k| auto is_leaf = shift_ == BL; 1363| 64.2k| auto child = node_->inner()[0]; 1364| 64.2k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 64.2k] ------------------ 1365| 64.2k| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 64.2k| } _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| 122k| { 959| 122k| auto offset = count() - 1; 960| 122k| auto child = node_->inner()[offset]; 961| 122k| auto is_leaf = shift_ == BL; 962| 122k| auto lsize = size_ - (size_t{offset} << shift_); 963| 122k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 59.0k, False: 63.7k] ------------------ 964| 122k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 63.7k| .visit(v, args...); 966| 122k| } _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| 60.2k| { 145| 60.2k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 60.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| 60.2k| { 1371| 60.2k| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 60.2k, False: 0] ------------------ 1372| 60.2k| auto child = node_->inner()[0]; 1373| 60.2k| return make_full_leaf_pos(child).visit(v, args...); 1374| 60.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| 147k| { 208| 147k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 147k| } _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| 63.9k| { 1037| 63.9k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 63.9k| } _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| 130k| { 959| 130k| auto offset = count() - 1; 960| 130k| auto child = node_->inner()[offset]; 961| 130k| auto is_leaf = shift_ == BL; 962| 130k| auto lsize = size_ - (size_t{offset} << shift_); 963| 130k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 81.9k, False: 48.4k] ------------------ 964| 130k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 48.4k| .visit(v, args...); 966| 130k| } _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| 87.3k| { 145| 87.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 87.3k| } _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| 87.3k| { 987| 87.3k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 87.3k, False: 0] ------------------ 988| 87.3k| auto child = node_->inner()[0]; 989| 87.3k| auto is_full = size_ >= branches; 990| 87.3k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 87.3k, False: 0] ------------------ 991| 87.3k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 87.3k| } _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| 368k| { 145| 368k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 368k| } _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| 58.2k| { 1037| 58.2k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 58.2k| } _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| 656k| { 959| 656k| auto offset = count() - 1; 960| 656k| auto child = node_->inner()[offset]; 961| 656k| auto is_leaf = shift_ == BL; 962| 656k| auto lsize = size_ - (size_t{offset} << shift_); 963| 656k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 287k, False: 369k] ------------------ 964| 656k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 369k| .visit(v, args...); 966| 656k| } _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| 368k| { 145| 368k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 368k| } _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| 368k| { 1775| 368k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 368k, False: 0] ------------------ 1776| 368k| auto child = node_->inner()[0]; 1777| 368k| auto child_size = relaxed_->d.sizes[0]; 1778| 368k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 368k| } _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| 771k| { 1037| 771k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 771k| } _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.53M| { 1618| 4.53M| each_left(v, relaxed_->d.count - 1, args...); 1619| 4.53M| } _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.53M| { 1624| 4.53M| auto p = node_->inner(); 1625| 4.53M| auto s = size_t{}; 1626| 4.53M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 88.2k, False: 4.44M] ------------------ 1627| 265k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 177k, False: 88.2k] ------------------ 1628| 177k| IMMER_PREFETCH(p + i + 1); 1629| 177k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 177k| .visit(v, args...); 1631| 177k| s = relaxed_->d.sizes[i]; 1632| 177k| assert(s); ------------------ | Branch (1632:17): [True: 177k, False: 0] ------------------ 1633| 177k| } 1634| 4.44M| } else { 1635| 4.44M| auto ss = shift_ - B; 1636| 11.3M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 6.92M, False: 4.44M] ------------------ 1637| 6.92M| visit_maybe_relaxed_sub( 1638| 6.92M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 6.92M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 6.92M, False: 0] ------------------ 1641| 6.92M| } 1642| 4.44M| } 1643| 4.53M| } _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.53M| { 1618| 4.53M| each_left(v, relaxed_->d.count - 1, args...); 1619| 4.53M| } _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.53M| { 1624| 4.53M| auto p = node_->inner(); 1625| 4.53M| auto s = size_t{}; 1626| 4.53M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 88.2k, False: 4.44M] ------------------ 1627| 265k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 177k, False: 88.2k] ------------------ 1628| 177k| IMMER_PREFETCH(p + i + 1); 1629| 177k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 177k| .visit(v, args...); 1631| 177k| s = relaxed_->d.sizes[i]; 1632| 177k| assert(s); ------------------ | Branch (1632:17): [True: 177k, False: 0] ------------------ 1633| 177k| } 1634| 4.44M| } else { 1635| 4.44M| auto ss = shift_ - B; 1636| 11.3M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 6.92M, False: 4.44M] ------------------ 1637| 6.92M| visit_maybe_relaxed_sub( 1638| 6.92M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 6.92M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 6.92M, False: 0] ------------------ 1641| 6.92M| } 1642| 4.44M| } 1643| 4.53M| } _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.82M| { 1763| 1.82M| auto child = node_->inner()[0]; 1764| 1.82M| auto child_size = relaxed_->d.sizes[0]; 1765| 1.82M| auto is_leaf = shift_ == BL; 1766| 1.82M| assert(child_size); ------------------ | Branch (1766:9): [True: 1.82M, False: 0] ------------------ 1767| 1.82M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 1.82M] ------------------ 1768| 1.82M| : visit_maybe_relaxed_sub( 1769| 1.82M| child, shift_ - B, child_size, v, args...); 1770| 1.82M| } _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.82M|{ 1839| 1.82M| assert(node); ------------------ | Branch (1839:5): [True: 1.82M, False: 0] ------------------ 1840| 1.82M| auto relaxed = node->relaxed(); 1841| 1.82M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.82M, False: 759] ------------------ 1842| 1.82M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.82M, False: 0] ------------------ 1843| 1.82M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.82M| .visit(v, std::forward(args)...); 1845| 1.82M| } else { 1846| 759| return make_regular_sub_pos(node, shift, size) 1847| 759| .visit(v, std::forward(args)...); 1848| 759| } 1849| 1.82M|} _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.82M| { 1814| 1.82M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.82M| } _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| 759| { 1037| 759| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 759| } _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| 70.4k| { 1751| 70.4k| auto offset = relaxed_->d.count - 1; 1752| 70.4k| auto child = node_->inner()[offset]; 1753| 70.4k| auto child_size = size(offset); 1754| 70.4k| auto is_leaf = shift_ == BL; 1755| 70.4k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 70.4k] ------------------ 1756| 70.4k| : visit_maybe_relaxed_sub( 1757| 70.4k| child, shift_ - B, child_size, v, args...); 1758| 70.4k| } _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| 70.4k|{ 1839| 70.4k| assert(node); ------------------ | Branch (1839:5): [True: 70.4k, False: 0] ------------------ 1840| 70.4k| auto relaxed = node->relaxed(); 1841| 70.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 70.1k, False: 377] ------------------ 1842| 70.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 70.1k, False: 0] ------------------ 1843| 70.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 70.1k| .visit(v, std::forward(args)...); 1845| 70.1k| } else { 1846| 377| return make_regular_sub_pos(node, shift, size) 1847| 377| .visit(v, std::forward(args)...); 1848| 377| } 1849| 70.4k|} _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| 70.1k| { 1814| 70.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 70.1k| } _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| 1.43k| { 971| 1.43k| auto is_leaf = shift_ == BL; 972| 1.43k| auto child = node_->inner()[0]; 973| 1.43k| auto is_full = size_ >= (size_t{1} << shift_); 974| 1.43k| return is_full ------------------ | Branch (974:16): [True: 1.43k, False: 0] ------------------ 975| 1.43k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 1.43k] ------------------ 976| 1.43k| ? make_full_leaf_pos(child).visit(v, args...) 977| 1.43k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 1.43k| : (is_leaf ------------------ | Branch (978:23): [True: 0, False: 0] ------------------ 979| 0| ? make_leaf_sub_pos(child, size_).visit(v, args...) 980| 0| : make_regular_sub_pos(child, shift_ - B, size_) 981| 0| .visit(v, args...)); 982| 1.43k| } _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| 2.87k| { 1406| 2.87k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.87k| } _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| 1.44k| { 1362| 1.44k| auto is_leaf = shift_ == BL; 1363| 1.44k| auto child = node_->inner()[0]; 1364| 1.44k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 1.44k] ------------------ 1365| 1.44k| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 1.44k| } _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| 2.57k| { 1751| 2.57k| auto offset = relaxed_->d.count - 1; 1752| 2.57k| auto child = node_->inner()[offset]; 1753| 2.57k| auto child_size = size(offset); 1754| 2.57k| auto is_leaf = shift_ == BL; 1755| 2.57k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 1.22k, False: 1.35k] ------------------ 1756| 2.57k| : visit_maybe_relaxed_sub( 1757| 1.35k| child, shift_ - B, child_size, v, args...); 1758| 2.57k| } _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| 1.35k|{ 1839| 1.35k| assert(node); ------------------ | Branch (1839:5): [True: 1.35k, False: 0] ------------------ 1840| 1.35k| auto relaxed = node->relaxed(); 1841| 1.35k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.14k, False: 209] ------------------ 1842| 1.14k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.14k, False: 0] ------------------ 1843| 1.14k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.14k| .visit(v, std::forward(args)...); 1845| 1.14k| } else { 1846| 209| return make_regular_sub_pos(node, shift, size) 1847| 209| .visit(v, std::forward(args)...); 1848| 209| } 1849| 1.35k|} _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| 1.14k| { 1814| 1.14k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.14k| } _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| 15.8k| { 1751| 15.8k| auto offset = relaxed_->d.count - 1; 1752| 15.8k| auto child = node_->inner()[offset]; 1753| 15.8k| auto child_size = size(offset); 1754| 15.8k| auto is_leaf = shift_ == BL; 1755| 15.8k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 5.43k, False: 10.4k] ------------------ 1756| 15.8k| : visit_maybe_relaxed_sub( 1757| 10.4k| child, shift_ - B, child_size, v, args...); 1758| 15.8k| } _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| 10.4k|{ 1839| 10.4k| assert(node); ------------------ | Branch (1839:5): [True: 10.4k, False: 0] ------------------ 1840| 10.4k| auto relaxed = node->relaxed(); 1841| 10.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 586, False: 9.83k] ------------------ 1842| 586| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 586, False: 0] ------------------ 1843| 586| return make_relaxed_pos(node, shift, relaxed) 1844| 586| .visit(v, std::forward(args)...); 1845| 9.83k| } else { 1846| 9.83k| return make_regular_sub_pos(node, shift, size) 1847| 9.83k| .visit(v, std::forward(args)...); 1848| 9.83k| } 1849| 10.4k|} _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| 586| { 1814| 586| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 586| } _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.21M| { 1751| 2.21M| auto offset = relaxed_->d.count - 1; 1752| 2.21M| auto child = node_->inner()[offset]; 1753| 2.21M| auto child_size = size(offset); 1754| 2.21M| auto is_leaf = shift_ == BL; 1755| 2.21M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 81.5k, False: 2.13M] ------------------ 1756| 2.21M| : visit_maybe_relaxed_sub( 1757| 2.13M| child, shift_ - B, child_size, v, args...); 1758| 2.21M| } _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.13M|{ 1839| 2.13M| assert(node); ------------------ | Branch (1839:5): [True: 2.13M, False: 0] ------------------ 1840| 2.13M| auto relaxed = node->relaxed(); 1841| 2.13M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.73M, False: 401k] ------------------ 1842| 1.73M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.73M, False: 0] ------------------ 1843| 1.73M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.73M| .visit(v, std::forward(args)...); 1845| 1.73M| } else { 1846| 401k| return make_regular_sub_pos(node, shift, size) 1847| 401k| .visit(v, std::forward(args)...); 1848| 401k| } 1849| 2.13M|} _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.73M| { 1814| 1.73M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.73M| } _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| 16.3k| { 1037| 16.3k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 16.3k| } _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.4k| { 1037| 14.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 14.4k| } _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.4k|{ 1839| 14.4k| assert(node); ------------------ | Branch (1839:5): [True: 14.4k, False: 0] ------------------ 1840| 14.4k| auto relaxed = node->relaxed(); 1841| 14.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 6.92k, False: 7.55k] ------------------ 1842| 6.92k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 6.92k, False: 0] ------------------ 1843| 6.92k| return make_relaxed_pos(node, shift, relaxed) 1844| 6.92k| .visit(v, std::forward(args)...); 1845| 7.55k| } else { 1846| 7.55k| return make_regular_sub_pos(node, shift, size) 1847| 7.55k| .visit(v, std::forward(args)...); 1848| 7.55k| } 1849| 14.4k|} _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.92k| { 1814| 6.92k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 6.92k| } _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.55k| { 1037| 7.55k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 7.55k| } _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| 68.3k| { 1814| 68.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 68.3k| } _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| 62.8k| { 1738| 62.8k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 62.8k, False: 0] ------------------ 1739| 62.8k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 62.8k, False: 0] ------------------ 1740| 62.8k| auto child = node_->inner()[offset_hint]; 1741| 62.8k| auto is_leaf = shift_ == BL; 1742| 62.8k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 62.8k] ------------------ 1743| 62.8k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 62.8k| : visit_maybe_relaxed_sub( 1745| 62.8k| child, shift_ - B, child_size_hint, v, args...); 1746| 62.8k| } _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| 62.8k|{ 1839| 62.8k| assert(node); ------------------ | Branch (1839:5): [True: 62.8k, False: 0] ------------------ 1840| 62.8k| auto relaxed = node->relaxed(); 1841| 62.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 9.52k, False: 53.2k] ------------------ 1842| 9.52k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 9.52k, False: 0] ------------------ 1843| 9.52k| return make_relaxed_pos(node, shift, relaxed) 1844| 9.52k| .visit(v, std::forward(args)...); 1845| 53.2k| } else { 1846| 53.2k| return make_regular_sub_pos(node, shift, size) 1847| 53.2k| .visit(v, std::forward(args)...); 1848| 53.2k| } 1849| 62.8k|} _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| 53.2k| { 1037| 53.2k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 53.2k| } _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| 202k| { 953| 202k| return last_oh_regular(*this, v, offset_hint, args...); 954| 202k| } _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| 202k|{ 678| 202k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 202k, False: 0] ------------------ 679| 202k| constexpr auto B = bits; 680| 202k| constexpr auto BL = bits_leaf; 681| 202k| auto child = p.node()->inner()[offset_hint]; 682| 202k| auto is_leaf = p.shift() == BL; 683| 202k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 202k] ------------------ 684| 202k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 202k| .visit(v, args...); 686| 202k|} _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| 954k| { 337| 954k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 954k| } _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| 751k| { 331| 751k| return last_oh_regular(*this, v, offset_hint, args...); 332| 751k| } _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| 751k|{ 678| 751k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 751k, False: 0] ------------------ 679| 751k| constexpr auto B = bits; 680| 751k| constexpr auto BL = bits_leaf; 681| 751k| auto child = p.node()->inner()[offset_hint]; 682| 751k| auto is_leaf = p.shift() == BL; 683| 751k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 751k] ------------------ 684| 751k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 751k| .visit(v, args...); 686| 751k|} _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.78k| { 331| 1.78k| return last_oh_regular(*this, v, offset_hint, args...); 332| 1.78k| } _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.78k|{ 678| 1.78k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.78k, False: 0] ------------------ 679| 1.78k| constexpr auto B = bits; 680| 1.78k| constexpr auto BL = bits_leaf; 681| 1.78k| auto child = p.node()->inner()[offset_hint]; 682| 1.78k| auto is_leaf = p.shift() == BL; 683| 1.78k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.78k] ------------------ 684| 1.78k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.78k| .visit(v, args...); 686| 1.78k|} _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.28k| { 337| 3.28k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.28k| } _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.50k| { 953| 1.50k| return last_oh_regular(*this, v, offset_hint, args...); 954| 1.50k| } _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.50k|{ 678| 1.50k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.50k, False: 0] ------------------ 679| 1.50k| constexpr auto B = bits; 680| 1.50k| constexpr auto BL = bits_leaf; 681| 1.50k| auto child = p.node()->inner()[offset_hint]; 682| 1.50k| auto is_leaf = p.shift() == BL; 683| 1.50k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.50k] ------------------ 684| 1.50k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.50k| .visit(v, args...); 686| 1.50k|} _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| 9.11k| { 1738| 9.11k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 9.11k, False: 0] ------------------ 1739| 9.11k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 9.11k, False: 0] ------------------ 1740| 9.11k| auto child = node_->inner()[offset_hint]; 1741| 9.11k| auto is_leaf = shift_ == BL; 1742| 9.11k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 9.11k] ------------------ 1743| 9.11k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 9.11k| : visit_maybe_relaxed_sub( 1745| 9.11k| child, shift_ - B, child_size_hint, v, args...); 1746| 9.11k| } _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| 9.11k|{ 1839| 9.11k| assert(node); ------------------ | Branch (1839:5): [True: 9.11k, False: 0] ------------------ 1840| 9.11k| auto relaxed = node->relaxed(); 1841| 9.11k| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.99k, False: 1.12k] ------------------ 1842| 7.99k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.99k, False: 0] ------------------ 1843| 7.99k| return make_relaxed_pos(node, shift, relaxed) 1844| 7.99k| .visit(v, std::forward(args)...); 1845| 7.99k| } else { 1846| 1.12k| return make_regular_sub_pos(node, shift, size) 1847| 1.12k| .visit(v, std::forward(args)...); 1848| 1.12k| } 1849| 9.11k|} _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| 7.99k| { 1814| 7.99k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.99k| } _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.12k| { 1037| 1.12k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.12k| } _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| 155k| { 1037| 155k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 155k| } _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| 22.8k|{ 1839| 22.8k| assert(node); ------------------ | Branch (1839:5): [True: 22.8k, False: 0] ------------------ 1840| 22.8k| auto relaxed = node->relaxed(); 1841| 22.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 19.3k, False: 3.47k] ------------------ 1842| 19.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 19.3k, False: 0] ------------------ 1843| 19.3k| return make_relaxed_pos(node, shift, relaxed) 1844| 19.3k| .visit(v, std::forward(args)...); 1845| 19.3k| } else { 1846| 3.47k| return make_regular_sub_pos(node, shift, size) 1847| 3.47k| .visit(v, std::forward(args)...); 1848| 3.47k| } 1849| 22.8k|} _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| 19.3k| { 1814| 19.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 19.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| 53.0k| { 1687| 53.0k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 53.0k, False: 0] ------------------ 1688| 53.0k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 18.0k, False: 34.9k] ------------------ 1689| 53.0k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 53.0k| } _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| 53.0k| { 1699| 53.0k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 53.0k| } _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| 53.0k| { 1718| 53.0k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 53.0k, False: 0] ------------------ 1719| 53.0k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 18.0k, False: 34.9k] | Branch (1719:9): [True: 53.0k, False: 0] ------------------ 1720| 53.0k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 53.0k| auto child = node_->inner()[offset_hint]; 1722| 53.0k| auto is_leaf = shift_ == BL; 1723| 53.0k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 53.0k| auto next_idx = idx - left_size_hint; 1725| 53.0k| return is_leaf ------------------ | Branch (1725:16): [True: 16.2k, False: 36.8k] ------------------ 1726| 53.0k| ? make_leaf_sub_pos(child, next_size) 1727| 16.2k| .visit(v, next_idx, args...) 1728| 53.0k| : visit_maybe_relaxed_sub( 1729| 36.8k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 53.0k| } _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| 16.2k| { 145| 16.2k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 16.2k| } _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| 36.8k|{ 1839| 36.8k| assert(node); ------------------ | Branch (1839:5): [True: 36.8k, False: 0] ------------------ 1840| 36.8k| auto relaxed = node->relaxed(); 1841| 36.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 33.7k, False: 3.15k] ------------------ 1842| 33.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 33.7k, False: 0] ------------------ 1843| 33.7k| return make_relaxed_pos(node, shift, relaxed) 1844| 33.7k| .visit(v, std::forward(args)...); 1845| 33.7k| } else { 1846| 3.15k| return make_regular_sub_pos(node, shift, size) 1847| 3.15k| .visit(v, std::forward(args)...); 1848| 3.15k| } 1849| 36.8k|} _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| 33.7k| { 1814| 33.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 33.7k| } _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| 3.15k| { 1037| 3.15k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.15k| } _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| 6.62k| { 939| 6.62k| return towards_oh_ch_regular( 940| 6.62k| *this, v, idx, offset_hint, count(), args...); 941| 6.62k| } _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| 6.62k|{ 633| 6.62k| constexpr auto B = bits; 634| 6.62k| constexpr auto BL = bits_leaf; 635| 6.62k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.62k, False: 0] ------------------ 636| 6.62k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.62k, False: 0] ------------------ 637| 6.62k| auto is_leaf = p.shift() == BL; 638| 6.62k| auto child = p.node()->inner()[offset_hint]; 639| 6.62k| auto is_full = offset_hint + 1 != count_hint; 640| 6.62k| return is_full ------------------ | Branch (640:12): [True: 4.34k, False: 2.27k] ------------------ 641| 6.62k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 820, False: 3.52k] ------------------ 642| 4.34k| : make_full_pos(child, p.shift() - B) 643| 3.52k| .visit(v, idx, args...)) 644| 6.62k| : (is_leaf ------------------ | Branch (644:19): [True: 430, False: 1.84k] ------------------ 645| 2.27k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.27k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.84k| .visit(v, idx, args...)); 648| 6.62k|} _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| 5.53k| { 208| 5.53k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.53k| } _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| 4.85k| { 1406| 4.85k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 4.85k| } _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| 4.85k| { 1330| 4.85k| return towards_oh(v, idx, offset_hint, args...); 1331| 4.85k| } _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| 4.85k| { 1337| 4.85k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 4.85k, False: 0] ------------------ 1338| 4.85k| auto is_leaf = shift_ == BL; 1339| 4.85k| auto child = node_->inner()[offset_hint]; 1340| 4.85k| return is_leaf ------------------ | Branch (1340:16): [True: 3.86k, False: 992] ------------------ 1341| 4.85k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 4.85k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 4.85k| } _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.09k| { 113| 1.09k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.09k| } _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| 2.41k| { 337| 2.41k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.41k| } _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| 2.41k| { 317| 2.41k| return towards_oh_ch_regular( 318| 2.41k| *this, v, idx, offset_hint, count(), args...); 319| 2.41k| } _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| 2.41k|{ 633| 2.41k| constexpr auto B = bits; 634| 2.41k| constexpr auto BL = bits_leaf; 635| 2.41k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.41k, False: 0] ------------------ 636| 2.41k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.41k, False: 0] ------------------ 637| 2.41k| auto is_leaf = p.shift() == BL; 638| 2.41k| auto child = p.node()->inner()[offset_hint]; 639| 2.41k| auto is_full = offset_hint + 1 != count_hint; 640| 2.41k| return is_full ------------------ | Branch (640:12): [True: 1.18k, False: 1.22k] ------------------ 641| 2.41k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 851, False: 336] ------------------ 642| 1.18k| : make_full_pos(child, p.shift() - B) 643| 336| .visit(v, idx, args...)) 644| 2.41k| : (is_leaf ------------------ | Branch (644:19): [True: 662, False: 562] ------------------ 645| 1.22k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.22k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 562| .visit(v, idx, args...)); 648| 2.41k|} _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| 3.47k| { 1037| 3.47k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.47k| } _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| 66.5k|{ 1839| 66.5k| assert(node); ------------------ | Branch (1839:5): [True: 66.5k, False: 0] ------------------ 1840| 66.5k| auto relaxed = node->relaxed(); 1841| 66.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 54.0k, False: 12.4k] ------------------ 1842| 54.0k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 54.0k, False: 0] ------------------ 1843| 54.0k| return make_relaxed_pos(node, shift, relaxed) 1844| 54.0k| .visit(v, std::forward(args)...); 1845| 54.0k| } else { 1846| 12.4k| return make_regular_sub_pos(node, shift, size) 1847| 12.4k| .visit(v, std::forward(args)...); 1848| 12.4k| } 1849| 66.5k|} _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| 54.0k| { 1814| 54.0k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 54.0k| } _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.4k| { 1687| 32.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 32.4k, False: 0] ------------------ 1688| 32.4k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 32.4k] ------------------ 1689| 32.4k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 32.4k| } _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.4k| { 1699| 32.4k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 32.4k| } _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.4k| { 1718| 32.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 32.4k, False: 0] ------------------ 1719| 32.4k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 32.4k] | Branch (1719:9): [True: 32.4k, False: 0] ------------------ 1720| 32.4k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 32.4k| auto child = node_->inner()[offset_hint]; 1722| 32.4k| auto is_leaf = shift_ == BL; 1723| 32.4k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 32.4k| auto next_idx = idx - left_size_hint; 1725| 32.4k| return is_leaf ------------------ | Branch (1725:16): [True: 997, False: 31.4k] ------------------ 1726| 32.4k| ? make_leaf_sub_pos(child, next_size) 1727| 997| .visit(v, next_idx, args...) 1728| 32.4k| : visit_maybe_relaxed_sub( 1729| 31.4k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 32.4k| } _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| 997| { 145| 997| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 997| } _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| 15.4k| { 1687| 15.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 15.4k, False: 0] ------------------ 1688| 15.4k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 15.4k] ------------------ 1689| 15.4k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 15.4k| } _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| 15.4k| { 1699| 15.4k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 15.4k| } _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| 15.4k| { 1718| 15.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 15.4k, False: 0] ------------------ 1719| 15.4k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 15.4k] | Branch (1719:9): [True: 15.4k, False: 0] ------------------ 1720| 15.4k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 15.4k| auto child = node_->inner()[offset_hint]; 1722| 15.4k| auto is_leaf = shift_ == BL; 1723| 15.4k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 15.4k| auto next_idx = idx - left_size_hint; 1725| 15.4k| return is_leaf ------------------ | Branch (1725:16): [True: 580, False: 14.8k] ------------------ 1726| 15.4k| ? make_leaf_sub_pos(child, next_size) 1727| 580| .visit(v, next_idx, args...) 1728| 15.4k| : visit_maybe_relaxed_sub( 1729| 14.8k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 15.4k| } _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| 580| { 145| 580| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 580| } _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| 14.8k|{ 1839| 14.8k| assert(node); ------------------ | Branch (1839:5): [True: 14.8k, False: 0] ------------------ 1840| 14.8k| auto relaxed = node->relaxed(); 1841| 14.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 13.2k, False: 1.58k] ------------------ 1842| 13.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 13.2k, False: 0] ------------------ 1843| 13.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 13.2k| .visit(v, std::forward(args)...); 1845| 13.2k| } else { 1846| 1.58k| return make_regular_sub_pos(node, shift, size) 1847| 1.58k| .visit(v, std::forward(args)...); 1848| 1.58k| } 1849| 14.8k|} _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| 13.2k| { 1814| 13.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 13.2k| } _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.58k| { 1037| 1.58k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.58k| } _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.41k| { 928| 2.41k| return towards_oh_ch_regular( 929| 2.41k| *this, v, idx, offset_hint, count(), args...); 930| 2.41k| } _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.41k|{ 633| 2.41k| constexpr auto B = bits; 634| 2.41k| constexpr auto BL = bits_leaf; 635| 2.41k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.41k, False: 0] ------------------ 636| 2.41k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.41k, False: 0] ------------------ 637| 2.41k| auto is_leaf = p.shift() == BL; 638| 2.41k| auto child = p.node()->inner()[offset_hint]; 639| 2.41k| auto is_full = offset_hint + 1 != count_hint; 640| 2.41k| return is_full ------------------ | Branch (640:12): [True: 2.00k, False: 406] ------------------ 641| 2.41k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 693, False: 1.31k] ------------------ 642| 2.00k| : make_full_pos(child, p.shift() - B) 643| 1.31k| .visit(v, idx, args...)) 644| 2.41k| : (is_leaf ------------------ | Branch (644:19): [True: 406, False: 0] ------------------ 645| 406| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 406| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 2.41k|} _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.42k| { 208| 1.42k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.42k| } _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.84k| { 1406| 1.84k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.84k| } _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.26k| { 1337| 1.26k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.26k, False: 0] ------------------ 1338| 1.26k| auto is_leaf = shift_ == BL; 1339| 1.26k| auto child = node_->inner()[offset_hint]; 1340| 1.26k| return is_leaf ------------------ | Branch (1340:16): [True: 735, False: 530] ------------------ 1341| 1.26k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.26k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.26k| } _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| 2.99k| { 1337| 2.99k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.99k, False: 0] ------------------ 1338| 2.99k| auto is_leaf = shift_ == BL; 1339| 2.99k| auto child = node_->inner()[offset_hint]; 1340| 2.99k| return is_leaf ------------------ | Branch (1340:16): [True: 1.92k, False: 1.06k] ------------------ 1341| 2.99k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.99k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.99k| } _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| 5.67k| { 208| 5.67k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.67k| } _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.20k| { 1406| 4.20k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 4.20k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1405| 3.26k| { 1406| 3.26k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.26k| } _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| 7.64k| { 1337| 7.64k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 7.64k, False: 0] ------------------ 1338| 7.64k| auto is_leaf = shift_ == BL; 1339| 7.64k| auto child = node_->inner()[offset_hint]; 1340| 7.64k| return is_leaf ------------------ | Branch (1340:16): [True: 6.21k, False: 1.42k] ------------------ 1341| 7.64k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 7.64k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 7.64k| } _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.70k| { 208| 9.70k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 9.70k| } _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| 2.94k| { 1406| 2.94k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.94k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1310| 3.93k| { 1311| 3.93k| each_i(v, start, branches, args...); 1312| 3.93k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE6each_iINS1_11dec_visitorEJEEEvT_jjDpOT0_: 1263| 6.35k| { 1264| 6.35k| auto p = node_->inner() + i; 1265| 6.35k| auto e = node_->inner() + n; 1266| 6.35k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 3.82k, False: 2.52k] ------------------ 1267| 11.9k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 8.14k, False: 3.82k] ------------------ 1268| 8.14k| IMMER_PREFETCH(p + 1); 1269| 8.14k| make_full_leaf_pos(*p).visit(v, args...); 1270| 8.14k| } 1271| 3.82k| } else { 1272| 2.52k| auto ss = shift_ - B; 1273| 7.39k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 4.87k, False: 2.52k] ------------------ 1274| 4.87k| make_full_pos(*p, ss).visit(v, args...); 1275| 2.52k| } 1276| 6.35k| } _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| 406| { 113| 406| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 406| } _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.48k| { 306| 5.48k| return towards_oh_ch_regular( 307| 5.48k| *this, v, idx, offset_hint, count(), args...); 308| 5.48k| } _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.48k|{ 633| 5.48k| constexpr auto B = bits; 634| 5.48k| constexpr auto BL = bits_leaf; 635| 5.48k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.48k, False: 0] ------------------ 636| 5.48k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.48k, False: 0] ------------------ 637| 5.48k| auto is_leaf = p.shift() == BL; 638| 5.48k| auto child = p.node()->inner()[offset_hint]; 639| 5.48k| auto is_full = offset_hint + 1 != count_hint; 640| 5.48k| return is_full ------------------ | Branch (640:12): [True: 2.78k, False: 2.69k] ------------------ 641| 5.48k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.60k, False: 1.17k] ------------------ 642| 2.78k| : make_full_pos(child, p.shift() - B) 643| 1.17k| .visit(v, idx, args...)) 644| 5.48k| : (is_leaf ------------------ | Branch (644:19): [True: 1.21k, False: 1.48k] ------------------ 645| 2.69k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.69k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.48k| .visit(v, idx, args...)); 648| 5.48k|} _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.68k| { 113| 2.68k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.68k| } _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.09k| { 337| 6.09k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 6.09k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 336| 3.75k| { 337| 3.75k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.75k| } _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.73k| { 306| 3.73k| return towards_oh_ch_regular( 307| 3.73k| *this, v, idx, offset_hint, count(), args...); 308| 3.73k| } _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.73k|{ 633| 3.73k| constexpr auto B = bits; 634| 3.73k| constexpr auto BL = bits_leaf; 635| 3.73k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.73k, False: 0] ------------------ 636| 3.73k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.73k, False: 0] ------------------ 637| 3.73k| auto is_leaf = p.shift() == BL; 638| 3.73k| auto child = p.node()->inner()[offset_hint]; 639| 3.73k| auto is_full = offset_hint + 1 != count_hint; 640| 3.73k| return is_full ------------------ | Branch (640:12): [True: 1.05k, False: 2.67k] ------------------ 641| 3.73k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 731, False: 325] ------------------ 642| 1.05k| : make_full_pos(child, p.shift() - B) 643| 325| .visit(v, idx, args...)) 644| 3.73k| : (is_leaf ------------------ | Branch (644:19): [True: 1.75k, False: 924] ------------------ 645| 2.67k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.67k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 924| .visit(v, idx, args...)); 648| 3.73k|} _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.40k| { 113| 2.40k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.40k| } _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.12k| { 337| 3.12k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.12k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 285| 5.48k| { 286| 5.48k| return each_right_regular(*this, v, start, args...); 287| 5.48k| } _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.48k|{ 598| 5.48k| constexpr auto B = bits; 599| 5.48k| constexpr auto BL = bits_leaf; 600| | 601| 5.48k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 2.81k, False: 2.66k] ------------------ 602| 2.81k| auto n = p.node()->inner() + start; 603| 2.81k| auto last = p.count() - 1; 604| 2.81k| auto e = p.node()->inner() + last; 605| 2.81k| if (n <= e) { ------------------ | Branch (605:13): [True: 1.60k, False: 1.21k] ------------------ 606| 2.68k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 1.08k, False: 1.60k] ------------------ 607| 1.08k| IMMER_PREFETCH(n + 1); 608| 1.08k| make_full_leaf_pos(*n).visit(v, args...); 609| 1.08k| } 610| 1.60k| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 1.60k| } 612| 2.81k| } else { 613| 2.66k| auto n = p.node()->inner() + start; 614| 2.66k| auto last = p.count() - 1; 615| 2.66k| auto e = p.node()->inner() + last; 616| 2.66k| auto ss = p.shift() - B; 617| 2.66k| if (n <= e) { ------------------ | Branch (617:13): [True: 1.17k, False: 1.48k] ------------------ 618| 2.35k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 1.18k, False: 1.17k] ------------------ 619| 1.18k| make_full_pos(*n, ss).visit(v, args...); 620| 1.17k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 1.17k| } 622| 2.66k| } 623| 5.48k|} _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.1k| { 928| 10.1k| return towards_oh_ch_regular( 929| 10.1k| *this, v, idx, offset_hint, count(), args...); 930| 10.1k| } _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.1k|{ 633| 10.1k| constexpr auto B = bits; 634| 10.1k| constexpr auto BL = bits_leaf; 635| 10.1k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 10.1k, False: 0] ------------------ 636| 10.1k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 10.1k, False: 0] ------------------ 637| 10.1k| auto is_leaf = p.shift() == BL; 638| 10.1k| auto child = p.node()->inner()[offset_hint]; 639| 10.1k| auto is_full = offset_hint + 1 != count_hint; 640| 10.1k| return is_full ------------------ | Branch (640:12): [True: 4.09k, False: 6.08k] ------------------ 641| 10.1k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 2.14k, False: 1.95k] ------------------ 642| 4.09k| : make_full_pos(child, p.shift() - B) 643| 1.95k| .visit(v, idx, args...)) 644| 10.1k| : (is_leaf ------------------ | Branch (644:19): [True: 1.47k, False: 4.60k] ------------------ 645| 6.08k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 6.08k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 4.60k| .visit(v, idx, args...)); 648| 10.1k|} _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.79k| { 928| 6.79k| return towards_oh_ch_regular( 929| 6.79k| *this, v, idx, offset_hint, count(), args...); 930| 6.79k| } _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.79k|{ 633| 6.79k| constexpr auto B = bits; 634| 6.79k| constexpr auto BL = bits_leaf; 635| 6.79k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.79k, False: 0] ------------------ 636| 6.79k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.79k, False: 0] ------------------ 637| 6.79k| auto is_leaf = p.shift() == BL; 638| 6.79k| auto child = p.node()->inner()[offset_hint]; 639| 6.79k| auto is_full = offset_hint + 1 != count_hint; 640| 6.79k| return is_full ------------------ | Branch (640:12): [True: 3.94k, False: 2.85k] ------------------ 641| 6.79k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 2.75k, False: 1.19k] ------------------ 642| 3.94k| : make_full_pos(child, p.shift() - B) 643| 1.19k| .visit(v, idx, args...)) 644| 6.79k| : (is_leaf ------------------ | Branch (644:19): [True: 657, False: 2.19k] ------------------ 645| 2.85k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.85k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.19k| .visit(v, idx, args...)); 648| 6.79k|} _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.4k| { 868| 15.4k| return each_right_regular(*this, v, start, args...); 869| 15.4k| } _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.4k|{ 598| 15.4k| constexpr auto B = bits; 599| 15.4k| constexpr auto BL = bits_leaf; 600| | 601| 15.4k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 5.43k, False: 10.0k] ------------------ 602| 5.43k| auto n = p.node()->inner() + start; 603| 5.43k| auto last = p.count() - 1; 604| 5.43k| auto e = p.node()->inner() + last; 605| 5.43k| if (n <= e) { ------------------ | Branch (605:13): [True: 3.32k, False: 2.11k] ------------------ 606| 5.72k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 2.40k, False: 3.32k] ------------------ 607| 2.40k| IMMER_PREFETCH(n + 1); 608| 2.40k| make_full_leaf_pos(*n).visit(v, args...); 609| 2.40k| } 610| 3.32k| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 3.32k| } 612| 10.0k| } else { 613| 10.0k| auto n = p.node()->inner() + start; 614| 10.0k| auto last = p.count() - 1; 615| 10.0k| auto e = p.node()->inner() + last; 616| 10.0k| auto ss = p.shift() - B; 617| 10.0k| if (n <= e) { ------------------ | Branch (617:13): [True: 5.42k, False: 4.60k] ------------------ 618| 7.94k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 2.51k, False: 5.42k] ------------------ 619| 2.51k| make_full_pos(*n, ss).visit(v, args...); 620| 5.42k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 5.42k| } 622| 10.0k| } 623| 15.4k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1813| 42.3k| { 1814| 42.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 42.3k| } _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.2k| { 1687| 23.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 23.2k, False: 0] ------------------ 1688| 23.2k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 17.7k, False: 5.45k] ------------------ 1689| 23.2k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 23.2k| } _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.2k| { 1699| 23.2k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 23.2k| } _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.2k| { 1718| 23.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 23.2k, False: 0] ------------------ 1719| 23.2k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 17.7k, False: 5.45k] | Branch (1719:9): [True: 23.2k, False: 0] ------------------ 1720| 23.2k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 23.2k| auto child = node_->inner()[offset_hint]; 1722| 23.2k| auto is_leaf = shift_ == BL; 1723| 23.2k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 23.2k| auto next_idx = idx - left_size_hint; 1725| 23.2k| return is_leaf ------------------ | Branch (1725:16): [True: 3.72k, False: 19.4k] ------------------ 1726| 23.2k| ? make_leaf_sub_pos(child, next_size) 1727| 3.72k| .visit(v, next_idx, args...) 1728| 23.2k| : visit_maybe_relaxed_sub( 1729| 19.4k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 23.2k| } _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| 3.72k| { 145| 3.72k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 3.72k| } _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.4k|{ 1839| 19.4k| assert(node); ------------------ | Branch (1839:5): [True: 19.4k, False: 0] ------------------ 1840| 19.4k| auto relaxed = node->relaxed(); 1841| 19.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 11.9k, False: 7.55k] ------------------ 1842| 11.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 11.9k, False: 0] ------------------ 1843| 11.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 11.9k| .visit(v, std::forward(args)...); 1845| 11.9k| } else { 1846| 7.55k| return make_regular_sub_pos(node, shift, size) 1847| 7.55k| .visit(v, std::forward(args)...); 1848| 7.55k| } 1849| 19.4k|} _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.9k| { 1814| 11.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 11.9k| } _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.55k| { 1037| 7.55k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 7.55k| } _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.3k| { 1037| 10.3k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 10.3k| } _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| 15.2k| { 1687| 15.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 15.2k, False: 0] ------------------ 1688| 15.2k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 9.04k, False: 6.19k] ------------------ 1689| 15.2k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 15.2k| } _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| 15.2k| { 1699| 15.2k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 15.2k| } _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| 15.2k| { 1718| 15.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 15.2k, False: 0] ------------------ 1719| 15.2k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 9.04k, False: 6.19k] | Branch (1719:9): [True: 15.2k, False: 0] ------------------ 1720| 15.2k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 15.2k| auto child = node_->inner()[offset_hint]; 1722| 15.2k| auto is_leaf = shift_ == BL; 1723| 15.2k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 15.2k| auto next_idx = idx - left_size_hint; 1725| 15.2k| return is_leaf ------------------ | Branch (1725:16): [True: 5.11k, False: 10.1k] ------------------ 1726| 15.2k| ? make_leaf_sub_pos(child, next_size) 1727| 5.11k| .visit(v, next_idx, args...) 1728| 15.2k| : visit_maybe_relaxed_sub( 1729| 10.1k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 15.2k| } _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.11k| { 145| 5.11k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.11k| } _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| 10.1k|{ 1839| 10.1k| assert(node); ------------------ | Branch (1839:5): [True: 10.1k, False: 0] ------------------ 1840| 10.1k| auto relaxed = node->relaxed(); 1841| 10.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.00k, False: 3.12k] ------------------ 1842| 7.00k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.00k, False: 0] ------------------ 1843| 7.00k| return make_relaxed_pos(node, shift, relaxed) 1844| 7.00k| .visit(v, std::forward(args)...); 1845| 7.00k| } else { 1846| 3.12k| return make_regular_sub_pos(node, shift, size) 1847| 3.12k| .visit(v, std::forward(args)...); 1848| 3.12k| } 1849| 10.1k|} _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| 7.00k| { 1814| 7.00k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.00k| } _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.12k| { 1037| 3.12k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.12k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1653| 55.6k| { 1654| 55.6k| assert(start > 0); ------------------ | Branch (1654:9): [True: 55.6k, False: 0] ------------------ 1655| 55.6k| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 55.6k, False: 0] ------------------ 1656| 55.6k| auto s = relaxed_->d.sizes[start - 1]; 1657| 55.6k| auto p = node_->inner(); 1658| 55.6k| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 4.72k, False: 50.8k] ------------------ 1659| 12.4k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 7.72k, False: 4.72k] ------------------ 1660| 7.72k| IMMER_PREFETCH(p + i + 1); 1661| 7.72k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 7.72k| .visit(v, args...); 1663| 7.72k| s = relaxed_->d.sizes[i]; 1664| 7.72k| assert(s); ------------------ | Branch (1664:17): [True: 7.72k, False: 0] ------------------ 1665| 7.72k| } 1666| 50.8k| } else { 1667| 50.8k| auto ss = shift_ - B; 1668| 155k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 104k, False: 50.8k] ------------------ 1669| 104k| visit_maybe_relaxed_sub( 1670| 104k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 104k| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 104k, False: 0] ------------------ 1673| 104k| } 1674| 50.8k| } 1675| 55.6k| } _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.4k| { 1037| 12.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 12.4k| } _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.29k| { 928| 5.29k| return towards_oh_ch_regular( 929| 5.29k| *this, v, idx, offset_hint, count(), args...); 930| 5.29k| } _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.29k|{ 633| 5.29k| constexpr auto B = bits; 634| 5.29k| constexpr auto BL = bits_leaf; 635| 5.29k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.29k, False: 0] ------------------ 636| 5.29k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.29k, False: 0] ------------------ 637| 5.29k| auto is_leaf = p.shift() == BL; 638| 5.29k| auto child = p.node()->inner()[offset_hint]; 639| 5.29k| auto is_full = offset_hint + 1 != count_hint; 640| 5.29k| return is_full ------------------ | Branch (640:12): [True: 4.66k, False: 637] ------------------ 641| 5.29k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.18k, False: 3.47k] ------------------ 642| 4.66k| : make_full_pos(child, p.shift() - B) 643| 3.47k| .visit(v, idx, args...)) 644| 5.29k| : (is_leaf ------------------ | Branch (644:19): [True: 637, False: 0] ------------------ 645| 637| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 637| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 5.29k|} _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.73k| { 208| 1.73k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.73k| } _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.85k| { 1406| 3.85k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.85k| } _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| 936| { 1337| 936| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 936, False: 0] ------------------ 1338| 936| auto is_leaf = shift_ == BL; 1339| 936| auto child = node_->inner()[offset_hint]; 1340| 936| return is_leaf ------------------ | Branch (1340:16): [True: 554, False: 382] ------------------ 1341| 936| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 936| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 936| } _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| 637| { 113| 637| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 637| } _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| 687| { 145| 687| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 687| } _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| 43.2k|{ 1839| 43.2k| assert(node); ------------------ | Branch (1839:5): [True: 43.2k, False: 0] ------------------ 1840| 43.2k| auto relaxed = node->relaxed(); 1841| 43.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 34.9k, False: 8.27k] ------------------ 1842| 34.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 34.9k, False: 0] ------------------ 1843| 34.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 34.9k| .visit(v, std::forward(args)...); 1845| 34.9k| } else { 1846| 8.27k| return make_regular_sub_pos(node, shift, size) 1847| 8.27k| .visit(v, std::forward(args)...); 1848| 8.27k| } 1849| 43.2k|} _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| 34.9k| { 1814| 34.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 34.9k| } _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.28k| { 1706| 5.28k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 5.28k, False: 0] ------------------ 1707| 5.28k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 4.44k, False: 845] ------------------ 1708| 5.28k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 5.28k| } _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.28k| { 1718| 5.28k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 5.28k, False: 0] ------------------ 1719| 5.28k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 4.44k, False: 845] | Branch (1719:9): [True: 5.28k, False: 0] ------------------ 1720| 5.28k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 5.28k| auto child = node_->inner()[offset_hint]; 1722| 5.28k| auto is_leaf = shift_ == BL; 1723| 5.28k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 5.28k| auto next_idx = idx - left_size_hint; 1725| 5.28k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 5.28k] ------------------ 1726| 5.28k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 5.28k| : visit_maybe_relaxed_sub( 1729| 5.28k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 5.28k| } _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.23k| { 1706| 4.23k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 4.23k, False: 0] ------------------ 1707| 4.23k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 3.58k, False: 648] ------------------ 1708| 4.23k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 4.23k| } _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.23k| { 1718| 4.23k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 4.23k, False: 0] ------------------ 1719| 4.23k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.58k, False: 648] | Branch (1719:9): [True: 4.23k, False: 0] ------------------ 1720| 4.23k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 4.23k| auto child = node_->inner()[offset_hint]; 1722| 4.23k| auto is_leaf = shift_ == BL; 1723| 4.23k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 4.23k| auto next_idx = idx - left_size_hint; 1725| 4.23k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 4.23k] ------------------ 1726| 4.23k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 4.23k| : visit_maybe_relaxed_sub( 1729| 4.23k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 4.23k| } _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.23k|{ 1839| 4.23k| assert(node); ------------------ | Branch (1839:5): [True: 4.23k, False: 0] ------------------ 1840| 4.23k| auto relaxed = node->relaxed(); 1841| 4.23k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.50k, False: 1.72k] ------------------ 1842| 2.50k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.50k, False: 0] ------------------ 1843| 2.50k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.50k| .visit(v, std::forward(args)...); 1845| 2.50k| } 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.23k|} _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.50k| { 1814| 2.50k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.50k| } _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.43k| { 947| 2.43k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 2.43k| } _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.43k|{ 654| 2.43k| constexpr auto B = bits; 655| 2.43k| constexpr auto BL = bits_leaf; 656| 2.43k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 2.43k, False: 0] ------------------ 657| 2.43k| auto is_leaf = p.shift() == BL; 658| 2.43k| auto child = p.node()->inner()[offset_hint]; 659| 2.43k| auto lsize = offset_hint << p.shift(); 660| 2.43k| auto size = p.this_size(); 661| 2.43k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 2.43k| return is_full ------------------ | Branch (662:12): [True: 1.23k, False: 1.20k] ------------------ 663| 2.43k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 1.23k] ------------------ 664| 1.23k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 1.23k| : make_full_pos(child, p.shift() - B) 666| 1.23k| .visit(v, idx - lsize, args...)) 667| 2.43k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 1.20k] ------------------ 668| 1.20k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 1.20k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 1.20k| .visit(v, idx - lsize, args...)); 672| 2.43k|} _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.85k| { 1406| 2.85k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.85k| } _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.62k| { 1349| 1.62k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 1.62k, False: 0] ------------------ 1350| 1.62k| auto is_leaf = shift_ == BL; 1351| 1.62k| auto child = node_->inner()[offset_hint]; 1352| 1.62k| auto lsize = size_t{offset_hint} << shift_; 1353| 1.62k| return is_leaf ------------------ | Branch (1353:16): [True: 0, False: 1.62k] ------------------ 1354| 1.62k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 1.62k| : make_full_pos(child, shift_ - B) 1356| 1.62k| .visit(v, idx - lsize, args...); 1357| 1.62k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1405| 323| { 1406| 323| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 323| } _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| 2.10k| { 1349| 2.10k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 2.10k, False: 0] ------------------ 1350| 2.10k| auto is_leaf = shift_ == BL; 1351| 2.10k| auto child = node_->inner()[offset_hint]; 1352| 2.10k| auto lsize = size_t{offset_hint} << shift_; 1353| 2.10k| return is_leaf ------------------ | Branch (1353:16): [True: 1.34k, False: 754] ------------------ 1354| 2.10k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 2.10k| : make_full_pos(child, shift_ - B) 1356| 754| .visit(v, idx - lsize, args...); 1357| 2.10k| } _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.32k| { 208| 3.32k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.32k| } _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| 2.00k| { 1406| 2.00k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.00k| } _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.54k| { 1349| 7.54k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 7.54k, False: 0] ------------------ 1350| 7.54k| auto is_leaf = shift_ == BL; 1351| 7.54k| auto child = node_->inner()[offset_hint]; 1352| 7.54k| auto lsize = size_t{offset_hint} << shift_; 1353| 7.54k| return is_leaf ------------------ | Branch (1353:16): [True: 6.08k, False: 1.46k] ------------------ 1354| 7.54k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 7.54k| : make_full_pos(child, shift_ - B) 1356| 1.46k| .visit(v, idx - lsize, args...); 1357| 7.54k| } _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| 9.86k| { 208| 9.86k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 9.86k| } _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.27k| { 1406| 3.27k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.27k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1316| 2.42k| { 1317| 2.42k| each_i(v, 0, last, args...); 1318| 2.42k| } _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| 1.20k| { 1037| 1.20k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.20k| } _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.29k| { 1037| 4.29k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.29k| } _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.22k| { 947| 3.22k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 3.22k| } _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.22k|{ 654| 3.22k| constexpr auto B = bits; 655| 3.22k| constexpr auto BL = bits_leaf; 656| 3.22k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 3.22k, False: 0] ------------------ 657| 3.22k| auto is_leaf = p.shift() == BL; 658| 3.22k| auto child = p.node()->inner()[offset_hint]; 659| 3.22k| auto lsize = offset_hint << p.shift(); 660| 3.22k| auto size = p.this_size(); 661| 3.22k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 3.22k| return is_full ------------------ | Branch (662:12): [True: 3.22k, False: 0] ------------------ 663| 3.22k| ? (is_leaf ------------------ | Branch (663:19): [True: 1.97k, False: 1.25k] ------------------ 664| 3.22k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 3.22k| : make_full_pos(child, p.shift() - B) 666| 1.25k| .visit(v, idx - lsize, args...)) 667| 3.22k| : (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.22k|} _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.59k| { 947| 5.59k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 5.59k| } _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.59k|{ 654| 5.59k| constexpr auto B = bits; 655| 5.59k| constexpr auto BL = bits_leaf; 656| 5.59k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 5.59k, False: 0] ------------------ 657| 5.59k| auto is_leaf = p.shift() == BL; 658| 5.59k| auto child = p.node()->inner()[offset_hint]; 659| 5.59k| auto lsize = offset_hint << p.shift(); 660| 5.59k| auto size = p.this_size(); 661| 5.59k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 5.59k| return is_full ------------------ | Branch (662:12): [True: 5.59k, False: 0] ------------------ 663| 5.59k| ? (is_leaf ------------------ | Branch (663:19): [True: 3.78k, False: 1.81k] ------------------ 664| 5.59k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 5.59k| : make_full_pos(child, p.shift() - B) 666| 1.81k| .visit(v, idx - lsize, args...)) 667| 5.59k| : (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.59k|} _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.52k| { 874| 7.52k| return each_left_regular(*this, v, last, args...); 875| 7.52k| } _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.52k|{ 576| 7.52k| constexpr auto B = bits; 577| 7.52k| constexpr auto BL = bits_leaf; 578| 7.52k| assert(last < p.count()); ------------------ | Branch (578:5): [True: 7.52k, False: 0] ------------------ 579| 7.52k| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 1.97k, False: 5.54k] ------------------ 580| 1.97k| auto n = p.node()->inner(); 581| 1.97k| auto e = n + last; 582| 4.27k| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 2.30k, False: 1.97k] ------------------ 583| 2.30k| IMMER_PREFETCH(n + 1); 584| 2.30k| make_full_leaf_pos(*n).visit(v, args...); 585| 2.30k| } 586| 5.54k| } else { 587| 5.54k| auto n = p.node()->inner(); 588| 5.54k| auto e = n + last; 589| 5.54k| auto ss = p.shift() - B; 590| 7.74k| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 2.19k, False: 5.54k] ------------------ 591| 2.19k| make_full_pos(*n, ss).visit(v, args...); 592| 5.54k| } 593| 7.52k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1813| 5.28k| { 1814| 5.28k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 5.28k| } _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| 144k| { 1706| 144k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 144k, False: 0] ------------------ 1707| 144k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 8.66k, False: 135k] ------------------ 1708| 144k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 144k| } _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| 144k| { 1718| 144k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 144k, False: 0] ------------------ 1719| 144k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 8.66k, False: 135k] | Branch (1719:9): [True: 144k, False: 0] ------------------ 1720| 144k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 144k| auto child = node_->inner()[offset_hint]; 1722| 144k| auto is_leaf = shift_ == BL; 1723| 144k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 144k| auto next_idx = idx - left_size_hint; 1725| 144k| return is_leaf ------------------ | Branch (1725:16): [True: 8.78k, False: 135k] ------------------ 1726| 144k| ? make_leaf_sub_pos(child, next_size) 1727| 8.78k| .visit(v, next_idx, args...) 1728| 144k| : visit_maybe_relaxed_sub( 1729| 135k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 144k| } _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| 8.78k| { 145| 8.78k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 8.78k| } _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| 135k|{ 1839| 135k| assert(node); ------------------ | Branch (1839:5): [True: 135k, False: 0] ------------------ 1840| 135k| auto relaxed = node->relaxed(); 1841| 135k| if (relaxed) { ------------------ | Branch (1841:9): [True: 134k, False: 1.49k] ------------------ 1842| 134k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 134k, False: 0] ------------------ 1843| 134k| return make_relaxed_pos(node, shift, relaxed) 1844| 134k| .visit(v, std::forward(args)...); 1845| 134k| } else { 1846| 1.49k| return make_regular_sub_pos(node, shift, size) 1847| 1.49k| .visit(v, std::forward(args)...); 1848| 1.49k| } 1849| 135k|} _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| 134k| { 1814| 134k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 134k| } _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.49k| { 1037| 1.49k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.49k| } _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| 86.1k| { 1706| 86.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 86.1k, False: 0] ------------------ 1707| 86.1k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 25.8k, False: 60.3k] ------------------ 1708| 86.1k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 86.1k| } _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| 86.1k| { 1718| 86.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 86.1k, False: 0] ------------------ 1719| 86.1k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 25.8k, False: 60.3k] | Branch (1719:9): [True: 86.1k, False: 0] ------------------ 1720| 86.1k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 86.1k| auto child = node_->inner()[offset_hint]; 1722| 86.1k| auto is_leaf = shift_ == BL; 1723| 86.1k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 86.1k| auto next_idx = idx - left_size_hint; 1725| 86.1k| return is_leaf ------------------ | Branch (1725:16): [True: 15.9k, False: 70.2k] ------------------ 1726| 86.1k| ? make_leaf_sub_pos(child, next_size) 1727| 15.9k| .visit(v, next_idx, args...) 1728| 86.1k| : visit_maybe_relaxed_sub( 1729| 70.2k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 86.1k| } _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| 15.9k| { 145| 15.9k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 15.9k| } _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| 70.2k|{ 1839| 70.2k| assert(node); ------------------ | Branch (1839:5): [True: 70.2k, False: 0] ------------------ 1840| 70.2k| auto relaxed = node->relaxed(); 1841| 70.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 68.5k, False: 1.68k] ------------------ 1842| 68.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 68.5k, False: 0] ------------------ 1843| 68.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 68.5k| .visit(v, std::forward(args)...); 1845| 68.5k| } else { 1846| 1.68k| return make_regular_sub_pos(node, shift, size) 1847| 1.68k| .visit(v, std::forward(args)...); 1848| 1.68k| } 1849| 70.2k|} _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| 68.5k| { 1814| 68.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 68.5k| } _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| 1.68k| { 1037| 1.68k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.68k| } _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| 8.27k| { 1037| 8.27k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.27k| } _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.29k| { 947| 4.29k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 4.29k| } _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.29k|{ 654| 4.29k| constexpr auto B = bits; 655| 4.29k| constexpr auto BL = bits_leaf; 656| 4.29k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 4.29k, False: 0] ------------------ 657| 4.29k| auto is_leaf = p.shift() == BL; 658| 4.29k| auto child = p.node()->inner()[offset_hint]; 659| 4.29k| auto lsize = offset_hint << p.shift(); 660| 4.29k| auto size = p.this_size(); 661| 4.29k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 4.29k| return is_full ------------------ | Branch (662:12): [True: 3.13k, False: 1.16k] ------------------ 663| 4.29k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 3.13k] ------------------ 664| 3.13k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 3.13k| : make_full_pos(child, p.shift() - B) 666| 3.13k| .visit(v, idx - lsize, args...)) 667| 4.29k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 1.16k] ------------------ 668| 1.16k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 1.16k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 1.16k| .visit(v, idx - lsize, args...)); 672| 4.29k|} _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.45k| { 1406| 3.45k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.45k| } _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| 323| { 1349| 323| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 323, False: 0] ------------------ 1350| 323| auto is_leaf = shift_ == BL; 1351| 323| auto child = node_->inner()[offset_hint]; 1352| 323| auto lsize = size_t{offset_hint} << shift_; 1353| 323| return is_leaf ------------------ | Branch (1353:16): [True: 0, False: 323] ------------------ 1354| 323| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 323| : make_full_pos(child, shift_ - B) 1356| 323| .visit(v, idx - lsize, args...); 1357| 323| } _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.16k| { 1037| 1.16k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.16k| } _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.2k|{ 1839| 18.2k| assert(node); ------------------ | Branch (1839:5): [True: 18.2k, False: 0] ------------------ 1840| 18.2k| auto relaxed = node->relaxed(); 1841| 18.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 12.3k, False: 5.95k] ------------------ 1842| 12.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 12.3k, False: 0] ------------------ 1843| 12.3k| return make_relaxed_pos(node, shift, relaxed) 1844| 12.3k| .visit(v, std::forward(args)...); 1845| 12.3k| } else { 1846| 5.95k| return make_regular_sub_pos(node, shift, size) 1847| 5.95k| .visit(v, std::forward(args)...); 1848| 5.95k| } 1849| 18.2k|} _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| 12.3k| { 1814| 12.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 12.3k| } _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| 12.3k|{ 1839| 12.3k| assert(node); ------------------ | Branch (1839:5): [True: 12.3k, False: 0] ------------------ 1840| 12.3k| auto relaxed = node->relaxed(); 1841| 12.3k| if (relaxed) { ------------------ | Branch (1841:9): [True: 9.19k, False: 3.11k] ------------------ 1842| 9.19k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 9.19k, False: 0] ------------------ 1843| 9.19k| return make_relaxed_pos(node, shift, relaxed) 1844| 9.19k| .visit(v, std::forward(args)...); 1845| 9.19k| } else { 1846| 3.11k| return make_regular_sub_pos(node, shift, size) 1847| 3.11k| .visit(v, std::forward(args)...); 1848| 3.11k| } 1849| 12.3k|} _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| 9.19k| { 1814| 9.19k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 9.19k| } _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| 33.5k| { 1794| 33.5k| auto child = node_->inner()[offset]; 1795| 33.5k| auto child_size = size(offset); 1796| 33.5k| auto is_leaf = shift_ == BL; 1797| 33.5k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 8.90k, False: 24.6k] ------------------ 1798| 33.5k| : visit_maybe_relaxed_sub( 1799| 24.6k| child, shift_ - B, child_size, v, args...); 1800| 33.5k| } _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| 9.22k| { 145| 9.22k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 9.22k| } _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| 9.22k| { 1805| 9.22k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 9.22k, False: 0] ------------------ 1806| 9.22k| auto child = node_->inner()[offset]; 1807| 9.22k| auto child_size = size(offset); 1808| 9.22k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 9.22k| } _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.77k| { 145| 9.77k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 9.77k| } _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| 24.6k|{ 1839| 24.6k| assert(node); ------------------ | Branch (1839:5): [True: 24.6k, False: 0] ------------------ 1840| 24.6k| auto relaxed = node->relaxed(); 1841| 24.6k| if (relaxed) { ------------------ | Branch (1841:9): [True: 22.0k, False: 2.57k] ------------------ 1842| 22.0k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 22.0k, False: 0] ------------------ 1843| 22.0k| return make_relaxed_pos(node, shift, relaxed) 1844| 22.0k| .visit(v, std::forward(args)...); 1845| 22.0k| } else { 1846| 2.57k| return make_regular_sub_pos(node, shift, size) 1847| 2.57k| .visit(v, std::forward(args)...); 1848| 2.57k| } 1849| 24.6k|} _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| 22.0k| { 1814| 22.0k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 22.0k| } _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| 22.0k| { 1794| 22.0k| auto child = node_->inner()[offset]; 1795| 22.0k| auto child_size = size(offset); 1796| 22.0k| auto is_leaf = shift_ == BL; 1797| 22.0k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 22.0k] ------------------ 1798| 22.0k| : visit_maybe_relaxed_sub( 1799| 22.0k| child, shift_ - B, child_size, v, args...); 1800| 22.0k| } _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| 22.0k|{ 1839| 22.0k| assert(node); ------------------ | Branch (1839:5): [True: 22.0k, False: 0] ------------------ 1840| 22.0k| auto relaxed = node->relaxed(); 1841| 22.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 21.0k, False: 990] ------------------ 1842| 21.0k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 21.0k, False: 0] ------------------ 1843| 21.0k| return make_relaxed_pos(node, shift, relaxed) 1844| 21.0k| .visit(v, std::forward(args)...); 1845| 21.0k| } else { 1846| 990| return make_regular_sub_pos(node, shift, size) 1847| 990| .visit(v, std::forward(args)...); 1848| 990| } 1849| 22.0k|} _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| 21.0k| { 1814| 21.0k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 21.0k| } _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.38k| { 1037| 1.38k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.38k| } _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.57k| { 1794| 6.57k| auto child = node_->inner()[offset]; 1795| 6.57k| auto child_size = size(offset); 1796| 6.57k| auto is_leaf = shift_ == BL; 1797| 6.57k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 3.55k, False: 3.02k] ------------------ 1798| 6.57k| : visit_maybe_relaxed_sub( 1799| 3.02k| child, shift_ - B, child_size, v, args...); 1800| 6.57k| } _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.55k| { 145| 3.55k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 3.55k| } _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.55k| { 1026| 3.55k| assert(shift_ == BL); ------------------ | Branch (1026:9): [True: 3.55k, False: 0] ------------------ 1027| 3.55k| auto child = node_->inner()[idx]; 1028| 3.55k| auto lsize = size(idx); 1029| 3.55k| auto is_full = idx + 1 < count(); 1030| 3.55k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1030:16): [True: 2.99k, False: 555] ------------------ 1031| 3.55k| : make_leaf_sub_pos(child, lsize).visit(v, args...); 1032| 3.55k| } _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.78k| { 208| 6.78k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 6.78k| } _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.02k|{ 1839| 3.02k| assert(node); ------------------ | Branch (1839:5): [True: 3.02k, False: 0] ------------------ 1840| 3.02k| auto relaxed = node->relaxed(); 1841| 3.02k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.28k, False: 740] ------------------ 1842| 2.28k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.28k, False: 0] ------------------ 1843| 2.28k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.28k| .visit(v, std::forward(args)...); 1845| 2.28k| } else { 1846| 740| return make_regular_sub_pos(node, shift, size) 1847| 740| .visit(v, std::forward(args)...); 1848| 740| } 1849| 3.02k|} _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.28k| { 1814| 2.28k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.28k| } _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.28k| { 1008| 2.28k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 2.28k, False: 0] ------------------ 1009| 2.28k| auto is_leaf = shift_ == BL; 1010| 2.28k| auto child = node_->inner()[idx]; 1011| 2.28k| auto lsize = size(idx); 1012| 2.28k| auto is_full = idx + 1 < count(); 1013| 2.28k| return is_full ------------------ | Branch (1013:16): [True: 1.89k, False: 393] ------------------ 1014| 2.28k| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 1.89k] ------------------ 1015| 1.89k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.89k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 2.28k| : (is_leaf ------------------ | Branch (1017:23): [True: 0, False: 393] ------------------ 1018| 393| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 393| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 393| .visit(v, args...)); 1021| 2.28k| } _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.76k| { 1406| 2.76k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.76k| } _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.78k, False: 1.97k] ------------------ 1798| 5.76k| : visit_maybe_relaxed_sub( 1799| 1.97k| 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.78k| { 145| 3.78k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 3.78k| } _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.78k| { 1397| 3.78k| assert(shift_ == BL); ------------------ | Branch (1397:9): [True: 3.78k, False: 0] ------------------ 1398| 3.78k| assert(idx < count()); ------------------ | Branch (1398:9): [True: 3.78k, False: 0] ------------------ 1399| 3.78k| auto child = node_->inner()[idx]; 1400| 3.78k| return make_full_leaf_pos(child).visit(v, args...); 1401| 3.78k| } _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| 1.97k|{ 1839| 1.97k| assert(node); ------------------ | Branch (1839:5): [True: 1.97k, False: 0] ------------------ 1840| 1.97k| auto relaxed = node->relaxed(); 1841| 1.97k| if (relaxed) { ------------------ | Branch (1841:9): [True: 868, False: 1.10k] ------------------ 1842| 868| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 868, False: 0] ------------------ 1843| 868| return make_relaxed_pos(node, shift, relaxed) 1844| 868| .visit(v, std::forward(args)...); 1845| 1.10k| } else { 1846| 1.10k| return make_regular_sub_pos(node, shift, size) 1847| 1.10k| .visit(v, std::forward(args)...); 1848| 1.10k| } 1849| 1.97k|} _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| 868| { 1814| 868| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 868| } _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| 868| { 1387| 868| assert(idx < count()); ------------------ | Branch (1387:9): [True: 868, False: 0] ------------------ 1388| 868| auto is_leaf = shift_ == BL; 1389| 868| auto child = node_->inner()[idx]; 1390| 868| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 868] ------------------ 1391| 868| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 868| } _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.10k| { 1037| 1.10k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.10k| } _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.10k| { 1387| 1.10k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 1.10k, False: 0] ------------------ 1388| 1.10k| auto is_leaf = shift_ == BL; 1389| 1.10k| auto child = node_->inner()[idx]; 1390| 1.10k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 1.10k] ------------------ 1391| 1.10k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 1.10k| } _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.84k| { 1406| 1.84k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.84k| } _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.05k| { 1223| 3.05k| auto p = node_->inner(); 1224| 3.05k| auto p2 = other->inner(); 1225| 3.05k| auto e = p + branches; 1226| 3.05k| if (shift_ == BL) { ------------------ | Branch (1226:13): [True: 2.39k, False: 664] ------------------ 1227| 9.40k| for (; p != e; ++p, ++p2) { ------------------ | Branch (1227:20): [True: 8.09k, False: 1.31k] ------------------ 1228| 8.09k| IMMER_PREFETCH(p + 1); 1229| 8.09k| if (!make_full_leaf_pos(*p).visit(v, *p2, args...)) ------------------ | Branch (1229:21): [True: 1.08k, False: 7.01k] ------------------ 1230| 1.08k| return false; 1231| 8.09k| } 1232| 2.39k| } else { 1233| 664| auto ss = shift_ - B; 1234| 2.46k| for (; p != e; ++p, ++p2) ------------------ | Branch (1234:20): [True: 2.18k, False: 289] ------------------ 1235| 2.18k| if (!make_full_pos(*p, ss).visit(v, *p2, args...)) ------------------ | Branch (1235:21): [True: 375, False: 1.80k] ------------------ 1236| 375| return false; 1237| 664| } 1238| 1.59k| return true; 1239| 3.05k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 207| 12.3k| { 208| 12.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 12.3k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 1405| 7.62k| { 1406| 7.62k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 7.62k| } _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| 4.79k| { 838| 4.79k| return each_pred_zip_regular(*this, v, other, args...); 839| 4.79k| } _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| 4.79k|{ 393| 4.79k| constexpr auto B = bits; 394| 4.79k| constexpr auto BL = bits_leaf; 395| | 396| 4.79k| auto n = p.node()->inner(); 397| 4.79k| auto n2 = other->inner(); 398| 4.79k| auto last = p.count() - 1; 399| 4.79k| auto e = n + last; 400| 4.79k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 1.49k, False: 3.30k] ------------------ 401| 3.86k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 2.74k, False: 1.11k] ------------------ 402| 2.74k| IMMER_PREFETCH(n + 1); 403| 2.74k| IMMER_PREFETCH(n2 + 1); 404| 2.74k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 377, False: 2.36k] ------------------ 405| 377| return false; 406| 2.74k| } 407| 1.11k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 3.30k| } else { 409| 3.30k| auto ss = p.shift() - B; 410| 6.62k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 3.96k, False: 2.66k] ------------------ 411| 3.96k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 635, False: 3.32k] ------------------ 412| 635| return false; 413| 2.66k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 3.30k| } 415| 4.79k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 112| 2.87k| { 113| 2.87k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.87k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 336| 3.85k| { 337| 3.85k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.85k| } _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.39k| { 256| 3.39k| return each_pred_zip_regular(*this, v, other, args...); 257| 3.39k| } _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.39k|{ 393| 3.39k| constexpr auto B = bits; 394| 3.39k| constexpr auto BL = bits_leaf; 395| | 396| 3.39k| auto n = p.node()->inner(); 397| 3.39k| auto n2 = other->inner(); 398| 3.39k| auto last = p.count() - 1; 399| 3.39k| auto e = n + last; 400| 3.39k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 1.99k, False: 1.39k] ------------------ 401| 3.21k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 1.46k, False: 1.75k] ------------------ 402| 1.46k| IMMER_PREFETCH(n + 1); 403| 1.46k| IMMER_PREFETCH(n2 + 1); 404| 1.46k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 241, False: 1.22k] ------------------ 405| 241| return false; 406| 1.46k| } 407| 1.75k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 1.99k| } else { 409| 1.39k| auto ss = p.shift() - B; 410| 2.67k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 1.48k, False: 1.19k] ------------------ 411| 1.48k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 205, False: 1.27k] ------------------ 412| 205| return false; 413| 1.19k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 1.39k| } 415| 3.39k|} _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.54k| { 1387| 4.54k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 4.54k, False: 0] ------------------ 1388| 4.54k| auto is_leaf = shift_ == BL; 1389| 4.54k| auto child = node_->inner()[idx]; 1390| 4.54k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 3.13k, False: 1.41k] ------------------ 1391| 4.54k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 4.54k| } _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| 346k| { 208| 346k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 346k| } _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| 9.75M|{ 1839| 9.75M| assert(node); ------------------ | Branch (1839:5): [True: 9.75M, False: 0] ------------------ 1840| 9.75M| auto relaxed = node->relaxed(); 1841| 9.75M| if (relaxed) { ------------------ | Branch (1841:9): [True: 9.38M, False: 372k] ------------------ 1842| 9.38M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 9.38M, False: 0] ------------------ 1843| 9.38M| return make_relaxed_pos(node, shift, relaxed) 1844| 9.38M| .visit(v, std::forward(args)...); 1845| 9.38M| } else { 1846| 372k| return make_regular_sub_pos(node, shift, size) 1847| 372k| .visit(v, std::forward(args)...); 1848| 372k| } 1849| 9.75M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1813| 9.38M| { 1814| 9.38M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 9.38M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1679| 9.38M| { 1680| 9.38M| return towards_oh(v, idx, subindex(idx), args...); 1681| 9.38M| } _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.38M| { 1687| 9.38M| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 9.38M, False: 0] ------------------ 1688| 9.38M| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 5.04M, False: 4.33M] ------------------ 1689| 9.38M| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 9.38M| } _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.38M| { 1699| 9.38M| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 9.38M| } _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.38M| { 1718| 9.38M| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 9.38M, False: 0] ------------------ 1719| 9.38M| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 5.04M, False: 4.33M] | Branch (1719:9): [True: 9.38M, False: 0] ------------------ 1720| 9.38M| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 9.38M| auto child = node_->inner()[offset_hint]; 1722| 9.38M| auto is_leaf = shift_ == BL; 1723| 9.38M| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 9.38M| auto next_idx = idx - left_size_hint; 1725| 9.38M| return is_leaf ------------------ | Branch (1725:16): [True: 1.00M, False: 8.37M] ------------------ 1726| 9.38M| ? make_leaf_sub_pos(child, next_size) 1727| 1.00M| .visit(v, next_idx, args...) 1728| 9.38M| : visit_maybe_relaxed_sub( 1729| 8.37M| child, shift_ - B, next_size, v, next_idx, args...); 1730| 9.38M| } _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.00M| { 145| 1.00M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.00M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1036| 372k| { 1037| 372k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 372k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 919| 372k| { 920| 372k| return towards_oh_ch_regular( 921| 372k| *this, v, idx, index(idx), count(), args...); 922| 372k| } _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| 372k|{ 633| 372k| constexpr auto B = bits; 634| 372k| constexpr auto BL = bits_leaf; 635| 372k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 372k, False: 0] ------------------ 636| 372k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 372k, False: 0] ------------------ 637| 372k| auto is_leaf = p.shift() == BL; 638| 372k| auto child = p.node()->inner()[offset_hint]; 639| 372k| auto is_full = offset_hint + 1 != count_hint; 640| 372k| return is_full ------------------ | Branch (640:12): [True: 272k, False: 100k] ------------------ 641| 372k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 50.2k, False: 221k] ------------------ 642| 272k| : make_full_pos(child, p.shift() - B) 643| 221k| .visit(v, idx, args...)) 644| 372k| : (is_leaf ------------------ | Branch (644:19): [True: 18.8k, False: 81.7k] ------------------ 645| 100k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 100k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 81.7k| .visit(v, idx, args...)); 648| 372k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 207| 348k| { 208| 348k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 348k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1405| 1.04M| { 1406| 1.04M| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.04M| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1322| 1.04M| { 1323| 1.04M| return towards_oh(v, idx, index(idx), args...); 1324| 1.04M| } _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.04M| { 1337| 1.04M| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.04M, False: 0] ------------------ 1338| 1.04M| auto is_leaf = shift_ == BL; 1339| 1.04M| auto child = node_->inner()[offset_hint]; 1340| 1.04M| return is_leaf ------------------ | Branch (1340:16): [True: 291k, False: 749k] ------------------ 1341| 1.04M| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.04M| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.04M| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 112| 24.1k| { 113| 24.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 24.1k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 336| 109k| { 337| 109k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 109k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 297| 109k| { 298| 109k| return towards_oh_ch_regular( 299| 109k| *this, v, idx, index(idx), count(), args...); 300| 109k| } _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| 109k|{ 633| 109k| constexpr auto B = bits; 634| 109k| constexpr auto BL = bits_leaf; 635| 109k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 109k, False: 0] ------------------ 636| 109k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 109k, False: 0] ------------------ 637| 109k| auto is_leaf = p.shift() == BL; 638| 109k| auto child = p.node()->inner()[offset_hint]; 639| 109k| auto is_full = offset_hint + 1 != count_hint; 640| 109k| return is_full ------------------ | Branch (640:12): [True: 76.4k, False: 33.4k] ------------------ 641| 109k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 7.12k, False: 69.2k] ------------------ 642| 76.4k| : make_full_pos(child, p.shift() - B) 643| 69.2k| .visit(v, idx, args...)) 644| 109k| : (is_leaf ------------------ | Branch (644:19): [True: 5.31k, False: 28.1k] ------------------ 645| 33.4k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 33.4k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 28.1k| .visit(v, idx, args...)); 648| 109k|} _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| 93.7k| { 1406| 93.7k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 93.7k| } _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| 93.7k| { 1203| 93.7k| auto p = node_->inner(); 1204| 93.7k| auto e = p + branches; 1205| 93.7k| if (shift_ == BL) { ------------------ | Branch (1205:13): [True: 73.0k, False: 20.6k] ------------------ 1206| 363k| for (; p != e; ++p) { ------------------ | Branch (1206:20): [True: 290k, False: 72.0k] ------------------ 1207| 290k| IMMER_PREFETCH(p + 1); 1208| 290k| if (!make_full_leaf_pos(*p).visit(v, args...)) ------------------ | Branch (1208:21): [True: 962, False: 290k] ------------------ 1209| 962| return false; 1210| 290k| } 1211| 73.0k| } else { 1212| 20.6k| auto ss = shift_ - B; 1213| 102k| for (; p != e; ++p) ------------------ | Branch (1213:20): [True: 82.1k, False: 20.2k] ------------------ 1214| 82.1k| if (!make_full_pos(*p, ss).visit(v, args...)) ------------------ | Branch (1214:21): [True: 461, False: 81.7k] ------------------ 1215| 461| return false; 1216| 20.6k| } 1217| 92.3k| return true; 1218| 93.7k| } _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| 740| { 1037| 740| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 740| } _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| 740| { 1008| 740| assert(idx < count()); ------------------ | Branch (1008:9): [True: 740, False: 0] ------------------ 1009| 740| auto is_leaf = shift_ == BL; 1010| 740| auto child = node_->inner()[idx]; 1011| 740| auto lsize = size(idx); 1012| 740| auto is_full = idx + 1 < count(); 1013| 740| return is_full ------------------ | Branch (1013:16): [True: 740, False: 0] ------------------ 1014| 740| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 740] ------------------ 1015| 740| ? make_full_leaf_pos(child).visit(v, args...) 1016| 740| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 740| : (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| 740| } _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.83k| { 1037| 1.83k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.83k| } _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.18k| { 1008| 4.18k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 4.18k, False: 0] ------------------ 1009| 4.18k| auto is_leaf = shift_ == BL; 1010| 4.18k| auto child = node_->inner()[idx]; 1011| 4.18k| auto lsize = size(idx); 1012| 4.18k| auto is_full = idx + 1 < count(); 1013| 4.18k| return is_full ------------------ | Branch (1013:16): [True: 1.43k, False: 2.75k] ------------------ 1014| 4.18k| ? (is_leaf ------------------ | Branch (1014:23): [True: 844, False: 590] ------------------ 1015| 1.43k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.43k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 4.18k| : (is_leaf ------------------ | Branch (1017:23): [True: 1.45k, False: 1.29k] ------------------ 1018| 2.75k| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 2.75k| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 1.29k| .visit(v, args...)); 1021| 4.18k| } _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| 991k| { 145| 991k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 991k| } _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.8k| { 1037| 20.8k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 20.8k| } _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.8k| { 832| 20.8k| return each_pred_regular(*this, v, args...); 833| 20.8k| } _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.8k|{ 366| 20.8k| constexpr auto B = bits; 367| 20.8k| constexpr auto BL = bits_leaf; 368| 20.8k| auto n = p.node()->inner(); 369| 20.8k| auto last = p.count() - 1; 370| 20.8k| auto e = n + last; 371| 20.8k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 16.5k, False: 4.32k] ------------------ 372| 61.9k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 45.6k, False: 16.2k] ------------------ 373| 45.6k| IMMER_PREFETCH(n + 1); 374| 45.6k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 244, False: 45.3k] ------------------ 375| 244| return false; 376| 45.6k| } 377| 16.2k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 16.5k| } else { 379| 4.32k| auto ss = p.shift() - B; 380| 9.54k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 5.84k, False: 3.70k] ------------------ 381| 5.84k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 625, False: 5.22k] ------------------ 382| 625| return false; 383| 3.70k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 4.32k| } 385| 20.8k|} _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| 19.3k| { 113| 19.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 19.3k| } _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| 5.79k| { 337| 5.79k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 5.79k| } _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| 5.79k| { 250| 5.79k| return each_pred_regular(*this, v, args...); 251| 5.79k| } _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| 5.79k|{ 366| 5.79k| constexpr auto B = bits; 367| 5.79k| constexpr auto BL = bits_leaf; 368| 5.79k| auto n = p.node()->inner(); 369| 5.79k| auto last = p.count() - 1; 370| 5.79k| auto e = n + last; 371| 5.79k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 3.38k, False: 2.40k] ------------------ 372| 8.86k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 5.73k, False: 3.13k] ------------------ 373| 5.73k| IMMER_PREFETCH(n + 1); 374| 5.73k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 258, False: 5.47k] ------------------ 375| 258| return false; 376| 5.73k| } 377| 3.13k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 3.38k| } else { 379| 2.40k| auto ss = p.shift() - B; 380| 5.77k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 3.67k, False: 2.09k] ------------------ 381| 3.67k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 312, False: 3.36k] ------------------ 382| 312| return false; 383| 2.09k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 2.40k| } 385| 5.79k|} _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.57k| { 1037| 2.57k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.57k| } _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.57k| { 1794| 2.57k| auto child = node_->inner()[offset]; 1795| 2.57k| auto child_size = size(offset); 1796| 2.57k| auto is_leaf = shift_ == BL; 1797| 2.57k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 2.57k] ------------------ 1798| 2.57k| : visit_maybe_relaxed_sub( 1799| 2.57k| child, shift_ - B, child_size, v, args...); 1800| 2.57k| } _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.57k|{ 1839| 2.57k| assert(node); ------------------ | Branch (1839:5): [True: 2.57k, False: 0] ------------------ 1840| 2.57k| auto relaxed = node->relaxed(); 1841| 2.57k| if (relaxed) { ------------------ | Branch (1841:9): [True: 748, False: 1.83k] ------------------ 1842| 748| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 748, False: 0] ------------------ 1843| 748| return make_relaxed_pos(node, shift, relaxed) 1844| 748| .visit(v, std::forward(args)...); 1845| 1.83k| } else { 1846| 1.83k| return make_regular_sub_pos(node, shift, size) 1847| 1.83k| .visit(v, std::forward(args)...); 1848| 1.83k| } 1849| 2.57k|} _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| 748| { 1814| 748| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 748| } _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| 3.99k| { 1008| 3.99k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 3.99k, False: 0] ------------------ 1009| 3.99k| auto is_leaf = shift_ == BL; 1010| 3.99k| auto child = node_->inner()[idx]; 1011| 3.99k| auto lsize = size(idx); 1012| 3.99k| auto is_full = idx + 1 < count(); 1013| 3.99k| return is_full ------------------ | Branch (1013:16): [True: 3.68k, False: 315] ------------------ 1014| 3.99k| ? (is_leaf ------------------ | Branch (1014:23): [True: 2.21k, False: 1.46k] ------------------ 1015| 3.68k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 3.68k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 3.99k| : (is_leaf ------------------ | Branch (1017:23): [True: 315, False: 0] ------------------ 1018| 315| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 315| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 0| .visit(v, args...)); 1021| 3.99k| } _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.65k| { 208| 4.65k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 4.65k| } _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.65k| { 1805| 4.65k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 4.65k, False: 0] ------------------ 1806| 4.65k| auto child = node_->inner()[offset]; 1807| 4.65k| auto child_size = size(offset); 1808| 4.65k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 4.65k| } _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.65k| { 145| 4.65k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.65k| } _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.67k| { 1406| 2.67k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.67k| } _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.67k| { 1794| 2.67k| auto child = node_->inner()[offset]; 1795| 2.67k| auto child_size = size(offset); 1796| 2.67k| auto is_leaf = shift_ == BL; 1797| 2.67k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 2.67k] ------------------ 1798| 2.67k| : visit_maybe_relaxed_sub( 1799| 2.67k| child, shift_ - B, child_size, v, args...); 1800| 2.67k| } _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.67k|{ 1839| 2.67k| assert(node); ------------------ | Branch (1839:5): [True: 2.67k, False: 0] ------------------ 1840| 2.67k| auto relaxed = node->relaxed(); 1841| 2.67k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.60k, False: 1.07k] ------------------ 1842| 1.60k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.60k, False: 0] ------------------ 1843| 1.60k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.60k| .visit(v, std::forward(args)...); 1845| 1.60k| } else { 1846| 1.07k| return make_regular_sub_pos(node, shift, size) 1847| 1.07k| .visit(v, std::forward(args)...); 1848| 1.07k| } 1849| 2.67k|} _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.60k| { 1814| 1.60k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.60k| } _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.65k| { 1387| 3.65k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 3.65k, False: 0] ------------------ 1388| 3.65k| auto is_leaf = shift_ == BL; 1389| 3.65k| auto child = node_->inner()[idx]; 1390| 3.65k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 2.44k, False: 1.20k] ------------------ 1391| 3.65k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 3.65k| } _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.07k| { 1037| 1.07k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.07k| } _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.9k| { 1794| 23.9k| auto child = node_->inner()[offset]; 1795| 23.9k| auto child_size = size(offset); 1796| 23.9k| auto is_leaf = shift_ == BL; 1797| 23.9k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 8.14k, False: 15.8k] ------------------ 1798| 23.9k| : visit_maybe_relaxed_sub( 1799| 15.8k| child, shift_ - B, child_size, v, args...); 1800| 23.9k| } _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| 629k|{ 1839| 629k| assert(node); ------------------ | Branch (1839:5): [True: 629k, False: 0] ------------------ 1840| 629k| auto relaxed = node->relaxed(); 1841| 629k| if (relaxed) { ------------------ | Branch (1841:9): [True: 609k, False: 19.5k] ------------------ 1842| 609k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 609k, False: 0] ------------------ 1843| 609k| return make_relaxed_pos(node, shift, relaxed) 1844| 609k| .visit(v, std::forward(args)...); 1845| 609k| } else { 1846| 19.5k| return make_regular_sub_pos(node, shift, size) 1847| 19.5k| .visit(v, std::forward(args)...); 1848| 19.5k| } 1849| 629k|} _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| 609k| { 1814| 609k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 609k| } _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| 609k| { 1483| 609k| auto p = node_->inner(); 1484| 609k| auto s = size_t{}; 1485| 609k| auto n = count(); 1486| 609k| if (shift_ == BL) { ------------------ | Branch (1486:13): [True: 291k, False: 318k] ------------------ 1487| 1.27M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1487:39): [True: 981k, False: 291k] ------------------ 1488| 981k| IMMER_PREFETCH(p + i + 1); 1489| 981k| if (!make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) ------------------ | Branch (1489:21): [True: 383, False: 981k] ------------------ 1490| 981k| .visit(v, args...)) 1491| 383| return false; 1492| 981k| s = relaxed_->d.sizes[i]; 1493| 981k| } 1494| 318k| } else { 1495| 318k| auto ss = shift_ - B; 1496| 931k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1496:39): [True: 613k, False: 317k] ------------------ 1497| 613k| if (!visit_maybe_relaxed_sub( ------------------ | Branch (1497:21): [True: 553, False: 613k] ------------------ 1498| 613k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...)) 1499| 553| return false; 1500| 613k| s = relaxed_->d.sizes[i]; 1501| 613k| } 1502| 318k| } 1503| 608k| return true; 1504| 609k| } _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.11k| { 1037| 3.11k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.11k| } _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.43k| { 1784| 1.43k| assert(shift_ > BL); ------------------ | Branch (1784:9): [True: 1.43k, False: 0] ------------------ 1785| 1.43k| auto child = node_->inner()[0]; 1786| 1.43k| auto child_size = relaxed_->d.sizes[0]; 1787| 1.43k| return visit_maybe_relaxed_sub( 1788| 1.43k| child, shift_ - B, child_size, v, args...); 1789| 1.43k| } _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.43k|{ 1839| 1.43k| assert(node); ------------------ | Branch (1839:5): [True: 1.43k, False: 0] ------------------ 1840| 1.43k| auto relaxed = node->relaxed(); 1841| 1.43k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.43k, False: 0] ------------------ 1842| 1.43k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.43k, False: 0] ------------------ 1843| 1.43k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.43k| .visit(v, std::forward(args)...); 1845| 1.43k| } else { 1846| 0| return make_regular_sub_pos(node, shift, size) 1847| 0| .visit(v, std::forward(args)...); 1848| 0| } 1849| 1.43k|} _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.43k| { 1814| 1.43k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.43k| } _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| 5.95k|{ 1839| 5.95k| assert(node); ------------------ | Branch (1839:5): [True: 5.95k, False: 0] ------------------ 1840| 5.95k| auto relaxed = node->relaxed(); 1841| 5.95k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.59k, False: 4.36k] ------------------ 1842| 1.59k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.59k, False: 0] ------------------ 1843| 1.59k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.59k| .visit(v, std::forward(args)...); 1845| 4.36k| } else { 1846| 4.36k| return make_regular_sub_pos(node, shift, size) 1847| 4.36k| .visit(v, std::forward(args)...); 1848| 4.36k| } 1849| 5.95k|} _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.59k| { 1814| 1.59k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.59k| } _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| 4.36k| { 1037| 4.36k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.36k| } _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| 5.95k| { 1037| 5.95k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.95k| } _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.94k| { 145| 6.94k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 6.94k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2Ev: 114| 1.64M| : size{0} 115| 1.64M| , shift{BL} 116| 1.64M| , root{empty_root()} 117| 1.64M| , tail{empty_tail()} 118| 1.64M| { 119| | assert(check_tree()); ------------------ | Branch (119:9): [True: 1.64M, False: 0] ------------------ 120| 1.64M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10empty_rootEv: 61| 1.65M| { 62| 1.65M| static const auto empty_ = [] { 63| 1.65M| constexpr auto size = node_t::sizeof_inner_n(0); 64| 1.65M| static std::aligned_storage_t 65| 1.65M| storage; 66| 1.65M| return node_t::make_inner_n_into(&storage, size, 0u); 67| 1.65M| }(); 68| 1.65M| return empty_->inc(); 69| 1.65M| } _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.64M| { 73| 1.64M| static const auto empty_ = [] { 74| 1.64M| constexpr auto size = node_t::sizeof_leaf_n(0); 75| 1.64M| static std::aligned_storage_t 76| 1.64M| storage; 77| 1.64M| return node_t::make_leaf_n_into(&storage, size, 0u); 78| 1.64M| }(); 79| 1.64M| return empty_->inc(); 80| 1.64M| } _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.26M| { 1373| 3.26M| IMMER_INVALID_STATE_ASSERT(shift <= sizeof(size_t) * 8 - BL); ------------------ | | 32| 3.26M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.26M] | | ------------------ | | 33| 3.26M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1374| 3.26M| IMMER_INVALID_STATE_ASSERT(shift >= BL); ------------------ | | 32| 3.26M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.26M] | | ------------------ | | 33| 3.26M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1375| 3.26M| IMMER_INVALID_STATE_ASSERT(tail_offset() <= size); ------------------ | | 32| 3.26M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.26M] | | ------------------ | | 33| 3.26M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1376| 3.26M| IMMER_INVALID_STATE_ASSERT(tail_size() <= branches); ------------------ | | 32| 3.26M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.26M] | | ------------------ | | 33| 3.26M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1377| |#if IMMER_DEBUG_DEEP_CHECK 1378| | IMMER_INVALID_STATE_ASSERT(check_root()); 1379| | IMMER_INVALID_STATE_ASSERT(check_tail()); 1380| |#endif 1381| 3.26M| return true; 1382| 3.26M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11tail_offsetEv: 197| 16.1M| { 198| 16.1M| auto r = root->relaxed(); 199| 16.1M| assert(r == nullptr || r->d.count); ------------------ | Branch (199:9): [True: 8.17M, False: 7.93M] | Branch (199:9): [True: 7.93M, False: 0] | Branch (199:9): [True: 16.1M, False: 0] ------------------ 200| 16.1M| return r ? r->d.sizes[r->d.count - 1] ------------------ | Branch (200:16): [True: 7.93M, False: 8.17M] ------------------ 201| 16.1M| : size ? (size - 1) & ~mask ------------------ | Branch (201:18): [True: 3.22M, False: 4.94M] ------------------ 202| | /* otherwise */ 203| 8.17M| : 0; 204| 16.1M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9tail_sizeEv: 194| 3.74M| 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.26M| ~rrbtree() { dec(); } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE3decEv: 192| 3.26M| 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.26M| { 209| 3.26M| auto tail_off = tail_offset(); 210| 3.26M| auto tail_size = size - tail_off; 211| | 212| 3.26M| if (tail_off) ------------------ | Branch (212:13): [True: 1.53M, False: 1.72M] ------------------ 213| 1.53M| visit_maybe_relaxed_sub(root, shift, tail_off, v, args...); 214| 1.72M| else 215| 1.72M| make_empty_regular_pos(root).visit(v, args...); 216| | 217| 3.26M| if (tail_size) ------------------ | Branch (217:13): [True: 1.62M, False: 1.64M] ------------------ 218| 1.62M| make_leaf_sub_pos(tail, tail_size).visit(v, args...); 219| 1.64M| else 220| 1.64M| make_empty_leaf_pos(tail).visit(v, args...); 221| 3.26M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9push_backEi: 500| 433k| { 501| 433k| auto ts = tail_size(); 502| 433k| if (ts < branches) { ------------------ | Branch (502:13): [True: 316k, False: 116k] ------------------ 503| 316k| auto new_tail = 504| 316k| node_t::copy_leaf_emplace(tail, ts, std::move(value)); 505| 316k| return {size + 1, shift, root->inc(), new_tail}; 506| 316k| } else { 507| 116k| using std::get; 508| 116k| auto new_tail = node_t::make_leaf_n(1u, std::move(value)); 509| 116k| auto tail_off = tail_offset(); 510| 116k| IMMER_TRY { ------------------ | | 49| 116k|#define IMMER_TRY try ------------------ 511| 116k| auto new_root = 512| 116k| push_tail(root, shift, tail_off, tail, size - tail_off); 513| 116k| tail->inc(); 514| 116k| return {size + 1, get<0>(new_root), get<1>(new_root), new_tail}; 515| 116k| } 516| 116k| IMMER_CATCH (...) { 517| 0| node_t::delete_leaf(new_tail, 1u); 518| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 519| 0| } 520| 116k| } 521| 433k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2EmjPNS1_4nodeIiSA_Lj2ELj2EEESE_: 127| 1.62M| : size{sz} 128| 1.62M| , shift{sh} 129| 1.62M| , root{r} 130| 1.62M| , tail{t} 131| 1.62M| { 132| 1.62M|#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.62M| try { 137| 1.62M| check_tree(); 138| 1.62M| } 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.62M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9push_tailEPNS1_4nodeIiSA_Lj2ELj2EEEjmSE_j: 369| 601k| { 370| 601k| if (auto r = root->relaxed()) { ------------------ | Branch (370:18): [True: 215k, False: 386k] ------------------ 371| 215k| auto new_root = 372| 215k| make_relaxed_pos(root, shift, r) 373| 215k| .visit(push_tail_visitor{}, tail, tail_size); 374| 215k| if (new_root) ------------------ | Branch (374:17): [True: 213k, False: 1.93k] ------------------ 375| 213k| return std::make_tuple(shift, new_root); 376| 1.93k| else { 377| 1.93k| auto new_root = node_t::make_inner_r_n(2); 378| 1.93k| IMMER_TRY { ------------------ | | 49| 1.93k|#define IMMER_TRY try ------------------ 379| 1.93k| auto new_path = node_t::make_path(shift, tail); 380| 1.93k| new_root->inner()[0] = root->inc(); 381| 1.93k| new_root->inner()[1] = new_path; 382| 1.93k| new_root->relaxed()->d.sizes[0] = size; 383| 1.93k| new_root->relaxed()->d.sizes[1] = size + tail_size; 384| 1.93k| assert(size); ------------------ | Branch (384:21): [True: 1.93k, False: 0] ------------------ 385| 1.93k| assert(tail_size); ------------------ | Branch (385:21): [True: 1.93k, False: 0] ------------------ 386| 1.93k| new_root->relaxed()->d.count = 2u; 387| 1.93k| } 388| 1.93k| IMMER_CATCH (...) { 389| 0| node_t::delete_inner_r(new_root, 2); 390| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 391| 0| } 392| 1.93k| return std::make_tuple(shift + B, new_root); 393| 1.93k| } 394| 386k| } else if (size == size_t{branches} << shift) { ------------------ | Branch (394:20): [True: 5.12k, False: 381k] ------------------ 395| 5.12k| auto new_root = node_t::make_inner_n(2); 396| 5.12k| IMMER_TRY { ------------------ | | 49| 5.12k|#define IMMER_TRY try ------------------ 397| 5.12k| auto new_path = node_t::make_path(shift, tail); 398| 5.12k| new_root->inner()[0] = root->inc(); 399| 5.12k| new_root->inner()[1] = new_path; 400| 5.12k| } 401| 5.12k| 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.12k| return std::make_tuple(shift + B, new_root); 406| 381k| } else if (size) { ------------------ | Branch (406:20): [True: 370k, False: 11.0k] ------------------ 407| 370k| auto new_root = make_regular_sub_pos(root, shift, size) 408| 370k| .visit(push_tail_visitor{}, tail); 409| 370k| return std::make_tuple(shift, new_root); 410| 370k| } else { 411| 11.0k| return std::make_tuple(shift, node_t::make_path(shift, tail)); 412| 11.0k| } 413| 601k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2EOSB_: 157| 1.55M| : rrbtree{} 158| 1.55M| { 159| 1.55M| swap(*this, other); 160| 1.55M| } _ZN5immer6detail4rbts4swapERNS1_7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEESC_: 176| 3.62M| { 177| 3.62M| using std::swap; 178| 3.62M| swap(x.size, y.size); 179| 3.62M| swap(x.shift, y.shift); 180| 3.62M| swap(x.root, y.root); 181| 3.62M| swap(x.tail, y.tail); 182| 3.62M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEaSEOSB_: 170| 2.05M| { 171| 2.05M| swap(*this, other); 172| 2.05M| return *this; 173| 2.05M| } 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| 121k| { 581| 121k| auto tail_off = tail_offset(); 582| 121k| if (idx >= tail_off) { ------------------ | Branch (582:13): [True: 37.3k, False: 84.4k] ------------------ 583| 37.3k| auto tail_size = size - tail_off; 584| 37.3k| auto new_tail = 585| 37.3k| make_leaf_sub_pos(tail, tail_size) 586| 37.3k| .visit(update_visitor{}, idx - tail_off, fn); 587| 37.3k| return {size, shift, root->inc(), new_tail}; 588| 84.4k| } else { 589| 84.4k| auto new_root = visit_maybe_relaxed_sub( 590| 84.4k| root, shift, tail_off, update_visitor{}, idx, fn); 591| 84.4k| return {size, shift, new_root, tail->inc()}; 592| 84.4k| } 593| 121k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4takeEm: 647| 24.4k| { 648| 24.4k| auto tail_off = tail_offset(); 649| 24.4k| if (new_size == 0) { ------------------ | Branch (649:13): [True: 3.44k, False: 21.0k] ------------------ 650| 3.44k| return {}; 651| 21.0k| } else if (new_size >= size) { ------------------ | Branch (651:20): [True: 1.50k, False: 19.4k] ------------------ 652| 1.50k| return *this; 653| 19.4k| } else if (new_size > tail_off) { ------------------ | Branch (653:20): [True: 1.57k, False: 17.9k] ------------------ 654| 1.57k| auto new_tail = node_t::copy_leaf(tail, new_size - tail_off); 655| 1.57k| return {new_size, shift, root->inc(), new_tail}; 656| 17.9k| } else { 657| 17.9k| using std::get; 658| 17.9k| auto l = new_size - 1; 659| 17.9k| auto v = slice_right_visitor(); 660| 17.9k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l); 661| 17.9k| auto new_shift = get<0>(r); 662| 17.9k| auto new_root = get<1>(r); 663| 17.9k| auto new_tail = get<3>(r); 664| 17.9k| if (new_root) { ------------------ | Branch (664:17): [True: 13.9k, False: 3.99k] ------------------ 665| 13.9k| IMMER_ASSERT_TAGGED(new_root->compute_shift() == get<0>(r)); ------------------ | | 68| 13.9k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (665:17): [True: 13.9k, False: 0] ------------------ 666| 13.9k| assert(new_root->check(new_shift, new_size - get<2>(r))); ------------------ | Branch (666:17): [True: 13.9k, False: 0] ------------------ 667| 13.9k| return {new_size, new_shift, new_root, new_tail}; 668| 13.9k| } else { 669| 3.99k| return {new_size, BL, empty_root(), new_tail}; 670| 3.99k| } 671| 17.9k| } 672| 24.4k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2ERKSB_: 151| 10.0k| : rrbtree{other.size, other.shift, other.root, other.tail} 152| 10.0k| { 153| 10.0k| inc(); 154| 10.0k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE3incEv: 187| 10.0k| { 188| 10.0k| root->inc(); 189| 10.0k| tail->inc(); 190| 10.0k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4dropEm: 711| 26.0k| { 712| 26.0k| if (elems == 0) { ------------------ | Branch (712:13): [True: 2.35k, False: 23.6k] ------------------ 713| 2.35k| return *this; 714| 23.6k| } else if (elems >= size) { ------------------ | Branch (714:20): [True: 2.24k, False: 21.3k] ------------------ 715| 2.24k| return {}; 716| 21.3k| } else if (elems == tail_offset()) { ------------------ | Branch (716:20): [True: 2.18k, False: 19.2k] ------------------ 717| 2.18k| return {size - elems, BL, empty_root(), tail->inc()}; 718| 19.2k| } else if (elems > tail_offset()) { ------------------ | Branch (718:20): [True: 1.69k, False: 17.5k] ------------------ 719| 1.69k| auto tail_off = tail_offset(); 720| 1.69k| auto new_tail = 721| 1.69k| node_t::copy_leaf(tail, elems - tail_off, size - tail_off); 722| 1.69k| return {size - elems, BL, empty_root(), new_tail}; 723| 17.5k| } else { 724| 17.5k| using std::get; 725| 17.5k| auto v = slice_left_visitor(); 726| 17.5k| auto r = 727| 17.5k| visit_maybe_relaxed_sub(root, shift, tail_offset(), v, elems); 728| 17.5k| auto new_root = get<1>(r); 729| 17.5k| auto new_shift = get<0>(r); 730| 17.5k| return {size - elems, new_shift, new_root, tail->inc()}; 731| 17.5k| } 732| 26.0k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8max_sizeEv: 54| 2.18M| { 55| 2.18M| auto S = sizeof(size_t) * 8; 56| 2.18M| return ((size_t{1} << BL) - std::min(size_t{BL}, size_t{2})) * 57| 2.18M| ipow((size_t{1} << B) - 2, (S - BL) / B); 58| 2.18M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6concatERKSB_: 735| 924k| { 736| 924k| assert(r.size + size <= max_size()); ------------------ | Branch (736:9): [True: 924k, False: 0] ------------------ 737| 924k| using std::get; 738| 924k| if (size == 0) ------------------ | Branch (738:13): [True: 2.31k, False: 921k] ------------------ 739| 2.31k| return r; 740| 921k| else if (r.size == 0) ------------------ | Branch (740:18): [True: 1.85k, False: 920k] ------------------ 741| 1.85k| return *this; 742| 920k| else if (r.tail_offset() == 0) { ------------------ | Branch (742:18): [True: 494k, False: 426k] ------------------ 743| | // just concat the tail, similar to push_back 744| 494k| auto tail_offst = tail_offset(); 745| 494k| auto tail_size = size - tail_offst; 746| 494k| if (tail_size == branches) { ------------------ | Branch (746:17): [True: 138k, False: 355k] ------------------ 747| 138k| auto new_root = 748| 138k| push_tail(root, shift, tail_offst, tail, tail_size); 749| 138k| tail->inc(); 750| 138k| return {size + r.size, 751| 138k| get<0>(new_root), 752| 138k| get<1>(new_root), 753| 138k| r.tail->inc()}; 754| 355k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (754:24): [True: 9.61k, False: 345k] ------------------ 755| 9.61k| auto new_tail = 756| 9.61k| node_t::copy_leaf(tail, tail_size, r.tail, r.size); 757| 9.61k| return {size + r.size, shift, root->inc(), new_tail}; 758| 345k| } else { 759| 345k| auto remaining = branches - tail_size; 760| 345k| auto add_tail = 761| 345k| node_t::copy_leaf(tail, tail_size, r.tail, remaining); 762| 345k| IMMER_TRY { ------------------ | | 49| 345k|#define IMMER_TRY try ------------------ 763| 345k| auto new_tail = 764| 345k| node_t::copy_leaf(r.tail, remaining, r.size); 765| 345k| IMMER_TRY { ------------------ | | 49| 345k|#define IMMER_TRY try ------------------ 766| 345k| auto new_root = push_tail( 767| 345k| root, shift, tail_offst, add_tail, branches); 768| 345k| return {size + r.size, 769| 345k| get<0>(new_root), 770| 345k| get<1>(new_root), 771| 345k| new_tail}; 772| 345k| } 773| 345k| 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| 345k| } 778| 345k| IMMER_CATCH (...) { 779| 0| node_t::delete_leaf(add_tail, branches); 780| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 781| 0| } 782| 345k| } 783| 494k| } else if (tail_offset() == 0) { ------------------ | Branch (783:20): [True: 3.78k, False: 422k] ------------------ 784| 3.78k| auto tail_offst = tail_offset(); 785| 3.78k| auto tail_size = size - tail_offst; 786| 3.78k| auto concated = 787| 3.78k| concat_trees(tail, tail_size, r.root, r.shift, r.tail_offset()); 788| 3.78k| auto new_shift = concated.shift(); 789| 3.78k| auto new_root = concated.node(); 790| 3.78k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 3.78k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (790:13): [True: 3.78k, False: 0] ------------------ 791| 3.78k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (791:13): [True: 3.78k, False: 0] ------------------ 792| 3.78k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 793| 422k| } else { 794| 422k| auto tail_offst = tail_offset(); 795| 422k| auto tail_size = size - tail_offst; 796| 422k| auto concated = concat_trees(root, 797| 422k| shift, 798| 422k| tail_offst, 799| 422k| tail, 800| 422k| tail_size, 801| 422k| r.root, 802| 422k| r.shift, 803| 422k| r.tail_offset()); 804| 422k| auto new_shift = concated.shift(); 805| 422k| auto new_root = concated.node(); 806| 422k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 422k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (806:13): [True: 422k, False: 0] ------------------ 807| 422k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (807:13): [True: 422k, False: 0] ------------------ 808| 422k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 809| 422k| } 810| 924k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13push_back_mutENS9_5applyIS6_E4type4editEi: 478| 32.1k| { 479| 32.1k| auto ts = tail_size(); 480| 32.1k| if (ts < branches) { ------------------ | Branch (480:13): [True: 18.1k, False: 14.0k] ------------------ 481| 18.1k| ensure_mutable_tail(e, ts); 482| 18.1k| new (&tail->leaf()[ts]) T(std::move(value)); 483| 18.1k| } else { 484| 14.0k| using std::get; 485| 14.0k| auto new_tail = node_t::make_leaf_e(e, std::move(value)); 486| 14.0k| auto tail_off = tail_offset(); 487| 14.0k| IMMER_TRY { ------------------ | | 49| 14.0k|#define IMMER_TRY try ------------------ 488| 14.0k| push_tail_mut(e, tail_off, tail, ts); 489| 14.0k| tail = new_tail; 490| 14.0k| } 491| 14.0k| IMMER_CATCH (...) { 492| 0| node_t::delete_leaf(new_tail, 1u); 493| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 494| 0| } 495| 14.0k| } 496| 32.1k| ++size; 497| 32.1k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE19ensure_mutable_tailENS9_5applyIS6_E4type4editEj: 469| 204k| { 470| 204k| if (!tail->can_mutate(e)) { ------------------ | Branch (470:13): [True: 4.42k, False: 199k] ------------------ 471| 4.42k| auto new_tail = node_t::copy_leaf_e(e, tail, n); 472| 4.42k| dec_leaf(tail, n); 473| 4.42k| tail = new_tail; 474| 4.42k| } 475| 204k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13push_tail_mutENS9_5applyIS6_E4type4editEmPNS1_4nodeIiSA_Lj2ELj2EEEj: 417| 218k| { 418| 218k| if (auto r = root->relaxed()) { ------------------ | Branch (418:18): [True: 58.8k, False: 160k] ------------------ 419| 58.8k| auto new_root = 420| 58.8k| make_relaxed_pos(root, shift, r) 421| 58.8k| .visit(push_tail_mut_visitor{}, e, tail, tail_size); 422| 58.8k| if (new_root) { ------------------ | Branch (422:17): [True: 57.6k, False: 1.17k] ------------------ 423| 57.6k| root = new_root; 424| 57.6k| } else { 425| 1.17k| auto new_root = node_t::make_inner_r_e(e); 426| 1.17k| IMMER_TRY { ------------------ | | 49| 1.17k|#define IMMER_TRY try ------------------ 427| 1.17k| auto new_path = node_t::make_path_e(e, shift, tail); 428| 1.17k| new_root->inner()[0] = root; 429| 1.17k| new_root->inner()[1] = new_path; 430| 1.17k| new_root->relaxed()->d.sizes[0] = tail_off; 431| 1.17k| new_root->relaxed()->d.sizes[1] = tail_off + tail_size; 432| 1.17k| assert(tail_off); ------------------ | Branch (432:21): [True: 1.17k, False: 0] ------------------ 433| 1.17k| assert(tail_size); ------------------ | Branch (433:21): [True: 1.17k, False: 0] ------------------ 434| 1.17k| new_root->relaxed()->d.count = 2u; 435| 1.17k| root = new_root; 436| 1.17k| shift += B; 437| 1.17k| } 438| 1.17k| 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.17k| } 443| 160k| } else if (tail_off == size_t{branches} << shift) { ------------------ | Branch (443:20): [True: 2.90k, False: 157k] ------------------ 444| 2.90k| auto new_root = node_t::make_inner_e(e); 445| 2.90k| IMMER_TRY { ------------------ | | 49| 2.90k|#define IMMER_TRY try ------------------ 446| 2.90k| auto new_path = node_t::make_path_e(e, shift, tail); 447| 2.90k| new_root->inner()[0] = root; 448| 2.90k| new_root->inner()[1] = new_path; 449| 2.90k| root = new_root; 450| 2.90k| shift += B; 451| 2.90k| } 452| 2.90k| IMMER_CATCH (...) { 453| 0| node_t::delete_inner_e(new_root); 454| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 455| 0| } 456| 157k| } else if (tail_off) { ------------------ | Branch (456:20): [True: 155k, False: 1.97k] ------------------ 457| 155k| auto new_root = 458| 155k| make_regular_sub_pos(root, shift, tail_off) 459| 155k| .visit(push_tail_mut_visitor{}, e, tail); 460| 155k| root = new_root; 461| 155k| } else { 462| 1.97k| auto new_root = node_t::make_path_e(e, shift, tail); 463| 1.97k| dec_empty_regular(root); 464| 1.97k| root = new_root; 465| 1.97k| } 466| 218k| } 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| 58.0k| { 574| 58.0k| auto& elem = get_mut(e, idx); 575| 58.0k| elem = std::forward(fn)(std::move(elem)); 576| 58.0k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7get_mutENS9_5applyIS6_E4type4editEm: 539| 58.0k| { 540| 58.0k| auto tail_off = tail_offset(); 541| 58.0k| if (idx >= tail_off) { ------------------ | Branch (541:13): [True: 35.2k, False: 22.8k] ------------------ 542| 35.2k| ensure_mutable_tail(e, size - tail_off); 543| 35.2k| return tail->leaf()[(idx - tail_off) & mask]; 544| 35.2k| } else { 545| 22.8k| return visit_maybe_relaxed_sub(root, 546| 22.8k| shift, 547| 22.8k| tail_off, 548| 22.8k| get_mut_visitor{}, 549| 22.8k| idx, 550| 22.8k| e, 551| 22.8k| &root); 552| 22.8k| } 553| 58.0k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8take_mutENS9_5applyIS6_E4type4editEm: 606| 37.6k| { 607| 37.6k| auto tail_off = tail_offset(); 608| 37.6k| if (new_size == 0) { ------------------ | Branch (608:13): [True: 606, False: 37.0k] ------------------ 609| 606| *this = {}; 610| 37.0k| } else if (new_size >= size) { ------------------ | Branch (610:20): [True: 1.23k, False: 35.8k] ------------------ 611| 1.23k| return; 612| 35.8k| } else if (new_size > tail_off) { ------------------ | Branch (612:20): [True: 706, False: 35.0k] ------------------ 613| 706| auto ts = size - tail_off; 614| 706| auto newts = new_size - tail_off; 615| 706| if (tail->can_mutate(e)) { ------------------ | Branch (615:17): [True: 412, False: 294] ------------------ 616| 412| detail::destroy_n(tail->leaf() + newts, ts - newts); 617| 412| } else { 618| 294| auto new_tail = node_t::copy_leaf_e(e, tail, newts); 619| 294| dec_leaf(tail, ts); 620| 294| tail = new_tail; 621| 294| } 622| 706| size = new_size; 623| 706| return; 624| 35.0k| } else { 625| 35.0k| using std::get; 626| 35.0k| auto l = new_size - 1; 627| 35.0k| auto v = slice_right_mut_visitor(); 628| 35.0k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l, e); 629| 35.0k| auto new_shift = get<0>(r); 630| 35.0k| auto new_root = get<1>(r); 631| 35.0k| auto new_tail = get<3>(r); 632| 35.0k| if (new_root) { ------------------ | Branch (632:17): [True: 29.3k, False: 5.78k] ------------------ 633| 29.3k| root = new_root; 634| 29.3k| shift = new_shift; 635| 29.3k| } else { 636| 5.78k| root = empty_root(); 637| 5.78k| shift = BL; 638| 5.78k| } 639| 35.0k| dec_leaf(tail, size - tail_off); 640| 35.0k| size = new_size; 641| 35.0k| tail = new_tail; 642| 35.0k| return; 643| 35.0k| } 644| 37.6k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8drop_mutENS9_5applyIS6_E4type4editEm: 675| 41.1k| { 676| 41.1k| using std::get; 677| 41.1k| auto tail_off = tail_offset(); 678| 41.1k| if (elems == 0) { ------------------ | Branch (678:13): [True: 2.05k, False: 39.1k] ------------------ 679| 2.05k| return; 680| 39.1k| } else if (elems >= size) { ------------------ | Branch (680:20): [True: 263, False: 38.8k] ------------------ 681| 263| *this = {}; 682| 38.8k| } else if (elems == tail_off) { ------------------ | Branch (682:20): [True: 252, False: 38.6k] ------------------ 683| 252| dec_inner(root, shift, tail_off); 684| 252| shift = BL; 685| 252| root = empty_root(); 686| 252| size -= elems; 687| 252| return; 688| 38.6k| } else if (elems > tail_off) { ------------------ | Branch (688:20): [True: 687, False: 37.9k] ------------------ 689| 687| auto v = slice_left_mut_visitor(); 690| 687| tail = get<1>(make_leaf_sub_pos(tail, size - tail_off) 691| 687| .visit(v, elems - tail_off, e)); 692| 687| if (tail_off) { ------------------ | Branch (692:17): [True: 262, False: 425] ------------------ 693| 262| dec_inner(root, shift, tail_off); 694| 262| shift = BL; 695| 262| root = empty_root(); 696| 262| } 697| 687| size -= elems; 698| 687| return; 699| 37.9k| } else { 700| 37.9k| auto v = slice_left_mut_visitor(); 701| 37.9k| auto r = 702| 37.9k| visit_maybe_relaxed_sub(root, shift, tail_off, v, elems, e); 703| 37.9k| shift = get<0>(r); 704| 37.9k| root = get<1>(r); 705| 37.9k| size -= elems; 706| 37.9k| return; 707| 37.9k| } 708| 41.1k| } _ZN5immer6detail4rbts12concat_mut_lERNS1_7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS9_5applyIS6_E4type4editERKSB_: 816| 283k| { 817| 283k| assert(&l != &r); ------------------ | Branch (817:9): [True: 283k, False: 0] ------------------ 818| 283k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (818:9): [True: 283k, False: 0] ------------------ 819| 283k| using std::get; 820| 283k| if (l.size == 0) ------------------ | Branch (820:13): [True: 290, False: 283k] ------------------ 821| 290| l = r; 822| 283k| else if (r.size == 0) ------------------ | Branch (822:18): [True: 321, False: 282k] ------------------ 823| 321| return; 824| 282k| else if (r.tail_offset() == 0) { ------------------ | Branch (824:18): [True: 202k, False: 79.9k] ------------------ 825| | // just concat the tail, similar to push_back 826| 202k| auto tail_offst = l.tail_offset(); 827| 202k| auto tail_size = l.size - tail_offst; 828| 202k| if (tail_size == branches) { ------------------ | Branch (828:17): [True: 55.8k, False: 147k] ------------------ 829| 55.8k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 830| 55.8k| l.tail = r.tail->inc(); 831| 55.8k| l.size += r.size; 832| 55.8k| return; 833| 147k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (833:24): [True: 722, False: 146k] ------------------ 834| 722| l.ensure_mutable_tail(el, tail_size); 835| 722| detail::uninitialized_copy(r.tail->leaf(), 836| 722| r.tail->leaf() + r.size, 837| 722| l.tail->leaf() + tail_size); 838| 722| l.size += r.size; 839| 722| return; 840| 146k| } else { 841| 146k| auto remaining = branches - tail_size; 842| 146k| l.ensure_mutable_tail(el, tail_size); 843| 146k| detail::uninitialized_copy(r.tail->leaf(), 844| 146k| r.tail->leaf() + remaining, 845| 146k| l.tail->leaf() + tail_size); 846| 146k| IMMER_TRY { ------------------ | | 49| 146k|#define IMMER_TRY try ------------------ 847| 146k| auto new_tail = 848| 146k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 849| 146k| IMMER_TRY { ------------------ | | 49| 146k|#define IMMER_TRY try ------------------ 850| 146k| l.push_tail_mut(el, tail_offst, l.tail, branches); 851| 146k| l.tail = new_tail; 852| 146k| l.size += r.size; 853| 146k| return; 854| 146k| } 855| 146k| 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| 146k| } 860| 146k| 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| 146k| } 865| 202k| } else if (l.tail_offset() == 0) { ------------------ | Branch (865:20): [True: 479, False: 79.4k] ------------------ 866| 479| if (supports_transient_concat) { ------------------ | Branch (866:17): [Folded, False: 479] ------------------ 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| 479| } else { 886| 479| auto tail_offst = l.tail_offset(); 887| 479| auto tail_size = l.size - tail_offst; 888| 479| auto concated = concat_trees( 889| 479| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 890| 479| l = {l.size + r.size, 891| 479| concated.shift(), 892| 479| concated.node(), 893| 479| r.tail->inc()}; 894| 479| assert(l.check_tree()); ------------------ | Branch (894:17): [True: 479, False: 0] ------------------ 895| 479| return; 896| 479| } 897| 79.4k| } else { 898| 79.4k| if (supports_transient_concat) { ------------------ | Branch (898:17): [Folded, False: 79.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| 79.4k| } else { 923| 79.4k| auto tail_offst = l.tail_offset(); 924| 79.4k| auto tail_size = l.size - tail_offst; 925| 79.4k| auto concated = concat_trees(l.root, 926| 79.4k| l.shift, 927| 79.4k| tail_offst, 928| 79.4k| l.tail, 929| 79.4k| tail_size, 930| 79.4k| r.root, 931| 79.4k| r.shift, 932| 79.4k| r.tail_offset()); 933| 79.4k| l = {l.size + r.size, 934| 79.4k| concated.shift(), 935| 79.4k| concated.node(), 936| 79.4k| r.tail->inc()}; 937| 79.4k| } 938| 79.4k| } 939| 283k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEaSERKSB_: 163| 1.99k| { 164| 1.99k| auto next{other}; 165| 1.99k| swap(*this, next); 166| 1.99k| return *this; 167| 1.99k| } _ZN5immer6detail4rbts12concat_mut_rERKNS1_7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERSB_NS9_5applyIS6_E4type4editE: 942| 3.59k| { 943| 3.59k| assert(&l != &r); ------------------ | Branch (943:9): [True: 3.59k, False: 0] ------------------ 944| 3.59k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (944:9): [True: 3.59k, False: 0] ------------------ 945| 3.59k| using std::get; 946| 3.59k| if (r.size == 0) ------------------ | Branch (946:13): [True: 353, False: 3.24k] ------------------ 947| 353| r = std::move(l); 948| 3.24k| else if (l.size == 0) ------------------ | Branch (948:18): [True: 245, False: 3.00k] ------------------ 949| 245| return; 950| 3.00k| else if (r.tail_offset() == 0) { ------------------ | Branch (950:18): [True: 944, False: 2.05k] ------------------ 951| | // just concat the tail, similar to push_back 952| 944| auto tail_offst = l.tail_offset(); 953| 944| auto tail_size = l.size - tail_offst; 954| 944| if (tail_size == branches) { ------------------ | Branch (954:17): [True: 240, False: 704] ------------------ 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| 240| auto res = 959| 240| l.push_tail(l.root, l.shift, tail_offst, l.tail, tail_size); 960| 240| l.tail->inc(); // note: leak if mutably concatenated 961| | // with itself, but this is forbidden 962| | // by the interface 963| 240| r = {l.size + r.size, get<0>(res), get<1>(res), r.tail->inc()}; 964| 240| return; 965| 704| } else if (tail_size + r.size <= branches) { ------------------ | Branch (965:24): [True: 323, False: 381] ------------------ 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| 323| auto new_tail = 974| 323| node_t::copy_leaf(l.tail, tail_size, r.tail, r.size); 975| 323| r = {l.size + r.size, l.shift, l.root->inc(), new_tail}; 976| 323| return; 977| 381| } else { 978| | // like the immutable version 979| 381| auto remaining = branches - tail_size; 980| 381| auto add_tail = node_t::copy_leaf_e( 981| 381| er, l.tail, tail_size, r.tail, remaining); 982| 381| IMMER_TRY { ------------------ | | 49| 381|#define IMMER_TRY try ------------------ 983| 381| auto new_tail = 984| 381| node_t::copy_leaf_e(er, r.tail, remaining, r.size); 985| 381| IMMER_TRY { ------------------ | | 49| 381|#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| 381| auto new_root = l.push_tail(l.root, 990| 381| l.shift, 991| 381| tail_offst, 992| 381| add_tail, 993| 381| branches); 994| 381| r = {l.size + r.size, 995| 381| get<0>(new_root), 996| 381| get<1>(new_root), 997| 381| new_tail}; 998| 381| return; 999| 381| } 1000| 381| 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| 381| } 1005| 381| IMMER_CATCH (...) { 1006| 0| node_t::delete_leaf(add_tail, branches); 1007| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1008| 0| } 1009| 381| } 1010| 2.05k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1010:20): [True: 513, False: 1.54k] ------------------ 1011| 513| if (supports_transient_concat) { ------------------ | Branch (1011:17): [Folded, False: 513] ------------------ 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| 513| } else { 1030| 513| auto tail_offst = l.tail_offset(); 1031| 513| auto tail_size = l.size - tail_offst; 1032| 513| auto concated = concat_trees( 1033| 513| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1034| 513| r = {l.size + r.size, 1035| 513| concated.shift(), 1036| 513| concated.node(), 1037| 513| r.tail->inc()}; 1038| 513| return; 1039| 513| } 1040| 1.54k| } else { 1041| 1.54k| if (supports_transient_concat) { ------------------ | Branch (1041:17): [Folded, False: 1.54k] ------------------ 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.54k| } else { 1064| 1.54k| auto tail_offst = l.tail_offset(); 1065| 1.54k| auto tail_size = l.size - tail_offst; 1066| 1.54k| auto concated = concat_trees(l.root, 1067| 1.54k| l.shift, 1068| 1.54k| tail_offst, 1069| 1.54k| l.tail, 1070| 1.54k| tail_size, 1071| 1.54k| r.root, 1072| 1.54k| r.shift, 1073| 1.54k| r.tail_offset()); 1074| 1.54k| r = {l.size + r.size, 1075| 1.54k| concated.shift(), 1076| 1.54k| concated.node(), 1077| 1.54k| r.tail->inc()}; 1078| 1.54k| return; 1079| 1.54k| } 1080| 1.54k| } 1081| 3.59k| } _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.35k, False: 23.1k] ------------------ 1089| 1.35k| l = r; 1090| 23.1k| else if (r.size == 0) ------------------ | Branch (1090:18): [True: 1.78k, False: 21.3k] ------------------ 1091| 1.78k| return; 1092| 21.3k| else if (r.tail_offset() == 0) { ------------------ | Branch (1092:18): [True: 4.91k, False: 16.4k] ------------------ 1093| | // just concat the tail, similar to push_back 1094| 4.91k| auto tail_offst = l.tail_offset(); 1095| 4.91k| auto tail_size = l.size - tail_offst; 1096| 4.91k| if (tail_size == branches) { ------------------ | Branch (1096:17): [True: 993, False: 3.91k] ------------------ 1097| 993| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 1098| 993| l.tail = r.tail->inc(); 1099| 993| l.size += r.size; 1100| 993| return; 1101| 3.91k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (1101:24): [True: 2.03k, False: 1.88k] ------------------ 1102| 2.03k| l.ensure_mutable_tail(el, tail_size); 1103| 2.03k| if (r.tail->can_mutate(er)) ------------------ | Branch (1103:21): [True: 621, False: 1.41k] ------------------ 1104| 621| detail::uninitialized_move(r.tail->leaf(), 1105| 621| r.tail->leaf() + r.size, 1106| 621| l.tail->leaf() + tail_size); 1107| 1.41k| else 1108| 1.41k| detail::uninitialized_copy(r.tail->leaf(), 1109| 1.41k| r.tail->leaf() + r.size, 1110| 1.41k| l.tail->leaf() + tail_size); 1111| 2.03k| l.size += r.size; 1112| 2.03k| return; 1113| 2.03k| } else { 1114| 1.88k| auto remaining = branches - tail_size; 1115| 1.88k| l.ensure_mutable_tail(el, tail_size); 1116| 1.88k| if (r.tail->can_mutate(er)) ------------------ | Branch (1116:21): [True: 603, False: 1.27k] ------------------ 1117| 603| detail::uninitialized_move(r.tail->leaf(), 1118| 603| r.tail->leaf() + remaining, 1119| 603| l.tail->leaf() + tail_size); 1120| 1.27k| else 1121| 1.27k| detail::uninitialized_copy(r.tail->leaf(), 1122| 1.27k| r.tail->leaf() + remaining, 1123| 1.27k| l.tail->leaf() + tail_size); 1124| 1.88k| IMMER_TRY { ------------------ | | 49| 1.88k|#define IMMER_TRY try ------------------ 1125| 1.88k| auto new_tail = 1126| 1.88k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 1127| 1.88k| IMMER_TRY { ------------------ | | 49| 1.88k|#define IMMER_TRY try ------------------ 1128| 1.88k| l.push_tail_mut(el, tail_offst, l.tail, branches); 1129| 1.88k| l.tail = new_tail; 1130| 1.88k| l.size += r.size; 1131| 1.88k| return; 1132| 1.88k| } 1133| 1.88k| 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| 1.88k| } 1138| 1.88k| 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| 1.88k| } 1143| 16.4k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1143:20): [True: 3.37k, False: 13.0k] ------------------ 1144| 3.37k| if (supports_transient_concat) { ------------------ | Branch (1144:17): [Folded, False: 3.37k] ------------------ 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.37k| } else { 1165| 3.37k| auto tail_offst = l.tail_offset(); 1166| 3.37k| auto tail_size = l.size - tail_offst; 1167| 3.37k| auto concated = concat_trees( 1168| 3.37k| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1169| 3.37k| l = {l.size + r.size, 1170| 3.37k| concated.shift(), 1171| 3.37k| concated.node(), 1172| 3.37k| r.tail->inc()}; 1173| 3.37k| return; 1174| 3.37k| } 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| 29.4k| { 316| 29.4k| using iter_t = rrbtree_iterator; 317| 29.4k| if (size != other.size) ------------------ | Branch (317:13): [True: 9.81k, False: 19.6k] ------------------ 318| 9.81k| return false; 319| 19.6k| if (size == 0) ------------------ | Branch (319:13): [True: 216, False: 19.4k] ------------------ 320| 216| return true; 321| 19.4k| auto tail_off = tail_offset(); 322| 19.4k| auto tail_off_other = other.tail_offset(); 323| | // compare trees 324| 19.4k| if (tail_off > 0 && tail_off_other > 0) { ------------------ | Branch (324:13): [True: 18.4k, False: 940] | Branch (324:29): [True: 18.2k, False: 195] ------------------ 325| | // other.shift != shift is a theoretical possibility for 326| | // relaxed trees that sadly we haven't managed to exercise 327| | // in tests yet... 328| 18.2k| if (other.shift >= shift) { ------------------ | Branch (328:17): [True: 17.4k, False: 780] ------------------ 329| 17.4k| if (!visit_maybe_relaxed_sub(other.root, ------------------ | Branch (329:21): [True: 8.23k, False: 9.25k] ------------------ 330| 17.4k| other.shift, 331| 17.4k| tail_off_other, 332| 17.4k| equals_visitor::rrb{}, 333| 17.4k| iter_t{other}, 334| 17.4k| root, 335| 17.4k| shift, 336| 17.4k| tail_off)) 337| 8.23k| return false; 338| 17.4k| } else { 339| 780| if (!visit_maybe_relaxed_sub(root, ------------------ | Branch (339:21): [True: 401, False: 379] ------------------ 340| 780| shift, 341| 780| tail_off, 342| 780| equals_visitor::rrb{}, 343| 780| iter_t{*this}, 344| 780| other.root, 345| 780| other.shift, 346| 780| tail_off_other)) 347| 401| return false; 348| 780| } 349| 18.2k| } 350| 10.7k| return tail_off == tail_off_other ------------------ | Branch (350:16): [True: 6.94k, False: 3.81k] ------------------ 351| 10.7k| ? make_leaf_sub_pos(tail, tail_size()) 352| 6.94k| .visit(equals_visitor{}, other.tail) 353| 10.7k| : tail_off > tail_off_other ------------------ | Branch (353:18): [True: 1.65k, False: 2.16k] ------------------ 354| 3.81k| ? std::equal(tail->leaf(), 355| 1.65k| tail->leaf() + (size - tail_off), 356| 1.65k| other.tail->leaf() + 357| 1.65k| (tail_off - tail_off_other)) 358| | /* otherwise */ 359| 3.81k| : std::equal(tail->leaf(), 360| 2.16k| tail->leaf() + (size - tail_off), 361| 2.16k| iter_t{other} + tail_off); 362| 19.4k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10region_forEm: 524| 1.38M| { 525| 1.38M| using std::get; 526| 1.38M| auto tail_off = tail_offset(); 527| 1.38M| if (idx >= tail_off) { ------------------ | Branch (527:13): [True: 4.02k, False: 1.38M] ------------------ 528| 4.02k| return std::make_tuple(tail->leaf(), tail_off, size); 529| 1.38M| } else { 530| 1.38M| auto subs = visit_maybe_relaxed_sub( 531| 1.38M| root, shift, tail_off, region_for_visitor(), idx); 532| 1.38M| auto first = idx - get<1>(subs); 533| 1.38M| auto end = first + get<2>(subs); 534| 1.38M| return std::make_tuple(get<0>(subs), first, end); 535| 1.38M| } 536| 1.38M| } _ZNK5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11dereferenceEv: 90| 5.51M| { 91| 5.51M| using std::get; 92| 5.51M| if (i_ < get<1>(curr_) || i_ >= get<2>(curr_)) ------------------ | Branch (92:13): [True: 38.1k, False: 5.47M] | Branch (92:35): [True: 1.34M, False: 4.13M] ------------------ 93| 1.38M| curr_ = v_->region_for(i_); 94| 5.51M| return get<0>(curr_)[i_ - get<1>(curr_)]; 95| 5.51M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7advanceEl: 74| 237k| { 75| 237k| using std::get; 76| 237k| assert(n <= 0 || i_ + static_cast(n) <= v_->size); ------------------ | Branch (76:9): [True: 425, False: 237k] | Branch (76:9): [True: 237k, False: 0] | Branch (76:9): [True: 237k, False: 0] ------------------ 77| 237k| assert(n >= 0 || static_cast(-n) <= i_); ------------------ | Branch (77:9): [True: 237k, False: 0] | Branch (77:9): [True: 0, False: 0] | Branch (77:9): [True: 237k, False: 0] ------------------ 78| 237k| i_ += n; 79| 237k| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9incrementEv: 60| 4.15M| { 61| 4.15M| using std::get; 62| 4.15M| assert(i_ < v_->size); ------------------ | Branch (62:9): [True: 4.15M, False: 0] ------------------ 63| 4.15M| ++i_; 64| 4.15M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2ERKNS1_7rrbtreeIiSA_Lj2ELj2EEE: 39| 20.4k| : v_{&v} 40| 20.4k| , i_{0} 41| 20.4k| , curr_{nullptr, ~size_t{}, ~size_t{}} 42| 20.4k| { 43| 20.4k| } _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| 14.5k| { 32| 14.5k| return Deriv::visit_inner(std::forward(args)...); 33| 14.5k| } _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| 40.4k| { 32| 40.4k| return Deriv::visit_inner(std::forward(args)...); 33| 40.4k| } _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.12k| { 38| 2.12k| return Deriv::visit_inner(std::forward(args)...); 39| 2.12k| } _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.60k| { 38| 5.60k| return Deriv::visit_inner(std::forward(args)...); 39| 5.60k| } _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.46k| { 38| 7.46k| return Deriv::visit_inner(std::forward(args)...); 39| 7.46k| } _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.55k| { 38| 1.55k| return Deriv::visit_inner(std::forward(args)...); 39| 1.55k| } _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.14k| { 38| 2.14k| return Deriv::visit_inner(std::forward(args)...); 39| 2.14k| } _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.15k| { 38| 8.15k| return Deriv::visit_inner(std::forward(args)...); 39| 8.15k| } _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.15k| { 44| 8.15k| return Deriv::visit_node(std::forward(args)...); 45| 8.15k| } _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.69k| { 32| 5.69k| return Deriv::visit_inner(std::forward(args)...); 33| 5.69k| } _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.69k| { 44| 5.69k| return Deriv::visit_node(std::forward(args)...); 45| 5.69k| } _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.40M| { 50| 2.40M| return Deriv::visit_node(std::forward(args)...); 51| 2.40M| } _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| 20.6M| { 32| 20.6M| return Deriv::visit_inner(std::forward(args)...); 33| 20.6M| } _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| 20.6M| { 44| 20.6M| return Deriv::visit_node(std::forward(args)...); 45| 20.6M| } _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| 20.6M| { 32| 20.6M| return Deriv::visit_inner(std::forward(args)...); 33| 20.6M| } _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| 18.4k| { 32| 18.4k| return Deriv::visit_inner(std::forward(args)...); 33| 18.4k| } _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| 398| { 38| 398| return Deriv::visit_inner(std::forward(args)...); 39| 398| } _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.03k| { 38| 1.03k| return Deriv::visit_inner(std::forward(args)...); 39| 1.03k| } _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.07M| { 50| 1.07M| return Deriv::visit_node(std::forward(args)...); 51| 1.07M| } _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| 715k| { 38| 715k| return Deriv::visit_inner(std::forward(args)...); 39| 715k| } _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| 715k| { 44| 715k| return Deriv::visit_node(std::forward(args)...); 45| 715k| } _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| 715k| { 38| 715k| return Deriv::visit_inner(std::forward(args)...); 39| 715k| } _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| 691k| { 38| 691k| return Deriv::visit_inner(std::forward(args)...); 39| 691k| } _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| 691k| { 44| 691k| return Deriv::visit_node(std::forward(args)...); 45| 691k| } _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| 691k| { 38| 691k| return Deriv::visit_inner(std::forward(args)...); 39| 691k| } _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.46k| { 38| 2.46k| return Deriv::visit_inner(std::forward(args)...); 39| 2.46k| } _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.46k| { 44| 2.46k| return Deriv::visit_node(std::forward(args)...); 45| 2.46k| } _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| 501k| { 32| 501k| return Deriv::visit_inner(std::forward(args)...); 33| 501k| } _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| 501k| { 44| 501k| return Deriv::visit_node(std::forward(args)...); 45| 501k| } _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| 485k| { 32| 485k| return Deriv::visit_inner(std::forward(args)...); 33| 485k| } _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| 485k| { 44| 485k| return Deriv::visit_node(std::forward(args)...); 45| 485k| } _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.22M| { 32| 2.22M| return Deriv::visit_inner(std::forward(args)...); 33| 2.22M| } _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| 4.65k| { 38| 4.65k| return Deriv::visit_inner(std::forward(args)...); 39| 4.65k| } _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| 659k| { 32| 659k| return Deriv::visit_inner(std::forward(args)...); 33| 659k| } _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| 122k| { 38| 122k| return Deriv::visit_inner(std::forward(args)...); 39| 122k| } _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.13k| { 38| 1.13k| return Deriv::visit_inner(std::forward(args)...); 39| 1.13k| } _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| 123k| { 38| 123k| return Deriv::visit_inner(std::forward(args)...); 39| 123k| } _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| 63.9k| { 38| 63.9k| return Deriv::visit_inner(std::forward(args)...); 39| 63.9k| } _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| 58.2k| { 38| 58.2k| return Deriv::visit_inner(std::forward(args)...); 39| 58.2k| } _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| 771k| { 38| 771k| return Deriv::visit_inner(std::forward(args)...); 39| 771k| } _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.82M| { 32| 1.82M| return Deriv::visit_inner(std::forward(args)...); 33| 1.82M| } _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| 759| { 38| 759| return Deriv::visit_inner(std::forward(args)...); 39| 759| } _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| 70.1k| { 32| 70.1k| return Deriv::visit_inner(std::forward(args)...); 33| 70.1k| } _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| 2.87k| { 38| 2.87k| return Deriv::visit_inner(std::forward(args)...); 39| 2.87k| } _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| 1.14k| { 32| 1.14k| return Deriv::visit_inner(std::forward(args)...); 33| 1.14k| } _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| 586| { 32| 586| return Deriv::visit_inner(std::forward(args)...); 33| 586| } _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.73M| { 32| 1.73M| return Deriv::visit_inner(std::forward(args)...); 33| 1.73M| } _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| 16.3k| { 38| 16.3k| return Deriv::visit_inner(std::forward(args)...); 39| 16.3k| } _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| 16.3k| { 44| 16.3k| return Deriv::visit_node(std::forward(args)...); 45| 16.3k| } _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.4k| { 38| 14.4k| return Deriv::visit_inner(std::forward(args)...); 39| 14.4k| } _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.4k| { 44| 14.4k| return Deriv::visit_node(std::forward(args)...); 45| 14.4k| } _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.92k| { 32| 6.92k| return Deriv::visit_inner(std::forward(args)...); 33| 6.92k| } _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.92k| { 44| 6.92k| return Deriv::visit_node(std::forward(args)...); 45| 6.92k| } _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.55k| { 38| 7.55k| return Deriv::visit_inner(std::forward(args)...); 39| 7.55k| } _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.55k| { 44| 7.55k| return Deriv::visit_node(std::forward(args)...); 45| 7.55k| } _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| 12.3k| { 32| 12.3k| return Deriv::visit_inner(std::forward(args)...); 33| 12.3k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE11visit_innerIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERKPSH_RKjRmEEEDcDpOT_: 43| 12.3k| { 44| 12.3k| return Deriv::visit_node(std::forward(args)...); 45| 12.3k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERjSJ_RNS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERmEEEDcDpOT_: 31| 22.0k| { 32| 22.0k| return Deriv::visit_inner(std::forward(args)...); 33| 22.0k| } _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.28k| { 32| 2.28k| return Deriv::visit_inner(std::forward(args)...); 33| 2.28k| } _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| 868| { 32| 868| return Deriv::visit_inner(std::forward(args)...); 33| 868| } _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.10k| { 38| 1.10k| return Deriv::visit_inner(std::forward(args)...); 39| 1.10k| } _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.38M| { 32| 9.38M| return Deriv::visit_inner(std::forward(args)...); 33| 9.38M| } _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| 372k| { 38| 372k| return Deriv::visit_inner(std::forward(args)...); 39| 372k| } _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.04M| { 38| 1.04M| return Deriv::visit_inner(std::forward(args)...); 39| 1.04M| } _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| 109k| { 38| 109k| return Deriv::visit_inner(std::forward(args)...); 39| 109k| } _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| 93.7k| { 38| 93.7k| return Deriv::visit_inner(std::forward(args)...); 39| 93.7k| } _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| 740| { 38| 740| return Deriv::visit_inner(std::forward(args)...); 39| 740| } _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.8k| { 38| 20.8k| return Deriv::visit_inner(std::forward(args)...); 39| 20.8k| } _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| 5.79k| { 38| 5.79k| return Deriv::visit_inner(std::forward(args)...); 39| 5.79k| } _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.57k| { 38| 2.57k| return Deriv::visit_inner(std::forward(args)...); 39| 2.57k| } _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.67k| { 38| 2.67k| return Deriv::visit_inner(std::forward(args)...); 39| 2.67k| } _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| 609k| { 32| 609k| return Deriv::visit_inner(std::forward(args)...); 33| 609k| } _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.43k| { 32| 1.43k| return Deriv::visit_inner(std::forward(args)...); 33| 1.43k| } _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.43k| { 44| 1.43k| return Deriv::visit_node(std::forward(args)...); 45| 1.43k| } _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| 5.95k| { 38| 5.95k| return Deriv::visit_inner(std::forward(args)...); 39| 5.95k| } _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| 5.95k| { 44| 5.95k| return Deriv::visit_node(std::forward(args)...); 45| 5.95k| } _ZN5immer6detail15auto_const_castINS_15refcount_policyEEERT_RKS3_: 143| 118M|{ 144| 118M| return const_cast(x); 145| 118M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7inner_tEPSC_Lb0EE15get_storage_ptrEv: 113| 112M| { 114| 112M| check_base(); 115| 112M| auto* base = static_cast(this); 116| 112M| return reinterpret_cast(base + 1); 117| 112M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7inner_tEPSC_Lb0EE10check_baseEv: 134| 112M| { 135| 112M| static_assert(std::is_standard_layout::value && 136| 112M| !std::is_empty::value, 137| 112M| "Please add 'true' if the derived class is emtpy"); 138| 112M| } _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| 11.8M|{ 330| 11.8M| std::forward(f)(empty_t{}); 331| 11.8M|} _ZN5immer6detail9destroy_nIPijEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 1.57M|{ 189| 1.57M| return first + n; 190| 1.57M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6leaf_tEiLb1EE15get_storage_ptrEv: 75| 11.0M| { 76| 11.0M| check_base(); 77| 11.0M| return reinterpret_cast(this); 78| 11.0M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6leaf_tEiLb1EE10check_baseEv: 94| 11.0M| { 95| | // is_standard_layout requires that only one class in the hierarchy 96| | // contains non-static data members. Since this class contains one 97| | // member, the static_assert will only hold when the derived class is 98| | // empty. 99| 11.0M| static_assert(std::is_standard_layout::value, 100| 11.0M| "Please remove 'true' if the derived class is non emtpy"); 101| 11.0M| } _ZN5immer6detail18uninitialized_copyIPiS2_S2_EENSt3__19enable_ifIX18can_trivially_copyIT_T1_EES6_E4typeES5_T0_S6_: 236| 1.99M|{ 237| 1.99M| return std::copy(first, last, out); 238| 1.99M|} _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| 314k|{ 345| 314k| return std::forward(f2)(empty_t{}); 346| 314k|} _ZN5immer6detail4ipowImEET_S2_j: 323| 70.0M|{ 324| 70.0M| return pow == 0 ? 1 : num * ipow(num, pow - 1); ------------------ | Branch (324:12): [True: 2.18M, False: 67.8M] ------------------ 325| 70.0M|} _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| 83.0k|{ 345| 83.0k| return std::forward(f2)(empty_t{}); 346| 83.0k|} _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| 119k|{ 330| 119k| std::forward(f)(empty_t{}); 331| 119k|} _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| 9.75k|{ 345| 9.75k| return std::forward(f2)(empty_t{}); 346| 9.75k|} _ZN5immer6detail9destroy_nIPimEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 412|{ 189| 412| return first + n; 190| 412|} _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| 144k|{ 345| 144k| return std::forward(f2)(empty_t{}); 346| 144k|} _ZN5immer6detail18uninitialized_moveIPiS2_EENSt3__19enable_ifIX18can_trivially_copyIT_T0_EES6_E4typeES5_S5_S6_: 210| 1.22k|{ 211| 1.22k| return std::copy(first, last, out); 212| 1.22k|} _ZN5immer6detail8as_constIiEEPKT_PS2_: 29| 1.35M|{ 30| 1.35M| return x; 31| 1.35M|} _ZN5immer6detail4makeINS_15debug_size_heapINS_8cpp_heapEEENS_3boxIiNS_13memory_policyINS_21free_list_heap_policyIS3_Lm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderEJiEEEPT0_DpOT1_: 260| 19.2k|{ 261| 19.2k| auto ptr = Heap::allocate(sizeof(T)); 262| 19.2k| IMMER_TRY { ------------------ | | 49| 19.2k|#define IMMER_TRY try ------------------ 263| 19.2k| return new (ptr) T(std::forward(args)...); 264| 19.2k| } 265| 19.2k| IMMER_CATCH (...) { 266| 0| Heap::deallocate(sizeof(T), ptr); 267| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 268| 0| } 269| 19.2k|} _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2Ev: 96| 75.6k| flex_vector() = default; _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9push_backEi: 246| 433k| { 247| 433k| return impl_.push_back(std::move(value)); 248| 433k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2ENS_6detail4rbts7rrbtreeIiS8_Lj2ELj2EEE: 536| 1.52M| : impl_(std::move(impl)) 537| 1.52M| { 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.52M| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4sizeEv: 181| 2.95M| 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| 121k| { 324| 121k| return impl_.update(index, std::forward(fn)); 325| 121k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4takeEm: 350| 24.4k| { 351| 24.4k| return impl_.take(elems); 352| 24.4k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4dropEm: 376| 26.0k| { 377| 26.0k| return impl_.drop(elems); 378| 26.0k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8max_sizeEv: 90| 1.26M| 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| 924k| { 404| 924k| return l.impl_.concat(r.impl_); 405| 924k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9push_backEi: 251| 32.1k| { 252| 32.1k| return push_back_move(move_t{}, std::move(value)); 253| 32.1k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14push_back_moveENSt3__117integral_constantIbLb1EEEi: 547| 32.1k| { 548| 32.1k| impl_.push_back_mut({}, std::move(value)); 549| 32.1k| return std::move(*this); 550| 32.1k| } 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| 58.0k| { 330| 58.0k| return update_move(move_t{}, index, std::forward(fn)); 331| 58.0k| } 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| 58.0k| { 569| 58.0k| impl_.update_mut({}, index, std::forward(fn)); 570| 58.0k| return std::move(*this); 571| 58.0k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4takeEm: 355| 37.6k| { 356| 37.6k| return take_move(move_t{}, elems); 357| 37.6k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9take_moveENSt3__117integral_constantIbLb1EEEm: 579| 37.6k| { 580| 37.6k| impl_.take_mut({}, elems); 581| 37.6k| return std::move(*this); 582| 37.6k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4dropEm: 381| 41.1k| { 382| 41.1k| return drop_move(move_t{}, elems); 383| 41.1k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9drop_moveENSt3__117integral_constantIbLb1EEEm: 589| 41.1k| { 590| 41.1k| impl_.drop_mut({}, elems); 591| 41.1k| return std::move(*this); 592| 41.1k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERKS9_: 409| 283k| { 410| 283k| return concat_move(move_t{}, std::move(l), r); 411| 283k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_RKS9_: 600| 283k| { 601| 283k| concat_mut_l(l.impl_, {}, r.impl_); 602| 283k| return std::move(l); 603| 283k| } _ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEOS9_: 415| 3.59k| { 416| 3.59k| return concat_move(move_t{}, l, std::move(r)); 417| 3.59k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11concat_moveENSt3__117integral_constantIbLb1EEERKS9_OS9_: 606| 3.59k| { 607| 3.59k| concat_mut_r(l.impl_, r.impl_, {}); 608| 3.59k| return std::move(r); 609| 3.59k| } _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| 29.4k| { 223| 29.4k| return impl_.equals(other.impl_); 224| 29.4k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5eraseEm: 480| 3.56k| { 481| 3.56k| return take(pos) + drop(pos + 1); 482| 3.56k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6insertEmi: 442| 19.2k| { 443| 19.2k| return take(pos).push_back(std::move(value)) + drop(pos); 444| 19.2k| } _ZN5immer8cpp_heap10deallocateEmPv: 36| 10.4M| static void deallocate(std::size_t, void* data) { ::operator delete(data); } _ZN5immer8cpp_heap8allocateIJEEEPvmDpT_: 27| 10.4M| { 28| 10.4M| return ::operator new(size); 29| 10.4M| } _ZN5immer15debug_size_heapINS_8cpp_heapEE10deallocateIJEEEvmPvDpT_: 57| 10.4M| { 58| 10.4M| auto p = (std::size_t*) (((char*) data) - extra_size); 59| 10.4M| assert(*p == size); ------------------ | Branch (59:9): [True: 10.4M, False: 0] ------------------ 60| 10.4M| Base::deallocate(size + extra_size, p, tags...); 61| 10.4M| } _ZN5immer15debug_size_heapINS_8cpp_heapEE8allocateIJEEEPvmDpT_: 49| 10.4M| { 50| 10.4M| auto p = (std::size_t*) Base::allocate(size + extra_size, tags...); 51| 10.4M| new (p) std::size_t{size}; 52| 10.4M| return ((char*) p) + extra_size; 53| 10.4M| } _ZN5immer14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEE10deallocateIJEEEvmPvDpT_: 56| 11.0M| { 57| 11.0M| assert(size <= Size); ------------------ | Branch (57:9): [True: 11.0M, 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.0M| if (head().count.load(std::memory_order_relaxed) >= Limit) { ------------------ | Branch (61:13): [True: 10.4M, False: 626k] ------------------ 62| 10.4M| base_t::deallocate(Size, data); 63| 10.4M| } else { 64| 626k| auto n = static_cast(data); 65| 626k| do { 66| 626k| n->next = head().data; 67| 626k| } while (!head().data.compare_exchange_weak(n->next, n)); ------------------ | Branch (67:22): [True: 0, False: 626k] ------------------ 68| 626k| head().count.fetch_add(1u, std::memory_order_relaxed); 69| 626k| } 70| 11.0M| } _ZN5immer14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEE4headEv: 80| 25.2M| { 81| 25.2M| static head_t head_{{nullptr}, {0}}; 82| 25.2M| return head_; 83| 25.2M| } _ZN5immer14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEE8allocateIJEEEPvmDpT_: 39| 11.0M| { 40| 11.0M| assert(size <= Size); ------------------ | Branch (40:9): [True: 11.0M, False: 0] ------------------ 41| | 42| 11.0M| node_t* n; 43| 11.0M| do { 44| 11.0M| n = head().data; 45| 11.0M| if (!n) { ------------------ | Branch (45:17): [True: 10.4M, False: 625k] ------------------ 46| 10.4M| auto p = base_t::allocate(Size); 47| 10.4M| return p; 48| 10.4M| } 49| 11.0M| } while (!head().data.compare_exchange_weak(n, n->next)); ------------------ | Branch (49:18): [True: 0, False: 625k] ------------------ 50| 625k| head().count.fetch_sub(1u, std::memory_order_relaxed); 51| 625k| return n; 52| 11.0M| } _ZN5immer10split_heapILm56ENS_27thread_local_free_list_heapILm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEEES5_E10deallocateIJEEEvmPvDpT_: 33| 28.2M| { 34| 28.2M| if (size <= Size) ------------------ | Branch (34:13): [True: 28.2M, False: 0] ------------------ 35| 28.2M| SmallHeap::deallocate(size, data, tags...); 36| 0| else 37| 0| BigHeap::deallocate(size, data, tags...); 38| 28.2M| } _ZN5immer10split_heapILm56ENS_27thread_local_free_list_heapILm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEEES5_E8allocateIJEEEPvmDpT_: 26| 16.7M| { 27| 16.7M| return size <= Size ? SmallHeap::allocate(size, tags...) ------------------ | Branch (27:16): [True: 16.7M, False: 0] ------------------ 28| 16.7M| : BigHeap::allocate(size, tags...); 29| 16.7M| } _ZN5immer10split_heapILm56ENS_27thread_local_free_list_heapILm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEEES5_E8allocateIJNS_10norefs_tagEEEEPvmDpT_: 26| 11.4M| { 27| 11.4M| return size <= Size ? SmallHeap::allocate(size, tags...) ------------------ | Branch (27:16): [True: 11.4M, False: 0] ------------------ 28| 11.4M| : BigHeap::allocate(size, tags...); 29| 11.4M| } _ZN5immer6detail30thread_local_free_list_storageINS0_26unsafe_free_list_heap_implIS1_Lm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEEEE4headEv: 35| 142M| { 36| 142M| thread_local static head_t head_{nullptr, 0}; 37| 142M| return head_; 38| 142M| } _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| 28.2M| { 73| 28.2M| assert(size <= Size); ------------------ | Branch (73:9): [True: 28.2M, False: 0] ------------------ 74| | 75| 28.2M| if (storage::head().count >= Limit) ------------------ | Branch (75:13): [True: 11.0M, False: 17.1M] ------------------ 76| 11.0M| base_t::deallocate(Size, data); 77| 17.1M| else { 78| 17.1M| auto n = static_cast(data); 79| 17.1M| n->next = storage::head().data; 80| 17.1M| storage::head().data = n; 81| 17.1M| ++storage::head().count; 82| 17.1M| } 83| 28.2M| } _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| 16.7M| { 58| 16.7M| assert(size <= Size); ------------------ | Branch (58:9): [True: 16.7M, False: 0] ------------------ 59| | 60| 16.7M| auto n = storage::head().data; 61| 16.7M| if (!n) { ------------------ | Branch (61:13): [True: 5.69M, False: 11.0M] ------------------ 62| 5.69M| auto p = base_t::allocate(Size); 63| 5.69M| return p; 64| 5.69M| } 65| 11.0M| --storage::head().count; 66| 11.0M| storage::head().data = n->next; 67| 11.0M| return n; 68| 16.7M| } _ZN5immer6detail26unsafe_free_list_heap_implINS0_30thread_local_free_list_storageELm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEE8allocateIJNS_10norefs_tagEEEEPvmDpT_: 57| 11.4M| { 58| 11.4M| assert(size <= Size); ------------------ | Branch (58:9): [True: 11.4M, False: 0] ------------------ 59| | 60| 11.4M| auto n = storage::head().data; 61| 11.4M| if (!n) { ------------------ | Branch (61:13): [True: 5.36M, False: 6.12M] ------------------ 62| 5.36M| auto p = base_t::allocate(Size); 63| 5.36M| return p; 64| 5.36M| } 65| 6.12M| --storage::head().count; 66| 6.12M| storage::head().data = n->next; 67| 6.12M| return n; 68| 11.4M| } _ZN5immer15refcount_policyC2Ev: 28| 28.2M| : refcount{1} {}; _ZN5immer15refcount_policy3incEv: 34| 44.2M| void inc() { refcount.fetch_add(1, std::memory_order_relaxed); } _ZN5immer15refcount_policy3decEv: 36| 72.4M| bool dec() { return 1 == refcount.fetch_sub(1, std::memory_order_acq_rel); } _ZN5immer15refcount_policy6uniqueEv: 38| 2.07M| bool unique() { return refcount == 1; } _ZNK5immer20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5ownee5ownedEv: 36| 28.2M| bool owned() const { return false; } _ZNK5immer20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5ownee10can_mutateENS6_4editE: 35| 117k| bool can_mutate(edit) const { return false; } _ZN5immer20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeaSENS6_4editE: 34| 596k| ownee& operator=(edit) { return *this; };