LLVMFuzzerTestOneInput: 18| 9.00k|{ 19| 9.00k| constexpr auto var_count = 8; 20| 9.00k| constexpr auto bits = 2; 21| | 22| 9.00k| using vector_t = 23| 9.00k| immer::flex_vector; 24| 9.00k| using size_t = std::uint8_t; 25| | 26| 9.00k| auto vars = std::array{}; 27| | 28| 9.00k| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; 29| 9.00k| auto is_valid_var_neq = [](auto other) { 30| 9.00k| return [=](auto idx) { 31| 9.00k| return idx >= 0 && idx < var_count && idx != other; 32| 9.00k| }; 33| 9.00k| }; 34| 9.00k| auto is_valid_index = [](auto& v) { 35| 9.00k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 36| 9.00k| }; 37| 9.00k| auto is_valid_size = [](auto& v) { 38| 9.00k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 39| 9.00k| }; 40| 9.00k| auto can_concat = [](auto&& v1, auto&& v2) { 41| 9.00k| return v1.size() + v2.size() < vector_t::max_size(); 42| 9.00k| }; 43| 9.00k| auto can_compare = [](auto&& v) { 44| | // avoid comparing vectors that are too big, and hence, slow to compare 45| 9.00k| return v.size() < (1 << 15); 46| 9.00k| }; 47| 9.00k| return fuzzer_input{data, size}.run([&](auto& in) { 48| 9.00k| enum ops 49| 9.00k| { 50| 9.00k| op_push_back, 51| 9.00k| op_update, 52| 9.00k| op_take, 53| 9.00k| op_drop, 54| 9.00k| op_concat, 55| 9.00k| op_push_back_move, 56| 9.00k| op_update_move, 57| 9.00k| op_take_move, 58| 9.00k| op_drop_move, 59| 9.00k| op_concat_move_l, 60| 9.00k| op_concat_move_r, 61| 9.00k| op_concat_move_lr, 62| 9.00k| op_insert, 63| 9.00k| op_erase, 64| 9.00k| op_compare, 65| 9.00k| }; 66| 9.00k| auto src = read(in, is_valid_var); 67| 9.00k| auto dst = read(in, is_valid_var); 68| 9.00k| switch (read(in)) { 69| 9.00k| case op_push_back: { 70| 9.00k| vars[dst] = vars[src].push_back(42); 71| 9.00k| break; 72| 9.00k| } 73| 9.00k| case op_update: { 74| 9.00k| auto idx = read(in, is_valid_index(vars[src])); 75| 9.00k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 76| 9.00k| break; 77| 9.00k| } 78| 9.00k| case op_take: { 79| 9.00k| auto idx = read(in, is_valid_size(vars[src])); 80| 9.00k| vars[dst] = vars[src].take(idx); 81| 9.00k| break; 82| 9.00k| } 83| 9.00k| case op_drop: { 84| 9.00k| auto idx = read(in, is_valid_size(vars[src])); 85| 9.00k| vars[dst] = vars[src].drop(idx); 86| 9.00k| break; 87| 9.00k| } 88| 9.00k| case op_concat: { 89| 9.00k| auto src2 = read(in, is_valid_var); 90| 9.00k| if (can_concat(vars[src], vars[src2])) 91| 9.00k| vars[dst] = vars[src] + vars[src2]; 92| 9.00k| break; 93| 9.00k| } 94| 9.00k| case op_push_back_move: { 95| 9.00k| vars[dst] = std::move(vars[src]).push_back(21); 96| 9.00k| break; 97| 9.00k| } 98| 9.00k| case op_update_move: { 99| 9.00k| auto idx = read(in, is_valid_index(vars[src])); 100| 9.00k| vars[dst] = 101| 9.00k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 102| 9.00k| break; 103| 9.00k| } 104| 9.00k| case op_take_move: { 105| 9.00k| auto idx = read(in, is_valid_size(vars[src])); 106| 9.00k| vars[dst] = std::move(vars[src]).take(idx); 107| 9.00k| break; 108| 9.00k| } 109| 9.00k| case op_drop_move: { 110| 9.00k| auto idx = read(in, is_valid_size(vars[src])); 111| 9.00k| vars[dst] = std::move(vars[src]).drop(idx); 112| 9.00k| break; 113| 9.00k| } 114| 9.00k| case op_concat_move_l: { 115| 9.00k| auto src2 = read(in, is_valid_var_neq(src)); 116| 9.00k| if (can_concat(vars[src], vars[src2])) 117| 9.00k| vars[dst] = std::move(vars[src]) + vars[src2]; 118| 9.00k| break; 119| 9.00k| } 120| 9.00k| case op_concat_move_r: { 121| 9.00k| auto src2 = read(in, is_valid_var_neq(src)); 122| 9.00k| if (can_concat(vars[src], vars[src2])) 123| 9.00k| vars[dst] = vars[src] + std::move(vars[src2]); 124| 9.00k| break; 125| 9.00k| } 126| 9.00k| case op_concat_move_lr: { 127| 9.00k| auto src2 = read(in, is_valid_var_neq(src)); 128| 9.00k| if (can_concat(vars[src], vars[src2])) 129| 9.00k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 130| 9.00k| break; 131| 9.00k| } 132| 9.00k| case op_compare: { 133| 9.00k| using std::swap; 134| 9.00k| if (can_compare(vars[src]) && vars[src] == vars[dst]) 135| 9.00k| swap(vars[src], vars[dst]); 136| 9.00k| break; 137| 9.00k| } 138| 9.00k| case op_erase: { 139| 9.00k| auto idx = read(in, is_valid_index(vars[src])); 140| 9.00k| vars[dst] = vars[src].erase(idx); 141| 9.00k| break; 142| 9.00k| } 143| 9.00k| case op_insert: { 144| 9.00k| auto idx = read(in, is_valid_size(vars[src])); 145| 9.00k| vars[dst] = vars[src].insert(idx, immer::box{42}); 146| 9.00k| break; 147| 9.00k| } 148| 9.00k| default: 149| 9.00k| break; 150| 9.00k| }; 151| 9.00k| return true; 152| 9.00k| }); 153| 9.00k|} flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_: 47| 2.04M| return fuzzer_input{data, size}.run([&](auto& in) { 48| 2.04M| enum ops 49| 2.04M| { 50| 2.04M| op_push_back, 51| 2.04M| op_update, 52| 2.04M| op_take, 53| 2.04M| op_drop, 54| 2.04M| op_concat, 55| 2.04M| op_push_back_move, 56| 2.04M| op_update_move, 57| 2.04M| op_take_move, 58| 2.04M| op_drop_move, 59| 2.04M| op_concat_move_l, 60| 2.04M| op_concat_move_r, 61| 2.04M| op_concat_move_lr, 62| 2.04M| op_insert, 63| 2.04M| op_erase, 64| 2.04M| op_compare, 65| 2.04M| }; 66| 2.04M| auto src = read(in, is_valid_var); 67| 2.04M| auto dst = read(in, is_valid_var); 68| 2.04M| switch (read(in)) { 69| 442k| case op_push_back: { ------------------ | Branch (69:9): [True: 442k, False: 1.60M] ------------------ 70| 442k| vars[dst] = vars[src].push_back(42); 71| 442k| break; 72| 0| } 73| 123k| case op_update: { ------------------ | Branch (73:9): [True: 123k, False: 1.92M] ------------------ 74| 123k| auto idx = read(in, is_valid_index(vars[src])); 75| 123k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 76| 123k| break; 77| 0| } 78| 1.36k| case op_take: { ------------------ | Branch (78:9): [True: 1.36k, False: 2.04M] ------------------ 79| 1.36k| auto idx = read(in, is_valid_size(vars[src])); 80| 1.36k| vars[dst] = vars[src].take(idx); 81| 1.36k| break; 82| 0| } 83| 3.10k| case op_drop: { ------------------ | Branch (83:9): [True: 3.10k, False: 2.04M] ------------------ 84| 3.10k| auto idx = read(in, is_valid_size(vars[src])); 85| 3.10k| vars[dst] = vars[src].drop(idx); 86| 3.10k| break; 87| 0| } 88| 965k| case op_concat: { ------------------ | Branch (88:9): [True: 965k, False: 1.07M] ------------------ 89| 965k| auto src2 = read(in, is_valid_var); 90| 965k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (90:17): [True: 905k, False: 59.4k] ------------------ 91| 905k| vars[dst] = vars[src] + vars[src2]; 92| 965k| break; 93| 0| } 94| 13.0k| case op_push_back_move: { ------------------ | Branch (94:9): [True: 13.0k, False: 2.03M] ------------------ 95| 13.0k| vars[dst] = std::move(vars[src]).push_back(21); 96| 13.0k| break; 97| 0| } 98| 41.4k| case op_update_move: { ------------------ | Branch (98:9): [True: 41.4k, False: 2.00M] ------------------ 99| 41.4k| auto idx = read(in, is_valid_index(vars[src])); 100| 41.4k| vars[dst] = 101| 41.4k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 102| 41.4k| break; 103| 0| } 104| 39.2k| case op_take_move: { ------------------ | Branch (104:9): [True: 39.2k, False: 2.00M] ------------------ 105| 39.2k| auto idx = read(in, is_valid_size(vars[src])); 106| 39.2k| vars[dst] = std::move(vars[src]).take(idx); 107| 39.2k| break; 108| 0| } 109| 44.2k| case op_drop_move: { ------------------ | Branch (109:9): [True: 44.2k, False: 1.99M] ------------------ 110| 44.2k| auto idx = read(in, is_valid_size(vars[src])); 111| 44.2k| vars[dst] = std::move(vars[src]).drop(idx); 112| 44.2k| break; 113| 0| } 114| 270k| case op_concat_move_l: { ------------------ | Branch (114:9): [True: 270k, False: 1.77M] ------------------ 115| 270k| auto src2 = read(in, is_valid_var_neq(src)); 116| 270k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (116:17): [True: 264k, False: 6.27k] ------------------ 117| 264k| vars[dst] = std::move(vars[src]) + vars[src2]; 118| 270k| break; 119| 0| } 120| 5.65k| case op_concat_move_r: { ------------------ | Branch (120:9): [True: 5.65k, False: 2.03M] ------------------ 121| 5.65k| auto src2 = read(in, is_valid_var_neq(src)); 122| 5.65k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (122:17): [True: 5.28k, False: 375] ------------------ 123| 5.28k| vars[dst] = vars[src] + std::move(vars[src2]); 124| 5.65k| break; 125| 0| } 126| 3.06k| case op_concat_move_lr: { ------------------ | Branch (126:9): [True: 3.06k, False: 2.04M] ------------------ 127| 3.06k| auto src2 = read(in, is_valid_var_neq(src)); 128| 3.06k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (128:17): [True: 1.86k, False: 1.19k] ------------------ 129| 1.86k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 130| 3.06k| break; 131| 0| } 132| 32.6k| case op_compare: { ------------------ | Branch (132:9): [True: 32.6k, False: 2.01M] ------------------ 133| 32.6k| using std::swap; 134| 32.6k| if (can_compare(vars[src]) && vars[src] == vars[dst]) ------------------ | Branch (134:17): [True: 29.2k, False: 3.40k] | Branch (134:43): [True: 7.08k, False: 22.2k] ------------------ 135| 7.08k| swap(vars[src], vars[dst]); 136| 32.6k| break; 137| 0| } 138| 3.41k| case op_erase: { ------------------ | Branch (138:9): [True: 3.41k, False: 2.04M] ------------------ 139| 3.41k| auto idx = read(in, is_valid_index(vars[src])); 140| 3.41k| vars[dst] = vars[src].erase(idx); 141| 3.41k| break; 142| 0| } 143| 18.6k| case op_insert: { ------------------ | Branch (143:9): [True: 18.6k, False: 2.02M] ------------------ 144| 18.6k| auto idx = read(in, is_valid_size(vars[src])); 145| 18.6k| vars[dst] = vars[src].insert(idx, immer::box{42}); 146| 18.6k| break; 147| 0| } 148| 27.3k| default: ------------------ | Branch (148:9): [True: 27.3k, False: 2.01M] ------------------ 149| 27.3k| break; 150| 2.04M| }; 151| 2.03M| return true; 152| 2.04M| }); flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_0clIcEEDaT_: 28| 5.38M| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; ------------------ | Branch (28:48): [True: 5.21M, False: 171k] | Branch (28:60): [True: 5.03M, False: 180k] ------------------ 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| 190k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; ------------------ | Branch (35:39): [True: 190k, False: 0] | Branch (35:51): [True: 168k, False: 22.2k] ------------------ flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaRT_: 34| 168k| auto is_valid_index = [](auto& v) { 35| 168k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 36| 168k| }; flex-vector.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E_clIiEEDaS2_: 75| 123k| 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| 117k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; ------------------ | Branch (38:39): [True: 117k, False: 0] | Branch (38:51): [True: 106k, False: 11.2k] ------------------ flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaRT_: 37| 106k| auto is_valid_size = [](auto& v) { 38| 106k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 39| 106k| }; flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_4clIRN5immer11flex_vectorIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEELj2ELj2EEESC_EEDaOT_OT0_: 40| 1.24M| auto can_concat = [](auto&& v1, auto&& v2) { 41| 1.24M| return v1.size() + v2.size() < vector_t::max_size(); 42| 1.24M| }; flex-vector.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E0_clIiEEDaS2_: 101| 41.3k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); flex-vector.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_ENKUlS1_E_clIcEEDaS1_: 30| 317k| return [=](auto idx) { 31| 317k| return idx >= 0 && idx < var_count && idx != other; ------------------ | Branch (31:20): [True: 310k, False: 6.05k] | Branch (31:32): [True: 300k, False: 10.4k] | Branch (31:51): [True: 279k, False: 21.3k] ------------------ 32| 317k| }; flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_: 29| 279k| auto is_valid_var_neq = [](auto other) { 30| 279k| return [=](auto idx) { 31| 279k| return idx >= 0 && idx < var_count && idx != other; 32| 279k| }; 33| 279k| }; flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_5clIRN5immer11flex_vectorIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaOT_: 43| 32.6k| auto can_compare = [](auto&& v) { 44| | // avoid comparing vectors that are too big, and hence, slow to compare 45| 32.6k| return v.size() < (1 << 15); 46| 32.6k| }; flex-vector.cpp:_ZN12fuzzer_input3runIZ22LLVMFuzzerTestOneInputE3$_6EEiT_: 50| 9.00k| { 51| 9.00k| if (size_ > fuzzer_input_max_size) ------------------ | Branch (51:13): [True: 8, False: 8.99k] ------------------ 52| 8| return 0; 53| 8.99k| try { 54| 2.04M| while (step(*this)) ------------------ | Branch (54:20): [True: 2.03M, False: 8.99k] ------------------ 55| 2.03M| continue; 56| 8.99k| } catch (const no_more_input&) { 57| 8.99k| }; 58| 8.99k| return 0; 59| 8.99k| } flex-vector.cpp:_Z4readIcZ22LLVMFuzzerTestOneInputE3$_0ET_R12fuzzer_inputT0_: 70| 5.04M|{ 71| 5.04M| auto x = read(fz); 72| 5.39M| while (!cond(x)) ------------------ | Branch (72:12): [True: 351k, False: 5.04M] ------------------ 73| 351k| x = read(fz); 74| 5.04M| return x; 75| 5.04M|} _Z4readIcERKT_R12fuzzer_input: 64| 7.75M|{ 65| 7.75M| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 7.75M|} _ZN12fuzzer_input4nextEmm: 40| 8.06M| { 41| 8.06M| auto& p = const_cast(reinterpret_cast(data_)); 42| 8.06M| auto r = std::align(align, size, p, size_); 43| 8.06M| if (r == nullptr) ------------------ | Branch (43:13): [True: 8.99k, False: 8.05M] ------------------ 44| 8.99k| throw no_more_input{}; 45| 8.05M| return next(size); 46| 8.06M| } _ZN12fuzzer_input4nextEm: 30| 8.05M| { 31| 8.05M| if (size_ < size) ------------------ | Branch (31:13): [True: 0, False: 8.05M] ------------------ 32| 0| throw no_more_input{}; 33| 8.05M| auto r = data_; 34| 8.05M| data_ += size; 35| 8.05M| size_ -= size; 36| 8.05M| return r; 37| 8.05M| } 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| 168k|{ 71| 168k| auto x = read(fz); 72| 191k| while (!cond(x)) ------------------ | Branch (72:12): [True: 22.2k, False: 168k] ------------------ 73| 22.2k| x = read(fz); 74| 168k| return x; 75| 168k|} _Z4readIhERKT_R12fuzzer_input: 64| 308k|{ 65| 308k| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 308k|} 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| 106k|{ 71| 106k| auto x = read(fz); 72| 117k| while (!cond(x)) ------------------ | Branch (72:12): [True: 11.2k, False: 106k] ------------------ 73| 11.2k| x = read(fz); 74| 106k| return x; 75| 106k|} flex-vector.cpp:_Z4readIcZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_EUlS2_E_ES2_R12fuzzer_inputT0_: 70| 279k|{ 71| 279k| auto x = read(fz); 72| 317k| while (!cond(x)) ------------------ | Branch (72:12): [True: 37.8k, False: 279k] ------------------ 73| 37.8k| x = read(fz); 74| 279k| return x; 75| 279k|} _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2IiviEEOT_: 85| 18.6k| : impl_{detail::make(std::forward(arg))} 86| 18.6k| { 87| 18.6k| } _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderC2IJiEEEDpOT_: 47| 18.6k| : value(std::forward(args)...) 48| 18.6k| { 49| 18.6k| } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEcvRKiEv: 142| 18.6k| operator const T&() const { return get(); } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE3getEv: 139| 18.6k| IMMER_NODISCARD const T& get() const { return impl_->value; } _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEED2Ev: 131| 18.6k| { 132| 18.6k| if (impl_ && impl_->dec()) { ------------------ | Branch (132:13): [True: 18.6k, False: 0] | Branch (132:22): [True: 18.6k, False: 0] ------------------ 133| 18.6k| impl_->~holder(); 134| 18.6k| heap::deallocate(sizeof(holder), impl_); 135| 18.6k| } 136| 18.6k| } _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| 107M| { 171| 107M| return x.get_(type_t{}); 172| 107M| } _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| 107M| { 185| 107M| return n.get_(t); 186| 107M| } _ZNK5immer6detail3csl6memberINS_15refcount_policyENS1_7inheritINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEvE4typeEE4type4get_ENS1_6type_tIS3_EE: 128| 120M| 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.6M| { 171| 12.6M| return x.get_(type_t{}); 172| 12.6M| } _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.6M| { 185| 12.6M| return n.get_(t); 186| 12.6M| } _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.9M| { 166| 11.9M| return x.get_(type_t{}); 167| 11.9M| } _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.9M| { 180| 11.9M| return n.get_(t); 181| 11.9M| } _ZN5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 102| 29.1M| 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| 96.0k| { 171| 96.0k| return x.get_(type_t{}); 172| 96.0k| } _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| 96.0k| { 185| 96.0k| return n.get_(t); 186| 96.0k| } _ZNK5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 103| 96.0k| 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.55M| 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.55M| { 23| 5.55M| return x.dereference(); 24| 5.55M| } _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.60M| { 87| 5.60M| static_assert(std::is_base_of::value, 88| 5.60M| "must pass a derived thing"); 89| 5.60M| return *static_cast(this); 90| 5.60M| } _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| 233k| { 152| 233k| access_t::advance(derived(), n); 153| 233k| return derived(); 154| 233k| } _ZN5immer6detail20iterator_core_access7advanceIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEElEEDcOT_T0_: 46| 233k| { 47| 233k| return x.advance(d); 48| 233k| } _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.85M| { 93| 8.85M| static_assert(std::is_base_of::value, 94| 8.85M| "must pass a derived thing"); 95| 8.85M| return *static_cast(this); 96| 8.85M| } _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.19M| { 120| 4.19M| access_t::increment(derived()); 121| 4.19M| return derived(); 122| 4.19M| } _ZN5immer6detail20iterator_core_access9incrementIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDcOT_: 28| 4.19M| { 29| 4.19M| return x.increment(); 30| 4.19M| } _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| 44.0k| { 165| 44.0k| auto tmp = derived(); 166| 44.0k| return tmp += n; 167| 44.0k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE17make_inner_n_intoEPvmj: 213| 3.03M| { 214| 3.03M| assert(n <= branches); ------------------ | Branch (214:9): [True: 3.03M, False: 0] ------------------ 215| 3.03M| assert(size >= sizeof_inner_n(n)); ------------------ | Branch (215:9): [True: 3.03M, False: 0] ------------------ 216| 3.03M| auto p = new (buffer) node_t; 217| 3.03M| p->impl.d.data.inner.relaxed = nullptr; 218| 3.03M|#if IMMER_TAGGED_NODE 219| 3.03M| p->impl.d.kind = node_t::kind_t::inner; 220| 3.03M|#endif 221| 3.03M| return p; 222| 3.03M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14sizeof_inner_nEj: 145| 12.2M| { 146| 12.2M| return keep_headroom ? max_sizeof_inner : sizeof_packed_inner_n(n); ------------------ | Branch (146:16): [True: 12.2M, Folded] ------------------ 147| 12.2M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE3incEv: 956| 29.2M| { 957| 29.2M| refs(this).inc(); 958| 29.2M| return this; 959| 29.2M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4refsEPKSB_: 203| 107M| { 204| 107M| return auto_const_cast(get(x->impl)); 205| 107M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE16make_leaf_n_intoEPvmj: 330| 1.27M| { 331| 1.27M| assert(n <= branches); ------------------ | Branch (331:9): [True: 1.27M, False: 0] ------------------ 332| 1.27M| assert(size >= sizeof_leaf_n(n)); ------------------ | Branch (332:9): [True: 1.27M, False: 0] ------------------ 333| 1.27M| auto p = new (buffer) node_t; 334| 1.27M|#if IMMER_TAGGED_NODE 335| 1.27M| p->impl.d.kind = node_t::kind_t::leaf; 336| 1.27M|#endif 337| 1.27M| return p; 338| 1.27M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13sizeof_leaf_nEj: 160| 5.32M| { 161| 5.32M| return keep_headroom ? max_sizeof_leaf : sizeof_packed_leaf_n(n); ------------------ | Branch (161:16): [True: 5.32M, Folded] ------------------ 162| 5.32M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7relaxedEv: 172| 174M| { 173| 174M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 174M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (173:9): [True: 174M, False: 0] ------------------ 174| 174M| return impl.d.data.inner.relaxed; 175| 174M| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4kindEv: 168| 329M| 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| 61.2M| 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| 12.0M| { 833| 12.0M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 12.0M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (833:9): [True: 12.0M, False: 0] ------------------ 834| 12.0M| auto r = p->relaxed(); 835| 12.0M| assert(r); ------------------ | Branch (835:9): [True: 12.0M, False: 0] ------------------ 836| 12.0M| static_if([&](auto) { 837| 12.0M| if (node_t::refs(r).dec()) 838| 12.0M| heap::deallocate(node_t::ownee(r).owned() 839| 12.0M| ? node_t::max_sizeof_relaxed 840| 12.0M| : node_t::sizeof_relaxed_n(n), 841| 12.0M| r); 842| 12.0M| }); 843| 12.0M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner_r ------------------ | Branch (843:26): [True: 0, False: 12.0M] ------------------ 844| 12.0M| : node_t::sizeof_inner_r_n(n), 845| 12.0M| p); 846| 12.0M| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14delete_inner_rEPSB_jENKUlT_E_clINS0_7empty_tEEEDaSD_: 836| 12.0M| static_if([&](auto) { 837| 12.0M| if (node_t::refs(r).dec()) ------------------ | Branch (837:17): [True: 11.8M, False: 263k] ------------------ 838| 11.8M| heap::deallocate(node_t::ownee(r).owned() ------------------ | Branch (838:34): [True: 0, False: 11.8M] ------------------ 839| 11.8M| ? node_t::max_sizeof_relaxed 840| 11.8M| : node_t::sizeof_relaxed_n(n), 841| 11.8M| r); 842| 12.0M| }); _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.6M| { 197| 12.6M| return auto_const_cast(get(*x)); 198| 12.6M| } _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.9M| 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| 23.5M| { 156| 23.5M| return keep_headroom ? max_sizeof_relaxed : sizeof_packed_relaxed_n(n); ------------------ | Branch (156:16): [True: 23.5M, Folded] ------------------ 157| 23.5M| } _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| 24.0M| { 151| 24.0M| return keep_headroom ? max_sizeof_inner_r : sizeof_packed_inner_r_n(n); ------------------ | Branch (151:16): [True: 24.0M, Folded] ------------------ 152| 24.0M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11delete_leafEPSB_j: 861| 1.49M| { 862| 1.49M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::leaf); ------------------ | | 68| 1.49M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (862:9): [True: 1.49M, False: 0] ------------------ 863| 1.49M| detail::destroy_n(p->leaf(), n); 864| 1.49M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_leaf ------------------ | Branch (864:26): [True: 0, False: 1.49M] ------------------ 865| 1.49M| : node_t::sizeof_leaf_n(n), 866| 1.49M| p); 867| 1.49M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4leafEv: 190| 10.6M| { 191| 10.6M| IMMER_ASSERT_TAGGED(kind() == kind_t::leaf); ------------------ | | 68| 10.6M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (191:9): [True: 10.6M, False: 0] ------------------ 192| 10.6M| return impl.d.data.leaf.get_storage_ptr(); 193| 10.6M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12delete_innerEPSB_j: 808| 3.11M| { 809| 3.11M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 3.11M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (809:9): [True: 3.11M, False: 0] ------------------ 810| 3.11M| assert(!p->relaxed()); ------------------ | Branch (810:9): [True: 3.11M, False: 0] ------------------ 811| 3.11M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner ------------------ | Branch (811:26): [True: 0, False: 3.11M] ------------------ 812| 3.11M| : node_t::sizeof_inner_n(n), 813| 3.11M| p); 814| 3.11M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE17copy_leaf_emplaceIiEEPSB_SD_jOT_: 794| 324k| { 795| 324k| auto dst = copy_leaf_n(n + 1, src, n); 796| 324k| IMMER_TRY { ------------------ | | 49| 324k|#define IMMER_TRY try ------------------ 797| 324k| new (dst->leaf() + n) T(std::forward(x)); 798| 324k| } 799| 324k| 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| 324k| return dst; 805| 324k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11copy_leaf_nEjPSB_j: 696| 324k| { 697| 324k| assert(allocn >= n); ------------------ | Branch (697:9): [True: 324k, False: 0] ------------------ 698| 324k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 324k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (698:9): [True: 324k, False: 0] ------------------ 699| 324k| auto dst = make_leaf_n(allocn); 700| 324k| IMMER_TRY { ------------------ | | 49| 324k|#define IMMER_TRY try ------------------ 701| 324k| detail::uninitialized_copy( 702| 324k| src->leaf(), src->leaf() + n, dst->leaf()); 703| 324k| } 704| 324k| 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| 324k| return dst; 709| 324k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_nEj: 341| 1.27M| { 342| 1.27M| assert(n <= branches); ------------------ | Branch (342:9): [True: 1.27M, False: 0] ------------------ 343| 1.27M| auto m = heap::allocate(sizeof_leaf_n(n)); 344| 1.27M| return make_leaf_n_into(m, sizeof_leaf_n(n), n); 345| 1.27M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_nIiEEPSB_jOT_: 470| 118k| { 471| 118k| assert(n >= 1); ------------------ | Branch (471:9): [True: 118k, False: 0] ------------------ 472| 118k| auto p = make_leaf_n(n); 473| 118k| IMMER_TRY { ------------------ | | 49| 118k|#define IMMER_TRY try ------------------ 474| 118k| new (p->leaf()) T(std::forward(x)); 475| 118k| } 476| 118k| 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| 118k| return p; 481| 118k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13do_copy_innerEPSB_SC_j: 558| 2.78M| { 559| 2.78M| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 2.78M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (559:9): [True: 2.78M, False: 0] ------------------ 560| 2.78M| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 2.78M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (560:9): [True: 2.78M, False: 0] ------------------ 561| 2.78M| auto p = src->inner(); 562| 2.78M| inc_nodes(p, n); 563| 2.78M| std::copy(p, p + n, dst->inner()); 564| 2.78M| return dst; 565| 2.78M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9inc_nodesEPPSB_j: 970| 9.08M| { 971| 24.4M| for (auto i = p, e = i + n; i != e; ++i) ------------------ | Branch (971:37): [True: 15.3M, False: 9.08M] ------------------ 972| 15.3M| refs(*i).inc(); 973| 9.08M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14copy_inner_r_nEjPSB_j: 588| 535k| { 589| 535k| assert(allocn >= n); ------------------ | Branch (589:9): [True: 535k, False: 0] ------------------ 590| 535k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 535k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (590:9): [True: 535k, False: 0] ------------------ 591| 535k| auto dst = make_inner_r_n(allocn); 592| 535k| return do_copy_inner_r(dst, src, n); 593| 535k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE15do_copy_inner_rEPSB_SC_j: 610| 558k| { 611| 558k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 558k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (611:9): [True: 558k, False: 0] ------------------ 612| 558k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 558k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (612:9): [True: 558k, False: 0] ------------------ 613| 558k| auto src_r = src->relaxed(); 614| 558k| auto dst_r = dst->relaxed(); 615| 558k| inc_nodes(src->inner(), n); 616| 558k| std::copy(src->inner(), src->inner() + n, dst->inner()); 617| 558k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 618| 558k| dst_r->d.count = n; 619| 558k| return dst; 620| 558k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14make_inner_r_nEj: 243| 11.6M| { 244| 11.6M| assert(n <= branches); ------------------ | Branch (244:9): [True: 11.6M, False: 0] ------------------ 245| 11.6M| auto mp = heap::allocate(sizeof_inner_r_n(n)); 246| 11.6M| auto mr = static_cast(nullptr); 247| 11.6M| if (embed_relaxed) { ------------------ | Branch (247:13): [Folded, False: 11.6M] ------------------ 248| 0| mr = reinterpret_cast(mp) + sizeof_inner_n(n); 249| 11.6M| } else { 250| 11.6M| IMMER_TRY { ------------------ | | 49| 11.6M|#define IMMER_TRY try ------------------ 251| 11.6M| mr = heap::allocate(sizeof_relaxed_n(n), norefs_tag{}); 252| 11.6M| } 253| 11.6M| 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.6M| } 258| 11.6M| auto p = new (mp) node_t; 259| 11.6M| auto r = new (mr) relaxed_t; 260| 11.6M| r->d.count = 0; 261| 11.6M| p->impl.d.data.inner.relaxed = r; 262| 11.6M|#if IMMER_TAGGED_NODE 263| 11.6M| p->impl.d.kind = node_t::kind_t::inner; 264| 11.6M|#endif 265| 11.6M| return p; 266| 11.6M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9make_pathEjPSB_: 498| 775k| { 499| 775k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 775k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (499:9): [True: 775k, False: 0] ------------------ 500| 775k| if (shift == endshift) ------------------ | Branch (500:13): [True: 573k, False: 202k] ------------------ 501| 573k| return node; 502| 202k| else { 503| 202k| auto n = node_t::make_inner_n(1); 504| 202k| IMMER_TRY { ------------------ | | 49| 202k|#define IMMER_TRY try ------------------ 505| 202k| n->inner()[0] = make_path(shift - B, node); 506| 202k| } 507| 202k| 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| 202k| return n; 512| 202k| } 513| 775k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12make_inner_nEj: 224| 3.03M| { 225| 3.03M| assert(n <= branches); ------------------ | Branch (225:9): [True: 3.03M, False: 0] ------------------ 226| 3.03M| auto m = heap::allocate(sizeof_inner_n(n)); 227| 3.03M| return make_inner_n_into(m, sizeof_inner_n(n), n); 228| 3.03M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9copy_leafEPSB_j: 666| 133k| { 667| 133k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 133k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (667:9): [True: 133k, False: 0] ------------------ 668| 133k| auto dst = make_leaf_n(n); 669| 133k| IMMER_TRY { ------------------ | | 49| 133k|#define IMMER_TRY try ------------------ 670| 133k| detail::uninitialized_copy( 671| 133k| src->leaf(), src->leaf() + n, dst->leaf()); 672| 133k| } 673| 133k| 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| 133k| return dst; 678| 133k| } _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| 279k| { 270| 279k| return static_if( 271| 279k| [&](auto) { return node_t::make_inner_r_n(n); }, 272| 279k| [&](auto) { 273| 279k| auto p = 274| 279k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 279k| assert(r->d.count >= n); 276| 279k| node_t::refs(r).inc(); 277| 279k| p->impl.d.data.inner.relaxed = r; 278| 279k|#if IMMER_TAGGED_NODE 279| 279k| p->impl.d.kind = node_t::kind_t::inner; 280| 279k|#endif 281| 279k| return p; 282| 279k| }); 283| 279k| } _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| 279k| [&](auto) { 273| 279k| auto p = 274| 279k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 279k| assert(r->d.count >= n); ------------------ | Branch (275:17): [True: 279k, False: 0] ------------------ 276| 279k| node_t::refs(r).inc(); 277| 279k| p->impl.d.data.inner.relaxed = r; 278| 279k|#if IMMER_TAGGED_NODE 279| 279k| p->impl.d.kind = node_t::kind_t::inner; 280| 279k|#endif 281| 279k| return p; 282| 279k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE24do_copy_inner_replace_srEPSB_SC_jjSC_: 652| 279k| { 653| 279k| if (embed_relaxed) ------------------ | Branch (653:13): [Folded, False: 279k] ------------------ 654| 0| return do_copy_inner_replace_r(dst, src, n, offset, child); 655| 279k| else { 656| 279k| auto p = src->inner(); 657| 279k| inc_nodes(p, offset); 658| 279k| inc_nodes(p + offset + 1, n - offset - 1); 659| 279k| std::copy(p, p + n, dst->inner()); 660| 279k| dst->inner()[offset] = child; 661| 279k| return dst; 662| 279k| } 663| 279k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE21do_copy_inner_replaceEPSB_SC_jjSC_: 569| 58.3k| { 570| 58.3k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 58.3k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (570:9): [True: 58.3k, False: 0] ------------------ 571| 58.3k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 58.3k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (571:9): [True: 58.3k, False: 0] ------------------ 572| 58.3k| auto p = src->inner(); 573| 58.3k| inc_nodes(p, offset); 574| 58.3k| inc_nodes(p + offset + 1, n - offset - 1); 575| 58.3k| std::copy(p, p + n, dst->inner()); 576| 58.3k| dst->inner()[offset] = child; 577| 58.3k| return dst; 578| 58.3k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12copy_inner_nEjPSB_j: 543| 9.02k| { 544| 9.02k| assert(allocn >= n); ------------------ | Branch (544:9): [True: 9.02k, False: 0] ------------------ 545| 9.02k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 9.02k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (545:9): [True: 9.02k, False: 0] ------------------ 546| 9.02k| auto dst = make_inner_n(allocn); 547| 9.02k| return do_copy_inner(dst, src, n); 548| 9.02k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12copy_inner_rEPSB_j: 581| 4.58k| { 582| 4.58k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 4.58k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (582:9): [True: 4.58k, False: 0] ------------------ 583| 4.58k| auto dst = make_inner_r_n(n); 584| 4.58k| return do_copy_inner_r(dst, src, n); 585| 4.58k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13compute_shiftEv: 977| 5.20M| { 978| 5.20M| if (kind() == kind_t::leaf) ------------------ | Branch (978:13): [True: 450k, False: 4.75M] ------------------ 979| 450k| return endshift; 980| 4.75M| else 981| 4.75M| return B + inner()[0]->compute_shift(); 982| 5.20M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5checkEjm: 986| 450k| { 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| 450k| return true; 1023| 450k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9copy_leafEPSB_jj: 778| 341k| { 779| 341k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 341k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (779:9): [True: 341k, False: 0] ------------------ 780| 341k| auto dst = make_leaf_n(last - idx); 781| 341k| IMMER_TRY { ------------------ | | 49| 341k|#define IMMER_TRY try ------------------ 782| 341k| detail::uninitialized_copy( 783| 341k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 784| 341k| } 785| 341k| 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| 341k| return dst; 790| 341k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9copy_leafEPSB_jSC_j: 712| 332k| { 713| 332k| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 332k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (713:9): [True: 332k, False: 0] ------------------ 714| 332k| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 332k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (714:9): [True: 332k, False: 0] ------------------ 715| 332k| auto dst = make_leaf_n(n1 + n2); 716| 332k| IMMER_TRY { ------------------ | | 49| 332k|#define IMMER_TRY try ------------------ 717| 332k| detail::uninitialized_copy( 718| 332k| src1->leaf(), src1->leaf() + n1, dst->leaf()); 719| 332k| } 720| 332k| 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| 332k| IMMER_TRY { ------------------ | | 49| 332k|#define IMMER_TRY try ------------------ 725| 332k| detail::uninitialized_copy( 726| 332k| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 727| 332k| } 728| 332k| 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| 332k| return dst; 734| 332k| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10can_mutateENS9_5applyIS6_E4type4editE: 870| 1.72M| { 871| 1.72M| return refs(this).unique() || ownee(this).can_mutate(e); ------------------ | Branch (871:16): [True: 1.63M, False: 96.0k] | Branch (871:39): [True: 0, False: 96.0k] ------------------ 872| 1.72M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5owneeEPKSB_: 207| 96.0k| { 208| 96.0k| return get(x->impl); 209| 96.0k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_j: 681| 30.6k| { 682| 30.6k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 30.6k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (682:9): [True: 30.6k, False: 0] ------------------ 683| 30.6k| auto dst = make_leaf_e(e); 684| 30.6k| IMMER_TRY { ------------------ | | 49| 30.6k|#define IMMER_TRY try ------------------ 685| 30.6k| detail::uninitialized_copy( 686| 30.6k| src->leaf(), src->leaf() + n, dst->leaf()); 687| 30.6k| } 688| 30.6k| 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.6k| return dst; 693| 30.6k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_eENS9_5applyIS6_E4type4editE: 348| 214k| { 349| 214k| auto p = new (heap::allocate(max_sizeof_leaf)) node_t; 350| 214k| ownee(p) = e; 351| 214k|#if IMMER_TAGGED_NODE 352| 214k| p->impl.d.kind = node_t::kind_t::leaf; 353| 214k|#endif 354| 214k| return p; 355| 214k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_eIiEEPSB_NS9_5applyIS6_E4type4editEOT_: 485| 12.8k| { 486| 12.8k| auto p = make_leaf_e(e); 487| 12.8k| IMMER_TRY { ------------------ | | 49| 12.8k|#define IMMER_TRY try ------------------ 488| 12.8k| new (p->leaf()) T(std::forward(x)); 489| 12.8k| } 490| 12.8k| 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| 12.8k| return p; 495| 12.8k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEj: 930| 62.9k| { 931| 62.9k| auto src_r = relaxed(); 932| 62.9k| return static_if( 933| 62.9k| [&](auto) { return src_r; }, 934| 62.9k| [&](auto) { 935| 62.9k| if (node_t::refs(src_r).unique() || 936| 62.9k| node_t::ownee(src_r).can_mutate(e)) 937| 62.9k| return src_r; 938| 62.9k| else { 939| 62.9k| auto dst_r = 940| 62.9k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 62.9k| if (src_r) { 942| 62.9k| std::copy( 943| 62.9k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 62.9k| if (node_t::refs(src_r).dec()) 945| 62.9k| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 62.9k| src_r); 947| 62.9k| } 948| 62.9k| dst_r->d.count = n; 949| 62.9k| node_t::ownee(dst_r) = e; 950| 62.9k| return impl.d.data.inner.relaxed = dst_r; 951| 62.9k| } 952| 62.9k| }); 953| 62.9k| } _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| 62.9k| [&](auto) { 935| 62.9k| if (node_t::refs(src_r).unique() || ------------------ | Branch (935:21): [True: 51.8k, False: 11.1k] ------------------ 936| 11.1k| node_t::ownee(src_r).can_mutate(e)) ------------------ | Branch (936:21): [True: 0, False: 11.1k] ------------------ 937| 51.8k| return src_r; 938| 11.1k| else { 939| 11.1k| auto dst_r = 940| 11.1k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 11.1k| if (src_r) { ------------------ | Branch (941:25): [True: 11.1k, False: 0] ------------------ 942| 11.1k| std::copy( 943| 11.1k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 11.1k| if (node_t::refs(src_r).dec()) ------------------ | Branch (944:29): [True: 0, False: 11.1k] ------------------ 945| 0| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 0| src_r); 947| 11.1k| } 948| 11.1k| dst_r->d.count = n; 949| 11.1k| node_t::ownee(dst_r) = e; 950| 11.1k| return impl.d.data.inner.relaxed = dst_r; 951| 11.1k| } 952| 62.9k| }); _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| 116k| { 287| 116k| auto mp = heap::allocate(max_sizeof_inner_r); 288| 116k| auto mr = static_cast(nullptr); 289| 116k| if (embed_relaxed) { ------------------ | Branch (289:13): [Folded, False: 116k] ------------------ 290| 0| mr = reinterpret_cast(mp) + max_sizeof_inner; 291| 116k| } else { 292| 116k| IMMER_TRY { ------------------ | | 49| 116k|#define IMMER_TRY try ------------------ 293| 116k| mr = heap::allocate(max_sizeof_relaxed, norefs_tag{}); 294| 116k| } 295| 116k| IMMER_CATCH (...) { 296| 0| heap::deallocate(max_sizeof_inner_r, mp); 297| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 298| 0| } 299| 116k| } 300| 116k| auto p = new (mp) node_t; 301| 116k| auto r = new (mr) relaxed_t; 302| 116k| ownee(p) = e; 303| 116k| static_if([&](auto) { node_t::ownee(r) = e; }); 304| 116k| r->d.count = 0; 305| 116k| p->impl.d.data.inner.relaxed = r; 306| 116k|#if IMMER_TAGGED_NODE 307| 116k| p->impl.d.kind = node_t::kind_t::inner; 308| 116k|#endif 309| 116k| return p; 310| 116k| } _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| 116k| 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| 270k| { 517| 270k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 270k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (517:9): [True: 270k, False: 0] ------------------ 518| 270k| if (shift == endshift) ------------------ | Branch (518:13): [True: 201k, False: 68.5k] ------------------ 519| 201k| return node; 520| 68.5k| else { 521| 68.5k| auto n = node_t::make_inner_e(e); 522| 68.5k| IMMER_TRY { ------------------ | | 49| 68.5k|#define IMMER_TRY try ------------------ 523| 68.5k| n->inner()[0] = make_path_e(e, shift - B, node); 524| 68.5k| } 525| 68.5k| 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| 68.5k| return n; 530| 68.5k| } 531| 270k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12make_inner_eENS9_5applyIS6_E4type4editE: 231| 90.9k| { 232| 90.9k| auto m = heap::allocate(max_sizeof_inner); 233| 90.9k| auto p = new (m) node_t; 234| 90.9k| ownee(p) = e; 235| 90.9k| p->impl.d.data.inner.relaxed = nullptr; 236| 90.9k|#if IMMER_TAGGED_NODE 237| 90.9k| p->impl.d.kind = node_t::kind_t::inner; 238| 90.9k|#endif 239| 90.9k| return p; 240| 90.9k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12copy_inner_eENS9_5applyIS6_E4type4editEPSB_j: 551| 14.5k| { 552| 14.5k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 14.5k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (552:9): [True: 14.5k, False: 0] ------------------ 553| 14.5k| auto dst = make_inner_e(e); 554| 14.5k| return do_copy_inner(dst, src, n); 555| 14.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.60k| { 604| 9.60k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 9.60k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (604:9): [True: 9.60k, False: 0] ------------------ 605| 9.60k| auto dst = make_inner_sr_e(e, src->relaxed()); 606| 9.60k| return do_copy_inner_sr(dst, src, n); 607| 9.60k| } _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.60k| { 314| 9.60k| return static_if( 315| 9.60k| [&](auto) { return node_t::make_inner_r_e(e); }, 316| 9.60k| [&](auto) { 317| 9.60k| auto p = 318| 9.60k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 9.60k| node_t::refs(r).inc(); 320| 9.60k| p->impl.d.data.inner.relaxed = r; 321| 9.60k| node_t::ownee(p) = e; 322| 9.60k|#if IMMER_TAGGED_NODE 323| 9.60k| p->impl.d.kind = node_t::kind_t::inner; 324| 9.60k|#endif 325| 9.60k| return p; 326| 9.60k| }); 327| 9.60k| } _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.60k| [&](auto) { 317| 9.60k| auto p = 318| 9.60k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 9.60k| node_t::refs(r).inc(); 320| 9.60k| p->impl.d.data.inner.relaxed = r; 321| 9.60k| node_t::ownee(p) = e; 322| 9.60k|#if IMMER_TAGGED_NODE 323| 9.60k| p->impl.d.kind = node_t::kind_t::inner; 324| 9.60k|#endif 325| 9.60k| return p; 326| 9.60k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE16do_copy_inner_srEPSB_SC_j: 640| 9.60k| { 641| 9.60k| if (embed_relaxed) ------------------ | Branch (641:13): [Folded, False: 9.60k] ------------------ 642| 0| return do_copy_inner_r(dst, src, n); 643| 9.60k| else { 644| 9.60k| inc_nodes(src->inner(), n); 645| 9.60k| std::copy(src->inner(), src->inner() + n, dst->inner()); 646| 9.60k| return dst; 647| 9.60k| } 648| 9.60k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jj: 763| 170k| { 764| 170k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 170k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (764:9): [True: 170k, False: 0] ------------------ 765| 170k| auto dst = make_leaf_e(e); 766| 170k| IMMER_TRY { ------------------ | | 49| 170k|#define IMMER_TRY try ------------------ 767| 170k| detail::uninitialized_copy( 768| 170k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 769| 170k| } 770| 170k| IMMER_CATCH (...) { 771| 0| heap::deallocate(max_sizeof_leaf, dst); 772| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 773| 0| } 774| 170k| return dst; 775| 170k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE22ensure_mutable_relaxedENS9_5applyIS6_E4type4editE: 877| 166k| { 878| 166k| auto src_r = relaxed(); 879| 166k| return static_if( 880| 166k| [&](auto) { return src_r; }, 881| 166k| [&](auto) { 882| 166k| if (node_t::refs(src_r).unique() || 883| 166k| node_t::ownee(src_r).can_mutate(e)) 884| 166k| return src_r; 885| 166k| else { 886| 166k| auto dst_r = impl.d.data.inner.relaxed = 887| 166k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 166k| if (src_r) { 889| 166k| auto n = dst_r->d.count = src_r->d.count; 890| 166k| std::copy( 891| 166k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 166k| if (node_t::refs(src_r).dec()) 893| 166k| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 166k| src_r); 895| 166k| } 896| 166k| node_t::ownee(dst_r) = e; 897| 166k| return dst_r; 898| 166k| } 899| 166k| }); 900| 166k| } _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| 166k| [&](auto) { 882| 166k| if (node_t::refs(src_r).unique() || ------------------ | Branch (882:21): [True: 152k, False: 14.0k] ------------------ 883| 14.0k| node_t::ownee(src_r).can_mutate(e)) ------------------ | Branch (883:21): [True: 0, False: 14.0k] ------------------ 884| 152k| return src_r; 885| 14.0k| else { 886| 14.0k| auto dst_r = impl.d.data.inner.relaxed = 887| 14.0k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 14.0k| if (src_r) { ------------------ | Branch (888:25): [True: 14.0k, False: 0] ------------------ 889| 14.0k| auto n = dst_r->d.count = src_r->d.count; 890| 14.0k| std::copy( 891| 14.0k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 14.0k| if (node_t::refs(src_r).dec()) ------------------ | Branch (892:29): [True: 0, False: 14.0k] ------------------ 893| 0| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 0| src_r); 895| 14.0k| } 896| 14.0k| node_t::ownee(dst_r) = e; 897| 14.0k| return dst_r; 898| 14.0k| } 899| 166k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jSG_j: 738| 268| { 739| 268| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 268|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (739:9): [True: 268, False: 0] ------------------ 740| 268| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 268|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (740:9): [True: 268, False: 0] ------------------ 741| 268| auto dst = make_leaf_e(e); 742| 268| IMMER_TRY { ------------------ | | 49| 268|#define IMMER_TRY try ------------------ 743| 268| detail::uninitialized_copy( 744| 268| src1->leaf(), src1->leaf() + n1, dst->leaf()); 745| 268| } 746| 268| IMMER_CATCH (...) { 747| 0| heap::deallocate(max_sizeof_leaf, dst); 748| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 749| 0| } 750| 268| IMMER_TRY { ------------------ | | 49| 268|#define IMMER_TRY try ------------------ 751| 268| detail::uninitialized_copy( 752| 268| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 753| 268| } 754| 268| IMMER_CATCH (...) { 755| 0| detail::destroy_n(dst->leaf(), n1); 756| 0| heap::deallocate(max_sizeof_leaf, dst); 757| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 758| 0| } 759| 268| return dst; 760| 268| } _ZN5immer6detail4rbts11dec_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 523| 37.1M| { 524| 37.1M| using node_t = node_type; 525| 37.1M| auto node = p.node(); 526| 37.1M| if (node->dec()) { ------------------ | Branch (526:13): [True: 12.0M, False: 25.0M] ------------------ 527| 12.0M| p.each(this_t{}); 528| 12.0M| node_t::delete_inner_r(node, p.count()); 529| 12.0M| } 530| 37.1M| } _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: 610k, False: 1.90M] ------------------ 538| 610k| p.each(this_t{}); 539| 610k| node_t::delete_inner(node, p.count()); 540| 610k| } 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.24M| { 546| 1.24M| using node_t = node_type; 547| 1.24M| auto node = p.node(); 548| 1.24M| if (node->dec()) { ------------------ | Branch (548:13): [True: 557k, False: 685k] ------------------ 549| 557k| node_t::delete_leaf(node, p.count()); 550| 557k| } 551| 1.24M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 545| 482k| { 546| 482k| using node_t = node_type; 547| 482k| auto node = p.node(); 548| 482k| if (node->dec()) { ------------------ | Branch (548:13): [True: 21.3k, False: 461k] ------------------ 549| 21.3k| node_t::delete_leaf(node, p.count()); 550| 21.3k| } 551| 482k| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 534| 3.53M| { 535| 3.53M| using node_t = node_type; 536| 3.53M| auto node = p.node(); 537| 3.53M| if (node->dec()) { ------------------ | Branch (537:13): [True: 238k, False: 3.30M] ------------------ 538| 238k| p.each(this_t{}); 539| 238k| node_t::delete_inner(node, p.count()); 540| 238k| } 541| 3.53M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 534| 2.39M| { 535| 2.39M| using node_t = node_type; 536| 2.39M| auto node = p.node(); 537| 2.39M| if (node->dec()) { ------------------ | Branch (537:13): [True: 2.24M, False: 142k] ------------------ 538| 2.24M| p.each(this_t{}); 539| 2.24M| node_t::delete_inner(node, p.count()); 540| 2.24M| } 541| 2.39M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 534| 1.72M| { 535| 1.72M| using node_t = node_type; 536| 1.72M| auto node = p.node(); 537| 1.72M| if (node->dec()) { ------------------ | Branch (537:13): [True: 0, False: 1.72M] ------------------ 538| 0| p.each(this_t{}); 539| 0| node_t::delete_inner(node, p.count()); 540| 0| } 541| 1.72M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 545| 10.5M| { 546| 10.5M| using node_t = node_type; 547| 10.5M| auto node = p.node(); 548| 10.5M| if (node->dec()) { ------------------ | Branch (548:13): [True: 912k, False: 9.63M] ------------------ 549| 912k| node_t::delete_leaf(node, p.count()); 550| 912k| } 551| 10.5M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 545| 1.62M| { 546| 1.62M| using node_t = node_type; 547| 1.62M| auto node = p.node(); 548| 1.62M| if (node->dec()) { ------------------ | Branch (548:13): [True: 0, False: 1.62M] ------------------ 549| 0| node_t::delete_leaf(node, p.count()); 550| 0| } 551| 1.62M| } _ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_relaxedIRNS1_11relaxed_posISC_EEEEPSC_OT_SI_j: 791| 529k| { 792| 529k| auto level = pos.shift(); 793| 529k| auto idx = pos.count() - 1; 794| 529k| auto children = pos.size(idx); 795| 529k| auto new_idx = 796| 529k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (796:13): [True: 13.7k, False: 516k] | Branch (796:47): [True: 796, False: 515k] ------------------ 797| 529k| auto new_child = static_cast(nullptr); 798| 529k| if (new_idx >= branches) ------------------ | Branch (798:13): [True: 4.90k, False: 524k] ------------------ 799| 4.90k| return nullptr; 800| 524k| else if (idx == new_idx) { ------------------ | Branch (800:18): [True: 515k, False: 9.68k] ------------------ 801| 515k| new_child = pos.last_oh_csh(this_t{}, idx, children, tail, ts); 802| 515k| if (!new_child) { ------------------ | Branch (802:17): [True: 4.31k, False: 510k] ------------------ 803| 4.31k| if (++new_idx < branches) ------------------ | Branch (803:21): [True: 2.81k, False: 1.49k] ------------------ 804| 2.81k| new_child = node_t::make_path(level - B, tail); 805| 1.49k| else 806| 1.49k| return nullptr; 807| 4.31k| } 808| 515k| } else 809| 9.68k| new_child = node_t::make_path(level - B, tail); 810| 523k| IMMER_TRY { ------------------ | | 49| 523k|#define IMMER_TRY try ------------------ 811| 523k| auto count = new_idx + 1; 812| 523k| auto new_parent = 813| 523k| node_t::copy_inner_r_n(count, pos.node(), new_idx); 814| 523k| auto new_relaxed = new_parent->relaxed(); 815| 523k| new_parent->inner()[new_idx] = new_child; 816| 523k| new_relaxed->d.sizes[new_idx] = pos.size() + ts; 817| 523k| new_relaxed->d.count = count; 818| 523k| assert(new_relaxed->d.sizes[new_idx]); ------------------ | Branch (818:13): [True: 523k, False: 0] ------------------ 819| 523k| return new_parent; 820| 523k| } 821| 523k| 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| 523k| } _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: 8.55k] ------------------ 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.21M| { 835| 2.21M| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 2.21M, False: 0] ------------------ 836| 2.21M| auto idx = pos.index(pos.size() - 1); 837| 2.21M| auto new_idx = pos.index(pos.size() + branches - 1); 838| 2.21M| auto count = new_idx + 1; 839| 2.21M| auto new_parent = node_t::make_inner_n(count); 840| 2.21M| IMMER_TRY { ------------------ | | 49| 2.21M|#define IMMER_TRY try ------------------ 841| 2.21M| new_parent->inner()[new_idx] = 842| 2.21M| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 1.69M, False: 519k] ------------------ 843| | /* otherwise */ 844| 2.21M| : node_t::make_path(pos.shift() - B, tail); 845| 2.21M| } 846| 2.21M| 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.21M| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 2.21M| } _ZN5immer6detail4rbts9dec_innerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEvPT_jm: 562| 613|{ 563| 613| visit_maybe_relaxed_sub(node, shift, size, dec_visitor()); 564| 613|} _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| 341k| { 835| 341k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 341k, False: 0] ------------------ 836| 341k| auto idx = pos.index(pos.size() - 1); 837| 341k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 341k| auto count = new_idx + 1; 839| 341k| auto new_parent = node_t::make_inner_n(count); 840| 341k| IMMER_TRY { ------------------ | | 49| 341k|#define IMMER_TRY try ------------------ 841| 341k| new_parent->inner()[new_idx] = 842| 341k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 326k, False: 15.0k] ------------------ 843| | /* otherwise */ 844| 341k| : node_t::make_path(pos.shift() - B, tail); 845| 341k| } 846| 341k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 341k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 341k| } 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| 89.8k| { 503| 89.8k| auto offset = pos.index(idx); 504| 89.8k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 89.8k| IMMER_TRY { ------------------ | | 49| 89.8k|#define IMMER_TRY try ------------------ 506| 89.8k| node->leaf()[offset] = 507| 89.8k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 89.8k| return node; 509| 89.8k| } 510| 89.8k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 89.8k| } 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| 279k| { 467| 279k| auto offset = pos.index(idx); 468| 279k| auto count = pos.count(); 469| 279k| auto node = node_t::make_inner_sr_n(count, pos.relaxed()); 470| 279k| IMMER_TRY { ------------------ | | 49| 279k|#define IMMER_TRY try ------------------ 471| 279k| auto child = pos.towards_oh(this_t{}, idx, offset, fn); 472| 279k| node_t::do_copy_inner_replace_sr( 473| 279k| node, pos.node(), count, offset, child); 474| 279k| return node; 475| 279k| } 476| 279k| IMMER_CATCH (...) { 477| 0| node_t::delete_inner_r(node, count); 478| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 479| 0| } 480| 279k| } 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| 34.0k| { 485| 34.0k| auto offset = pos.index(idx); 486| 34.0k| auto count = pos.count(); 487| 34.0k| auto node = node_t::make_inner_n(count); 488| 34.0k| IMMER_TRY { ------------------ | | 49| 34.0k|#define IMMER_TRY try ------------------ 489| 34.0k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 34.0k| node_t::do_copy_inner_replace( 491| 34.0k| node, pos.node(), count, offset, child); 492| 34.0k| return node; 493| 34.0k| } 494| 34.0k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 34.0k| } 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| 29.0k| { 503| 29.0k| auto offset = pos.index(idx); 504| 29.0k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 29.0k| IMMER_TRY { ------------------ | | 49| 29.0k|#define IMMER_TRY try ------------------ 506| 29.0k| node->leaf()[offset] = 507| 29.0k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 29.0k| return node; 509| 29.0k| } 510| 29.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| 29.0k| } flex-vector.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_regularIRNS1_8full_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 484| 20.2k| { 485| 20.2k| auto offset = pos.index(idx); 486| 20.2k| auto count = pos.count(); 487| 20.2k| auto node = node_t::make_inner_n(count); 488| 20.2k| IMMER_TRY { ------------------ | | 49| 20.2k|#define IMMER_TRY try ------------------ 489| 20.2k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 20.2k| node_t::do_copy_inner_replace( 491| 20.2k| node, pos.node(), count, offset, child); 492| 20.2k| return node; 493| 20.2k| } 494| 20.2k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 20.2k| } 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.97k| { 503| 4.97k| auto offset = pos.index(idx); 504| 4.97k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 4.97k| IMMER_TRY { ------------------ | | 49| 4.97k|#define IMMER_TRY try ------------------ 506| 4.97k| node->leaf()[offset] = 507| 4.97k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 4.97k| return node; 509| 4.97k| } 510| 4.97k| 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.97k| } flex-vector.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_regularIRNS1_11regular_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 484| 4.10k| { 485| 4.10k| auto offset = pos.index(idx); 486| 4.10k| auto count = pos.count(); 487| 4.10k| auto node = node_t::make_inner_n(count); 488| 4.10k| IMMER_TRY { ------------------ | | 49| 4.10k|#define IMMER_TRY try ------------------ 489| 4.10k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 4.10k| node_t::do_copy_inner_replace( 491| 4.10k| node, pos.node(), count, offset, child); 492| 4.10k| return node; 493| 4.10k| } 494| 4.10k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 4.10k| } _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| 38.7k| { 1097| 38.7k| auto idx = pos.index(last); 1098| 38.7k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [True: 38.7k, Folded] | Branch (1098:25): [True: 29.9k, False: 8.83k] ------------------ 1099| 29.9k| return pos.towards_oh(this_t{}, last, idx); 1100| 29.9k| } else { 1101| 8.83k| using std::get; 1102| 8.83k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 8.83k| auto next = get<1>(subs); 1104| 8.83k| auto ts = get<2>(subs); 1105| 8.83k| auto tail = get<3>(subs); 1106| 8.83k| IMMER_TRY { ------------------ | | 49| 8.83k|#define IMMER_TRY try ------------------ 1107| 8.83k| if (next) { ------------------ | Branch (1107:21): [True: 5.45k, False: 3.38k] ------------------ 1108| 5.45k| auto count = idx + 1; 1109| 5.45k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 5.45k| auto newr = newn->relaxed(); 1111| 5.45k| newn->inner()[idx] = next; 1112| 5.45k| newr->d.sizes[idx] = last + 1 - ts; 1113| 5.45k| newr->d.count = count; 1114| 5.45k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 5.45k, False: 0] ------------------ 1115| 5.45k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 5.45k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 0, False: 3.38k] ------------------ 1117| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 3.38k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [True: 3.38k, Folded] | Branch (1118:40): [True: 2.66k, False: 726] | Branch (1118:52): [True: 1.97k, False: 690] ------------------ 1119| 1.97k| auto newn = pos.node()->inner()[0]; 1120| 1.97k| return std::make_tuple( 1121| 1.97k| pos.shift() - B, newn->inc(), ts, tail); 1122| 1.97k| } else { 1123| 1.41k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 1.41k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 1.41k| } 1126| 8.83k| } 1127| 8.83k| IMMER_CATCH (...) { 1128| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1128:17): [True: 0, False: 0] | Branch (1128:17): [True: 0, False: 0] | Branch (1128:17): [True: 0, False: 0] ------------------ 1129| 0| if (next) ------------------ | Branch (1129:21): [True: 0, False: 0] ------------------ 1130| 0| dec_inner(next, 1131| 0| pos.shift() - B, 1132| 0| last + 1 - ts - pos.size_before(idx)); 1133| 0| if (tail) ------------------ | Branch (1133:21): [True: 0, False: 0] ------------------ 1134| 0| dec_leaf(tail, ts); 1135| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1136| 0| } 1137| 8.83k| } 1138| 38.7k| } _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.96k| { 1182| 1.96k| auto old_tail_size = pos.count(); 1183| 1.96k| auto new_tail_size = pos.index(last) + 1; 1184| 1.96k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.07k, False: 896] ------------------ 1185| 1.96k| ? pos.node()->inc() 1186| 1.96k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.96k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.96k| } _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.19k| { 1182| 5.19k| auto old_tail_size = pos.count(); 1183| 5.19k| auto new_tail_size = pos.index(last) + 1; 1184| 5.19k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 2.42k, False: 2.76k] ------------------ 1185| 5.19k| ? pos.node()->inc() 1186| 5.19k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 5.19k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 5.19k| } _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.13k, False: 5.85k] ------------------ 1108| 6.13k| auto count = idx + 1; 1109| 6.13k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 6.13k| auto newr = newn->relaxed(); 1111| 6.13k| newn->inner()[idx] = next; 1112| 6.13k| newr->d.sizes[idx] = last + 1 - ts; 1113| 6.13k| newr->d.count = count; 1114| 6.13k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 6.13k, False: 0] ------------------ 1115| 6.13k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 6.13k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 2.68k, False: 3.17k] ------------------ 1117| 2.68k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 3.17k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [Folded, False: 3.17k] | 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| 3.17k| } else { 1123| 3.17k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 3.17k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 3.17k| } 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| 3.64k| { 1143| 3.64k| auto idx = pos.index(last); 1144| 3.64k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 3.64k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 3.64k| } else { 1147| 3.64k| using std::get; 1148| 3.64k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 3.64k| auto next = get<1>(subs); 1150| 3.64k| auto ts = get<2>(subs); 1151| 3.64k| auto tail = get<3>(subs); 1152| 3.64k| IMMER_TRY { ------------------ | | 49| 3.64k|#define IMMER_TRY try ------------------ 1153| 3.64k| if (next) { ------------------ | Branch (1153:21): [True: 1.60k, False: 2.03k] ------------------ 1154| 1.60k| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 1.60k| newn->inner()[idx] = next; 1156| 1.60k| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.03k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 1.36k, False: 671] ------------------ 1158| 1.36k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.36k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 671] | 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| 671| } else { 1164| 671| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 671| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 671| } 1167| 3.64k| } 1168| 3.64k| 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.64k| } 1177| 3.64k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 5.34k| { 1182| 5.34k| auto old_tail_size = pos.count(); 1183| 5.34k| auto new_tail_size = pos.index(last) + 1; 1184| 5.34k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 3.60k, False: 1.74k] ------------------ 1185| 5.34k| ? pos.node()->inc() 1186| 5.34k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 5.34k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 5.34k| } _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.25k| { 1143| 2.25k| auto idx = pos.index(last); 1144| 2.25k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.25k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.25k| } else { 1147| 2.25k| using std::get; 1148| 2.25k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.25k| auto next = get<1>(subs); 1150| 2.25k| auto ts = get<2>(subs); 1151| 2.25k| auto tail = get<3>(subs); 1152| 2.25k| IMMER_TRY { ------------------ | | 49| 2.25k|#define IMMER_TRY try ------------------ 1153| 2.25k| if (next) { ------------------ | Branch (1153:21): [True: 331, False: 1.91k] ------------------ 1154| 331| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 331| newn->inner()[idx] = next; 1156| 331| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.91k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 952, False: 967] ------------------ 1158| 952| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 967| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 967] | 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| 967| } else { 1164| 967| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 967| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 967| } 1167| 2.25k| } 1168| 2.25k| 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.25k| } 1177| 2.25k| } _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.12k| { 1182| 2.12k| auto old_tail_size = pos.count(); 1183| 2.12k| auto new_tail_size = pos.index(last) + 1; 1184| 2.12k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.02k, False: 1.10k] ------------------ 1185| 2.12k| ? pos.node()->inc() 1186| 2.12k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 2.12k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 2.12k| } _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.60k| { 1143| 4.60k| auto idx = pos.index(last); 1144| 4.60k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 4.60k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 4.60k| } else { 1147| 4.60k| using std::get; 1148| 4.60k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 4.60k| auto next = get<1>(subs); 1150| 4.60k| auto ts = get<2>(subs); 1151| 4.60k| auto tail = get<3>(subs); 1152| 4.60k| IMMER_TRY { ------------------ | | 49| 4.60k|#define IMMER_TRY try ------------------ 1153| 4.60k| if (next) { ------------------ | Branch (1153:21): [True: 1.37k, False: 3.22k] ------------------ 1154| 1.37k| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 1.37k| newn->inner()[idx] = next; 1156| 1.37k| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 3.22k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 1.56k, False: 1.65k] ------------------ 1158| 1.56k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.65k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 1.65k] | 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.65k| } else { 1164| 1.65k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.65k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.65k| } 1167| 4.60k| } 1168| 4.60k| 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.60k| } 1177| 4.60k| } _ZN5immer6detail4rbts8dec_leafINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEvPT_j: 556| 41.6k|{ 557| 41.6k| make_leaf_sub_pos(node, n).visit(dec_visitor{}); 558| 41.6k|} _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.14k| { 1143| 6.14k| auto idx = pos.index(last); 1144| 6.14k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 6.14k, Folded] | Branch (1144:25): [True: 3.47k, False: 2.67k] ------------------ 1145| 3.47k| return pos.towards_oh(this_t{}, last, idx); 1146| 3.47k| } else { 1147| 2.67k| using std::get; 1148| 2.67k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.67k| auto next = get<1>(subs); 1150| 2.67k| auto ts = get<2>(subs); 1151| 2.67k| auto tail = get<3>(subs); 1152| 2.67k| IMMER_TRY { ------------------ | | 49| 2.67k|#define IMMER_TRY try ------------------ 1153| 2.67k| if (next) { ------------------ | Branch (1153:21): [True: 684, False: 1.99k] ------------------ 1154| 684| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 684| newn->inner()[idx] = next; 1156| 684| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.99k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 1.99k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.99k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 1.99k, Folded] | Branch (1159:40): [True: 1.64k, False: 344] | Branch (1159:52): [True: 1.22k, False: 427] ------------------ 1160| 1.22k| auto newn = pos.node()->inner()[0]; 1161| 1.22k| return std::make_tuple( 1162| 1.22k| pos.shift() - B, newn->inc(), ts, tail); 1163| 1.22k| } else { 1164| 771| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 771| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 771| } 1167| 2.67k| } 1168| 2.67k| 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.67k| } 1177| 6.14k| } _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.62k| { 1182| 1.62k| auto old_tail_size = pos.count(); 1183| 1.62k| auto new_tail_size = pos.index(last) + 1; 1184| 1.62k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 748, False: 880] ------------------ 1185| 1.62k| ? pos.node()->inc() 1186| 1.62k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.62k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.62k| } _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.48k| { 1143| 2.48k| auto idx = pos.index(last); 1144| 2.48k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 2.48k, Folded] | Branch (1144:25): [True: 1.33k, False: 1.15k] ------------------ 1145| 1.33k| return pos.towards_oh(this_t{}, last, idx); 1146| 1.33k| } else { 1147| 1.15k| using std::get; 1148| 1.15k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 1.15k| auto next = get<1>(subs); 1150| 1.15k| auto ts = get<2>(subs); 1151| 1.15k| auto tail = get<3>(subs); 1152| 1.15k| IMMER_TRY { ------------------ | | 49| 1.15k|#define IMMER_TRY try ------------------ 1153| 1.15k| if (next) { ------------------ | Branch (1153:21): [True: 335, False: 821] ------------------ 1154| 335| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 335| newn->inner()[idx] = next; 1156| 335| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 821| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 821] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 821| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 821, Folded] | Branch (1159:40): [True: 472, False: 349] | Branch (1159:52): [True: 202, False: 270] ------------------ 1160| 202| auto newn = pos.node()->inner()[0]; 1161| 202| return std::make_tuple( 1162| 202| pos.shift() - B, newn->inc(), ts, tail); 1163| 619| } else { 1164| 619| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 619| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 619| } 1167| 1.15k| } 1168| 1.15k| 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.15k| } 1177| 2.48k| } _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| 686| { 1182| 686| auto old_tail_size = pos.count(); 1183| 686| auto new_tail_size = pos.index(last) + 1; 1184| 686| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 276, False: 410] ------------------ 1185| 686| ? pos.node()->inc() 1186| 686| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 686| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 686| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE11visit_innerIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 15.2k| { 1415| 15.2k| auto idx = pos.subindex(first); 1416| 15.2k| auto count = pos.count(); 1417| 15.2k| auto left_size = pos.size_before(idx); 1418| 15.2k| auto child_size = pos.size_sbh(idx, left_size); 1419| 15.2k| auto dropped_size = first; 1420| 15.2k| auto child_dropped_size = dropped_size - left_size; 1421| 15.2k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 15.2k, Folded] | Branch (1421:25): [True: 13.6k, False: 1.60k] | Branch (1421:45): [True: 4.59k, False: 9.05k] ------------------ 1422| 4.59k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 10.6k| } else { 1424| 10.6k| using std::get; 1425| 10.6k| auto n = pos.node(); 1426| 10.6k| auto newc = count - idx; 1427| 10.6k| auto newn = node_t::make_inner_r_n(newc); 1428| 10.6k| IMMER_TRY { ------------------ | | 49| 10.6k|#define IMMER_TRY try ------------------ 1429| 10.6k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 10.6k| auto newr = newn->relaxed(); 1431| 10.6k| newr->d.count = count - idx; 1432| 10.6k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 10.6k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 10.6k, False: 0] ------------------ 1434| 10.6k| pos.copy_sizes(idx + 1, 1435| 10.6k| newr->d.count - 1, 1436| 10.6k| newr->d.sizes[0], 1437| 10.6k| newr->d.sizes + 1); 1438| 10.6k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 10.6k, False: 0] ------------------ 1439| 10.6k| pos.size() - dropped_size); 1440| 10.6k| newn->inner()[0] = get<1>(subs); 1441| 10.6k| std::copy(n->inner() + idx + 1, 1442| 10.6k| n->inner() + count, 1443| 10.6k| newn->inner() + 1); 1444| 10.6k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 10.6k| return std::make_tuple(pos.shift(), newn); 1446| 10.6k| } 1447| 10.6k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 10.6k| } 1452| 15.2k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1456| 8.51k| { 1457| 8.51k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 8.51k| return std::make_tuple(0, n); 1459| 8.51k| } _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| 49.6k| { 1415| 49.6k| auto idx = pos.subindex(first); 1416| 49.6k| auto count = pos.count(); 1417| 49.6k| auto left_size = pos.size_before(idx); 1418| 49.6k| auto child_size = pos.size_sbh(idx, left_size); 1419| 49.6k| auto dropped_size = first; 1420| 49.6k| auto child_dropped_size = dropped_size - left_size; 1421| 49.6k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 49.6k] | Branch (1421:25): [True: 0, False: 0] | Branch (1421:45): [True: 0, False: 0] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 49.6k| } else { 1424| 49.6k| using std::get; 1425| 49.6k| auto n = pos.node(); 1426| 49.6k| auto newc = count - idx; 1427| 49.6k| auto newn = node_t::make_inner_r_n(newc); 1428| 49.6k| IMMER_TRY { ------------------ | | 49| 49.6k|#define IMMER_TRY try ------------------ 1429| 49.6k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 49.6k| auto newr = newn->relaxed(); 1431| 49.6k| newr->d.count = count - idx; 1432| 49.6k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 49.6k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 49.6k, False: 0] ------------------ 1434| 49.6k| pos.copy_sizes(idx + 1, 1435| 49.6k| newr->d.count - 1, 1436| 49.6k| newr->d.sizes[0], 1437| 49.6k| newr->d.sizes + 1); 1438| 49.6k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 49.6k, False: 0] ------------------ 1439| 49.6k| pos.size() - dropped_size); 1440| 49.6k| newn->inner()[0] = get<1>(subs); 1441| 49.6k| std::copy(n->inner() + idx + 1, 1442| 49.6k| n->inner() + count, 1443| 49.6k| newn->inner() + 1); 1444| 49.6k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 49.6k| return std::make_tuple(pos.shift(), newn); 1446| 49.6k| } 1447| 49.6k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 49.6k| } 1452| 49.6k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE11visit_innerIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 2.14k| { 1415| 2.14k| auto idx = pos.subindex(first); 1416| 2.14k| auto count = pos.count(); 1417| 2.14k| auto left_size = pos.size_before(idx); 1418| 2.14k| auto child_size = pos.size_sbh(idx, left_size); 1419| 2.14k| auto dropped_size = first; 1420| 2.14k| auto child_dropped_size = dropped_size - left_size; 1421| 2.14k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 2.14k] | 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.14k| } else { 1424| 2.14k| using std::get; 1425| 2.14k| auto n = pos.node(); 1426| 2.14k| auto newc = count - idx; 1427| 2.14k| auto newn = node_t::make_inner_r_n(newc); 1428| 2.14k| IMMER_TRY { ------------------ | | 49| 2.14k|#define IMMER_TRY try ------------------ 1429| 2.14k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 2.14k| auto newr = newn->relaxed(); 1431| 2.14k| newr->d.count = count - idx; 1432| 2.14k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 2.14k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 2.14k, False: 0] ------------------ 1434| 2.14k| pos.copy_sizes(idx + 1, 1435| 2.14k| newr->d.count - 1, 1436| 2.14k| newr->d.sizes[0], 1437| 2.14k| newr->d.sizes + 1); 1438| 2.14k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 2.14k, False: 0] ------------------ 1439| 2.14k| pos.size() - dropped_size); 1440| 2.14k| newn->inner()[0] = get<1>(subs); 1441| 2.14k| std::copy(n->inner() + idx + 1, 1442| 2.14k| n->inner() + count, 1443| 2.14k| newn->inner() + 1); 1444| 2.14k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 2.14k| return std::make_tuple(pos.shift(), newn); 1446| 2.14k| } 1447| 2.14k| 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.14k| } 1452| 2.14k| } _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| 8.84k| { 1457| 8.84k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 8.84k| return std::make_tuple(0, n); 1459| 8.84k| } _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.26k| { 1415| 5.26k| auto idx = pos.subindex(first); 1416| 5.26k| auto count = pos.count(); 1417| 5.26k| auto left_size = pos.size_before(idx); 1418| 5.26k| auto child_size = pos.size_sbh(idx, left_size); 1419| 5.26k| auto dropped_size = first; 1420| 5.26k| auto child_dropped_size = dropped_size - left_size; 1421| 5.26k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 5.26k] | 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.26k| } else { 1424| 5.26k| using std::get; 1425| 5.26k| auto n = pos.node(); 1426| 5.26k| auto newc = count - idx; 1427| 5.26k| auto newn = node_t::make_inner_r_n(newc); 1428| 5.26k| IMMER_TRY { ------------------ | | 49| 5.26k|#define IMMER_TRY try ------------------ 1429| 5.26k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 5.26k| auto newr = newn->relaxed(); 1431| 5.26k| newr->d.count = count - idx; 1432| 5.26k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 5.26k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 5.26k, False: 0] ------------------ 1434| 5.26k| pos.copy_sizes(idx + 1, 1435| 5.26k| newr->d.count - 1, 1436| 5.26k| newr->d.sizes[0], 1437| 5.26k| newr->d.sizes + 1); 1438| 5.26k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 5.26k, False: 0] ------------------ 1439| 5.26k| pos.size() - dropped_size); 1440| 5.26k| newn->inner()[0] = get<1>(subs); 1441| 5.26k| std::copy(n->inner() + idx + 1, 1442| 5.26k| n->inner() + count, 1443| 5.26k| newn->inner() + 1); 1444| 5.26k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 5.26k| return std::make_tuple(pos.shift(), newn); 1446| 5.26k| } 1447| 5.26k| 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.26k| } 1452| 5.26k| } _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.05k| { 1415| 9.05k| auto idx = pos.subindex(first); 1416| 9.05k| auto count = pos.count(); 1417| 9.05k| auto left_size = pos.size_before(idx); 1418| 9.05k| auto child_size = pos.size_sbh(idx, left_size); 1419| 9.05k| auto dropped_size = first; 1420| 9.05k| auto child_dropped_size = dropped_size - left_size; 1421| 9.05k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 9.05k, Folded] | Branch (1421:25): [True: 6.45k, False: 2.60k] | Branch (1421:45): [True: 3.62k, False: 2.82k] ------------------ 1422| 3.62k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 5.43k| } else { 1424| 5.43k| using std::get; 1425| 5.43k| auto n = pos.node(); 1426| 5.43k| auto newc = count - idx; 1427| 5.43k| auto newn = node_t::make_inner_r_n(newc); 1428| 5.43k| IMMER_TRY { ------------------ | | 49| 5.43k|#define IMMER_TRY try ------------------ 1429| 5.43k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 5.43k| auto newr = newn->relaxed(); 1431| 5.43k| newr->d.count = count - idx; 1432| 5.43k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 5.43k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 5.43k, False: 0] ------------------ 1434| 5.43k| pos.copy_sizes(idx + 1, 1435| 5.43k| newr->d.count - 1, 1436| 5.43k| newr->d.sizes[0], 1437| 5.43k| newr->d.sizes + 1); 1438| 5.43k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 5.43k, False: 0] ------------------ 1439| 5.43k| pos.size() - dropped_size); 1440| 5.43k| newn->inner()[0] = get<1>(subs); 1441| 5.43k| std::copy(n->inner() + idx + 1, 1442| 5.43k| n->inner() + count, 1443| 5.43k| newn->inner() + 1); 1444| 5.43k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 5.43k| return std::make_tuple(pos.shift(), newn); 1446| 5.43k| } 1447| 5.43k| 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.43k| } 1452| 9.05k| } _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.56k| { 1415| 1.56k| auto idx = pos.subindex(first); 1416| 1.56k| auto count = pos.count(); 1417| 1.56k| auto left_size = pos.size_before(idx); 1418| 1.56k| auto child_size = pos.size_sbh(idx, left_size); 1419| 1.56k| auto dropped_size = first; 1420| 1.56k| auto child_dropped_size = dropped_size - left_size; 1421| 1.56k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 1.56k, Folded] | Branch (1421:25): [True: 514, False: 1.05k] | Branch (1421:45): [True: 304, False: 210] ------------------ 1422| 304| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 1.26k| } else { 1424| 1.26k| using std::get; 1425| 1.26k| auto n = pos.node(); 1426| 1.26k| auto newc = count - idx; 1427| 1.26k| auto newn = node_t::make_inner_r_n(newc); 1428| 1.26k| IMMER_TRY { ------------------ | | 49| 1.26k|#define IMMER_TRY try ------------------ 1429| 1.26k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 1.26k| auto newr = newn->relaxed(); 1431| 1.26k| newr->d.count = count - idx; 1432| 1.26k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 1.26k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 1.26k, False: 0] ------------------ 1434| 1.26k| pos.copy_sizes(idx + 1, 1435| 1.26k| newr->d.count - 1, 1436| 1.26k| newr->d.sizes[0], 1437| 1.26k| newr->d.sizes + 1); 1438| 1.26k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 1.26k, False: 0] ------------------ 1439| 1.26k| pos.size() - dropped_size); 1440| 1.26k| newn->inner()[0] = get<1>(subs); 1441| 1.26k| std::copy(n->inner() + idx + 1, 1442| 1.26k| n->inner() + count, 1443| 1.26k| newn->inner() + 1); 1444| 1.26k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 1.26k| return std::make_tuple(pos.shift(), newn); 1446| 1.26k| } 1447| 1.26k| 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.26k| } 1452| 1.56k| } _ZN5immer6detail4rbts12concat_treesINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_11relaxed_posIT_EEPSE_jSG_jm: 2001| 7.96k|{ 2002| 7.96k| return make_singleton_regular_sub_pos(ltail, ltcount) 2003| 7.96k| .visit(concat_trees_left_visitor{}, 2004| 7.96k| empty_leaf_pos{}, 2005| 7.96k| rroot, 2006| 7.96k| rshift, 2007| 7.96k| rsize) 2008| 7.96k| .realize(); 2009| 7.96k|} _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| 7.96k| { 1972| 7.96k| return visit_maybe_relaxed_sub( 1973| 7.96k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 7.96k| } _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.58k| { 1959| 5.58k| return concat_inners(lpos, tpos, rpos); 1960| 5.58k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 23.0k|{ 1873| 23.0k| auto lshift = lpos.shift(); 1874| 23.0k| auto rshift = rpos.shift(); 1875| 23.0k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 23.0k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 23.0k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 17.8k, False: 5.20k] ------------------ 1879| 17.8k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 17.8k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 17.8k| } else { 1882| 5.20k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 5.20k, False: 0] ------------------ 1883| 5.20k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 5.20k] | Branch (1883:9): [True: 5.20k, False: 0] | Branch (1883:9): [True: 5.20k, False: 0] ------------------ 1884| 5.20k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 5.20k| return concat_rebalance(lpos, cpos, rpos); 1886| 5.20k| } 1887| 23.0k|} _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.72M| { 1513| 5.72M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 534k, False: 5.19M] ------------------ 1514| 534k| auto s = size_t{}; 1515| 2.12M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 1.59M, False: 534k] ------------------ 1516| 1.59M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 1.59M| s = sizes_[i]; 1518| 1.59M| } 1519| 5.19M| } else { 1520| 13.2M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 8.01M, False: 5.19M] ------------------ 1521| 8.01M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 8.01M| .visit(v, args...); 1523| 5.19M| } 1524| 5.72M| } _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.55M| { 1734| 2.55M| auto count = p.count(); 1735| 2.55M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 2.55M, False: 0] ------------------ 1736| 2.55M| plan.counts[plan.n++] = count; 1737| 2.55M| plan.total += count; 1738| 2.55M| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_21concat_rebalance_planILj2ELj2EEEEEvOT_RT0_: 1733| 21.4M| { 1734| 21.4M| auto count = p.count(); 1735| 21.4M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 21.4M, False: 0] ------------------ 1736| 21.4M| plan.counts[plan.n++] = count; 1737| 21.4M| plan.total += count; 1738| 21.4M| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE7shuffleEj: 1762| 5.72M| { 1763| | // gcc seems to not really understand this code... :( 1764| 5.72M|#if !defined(_MSC_VER) 1765| 5.72M|#pragma GCC diagnostic push 1766| 5.72M|#pragma GCC diagnostic ignored "-Warray-bounds" 1767| 5.72M|#endif 1768| 5.72M| constexpr count_t rrb_extras = 2; 1769| 5.72M| constexpr count_t rrb_invariant = 1; 1770| 5.72M| const auto bits = shift == BL ? BL : B; ------------------ | Branch (1770:43): [True: 534k, False: 5.19M] ------------------ 1771| 5.72M| const auto branches = count_t{1} << bits; 1772| 5.72M| const auto optimal = ((total - 1) >> bits) + 1; 1773| 5.72M| count_t i = 0; 1774| 6.74M| while (n >= optimal + rrb_extras) { ------------------ | Branch (1774:16): [True: 1.01M, False: 5.72M] ------------------ 1775| | // skip ok nodes 1776| 1.69M| while (counts[i] > branches - rrb_invariant) ------------------ | Branch (1776:20): [True: 680k, False: 1.01M] ------------------ 1777| 680k| i++; 1778| 1.01M| assert(i < n); ------------------ | Branch (1778:13): [True: 1.01M, False: 0] ------------------ 1779| | // short node, redistribute 1780| 1.01M| auto remaining = counts[i]; 1781| 2.47M| do { 1782| 2.47M| auto next = counts[i + 1]; 1783| 2.47M| auto count = std::min(remaining + next, branches); 1784| 2.47M| counts[i] = count; 1785| 2.47M| assert(counts[i]); ------------------ | Branch (1785:17): [True: 2.47M, False: 0] ------------------ 1786| 2.47M| remaining += next - count; 1787| 2.47M| ++i; 1788| 2.47M| } while (remaining > 0); ------------------ | Branch (1788:22): [True: 1.46M, False: 1.01M] ------------------ 1789| | // remove node 1790| 1.01M| std::move(counts + i + 1, counts + n, counts + i); 1791| 1.01M| --n; 1792| 1.01M| --i; 1793| 1.01M| } 1794| 5.72M|#if !defined(_MSC_VER) 1795| 5.72M|#pragma GCC diagnostic pop 1796| 5.72M|#endif 1797| 5.72M| } _ZNK5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 1478| 11.4M| 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.72M| : curr_{counts} 1578| 5.72M| , n_{n} 1579| 5.72M| , result_{ 1580| 5.72M| shift + B, node_t::make_inner_r_n(std::min(n_, branches)), 0} 1581| 5.72M| { 1582| 5.72M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEC2EjPSC_m: 1481| 5.72M| : shift_{s} 1482| 5.72M| , count_{1} 1483| 5.72M| , nodes_{n0} 1484| 5.72M| , sizes_{s0} 1485| 5.72M| { 1486| 5.72M| } _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.72M| { 1513| 5.72M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 534k, False: 5.19M] ------------------ 1514| 534k| auto s = size_t{}; 1515| 2.12M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 1.59M, False: 534k] ------------------ 1516| 1.59M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 1.59M| s = sizes_[i]; 1518| 1.59M| } 1519| 5.19M| } else { 1520| 13.2M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 8.01M, False: 5.19M] ------------------ 1521| 8.01M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 8.01M| .visit(v, args...); 1523| 5.19M| } 1524| 5.72M| } _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.55M| { 1722| 2.55M| merger.merge_leaf(p); 1723| 2.55M| } _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.55M| { 1615| 2.55M| auto from = p.node(); 1616| 2.55M| auto from_size = p.size(); 1617| 2.55M| auto from_count = p.count(); 1618| 2.55M| assert(from_size); ------------------ | Branch (1618:9): [True: 2.55M, False: 0] ------------------ 1619| 2.55M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 2.52M, False: 26.8k] | Branch (1619:21): [True: 2.50M, False: 15.4k] ------------------ 1620| 2.50M| add_child(from, from_size); 1621| 2.50M| from->inc(); 1622| 2.50M| } else { 1623| 42.3k| auto from_offset = count_t{}; 1624| 42.3k| auto from_data = from->leaf(); 1625| 52.9k| do { 1626| 52.9k| if (!to_) { ------------------ | Branch (1626:21): [True: 26.1k, False: 26.8k] ------------------ 1627| 26.1k| to_ = node_t::make_leaf_n(*curr_); 1628| 26.1k| to_offset_ = 0; 1629| 26.1k| } 1630| 52.9k| auto data = to_->leaf(); 1631| 52.9k| auto to_copy = 1632| 52.9k| std::min(from_count - from_offset, *curr_ - to_offset_); 1633| 52.9k| detail::uninitialized_copy(from_data + from_offset, 1634| 52.9k| from_data + from_offset + to_copy, 1635| 52.9k| data + to_offset_); 1636| 52.9k| to_offset_ += to_copy; 1637| 52.9k| from_offset += to_copy; 1638| 52.9k| if (*curr_ == to_offset_) { ------------------ | Branch (1638:21): [True: 26.1k, False: 26.8k] ------------------ 1639| 26.1k| add_child(to_, to_offset_); 1640| 26.1k| to_ = nullptr; 1641| 26.1k| } 1642| 52.9k| } while (from_offset != from_count); ------------------ | Branch (1642:22): [True: 10.6k, False: 42.3k] ------------------ 1643| 42.3k| } 1644| 2.55M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9add_childEPSC_m: 1589| 25.3M| { 1590| 25.3M| assert(size); ------------------ | Branch (1590:9): [True: 25.3M, False: 0] ------------------ 1591| 25.3M| ++curr_; 1592| 25.3M| auto parent = result_.nodes_[result_.count_ - 1]; 1593| 25.3M| auto relaxed = parent->relaxed(); 1594| 25.3M| if (relaxed->d.count == branches) { ------------------ | Branch (1594:13): [True: 2.86M, False: 22.5M] ------------------ 1595| 2.86M| assert(result_.count_ < result_t::max_children); ------------------ | Branch (1595:13): [True: 2.86M, False: 0] ------------------ 1596| 2.86M| n_ -= branches; 1597| 2.86M| parent = node_t::make_inner_r_n(std::min(n_, branches)); 1598| 2.86M| relaxed = parent->relaxed(); 1599| 2.86M| result_.nodes_[result_.count_] = parent; 1600| 2.86M| result_.sizes_[result_.count_] = result_.sizes_[result_.count_ - 1]; 1601| 2.86M| assert(result_.sizes_[result_.count_]); ------------------ | Branch (1601:13): [True: 2.86M, False: 0] ------------------ 1602| 2.86M| ++result_.count_; 1603| 2.86M| } 1604| 25.3M| auto idx = relaxed->d.count++; 1605| 25.3M| result_.sizes_[result_.count_ - 1] += size; 1606| 25.3M| assert(result_.sizes_[result_.count_ - 1]); ------------------ | Branch (1606:9): [True: 25.3M, False: 0] ------------------ 1607| 25.3M| relaxed->d.sizes[idx] = size + (idx ? relaxed->d.sizes[idx - 1] : 0); ------------------ | Branch (1607:41): [True: 16.7M, False: 8.58M] ------------------ 1608| 25.3M| assert(relaxed->d.sizes[idx]); ------------------ | Branch (1608:9): [True: 25.3M, False: 0] ------------------ 1609| 25.3M| parent->inner()[idx] = p; 1610| 25.3M| }; _ZN5immer6detail4rbts21concat_merger_visitor11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1715| 21.4M| { 1716| 21.4M| merger.merge_inner(p); 1717| 21.4M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11merge_innerIRNS1_11relaxed_posISC_EEEEvOT_: 1648| 21.4M| { 1649| 21.4M| auto from = p.node(); 1650| 21.4M| auto from_size = p.size(); 1651| 21.4M| auto from_count = p.count(); 1652| 21.4M| assert(from_size); ------------------ | Branch (1652:9): [True: 21.4M, False: 0] ------------------ 1653| 21.4M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 19.0M, False: 2.35M] | Branch (1653:21): [True: 18.1M, False: 984k] ------------------ 1654| 18.1M| add_child(from, from_size); 1655| 18.1M| from->inc(); 1656| 18.1M| } else { 1657| 3.34M| auto from_offset = count_t{}; 1658| 3.34M| auto from_data = from->inner(); 1659| 4.70M| do { 1660| 4.70M| if (!to_) { ------------------ | Branch (1660:21): [True: 2.34M, False: 2.35M] ------------------ 1661| 2.34M| to_ = node_t::make_inner_r_n(*curr_); 1662| 2.34M| to_offset_ = 0; 1663| 2.34M| to_size_ = 0; 1664| 2.34M| } 1665| 4.70M| auto data = to_->inner(); 1666| 4.70M| auto to_copy = 1667| 4.70M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 4.70M| std::copy(from_data + from_offset, 1669| 4.70M| from_data + from_offset + to_copy, 1670| 4.70M| data + to_offset_); 1671| 4.70M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 4.70M| auto sizes = to_->relaxed()->d.sizes; 1673| 4.70M| p.copy_sizes( 1674| 4.70M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 4.70M| to_offset_ += to_copy; 1676| 4.70M| from_offset += to_copy; 1677| 4.70M| to_size_ = sizes[to_offset_ - 1]; 1678| 4.70M| assert(to_size_); ------------------ | Branch (1678:17): [True: 4.70M, False: 0] ------------------ 1679| 4.70M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 2.34M, False: 2.35M] ------------------ 1680| 2.34M| to_->relaxed()->d.count = to_offset_; 1681| 2.34M| add_child(to_, to_size_); 1682| 2.34M| to_ = nullptr; 1683| 2.34M| } 1684| 4.70M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 1.36M, False: 3.34M] ------------------ 1685| 3.34M| } 1686| 21.4M| } _ZNK5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE6finishEv: 1689| 5.72M| { 1690| 5.72M| assert(!to_); ------------------ | Branch (1690:9): [True: 5.72M, False: 0] ------------------ 1691| 5.72M| return result_; 1692| 5.72M| } _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.72M| { 1513| 5.72M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 534k, False: 5.19M] ------------------ 1514| 534k| auto s = size_t{}; 1515| 2.12M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 1.59M, False: 534k] ------------------ 1516| 1.59M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 1.59M| s = sizes_[i]; 1518| 1.59M| } 1519| 5.19M| } else { 1520| 13.2M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 8.01M, False: 5.19M] ------------------ 1521| 8.01M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 8.01M| .visit(v, args...); 1523| 5.19M| } 1524| 5.72M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEC2EjPSC_mSE_mSE_m: 1503| 526k| : shift_{s} 1504| 526k| , count_{3} 1505| 526k| , nodes_{n0, n1, n2} 1506| 526k| , sizes_{s0, s0 + s1, s0 + s1 + s2} 1507| 526k| { 1508| 526k| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEC2EjPSC_mSE_m: 1489| 7.96k| : shift_{s} 1490| 7.96k| , count_{2} 1491| 7.96k| , nodes_{n0, n1} 1492| 7.96k| , sizes_{s0, s0 + s1} 1493| 7.96k| { 1494| 7.96k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 17.4k| { 1918| 17.4k| return concat_inners(lpos, tpos, rpos); 1919| 17.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| 382| { 1918| 382| return concat_inners(lpos, tpos, rpos); 1919| 382| } _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.76k|{ 1873| 2.76k| auto lshift = lpos.shift(); 1874| 2.76k| auto rshift = rpos.shift(); 1875| 2.76k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 2.76k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 2.76k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 759, False: 2.00k] ------------------ 1879| 759| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 759| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 2.00k| } else { 1882| 2.00k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 2.00k, False: 0] ------------------ 1883| 2.00k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 2.00k] | Branch (1883:9): [True: 2.00k, False: 0] | Branch (1883:9): [True: 2.00k, False: 0] ------------------ 1884| 2.00k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 2.00k| return concat_rebalance(lpos, cpos, rpos); 1886| 2.00k| } 1887| 2.76k|} _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.13k| { 1918| 1.13k| return concat_inners(lpos, tpos, rpos); 1919| 1.13k| } _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.13k|{ 1873| 1.13k| auto lshift = lpos.shift(); 1874| 1.13k| auto rshift = rpos.shift(); 1875| 1.13k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 1.13k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 1.13k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 380, False: 759] ------------------ 1879| 380| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 380| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 759| } else { 1882| 759| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 759, False: 0] ------------------ 1883| 759| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 759] | Branch (1883:9): [True: 759, False: 0] | Branch (1883:9): [True: 759, False: 0] ------------------ 1884| 759| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 759| return concat_rebalance(lpos, cpos, rpos); 1886| 759| } 1887| 1.13k|} _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| 931|{ 1824| 931| auto plan = concat_rebalance_plan{}; 1825| 931| plan.fill(lpos, cpos, rpos); 1826| 931| plan.shuffle(cpos.shift()); 1827| 931| IMMER_TRY { ------------------ | | 49| 931|#define IMMER_TRY try ------------------ 1828| 931| return plan.merge(lpos, cpos, rpos); 1829| 931| } 1830| 931| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 931|} _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| 931| { 1753| 931| assert(n == 0u); ------------------ | Branch (1753:9): [True: 931, False: 0] ------------------ 1754| 931| assert(total == 0u); ------------------ | Branch (1754:9): [True: 931, False: 0] ------------------ 1755| 931| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 931| lpos.each_left_sub(visitor_t{}, *this); 1757| 931| cpos.each_sub(visitor_t{}, *this); 1758| 931| rpos.each_right_sub(visitor_t{}, *this); 1759| 931| } _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.02M| { 1734| 1.02M| auto count = p.count(); 1735| 1.02M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 1.02M, False: 0] ------------------ 1736| 1.02M| plan.counts[plan.n++] = count; 1737| 1.02M| plan.total += count; 1738| 1.02M| } _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| 717k| { 1734| 717k| auto count = p.count(); 1735| 717k| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 717k, False: 0] ------------------ 1736| 717k| plan.counts[plan.n++] = count; 1737| 717k| plan.total += count; 1738| 717k| } _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| 931| { 1803| 931| using node_t = node_type; 1804| 931| using merger_t = concat_merger; 1805| 931| using visitor_t = concat_merger_visitor; 1806| 931| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 931| IMMER_TRY { ------------------ | | 49| 931|#define IMMER_TRY try ------------------ 1808| 931| lpos.each_left_sub(visitor_t{}, merger); 1809| 931| cpos.each_sub(visitor_t{}, merger); 1810| 931| rpos.each_right_sub(visitor_t{}, merger); 1811| 931| cpos.each_sub(dec_visitor{}); 1812| 931| return merger.finish(); 1813| 931| } 1814| 931| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 931| } _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.02M| { 1722| 1.02M| merger.merge_leaf(p); 1723| 1.02M| } _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.02M| { 1615| 1.02M| auto from = p.node(); 1616| 1.02M| auto from_size = p.size(); 1617| 1.02M| auto from_count = p.count(); 1618| 1.02M| assert(from_size); ------------------ | Branch (1618:9): [True: 1.02M, False: 0] ------------------ 1619| 1.02M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 1.02M, False: 0] | Branch (1619:21): [True: 1.02M, False: 0] ------------------ 1620| 1.02M| add_child(from, from_size); 1621| 1.02M| from->inc(); 1622| 1.02M| } 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.02M| } _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| 717k| { 1716| 717k| merger.merge_inner(p); 1717| 717k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11merge_innerIRNS1_8full_posISC_EEEEvOT_: 1648| 717k| { 1649| 717k| auto from = p.node(); 1650| 717k| auto from_size = p.size(); 1651| 717k| auto from_count = p.count(); 1652| 717k| assert(from_size); ------------------ | Branch (1652:9): [True: 717k, False: 0] ------------------ 1653| 717k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 717k, False: 0] | Branch (1653:21): [True: 717k, False: 0] ------------------ 1654| 717k| add_child(from, from_size); 1655| 717k| from->inc(); 1656| 717k| } 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| 717k| } _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| 759| { 1945| 759| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 759| } _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.76k| { 1925| 2.76k| return concat_leafs(lpos, tpos, rpos); 1926| 2.76k| } _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.76k|{ 1839| 2.76k| static_assert(Node::bits >= 2, ""); 1840| 2.76k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 2.76k, False: 0] ------------------ 1841| 2.76k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 2.76k, False: 0] ------------------ 1842| 2.76k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 2.76k, False: 0] ------------------ 1843| 2.76k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 2.76k] ------------------ 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.76k| else 1854| 2.76k| return { 1855| 2.76k| Node::bits_leaf, 1856| 2.76k| lpos.node()->inc(), 1857| 2.76k| lpos.count(), 1858| 2.76k| rpos.node()->inc(), 1859| 2.76k| rpos.count(), 1860| 2.76k| }; 1861| 2.76k|} _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| 759|{ 1824| 759| auto plan = concat_rebalance_plan{}; 1825| 759| plan.fill(lpos, cpos, rpos); 1826| 759| plan.shuffle(cpos.shift()); 1827| 759| IMMER_TRY { ------------------ | | 49| 759|#define IMMER_TRY try ------------------ 1828| 759| return plan.merge(lpos, cpos, rpos); 1829| 759| } 1830| 759| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 759|} _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| 759| { 1753| 759| assert(n == 0u); ------------------ | Branch (1753:9): [True: 759, False: 0] ------------------ 1754| 759| assert(total == 0u); ------------------ | Branch (1754:9): [True: 759, False: 0] ------------------ 1755| 759| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 759| lpos.each_left_sub(visitor_t{}, *this); 1757| 759| cpos.each_sub(visitor_t{}, *this); 1758| 759| rpos.each_right_sub(visitor_t{}, *this); 1759| 759| } _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| 759| { 1803| 759| using node_t = node_type; 1804| 759| using merger_t = concat_merger; 1805| 759| using visitor_t = concat_merger_visitor; 1806| 759| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 759| IMMER_TRY { ------------------ | | 49| 759|#define IMMER_TRY try ------------------ 1808| 759| lpos.each_left_sub(visitor_t{}, merger); 1809| 759| cpos.each_sub(visitor_t{}, merger); 1810| 759| rpos.each_right_sub(visitor_t{}, merger); 1811| 759| cpos.each_sub(dec_visitor{}); 1812| 759| return merger.finish(); 1813| 759| } 1814| 759| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 759| } _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.08k|{ 1824| 2.08k| auto plan = concat_rebalance_plan{}; 1825| 2.08k| plan.fill(lpos, cpos, rpos); 1826| 2.08k| plan.shuffle(cpos.shift()); 1827| 2.08k| IMMER_TRY { ------------------ | | 49| 2.08k|#define IMMER_TRY try ------------------ 1828| 2.08k| return plan.merge(lpos, cpos, rpos); 1829| 2.08k| } 1830| 2.08k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.08k|} _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.08k| { 1753| 2.08k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.08k, False: 0] ------------------ 1754| 2.08k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.08k, False: 0] ------------------ 1755| 2.08k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.08k| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.08k| cpos.each_sub(visitor_t{}, *this); 1758| 2.08k| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.08k| } _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| 645k| { 1734| 645k| auto count = p.count(); 1735| 645k| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 645k, False: 0] ------------------ 1736| 645k| plan.counts[plan.n++] = count; 1737| 645k| plan.total += count; 1738| 645k| } _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.08k| { 1803| 2.08k| using node_t = node_type; 1804| 2.08k| using merger_t = concat_merger; 1805| 2.08k| using visitor_t = concat_merger_visitor; 1806| 2.08k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.08k| IMMER_TRY { ------------------ | | 49| 2.08k|#define IMMER_TRY try ------------------ 1808| 2.08k| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.08k| cpos.each_sub(visitor_t{}, merger); 1810| 2.08k| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.08k| cpos.each_sub(dec_visitor{}); 1812| 2.08k| return merger.finish(); 1813| 2.08k| } 1814| 2.08k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.08k| } _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| 645k| { 1716| 645k| merger.merge_inner(p); 1717| 645k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11merge_innerIRNS1_15regular_sub_posISC_EEEEvOT_: 1648| 645k| { 1649| 645k| auto from = p.node(); 1650| 645k| auto from_size = p.size(); 1651| 645k| auto from_count = p.count(); 1652| 645k| assert(from_size); ------------------ | Branch (1652:9): [True: 645k, False: 0] ------------------ 1653| 645k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 554k, False: 91.3k] | Branch (1653:21): [True: 554k, False: 0] ------------------ 1654| 554k| add_child(from, from_size); 1655| 554k| from->inc(); 1656| 554k| } else { 1657| 91.3k| auto from_offset = count_t{}; 1658| 91.3k| auto from_data = from->inner(); 1659| 182k| do { 1660| 182k| if (!to_) { ------------------ | Branch (1660:21): [True: 91.3k, False: 91.3k] ------------------ 1661| 91.3k| to_ = node_t::make_inner_r_n(*curr_); 1662| 91.3k| to_offset_ = 0; 1663| 91.3k| to_size_ = 0; 1664| 91.3k| } 1665| 182k| auto data = to_->inner(); 1666| 182k| auto to_copy = 1667| 182k| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 182k| std::copy(from_data + from_offset, 1669| 182k| from_data + from_offset + to_copy, 1670| 182k| data + to_offset_); 1671| 182k| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 182k| auto sizes = to_->relaxed()->d.sizes; 1673| 182k| p.copy_sizes( 1674| 182k| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 182k| to_offset_ += to_copy; 1676| 182k| from_offset += to_copy; 1677| 182k| to_size_ = sizes[to_offset_ - 1]; 1678| 182k| assert(to_size_); ------------------ | Branch (1678:17): [True: 182k, False: 0] ------------------ 1679| 182k| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 91.3k, False: 91.3k] ------------------ 1680| 91.3k| to_->relaxed()->d.count = to_offset_; 1681| 91.3k| add_child(to_, to_size_); 1682| 91.3k| to_ = nullptr; 1683| 91.3k| } 1684| 182k| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 91.3k, False: 91.3k] ------------------ 1685| 91.3k| } 1686| 645k| } _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.00k| { 1945| 2.00k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 2.00k| } _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.20k| { 1925| 5.20k| return concat_leafs(lpos, tpos, rpos); 1926| 5.20k| } _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.20k|{ 1839| 5.20k| static_assert(Node::bits >= 2, ""); 1840| 5.20k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 5.20k, False: 0] ------------------ 1841| 5.20k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 5.20k, False: 0] ------------------ 1842| 5.20k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 5.20k, False: 0] ------------------ 1843| 5.20k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 5.20k] ------------------ 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.20k| else 1854| 5.20k| return { 1855| 5.20k| Node::bits_leaf, 1856| 5.20k| lpos.node()->inc(), 1857| 5.20k| lpos.count(), 1858| 5.20k| rpos.node()->inc(), 1859| 5.20k| rpos.count(), 1860| 5.20k| }; 1861| 5.20k|} _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.00k|{ 1824| 2.00k| auto plan = concat_rebalance_plan{}; 1825| 2.00k| plan.fill(lpos, cpos, rpos); 1826| 2.00k| plan.shuffle(cpos.shift()); 1827| 2.00k| IMMER_TRY { ------------------ | | 49| 2.00k|#define IMMER_TRY try ------------------ 1828| 2.00k| return plan.merge(lpos, cpos, rpos); 1829| 2.00k| } 1830| 2.00k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.00k|} _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.00k| { 1753| 2.00k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.00k, False: 0] ------------------ 1754| 2.00k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.00k, False: 0] ------------------ 1755| 2.00k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.00k| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.00k| cpos.each_sub(visitor_t{}, *this); 1758| 2.00k| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.00k| } _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.00k| { 1803| 2.00k| using node_t = node_type; 1804| 2.00k| using merger_t = concat_merger; 1805| 2.00k| using visitor_t = concat_merger_visitor; 1806| 2.00k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.00k| IMMER_TRY { ------------------ | | 49| 2.00k|#define IMMER_TRY try ------------------ 1808| 2.00k| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.00k| cpos.each_sub(visitor_t{}, merger); 1810| 2.00k| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.00k| cpos.each_sub(dec_visitor{}); 1812| 2.00k| return merger.finish(); 1813| 2.00k| } 1814| 2.00k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.00k| } _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| 129k|{ 1824| 129k| auto plan = concat_rebalance_plan{}; 1825| 129k| plan.fill(lpos, cpos, rpos); 1826| 129k| plan.shuffle(cpos.shift()); 1827| 129k| IMMER_TRY { ------------------ | | 49| 129k|#define IMMER_TRY try ------------------ 1828| 129k| return plan.merge(lpos, cpos, rpos); 1829| 129k| } 1830| 129k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 129k|} _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| 129k| { 1753| 129k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 129k, False: 0] ------------------ 1754| 129k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 129k, False: 0] ------------------ 1755| 129k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 129k| lpos.each_left_sub(visitor_t{}, *this); 1757| 129k| cpos.each_sub(visitor_t{}, *this); 1758| 129k| rpos.each_right_sub(visitor_t{}, *this); 1759| 129k| } _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| 129k| { 1803| 129k| using node_t = node_type; 1804| 129k| using merger_t = concat_merger; 1805| 129k| using visitor_t = concat_merger_visitor; 1806| 129k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 129k| IMMER_TRY { ------------------ | | 49| 129k|#define IMMER_TRY try ------------------ 1808| 129k| lpos.each_left_sub(visitor_t{}, merger); 1809| 129k| cpos.each_sub(visitor_t{}, merger); 1810| 129k| rpos.each_right_sub(visitor_t{}, merger); 1811| 129k| cpos.each_sub(dec_visitor{}); 1812| 129k| return merger.finish(); 1813| 129k| } 1814| 129k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 129k| } _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.20k| { 1945| 5.20k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 5.20k| } _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.20k|{ 1824| 5.20k| auto plan = concat_rebalance_plan{}; 1825| 5.20k| plan.fill(lpos, cpos, rpos); 1826| 5.20k| plan.shuffle(cpos.shift()); 1827| 5.20k| IMMER_TRY { ------------------ | | 49| 5.20k|#define IMMER_TRY try ------------------ 1828| 5.20k| return plan.merge(lpos, cpos, rpos); 1829| 5.20k| } 1830| 5.20k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 5.20k|} _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.20k| { 1753| 5.20k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 5.20k, False: 0] ------------------ 1754| 5.20k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 5.20k, False: 0] ------------------ 1755| 5.20k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 5.20k| lpos.each_left_sub(visitor_t{}, *this); 1757| 5.20k| cpos.each_sub(visitor_t{}, *this); 1758| 5.20k| rpos.each_right_sub(visitor_t{}, *this); 1759| 5.20k| } _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.20k| { 1803| 5.20k| using node_t = node_type; 1804| 5.20k| using merger_t = concat_merger; 1805| 5.20k| using visitor_t = concat_merger_visitor; 1806| 5.20k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 5.20k| IMMER_TRY { ------------------ | | 49| 5.20k|#define IMMER_TRY try ------------------ 1808| 5.20k| lpos.each_left_sub(visitor_t{}, merger); 1809| 5.20k| cpos.each_sub(visitor_t{}, merger); 1810| 5.20k| rpos.each_right_sub(visitor_t{}, merger); 1811| 5.20k| cpos.each_sub(dec_visitor{}); 1812| 5.20k| return merger.finish(); 1813| 5.20k| } 1814| 5.20k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 5.20k| } _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.37k| { 1959| 2.37k| return concat_inners(lpos, tpos, rpos); 1960| 2.37k| } _ZNO5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7realizeEv: 1527| 534k| { 1528| 534k| if (count_ > 1) { ------------------ | Branch (1528:13): [True: 38.5k, False: 495k] ------------------ 1529| 38.5k| IMMER_TRY { ------------------ | | 49| 38.5k|#define IMMER_TRY try ------------------ 1530| 38.5k| auto result = node_t::make_inner_r_n(count_); 1531| 38.5k| auto r = result->relaxed(); 1532| 38.5k| r->d.count = count_; 1533| 38.5k| std::copy(nodes_, nodes_ + count_, result->inner()); 1534| 38.5k| std::copy(sizes_, sizes_ + count_, r->d.sizes); 1535| 38.5k| return {result, shift_, r}; 1536| 38.5k| } 1537| 38.5k| IMMER_CATCH (...) { 1538| 0| each_sub(dec_visitor{}); 1539| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1540| 0| } 1541| 495k| } else { 1542| 495k| assert(shift_ >= B + BL); ------------------ | Branch (1542:13): [True: 495k, False: 0] ------------------ 1543| 495k| return {nodes_[0], shift_ - B, nodes_[0]->relaxed()}; 1544| 495k| } 1545| 534k| } _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| 526k|{ 1987| 526k| return visit_maybe_relaxed_sub(lroot, 1988| 526k| lshift, 1989| 526k| lsize, 1990| 526k| concat_trees_left_visitor{}, 1991| 526k| make_leaf_pos(ltail, ltcount), 1992| 526k| rroot, 1993| 526k| rshift, 1994| 526k| rsize) 1995| 526k| .realize(); 1996| 526k|} _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| 512k| { 1972| 512k| return visit_maybe_relaxed_sub( 1973| 512k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 512k| } _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| 488k| { 1959| 488k| return concat_inners(lpos, tpos, rpos); 1960| 488k| } _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.65M|{ 1873| 4.65M| auto lshift = lpos.shift(); 1874| 4.65M| auto rshift = rpos.shift(); 1875| 4.65M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 2.25M, False: 2.40M] ------------------ 1876| 2.25M| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 2.25M| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 2.40M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 100k, False: 2.30M] ------------------ 1879| 100k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 100k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 2.30M| } else { 1882| 2.30M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 2.30M, False: 0] ------------------ 1883| 2.30M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 2.30M] | Branch (1883:9): [True: 2.30M, False: 0] | Branch (1883:9): [True: 2.30M, False: 0] ------------------ 1884| 2.30M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 2.30M| return concat_rebalance(lpos, cpos, rpos); 1886| 2.30M| } 1887| 4.65M|} _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.25M| { 1898| 2.25M| return concat_inners(lpos, tpos, rpos); 1899| 2.25M| } _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1897| 5.95k| { 1898| 5.95k| return concat_inners(lpos, tpos, rpos); 1899| 5.95k| } _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| 660k|{ 1873| 660k| auto lshift = lpos.shift(); 1874| 660k| auto rshift = rpos.shift(); 1875| 660k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 3.60k, False: 657k] ------------------ 1876| 3.60k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 3.60k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 657k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 10.9k, False: 646k] ------------------ 1879| 10.9k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 10.9k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 646k| } else { 1882| 646k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 646k, False: 0] ------------------ 1883| 646k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 646k] | Branch (1883:9): [True: 646k, False: 0] | Branch (1883:9): [True: 646k, False: 0] ------------------ 1884| 646k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 646k| return concat_rebalance(lpos, cpos, rpos); 1886| 646k| } 1887| 660k|} _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EENS1_12null_sub_posEEENSG_IT_EEOT0_OT1_OT2_: 1823| 4.34k|{ 1824| 4.34k| auto plan = concat_rebalance_plan{}; 1825| 4.34k| plan.fill(lpos, cpos, rpos); 1826| 4.34k| plan.shuffle(cpos.shift()); 1827| 4.34k| IMMER_TRY { ------------------ | | 49| 4.34k|#define IMMER_TRY try ------------------ 1828| 4.34k| return plan.merge(lpos, cpos, rpos); 1829| 4.34k| } 1830| 4.34k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 4.34k|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEEvOT_OT0_OT1_: 1752| 4.34k| { 1753| 4.34k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 4.34k, False: 0] ------------------ 1754| 4.34k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 4.34k, False: 0] ------------------ 1755| 4.34k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 4.34k| lpos.each_left_sub(visitor_t{}, *this); 1757| 4.34k| cpos.each_sub(visitor_t{}, *this); 1758| 4.34k| rpos.each_right_sub(visitor_t{}, *this); 1759| 4.34k| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 4.34k| { 1803| 4.34k| using node_t = node_type; 1804| 4.34k| using merger_t = concat_merger; 1805| 4.34k| using visitor_t = concat_merger_visitor; 1806| 4.34k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 4.34k| IMMER_TRY { ------------------ | | 49| 4.34k|#define IMMER_TRY try ------------------ 1808| 4.34k| lpos.each_left_sub(visitor_t{}, merger); 1809| 4.34k| cpos.each_sub(visitor_t{}, merger); 1810| 4.34k| rpos.each_right_sub(visitor_t{}, merger); 1811| 4.34k| cpos.each_sub(dec_visitor{}); 1812| 4.34k| return merger.finish(); 1813| 4.34k| } 1814| 4.34k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 4.34k| } _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| 648k| { 1918| 648k| return concat_inners(lpos, tpos, rpos); 1919| 648k| } _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| 100k| { 1918| 100k| return concat_inners(lpos, tpos, rpos); 1919| 100k| } _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| 109k|{ 1873| 109k| auto lshift = lpos.shift(); 1874| 109k| auto rshift = rpos.shift(); 1875| 109k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 742, False: 108k] ------------------ 1876| 742| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 742| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 108k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 608, False: 108k] ------------------ 1879| 608| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 608| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 108k| } else { 1882| 108k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 108k, False: 0] ------------------ 1883| 108k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 108k] | Branch (1883:9): [True: 108k, False: 0] | Branch (1883:9): [True: 108k, False: 0] ------------------ 1884| 108k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 108k| return concat_rebalance(lpos, cpos, rpos); 1886| 108k| } 1887| 109k|} _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.12k| { 1898| 1.12k| return concat_inners(lpos, tpos, rpos); 1899| 1.12k| } _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| 121k| { 1918| 121k| return concat_inners(lpos, tpos, rpos); 1919| 121k| } _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| 121k|{ 1873| 121k| auto lshift = lpos.shift(); 1874| 121k| auto rshift = rpos.shift(); 1875| 121k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 121k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 121k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 289, False: 121k] ------------------ 1879| 289| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 289| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 121k| } else { 1882| 121k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 121k, False: 0] ------------------ 1883| 121k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 121k] | Branch (1883:9): [True: 121k, False: 0] | Branch (1883:9): [True: 121k, False: 0] ------------------ 1884| 121k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 121k| return concat_rebalance(lpos, cpos, rpos); 1886| 121k| } 1887| 121k|} _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| 66.2k| { 1945| 66.2k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 66.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| 136k| { 1925| 136k| return concat_leafs(lpos, tpos, rpos); 1926| 136k| } _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| 136k|{ 1839| 136k| static_assert(Node::bits >= 2, ""); 1840| 136k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 136k, False: 0] ------------------ 1841| 136k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 136k, False: 0] ------------------ 1842| 136k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 136k, False: 0] ------------------ 1843| 136k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 136k, False: 0] ------------------ 1844| 136k| return { 1845| 136k| Node::bits_leaf, 1846| 136k| lpos.node()->inc(), 1847| 136k| lpos.count(), 1848| 136k| tpos.node()->inc(), 1849| 136k| tpos.count(), 1850| 136k| rpos.node()->inc(), 1851| 136k| rpos.count(), 1852| 136k| }; 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| 136k|} _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| 59.6k| { 1938| 59.6k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 59.6k| } _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| 121k|{ 1824| 121k| auto plan = concat_rebalance_plan{}; 1825| 121k| plan.fill(lpos, cpos, rpos); 1826| 121k| plan.shuffle(cpos.shift()); 1827| 121k| IMMER_TRY { ------------------ | | 49| 121k|#define IMMER_TRY try ------------------ 1828| 121k| return plan.merge(lpos, cpos, rpos); 1829| 121k| } 1830| 121k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 121k|} _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| 121k| { 1753| 121k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 121k, False: 0] ------------------ 1754| 121k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 121k, False: 0] ------------------ 1755| 121k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 121k| lpos.each_left_sub(visitor_t{}, *this); 1757| 121k| cpos.each_sub(visitor_t{}, *this); 1758| 121k| rpos.each_right_sub(visitor_t{}, *this); 1759| 121k| } _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| 121k| { 1803| 121k| using node_t = node_type; 1804| 121k| using merger_t = concat_merger; 1805| 121k| using visitor_t = concat_merger_visitor; 1806| 121k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 121k| IMMER_TRY { ------------------ | | 49| 121k|#define IMMER_TRY try ------------------ 1808| 121k| lpos.each_left_sub(visitor_t{}, merger); 1809| 121k| cpos.each_sub(visitor_t{}, merger); 1810| 121k| rpos.each_right_sub(visitor_t{}, merger); 1811| 121k| cpos.each_sub(dec_visitor{}); 1812| 121k| return merger.finish(); 1813| 121k| } 1814| 121k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 121k| } _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| 70.1k| { 1945| 70.1k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 70.1k| } _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| 389k| { 1925| 389k| return concat_leafs(lpos, tpos, rpos); 1926| 389k| } _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| 389k|{ 1839| 389k| static_assert(Node::bits >= 2, ""); 1840| 389k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 389k, False: 0] ------------------ 1841| 389k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 389k, False: 0] ------------------ 1842| 389k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 389k, False: 0] ------------------ 1843| 389k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 389k, False: 0] ------------------ 1844| 389k| return { 1845| 389k| Node::bits_leaf, 1846| 389k| lpos.node()->inc(), 1847| 389k| lpos.count(), 1848| 389k| tpos.node()->inc(), 1849| 389k| tpos.count(), 1850| 389k| rpos.node()->inc(), 1851| 389k| rpos.count(), 1852| 389k| }; 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| 389k|} _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| 61.3k| { 1938| 61.3k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 61.3k| } _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| 108k|{ 1824| 108k| auto plan = concat_rebalance_plan{}; 1825| 108k| plan.fill(lpos, cpos, rpos); 1826| 108k| plan.shuffle(cpos.shift()); 1827| 108k| IMMER_TRY { ------------------ | | 49| 108k|#define IMMER_TRY try ------------------ 1828| 108k| return plan.merge(lpos, cpos, rpos); 1829| 108k| } 1830| 108k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 108k|} _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| 108k| { 1753| 108k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 108k, False: 0] ------------------ 1754| 108k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 108k, False: 0] ------------------ 1755| 108k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 108k| lpos.each_left_sub(visitor_t{}, *this); 1757| 108k| cpos.each_sub(visitor_t{}, *this); 1758| 108k| rpos.each_right_sub(visitor_t{}, *this); 1759| 108k| } _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| 108k| { 1803| 108k| using node_t = node_type; 1804| 108k| using merger_t = concat_merger; 1805| 108k| using visitor_t = concat_merger_visitor; 1806| 108k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 108k| IMMER_TRY { ------------------ | | 49| 108k|#define IMMER_TRY try ------------------ 1808| 108k| lpos.each_left_sub(visitor_t{}, merger); 1809| 108k| cpos.each_sub(visitor_t{}, merger); 1810| 108k| rpos.each_right_sub(visitor_t{}, merger); 1811| 108k| cpos.each_sub(dec_visitor{}); 1812| 108k| return merger.finish(); 1813| 108k| } 1814| 108k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 108k| } _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| 389k| { 1945| 389k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 389k| } _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| 738k| { 1938| 738k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 738k| } _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| 646k|{ 1824| 646k| auto plan = concat_rebalance_plan{}; 1825| 646k| plan.fill(lpos, cpos, rpos); 1826| 646k| plan.shuffle(cpos.shift()); 1827| 646k| IMMER_TRY { ------------------ | | 49| 646k|#define IMMER_TRY try ------------------ 1828| 646k| return plan.merge(lpos, cpos, rpos); 1829| 646k| } 1830| 646k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 646k|} _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| 646k| { 1753| 646k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 646k, False: 0] ------------------ 1754| 646k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 646k, False: 0] ------------------ 1755| 646k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 646k| lpos.each_left_sub(visitor_t{}, *this); 1757| 646k| cpos.each_sub(visitor_t{}, *this); 1758| 646k| rpos.each_right_sub(visitor_t{}, *this); 1759| 646k| } _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| 646k| { 1803| 646k| using node_t = node_type; 1804| 646k| using merger_t = concat_merger; 1805| 646k| using visitor_t = concat_merger_visitor; 1806| 646k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 646k| IMMER_TRY { ------------------ | | 49| 646k|#define IMMER_TRY try ------------------ 1808| 646k| lpos.each_left_sub(visitor_t{}, merger); 1809| 646k| cpos.each_sub(visitor_t{}, merger); 1810| 646k| rpos.each_right_sub(visitor_t{}, merger); 1811| 646k| cpos.each_sub(dec_visitor{}); 1812| 646k| return merger.finish(); 1813| 646k| } 1814| 646k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 646k| } _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.36M|{ 1824| 2.36M| auto plan = concat_rebalance_plan{}; 1825| 2.36M| plan.fill(lpos, cpos, rpos); 1826| 2.36M| plan.shuffle(cpos.shift()); 1827| 2.36M| IMMER_TRY { ------------------ | | 49| 2.36M|#define IMMER_TRY try ------------------ 1828| 2.36M| return plan.merge(lpos, cpos, rpos); 1829| 2.36M| } 1830| 2.36M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.36M|} _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.36M| { 1753| 2.36M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.36M, False: 0] ------------------ 1754| 2.36M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.36M, False: 0] ------------------ 1755| 2.36M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.36M| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.36M| cpos.each_sub(visitor_t{}, *this); 1758| 2.36M| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.36M| } _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.36M| { 1803| 2.36M| using node_t = node_type; 1804| 2.36M| using merger_t = concat_merger; 1805| 2.36M| using visitor_t = concat_merger_visitor; 1806| 2.36M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.36M| IMMER_TRY { ------------------ | | 49| 2.36M|#define IMMER_TRY try ------------------ 1808| 2.36M| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.36M| cpos.each_sub(visitor_t{}, merger); 1810| 2.36M| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.36M| cpos.each_sub(dec_visitor{}); 1812| 2.36M| return merger.finish(); 1813| 2.36M| } 1814| 2.36M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.36M| } _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.91M| { 1918| 1.91M| return concat_inners(lpos, tpos, rpos); 1919| 1.91M| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 4.38k| { 1918| 4.38k| return concat_inners(lpos, tpos, rpos); 1919| 4.38k| } _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| 143k|{ 1873| 143k| auto lshift = lpos.shift(); 1874| 143k| auto rshift = rpos.shift(); 1875| 143k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 116k, False: 27.4k] ------------------ 1876| 116k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 116k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 116k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 714, False: 26.7k] ------------------ 1879| 714| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 714| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 26.7k| } else { 1882| 26.7k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 26.7k, False: 0] ------------------ 1883| 26.7k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 26.7k] | Branch (1883:9): [True: 26.7k, False: 0] | Branch (1883:9): [True: 26.7k, False: 0] ------------------ 1884| 26.7k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 26.7k| return concat_rebalance(lpos, cpos, rpos); 1886| 26.7k| } 1887| 143k|} _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| 116k| { 1898| 116k| return concat_inners(lpos, tpos, rpos); 1899| 116k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_8full_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 6.74k| { 1918| 6.74k| return concat_inners(lpos, tpos, rpos); 1919| 6.74k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 6.74k|{ 1873| 6.74k| auto lshift = lpos.shift(); 1874| 6.74k| auto rshift = rpos.shift(); 1875| 6.74k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 6.74k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 6.74k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 262, False: 6.48k] ------------------ 1879| 262| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 262| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 6.48k| } else { 1882| 6.48k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 6.48k, False: 0] ------------------ 1883| 6.48k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 6.48k] | Branch (1883:9): [True: 6.48k, False: 0] | Branch (1883:9): [True: 6.48k, False: 0] ------------------ 1884| 6.48k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 6.48k| return concat_rebalance(lpos, cpos, rpos); 1886| 6.48k| } 1887| 6.74k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 2.22k| { 1938| 2.22k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 2.22k| } _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| 6.48k|{ 1824| 6.48k| auto plan = concat_rebalance_plan{}; 1825| 6.48k| plan.fill(lpos, cpos, rpos); 1826| 6.48k| plan.shuffle(cpos.shift()); 1827| 6.48k| IMMER_TRY { ------------------ | | 49| 6.48k|#define IMMER_TRY try ------------------ 1828| 6.48k| return plan.merge(lpos, cpos, rpos); 1829| 6.48k| } 1830| 6.48k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 6.48k|} _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| 6.48k| { 1753| 6.48k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 6.48k, False: 0] ------------------ 1754| 6.48k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 6.48k, False: 0] ------------------ 1755| 6.48k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 6.48k| lpos.each_left_sub(visitor_t{}, *this); 1757| 6.48k| cpos.each_sub(visitor_t{}, *this); 1758| 6.48k| rpos.each_right_sub(visitor_t{}, *this); 1759| 6.48k| } _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| 6.48k| { 1803| 6.48k| using node_t = node_type; 1804| 6.48k| using merger_t = concat_merger; 1805| 6.48k| using visitor_t = concat_merger_visitor; 1806| 6.48k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 6.48k| IMMER_TRY { ------------------ | | 49| 6.48k|#define IMMER_TRY try ------------------ 1808| 6.48k| lpos.each_left_sub(visitor_t{}, merger); 1809| 6.48k| cpos.each_sub(visitor_t{}, merger); 1810| 6.48k| rpos.each_right_sub(visitor_t{}, merger); 1811| 6.48k| cpos.each_sub(dec_visitor{}); 1812| 6.48k| return merger.finish(); 1813| 6.48k| } 1814| 6.48k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 6.48k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 3.54k| { 1938| 3.54k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 3.54k| } _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| 26.7k|{ 1824| 26.7k| auto plan = concat_rebalance_plan{}; 1825| 26.7k| plan.fill(lpos, cpos, rpos); 1826| 26.7k| plan.shuffle(cpos.shift()); 1827| 26.7k| IMMER_TRY { ------------------ | | 49| 26.7k|#define IMMER_TRY try ------------------ 1828| 26.7k| return plan.merge(lpos, cpos, rpos); 1829| 26.7k| } 1830| 26.7k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 26.7k|} _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| 26.7k| { 1753| 26.7k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 26.7k, False: 0] ------------------ 1754| 26.7k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 26.7k, False: 0] ------------------ 1755| 26.7k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 26.7k| lpos.each_left_sub(visitor_t{}, *this); 1757| 26.7k| cpos.each_sub(visitor_t{}, *this); 1758| 26.7k| rpos.each_right_sub(visitor_t{}, *this); 1759| 26.7k| } _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| 26.7k| { 1803| 26.7k| using node_t = node_type; 1804| 26.7k| using merger_t = concat_merger; 1805| 26.7k| using visitor_t = concat_merger_visitor; 1806| 26.7k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 26.7k| IMMER_TRY { ------------------ | | 49| 26.7k|#define IMMER_TRY try ------------------ 1808| 26.7k| lpos.each_left_sub(visitor_t{}, merger); 1809| 26.7k| cpos.each_sub(visitor_t{}, merger); 1810| 26.7k| rpos.each_right_sub(visitor_t{}, merger); 1811| 26.7k| cpos.each_sub(dec_visitor{}); 1812| 26.7k| return merger.finish(); 1813| 26.7k| } 1814| 26.7k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 26.7k| } _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.82M| { 1938| 1.82M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 1.82M| } _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.30M|{ 1824| 2.30M| auto plan = concat_rebalance_plan{}; 1825| 2.30M| plan.fill(lpos, cpos, rpos); 1826| 2.30M| plan.shuffle(cpos.shift()); 1827| 2.30M| IMMER_TRY { ------------------ | | 49| 2.30M|#define IMMER_TRY try ------------------ 1828| 2.30M| return plan.merge(lpos, cpos, rpos); 1829| 2.30M| } 1830| 2.30M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.30M|} _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.30M| { 1753| 2.30M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.30M, False: 0] ------------------ 1754| 2.30M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.30M, False: 0] ------------------ 1755| 2.30M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.30M| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.30M| cpos.each_sub(visitor_t{}, *this); 1758| 2.30M| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.30M| } _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.30M| { 1803| 2.30M| using node_t = node_type; 1804| 2.30M| using merger_t = concat_merger; 1805| 2.30M| using visitor_t = concat_merger_visitor; 1806| 2.30M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.30M| IMMER_TRY { ------------------ | | 49| 2.30M|#define IMMER_TRY try ------------------ 1808| 2.30M| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.30M| cpos.each_sub(visitor_t{}, merger); 1810| 2.30M| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.30M| cpos.each_sub(dec_visitor{}); 1812| 2.30M| return merger.finish(); 1813| 2.30M| } 1814| 2.30M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.30M| } _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| 23.4k| { 1959| 23.4k| return concat_inners(lpos, tpos, rpos); 1960| 23.4k| } _ZN5immer6detail4rbts25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_nodeIRNS1_15regular_sub_posISC_EENS1_8leaf_posISC_EEJRPSC_RjRmEEENS1_17concat_center_posISC_EEOT_OT0_DpOT1_: 1971| 14.1k| { 1972| 14.1k| return visit_maybe_relaxed_sub( 1973| 14.1k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 14.1k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_nodeIRNS1_11relaxed_posISC_EERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 6.26k| { 1959| 6.26k| return concat_inners(lpos, tpos, rpos); 1960| 6.26k| } _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.90k| { 1959| 7.90k| return concat_inners(lpos, tpos, rpos); 1960| 7.90k| } _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| 48.5k| { 681| 48.5k| auto node = pos.node(); 682| 48.5k| auto level = pos.shift(); 683| 48.5k| auto idx = pos.count() - 1; 684| 48.5k| auto children = pos.size(idx); 685| 48.5k| auto new_idx = 686| 48.5k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 2.25k, False: 46.3k] | Branch (686:47): [True: 490, False: 45.8k] ------------------ 687| 48.5k| auto new_child = static_cast(nullptr); 688| 48.5k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [True: 48.5k, Folded] | Branch (688:38): [True: 45.2k, False: 3.31k] ------------------ 689| | 690| 48.5k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 1.06k, False: 47.5k] ------------------ 691| 1.06k| return nullptr; 692| 47.5k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 45.8k, False: 1.68k] ------------------ 693| 45.8k| new_child = 694| 45.8k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 43.5k, False: 2.31k] ------------------ 695| 45.8k| : pos.last_oh_csh( 696| 2.31k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 45.8k| if (!new_child) { ------------------ | Branch (697:17): [True: 763, False: 45.0k] ------------------ 698| 763| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 417, False: 346] ------------------ 699| 417| new_child = node_t::make_path_e(e, level - B, tail); 700| 346| else 701| 346| return nullptr; 702| 763| } 703| 45.8k| } else 704| 1.68k| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 47.1k| if (mutate) { ------------------ | Branch (706:13): [True: 44.9k, False: 2.20k] ------------------ 707| 44.9k| auto count = new_idx + 1; 708| 44.9k| auto relaxed = node->ensure_mutable_relaxed_n(e, new_idx); 709| 44.9k| node->inner()[new_idx] = new_child; 710| 44.9k| relaxed->d.sizes[new_idx] = pos.size() + ts; 711| 44.9k| relaxed->d.count = count; 712| 44.9k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (712:13): [True: 44.9k, False: 0] ------------------ 713| 44.9k| return node; 714| 44.9k| } else { 715| 2.20k| IMMER_TRY { ------------------ | | 49| 2.20k|#define IMMER_TRY try ------------------ 716| 2.20k| auto count = new_idx + 1; 717| 2.20k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 2.20k| auto relaxed = new_node->relaxed(); 719| 2.20k| new_node->inner()[new_idx] = new_child; 720| 2.20k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 2.20k| relaxed->d.count = count; 722| 2.20k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 2.20k, False: 0] ------------------ 723| 2.20k| if (Mutating) ------------------ | Branch (723:21): [True: 2.20k, Folded] ------------------ 724| 2.20k| pos.visit(dec_visitor{}); 725| 2.20k| return new_node; 726| 2.20k| } 727| 2.20k| IMMER_CATCH (...) { 728| 0| auto shift = pos.shift(); 729| 0| auto size = new_idx == idx ? children + ts : ts; ------------------ | Branch (729:30): [True: 0, False: 0] ------------------ 730| 0| if (shift > BL) { ------------------ | Branch (730:21): [True: 0, False: 0] ------------------ 731| 0| tail->inc(); 732| 0| dec_inner(new_child, shift - B, size); 733| 0| } 734| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 735| 0| } 736| 2.20k| } 737| 47.1k| } _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| 34.4k| { 742| 34.4k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 34.4k, False: 0] ------------------ 743| 34.4k| auto node = pos.node(); 744| 34.4k| auto idx = pos.index(pos.size() - 1); 745| 34.4k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 34.4k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 34.4k, Folded] | Branch (746:36): [True: 33.7k, False: 643] ------------------ 747| 34.4k| if (mutate) { ------------------ | Branch (747:13): [True: 33.7k, False: 643] ------------------ 748| 33.7k| node->inner()[new_idx] = 749| 33.7k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 32.8k, False: 954] ------------------ 750| | /* otherwise */ 751| 33.7k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 33.7k| return node; 753| 33.7k| } else { 754| 643| auto new_parent = node_t::make_inner_e(e); 755| 643| IMMER_TRY { ------------------ | | 49| 643|#define IMMER_TRY try ------------------ 756| 643| new_parent->inner()[new_idx] = 757| 643| idx == new_idx ------------------ | Branch (757:21): [True: 334, False: 309] ------------------ 758| 643| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 643| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 643| node_t::do_copy_inner(new_parent, node, new_idx); 762| 643| if (Mutating) ------------------ | Branch (762:21): [True: 643, Folded] ------------------ 763| 643| pos.visit(dec_visitor{}); 764| 643| return new_parent; 765| 643| } 766| 643| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 643| } 771| 34.4k| } _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| 857k| { 742| 857k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 857k, False: 0] ------------------ 743| 857k| auto node = pos.node(); 744| 857k| auto idx = pos.index(pos.size() - 1); 745| 857k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 857k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 857k, Folded] | Branch (746:36): [True: 857k, False: 542] ------------------ 747| 857k| if (mutate) { ------------------ | Branch (747:13): [True: 857k, False: 542] ------------------ 748| 857k| node->inner()[new_idx] = 749| 857k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 672k, False: 185k] ------------------ 750| | /* otherwise */ 751| 857k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 857k| return node; 753| 857k| } else { 754| 542| auto new_parent = node_t::make_inner_e(e); 755| 542| IMMER_TRY { ------------------ | | 49| 542|#define IMMER_TRY try ------------------ 756| 542| new_parent->inner()[new_idx] = 757| 542| idx == new_idx ------------------ | Branch (757:21): [True: 224, False: 318] ------------------ 758| 542| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 542| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 542| node_t::do_copy_inner(new_parent, node, new_idx); 762| 542| if (Mutating) ------------------ | Branch (762:21): [True: 542, Folded] ------------------ 763| 542| pos.visit(dec_visitor{}); 764| 542| return new_parent; 765| 542| } 766| 542| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 542| } 771| 857k| } _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| 2.65k| { 742| 2.65k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 2.65k, False: 0] ------------------ 743| 2.65k| auto node = pos.node(); 744| 2.65k| auto idx = pos.index(pos.size() - 1); 745| 2.65k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 2.65k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 2.65k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 2.65k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 2.65k] ------------------ 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| 2.65k| } else { 754| 2.65k| auto new_parent = node_t::make_inner_e(e); 755| 2.65k| IMMER_TRY { ------------------ | | 49| 2.65k|#define IMMER_TRY try ------------------ 756| 2.65k| new_parent->inner()[new_idx] = 757| 2.65k| idx == new_idx ------------------ | Branch (757:21): [True: 1.18k, False: 1.46k] ------------------ 758| 2.65k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 2.65k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 2.65k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 2.65k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 2.65k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 2.65k| return new_parent; 765| 2.65k| } 766| 2.65k| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 2.65k| } 771| 2.65k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEEPSC_OT_NSA_5applyIS7_E4type4editESI_j: 680| 6.61k| { 681| 6.61k| auto node = pos.node(); 682| 6.61k| auto level = pos.shift(); 683| 6.61k| auto idx = pos.count() - 1; 684| 6.61k| auto children = pos.size(idx); 685| 6.61k| auto new_idx = 686| 6.61k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 917, False: 5.69k] | Branch (686:47): [True: 361, False: 5.33k] ------------------ 687| 6.61k| auto new_child = static_cast(nullptr); 688| 6.61k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [Folded, False: 6.61k] | Branch (688:38): [True: 0, False: 0] ------------------ 689| | 690| 6.61k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 565, False: 6.05k] ------------------ 691| 565| return nullptr; 692| 6.05k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 5.33k, False: 713] ------------------ 693| 5.33k| new_child = 694| 5.33k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 0, False: 5.33k] ------------------ 695| 5.33k| : pos.last_oh_csh( 696| 5.33k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 5.33k| if (!new_child) { ------------------ | Branch (697:17): [True: 487, False: 4.85k] ------------------ 698| 487| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 253, False: 234] ------------------ 699| 253| new_child = node_t::make_path_e(e, level - B, tail); 700| 234| else 701| 234| return nullptr; 702| 487| } 703| 5.33k| } else 704| 713| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 5.81k| if (mutate) { ------------------ | Branch (706:13): [True: 0, False: 5.81k] ------------------ 707| 0| auto count = new_idx + 1; 708| 0| auto relaxed = node->ensure_mutable_relaxed_n(e, new_idx); 709| 0| node->inner()[new_idx] = new_child; 710| 0| relaxed->d.sizes[new_idx] = pos.size() + ts; 711| 0| relaxed->d.count = count; 712| 0| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (712:13): [True: 0, False: 0] ------------------ 713| 0| return node; 714| 5.81k| } else { 715| 5.81k| IMMER_TRY { ------------------ | | 49| 5.81k|#define IMMER_TRY try ------------------ 716| 5.81k| auto count = new_idx + 1; 717| 5.81k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 5.81k| auto relaxed = new_node->relaxed(); 719| 5.81k| new_node->inner()[new_idx] = new_child; 720| 5.81k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 5.81k| relaxed->d.count = count; 722| 5.81k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 5.81k, False: 0] ------------------ 723| 5.81k| if (Mutating) ------------------ | Branch (723:21): [Folded, False: 5.81k] ------------------ 724| 0| pos.visit(dec_visitor{}); 725| 5.81k| return new_node; 726| 5.81k| } 727| 5.81k| IMMER_CATCH (...) { 728| 0| auto shift = pos.shift(); 729| 0| auto size = new_idx == idx ? children + ts : ts; ------------------ | Branch (729:30): [True: 0, False: 0] ------------------ 730| 0| if (shift > BL) { ------------------ | Branch (730:21): [True: 0, False: 0] ------------------ 731| 0| tail->inc(); 732| 0| dec_inner(new_child, shift - B, size); 733| 0| } 734| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 735| 0| } 736| 5.81k| } 737| 5.81k| } _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.03k| { 742| 1.03k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 1.03k, False: 0] ------------------ 743| 1.03k| auto node = pos.node(); 744| 1.03k| auto idx = pos.index(pos.size() - 1); 745| 1.03k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 1.03k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 1.03k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 1.03k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 1.03k] ------------------ 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.03k| } else { 754| 1.03k| auto new_parent = node_t::make_inner_e(e); 755| 1.03k| IMMER_TRY { ------------------ | | 49| 1.03k|#define IMMER_TRY try ------------------ 756| 1.03k| new_parent->inner()[new_idx] = 757| 1.03k| idx == new_idx ------------------ | Branch (757:21): [True: 619, False: 414] ------------------ 758| 1.03k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 1.03k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 1.03k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 1.03k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 1.03k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 1.03k| return new_parent; 765| 1.03k| } 766| 1.03k| 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.03k| } 771| 1.03k| } _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| 157k| { 742| 157k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 157k, False: 0] ------------------ 743| 157k| auto node = pos.node(); 744| 157k| auto idx = pos.index(pos.size() - 1); 745| 157k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 157k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 157k, Folded] | Branch (746:36): [True: 156k, False: 542] ------------------ 747| 157k| if (mutate) { ------------------ | Branch (747:13): [True: 156k, False: 542] ------------------ 748| 156k| node->inner()[new_idx] = 749| 156k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 152k, False: 3.70k] ------------------ 750| | /* otherwise */ 751| 156k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 156k| return node; 753| 156k| } else { 754| 542| auto new_parent = node_t::make_inner_e(e); 755| 542| IMMER_TRY { ------------------ | | 49| 542|#define IMMER_TRY try ------------------ 756| 542| new_parent->inner()[new_idx] = 757| 542| idx == new_idx ------------------ | Branch (757:21): [True: 292, False: 250] ------------------ 758| 542| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 542| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 542| node_t::do_copy_inner(new_parent, node, new_idx); 762| 542| if (Mutating) ------------------ | Branch (762:21): [True: 542, Folded] ------------------ 763| 542| pos.visit(dec_visitor{}); 764| 542| return new_parent; 765| 542| } 766| 542| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 542| } 771| 157k| } _ZN5immer6detail4rbts17dec_empty_regularINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEvPT_: 580| 2.49k|{ 581| 2.49k| make_empty_regular_pos(node).visit(dec_visitor()); 582| 2.49k|} _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| 70.2k| { 596| 70.2k| auto offset = pos.index(idx); 597| 70.2k| auto count = pos.count(); 598| 70.2k| auto node = pos.node(); 599| 70.2k| if (node->can_mutate(e)) { ------------------ | Branch (599:13): [True: 60.6k, False: 9.60k] ------------------ 600| 60.6k| return pos.towards_oh( 601| 60.6k| this_t{}, idx, offset, e, &node->inner()[offset]); 602| 60.6k| } else { 603| 9.60k| auto new_node = node_t::copy_inner_sr_e(e, node, count); 604| 9.60k| IMMER_TRY { ------------------ | | 49| 9.60k|#define IMMER_TRY try ------------------ 605| 9.60k| auto& res = pos.towards_oh( 606| 9.60k| this_t{}, idx, offset, e, &new_node->inner()[offset]); 607| 9.60k| pos.visit(dec_visitor{}); 608| 9.60k| *location = new_node; 609| 9.60k| return res; 610| 9.60k| } 611| 9.60k| IMMER_CATCH (...) { 612| 0| dec_relaxed(new_node, pos.shift()); 613| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 614| 0| } 615| 9.60k| } 616| 70.2k| } _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| 13.5k| { 653| 13.5k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 13.5k, False: 0] ------------------ 654| 13.5k| auto node = pos.node(); 655| 13.5k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 11.4k, False: 2.03k] ------------------ 656| 11.4k| return node->leaf()[pos.index(idx)]; 657| 11.4k| } else { 658| 2.03k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 2.03k| pos.visit(dec_visitor{}); 660| 2.03k| *location = new_node; 661| 2.03k| return new_node->leaf()[pos.index(idx)]; 662| 2.03k| } 663| 13.5k| } _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| 9.13k| { 622| 9.13k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 9.13k, False: 0] ------------------ 623| 9.13k| auto offset = pos.index(idx); 624| 9.13k| auto count = pos.count(); 625| 9.13k| auto node = pos.node(); 626| 9.13k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 7.85k, False: 1.28k] ------------------ 627| 7.85k| return pos.towards_oh_ch( 628| 7.85k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 7.85k| } else { 630| 1.28k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.28k| IMMER_TRY { ------------------ | | 49| 1.28k|#define IMMER_TRY try ------------------ 632| 1.28k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.28k| idx, 634| 1.28k| offset, 635| 1.28k| count, 636| 1.28k| e, 637| 1.28k| &new_node->inner()[offset]); 638| 1.28k| pos.visit(dec_visitor{}); 639| 1.28k| *location = new_node; 640| 1.28k| return res; 641| 1.28k| } 642| 1.28k| 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.28k| } 647| 9.13k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_13full_leaf_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 652| 7.86k| { 653| 7.86k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 7.86k, False: 0] ------------------ 654| 7.86k| auto node = pos.node(); 655| 7.86k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 6.25k, False: 1.60k] ------------------ 656| 6.25k| return node->leaf()[pos.index(idx)]; 657| 6.25k| } else { 658| 1.60k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 1.60k| pos.visit(dec_visitor{}); 660| 1.60k| *location = new_node; 661| 1.60k| return new_node->leaf()[pos.index(idx)]; 662| 1.60k| } 663| 7.86k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_regularIRNS1_8full_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 621| 6.11k| { 622| 6.11k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 6.11k, False: 0] ------------------ 623| 6.11k| auto offset = pos.index(idx); 624| 6.11k| auto count = pos.count(); 625| 6.11k| auto node = pos.node(); 626| 6.11k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 4.72k, False: 1.39k] ------------------ 627| 4.72k| return pos.towards_oh_ch( 628| 4.72k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 4.72k| } else { 630| 1.39k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.39k| IMMER_TRY { ------------------ | | 49| 1.39k|#define IMMER_TRY try ------------------ 632| 1.39k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.39k| idx, 634| 1.39k| offset, 635| 1.39k| count, 636| 1.39k| e, 637| 1.39k| &new_node->inner()[offset]); 638| 1.39k| pos.visit(dec_visitor{}); 639| 1.39k| *location = new_node; 640| 1.39k| return res; 641| 1.39k| } 642| 1.39k| 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.39k| } 647| 6.11k| } _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.27k| { 653| 1.27k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 1.27k, False: 0] ------------------ 654| 1.27k| auto node = pos.node(); 655| 1.27k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 875, False: 396] ------------------ 656| 875| return node->leaf()[pos.index(idx)]; 657| 875| } else { 658| 396| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 396| pos.visit(dec_visitor{}); 660| 396| *location = new_node; 661| 396| return new_node->leaf()[pos.index(idx)]; 662| 396| } 663| 1.27k| } _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.01k| { 622| 2.01k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 2.01k, False: 0] ------------------ 623| 2.01k| auto offset = pos.index(idx); 624| 2.01k| auto count = pos.count(); 625| 2.01k| auto node = pos.node(); 626| 2.01k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.70k, False: 307] ------------------ 627| 1.70k| return pos.towards_oh_ch( 628| 1.70k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.70k| } else { 630| 307| auto new_node = node_t::copy_inner_e(e, node, count); 631| 307| IMMER_TRY { ------------------ | | 49| 307|#define IMMER_TRY try ------------------ 632| 307| auto& res = pos.towards_oh_ch(this_t{}, 633| 307| idx, 634| 307| offset, 635| 307| count, 636| 307| e, 637| 307| &new_node->inner()[offset]); 638| 307| pos.visit(dec_visitor{}); 639| 307| *location = new_node; 640| 307| return res; 641| 307| } 642| 307| 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| 307| } 647| 2.01k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 913| 55.3k| { 914| 55.3k| auto idx = pos.index(last); 915| 55.3k| auto node = pos.node(); 916| 55.3k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 55.3k, Folded] | Branch (916:35): [True: 45.9k, False: 9.36k] ------------------ 917| 55.3k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 55.3k, Folded] | Branch (917:25): [True: 37.4k, False: 17.9k] ------------------ 918| 37.4k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 31.8k, False: 5.52k] ------------------ 919| 37.4k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 37.4k| if (Mutating) ------------------ | Branch (920:17): [True: 37.4k, Folded] ------------------ 921| 37.4k| pos.visit(dec_right_visitor{}, count_t{1}); 922| 37.4k| return res; 923| 37.4k| } else { 924| 17.9k| using std::get; 925| 17.9k| auto subs = 926| 17.9k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 14.1k, False: 3.83k] ------------------ 927| 17.9k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 17.9k| auto next = get<1>(subs); 929| 17.9k| auto ts = get<2>(subs); 930| 17.9k| auto tail = get<3>(subs); 931| 17.9k| IMMER_TRY { ------------------ | | 49| 17.9k|#define IMMER_TRY try ------------------ 932| 17.9k| if (next) { ------------------ | Branch (932:21): [True: 12.0k, False: 5.87k] ------------------ 933| 12.0k| if (mutate) { ------------------ | Branch (933:25): [True: 9.86k, False: 2.21k] ------------------ 934| 9.86k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 9.86k| pos.each_right(dec_visitor{}, idx + 1); 936| 9.86k| node->inner()[idx] = next; 937| 9.86k| nodr->d.sizes[idx] = last + 1 - ts; 938| 9.86k| nodr->d.count = idx + 1; 939| 9.86k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 9.86k, False: 0] ------------------ 940| 9.86k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 9.86k| } else { 942| 2.21k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 2.21k| auto newr = newn->relaxed(); 944| 2.21k| newn->inner()[idx] = next; 945| 2.21k| newr->d.sizes[idx] = last + 1 - ts; 946| 2.21k| newr->d.count = idx + 1; 947| 2.21k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 2.21k, False: 0] ------------------ 948| 2.21k| if (Mutating) ------------------ | Branch (948:29): [True: 2.21k, Folded] ------------------ 949| 2.21k| pos.visit(dec_visitor{}); 950| 2.21k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 2.21k| } 952| 12.0k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 5.87k] ------------------ 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| 5.87k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 5.87k, Folded] | Branch (956:40): [True: 4.21k, False: 1.65k] | Branch (956:52): [True: 3.73k, False: 475] ------------------ 957| 3.73k| auto newn = pos.node()->inner()[0]; 958| 3.73k| if (!mutate) ------------------ | Branch (958:25): [True: 959, False: 2.77k] ------------------ 959| 959| newn->inc(); 960| 3.73k| if (Mutating) ------------------ | Branch (960:25): [True: 3.73k, Folded] ------------------ 961| 3.73k| pos.visit(dec_right_visitor{}, count_t{2}); 962| 3.73k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 3.73k| } else { 964| 2.13k| if (mutate) { ------------------ | Branch (964:25): [True: 1.46k, False: 667] ------------------ 965| 1.46k| pos.each_right(dec_visitor{}, idx + 1); 966| 1.46k| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 1.46k| return std::make_tuple(pos.shift(), node, ts, tail); 968| 1.46k| } else { 969| 667| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 667| if (Mutating) ------------------ | Branch (970:29): [True: 667, Folded] ------------------ 971| 667| pos.visit(dec_visitor{}); 972| 667| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 667| } 974| 2.13k| } 975| 17.9k| } 976| 17.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| 17.9k| } 987| 55.3k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 1.17k| { 1060| 1.17k| auto old_tail_size = pos.count(); 1061| 1.17k| auto new_tail_size = pos.index(last) + 1; 1062| 1.17k| auto node = pos.node(); 1063| 1.17k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.17k, Folded] | Branch (1063:42): [True: 260, False: 913] ------------------ 1064| 1.17k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 386, False: 787] ------------------ 1065| 386| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 386] ------------------ 1066| 0| node->inc(); 1067| 386| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 787| } else if (mutate) { ------------------ | Branch (1068:20): [True: 243, False: 544] ------------------ 1069| 243| detail::destroy_n(node->leaf() + new_tail_size, 1070| 243| old_tail_size - new_tail_size); 1071| 243| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 544| } else { 1073| 544| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 544| if (Mutating) ------------------ | Branch (1074:17): [True: 544, Folded] ------------------ 1075| 544| pos.visit(dec_visitor{}); 1076| 544| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 544| } 1078| 1.17k| } _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| 530| { 1060| 530| auto old_tail_size = pos.count(); 1061| 530| auto new_tail_size = pos.index(last) + 1; 1062| 530| auto node = pos.node(); 1063| 530| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 530] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 530| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 244, False: 286] ------------------ 1065| 244| if (!Mutating) ------------------ | Branch (1065:17): [True: 244, Folded] ------------------ 1066| 244| node->inc(); 1067| 244| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 286| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 286] ------------------ 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| 286| } else { 1073| 286| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 286| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 286] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 286| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 286| } 1078| 530| } _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| 22.8k| { 914| 22.8k| auto idx = pos.index(last); 915| 22.8k| auto node = pos.node(); 916| 22.8k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 22.8k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 22.8k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 22.8k, Folded] | Branch (917:25): [True: 19.2k, False: 3.64k] ------------------ 918| 19.2k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 0, False: 19.2k] ------------------ 919| 19.2k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 19.2k| if (Mutating) ------------------ | Branch (920:17): [Folded, False: 19.2k] ------------------ 921| 0| pos.visit(dec_right_visitor{}, count_t{1}); 922| 19.2k| return res; 923| 19.2k| } else { 924| 3.64k| using std::get; 925| 3.64k| auto subs = 926| 3.64k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 3.64k] ------------------ 927| 3.64k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 3.64k| auto next = get<1>(subs); 929| 3.64k| auto ts = get<2>(subs); 930| 3.64k| auto tail = get<3>(subs); 931| 3.64k| IMMER_TRY { ------------------ | | 49| 3.64k|#define IMMER_TRY try ------------------ 932| 3.64k| if (next) { ------------------ | Branch (932:21): [True: 1.20k, False: 2.43k] ------------------ 933| 1.20k| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 1.20k] ------------------ 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.20k| } else { 942| 1.20k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 1.20k| auto newr = newn->relaxed(); 944| 1.20k| newn->inner()[idx] = next; 945| 1.20k| newr->d.sizes[idx] = last + 1 - ts; 946| 1.20k| newr->d.count = idx + 1; 947| 1.20k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 1.20k, False: 0] ------------------ 948| 1.20k| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 1.20k] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 1.20k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 1.20k| } 952| 2.43k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 2.43k] ------------------ 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| 2.43k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 2.43k, Folded] | Branch (956:40): [True: 782, False: 1.65k] | Branch (956:52): [True: 522, False: 260] ------------------ 957| 522| auto newn = pos.node()->inner()[0]; 958| 522| if (!mutate) ------------------ | Branch (958:25): [True: 522, False: 0] ------------------ 959| 522| newn->inc(); 960| 522| if (Mutating) ------------------ | Branch (960:25): [Folded, False: 522] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 522| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 1.91k| } else { 964| 1.91k| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 1.91k] ------------------ 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.91k| } else { 969| 1.91k| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 1.91k| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 1.91k] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 1.91k| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 1.91k| } 974| 1.91k| } 975| 3.64k| } 976| 3.64k| IMMER_CATCH (...) { 977| 0| assert(!mutate); ------------------ | Branch (977:17): [True: 0, False: 0] ------------------ 978| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] ------------------ 979| 0| if (next) ------------------ | Branch (979:21): [True: 0, False: 0] ------------------ 980| 0| dec_inner(next, 981| 0| pos.shift() - B, 982| 0| last + 1 - ts - pos.size_before(idx)); 983| 0| dec_leaf(tail, ts); 984| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 985| 0| } 986| 3.64k| } 987| 22.8k| } _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.35k| { 992| 1.35k| auto idx = pos.index(last); 993| 1.35k| auto node = pos.node(); 994| 1.35k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.35k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.35k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.35k, Folded] | Branch (995:25): [True: 446, False: 912] ------------------ 996| 446| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 446] ------------------ 997| 446| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 446| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 446] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 446| return res; 1001| 912| } else { 1002| 912| using std::get; 1003| 912| auto subs = 1004| 912| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 912] ------------------ 1005| 912| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 912| auto next = get<1>(subs); 1007| 912| auto ts = get<2>(subs); 1008| 912| auto tail = get<3>(subs); 1009| 912| IMMER_TRY { ------------------ | | 49| 912|#define IMMER_TRY try ------------------ 1010| 912| if (next) { ------------------ | Branch (1010:21): [True: 221, False: 691] ------------------ 1011| 221| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 221] ------------------ 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| 221| } else { 1016| 221| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 221| newn->inner()[idx] = next; 1018| 221| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 221] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 221| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 221| } 1022| 691| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 691] ------------------ 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| 691| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 691, Folded] | Branch (1026:40): [True: 445, False: 246] | Branch (1026:52): [True: 78, False: 367] ------------------ 1027| 78| auto newn = pos.node()->inner()[0]; 1028| 78| if (!mutate) ------------------ | Branch (1028:25): [True: 78, False: 0] ------------------ 1029| 78| newn->inc(); 1030| 78| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 78] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 78| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 613| } else { 1034| 613| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 613] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 613| } else { 1038| 613| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 613| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 613] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 613| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 613| } 1043| 613| } 1044| 912| } 1045| 912| 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| 912| } 1055| 1.35k| } _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.45k| { 1060| 1.45k| auto old_tail_size = pos.count(); 1061| 1.45k| auto new_tail_size = pos.index(last) + 1; 1062| 1.45k| auto node = pos.node(); 1063| 1.45k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 1.45k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 1.45k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 702, False: 757] ------------------ 1065| 702| if (!Mutating) ------------------ | Branch (1065:17): [True: 702, Folded] ------------------ 1066| 702| node->inc(); 1067| 702| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 757| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 757] ------------------ 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| 757| } else { 1073| 757| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 757| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 757] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 757| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 757| } 1078| 1.45k| } _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.79k| { 992| 1.79k| auto idx = pos.index(last); 993| 1.79k| auto node = pos.node(); 994| 1.79k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.79k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.79k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.79k, Folded] | Branch (995:25): [True: 678, False: 1.12k] ------------------ 996| 678| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 678] ------------------ 997| 678| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 678| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 678] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 678| return res; 1001| 1.12k| } else { 1002| 1.12k| using std::get; 1003| 1.12k| auto subs = 1004| 1.12k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 1.12k] ------------------ 1005| 1.12k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.12k| auto next = get<1>(subs); 1007| 1.12k| auto ts = get<2>(subs); 1008| 1.12k| auto tail = get<3>(subs); 1009| 1.12k| IMMER_TRY { ------------------ | | 49| 1.12k|#define IMMER_TRY try ------------------ 1010| 1.12k| if (next) { ------------------ | Branch (1010:21): [True: 211, False: 910] ------------------ 1011| 211| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 211] ------------------ 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| 211| } else { 1016| 211| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 211| newn->inner()[idx] = next; 1018| 211| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 211] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 211| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 211| } 1022| 910| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 910] ------------------ 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| 910| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 910, Folded] | Branch (1026:40): [True: 703, False: 207] | Branch (1026:52): [True: 242, False: 461] ------------------ 1027| 242| auto newn = pos.node()->inner()[0]; 1028| 242| if (!mutate) ------------------ | Branch (1028:25): [True: 242, False: 0] ------------------ 1029| 242| newn->inc(); 1030| 242| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 242] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 242| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 668| } else { 1034| 668| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 668] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 668| } else { 1038| 668| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 668| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 668] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 668| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 668| } 1043| 668| } 1044| 1.12k| } 1045| 1.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| 1.12k| } 1055| 1.79k| } _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.00k| { 1060| 5.00k| auto old_tail_size = pos.count(); 1061| 5.00k| auto new_tail_size = pos.index(last) + 1; 1062| 5.00k| auto node = pos.node(); 1063| 5.00k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 5.00k, Folded] | Branch (1063:42): [True: 959, False: 4.04k] ------------------ 1064| 5.00k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.15k, False: 3.85k] ------------------ 1065| 1.15k| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 1.15k] ------------------ 1066| 0| node->inc(); 1067| 1.15k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 3.85k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 948, False: 2.90k] ------------------ 1069| 948| detail::destroy_n(node->leaf() + new_tail_size, 1070| 948| old_tail_size - new_tail_size); 1071| 948| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 2.90k| } else { 1073| 2.90k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 2.90k| if (Mutating) ------------------ | Branch (1074:17): [True: 2.90k, Folded] ------------------ 1075| 2.90k| pos.visit(dec_visitor{}); 1076| 2.90k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 2.90k| } 1078| 5.00k| } _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.21k| { 992| 4.21k| auto idx = pos.index(last); 993| 4.21k| auto node = pos.node(); 994| 4.21k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 4.21k, Folded] | Branch (994:35): [True: 2.17k, False: 2.04k] ------------------ 995| 4.21k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 4.21k] | 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.21k| } else { 1002| 4.21k| using std::get; 1003| 4.21k| auto subs = 1004| 4.21k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 2.17k, False: 2.04k] ------------------ 1005| 4.21k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 4.21k| auto next = get<1>(subs); 1007| 4.21k| auto ts = get<2>(subs); 1008| 4.21k| auto tail = get<3>(subs); 1009| 4.21k| IMMER_TRY { ------------------ | | 49| 4.21k|#define IMMER_TRY try ------------------ 1010| 4.21k| if (next) { ------------------ | Branch (1010:21): [True: 657, False: 3.56k] ------------------ 1011| 657| if (mutate) { ------------------ | Branch (1011:25): [True: 432, False: 225] ------------------ 1012| 432| node->inner()[idx] = next; 1013| 432| pos.each_right(dec_visitor{}, idx + 1); 1014| 432| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 432| } else { 1016| 225| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 225| newn->inner()[idx] = next; 1018| 225| if (Mutating) ------------------ | Branch (1018:29): [True: 225, Folded] ------------------ 1019| 225| pos.visit(dec_visitor{}); 1020| 225| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 225| } 1022| 3.56k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.46k, False: 2.09k] ------------------ 1023| 1.46k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.46k, Folded] ------------------ 1024| 1.46k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.46k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 2.09k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 2.09k] | 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.09k| } else { 1034| 2.09k| if (mutate) { ------------------ | Branch (1034:25): [True: 1.05k, False: 1.04k] ------------------ 1035| 1.05k| pos.each_right(dec_visitor{}, idx + 1); 1036| 1.05k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.05k| } else { 1038| 1.04k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.04k| if (Mutating) ------------------ | Branch (1039:29): [True: 1.04k, Folded] ------------------ 1040| 1.04k| pos.visit(dec_visitor{}); 1041| 1.04k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.04k| } 1043| 2.09k| } 1044| 4.21k| } 1045| 4.21k| 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.21k| } 1055| 4.21k| } _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.63k| { 879| 3.63k| using node_t = node_type; 880| 3.63k| auto node = p.node(); 881| 3.63k| if (node->dec()) { ------------------ | Branch (881:13): [True: 1.96k, False: 1.66k] ------------------ 882| 1.96k| p.each_right(dec_t{}, idx); 883| 1.96k| node_t::delete_inner(node, p.count()); 884| 1.96k| } 885| 3.63k| } _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.27k| { 1060| 9.27k| auto old_tail_size = pos.count(); 1061| 9.27k| auto new_tail_size = pos.index(last) + 1; 1062| 9.27k| auto node = pos.node(); 1063| 9.27k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 9.27k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 9.27k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 2.93k, False: 6.34k] ------------------ 1065| 2.93k| if (!Mutating) ------------------ | Branch (1065:17): [True: 2.93k, Folded] ------------------ 1066| 2.93k| node->inc(); 1067| 2.93k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 6.34k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 6.34k] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 6.34k| } else { 1073| 6.34k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 6.34k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 6.34k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 6.34k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 6.34k| } 1078| 9.27k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 3.17k| { 992| 3.17k| auto idx = pos.index(last); 993| 3.17k| auto node = pos.node(); 994| 3.17k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.17k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.17k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.17k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 0] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 3.17k| } else { 1002| 3.17k| using std::get; 1003| 3.17k| auto subs = 1004| 3.17k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.17k] ------------------ 1005| 3.17k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.17k| auto next = get<1>(subs); 1007| 3.17k| auto ts = get<2>(subs); 1008| 3.17k| auto tail = get<3>(subs); 1009| 3.17k| IMMER_TRY { ------------------ | | 49| 3.17k|#define IMMER_TRY try ------------------ 1010| 3.17k| if (next) { ------------------ | Branch (1010:21): [True: 320, False: 2.85k] ------------------ 1011| 320| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 320] ------------------ 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| 320| } else { 1016| 320| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 320| newn->inner()[idx] = next; 1018| 320| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 320] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 320| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 320| } 1022| 2.85k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.17k, False: 1.68k] ------------------ 1023| 1.17k| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 1.17k] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.17k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.68k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.68k] | Branch (1026:40): [True: 0, False: 0] | Branch (1026:52): [True: 0, False: 0] ------------------ 1027| 0| auto newn = pos.node()->inner()[0]; 1028| 0| if (!mutate) ------------------ | Branch (1028:25): [True: 0, False: 0] ------------------ 1029| 0| newn->inc(); 1030| 0| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 0] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 1.68k| } else { 1034| 1.68k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 1.68k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.68k| } else { 1038| 1.68k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.68k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 1.68k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 1.68k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.68k| } 1043| 1.68k| } 1044| 3.17k| } 1045| 3.17k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 3.17k| } 1055| 3.17k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb0EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 398| { 1060| 398| auto old_tail_size = pos.count(); 1061| 398| auto new_tail_size = pos.index(last) + 1; 1062| 398| auto node = pos.node(); 1063| 398| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 398] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 398| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 200, False: 198] ------------------ 1065| 200| if (!Mutating) ------------------ | Branch (1065:17): [True: 200, Folded] ------------------ 1066| 200| node->inc(); 1067| 200| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 200| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 198] ------------------ 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| 198| } else { 1073| 198| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 198| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 198] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 198| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 198| } 1078| 398| } _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.49k| { 1060| 2.49k| auto old_tail_size = pos.count(); 1061| 2.49k| auto new_tail_size = pos.index(last) + 1; 1062| 2.49k| auto node = pos.node(); 1063| 2.49k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 2.49k, Folded] | Branch (1063:42): [True: 421, False: 2.07k] ------------------ 1064| 2.49k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 250, False: 2.24k] ------------------ 1065| 250| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 250] ------------------ 1066| 0| node->inc(); 1067| 250| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 2.24k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 391, False: 1.85k] ------------------ 1069| 391| detail::destroy_n(node->leaf() + new_tail_size, 1070| 391| old_tail_size - new_tail_size); 1071| 391| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.85k| } else { 1073| 1.85k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.85k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.85k, Folded] ------------------ 1075| 1.85k| pos.visit(dec_visitor{}); 1076| 1.85k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.85k| } 1078| 2.49k| } _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.48k| { 992| 6.48k| auto idx = pos.index(last); 993| 6.48k| auto node = pos.node(); 994| 6.48k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 6.48k, Folded] | Branch (994:35): [True: 5.87k, False: 607] ------------------ 995| 6.48k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 6.48k] | 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.48k| } else { 1002| 6.48k| using std::get; 1003| 6.48k| auto subs = 1004| 6.48k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 5.87k, False: 607] ------------------ 1005| 6.48k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 6.48k| auto next = get<1>(subs); 1007| 6.48k| auto ts = get<2>(subs); 1008| 6.48k| auto tail = get<3>(subs); 1009| 6.48k| IMMER_TRY { ------------------ | | 49| 6.48k|#define IMMER_TRY try ------------------ 1010| 6.48k| if (next) { ------------------ | Branch (1010:21): [True: 1.51k, False: 4.97k] ------------------ 1011| 1.51k| if (mutate) { ------------------ | Branch (1011:25): [True: 1.31k, False: 197] ------------------ 1012| 1.31k| node->inner()[idx] = next; 1013| 1.31k| pos.each_right(dec_visitor{}, idx + 1); 1014| 1.31k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 1.31k| } else { 1016| 197| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 197| newn->inner()[idx] = next; 1018| 197| if (Mutating) ------------------ | Branch (1018:29): [True: 197, Folded] ------------------ 1019| 197| pos.visit(dec_visitor{}); 1020| 197| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 197| } 1022| 4.97k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 4.30k, False: 669] ------------------ 1023| 4.30k| if (Mutating) ------------------ | Branch (1023:25): [True: 4.30k, Folded] ------------------ 1024| 4.30k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 4.30k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 4.30k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 669] | 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| 669| } else { 1034| 669| if (mutate) { ------------------ | Branch (1034:25): [True: 463, False: 206] ------------------ 1035| 463| pos.each_right(dec_visitor{}, idx + 1); 1036| 463| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 463| } else { 1038| 206| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 206| if (Mutating) ------------------ | Branch (1039:29): [True: 206, Folded] ------------------ 1040| 206| pos.visit(dec_visitor{}); 1041| 206| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 206| } 1043| 669| } 1044| 6.48k| } 1045| 6.48k| 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.48k| } 1055| 6.48k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_j: 878| 4.30k| { 879| 4.30k| using node_t = node_type; 880| 4.30k| auto node = p.node(); 881| 4.30k| if (node->dec()) { ------------------ | Branch (881:13): [True: 4.09k, False: 204] ------------------ 882| 4.09k| p.each_right(dec_t{}, idx); 883| 4.09k| node_t::delete_inner(node, p.count()); 884| 4.09k| } 885| 4.30k| } _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.42k| { 1060| 2.42k| auto old_tail_size = pos.count(); 1061| 2.42k| auto new_tail_size = pos.index(last) + 1; 1062| 2.42k| auto node = pos.node(); 1063| 2.42k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 2.42k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 2.42k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 674, False: 1.75k] ------------------ 1065| 674| if (!Mutating) ------------------ | Branch (1065:17): [True: 674, Folded] ------------------ 1066| 674| node->inc(); 1067| 674| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.75k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 1.75k] ------------------ 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.75k| } else { 1073| 1.75k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.75k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 1.75k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 1.75k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.75k| } 1078| 2.42k| } _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.24k| { 992| 3.24k| auto idx = pos.index(last); 993| 3.24k| auto node = pos.node(); 994| 3.24k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.24k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.24k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.24k] | 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.24k| } else { 1002| 3.24k| using std::get; 1003| 3.24k| auto subs = 1004| 3.24k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.24k] ------------------ 1005| 3.24k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.24k| auto next = get<1>(subs); 1007| 3.24k| auto ts = get<2>(subs); 1008| 3.24k| auto tail = get<3>(subs); 1009| 3.24k| IMMER_TRY { ------------------ | | 49| 3.24k|#define IMMER_TRY try ------------------ 1010| 3.24k| if (next) { ------------------ | Branch (1010:21): [True: 515, False: 2.72k] ------------------ 1011| 515| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 515] ------------------ 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| 515| } else { 1016| 515| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 515| newn->inner()[idx] = next; 1018| 515| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 515] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 515| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 515| } 1022| 2.72k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.83k, False: 888] ------------------ 1023| 1.83k| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 1.83k] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.83k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.83k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 888] | 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| 888| } else { 1034| 888| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 888] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 888| } else { 1038| 888| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 888| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 888] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 888| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 888| } 1043| 888| } 1044| 3.24k| } 1045| 3.24k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 3.24k| } 1055| 3.24k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_j: 867| 44.2k| { 868| 44.2k| using node_t = node_type; 869| 44.2k| auto node = p.node(); 870| 44.2k| if (node->dec()) { ------------------ | Branch (870:13): [True: 36.8k, False: 7.41k] ------------------ 871| 36.8k| p.each_right(dec_t{}, idx); 872| 36.8k| node_t::delete_inner_r(node, p.count()); 873| 36.8k| } 874| 44.2k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 4.64k| { 1060| 4.64k| auto old_tail_size = pos.count(); 1061| 4.64k| auto new_tail_size = pos.index(last) + 1; 1062| 4.64k| auto node = pos.node(); 1063| 4.64k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 4.64k, Folded] | Branch (1063:42): [True: 1.18k, False: 3.45k] ------------------ 1064| 4.64k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.80k, False: 2.83k] ------------------ 1065| 1.80k| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 1.80k] ------------------ 1066| 0| node->inc(); 1067| 1.80k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 2.83k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 994, False: 1.84k] ------------------ 1069| 994| detail::destroy_n(node->leaf() + new_tail_size, 1070| 994| old_tail_size - new_tail_size); 1071| 994| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.84k| } else { 1073| 1.84k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.84k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.84k, Folded] ------------------ 1075| 1.84k| pos.visit(dec_visitor{}); 1076| 1.84k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.84k| } 1078| 4.64k| } _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.1k| { 914| 11.1k| auto idx = pos.index(last); 915| 11.1k| auto node = pos.node(); 916| 11.1k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 11.1k, Folded] | Branch (916:35): [True: 8.83k, False: 2.35k] ------------------ 917| 11.1k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 11.1k] | 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.1k| } else { 924| 11.1k| using std::get; 925| 11.1k| auto subs = 926| 11.1k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 8.83k, False: 2.35k] ------------------ 927| 11.1k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 11.1k| auto next = get<1>(subs); 929| 11.1k| auto ts = get<2>(subs); 930| 11.1k| auto tail = get<3>(subs); 931| 11.1k| IMMER_TRY { ------------------ | | 49| 11.1k|#define IMMER_TRY try ------------------ 932| 11.1k| if (next) { ------------------ | Branch (932:21): [True: 4.86k, False: 6.31k] ------------------ 933| 4.86k| if (mutate) { ------------------ | Branch (933:25): [True: 3.97k, False: 889] ------------------ 934| 3.97k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 3.97k| pos.each_right(dec_visitor{}, idx + 1); 936| 3.97k| node->inner()[idx] = next; 937| 3.97k| nodr->d.sizes[idx] = last + 1 - ts; 938| 3.97k| nodr->d.count = idx + 1; 939| 3.97k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 3.97k, False: 0] ------------------ 940| 3.97k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 3.97k| } else { 942| 889| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 889| auto newr = newn->relaxed(); 944| 889| newn->inner()[idx] = next; 945| 889| newr->d.sizes[idx] = last + 1 - ts; 946| 889| newr->d.count = idx + 1; 947| 889| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 889, False: 0] ------------------ 948| 889| if (Mutating) ------------------ | Branch (948:29): [True: 889, Folded] ------------------ 949| 889| pos.visit(dec_visitor{}); 950| 889| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 889| } 952| 6.31k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 3.10k, False: 3.20k] ------------------ 953| 3.10k| if (Mutating) ------------------ | Branch (953:25): [True: 3.10k, Folded] ------------------ 954| 3.10k| pos.visit(dec_right_visitor{}, count_t{1}); 955| 3.10k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 3.20k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 3.20k] | Branch (956:40): [True: 0, False: 0] | Branch (956:52): [True: 0, False: 0] ------------------ 957| 0| auto newn = pos.node()->inner()[0]; 958| 0| if (!mutate) ------------------ | Branch (958:25): [True: 0, False: 0] ------------------ 959| 0| newn->inc(); 960| 0| if (Mutating) ------------------ | Branch (960:25): [True: 0, Folded] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 3.20k| } else { 964| 3.20k| if (mutate) { ------------------ | Branch (964:25): [True: 2.67k, False: 536] ------------------ 965| 2.67k| pos.each_right(dec_visitor{}, idx + 1); 966| 2.67k| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 2.67k| return std::make_tuple(pos.shift(), node, ts, tail); 968| 2.67k| } else { 969| 536| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 536| if (Mutating) ------------------ | Branch (970:29): [True: 536, Folded] ------------------ 971| 536| pos.visit(dec_visitor{}); 972| 536| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 536| } 974| 3.20k| } 975| 11.1k| } 976| 11.1k| 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.1k| } 987| 11.1k| } _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.11k| { 992| 7.11k| auto idx = pos.index(last); 993| 7.11k| auto node = pos.node(); 994| 7.11k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 7.11k, Folded] | Branch (994:35): [True: 6.07k, False: 1.04k] ------------------ 995| 7.11k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 7.11k] | 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.11k| } else { 1002| 7.11k| using std::get; 1003| 7.11k| auto subs = 1004| 7.11k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 6.07k, False: 1.04k] ------------------ 1005| 7.11k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 7.11k| auto next = get<1>(subs); 1007| 7.11k| auto ts = get<2>(subs); 1008| 7.11k| auto tail = get<3>(subs); 1009| 7.11k| IMMER_TRY { ------------------ | | 49| 7.11k|#define IMMER_TRY try ------------------ 1010| 7.11k| if (next) { ------------------ | Branch (1010:21): [True: 2.54k, False: 4.56k] ------------------ 1011| 2.54k| if (mutate) { ------------------ | Branch (1011:25): [True: 2.25k, False: 287] ------------------ 1012| 2.25k| node->inner()[idx] = next; 1013| 2.25k| pos.each_right(dec_visitor{}, idx + 1); 1014| 2.25k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 2.25k| } else { 1016| 287| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 287| newn->inner()[idx] = next; 1018| 287| if (Mutating) ------------------ | Branch (1018:29): [True: 287, Folded] ------------------ 1019| 287| pos.visit(dec_visitor{}); 1020| 287| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 287| } 1022| 4.56k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.34k, False: 3.22k] ------------------ 1023| 1.34k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.34k, Folded] ------------------ 1024| 1.34k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.34k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 3.22k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 3.22k] | 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.22k| } else { 1034| 3.22k| if (mutate) { ------------------ | Branch (1034:25): [True: 2.85k, False: 371] ------------------ 1035| 2.85k| pos.each_right(dec_visitor{}, idx + 1); 1036| 2.85k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 2.85k| } else { 1038| 371| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 371| if (Mutating) ------------------ | Branch (1039:29): [True: 371, Folded] ------------------ 1040| 371| pos.visit(dec_visitor{}); 1041| 371| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 371| } 1043| 3.22k| } 1044| 7.11k| } 1045| 7.11k| 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.11k| } 1055| 7.11k| } _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.7k| { 879| 10.7k| using node_t = node_type; 880| 10.7k| auto node = p.node(); 881| 10.7k| if (node->dec()) { ------------------ | Branch (881:13): [True: 7.92k, False: 2.86k] ------------------ 882| 7.92k| p.each_right(dec_t{}, idx); 883| 7.92k| node_t::delete_inner(node, p.count()); 884| 7.92k| } 885| 10.7k| } _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| 6.84k| { 1060| 6.84k| auto old_tail_size = pos.count(); 1061| 6.84k| auto new_tail_size = pos.index(last) + 1; 1062| 6.84k| auto node = pos.node(); 1063| 6.84k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 6.84k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 6.84k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 2.33k, False: 4.51k] ------------------ 1065| 2.33k| if (!Mutating) ------------------ | Branch (1065:17): [True: 2.33k, Folded] ------------------ 1066| 2.33k| node->inc(); 1067| 2.33k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 4.51k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 4.51k] ------------------ 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| 4.51k| } else { 1073| 4.51k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 4.51k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 4.51k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 4.51k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 4.51k| } 1078| 6.84k| } _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.77k| { 914| 7.77k| auto idx = pos.index(last); 915| 7.77k| auto node = pos.node(); 916| 7.77k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 7.77k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 7.77k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 7.77k] | 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.77k| } else { 924| 7.77k| using std::get; 925| 7.77k| auto subs = 926| 7.77k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 7.77k] ------------------ 927| 7.77k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 7.77k| auto next = get<1>(subs); 929| 7.77k| auto ts = get<2>(subs); 930| 7.77k| auto tail = get<3>(subs); 931| 7.77k| IMMER_TRY { ------------------ | | 49| 7.77k|#define IMMER_TRY try ------------------ 932| 7.77k| if (next) { ------------------ | Branch (932:21): [True: 1.30k, False: 6.47k] ------------------ 933| 1.30k| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 1.30k] ------------------ 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.30k| } else { 942| 1.30k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 1.30k| auto newr = newn->relaxed(); 944| 1.30k| newn->inner()[idx] = next; 945| 1.30k| newr->d.sizes[idx] = last + 1 - ts; 946| 1.30k| newr->d.count = idx + 1; 947| 1.30k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 1.30k, False: 0] ------------------ 948| 1.30k| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 1.30k] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 1.30k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 1.30k| } 952| 6.47k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 4.15k, False: 2.32k] ------------------ 953| 4.15k| if (Mutating) ------------------ | Branch (953:25): [Folded, False: 4.15k] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 4.15k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 4.15k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 2.32k] | Branch (956:40): [True: 0, False: 0] | Branch (956:52): [True: 0, False: 0] ------------------ 957| 0| auto newn = pos.node()->inner()[0]; 958| 0| if (!mutate) ------------------ | Branch (958:25): [True: 0, False: 0] ------------------ 959| 0| newn->inc(); 960| 0| if (Mutating) ------------------ | Branch (960:25): [Folded, False: 0] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 2.32k| } else { 964| 2.32k| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 2.32k] ------------------ 965| 0| pos.each_right(dec_visitor{}, idx + 1); 966| 0| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 0| return std::make_tuple(pos.shift(), node, ts, tail); 968| 2.32k| } else { 969| 2.32k| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 2.32k| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 2.32k] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 2.32k| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 2.32k| } 974| 2.32k| } 975| 7.77k| } 976| 7.77k| 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.77k| } 987| 7.77k| } _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| 2.98k| { 992| 2.98k| auto idx = pos.index(last); 993| 2.98k| auto node = pos.node(); 994| 2.98k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 2.98k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 2.98k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 2.98k] | 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.98k| } else { 1002| 2.98k| using std::get; 1003| 2.98k| auto subs = 1004| 2.98k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 2.98k] ------------------ 1005| 2.98k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 2.98k| auto next = get<1>(subs); 1007| 2.98k| auto ts = get<2>(subs); 1008| 2.98k| auto tail = get<3>(subs); 1009| 2.98k| IMMER_TRY { ------------------ | | 49| 2.98k|#define IMMER_TRY try ------------------ 1010| 2.98k| if (next) { ------------------ | Branch (1010:21): [True: 945, False: 2.04k] ------------------ 1011| 945| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 945] ------------------ 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| 945| } else { 1016| 945| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 945| newn->inner()[idx] = next; 1018| 945| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 945] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 945| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 945| } 1022| 2.04k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.00k, False: 1.03k] ------------------ 1023| 1.00k| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 1.00k] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.00k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.03k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.03k] | 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.03k| } else { 1034| 1.03k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 1.03k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.03k| } else { 1038| 1.03k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.03k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 1.03k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 1.03k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.03k| } 1043| 1.03k| } 1044| 2.98k| } 1045| 2.98k| 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.98k| } 1055| 2.98k| } _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.0k| { 992| 12.0k| auto idx = pos.index(last); 993| 12.0k| auto node = pos.node(); 994| 12.0k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 12.0k, Folded] | Branch (994:35): [True: 8.74k, False: 3.30k] ------------------ 995| 12.0k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 12.0k, Folded] | Branch (995:25): [True: 7.31k, False: 4.73k] ------------------ 996| 7.31k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 5.40k, False: 1.91k] ------------------ 997| 7.31k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 7.31k| if (Mutating) ------------------ | Branch (998:17): [True: 7.31k, Folded] ------------------ 999| 7.31k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 7.31k| return res; 1001| 7.31k| } else { 1002| 4.73k| using std::get; 1003| 4.73k| auto subs = 1004| 4.73k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.34k, False: 1.38k] ------------------ 1005| 4.73k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 4.73k| auto next = get<1>(subs); 1007| 4.73k| auto ts = get<2>(subs); 1008| 4.73k| auto tail = get<3>(subs); 1009| 4.73k| IMMER_TRY { ------------------ | | 49| 4.73k|#define IMMER_TRY try ------------------ 1010| 4.73k| if (next) { ------------------ | Branch (1010:21): [True: 984, False: 3.75k] ------------------ 1011| 984| if (mutate) { ------------------ | Branch (1011:25): [True: 698, False: 286] ------------------ 1012| 698| node->inner()[idx] = next; 1013| 698| pos.each_right(dec_visitor{}, idx + 1); 1014| 698| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 698| } else { 1016| 286| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 286| newn->inner()[idx] = next; 1018| 286| if (Mutating) ------------------ | Branch (1018:29): [True: 286, Folded] ------------------ 1019| 286| pos.visit(dec_visitor{}); 1020| 286| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 286| } 1022| 3.75k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 3.75k] ------------------ 1023| 0| if (Mutating) ------------------ | Branch (1023:25): [True: 0, Folded] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 3.75k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 3.75k, Folded] | Branch (1026:40): [True: 3.17k, False: 583] | Branch (1026:52): [True: 2.13k, False: 1.04k] ------------------ 1027| 2.13k| auto newn = pos.node()->inner()[0]; 1028| 2.13k| if (!mutate) ------------------ | Branch (1028:25): [True: 571, False: 1.55k] ------------------ 1029| 571| newn->inc(); 1030| 2.13k| if (Mutating) ------------------ | Branch (1030:25): [True: 2.13k, Folded] ------------------ 1031| 2.13k| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 2.13k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 2.13k| } else { 1034| 1.62k| if (mutate) { ------------------ | Branch (1034:25): [True: 1.09k, False: 532] ------------------ 1035| 1.09k| pos.each_right(dec_visitor{}, idx + 1); 1036| 1.09k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.09k| } else { 1038| 532| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 532| if (Mutating) ------------------ | Branch (1039:29): [True: 532, Folded] ------------------ 1040| 532| pos.visit(dec_visitor{}); 1041| 532| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 532| } 1043| 1.62k| } 1044| 4.73k| } 1045| 4.73k| 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.73k| } 1055| 12.0k| } _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.77k| { 1060| 1.77k| auto old_tail_size = pos.count(); 1061| 1.77k| auto new_tail_size = pos.index(last) + 1; 1062| 1.77k| auto node = pos.node(); 1063| 1.77k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.77k, Folded] | Branch (1063:42): [True: 745, False: 1.02k] ------------------ 1064| 1.77k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 820, False: 953] ------------------ 1065| 820| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 820] ------------------ 1066| 0| node->inc(); 1067| 820| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 953| } else if (mutate) { ------------------ | Branch (1068:20): [True: 524, False: 429] ------------------ 1069| 524| detail::destroy_n(node->leaf() + new_tail_size, 1070| 524| old_tail_size - new_tail_size); 1071| 524| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 524| } else { 1073| 429| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 429| if (Mutating) ------------------ | Branch (1074:17): [True: 429, Folded] ------------------ 1075| 429| pos.visit(dec_visitor{}); 1076| 429| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 429| } 1078| 1.77k| } _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.99k| { 992| 3.99k| auto idx = pos.index(last); 993| 3.99k| auto node = pos.node(); 994| 3.99k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.99k, Folded] | Branch (994:35): [True: 1.77k, False: 2.22k] ------------------ 995| 3.99k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 3.99k, Folded] | Branch (995:25): [True: 1.66k, False: 2.33k] ------------------ 996| 1.66k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 1.04k, False: 619] ------------------ 997| 1.66k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 1.66k| if (Mutating) ------------------ | Branch (998:17): [True: 1.66k, Folded] ------------------ 999| 1.66k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 1.66k| return res; 1001| 2.33k| } else { 1002| 2.33k| using std::get; 1003| 2.33k| auto subs = 1004| 2.33k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 729, False: 1.60k] ------------------ 1005| 2.33k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 2.33k| auto next = get<1>(subs); 1007| 2.33k| auto ts = get<2>(subs); 1008| 2.33k| auto tail = get<3>(subs); 1009| 2.33k| IMMER_TRY { ------------------ | | 49| 2.33k|#define IMMER_TRY try ------------------ 1010| 2.33k| if (next) { ------------------ | Branch (1010:21): [True: 427, False: 1.90k] ------------------ 1011| 427| if (mutate) { ------------------ | Branch (1011:25): [True: 231, False: 196] ------------------ 1012| 231| node->inner()[idx] = next; 1013| 231| pos.each_right(dec_visitor{}, idx + 1); 1014| 231| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 231| } 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.90k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 1.90k] ------------------ 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.90k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 1.90k, Folded] | Branch (1026:40): [True: 1.38k, False: 523] | Branch (1026:52): [True: 505, False: 878] ------------------ 1027| 505| auto newn = pos.node()->inner()[0]; 1028| 505| if (!mutate) ------------------ | Branch (1028:25): [True: 265, False: 240] ------------------ 1029| 265| newn->inc(); 1030| 505| if (Mutating) ------------------ | Branch (1030:25): [True: 505, Folded] ------------------ 1031| 505| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 505| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 1.40k| } else { 1034| 1.40k| if (mutate) { ------------------ | Branch (1034:25): [True: 258, False: 1.14k] ------------------ 1035| 258| pos.each_right(dec_visitor{}, idx + 1); 1036| 258| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.14k| } else { 1038| 1.14k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.14k| if (Mutating) ------------------ | Branch (1039:29): [True: 1.14k, Folded] ------------------ 1040| 1.14k| pos.visit(dec_visitor{}); 1041| 1.14k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.14k| } 1043| 1.40k| } 1044| 2.33k| } 1045| 2.33k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 2.33k| } 1055| 3.99k| } _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| 675| { 1060| 675| auto old_tail_size = pos.count(); 1061| 675| auto new_tail_size = pos.index(last) + 1; 1062| 675| auto node = pos.node(); 1063| 675| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 675, Folded] | Branch (1063:42): [True: 202, False: 473] ------------------ 1064| 675| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 233, False: 442] ------------------ 1065| 233| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 233] ------------------ 1066| 0| node->inc(); 1067| 233| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 442| } else if (mutate) { ------------------ | Branch (1068:20): [True: 196, False: 246] ------------------ 1069| 196| detail::destroy_n(node->leaf() + new_tail_size, 1070| 196| old_tail_size - new_tail_size); 1071| 196| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 246| } else { 1073| 246| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 246| if (Mutating) ------------------ | Branch (1074:17): [True: 246, Folded] ------------------ 1075| 246| pos.visit(dec_visitor{}); 1076| 246| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 246| } 1078| 675| } _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| 774| { 1378| 774| auto node = pos.node(); 1379| 774| auto idx = pos.index(first); 1380| 774| auto count = pos.count(); 1381| 774| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 774| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 512, False: 262] ------------------ 1384| 774| if (mutate) { ------------------ | Branch (1384:13): [True: 512, False: 262] ------------------ 1385| 512| auto data = node->leaf(); 1386| 512| auto newcount = count - idx; 1387| 512| std::move(data + idx, data + count, data); 1388| 512| detail::destroy_n(data + newcount, idx); 1389| 512| return std::make_tuple(0, node); 1390| 512| } else { 1391| 262| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 262| if (Mutating) ------------------ | Branch (1392:17): [True: 262, Folded] ------------------ 1393| 262| pos.visit(dec_visitor{}); 1394| 262| return std::make_tuple(0, newn); 1395| 262| } 1396| 774| } _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| 37.5k| { 1247| 37.5k| auto idx = pos.subindex(first); 1248| 37.5k| auto count = pos.count(); 1249| 37.5k| auto node = pos.node(); 1250| 37.5k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 37.5k, Folded] | Branch (1250:47): [True: 27.3k, False: 10.1k] ------------------ 1251| 37.5k| auto left_size = pos.size_before(idx); 1252| 37.5k| auto child_size = pos.size_sbh(idx, left_size); 1253| 37.5k| auto dropped_size = first; 1254| 37.5k| auto child_dropped_size = dropped_size - left_size; 1255| 37.5k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 37.5k, Folded] | Branch (1255:25): [True: 36.1k, False: 1.36k] | Branch (1255:45): [True: 8.99k, False: 27.1k] ------------------ 1256| 8.99k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 5.57k, False: 3.42k] ------------------ 1257| 8.99k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 8.99k| if (mutate) ------------------ | Branch (1258:17): [True: 5.57k, False: 3.42k] ------------------ 1259| 5.57k| pos.visit(dec_left_visitor{}, idx); 1260| 3.42k| else if (Mutating) ------------------ | Branch (1260:22): [True: 3.42k, Folded] ------------------ 1261| 3.42k| pos.visit(dec_visitor{}); 1262| 8.99k| return r; 1263| 28.5k| } else { 1264| 28.5k| using std::get; 1265| 28.5k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 21.8k, False: 6.71k] ------------------ 1266| 28.5k| : node_t::make_inner_r_e(e); 1267| 28.5k| auto newr = newn->relaxed(); 1268| 28.5k| auto newcount = count - idx; 1269| 28.5k| auto new_child_size = child_size - child_dropped_size; 1270| 28.5k| IMMER_TRY { ------------------ | | 49| 28.5k|#define IMMER_TRY try ------------------ 1271| 28.5k| auto subs = 1272| 28.5k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 21.8k, False: 6.71k] ------------------ 1273| 28.5k| : pos.towards_sub_oh( 1274| 6.71k| no_collapse_no_mut_t{}, first, idx, e); 1275| 28.5k| if (mutate) ------------------ | Branch (1275:21): [True: 21.8k, False: 6.71k] ------------------ 1276| 21.8k| pos.each_left(dec_visitor{}, idx); 1277| 28.5k| pos.copy_sizes( 1278| 28.5k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 28.5k| std::copy(node->inner() + idx + 1, 1280| 28.5k| node->inner() + count, 1281| 28.5k| newn->inner() + 1); 1282| 28.5k| newn->inner()[0] = get<1>(subs); 1283| 28.5k| newr->d.sizes[0] = new_child_size; 1284| 28.5k| newr->d.count = newcount; 1285| 28.5k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 28.5k, False: 0] ------------------ 1286| 28.5k| if (!mutate) { ------------------ | Branch (1286:21): [True: 6.71k, False: 21.8k] ------------------ 1287| 6.71k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 6.71k| if (Mutating) ------------------ | Branch (1288:25): [True: 6.71k, Folded] ------------------ 1289| 6.71k| pos.visit(dec_visitor{}); 1290| 6.71k| } 1291| 28.5k| return std::make_tuple(pos.shift(), newn); 1292| 28.5k| } 1293| 28.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| 28.5k| } 1299| 37.5k| } _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.62k| { 1247| 2.62k| auto idx = pos.subindex(first); 1248| 2.62k| auto count = pos.count(); 1249| 2.62k| auto node = pos.node(); 1250| 2.62k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 2.62k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 2.62k| auto left_size = pos.size_before(idx); 1252| 2.62k| auto child_size = pos.size_sbh(idx, left_size); 1253| 2.62k| auto dropped_size = first; 1254| 2.62k| auto child_dropped_size = dropped_size - left_size; 1255| 2.62k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 2.62k, Folded] | Branch (1255:25): [True: 1.53k, False: 1.09k] | Branch (1255:45): [True: 929, False: 601] ------------------ 1256| 929| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 929] ------------------ 1257| 929| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 929| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 929] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 929| else if (Mutating) ------------------ | Branch (1260:22): [Folded, False: 929] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 929| return r; 1263| 1.69k| } else { 1264| 1.69k| using std::get; 1265| 1.69k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 1.69k] ------------------ 1266| 1.69k| : node_t::make_inner_r_e(e); 1267| 1.69k| auto newr = newn->relaxed(); 1268| 1.69k| auto newcount = count - idx; 1269| 1.69k| auto new_child_size = child_size - child_dropped_size; 1270| 1.69k| IMMER_TRY { ------------------ | | 49| 1.69k|#define IMMER_TRY try ------------------ 1271| 1.69k| auto subs = 1272| 1.69k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 1.69k] ------------------ 1273| 1.69k| : pos.towards_sub_oh( 1274| 1.69k| no_collapse_no_mut_t{}, first, idx, e); 1275| 1.69k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 1.69k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 1.69k| pos.copy_sizes( 1278| 1.69k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 1.69k| std::copy(node->inner() + idx + 1, 1280| 1.69k| node->inner() + count, 1281| 1.69k| newn->inner() + 1); 1282| 1.69k| newn->inner()[0] = get<1>(subs); 1283| 1.69k| newr->d.sizes[0] = new_child_size; 1284| 1.69k| newr->d.count = newcount; 1285| 1.69k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 1.69k, False: 0] ------------------ 1286| 1.69k| if (!mutate) { ------------------ | Branch (1286:21): [True: 1.69k, False: 0] ------------------ 1287| 1.69k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 1.69k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 1.69k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 1.69k| } 1291| 1.69k| return std::make_tuple(pos.shift(), newn); 1292| 1.69k| } 1293| 1.69k| 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.69k| } 1299| 2.62k| } _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.79k| { 1304| 2.79k| auto idx = pos.subindex(first); 1305| 2.79k| auto count = pos.count(); 1306| 2.79k| auto node = pos.node(); 1307| 2.79k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.79k] ------------------ 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.79k| auto left_size = pos.size_before(idx); 1313| 2.79k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.79k| auto dropped_size = first; 1315| 2.79k| auto child_dropped_size = dropped_size - left_size; 1316| 2.79k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 2.79k, Folded] | Branch (1316:25): [True: 1.54k, False: 1.24k] | Branch (1316:45): [True: 1.15k, False: 398] ------------------ 1317| 1.15k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 1.15k] ------------------ 1318| 1.15k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 1.15k| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 1.15k] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 1.15k| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 1.15k] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 1.15k| return r; 1324| 1.64k| } else { 1325| 1.64k| 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.64k| auto newcount = count - idx; 1330| 1.64k| auto newn = 1331| 1.64k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.64k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.64k| : node_t::make_inner_r_e(e); 1336| 1.64k| auto newr = newn->relaxed(); 1337| 1.64k| IMMER_TRY { ------------------ | | 49| 1.64k|#define IMMER_TRY try ------------------ 1338| 1.64k| auto subs = 1339| 1.64k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.64k] ------------------ 1340| 1.64k| : pos.towards_sub_oh( 1341| 1.64k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.64k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.64k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.64k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.64k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.64k, False: 0] ------------------ 1346| 1.64k| pos.copy_sizes( 1347| 1.64k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.64k| newr->d.count = newcount; 1349| 1.64k| newn->inner()[0] = get<1>(subs); 1350| 1.64k| std::copy(node->inner() + idx + 1, 1351| 1.64k| node->inner() + count, 1352| 1.64k| newn->inner() + 1); 1353| 1.64k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.64k, False: 0] ------------------ 1354| 1.64k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.64k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.64k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.64k| } 1358| 1.64k| return std::make_tuple(pos.shift(), newn); 1359| 1.64k| } 1360| 1.64k| 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.64k| } 1373| 2.79k| } _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| 3.32k| { 1304| 3.32k| auto idx = pos.subindex(first); 1305| 3.32k| auto count = pos.count(); 1306| 3.32k| auto node = pos.node(); 1307| 3.32k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 3.32k] ------------------ 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.32k| auto left_size = pos.size_before(idx); 1313| 3.32k| auto child_size = pos.size_sbh(idx, left_size); 1314| 3.32k| auto dropped_size = first; 1315| 3.32k| auto child_dropped_size = dropped_size - left_size; 1316| 3.32k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 3.32k, Folded] | Branch (1316:25): [True: 623, False: 2.70k] | Branch (1316:45): [True: 403, False: 220] ------------------ 1317| 403| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 403] ------------------ 1318| 403| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 403| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 403] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 403| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 403] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 403| return r; 1324| 2.92k| } else { 1325| 2.92k| 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.92k| auto newcount = count - idx; 1330| 2.92k| auto newn = 1331| 2.92k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 2.92k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 2.92k| : node_t::make_inner_r_e(e); 1336| 2.92k| auto newr = newn->relaxed(); 1337| 2.92k| IMMER_TRY { ------------------ | | 49| 2.92k|#define IMMER_TRY try ------------------ 1338| 2.92k| auto subs = 1339| 2.92k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 2.92k] ------------------ 1340| 2.92k| : pos.towards_sub_oh( 1341| 2.92k| no_collapse_no_mut_t{}, first, idx, e); 1342| 2.92k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 2.92k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 2.92k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 2.92k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 2.92k, False: 0] ------------------ 1346| 2.92k| pos.copy_sizes( 1347| 2.92k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 2.92k| newr->d.count = newcount; 1349| 2.92k| newn->inner()[0] = get<1>(subs); 1350| 2.92k| std::copy(node->inner() + idx + 1, 1351| 2.92k| node->inner() + count, 1352| 2.92k| newn->inner() + 1); 1353| 2.92k| if (!mutate) { ------------------ | Branch (1353:21): [True: 2.92k, False: 0] ------------------ 1354| 2.92k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 2.92k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 2.92k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 2.92k| } 1358| 2.92k| return std::make_tuple(pos.shift(), newn); 1359| 2.92k| } 1360| 2.92k| 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.92k| } 1373| 3.32k| } _ZN5immer6detail4rbts16dec_left_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_j: 1209| 311| { 1210| 311| using node_t = node_type; 1211| 311| auto node = p.node(); 1212| 311| if (node->dec()) { ------------------ | Branch (1212:13): [True: 311, False: 0] ------------------ 1213| 311| p.each_left(dec_t{}, idx); 1214| 311| node_t::delete_inner(node, p.count()); 1215| 311| } 1216| 311| } _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.17k| { 1378| 3.17k| auto node = pos.node(); 1379| 3.17k| auto idx = pos.index(first); 1380| 3.17k| auto count = pos.count(); 1381| 3.17k| 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.17k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 496, False: 2.68k] ------------------ 1384| 3.17k| if (mutate) { ------------------ | Branch (1384:13): [True: 496, False: 2.68k] ------------------ 1385| 496| auto data = node->leaf(); 1386| 496| auto newcount = count - idx; 1387| 496| std::move(data + idx, data + count, data); 1388| 496| detail::destroy_n(data + newcount, idx); 1389| 496| return std::make_tuple(0, node); 1390| 2.68k| } else { 1391| 2.68k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 2.68k| if (Mutating) ------------------ | Branch (1392:17): [True: 2.68k, Folded] ------------------ 1393| 2.68k| pos.visit(dec_visitor{}); 1394| 2.68k| return std::make_tuple(0, newn); 1395| 2.68k| } 1396| 3.17k| } _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.19k| { 1304| 2.19k| auto idx = pos.subindex(first); 1305| 2.19k| auto count = pos.count(); 1306| 2.19k| auto node = pos.node(); 1307| 2.19k| 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.19k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 864, False: 1.32k] ------------------ 1312| 2.19k| auto left_size = pos.size_before(idx); 1313| 2.19k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.19k| auto dropped_size = first; 1315| 2.19k| auto child_dropped_size = dropped_size - left_size; 1316| 2.19k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 2.19k] | 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.19k| } else { 1325| 2.19k| 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.19k| auto newcount = count - idx; 1330| 2.19k| auto newn = 1331| 2.19k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 864, False: 1.32k] ------------------ 1332| 864| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 864| norefs_tag{})) relaxed_t, 1334| 864| node) 1335| 2.19k| : node_t::make_inner_r_e(e); 1336| 2.19k| auto newr = newn->relaxed(); 1337| 2.19k| IMMER_TRY { ------------------ | | 49| 2.19k|#define IMMER_TRY try ------------------ 1338| 2.19k| auto subs = 1339| 2.19k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 864, False: 1.32k] ------------------ 1340| 2.19k| : pos.towards_sub_oh( 1341| 1.32k| no_collapse_no_mut_t{}, first, idx, e); 1342| 2.19k| if (mutate) ------------------ | Branch (1342:21): [True: 864, False: 1.32k] ------------------ 1343| 864| pos.each_left(dec_visitor{}, idx); 1344| 2.19k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 2.19k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 2.19k, False: 0] ------------------ 1346| 2.19k| pos.copy_sizes( 1347| 2.19k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 2.19k| newr->d.count = newcount; 1349| 2.19k| newn->inner()[0] = get<1>(subs); 1350| 2.19k| std::copy(node->inner() + idx + 1, 1351| 2.19k| node->inner() + count, 1352| 2.19k| newn->inner() + 1); 1353| 2.19k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.32k, False: 864] ------------------ 1354| 1.32k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.32k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.32k, Folded] ------------------ 1356| 1.32k| pos.visit(dec_visitor{}); 1357| 1.32k| } 1358| 2.19k| return std::make_tuple(pos.shift(), newn); 1359| 2.19k| } 1360| 2.19k| 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.19k| } 1373| 2.19k| } _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| 13.2k| { 1378| 13.2k| auto node = pos.node(); 1379| 13.2k| auto idx = pos.index(first); 1380| 13.2k| auto count = pos.count(); 1381| 13.2k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 13.2k] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 0| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 0, False: 0] ------------------ 1384| 13.2k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 13.2k] ------------------ 1385| 0| auto data = node->leaf(); 1386| 0| auto newcount = count - idx; 1387| 0| std::move(data + idx, data + count, data); 1388| 0| detail::destroy_n(data + newcount, idx); 1389| 0| return std::make_tuple(0, node); 1390| 13.2k| } else { 1391| 13.2k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 13.2k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 13.2k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 13.2k| return std::make_tuple(0, newn); 1395| 13.2k| } 1396| 13.2k| } _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.94k| { 1304| 3.94k| auto idx = pos.subindex(first); 1305| 3.94k| auto count = pos.count(); 1306| 3.94k| auto node = pos.node(); 1307| 3.94k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 3.94k] ------------------ 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.94k| auto left_size = pos.size_before(idx); 1313| 3.94k| auto child_size = pos.size_sbh(idx, left_size); 1314| 3.94k| auto dropped_size = first; 1315| 3.94k| auto child_dropped_size = dropped_size - left_size; 1316| 3.94k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 3.94k] | 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.94k| } else { 1325| 3.94k| 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.94k| auto newcount = count - idx; 1330| 3.94k| auto newn = 1331| 3.94k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 3.94k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 3.94k| : node_t::make_inner_r_e(e); 1336| 3.94k| auto newr = newn->relaxed(); 1337| 3.94k| IMMER_TRY { ------------------ | | 49| 3.94k|#define IMMER_TRY try ------------------ 1338| 3.94k| auto subs = 1339| 3.94k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 3.94k] ------------------ 1340| 3.94k| : pos.towards_sub_oh( 1341| 3.94k| no_collapse_no_mut_t{}, first, idx, e); 1342| 3.94k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 3.94k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 3.94k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 3.94k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 3.94k, False: 0] ------------------ 1346| 3.94k| pos.copy_sizes( 1347| 3.94k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 3.94k| newr->d.count = newcount; 1349| 3.94k| newn->inner()[0] = get<1>(subs); 1350| 3.94k| std::copy(node->inner() + idx + 1, 1351| 3.94k| node->inner() + count, 1352| 3.94k| newn->inner() + 1); 1353| 3.94k| if (!mutate) { ------------------ | Branch (1353:21): [True: 3.94k, False: 0] ------------------ 1354| 3.94k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 3.94k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 3.94k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 3.94k| } 1358| 3.94k| return std::make_tuple(pos.shift(), newn); 1359| 3.94k| } 1360| 3.94k| 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.94k| } 1373| 3.94k| } _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.26k| { 1210| 4.26k| using node_t = node_type; 1211| 4.26k| auto node = p.node(); 1212| 4.26k| if (node->dec()) { ------------------ | Branch (1212:13): [True: 4.26k, False: 0] ------------------ 1213| 4.26k| p.each_left(dec_t{}, idx); 1214| 4.26k| node_t::delete_inner(node, p.count()); 1215| 4.26k| } 1216| 4.26k| } _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| 10.1k| { 1378| 10.1k| auto node = pos.node(); 1379| 10.1k| auto idx = pos.index(first); 1380| 10.1k| auto count = pos.count(); 1381| 10.1k| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 10.1k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 6.41k, False: 3.73k] ------------------ 1384| 10.1k| if (mutate) { ------------------ | Branch (1384:13): [True: 6.41k, False: 3.73k] ------------------ 1385| 6.41k| auto data = node->leaf(); 1386| 6.41k| auto newcount = count - idx; 1387| 6.41k| std::move(data + idx, data + count, data); 1388| 6.41k| detail::destroy_n(data + newcount, idx); 1389| 6.41k| return std::make_tuple(0, node); 1390| 6.41k| } else { 1391| 3.73k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 3.73k| if (Mutating) ------------------ | Branch (1392:17): [True: 3.73k, Folded] ------------------ 1393| 3.73k| pos.visit(dec_visitor{}); 1394| 3.73k| return std::make_tuple(0, newn); 1395| 3.73k| } 1396| 10.1k| } _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.38k| { 1304| 1.38k| auto idx = pos.subindex(first); 1305| 1.38k| auto count = pos.count(); 1306| 1.38k| auto node = pos.node(); 1307| 1.38k| 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.38k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 428, False: 961] ------------------ 1312| 1.38k| auto left_size = pos.size_before(idx); 1313| 1.38k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.38k| auto dropped_size = first; 1315| 1.38k| auto child_dropped_size = dropped_size - left_size; 1316| 1.38k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.38k] | 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.38k| } else { 1325| 1.38k| 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.38k| auto newcount = count - idx; 1330| 1.38k| auto newn = 1331| 1.38k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 428, False: 961] ------------------ 1332| 428| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 428| norefs_tag{})) relaxed_t, 1334| 428| node) 1335| 1.38k| : node_t::make_inner_r_e(e); 1336| 1.38k| auto newr = newn->relaxed(); 1337| 1.38k| IMMER_TRY { ------------------ | | 49| 1.38k|#define IMMER_TRY try ------------------ 1338| 1.38k| auto subs = 1339| 1.38k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 428, False: 961] ------------------ 1340| 1.38k| : pos.towards_sub_oh( 1341| 961| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.38k| if (mutate) ------------------ | Branch (1342:21): [True: 428, False: 961] ------------------ 1343| 428| pos.each_left(dec_visitor{}, idx); 1344| 1.38k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.38k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.38k, False: 0] ------------------ 1346| 1.38k| pos.copy_sizes( 1347| 1.38k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.38k| newr->d.count = newcount; 1349| 1.38k| newn->inner()[0] = get<1>(subs); 1350| 1.38k| std::copy(node->inner() + idx + 1, 1351| 1.38k| node->inner() + count, 1352| 1.38k| newn->inner() + 1); 1353| 1.38k| if (!mutate) { ------------------ | Branch (1353:21): [True: 961, False: 428] ------------------ 1354| 961| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 961| if (Mutating) ------------------ | Branch (1355:25): [True: 961, Folded] ------------------ 1356| 961| pos.visit(dec_visitor{}); 1357| 961| } 1358| 1.38k| return std::make_tuple(pos.shift(), newn); 1359| 1.38k| } 1360| 1.38k| 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.38k| } 1373| 1.38k| } _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| 14.0k| { 1378| 14.0k| auto node = pos.node(); 1379| 14.0k| auto idx = pos.index(first); 1380| 14.0k| auto count = pos.count(); 1381| 14.0k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 14.0k] ------------------ 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| 14.0k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 14.0k] ------------------ 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| 14.0k| } else { 1391| 14.0k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 14.0k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 14.0k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 14.0k| return std::make_tuple(0, newn); 1395| 14.0k| } 1396| 14.0k| } _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| 4.59k| { 1304| 4.59k| auto idx = pos.subindex(first); 1305| 4.59k| auto count = pos.count(); 1306| 4.59k| auto node = pos.node(); 1307| 4.59k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 4.59k] ------------------ 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| 4.59k| auto left_size = pos.size_before(idx); 1313| 4.59k| auto child_size = pos.size_sbh(idx, left_size); 1314| 4.59k| auto dropped_size = first; 1315| 4.59k| auto child_dropped_size = dropped_size - left_size; 1316| 4.59k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 4.59k] | 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| 4.59k| } else { 1325| 4.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| 4.59k| auto newcount = count - idx; 1330| 4.59k| auto newn = 1331| 4.59k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 4.59k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 4.59k| : node_t::make_inner_r_e(e); 1336| 4.59k| auto newr = newn->relaxed(); 1337| 4.59k| IMMER_TRY { ------------------ | | 49| 4.59k|#define IMMER_TRY try ------------------ 1338| 4.59k| auto subs = 1339| 4.59k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 4.59k] ------------------ 1340| 4.59k| : pos.towards_sub_oh( 1341| 4.59k| no_collapse_no_mut_t{}, first, idx, e); 1342| 4.59k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 4.59k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 4.59k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 4.59k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 4.59k, False: 0] ------------------ 1346| 4.59k| pos.copy_sizes( 1347| 4.59k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 4.59k| newr->d.count = newcount; 1349| 4.59k| newn->inner()[0] = get<1>(subs); 1350| 4.59k| std::copy(node->inner() + idx + 1, 1351| 4.59k| node->inner() + count, 1352| 4.59k| newn->inner() + 1); 1353| 4.59k| if (!mutate) { ------------------ | Branch (1353:21): [True: 4.59k, False: 0] ------------------ 1354| 4.59k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 4.59k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 4.59k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 4.59k| } 1358| 4.59k| return std::make_tuple(pos.shift(), newn); 1359| 4.59k| } 1360| 4.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| 4.59k| } 1373| 4.59k| } _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.57k| { 1199| 5.57k| using node_t = node_type; 1200| 5.57k| auto node = p.node(); 1201| 5.57k| if (node->dec()) { ------------------ | Branch (1201:13): [True: 5.57k, False: 0] ------------------ 1202| 5.57k| p.each_left(dec_t{}, idx); 1203| 5.57k| node_t::delete_inner_r(node, p.count()); 1204| 5.57k| } 1205| 5.57k| } _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| 154k| { 1247| 154k| auto idx = pos.subindex(first); 1248| 154k| auto count = pos.count(); 1249| 154k| auto node = pos.node(); 1250| 154k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 154k, Folded] | Branch (1250:47): [True: 144k, False: 10.2k] ------------------ 1251| 154k| auto left_size = pos.size_before(idx); 1252| 154k| auto child_size = pos.size_sbh(idx, left_size); 1253| 154k| auto dropped_size = first; 1254| 154k| auto child_dropped_size = dropped_size - left_size; 1255| 154k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 154k] | 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| 154k| } else { 1264| 154k| using std::get; 1265| 154k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 144k, False: 10.2k] ------------------ 1266| 154k| : node_t::make_inner_r_e(e); 1267| 154k| auto newr = newn->relaxed(); 1268| 154k| auto newcount = count - idx; 1269| 154k| auto new_child_size = child_size - child_dropped_size; 1270| 154k| IMMER_TRY { ------------------ | | 49| 154k|#define IMMER_TRY try ------------------ 1271| 154k| auto subs = 1272| 154k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 144k, False: 10.2k] ------------------ 1273| 154k| : pos.towards_sub_oh( 1274| 10.2k| no_collapse_no_mut_t{}, first, idx, e); 1275| 154k| if (mutate) ------------------ | Branch (1275:21): [True: 144k, False: 10.2k] ------------------ 1276| 144k| pos.each_left(dec_visitor{}, idx); 1277| 154k| pos.copy_sizes( 1278| 154k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 154k| std::copy(node->inner() + idx + 1, 1280| 154k| node->inner() + count, 1281| 154k| newn->inner() + 1); 1282| 154k| newn->inner()[0] = get<1>(subs); 1283| 154k| newr->d.sizes[0] = new_child_size; 1284| 154k| newr->d.count = newcount; 1285| 154k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 154k, False: 0] ------------------ 1286| 154k| if (!mutate) { ------------------ | Branch (1286:21): [True: 10.2k, False: 144k] ------------------ 1287| 10.2k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 10.2k| if (Mutating) ------------------ | Branch (1288:25): [True: 10.2k, Folded] ------------------ 1289| 10.2k| pos.visit(dec_visitor{}); 1290| 10.2k| } 1291| 154k| return std::make_tuple(pos.shift(), newn); 1292| 154k| } 1293| 154k| 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| 154k| } 1299| 154k| } _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| 60.7k| { 1247| 60.7k| auto idx = pos.subindex(first); 1248| 60.7k| auto count = pos.count(); 1249| 60.7k| auto node = pos.node(); 1250| 60.7k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 60.7k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 60.7k| auto left_size = pos.size_before(idx); 1252| 60.7k| auto child_size = pos.size_sbh(idx, left_size); 1253| 60.7k| auto dropped_size = first; 1254| 60.7k| auto child_dropped_size = dropped_size - left_size; 1255| 60.7k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 60.7k] | 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| 60.7k| } else { 1264| 60.7k| using std::get; 1265| 60.7k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 60.7k] ------------------ 1266| 60.7k| : node_t::make_inner_r_e(e); 1267| 60.7k| auto newr = newn->relaxed(); 1268| 60.7k| auto newcount = count - idx; 1269| 60.7k| auto new_child_size = child_size - child_dropped_size; 1270| 60.7k| IMMER_TRY { ------------------ | | 49| 60.7k|#define IMMER_TRY try ------------------ 1271| 60.7k| auto subs = 1272| 60.7k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 60.7k] ------------------ 1273| 60.7k| : pos.towards_sub_oh( 1274| 60.7k| no_collapse_no_mut_t{}, first, idx, e); 1275| 60.7k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 60.7k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 60.7k| pos.copy_sizes( 1278| 60.7k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 60.7k| std::copy(node->inner() + idx + 1, 1280| 60.7k| node->inner() + count, 1281| 60.7k| newn->inner() + 1); 1282| 60.7k| newn->inner()[0] = get<1>(subs); 1283| 60.7k| newr->d.sizes[0] = new_child_size; 1284| 60.7k| newr->d.count = newcount; 1285| 60.7k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 60.7k, False: 0] ------------------ 1286| 60.7k| if (!mutate) { ------------------ | Branch (1286:21): [True: 60.7k, False: 0] ------------------ 1287| 60.7k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 60.7k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 60.7k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 60.7k| } 1291| 60.7k| return std::make_tuple(pos.shift(), newn); 1292| 60.7k| } 1293| 60.7k| IMMER_CATCH (...) { 1294| 0| if (!mutate) ------------------ | Branch (1294:21): [True: 0, False: 0] ------------------ 1295| 0| node_t::delete_inner_r_e(newn); 1296| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1297| 0| } 1298| 60.7k| } 1299| 60.7k| } _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.76k| { 1304| 9.76k| auto idx = pos.subindex(first); 1305| 9.76k| auto count = pos.count(); 1306| 9.76k| auto node = pos.node(); 1307| 9.76k| auto mutate = Mutating ------------------ | Branch (1307:23): [True: 0, Folded] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 9.76k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 7.25k, False: 2.51k] ------------------ 1312| 9.76k| auto left_size = pos.size_before(idx); 1313| 9.76k| auto child_size = pos.size_sbh(idx, left_size); 1314| 9.76k| auto dropped_size = first; 1315| 9.76k| auto child_dropped_size = dropped_size - left_size; 1316| 9.76k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 9.76k, Folded] | Branch (1316:25): [True: 7.43k, False: 2.32k] | Branch (1316:45): [True: 5.50k, False: 1.93k] ------------------ 1317| 5.50k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 4.26k, False: 1.24k] ------------------ 1318| 5.50k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 5.50k| if (mutate) ------------------ | Branch (1319:17): [True: 4.26k, False: 1.24k] ------------------ 1320| 4.26k| pos.visit(dec_left_visitor{}, idx); 1321| 1.24k| else if (Mutating) ------------------ | Branch (1321:22): [True: 1.24k, Folded] ------------------ 1322| 1.24k| pos.visit(dec_visitor{}); 1323| 5.50k| return r; 1324| 5.50k| } else { 1325| 4.25k| 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.25k| auto newcount = count - idx; 1330| 4.25k| auto newn = 1331| 4.25k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 2.98k, False: 1.27k] ------------------ 1332| 2.98k| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 2.98k| norefs_tag{})) relaxed_t, 1334| 2.98k| node) 1335| 4.25k| : node_t::make_inner_r_e(e); 1336| 4.25k| auto newr = newn->relaxed(); 1337| 4.25k| IMMER_TRY { ------------------ | | 49| 4.25k|#define IMMER_TRY try ------------------ 1338| 4.25k| auto subs = 1339| 4.25k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 2.98k, False: 1.27k] ------------------ 1340| 4.25k| : pos.towards_sub_oh( 1341| 1.27k| no_collapse_no_mut_t{}, first, idx, e); 1342| 4.25k| if (mutate) ------------------ | Branch (1342:21): [True: 2.98k, False: 1.27k] ------------------ 1343| 2.98k| pos.each_left(dec_visitor{}, idx); 1344| 4.25k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 4.25k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 4.25k, False: 0] ------------------ 1346| 4.25k| pos.copy_sizes( 1347| 4.25k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 4.25k| newr->d.count = newcount; 1349| 4.25k| newn->inner()[0] = get<1>(subs); 1350| 4.25k| std::copy(node->inner() + idx + 1, 1351| 4.25k| node->inner() + count, 1352| 4.25k| newn->inner() + 1); 1353| 4.25k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.27k, False: 2.98k] ------------------ 1354| 1.27k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.27k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.27k, Folded] ------------------ 1356| 1.27k| pos.visit(dec_visitor{}); 1357| 1.27k| } 1358| 4.25k| return std::make_tuple(pos.shift(), newn); 1359| 4.25k| } 1360| 4.25k| 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.25k| } 1373| 9.76k| } _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.49k| { 1304| 3.49k| auto idx = pos.subindex(first); 1305| 3.49k| auto count = pos.count(); 1306| 3.49k| auto node = pos.node(); 1307| 3.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| 3.49k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 1.40k, False: 2.09k] ------------------ 1312| 3.49k| auto left_size = pos.size_before(idx); 1313| 3.49k| auto child_size = pos.size_sbh(idx, left_size); 1314| 3.49k| auto dropped_size = first; 1315| 3.49k| auto child_dropped_size = dropped_size - left_size; 1316| 3.49k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 3.49k, Folded] | Branch (1316:25): [True: 2.12k, False: 1.36k] | Branch (1316:45): [True: 1.91k, False: 215] ------------------ 1317| 1.91k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 311, False: 1.60k] ------------------ 1318| 1.91k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 1.91k| if (mutate) ------------------ | Branch (1319:17): [True: 311, False: 1.60k] ------------------ 1320| 311| pos.visit(dec_left_visitor{}, idx); 1321| 1.60k| else if (Mutating) ------------------ | Branch (1321:22): [True: 1.60k, Folded] ------------------ 1322| 1.60k| pos.visit(dec_visitor{}); 1323| 1.91k| return r; 1324| 1.91k| } else { 1325| 1.58k| 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.58k| auto newcount = count - idx; 1330| 1.58k| auto newn = 1331| 1.58k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 1.09k, False: 490] ------------------ 1332| 1.09k| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 1.09k| norefs_tag{})) relaxed_t, 1334| 1.09k| node) 1335| 1.58k| : node_t::make_inner_r_e(e); 1336| 1.58k| auto newr = newn->relaxed(); 1337| 1.58k| IMMER_TRY { ------------------ | | 49| 1.58k|#define IMMER_TRY try ------------------ 1338| 1.58k| auto subs = 1339| 1.58k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 1.09k, False: 490] ------------------ 1340| 1.58k| : pos.towards_sub_oh( 1341| 490| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.58k| if (mutate) ------------------ | Branch (1342:21): [True: 1.09k, False: 490] ------------------ 1343| 1.09k| pos.each_left(dec_visitor{}, idx); 1344| 1.58k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.58k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.58k, False: 0] ------------------ 1346| 1.58k| pos.copy_sizes( 1347| 1.58k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.58k| newr->d.count = newcount; 1349| 1.58k| newn->inner()[0] = get<1>(subs); 1350| 1.58k| std::copy(node->inner() + idx + 1, 1351| 1.58k| node->inner() + count, 1352| 1.58k| newn->inner() + 1); 1353| 1.58k| if (!mutate) { ------------------ | Branch (1353:21): [True: 490, False: 1.09k] ------------------ 1354| 490| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 490| if (Mutating) ------------------ | Branch (1355:25): [True: 490, Folded] ------------------ 1356| 490| pos.visit(dec_visitor{}); 1357| 490| } 1358| 1.58k| return std::make_tuple(pos.shift(), newn); 1359| 1.58k| } 1360| 1.58k| 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.58k| } 1373| 3.49k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_16rrbtree_iteratorIiSE_Lj2ELj2EEESF_EEbOT_OT0_PT1_jm: 349| 11.2k| { 350| 11.2k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 11.2k, False: 0] ------------------ 351| 11.2k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 10.1k, False: 1.10k] ------------------ 352| 11.2k| ? visit_maybe_relaxed_sub(rootl, 353| 10.1k| shiftl, 354| 10.1k| sizel, 355| 10.1k| this_t{}, 356| 10.1k| posr, 357| 10.1k| first, 358| 10.1k| size_t{}) 359| 11.2k| : posr.first_sub_inner( 360| 1.10k| rrb{}, first, rootl, shiftl, sizel); 361| 11.2k| } _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| 28.4k| { 383| 28.4k| auto nl = posl.node(); 384| 28.4k| auto nr = posr.node(); 385| 28.4k| if (nl == nr) ------------------ | Branch (385:13): [True: 8.37k, False: 20.0k] ------------------ 386| 8.37k| return true; 387| 20.0k| auto cl = posl.count(); 388| 20.0k| auto cr = posr.count(); 389| 20.0k| assert(cr > 0); ------------------ | Branch (389:9): [True: 20.0k, False: 0] ------------------ 390| 20.0k| auto sbr = size_t{}; 391| 20.0k| auto i = count_t{}; 392| 20.0k| auto j = count_t{}; 393| 63.0k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 51.8k, False: 11.1k] ------------------ 394| 51.8k| auto sbl = posl.size_before(i); 395| 81.8k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 65.8k, False: 16.0k] | Branch (395:34): [True: 30.0k, False: 35.7k] ------------------ 396| 30.0k| ; 397| 51.8k| auto res = 398| 51.8k| sbl == sbr ------------------ | Branch (398:17): [True: 32.7k, False: 19.0k] ------------------ 399| 51.8k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 51.8k| : posl.nth_sub(i, 401| 19.0k| for_each_chunk_p_visitor{}, 402| 19.0k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 51.8k| if (!res) ------------------ | Branch (403:17): [True: 8.89k, False: 42.9k] ------------------ 404| 8.89k| return false; 405| 51.8k| } 406| 11.1k| return true; 407| 20.0k| } _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.01k| { 337| 9.01k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 9.01k| } _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.56k| { 428| 9.56k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 4.74k, False: 4.81k] ------------------ 429| 4.74k| return true; 430| 4.81k| auto cl = posl.count(); 431| 4.81k| auto cr = posr.count(); 432| 4.81k| auto mp = std::min(cl, cr); 433| 4.81k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 3.42k, False: 1.39k] ------------------ 434| 4.81k| posl.node()->leaf() + mp, 435| 4.81k| posr.node()->leaf()) && 436| 3.42k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 3.04k, False: 380] ------------------ 437| 3.42k| posl.node()->leaf() + posl.count(), 438| 3.42k| first + (idx + mp)); 439| 9.56k| } _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| 21.5k| { 330| 21.5k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 21.5k| } _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.71k| { 413| 4.71k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 4.71k| } _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.71k| { 383| 4.71k| auto nl = posl.node(); 384| 4.71k| auto nr = posr.node(); 385| 4.71k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 4.71k] ------------------ 386| 0| return true; 387| 4.71k| auto cl = posl.count(); 388| 4.71k| auto cr = posr.count(); 389| 4.71k| assert(cr > 0); ------------------ | Branch (389:9): [True: 4.71k, False: 0] ------------------ 390| 4.71k| auto sbr = size_t{}; 391| 4.71k| auto i = count_t{}; 392| 4.71k| auto j = count_t{}; 393| 13.8k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 11.5k, False: 2.29k] ------------------ 394| 11.5k| auto sbl = posl.size_before(i); 395| 18.0k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 13.4k, False: 4.61k] | Branch (395:34): [True: 6.49k, False: 6.96k] ------------------ 396| 6.49k| ; 397| 11.5k| auto res = 398| 11.5k| sbl == sbr ------------------ | Branch (398:17): [True: 7.12k, False: 4.44k] ------------------ 399| 11.5k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 11.5k| : posl.nth_sub(i, 401| 4.44k| for_each_chunk_p_visitor{}, 402| 4.44k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 11.5k| if (!res) ------------------ | Branch (403:17): [True: 2.41k, False: 9.16k] ------------------ 404| 2.41k| return false; 405| 11.5k| } 406| 2.29k| return true; 407| 4.71k| } _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| 4.11k| { 337| 4.11k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 4.11k| } _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| 7.29k| { 428| 7.29k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 3.90k, False: 3.38k] ------------------ 429| 3.90k| return true; 430| 3.38k| auto cl = posl.count(); 431| 3.38k| auto cr = posr.count(); 432| 3.38k| auto mp = std::min(cl, cr); 433| 3.38k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 3.16k, False: 227] ------------------ 434| 3.38k| posl.node()->leaf() + mp, 435| 3.38k| posr.node()->leaf()) && 436| 3.16k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 2.91k, False: 252] ------------------ 437| 3.16k| posl.node()->leaf() + posl.count(), 438| 3.16k| first + (idx + mp)); 439| 7.29k| } _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.25k| { 330| 2.25k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.25k| } _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.74k| { 413| 2.74k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 2.74k| } _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.74k| { 383| 2.74k| auto nl = posl.node(); 384| 2.74k| auto nr = posr.node(); 385| 2.74k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.74k] ------------------ 386| 0| return true; 387| 2.74k| auto cl = posl.count(); 388| 2.74k| auto cr = posr.count(); 389| 2.74k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.74k, False: 0] ------------------ 390| 2.74k| auto sbr = size_t{}; 391| 2.74k| auto i = count_t{}; 392| 2.74k| auto j = count_t{}; 393| 12.6k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 10.2k, False: 2.32k] ------------------ 394| 10.2k| 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.4k, False: 4.05k] | Branch (395:34): [True: 7.25k, False: 6.23k] ------------------ 396| 7.25k| ; 397| 10.2k| auto res = 398| 10.2k| sbl == sbr ------------------ | Branch (398:17): [True: 5.70k, False: 4.59k] ------------------ 399| 10.2k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 10.2k| : posl.nth_sub(i, 401| 4.59k| for_each_chunk_p_visitor{}, 402| 4.59k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 10.2k| if (!res) ------------------ | Branch (403:17): [True: 420, False: 9.87k] ------------------ 404| 420| return false; 405| 10.2k| } 406| 2.32k| return true; 407| 2.74k| } _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.71k| { 337| 3.71k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 3.71k| } _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| 876| { 330| 876| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 876| } _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.86k| { 420| 1.86k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 1.86k, False: 0] ------------------ 421| 1.86k| ? this_t::visit_regular(posl, posr.node()) 422| 1.86k| : this_t::visit_regular(posr, posl.node()); 423| 1.86k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESE_EEbOT_PT0_: 443| 10.5k| { 444| 10.5k| auto node = pos.node(); 445| 10.5k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 6.70k, False: 3.80k] | Branch (445:33): [True: 1.97k, False: 1.83k] ------------------ 446| 10.5k| } _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| 13.6k| { 451| 13.6k| auto node = pos.node(); 452| 13.6k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 8.39k, False: 5.27k] | Branch (452:33): [True: 3.26k, False: 2.00k] ------------------ 453| 5.27k| node->leaf() + pos.count(), 454| 5.27k| other->leaf()); 455| 13.6k| } _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.94k| { 444| 7.94k| auto node = pos.node(); 445| 7.94k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 2.70k, False: 5.24k] | Branch (445:33): [True: 2.75k, False: 2.48k] ------------------ 446| 7.94k| } _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.99k| { 451| 2.99k| auto node = pos.node(); 452| 2.99k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.57k, False: 1.41k] | Branch (452:33): [True: 707, False: 710] ------------------ 453| 1.41k| node->leaf() + pos.count(), 454| 1.41k| other->leaf()); 455| 2.99k| } _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.95k| { 444| 3.95k| auto node = pos.node(); 445| 3.95k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 474, False: 3.48k] | Branch (445:33): [True: 2.42k, False: 1.06k] ------------------ 446| 3.95k| } _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| 344k| { 113| 344k| auto data = as_const(pos.node()->leaf()); 114| 344k| return fn(data, data + pos.count()); 115| 344k| } _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: 189k, False: 1.16M] ------------------ 369| 189k| iter += e - f; 370| 189k| return true; 371| 189k| } 372| 5.34M| for (; f != e; ++f, ++iter) ------------------ | Branch (372:20): [True: 4.18M, False: 1.16M] ------------------ 373| 4.18M| if (*f != *iter) ------------------ | Branch (373:21): [True: 3.20k, False: 4.18M] ------------------ 374| 3.20k| return false; 375| 1.16M| 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.17M| { 54| 9.17M| return pos.towards(this_t{}, idx); 55| 9.17M| } _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| 371k| { 54| 371k| return pos.towards(this_t{}, idx); 55| 371k| } _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| 347k| { 60| 347k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 347k| } _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| 998k| { 54| 998k| return pos.towards(this_t{}, idx); 55| 998k| } _ZN5immer6detail4rbts18region_for_visitorIiE10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEENSt3__15tupleIJPimmEEEOT_m: 59| 23.7k| { 60| 23.7k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 23.7k| } _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| 108k| { 54| 108k| return pos.towards(this_t{}, idx); 55| 108k| } _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| 92.8k| { 107| 92.8k| return pos.each_pred(this_t{}, fn); 108| 92.8k| } _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| 756| { 330| 756| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 756| } _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.79k| { 420| 6.79k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 6.79k, False: 0] ------------------ 421| 6.79k| ? this_t::visit_regular(posl, posr.node()) 422| 6.79k| : this_t::visit_regular(posr, posl.node()); 423| 6.79k| } _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| 994k| { 113| 994k| auto data = as_const(pos.node()->leaf()); 114| 994k| return fn(data, data + pos.count()); 115| 994k| } _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| 19.9k| { 107| 19.9k| return pos.each_pred(this_t{}, fn); 108| 19.9k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 112| 18.7k| { 113| 18.7k| auto data = as_const(pos.node()->leaf()); 114| 18.7k| return fn(data, data + pos.count()); 115| 18.7k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 6.44k| { 107| 6.44k| return pos.each_pred(this_t{}, fn); 108| 6.44k| } _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.58k| { 330| 2.58k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.58k| } _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.60k| { 383| 2.60k| auto nl = posl.node(); 384| 2.60k| auto nr = posr.node(); 385| 2.60k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.60k] ------------------ 386| 0| return true; 387| 2.60k| auto cl = posl.count(); 388| 2.60k| auto cr = posr.count(); 389| 2.60k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.60k, False: 0] ------------------ 390| 2.60k| auto sbr = size_t{}; 391| 2.60k| auto i = count_t{}; 392| 2.60k| auto j = count_t{}; 393| 9.15k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 7.22k, False: 1.92k] ------------------ 394| 7.22k| auto sbl = posl.size_before(i); 395| 11.4k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 9.12k, False: 2.27k] | Branch (395:34): [True: 4.17k, False: 4.95k] ------------------ 396| 4.17k| ; 397| 7.22k| auto res = 398| 7.22k| sbl == sbr ------------------ | Branch (398:17): [True: 4.66k, False: 2.56k] ------------------ 399| 7.22k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 7.22k| : posl.nth_sub(i, 401| 2.56k| for_each_chunk_p_visitor{}, 402| 2.56k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 7.22k| if (!res) ------------------ | Branch (403:17): [True: 683, False: 6.54k] ------------------ 404| 683| return false; 405| 7.22k| } 406| 1.92k| return true; 407| 2.60k| } _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| 5.31k| { 337| 5.31k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 5.31k| } _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| 5.31k| { 428| 5.31k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 2.85k, False: 2.45k] ------------------ 429| 2.85k| return true; 430| 2.45k| auto cl = posl.count(); 431| 2.45k| auto cr = posr.count(); 432| 2.45k| auto mp = std::min(cl, cr); 433| 2.45k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 2.10k, False: 346] ------------------ 434| 2.45k| posl.node()->leaf() + mp, 435| 2.45k| posr.node()->leaf()) && 436| 2.10k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 2.10k, False: 0] ------------------ 437| 2.10k| posl.node()->leaf() + posl.count(), 438| 2.10k| first + (idx + mp)); 439| 5.31k| } _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.80k| { 330| 2.80k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.80k| } _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.65k| { 383| 1.65k| auto nl = posl.node(); 384| 1.65k| auto nr = posr.node(); 385| 1.65k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 1.65k] ------------------ 386| 0| return true; 387| 1.65k| auto cl = posl.count(); 388| 1.65k| auto cr = posr.count(); 389| 1.65k| assert(cr > 0); ------------------ | Branch (389:9): [True: 1.65k, False: 0] ------------------ 390| 1.65k| auto sbr = size_t{}; 391| 1.65k| auto i = count_t{}; 392| 1.65k| auto j = count_t{}; 393| 7.64k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 6.23k, False: 1.41k] ------------------ 394| 6.23k| auto sbl = posl.size_before(i); 395| 10.7k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 9.39k, False: 1.37k] | Branch (395:34): [True: 4.52k, False: 4.86k] ------------------ 396| 4.52k| ; 397| 6.23k| auto res = 398| 6.23k| sbl == sbr ------------------ | Branch (398:17): [True: 3.79k, False: 2.43k] ------------------ 399| 6.23k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 6.23k| : posl.nth_sub(i, 401| 2.43k| for_each_chunk_p_visitor{}, 402| 2.43k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 6.23k| if (!res) ------------------ | Branch (403:17): [True: 242, False: 5.99k] ------------------ 404| 242| return false; 405| 6.23k| } 406| 1.41k| return true; 407| 1.65k| } _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.15k| { 420| 1.15k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 1.15k, False: 0] ------------------ 421| 1.15k| ? this_t::visit_regular(posl, posr.node()) 422| 1.15k| : this_t::visit_regular(posr, posl.node()); 423| 1.15k| } _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| 575k| { 107| 575k| return pos.each_pred(this_t{}, fn); 108| 575k| } _ZN5immer6detail4rbts14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaOT_: 366| 33.0k| { 367| 33.0k| return [iter](auto f, auto e) mutable { 368| 33.0k| if (f == &*iter) { 369| 33.0k| iter += e - f; 370| 33.0k| return true; 371| 33.0k| } 372| 33.0k| for (; f != e; ++f, ++iter) 373| 33.0k| if (*f != *iter) 374| 33.0k| return false; 375| 33.0k| return true; 376| 33.0k| }; 377| 33.0k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEESF_EEbOT_OT0_PT1_jm: 349| 1.44k| { 350| 1.44k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 1.44k, False: 0] ------------------ 351| 1.44k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 1.10k, False: 348] ------------------ 352| 1.44k| ? 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.44k| : posr.first_sub_inner( 360| 348| rrb{}, first, rootl, shiftl, sizel); 361| 1.44k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_16rrbtree_iteratorIiSE_Lj2ELj2EEESF_EEbOT_OT0_PT1_jm: 349| 6.81k| { 350| 6.81k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 6.81k, False: 0] ------------------ 351| 6.81k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 6.81k, False: 0] ------------------ 352| 6.81k| ? visit_maybe_relaxed_sub(rootl, 353| 6.81k| shiftl, 354| 6.81k| sizel, 355| 6.81k| this_t{}, 356| 6.81k| posr, 357| 6.81k| first, 358| 6.81k| size_t{}) 359| 6.81k| : posr.first_sub_inner( 360| 0| rrb{}, first, rootl, shiftl, sizel); 361| 6.81k| } _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.77k| { 451| 6.77k| auto node = pos.node(); 452| 6.77k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 3.58k, False: 3.18k] | Branch (452:33): [True: 1.39k, False: 1.78k] ------------------ 453| 3.18k| node->leaf() + pos.count(), 454| 3.18k| other->leaf()); 455| 6.77k| } _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| 31.5M|{ 1839| 31.5M| assert(node); ------------------ | Branch (1839:5): [True: 31.5M, False: 0] ------------------ 1840| 31.5M| auto relaxed = node->relaxed(); 1841| 31.5M| if (relaxed) { ------------------ | Branch (1841:9): [True: 29.0M, False: 2.50M] ------------------ 1842| 29.0M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 29.0M, False: 0] ------------------ 1843| 29.0M| return make_relaxed_pos(node, shift, relaxed) 1844| 29.0M| .visit(v, std::forward(args)...); 1845| 29.0M| } else { 1846| 2.50M| return make_regular_sub_pos(node, shift, size) 1847| 2.50M| .visit(v, std::forward(args)...); 1848| 2.50M| } 1849| 31.5M|} _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| 99.0M|{ 1829| 99.0M| assert(node); ------------------ | Branch (1829:5): [True: 99.0M, False: 0] ------------------ 1830| 99.0M| assert(relaxed); ------------------ | Branch (1830:5): [True: 99.0M, False: 0] ------------------ 1831| 99.0M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1831:5): [True: 99.0M, False: 0] ------------------ 1832| 99.0M| return {node, shift, relaxed}; 1833| 99.0M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1813| 37.1M| { 1814| 37.1M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 37.1M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 1431| 60.6M| node_t* node() const { return node_; } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 1476| 12.0M| { 1477| 12.0M| each_left(v, relaxed_->d.count, args...); 1478| 12.0M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1623| 12.2M| { 1624| 12.2M| auto p = node_->inner(); 1625| 12.2M| auto s = size_t{}; 1626| 12.2M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 2.14M, False: 10.0M] ------------------ 1627| 9.42M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 7.28M, False: 2.14M] ------------------ 1628| 7.28M| IMMER_PREFETCH(p + i + 1); 1629| 7.28M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 7.28M| .visit(v, args...); 1631| 7.28M| s = relaxed_->d.sizes[i]; 1632| 7.28M| assert(s); ------------------ | Branch (1632:17): [True: 7.28M, False: 0] ------------------ 1633| 7.28M| } 1634| 10.0M| } else { 1635| 10.0M| auto ss = shift_ - B; 1636| 40.0M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 29.9M, False: 10.0M] ------------------ 1637| 29.9M| visit_maybe_relaxed_sub( 1638| 29.9M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 29.9M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 29.9M, False: 0] ------------------ 1641| 29.9M| } 1642| 10.0M| } 1643| 12.2M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5countEv: 1430| 57.4M| 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.07M|{ 1045| 6.07M| assert(node); ------------------ | Branch (1045:5): [True: 6.07M, False: 0] ------------------ 1046| 6.07M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1046:5): [True: 6.07M, False: 0] ------------------ 1047| 6.07M| assert(size > 0); ------------------ | Branch (1047:5): [True: 6.07M, False: 0] ------------------ 1048| 6.07M| assert(size <= (branches << shift)); ------------------ | Branch (1048:5): [True: 6.07M, False: 0] ------------------ 1049| 6.07M| return {node, shift, size}; 1050| 6.07M|} _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.15M| 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| 610k| { 826| 610k| return each_regular(*this, v, args...); 827| 610k| } _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| 610k|{ 344| 610k| constexpr auto B = bits; 345| 610k| constexpr auto BL = bits_leaf; 346| 610k| auto n = p.node()->inner(); 347| 610k| auto last = p.count() - 1; 348| 610k| auto e = n + last; 349| 610k| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 54.6k, False: 555k] ------------------ 350| 118k| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 64.1k, False: 54.6k] ------------------ 351| 64.1k| IMMER_PREFETCH(n + 1); 352| 64.1k| make_full_leaf_pos(*n).visit(v, args...); 353| 64.1k| } 354| 54.6k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 555k| } else { 356| 555k| auto ss = p.shift() - B; 357| 1.30M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 747k, False: 555k] ------------------ 358| 747k| make_full_pos(*n, ss).visit(v, args...); 359| 555k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 555k| } 361| 610k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 787| 7.75M| 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.22M|{ 215| 4.22M| assert(node); ------------------ | Branch (215:5): [True: 4.22M, False: 0] ------------------ 216| 4.22M| return {node}; 217| 4.22M|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 207| 1.24M| { 208| 1.24M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.24M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 199| 3.23M| 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.53M| count_t count() const { return branches; } _ZN5immer6detail4rbts13make_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_8leaf_posIT_EEPSE_m: 119| 1.06M|{ 120| 1.06M| assert(node); ------------------ | Branch (120:5): [True: 1.06M, False: 0] ------------------ 121| 1.06M| assert(size > 0); ------------------ | Branch (121:5): [True: 1.06M, False: 0] ------------------ 122| 1.06M| return {node, size}; 123| 1.06M|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 786| 4.33M| 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| 482k| { 113| 482k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 482k| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 104| 1.07M| node_t* node() const { return node_; } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5countEv: 103| 1.13M| count_t count() const { return index(size_ - 1) + 1; } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 107| 1.17M| count_t index(size_t idx) const { return idx & mask; } _ZN5immer6detail4rbts13make_full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_8full_posIT_EEPSE_j: 1412| 6.26M|{ 1413| 6.26M| assert(node); ------------------ | Branch (1413:5): [True: 6.26M, False: 0] ------------------ 1414| 6.26M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1414:5): [True: 6.26M, False: 0] ------------------ 1415| 6.26M| return {node, shift}; 1416| 6.26M|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1405| 3.53M| { 1406| 3.53M| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.53M| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 1159| 4.34M| 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| 238k| { 1186| 238k| auto p = node_->inner(); 1187| 238k| auto e = p + branches; 1188| 238k| if (shift_ == BL) { ------------------ | Branch (1188:13): [True: 183k, False: 54.7k] ------------------ 1189| 917k| for (; p != e; ++p) { ------------------ | Branch (1189:20): [True: 734k, False: 183k] ------------------ 1190| 734k| IMMER_PREFETCH(p + 1); 1191| 734k| make_full_leaf_pos(*p).visit(v, args...); 1192| 734k| } 1193| 183k| } else { 1194| 54.7k| auto ss = shift_ - B; 1195| 273k| for (; p != e; ++p) ------------------ | Branch (1195:20): [True: 219k, False: 54.7k] ------------------ 1196| 219k| make_full_pos(*p, ss).visit(v, args...); 1197| 54.7k| } 1198| 238k| } _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| 5.60M|{ 691| 5.60M| assert(node); ------------------ | Branch (691:5): [True: 5.60M, False: 0] ------------------ 692| 5.60M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (692:5): [True: 5.60M, False: 0] ------------------ 693| 5.60M| assert(size > 0); ------------------ | Branch (693:5): [True: 5.60M, False: 0] ------------------ 694| 5.60M| return {node, shift, size}; 695| 5.60M|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 336| 2.39M| { 337| 2.39M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.39M| } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 231| 10.2M| node_t* node() const { return node_; } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 243| 2.24M| { 244| 2.24M| return each_regular(*this, v, args...); 245| 2.24M| } _ZN5immer6detail4rbts12each_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_11dec_visitorEJEEEvOT_T0_DpOT1_: 343| 2.24M|{ 344| 2.24M| constexpr auto B = bits; 345| 2.24M| constexpr auto BL = bits_leaf; 346| 2.24M| auto n = p.node()->inner(); 347| 2.24M| auto last = p.count() - 1; 348| 2.24M| auto e = n + last; 349| 2.24M| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 420k, False: 1.82M] ------------------ 350| 845k| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 424k, False: 420k] ------------------ 351| 424k| IMMER_PREFETCH(n + 1); 352| 424k| make_full_leaf_pos(*n).visit(v, args...); 353| 424k| } 354| 420k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 1.82M| } else { 356| 1.82M| auto ss = p.shift() - B; 357| 4.38M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 2.55M, False: 1.82M] ------------------ 358| 2.55M| make_full_pos(*n, ss).visit(v, args...); 359| 1.82M| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 1.82M| } 361| 2.24M|} _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 233| 9.78M| 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| 13.8M| 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.14M| count_t count() const { return index(size_ - 1) + 1; } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 234| 13.5M| 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.24M| 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.51M| 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.72M|{ 65| 1.72M| return {node}; 66| 1.72M|} _ZN5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 57| 1.72M| { 58| 1.72M| return Visitor::visit_regular(*this, std::forward(args)...); 59| 1.72M| } _ZNK5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 41| 1.72M| 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.7M|{ 152| 18.7M| assert(node); ------------------ | Branch (152:5): [True: 18.7M, False: 0] ------------------ 153| 18.7M| assert(count <= branches); ------------------ | Branch (153:5): [True: 18.7M, False: 0] ------------------ 154| 18.7M| return {node, count}; 155| 18.7M|} _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 144| 10.5M| { 145| 10.5M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 10.5M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 136| 16.2M| node_t* node() const { return node_; } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5countEv: 135| 9.11M| count_t count() const { return count_; } _ZN5immer6detail4rbts19make_empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_14empty_leaf_posIT_EEPSE_: 88| 1.62M|{ 89| 1.62M| assert(node); ------------------ | Branch (89:5): [True: 1.62M, False: 0] ------------------ 90| 1.62M| return {node}; 91| 1.62M|} _ZN5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 81| 1.62M| { 82| 1.62M| return Visitor::visit_leaf(*this, std::forward(args)...); 83| 1.62M| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 75| 1.62M| node_t* node() const { return node_; } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5countEv: 74| 7.96k| 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| 529k| { 1814| 529k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 529k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 1433| 11.7M| 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.96M| { 1444| 5.96M| return size_sbh(offset, size_before(offset)); 1445| 5.96M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8size_sbhEjm: 1448| 6.28M| { 1449| 6.28M| assert(size_before_hint == size_before(offset)); ------------------ | Branch (1449:9): [True: 6.28M, False: 0] ------------------ 1450| 6.28M| return relaxed_->d.sizes[offset] - size_before_hint; 1451| 6.28M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11size_beforeEj: 1438| 17.7M| { 1439| 17.7M| return offset ? relaxed_->d.sizes[offset - 1] : 0; ------------------ | Branch (1439:16): [True: 11.1M, False: 6.57M] ------------------ 1440| 17.7M| } _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| 515k| { 1738| 515k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 515k, False: 0] ------------------ 1739| 515k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 515k, False: 0] ------------------ 1740| 515k| auto child = node_->inner()[offset_hint]; 1741| 515k| auto is_leaf = shift_ == BL; 1742| 515k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 515k] ------------------ 1743| 515k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 515k| : visit_maybe_relaxed_sub( 1745| 515k| child, shift_ - B, child_size_hint, v, args...); 1746| 515k| } _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| 515k|{ 1839| 515k| assert(node); ------------------ | Branch (1839:5): [True: 515k, False: 0] ------------------ 1840| 515k| auto relaxed = node->relaxed(); 1841| 515k| if (relaxed) { ------------------ | Branch (1841:9): [True: 313k, False: 201k] ------------------ 1842| 313k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 313k, False: 0] ------------------ 1843| 313k| return make_relaxed_pos(node, shift, relaxed) 1844| 313k| .visit(v, std::forward(args)...); 1845| 313k| } else { 1846| 201k| return make_regular_sub_pos(node, shift, size) 1847| 201k| .visit(v, std::forward(args)...); 1848| 201k| } 1849| 515k|} _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.39M| 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| 519k| { 953| 519k| return last_oh_regular(*this, v, offset_hint, args...); 954| 519k| } _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| 519k|{ 678| 519k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 519k, False: 0] ------------------ 679| 519k| constexpr auto B = bits; 680| 519k| constexpr auto BL = bits_leaf; 681| 519k| auto child = p.node()->inner()[offset_hint]; 682| 519k| auto is_leaf = p.shift() == BL; 683| 519k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 519k] ------------------ 684| 519k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 519k| .visit(v, args...); 686| 519k|} _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.21M| { 337| 2.21M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.21M| } _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.69M| { 331| 1.69M| return last_oh_regular(*this, v, offset_hint, args...); 332| 1.69M| } _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.69M|{ 678| 1.69M| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.69M, False: 0] ------------------ 679| 1.69M| constexpr auto B = bits; 680| 1.69M| constexpr auto BL = bits_leaf; 681| 1.69M| auto child = p.node()->inner()[offset_hint]; 682| 1.69M| auto is_leaf = p.shift() == BL; 683| 1.69M| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.69M] ------------------ 684| 1.69M| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.69M| .visit(v, args...); 686| 1.69M|} _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 1432| 22.0M| 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| 341k| { 1037| 341k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 341k| } 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| 42.9k| { 145| 42.9k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 42.9k| } _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| 313k|{ 1839| 313k| assert(node); ------------------ | Branch (1839:5): [True: 313k, False: 0] ------------------ 1840| 313k| auto relaxed = node->relaxed(); 1841| 313k| if (relaxed) { ------------------ | Branch (1841:9): [True: 279k, False: 34.0k] ------------------ 1842| 279k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 279k, False: 0] ------------------ 1843| 279k| return make_relaxed_pos(node, shift, relaxed) 1844| 279k| .visit(v, std::forward(args)...); 1845| 279k| } else { 1846| 34.0k| return make_regular_sub_pos(node, shift, size) 1847| 34.0k| .visit(v, std::forward(args)...); 1848| 34.0k| } 1849| 313k|} 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| 279k| { 1814| 279k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 279k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 1454| 29.9M| { 1455| 29.9M| auto offset = idx >> shift_; 1456| 41.6M| while (relaxed_->d.sizes[offset] <= idx) ------------------ | Branch (1456:16): [True: 11.6M, False: 29.9M] ------------------ 1457| 11.6M| ++offset; 1458| 29.9M| return offset; 1459| 29.9M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7relaxedEv: 1435| 279k| 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| 279k| { 1687| 279k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 279k, False: 0] ------------------ 1688| 279k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 60.3k, False: 218k] ------------------ 1689| 279k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 279k| } 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| 279k| { 1699| 279k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 279k| } 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| 279k| { 1718| 279k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 279k, False: 0] ------------------ 1719| 279k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 60.3k, False: 218k] | Branch (1719:9): [True: 279k, False: 0] ------------------ 1720| 279k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 279k| auto child = node_->inner()[offset_hint]; 1722| 279k| auto is_leaf = shift_ == BL; 1723| 279k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 279k| auto next_idx = idx - left_size_hint; 1725| 279k| return is_leaf ------------------ | Branch (1725:16): [True: 46.9k, False: 232k] ------------------ 1726| 279k| ? make_leaf_sub_pos(child, next_size) 1727| 46.9k| .visit(v, next_idx, args...) 1728| 279k| : visit_maybe_relaxed_sub( 1729| 232k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 279k| } 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| 46.9k| { 145| 46.9k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 46.9k| } 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| 34.0k| { 1037| 34.0k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 34.0k| } 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| 34.0k| { 939| 34.0k| return towards_oh_ch_regular( 940| 34.0k| *this, v, idx, offset_hint, count(), args...); 941| 34.0k| } 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| 34.0k|{ 633| 34.0k| constexpr auto B = bits; 634| 34.0k| constexpr auto BL = bits_leaf; 635| 34.0k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 34.0k, False: 0] ------------------ 636| 34.0k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 34.0k, False: 0] ------------------ 637| 34.0k| auto is_leaf = p.shift() == BL; 638| 34.0k| auto child = p.node()->inner()[offset_hint]; 639| 34.0k| auto is_full = offset_hint + 1 != count_hint; 640| 34.0k| return is_full ------------------ | Branch (640:12): [True: 26.1k, False: 7.82k] ------------------ 641| 34.0k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 11.7k, False: 14.4k] ------------------ 642| 26.1k| : make_full_pos(child, p.shift() - B) 643| 14.4k| .visit(v, idx, args...)) 644| 34.0k| : (is_leaf ------------------ | Branch (644:19): [True: 4.10k, False: 3.71k] ------------------ 645| 7.82k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 7.82k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.71k| .visit(v, idx, args...)); 648| 34.0k|} 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| 29.0k| { 208| 29.0k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 29.0k| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 202| 434k| 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| 20.2k| { 1406| 20.2k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 20.2k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 1162| 2.10M| 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| 20.2k| { 1330| 20.2k| return towards_oh(v, idx, offset_hint, args...); 1331| 20.2k| } 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| 20.2k| { 1337| 20.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 20.2k, False: 0] ------------------ 1338| 20.2k| auto is_leaf = shift_ == BL; 1339| 20.2k| auto child = node_->inner()[offset_hint]; 1340| 20.2k| return is_leaf ------------------ | Branch (1340:16): [True: 15.2k, False: 4.97k] ------------------ 1341| 20.2k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 20.2k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 20.2k| } 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.97k| { 113| 4.97k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 4.97k| } flex-vector.cpp:_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 336| 4.10k| { 337| 4.10k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.10k| } flex-vector.cpp:_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_: 316| 4.10k| { 317| 4.10k| return towards_oh_ch_regular( 318| 4.10k| *this, v, idx, offset_hint, count(), args...); 319| 4.10k| } flex-vector.cpp:_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_14update_visitorISD_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcOSL_T0_mjjDpOT1_: 632| 4.10k|{ 633| 4.10k| constexpr auto B = bits; 634| 4.10k| constexpr auto BL = bits_leaf; 635| 4.10k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.10k, False: 0] ------------------ 636| 4.10k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.10k, False: 0] ------------------ 637| 4.10k| auto is_leaf = p.shift() == BL; 638| 4.10k| auto child = p.node()->inner()[offset_hint]; 639| 4.10k| auto is_full = offset_hint + 1 != count_hint; 640| 4.10k| return is_full ------------------ | Branch (640:12): [True: 2.84k, False: 1.25k] ------------------ 641| 4.10k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.97k, False: 874] ------------------ 642| 2.84k| : make_full_pos(child, p.shift() - B) 643| 874| .visit(v, idx, args...)) 644| 4.10k| : (is_leaf ------------------ | Branch (644:19): [True: 870, False: 384] ------------------ 645| 1.25k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.25k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 384| .visit(v, idx, args...)); 648| 4.10k|} _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| 44.9k|{ 1839| 44.9k| assert(node); ------------------ | Branch (1839:5): [True: 44.9k, False: 0] ------------------ 1840| 44.9k| auto relaxed = node->relaxed(); 1841| 44.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 38.7k, False: 6.14k] ------------------ 1842| 38.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 38.7k, False: 0] ------------------ 1843| 38.7k| return make_relaxed_pos(node, shift, relaxed) 1844| 38.7k| .visit(v, std::forward(args)...); 1845| 38.7k| } else { 1846| 6.14k| return make_regular_sub_pos(node, shift, size) 1847| 6.14k| .visit(v, std::forward(args)...); 1848| 6.14k| } 1849| 44.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 38.7k| { 1814| 38.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 38.7k| } _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| 29.9k| { 1687| 29.9k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 29.9k, False: 0] ------------------ 1688| 29.9k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 29.9k] ------------------ 1689| 29.9k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 29.9k| } _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| 29.9k| { 1699| 29.9k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 29.9k| } _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| 29.9k| { 1718| 29.9k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 29.9k, False: 0] ------------------ 1719| 29.9k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 29.9k] | Branch (1719:9): [True: 29.9k, False: 0] ------------------ 1720| 29.9k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 29.9k| auto child = node_->inner()[offset_hint]; 1722| 29.9k| auto is_leaf = shift_ == BL; 1723| 29.9k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 29.9k| auto next_idx = idx - left_size_hint; 1725| 29.9k| return is_leaf ------------------ | Branch (1725:16): [True: 1.96k, False: 27.9k] ------------------ 1726| 29.9k| ? make_leaf_sub_pos(child, next_size) 1727| 1.96k| .visit(v, next_idx, args...) 1728| 29.9k| : visit_maybe_relaxed_sub( 1729| 27.9k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 29.9k| } _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.96k| { 145| 1.96k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.96k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1686| 20.8k| { 1687| 20.8k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 20.8k, False: 0] ------------------ 1688| 20.8k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 13.7k, False: 7.09k] ------------------ 1689| 20.8k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 20.8k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1698| 20.8k| { 1699| 20.8k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 20.8k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1717| 20.8k| { 1718| 20.8k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 20.8k, False: 0] ------------------ 1719| 20.8k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 13.7k, False: 7.09k] | Branch (1719:9): [True: 20.8k, False: 0] ------------------ 1720| 20.8k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 20.8k| auto child = node_->inner()[offset_hint]; 1722| 20.8k| auto is_leaf = shift_ == BL; 1723| 20.8k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 20.8k| auto next_idx = idx - left_size_hint; 1725| 20.8k| return is_leaf ------------------ | Branch (1725:16): [True: 5.19k, False: 15.6k] ------------------ 1726| 20.8k| ? make_leaf_sub_pos(child, next_size) 1727| 5.19k| .visit(v, next_idx, args...) 1728| 20.8k| : visit_maybe_relaxed_sub( 1729| 15.6k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 20.8k| } _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.19k| { 145| 5.19k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.19k| } _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| 15.6k|{ 1839| 15.6k| assert(node); ------------------ | Branch (1839:5): [True: 15.6k, False: 0] ------------------ 1840| 15.6k| auto relaxed = node->relaxed(); 1841| 15.6k| if (relaxed) { ------------------ | Branch (1841:9): [True: 11.9k, False: 3.64k] ------------------ 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| 3.64k| return make_regular_sub_pos(node, shift, size) 1847| 3.64k| .visit(v, std::forward(args)...); 1848| 3.64k| } 1849| 15.6k|} _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| 3.64k| { 1037| 3.64k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.64k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 927| 6.31k| { 928| 6.31k| return towards_oh_ch_regular( 929| 6.31k| *this, v, idx, offset_hint, count(), args...); 930| 6.31k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_19slice_right_visitorISD_Lb0EEEJEEEDcOT_T0_mjjDpOT1_: 632| 6.31k|{ 633| 6.31k| constexpr auto B = bits; 634| 6.31k| constexpr auto BL = bits_leaf; 635| 6.31k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.31k, False: 0] ------------------ 636| 6.31k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.31k, False: 0] ------------------ 637| 6.31k| auto is_leaf = p.shift() == BL; 638| 6.31k| auto child = p.node()->inner()[offset_hint]; 639| 6.31k| auto is_full = offset_hint + 1 != count_hint; 640| 6.31k| return is_full ------------------ | Branch (640:12): [True: 2.33k, False: 3.97k] ------------------ 641| 6.31k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.48k, False: 852] ------------------ 642| 2.33k| : make_full_pos(child, p.shift() - B) 643| 852| .visit(v, idx, args...)) 644| 6.31k| : (is_leaf ------------------ | Branch (644:19): [True: 914, False: 3.06k] ------------------ 645| 3.97k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.97k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.06k| .visit(v, idx, args...)); 648| 6.31k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 207| 5.34k| { 208| 5.34k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.34k| } _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.25k| { 1406| 2.25k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.25k| } _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.40k| { 1337| 3.40k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 3.40k, False: 0] ------------------ 1338| 3.40k| auto is_leaf = shift_ == BL; 1339| 3.40k| auto child = node_->inner()[offset_hint]; 1340| 3.40k| return is_leaf ------------------ | Branch (1340:16): [True: 2.42k, False: 978] ------------------ 1341| 3.40k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 3.40k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 3.40k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 1161| 172k| 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.12k| { 113| 2.12k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.12k| } _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.60k| { 337| 4.60k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.60k| } _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.60k| { 306| 4.60k| return towards_oh_ch_regular( 307| 4.60k| *this, v, idx, offset_hint, count(), args...); 308| 4.60k| } _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.60k|{ 633| 4.60k| constexpr auto B = bits; 634| 4.60k| constexpr auto BL = bits_leaf; 635| 4.60k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.60k, False: 0] ------------------ 636| 4.60k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.60k, False: 0] ------------------ 637| 4.60k| auto is_leaf = p.shift() == BL; 638| 4.60k| auto child = p.node()->inner()[offset_hint]; 639| 4.60k| auto is_full = offset_hint + 1 != count_hint; 640| 4.60k| return is_full ------------------ | Branch (640:12): [True: 1.84k, False: 2.75k] ------------------ 641| 4.60k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.42k, False: 420] ------------------ 642| 1.84k| : make_full_pos(child, p.shift() - B) 643| 420| .visit(v, idx, args...)) 644| 4.60k| : (is_leaf ------------------ | Branch (644:19): [True: 1.21k, False: 1.54k] ------------------ 645| 2.75k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.75k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.54k| .visit(v, idx, args...)); 648| 4.60k|} _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.14k| { 1037| 6.14k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.14k| } _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.47k| { 928| 3.47k| return towards_oh_ch_regular( 929| 3.47k| *this, v, idx, offset_hint, count(), args...); 930| 3.47k| } _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.47k|{ 633| 3.47k| constexpr auto B = bits; 634| 3.47k| constexpr auto BL = bits_leaf; 635| 3.47k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.47k, False: 0] ------------------ 636| 3.47k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.47k, False: 0] ------------------ 637| 3.47k| auto is_leaf = p.shift() == BL; 638| 3.47k| auto child = p.node()->inner()[offset_hint]; 639| 3.47k| auto is_full = offset_hint + 1 != count_hint; 640| 3.47k| return is_full ------------------ | Branch (640:12): [True: 2.78k, False: 686] ------------------ 641| 3.47k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 837, False: 1.94k] ------------------ 642| 2.78k| : make_full_pos(child, p.shift() - B) 643| 1.94k| .visit(v, idx, args...)) 644| 3.47k| : (is_leaf ------------------ | Branch (644:19): [True: 686, False: 0] ------------------ 645| 686| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 686| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 3.47k|} _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.62k| { 208| 1.62k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.62k| } _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.48k| { 1406| 2.48k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.48k| } _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.33k| { 1337| 1.33k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.33k, False: 0] ------------------ 1338| 1.33k| auto is_leaf = shift_ == BL; 1339| 1.33k| auto child = node_->inner()[offset_hint]; 1340| 1.33k| return is_leaf ------------------ | Branch (1340:16): [True: 791, False: 542] ------------------ 1341| 1.33k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.33k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.33k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 112| 686| { 113| 686| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 686| } _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: 15.2k, False: 6.69k] ------------------ 1842| 15.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 15.2k, False: 0] ------------------ 1843| 15.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 15.2k| .visit(v, std::forward(args)...); 1845| 15.2k| } else { 1846| 6.69k| return make_regular_sub_pos(node, shift, size) 1847| 6.69k| .visit(v, std::forward(args)...); 1848| 6.69k| } 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| 15.2k| { 1814| 15.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 15.2k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8subindexEm: 1434| 9.49M| 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.59k| { 1706| 4.59k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 4.59k, False: 0] ------------------ 1707| 4.59k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 3.88k, False: 703] ------------------ 1708| 4.59k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 4.59k| } _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.59k| { 1718| 4.59k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 4.59k, False: 0] ------------------ 1719| 4.59k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.88k, False: 703] | Branch (1719:9): [True: 4.59k, False: 0] ------------------ 1720| 4.59k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 4.59k| auto child = node_->inner()[offset_hint]; 1722| 4.59k| auto is_leaf = shift_ == BL; 1723| 4.59k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 4.59k| auto next_idx = idx - left_size_hint; 1725| 4.59k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 4.59k] ------------------ 1726| 4.59k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 4.59k| : visit_maybe_relaxed_sub( 1729| 4.59k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 4.59k| } _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| 60.3k| { 1706| 60.3k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 60.3k, False: 0] ------------------ 1707| 60.3k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 15.7k, False: 44.6k] ------------------ 1708| 60.3k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 60.3k| } _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| 60.3k| { 1718| 60.3k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 60.3k, False: 0] ------------------ 1719| 60.3k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 15.7k, False: 44.6k] | Branch (1719:9): [True: 60.3k, False: 0] ------------------ 1720| 60.3k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 60.3k| auto child = node_->inner()[offset_hint]; 1722| 60.3k| auto is_leaf = shift_ == BL; 1723| 60.3k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 60.3k| auto next_idx = idx - left_size_hint; 1725| 60.3k| return is_leaf ------------------ | Branch (1725:16): [True: 8.51k, False: 51.8k] ------------------ 1726| 60.3k| ? make_leaf_sub_pos(child, next_size) 1727| 8.51k| .visit(v, next_idx, args...) 1728| 60.3k| : visit_maybe_relaxed_sub( 1729| 51.8k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 60.3k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 144| 8.51k| { 145| 8.51k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 8.51k| } _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| 51.8k|{ 1839| 51.8k| assert(node); ------------------ | Branch (1839:5): [True: 51.8k, False: 0] ------------------ 1840| 51.8k| auto relaxed = node->relaxed(); 1841| 51.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 49.6k, False: 2.14k] ------------------ 1842| 49.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 49.6k, False: 0] ------------------ 1843| 49.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 49.6k| .visit(v, std::forward(args)...); 1845| 49.6k| } else { 1846| 2.14k| return make_regular_sub_pos(node, shift, size) 1847| 2.14k| .visit(v, std::forward(args)...); 1848| 2.14k| } 1849| 51.8k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1813| 49.6k| { 1814| 49.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 49.6k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1036| 2.14k| { 1037| 2.14k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.14k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11size_beforeEj: 791| 189k| { 792| 189k| return size_t{offset} << shift_; 793| 189k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8size_sbhEjm: 803| 29.7k| { 804| 29.7k| assert(size_before_hint == size_before(offset)); ------------------ | Branch (804:9): [True: 29.7k, False: 0] ------------------ 805| 29.7k| return offset == subindex(size_ - 1) ? size_ - size_before_hint ------------------ | Branch (805:16): [True: 15.5k, False: 14.1k] ------------------ 806| 29.7k| : size_t{1} << shift_; 807| 29.7k| } _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| 7.57k| { 947| 7.57k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 7.57k| } _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| 7.57k|{ 654| 7.57k| constexpr auto B = bits; 655| 7.57k| constexpr auto BL = bits_leaf; 656| 7.57k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 7.57k, False: 0] ------------------ 657| 7.57k| auto is_leaf = p.shift() == BL; 658| 7.57k| auto child = p.node()->inner()[offset_hint]; 659| 7.57k| auto lsize = offset_hint << p.shift(); 660| 7.57k| auto size = p.this_size(); 661| 7.57k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 7.57k| return is_full ------------------ | Branch (662:12): [True: 7.57k, False: 0] ------------------ 663| 7.57k| ? (is_leaf ------------------ | Branch (663:19): [True: 4.23k, False: 3.34k] ------------------ 664| 7.57k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 7.57k| : make_full_pos(child, p.shift() - B) 666| 3.34k| .visit(v, idx - lsize, args...)) 667| 7.57k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 0] ------------------ 668| 0| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 0| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 0| .visit(v, idx - lsize, args...)); 672| 7.57k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9this_sizeEv: 794| 29.7k| 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| 8.84k| { 208| 8.84k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 8.84k| } _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.26k| { 1406| 5.26k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 5.26k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8subindexEm: 1163| 19.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| 39.4k| { 1171| 39.4k| return size_t{offset} << shift_; 1172| 39.4k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8size_sbhEjm: 1166| 19.7k| { 1167| 19.7k| return size_t{1} << shift_; 1168| 19.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.53k| { 1349| 6.53k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 6.53k, False: 0] ------------------ 1350| 6.53k| auto is_leaf = shift_ == BL; 1351| 6.53k| auto child = node_->inner()[offset_hint]; 1352| 6.53k| auto lsize = size_t{offset_hint} << shift_; 1353| 6.53k| return is_leaf ------------------ | Branch (1353:16): [True: 4.60k, False: 1.92k] ------------------ 1354| 6.53k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 6.53k| : make_full_pos(child, shift_ - B) 1356| 1.92k| .visit(v, idx - lsize, args...); 1357| 6.53k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10copy_sizesEjjmPm: 1175| 17.1k| { 1176| 17.1k| auto e = sizes + n; 1177| 42.8k| for (; sizes != e; ++sizes) { ------------------ | Branch (1177:16): [True: 25.6k, False: 17.1k] ------------------ 1178| 25.6k| init = *sizes = init + (size_t{1} << shift_); 1179| | assert(init); ------------------ | Branch (1179:13): [True: 25.6k, False: 0] ------------------ 1180| 25.6k| } 1181| 17.1k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 1160| 723k| 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| 202k| { 811| 202k| if (n) { ------------------ | Branch (811:13): [True: 196k, False: 5.27k] ------------------ 812| 196k| auto last = offset + n - 1; 813| 196k| auto e = sizes + n - 1; 814| 393k| for (; sizes != e; ++sizes) { ------------------ | Branch (814:20): [True: 196k, False: 196k] ------------------ 815| 196k| init = *sizes = init + (size_t{1} << shift_); 816| 196k| assert(init); ------------------ | Branch (816:17): [True: 196k, False: 0] ------------------ 817| 196k| } 818| 196k| *sizes = init + size(last); 819| | assert(*sizes); ------------------ | Branch (819:13): [True: 196k, False: 0] ------------------ 820| 196k| } 821| 202k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEj: 797| 213k| { 798| 213k| return offset == subindex(size_ - 1) ? size_ - size_before(offset) ------------------ | Branch (798:16): [True: 109k, False: 103k] ------------------ 799| 213k| : size_t{1} << shift_; 800| 213k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10copy_sizesEjjmPm: 1462| 5.00M| { 1463| 5.00M| auto e = sizes + n; 1464| 5.00M| auto prev = size_before(offset); 1465| 5.00M| auto these = relaxed_->d.sizes + offset; 1466| 14.3M| for (; sizes != e; ++sizes, ++these) { ------------------ | Branch (1466:16): [True: 9.30M, False: 5.00M] ------------------ 1467| 9.30M| auto this_size = *these; 1468| 9.30M| init = *sizes = init + (this_size - prev); 1469| 9.30M| assert(init); ------------------ | Branch (1469:13): [True: 9.30M, False: 0] ------------------ 1470| 9.30M| prev = this_size; 1471| 9.30M| } 1472| 5.00M| } _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| 6.69k| { 1037| 6.69k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.69k| } _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.62k| { 947| 3.62k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 3.62k| } _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.62k|{ 654| 3.62k| constexpr auto B = bits; 655| 3.62k| constexpr auto BL = bits_leaf; 656| 3.62k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 3.62k, False: 0] ------------------ 657| 3.62k| auto is_leaf = p.shift() == BL; 658| 3.62k| auto child = p.node()->inner()[offset_hint]; 659| 3.62k| auto lsize = offset_hint << p.shift(); 660| 3.62k| auto size = p.this_size(); 661| 3.62k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 3.62k| return is_full ------------------ | Branch (662:12): [True: 1.26k, False: 2.36k] ------------------ 663| 3.62k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 1.26k] ------------------ 664| 1.26k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 1.26k| : make_full_pos(child, p.shift() - B) 666| 1.26k| .visit(v, idx - lsize, args...)) 667| 3.62k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 2.36k] ------------------ 668| 2.36k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 2.36k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 2.36k| .visit(v, idx - lsize, args...)); 672| 3.62k|} _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.56k| { 1406| 1.56k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.56k| } _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.36k| { 1037| 2.36k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.36k| } _ZN5immer6detail4rbts30make_singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaPT_j: 766| 7.96k|{ 767| 7.96k| assert(leaf); ------------------ | Branch (767:5): [True: 7.96k, False: 0] ------------------ 768| 7.96k| IMMER_ASSERT_TAGGED(leaf->kind() == NodeT::kind_t::leaf); ------------------ | | 68| 7.96k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (768:5): [True: 7.96k, False: 0] ------------------ 769| 7.96k| assert(count > 0); ------------------ | Branch (769:5): [True: 7.96k, False: 0] ------------------ 770| 7.96k| return singleton_regular_sub_pos{leaf, count}; 771| 7.96k|} _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| 7.96k| { 760| 7.96k| return Visitor::visit_regular(*this, std::forward(args)...); 761| 7.96k| } _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| 7.96k|{ 1839| 7.96k| assert(node); ------------------ | Branch (1839:5): [True: 7.96k, False: 0] ------------------ 1840| 7.96k| auto relaxed = node->relaxed(); 1841| 7.96k| if (relaxed) { ------------------ | Branch (1841:9): [True: 5.58k, False: 2.37k] ------------------ 1842| 5.58k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 5.58k, False: 0] ------------------ 1843| 5.58k| return make_relaxed_pos(node, shift, relaxed) 1844| 5.58k| .visit(v, std::forward(args)...); 1845| 5.58k| } else { 1846| 2.37k| return make_regular_sub_pos(node, shift, size) 1847| 2.37k| .visit(v, std::forward(args)...); 1848| 2.37k| } 1849| 7.96k|} _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.58k| { 1814| 5.58k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 5.58k| } _ZNK5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 735| 26.9k| 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| 7.96k| { 745| 7.96k| } _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.55M| { 145| 2.55M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.55M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEDcT_DpOT0_: 1813| 21.4M| { 1814| 21.4M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 21.4M| } _ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_: 707| 2.37M| { 708| 2.37M| } _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| 7.96k| { 745| 7.96k| } _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.55M| { 145| 2.55M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.55M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 137| 2.55M| size_t size() const { return count_; } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 1813| 21.4M| { 1814| 21.4M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 21.4M| } _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.37M| { 708| 2.37M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1762| 17.8k| { 1763| 17.8k| auto child = node_->inner()[0]; 1764| 17.8k| auto child_size = relaxed_->d.sizes[0]; 1765| 17.8k| auto is_leaf = shift_ == BL; 1766| 17.8k| assert(child_size); ------------------ | Branch (1766:9): [True: 17.8k, False: 0] ------------------ 1767| 17.8k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 17.8k] ------------------ 1768| 17.8k| : visit_maybe_relaxed_sub( 1769| 17.8k| child, shift_ - B, child_size, v, args...); 1770| 17.8k| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 76| 7.96k| shift_t shift() const { return 0; } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 138| 1.99M| shift_t shift() const { return 0; } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 17.8k|{ 1839| 17.8k| assert(node); ------------------ | Branch (1839:5): [True: 17.8k, False: 0] ------------------ 1840| 17.8k| auto relaxed = node->relaxed(); 1841| 17.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 17.4k, False: 382] ------------------ 1842| 17.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 17.4k, False: 0] ------------------ 1843| 17.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 17.4k| .visit(v, std::forward(args)...); 1845| 17.4k| } else { 1846| 382| return make_regular_sub_pos(node, shift, size) 1847| 382| .visit(v, std::forward(args)...); 1848| 382| } 1849| 17.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| 17.4k| { 1814| 17.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 17.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| 382| { 1037| 382| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 382| } _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| 759| { 971| 759| auto is_leaf = shift_ == BL; 972| 759| auto child = node_->inner()[0]; 973| 759| auto is_full = size_ >= (size_t{1} << shift_); 974| 759| return is_full ------------------ | Branch (974:16): [True: 759, False: 0] ------------------ 975| 759| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 759] ------------------ 976| 759| ? make_full_leaf_pos(child).visit(v, args...) 977| 759| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 759| : (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| 759| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 201| 139k| 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.13k| { 1406| 1.13k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.13k| } _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| 380| { 1362| 380| auto is_leaf = shift_ == BL; 1363| 380| auto child = node_->inner()[0]; 1364| 380| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 380] ------------------ 1365| 380| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 380| } _ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_: 711| 132k| { 712| 132k| } _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| 129k| { 1305| 129k| each_i(v, 1, branches, args...); 1306| 129k| } _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| 129k| { 1264| 129k| auto p = node_->inner() + i; 1265| 129k| auto e = node_->inner() + n; 1266| 129k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 67.0k, False: 62.8k] ------------------ 1267| 268k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 201k, False: 67.0k] ------------------ 1268| 201k| IMMER_PREFETCH(p + 1); 1269| 201k| make_full_leaf_pos(*p).visit(v, args...); 1270| 201k| } 1271| 67.0k| } else { 1272| 62.8k| auto ss = shift_ - B; 1273| 251k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 188k, False: 62.8k] ------------------ 1274| 188k| make_full_pos(*p, ss).visit(v, args...); 1275| 62.8k| } 1276| 129k| } _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.02M| { 208| 1.02M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.02M| } _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| 717k| { 1406| 717k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 717k| } _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| 132k| { 712| 132k| } _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| 129k| { 1305| 129k| each_i(v, 1, branches, args...); 1306| 129k| } _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| 129k| { 1264| 129k| auto p = node_->inner() + i; 1265| 129k| auto e = node_->inner() + n; 1266| 129k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 67.0k, False: 62.8k] ------------------ 1267| 268k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 201k, False: 67.0k] ------------------ 1268| 201k| IMMER_PREFETCH(p + 1); 1269| 201k| make_full_leaf_pos(*p).visit(v, args...); 1270| 201k| } 1271| 67.0k| } else { 1272| 62.8k| auto ss = shift_ - B; 1273| 251k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 188k, False: 62.8k] ------------------ 1274| 188k| make_full_pos(*p, ss).visit(v, args...); 1275| 62.8k| } 1276| 129k| } _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.02M| { 208| 1.02M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.02M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 200| 1.02M| 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| 717k| { 1406| 717k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 717k| } _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| 759| { 754| 759| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 759| } _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| 759| { 145| 759| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 759| } _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| 759| { 1371| 759| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 759, False: 0] ------------------ 1372| 759| auto child = node_->inner()[0]; 1373| 759| return make_full_leaf_pos(child).visit(v, args...); 1374| 759| } _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.76k| { 208| 2.76k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 2.76k| } _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| 139k| { 907| 139k| if (count() > 1) ------------------ | Branch (907:13): [True: 122k, False: 16.4k] ------------------ 908| 122k| each_right_sub_(v, 1, args...); 909| 139k| } _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| 122k| { 880| 122k| auto last = count() - 1; 881| 122k| auto lsize = size_ - (last << shift_); 882| 122k| auto n = node()->inner() + i; 883| 122k| auto e = node()->inner() + last; 884| 122k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 55.7k, False: 67.0k] ------------------ 885| 164k| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 108k, False: 55.7k] ------------------ 886| 108k| IMMER_PREFETCH(n + 1); 887| 108k| make_full_leaf_pos(*n).visit(v, args...); 888| 108k| } 889| 55.7k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 67.0k| } else { 891| 67.0k| auto ss = shift_ - B; 892| 174k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 107k, False: 67.0k] ------------------ 893| 107k| make_full_pos(*n, ss).visit(v, args...); 894| 67.0k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 67.0k| } 896| 122k| } _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| 645k| { 1037| 645k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 645k| } _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| 139k| { 907| 139k| if (count() > 1) ------------------ | Branch (907:13): [True: 122k, False: 16.4k] ------------------ 908| 122k| each_right_sub_(v, 1, args...); 909| 139k| } _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| 122k| { 880| 122k| auto last = count() - 1; 881| 122k| auto lsize = size_ - (last << shift_); 882| 122k| auto n = node()->inner() + i; 883| 122k| auto e = node()->inner() + last; 884| 122k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 55.7k, False: 67.0k] ------------------ 885| 164k| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 108k, False: 55.7k] ------------------ 886| 108k| IMMER_PREFETCH(n + 1); 887| 108k| make_full_leaf_pos(*n).visit(v, args...); 888| 108k| } 889| 55.7k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 67.0k| } else { 891| 67.0k| auto ss = shift_ - B; 892| 174k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 107k, False: 67.0k] ------------------ 893| 107k| make_full_pos(*n, ss).visit(v, args...); 894| 67.0k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 67.0k| } 896| 122k| } _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| 645k| { 1037| 645k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 645k| } _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.00k| { 754| 2.00k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 2.00k| } _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.00k| { 145| 2.00k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.00k| } _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.00k| { 987| 2.00k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 2.00k, False: 0] ------------------ 988| 2.00k| auto child = node_->inner()[0]; 989| 2.00k| auto is_full = size_ >= branches; 990| 2.00k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 2.00k, False: 0] ------------------ 991| 2.00k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 2.00k| } _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.20k| { 145| 5.20k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.20k| } _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.08M| { 1648| 3.08M| each_right(v, 1, std::forward(args)...); 1649| 3.08M| } _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.08M| { 1654| 3.08M| assert(start > 0); ------------------ | Branch (1654:9): [True: 3.08M, False: 0] ------------------ 1655| 3.08M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 3.08M, False: 0] ------------------ 1656| 3.08M| auto s = relaxed_->d.sizes[start - 1]; 1657| 3.08M| auto p = node_->inner(); 1658| 3.08M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 394k, False: 2.68M] ------------------ 1659| 1.07M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 683k, False: 394k] ------------------ 1660| 683k| IMMER_PREFETCH(p + i + 1); 1661| 683k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 683k| .visit(v, args...); 1663| 683k| s = relaxed_->d.sizes[i]; 1664| 683k| assert(s); ------------------ | Branch (1664:17): [True: 683k, False: 0] ------------------ 1665| 683k| } 1666| 2.68M| } else { 1667| 2.68M| auto ss = shift_ - B; 1668| 9.60M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 6.91M, False: 2.68M] ------------------ 1669| 6.91M| visit_maybe_relaxed_sub( 1670| 6.91M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 6.91M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 6.91M, False: 0] ------------------ 1673| 6.91M| } 1674| 2.68M| } 1675| 3.08M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEDcPT_jmT0_DpOT1_: 1838| 14.0M|{ 1839| 14.0M| assert(node); ------------------ | Branch (1839:5): [True: 14.0M, False: 0] ------------------ 1840| 14.0M| auto relaxed = node->relaxed(); 1841| 14.0M| if (relaxed) { ------------------ | Branch (1841:9): [True: 13.4M, False: 578k] ------------------ 1842| 13.4M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 13.4M, False: 0] ------------------ 1843| 13.4M| return make_relaxed_pos(node, shift, relaxed) 1844| 13.4M| .visit(v, std::forward(args)...); 1845| 13.4M| } else { 1846| 578k| return make_regular_sub_pos(node, shift, size) 1847| 578k| .visit(v, std::forward(args)...); 1848| 578k| } 1849| 14.0M|} _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.08M| { 1648| 3.08M| each_right(v, 1, std::forward(args)...); 1649| 3.08M| } _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.08M| { 1654| 3.08M| assert(start > 0); ------------------ | Branch (1654:9): [True: 3.08M, False: 0] ------------------ 1655| 3.08M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 3.08M, False: 0] ------------------ 1656| 3.08M| auto s = relaxed_->d.sizes[start - 1]; 1657| 3.08M| auto p = node_->inner(); 1658| 3.08M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 394k, False: 2.68M] ------------------ 1659| 1.07M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 683k, False: 394k] ------------------ 1660| 683k| IMMER_PREFETCH(p + i + 1); 1661| 683k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 683k| .visit(v, args...); 1663| 683k| s = relaxed_->d.sizes[i]; 1664| 683k| assert(s); ------------------ | Branch (1664:17): [True: 683k, False: 0] ------------------ 1665| 683k| } 1666| 2.68M| } else { 1667| 2.68M| auto ss = shift_ - B; 1668| 9.60M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 6.91M, False: 2.68M] ------------------ 1669| 6.91M| visit_maybe_relaxed_sub( 1670| 6.91M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 6.91M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 6.91M, False: 0] ------------------ 1673| 6.91M| } 1674| 2.68M| } 1675| 3.08M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 14.0M|{ 1839| 14.0M| assert(node); ------------------ | Branch (1839:5): [True: 14.0M, False: 0] ------------------ 1840| 14.0M| auto relaxed = node->relaxed(); 1841| 14.0M| if (relaxed) { ------------------ | Branch (1841:9): [True: 13.4M, False: 578k] ------------------ 1842| 13.4M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 13.4M, False: 0] ------------------ 1843| 13.4M| return make_relaxed_pos(node, shift, relaxed) 1844| 13.4M| .visit(v, std::forward(args)...); 1845| 13.4M| } else { 1846| 578k| return make_regular_sub_pos(node, shift, size) 1847| 578k| .visit(v, std::forward(args)...); 1848| 578k| } 1849| 14.0M|} _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.20k| { 754| 5.20k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 5.20k| } _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.20k| { 145| 5.20k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.20k| } _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.20k| { 1775| 5.20k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 5.20k, False: 0] ------------------ 1776| 5.20k| auto child = node_->inner()[0]; 1777| 5.20k| auto child_size = relaxed_->d.sizes[0]; 1778| 5.20k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 5.20k| } _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.37k| { 1037| 2.37k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.37k| } _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| 526k|{ 1839| 526k| assert(node); ------------------ | Branch (1839:5): [True: 526k, False: 0] ------------------ 1840| 526k| auto relaxed = node->relaxed(); 1841| 526k| if (relaxed) { ------------------ | Branch (1841:9): [True: 512k, False: 14.1k] ------------------ 1842| 512k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 512k, False: 0] ------------------ 1843| 512k| return make_relaxed_pos(node, shift, relaxed) 1844| 512k| .visit(v, std::forward(args)...); 1845| 512k| } else { 1846| 14.1k| return make_regular_sub_pos(node, shift, size) 1847| 14.1k| .visit(v, std::forward(args)...); 1848| 14.1k| } 1849| 526k|} _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| 512k| { 1814| 512k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 512k| } _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| 512k|{ 1839| 512k| assert(node); ------------------ | Branch (1839:5): [True: 512k, False: 0] ------------------ 1840| 512k| auto relaxed = node->relaxed(); 1841| 512k| if (relaxed) { ------------------ | Branch (1841:9): [True: 488k, False: 23.4k] ------------------ 1842| 488k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 488k, False: 0] ------------------ 1843| 488k| return make_relaxed_pos(node, shift, relaxed) 1844| 488k| .visit(v, std::forward(args)...); 1845| 488k| } else { 1846| 23.4k| return make_regular_sub_pos(node, shift, size) 1847| 23.4k| .visit(v, std::forward(args)...); 1848| 23.4k| } 1849| 512k|} _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| 488k| { 1814| 488k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 488k| } _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.25M| { 1751| 2.25M| auto offset = relaxed_->d.count - 1; 1752| 2.25M| auto child = node_->inner()[offset]; 1753| 2.25M| auto child_size = size(offset); 1754| 2.25M| auto is_leaf = shift_ == BL; 1755| 2.25M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 2.25M] ------------------ 1756| 2.25M| : visit_maybe_relaxed_sub( 1757| 2.25M| child, shift_ - B, child_size, v, args...); 1758| 2.25M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 2.25M|{ 1839| 2.25M| assert(node); ------------------ | Branch (1839:5): [True: 2.25M, False: 0] ------------------ 1840| 2.25M| auto relaxed = node->relaxed(); 1841| 2.25M| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.25M, False: 2.35k] ------------------ 1842| 2.25M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.25M, False: 0] ------------------ 1843| 2.25M| return make_relaxed_pos(node, shift, relaxed) 1844| 2.25M| .visit(v, std::forward(args)...); 1845| 2.25M| } else { 1846| 2.35k| return make_regular_sub_pos(node, shift, size) 1847| 2.35k| .visit(v, std::forward(args)...); 1848| 2.35k| } 1849| 2.25M|} _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.25M| { 1814| 2.25M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.25M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 1036| 5.95k| { 1037| 5.95k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.95k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 958| 3.60k| { 959| 3.60k| auto offset = count() - 1; 960| 3.60k| auto child = node_->inner()[offset]; 961| 3.60k| auto is_leaf = shift_ == BL; 962| 3.60k| auto lsize = size_ - (size_t{offset} << shift_); 963| 3.60k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 3.60k] ------------------ 964| 3.60k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 3.60k| .visit(v, args...); 966| 3.60k| } _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| 880k| { 914| 880k| each_left(v, count() - 1, args...); 915| 880k| } _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| 880k| { 874| 880k| return each_left_regular(*this, v, last, args...); 875| 880k| } _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| 880k|{ 576| 880k| constexpr auto B = bits; 577| 880k| constexpr auto BL = bits_leaf; 578| 880k| assert(last < p.count()); ------------------ | Branch (578:5): [True: 880k, False: 0] ------------------ 579| 880k| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 414k, False: 465k] ------------------ 580| 414k| auto n = p.node()->inner(); 581| 414k| auto e = n + last; 582| 1.12M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 714k, False: 414k] ------------------ 583| 714k| IMMER_PREFETCH(n + 1); 584| 714k| make_full_leaf_pos(*n).visit(v, args...); 585| 714k| } 586| 465k| } else { 587| 465k| auto n = p.node()->inner(); 588| 465k| auto e = n + last; 589| 465k| auto ss = p.shift() - B; 590| 887k| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 421k, False: 465k] ------------------ 591| 421k| make_full_pos(*n, ss).visit(v, args...); 592| 465k| } 593| 880k|} _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| 880k| { 914| 880k| each_left(v, count() - 1, args...); 915| 880k| } _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| 880k| { 874| 880k| return each_left_regular(*this, v, last, args...); 875| 880k| } _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| 880k|{ 576| 880k| constexpr auto B = bits; 577| 880k| constexpr auto BL = bits_leaf; 578| 880k| assert(last < p.count()); ------------------ | Branch (578:5): [True: 880k, False: 0] ------------------ 579| 880k| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 414k, False: 465k] ------------------ 580| 414k| auto n = p.node()->inner(); 581| 414k| auto e = n + last; 582| 1.12M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 714k, False: 414k] ------------------ 583| 714k| IMMER_PREFETCH(n + 1); 584| 714k| make_full_leaf_pos(*n).visit(v, args...); 585| 714k| } 586| 465k| } else { 587| 465k| auto n = p.node()->inner(); 588| 465k| auto e = n + last; 589| 465k| auto ss = p.shift() - B; 590| 887k| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 421k, False: 465k] ------------------ 591| 421k| make_full_pos(*n, ss).visit(v, args...); 592| 465k| } 593| 880k|} _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| 749k| { 1763| 749k| auto child = node_->inner()[0]; 1764| 749k| auto child_size = relaxed_->d.sizes[0]; 1765| 749k| auto is_leaf = shift_ == BL; 1766| 749k| assert(child_size); ------------------ | Branch (1766:9): [True: 749k, False: 0] ------------------ 1767| 749k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 749k] ------------------ 1768| 749k| : visit_maybe_relaxed_sub( 1769| 749k| child, shift_ - B, child_size, v, args...); 1770| 749k| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 106| 526k| 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| 749k|{ 1839| 749k| assert(node); ------------------ | Branch (1839:5): [True: 749k, False: 0] ------------------ 1840| 749k| auto relaxed = node->relaxed(); 1841| 749k| if (relaxed) { ------------------ | Branch (1841:9): [True: 648k, False: 100k] ------------------ 1842| 648k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 648k, False: 0] ------------------ 1843| 648k| return make_relaxed_pos(node, shift, relaxed) 1844| 648k| .visit(v, std::forward(args)...); 1845| 648k| } else { 1846| 100k| return make_regular_sub_pos(node, shift, size) 1847| 100k| .visit(v, std::forward(args)...); 1848| 100k| } 1849| 749k|} _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| 648k| { 1814| 648k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 648k| } _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| 100k| { 1037| 100k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 100k| } _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| 742| { 959| 742| auto offset = count() - 1; 960| 742| auto child = node_->inner()[offset]; 961| 742| auto is_leaf = shift_ == BL; 962| 742| auto lsize = size_ - (size_t{offset} << shift_); 963| 742| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 742] ------------------ 964| 742| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 742| .visit(v, args...); 966| 742| } _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.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_policyELb0ELb1EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 970| 61.9k| { 971| 61.9k| auto is_leaf = shift_ == BL; 972| 61.9k| auto child = node_->inner()[0]; 973| 61.9k| auto is_full = size_ >= (size_t{1} << shift_); 974| 61.9k| return is_full ------------------ | Branch (974:16): [True: 61.9k, False: 0] ------------------ 975| 61.9k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 61.9k] ------------------ 976| 61.9k| ? make_full_leaf_pos(child).visit(v, args...) 977| 61.9k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 61.9k| : (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| 61.9k| } _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| 121k| { 1406| 121k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 121k| } _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| 59.9k| { 1362| 59.9k| auto is_leaf = shift_ == BL; 1363| 59.9k| auto child = node_->inner()[0]; 1364| 59.9k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 59.9k] ------------------ 1365| 59.9k| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 59.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_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 958| 121k| { 959| 121k| auto offset = count() - 1; 960| 121k| auto child = node_->inner()[offset]; 961| 121k| auto is_leaf = shift_ == BL; 962| 121k| auto lsize = size_ - (size_t{offset} << shift_); 963| 121k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 63.3k, False: 58.3k] ------------------ 964| 121k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 58.3k| .visit(v, args...); 966| 121k| } _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| 66.2k| { 145| 66.2k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 66.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| 66.2k| { 1371| 66.2k| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 66.2k, False: 0] ------------------ 1372| 66.2k| auto child = node_->inner()[0]; 1373| 66.2k| return make_full_leaf_pos(child).visit(v, args...); 1374| 66.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| 136k| { 208| 136k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 136k| } _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| 59.6k| { 1037| 59.6k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 59.6k| } _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| 108k| { 959| 108k| auto offset = count() - 1; 960| 108k| auto child = node_->inner()[offset]; 961| 108k| auto is_leaf = shift_ == BL; 962| 108k| auto lsize = size_ - (size_t{offset} << shift_); 963| 108k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 59.3k, False: 49.0k] ------------------ 964| 108k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 49.0k| .visit(v, args...); 966| 108k| } _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| 70.1k| { 145| 70.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 70.1k| } _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| 70.1k| { 987| 70.1k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 70.1k, False: 0] ------------------ 988| 70.1k| auto child = node_->inner()[0]; 989| 70.1k| auto is_full = size_ >= branches; 990| 70.1k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 70.1k, False: 0] ------------------ 991| 70.1k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 70.1k| } _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| 389k| { 145| 389k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 389k| } _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| 61.3k| { 1037| 61.3k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 61.3k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 958| 646k| { 959| 646k| auto offset = count() - 1; 960| 646k| auto child = node_->inner()[offset]; 961| 646k| auto is_leaf = shift_ == BL; 962| 646k| auto lsize = size_ - (size_t{offset} << shift_); 963| 646k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 292k, False: 353k] ------------------ 964| 646k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 353k| .visit(v, args...); 966| 646k| } _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| 389k| { 145| 389k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 389k| } _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| 389k| { 1775| 389k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 389k, False: 0] ------------------ 1776| 389k| auto child = node_->inner()[0]; 1777| 389k| auto child_size = relaxed_->d.sizes[0]; 1778| 389k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 389k| } _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| 738k| { 1037| 738k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 738k| } _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.70M| { 1618| 4.70M| each_left(v, relaxed_->d.count - 1, args...); 1619| 4.70M| } _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.70M| { 1624| 4.70M| auto p = node_->inner(); 1625| 4.70M| auto s = size_t{}; 1626| 4.70M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 111k, False: 4.59M] ------------------ 1627| 327k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 216k, False: 111k] ------------------ 1628| 216k| IMMER_PREFETCH(p + i + 1); 1629| 216k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 216k| .visit(v, args...); 1631| 216k| s = relaxed_->d.sizes[i]; 1632| 216k| assert(s); ------------------ | Branch (1632:17): [True: 216k, False: 0] ------------------ 1633| 216k| } 1634| 4.59M| } else { 1635| 4.59M| auto ss = shift_ - B; 1636| 11.6M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 7.09M, False: 4.59M] ------------------ 1637| 7.09M| visit_maybe_relaxed_sub( 1638| 7.09M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 7.09M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 7.09M, False: 0] ------------------ 1641| 7.09M| } 1642| 4.59M| } 1643| 4.70M| } _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.70M| { 1618| 4.70M| each_left(v, relaxed_->d.count - 1, args...); 1619| 4.70M| } _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.70M| { 1624| 4.70M| auto p = node_->inner(); 1625| 4.70M| auto s = size_t{}; 1626| 4.70M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 111k, False: 4.59M] ------------------ 1627| 327k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 216k, False: 111k] ------------------ 1628| 216k| IMMER_PREFETCH(p + i + 1); 1629| 216k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 216k| .visit(v, args...); 1631| 216k| s = relaxed_->d.sizes[i]; 1632| 216k| assert(s); ------------------ | Branch (1632:17): [True: 216k, False: 0] ------------------ 1633| 216k| } 1634| 4.59M| } else { 1635| 4.59M| auto ss = shift_ - B; 1636| 11.6M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 7.09M, False: 4.59M] ------------------ 1637| 7.09M| visit_maybe_relaxed_sub( 1638| 7.09M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 7.09M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 7.09M, False: 0] ------------------ 1641| 7.09M| } 1642| 4.59M| } 1643| 4.70M| } _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.92M| { 1763| 1.92M| auto child = node_->inner()[0]; 1764| 1.92M| auto child_size = relaxed_->d.sizes[0]; 1765| 1.92M| auto is_leaf = shift_ == BL; 1766| 1.92M| assert(child_size); ------------------ | Branch (1766:9): [True: 1.92M, False: 0] ------------------ 1767| 1.92M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 1.92M] ------------------ 1768| 1.92M| : visit_maybe_relaxed_sub( 1769| 1.92M| child, shift_ - B, child_size, v, args...); 1770| 1.92M| } _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.92M|{ 1839| 1.92M| assert(node); ------------------ | Branch (1839:5): [True: 1.92M, False: 0] ------------------ 1840| 1.92M| auto relaxed = node->relaxed(); 1841| 1.92M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.91M, False: 4.38k] ------------------ 1842| 1.91M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.91M, False: 0] ------------------ 1843| 1.91M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.91M| .visit(v, std::forward(args)...); 1845| 1.91M| } else { 1846| 4.38k| return make_regular_sub_pos(node, shift, size) 1847| 4.38k| .visit(v, std::forward(args)...); 1848| 4.38k| } 1849| 1.92M|} _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.91M| { 1814| 1.91M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.91M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 4.38k| { 1037| 4.38k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.38k| } _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| 116k| { 1751| 116k| auto offset = relaxed_->d.count - 1; 1752| 116k| auto child = node_->inner()[offset]; 1753| 116k| auto child_size = size(offset); 1754| 116k| auto is_leaf = shift_ == BL; 1755| 116k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 116k] ------------------ 1756| 116k| : visit_maybe_relaxed_sub( 1757| 116k| child, shift_ - B, child_size, v, args...); 1758| 116k| } _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| 116k|{ 1839| 116k| assert(node); ------------------ | Branch (1839:5): [True: 116k, False: 0] ------------------ 1840| 116k| auto relaxed = node->relaxed(); 1841| 116k| if (relaxed) { ------------------ | Branch (1841:9): [True: 116k, False: 379] ------------------ 1842| 116k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 116k, False: 0] ------------------ 1843| 116k| return make_relaxed_pos(node, shift, relaxed) 1844| 116k| .visit(v, std::forward(args)...); 1845| 116k| } else { 1846| 379| return make_regular_sub_pos(node, shift, size) 1847| 379| .visit(v, std::forward(args)...); 1848| 379| } 1849| 116k|} _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| 116k| { 1814| 116k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 116k| } _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| 4.25k| { 971| 4.25k| auto is_leaf = shift_ == BL; 972| 4.25k| auto child = node_->inner()[0]; 973| 4.25k| auto is_full = size_ >= (size_t{1} << shift_); 974| 4.25k| return is_full ------------------ | Branch (974:16): [True: 4.25k, False: 0] ------------------ 975| 4.25k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 4.25k] ------------------ 976| 4.25k| ? make_full_leaf_pos(child).visit(v, args...) 977| 4.25k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 4.25k| : (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| 4.25k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1405| 6.74k| { 1406| 6.74k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 6.74k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1361| 2.49k| { 1362| 2.49k| auto is_leaf = shift_ == BL; 1363| 2.49k| auto child = node_->inner()[0]; 1364| 2.49k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 2.49k] ------------------ 1365| 2.49k| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 2.49k| } _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| 6.48k| { 1751| 6.48k| auto offset = relaxed_->d.count - 1; 1752| 6.48k| auto child = node_->inner()[offset]; 1753| 6.48k| auto child_size = size(offset); 1754| 6.48k| auto is_leaf = shift_ == BL; 1755| 6.48k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 2.93k, False: 3.55k] ------------------ 1756| 6.48k| : visit_maybe_relaxed_sub( 1757| 3.55k| child, shift_ - B, child_size, v, args...); 1758| 6.48k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 3.55k|{ 1839| 3.55k| assert(node); ------------------ | Branch (1839:5): [True: 3.55k, False: 0] ------------------ 1840| 3.55k| auto relaxed = node->relaxed(); 1841| 3.55k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.22k, False: 1.32k] ------------------ 1842| 2.22k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.22k, False: 0] ------------------ 1843| 2.22k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.22k| .visit(v, std::forward(args)...); 1845| 2.22k| } else { 1846| 1.32k| return make_regular_sub_pos(node, shift, size) 1847| 1.32k| .visit(v, std::forward(args)...); 1848| 1.32k| } 1849| 3.55k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 1813| 2.22k| { 1814| 2.22k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.22k| } _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| 26.7k| { 1751| 26.7k| auto offset = relaxed_->d.count - 1; 1752| 26.7k| auto child = node_->inner()[offset]; 1753| 26.7k| auto child_size = size(offset); 1754| 26.7k| auto is_leaf = shift_ == BL; 1755| 26.7k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 10.8k, False: 15.9k] ------------------ 1756| 26.7k| : visit_maybe_relaxed_sub( 1757| 15.9k| child, shift_ - B, child_size, v, args...); 1758| 26.7k| } _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| 15.9k|{ 1839| 15.9k| assert(node); ------------------ | Branch (1839:5): [True: 15.9k, False: 0] ------------------ 1840| 15.9k| auto relaxed = node->relaxed(); 1841| 15.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.54k, False: 12.3k] ------------------ 1842| 3.54k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.54k, False: 0] ------------------ 1843| 3.54k| return make_relaxed_pos(node, shift, relaxed) 1844| 3.54k| .visit(v, std::forward(args)...); 1845| 12.3k| } else { 1846| 12.3k| return make_regular_sub_pos(node, shift, size) 1847| 12.3k| .visit(v, std::forward(args)...); 1848| 12.3k| } 1849| 15.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1813| 3.54k| { 1814| 3.54k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.54k| } _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.30M| { 1751| 2.30M| auto offset = relaxed_->d.count - 1; 1752| 2.30M| auto child = node_->inner()[offset]; 1753| 2.30M| auto child_size = size(offset); 1754| 2.30M| auto is_leaf = shift_ == BL; 1755| 2.30M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 97.5k, False: 2.20M] ------------------ 1756| 2.30M| : visit_maybe_relaxed_sub( 1757| 2.20M| child, shift_ - B, child_size, v, args...); 1758| 2.30M| } _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.20M|{ 1839| 2.20M| assert(node); ------------------ | Branch (1839:5): [True: 2.20M, False: 0] ------------------ 1840| 2.20M| auto relaxed = node->relaxed(); 1841| 2.20M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.82M, False: 384k] ------------------ 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| 384k| return make_regular_sub_pos(node, shift, size) 1847| 384k| .visit(v, std::forward(args)...); 1848| 384k| } 1849| 2.20M|} _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.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_26concat_trees_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 23.4k| { 1037| 23.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 23.4k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_25concat_trees_left_visitorISC_EEJNS1_8leaf_posISC_EERPSC_RjRmEEEDcT_DpOT0_: 1036| 14.1k| { 1037| 14.1k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 14.1k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_26concat_trees_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 14.1k|{ 1839| 14.1k| assert(node); ------------------ | Branch (1839:5): [True: 14.1k, False: 0] ------------------ 1840| 14.1k| auto relaxed = node->relaxed(); 1841| 14.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 6.26k, False: 7.90k] ------------------ 1842| 6.26k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 6.26k, False: 0] ------------------ 1843| 6.26k| return make_relaxed_pos(node, shift, relaxed) 1844| 6.26k| .visit(v, std::forward(args)...); 1845| 7.90k| } else { 1846| 7.90k| return make_regular_sub_pos(node, shift, size) 1847| 7.90k| .visit(v, std::forward(args)...); 1848| 7.90k| } 1849| 14.1k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1813| 6.26k| { 1814| 6.26k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 6.26k| } _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.90k| { 1037| 7.90k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 7.90k| } _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| 48.5k| { 1814| 48.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 48.5k| } _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| 43.5k| { 1738| 43.5k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 43.5k, False: 0] ------------------ 1739| 43.5k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 43.5k, False: 0] ------------------ 1740| 43.5k| auto child = node_->inner()[offset_hint]; 1741| 43.5k| auto is_leaf = shift_ == BL; 1742| 43.5k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 43.5k] ------------------ 1743| 43.5k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 43.5k| : visit_maybe_relaxed_sub( 1745| 43.5k| child, shift_ - B, child_size_hint, v, args...); 1746| 43.5k| } _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| 43.5k|{ 1839| 43.5k| assert(node); ------------------ | Branch (1839:5): [True: 43.5k, False: 0] ------------------ 1840| 43.5k| auto relaxed = node->relaxed(); 1841| 43.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 9.11k, False: 34.4k] ------------------ 1842| 9.11k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 9.11k, False: 0] ------------------ 1843| 9.11k| return make_relaxed_pos(node, shift, relaxed) 1844| 9.11k| .visit(v, std::forward(args)...); 1845| 34.4k| } else { 1846| 34.4k| return make_regular_sub_pos(node, shift, size) 1847| 34.4k| .visit(v, std::forward(args)...); 1848| 34.4k| } 1849| 43.5k|} _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| 34.4k| { 1037| 34.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 34.4k| } _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| 185k| { 953| 185k| return last_oh_regular(*this, v, offset_hint, args...); 954| 185k| } _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| 185k|{ 678| 185k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 185k, False: 0] ------------------ 679| 185k| constexpr auto B = bits; 680| 185k| constexpr auto BL = bits_leaf; 681| 185k| auto child = p.node()->inner()[offset_hint]; 682| 185k| auto is_leaf = p.shift() == BL; 683| 185k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 185k] ------------------ 684| 185k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 185k| .visit(v, args...); 686| 185k|} _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| 857k| { 337| 857k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 857k| } _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| 672k| { 331| 672k| return last_oh_regular(*this, v, offset_hint, args...); 332| 672k| } _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| 672k|{ 678| 672k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 672k, False: 0] ------------------ 679| 672k| constexpr auto B = bits; 680| 672k| constexpr auto BL = bits_leaf; 681| 672k| auto child = p.node()->inner()[offset_hint]; 682| 672k| auto is_leaf = p.shift() == BL; 683| 672k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 672k] ------------------ 684| 672k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 672k| .visit(v, args...); 686| 672k|} _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.40k| { 331| 1.40k| return last_oh_regular(*this, v, offset_hint, args...); 332| 1.40k| } _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.40k|{ 678| 1.40k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.40k, False: 0] ------------------ 679| 1.40k| constexpr auto B = bits; 680| 1.40k| constexpr auto BL = bits_leaf; 681| 1.40k| auto child = p.node()->inner()[offset_hint]; 682| 1.40k| auto is_leaf = p.shift() == BL; 683| 1.40k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.40k] ------------------ 684| 1.40k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.40k| .visit(v, args...); 686| 1.40k|} _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| 2.65k| { 337| 2.65k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.65k| } _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.24k| { 953| 1.24k| return last_oh_regular(*this, v, offset_hint, args...); 954| 1.24k| } _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.24k|{ 678| 1.24k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.24k, False: 0] ------------------ 679| 1.24k| constexpr auto B = bits; 680| 1.24k| constexpr auto BL = bits_leaf; 681| 1.24k| auto child = p.node()->inner()[offset_hint]; 682| 1.24k| auto is_leaf = p.shift() == BL; 683| 1.24k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.24k] ------------------ 684| 1.24k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.24k| .visit(v, args...); 686| 1.24k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11last_oh_cshINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_jmDpOT0_: 1737| 7.64k| { 1738| 7.64k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 7.64k, False: 0] ------------------ 1739| 7.64k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 7.64k, False: 0] ------------------ 1740| 7.64k| auto child = node_->inner()[offset_hint]; 1741| 7.64k| auto is_leaf = shift_ == BL; 1742| 7.64k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 7.64k] ------------------ 1743| 7.64k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 7.64k| : visit_maybe_relaxed_sub( 1745| 7.64k| child, shift_ - B, child_size_hint, v, args...); 1746| 7.64k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcPT_jmT0_DpOT1_: 1838| 7.64k|{ 1839| 7.64k| assert(node); ------------------ | Branch (1839:5): [True: 7.64k, False: 0] ------------------ 1840| 7.64k| auto relaxed = node->relaxed(); 1841| 7.64k| if (relaxed) { ------------------ | Branch (1841:9): [True: 6.61k, False: 1.03k] ------------------ 1842| 6.61k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 6.61k, False: 0] ------------------ 1843| 6.61k| return make_relaxed_pos(node, shift, relaxed) 1844| 6.61k| .visit(v, std::forward(args)...); 1845| 6.61k| } else { 1846| 1.03k| return make_regular_sub_pos(node, shift, size) 1847| 1.03k| .visit(v, std::forward(args)...); 1848| 1.03k| } 1849| 7.64k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_: 1813| 6.61k| { 1814| 6.61k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 6.61k| } _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.03k| { 1037| 1.03k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.03k| } _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| 157k| { 1037| 157k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 157k| } _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.6k|{ 1839| 22.6k| assert(node); ------------------ | Branch (1839:5): [True: 22.6k, False: 0] ------------------ 1840| 22.6k| auto relaxed = node->relaxed(); 1841| 22.6k| if (relaxed) { ------------------ | Branch (1841:9): [True: 18.0k, False: 4.65k] ------------------ 1842| 18.0k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 18.0k, False: 0] ------------------ 1843| 18.0k| return make_relaxed_pos(node, shift, relaxed) 1844| 18.0k| .visit(v, std::forward(args)...); 1845| 18.0k| } else { 1846| 4.65k| return make_regular_sub_pos(node, shift, size) 1847| 4.65k| .visit(v, std::forward(args)...); 1848| 4.65k| } 1849| 22.6k|} _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| 18.0k| { 1814| 18.0k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 18.0k| } _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| 70.2k| { 1687| 70.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 70.2k, False: 0] ------------------ 1688| 70.2k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 15.4k, False: 54.7k] ------------------ 1689| 70.2k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 70.2k| } _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| 70.2k| { 1699| 70.2k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 70.2k| } _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| 70.2k| { 1718| 70.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 70.2k, False: 0] ------------------ 1719| 70.2k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 15.4k, False: 54.7k] | Branch (1719:9): [True: 70.2k, False: 0] ------------------ 1720| 70.2k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 70.2k| auto child = node_->inner()[offset_hint]; 1722| 70.2k| auto is_leaf = shift_ == BL; 1723| 70.2k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 70.2k| auto next_idx = idx - left_size_hint; 1725| 70.2k| return is_leaf ------------------ | Branch (1725:16): [True: 13.5k, False: 56.6k] ------------------ 1726| 70.2k| ? make_leaf_sub_pos(child, next_size) 1727| 13.5k| .visit(v, next_idx, args...) 1728| 70.2k| : visit_maybe_relaxed_sub( 1729| 56.6k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 70.2k| } _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| 13.5k| { 145| 13.5k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 13.5k| } _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| 56.6k|{ 1839| 56.6k| assert(node); ------------------ | Branch (1839:5): [True: 56.6k, False: 0] ------------------ 1840| 56.6k| auto relaxed = node->relaxed(); 1841| 56.6k| if (relaxed) { ------------------ | Branch (1841:9): [True: 52.2k, False: 4.47k] ------------------ 1842| 52.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 52.2k, False: 0] ------------------ 1843| 52.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 52.2k| .visit(v, std::forward(args)...); 1845| 52.2k| } else { 1846| 4.47k| return make_regular_sub_pos(node, shift, size) 1847| 4.47k| .visit(v, std::forward(args)...); 1848| 4.47k| } 1849| 56.6k|} _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| 52.2k| { 1814| 52.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 52.2k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1036| 4.47k| { 1037| 4.47k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.47k| } _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| 9.13k| { 939| 9.13k| return towards_oh_ch_regular( 940| 9.13k| *this, v, idx, offset_hint, count(), args...); 941| 9.13k| } _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| 9.13k|{ 633| 9.13k| constexpr auto B = bits; 634| 9.13k| constexpr auto BL = bits_leaf; 635| 9.13k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 9.13k, False: 0] ------------------ 636| 9.13k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 9.13k, False: 0] ------------------ 637| 9.13k| auto is_leaf = p.shift() == BL; 638| 9.13k| auto child = p.node()->inner()[offset_hint]; 639| 9.13k| auto is_full = offset_hint + 1 != count_hint; 640| 9.13k| return is_full ------------------ | Branch (640:12): [True: 7.07k, False: 2.05k] ------------------ 641| 9.13k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 2.20k, False: 4.87k] ------------------ 642| 7.07k| : make_full_pos(child, p.shift() - B) 643| 4.87k| .visit(v, idx, args...)) 644| 9.13k| : (is_leaf ------------------ | Branch (644:19): [True: 712, False: 1.34k] ------------------ 645| 2.05k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.05k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.34k| .visit(v, idx, args...)); 648| 9.13k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 207| 7.86k| { 208| 7.86k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 7.86k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1405| 6.11k| { 1406| 6.11k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 6.11k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 1329| 6.11k| { 1330| 6.11k| return towards_oh(v, idx, offset_hint, args...); 1331| 6.11k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_mjDpOT0_: 1336| 6.11k| { 1337| 6.11k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 6.11k, False: 0] ------------------ 1338| 6.11k| auto is_leaf = shift_ == BL; 1339| 6.11k| auto child = node_->inner()[offset_hint]; 1340| 6.11k| return is_leaf ------------------ | Branch (1340:16): [True: 5.14k, False: 974] ------------------ 1341| 6.11k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 6.11k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 6.11k| } _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.27k| { 113| 1.27k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.27k| } _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.01k| { 337| 2.01k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.01k| } _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.01k| { 317| 2.01k| return towards_oh_ch_regular( 318| 2.01k| *this, v, idx, offset_hint, count(), args...); 319| 2.01k| } _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.01k|{ 633| 2.01k| constexpr auto B = bits; 634| 2.01k| constexpr auto BL = bits_leaf; 635| 2.01k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.01k, False: 0] ------------------ 636| 2.01k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.01k, False: 0] ------------------ 637| 2.01k| auto is_leaf = p.shift() == BL; 638| 2.01k| auto child = p.node()->inner()[offset_hint]; 639| 2.01k| auto is_full = offset_hint + 1 != count_hint; 640| 2.01k| return is_full ------------------ | Branch (640:12): [True: 785, False: 1.22k] ------------------ 641| 2.01k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 515, False: 270] ------------------ 642| 785| : make_full_pos(child, p.shift() - B) 643| 270| .visit(v, idx, args...)) 644| 2.01k| : (is_leaf ------------------ | Branch (644:19): [True: 559, False: 669] ------------------ 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| 669| .visit(v, idx, args...)); 648| 2.01k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_DpOT0_: 1036| 4.65k| { 1037| 4.65k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.65k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 67.4k|{ 1839| 67.4k| assert(node); ------------------ | Branch (1839:5): [True: 67.4k, False: 0] ------------------ 1840| 67.4k| auto relaxed = node->relaxed(); 1841| 67.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 55.3k, False: 12.0k] ------------------ 1842| 55.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 55.3k, False: 0] ------------------ 1843| 55.3k| return make_relaxed_pos(node, shift, relaxed) 1844| 55.3k| .visit(v, std::forward(args)...); 1845| 55.3k| } else { 1846| 12.0k| return make_regular_sub_pos(node, shift, size) 1847| 12.0k| .visit(v, std::forward(args)...); 1848| 12.0k| } 1849| 67.4k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 55.3k| { 1814| 55.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 55.3k| } _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| 31.8k| { 1687| 31.8k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 31.8k, False: 0] ------------------ 1688| 31.8k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 31.8k] ------------------ 1689| 31.8k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 31.8k| } _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| 31.8k| { 1699| 31.8k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 31.8k| } _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| 31.8k| { 1718| 31.8k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 31.8k, False: 0] ------------------ 1719| 31.8k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 31.8k] | Branch (1719:9): [True: 31.8k, False: 0] ------------------ 1720| 31.8k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 31.8k| auto child = node_->inner()[offset_hint]; 1722| 31.8k| auto is_leaf = shift_ == BL; 1723| 31.8k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 31.8k| auto next_idx = idx - left_size_hint; 1725| 31.8k| return is_leaf ------------------ | Branch (1725:16): [True: 1.17k, False: 30.7k] ------------------ 1726| 31.8k| ? make_leaf_sub_pos(child, next_size) 1727| 1.17k| .visit(v, next_idx, args...) 1728| 31.8k| : visit_maybe_relaxed_sub( 1729| 30.7k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 31.8k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 1.17k| { 145| 1.17k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.17k| } _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| 24.7k| { 1687| 24.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 24.7k, False: 0] ------------------ 1688| 24.7k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 24.7k] ------------------ 1689| 24.7k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 24.7k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 24.7k| { 1699| 24.7k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 24.7k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 24.7k| { 1718| 24.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 24.7k, False: 0] ------------------ 1719| 24.7k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 24.7k] | Branch (1719:9): [True: 24.7k, False: 0] ------------------ 1720| 24.7k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 24.7k| auto child = node_->inner()[offset_hint]; 1722| 24.7k| auto is_leaf = shift_ == BL; 1723| 24.7k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 24.7k| auto next_idx = idx - left_size_hint; 1725| 24.7k| return is_leaf ------------------ | Branch (1725:16): [True: 530, False: 24.2k] ------------------ 1726| 24.7k| ? make_leaf_sub_pos(child, next_size) 1727| 530| .visit(v, next_idx, args...) 1728| 24.7k| : visit_maybe_relaxed_sub( 1729| 24.2k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 24.7k| } _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| 530| { 145| 530| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 530| } _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| 24.2k|{ 1839| 24.2k| assert(node); ------------------ | Branch (1839:5): [True: 24.2k, False: 0] ------------------ 1840| 24.2k| auto relaxed = node->relaxed(); 1841| 24.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 22.8k, False: 1.35k] ------------------ 1842| 22.8k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 22.8k, False: 0] ------------------ 1843| 22.8k| return make_relaxed_pos(node, shift, relaxed) 1844| 22.8k| .visit(v, std::forward(args)...); 1845| 22.8k| } else { 1846| 1.35k| return make_regular_sub_pos(node, shift, size) 1847| 1.35k| .visit(v, std::forward(args)...); 1848| 1.35k| } 1849| 24.2k|} _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| 22.8k| { 1814| 22.8k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 22.8k| } _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.35k| { 1037| 1.35k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.35k| } _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.35k| { 928| 2.35k| return towards_oh_ch_regular( 929| 2.35k| *this, v, idx, offset_hint, count(), args...); 930| 2.35k| } _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.35k|{ 633| 2.35k| constexpr auto B = bits; 634| 2.35k| constexpr auto BL = bits_leaf; 635| 2.35k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.35k, False: 0] ------------------ 636| 2.35k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.35k, False: 0] ------------------ 637| 2.35k| auto is_leaf = p.shift() == BL; 638| 2.35k| auto child = p.node()->inner()[offset_hint]; 639| 2.35k| auto is_full = offset_hint + 1 != count_hint; 640| 2.35k| return is_full ------------------ | Branch (640:12): [True: 1.96k, False: 398] ------------------ 641| 2.35k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 702, False: 1.25k] ------------------ 642| 1.96k| : make_full_pos(child, p.shift() - B) 643| 1.25k| .visit(v, idx, args...)) 644| 2.35k| : (is_leaf ------------------ | Branch (644:19): [True: 398, False: 0] ------------------ 645| 398| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 398| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 2.35k|} _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.45k| { 208| 1.45k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.45k| } _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.79k| { 1406| 1.79k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.79k| } _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.29k| { 1337| 1.29k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.29k, False: 0] ------------------ 1338| 1.29k| auto is_leaf = shift_ == BL; 1339| 1.29k| auto child = node_->inner()[offset_hint]; 1340| 1.29k| return is_leaf ------------------ | Branch (1340:16): [True: 757, False: 540] ------------------ 1341| 1.29k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.29k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.29k| } _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.90k| { 1337| 2.90k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.90k, False: 0] ------------------ 1338| 2.90k| auto is_leaf = shift_ == BL; 1339| 2.90k| auto child = node_->inner()[offset_hint]; 1340| 2.90k| return is_leaf ------------------ | Branch (1340:16): [True: 1.91k, False: 991] ------------------ 1341| 2.90k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.90k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.90k| } _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.00k| { 208| 5.00k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.00k| } _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.21k| { 1406| 4.21k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 4.21k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1405| 3.63k| { 1406| 3.63k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.63k| } _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.94k| { 1337| 7.94k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 7.94k, False: 0] ------------------ 1338| 7.94k| auto is_leaf = shift_ == BL; 1339| 7.94k| auto child = node_->inner()[offset_hint]; 1340| 7.94k| return is_leaf ------------------ | Branch (1340:16): [True: 6.43k, False: 1.50k] ------------------ 1341| 7.94k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 7.94k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 7.94k| } _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.27k| { 208| 9.27k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 9.27k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 3.17k| { 1406| 3.17k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.17k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1310| 3.94k| { 1311| 3.94k| each_i(v, start, branches, args...); 1312| 3.94k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE6each_iINS1_11dec_visitorEJEEEvT_jjDpOT0_: 1263| 6.21k| { 1264| 6.21k| auto p = node_->inner() + i; 1265| 6.21k| auto e = node_->inner() + n; 1266| 6.21k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 3.71k, False: 2.49k] ------------------ 1267| 11.5k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 7.82k, False: 3.71k] ------------------ 1268| 7.82k| IMMER_PREFETCH(p + 1); 1269| 7.82k| make_full_leaf_pos(*p).visit(v, args...); 1270| 7.82k| } 1271| 3.71k| } else { 1272| 2.49k| auto ss = shift_ - B; 1273| 7.38k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 4.88k, False: 2.49k] ------------------ 1274| 4.88k| make_full_pos(*p, ss).visit(v, args...); 1275| 2.49k| } 1276| 6.21k| } _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| 398| { 113| 398| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 398| } _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.87k| { 306| 5.87k| return towards_oh_ch_regular( 307| 5.87k| *this, v, idx, offset_hint, count(), args...); 308| 5.87k| } _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.87k|{ 633| 5.87k| constexpr auto B = bits; 634| 5.87k| constexpr auto BL = bits_leaf; 635| 5.87k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.87k, False: 0] ------------------ 636| 5.87k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.87k, False: 0] ------------------ 637| 5.87k| auto is_leaf = p.shift() == BL; 638| 5.87k| auto child = p.node()->inner()[offset_hint]; 639| 5.87k| auto is_full = offset_hint + 1 != count_hint; 640| 5.87k| return is_full ------------------ | Branch (640:12): [True: 2.79k, False: 3.08k] ------------------ 641| 5.87k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.72k, False: 1.07k] ------------------ 642| 2.79k| : make_full_pos(child, p.shift() - B) 643| 1.07k| .visit(v, idx, args...)) 644| 5.87k| : (is_leaf ------------------ | Branch (644:19): [True: 1.32k, False: 1.75k] ------------------ 645| 3.08k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.08k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.75k| .visit(v, idx, args...)); 648| 5.87k|} _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.49k| { 113| 2.49k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.49k| } _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.48k| { 337| 6.48k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 6.48k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 336| 4.30k| { 337| 4.30k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.30k| } _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.84k| { 306| 3.84k| return towards_oh_ch_regular( 307| 3.84k| *this, v, idx, offset_hint, count(), args...); 308| 3.84k| } _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.84k|{ 633| 3.84k| constexpr auto B = bits; 634| 3.84k| constexpr auto BL = bits_leaf; 635| 3.84k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.84k, False: 0] ------------------ 636| 3.84k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.84k, False: 0] ------------------ 637| 3.84k| auto is_leaf = p.shift() == BL; 638| 3.84k| auto child = p.node()->inner()[offset_hint]; 639| 3.84k| auto is_full = offset_hint + 1 != count_hint; 640| 3.84k| return is_full ------------------ | Branch (640:12): [True: 1.11k, False: 2.73k] ------------------ 641| 3.84k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 812, False: 303] ------------------ 642| 1.11k| : make_full_pos(child, p.shift() - B) 643| 303| .visit(v, idx, args...)) 644| 3.84k| : (is_leaf ------------------ | Branch (644:19): [True: 1.61k, False: 1.12k] ------------------ 645| 2.73k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.73k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.12k| .visit(v, idx, args...)); 648| 3.84k|} _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.42k| { 113| 2.42k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.42k| } _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.24k| { 337| 3.24k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.24k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 285| 5.87k| { 286| 5.87k| return each_right_regular(*this, v, start, args...); 287| 5.87k| } _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.87k|{ 598| 5.87k| constexpr auto B = bits; 599| 5.87k| constexpr auto BL = bits_leaf; 600| | 601| 5.87k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 3.05k, False: 2.82k] ------------------ 602| 3.05k| auto n = p.node()->inner() + start; 603| 3.05k| auto last = p.count() - 1; 604| 3.05k| auto e = p.node()->inner() + last; 605| 3.05k| if (n <= e) { ------------------ | Branch (605:13): [True: 1.72k, False: 1.32k] ------------------ 606| 2.92k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 1.19k, False: 1.72k] ------------------ 607| 1.19k| IMMER_PREFETCH(n + 1); 608| 1.19k| make_full_leaf_pos(*n).visit(v, args...); 609| 1.19k| } 610| 1.72k| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 1.72k| } 612| 3.05k| } else { 613| 2.82k| auto n = p.node()->inner() + start; 614| 2.82k| auto last = p.count() - 1; 615| 2.82k| auto e = p.node()->inner() + last; 616| 2.82k| auto ss = p.shift() - B; 617| 2.82k| if (n <= e) { ------------------ | Branch (617:13): [True: 1.07k, False: 1.75k] ------------------ 618| 2.00k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 934, False: 1.07k] ------------------ 619| 934| make_full_pos(*n, ss).visit(v, args...); 620| 1.07k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 1.07k| } 622| 2.82k| } 623| 5.87k|} _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| 9.42k| { 928| 9.42k| return towards_oh_ch_regular( 929| 9.42k| *this, v, idx, offset_hint, count(), args...); 930| 9.42k| } _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| 9.42k|{ 633| 9.42k| constexpr auto B = bits; 634| 9.42k| constexpr auto BL = bits_leaf; 635| 9.42k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 9.42k, False: 0] ------------------ 636| 9.42k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 9.42k, False: 0] ------------------ 637| 9.42k| auto is_leaf = p.shift() == BL; 638| 9.42k| auto child = p.node()->inner()[offset_hint]; 639| 9.42k| auto is_full = offset_hint + 1 != count_hint; 640| 9.42k| return is_full ------------------ | Branch (640:12): [True: 3.52k, False: 5.89k] ------------------ 641| 9.42k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.37k, False: 2.15k] ------------------ 642| 3.52k| : make_full_pos(child, p.shift() - B) 643| 2.15k| .visit(v, idx, args...)) 644| 9.42k| : (is_leaf ------------------ | Branch (644:19): [True: 1.16k, False: 4.72k] ------------------ 645| 5.89k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 5.89k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 4.72k| .visit(v, idx, args...)); 648| 9.42k|} _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.32k| { 928| 6.32k| return towards_oh_ch_regular( 929| 6.32k| *this, v, idx, offset_hint, count(), args...); 930| 6.32k| } _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.32k|{ 633| 6.32k| constexpr auto B = bits; 634| 6.32k| constexpr auto BL = bits_leaf; 635| 6.32k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.32k, False: 0] ------------------ 636| 6.32k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.32k, False: 0] ------------------ 637| 6.32k| auto is_leaf = p.shift() == BL; 638| 6.32k| auto child = p.node()->inner()[offset_hint]; 639| 6.32k| auto is_full = offset_hint + 1 != count_hint; 640| 6.32k| return is_full ------------------ | Branch (640:12): [True: 3.39k, False: 2.93k] ------------------ 641| 6.32k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 2.03k, False: 1.36k] ------------------ 642| 3.39k| : make_full_pos(child, p.shift() - B) 643| 1.36k| .visit(v, idx, args...)) 644| 6.32k| : (is_leaf ------------------ | Branch (644:19): [True: 815, False: 2.12k] ------------------ 645| 2.93k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.93k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.12k| .visit(v, idx, args...)); 648| 6.32k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 867| 14.8k| { 868| 14.8k| return each_right_regular(*this, v, start, args...); 869| 14.8k| } _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| 14.8k|{ 598| 14.8k| constexpr auto B = bits; 599| 14.8k| constexpr auto BL = bits_leaf; 600| | 601| 14.8k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 4.37k, False: 10.4k] ------------------ 602| 4.37k| auto n = p.node()->inner() + start; 603| 4.37k| auto last = p.count() - 1; 604| 4.37k| auto e = p.node()->inner() + last; 605| 4.37k| if (n <= e) { ------------------ | Branch (605:13): [True: 2.53k, False: 1.84k] ------------------ 606| 4.17k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 1.64k, False: 2.53k] ------------------ 607| 1.64k| IMMER_PREFETCH(n + 1); 608| 1.64k| make_full_leaf_pos(*n).visit(v, args...); 609| 1.64k| } 610| 2.53k| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 2.53k| } 612| 10.4k| } else { 613| 10.4k| auto n = p.node()->inner() + start; 614| 10.4k| auto last = p.count() - 1; 615| 10.4k| auto e = p.node()->inner() + last; 616| 10.4k| auto ss = p.shift() - B; 617| 10.4k| if (n <= e) { ------------------ | Branch (617:13): [True: 5.72k, False: 4.72k] ------------------ 618| 9.18k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 3.46k, False: 5.72k] ------------------ 619| 3.46k| make_full_pos(*n, ss).visit(v, args...); 620| 5.72k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 5.72k| } 622| 10.4k| } 623| 14.8k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1813| 44.2k| { 1814| 44.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 44.2k| } _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| 22.9k| { 1687| 22.9k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 22.9k, False: 0] ------------------ 1688| 22.9k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 18.2k, False: 4.70k] ------------------ 1689| 22.9k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 22.9k| } _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| 22.9k| { 1699| 22.9k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 22.9k| } _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| 22.9k| { 1718| 22.9k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 22.9k, False: 0] ------------------ 1719| 22.9k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 18.2k, False: 4.70k] | Branch (1719:9): [True: 22.9k, False: 0] ------------------ 1720| 22.9k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 22.9k| auto child = node_->inner()[offset_hint]; 1722| 22.9k| auto is_leaf = shift_ == BL; 1723| 22.9k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 22.9k| auto next_idx = idx - left_size_hint; 1725| 22.9k| return is_leaf ------------------ | Branch (1725:16): [True: 4.64k, False: 18.2k] ------------------ 1726| 22.9k| ? make_leaf_sub_pos(child, next_size) 1727| 4.64k| .visit(v, next_idx, args...) 1728| 22.9k| : visit_maybe_relaxed_sub( 1729| 18.2k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 22.9k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 4.64k| { 145| 4.64k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.64k| } _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| 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: 11.1k, False: 7.11k] ------------------ 1842| 11.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 11.1k, False: 0] ------------------ 1843| 11.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 11.1k| .visit(v, std::forward(args)...); 1845| 11.1k| } else { 1846| 7.11k| return make_regular_sub_pos(node, shift, size) 1847| 7.11k| .visit(v, std::forward(args)...); 1848| 7.11k| } 1849| 18.2k|} _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.1k| { 1814| 11.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 11.1k| } _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.11k| { 1037| 7.11k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 7.11k| } _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.7k| { 1037| 10.7k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 10.7k| } _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| 17.6k| { 1687| 17.6k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 17.6k, False: 0] ------------------ 1688| 17.6k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 11.2k, False: 6.34k] ------------------ 1689| 17.6k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 17.6k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 17.6k| { 1699| 17.6k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 17.6k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 17.6k| { 1718| 17.6k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 17.6k, False: 0] ------------------ 1719| 17.6k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 11.2k, False: 6.34k] | Branch (1719:9): [True: 17.6k, False: 0] ------------------ 1720| 17.6k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 17.6k| auto child = node_->inner()[offset_hint]; 1722| 17.6k| auto is_leaf = shift_ == BL; 1723| 17.6k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 17.6k| auto next_idx = idx - left_size_hint; 1725| 17.6k| return is_leaf ------------------ | Branch (1725:16): [True: 6.84k, False: 10.7k] ------------------ 1726| 17.6k| ? make_leaf_sub_pos(child, next_size) 1727| 6.84k| .visit(v, next_idx, args...) 1728| 17.6k| : visit_maybe_relaxed_sub( 1729| 10.7k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 17.6k| } _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| 6.84k| { 145| 6.84k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 6.84k| } _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.7k|{ 1839| 10.7k| assert(node); ------------------ | Branch (1839:5): [True: 10.7k, False: 0] ------------------ 1840| 10.7k| auto relaxed = node->relaxed(); 1841| 10.7k| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.77k, False: 2.98k] ------------------ 1842| 7.77k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.77k, False: 0] ------------------ 1843| 7.77k| return make_relaxed_pos(node, shift, relaxed) 1844| 7.77k| .visit(v, std::forward(args)...); 1845| 7.77k| } else { 1846| 2.98k| return make_regular_sub_pos(node, shift, size) 1847| 2.98k| .visit(v, std::forward(args)...); 1848| 2.98k| } 1849| 10.7k|} _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.77k| { 1814| 7.77k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.77k| } _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| 2.98k| { 1037| 2.98k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.98k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1653| 54.8k| { 1654| 54.8k| assert(start > 0); ------------------ | Branch (1654:9): [True: 54.8k, False: 0] ------------------ 1655| 54.8k| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 54.8k, False: 0] ------------------ 1656| 54.8k| auto s = relaxed_->d.sizes[start - 1]; 1657| 54.8k| auto p = node_->inner(); 1658| 54.8k| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 5.81k, False: 49.0k] ------------------ 1659| 14.8k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 9.05k, False: 5.81k] ------------------ 1660| 9.05k| IMMER_PREFETCH(p + i + 1); 1661| 9.05k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 9.05k| .visit(v, args...); 1663| 9.05k| s = relaxed_->d.sizes[i]; 1664| 9.05k| assert(s); ------------------ | Branch (1664:17): [True: 9.05k, False: 0] ------------------ 1665| 9.05k| } 1666| 49.0k| } else { 1667| 49.0k| auto ss = shift_ - B; 1668| 150k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 101k, False: 49.0k] ------------------ 1669| 101k| visit_maybe_relaxed_sub( 1670| 101k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 101k| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 101k, False: 0] ------------------ 1673| 101k| } 1674| 49.0k| } 1675| 54.8k| } _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.0k| { 1037| 12.0k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 12.0k| } _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.40k| { 928| 5.40k| return towards_oh_ch_regular( 929| 5.40k| *this, v, idx, offset_hint, count(), args...); 930| 5.40k| } _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.40k|{ 633| 5.40k| constexpr auto B = bits; 634| 5.40k| constexpr auto BL = bits_leaf; 635| 5.40k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.40k, False: 0] ------------------ 636| 5.40k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.40k, False: 0] ------------------ 637| 5.40k| auto is_leaf = p.shift() == BL; 638| 5.40k| auto child = p.node()->inner()[offset_hint]; 639| 5.40k| auto is_full = offset_hint + 1 != count_hint; 640| 5.40k| return is_full ------------------ | Branch (640:12): [True: 4.72k, False: 675] ------------------ 641| 5.40k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.16k, False: 3.56k] ------------------ 642| 4.72k| : make_full_pos(child, p.shift() - B) 643| 3.56k| .visit(v, idx, args...)) 644| 5.40k| : (is_leaf ------------------ | Branch (644:19): [True: 675, False: 0] ------------------ 645| 675| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 675| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 5.40k|} _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.77k| { 208| 1.77k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.77k| } _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.99k| { 1406| 3.99k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.99k| } _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| 1.04k| { 1337| 1.04k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.04k, False: 0] ------------------ 1338| 1.04k| auto is_leaf = shift_ == BL; 1339| 1.04k| auto child = node_->inner()[offset_hint]; 1340| 1.04k| return is_leaf ------------------ | Branch (1340:16): [True: 613, False: 429] ------------------ 1341| 1.04k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.04k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.04k| } _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| 675| { 113| 675| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 675| } _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| 774| { 145| 774| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 774| } _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| 46.2k|{ 1839| 46.2k| assert(node); ------------------ | Branch (1839:5): [True: 46.2k, False: 0] ------------------ 1840| 46.2k| auto relaxed = node->relaxed(); 1841| 46.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 37.5k, False: 8.68k] ------------------ 1842| 37.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 37.5k, False: 0] ------------------ 1843| 37.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 37.5k| .visit(v, std::forward(args)...); 1845| 37.5k| } else { 1846| 8.68k| return make_regular_sub_pos(node, shift, size) 1847| 8.68k| .visit(v, std::forward(args)...); 1848| 8.68k| } 1849| 46.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| 37.5k| { 1814| 37.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 37.5k| } _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.57k| { 1706| 5.57k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 5.57k, False: 0] ------------------ 1707| 5.57k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 4.84k, False: 726] ------------------ 1708| 5.57k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 5.57k| } _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.57k| { 1718| 5.57k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 5.57k, False: 0] ------------------ 1719| 5.57k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 4.84k, False: 726] | Branch (1719:9): [True: 5.57k, False: 0] ------------------ 1720| 5.57k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 5.57k| auto child = node_->inner()[offset_hint]; 1722| 5.57k| auto is_leaf = shift_ == BL; 1723| 5.57k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 5.57k| auto next_idx = idx - left_size_hint; 1725| 5.57k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 5.57k] ------------------ 1726| 5.57k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 5.57k| : visit_maybe_relaxed_sub( 1729| 5.57k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 5.57k| } _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.34k| { 1706| 4.34k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 4.34k, False: 0] ------------------ 1707| 4.34k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 3.69k, False: 655] ------------------ 1708| 4.34k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 4.34k| } _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.34k| { 1718| 4.34k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 4.34k, False: 0] ------------------ 1719| 4.34k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.69k, False: 655] | Branch (1719:9): [True: 4.34k, False: 0] ------------------ 1720| 4.34k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 4.34k| auto child = node_->inner()[offset_hint]; 1722| 4.34k| auto is_leaf = shift_ == BL; 1723| 4.34k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 4.34k| auto next_idx = idx - left_size_hint; 1725| 4.34k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 4.34k] ------------------ 1726| 4.34k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 4.34k| : visit_maybe_relaxed_sub( 1729| 4.34k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 4.34k| } _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.34k|{ 1839| 4.34k| assert(node); ------------------ | Branch (1839:5): [True: 4.34k, False: 0] ------------------ 1840| 4.34k| auto relaxed = node->relaxed(); 1841| 4.34k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.62k, False: 1.72k] ------------------ 1842| 2.62k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.62k, False: 0] ------------------ 1843| 2.62k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.62k| .visit(v, std::forward(args)...); 1845| 2.62k| } 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.34k|} _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.62k| { 1814| 2.62k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.62k| } _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.39k| { 947| 2.39k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 2.39k| } _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.39k|{ 654| 2.39k| constexpr auto B = bits; 655| 2.39k| constexpr auto BL = bits_leaf; 656| 2.39k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 2.39k, False: 0] ------------------ 657| 2.39k| auto is_leaf = p.shift() == BL; 658| 2.39k| auto child = p.node()->inner()[offset_hint]; 659| 2.39k| auto lsize = offset_hint << p.shift(); 660| 2.39k| auto size = p.this_size(); 661| 2.39k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 2.39k| return is_full ------------------ | Branch (662:12): [True: 1.32k, False: 1.06k] ------------------ 663| 2.39k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 1.32k] ------------------ 664| 1.32k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 1.32k| : make_full_pos(child, p.shift() - B) 666| 1.32k| .visit(v, idx - lsize, args...)) 667| 2.39k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 1.06k] ------------------ 668| 1.06k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 1.06k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 1.06k| .visit(v, idx - lsize, args...)); 672| 2.39k|} _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| 3.32k| { 1406| 3.32k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.32k| } _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| 2.00k| { 1349| 2.00k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 2.00k, False: 0] ------------------ 1350| 2.00k| auto is_leaf = shift_ == BL; 1351| 2.00k| auto child = node_->inner()[offset_hint]; 1352| 2.00k| auto lsize = size_t{offset_hint} << shift_; 1353| 2.00k| return is_leaf ------------------ | Branch (1353:16): [True: 0, False: 2.00k] ------------------ 1354| 2.00k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 2.00k| : make_full_pos(child, shift_ - B) 1356| 2.00k| .visit(v, idx - lsize, args...); 1357| 2.00k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1405| 311| { 1406| 311| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 311| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1348| 1.95k| { 1349| 1.95k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 1.95k, False: 0] ------------------ 1350| 1.95k| auto is_leaf = shift_ == BL; 1351| 1.95k| auto child = node_->inner()[offset_hint]; 1352| 1.95k| auto lsize = size_t{offset_hint} << shift_; 1353| 1.95k| return is_leaf ------------------ | Branch (1353:16): [True: 1.19k, False: 764] ------------------ 1354| 1.95k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 1.95k| : make_full_pos(child, shift_ - B) 1356| 764| .visit(v, idx - lsize, args...); 1357| 1.95k| } _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.17k| { 208| 3.17k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.17k| } _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.19k| { 1406| 2.19k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.19k| } _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| 8.68k| { 1349| 8.68k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 8.68k, False: 0] ------------------ 1350| 8.68k| auto is_leaf = shift_ == BL; 1351| 8.68k| auto child = node_->inner()[offset_hint]; 1352| 8.68k| auto lsize = size_t{offset_hint} << shift_; 1353| 8.68k| return is_leaf ------------------ | Branch (1353:16): [True: 6.48k, False: 2.20k] ------------------ 1354| 8.68k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 8.68k| : make_full_pos(child, shift_ - B) 1356| 2.20k| .visit(v, idx - lsize, args...); 1357| 8.68k| } _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| 13.2k| { 208| 13.2k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 13.2k| } _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.94k| { 1406| 3.94k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.94k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1316| 2.26k| { 1317| 2.26k| each_i(v, 0, last, args...); 1318| 2.26k| } _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.06k| { 1037| 1.06k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.06k| } _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.26k| { 1037| 4.26k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.26k| } _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.41k| { 947| 3.41k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 3.41k| } _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.41k|{ 654| 3.41k| constexpr auto B = bits; 655| 3.41k| constexpr auto BL = bits_leaf; 656| 3.41k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 3.41k, False: 0] ------------------ 657| 3.41k| auto is_leaf = p.shift() == BL; 658| 3.41k| auto child = p.node()->inner()[offset_hint]; 659| 3.41k| auto lsize = offset_hint << p.shift(); 660| 3.41k| auto size = p.this_size(); 661| 3.41k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 3.41k| return is_full ------------------ | Branch (662:12): [True: 3.41k, False: 0] ------------------ 663| 3.41k| ? (is_leaf ------------------ | Branch (663:19): [True: 1.98k, False: 1.42k] ------------------ 664| 3.41k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 3.41k| : make_full_pos(child, p.shift() - B) 666| 1.42k| .visit(v, idx - lsize, args...)) 667| 3.41k| : (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.41k|} _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| 8.47k| { 947| 8.47k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 8.47k| } _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| 8.47k|{ 654| 8.47k| constexpr auto B = bits; 655| 8.47k| constexpr auto BL = bits_leaf; 656| 8.47k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 8.47k, False: 0] ------------------ 657| 8.47k| auto is_leaf = p.shift() == BL; 658| 8.47k| auto child = p.node()->inner()[offset_hint]; 659| 8.47k| auto lsize = offset_hint << p.shift(); 660| 8.47k| auto size = p.this_size(); 661| 8.47k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 8.47k| return is_full ------------------ | Branch (662:12): [True: 8.47k, False: 0] ------------------ 663| 8.47k| ? (is_leaf ------------------ | Branch (663:19): [True: 6.73k, False: 1.74k] ------------------ 664| 8.47k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 8.47k| : make_full_pos(child, p.shift() - B) 666| 1.74k| .visit(v, idx - lsize, args...)) 667| 8.47k| : (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.47k|} _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.68k| { 874| 7.68k| return each_left_regular(*this, v, last, args...); 875| 7.68k| } _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.68k|{ 576| 7.68k| constexpr auto B = bits; 577| 7.68k| constexpr auto BL = bits_leaf; 578| 7.68k| assert(last < p.count()); ------------------ | Branch (578:5): [True: 7.68k, False: 0] ------------------ 579| 7.68k| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 1.98k, False: 5.69k] ------------------ 580| 1.98k| auto n = p.node()->inner(); 581| 1.98k| auto e = n + last; 582| 3.99k| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 2.01k, False: 1.98k] ------------------ 583| 2.01k| IMMER_PREFETCH(n + 1); 584| 2.01k| make_full_leaf_pos(*n).visit(v, args...); 585| 2.01k| } 586| 5.69k| } else { 587| 5.69k| auto n = p.node()->inner(); 588| 5.69k| auto e = n + last; 589| 5.69k| auto ss = p.shift() - B; 590| 7.79k| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 2.09k, False: 5.69k] ------------------ 591| 2.09k| make_full_pos(*n, ss).visit(v, args...); 592| 5.69k| } 593| 7.68k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1813| 5.57k| { 1814| 5.57k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 5.57k| } _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| 166k| { 1706| 166k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 166k, False: 0] ------------------ 1707| 166k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 9.54k, False: 156k] ------------------ 1708| 166k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 166k| } _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| 166k| { 1718| 166k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 166k, False: 0] ------------------ 1719| 166k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 9.54k, False: 156k] | Branch (1719:9): [True: 166k, False: 0] ------------------ 1720| 166k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 166k| auto child = node_->inner()[offset_hint]; 1722| 166k| auto is_leaf = shift_ == BL; 1723| 166k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 166k| auto next_idx = idx - left_size_hint; 1725| 166k| return is_leaf ------------------ | Branch (1725:16): [True: 10.1k, False: 156k] ------------------ 1726| 166k| ? make_leaf_sub_pos(child, next_size) 1727| 10.1k| .visit(v, next_idx, args...) 1728| 166k| : visit_maybe_relaxed_sub( 1729| 156k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 166k| } _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| 10.1k| { 145| 10.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 10.1k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 156k|{ 1839| 156k| assert(node); ------------------ | Branch (1839:5): [True: 156k, False: 0] ------------------ 1840| 156k| auto relaxed = node->relaxed(); 1841| 156k| if (relaxed) { ------------------ | Branch (1841:9): [True: 154k, False: 1.38k] ------------------ 1842| 154k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 154k, False: 0] ------------------ 1843| 154k| return make_relaxed_pos(node, shift, relaxed) 1844| 154k| .visit(v, std::forward(args)...); 1845| 154k| } else { 1846| 1.38k| return make_regular_sub_pos(node, shift, size) 1847| 1.38k| .visit(v, std::forward(args)...); 1848| 1.38k| } 1849| 156k|} _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| 154k| { 1814| 154k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 154k| } _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.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_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1705| 79.3k| { 1706| 79.3k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 79.3k, False: 0] ------------------ 1707| 79.3k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 24.4k, False: 54.9k] ------------------ 1708| 79.3k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 79.3k| } _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| 79.3k| { 1718| 79.3k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 79.3k, False: 0] ------------------ 1719| 79.3k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 24.4k, False: 54.9k] | Branch (1719:9): [True: 79.3k, False: 0] ------------------ 1720| 79.3k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 79.3k| auto child = node_->inner()[offset_hint]; 1722| 79.3k| auto is_leaf = shift_ == BL; 1723| 79.3k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 79.3k| auto next_idx = idx - left_size_hint; 1725| 79.3k| return is_leaf ------------------ | Branch (1725:16): [True: 14.0k, False: 65.3k] ------------------ 1726| 79.3k| ? make_leaf_sub_pos(child, next_size) 1727| 14.0k| .visit(v, next_idx, args...) 1728| 79.3k| : visit_maybe_relaxed_sub( 1729| 65.3k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 79.3k| } _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| 14.0k| { 145| 14.0k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 14.0k| } _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| 65.3k|{ 1839| 65.3k| assert(node); ------------------ | Branch (1839:5): [True: 65.3k, False: 0] ------------------ 1840| 65.3k| auto relaxed = node->relaxed(); 1841| 65.3k| if (relaxed) { ------------------ | Branch (1841:9): [True: 60.7k, False: 4.59k] ------------------ 1842| 60.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 60.7k, False: 0] ------------------ 1843| 60.7k| return make_relaxed_pos(node, shift, relaxed) 1844| 60.7k| .visit(v, std::forward(args)...); 1845| 60.7k| } else { 1846| 4.59k| return make_regular_sub_pos(node, shift, size) 1847| 4.59k| .visit(v, std::forward(args)...); 1848| 4.59k| } 1849| 65.3k|} _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| 60.7k| { 1814| 60.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 60.7k| } _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| 4.59k| { 1037| 4.59k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.59k| } _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.68k| { 1037| 8.68k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.68k| } _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.26k| { 947| 4.26k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 4.26k| } _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.26k|{ 654| 4.26k| constexpr auto B = bits; 655| 4.26k| constexpr auto BL = bits_leaf; 656| 4.26k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 4.26k, False: 0] ------------------ 657| 4.26k| auto is_leaf = p.shift() == BL; 658| 4.26k| auto child = p.node()->inner()[offset_hint]; 659| 4.26k| auto lsize = offset_hint << p.shift(); 660| 4.26k| auto size = p.this_size(); 661| 4.26k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 4.26k| return is_full ------------------ | Branch (662:12): [True: 3.18k, False: 1.08k] ------------------ 663| 4.26k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 3.18k] ------------------ 664| 3.18k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 3.18k| : make_full_pos(child, p.shift() - B) 666| 3.18k| .visit(v, idx - lsize, args...)) 667| 4.26k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 1.08k] ------------------ 668| 1.08k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 1.08k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 1.08k| .visit(v, idx - lsize, args...)); 672| 4.26k|} _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.49k| { 1406| 3.49k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.49k| } _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| 311| { 1349| 311| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 311, False: 0] ------------------ 1350| 311| auto is_leaf = shift_ == BL; 1351| 311| auto child = node_->inner()[offset_hint]; 1352| 311| auto lsize = size_t{offset_hint} << shift_; 1353| 311| return is_leaf ------------------ | Branch (1353:16): [True: 0, False: 311] ------------------ 1354| 311| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 311| : make_full_pos(child, shift_ - B) 1356| 311| .visit(v, idx - lsize, args...); 1357| 311| } _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.08k| { 1037| 1.08k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.08k| } _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.0k|{ 1839| 18.0k| assert(node); ------------------ | Branch (1839:5): [True: 18.0k, False: 0] ------------------ 1840| 18.0k| auto relaxed = node->relaxed(); 1841| 18.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 11.2k, False: 6.81k] ------------------ 1842| 11.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 11.2k, False: 0] ------------------ 1843| 11.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 11.2k| .visit(v, std::forward(args)...); 1845| 11.2k| } else { 1846| 6.81k| return make_regular_sub_pos(node, shift, size) 1847| 6.81k| .visit(v, std::forward(args)...); 1848| 6.81k| } 1849| 18.0k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor3rrbEJNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERKPSC_RKjRmEEEDcT_DpOT0_: 1813| 11.2k| { 1814| 11.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 11.2k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcPT_jmT0_DpOT1_: 1838| 11.2k|{ 1839| 11.2k| assert(node); ------------------ | Branch (1839:5): [True: 11.2k, False: 0] ------------------ 1840| 11.2k| auto relaxed = node->relaxed(); 1841| 11.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 8.16k, False: 3.10k] ------------------ 1842| 8.16k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 8.16k, False: 0] ------------------ 1843| 8.16k| return make_relaxed_pos(node, shift, relaxed) 1844| 8.16k| .visit(v, std::forward(args)...); 1845| 8.16k| } else { 1846| 3.10k| return make_regular_sub_pos(node, shift, size) 1847| 3.10k| .visit(v, std::forward(args)...); 1848| 3.10k| } 1849| 11.2k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcT_DpOT0_: 1813| 8.16k| { 1814| 8.16k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 8.16k| } _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| 32.7k| { 1794| 32.7k| auto child = node_->inner()[offset]; 1795| 32.7k| auto child_size = size(offset); 1796| 32.7k| auto is_leaf = shift_ == BL; 1797| 32.7k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 8.67k, False: 24.1k] ------------------ 1798| 32.7k| : visit_maybe_relaxed_sub( 1799| 24.1k| child, shift_ - B, child_size, v, args...); 1800| 32.7k| } _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.01k| { 145| 9.01k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 9.01k| } _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.01k| { 1805| 9.01k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 9.01k, False: 0] ------------------ 1806| 9.01k| auto child = node_->inner()[offset]; 1807| 9.01k| auto child_size = size(offset); 1808| 9.01k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 9.01k| } _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.56k| { 145| 9.56k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 9.56k| } _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.1k|{ 1839| 24.1k| assert(node); ------------------ | Branch (1839:5): [True: 24.1k, False: 0] ------------------ 1840| 24.1k| auto relaxed = node->relaxed(); 1841| 24.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 21.5k, False: 2.58k] ------------------ 1842| 21.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 21.5k, False: 0] ------------------ 1843| 21.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 21.5k| .visit(v, std::forward(args)...); 1845| 21.5k| } else { 1846| 2.58k| return make_regular_sub_pos(node, shift, size) 1847| 2.58k| .visit(v, std::forward(args)...); 1848| 2.58k| } 1849| 24.1k|} _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| 21.5k| { 1814| 21.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 21.5k| } _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| 21.5k| { 1794| 21.5k| auto child = node_->inner()[offset]; 1795| 21.5k| auto child_size = size(offset); 1796| 21.5k| auto is_leaf = shift_ == BL; 1797| 21.5k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 21.5k] ------------------ 1798| 21.5k| : visit_maybe_relaxed_sub( 1799| 21.5k| child, shift_ - B, child_size, v, args...); 1800| 21.5k| } _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| 21.5k|{ 1839| 21.5k| assert(node); ------------------ | Branch (1839:5): [True: 21.5k, False: 0] ------------------ 1840| 21.5k| auto relaxed = node->relaxed(); 1841| 21.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 20.3k, False: 1.21k] ------------------ 1842| 20.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 20.3k, False: 0] ------------------ 1843| 20.3k| return make_relaxed_pos(node, shift, relaxed) 1844| 20.3k| .visit(v, std::forward(args)...); 1845| 20.3k| } else { 1846| 1.21k| return make_regular_sub_pos(node, shift, size) 1847| 1.21k| .visit(v, std::forward(args)...); 1848| 1.21k| } 1849| 21.5k|} _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| 20.3k| { 1814| 20.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 20.3k| } _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.60k| { 1037| 1.60k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.60k| } _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| 7.12k| { 1794| 7.12k| auto child = node_->inner()[offset]; 1795| 7.12k| auto child_size = size(offset); 1796| 7.12k| auto is_leaf = shift_ == BL; 1797| 7.12k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 4.11k, False: 3.00k] ------------------ 1798| 7.12k| : visit_maybe_relaxed_sub( 1799| 3.00k| child, shift_ - B, child_size, v, args...); 1800| 7.12k| } _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| 4.11k| { 145| 4.11k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.11k| } _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| 4.11k| { 1026| 4.11k| assert(shift_ == BL); ------------------ | Branch (1026:9): [True: 4.11k, False: 0] ------------------ 1027| 4.11k| auto child = node_->inner()[idx]; 1028| 4.11k| auto lsize = size(idx); 1029| 4.11k| auto is_full = idx + 1 < count(); 1030| 4.11k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1030:16): [True: 3.57k, False: 545] ------------------ 1031| 4.11k| : make_leaf_sub_pos(child, lsize).visit(v, args...); 1032| 4.11k| } _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| 7.29k| { 208| 7.29k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 7.29k| } _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.00k|{ 1839| 3.00k| assert(node); ------------------ | Branch (1839:5): [True: 3.00k, False: 0] ------------------ 1840| 3.00k| auto relaxed = node->relaxed(); 1841| 3.00k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.25k, False: 756] ------------------ 1842| 2.25k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.25k, False: 0] ------------------ 1843| 2.25k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.25k| .visit(v, std::forward(args)...); 1845| 2.25k| } else { 1846| 756| return make_regular_sub_pos(node, shift, size) 1847| 756| .visit(v, std::forward(args)...); 1848| 756| } 1849| 3.00k|} _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.25k| { 1814| 2.25k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.25k| } _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.25k| { 1008| 2.25k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 2.25k, False: 0] ------------------ 1009| 2.25k| auto is_leaf = shift_ == BL; 1010| 2.25k| auto child = node_->inner()[idx]; 1011| 2.25k| auto lsize = size(idx); 1012| 2.25k| auto is_full = idx + 1 < count(); 1013| 2.25k| return is_full ------------------ | Branch (1013:16): [True: 1.86k, False: 386] ------------------ 1014| 2.25k| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 1.86k] ------------------ 1015| 1.86k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.86k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 2.25k| : (is_leaf ------------------ | Branch (1017:23): [True: 0, False: 386] ------------------ 1018| 386| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 386| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 386| .visit(v, args...)); 1021| 2.25k| } _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.74k| { 1406| 2.74k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.74k| } _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.70k| { 1794| 5.70k| auto child = node_->inner()[offset]; 1795| 5.70k| auto child_size = size(offset); 1796| 5.70k| auto is_leaf = shift_ == BL; 1797| 5.70k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 3.71k, False: 1.98k] ------------------ 1798| 5.70k| : visit_maybe_relaxed_sub( 1799| 1.98k| child, shift_ - B, child_size, v, args...); 1800| 5.70k| } _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.71k| { 145| 3.71k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 3.71k| } _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.71k| { 1397| 3.71k| assert(shift_ == BL); ------------------ | Branch (1397:9): [True: 3.71k, False: 0] ------------------ 1398| 3.71k| assert(idx < count()); ------------------ | Branch (1398:9): [True: 3.71k, False: 0] ------------------ 1399| 3.71k| auto child = node_->inner()[idx]; 1400| 3.71k| return make_full_leaf_pos(child).visit(v, args...); 1401| 3.71k| } _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.98k|{ 1839| 1.98k| assert(node); ------------------ | Branch (1839:5): [True: 1.98k, False: 0] ------------------ 1840| 1.98k| auto relaxed = node->relaxed(); 1841| 1.98k| if (relaxed) { ------------------ | Branch (1841:9): [True: 876, False: 1.10k] ------------------ 1842| 876| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 876, False: 0] ------------------ 1843| 876| return make_relaxed_pos(node, shift, relaxed) 1844| 876| .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.98k|} _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| 876| { 1814| 876| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 876| } _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| 876| { 1387| 876| assert(idx < count()); ------------------ | Branch (1387:9): [True: 876, False: 0] ------------------ 1388| 876| auto is_leaf = shift_ == BL; 1389| 876| auto child = node_->inner()[idx]; 1390| 876| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 876] ------------------ 1391| 876| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 876| } _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.86k| { 1406| 1.86k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.86k| } _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.80k| { 1223| 3.80k| auto p = node_->inner(); 1224| 3.80k| auto p2 = other->inner(); 1225| 3.80k| auto e = p + branches; 1226| 3.80k| if (shift_ == BL) { ------------------ | Branch (1226:13): [True: 2.93k, False: 874] ------------------ 1227| 11.2k| for (; p != e; ++p, ++p2) { ------------------ | Branch (1227:20): [True: 9.67k, False: 1.62k] ------------------ 1228| 9.67k| IMMER_PREFETCH(p + 1); 1229| 9.67k| if (!make_full_leaf_pos(*p).visit(v, *p2, args...)) ------------------ | Branch (1229:21): [True: 1.30k, False: 8.36k] ------------------ 1230| 1.30k| return false; 1231| 9.67k| } 1232| 2.93k| } else { 1233| 874| auto ss = shift_ - B; 1234| 3.07k| for (; p != e; ++p, ++p2) ------------------ | Branch (1234:20): [True: 2.72k, False: 348] ------------------ 1235| 2.72k| if (!make_full_pos(*p, ss).visit(v, *p2, args...)) ------------------ | Branch (1235:21): [True: 526, False: 2.20k] ------------------ 1236| 526| return false; 1237| 874| } 1238| 1.97k| return true; 1239| 3.80k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 207| 13.6k| { 208| 13.6k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 13.6k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 1405| 8.65k| { 1406| 8.65k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 8.65k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13each_pred_zipINS1_14equals_visitorEJEEEbT_PSC_DpOT0_: 837| 5.24k| { 838| 5.24k| return each_pred_zip_regular(*this, v, other, args...); 839| 5.24k| } _ZN5immer6detail4rbts21each_pred_zip_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_14equals_visitorEJEEEbOT_T0_PNSt3__15decayISH_E4type6node_tEDpOT1_: 392| 5.24k|{ 393| 5.24k| constexpr auto B = bits; 394| 5.24k| constexpr auto BL = bits_leaf; 395| | 396| 5.24k| auto n = p.node()->inner(); 397| 5.24k| auto n2 = other->inner(); 398| 5.24k| auto last = p.count() - 1; 399| 5.24k| auto e = n + last; 400| 5.24k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 1.55k, False: 3.68k] ------------------ 401| 3.37k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 2.24k, False: 1.12k] ------------------ 402| 2.24k| IMMER_PREFETCH(n + 1); 403| 2.24k| IMMER_PREFETCH(n2 + 1); 404| 2.24k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 436, False: 1.81k] ------------------ 405| 436| return false; 406| 2.24k| } 407| 1.12k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 3.68k| } else { 409| 3.68k| auto ss = p.shift() - B; 410| 7.22k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 4.42k, False: 2.80k] ------------------ 411| 4.42k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 876, False: 3.54k] ------------------ 412| 876| return false; 413| 2.80k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 3.68k| } 415| 5.24k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 112| 2.99k| { 113| 2.99k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.99k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 336| 3.95k| { 337| 3.95k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.95k| } _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.48k| { 256| 3.48k| return each_pred_zip_regular(*this, v, other, args...); 257| 3.48k| } _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.48k|{ 393| 3.48k| constexpr auto B = bits; 394| 3.48k| constexpr auto BL = bits_leaf; 395| | 396| 3.48k| auto n = p.node()->inner(); 397| 3.48k| auto n2 = other->inner(); 398| 3.48k| auto last = p.count() - 1; 399| 3.48k| auto e = n + last; 400| 3.48k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 2.13k, False: 1.34k] ------------------ 401| 3.61k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 1.74k, False: 1.87k] ------------------ 402| 1.74k| IMMER_PREFETCH(n + 1); 403| 1.74k| IMMER_PREFETCH(n2 + 1); 404| 1.74k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 264, False: 1.48k] ------------------ 405| 264| return false; 406| 1.74k| } 407| 1.87k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 2.13k| } else { 409| 1.34k| auto ss = p.shift() - B; 410| 2.64k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 1.49k, False: 1.15k] ------------------ 411| 1.49k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 199, False: 1.30k] ------------------ 412| 199| return false; 413| 1.15k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 1.34k| } 415| 3.48k|} _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.59k| { 1387| 4.59k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 4.59k, False: 0] ------------------ 1388| 4.59k| auto is_leaf = shift_ == BL; 1389| 4.59k| auto child = node_->inner()[idx]; 1390| 4.59k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 3.25k, False: 1.33k] ------------------ 1391| 4.59k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 4.59k| } _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| 344k| { 208| 344k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 344k| } _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.54M|{ 1839| 9.54M| assert(node); ------------------ | Branch (1839:5): [True: 9.54M, False: 0] ------------------ 1840| 9.54M| auto relaxed = node->relaxed(); 1841| 9.54M| if (relaxed) { ------------------ | Branch (1841:9): [True: 9.17M, False: 371k] ------------------ 1842| 9.17M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 9.17M, False: 0] ------------------ 1843| 9.17M| return make_relaxed_pos(node, shift, relaxed) 1844| 9.17M| .visit(v, std::forward(args)...); 1845| 9.17M| } else { 1846| 371k| return make_regular_sub_pos(node, shift, size) 1847| 371k| .visit(v, std::forward(args)...); 1848| 371k| } 1849| 9.54M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1813| 9.17M| { 1814| 9.17M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 9.17M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1679| 9.17M| { 1680| 9.17M| return towards_oh(v, idx, subindex(idx), args...); 1681| 9.17M| } _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.17M| { 1687| 9.17M| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 9.17M, False: 0] ------------------ 1688| 9.17M| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 5.10M, False: 4.06M] ------------------ 1689| 9.17M| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 9.17M| } _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.17M| { 1699| 9.17M| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 9.17M| } _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.17M| { 1718| 9.17M| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 9.17M, False: 0] ------------------ 1719| 9.17M| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 5.10M, False: 4.06M] | Branch (1719:9): [True: 9.17M, False: 0] ------------------ 1720| 9.17M| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 9.17M| auto child = node_->inner()[offset_hint]; 1722| 9.17M| auto is_leaf = shift_ == BL; 1723| 9.17M| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 9.17M| auto next_idx = idx - left_size_hint; 1725| 9.17M| return is_leaf ------------------ | Branch (1725:16): [True: 1.00M, False: 8.16M] ------------------ 1726| 9.17M| ? make_leaf_sub_pos(child, next_size) 1727| 1.00M| .visit(v, next_idx, args...) 1728| 9.17M| : visit_maybe_relaxed_sub( 1729| 8.16M| child, shift_ - B, next_size, v, next_idx, args...); 1730| 9.17M| } _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| 371k| { 1037| 371k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 371k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 919| 371k| { 920| 371k| return towards_oh_ch_regular( 921| 371k| *this, v, idx, index(idx), count(), args...); 922| 371k| } _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| 371k|{ 633| 371k| constexpr auto B = bits; 634| 371k| constexpr auto BL = bits_leaf; 635| 371k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 371k, False: 0] ------------------ 636| 371k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 371k, False: 0] ------------------ 637| 371k| auto is_leaf = p.shift() == BL; 638| 371k| auto child = p.node()->inner()[offset_hint]; 639| 371k| auto is_full = offset_hint + 1 != count_hint; 640| 371k| return is_full ------------------ | Branch (640:12): [True: 272k, False: 99.0k] ------------------ 641| 371k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 45.5k, False: 227k] ------------------ 642| 272k| : make_full_pos(child, p.shift() - B) 643| 227k| .visit(v, idx, args...)) 644| 371k| : (is_leaf ------------------ | Branch (644:19): [True: 17.5k, False: 81.5k] ------------------ 645| 99.0k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 99.0k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 81.5k| .visit(v, idx, args...)); 648| 371k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 207| 347k| { 208| 347k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 347k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1405| 998k| { 1406| 998k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 998k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1322| 998k| { 1323| 998k| return towards_oh(v, idx, index(idx), args...); 1324| 998k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_18region_for_visitorIiEEJEEEDcT_mjDpOT0_: 1336| 998k| { 1337| 998k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 998k, False: 0] ------------------ 1338| 998k| auto is_leaf = shift_ == BL; 1339| 998k| auto child = node_->inner()[offset_hint]; 1340| 998k| return is_leaf ------------------ | Branch (1340:16): [True: 292k, False: 706k] ------------------ 1341| 998k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 998k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 998k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 112| 23.7k| { 113| 23.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 23.7k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 336| 108k| { 337| 108k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 108k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 297| 108k| { 298| 108k| return towards_oh_ch_regular( 299| 108k| *this, v, idx, index(idx), count(), args...); 300| 108k| } _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| 108k|{ 633| 108k| constexpr auto B = bits; 634| 108k| constexpr auto BL = bits_leaf; 635| 108k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 108k, False: 0] ------------------ 636| 108k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 108k, False: 0] ------------------ 637| 108k| auto is_leaf = p.shift() == BL; 638| 108k| auto child = p.node()->inner()[offset_hint]; 639| 108k| auto is_full = offset_hint + 1 != count_hint; 640| 108k| return is_full ------------------ | Branch (640:12): [True: 75.2k, False: 33.3k] ------------------ 641| 108k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 10.0k, False: 65.2k] ------------------ 642| 75.2k| : make_full_pos(child, p.shift() - B) 643| 65.2k| .visit(v, idx, args...)) 644| 108k| : (is_leaf ------------------ | Branch (644:19): [True: 6.26k, False: 27.0k] ------------------ 645| 33.3k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 33.3k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 27.0k| .visit(v, idx, args...)); 648| 108k|} _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| 92.8k| { 1406| 92.8k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 92.8k| } _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| 92.8k| { 1203| 92.8k| auto p = node_->inner(); 1204| 92.8k| auto e = p + branches; 1205| 92.8k| if (shift_ == BL) { ------------------ | Branch (1205:13): [True: 73.0k, False: 19.7k] ------------------ 1206| 363k| for (; p != e; ++p) { ------------------ | Branch (1206:20): [True: 291k, False: 72.3k] ------------------ 1207| 291k| IMMER_PREFETCH(p + 1); 1208| 291k| if (!make_full_leaf_pos(*p).visit(v, args...)) ------------------ | Branch (1208:21): [True: 698, False: 290k] ------------------ 1209| 698| return false; 1210| 291k| } 1211| 73.0k| } else { 1212| 19.7k| auto ss = shift_ - B; 1213| 97.5k| for (; p != e; ++p) ------------------ | Branch (1213:20): [True: 78.1k, False: 19.3k] ------------------ 1214| 78.1k| if (!make_full_pos(*p, ss).visit(v, args...)) ------------------ | Branch (1214:21): [True: 463, False: 77.7k] ------------------ 1215| 463| return false; 1216| 19.7k| } 1217| 91.6k| return true; 1218| 92.8k| } _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| 756| { 1037| 756| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 756| } _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| 756| { 1008| 756| assert(idx < count()); ------------------ | Branch (1008:9): [True: 756, False: 0] ------------------ 1009| 756| auto is_leaf = shift_ == BL; 1010| 756| auto child = node_->inner()[idx]; 1011| 756| auto lsize = size(idx); 1012| 756| auto is_full = idx + 1 < count(); 1013| 756| return is_full ------------------ | Branch (1013:16): [True: 756, False: 0] ------------------ 1014| 756| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 756] ------------------ 1015| 756| ? make_full_leaf_pos(child).visit(v, args...) 1016| 756| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 756| : (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| 756| } _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.60k| { 1037| 1.60k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.60k| } _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.44k| { 1008| 4.44k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 4.44k, False: 0] ------------------ 1009| 4.44k| auto is_leaf = shift_ == BL; 1010| 4.44k| auto child = node_->inner()[idx]; 1011| 4.44k| auto lsize = size(idx); 1012| 4.44k| auto is_full = idx + 1 < count(); 1013| 4.44k| return is_full ------------------ | Branch (1013:16): [True: 1.51k, False: 2.93k] ------------------ 1014| 4.44k| ? (is_leaf ------------------ | Branch (1014:23): [True: 909, False: 605] ------------------ 1015| 1.51k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.51k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 4.44k| : (is_leaf ------------------ | Branch (1017:23): [True: 1.64k, False: 1.28k] ------------------ 1018| 2.93k| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 2.93k| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 1.28k| .visit(v, args...)); 1021| 4.44k| } _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| 994k| { 145| 994k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 994k| } _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| 19.9k| { 1037| 19.9k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 19.9k| } _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| 19.9k| { 832| 19.9k| return each_pred_regular(*this, v, args...); 833| 19.9k| } _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| 19.9k|{ 366| 19.9k| constexpr auto B = bits; 367| 19.9k| constexpr auto BL = bits_leaf; 368| 19.9k| auto n = p.node()->inner(); 369| 19.9k| auto last = p.count() - 1; 370| 19.9k| auto e = n + last; 371| 19.9k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 14.8k, False: 5.03k] ------------------ 372| 55.0k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 40.3k, False: 14.6k] ------------------ 373| 40.3k| IMMER_PREFETCH(n + 1); 374| 40.3k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 238, False: 40.1k] ------------------ 375| 238| return false; 376| 40.3k| } 377| 14.6k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 14.8k| } else { 379| 5.03k| auto ss = p.shift() - B; 380| 13.5k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 9.03k, False: 4.48k] ------------------ 381| 9.03k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 553, False: 8.47k] ------------------ 382| 553| return false; 383| 4.48k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 5.03k| } 385| 19.9k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 112| 18.7k| { 113| 18.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 18.7k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 336| 6.44k| { 337| 6.44k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 6.44k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 249| 6.44k| { 250| 6.44k| return each_pred_regular(*this, v, args...); 251| 6.44k| } _ZN5immer6detail4rbts17each_pred_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSC_Lj2ELj2EEEEEDaOT_EUlSL_T0_E_EEEbSM_SN_DpOT1_: 365| 6.44k|{ 366| 6.44k| constexpr auto B = bits; 367| 6.44k| constexpr auto BL = bits_leaf; 368| 6.44k| auto n = p.node()->inner(); 369| 6.44k| auto last = p.count() - 1; 370| 6.44k| auto e = n + last; 371| 6.44k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 4.36k, False: 2.08k] ------------------ 372| 12.9k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 8.85k, False: 4.09k] ------------------ 373| 8.85k| IMMER_PREFETCH(n + 1); 374| 8.85k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 262, False: 8.59k] ------------------ 375| 262| return false; 376| 8.85k| } 377| 4.09k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 4.36k| } else { 379| 2.08k| auto ss = p.shift() - B; 380| 5.64k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 3.68k, False: 1.96k] ------------------ 381| 3.68k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 125, False: 3.55k] ------------------ 382| 125| return false; 383| 1.96k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 2.08k| } 385| 6.44k|} _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.58k| { 1037| 2.58k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.58k| } _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.58k| { 1794| 2.58k| auto child = node_->inner()[offset]; 1795| 2.58k| auto child_size = size(offset); 1796| 2.58k| auto is_leaf = shift_ == BL; 1797| 2.58k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 2.58k] ------------------ 1798| 2.58k| : visit_maybe_relaxed_sub( 1799| 2.58k| child, shift_ - B, child_size, v, args...); 1800| 2.58k| } _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.58k|{ 1839| 2.58k| assert(node); ------------------ | Branch (1839:5): [True: 2.58k, False: 0] ------------------ 1840| 2.58k| auto relaxed = node->relaxed(); 1841| 2.58k| if (relaxed) { ------------------ | Branch (1841:9): [True: 980, False: 1.60k] ------------------ 1842| 980| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 980, False: 0] ------------------ 1843| 980| return make_relaxed_pos(node, shift, relaxed) 1844| 980| .visit(v, std::forward(args)...); 1845| 1.60k| } else { 1846| 1.60k| return make_regular_sub_pos(node, shift, size) 1847| 1.60k| .visit(v, std::forward(args)...); 1848| 1.60k| } 1849| 2.58k|} _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| 980| { 1814| 980| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 980| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcjT_DpOT0_: 1007| 4.66k| { 1008| 4.66k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 4.66k, False: 0] ------------------ 1009| 4.66k| auto is_leaf = shift_ == BL; 1010| 4.66k| auto child = node_->inner()[idx]; 1011| 4.66k| auto lsize = size(idx); 1012| 4.66k| auto is_full = idx + 1 < count(); 1013| 4.66k| return is_full ------------------ | Branch (1013:16): [True: 4.32k, False: 341] ------------------ 1014| 4.66k| ? (is_leaf ------------------ | Branch (1014:23): [True: 2.77k, False: 1.54k] ------------------ 1015| 4.32k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 4.32k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 4.66k| : (is_leaf ------------------ | Branch (1017:23): [True: 341, False: 0] ------------------ 1018| 341| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 341| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 0| .visit(v, args...)); 1021| 4.66k| } _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| 5.31k| { 208| 5.31k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.31k| } _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| 5.31k| { 1805| 5.31k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 5.31k, False: 0] ------------------ 1806| 5.31k| auto child = node_->inner()[offset]; 1807| 5.31k| auto child_size = size(offset); 1808| 5.31k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 5.31k| } _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| 5.31k| { 145| 5.31k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.31k| } _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.80k| { 1406| 2.80k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.80k| } _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.80k| { 1794| 2.80k| auto child = node_->inner()[offset]; 1795| 2.80k| auto child_size = size(offset); 1796| 2.80k| auto is_leaf = shift_ == BL; 1797| 2.80k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 2.80k] ------------------ 1798| 2.80k| : visit_maybe_relaxed_sub( 1799| 2.80k| child, shift_ - B, child_size, v, args...); 1800| 2.80k| } _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.80k|{ 1839| 2.80k| assert(node); ------------------ | Branch (1839:5): [True: 2.80k, False: 0] ------------------ 1840| 2.80k| auto relaxed = node->relaxed(); 1841| 2.80k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.65k, False: 1.15k] ------------------ 1842| 1.65k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.65k, False: 0] ------------------ 1843| 1.65k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.65k| .visit(v, std::forward(args)...); 1845| 1.65k| } else { 1846| 1.15k| return make_regular_sub_pos(node, shift, size) 1847| 1.15k| .visit(v, std::forward(args)...); 1848| 1.15k| } 1849| 2.80k|} _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.65k| { 1814| 1.65k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.65k| } _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.79k| { 1387| 3.79k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 3.79k, False: 0] ------------------ 1388| 3.79k| auto is_leaf = shift_ == BL; 1389| 3.79k| auto child = node_->inner()[idx]; 1390| 3.79k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 2.53k, False: 1.26k] ------------------ 1391| 3.79k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 3.79k| } _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.15k| { 1037| 1.15k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.15k| } _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| 24.0k| { 1794| 24.0k| auto child = node_->inner()[offset]; 1795| 24.0k| auto child_size = size(offset); 1796| 24.0k| auto is_leaf = shift_ == BL; 1797| 24.0k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 8.27k, False: 15.7k] ------------------ 1798| 24.0k| : visit_maybe_relaxed_sub( 1799| 15.7k| child, shift_ - B, child_size, v, args...); 1800| 24.0k| } _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| 594k|{ 1839| 594k| assert(node); ------------------ | Branch (1839:5): [True: 594k, False: 0] ------------------ 1840| 594k| auto relaxed = node->relaxed(); 1841| 594k| if (relaxed) { ------------------ | Branch (1841:9): [True: 575k, False: 18.6k] ------------------ 1842| 575k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 575k, False: 0] ------------------ 1843| 575k| return make_relaxed_pos(node, shift, relaxed) 1844| 575k| .visit(v, std::forward(args)...); 1845| 575k| } else { 1846| 18.6k| return make_regular_sub_pos(node, shift, size) 1847| 18.6k| .visit(v, std::forward(args)...); 1848| 18.6k| } 1849| 594k|} _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| 575k| { 1814| 575k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 575k| } _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| 575k| { 1483| 575k| auto p = node_->inner(); 1484| 575k| auto s = size_t{}; 1485| 575k| auto n = count(); 1486| 575k| if (shift_ == BL) { ------------------ | Branch (1486:13): [True: 291k, False: 284k] ------------------ 1487| 1.27M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1487:39): [True: 984k, False: 291k] ------------------ 1488| 984k| IMMER_PREFETCH(p + i + 1); 1489| 984k| if (!make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) ------------------ | Branch (1489:21): [True: 418, False: 984k] ------------------ 1490| 984k| .visit(v, args...)) 1491| 418| return false; 1492| 984k| s = relaxed_->d.sizes[i]; 1493| 984k| } 1494| 291k| } else { 1495| 284k| auto ss = shift_ - B; 1496| 862k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1496:39): [True: 578k, False: 283k] ------------------ 1497| 578k| if (!visit_maybe_relaxed_sub( ------------------ | Branch (1497:21): [True: 494, False: 578k] ------------------ 1498| 578k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...)) 1499| 494| return false; 1500| 578k| s = relaxed_->d.sizes[i]; 1501| 578k| } 1502| 284k| } 1503| 575k| return true; 1504| 575k| } _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.10k| { 1037| 3.10k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.10k| } _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.44k| { 1784| 1.44k| assert(shift_ > BL); ------------------ | Branch (1784:9): [True: 1.44k, False: 0] ------------------ 1785| 1.44k| auto child = node_->inner()[0]; 1786| 1.44k| auto child_size = relaxed_->d.sizes[0]; 1787| 1.44k| return visit_maybe_relaxed_sub( 1788| 1.44k| child, shift_ - B, child_size, v, args...); 1789| 1.44k| } _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.44k|{ 1839| 1.44k| assert(node); ------------------ | Branch (1839:5): [True: 1.44k, False: 0] ------------------ 1840| 1.44k| auto relaxed = node->relaxed(); 1841| 1.44k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.44k, False: 0] ------------------ 1842| 1.44k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.44k, False: 0] ------------------ 1843| 1.44k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.44k| .visit(v, std::forward(args)...); 1845| 1.44k| } else { 1846| 0| return make_regular_sub_pos(node, shift, size) 1847| 0| .visit(v, std::forward(args)...); 1848| 0| } 1849| 1.44k|} _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.44k| { 1814| 1.44k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.44k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcPT_jmT0_DpOT1_: 1838| 6.81k|{ 1839| 6.81k| assert(node); ------------------ | Branch (1839:5): [True: 6.81k, False: 0] ------------------ 1840| 6.81k| auto relaxed = node->relaxed(); 1841| 6.81k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.62k, False: 5.19k] ------------------ 1842| 1.62k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.62k, False: 0] ------------------ 1843| 1.62k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.62k| .visit(v, std::forward(args)...); 1845| 5.19k| } else { 1846| 5.19k| return make_regular_sub_pos(node, shift, size) 1847| 5.19k| .visit(v, std::forward(args)...); 1848| 5.19k| } 1849| 6.81k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcT_DpOT0_: 1813| 1.62k| { 1814| 1.62k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.62k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcT_DpOT0_: 1036| 5.19k| { 1037| 5.19k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.19k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor3rrbEJNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERKPSC_RKjRmEEEDcT_DpOT0_: 1036| 6.81k| { 1037| 6.81k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.81k| } _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.77k| { 145| 6.77k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 6.77k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2Ev: 114| 1.62M| : size{0} 115| 1.62M| , shift{BL} 116| 1.62M| , root{empty_root()} 117| 1.62M| , tail{empty_tail()} 118| 1.62M| { 119| | assert(check_tree()); ------------------ | Branch (119:9): [True: 1.62M, False: 0] ------------------ 120| 1.62M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10empty_rootEv: 61| 1.64M| { 62| 1.64M| static const auto empty_ = [] { 63| 1.64M| constexpr auto size = node_t::sizeof_inner_n(0); 64| 1.64M| static std::aligned_storage_t 65| 1.64M| storage; 66| 1.64M| return node_t::make_inner_n_into(&storage, size, 0u); 67| 1.64M| }(); 68| 1.64M| return empty_->inc(); 69| 1.64M| } _ZZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10empty_rootEvENKUlvE_clEv: 62| 1| static const auto empty_ = [] { 63| 1| constexpr auto size = node_t::sizeof_inner_n(0); 64| 1| static std::aligned_storage_t 65| 1| storage; 66| 1| return node_t::make_inner_n_into(&storage, size, 0u); 67| 1| }(); _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10empty_tailEv: 72| 1.62M| { 73| 1.62M| static const auto empty_ = [] { 74| 1.62M| constexpr auto size = node_t::sizeof_leaf_n(0); 75| 1.62M| static std::aligned_storage_t 76| 1.62M| storage; 77| 1.62M| return node_t::make_leaf_n_into(&storage, size, 0u); 78| 1.62M| }(); 79| 1.62M| return empty_->inc(); 80| 1.62M| } _ZZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10empty_tailEvENKUlvE_clEv: 73| 1| static const auto empty_ = [] { 74| 1| constexpr auto size = node_t::sizeof_leaf_n(0); 75| 1| static std::aligned_storage_t 76| 1| storage; 77| 1| return node_t::make_leaf_n_into(&storage, size, 0u); 78| 1| }(); _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10check_treeEv: 1372| 3.24M| { 1373| 3.24M| IMMER_INVALID_STATE_ASSERT(shift <= sizeof(size_t) * 8 - BL); ------------------ | | 32| 3.24M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.24M] | | ------------------ | | 33| 3.24M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1374| 3.24M| IMMER_INVALID_STATE_ASSERT(shift >= BL); ------------------ | | 32| 3.24M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.24M] | | ------------------ | | 33| 3.24M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1375| 3.24M| IMMER_INVALID_STATE_ASSERT(tail_offset() <= size); ------------------ | | 32| 3.24M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.24M] | | ------------------ | | 33| 3.24M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1376| 3.24M| IMMER_INVALID_STATE_ASSERT(tail_size() <= branches); ------------------ | | 32| 3.24M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.24M] | | ------------------ | | 33| 3.24M| 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.24M| return true; 1382| 3.24M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11tail_offsetEv: 197| 15.9M| { 198| 15.9M| auto r = root->relaxed(); 199| 15.9M| assert(r == nullptr || r->d.count); ------------------ | Branch (199:9): [True: 8.03M, False: 7.95M] | Branch (199:9): [True: 7.95M, False: 0] | Branch (199:9): [True: 15.9M, False: 0] ------------------ 200| 15.9M| return r ? r->d.sizes[r->d.count - 1] ------------------ | Branch (200:16): [True: 7.95M, False: 8.03M] ------------------ 201| 15.9M| : size ? (size - 1) & ~mask ------------------ | Branch (201:18): [True: 3.12M, False: 4.90M] ------------------ 202| | /* otherwise */ 203| 8.03M| : 0; 204| 15.9M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9tail_sizeEv: 194| 3.72M| 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.24M| ~rrbtree() { dec(); } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE3decEv: 192| 3.24M| 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.24M| { 209| 3.24M| auto tail_off = tail_offset(); 210| 3.24M| auto tail_size = size - tail_off; 211| | 212| 3.24M| if (tail_off) ------------------ | Branch (212:13): [True: 1.52M, False: 1.71M] ------------------ 213| 1.52M| visit_maybe_relaxed_sub(root, shift, tail_off, v, args...); 214| 1.71M| else 215| 1.71M| make_empty_regular_pos(root).visit(v, args...); 216| | 217| 3.24M| if (tail_size) ------------------ | Branch (217:13): [True: 1.61M, False: 1.62M] ------------------ 218| 1.61M| make_leaf_sub_pos(tail, tail_size).visit(v, args...); 219| 1.62M| else 220| 1.62M| make_empty_leaf_pos(tail).visit(v, args...); 221| 3.24M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9push_backEi: 500| 442k| { 501| 442k| auto ts = tail_size(); 502| 442k| if (ts < branches) { ------------------ | Branch (502:13): [True: 324k, False: 118k] ------------------ 503| 324k| auto new_tail = 504| 324k| node_t::copy_leaf_emplace(tail, ts, std::move(value)); 505| 324k| return {size + 1, shift, root->inc(), new_tail}; 506| 324k| } else { 507| 118k| using std::get; 508| 118k| auto new_tail = node_t::make_leaf_n(1u, std::move(value)); 509| 118k| auto tail_off = tail_offset(); 510| 118k| IMMER_TRY { ------------------ | | 49| 118k|#define IMMER_TRY try ------------------ 511| 118k| auto new_root = 512| 118k| push_tail(root, shift, tail_off, tail, size - tail_off); 513| 118k| tail->inc(); 514| 118k| return {size + 1, get<0>(new_root), get<1>(new_root), new_tail}; 515| 118k| } 516| 118k| IMMER_CATCH (...) { 517| 0| node_t::delete_leaf(new_tail, 1u); 518| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 519| 0| } 520| 118k| } 521| 442k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2EmjPNS1_4nodeIiSA_Lj2ELj2EEESE_: 127| 1.61M| : size{sz} 128| 1.61M| , shift{sh} 129| 1.61M| , root{r} 130| 1.61M| , tail{t} 131| 1.61M| { 132| 1.61M|#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.61M| try { 137| 1.61M| check_tree(); 138| 1.61M| } 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.61M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9push_tailEPNS1_4nodeIiSA_Lj2ELj2EEEjmSE_j: 369| 573k| { 370| 573k| if (auto r = root->relaxed()) { ------------------ | Branch (370:18): [True: 216k, False: 356k] ------------------ 371| 216k| auto new_root = 372| 216k| make_relaxed_pos(root, shift, r) 373| 216k| .visit(push_tail_visitor{}, tail, tail_size); 374| 216k| if (new_root) ------------------ | Branch (374:17): [True: 214k, False: 2.08k] ------------------ 375| 214k| return std::make_tuple(shift, new_root); 376| 2.08k| else { 377| 2.08k| auto new_root = node_t::make_inner_r_n(2); 378| 2.08k| IMMER_TRY { ------------------ | | 49| 2.08k|#define IMMER_TRY try ------------------ 379| 2.08k| auto new_path = node_t::make_path(shift, tail); 380| 2.08k| new_root->inner()[0] = root->inc(); 381| 2.08k| new_root->inner()[1] = new_path; 382| 2.08k| new_root->relaxed()->d.sizes[0] = size; 383| 2.08k| new_root->relaxed()->d.sizes[1] = size + tail_size; 384| 2.08k| assert(size); ------------------ | Branch (384:21): [True: 2.08k, False: 0] ------------------ 385| 2.08k| assert(tail_size); ------------------ | Branch (385:21): [True: 2.08k, False: 0] ------------------ 386| 2.08k| new_root->relaxed()->d.count = 2u; 387| 2.08k| } 388| 2.08k| IMMER_CATCH (...) { 389| 0| node_t::delete_inner_r(new_root, 2); 390| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 391| 0| } 392| 2.08k| return std::make_tuple(shift + B, new_root); 393| 2.08k| } 394| 356k| } else if (size == size_t{branches} << shift) { ------------------ | Branch (394:20): [True: 5.24k, False: 351k] ------------------ 395| 5.24k| auto new_root = node_t::make_inner_n(2); 396| 5.24k| IMMER_TRY { ------------------ | | 49| 5.24k|#define IMMER_TRY try ------------------ 397| 5.24k| auto new_path = node_t::make_path(shift, tail); 398| 5.24k| new_root->inner()[0] = root->inc(); 399| 5.24k| new_root->inner()[1] = new_path; 400| 5.24k| } 401| 5.24k| 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.24k| return std::make_tuple(shift + B, new_root); 406| 351k| } else if (size) { ------------------ | Branch (406:20): [True: 341k, False: 10.4k] ------------------ 407| 341k| auto new_root = make_regular_sub_pos(root, shift, size) 408| 341k| .visit(push_tail_visitor{}, tail); 409| 341k| return std::make_tuple(shift, new_root); 410| 341k| } else { 411| 10.4k| return std::make_tuple(shift, node_t::make_path(shift, tail)); 412| 10.4k| } 413| 573k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2EOSB_: 157| 1.54M| : rrbtree{} 158| 1.54M| { 159| 1.54M| swap(*this, other); 160| 1.54M| } _ZN5immer6detail4rbts4swapERNS1_7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEESC_: 176| 3.57M| { 177| 3.57M| using std::swap; 178| 3.57M| swap(x.size, y.size); 179| 3.57M| swap(x.shift, y.shift); 180| 3.57M| swap(x.root, y.root); 181| 3.57M| swap(x.tail, y.tail); 182| 3.57M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEaSEOSB_: 170| 2.02M| { 171| 2.02M| swap(*this, other); 172| 2.02M| return *this; 173| 2.02M| } 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| 123k| { 581| 123k| auto tail_off = tail_offset(); 582| 123k| if (idx >= tail_off) { ------------------ | Branch (582:13): [True: 42.9k, False: 80.9k] ------------------ 583| 42.9k| auto tail_size = size - tail_off; 584| 42.9k| auto new_tail = 585| 42.9k| make_leaf_sub_pos(tail, tail_size) 586| 42.9k| .visit(update_visitor{}, idx - tail_off, fn); 587| 42.9k| return {size, shift, root->inc(), new_tail}; 588| 80.9k| } else { 589| 80.9k| auto new_root = visit_maybe_relaxed_sub( 590| 80.9k| root, shift, tail_off, update_visitor{}, idx, fn); 591| 80.9k| return {size, shift, new_root, tail->inc()}; 592| 80.9k| } 593| 123k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4takeEm: 647| 23.3k| { 648| 23.3k| auto tail_off = tail_offset(); 649| 23.3k| if (new_size == 0) { ------------------ | Branch (649:13): [True: 3.63k, False: 19.7k] ------------------ 650| 3.63k| return {}; 651| 19.7k| } else if (new_size >= size) { ------------------ | Branch (651:20): [True: 918, False: 18.8k] ------------------ 652| 918| return *this; 653| 18.8k| } else if (new_size > tail_off) { ------------------ | Branch (653:20): [True: 1.87k, False: 16.9k] ------------------ 654| 1.87k| auto new_tail = node_t::copy_leaf(tail, new_size - tail_off); 655| 1.87k| return {new_size, shift, root->inc(), new_tail}; 656| 16.9k| } else { 657| 16.9k| using std::get; 658| 16.9k| auto l = new_size - 1; 659| 16.9k| auto v = slice_right_visitor(); 660| 16.9k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l); 661| 16.9k| auto new_shift = get<0>(r); 662| 16.9k| auto new_root = get<1>(r); 663| 16.9k| auto new_tail = get<3>(r); 664| 16.9k| if (new_root) { ------------------ | Branch (664:17): [True: 12.6k, False: 4.28k] ------------------ 665| 12.6k| IMMER_ASSERT_TAGGED(new_root->compute_shift() == get<0>(r)); ------------------ | | 68| 12.6k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (665:17): [True: 12.6k, False: 0] ------------------ 666| 12.6k| assert(new_root->check(new_shift, new_size - get<2>(r))); ------------------ | Branch (666:17): [True: 12.6k, False: 0] ------------------ 667| 12.6k| return {new_size, new_shift, new_root, new_tail}; 668| 12.6k| } else { 669| 4.28k| return {new_size, BL, empty_root(), new_tail}; 670| 4.28k| } 671| 16.9k| } 672| 23.3k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2ERKSB_: 151| 9.85k| : rrbtree{other.size, other.shift, other.root, other.tail} 152| 9.85k| { 153| 9.85k| inc(); 154| 9.85k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE3incEv: 187| 9.85k| { 188| 9.85k| root->inc(); 189| 9.85k| tail->inc(); 190| 9.85k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4dropEm: 711| 25.1k| { 712| 25.1k| if (elems == 0) { ------------------ | Branch (712:13): [True: 2.38k, False: 22.7k] ------------------ 713| 2.38k| return *this; 714| 22.7k| } else if (elems >= size) { ------------------ | Branch (714:20): [True: 1.84k, False: 20.8k] ------------------ 715| 1.84k| return {}; 716| 20.8k| } else if (elems == tail_offset()) { ------------------ | Branch (716:20): [True: 1.62k, False: 19.2k] ------------------ 717| 1.62k| return {size - elems, BL, empty_root(), tail->inc()}; 718| 19.2k| } else if (elems > tail_offset()) { ------------------ | Branch (718:20): [True: 1.90k, False: 17.3k] ------------------ 719| 1.90k| auto tail_off = tail_offset(); 720| 1.90k| auto new_tail = 721| 1.90k| node_t::copy_leaf(tail, elems - tail_off, size - tail_off); 722| 1.90k| return {size - elems, BL, empty_root(), new_tail}; 723| 17.3k| } else { 724| 17.3k| using std::get; 725| 17.3k| auto v = slice_left_visitor(); 726| 17.3k| auto r = 727| 17.3k| visit_maybe_relaxed_sub(root, shift, tail_offset(), v, elems); 728| 17.3k| auto new_root = get<1>(r); 729| 17.3k| auto new_shift = get<0>(r); 730| 17.3k| return {size - elems, new_shift, new_root, tail->inc()}; 731| 17.3k| } 732| 25.1k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8max_sizeEv: 54| 2.14M| { 55| 2.14M| auto S = sizeof(size_t) * 8; 56| 2.14M| return ((size_t{1} << BL) - std::min(size_t{BL}, size_t{2})) * 57| 2.14M| ipow((size_t{1} << B) - 2, (S - BL) / B); 58| 2.14M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6concatERKSB_: 735| 905k| { 736| 905k| assert(r.size + size <= max_size()); ------------------ | Branch (736:9): [True: 905k, False: 0] ------------------ 737| 905k| using std::get; 738| 905k| if (size == 0) ------------------ | Branch (738:13): [True: 2.43k, False: 903k] ------------------ 739| 2.43k| return r; 740| 903k| else if (r.size == 0) ------------------ | Branch (740:18): [True: 1.71k, False: 901k] ------------------ 741| 1.71k| return *this; 742| 901k| else if (r.tail_offset() == 0) { ------------------ | Branch (742:18): [True: 463k, False: 437k] ------------------ 743| | // just concat the tail, similar to push_back 744| 463k| auto tail_offst = tail_offset(); 745| 463k| auto tail_size = size - tail_offst; 746| 463k| if (tail_size == branches) { ------------------ | Branch (746:17): [True: 131k, False: 331k] ------------------ 747| 131k| auto new_root = 748| 131k| push_tail(root, shift, tail_offst, tail, tail_size); 749| 131k| tail->inc(); 750| 131k| return {size + r.size, 751| 131k| get<0>(new_root), 752| 131k| get<1>(new_root), 753| 131k| r.tail->inc()}; 754| 331k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (754:24): [True: 9.55k, False: 322k] ------------------ 755| 9.55k| auto new_tail = 756| 9.55k| node_t::copy_leaf(tail, tail_size, r.tail, r.size); 757| 9.55k| return {size + r.size, shift, root->inc(), new_tail}; 758| 322k| } else { 759| 322k| auto remaining = branches - tail_size; 760| 322k| auto add_tail = 761| 322k| node_t::copy_leaf(tail, tail_size, r.tail, remaining); 762| 322k| IMMER_TRY { ------------------ | | 49| 322k|#define IMMER_TRY try ------------------ 763| 322k| auto new_tail = 764| 322k| node_t::copy_leaf(r.tail, remaining, r.size); 765| 322k| IMMER_TRY { ------------------ | | 49| 322k|#define IMMER_TRY try ------------------ 766| 322k| auto new_root = push_tail( 767| 322k| root, shift, tail_offst, add_tail, branches); 768| 322k| return {size + r.size, 769| 322k| get<0>(new_root), 770| 322k| get<1>(new_root), 771| 322k| new_tail}; 772| 322k| } 773| 322k| 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| 322k| } 778| 322k| IMMER_CATCH (...) { 779| 0| node_t::delete_leaf(add_tail, branches); 780| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 781| 0| } 782| 322k| } 783| 463k| } else if (tail_offset() == 0) { ------------------ | Branch (783:20): [True: 3.46k, False: 434k] ------------------ 784| 3.46k| auto tail_offst = tail_offset(); 785| 3.46k| auto tail_size = size - tail_offst; 786| 3.46k| auto concated = 787| 3.46k| concat_trees(tail, tail_size, r.root, r.shift, r.tail_offset()); 788| 3.46k| auto new_shift = concated.shift(); 789| 3.46k| auto new_root = concated.node(); 790| 3.46k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 3.46k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (790:13): [True: 3.46k, False: 0] ------------------ 791| 3.46k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (791:13): [True: 3.46k, False: 0] ------------------ 792| 3.46k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 793| 434k| } else { 794| 434k| auto tail_offst = tail_offset(); 795| 434k| auto tail_size = size - tail_offst; 796| 434k| auto concated = concat_trees(root, 797| 434k| shift, 798| 434k| tail_offst, 799| 434k| tail, 800| 434k| tail_size, 801| 434k| r.root, 802| 434k| r.shift, 803| 434k| r.tail_offset()); 804| 434k| auto new_shift = concated.shift(); 805| 434k| auto new_root = concated.node(); 806| 434k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 434k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (806:13): [True: 434k, False: 0] ------------------ 807| 434k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (807:13): [True: 434k, False: 0] ------------------ 808| 434k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 809| 434k| } 810| 905k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13push_back_mutENS9_5applyIS6_E4type4editEi: 478| 31.6k| { 479| 31.6k| auto ts = tail_size(); 480| 31.6k| if (ts < branches) { ------------------ | Branch (480:13): [True: 18.7k, False: 12.8k] ------------------ 481| 18.7k| ensure_mutable_tail(e, ts); 482| 18.7k| new (&tail->leaf()[ts]) T(std::move(value)); 483| 18.7k| } else { 484| 12.8k| using std::get; 485| 12.8k| auto new_tail = node_t::make_leaf_e(e, std::move(value)); 486| 12.8k| auto tail_off = tail_offset(); 487| 12.8k| IMMER_TRY { ------------------ | | 49| 12.8k|#define IMMER_TRY try ------------------ 488| 12.8k| push_tail_mut(e, tail_off, tail, ts); 489| 12.8k| tail = new_tail; 490| 12.8k| } 491| 12.8k| IMMER_CATCH (...) { 492| 0| node_t::delete_leaf(new_tail, 1u); 493| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 494| 0| } 495| 12.8k| } 496| 31.6k| ++size; 497| 31.6k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE19ensure_mutable_tailENS9_5applyIS6_E4type4editEj: 469| 176k| { 470| 176k| if (!tail->can_mutate(e)) { ------------------ | Branch (470:13): [True: 4.69k, False: 171k] ------------------ 471| 4.69k| auto new_tail = node_t::copy_leaf_e(e, tail, n); 472| 4.69k| dec_leaf(tail, n); 473| 4.69k| tail = new_tail; 474| 4.69k| } 475| 176k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13push_tail_mutENS9_5applyIS6_E4type4editEmPNS1_4nodeIiSA_Lj2ELj2EEEj: 417| 201k| { 418| 201k| if (auto r = root->relaxed()) { ------------------ | Branch (418:18): [True: 39.4k, False: 162k] ------------------ 419| 39.4k| auto new_root = 420| 39.4k| make_relaxed_pos(root, shift, r) 421| 39.4k| .visit(push_tail_mut_visitor{}, e, tail, tail_size); 422| 39.4k| if (new_root) { ------------------ | Branch (422:17): [True: 38.5k, False: 958] ------------------ 423| 38.5k| root = new_root; 424| 38.5k| } else { 425| 958| auto new_root = node_t::make_inner_r_e(e); 426| 958| IMMER_TRY { ------------------ | | 49| 958|#define IMMER_TRY try ------------------ 427| 958| auto new_path = node_t::make_path_e(e, shift, tail); 428| 958| new_root->inner()[0] = root; 429| 958| new_root->inner()[1] = new_path; 430| 958| new_root->relaxed()->d.sizes[0] = tail_off; 431| 958| new_root->relaxed()->d.sizes[1] = tail_off + tail_size; 432| 958| assert(tail_off); ------------------ | Branch (432:21): [True: 958, False: 0] ------------------ 433| 958| assert(tail_size); ------------------ | Branch (433:21): [True: 958, False: 0] ------------------ 434| 958| new_root->relaxed()->d.count = 2u; 435| 958| root = new_root; 436| 958| shift += B; 437| 958| } 438| 958| 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| 958| } 443| 162k| } else if (tail_off == size_t{branches} << shift) { ------------------ | Branch (443:20): [True: 2.44k, False: 159k] ------------------ 444| 2.44k| auto new_root = node_t::make_inner_e(e); 445| 2.44k| IMMER_TRY { ------------------ | | 49| 2.44k|#define IMMER_TRY try ------------------ 446| 2.44k| auto new_path = node_t::make_path_e(e, shift, tail); 447| 2.44k| new_root->inner()[0] = root; 448| 2.44k| new_root->inner()[1] = new_path; 449| 2.44k| root = new_root; 450| 2.44k| shift += B; 451| 2.44k| } 452| 2.44k| IMMER_CATCH (...) { 453| 0| node_t::delete_inner_e(new_root); 454| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 455| 0| } 456| 159k| } else if (tail_off) { ------------------ | Branch (456:20): [True: 157k, False: 2.49k] ------------------ 457| 157k| auto new_root = 458| 157k| make_regular_sub_pos(root, shift, tail_off) 459| 157k| .visit(push_tail_mut_visitor{}, e, tail); 460| 157k| root = new_root; 461| 157k| } else { 462| 2.49k| auto new_root = node_t::make_path_e(e, shift, tail); 463| 2.49k| dec_empty_regular(root); 464| 2.49k| root = new_root; 465| 2.49k| } 466| 201k| } 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| 41.3k| { 574| 41.3k| auto& elem = get_mut(e, idx); 575| 41.3k| elem = std::forward(fn)(std::move(elem)); 576| 41.3k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7get_mutENS9_5applyIS6_E4type4editEm: 539| 41.3k| { 540| 41.3k| auto tail_off = tail_offset(); 541| 41.3k| if (idx >= tail_off) { ------------------ | Branch (541:13): [True: 18.7k, False: 22.6k] ------------------ 542| 18.7k| ensure_mutable_tail(e, size - tail_off); 543| 18.7k| return tail->leaf()[(idx - tail_off) & mask]; 544| 22.6k| } else { 545| 22.6k| return visit_maybe_relaxed_sub(root, 546| 22.6k| shift, 547| 22.6k| tail_off, 548| 22.6k| get_mut_visitor{}, 549| 22.6k| idx, 550| 22.6k| e, 551| 22.6k| &root); 552| 22.6k| } 553| 41.3k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8take_mutENS9_5applyIS6_E4type4editEm: 606| 39.2k| { 607| 39.2k| auto tail_off = tail_offset(); 608| 39.2k| if (new_size == 0) { ------------------ | Branch (608:13): [True: 654, False: 38.5k] ------------------ 609| 654| *this = {}; 610| 38.5k| } else if (new_size >= size) { ------------------ | Branch (610:20): [True: 1.14k, False: 37.4k] ------------------ 611| 1.14k| return; 612| 37.4k| } else if (new_size > tail_off) { ------------------ | Branch (612:20): [True: 734, False: 36.6k] ------------------ 613| 734| auto ts = size - tail_off; 614| 734| auto newts = new_size - tail_off; 615| 734| if (tail->can_mutate(e)) { ------------------ | Branch (615:17): [True: 433, False: 301] ------------------ 616| 433| detail::destroy_n(tail->leaf() + newts, ts - newts); 617| 433| } else { 618| 301| auto new_tail = node_t::copy_leaf_e(e, tail, newts); 619| 301| dec_leaf(tail, ts); 620| 301| tail = new_tail; 621| 301| } 622| 734| size = new_size; 623| 734| return; 624| 36.6k| } else { 625| 36.6k| using std::get; 626| 36.6k| auto l = new_size - 1; 627| 36.6k| auto v = slice_right_mut_visitor(); 628| 36.6k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l, e); 629| 36.6k| auto new_shift = get<0>(r); 630| 36.6k| auto new_root = get<1>(r); 631| 36.6k| auto new_tail = get<3>(r); 632| 36.6k| if (new_root) { ------------------ | Branch (632:17): [True: 30.6k, False: 6.00k] ------------------ 633| 30.6k| root = new_root; 634| 30.6k| shift = new_shift; 635| 30.6k| } else { 636| 6.00k| root = empty_root(); 637| 6.00k| shift = BL; 638| 6.00k| } 639| 36.6k| dec_leaf(tail, size - tail_off); 640| 36.6k| size = new_size; 641| 36.6k| tail = new_tail; 642| 36.6k| return; 643| 36.6k| } 644| 39.2k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8drop_mutENS9_5applyIS6_E4type4editEm: 675| 44.2k| { 676| 44.2k| using std::get; 677| 44.2k| auto tail_off = tail_offset(); 678| 44.2k| if (elems == 0) { ------------------ | Branch (678:13): [True: 2.30k, False: 41.9k] ------------------ 679| 2.30k| return; 680| 41.9k| } else if (elems >= size) { ------------------ | Branch (680:20): [True: 283, False: 41.6k] ------------------ 681| 283| *this = {}; 682| 41.6k| } else if (elems == tail_off) { ------------------ | Branch (682:20): [True: 271, False: 41.4k] ------------------ 683| 271| dec_inner(root, shift, tail_off); 684| 271| shift = BL; 685| 271| root = empty_root(); 686| 271| size -= elems; 687| 271| return; 688| 41.4k| } else if (elems > tail_off) { ------------------ | Branch (688:20): [True: 774, False: 40.6k] ------------------ 689| 774| auto v = slice_left_mut_visitor(); 690| 774| tail = get<1>(make_leaf_sub_pos(tail, size - tail_off) 691| 774| .visit(v, elems - tail_off, e)); 692| 774| if (tail_off) { ------------------ | Branch (692:17): [True: 342, False: 432] ------------------ 693| 342| dec_inner(root, shift, tail_off); 694| 342| shift = BL; 695| 342| root = empty_root(); 696| 342| } 697| 774| size -= elems; 698| 774| return; 699| 40.6k| } else { 700| 40.6k| auto v = slice_left_mut_visitor(); 701| 40.6k| auto r = 702| 40.6k| visit_maybe_relaxed_sub(root, shift, tail_off, v, elems, e); 703| 40.6k| shift = get<0>(r); 704| 40.6k| root = get<1>(r); 705| 40.6k| size -= elems; 706| 40.6k| return; 707| 40.6k| } 708| 44.2k| } _ZN5immer6detail4rbts12concat_mut_lERNS1_7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS9_5applyIS6_E4type4editERKSB_: 816| 264k| { 817| 264k| assert(&l != &r); ------------------ | Branch (817:9): [True: 264k, False: 0] ------------------ 818| 264k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (818:9): [True: 264k, False: 0] ------------------ 819| 264k| using std::get; 820| 264k| if (l.size == 0) ------------------ | Branch (820:13): [True: 635, False: 263k] ------------------ 821| 635| l = r; 822| 263k| else if (r.size == 0) ------------------ | Branch (822:18): [True: 542, False: 263k] ------------------ 823| 542| return; 824| 263k| else if (r.tail_offset() == 0) { ------------------ | Branch (824:18): [True: 186k, False: 76.6k] ------------------ 825| | // just concat the tail, similar to push_back 826| 186k| auto tail_offst = l.tail_offset(); 827| 186k| auto tail_size = l.size - tail_offst; 828| 186k| if (tail_size == branches) { ------------------ | Branch (828:17): [True: 51.3k, False: 135k] ------------------ 829| 51.3k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 830| 51.3k| l.tail = r.tail->inc(); 831| 51.3k| l.size += r.size; 832| 51.3k| return; 833| 135k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (833:24): [True: 969, False: 134k] ------------------ 834| 969| l.ensure_mutable_tail(el, tail_size); 835| 969| detail::uninitialized_copy(r.tail->leaf(), 836| 969| r.tail->leaf() + r.size, 837| 969| l.tail->leaf() + tail_size); 838| 969| l.size += r.size; 839| 969| return; 840| 134k| } else { 841| 134k| auto remaining = branches - tail_size; 842| 134k| l.ensure_mutable_tail(el, tail_size); 843| 134k| detail::uninitialized_copy(r.tail->leaf(), 844| 134k| r.tail->leaf() + remaining, 845| 134k| l.tail->leaf() + tail_size); 846| 134k| IMMER_TRY { ------------------ | | 49| 134k|#define IMMER_TRY try ------------------ 847| 134k| auto new_tail = 848| 134k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 849| 134k| IMMER_TRY { ------------------ | | 49| 134k|#define IMMER_TRY try ------------------ 850| 134k| l.push_tail_mut(el, tail_offst, l.tail, branches); 851| 134k| l.tail = new_tail; 852| 134k| l.size += r.size; 853| 134k| return; 854| 134k| } 855| 134k| 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| 134k| } 860| 134k| 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| 134k| } 865| 186k| } else if (l.tail_offset() == 0) { ------------------ | Branch (865:20): [True: 465, False: 76.2k] ------------------ 866| 465| if (supports_transient_concat) { ------------------ | Branch (866:17): [Folded, False: 465] ------------------ 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| 465| } else { 886| 465| auto tail_offst = l.tail_offset(); 887| 465| auto tail_size = l.size - tail_offst; 888| 465| auto concated = concat_trees( 889| 465| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 890| 465| l = {l.size + r.size, 891| 465| concated.shift(), 892| 465| concated.node(), 893| 465| r.tail->inc()}; 894| 465| assert(l.check_tree()); ------------------ | Branch (894:17): [True: 465, False: 0] ------------------ 895| 465| return; 896| 465| } 897| 76.2k| } else { 898| 76.2k| if (supports_transient_concat) { ------------------ | Branch (898:17): [Folded, False: 76.2k] ------------------ 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| 76.2k| } else { 923| 76.2k| auto tail_offst = l.tail_offset(); 924| 76.2k| auto tail_size = l.size - tail_offst; 925| 76.2k| auto concated = concat_trees(l.root, 926| 76.2k| l.shift, 927| 76.2k| tail_offst, 928| 76.2k| l.tail, 929| 76.2k| tail_size, 930| 76.2k| r.root, 931| 76.2k| r.shift, 932| 76.2k| r.tail_offset()); 933| 76.2k| l = {l.size + r.size, 934| 76.2k| concated.shift(), 935| 76.2k| concated.node(), 936| 76.2k| r.tail->inc()}; 937| 76.2k| } 938| 76.2k| } 939| 264k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEaSERKSB_: 163| 2.39k| { 164| 2.39k| auto next{other}; 165| 2.39k| swap(*this, next); 166| 2.39k| return *this; 167| 2.39k| } _ZN5immer6detail4rbts12concat_mut_rERKNS1_7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERSB_NS9_5applyIS6_E4type4editE: 942| 5.28k| { 943| 5.28k| assert(&l != &r); ------------------ | Branch (943:9): [True: 5.28k, False: 0] ------------------ 944| 5.28k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (944:9): [True: 5.28k, False: 0] ------------------ 945| 5.28k| using std::get; 946| 5.28k| if (r.size == 0) ------------------ | Branch (946:13): [True: 302, False: 4.98k] ------------------ 947| 302| r = std::move(l); 948| 4.98k| else if (l.size == 0) ------------------ | Branch (948:18): [True: 260, False: 4.72k] ------------------ 949| 260| return; 950| 4.72k| else if (r.tail_offset() == 0) { ------------------ | Branch (950:18): [True: 1.15k, False: 3.56k] ------------------ 951| | // just concat the tail, similar to push_back 952| 1.15k| auto tail_offst = l.tail_offset(); 953| 1.15k| auto tail_size = l.size - tail_offst; 954| 1.15k| if (tail_size == branches) { ------------------ | Branch (954:17): [True: 328, False: 825] ------------------ 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| 328| auto res = 959| 328| l.push_tail(l.root, l.shift, tail_offst, l.tail, tail_size); 960| 328| l.tail->inc(); // note: leak if mutably concatenated 961| | // with itself, but this is forbidden 962| | // by the interface 963| 328| r = {l.size + r.size, get<0>(res), get<1>(res), r.tail->inc()}; 964| 328| return; 965| 825| } else if (tail_size + r.size <= branches) { ------------------ | Branch (965:24): [True: 557, False: 268] ------------------ 966| | // doing this in a exception way mutating way is very 967| | // tricky while potential performance gains are 968| | // minimal (we need to move every element of the right 969| | // tail anyways to make space for the left tail) 970| | // 971| | // we could however improve this by at least moving the 972| | // elements of the right tail... 973| 557| auto new_tail = 974| 557| node_t::copy_leaf(l.tail, tail_size, r.tail, r.size); 975| 557| r = {l.size + r.size, l.shift, l.root->inc(), new_tail}; 976| 557| return; 977| 557| } else { 978| | // like the immutable version 979| 268| auto remaining = branches - tail_size; 980| 268| auto add_tail = node_t::copy_leaf_e( 981| 268| er, l.tail, tail_size, r.tail, remaining); 982| 268| IMMER_TRY { ------------------ | | 49| 268|#define IMMER_TRY try ------------------ 983| 268| auto new_tail = 984| 268| node_t::copy_leaf_e(er, r.tail, remaining, r.size); 985| 268| IMMER_TRY { ------------------ | | 49| 268|#define IMMER_TRY try ------------------ 986| | // this could be improved by making sure that the 987| | // newly created nodes as part of the `push_tail()` 988| | // are tagged with `er` 989| 268| auto new_root = l.push_tail(l.root, 990| 268| l.shift, 991| 268| tail_offst, 992| 268| add_tail, 993| 268| branches); 994| 268| r = {l.size + r.size, 995| 268| get<0>(new_root), 996| 268| get<1>(new_root), 997| 268| new_tail}; 998| 268| return; 999| 268| } 1000| 268| IMMER_CATCH (...) { 1001| 0| node_t::delete_leaf(new_tail, r.size - remaining); 1002| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1003| 0| } 1004| 268| } 1005| 268| IMMER_CATCH (...) { 1006| 0| node_t::delete_leaf(add_tail, branches); 1007| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1008| 0| } 1009| 268| } 1010| 3.56k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1010:20): [True: 647, False: 2.92k] ------------------ 1011| 647| if (supports_transient_concat) { ------------------ | Branch (1011:17): [Folded, False: 647] ------------------ 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| 647| } else { 1030| 647| auto tail_offst = l.tail_offset(); 1031| 647| auto tail_size = l.size - tail_offst; 1032| 647| auto concated = concat_trees( 1033| 647| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1034| 647| r = {l.size + r.size, 1035| 647| concated.shift(), 1036| 647| concated.node(), 1037| 647| r.tail->inc()}; 1038| 647| return; 1039| 647| } 1040| 2.92k| } else { 1041| 2.92k| if (supports_transient_concat) { ------------------ | Branch (1041:17): [Folded, False: 2.92k] ------------------ 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| 2.92k| } else { 1064| 2.92k| auto tail_offst = l.tail_offset(); 1065| 2.92k| auto tail_size = l.size - tail_offst; 1066| 2.92k| auto concated = concat_trees(l.root, 1067| 2.92k| l.shift, 1068| 2.92k| tail_offst, 1069| 2.92k| l.tail, 1070| 2.92k| tail_size, 1071| 2.92k| r.root, 1072| 2.92k| r.shift, 1073| 2.92k| r.tail_offset()); 1074| 2.92k| r = {l.size + r.size, 1075| 2.92k| concated.shift(), 1076| 2.92k| concated.node(), 1077| 2.92k| r.tail->inc()}; 1078| 2.92k| return; 1079| 2.92k| } 1080| 2.92k| } 1081| 5.28k| } _ZN5immer6detail4rbts15concat_mut_lr_lERNS1_7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS9_5applyIS6_E4type4editESC_SG_: 1084| 23.8k| { 1085| 23.8k| assert(&l != &r); ------------------ | Branch (1085:9): [True: 23.8k, False: 0] ------------------ 1086| 23.8k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (1086:9): [True: 23.8k, False: 0] ------------------ 1087| 23.8k| using std::get; 1088| 23.8k| if (l.size == 0) ------------------ | Branch (1088:13): [True: 1.45k, False: 22.4k] ------------------ 1089| 1.45k| l = r; 1090| 22.4k| else if (r.size == 0) ------------------ | Branch (1090:18): [True: 1.07k, False: 21.3k] ------------------ 1091| 1.07k| return; 1092| 21.3k| else if (r.tail_offset() == 0) { ------------------ | Branch (1092:18): [True: 5.01k, False: 16.3k] ------------------ 1093| | // just concat the tail, similar to push_back 1094| 5.01k| auto tail_offst = l.tail_offset(); 1095| 5.01k| auto tail_size = l.size - tail_offst; 1096| 5.01k| if (tail_size == branches) { ------------------ | Branch (1096:17): [True: 983, False: 4.03k] ------------------ 1097| 983| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 1098| 983| l.tail = r.tail->inc(); 1099| 983| l.size += r.size; 1100| 983| return; 1101| 4.03k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (1101:24): [True: 1.75k, False: 2.27k] ------------------ 1102| 1.75k| l.ensure_mutable_tail(el, tail_size); 1103| 1.75k| if (r.tail->can_mutate(er)) ------------------ | Branch (1103:21): [True: 636, False: 1.11k] ------------------ 1104| 636| detail::uninitialized_move(r.tail->leaf(), 1105| 636| r.tail->leaf() + r.size, 1106| 636| l.tail->leaf() + tail_size); 1107| 1.11k| else 1108| 1.11k| detail::uninitialized_copy(r.tail->leaf(), 1109| 1.11k| r.tail->leaf() + r.size, 1110| 1.11k| l.tail->leaf() + tail_size); 1111| 1.75k| l.size += r.size; 1112| 1.75k| return; 1113| 2.27k| } else { 1114| 2.27k| auto remaining = branches - tail_size; 1115| 2.27k| l.ensure_mutable_tail(el, tail_size); 1116| 2.27k| if (r.tail->can_mutate(er)) ------------------ | Branch (1116:21): [True: 941, False: 1.33k] ------------------ 1117| 941| detail::uninitialized_move(r.tail->leaf(), 1118| 941| r.tail->leaf() + remaining, 1119| 941| l.tail->leaf() + tail_size); 1120| 1.33k| else 1121| 1.33k| detail::uninitialized_copy(r.tail->leaf(), 1122| 1.33k| r.tail->leaf() + remaining, 1123| 1.33k| l.tail->leaf() + tail_size); 1124| 2.27k| IMMER_TRY { ------------------ | | 49| 2.27k|#define IMMER_TRY try ------------------ 1125| 2.27k| auto new_tail = 1126| 2.27k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 1127| 2.27k| IMMER_TRY { ------------------ | | 49| 2.27k|#define IMMER_TRY try ------------------ 1128| 2.27k| l.push_tail_mut(el, tail_offst, l.tail, branches); 1129| 2.27k| l.tail = new_tail; 1130| 2.27k| l.size += r.size; 1131| 2.27k| return; 1132| 2.27k| } 1133| 2.27k| IMMER_CATCH (...) { 1134| 0| node_t::delete_leaf(new_tail, r.size - remaining); 1135| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1136| 0| } 1137| 2.27k| } 1138| 2.27k| IMMER_CATCH (...) { 1139| 0| detail::destroy_n(r.tail->leaf() + tail_size, remaining); 1140| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1141| 0| } 1142| 2.27k| } 1143| 16.3k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1143:20): [True: 3.38k, False: 12.9k] ------------------ 1144| 3.38k| if (supports_transient_concat) { ------------------ | Branch (1144:17): [Folded, False: 3.38k] ------------------ 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.38k| } else { 1165| 3.38k| auto tail_offst = l.tail_offset(); 1166| 3.38k| auto tail_size = l.size - tail_offst; 1167| 3.38k| auto concated = concat_trees( 1168| 3.38k| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1169| 3.38k| l = {l.size + r.size, 1170| 3.38k| concated.shift(), 1171| 3.38k| concated.node(), 1172| 3.38k| r.tail->inc()}; 1173| 3.38k| return; 1174| 3.38k| } 1175| 12.9k| } else { 1176| 12.9k| if (supports_transient_concat) { ------------------ | Branch (1176:17): [Folded, False: 12.9k] ------------------ 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| 12.9k| } else { 1200| 12.9k| auto tail_offst = l.tail_offset(); 1201| 12.9k| auto tail_size = l.size - tail_offst; 1202| 12.9k| auto concated = concat_trees(l.root, 1203| 12.9k| l.shift, 1204| 12.9k| tail_offst, 1205| 12.9k| l.tail, 1206| 12.9k| tail_size, 1207| 12.9k| r.root, 1208| 12.9k| r.shift, 1209| 12.9k| r.tail_offset()); 1210| 12.9k| l = {l.size + r.size, 1211| 12.9k| concated.shift(), 1212| 12.9k| concated.node(), 1213| 12.9k| r.tail->inc()}; 1214| 12.9k| return; 1215| 12.9k| } 1216| 12.9k| } 1217| 23.8k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6equalsERKSB_: 315| 29.2k| { 316| 29.2k| using iter_t = rrbtree_iterator; 317| 29.2k| if (size != other.size) ------------------ | Branch (317:13): [True: 9.85k, False: 19.4k] ------------------ 318| 9.85k| return false; 319| 19.4k| if (size == 0) ------------------ | Branch (319:13): [True: 215, False: 19.2k] ------------------ 320| 215| return true; 321| 19.2k| auto tail_off = tail_offset(); 322| 19.2k| auto tail_off_other = other.tail_offset(); 323| | // compare trees 324| 19.2k| if (tail_off > 0 && tail_off_other > 0) { ------------------ | Branch (324:13): [True: 18.2k, False: 940] | Branch (324:29): [True: 18.0k, False: 195] ------------------ 325| | // other.shift != shift is a theoretical possibility for 326| | // relaxed trees that sadly we haven't managed to exercise 327| | // in tests yet... 328| 18.0k| if (other.shift >= shift) { ------------------ | Branch (328:17): [True: 17.3k, False: 764] ------------------ 329| 17.3k| if (!visit_maybe_relaxed_sub(other.root, ------------------ | Branch (329:21): [True: 8.10k, False: 9.21k] ------------------ 330| 17.3k| other.shift, 331| 17.3k| tail_off_other, 332| 17.3k| equals_visitor::rrb{}, 333| 17.3k| iter_t{other}, 334| 17.3k| root, 335| 17.3k| shift, 336| 17.3k| tail_off)) 337| 8.10k| return false; 338| 17.3k| } else { 339| 764| if (!visit_maybe_relaxed_sub(root, ------------------ | Branch (339:21): [True: 413, False: 351] ------------------ 340| 764| shift, 341| 764| tail_off, 342| 764| equals_visitor::rrb{}, 343| 764| iter_t{*this}, 344| 764| other.root, 345| 764| other.shift, 346| 764| tail_off_other)) 347| 413| return false; 348| 764| } 349| 18.0k| } 350| 10.7k| return tail_off == tail_off_other ------------------ | Branch (350:16): [True: 6.77k, False: 3.93k] ------------------ 351| 10.7k| ? make_leaf_sub_pos(tail, tail_size()) 352| 6.77k| .visit(equals_visitor{}, other.tail) 353| 10.7k| : tail_off > tail_off_other ------------------ | Branch (353:18): [True: 1.62k, False: 2.31k] ------------------ 354| 3.93k| ? std::equal(tail->leaf(), 355| 1.62k| tail->leaf() + (size - tail_off), 356| 1.62k| other.tail->leaf() + 357| 1.62k| (tail_off - tail_off_other)) 358| | /* otherwise */ 359| 3.93k| : std::equal(tail->leaf(), 360| 2.31k| tail->leaf() + (size - tail_off), 361| 2.31k| iter_t{other} + tail_off); 362| 19.2k| } _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.04k, False: 1.38M] ------------------ 528| 4.04k| 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.55M| { 91| 5.55M| using std::get; 92| 5.55M| if (i_ < get<1>(curr_) || i_ >= get<2>(curr_)) ------------------ | Branch (92:13): [True: 38.8k, False: 5.51M] | Branch (92:35): [True: 1.34M, False: 4.17M] ------------------ 93| 1.38M| curr_ = v_->region_for(i_); 94| 5.55M| return get<0>(curr_)[i_ - get<1>(curr_)]; 95| 5.55M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7advanceEl: 74| 233k| { 75| 233k| using std::get; 76| 233k| assert(n <= 0 || i_ + static_cast(n) <= v_->size); ------------------ | Branch (76:9): [True: 445, False: 233k] | Branch (76:9): [True: 233k, False: 0] | Branch (76:9): [True: 233k, False: 0] ------------------ 77| 233k| assert(n >= 0 || static_cast(-n) <= i_); ------------------ | Branch (77:9): [True: 233k, False: 0] | Branch (77:9): [True: 0, False: 0] | Branch (77:9): [True: 233k, False: 0] ------------------ 78| 233k| i_ += n; 79| 233k| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9incrementEv: 60| 4.19M| { 61| 4.19M| using std::get; 62| 4.19M| assert(i_ < v_->size); ------------------ | Branch (62:9): [True: 4.19M, False: 0] ------------------ 63| 4.19M| ++i_; 64| 4.19M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2ERKNS1_7rrbtreeIiSA_Lj2ELj2EEE: 39| 20.3k| : v_{&v} 40| 20.3k| , i_{0} 41| 20.3k| , curr_{nullptr, ~size_t{}, ~size_t{}} 42| 20.3k| { 43| 20.3k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERmEEEDcDpOT_: 31| 15.2k| { 32| 15.2k| return Deriv::visit_inner(std::forward(args)...); 33| 15.2k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERmEEEDcDpOT_: 31| 49.6k| { 32| 49.6k| return Deriv::visit_inner(std::forward(args)...); 33| 49.6k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EEEE13visit_regularIJRNS1_15regular_sub_posISD_EERmEEEDcDpOT_: 37| 2.14k| { 38| 2.14k| return Deriv::visit_inner(std::forward(args)...); 39| 2.14k| } _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.26k| { 38| 5.26k| return Deriv::visit_inner(std::forward(args)...); 39| 5.26k| } _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| 6.69k| { 38| 6.69k| return Deriv::visit_inner(std::forward(args)...); 39| 6.69k| } _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.56k| { 38| 1.56k| return Deriv::visit_inner(std::forward(args)...); 39| 1.56k| } _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.36k| { 38| 2.36k| return Deriv::visit_inner(std::forward(args)...); 39| 2.36k| } _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| 7.96k| { 38| 7.96k| return Deriv::visit_inner(std::forward(args)...); 39| 7.96k| } _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| 7.96k| { 44| 7.96k| return Deriv::visit_node(std::forward(args)...); 45| 7.96k| } _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.58k| { 32| 5.58k| return Deriv::visit_inner(std::forward(args)...); 33| 5.58k| } _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.58k| { 44| 5.58k| return Deriv::visit_node(std::forward(args)...); 45| 5.58k| } _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.55M| { 50| 2.55M| return Deriv::visit_node(std::forward(args)...); 51| 2.55M| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_21concat_rebalance_planILj2ELj2EEEEEEDcDpOT_: 31| 21.4M| { 32| 21.4M| return Deriv::visit_inner(std::forward(args)...); 33| 21.4M| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE11visit_innerIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_21concat_rebalance_planILj2ELj2EEEEEEDcDpOT_: 43| 21.4M| { 44| 21.4M| return Deriv::visit_node(std::forward(args)...); 45| 21.4M| } _ZN5immer6detail4rbts12visitor_baseINS1_21concat_merger_visitorEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_13concat_mergerISG_EEEEEDcDpOT_: 31| 21.4M| { 32| 21.4M| return Deriv::visit_inner(std::forward(args)...); 33| 21.4M| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 31| 17.4k| { 32| 17.4k| return Deriv::visit_inner(std::forward(args)...); 33| 17.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| 382| { 38| 382| return Deriv::visit_inner(std::forward(args)...); 39| 382| } _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.13k| { 38| 1.13k| return Deriv::visit_inner(std::forward(args)...); 39| 1.13k| } _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.02M| { 50| 1.02M| return Deriv::visit_node(std::forward(args)...); 51| 1.02M| } _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| 717k| { 38| 717k| return Deriv::visit_inner(std::forward(args)...); 39| 717k| } _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| 717k| { 44| 717k| return Deriv::visit_node(std::forward(args)...); 45| 717k| } _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| 717k| { 38| 717k| return Deriv::visit_inner(std::forward(args)...); 39| 717k| } _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| 645k| { 38| 645k| return Deriv::visit_inner(std::forward(args)...); 39| 645k| } _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| 645k| { 44| 645k| return Deriv::visit_node(std::forward(args)...); 45| 645k| } _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| 645k| { 38| 645k| return Deriv::visit_inner(std::forward(args)...); 39| 645k| } _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.37k| { 38| 2.37k| return Deriv::visit_inner(std::forward(args)...); 39| 2.37k| } _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.37k| { 44| 2.37k| return Deriv::visit_node(std::forward(args)...); 45| 2.37k| } _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| 512k| { 32| 512k| return Deriv::visit_inner(std::forward(args)...); 33| 512k| } _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| 512k| { 44| 512k| return Deriv::visit_node(std::forward(args)...); 45| 512k| } _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| 488k| { 32| 488k| return Deriv::visit_inner(std::forward(args)...); 33| 488k| } _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| 488k| { 44| 488k| return Deriv::visit_node(std::forward(args)...); 45| 488k| } _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.25M| { 32| 2.25M| return Deriv::visit_inner(std::forward(args)...); 33| 2.25M| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EERNS1_11relaxed_posISD_EEEEEDcDpOT_: 37| 5.95k| { 38| 5.95k| return Deriv::visit_inner(std::forward(args)...); 39| 5.95k| } _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| 648k| { 32| 648k| return Deriv::visit_inner(std::forward(args)...); 33| 648k| } _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| 100k| { 38| 100k| return Deriv::visit_inner(std::forward(args)...); 39| 100k| } _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.12k| { 38| 1.12k| return Deriv::visit_inner(std::forward(args)...); 39| 1.12k| } _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| 121k| { 38| 121k| return Deriv::visit_inner(std::forward(args)...); 39| 121k| } _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| 59.6k| { 38| 59.6k| return Deriv::visit_inner(std::forward(args)...); 39| 59.6k| } _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| 61.3k| { 38| 61.3k| return Deriv::visit_inner(std::forward(args)...); 39| 61.3k| } _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| 738k| { 38| 738k| return Deriv::visit_inner(std::forward(args)...); 39| 738k| } _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.91M| { 32| 1.91M| return Deriv::visit_inner(std::forward(args)...); 33| 1.91M| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 4.38k| { 38| 4.38k| return Deriv::visit_inner(std::forward(args)...); 39| 4.38k| } _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| 116k| { 32| 116k| return Deriv::visit_inner(std::forward(args)...); 33| 116k| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_8full_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 6.74k| { 38| 6.74k| return Deriv::visit_inner(std::forward(args)...); 39| 6.74k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EERNS1_8full_posISD_EEEEEDcDpOT_: 31| 2.22k| { 32| 2.22k| return Deriv::visit_inner(std::forward(args)...); 33| 2.22k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EERNS1_15regular_sub_posISD_EEEEEDcDpOT_: 31| 3.54k| { 32| 3.54k| return Deriv::visit_inner(std::forward(args)...); 33| 3.54k| } _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.82M| { 32| 1.82M| return Deriv::visit_inner(std::forward(args)...); 33| 1.82M| } _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| 23.4k| { 38| 23.4k| return Deriv::visit_inner(std::forward(args)...); 39| 23.4k| } _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| 23.4k| { 44| 23.4k| return Deriv::visit_node(std::forward(args)...); 45| 23.4k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 37| 14.1k| { 38| 14.1k| return Deriv::visit_inner(std::forward(args)...); 39| 14.1k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 43| 14.1k| { 44| 14.1k| return Deriv::visit_node(std::forward(args)...); 45| 14.1k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 31| 6.26k| { 32| 6.26k| return Deriv::visit_inner(std::forward(args)...); 33| 6.26k| } _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.26k| { 44| 6.26k| return Deriv::visit_node(std::forward(args)...); 45| 6.26k| } _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.90k| { 38| 7.90k| return Deriv::visit_inner(std::forward(args)...); 39| 7.90k| } _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.90k| { 44| 7.90k| return Deriv::visit_node(std::forward(args)...); 45| 7.90k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERKPSH_RKjRmEEEDcDpOT_: 31| 11.2k| { 32| 11.2k| return Deriv::visit_inner(std::forward(args)...); 33| 11.2k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE11visit_innerIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERKPSH_RKjRmEEEDcDpOT_: 43| 11.2k| { 44| 11.2k| return Deriv::visit_node(std::forward(args)...); 45| 11.2k| } _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| 21.5k| { 32| 21.5k| return Deriv::visit_inner(std::forward(args)...); 33| 21.5k| } _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.25k| { 32| 2.25k| return Deriv::visit_inner(std::forward(args)...); 33| 2.25k| } _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| 876| { 32| 876| return Deriv::visit_inner(std::forward(args)...); 33| 876| } _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.17M| { 32| 9.17M| return Deriv::visit_inner(std::forward(args)...); 33| 9.17M| } _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| 371k| { 38| 371k| return Deriv::visit_inner(std::forward(args)...); 39| 371k| } _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| 998k| { 38| 998k| return Deriv::visit_inner(std::forward(args)...); 39| 998k| } _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| 108k| { 38| 108k| return Deriv::visit_inner(std::forward(args)...); 39| 108k| } _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| 92.8k| { 38| 92.8k| return Deriv::visit_inner(std::forward(args)...); 39| 92.8k| } _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| 756| { 38| 756| return Deriv::visit_inner(std::forward(args)...); 39| 756| } _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| 19.9k| { 38| 19.9k| return Deriv::visit_inner(std::forward(args)...); 39| 19.9k| } _ZN5immer6detail4rbts12visitor_baseINS1_24for_each_chunk_p_visitorEE13visit_regularIJRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSF_Lj2ELj2EEEEEDaOT_EUlSN_T0_E_EEEDcDpOT_: 37| 6.44k| { 38| 6.44k| return Deriv::visit_inner(std::forward(args)...); 39| 6.44k| } _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.58k| { 38| 2.58k| return Deriv::visit_inner(std::forward(args)...); 39| 2.58k| } _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.80k| { 38| 2.80k| return Deriv::visit_inner(std::forward(args)...); 39| 2.80k| } _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| 575k| { 32| 575k| return Deriv::visit_inner(std::forward(args)...); 33| 575k| } _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.44k| { 32| 1.44k| return Deriv::visit_inner(std::forward(args)...); 33| 1.44k| } _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.44k| { 44| 1.44k| return Deriv::visit_node(std::forward(args)...); 45| 1.44k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERKPSH_RKjRmEEEDcDpOT_: 37| 6.81k| { 38| 6.81k| return Deriv::visit_inner(std::forward(args)...); 39| 6.81k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE11visit_innerIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERKPSH_RKjRmEEEDcDpOT_: 43| 6.81k| { 44| 6.81k| return Deriv::visit_node(std::forward(args)...); 45| 6.81k| } _ZN5immer6detail15auto_const_castINS_15refcount_policyEEERT_RKS3_: 143| 120M|{ 144| 120M| return const_cast(x); 145| 120M|} _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| 12.0M|{ 330| 12.0M| std::forward(f)(empty_t{}); 331| 12.0M|} _ZN5immer6detail9destroy_nIPijEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 1.50M|{ 189| 1.50M| return first + n; 190| 1.50M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6leaf_tEiLb1EE15get_storage_ptrEv: 75| 10.6M| { 76| 10.6M| check_base(); 77| 10.6M| return reinterpret_cast(this); 78| 10.6M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6leaf_tEiLb1EE10check_baseEv: 94| 10.6M| { 95| | // is_standard_layout requires that only one class in the hierarchy 96| | // contains non-static data members. Since this class contains one 97| | // member, the static_assert will only hold when the derived class is 98| | // empty. 99| 10.6M| static_assert(std::is_standard_layout::value, 100| 10.6M| "Please remove 'true' if the derived class is non emtpy"); 101| 10.6M| } _ZN5immer6detail18uninitialized_copyIPiS2_S2_EENSt3__19enable_ifIX18can_trivially_copyIT_T1_EES6_E4typeES5_T0_S6_: 236| 1.85M|{ 237| 1.85M| return std::copy(first, last, out); 238| 1.85M|} _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| 279k|{ 345| 279k| return std::forward(f2)(empty_t{}); 346| 279k|} _ZN5immer6detail4ipowImEET_S2_j: 323| 68.7M|{ 324| 68.7M| return pow == 0 ? 1 : num * ipow(num, pow - 1); ------------------ | Branch (324:12): [True: 2.14M, False: 66.6M] ------------------ 325| 68.7M|} _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| 62.9k|{ 345| 62.9k| return std::forward(f2)(empty_t{}); 346| 62.9k|} _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| 116k|{ 330| 116k| std::forward(f)(empty_t{}); 331| 116k|} _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.60k|{ 345| 9.60k| return std::forward(f2)(empty_t{}); 346| 9.60k|} _ZN5immer6detail9destroy_nIPimEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 433|{ 189| 433| return first + n; 190| 433|} _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| 166k|{ 345| 166k| return std::forward(f2)(empty_t{}); 346| 166k|} _ZN5immer6detail18uninitialized_moveIPiS2_EENSt3__19enable_ifIX18can_trivially_copyIT_T0_EES6_E4typeES5_S5_S6_: 210| 1.57k|{ 211| 1.57k| return std::copy(first, last, out); 212| 1.57k|} _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| 18.6k|{ 261| 18.6k| auto ptr = Heap::allocate(sizeof(T)); 262| 18.6k| IMMER_TRY { ------------------ | | 49| 18.6k|#define IMMER_TRY try ------------------ 263| 18.6k| return new (ptr) T(std::forward(args)...); 264| 18.6k| } 265| 18.6k| IMMER_CATCH (...) { 266| 0| Heap::deallocate(sizeof(T), ptr); 267| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 268| 0| } 269| 18.6k|} _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2Ev: 96| 72.0k| flex_vector() = default; _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9push_backEi: 246| 442k| { 247| 442k| return impl_.push_back(std::move(value)); 248| 442k| } _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.82M| 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| 123k| { 324| 123k| return impl_.update(index, std::forward(fn)); 325| 123k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4takeEm: 350| 23.3k| { 351| 23.3k| return impl_.take(elems); 352| 23.3k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4dropEm: 376| 25.1k| { 377| 25.1k| return impl_.drop(elems); 378| 25.1k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8max_sizeEv: 90| 1.24M| constexpr static size_type max_size() { return impl_t::max_size(); } _ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEESB_: 403| 905k| { 404| 905k| return l.impl_.concat(r.impl_); 405| 905k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9push_backEi: 251| 31.6k| { 252| 31.6k| return push_back_move(move_t{}, std::move(value)); 253| 31.6k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14push_back_moveENSt3__117integral_constantIbLb1EEEi: 547| 31.6k| { 548| 31.6k| impl_.push_back_mut({}, std::move(value)); 549| 31.6k| return std::move(*this); 550| 31.6k| } 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| 41.3k| { 330| 41.3k| return update_move(move_t{}, index, std::forward(fn)); 331| 41.3k| } 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| 41.3k| { 569| 41.3k| impl_.update_mut({}, index, std::forward(fn)); 570| 41.3k| return std::move(*this); 571| 41.3k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4takeEm: 355| 39.2k| { 356| 39.2k| return take_move(move_t{}, elems); 357| 39.2k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9take_moveENSt3__117integral_constantIbLb1EEEm: 579| 39.2k| { 580| 39.2k| impl_.take_mut({}, elems); 581| 39.2k| return std::move(*this); 582| 39.2k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4dropEm: 381| 44.2k| { 382| 44.2k| return drop_move(move_t{}, elems); 383| 44.2k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9drop_moveENSt3__117integral_constantIbLb1EEEm: 589| 44.2k| { 590| 44.2k| impl_.drop_mut({}, elems); 591| 44.2k| return std::move(*this); 592| 44.2k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERKS9_: 409| 264k| { 410| 264k| return concat_move(move_t{}, std::move(l), r); 411| 264k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_RKS9_: 600| 264k| { 601| 264k| concat_mut_l(l.impl_, {}, r.impl_); 602| 264k| return std::move(l); 603| 264k| } _ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEOS9_: 415| 5.28k| { 416| 5.28k| return concat_move(move_t{}, l, std::move(r)); 417| 5.28k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11concat_moveENSt3__117integral_constantIbLb1EEERKS9_OS9_: 606| 5.28k| { 607| 5.28k| concat_mut_r(l.impl_, r.impl_, {}); 608| 5.28k| return std::move(r); 609| 5.28k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEESA_: 421| 23.8k| { 422| 23.8k| return concat_move(move_t{}, std::move(l), std::move(r)); 423| 23.8k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_SD_: 612| 23.8k| { 613| 23.8k| concat_mut_lr_l(l.impl_, {}, r.impl_, {}); 614| 23.8k| return std::move(l); 615| 23.8k| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEeqERKS9_: 222| 29.2k| { 223| 29.2k| return impl_.equals(other.impl_); 224| 29.2k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5eraseEm: 480| 3.39k| { 481| 3.39k| return take(pos) + drop(pos + 1); 482| 3.39k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6insertEmi: 442| 18.6k| { 443| 18.6k| return take(pos).push_back(std::move(value)) + drop(pos); 444| 18.6k| } _ZN5immer8cpp_heap10deallocateEmPv: 36| 10.8M| static void deallocate(std::size_t, void* data) { ::operator delete(data); } _ZN5immer8cpp_heap8allocateIJEEEPvmDpT_: 27| 10.8M| { 28| 10.8M| return ::operator new(size); 29| 10.8M| } _ZN5immer15debug_size_heapINS_8cpp_heapEE10deallocateIJEEEvmPvDpT_: 57| 10.8M| { 58| 10.8M| auto p = (std::size_t*) (((char*) data) - extra_size); 59| 10.8M| assert(*p == size); ------------------ | Branch (59:9): [True: 10.8M, False: 0] ------------------ 60| 10.8M| Base::deallocate(size + extra_size, p, tags...); 61| 10.8M| } _ZN5immer15debug_size_heapINS_8cpp_heapEE8allocateIJEEEPvmDpT_: 49| 10.8M| { 50| 10.8M| auto p = (std::size_t*) Base::allocate(size + extra_size, tags...); 51| 10.8M| new (p) std::size_t{size}; 52| 10.8M| return ((char*) p) + extra_size; 53| 10.8M| } _ZN5immer14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEE10deallocateIJEEEvmPvDpT_: 56| 11.4M| { 57| 11.4M| assert(size <= Size); ------------------ | Branch (57:9): [True: 11.4M, 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.4M| if (head().count.load(std::memory_order_relaxed) >= Limit) { ------------------ | Branch (61:13): [True: 10.8M, False: 594k] ------------------ 62| 10.8M| base_t::deallocate(Size, data); 63| 10.8M| } else { 64| 594k| auto n = static_cast(data); 65| 594k| do { 66| 594k| n->next = head().data; 67| 594k| } while (!head().data.compare_exchange_weak(n->next, n)); ------------------ | Branch (67:22): [True: 0, False: 594k] ------------------ 68| 594k| head().count.fetch_add(1u, std::memory_order_relaxed); 69| 594k| } 70| 11.4M| } _ZN5immer14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEE4headEv: 80| 25.7M| { 81| 25.7M| static head_t head_{{nullptr}, {0}}; 82| 25.7M| return head_; 83| 25.7M| } _ZN5immer14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEE8allocateIJEEEPvmDpT_: 39| 11.4M| { 40| 11.4M| assert(size <= Size); ------------------ | Branch (40:9): [True: 11.4M, False: 0] ------------------ 41| | 42| 11.4M| node_t* n; 43| 11.4M| do { 44| 11.4M| n = head().data; 45| 11.4M| if (!n) { ------------------ | Branch (45:17): [True: 10.8M, False: 593k] ------------------ 46| 10.8M| auto p = base_t::allocate(Size); 47| 10.8M| return p; 48| 10.8M| } 49| 11.4M| } while (!head().data.compare_exchange_weak(n, n->next)); ------------------ | Branch (49:18): [True: 0, False: 593k] ------------------ 50| 593k| head().count.fetch_sub(1u, std::memory_order_relaxed); 51| 593k| return n; 52| 11.4M| } _ZN5immer10split_heapILm56ENS_27thread_local_free_list_heapILm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEEES5_E10deallocateIJEEEvmPvDpT_: 33| 28.5M| { 34| 28.5M| if (size <= Size) ------------------ | Branch (34:13): [True: 28.5M, False: 0] ------------------ 35| 28.5M| SmallHeap::deallocate(size, data, tags...); 36| 0| else 37| 0| BigHeap::deallocate(size, data, tags...); 38| 28.5M| } _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.8M| { 27| 11.8M| return size <= Size ? SmallHeap::allocate(size, tags...) ------------------ | Branch (27:16): [True: 11.8M, False: 0] ------------------ 28| 11.8M| : BigHeap::allocate(size, tags...); 29| 11.8M| } _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.5M| { 73| 28.5M| assert(size <= Size); ------------------ | Branch (73:9): [True: 28.5M, False: 0] ------------------ 74| | 75| 28.5M| if (storage::head().count >= Limit) ------------------ | Branch (75:13): [True: 11.4M, False: 17.1M] ------------------ 76| 11.4M| 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.5M| } _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.84M, False: 10.8M] ------------------ 62| 5.84M| auto p = base_t::allocate(Size); 63| 5.84M| return p; 64| 5.84M| } 65| 10.8M| --storage::head().count; 66| 10.8M| storage::head().data = n->next; 67| 10.8M| 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.8M| { 58| 11.8M| assert(size <= Size); ------------------ | Branch (58:9): [True: 11.8M, False: 0] ------------------ 59| | 60| 11.8M| auto n = storage::head().data; 61| 11.8M| if (!n) { ------------------ | Branch (61:13): [True: 5.55M, False: 6.24M] ------------------ 62| 5.55M| auto p = base_t::allocate(Size); 63| 5.55M| return p; 64| 5.55M| } 65| 6.24M| --storage::head().count; 66| 6.24M| storage::head().data = n->next; 67| 6.24M| return n; 68| 11.8M| } _ZN5immer15refcount_policyC2Ev: 28| 28.5M| : refcount{1} {}; _ZN5immer15refcount_policy3incEv: 34| 44.8M| void inc() { refcount.fetch_add(1, std::memory_order_relaxed); } _ZN5immer15refcount_policy3decEv: 36| 73.4M| bool dec() { return 1 == refcount.fetch_sub(1, std::memory_order_acq_rel); } _ZN5immer15refcount_policy6uniqueEv: 38| 1.95M| bool unique() { return refcount == 1; } _ZNK5immer20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5ownee5ownedEv: 36| 28.5M| bool owned() const { return false; } _ZNK5immer20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5ownee10can_mutateENS6_4editE: 35| 121k| bool can_mutate(edit) const { return false; } _ZN5immer20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeaSENS6_4editE: 34| 573k| ownee& operator=(edit) { return *this; };