LLVMFuzzerTestOneInput: 18| 8.88k|{ 19| 8.88k| constexpr auto var_count = 8; 20| 8.88k| constexpr auto bits = 2; 21| | 22| 8.88k| using vector_t = 23| 8.88k| immer::flex_vector; 24| 8.88k| using size_t = std::uint8_t; 25| | 26| 8.88k| auto vars = std::array{}; 27| | 28| 8.88k| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; 29| 8.88k| auto is_valid_var_neq = [](auto other) { 30| 8.88k| return [=](auto idx) { 31| 8.88k| return idx >= 0 && idx < var_count && idx != other; 32| 8.88k| }; 33| 8.88k| }; 34| 8.88k| auto is_valid_index = [](auto& v) { 35| 8.88k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 36| 8.88k| }; 37| 8.88k| auto is_valid_size = [](auto& v) { 38| 8.88k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 39| 8.88k| }; 40| 8.88k| auto can_concat = [](auto&& v1, auto&& v2) { 41| 8.88k| return v1.size() + v2.size() < vector_t::max_size(); 42| 8.88k| }; 43| 8.88k| auto can_compare = [](auto&& v) { 44| | // avoid comparing vectors that are too big, and hence, slow to compare 45| 8.88k| return v.size() < (1 << 15); 46| 8.88k| }; 47| 8.88k| return fuzzer_input{data, size}.run([&](auto& in) { 48| 8.88k| enum ops 49| 8.88k| { 50| 8.88k| op_push_back, 51| 8.88k| op_update, 52| 8.88k| op_take, 53| 8.88k| op_drop, 54| 8.88k| op_concat, 55| 8.88k| op_push_back_move, 56| 8.88k| op_update_move, 57| 8.88k| op_take_move, 58| 8.88k| op_drop_move, 59| 8.88k| op_concat_move_l, 60| 8.88k| op_concat_move_r, 61| 8.88k| op_concat_move_lr, 62| 8.88k| op_insert, 63| 8.88k| op_erase, 64| 8.88k| op_compare, 65| 8.88k| }; 66| 8.88k| auto src = read(in, is_valid_var); 67| 8.88k| auto dst = read(in, is_valid_var); 68| 8.88k| switch (read(in)) { 69| 8.88k| case op_push_back: { 70| 8.88k| vars[dst] = vars[src].push_back(42); 71| 8.88k| break; 72| 8.88k| } 73| 8.88k| case op_update: { 74| 8.88k| auto idx = read(in, is_valid_index(vars[src])); 75| 8.88k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 76| 8.88k| break; 77| 8.88k| } 78| 8.88k| case op_take: { 79| 8.88k| auto idx = read(in, is_valid_size(vars[src])); 80| 8.88k| vars[dst] = vars[src].take(idx); 81| 8.88k| break; 82| 8.88k| } 83| 8.88k| case op_drop: { 84| 8.88k| auto idx = read(in, is_valid_size(vars[src])); 85| 8.88k| vars[dst] = vars[src].drop(idx); 86| 8.88k| break; 87| 8.88k| } 88| 8.88k| case op_concat: { 89| 8.88k| auto src2 = read(in, is_valid_var); 90| 8.88k| if (can_concat(vars[src], vars[src2])) 91| 8.88k| vars[dst] = vars[src] + vars[src2]; 92| 8.88k| break; 93| 8.88k| } 94| 8.88k| case op_push_back_move: { 95| 8.88k| vars[dst] = std::move(vars[src]).push_back(21); 96| 8.88k| break; 97| 8.88k| } 98| 8.88k| case op_update_move: { 99| 8.88k| auto idx = read(in, is_valid_index(vars[src])); 100| 8.88k| vars[dst] = 101| 8.88k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 102| 8.88k| break; 103| 8.88k| } 104| 8.88k| case op_take_move: { 105| 8.88k| auto idx = read(in, is_valid_size(vars[src])); 106| 8.88k| vars[dst] = std::move(vars[src]).take(idx); 107| 8.88k| break; 108| 8.88k| } 109| 8.88k| case op_drop_move: { 110| 8.88k| auto idx = read(in, is_valid_size(vars[src])); 111| 8.88k| vars[dst] = std::move(vars[src]).drop(idx); 112| 8.88k| break; 113| 8.88k| } 114| 8.88k| case op_concat_move_l: { 115| 8.88k| auto src2 = read(in, is_valid_var_neq(src)); 116| 8.88k| if (can_concat(vars[src], vars[src2])) 117| 8.88k| vars[dst] = std::move(vars[src]) + vars[src2]; 118| 8.88k| break; 119| 8.88k| } 120| 8.88k| case op_concat_move_r: { 121| 8.88k| auto src2 = read(in, is_valid_var_neq(src)); 122| 8.88k| if (can_concat(vars[src], vars[src2])) 123| 8.88k| vars[dst] = vars[src] + std::move(vars[src2]); 124| 8.88k| break; 125| 8.88k| } 126| 8.88k| case op_concat_move_lr: { 127| 8.88k| auto src2 = read(in, is_valid_var_neq(src)); 128| 8.88k| if (can_concat(vars[src], vars[src2])) 129| 8.88k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 130| 8.88k| break; 131| 8.88k| } 132| 8.88k| case op_compare: { 133| 8.88k| using std::swap; 134| 8.88k| if (can_compare(vars[src]) && vars[src] == vars[dst]) 135| 8.88k| swap(vars[src], vars[dst]); 136| 8.88k| break; 137| 8.88k| } 138| 8.88k| case op_erase: { 139| 8.88k| auto idx = read(in, is_valid_index(vars[src])); 140| 8.88k| vars[dst] = vars[src].erase(idx); 141| 8.88k| break; 142| 8.88k| } 143| 8.88k| case op_insert: { 144| 8.88k| auto idx = read(in, is_valid_size(vars[src])); 145| 8.88k| vars[dst] = vars[src].insert(idx, immer::box{42}); 146| 8.88k| break; 147| 8.88k| } 148| 8.88k| default: 149| 8.88k| break; 150| 8.88k| }; 151| 8.88k| return true; 152| 8.88k| }); 153| 8.88k|} flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_: 47| 1.99M| return fuzzer_input{data, size}.run([&](auto& in) { 48| 1.99M| enum ops 49| 1.99M| { 50| 1.99M| op_push_back, 51| 1.99M| op_update, 52| 1.99M| op_take, 53| 1.99M| op_drop, 54| 1.99M| op_concat, 55| 1.99M| op_push_back_move, 56| 1.99M| op_update_move, 57| 1.99M| op_take_move, 58| 1.99M| op_drop_move, 59| 1.99M| op_concat_move_l, 60| 1.99M| op_concat_move_r, 61| 1.99M| op_concat_move_lr, 62| 1.99M| op_insert, 63| 1.99M| op_erase, 64| 1.99M| op_compare, 65| 1.99M| }; 66| 1.99M| auto src = read(in, is_valid_var); 67| 1.99M| auto dst = read(in, is_valid_var); 68| 1.99M| switch (read(in)) { 69| 400k| case op_push_back: { ------------------ | Branch (69:9): [True: 400k, False: 1.59M] ------------------ 70| 400k| vars[dst] = vars[src].push_back(42); 71| 400k| break; 72| 0| } 73| 133k| case op_update: { ------------------ | Branch (73:9): [True: 133k, False: 1.86M] ------------------ 74| 133k| auto idx = read(in, is_valid_index(vars[src])); 75| 133k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 76| 133k| break; 77| 0| } 78| 1.42k| case op_take: { ------------------ | Branch (78:9): [True: 1.42k, False: 1.99M] ------------------ 79| 1.42k| auto idx = read(in, is_valid_size(vars[src])); 80| 1.42k| vars[dst] = vars[src].take(idx); 81| 1.42k| break; 82| 0| } 83| 3.00k| case op_drop: { ------------------ | Branch (83:9): [True: 3.00k, False: 1.99M] ------------------ 84| 3.00k| auto idx = read(in, is_valid_size(vars[src])); 85| 3.00k| vars[dst] = vars[src].drop(idx); 86| 3.00k| break; 87| 0| } 88| 976k| case op_concat: { ------------------ | Branch (88:9): [True: 976k, False: 1.02M] ------------------ 89| 976k| auto src2 = read(in, is_valid_var); 90| 976k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (90:17): [True: 909k, False: 67.2k] ------------------ 91| 909k| vars[dst] = vars[src] + vars[src2]; 92| 976k| break; 93| 0| } 94| 13.4k| case op_push_back_move: { ------------------ | Branch (94:9): [True: 13.4k, False: 1.98M] ------------------ 95| 13.4k| vars[dst] = std::move(vars[src]).push_back(21); 96| 13.4k| break; 97| 0| } 98| 28.4k| case op_update_move: { ------------------ | Branch (98:9): [True: 28.4k, False: 1.96M] ------------------ 99| 28.4k| auto idx = read(in, is_valid_index(vars[src])); 100| 28.4k| vars[dst] = 101| 28.4k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 102| 28.4k| break; 103| 0| } 104| 36.6k| case op_take_move: { ------------------ | Branch (104:9): [True: 36.6k, False: 1.96M] ------------------ 105| 36.6k| auto idx = read(in, is_valid_size(vars[src])); 106| 36.6k| vars[dst] = std::move(vars[src]).take(idx); 107| 36.6k| break; 108| 0| } 109| 45.1k| case op_drop_move: { ------------------ | Branch (109:9): [True: 45.1k, False: 1.95M] ------------------ 110| 45.1k| auto idx = read(in, is_valid_size(vars[src])); 111| 45.1k| vars[dst] = std::move(vars[src]).drop(idx); 112| 45.1k| break; 113| 0| } 114| 265k| case op_concat_move_l: { ------------------ | Branch (114:9): [True: 265k, False: 1.73M] ------------------ 115| 265k| auto src2 = read(in, is_valid_var_neq(src)); 116| 265k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (116:17): [True: 260k, False: 4.92k] ------------------ 117| 260k| vars[dst] = std::move(vars[src]) + vars[src2]; 118| 265k| break; 119| 0| } 120| 3.80k| case op_concat_move_r: { ------------------ | Branch (120:9): [True: 3.80k, False: 1.99M] ------------------ 121| 3.80k| auto src2 = read(in, is_valid_var_neq(src)); 122| 3.80k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (122:17): [True: 3.44k, False: 363] ------------------ 123| 3.44k| vars[dst] = vars[src] + std::move(vars[src2]); 124| 3.80k| break; 125| 0| } 126| 2.31k| case op_concat_move_lr: { ------------------ | Branch (126:9): [True: 2.31k, False: 1.99M] ------------------ 127| 2.31k| auto src2 = read(in, is_valid_var_neq(src)); 128| 2.31k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (128:17): [True: 1.68k, False: 623] ------------------ 129| 1.68k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 130| 2.31k| break; 131| 0| } 132| 32.1k| case op_compare: { ------------------ | Branch (132:9): [True: 32.1k, False: 1.96M] ------------------ 133| 32.1k| using std::swap; 134| 32.1k| if (can_compare(vars[src]) && vars[src] == vars[dst]) ------------------ | Branch (134:17): [True: 28.1k, False: 4.06k] | Branch (134:43): [True: 6.09k, False: 22.0k] ------------------ 135| 6.09k| swap(vars[src], vars[dst]); 136| 32.1k| break; 137| 0| } 138| 3.32k| case op_erase: { ------------------ | Branch (138:9): [True: 3.32k, False: 1.99M] ------------------ 139| 3.32k| auto idx = read(in, is_valid_index(vars[src])); 140| 3.32k| vars[dst] = vars[src].erase(idx); 141| 3.32k| break; 142| 0| } 143| 18.0k| case op_insert: { ------------------ | Branch (143:9): [True: 18.0k, False: 1.97M] ------------------ 144| 18.0k| auto idx = read(in, is_valid_size(vars[src])); 145| 18.0k| vars[dst] = vars[src].insert(idx, immer::box{42}); 146| 18.0k| break; 147| 0| } 148| 24.9k| default: ------------------ | Branch (148:9): [True: 24.9k, False: 1.97M] ------------------ 149| 24.9k| break; 150| 1.99M| }; 151| 1.98M| return true; 152| 1.99M| }); flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_0clIcEEDaT_: 28| 5.28M| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; ------------------ | Branch (28:48): [True: 5.12M, False: 156k] | Branch (28:60): [True: 4.95M, False: 169k] ------------------ 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| 191k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; ------------------ | Branch (35:39): [True: 191k, False: 0] | Branch (35:51): [True: 165k, False: 26.1k] ------------------ flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaRT_: 34| 165k| auto is_valid_index = [](auto& v) { 35| 165k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 36| 165k| }; flex-vector.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E_clIiEEDaS2_: 75| 133k| 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| 115k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; ------------------ | Branch (38:39): [True: 115k, False: 0] | Branch (38:51): [True: 104k, False: 10.9k] ------------------ flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaRT_: 37| 104k| auto is_valid_size = [](auto& v) { 38| 104k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 39| 104k| }; 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| 28.4k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); flex-vector.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_ENKUlS1_E_clIcEEDaS1_: 30| 307k| return [=](auto idx) { 31| 307k| return idx >= 0 && idx < var_count && idx != other; ------------------ | Branch (31:20): [True: 302k, False: 4.55k] | Branch (31:32): [True: 292k, False: 9.51k] | Branch (31:51): [True: 271k, False: 21.1k] ------------------ 32| 307k| }; flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_: 29| 271k| auto is_valid_var_neq = [](auto other) { 30| 271k| return [=](auto idx) { 31| 271k| return idx >= 0 && idx < var_count && idx != other; 32| 271k| }; 33| 271k| }; flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_5clIRN5immer11flex_vectorIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaOT_: 43| 32.1k| auto can_compare = [](auto&& v) { 44| | // avoid comparing vectors that are too big, and hence, slow to compare 45| 32.1k| return v.size() < (1 << 15); 46| 32.1k| }; flex-vector.cpp:_ZN12fuzzer_input3runIZ22LLVMFuzzerTestOneInputE3$_6EEiT_: 50| 8.88k| { 51| 8.88k| if (size_ > fuzzer_input_max_size) ------------------ | Branch (51:13): [True: 8, False: 8.87k] ------------------ 52| 8| return 0; 53| 8.87k| try { 54| 1.99M| while (step(*this)) ------------------ | Branch (54:20): [True: 1.98M, False: 8.87k] ------------------ 55| 1.98M| continue; 56| 8.87k| } catch (const no_more_input&) { 57| 8.87k| }; 58| 8.87k| return 0; 59| 8.87k| } flex-vector.cpp:_Z4readIcZ22LLVMFuzzerTestOneInputE3$_0ET_R12fuzzer_inputT0_: 70| 4.96M|{ 71| 4.96M| auto x = read(fz); 72| 5.28M| while (!cond(x)) ------------------ | Branch (72:12): [True: 326k, False: 4.96M] ------------------ 73| 326k| x = read(fz); 74| 4.96M| return x; 75| 4.96M|} _Z4readIcERKT_R12fuzzer_input: 64| 7.58M|{ 65| 7.58M| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 7.58M|} _ZN12fuzzer_input4nextEmm: 40| 7.89M| { 41| 7.89M| auto& p = const_cast(reinterpret_cast(data_)); 42| 7.89M| auto r = std::align(align, size, p, size_); 43| 7.89M| if (r == nullptr) ------------------ | Branch (43:13): [True: 8.87k, False: 7.88M] ------------------ 44| 8.87k| throw no_more_input{}; 45| 7.88M| return next(size); 46| 7.89M| } _ZN12fuzzer_input4nextEm: 30| 7.88M| { 31| 7.88M| if (size_ < size) ------------------ | Branch (31:13): [True: 0, False: 7.88M] ------------------ 32| 0| throw no_more_input{}; 33| 7.88M| auto r = data_; 34| 7.88M| data_ += size; 35| 7.88M| size_ -= size; 36| 7.88M| return r; 37| 7.88M| } 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| 165k|{ 71| 165k| auto x = read(fz); 72| 191k| while (!cond(x)) ------------------ | Branch (72:12): [True: 26.1k, False: 165k] ------------------ 73| 26.1k| x = read(fz); 74| 165k| return x; 75| 165k|} _Z4readIhERKT_R12fuzzer_input: 64| 306k|{ 65| 306k| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 306k|} 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| 104k|{ 71| 104k| auto x = read(fz); 72| 115k| while (!cond(x)) ------------------ | Branch (72:12): [True: 10.9k, False: 104k] ------------------ 73| 10.9k| x = read(fz); 74| 104k| return x; 75| 104k|} flex-vector.cpp:_Z4readIcZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_EUlS2_E_ES2_R12fuzzer_inputT0_: 70| 271k|{ 71| 271k| auto x = read(fz); 72| 307k| while (!cond(x)) ------------------ | Branch (72:12): [True: 35.2k, False: 271k] ------------------ 73| 35.2k| x = read(fz); 74| 271k| return x; 75| 271k|} _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2IiviEEOT_: 85| 17.9k| : impl_{detail::make(std::forward(arg))} 86| 17.9k| { 87| 17.9k| } _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderC2IJiEEEDpOT_: 47| 17.9k| : value(std::forward(args)...) 48| 17.9k| { 49| 17.9k| } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEcvRKiEv: 142| 17.9k| operator const T&() const { return get(); } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE3getEv: 139| 17.9k| 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| 17.9k| { 132| 17.9k| if (impl_ && impl_->dec()) { ------------------ | Branch (132:13): [True: 17.9k, False: 0] | Branch (132:22): [True: 17.9k, False: 0] ------------------ 133| 17.9k| impl_->~holder(); 134| 17.9k| heap::deallocate(sizeof(holder), impl_); 135| 17.9k| } 136| 17.9k| } _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| 101M| { 171| 101M| return x.get_(type_t{}); 172| 101M| } _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| 101M| { 185| 101M| return n.get_(t); 186| 101M| } _ZNK5immer6detail3csl6memberINS_15refcount_policyENS1_7inheritINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEvE4typeEE4type4get_ENS1_6type_tIS3_EE: 128| 112M| 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| 11.7M| { 171| 11.7M| return x.get_(type_t{}); 172| 11.7M| } _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| 11.7M| { 185| 11.7M| return n.get_(t); 186| 11.7M| } _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.0M| { 166| 11.0M| return x.get_(type_t{}); 167| 11.0M| } _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.0M| { 180| 11.0M| return n.get_(t); 181| 11.0M| } _ZN5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 102| 27.4M| 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| 16.3M| { 166| 16.3M| return x.get_(type_t{}); 167| 16.3M| } _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| 16.3M| { 180| 16.3M| return n.get_(t); 181| 16.3M| } _ZN5immer6detail3csl3getINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEEEDcRKNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyIS7_NS_15refcount_policyENS_15spinlock_policyES3_Lb0ELb1EEELj2ELj2EE11impl_data_tENS1_6memberISF_NS1_7inheritISA_vE4typeEE4typeEE4typeE: 170| 93.0k| { 171| 93.0k| return x.get_(type_t{}); 172| 93.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| 93.0k| { 185| 93.0k| return n.get_(t); 186| 93.0k| } _ZNK5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 103| 93.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.16M| 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.16M| { 23| 5.16M| return x.dereference(); 24| 5.16M| } _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.20M| { 87| 5.20M| static_assert(std::is_base_of::value, 88| 5.20M| "must pass a derived thing"); 89| 5.20M| return *static_cast(this); 90| 5.20M| } _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| 232k| { 152| 232k| access_t::advance(derived(), n); 153| 232k| return derived(); 154| 232k| } _ZN5immer6detail20iterator_core_access7advanceIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEElEEDcOT_T0_: 46| 232k| { 47| 232k| return x.advance(d); 48| 232k| } _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.23M| { 93| 8.23M| static_assert(std::is_base_of::value, 94| 8.23M| "must pass a derived thing"); 95| 8.23M| return *static_cast(this); 96| 8.23M| } _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| 3.88M| { 120| 3.88M| access_t::increment(derived()); 121| 3.88M| return derived(); 122| 3.88M| } _ZN5immer6detail20iterator_core_access9incrementIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDcOT_: 28| 3.88M| { 29| 3.88M| return x.increment(); 30| 3.88M| } _ZNK5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENSt3__126random_access_iterator_tagEiRKilPSF_EplISI_TnNSD_9enable_ifIXsrT_16is_random_accessEbE4typeELb1EEESC_l: 164| 42.7k| { 165| 42.7k| auto tmp = derived(); 166| 42.7k| return tmp += n; 167| 42.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE17make_inner_n_intoEPvmj: 213| 3.12M| { 214| 3.12M| assert(n <= branches); ------------------ | Branch (214:9): [True: 3.12M, False: 0] ------------------ 215| 3.12M| assert(size >= sizeof_inner_n(n)); ------------------ | Branch (215:9): [True: 3.12M, False: 0] ------------------ 216| 3.12M| auto p = new (buffer) node_t; 217| 3.12M| p->impl.d.data.inner.relaxed = nullptr; 218| 3.12M|#if IMMER_TAGGED_NODE 219| 3.12M| p->impl.d.kind = node_t::kind_t::inner; 220| 3.12M|#endif 221| 3.12M| return p; 222| 3.12M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14sizeof_inner_nEj: 145| 12.5M| { 146| 12.5M| return keep_headroom ? max_sizeof_inner : sizeof_packed_inner_n(n); ------------------ | Branch (146:16): [True: 12.5M, Folded] ------------------ 147| 12.5M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE3incEv: 956| 27.4M| { 957| 27.4M| refs(this).inc(); 958| 27.4M| return this; 959| 27.4M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4refsEPKSB_: 203| 101M| { 204| 101M| return auto_const_cast(get(x->impl)); 205| 101M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE16make_leaf_n_intoEPvmj: 330| 1.26M| { 331| 1.26M| assert(n <= branches); ------------------ | Branch (331:9): [True: 1.26M, False: 0] ------------------ 332| 1.26M| assert(size >= sizeof_leaf_n(n)); ------------------ | Branch (332:9): [True: 1.26M, False: 0] ------------------ 333| 1.26M| auto p = new (buffer) node_t; 334| 1.26M|#if IMMER_TAGGED_NODE 335| 1.26M| p->impl.d.kind = node_t::kind_t::leaf; 336| 1.26M|#endif 337| 1.26M| return p; 338| 1.26M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13sizeof_leaf_nEj: 160| 5.28M| { 161| 5.28M| return keep_headroom ? max_sizeof_leaf : sizeof_packed_leaf_n(n); ------------------ | Branch (161:16): [True: 5.28M, Folded] ------------------ 162| 5.28M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7relaxedEv: 172| 162M| { 173| 162M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 162M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (173:9): [True: 162M, False: 0] ------------------ 174| 162M| return impl.d.data.inner.relaxed; 175| 162M| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4kindEv: 168| 311M| 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| 57.5M| bool dec() const { return refs(this).dec(); } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5innerEv: 184| 107M| { 185| 107M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 107M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (185:9): [True: 107M, False: 0] ------------------ 186| 107M| return impl.d.data.inner.get_storage_ptr(); 187| 107M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14delete_inner_rEPSB_j: 832| 11.1M| { 833| 11.1M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 11.1M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (833:9): [True: 11.1M, False: 0] ------------------ 834| 11.1M| auto r = p->relaxed(); 835| 11.1M| assert(r); ------------------ | Branch (835:9): [True: 11.1M, False: 0] ------------------ 836| 11.1M| static_if([&](auto) { 837| 11.1M| if (node_t::refs(r).dec()) 838| 11.1M| heap::deallocate(node_t::ownee(r).owned() 839| 11.1M| ? node_t::max_sizeof_relaxed 840| 11.1M| : node_t::sizeof_relaxed_n(n), 841| 11.1M| r); 842| 11.1M| }); 843| 11.1M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner_r ------------------ | Branch (843:26): [True: 0, False: 11.1M] ------------------ 844| 11.1M| : node_t::sizeof_inner_r_n(n), 845| 11.1M| p); 846| 11.1M| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14delete_inner_rEPSB_jENKUlT_E_clINS0_7empty_tEEEDaSD_: 836| 11.1M| static_if([&](auto) { 837| 11.1M| if (node_t::refs(r).dec()) ------------------ | Branch (837:17): [True: 10.9M, False: 253k] ------------------ 838| 10.9M| heap::deallocate(node_t::ownee(r).owned() ------------------ | Branch (838:34): [True: 0, False: 10.9M] ------------------ 839| 10.9M| ? node_t::max_sizeof_relaxed 840| 10.9M| : node_t::sizeof_relaxed_n(n), 841| 10.9M| r); 842| 11.1M| }); _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| 11.7M| { 197| 11.7M| return auto_const_cast(get(*x)); 198| 11.7M| } _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.0M| 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| 21.6M| { 156| 21.6M| return keep_headroom ? max_sizeof_relaxed : sizeof_packed_relaxed_n(n); ------------------ | Branch (156:16): [True: 21.6M, Folded] ------------------ 157| 21.6M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5owneeEPSB_: 210| 16.3M| 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| 22.2M| { 151| 22.2M| return keep_headroom ? max_sizeof_inner_r : sizeof_packed_inner_r_n(n); ------------------ | Branch (151:16): [True: 22.2M, Folded] ------------------ 152| 22.2M| } _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.5M| { 191| 10.5M| IMMER_ASSERT_TAGGED(kind() == kind_t::leaf); ------------------ | | 68| 10.5M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (191:9): [True: 10.5M, False: 0] ------------------ 192| 10.5M| return impl.d.data.leaf.get_storage_ptr(); 193| 10.5M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12delete_innerEPSB_j: 808| 3.21M| { 809| 3.21M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 3.21M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (809:9): [True: 3.21M, False: 0] ------------------ 810| 3.21M| assert(!p->relaxed()); ------------------ | Branch (810:9): [True: 3.21M, False: 0] ------------------ 811| 3.21M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner ------------------ | Branch (811:26): [True: 0, False: 3.21M] ------------------ 812| 3.21M| : node_t::sizeof_inner_n(n), 813| 3.21M| p); 814| 3.21M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE17copy_leaf_emplaceIiEEPSB_SD_jOT_: 794| 292k| { 795| 292k| auto dst = copy_leaf_n(n + 1, src, n); 796| 292k| IMMER_TRY { ------------------ | | 49| 292k|#define IMMER_TRY try ------------------ 797| 292k| new (dst->leaf() + n) T(std::forward(x)); 798| 292k| } 799| 292k| 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| 292k| return dst; 805| 292k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11copy_leaf_nEjPSB_j: 696| 292k| { 697| 292k| assert(allocn >= n); ------------------ | Branch (697:9): [True: 292k, False: 0] ------------------ 698| 292k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 292k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (698:9): [True: 292k, False: 0] ------------------ 699| 292k| auto dst = make_leaf_n(allocn); 700| 292k| IMMER_TRY { ------------------ | | 49| 292k|#define IMMER_TRY try ------------------ 701| 292k| detail::uninitialized_copy( 702| 292k| src->leaf(), src->leaf() + n, dst->leaf()); 703| 292k| } 704| 292k| 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| 292k| return dst; 709| 292k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_nEj: 341| 1.26M| { 342| 1.26M| assert(n <= branches); ------------------ | Branch (342:9): [True: 1.26M, False: 0] ------------------ 343| 1.26M| auto m = heap::allocate(sizeof_leaf_n(n)); 344| 1.26M| return make_leaf_n_into(m, sizeof_leaf_n(n), n); 345| 1.26M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_nIiEEPSB_jOT_: 470| 107k| { 471| 107k| assert(n >= 1); ------------------ | Branch (471:9): [True: 107k, False: 0] ------------------ 472| 107k| auto p = make_leaf_n(n); 473| 107k| IMMER_TRY { ------------------ | | 49| 107k|#define IMMER_TRY try ------------------ 474| 107k| new (p->leaf()) T(std::forward(x)); 475| 107k| } 476| 107k| 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| 107k| return p; 481| 107k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13do_copy_innerEPSB_SC_j: 558| 2.87M| { 559| 2.87M| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 2.87M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (559:9): [True: 2.87M, False: 0] ------------------ 560| 2.87M| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 2.87M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (560:9): [True: 2.87M, False: 0] ------------------ 561| 2.87M| auto p = src->inner(); 562| 2.87M| inc_nodes(p, n); 563| 2.87M| std::copy(p, p + n, dst->inner()); 564| 2.87M| return dst; 565| 2.87M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9inc_nodesEPPSB_j: 970| 8.53M| { 971| 22.7M| for (auto i = p, e = i + n; i != e; ++i) ------------------ | Branch (971:37): [True: 14.1M, False: 8.53M] ------------------ 972| 14.1M| refs(*i).inc(); 973| 8.53M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14copy_inner_r_nEjPSB_j: 588| 590k| { 589| 590k| assert(allocn >= n); ------------------ | Branch (589:9): [True: 590k, False: 0] ------------------ 590| 590k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 590k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (590:9): [True: 590k, False: 0] ------------------ 591| 590k| auto dst = make_inner_r_n(allocn); 592| 590k| return do_copy_inner_r(dst, src, n); 593| 590k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE15do_copy_inner_rEPSB_SC_j: 610| 612k| { 611| 612k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 612k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (611:9): [True: 612k, False: 0] ------------------ 612| 612k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 612k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (612:9): [True: 612k, False: 0] ------------------ 613| 612k| auto src_r = src->relaxed(); 614| 612k| auto dst_r = dst->relaxed(); 615| 612k| inc_nodes(src->inner(), n); 616| 612k| std::copy(src->inner(), src->inner() + n, dst->inner()); 617| 612k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 618| 612k| dst_r->d.count = n; 619| 612k| return dst; 620| 612k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14make_inner_r_nEj: 243| 10.7M| { 244| 10.7M| assert(n <= branches); ------------------ | Branch (244:9): [True: 10.7M, False: 0] ------------------ 245| 10.7M| auto mp = heap::allocate(sizeof_inner_r_n(n)); 246| 10.7M| auto mr = static_cast(nullptr); 247| 10.7M| if (embed_relaxed) { ------------------ | Branch (247:13): [Folded, False: 10.7M] ------------------ 248| 0| mr = reinterpret_cast(mp) + sizeof_inner_n(n); 249| 10.7M| } else { 250| 10.7M| IMMER_TRY { ------------------ | | 49| 10.7M|#define IMMER_TRY try ------------------ 251| 10.7M| mr = heap::allocate(sizeof_relaxed_n(n), norefs_tag{}); 252| 10.7M| } 253| 10.7M| 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| 10.7M| } 258| 10.7M| auto p = new (mp) node_t; 259| 10.7M| auto r = new (mr) relaxed_t; 260| 10.7M| r->d.count = 0; 261| 10.7M| p->impl.d.data.inner.relaxed = r; 262| 10.7M|#if IMMER_TAGGED_NODE 263| 10.7M| p->impl.d.kind = node_t::kind_t::inner; 264| 10.7M|#endif 265| 10.7M| return p; 266| 10.7M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9make_pathEjPSB_: 498| 781k| { 499| 781k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 781k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (499:9): [True: 781k, False: 0] ------------------ 500| 781k| if (shift == endshift) ------------------ | Branch (500:13): [True: 578k, False: 203k] ------------------ 501| 578k| return node; 502| 203k| else { 503| 203k| auto n = node_t::make_inner_n(1); 504| 203k| IMMER_TRY { ------------------ | | 49| 203k|#define IMMER_TRY try ------------------ 505| 203k| n->inner()[0] = make_path(shift - B, node); 506| 203k| } 507| 203k| 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| 203k| return n; 512| 203k| } 513| 781k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12make_inner_nEj: 224| 3.12M| { 225| 3.12M| assert(n <= branches); ------------------ | Branch (225:9): [True: 3.12M, False: 0] ------------------ 226| 3.12M| auto m = heap::allocate(sizeof_inner_n(n)); 227| 3.12M| return make_inner_n_into(m, sizeof_inner_n(n), n); 228| 3.12M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9copy_leafEPSB_j: 666| 143k| { 667| 143k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 143k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (667:9): [True: 143k, False: 0] ------------------ 668| 143k| auto dst = make_leaf_n(n); 669| 143k| IMMER_TRY { ------------------ | | 49| 143k|#define IMMER_TRY try ------------------ 670| 143k| detail::uninitialized_copy( 671| 143k| src->leaf(), src->leaf() + n, dst->leaf()); 672| 143k| } 673| 143k| 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| 143k| return dst; 678| 143k| } _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| 270k| { 270| 270k| return static_if( 271| 270k| [&](auto) { return node_t::make_inner_r_n(n); }, 272| 270k| [&](auto) { 273| 270k| auto p = 274| 270k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 270k| assert(r->d.count >= n); 276| 270k| node_t::refs(r).inc(); 277| 270k| p->impl.d.data.inner.relaxed = r; 278| 270k|#if IMMER_TAGGED_NODE 279| 270k| p->impl.d.kind = node_t::kind_t::inner; 280| 270k|#endif 281| 270k| return p; 282| 270k| }); 283| 270k| } _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| 270k| [&](auto) { 273| 270k| auto p = 274| 270k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 270k| assert(r->d.count >= n); ------------------ | Branch (275:17): [True: 270k, False: 0] ------------------ 276| 270k| node_t::refs(r).inc(); 277| 270k| p->impl.d.data.inner.relaxed = r; 278| 270k|#if IMMER_TAGGED_NODE 279| 270k| p->impl.d.kind = node_t::kind_t::inner; 280| 270k|#endif 281| 270k| return p; 282| 270k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE24do_copy_inner_replace_srEPSB_SC_jjSC_: 652| 270k| { 653| 270k| if (embed_relaxed) ------------------ | Branch (653:13): [Folded, False: 270k] ------------------ 654| 0| return do_copy_inner_replace_r(dst, src, n, offset, child); 655| 270k| else { 656| 270k| auto p = src->inner(); 657| 270k| inc_nodes(p, offset); 658| 270k| inc_nodes(p + offset + 1, n - offset - 1); 659| 270k| std::copy(p, p + n, dst->inner()); 660| 270k| dst->inner()[offset] = child; 661| 270k| return dst; 662| 270k| } 663| 270k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE21do_copy_inner_replaceEPSB_SC_jjSC_: 569| 56.5k| { 570| 56.5k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 56.5k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (570:9): [True: 56.5k, False: 0] ------------------ 571| 56.5k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 56.5k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (571:9): [True: 56.5k, False: 0] ------------------ 572| 56.5k| auto p = src->inner(); 573| 56.5k| inc_nodes(p, offset); 574| 56.5k| inc_nodes(p + offset + 1, n - offset - 1); 575| 56.5k| std::copy(p, p + n, dst->inner()); 576| 56.5k| dst->inner()[offset] = child; 577| 56.5k| return dst; 578| 56.5k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12copy_inner_nEjPSB_j: 543| 9.55k| { 544| 9.55k| assert(allocn >= n); ------------------ | Branch (544:9): [True: 9.55k, False: 0] ------------------ 545| 9.55k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 9.55k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (545:9): [True: 9.55k, False: 0] ------------------ 546| 9.55k| auto dst = make_inner_n(allocn); 547| 9.55k| return do_copy_inner(dst, src, n); 548| 9.55k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12copy_inner_rEPSB_j: 581| 4.25k| { 582| 4.25k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 4.25k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (582:9): [True: 4.25k, False: 0] ------------------ 583| 4.25k| auto dst = make_inner_r_n(n); 584| 4.25k| return do_copy_inner_r(dst, src, n); 585| 4.25k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13compute_shiftEv: 977| 5.03M| { 978| 5.03M| if (kind() == kind_t::leaf) ------------------ | Branch (978:13): [True: 435k, False: 4.59M] ------------------ 979| 435k| return endshift; 980| 4.59M| else 981| 4.59M| return B + inner()[0]->compute_shift(); 982| 5.03M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5checkEjm: 986| 435k| { 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| 435k| return true; 1023| 435k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9copy_leafEPSB_jj: 778| 351k| { 779| 351k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 351k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (779:9): [True: 351k, False: 0] ------------------ 780| 351k| auto dst = make_leaf_n(last - idx); 781| 351k| IMMER_TRY { ------------------ | | 49| 351k|#define IMMER_TRY try ------------------ 782| 351k| detail::uninitialized_copy( 783| 351k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 784| 351k| } 785| 351k| 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| 351k| return dst; 790| 351k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9copy_leafEPSB_jSC_j: 712| 344k| { 713| 344k| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 344k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (713:9): [True: 344k, False: 0] ------------------ 714| 344k| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 344k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (714:9): [True: 344k, False: 0] ------------------ 715| 344k| auto dst = make_leaf_n(n1 + n2); 716| 344k| IMMER_TRY { ------------------ | | 49| 344k|#define IMMER_TRY try ------------------ 717| 344k| detail::uninitialized_copy( 718| 344k| src1->leaf(), src1->leaf() + n1, dst->leaf()); 719| 344k| } 720| 344k| 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| 344k| IMMER_TRY { ------------------ | | 49| 344k|#define IMMER_TRY try ------------------ 725| 344k| detail::uninitialized_copy( 726| 344k| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 727| 344k| } 728| 344k| 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| 344k| return dst; 734| 344k| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10can_mutateENS9_5applyIS6_E4type4editE: 870| 1.81M| { 871| 1.81M| return refs(this).unique() || ownee(this).can_mutate(e); ------------------ | Branch (871:16): [True: 1.72M, False: 93.0k] | Branch (871:39): [True: 0, False: 93.0k] ------------------ 872| 1.81M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5owneeEPKSB_: 207| 93.0k| { 208| 93.0k| return get(x->impl); 209| 93.0k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_j: 681| 27.9k| { 682| 27.9k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 27.9k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (682:9): [True: 27.9k, False: 0] ------------------ 683| 27.9k| auto dst = make_leaf_e(e); 684| 27.9k| IMMER_TRY { ------------------ | | 49| 27.9k|#define IMMER_TRY try ------------------ 685| 27.9k| detail::uninitialized_copy( 686| 27.9k| src->leaf(), src->leaf() + n, dst->leaf()); 687| 27.9k| } 688| 27.9k| IMMER_CATCH (...) { 689| 0| heap::deallocate(node_t::max_sizeof_leaf, dst); 690| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 691| 0| } 692| 27.9k| return dst; 693| 27.9k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_eENS9_5applyIS6_E4type4editE: 348| 226k| { 349| 226k| auto p = new (heap::allocate(max_sizeof_leaf)) node_t; 350| 226k| ownee(p) = e; 351| 226k|#if IMMER_TAGGED_NODE 352| 226k| p->impl.d.kind = node_t::kind_t::leaf; 353| 226k|#endif 354| 226k| return p; 355| 226k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_eIiEEPSB_NS9_5applyIS6_E4type4editEOT_: 485| 12.7k| { 486| 12.7k| auto p = make_leaf_e(e); 487| 12.7k| IMMER_TRY { ------------------ | | 49| 12.7k|#define IMMER_TRY try ------------------ 488| 12.7k| new (p->leaf()) T(std::forward(x)); 489| 12.7k| } 490| 12.7k| 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.7k| return p; 495| 12.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEj: 930| 67.4k| { 931| 67.4k| auto src_r = relaxed(); 932| 67.4k| return static_if( 933| 67.4k| [&](auto) { return src_r; }, 934| 67.4k| [&](auto) { 935| 67.4k| if (node_t::refs(src_r).unique() || 936| 67.4k| node_t::ownee(src_r).can_mutate(e)) 937| 67.4k| return src_r; 938| 67.4k| else { 939| 67.4k| auto dst_r = 940| 67.4k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 67.4k| if (src_r) { 942| 67.4k| std::copy( 943| 67.4k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 67.4k| if (node_t::refs(src_r).dec()) 945| 67.4k| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 67.4k| src_r); 947| 67.4k| } 948| 67.4k| dst_r->d.count = n; 949| 67.4k| node_t::ownee(dst_r) = e; 950| 67.4k| return impl.d.data.inner.relaxed = dst_r; 951| 67.4k| } 952| 67.4k| }); 953| 67.4k| } _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| 67.4k| [&](auto) { 935| 67.4k| if (node_t::refs(src_r).unique() || ------------------ | Branch (935:21): [True: 57.8k, False: 9.57k] ------------------ 936| 9.57k| node_t::ownee(src_r).can_mutate(e)) ------------------ | Branch (936:21): [True: 0, False: 9.57k] ------------------ 937| 57.8k| return src_r; 938| 9.57k| else { 939| 9.57k| auto dst_r = 940| 9.57k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 9.57k| if (src_r) { ------------------ | Branch (941:25): [True: 9.57k, False: 0] ------------------ 942| 9.57k| std::copy( 943| 9.57k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 9.57k| if (node_t::refs(src_r).dec()) ------------------ | Branch (944:29): [True: 0, False: 9.57k] ------------------ 945| 0| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 0| src_r); 947| 9.57k| } 948| 9.57k| dst_r->d.count = n; 949| 9.57k| node_t::ownee(dst_r) = e; 950| 9.57k| return impl.d.data.inner.relaxed = dst_r; 951| 9.57k| } 952| 67.4k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14copy_inner_r_eENS9_5applyIS6_E4type4editEPSB_j: 596| 17.5k| { 597| 17.5k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 17.5k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (597:9): [True: 17.5k, False: 0] ------------------ 598| 17.5k| auto dst = make_inner_r_e(e); 599| 17.5k| return do_copy_inner_r(dst, src, n); 600| 17.5k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14make_inner_r_eENS9_5applyIS6_E4type4editE: 286| 121k| { 287| 121k| auto mp = heap::allocate(max_sizeof_inner_r); 288| 121k| auto mr = static_cast(nullptr); 289| 121k| if (embed_relaxed) { ------------------ | Branch (289:13): [Folded, False: 121k] ------------------ 290| 0| mr = reinterpret_cast(mp) + max_sizeof_inner; 291| 121k| } else { 292| 121k| IMMER_TRY { ------------------ | | 49| 121k|#define IMMER_TRY try ------------------ 293| 121k| mr = heap::allocate(max_sizeof_relaxed, norefs_tag{}); 294| 121k| } 295| 121k| IMMER_CATCH (...) { 296| 0| heap::deallocate(max_sizeof_inner_r, mp); 297| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 298| 0| } 299| 121k| } 300| 121k| auto p = new (mp) node_t; 301| 121k| auto r = new (mr) relaxed_t; 302| 121k| ownee(p) = e; 303| 121k| static_if([&](auto) { node_t::ownee(r) = e; }); 304| 121k| r->d.count = 0; 305| 121k| p->impl.d.data.inner.relaxed = r; 306| 121k|#if IMMER_TAGGED_NODE 307| 121k| p->impl.d.kind = node_t::kind_t::inner; 308| 121k|#endif 309| 121k| return p; 310| 121k| } _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| 121k| 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| 289k| { 517| 289k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 289k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (517:9): [True: 289k, False: 0] ------------------ 518| 289k| if (shift == endshift) ------------------ | Branch (518:13): [True: 216k, False: 73.2k] ------------------ 519| 216k| return node; 520| 73.2k| else { 521| 73.2k| auto n = node_t::make_inner_e(e); 522| 73.2k| IMMER_TRY { ------------------ | | 49| 73.2k|#define IMMER_TRY try ------------------ 523| 73.2k| n->inner()[0] = make_path_e(e, shift - B, node); 524| 73.2k| } 525| 73.2k| IMMER_CATCH (...) { 526| 0| heap::deallocate(node_t::max_sizeof_inner, n); 527| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 528| 0| } 529| 73.2k| return n; 530| 73.2k| } 531| 289k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12make_inner_eENS9_5applyIS6_E4type4editE: 231| 94.6k| { 232| 94.6k| auto m = heap::allocate(max_sizeof_inner); 233| 94.6k| auto p = new (m) node_t; 234| 94.6k| ownee(p) = e; 235| 94.6k| p->impl.d.data.inner.relaxed = nullptr; 236| 94.6k|#if IMMER_TAGGED_NODE 237| 94.6k| p->impl.d.kind = node_t::kind_t::inner; 238| 94.6k|#endif 239| 94.6k| return p; 240| 94.6k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12copy_inner_eENS9_5applyIS6_E4type4editEPSB_j: 551| 13.5k| { 552| 13.5k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 13.5k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (552:9): [True: 13.5k, False: 0] ------------------ 553| 13.5k| auto dst = make_inner_e(e); 554| 13.5k| return do_copy_inner(dst, src, n); 555| 13.5k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE15copy_inner_sr_eENS9_5applyIS6_E4type4editEPSB_j: 603| 8.61k| { 604| 8.61k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 8.61k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (604:9): [True: 8.61k, False: 0] ------------------ 605| 8.61k| auto dst = make_inner_sr_e(e, src->relaxed()); 606| 8.61k| return do_copy_inner_sr(dst, src, n); 607| 8.61k| } _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| 8.61k| { 314| 8.61k| return static_if( 315| 8.61k| [&](auto) { return node_t::make_inner_r_e(e); }, 316| 8.61k| [&](auto) { 317| 8.61k| auto p = 318| 8.61k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 8.61k| node_t::refs(r).inc(); 320| 8.61k| p->impl.d.data.inner.relaxed = r; 321| 8.61k| node_t::ownee(p) = e; 322| 8.61k|#if IMMER_TAGGED_NODE 323| 8.61k| p->impl.d.kind = node_t::kind_t::inner; 324| 8.61k|#endif 325| 8.61k| return p; 326| 8.61k| }); 327| 8.61k| } _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| 8.61k| [&](auto) { 317| 8.61k| auto p = 318| 8.61k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 8.61k| node_t::refs(r).inc(); 320| 8.61k| p->impl.d.data.inner.relaxed = r; 321| 8.61k| node_t::ownee(p) = e; 322| 8.61k|#if IMMER_TAGGED_NODE 323| 8.61k| p->impl.d.kind = node_t::kind_t::inner; 324| 8.61k|#endif 325| 8.61k| return p; 326| 8.61k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE16do_copy_inner_srEPSB_SC_j: 640| 8.61k| { 641| 8.61k| if (embed_relaxed) ------------------ | Branch (641:13): [Folded, False: 8.61k] ------------------ 642| 0| return do_copy_inner_r(dst, src, n); 643| 8.61k| else { 644| 8.61k| inc_nodes(src->inner(), n); 645| 8.61k| std::copy(src->inner(), src->inner() + n, dst->inner()); 646| 8.61k| return dst; 647| 8.61k| } 648| 8.61k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jj: 763| 185k| { 764| 185k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 185k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (764:9): [True: 185k, False: 0] ------------------ 765| 185k| auto dst = make_leaf_e(e); 766| 185k| IMMER_TRY { ------------------ | | 49| 185k|#define IMMER_TRY try ------------------ 767| 185k| detail::uninitialized_copy( 768| 185k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 769| 185k| } 770| 185k| IMMER_CATCH (...) { 771| 0| heap::deallocate(max_sizeof_leaf, dst); 772| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 773| 0| } 774| 185k| return dst; 775| 185k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE22ensure_mutable_relaxedENS9_5applyIS6_E4type4editE: 877| 168k| { 878| 168k| auto src_r = relaxed(); 879| 168k| return static_if( 880| 168k| [&](auto) { return src_r; }, 881| 168k| [&](auto) { 882| 168k| if (node_t::refs(src_r).unique() || 883| 168k| node_t::ownee(src_r).can_mutate(e)) 884| 168k| return src_r; 885| 168k| else { 886| 168k| auto dst_r = impl.d.data.inner.relaxed = 887| 168k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 168k| if (src_r) { 889| 168k| auto n = dst_r->d.count = src_r->d.count; 890| 168k| std::copy( 891| 168k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 168k| if (node_t::refs(src_r).dec()) 893| 168k| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 168k| src_r); 895| 168k| } 896| 168k| node_t::ownee(dst_r) = e; 897| 168k| return dst_r; 898| 168k| } 899| 168k| }); 900| 168k| } _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| 168k| [&](auto) { 882| 168k| if (node_t::refs(src_r).unique() || ------------------ | Branch (882:21): [True: 152k, False: 15.7k] ------------------ 883| 15.7k| node_t::ownee(src_r).can_mutate(e)) ------------------ | Branch (883:21): [True: 0, False: 15.7k] ------------------ 884| 152k| return src_r; 885| 15.7k| else { 886| 15.7k| auto dst_r = impl.d.data.inner.relaxed = 887| 15.7k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 15.7k| if (src_r) { ------------------ | Branch (888:25): [True: 15.7k, False: 0] ------------------ 889| 15.7k| auto n = dst_r->d.count = src_r->d.count; 890| 15.7k| std::copy( 891| 15.7k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 15.7k| if (node_t::refs(src_r).dec()) ------------------ | Branch (892:29): [True: 0, False: 15.7k] ------------------ 893| 0| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 0| src_r); 895| 15.7k| } 896| 15.7k| node_t::ownee(dst_r) = e; 897| 15.7k| return dst_r; 898| 15.7k| } 899| 168k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jSG_j: 738| 305| { 739| 305| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 305|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (739:9): [True: 305, False: 0] ------------------ 740| 305| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 305|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (740:9): [True: 305, False: 0] ------------------ 741| 305| auto dst = make_leaf_e(e); 742| 305| IMMER_TRY { ------------------ | | 49| 305|#define IMMER_TRY try ------------------ 743| 305| detail::uninitialized_copy( 744| 305| src1->leaf(), src1->leaf() + n1, dst->leaf()); 745| 305| } 746| 305| IMMER_CATCH (...) { 747| 0| heap::deallocate(max_sizeof_leaf, dst); 748| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 749| 0| } 750| 305| IMMER_TRY { ------------------ | | 49| 305|#define IMMER_TRY try ------------------ 751| 305| detail::uninitialized_copy( 752| 305| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 753| 305| } 754| 305| 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| 305| return dst; 760| 305| } _ZN5immer6detail4rbts11dec_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 523| 34.2M| { 524| 34.2M| using node_t = node_type; 525| 34.2M| auto node = p.node(); 526| 34.2M| if (node->dec()) { ------------------ | Branch (526:13): [True: 11.1M, False: 23.0M] ------------------ 527| 11.1M| p.each(this_t{}); 528| 11.1M| node_t::delete_inner_r(node, p.count()); 529| 11.1M| } 530| 34.2M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 534| 2.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: 614k, False: 1.90M] ------------------ 538| 614k| p.each(this_t{}); 539| 614k| node_t::delete_inner(node, p.count()); 540| 614k| } 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.26M| { 546| 1.26M| using node_t = node_type; 547| 1.26M| auto node = p.node(); 548| 1.26M| if (node->dec()) { ------------------ | Branch (548:13): [True: 573k, False: 692k] ------------------ 549| 573k| node_t::delete_leaf(node, p.count()); 550| 573k| } 551| 1.26M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 545| 484k| { 546| 484k| using node_t = node_type; 547| 484k| auto node = p.node(); 548| 484k| if (node->dec()) { ------------------ | Branch (548:13): [True: 20.6k, False: 463k] ------------------ 549| 20.6k| node_t::delete_leaf(node, p.count()); 550| 20.6k| } 551| 484k| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 534| 3.61M| { 535| 3.61M| using node_t = node_type; 536| 3.61M| auto node = p.node(); 537| 3.61M| if (node->dec()) { ------------------ | Branch (537:13): [True: 246k, False: 3.37M] ------------------ 538| 246k| p.each(this_t{}); 539| 246k| node_t::delete_inner(node, p.count()); 540| 246k| } 541| 3.61M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 534| 2.47M| { 535| 2.47M| using node_t = node_type; 536| 2.47M| auto node = p.node(); 537| 2.47M| if (node->dec()) { ------------------ | Branch (537:13): [True: 2.33M, False: 145k] ------------------ 538| 2.33M| p.each(this_t{}); 539| 2.33M| node_t::delete_inner(node, p.count()); 540| 2.33M| } 541| 2.47M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 534| 1.68M| { 535| 1.68M| using node_t = node_type; 536| 1.68M| auto node = p.node(); 537| 1.68M| if (node->dec()) { ------------------ | Branch (537:13): [True: 0, False: 1.68M] ------------------ 538| 0| p.each(this_t{}); 539| 0| node_t::delete_inner(node, p.count()); 540| 0| } 541| 1.68M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 545| 9.63M| { 546| 9.63M| using node_t = node_type; 547| 9.63M| auto node = p.node(); 548| 9.63M| if (node->dec()) { ------------------ | Branch (548:13): [True: 898k, False: 8.73M] ------------------ 549| 898k| node_t::delete_leaf(node, p.count()); 550| 898k| } 551| 9.63M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 545| 1.59M| { 546| 1.59M| using node_t = node_type; 547| 1.59M| auto node = p.node(); 548| 1.59M| if (node->dec()) { ------------------ | Branch (548:13): [True: 0, False: 1.59M] ------------------ 549| 0| node_t::delete_leaf(node, p.count()); 550| 0| } 551| 1.59M| } _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| 585k| { 792| 585k| auto level = pos.shift(); 793| 585k| auto idx = pos.count() - 1; 794| 585k| auto children = pos.size(idx); 795| 585k| auto new_idx = 796| 585k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (796:13): [True: 12.0k, False: 573k] | Branch (796:47): [True: 577, False: 572k] ------------------ 797| 585k| auto new_child = static_cast(nullptr); 798| 585k| if (new_idx >= branches) ------------------ | Branch (798:13): [True: 4.39k, False: 580k] ------------------ 799| 4.39k| return nullptr; 800| 580k| else if (idx == new_idx) { ------------------ | Branch (800:18): [True: 572k, False: 8.19k] ------------------ 801| 572k| new_child = pos.last_oh_csh(this_t{}, idx, children, tail, ts); 802| 572k| if (!new_child) { ------------------ | Branch (802:17): [True: 3.92k, False: 568k] ------------------ 803| 3.92k| if (++new_idx < branches) ------------------ | Branch (803:21): [True: 2.62k, False: 1.30k] ------------------ 804| 2.62k| new_child = node_t::make_path(level - B, tail); 805| 1.30k| else 806| 1.30k| return nullptr; 807| 3.92k| } 808| 572k| } else 809| 8.19k| new_child = node_t::make_path(level - B, tail); 810| 579k| IMMER_TRY { ------------------ | | 49| 579k|#define IMMER_TRY try ------------------ 811| 579k| auto count = new_idx + 1; 812| 579k| auto new_parent = 813| 579k| node_t::copy_inner_r_n(count, pos.node(), new_idx); 814| 579k| auto new_relaxed = new_parent->relaxed(); 815| 579k| new_parent->inner()[new_idx] = new_child; 816| 579k| new_relaxed->d.sizes[new_idx] = pos.size() + ts; 817| 579k| new_relaxed->d.count = count; 818| 579k| assert(new_relaxed->d.sizes[new_idx]); ------------------ | Branch (818:13): [True: 579k, False: 0] ------------------ 819| 579k| return new_parent; 820| 579k| } 821| 579k| 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| 579k| } _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| 219k| { 835| 219k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 219k, False: 0] ------------------ 836| 219k| auto idx = pos.index(pos.size() - 1); 837| 219k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 219k| auto count = new_idx + 1; 839| 219k| auto new_parent = node_t::make_inner_n(count); 840| 219k| IMMER_TRY { ------------------ | | 49| 219k|#define IMMER_TRY try ------------------ 841| 219k| new_parent->inner()[new_idx] = 842| 219k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 211k, False: 7.57k] ------------------ 843| | /* otherwise */ 844| 219k| : node_t::make_path(pos.shift() - B, tail); 845| 219k| } 846| 219k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 219k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 219k| } _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.29M| { 835| 2.29M| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 2.29M, False: 0] ------------------ 836| 2.29M| auto idx = pos.index(pos.size() - 1); 837| 2.29M| auto new_idx = pos.index(pos.size() + branches - 1); 838| 2.29M| auto count = new_idx + 1; 839| 2.29M| auto new_parent = node_t::make_inner_n(count); 840| 2.29M| IMMER_TRY { ------------------ | | 49| 2.29M|#define IMMER_TRY try ------------------ 841| 2.29M| new_parent->inner()[new_idx] = 842| 2.29M| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 1.76M, False: 527k] ------------------ 843| | /* otherwise */ 844| 2.29M| : node_t::make_path(pos.shift() - B, tail); 845| 2.29M| } 846| 2.29M| 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.29M| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 2.29M| } _ZN5immer6detail4rbts9dec_innerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEvPT_jm: 562| 553|{ 563| 553| visit_maybe_relaxed_sub(node, shift, size, dec_visitor()); 564| 553|} _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| 330k| { 835| 330k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 330k, False: 0] ------------------ 836| 330k| auto idx = pos.index(pos.size() - 1); 837| 330k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 330k| auto count = new_idx + 1; 839| 330k| auto new_parent = node_t::make_inner_n(count); 840| 330k| IMMER_TRY { ------------------ | | 49| 330k|#define IMMER_TRY try ------------------ 841| 330k| new_parent->inner()[new_idx] = 842| 330k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 315k, False: 14.8k] ------------------ 843| | /* otherwise */ 844| 330k| : node_t::make_path(pos.shift() - B, tail); 845| 330k| } 846| 330k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 330k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 330k| } 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| 101k| { 503| 101k| auto offset = pos.index(idx); 504| 101k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 101k| IMMER_TRY { ------------------ | | 49| 101k|#define IMMER_TRY try ------------------ 506| 101k| node->leaf()[offset] = 507| 101k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 101k| return node; 509| 101k| } 510| 101k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 101k| } 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| 270k| { 467| 270k| auto offset = pos.index(idx); 468| 270k| auto count = pos.count(); 469| 270k| auto node = node_t::make_inner_sr_n(count, pos.relaxed()); 470| 270k| IMMER_TRY { ------------------ | | 49| 270k|#define IMMER_TRY try ------------------ 471| 270k| auto child = pos.towards_oh(this_t{}, idx, offset, fn); 472| 270k| node_t::do_copy_inner_replace_sr( 473| 270k| node, pos.node(), count, offset, child); 474| 270k| return node; 475| 270k| } 476| 270k| IMMER_CATCH (...) { 477| 0| node_t::delete_inner_r(node, count); 478| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 479| 0| } 480| 270k| } 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| 31.9k| { 485| 31.9k| auto offset = pos.index(idx); 486| 31.9k| auto count = pos.count(); 487| 31.9k| auto node = node_t::make_inner_n(count); 488| 31.9k| IMMER_TRY { ------------------ | | 49| 31.9k|#define IMMER_TRY try ------------------ 489| 31.9k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 31.9k| node_t::do_copy_inner_replace( 491| 31.9k| node, pos.node(), count, offset, child); 492| 31.9k| return node; 493| 31.9k| } 494| 31.9k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 31.9k| } flex-vector.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_13full_leaf_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 502| 27.0k| { 503| 27.0k| auto offset = pos.index(idx); 504| 27.0k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 27.0k| IMMER_TRY { ------------------ | | 49| 27.0k|#define IMMER_TRY try ------------------ 506| 27.0k| node->leaf()[offset] = 507| 27.0k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 27.0k| return node; 509| 27.0k| } 510| 27.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| 27.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| 21.0k| { 485| 21.0k| auto offset = pos.index(idx); 486| 21.0k| auto count = pos.count(); 487| 21.0k| auto node = node_t::make_inner_n(count); 488| 21.0k| IMMER_TRY { ------------------ | | 49| 21.0k|#define IMMER_TRY try ------------------ 489| 21.0k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 21.0k| node_t::do_copy_inner_replace( 491| 21.0k| node, pos.node(), count, offset, child); 492| 21.0k| return node; 493| 21.0k| } 494| 21.0k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 21.0k| } 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.86k| { 503| 4.86k| auto offset = pos.index(idx); 504| 4.86k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 4.86k| IMMER_TRY { ------------------ | | 49| 4.86k|#define IMMER_TRY try ------------------ 506| 4.86k| node->leaf()[offset] = 507| 4.86k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 4.86k| return node; 509| 4.86k| } 510| 4.86k| 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.86k| } 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| 3.63k| { 485| 3.63k| auto offset = pos.index(idx); 486| 3.63k| auto count = pos.count(); 487| 3.63k| auto node = node_t::make_inner_n(count); 488| 3.63k| IMMER_TRY { ------------------ | | 49| 3.63k|#define IMMER_TRY try ------------------ 489| 3.63k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 3.63k| node_t::do_copy_inner_replace( 491| 3.63k| node, pos.node(), count, offset, child); 492| 3.63k| return node; 493| 3.63k| } 494| 3.63k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 3.63k| } _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| 33.9k| { 1097| 33.9k| auto idx = pos.index(last); 1098| 33.9k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [True: 33.9k, Folded] | Branch (1098:25): [True: 25.1k, False: 8.73k] ------------------ 1099| 25.1k| return pos.towards_oh(this_t{}, last, idx); 1100| 25.1k| } else { 1101| 8.73k| using std::get; 1102| 8.73k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 8.73k| auto next = get<1>(subs); 1104| 8.73k| auto ts = get<2>(subs); 1105| 8.73k| auto tail = get<3>(subs); 1106| 8.73k| IMMER_TRY { ------------------ | | 49| 8.73k|#define IMMER_TRY try ------------------ 1107| 8.73k| if (next) { ------------------ | Branch (1107:21): [True: 5.21k, False: 3.51k] ------------------ 1108| 5.21k| auto count = idx + 1; 1109| 5.21k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 5.21k| auto newr = newn->relaxed(); 1111| 5.21k| newn->inner()[idx] = next; 1112| 5.21k| newr->d.sizes[idx] = last + 1 - ts; 1113| 5.21k| newr->d.count = count; 1114| 5.21k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 5.21k, False: 0] ------------------ 1115| 5.21k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 5.21k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 0, False: 3.51k] ------------------ 1117| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 3.51k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [True: 3.51k, Folded] | Branch (1118:40): [True: 2.59k, False: 929] | Branch (1118:52): [True: 1.95k, False: 638] ------------------ 1119| 1.95k| auto newn = pos.node()->inner()[0]; 1120| 1.95k| return std::make_tuple( 1121| 1.95k| pos.shift() - B, newn->inc(), ts, tail); 1122| 1.95k| } else { 1123| 1.56k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 1.56k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 1.56k| } 1126| 8.73k| } 1127| 8.73k| 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.73k| } 1138| 33.9k| } _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.80k| { 1182| 1.80k| auto old_tail_size = pos.count(); 1183| 1.80k| auto new_tail_size = pos.index(last) + 1; 1184| 1.80k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 990, False: 819] ------------------ 1185| 1.80k| ? pos.node()->inc() 1186| 1.80k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.80k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.80k| } _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| 4.86k| { 1182| 4.86k| auto old_tail_size = pos.count(); 1183| 4.86k| auto new_tail_size = pos.index(last) + 1; 1184| 4.86k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 2.30k, False: 2.56k] ------------------ 1185| 4.86k| ? pos.node()->inc() 1186| 4.86k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 4.86k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 4.86k| } _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.1k| { 1097| 11.1k| auto idx = pos.index(last); 1098| 11.1k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [Folded, False: 11.1k] | Branch (1098:25): [True: 0, False: 0] ------------------ 1099| 0| return pos.towards_oh(this_t{}, last, idx); 1100| 11.1k| } else { 1101| 11.1k| using std::get; 1102| 11.1k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 11.1k| auto next = get<1>(subs); 1104| 11.1k| auto ts = get<2>(subs); 1105| 11.1k| auto tail = get<3>(subs); 1106| 11.1k| IMMER_TRY { ------------------ | | 49| 11.1k|#define IMMER_TRY try ------------------ 1107| 11.1k| if (next) { ------------------ | Branch (1107:21): [True: 5.76k, False: 5.38k] ------------------ 1108| 5.76k| auto count = idx + 1; 1109| 5.76k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 5.76k| auto newr = newn->relaxed(); 1111| 5.76k| newn->inner()[idx] = next; 1112| 5.76k| newr->d.sizes[idx] = last + 1 - ts; 1113| 5.76k| newr->d.count = count; 1114| 5.76k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 5.76k, False: 0] ------------------ 1115| 5.76k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 5.76k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 2.69k, False: 2.68k] ------------------ 1117| 2.69k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 2.69k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [Folded, False: 2.68k] | Branch (1118:40): [True: 0, False: 0] | Branch (1118:52): [True: 0, False: 0] ------------------ 1119| 0| auto newn = pos.node()->inner()[0]; 1120| 0| return std::make_tuple( 1121| 0| pos.shift() - B, newn->inc(), ts, tail); 1122| 2.68k| } else { 1123| 2.68k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 2.68k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 2.68k| } 1126| 11.1k| } 1127| 11.1k| 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.1k| } 1138| 11.1k| } _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.86k| { 1143| 3.86k| auto idx = pos.index(last); 1144| 3.86k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 3.86k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 3.86k| } else { 1147| 3.86k| using std::get; 1148| 3.86k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 3.86k| auto next = get<1>(subs); 1150| 3.86k| auto ts = get<2>(subs); 1151| 3.86k| auto tail = get<3>(subs); 1152| 3.86k| IMMER_TRY { ------------------ | | 49| 3.86k|#define IMMER_TRY try ------------------ 1153| 3.86k| if (next) { ------------------ | Branch (1153:21): [True: 1.75k, False: 2.10k] ------------------ 1154| 1.75k| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 1.75k| newn->inner()[idx] = next; 1156| 1.75k| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.10k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 1.33k, False: 770] ------------------ 1158| 1.33k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.33k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 770] | 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| 770| } else { 1164| 770| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 770| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 770| } 1167| 3.86k| } 1168| 3.86k| 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.86k| } 1177| 3.86k| } _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.24k| { 1182| 5.24k| auto old_tail_size = pos.count(); 1183| 5.24k| auto new_tail_size = pos.index(last) + 1; 1184| 5.24k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 3.30k, False: 1.93k] ------------------ 1185| 5.24k| ? pos.node()->inc() 1186| 5.24k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 5.24k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 5.24k| } _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.34k| { 1143| 2.34k| auto idx = pos.index(last); 1144| 2.34k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.34k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.34k| } else { 1147| 2.34k| using std::get; 1148| 2.34k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.34k| auto next = get<1>(subs); 1150| 2.34k| auto ts = get<2>(subs); 1151| 2.34k| auto tail = get<3>(subs); 1152| 2.34k| IMMER_TRY { ------------------ | | 49| 2.34k|#define IMMER_TRY try ------------------ 1153| 2.34k| if (next) { ------------------ | Branch (1153:21): [True: 416, False: 1.93k] ------------------ 1154| 416| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 416| newn->inner()[idx] = next; 1156| 416| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.93k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 862, False: 1.06k] ------------------ 1158| 862| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.06k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 1.06k] | 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.06k| } else { 1164| 1.06k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.06k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.06k| } 1167| 2.34k| } 1168| 2.34k| 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.34k| } 1177| 2.34k| } _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.28k| { 1182| 2.28k| auto old_tail_size = pos.count(); 1183| 2.28k| auto new_tail_size = pos.index(last) + 1; 1184| 2.28k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.09k, False: 1.19k] ------------------ 1185| 2.28k| ? pos.node()->inc() 1186| 2.28k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 2.28k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 2.28k| } _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.76k| { 1143| 4.76k| auto idx = pos.index(last); 1144| 4.76k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 4.76k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 4.76k| } else { 1147| 4.76k| using std::get; 1148| 4.76k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 4.76k| auto next = get<1>(subs); 1150| 4.76k| auto ts = get<2>(subs); 1151| 4.76k| auto tail = get<3>(subs); 1152| 4.76k| IMMER_TRY { ------------------ | | 49| 4.76k|#define IMMER_TRY try ------------------ 1153| 4.76k| if (next) { ------------------ | Branch (1153:21): [True: 1.39k, False: 3.36k] ------------------ 1154| 1.39k| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 1.39k| newn->inner()[idx] = next; 1156| 1.39k| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 3.36k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 1.65k, False: 1.71k] ------------------ 1158| 1.65k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.71k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 1.71k] | Branch (1159:40): [True: 0, False: 0] | Branch (1159:52): [True: 0, False: 0] ------------------ 1160| 0| auto newn = pos.node()->inner()[0]; 1161| 0| return std::make_tuple( 1162| 0| pos.shift() - B, newn->inc(), ts, tail); 1163| 1.71k| } else { 1164| 1.71k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.71k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.71k| } 1167| 4.76k| } 1168| 4.76k| 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.76k| } 1177| 4.76k| } _ZN5immer6detail4rbts8dec_leafINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEvPT_j: 556| 38.8k|{ 557| 38.8k| make_leaf_sub_pos(node, n).visit(dec_visitor{}); 558| 38.8k|} _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 5.95k| { 1143| 5.95k| auto idx = pos.index(last); 1144| 5.95k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 5.95k, Folded] | Branch (1144:25): [True: 3.40k, False: 2.54k] ------------------ 1145| 3.40k| return pos.towards_oh(this_t{}, last, idx); 1146| 3.40k| } else { 1147| 2.54k| using std::get; 1148| 2.54k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.54k| auto next = get<1>(subs); 1150| 2.54k| auto ts = get<2>(subs); 1151| 2.54k| auto tail = get<3>(subs); 1152| 2.54k| IMMER_TRY { ------------------ | | 49| 2.54k|#define IMMER_TRY try ------------------ 1153| 2.54k| if (next) { ------------------ | Branch (1153:21): [True: 680, False: 1.86k] ------------------ 1154| 680| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 680| newn->inner()[idx] = next; 1156| 680| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.86k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 1.86k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.86k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 1.86k, Folded] | Branch (1159:40): [True: 1.52k, False: 339] | Branch (1159:52): [True: 1.10k, False: 420] ------------------ 1160| 1.10k| auto newn = pos.node()->inner()[0]; 1161| 1.10k| return std::make_tuple( 1162| 1.10k| pos.shift() - B, newn->inc(), ts, tail); 1163| 1.10k| } else { 1164| 759| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 759| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 759| } 1167| 2.54k| } 1168| 2.54k| 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.54k| } 1177| 5.95k| } _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.63k| { 1182| 1.63k| auto old_tail_size = pos.count(); 1183| 1.63k| auto new_tail_size = pos.index(last) + 1; 1184| 1.63k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 727, False: 911] ------------------ 1185| 1.63k| ? pos.node()->inc() 1186| 1.63k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.63k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.63k| } _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.57k| { 1143| 2.57k| auto idx = pos.index(last); 1144| 2.57k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 2.57k, Folded] | Branch (1144:25): [True: 1.46k, False: 1.11k] ------------------ 1145| 1.46k| return pos.towards_oh(this_t{}, last, idx); 1146| 1.46k| } else { 1147| 1.11k| using std::get; 1148| 1.11k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 1.11k| auto next = get<1>(subs); 1150| 1.11k| auto ts = get<2>(subs); 1151| 1.11k| auto tail = get<3>(subs); 1152| 1.11k| IMMER_TRY { ------------------ | | 49| 1.11k|#define IMMER_TRY try ------------------ 1153| 1.11k| if (next) { ------------------ | Branch (1153:21): [True: 345, False: 769] ------------------ 1154| 345| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 345| newn->inner()[idx] = next; 1156| 345| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 769| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 769] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 769| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 769, Folded] | Branch (1159:40): [True: 411, False: 358] | Branch (1159:52): [True: 127, False: 284] ------------------ 1160| 127| auto newn = pos.node()->inner()[0]; 1161| 127| return std::make_tuple( 1162| 127| pos.shift() - B, newn->inc(), ts, tail); 1163| 642| } else { 1164| 642| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 642| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 642| } 1167| 1.11k| } 1168| 1.11k| 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.11k| } 1177| 2.57k| } _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| 653| { 1182| 653| auto old_tail_size = pos.count(); 1183| 653| auto new_tail_size = pos.index(last) + 1; 1184| 653| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 270, False: 383] ------------------ 1185| 653| ? pos.node()->inc() 1186| 653| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 653| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 653| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE11visit_innerIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 14.4k| { 1415| 14.4k| auto idx = pos.subindex(first); 1416| 14.4k| auto count = pos.count(); 1417| 14.4k| auto left_size = pos.size_before(idx); 1418| 14.4k| auto child_size = pos.size_sbh(idx, left_size); 1419| 14.4k| auto dropped_size = first; 1420| 14.4k| auto child_dropped_size = dropped_size - left_size; 1421| 14.4k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 14.4k, Folded] | Branch (1421:25): [True: 12.9k, False: 1.55k] | Branch (1421:45): [True: 4.62k, False: 8.31k] ------------------ 1422| 4.62k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 9.86k| } else { 1424| 9.86k| using std::get; 1425| 9.86k| auto n = pos.node(); 1426| 9.86k| auto newc = count - idx; 1427| 9.86k| auto newn = node_t::make_inner_r_n(newc); 1428| 9.86k| IMMER_TRY { ------------------ | | 49| 9.86k|#define IMMER_TRY try ------------------ 1429| 9.86k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 9.86k| auto newr = newn->relaxed(); 1431| 9.86k| newr->d.count = count - idx; 1432| 9.86k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 9.86k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 9.86k, False: 0] ------------------ 1434| 9.86k| pos.copy_sizes(idx + 1, 1435| 9.86k| newr->d.count - 1, 1436| 9.86k| newr->d.sizes[0], 1437| 9.86k| newr->d.sizes + 1); 1438| 9.86k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 9.86k, False: 0] ------------------ 1439| 9.86k| pos.size() - dropped_size); 1440| 9.86k| newn->inner()[0] = get<1>(subs); 1441| 9.86k| std::copy(n->inner() + idx + 1, 1442| 9.86k| n->inner() + count, 1443| 9.86k| newn->inner() + 1); 1444| 9.86k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 9.86k| return std::make_tuple(pos.shift(), newn); 1446| 9.86k| } 1447| 9.86k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 9.86k| } 1452| 14.4k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1456| 7.85k| { 1457| 7.85k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 7.85k| return std::make_tuple(0, n); 1459| 7.85k| } _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| 43.8k| { 1415| 43.8k| auto idx = pos.subindex(first); 1416| 43.8k| auto count = pos.count(); 1417| 43.8k| auto left_size = pos.size_before(idx); 1418| 43.8k| auto child_size = pos.size_sbh(idx, left_size); 1419| 43.8k| auto dropped_size = first; 1420| 43.8k| auto child_dropped_size = dropped_size - left_size; 1421| 43.8k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 43.8k] | 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| 43.8k| } else { 1424| 43.8k| using std::get; 1425| 43.8k| auto n = pos.node(); 1426| 43.8k| auto newc = count - idx; 1427| 43.8k| auto newn = node_t::make_inner_r_n(newc); 1428| 43.8k| IMMER_TRY { ------------------ | | 49| 43.8k|#define IMMER_TRY try ------------------ 1429| 43.8k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 43.8k| auto newr = newn->relaxed(); 1431| 43.8k| newr->d.count = count - idx; 1432| 43.8k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 43.8k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 43.8k, False: 0] ------------------ 1434| 43.8k| pos.copy_sizes(idx + 1, 1435| 43.8k| newr->d.count - 1, 1436| 43.8k| newr->d.sizes[0], 1437| 43.8k| newr->d.sizes + 1); 1438| 43.8k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 43.8k, False: 0] ------------------ 1439| 43.8k| pos.size() - dropped_size); 1440| 43.8k| newn->inner()[0] = get<1>(subs); 1441| 43.8k| std::copy(n->inner() + idx + 1, 1442| 43.8k| n->inner() + count, 1443| 43.8k| newn->inner() + 1); 1444| 43.8k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 43.8k| return std::make_tuple(pos.shift(), newn); 1446| 43.8k| } 1447| 43.8k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 43.8k| } 1452| 43.8k| } _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.01k| { 1415| 2.01k| auto idx = pos.subindex(first); 1416| 2.01k| auto count = pos.count(); 1417| 2.01k| auto left_size = pos.size_before(idx); 1418| 2.01k| auto child_size = pos.size_sbh(idx, left_size); 1419| 2.01k| auto dropped_size = first; 1420| 2.01k| auto child_dropped_size = dropped_size - left_size; 1421| 2.01k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 2.01k] | 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.01k| } else { 1424| 2.01k| using std::get; 1425| 2.01k| auto n = pos.node(); 1426| 2.01k| auto newc = count - idx; 1427| 2.01k| auto newn = node_t::make_inner_r_n(newc); 1428| 2.01k| IMMER_TRY { ------------------ | | 49| 2.01k|#define IMMER_TRY try ------------------ 1429| 2.01k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 2.01k| auto newr = newn->relaxed(); 1431| 2.01k| newr->d.count = count - idx; 1432| 2.01k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 2.01k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 2.01k, False: 0] ------------------ 1434| 2.01k| pos.copy_sizes(idx + 1, 1435| 2.01k| newr->d.count - 1, 1436| 2.01k| newr->d.sizes[0], 1437| 2.01k| newr->d.sizes + 1); 1438| 2.01k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 2.01k, False: 0] ------------------ 1439| 2.01k| pos.size() - dropped_size); 1440| 2.01k| newn->inner()[0] = get<1>(subs); 1441| 2.01k| std::copy(n->inner() + idx + 1, 1442| 2.01k| n->inner() + count, 1443| 2.01k| newn->inner() + 1); 1444| 2.01k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 2.01k| return std::make_tuple(pos.shift(), newn); 1446| 2.01k| } 1447| 2.01k| 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.01k| } 1452| 2.01k| } _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.63k| { 1457| 8.63k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 8.63k| return std::make_tuple(0, n); 1459| 8.63k| } _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.19k| { 1415| 5.19k| auto idx = pos.subindex(first); 1416| 5.19k| auto count = pos.count(); 1417| 5.19k| auto left_size = pos.size_before(idx); 1418| 5.19k| auto child_size = pos.size_sbh(idx, left_size); 1419| 5.19k| auto dropped_size = first; 1420| 5.19k| auto child_dropped_size = dropped_size - left_size; 1421| 5.19k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 5.19k] | Branch (1421:25): [True: 0, False: 0] | Branch (1421:45): [True: 0, False: 0] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 5.19k| } else { 1424| 5.19k| using std::get; 1425| 5.19k| auto n = pos.node(); 1426| 5.19k| auto newc = count - idx; 1427| 5.19k| auto newn = node_t::make_inner_r_n(newc); 1428| 5.19k| IMMER_TRY { ------------------ | | 49| 5.19k|#define IMMER_TRY try ------------------ 1429| 5.19k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 5.19k| auto newr = newn->relaxed(); 1431| 5.19k| newr->d.count = count - idx; 1432| 5.19k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 5.19k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 5.19k, False: 0] ------------------ 1434| 5.19k| pos.copy_sizes(idx + 1, 1435| 5.19k| newr->d.count - 1, 1436| 5.19k| newr->d.sizes[0], 1437| 5.19k| newr->d.sizes + 1); 1438| 5.19k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 5.19k, False: 0] ------------------ 1439| 5.19k| pos.size() - dropped_size); 1440| 5.19k| newn->inner()[0] = get<1>(subs); 1441| 5.19k| std::copy(n->inner() + idx + 1, 1442| 5.19k| n->inner() + count, 1443| 5.19k| newn->inner() + 1); 1444| 5.19k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 5.19k| return std::make_tuple(pos.shift(), newn); 1446| 5.19k| } 1447| 5.19k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 5.19k| } 1452| 5.19k| } _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.00k| { 1415| 9.00k| auto idx = pos.subindex(first); 1416| 9.00k| auto count = pos.count(); 1417| 9.00k| auto left_size = pos.size_before(idx); 1418| 9.00k| auto child_size = pos.size_sbh(idx, left_size); 1419| 9.00k| auto dropped_size = first; 1420| 9.00k| auto child_dropped_size = dropped_size - left_size; 1421| 9.00k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 9.00k, Folded] | Branch (1421:25): [True: 6.29k, False: 2.71k] | Branch (1421:45): [True: 3.64k, False: 2.64k] ------------------ 1422| 3.64k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 5.35k| } else { 1424| 5.35k| using std::get; 1425| 5.35k| auto n = pos.node(); 1426| 5.35k| auto newc = count - idx; 1427| 5.35k| auto newn = node_t::make_inner_r_n(newc); 1428| 5.35k| IMMER_TRY { ------------------ | | 49| 5.35k|#define IMMER_TRY try ------------------ 1429| 5.35k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 5.35k| auto newr = newn->relaxed(); 1431| 5.35k| newr->d.count = count - idx; 1432| 5.35k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 5.35k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 5.35k, False: 0] ------------------ 1434| 5.35k| pos.copy_sizes(idx + 1, 1435| 5.35k| newr->d.count - 1, 1436| 5.35k| newr->d.sizes[0], 1437| 5.35k| newr->d.sizes + 1); 1438| 5.35k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 5.35k, False: 0] ------------------ 1439| 5.35k| pos.size() - dropped_size); 1440| 5.35k| newn->inner()[0] = get<1>(subs); 1441| 5.35k| std::copy(n->inner() + idx + 1, 1442| 5.35k| n->inner() + count, 1443| 5.35k| newn->inner() + 1); 1444| 5.35k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 5.35k| return std::make_tuple(pos.shift(), newn); 1446| 5.35k| } 1447| 5.35k| 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.35k| } 1452| 9.00k| } _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: 513, False: 1.04k] | Branch (1421:45): [True: 303, False: 210] ------------------ 1422| 303| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 1.25k| } else { 1424| 1.25k| using std::get; 1425| 1.25k| auto n = pos.node(); 1426| 1.25k| auto newc = count - idx; 1427| 1.25k| auto newn = node_t::make_inner_r_n(newc); 1428| 1.25k| IMMER_TRY { ------------------ | | 49| 1.25k|#define IMMER_TRY try ------------------ 1429| 1.25k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 1.25k| auto newr = newn->relaxed(); 1431| 1.25k| newr->d.count = count - idx; 1432| 1.25k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 1.25k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 1.25k, False: 0] ------------------ 1434| 1.25k| pos.copy_sizes(idx + 1, 1435| 1.25k| newr->d.count - 1, 1436| 1.25k| newr->d.sizes[0], 1437| 1.25k| newr->d.sizes + 1); 1438| 1.25k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 1.25k, False: 0] ------------------ 1439| 1.25k| pos.size() - dropped_size); 1440| 1.25k| newn->inner()[0] = get<1>(subs); 1441| 1.25k| std::copy(n->inner() + idx + 1, 1442| 1.25k| n->inner() + count, 1443| 1.25k| newn->inner() + 1); 1444| 1.25k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 1.25k| return std::make_tuple(pos.shift(), newn); 1446| 1.25k| } 1447| 1.25k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 1.25k| } 1452| 1.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.85k|{ 2002| 7.85k| return make_singleton_regular_sub_pos(ltail, ltcount) 2003| 7.85k| .visit(concat_trees_left_visitor{}, 2004| 7.85k| empty_leaf_pos{}, 2005| 7.85k| rroot, 2006| 7.85k| rshift, 2007| 7.85k| rsize) 2008| 7.85k| .realize(); 2009| 7.85k|} _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.85k| { 1972| 7.85k| return visit_maybe_relaxed_sub( 1973| 7.85k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 7.85k| } _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.52k| { 1959| 5.52k| return concat_inners(lpos, tpos, rpos); 1960| 5.52k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 24.1k|{ 1873| 24.1k| auto lshift = lpos.shift(); 1874| 24.1k| auto rshift = rpos.shift(); 1875| 24.1k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 24.1k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 24.1k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 19.0k, False: 5.11k] ------------------ 1879| 19.0k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 19.0k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 19.0k| } else { 1882| 5.11k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 5.11k, False: 0] ------------------ 1883| 5.11k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 5.11k] | Branch (1883:9): [True: 5.11k, False: 0] | Branch (1883:9): [True: 5.11k, False: 0] ------------------ 1884| 5.11k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 5.11k| return concat_rebalance(lpos, cpos, rpos); 1886| 5.11k| } 1887| 24.1k|} _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8each_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_: 1512| 5.29M| { 1513| 5.29M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 499k, False: 4.79M] ------------------ 1514| 499k| auto s = size_t{}; 1515| 1.99M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 1.49M, False: 499k] ------------------ 1516| 1.49M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 1.49M| s = sizes_[i]; 1518| 1.49M| } 1519| 4.79M| } else { 1520| 12.2M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 7.42M, False: 4.79M] ------------------ 1521| 7.42M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 7.42M| .visit(v, args...); 1523| 4.79M| } 1524| 5.29M| } _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.33M| { 1734| 2.33M| auto count = p.count(); 1735| 2.33M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 2.33M, False: 0] ------------------ 1736| 2.33M| plan.counts[plan.n++] = count; 1737| 2.33M| plan.total += count; 1738| 2.33M| } _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| 19.7M| { 1734| 19.7M| auto count = p.count(); 1735| 19.7M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 19.7M, False: 0] ------------------ 1736| 19.7M| plan.counts[plan.n++] = count; 1737| 19.7M| plan.total += count; 1738| 19.7M| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE7shuffleEj: 1762| 5.29M| { 1763| | // gcc seems to not really understand this code... :( 1764| 5.29M|#if !defined(_MSC_VER) 1765| 5.29M|#pragma GCC diagnostic push 1766| 5.29M|#pragma GCC diagnostic ignored "-Warray-bounds" 1767| 5.29M|#endif 1768| 5.29M| constexpr count_t rrb_extras = 2; 1769| 5.29M| constexpr count_t rrb_invariant = 1; 1770| 5.29M| const auto bits = shift == BL ? BL : B; ------------------ | Branch (1770:43): [True: 499k, False: 4.79M] ------------------ 1771| 5.29M| const auto branches = count_t{1} << bits; 1772| 5.29M| const auto optimal = ((total - 1) >> bits) + 1; 1773| 5.29M| count_t i = 0; 1774| 6.20M| while (n >= optimal + rrb_extras) { ------------------ | Branch (1774:16): [True: 913k, False: 5.29M] ------------------ 1775| | // skip ok nodes 1776| 1.56M| while (counts[i] > branches - rrb_invariant) ------------------ | Branch (1776:20): [True: 647k, False: 913k] ------------------ 1777| 647k| i++; 1778| 913k| assert(i < n); ------------------ | Branch (1778:13): [True: 913k, False: 0] ------------------ 1779| | // short node, redistribute 1780| 913k| auto remaining = counts[i]; 1781| 2.14M| do { 1782| 2.14M| auto next = counts[i + 1]; 1783| 2.14M| auto count = std::min(remaining + next, branches); 1784| 2.14M| counts[i] = count; 1785| 2.14M| assert(counts[i]); ------------------ | Branch (1785:17): [True: 2.14M, False: 0] ------------------ 1786| 2.14M| remaining += next - count; 1787| 2.14M| ++i; 1788| 2.14M| } while (remaining > 0); ------------------ | Branch (1788:22): [True: 1.22M, False: 913k] ------------------ 1789| | // remove node 1790| 913k| std::move(counts + i + 1, counts + n, counts + i); 1791| 913k| --n; 1792| 913k| --i; 1793| 913k| } 1794| 5.29M|#if !defined(_MSC_VER) 1795| 5.29M|#pragma GCC diagnostic pop 1796| 5.29M|#endif 1797| 5.29M| } _ZNK5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 1478| 10.5M| 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.29M| : curr_{counts} 1578| 5.29M| , n_{n} 1579| 5.29M| , result_{ 1580| 5.29M| shift + B, node_t::make_inner_r_n(std::min(n_, branches)), 0} 1581| 5.29M| { 1582| 5.29M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEC2EjPSC_m: 1481| 5.29M| : shift_{s} 1482| 5.29M| , count_{1} 1483| 5.29M| , nodes_{n0} 1484| 5.29M| , sizes_{s0} 1485| 5.29M| { 1486| 5.29M| } _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.29M| { 1513| 5.29M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 499k, False: 4.79M] ------------------ 1514| 499k| auto s = size_t{}; 1515| 1.99M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 1.49M, False: 499k] ------------------ 1516| 1.49M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 1.49M| s = sizes_[i]; 1518| 1.49M| } 1519| 4.79M| } else { 1520| 12.2M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 7.42M, False: 4.79M] ------------------ 1521| 7.42M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 7.42M| .visit(v, args...); 1523| 4.79M| } 1524| 5.29M| } _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.33M| { 1722| 2.33M| merger.merge_leaf(p); 1723| 2.33M| } _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.33M| { 1615| 2.33M| auto from = p.node(); 1616| 2.33M| auto from_size = p.size(); 1617| 2.33M| auto from_count = p.count(); 1618| 2.33M| assert(from_size); ------------------ | Branch (1618:9): [True: 2.33M, False: 0] ------------------ 1619| 2.33M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 2.30M, False: 26.6k] | Branch (1619:21): [True: 2.29M, False: 15.4k] ------------------ 1620| 2.29M| add_child(from, from_size); 1621| 2.29M| from->inc(); 1622| 2.29M| } else { 1623| 42.1k| auto from_offset = count_t{}; 1624| 42.1k| auto from_data = from->leaf(); 1625| 52.4k| do { 1626| 52.4k| if (!to_) { ------------------ | Branch (1626:21): [True: 25.7k, False: 26.6k] ------------------ 1627| 25.7k| to_ = node_t::make_leaf_n(*curr_); 1628| 25.7k| to_offset_ = 0; 1629| 25.7k| } 1630| 52.4k| auto data = to_->leaf(); 1631| 52.4k| auto to_copy = 1632| 52.4k| std::min(from_count - from_offset, *curr_ - to_offset_); 1633| 52.4k| detail::uninitialized_copy(from_data + from_offset, 1634| 52.4k| from_data + from_offset + to_copy, 1635| 52.4k| data + to_offset_); 1636| 52.4k| to_offset_ += to_copy; 1637| 52.4k| from_offset += to_copy; 1638| 52.4k| if (*curr_ == to_offset_) { ------------------ | Branch (1638:21): [True: 25.7k, False: 26.6k] ------------------ 1639| 25.7k| add_child(to_, to_offset_); 1640| 25.7k| to_ = nullptr; 1641| 25.7k| } 1642| 52.4k| } while (from_offset != from_count); ------------------ | Branch (1642:22): [True: 10.2k, False: 42.1k] ------------------ 1643| 42.1k| } 1644| 2.33M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9add_childEPSC_m: 1589| 23.4M| { 1590| 23.4M| assert(size); ------------------ | Branch (1590:9): [True: 23.4M, False: 0] ------------------ 1591| 23.4M| ++curr_; 1592| 23.4M| auto parent = result_.nodes_[result_.count_ - 1]; 1593| 23.4M| auto relaxed = parent->relaxed(); 1594| 23.4M| if (relaxed->d.count == branches) { ------------------ | Branch (1594:13): [True: 2.67M, False: 20.8M] ------------------ 1595| 2.67M| assert(result_.count_ < result_t::max_children); ------------------ | Branch (1595:13): [True: 2.67M, False: 0] ------------------ 1596| 2.67M| n_ -= branches; 1597| 2.67M| parent = node_t::make_inner_r_n(std::min(n_, branches)); 1598| 2.67M| relaxed = parent->relaxed(); 1599| 2.67M| result_.nodes_[result_.count_] = parent; 1600| 2.67M| result_.sizes_[result_.count_] = result_.sizes_[result_.count_ - 1]; 1601| 2.67M| assert(result_.sizes_[result_.count_]); ------------------ | Branch (1601:13): [True: 2.67M, False: 0] ------------------ 1602| 2.67M| ++result_.count_; 1603| 2.67M| } 1604| 23.4M| auto idx = relaxed->d.count++; 1605| 23.4M| result_.sizes_[result_.count_ - 1] += size; 1606| 23.4M| assert(result_.sizes_[result_.count_ - 1]); ------------------ | Branch (1606:9): [True: 23.4M, False: 0] ------------------ 1607| 23.4M| relaxed->d.sizes[idx] = size + (idx ? relaxed->d.sizes[idx - 1] : 0); ------------------ | Branch (1607:41): [True: 15.5M, False: 7.96M] ------------------ 1608| 23.4M| assert(relaxed->d.sizes[idx]); ------------------ | Branch (1608:9): [True: 23.4M, False: 0] ------------------ 1609| 23.4M| parent->inner()[idx] = p; 1610| 23.4M| }; _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| 19.7M| { 1716| 19.7M| merger.merge_inner(p); 1717| 19.7M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11merge_innerIRNS1_11relaxed_posISC_EEEEvOT_: 1648| 19.7M| { 1649| 19.7M| auto from = p.node(); 1650| 19.7M| auto from_size = p.size(); 1651| 19.7M| auto from_count = p.count(); 1652| 19.7M| assert(from_size); ------------------ | Branch (1652:9): [True: 19.7M, False: 0] ------------------ 1653| 19.7M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 17.6M, False: 2.02M] | Branch (1653:21): [True: 16.8M, False: 881k] ------------------ 1654| 16.8M| add_child(from, from_size); 1655| 16.8M| from->inc(); 1656| 16.8M| } else { 1657| 2.90M| auto from_offset = count_t{}; 1658| 2.90M| auto from_data = from->inner(); 1659| 4.02M| do { 1660| 4.02M| if (!to_) { ------------------ | Branch (1660:21): [True: 2.00M, False: 2.02M] ------------------ 1661| 2.00M| to_ = node_t::make_inner_r_n(*curr_); 1662| 2.00M| to_offset_ = 0; 1663| 2.00M| to_size_ = 0; 1664| 2.00M| } 1665| 4.02M| auto data = to_->inner(); 1666| 4.02M| auto to_copy = 1667| 4.02M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 4.02M| std::copy(from_data + from_offset, 1669| 4.02M| from_data + from_offset + to_copy, 1670| 4.02M| data + to_offset_); 1671| 4.02M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 4.02M| auto sizes = to_->relaxed()->d.sizes; 1673| 4.02M| p.copy_sizes( 1674| 4.02M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 4.02M| to_offset_ += to_copy; 1676| 4.02M| from_offset += to_copy; 1677| 4.02M| to_size_ = sizes[to_offset_ - 1]; 1678| 4.02M| assert(to_size_); ------------------ | Branch (1678:17): [True: 4.02M, False: 0] ------------------ 1679| 4.02M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 2.00M, False: 2.02M] ------------------ 1680| 2.00M| to_->relaxed()->d.count = to_offset_; 1681| 2.00M| add_child(to_, to_size_); 1682| 2.00M| to_ = nullptr; 1683| 2.00M| } 1684| 4.02M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 1.12M, False: 2.90M] ------------------ 1685| 2.90M| } 1686| 19.7M| } _ZNK5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE6finishEv: 1689| 5.29M| { 1690| 5.29M| assert(!to_); ------------------ | Branch (1690:9): [True: 5.29M, False: 0] ------------------ 1691| 5.29M| return result_; 1692| 5.29M| } _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.29M| { 1513| 5.29M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 499k, False: 4.79M] ------------------ 1514| 499k| auto s = size_t{}; 1515| 1.99M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 1.49M, False: 499k] ------------------ 1516| 1.49M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 1.49M| s = sizes_[i]; 1518| 1.49M| } 1519| 4.79M| } else { 1520| 12.2M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 7.42M, False: 4.79M] ------------------ 1521| 7.42M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 7.42M| .visit(v, args...); 1523| 4.79M| } 1524| 5.29M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEC2EjPSC_mSE_mSE_m: 1503| 491k| : shift_{s} 1504| 491k| , count_{3} 1505| 491k| , nodes_{n0, n1, n2} 1506| 491k| , sizes_{s0, s0 + s1, s0 + s1 + s2} 1507| 491k| { 1508| 491k| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEC2EjPSC_mSE_m: 1489| 7.85k| : shift_{s} 1490| 7.85k| , count_{2} 1491| 7.85k| , nodes_{n0, n1} 1492| 7.85k| , sizes_{s0, s0 + s1} 1493| 7.85k| { 1494| 7.85k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 18.6k| { 1918| 18.6k| return concat_inners(lpos, tpos, rpos); 1919| 18.6k| } _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| 408| { 1918| 408| return concat_inners(lpos, tpos, rpos); 1919| 408| } _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.74k|{ 1873| 2.74k| auto lshift = lpos.shift(); 1874| 2.74k| auto rshift = rpos.shift(); 1875| 2.74k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 2.74k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 2.74k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 747, False: 1.99k] ------------------ 1879| 747| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 747| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.99k| } else { 1882| 1.99k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.99k, False: 0] ------------------ 1883| 1.99k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.99k] | Branch (1883:9): [True: 1.99k, False: 0] | Branch (1883:9): [True: 1.99k, False: 0] ------------------ 1884| 1.99k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.99k| return concat_rebalance(lpos, cpos, rpos); 1886| 1.99k| } 1887| 2.74k|} _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_8full_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 1.14k| { 1918| 1.14k| return concat_inners(lpos, tpos, rpos); 1919| 1.14k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 1.14k|{ 1873| 1.14k| auto lshift = lpos.shift(); 1874| 1.14k| auto rshift = rpos.shift(); 1875| 1.14k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 1.14k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 1.14k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 396, False: 747] ------------------ 1879| 396| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 396| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 747| } else { 1882| 747| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 747, False: 0] ------------------ 1883| 747| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 747] | Branch (1883:9): [True: 747, False: 0] | Branch (1883:9): [True: 747, False: 0] ------------------ 1884| 747| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 747| return concat_rebalance(lpos, cpos, rpos); 1886| 747| } 1887| 1.14k|} _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_12null_sub_posERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSE_IT_EEOT0_OT1_OT2_: 1823| 902|{ 1824| 902| auto plan = concat_rebalance_plan{}; 1825| 902| plan.fill(lpos, cpos, rpos); 1826| 902| plan.shuffle(cpos.shift()); 1827| 902| IMMER_TRY { ------------------ | | 49| 902|#define IMMER_TRY try ------------------ 1828| 902| return plan.merge(lpos, cpos, rpos); 1829| 902| } 1830| 902| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 902|} _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| 902| { 1753| 902| assert(n == 0u); ------------------ | Branch (1753:9): [True: 902, False: 0] ------------------ 1754| 902| assert(total == 0u); ------------------ | Branch (1754:9): [True: 902, False: 0] ------------------ 1755| 902| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 902| lpos.each_left_sub(visitor_t{}, *this); 1757| 902| cpos.each_sub(visitor_t{}, *this); 1758| 902| rpos.each_right_sub(visitor_t{}, *this); 1759| 902| } _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.00M| { 1734| 1.00M| auto count = p.count(); 1735| 1.00M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 1.00M, False: 0] ------------------ 1736| 1.00M| plan.counts[plan.n++] = count; 1737| 1.00M| plan.total += count; 1738| 1.00M| } _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| 704k| { 1734| 704k| auto count = p.count(); 1735| 704k| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 704k, False: 0] ------------------ 1736| 704k| plan.counts[plan.n++] = count; 1737| 704k| plan.total += count; 1738| 704k| } _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| 902| { 1803| 902| using node_t = node_type; 1804| 902| using merger_t = concat_merger; 1805| 902| using visitor_t = concat_merger_visitor; 1806| 902| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 902| IMMER_TRY { ------------------ | | 49| 902|#define IMMER_TRY try ------------------ 1808| 902| lpos.each_left_sub(visitor_t{}, merger); 1809| 902| cpos.each_sub(visitor_t{}, merger); 1810| 902| rpos.each_right_sub(visitor_t{}, merger); 1811| 902| cpos.each_sub(dec_visitor{}); 1812| 902| return merger.finish(); 1813| 902| } 1814| 902| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 902| } _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.00M| { 1722| 1.00M| merger.merge_leaf(p); 1723| 1.00M| } _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.00M| { 1615| 1.00M| auto from = p.node(); 1616| 1.00M| auto from_size = p.size(); 1617| 1.00M| auto from_count = p.count(); 1618| 1.00M| assert(from_size); ------------------ | Branch (1618:9): [True: 1.00M, False: 0] ------------------ 1619| 1.00M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 1.00M, False: 0] | Branch (1619:21): [True: 1.00M, False: 0] ------------------ 1620| 1.00M| add_child(from, from_size); 1621| 1.00M| from->inc(); 1622| 1.00M| } 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.00M| } _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| 704k| { 1716| 704k| merger.merge_inner(p); 1717| 704k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11merge_innerIRNS1_8full_posISC_EEEEvOT_: 1648| 704k| { 1649| 704k| auto from = p.node(); 1650| 704k| auto from_size = p.size(); 1651| 704k| auto from_count = p.count(); 1652| 704k| assert(from_size); ------------------ | Branch (1652:9): [True: 704k, False: 0] ------------------ 1653| 704k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 704k, False: 0] | Branch (1653:21): [True: 704k, False: 0] ------------------ 1654| 704k| add_child(from, from_size); 1655| 704k| from->inc(); 1656| 704k| } 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| 704k| } _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| 747| { 1945| 747| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 747| } _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.74k| { 1925| 2.74k| return concat_leafs(lpos, tpos, rpos); 1926| 2.74k| } _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.74k|{ 1839| 2.74k| static_assert(Node::bits >= 2, ""); 1840| 2.74k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 2.74k, False: 0] ------------------ 1841| 2.74k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 2.74k, False: 0] ------------------ 1842| 2.74k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 2.74k, False: 0] ------------------ 1843| 2.74k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 2.74k] ------------------ 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.74k| else 1854| 2.74k| return { 1855| 2.74k| Node::bits_leaf, 1856| 2.74k| lpos.node()->inc(), 1857| 2.74k| lpos.count(), 1858| 2.74k| rpos.node()->inc(), 1859| 2.74k| rpos.count(), 1860| 2.74k| }; 1861| 2.74k|} _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| 747|{ 1824| 747| auto plan = concat_rebalance_plan{}; 1825| 747| plan.fill(lpos, cpos, rpos); 1826| 747| plan.shuffle(cpos.shift()); 1827| 747| IMMER_TRY { ------------------ | | 49| 747|#define IMMER_TRY try ------------------ 1828| 747| return plan.merge(lpos, cpos, rpos); 1829| 747| } 1830| 747| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 747|} _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| 747| { 1753| 747| assert(n == 0u); ------------------ | Branch (1753:9): [True: 747, False: 0] ------------------ 1754| 747| assert(total == 0u); ------------------ | Branch (1754:9): [True: 747, False: 0] ------------------ 1755| 747| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 747| lpos.each_left_sub(visitor_t{}, *this); 1757| 747| cpos.each_sub(visitor_t{}, *this); 1758| 747| rpos.each_right_sub(visitor_t{}, *this); 1759| 747| } _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| 747| { 1803| 747| using node_t = node_type; 1804| 747| using merger_t = concat_merger; 1805| 747| using visitor_t = concat_merger_visitor; 1806| 747| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 747| IMMER_TRY { ------------------ | | 49| 747|#define IMMER_TRY try ------------------ 1808| 747| lpos.each_left_sub(visitor_t{}, merger); 1809| 747| cpos.each_sub(visitor_t{}, merger); 1810| 747| rpos.each_right_sub(visitor_t{}, merger); 1811| 747| cpos.each_sub(dec_visitor{}); 1812| 747| return merger.finish(); 1813| 747| } 1814| 747| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 747| } _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| 1.97k|{ 1824| 1.97k| auto plan = concat_rebalance_plan{}; 1825| 1.97k| plan.fill(lpos, cpos, rpos); 1826| 1.97k| plan.shuffle(cpos.shift()); 1827| 1.97k| IMMER_TRY { ------------------ | | 49| 1.97k|#define IMMER_TRY try ------------------ 1828| 1.97k| return plan.merge(lpos, cpos, rpos); 1829| 1.97k| } 1830| 1.97k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.97k|} _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| 1.97k| { 1753| 1.97k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.97k, False: 0] ------------------ 1754| 1.97k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.97k, False: 0] ------------------ 1755| 1.97k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.97k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.97k| cpos.each_sub(visitor_t{}, *this); 1758| 1.97k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.97k| } _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| 648k| { 1734| 648k| auto count = p.count(); 1735| 648k| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 648k, False: 0] ------------------ 1736| 648k| plan.counts[plan.n++] = count; 1737| 648k| plan.total += count; 1738| 648k| } _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| 1.97k| { 1803| 1.97k| using node_t = node_type; 1804| 1.97k| using merger_t = concat_merger; 1805| 1.97k| using visitor_t = concat_merger_visitor; 1806| 1.97k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.97k| IMMER_TRY { ------------------ | | 49| 1.97k|#define IMMER_TRY try ------------------ 1808| 1.97k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.97k| cpos.each_sub(visitor_t{}, merger); 1810| 1.97k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.97k| cpos.each_sub(dec_visitor{}); 1812| 1.97k| return merger.finish(); 1813| 1.97k| } 1814| 1.97k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.97k| } _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| 648k| { 1716| 648k| merger.merge_inner(p); 1717| 648k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11merge_innerIRNS1_15regular_sub_posISC_EEEEvOT_: 1648| 648k| { 1649| 648k| auto from = p.node(); 1650| 648k| auto from_size = p.size(); 1651| 648k| auto from_count = p.count(); 1652| 648k| assert(from_size); ------------------ | Branch (1652:9): [True: 648k, False: 0] ------------------ 1653| 648k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 552k, False: 96.0k] | Branch (1653:21): [True: 552k, False: 0] ------------------ 1654| 552k| add_child(from, from_size); 1655| 552k| from->inc(); 1656| 552k| } else { 1657| 96.0k| auto from_offset = count_t{}; 1658| 96.0k| auto from_data = from->inner(); 1659| 192k| do { 1660| 192k| if (!to_) { ------------------ | Branch (1660:21): [True: 96.0k, False: 96.0k] ------------------ 1661| 96.0k| to_ = node_t::make_inner_r_n(*curr_); 1662| 96.0k| to_offset_ = 0; 1663| 96.0k| to_size_ = 0; 1664| 96.0k| } 1665| 192k| auto data = to_->inner(); 1666| 192k| auto to_copy = 1667| 192k| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 192k| std::copy(from_data + from_offset, 1669| 192k| from_data + from_offset + to_copy, 1670| 192k| data + to_offset_); 1671| 192k| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 192k| auto sizes = to_->relaxed()->d.sizes; 1673| 192k| p.copy_sizes( 1674| 192k| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 192k| to_offset_ += to_copy; 1676| 192k| from_offset += to_copy; 1677| 192k| to_size_ = sizes[to_offset_ - 1]; 1678| 192k| assert(to_size_); ------------------ | Branch (1678:17): [True: 192k, False: 0] ------------------ 1679| 192k| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 96.0k, False: 96.0k] ------------------ 1680| 96.0k| to_->relaxed()->d.count = to_offset_; 1681| 96.0k| add_child(to_, to_size_); 1682| 96.0k| to_ = nullptr; 1683| 96.0k| } 1684| 192k| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 96.0k, False: 96.0k] ------------------ 1685| 96.0k| } 1686| 648k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 1.99k| { 1945| 1.99k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 1.99k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EESH_RNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1924| 5.11k| { 1925| 5.11k| return concat_leafs(lpos, tpos, rpos); 1926| 5.11k| } _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.11k|{ 1839| 5.11k| static_assert(Node::bits >= 2, ""); 1840| 5.11k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 5.11k, False: 0] ------------------ 1841| 5.11k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 5.11k, False: 0] ------------------ 1842| 5.11k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 5.11k, False: 0] ------------------ 1843| 5.11k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 5.11k] ------------------ 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.11k| else 1854| 5.11k| return { 1855| 5.11k| Node::bits_leaf, 1856| 5.11k| lpos.node()->inc(), 1857| 5.11k| lpos.count(), 1858| 5.11k| rpos.node()->inc(), 1859| 5.11k| rpos.count(), 1860| 5.11k| }; 1861| 5.11k|} _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_15regular_sub_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 1.99k|{ 1824| 1.99k| auto plan = concat_rebalance_plan{}; 1825| 1.99k| plan.fill(lpos, cpos, rpos); 1826| 1.99k| plan.shuffle(cpos.shift()); 1827| 1.99k| IMMER_TRY { ------------------ | | 49| 1.99k|#define IMMER_TRY try ------------------ 1828| 1.99k| return plan.merge(lpos, cpos, rpos); 1829| 1.99k| } 1830| 1.99k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.99k|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEEvOT_OT0_OT1_: 1752| 1.99k| { 1753| 1.99k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.99k, False: 0] ------------------ 1754| 1.99k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.99k, False: 0] ------------------ 1755| 1.99k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.99k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.99k| cpos.each_sub(visitor_t{}, *this); 1758| 1.99k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.99k| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 1.99k| { 1803| 1.99k| using node_t = node_type; 1804| 1.99k| using merger_t = concat_merger; 1805| 1.99k| using visitor_t = concat_merger_visitor; 1806| 1.99k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.99k| IMMER_TRY { ------------------ | | 49| 1.99k|#define IMMER_TRY try ------------------ 1808| 1.99k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.99k| cpos.each_sub(visitor_t{}, merger); 1810| 1.99k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.99k| cpos.each_sub(dec_visitor{}); 1812| 1.99k| return merger.finish(); 1813| 1.99k| } 1814| 1.99k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.99k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_12null_sub_posERNS1_17concat_center_posISC_EERNS1_11relaxed_posISC_EEEENSE_IT_EEOT0_OT1_OT2_: 1823| 136k|{ 1824| 136k| auto plan = concat_rebalance_plan{}; 1825| 136k| plan.fill(lpos, cpos, rpos); 1826| 136k| plan.shuffle(cpos.shift()); 1827| 136k| IMMER_TRY { ------------------ | | 49| 136k|#define IMMER_TRY try ------------------ 1828| 136k| return plan.merge(lpos, cpos, rpos); 1829| 136k| } 1830| 136k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 136k|} _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| 136k| { 1753| 136k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 136k, False: 0] ------------------ 1754| 136k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 136k, False: 0] ------------------ 1755| 136k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 136k| lpos.each_left_sub(visitor_t{}, *this); 1757| 136k| cpos.each_sub(visitor_t{}, *this); 1758| 136k| rpos.each_right_sub(visitor_t{}, *this); 1759| 136k| } _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| 136k| { 1803| 136k| using node_t = node_type; 1804| 136k| using merger_t = concat_merger; 1805| 136k| using visitor_t = concat_merger_visitor; 1806| 136k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 136k| IMMER_TRY { ------------------ | | 49| 136k|#define IMMER_TRY try ------------------ 1808| 136k| lpos.each_left_sub(visitor_t{}, merger); 1809| 136k| cpos.each_sub(visitor_t{}, merger); 1810| 136k| rpos.each_right_sub(visitor_t{}, merger); 1811| 136k| cpos.each_sub(dec_visitor{}); 1812| 136k| return merger.finish(); 1813| 136k| } 1814| 136k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 136k| } _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.11k| { 1945| 5.11k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 5.11k| } _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.11k|{ 1824| 5.11k| auto plan = concat_rebalance_plan{}; 1825| 5.11k| plan.fill(lpos, cpos, rpos); 1826| 5.11k| plan.shuffle(cpos.shift()); 1827| 5.11k| IMMER_TRY { ------------------ | | 49| 5.11k|#define IMMER_TRY try ------------------ 1828| 5.11k| return plan.merge(lpos, cpos, rpos); 1829| 5.11k| } 1830| 5.11k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 5.11k|} _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.11k| { 1753| 5.11k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 5.11k, False: 0] ------------------ 1754| 5.11k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 5.11k, False: 0] ------------------ 1755| 5.11k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 5.11k| lpos.each_left_sub(visitor_t{}, *this); 1757| 5.11k| cpos.each_sub(visitor_t{}, *this); 1758| 5.11k| rpos.each_right_sub(visitor_t{}, *this); 1759| 5.11k| } _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.11k| { 1803| 5.11k| using node_t = node_type; 1804| 5.11k| using merger_t = concat_merger; 1805| 5.11k| using visitor_t = concat_merger_visitor; 1806| 5.11k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 5.11k| IMMER_TRY { ------------------ | | 49| 5.11k|#define IMMER_TRY try ------------------ 1808| 5.11k| lpos.each_left_sub(visitor_t{}, merger); 1809| 5.11k| cpos.each_sub(visitor_t{}, merger); 1810| 5.11k| rpos.each_right_sub(visitor_t{}, merger); 1811| 5.11k| cpos.each_sub(dec_visitor{}); 1812| 5.11k| return merger.finish(); 1813| 5.11k| } 1814| 5.11k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 5.11k| } _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.33k| { 1959| 2.33k| return concat_inners(lpos, tpos, rpos); 1960| 2.33k| } _ZNO5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7realizeEv: 1527| 499k| { 1528| 499k| if (count_ > 1) { ------------------ | Branch (1528:13): [True: 38.0k, False: 461k] ------------------ 1529| 38.0k| IMMER_TRY { ------------------ | | 49| 38.0k|#define IMMER_TRY try ------------------ 1530| 38.0k| auto result = node_t::make_inner_r_n(count_); 1531| 38.0k| auto r = result->relaxed(); 1532| 38.0k| r->d.count = count_; 1533| 38.0k| std::copy(nodes_, nodes_ + count_, result->inner()); 1534| 38.0k| std::copy(sizes_, sizes_ + count_, r->d.sizes); 1535| 38.0k| return {result, shift_, r}; 1536| 38.0k| } 1537| 38.0k| IMMER_CATCH (...) { 1538| 0| each_sub(dec_visitor{}); 1539| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1540| 0| } 1541| 461k| } else { 1542| 461k| assert(shift_ >= B + BL); ------------------ | Branch (1542:13): [True: 461k, False: 0] ------------------ 1543| 461k| return {nodes_[0], shift_ - B, nodes_[0]->relaxed()}; 1544| 461k| } 1545| 499k| } _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| 491k|{ 1987| 491k| return visit_maybe_relaxed_sub(lroot, 1988| 491k| lshift, 1989| 491k| lsize, 1990| 491k| concat_trees_left_visitor{}, 1991| 491k| make_leaf_pos(ltail, ltcount), 1992| 491k| rroot, 1993| 491k| rshift, 1994| 491k| rsize) 1995| 491k| .realize(); 1996| 491k|} _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| 477k| { 1972| 477k| return visit_maybe_relaxed_sub( 1973| 477k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 477k| } _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| 452k| { 1959| 452k| return concat_inners(lpos, tpos, rpos); 1960| 452k| } _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.24M|{ 1873| 4.24M| auto lshift = lpos.shift(); 1874| 4.24M| auto rshift = rpos.shift(); 1875| 4.24M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 2.02M, False: 2.21M] ------------------ 1876| 2.02M| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 2.02M| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 2.21M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 107k, False: 2.10M] ------------------ 1879| 107k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 107k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 2.10M| } else { 1882| 2.10M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 2.10M, False: 0] ------------------ 1883| 2.10M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 2.10M] | Branch (1883:9): [True: 2.10M, False: 0] | Branch (1883:9): [True: 2.10M, False: 0] ------------------ 1884| 2.10M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 2.10M| return concat_rebalance(lpos, cpos, rpos); 1886| 2.10M| } 1887| 4.24M|} _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.02M| { 1898| 2.02M| return concat_inners(lpos, tpos, rpos); 1899| 2.02M| } _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.81k| { 1898| 5.81k| return concat_inners(lpos, tpos, rpos); 1899| 5.81k| } _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| 614k|{ 1873| 614k| auto lshift = lpos.shift(); 1874| 614k| auto rshift = rpos.shift(); 1875| 614k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 3.59k, False: 611k] ------------------ 1876| 3.59k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 3.59k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 611k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 9.74k, False: 601k] ------------------ 1879| 9.74k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 9.74k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 601k| } else { 1882| 601k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 601k, False: 0] ------------------ 1883| 601k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 601k] | Branch (1883:9): [True: 601k, False: 0] | Branch (1883:9): [True: 601k, False: 0] ------------------ 1884| 601k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 601k| return concat_rebalance(lpos, cpos, rpos); 1886| 601k| } 1887| 614k|} _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EENS1_12null_sub_posEEENSG_IT_EEOT0_OT1_OT2_: 1823| 4.37k|{ 1824| 4.37k| auto plan = concat_rebalance_plan{}; 1825| 4.37k| plan.fill(lpos, cpos, rpos); 1826| 4.37k| plan.shuffle(cpos.shift()); 1827| 4.37k| IMMER_TRY { ------------------ | | 49| 4.37k|#define IMMER_TRY try ------------------ 1828| 4.37k| return plan.merge(lpos, cpos, rpos); 1829| 4.37k| } 1830| 4.37k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 4.37k|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEEvOT_OT0_OT1_: 1752| 4.37k| { 1753| 4.37k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 4.37k, False: 0] ------------------ 1754| 4.37k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 4.37k, False: 0] ------------------ 1755| 4.37k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 4.37k| lpos.each_left_sub(visitor_t{}, *this); 1757| 4.37k| cpos.each_sub(visitor_t{}, *this); 1758| 4.37k| rpos.each_right_sub(visitor_t{}, *this); 1759| 4.37k| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 4.37k| { 1803| 4.37k| using node_t = node_type; 1804| 4.37k| using merger_t = concat_merger; 1805| 4.37k| using visitor_t = concat_merger_visitor; 1806| 4.37k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 4.37k| IMMER_TRY { ------------------ | | 49| 4.37k|#define IMMER_TRY try ------------------ 1808| 4.37k| lpos.each_left_sub(visitor_t{}, merger); 1809| 4.37k| cpos.each_sub(visitor_t{}, merger); 1810| 4.37k| rpos.each_right_sub(visitor_t{}, merger); 1811| 4.37k| cpos.each_sub(dec_visitor{}); 1812| 4.37k| return merger.finish(); 1813| 4.37k| } 1814| 4.37k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 4.37k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 602k| { 1918| 602k| return concat_inners(lpos, tpos, rpos); 1919| 602k| } _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| 103k| { 1918| 103k| return concat_inners(lpos, tpos, rpos); 1919| 103k| } _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| 112k|{ 1873| 112k| auto lshift = lpos.shift(); 1874| 112k| auto rshift = rpos.shift(); 1875| 112k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 781, False: 111k] ------------------ 1876| 781| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 781| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 111k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 546, False: 111k] ------------------ 1879| 546| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 546| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 111k| } else { 1882| 111k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 111k, False: 0] ------------------ 1883| 111k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 111k] | Branch (1883:9): [True: 111k, False: 0] | Branch (1883:9): [True: 111k, False: 0] ------------------ 1884| 111k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 111k| return concat_rebalance(lpos, cpos, rpos); 1886| 111k| } 1887| 112k|} _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.17k| { 1898| 1.17k| return concat_inners(lpos, tpos, rpos); 1899| 1.17k| } _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| 122k| { 1918| 122k| return concat_inners(lpos, tpos, rpos); 1919| 122k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 122k|{ 1873| 122k| auto lshift = lpos.shift(); 1874| 122k| auto rshift = rpos.shift(); 1875| 122k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 122k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 122k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 219, False: 122k] ------------------ 1879| 219| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 219| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 122k| } else { 1882| 122k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 122k, False: 0] ------------------ 1883| 122k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 122k] | Branch (1883:9): [True: 122k, False: 0] | Branch (1883:9): [True: 122k, False: 0] ------------------ 1884| 122k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 122k| return concat_rebalance(lpos, cpos, rpos); 1886| 122k| } 1887| 122k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 70.7k| { 1945| 70.7k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 70.7k| } _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| 143k| { 1925| 143k| return concat_leafs(lpos, tpos, rpos); 1926| 143k| } _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| 143k|{ 1839| 143k| static_assert(Node::bits >= 2, ""); 1840| 143k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 143k, False: 0] ------------------ 1841| 143k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 143k, False: 0] ------------------ 1842| 143k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 143k, False: 0] ------------------ 1843| 143k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 143k, False: 0] ------------------ 1844| 143k| return { 1845| 143k| Node::bits_leaf, 1846| 143k| lpos.node()->inc(), 1847| 143k| lpos.count(), 1848| 143k| tpos.node()->inc(), 1849| 143k| tpos.count(), 1850| 143k| rpos.node()->inc(), 1851| 143k| rpos.count(), 1852| 143k| }; 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| 143k|} _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| 58.3k| { 1938| 58.3k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 58.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_EERNS1_8full_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 122k|{ 1824| 122k| auto plan = concat_rebalance_plan{}; 1825| 122k| plan.fill(lpos, cpos, rpos); 1826| 122k| plan.shuffle(cpos.shift()); 1827| 122k| IMMER_TRY { ------------------ | | 49| 122k|#define IMMER_TRY try ------------------ 1828| 122k| return plan.merge(lpos, cpos, rpos); 1829| 122k| } 1830| 122k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 122k|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEEvOT_OT0_OT1_: 1752| 122k| { 1753| 122k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 122k, False: 0] ------------------ 1754| 122k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 122k, False: 0] ------------------ 1755| 122k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 122k| lpos.each_left_sub(visitor_t{}, *this); 1757| 122k| cpos.each_sub(visitor_t{}, *this); 1758| 122k| rpos.each_right_sub(visitor_t{}, *this); 1759| 122k| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 122k| { 1803| 122k| using node_t = node_type; 1804| 122k| using merger_t = concat_merger; 1805| 122k| using visitor_t = concat_merger_visitor; 1806| 122k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 122k| IMMER_TRY { ------------------ | | 49| 122k|#define IMMER_TRY try ------------------ 1808| 122k| lpos.each_left_sub(visitor_t{}, merger); 1809| 122k| cpos.each_sub(visitor_t{}, merger); 1810| 122k| rpos.each_right_sub(visitor_t{}, merger); 1811| 122k| cpos.each_sub(dec_visitor{}); 1812| 122k| return merger.finish(); 1813| 122k| } 1814| 122k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 122k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 72.8k| { 1945| 72.8k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 72.8k| } _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| 348k| { 1925| 348k| return concat_leafs(lpos, tpos, rpos); 1926| 348k| } _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| 348k|{ 1839| 348k| static_assert(Node::bits >= 2, ""); 1840| 348k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 348k, False: 0] ------------------ 1841| 348k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 348k, False: 0] ------------------ 1842| 348k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 348k, False: 0] ------------------ 1843| 348k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 348k, False: 0] ------------------ 1844| 348k| return { 1845| 348k| Node::bits_leaf, 1846| 348k| lpos.node()->inc(), 1847| 348k| lpos.count(), 1848| 348k| tpos.node()->inc(), 1849| 348k| tpos.count(), 1850| 348k| rpos.node()->inc(), 1851| 348k| rpos.count(), 1852| 348k| }; 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| 348k|} _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| 63.1k| { 1938| 63.1k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 63.1k| } _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| 111k|{ 1824| 111k| auto plan = concat_rebalance_plan{}; 1825| 111k| plan.fill(lpos, cpos, rpos); 1826| 111k| plan.shuffle(cpos.shift()); 1827| 111k| IMMER_TRY { ------------------ | | 49| 111k|#define IMMER_TRY try ------------------ 1828| 111k| return plan.merge(lpos, cpos, rpos); 1829| 111k| } 1830| 111k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 111k|} _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| 111k| { 1753| 111k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 111k, False: 0] ------------------ 1754| 111k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 111k, False: 0] ------------------ 1755| 111k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 111k| lpos.each_left_sub(visitor_t{}, *this); 1757| 111k| cpos.each_sub(visitor_t{}, *this); 1758| 111k| rpos.each_right_sub(visitor_t{}, *this); 1759| 111k| } _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| 111k| { 1803| 111k| using node_t = node_type; 1804| 111k| using merger_t = concat_merger; 1805| 111k| using visitor_t = concat_merger_visitor; 1806| 111k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 111k| IMMER_TRY { ------------------ | | 49| 111k|#define IMMER_TRY try ------------------ 1808| 111k| lpos.each_left_sub(visitor_t{}, merger); 1809| 111k| cpos.each_sub(visitor_t{}, merger); 1810| 111k| rpos.each_right_sub(visitor_t{}, merger); 1811| 111k| cpos.each_sub(dec_visitor{}); 1812| 111k| return merger.finish(); 1813| 111k| } 1814| 111k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 111k| } _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| 348k| { 1945| 348k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 348k| } _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| 696k| { 1938| 696k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 696k| } _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| 601k|{ 1824| 601k| auto plan = concat_rebalance_plan{}; 1825| 601k| plan.fill(lpos, cpos, rpos); 1826| 601k| plan.shuffle(cpos.shift()); 1827| 601k| IMMER_TRY { ------------------ | | 49| 601k|#define IMMER_TRY try ------------------ 1828| 601k| return plan.merge(lpos, cpos, rpos); 1829| 601k| } 1830| 601k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 601k|} _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| 601k| { 1753| 601k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 601k, False: 0] ------------------ 1754| 601k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 601k, False: 0] ------------------ 1755| 601k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 601k| lpos.each_left_sub(visitor_t{}, *this); 1757| 601k| cpos.each_sub(visitor_t{}, *this); 1758| 601k| rpos.each_right_sub(visitor_t{}, *this); 1759| 601k| } _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| 601k| { 1803| 601k| using node_t = node_type; 1804| 601k| using merger_t = concat_merger; 1805| 601k| using visitor_t = concat_merger_visitor; 1806| 601k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 601k| IMMER_TRY { ------------------ | | 49| 601k|#define IMMER_TRY try ------------------ 1808| 601k| lpos.each_left_sub(visitor_t{}, merger); 1809| 601k| cpos.each_sub(visitor_t{}, merger); 1810| 601k| rpos.each_right_sub(visitor_t{}, merger); 1811| 601k| cpos.each_sub(dec_visitor{}); 1812| 601k| return merger.finish(); 1813| 601k| } 1814| 601k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 601k| } _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.15M|{ 1824| 2.15M| auto plan = concat_rebalance_plan{}; 1825| 2.15M| plan.fill(lpos, cpos, rpos); 1826| 2.15M| plan.shuffle(cpos.shift()); 1827| 2.15M| IMMER_TRY { ------------------ | | 49| 2.15M|#define IMMER_TRY try ------------------ 1828| 2.15M| return plan.merge(lpos, cpos, rpos); 1829| 2.15M| } 1830| 2.15M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.15M|} _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.15M| { 1753| 2.15M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.15M, False: 0] ------------------ 1754| 2.15M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.15M, False: 0] ------------------ 1755| 2.15M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.15M| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.15M| cpos.each_sub(visitor_t{}, *this); 1758| 2.15M| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.15M| } _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.15M| { 1803| 2.15M| using node_t = node_type; 1804| 2.15M| using merger_t = concat_merger; 1805| 2.15M| using visitor_t = concat_merger_visitor; 1806| 2.15M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.15M| IMMER_TRY { ------------------ | | 49| 2.15M|#define IMMER_TRY try ------------------ 1808| 2.15M| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.15M| cpos.each_sub(visitor_t{}, merger); 1810| 2.15M| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.15M| cpos.each_sub(dec_visitor{}); 1812| 2.15M| return merger.finish(); 1813| 2.15M| } 1814| 2.15M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.15M| } _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.76M| { 1918| 1.76M| return concat_inners(lpos, tpos, rpos); 1919| 1.76M| } _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| 7.46k| { 1918| 7.46k| return concat_inners(lpos, tpos, rpos); 1919| 7.46k| } _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| 162k|{ 1873| 162k| auto lshift = lpos.shift(); 1874| 162k| auto rshift = rpos.shift(); 1875| 162k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 130k, False: 32.1k] ------------------ 1876| 130k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 130k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 130k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 680, False: 31.4k] ------------------ 1879| 680| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 680| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 31.4k| } else { 1882| 31.4k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 31.4k, False: 0] ------------------ 1883| 31.4k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 31.4k] | Branch (1883:9): [True: 31.4k, False: 0] | Branch (1883:9): [True: 31.4k, False: 0] ------------------ 1884| 31.4k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 31.4k| return concat_rebalance(lpos, cpos, rpos); 1886| 31.4k| } 1887| 162k|} _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| 129k| { 1898| 129k| return concat_inners(lpos, tpos, rpos); 1899| 129k| } _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| 12.5k| { 1918| 12.5k| return concat_inners(lpos, tpos, rpos); 1919| 12.5k| } _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| 12.5k|{ 1873| 12.5k| auto lshift = lpos.shift(); 1874| 12.5k| auto rshift = rpos.shift(); 1875| 12.5k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 12.5k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 12.5k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 287, False: 12.2k] ------------------ 1879| 287| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 287| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 12.2k| } else { 1882| 12.2k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 12.2k, False: 0] ------------------ 1883| 12.2k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 12.2k] | Branch (1883:9): [True: 12.2k, False: 0] | Branch (1883:9): [True: 12.2k, False: 0] ------------------ 1884| 12.2k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 12.2k| return concat_rebalance(lpos, cpos, rpos); 1886| 12.2k| } 1887| 12.5k|} _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| 5.17k| { 1938| 5.17k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 5.17k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 12.2k|{ 1824| 12.2k| auto plan = concat_rebalance_plan{}; 1825| 12.2k| plan.fill(lpos, cpos, rpos); 1826| 12.2k| plan.shuffle(cpos.shift()); 1827| 12.2k| IMMER_TRY { ------------------ | | 49| 12.2k|#define IMMER_TRY try ------------------ 1828| 12.2k| return plan.merge(lpos, cpos, rpos); 1829| 12.2k| } 1830| 12.2k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 12.2k|} _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| 12.2k| { 1753| 12.2k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 12.2k, False: 0] ------------------ 1754| 12.2k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 12.2k, False: 0] ------------------ 1755| 12.2k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 12.2k| lpos.each_left_sub(visitor_t{}, *this); 1757| 12.2k| cpos.each_sub(visitor_t{}, *this); 1758| 12.2k| rpos.each_right_sub(visitor_t{}, *this); 1759| 12.2k| } _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| 12.2k| { 1803| 12.2k| using node_t = node_type; 1804| 12.2k| using merger_t = concat_merger; 1805| 12.2k| using visitor_t = concat_merger_visitor; 1806| 12.2k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 12.2k| IMMER_TRY { ------------------ | | 49| 12.2k|#define IMMER_TRY try ------------------ 1808| 12.2k| lpos.each_left_sub(visitor_t{}, merger); 1809| 12.2k| cpos.each_sub(visitor_t{}, merger); 1810| 12.2k| rpos.each_right_sub(visitor_t{}, merger); 1811| 12.2k| cpos.each_sub(dec_visitor{}); 1812| 12.2k| return merger.finish(); 1813| 12.2k| } 1814| 12.2k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 12.2k| } _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| 6.40k| { 1938| 6.40k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 6.40k| } _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| 31.4k|{ 1824| 31.4k| auto plan = concat_rebalance_plan{}; 1825| 31.4k| plan.fill(lpos, cpos, rpos); 1826| 31.4k| plan.shuffle(cpos.shift()); 1827| 31.4k| IMMER_TRY { ------------------ | | 49| 31.4k|#define IMMER_TRY try ------------------ 1828| 31.4k| return plan.merge(lpos, cpos, rpos); 1829| 31.4k| } 1830| 31.4k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 31.4k|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEEvOT_OT0_OT1_: 1752| 31.4k| { 1753| 31.4k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 31.4k, False: 0] ------------------ 1754| 31.4k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 31.4k, False: 0] ------------------ 1755| 31.4k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 31.4k| lpos.each_left_sub(visitor_t{}, *this); 1757| 31.4k| cpos.each_sub(visitor_t{}, *this); 1758| 31.4k| rpos.each_right_sub(visitor_t{}, *this); 1759| 31.4k| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 31.4k| { 1803| 31.4k| using node_t = node_type; 1804| 31.4k| using merger_t = concat_merger; 1805| 31.4k| using visitor_t = concat_merger_visitor; 1806| 31.4k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 31.4k| IMMER_TRY { ------------------ | | 49| 31.4k|#define IMMER_TRY try ------------------ 1808| 31.4k| lpos.each_left_sub(visitor_t{}, merger); 1809| 31.4k| cpos.each_sub(visitor_t{}, merger); 1810| 31.4k| rpos.each_right_sub(visitor_t{}, merger); 1811| 31.4k| cpos.each_sub(dec_visitor{}); 1812| 31.4k| return merger.finish(); 1813| 31.4k| } 1814| 31.4k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 31.4k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 1.66M| { 1938| 1.66M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 1.66M| } _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.10M|{ 1824| 2.10M| auto plan = concat_rebalance_plan{}; 1825| 2.10M| plan.fill(lpos, cpos, rpos); 1826| 2.10M| plan.shuffle(cpos.shift()); 1827| 2.10M| IMMER_TRY { ------------------ | | 49| 2.10M|#define IMMER_TRY try ------------------ 1828| 2.10M| return plan.merge(lpos, cpos, rpos); 1829| 2.10M| } 1830| 2.10M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.10M|} _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.10M| { 1753| 2.10M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.10M, False: 0] ------------------ 1754| 2.10M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.10M, False: 0] ------------------ 1755| 2.10M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.10M| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.10M| cpos.each_sub(visitor_t{}, *this); 1758| 2.10M| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.10M| } _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.10M| { 1803| 2.10M| using node_t = node_type; 1804| 2.10M| using merger_t = concat_merger; 1805| 2.10M| using visitor_t = concat_merger_visitor; 1806| 2.10M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.10M| IMMER_TRY { ------------------ | | 49| 2.10M|#define IMMER_TRY try ------------------ 1808| 2.10M| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.10M| cpos.each_sub(visitor_t{}, merger); 1810| 2.10M| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.10M| cpos.each_sub(dec_visitor{}); 1812| 2.10M| return merger.finish(); 1813| 2.10M| } 1814| 2.10M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.10M| } _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| 25.0k| { 1959| 25.0k| return concat_inners(lpos, tpos, rpos); 1960| 25.0k| } _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| 13.9k| { 1972| 13.9k| return visit_maybe_relaxed_sub( 1973| 13.9k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 13.9k| } _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| 5.98k| { 1959| 5.98k| return concat_inners(lpos, tpos, rpos); 1960| 5.98k| } _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| 8.00k| { 1959| 8.00k| return concat_inners(lpos, tpos, rpos); 1960| 8.00k| } _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| 55.2k| { 681| 55.2k| auto node = pos.node(); 682| 55.2k| auto level = pos.shift(); 683| 55.2k| auto idx = pos.count() - 1; 684| 55.2k| auto children = pos.size(idx); 685| 55.2k| auto new_idx = 686| 55.2k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 2.17k, False: 53.0k] | Branch (686:47): [True: 537, False: 52.5k] ------------------ 687| 55.2k| auto new_child = static_cast(nullptr); 688| 55.2k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [True: 55.2k, Folded] | Branch (688:38): [True: 51.8k, False: 3.35k] ------------------ 689| | 690| 55.2k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 1.06k, False: 54.1k] ------------------ 691| 1.06k| return nullptr; 692| 54.1k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 52.5k, False: 1.64k] ------------------ 693| 52.5k| new_child = 694| 52.5k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 50.1k, False: 2.34k] ------------------ 695| 52.5k| : pos.last_oh_csh( 696| 2.34k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 52.5k| if (!new_child) { ------------------ | Branch (697:17): [True: 769, False: 51.7k] ------------------ 698| 769| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 431, False: 338] ------------------ 699| 431| new_child = node_t::make_path_e(e, level - B, tail); 700| 338| else 701| 338| return nullptr; 702| 769| } 703| 52.5k| } else 704| 1.64k| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 53.8k| if (mutate) { ------------------ | Branch (706:13): [True: 51.6k, False: 2.23k] ------------------ 707| 51.6k| auto count = new_idx + 1; 708| 51.6k| auto relaxed = node->ensure_mutable_relaxed_n(e, new_idx); 709| 51.6k| node->inner()[new_idx] = new_child; 710| 51.6k| relaxed->d.sizes[new_idx] = pos.size() + ts; 711| 51.6k| relaxed->d.count = count; 712| 51.6k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (712:13): [True: 51.6k, False: 0] ------------------ 713| 51.6k| return node; 714| 51.6k| } else { 715| 2.23k| IMMER_TRY { ------------------ | | 49| 2.23k|#define IMMER_TRY try ------------------ 716| 2.23k| auto count = new_idx + 1; 717| 2.23k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 2.23k| auto relaxed = new_node->relaxed(); 719| 2.23k| new_node->inner()[new_idx] = new_child; 720| 2.23k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 2.23k| relaxed->d.count = count; 722| 2.23k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 2.23k, False: 0] ------------------ 723| 2.23k| if (Mutating) ------------------ | Branch (723:21): [True: 2.23k, Folded] ------------------ 724| 2.23k| pos.visit(dec_visitor{}); 725| 2.23k| return new_node; 726| 2.23k| } 727| 2.23k| 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.23k| } 737| 53.8k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEJRjEEEPSC_OT_NSA_5applyIS7_E4type4editESJ_DpOT0_: 741| 40.8k| { 742| 40.8k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 40.8k, False: 0] ------------------ 743| 40.8k| auto node = pos.node(); 744| 40.8k| auto idx = pos.index(pos.size() - 1); 745| 40.8k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 40.8k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 40.8k, Folded] | Branch (746:36): [True: 40.1k, False: 660] ------------------ 747| 40.8k| if (mutate) { ------------------ | Branch (747:13): [True: 40.1k, False: 660] ------------------ 748| 40.1k| node->inner()[new_idx] = 749| 40.1k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 39.3k, False: 779] ------------------ 750| | /* otherwise */ 751| 40.1k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 40.1k| return node; 753| 40.1k| } else { 754| 660| auto new_parent = node_t::make_inner_e(e); 755| 660| IMMER_TRY { ------------------ | | 49| 660|#define IMMER_TRY try ------------------ 756| 660| new_parent->inner()[new_idx] = 757| 660| idx == new_idx ------------------ | Branch (757:21): [True: 329, False: 331] ------------------ 758| 660| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 660| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 660| node_t::do_copy_inner(new_parent, node, new_idx); 762| 660| if (Mutating) ------------------ | Branch (762:21): [True: 660, Folded] ------------------ 763| 660| pos.visit(dec_visitor{}); 764| 660| return new_parent; 765| 660| } 766| 660| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 660| } 771| 40.8k| } _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| 947k| { 742| 947k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 947k, False: 0] ------------------ 743| 947k| auto node = pos.node(); 744| 947k| auto idx = pos.index(pos.size() - 1); 745| 947k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 947k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 947k, Folded] | Branch (746:36): [True: 946k, False: 537] ------------------ 747| 947k| if (mutate) { ------------------ | Branch (747:13): [True: 946k, False: 537] ------------------ 748| 946k| node->inner()[new_idx] = 749| 946k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 746k, False: 200k] ------------------ 750| | /* otherwise */ 751| 946k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 946k| return node; 753| 946k| } else { 754| 537| auto new_parent = node_t::make_inner_e(e); 755| 537| IMMER_TRY { ------------------ | | 49| 537|#define IMMER_TRY try ------------------ 756| 537| new_parent->inner()[new_idx] = 757| 537| idx == new_idx ------------------ | Branch (757:21): [True: 222, False: 315] ------------------ 758| 537| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 537| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 537| node_t::do_copy_inner(new_parent, node, new_idx); 762| 537| if (Mutating) ------------------ | Branch (762:21): [True: 537, Folded] ------------------ 763| 537| pos.visit(dec_visitor{}); 764| 537| return new_parent; 765| 537| } 766| 537| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 537| } 771| 947k| } _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.73k| { 742| 2.73k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 2.73k, False: 0] ------------------ 743| 2.73k| auto node = pos.node(); 744| 2.73k| auto idx = pos.index(pos.size() - 1); 745| 2.73k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 2.73k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 2.73k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 2.73k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 2.73k] ------------------ 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.73k| } else { 754| 2.73k| auto new_parent = node_t::make_inner_e(e); 755| 2.73k| IMMER_TRY { ------------------ | | 49| 2.73k|#define IMMER_TRY try ------------------ 756| 2.73k| new_parent->inner()[new_idx] = 757| 2.73k| idx == new_idx ------------------ | Branch (757:21): [True: 1.22k, False: 1.51k] ------------------ 758| 2.73k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 2.73k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 2.73k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 2.73k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 2.73k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 2.73k| return new_parent; 765| 2.73k| } 766| 2.73k| 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.73k| } 771| 2.73k| } _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.82k| { 681| 6.82k| auto node = pos.node(); 682| 6.82k| auto level = pos.shift(); 683| 6.82k| auto idx = pos.count() - 1; 684| 6.82k| auto children = pos.size(idx); 685| 6.82k| auto new_idx = 686| 6.82k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 909, False: 5.91k] | Branch (686:47): [True: 360, False: 5.55k] ------------------ 687| 6.82k| auto new_child = static_cast(nullptr); 688| 6.82k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [Folded, False: 6.82k] | Branch (688:38): [True: 0, False: 0] ------------------ 689| | 690| 6.82k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 557, False: 6.26k] ------------------ 691| 557| return nullptr; 692| 6.26k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 5.55k, False: 712] ------------------ 693| 5.55k| new_child = 694| 5.55k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 0, False: 5.55k] ------------------ 695| 5.55k| : pos.last_oh_csh( 696| 5.55k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 5.55k| if (!new_child) { ------------------ | Branch (697:17): [True: 495, False: 5.06k] ------------------ 698| 495| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 246, False: 249] ------------------ 699| 246| new_child = node_t::make_path_e(e, level - B, tail); 700| 249| else 701| 249| return nullptr; 702| 495| } 703| 5.55k| } else 704| 712| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 6.01k| if (mutate) { ------------------ | Branch (706:13): [True: 0, False: 6.01k] ------------------ 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| 6.01k| } else { 715| 6.01k| IMMER_TRY { ------------------ | | 49| 6.01k|#define IMMER_TRY try ------------------ 716| 6.01k| auto count = new_idx + 1; 717| 6.01k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 6.01k| auto relaxed = new_node->relaxed(); 719| 6.01k| new_node->inner()[new_idx] = new_child; 720| 6.01k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 6.01k| relaxed->d.count = count; 722| 6.01k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 6.01k, False: 0] ------------------ 723| 6.01k| if (Mutating) ------------------ | Branch (723:21): [Folded, False: 6.01k] ------------------ 724| 0| pos.visit(dec_visitor{}); 725| 6.01k| return new_node; 726| 6.01k| } 727| 6.01k| 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| 6.01k| } 737| 6.01k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEJRjEEEPSC_OT_NSA_5applyIS7_E4type4editESJ_DpOT0_: 741| 1.07k| { 742| 1.07k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 1.07k, False: 0] ------------------ 743| 1.07k| auto node = pos.node(); 744| 1.07k| auto idx = pos.index(pos.size() - 1); 745| 1.07k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 1.07k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 1.07k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 1.07k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 1.07k] ------------------ 748| 0| node->inner()[new_idx] = 749| 0| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 0, False: 0] ------------------ 750| | /* otherwise */ 751| 0| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 0| return node; 753| 1.07k| } else { 754| 1.07k| auto new_parent = node_t::make_inner_e(e); 755| 1.07k| IMMER_TRY { ------------------ | | 49| 1.07k|#define IMMER_TRY try ------------------ 756| 1.07k| new_parent->inner()[new_idx] = 757| 1.07k| idx == new_idx ------------------ | Branch (757:21): [True: 670, False: 405] ------------------ 758| 1.07k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 1.07k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 1.07k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 1.07k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 1.07k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 1.07k| return new_parent; 765| 1.07k| } 766| 1.07k| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 1.07k| } 771| 1.07k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_: 741| 165k| { 742| 165k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 165k, False: 0] ------------------ 743| 165k| auto node = pos.node(); 744| 165k| auto idx = pos.index(pos.size() - 1); 745| 165k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 165k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 165k, Folded] | Branch (746:36): [True: 165k, False: 531] ------------------ 747| 165k| if (mutate) { ------------------ | Branch (747:13): [True: 165k, False: 531] ------------------ 748| 165k| node->inner()[new_idx] = 749| 165k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 161k, False: 3.69k] ------------------ 750| | /* otherwise */ 751| 165k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 165k| return node; 753| 165k| } else { 754| 531| auto new_parent = node_t::make_inner_e(e); 755| 531| IMMER_TRY { ------------------ | | 49| 531|#define IMMER_TRY try ------------------ 756| 531| new_parent->inner()[new_idx] = 757| 531| idx == new_idx ------------------ | Branch (757:21): [True: 290, False: 241] ------------------ 758| 531| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 531| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 531| node_t::do_copy_inner(new_parent, node, new_idx); 762| 531| if (Mutating) ------------------ | Branch (762:21): [True: 531, Folded] ------------------ 763| 531| pos.visit(dec_visitor{}); 764| 531| return new_parent; 765| 531| } 766| 531| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 531| } 771| 165k| } _ZN5immer6detail4rbts17dec_empty_regularINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEvPT_: 580| 2.41k|{ 581| 2.41k| make_empty_regular_pos(node).visit(dec_visitor()); 582| 2.41k|} _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| 46.5k| { 596| 46.5k| auto offset = pos.index(idx); 597| 46.5k| auto count = pos.count(); 598| 46.5k| auto node = pos.node(); 599| 46.5k| if (node->can_mutate(e)) { ------------------ | Branch (599:13): [True: 37.9k, False: 8.61k] ------------------ 600| 37.9k| return pos.towards_oh( 601| 37.9k| this_t{}, idx, offset, e, &node->inner()[offset]); 602| 37.9k| } else { 603| 8.61k| auto new_node = node_t::copy_inner_sr_e(e, node, count); 604| 8.61k| IMMER_TRY { ------------------ | | 49| 8.61k|#define IMMER_TRY try ------------------ 605| 8.61k| auto& res = pos.towards_oh( 606| 8.61k| this_t{}, idx, offset, e, &new_node->inner()[offset]); 607| 8.61k| pos.visit(dec_visitor{}); 608| 8.61k| *location = new_node; 609| 8.61k| return res; 610| 8.61k| } 611| 8.61k| IMMER_CATCH (...) { 612| 0| dec_relaxed(new_node, pos.shift()); 613| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 614| 0| } 615| 8.61k| } 616| 46.5k| } _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| 8.05k| { 653| 8.05k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 8.05k, False: 0] ------------------ 654| 8.05k| auto node = pos.node(); 655| 8.05k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 6.64k, False: 1.41k] ------------------ 656| 6.64k| return node->leaf()[pos.index(idx)]; 657| 6.64k| } else { 658| 1.41k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 1.41k| pos.visit(dec_visitor{}); 660| 1.41k| *location = new_node; 661| 1.41k| return new_node->leaf()[pos.index(idx)]; 662| 1.41k| } 663| 8.05k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_regularIRNS1_15regular_sub_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 621| 6.81k| { 622| 6.81k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 6.81k, False: 0] ------------------ 623| 6.81k| auto offset = pos.index(idx); 624| 6.81k| auto count = pos.count(); 625| 6.81k| auto node = pos.node(); 626| 6.81k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 5.50k, False: 1.30k] ------------------ 627| 5.50k| return pos.towards_oh_ch( 628| 5.50k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 5.50k| } else { 630| 1.30k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.30k| IMMER_TRY { ------------------ | | 49| 1.30k|#define IMMER_TRY try ------------------ 632| 1.30k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.30k| idx, 634| 1.30k| offset, 635| 1.30k| count, 636| 1.30k| e, 637| 1.30k| &new_node->inner()[offset]); 638| 1.30k| pos.visit(dec_visitor{}); 639| 1.30k| *location = new_node; 640| 1.30k| return res; 641| 1.30k| } 642| 1.30k| 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.30k| } 647| 6.81k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_13full_leaf_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 652| 5.31k| { 653| 5.31k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 5.31k, False: 0] ------------------ 654| 5.31k| auto node = pos.node(); 655| 5.31k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 3.81k, False: 1.49k] ------------------ 656| 3.81k| return node->leaf()[pos.index(idx)]; 657| 3.81k| } else { 658| 1.49k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 1.49k| pos.visit(dec_visitor{}); 660| 1.49k| *location = new_node; 661| 1.49k| return new_node->leaf()[pos.index(idx)]; 662| 1.49k| } 663| 5.31k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_regularIRNS1_8full_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 621| 4.98k| { 622| 4.98k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 4.98k, False: 0] ------------------ 623| 4.98k| auto offset = pos.index(idx); 624| 4.98k| auto count = pos.count(); 625| 4.98k| auto node = pos.node(); 626| 4.98k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 3.66k, False: 1.32k] ------------------ 627| 3.66k| return pos.towards_oh_ch( 628| 3.66k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 3.66k| } else { 630| 1.32k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.32k| IMMER_TRY { ------------------ | | 49| 1.32k|#define IMMER_TRY try ------------------ 632| 1.32k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.32k| idx, 634| 1.32k| offset, 635| 1.32k| count, 636| 1.32k| e, 637| 1.32k| &new_node->inner()[offset]); 638| 1.32k| pos.visit(dec_visitor{}); 639| 1.32k| *location = new_node; 640| 1.32k| return res; 641| 1.32k| } 642| 1.32k| 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.32k| } 647| 4.98k| } _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.50k| { 653| 1.50k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 1.50k, False: 0] ------------------ 654| 1.50k| auto node = pos.node(); 655| 1.50k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 1.03k, False: 470] ------------------ 656| 1.03k| return node->leaf()[pos.index(idx)]; 657| 1.03k| } else { 658| 470| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 470| pos.visit(dec_visitor{}); 660| 470| *location = new_node; 661| 470| return new_node->leaf()[pos.index(idx)]; 662| 470| } 663| 1.50k| } _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.30k| { 622| 2.30k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 2.30k, False: 0] ------------------ 623| 2.30k| auto offset = pos.index(idx); 624| 2.30k| auto count = pos.count(); 625| 2.30k| auto node = pos.node(); 626| 2.30k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.93k, False: 368] ------------------ 627| 1.93k| return pos.towards_oh_ch( 628| 1.93k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.93k| } else { 630| 368| auto new_node = node_t::copy_inner_e(e, node, count); 631| 368| IMMER_TRY { ------------------ | | 49| 368|#define IMMER_TRY try ------------------ 632| 368| auto& res = pos.towards_oh_ch(this_t{}, 633| 368| idx, 634| 368| offset, 635| 368| count, 636| 368| e, 637| 368| &new_node->inner()[offset]); 638| 368| pos.visit(dec_visitor{}); 639| 368| *location = new_node; 640| 368| return res; 641| 368| } 642| 368| 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| 368| } 647| 2.30k| } _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| 56.4k| { 914| 56.4k| auto idx = pos.index(last); 915| 56.4k| auto node = pos.node(); 916| 56.4k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 56.4k, Folded] | Branch (916:35): [True: 48.4k, False: 8.02k] ------------------ 917| 56.4k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 56.4k, Folded] | Branch (917:25): [True: 40.0k, False: 16.4k] ------------------ 918| 40.0k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 35.5k, False: 4.42k] ------------------ 919| 40.0k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 40.0k| if (Mutating) ------------------ | Branch (920:17): [True: 40.0k, Folded] ------------------ 921| 40.0k| pos.visit(dec_right_visitor{}, count_t{1}); 922| 40.0k| return res; 923| 40.0k| } else { 924| 16.4k| using std::get; 925| 16.4k| auto subs = 926| 16.4k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 12.8k, False: 3.59k] ------------------ 927| 16.4k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 16.4k| auto next = get<1>(subs); 929| 16.4k| auto ts = get<2>(subs); 930| 16.4k| auto tail = get<3>(subs); 931| 16.4k| IMMER_TRY { ------------------ | | 49| 16.4k|#define IMMER_TRY try ------------------ 932| 16.4k| if (next) { ------------------ | Branch (932:21): [True: 10.9k, False: 5.47k] ------------------ 933| 10.9k| if (mutate) { ------------------ | Branch (933:25): [True: 8.89k, False: 2.09k] ------------------ 934| 8.89k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 8.89k| pos.each_right(dec_visitor{}, idx + 1); 936| 8.89k| node->inner()[idx] = next; 937| 8.89k| nodr->d.sizes[idx] = last + 1 - ts; 938| 8.89k| nodr->d.count = idx + 1; 939| 8.89k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 8.89k, False: 0] ------------------ 940| 8.89k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 8.89k| } else { 942| 2.09k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 2.09k| auto newr = newn->relaxed(); 944| 2.09k| newn->inner()[idx] = next; 945| 2.09k| newr->d.sizes[idx] = last + 1 - ts; 946| 2.09k| newr->d.count = idx + 1; 947| 2.09k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 2.09k, False: 0] ------------------ 948| 2.09k| if (Mutating) ------------------ | Branch (948:29): [True: 2.09k, Folded] ------------------ 949| 2.09k| pos.visit(dec_visitor{}); 950| 2.09k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 2.09k| } 952| 10.9k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 5.47k] ------------------ 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.47k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 5.47k, Folded] | Branch (956:40): [True: 4.22k, False: 1.25k] | Branch (956:52): [True: 3.75k, False: 469] ------------------ 957| 3.75k| auto newn = pos.node()->inner()[0]; 958| 3.75k| if (!mutate) ------------------ | Branch (958:25): [True: 901, False: 2.85k] ------------------ 959| 901| newn->inc(); 960| 3.75k| if (Mutating) ------------------ | Branch (960:25): [True: 3.75k, Folded] ------------------ 961| 3.75k| pos.visit(dec_right_visitor{}, count_t{2}); 962| 3.75k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 3.75k| } else { 964| 1.72k| if (mutate) { ------------------ | Branch (964:25): [True: 1.12k, False: 596] ------------------ 965| 1.12k| pos.each_right(dec_visitor{}, idx + 1); 966| 1.12k| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 1.12k| return std::make_tuple(pos.shift(), node, ts, tail); 968| 1.12k| } else { 969| 596| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 596| if (Mutating) ------------------ | Branch (970:29): [True: 596, Folded] ------------------ 971| 596| pos.visit(dec_visitor{}); 972| 596| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 596| } 974| 1.72k| } 975| 16.4k| } 976| 16.4k| 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| 16.4k| } 987| 56.4k| } _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.15k| { 1060| 1.15k| auto old_tail_size = pos.count(); 1061| 1.15k| auto new_tail_size = pos.index(last) + 1; 1062| 1.15k| auto node = pos.node(); 1063| 1.15k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.15k, Folded] | Branch (1063:42): [True: 336, False: 816] ------------------ 1064| 1.15k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 352, False: 800] ------------------ 1065| 352| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 352] ------------------ 1066| 0| node->inc(); 1067| 352| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 800| } else if (mutate) { ------------------ | Branch (1068:20): [True: 328, False: 472] ------------------ 1069| 328| detail::destroy_n(node->leaf() + new_tail_size, 1070| 328| old_tail_size - new_tail_size); 1071| 328| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 472| } else { 1073| 472| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 472| if (Mutating) ------------------ | Branch (1074:17): [True: 472, Folded] ------------------ 1075| 472| pos.visit(dec_visitor{}); 1076| 472| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 472| } 1078| 1.15k| } _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| 533| { 1060| 533| auto old_tail_size = pos.count(); 1061| 533| auto new_tail_size = pos.index(last) + 1; 1062| 533| auto node = pos.node(); 1063| 533| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 533] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 533| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 251, False: 282] ------------------ 1065| 251| if (!Mutating) ------------------ | Branch (1065:17): [True: 251, Folded] ------------------ 1066| 251| node->inc(); 1067| 251| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 282| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 282] ------------------ 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| 282| } else { 1073| 282| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 282| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 282] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 282| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 282| } 1078| 533| } _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| 15.9k| { 914| 15.9k| auto idx = pos.index(last); 915| 15.9k| auto node = pos.node(); 916| 15.9k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 15.9k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 15.9k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 15.9k, Folded] | Branch (917:25): [True: 13.5k, False: 2.47k] ------------------ 918| 13.5k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 0, False: 13.5k] ------------------ 919| 13.5k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 13.5k| if (Mutating) ------------------ | Branch (920:17): [Folded, False: 13.5k] ------------------ 921| 0| pos.visit(dec_right_visitor{}, count_t{1}); 922| 13.5k| return res; 923| 13.5k| } else { 924| 2.47k| using std::get; 925| 2.47k| auto subs = 926| 2.47k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 2.47k] ------------------ 927| 2.47k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 2.47k| auto next = get<1>(subs); 929| 2.47k| auto ts = get<2>(subs); 930| 2.47k| auto tail = get<3>(subs); 931| 2.47k| IMMER_TRY { ------------------ | | 49| 2.47k|#define IMMER_TRY try ------------------ 932| 2.47k| if (next) { ------------------ | Branch (932:21): [True: 776, False: 1.69k] ------------------ 933| 776| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 776] ------------------ 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| 776| } else { 942| 776| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 776| auto newr = newn->relaxed(); 944| 776| newn->inner()[idx] = next; 945| 776| newr->d.sizes[idx] = last + 1 - ts; 946| 776| newr->d.count = idx + 1; 947| 776| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 776, False: 0] ------------------ 948| 776| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 776] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 776| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 776| } 952| 1.69k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 1.69k] ------------------ 953| 0| if (Mutating) ------------------ | Branch (953:25): [Folded, False: 0] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 1.69k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 1.69k, Folded] | Branch (956:40): [True: 790, False: 904] | Branch (956:52): [True: 490, False: 300] ------------------ 957| 490| auto newn = pos.node()->inner()[0]; 958| 490| if (!mutate) ------------------ | Branch (958:25): [True: 490, False: 0] ------------------ 959| 490| newn->inc(); 960| 490| if (Mutating) ------------------ | Branch (960:25): [Folded, False: 490] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 490| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 1.20k| } else { 964| 1.20k| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 1.20k] ------------------ 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.20k| } else { 969| 1.20k| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 1.20k| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 1.20k] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 1.20k| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 1.20k| } 974| 1.20k| } 975| 2.47k| } 976| 2.47k| IMMER_CATCH (...) { 977| 0| assert(!mutate); ------------------ | Branch (977:17): [True: 0, False: 0] ------------------ 978| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] ------------------ 979| 0| if (next) ------------------ | Branch (979:21): [True: 0, False: 0] ------------------ 980| 0| dec_inner(next, 981| 0| pos.shift() - B, 982| 0| last + 1 - ts - pos.size_before(idx)); 983| 0| dec_leaf(tail, ts); 984| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 985| 0| } 986| 2.47k| } 987| 15.9k| } _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.42k| { 992| 1.42k| auto idx = pos.index(last); 993| 1.42k| auto node = pos.node(); 994| 1.42k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.42k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.42k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.42k, Folded] | Branch (995:25): [True: 392, False: 1.03k] ------------------ 996| 392| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 392] ------------------ 997| 392| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 392| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 392] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 392| return res; 1001| 1.03k| } else { 1002| 1.03k| using std::get; 1003| 1.03k| auto subs = 1004| 1.03k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 1.03k] ------------------ 1005| 1.03k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.03k| auto next = get<1>(subs); 1007| 1.03k| auto ts = get<2>(subs); 1008| 1.03k| auto tail = get<3>(subs); 1009| 1.03k| IMMER_TRY { ------------------ | | 49| 1.03k|#define IMMER_TRY try ------------------ 1010| 1.03k| if (next) { ------------------ | Branch (1010:21): [True: 223, False: 809] ------------------ 1011| 223| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 223] ------------------ 1012| 0| node->inner()[idx] = next; 1013| 0| pos.each_right(dec_visitor{}, idx + 1); 1014| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 223| } else { 1016| 223| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 223| newn->inner()[idx] = next; 1018| 223| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 223] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 223| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 223| } 1022| 809| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 809] ------------------ 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| 809| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 809, Folded] | Branch (1026:40): [True: 562, False: 247] | Branch (1026:52): [True: 209, False: 353] ------------------ 1027| 209| auto newn = pos.node()->inner()[0]; 1028| 209| if (!mutate) ------------------ | Branch (1028:25): [True: 209, False: 0] ------------------ 1029| 209| newn->inc(); 1030| 209| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 209] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 209| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 600| } else { 1034| 600| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 600] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 600| } else { 1038| 600| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 600| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 600] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 600| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 600| } 1043| 600| } 1044| 1.03k| } 1045| 1.03k| 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.03k| } 1055| 1.42k| } _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.40k| { 1060| 1.40k| auto old_tail_size = pos.count(); 1061| 1.40k| auto new_tail_size = pos.index(last) + 1; 1062| 1.40k| auto node = pos.node(); 1063| 1.40k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 1.40k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 1.40k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 686, False: 722] ------------------ 1065| 686| if (!Mutating) ------------------ | Branch (1065:17): [True: 686, Folded] ------------------ 1066| 686| node->inc(); 1067| 686| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 722| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 722] ------------------ 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| 722| } else { 1073| 722| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 722| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 722] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 722| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 722| } 1078| 1.40k| } _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.75k| { 992| 1.75k| auto idx = pos.index(last); 993| 1.75k| auto node = pos.node(); 994| 1.75k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.75k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.75k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.75k, Folded] | Branch (995:25): [True: 640, False: 1.11k] ------------------ 996| 640| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 640] ------------------ 997| 640| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 640| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 640] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 640| return res; 1001| 1.11k| } else { 1002| 1.11k| using std::get; 1003| 1.11k| auto subs = 1004| 1.11k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 1.11k] ------------------ 1005| 1.11k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.11k| auto next = get<1>(subs); 1007| 1.11k| auto ts = get<2>(subs); 1008| 1.11k| auto tail = get<3>(subs); 1009| 1.11k| IMMER_TRY { ------------------ | | 49| 1.11k|#define IMMER_TRY try ------------------ 1010| 1.11k| if (next) { ------------------ | Branch (1010:21): [True: 215, False: 898] ------------------ 1011| 215| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 215] ------------------ 1012| 0| node->inner()[idx] = next; 1013| 0| pos.each_right(dec_visitor{}, idx + 1); 1014| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 215| } else { 1016| 215| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 215| newn->inner()[idx] = next; 1018| 215| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 215] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 215| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 215| } 1022| 898| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 898] ------------------ 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| 898| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 898, Folded] | Branch (1026:40): [True: 709, False: 189] | Branch (1026:52): [True: 240, False: 469] ------------------ 1027| 240| auto newn = pos.node()->inner()[0]; 1028| 240| if (!mutate) ------------------ | Branch (1028:25): [True: 240, False: 0] ------------------ 1029| 240| newn->inc(); 1030| 240| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 240] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 240| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 658| } else { 1034| 658| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 658] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 658| } else { 1038| 658| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 658| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 658] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 658| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 658| } 1043| 658| } 1044| 1.11k| } 1045| 1.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| 1.11k| } 1055| 1.75k| } _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.16k| { 1060| 5.16k| auto old_tail_size = pos.count(); 1061| 5.16k| auto new_tail_size = pos.index(last) + 1; 1062| 5.16k| auto node = pos.node(); 1063| 5.16k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 5.16k, Folded] | Branch (1063:42): [True: 1.27k, False: 3.89k] ------------------ 1064| 5.16k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.68k, False: 3.48k] ------------------ 1065| 1.68k| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 1.68k] ------------------ 1066| 0| node->inc(); 1067| 1.68k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 3.48k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 1.18k, False: 2.29k] ------------------ 1069| 1.18k| detail::destroy_n(node->leaf() + new_tail_size, 1070| 1.18k| old_tail_size - new_tail_size); 1071| 1.18k| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 2.29k| } else { 1073| 2.29k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 2.29k| if (Mutating) ------------------ | Branch (1074:17): [True: 2.29k, Folded] ------------------ 1075| 2.29k| pos.visit(dec_visitor{}); 1076| 2.29k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 2.29k| } 1078| 5.16k| } _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.38k| { 992| 4.38k| auto idx = pos.index(last); 993| 4.38k| auto node = pos.node(); 994| 4.38k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 4.38k, Folded] | Branch (994:35): [True: 2.43k, False: 1.95k] ------------------ 995| 4.38k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 4.38k] | 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.38k| } else { 1002| 4.38k| using std::get; 1003| 4.38k| auto subs = 1004| 4.38k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 2.43k, False: 1.95k] ------------------ 1005| 4.38k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 4.38k| auto next = get<1>(subs); 1007| 4.38k| auto ts = get<2>(subs); 1008| 4.38k| auto tail = get<3>(subs); 1009| 4.38k| IMMER_TRY { ------------------ | | 49| 4.38k|#define IMMER_TRY try ------------------ 1010| 4.38k| if (next) { ------------------ | Branch (1010:21): [True: 610, False: 3.77k] ------------------ 1011| 610| if (mutate) { ------------------ | Branch (1011:25): [True: 400, False: 210] ------------------ 1012| 400| node->inner()[idx] = next; 1013| 400| pos.each_right(dec_visitor{}, idx + 1); 1014| 400| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 400| } else { 1016| 210| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 210| newn->inner()[idx] = next; 1018| 210| if (Mutating) ------------------ | Branch (1018:29): [True: 210, Folded] ------------------ 1019| 210| pos.visit(dec_visitor{}); 1020| 210| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 210| } 1022| 3.77k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.59k, False: 2.18k] ------------------ 1023| 1.59k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.59k, Folded] ------------------ 1024| 1.59k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.59k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 2.18k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 2.18k] | 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.18k| } else { 1034| 2.18k| if (mutate) { ------------------ | Branch (1034:25): [True: 1.22k, False: 967] ------------------ 1035| 1.22k| pos.each_right(dec_visitor{}, idx + 1); 1036| 1.22k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.22k| } else { 1038| 967| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 967| if (Mutating) ------------------ | Branch (1039:29): [True: 967, Folded] ------------------ 1040| 967| pos.visit(dec_visitor{}); 1041| 967| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 967| } 1043| 2.18k| } 1044| 4.38k| } 1045| 4.38k| 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.38k| } 1055| 4.38k| } _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.75k| { 879| 3.75k| using node_t = node_type; 880| 3.75k| auto node = p.node(); 881| 3.75k| if (node->dec()) { ------------------ | Branch (881:13): [True: 2.07k, False: 1.68k] ------------------ 882| 2.07k| p.each_right(dec_t{}, idx); 883| 2.07k| node_t::delete_inner(node, p.count()); 884| 2.07k| } 885| 3.75k| } _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| 8.68k| { 1060| 8.68k| auto old_tail_size = pos.count(); 1061| 8.68k| auto new_tail_size = pos.index(last) + 1; 1062| 8.68k| auto node = pos.node(); 1063| 8.68k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 8.68k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 8.68k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 2.36k, False: 6.32k] ------------------ 1065| 2.36k| if (!Mutating) ------------------ | Branch (1065:17): [True: 2.36k, Folded] ------------------ 1066| 2.36k| node->inc(); 1067| 2.36k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 6.32k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 6.32k] ------------------ 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.32k| } else { 1073| 6.32k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 6.32k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 6.32k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 6.32k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 6.32k| } 1078| 8.68k| } _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.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: 288, False: 2.96k] ------------------ 1011| 288| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 288] ------------------ 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| 288| } else { 1016| 288| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 288| newn->inner()[idx] = next; 1018| 288| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 288] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 288| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 288| } 1022| 2.96k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.29k, False: 1.66k] ------------------ 1023| 1.29k| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 1.29k] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.29k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.66k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.66k] | Branch (1026:40): [True: 0, False: 0] | Branch (1026:52): [True: 0, False: 0] ------------------ 1027| 0| auto newn = pos.node()->inner()[0]; 1028| 0| if (!mutate) ------------------ | Branch (1028:25): [True: 0, False: 0] ------------------ 1029| 0| newn->inc(); 1030| 0| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 0] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 1.66k| } else { 1034| 1.66k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 1.66k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.66k| } else { 1038| 1.66k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.66k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 1.66k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 1.66k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.66k| } 1043| 1.66k| } 1044| 3.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| } _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| 395| { 1060| 395| auto old_tail_size = pos.count(); 1061| 395| auto new_tail_size = pos.index(last) + 1; 1062| 395| auto node = pos.node(); 1063| 395| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 395] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 395| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 198, False: 197] ------------------ 1065| 198| if (!Mutating) ------------------ | Branch (1065:17): [True: 198, Folded] ------------------ 1066| 198| node->inc(); 1067| 198| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 198| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 197] ------------------ 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| 197| } else { 1073| 197| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 197| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 197] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 197| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 197| } 1078| 395| } _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.19k| { 1060| 2.19k| auto old_tail_size = pos.count(); 1061| 2.19k| auto new_tail_size = pos.index(last) + 1; 1062| 2.19k| auto node = pos.node(); 1063| 2.19k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 2.19k, Folded] | Branch (1063:42): [True: 296, False: 1.90k] ------------------ 1064| 2.19k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 247, False: 1.95k] ------------------ 1065| 247| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 247] ------------------ 1066| 0| node->inc(); 1067| 247| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.95k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 278, False: 1.67k] ------------------ 1069| 278| detail::destroy_n(node->leaf() + new_tail_size, 1070| 278| old_tail_size - new_tail_size); 1071| 278| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.67k| } else { 1073| 1.67k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.67k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.67k, Folded] ------------------ 1075| 1.67k| pos.visit(dec_visitor{}); 1076| 1.67k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.67k| } 1078| 2.19k| } _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.25k| { 992| 6.25k| auto idx = pos.index(last); 993| 6.25k| auto node = pos.node(); 994| 6.25k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 6.25k, Folded] | Branch (994:35): [True: 5.64k, False: 612] ------------------ 995| 6.25k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 6.25k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [True: 0, Folded] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 6.25k| } else { 1002| 6.25k| using std::get; 1003| 6.25k| auto subs = 1004| 6.25k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 5.64k, False: 612] ------------------ 1005| 6.25k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 6.25k| auto next = get<1>(subs); 1007| 6.25k| auto ts = get<2>(subs); 1008| 6.25k| auto tail = get<3>(subs); 1009| 6.25k| IMMER_TRY { ------------------ | | 49| 6.25k|#define IMMER_TRY try ------------------ 1010| 6.25k| if (next) { ------------------ | Branch (1010:21): [True: 1.50k, False: 4.74k] ------------------ 1011| 1.50k| if (mutate) { ------------------ | Branch (1011:25): [True: 1.30k, False: 197] ------------------ 1012| 1.30k| node->inner()[idx] = next; 1013| 1.30k| pos.each_right(dec_visitor{}, idx + 1); 1014| 1.30k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 1.30k| } 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.74k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 4.08k, False: 664] ------------------ 1023| 4.08k| if (Mutating) ------------------ | Branch (1023:25): [True: 4.08k, Folded] ------------------ 1024| 4.08k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 4.08k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 4.08k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 664] | 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| 664| } else { 1034| 664| if (mutate) { ------------------ | Branch (1034:25): [True: 455, False: 209] ------------------ 1035| 455| pos.each_right(dec_visitor{}, idx + 1); 1036| 455| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 455| } else { 1038| 209| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 209| if (Mutating) ------------------ | Branch (1039:29): [True: 209, Folded] ------------------ 1040| 209| pos.visit(dec_visitor{}); 1041| 209| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 209| } 1043| 664| } 1044| 6.25k| } 1045| 6.25k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 6.25k| } 1055| 6.25k| } _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.08k| { 879| 4.08k| using node_t = node_type; 880| 4.08k| auto node = p.node(); 881| 4.08k| if (node->dec()) { ------------------ | Branch (881:13): [True: 3.87k, False: 206] ------------------ 882| 3.87k| p.each_right(dec_t{}, idx); 883| 3.87k| node_t::delete_inner(node, p.count()); 884| 3.87k| } 885| 4.08k| } _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.59k| { 1060| 2.59k| auto old_tail_size = pos.count(); 1061| 2.59k| auto new_tail_size = pos.index(last) + 1; 1062| 2.59k| auto node = pos.node(); 1063| 2.59k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 2.59k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 2.59k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 933, False: 1.65k] ------------------ 1065| 933| if (!Mutating) ------------------ | Branch (1065:17): [True: 933, Folded] ------------------ 1066| 933| node->inc(); 1067| 933| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.65k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 1.65k] ------------------ 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.65k| } else { 1073| 1.65k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.65k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 1.65k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 1.65k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.65k| } 1078| 2.59k| } _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.07k| { 992| 3.07k| auto idx = pos.index(last); 993| 3.07k| auto node = pos.node(); 994| 3.07k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.07k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.07k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.07k] | 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.07k| } else { 1002| 3.07k| using std::get; 1003| 3.07k| auto subs = 1004| 3.07k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.07k] ------------------ 1005| 3.07k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.07k| auto next = get<1>(subs); 1007| 3.07k| auto ts = get<2>(subs); 1008| 3.07k| auto tail = get<3>(subs); 1009| 3.07k| IMMER_TRY { ------------------ | | 49| 3.07k|#define IMMER_TRY try ------------------ 1010| 3.07k| if (next) { ------------------ | Branch (1010:21): [True: 387, False: 2.68k] ------------------ 1011| 387| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 387] ------------------ 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| 387| } else { 1016| 387| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 387| newn->inner()[idx] = next; 1018| 387| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 387] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 387| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 387| } 1022| 2.68k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.93k, False: 750] ------------------ 1023| 1.93k| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 1.93k] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.93k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.93k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 750] | 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| 750| } else { 1034| 750| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 750] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 750| } else { 1038| 750| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 750| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 750] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 750| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 750| } 1043| 750| } 1044| 3.07k| } 1045| 3.07k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 3.07k| } 1055| 3.07k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_j: 867| 46.8k| { 868| 46.8k| using node_t = node_type; 869| 46.8k| auto node = p.node(); 870| 46.8k| if (node->dec()) { ------------------ | Branch (870:13): [True: 40.4k, False: 6.36k] ------------------ 871| 40.4k| p.each_right(dec_t{}, idx); 872| 40.4k| node_t::delete_inner_r(node, p.count()); 873| 40.4k| } 874| 46.8k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 3.94k| { 1060| 3.94k| auto old_tail_size = pos.count(); 1061| 3.94k| auto new_tail_size = pos.index(last) + 1; 1062| 3.94k| auto node = pos.node(); 1063| 3.94k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 3.94k, Folded] | Branch (1063:42): [True: 982, False: 2.96k] ------------------ 1064| 3.94k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.48k, False: 2.46k] ------------------ 1065| 1.48k| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 1.48k] ------------------ 1066| 0| node->inc(); 1067| 1.48k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 2.46k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 828, False: 1.63k] ------------------ 1069| 828| detail::destroy_n(node->leaf() + new_tail_size, 1070| 828| old_tail_size - new_tail_size); 1071| 828| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.63k| } else { 1073| 1.63k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.63k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.63k, Folded] ------------------ 1075| 1.63k| pos.visit(dec_visitor{}); 1076| 1.63k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.63k| } 1078| 3.94k| } _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| 10.1k| { 914| 10.1k| auto idx = pos.index(last); 915| 10.1k| auto node = pos.node(); 916| 10.1k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 10.1k, Folded] | Branch (916:35): [True: 7.87k, False: 2.23k] ------------------ 917| 10.1k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 10.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| 10.1k| } else { 924| 10.1k| using std::get; 925| 10.1k| auto subs = 926| 10.1k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 7.87k, False: 2.23k] ------------------ 927| 10.1k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 10.1k| auto next = get<1>(subs); 929| 10.1k| auto ts = get<2>(subs); 930| 10.1k| auto tail = get<3>(subs); 931| 10.1k| IMMER_TRY { ------------------ | | 49| 10.1k|#define IMMER_TRY try ------------------ 932| 10.1k| if (next) { ------------------ | Branch (932:21): [True: 4.17k, False: 5.94k] ------------------ 933| 4.17k| if (mutate) { ------------------ | Branch (933:25): [True: 3.52k, False: 648] ------------------ 934| 3.52k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 3.52k| pos.each_right(dec_visitor{}, idx + 1); 936| 3.52k| node->inner()[idx] = next; 937| 3.52k| nodr->d.sizes[idx] = last + 1 - ts; 938| 3.52k| nodr->d.count = idx + 1; 939| 3.52k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 3.52k, False: 0] ------------------ 940| 3.52k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 3.52k| } else { 942| 648| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 648| auto newr = newn->relaxed(); 944| 648| newn->inner()[idx] = next; 945| 648| newr->d.sizes[idx] = last + 1 - ts; 946| 648| newr->d.count = idx + 1; 947| 648| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 648, False: 0] ------------------ 948| 648| if (Mutating) ------------------ | Branch (948:29): [True: 648, Folded] ------------------ 949| 648| pos.visit(dec_visitor{}); 950| 648| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 648| } 952| 5.94k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 3.07k, False: 2.87k] ------------------ 953| 3.07k| if (Mutating) ------------------ | Branch (953:25): [True: 3.07k, Folded] ------------------ 954| 3.07k| pos.visit(dec_right_visitor{}, count_t{1}); 955| 3.07k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 3.07k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 2.87k] | Branch (956:40): [True: 0, False: 0] | Branch (956:52): [True: 0, False: 0] ------------------ 957| 0| auto newn = pos.node()->inner()[0]; 958| 0| if (!mutate) ------------------ | Branch (958:25): [True: 0, False: 0] ------------------ 959| 0| newn->inc(); 960| 0| if (Mutating) ------------------ | Branch (960:25): [True: 0, Folded] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 2.87k| } else { 964| 2.87k| if (mutate) { ------------------ | Branch (964:25): [True: 2.31k, False: 556] ------------------ 965| 2.31k| pos.each_right(dec_visitor{}, idx + 1); 966| 2.31k| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 2.31k| return std::make_tuple(pos.shift(), node, ts, tail); 968| 2.31k| } else { 969| 556| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 556| if (Mutating) ------------------ | Branch (970:29): [True: 556, Folded] ------------------ 971| 556| pos.visit(dec_visitor{}); 972| 556| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 556| } 974| 2.87k| } 975| 10.1k| } 976| 10.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| 10.1k| } 987| 10.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| 6.68k| { 992| 6.68k| auto idx = pos.index(last); 993| 6.68k| auto node = pos.node(); 994| 6.68k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 6.68k, Folded] | Branch (994:35): [True: 5.52k, False: 1.16k] ------------------ 995| 6.68k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 6.68k] | 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.68k| } else { 1002| 6.68k| using std::get; 1003| 6.68k| auto subs = 1004| 6.68k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 5.52k, False: 1.16k] ------------------ 1005| 6.68k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 6.68k| auto next = get<1>(subs); 1007| 6.68k| auto ts = get<2>(subs); 1008| 6.68k| auto tail = get<3>(subs); 1009| 6.68k| IMMER_TRY { ------------------ | | 49| 6.68k|#define IMMER_TRY try ------------------ 1010| 6.68k| if (next) { ------------------ | Branch (1010:21): [True: 2.49k, False: 4.18k] ------------------ 1011| 2.49k| if (mutate) { ------------------ | Branch (1011:25): [True: 2.18k, False: 308] ------------------ 1012| 2.18k| node->inner()[idx] = next; 1013| 2.18k| pos.each_right(dec_visitor{}, idx + 1); 1014| 2.18k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 2.18k| } else { 1016| 308| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 308| newn->inner()[idx] = next; 1018| 308| if (Mutating) ------------------ | Branch (1018:29): [True: 308, Folded] ------------------ 1019| 308| pos.visit(dec_visitor{}); 1020| 308| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 308| } 1022| 4.18k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.31k, False: 2.87k] ------------------ 1023| 1.31k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.31k, Folded] ------------------ 1024| 1.31k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.31k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 2.87k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 2.87k] | 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.87k| } else { 1034| 2.87k| if (mutate) { ------------------ | Branch (1034:25): [True: 2.35k, False: 517] ------------------ 1035| 2.35k| pos.each_right(dec_visitor{}, idx + 1); 1036| 2.35k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 2.35k| } else { 1038| 517| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 517| if (Mutating) ------------------ | Branch (1039:29): [True: 517, Folded] ------------------ 1040| 517| pos.visit(dec_visitor{}); 1041| 517| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 517| } 1043| 2.87k| } 1044| 6.68k| } 1045| 6.68k| 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.68k| } 1055| 6.68k| } _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.4k| { 879| 10.4k| using node_t = node_type; 880| 10.4k| auto node = p.node(); 881| 10.4k| if (node->dec()) { ------------------ | Branch (881:13): [True: 7.51k, False: 2.94k] ------------------ 882| 7.51k| p.each_right(dec_t{}, idx); 883| 7.51k| node_t::delete_inner(node, p.count()); 884| 7.51k| } 885| 10.4k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 5.77k| { 1060| 5.77k| auto old_tail_size = pos.count(); 1061| 5.77k| auto new_tail_size = pos.index(last) + 1; 1062| 5.77k| auto node = pos.node(); 1063| 5.77k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 5.77k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 5.77k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.96k, False: 3.80k] ------------------ 1065| 1.96k| if (!Mutating) ------------------ | Branch (1065:17): [True: 1.96k, Folded] ------------------ 1066| 1.96k| node->inc(); 1067| 1.96k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 3.80k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 3.80k] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 3.80k| } else { 1073| 3.80k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 3.80k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 3.80k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 3.80k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 3.80k| } 1078| 5.77k| } _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.65k| { 914| 7.65k| auto idx = pos.index(last); 915| 7.65k| auto node = pos.node(); 916| 7.65k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 7.65k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 7.65k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 7.65k] | 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.65k| } else { 924| 7.65k| using std::get; 925| 7.65k| auto subs = 926| 7.65k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 7.65k] ------------------ 927| 7.65k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 7.65k| auto next = get<1>(subs); 929| 7.65k| auto ts = get<2>(subs); 930| 7.65k| auto tail = get<3>(subs); 931| 7.65k| IMMER_TRY { ------------------ | | 49| 7.65k|#define IMMER_TRY try ------------------ 932| 7.65k| if (next) { ------------------ | Branch (932:21): [True: 1.43k, False: 6.22k] ------------------ 933| 1.43k| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 1.43k] ------------------ 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.43k| } else { 942| 1.43k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 1.43k| auto newr = newn->relaxed(); 944| 1.43k| newn->inner()[idx] = next; 945| 1.43k| newr->d.sizes[idx] = last + 1 - ts; 946| 1.43k| newr->d.count = idx + 1; 947| 1.43k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 1.43k, False: 0] ------------------ 948| 1.43k| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 1.43k] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 1.43k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 1.43k| } 952| 6.22k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 4.19k, False: 2.03k] ------------------ 953| 4.19k| if (Mutating) ------------------ | Branch (953:25): [Folded, False: 4.19k] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 4.19k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 4.19k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 2.03k] | 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.03k| } else { 964| 2.03k| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 2.03k] ------------------ 965| 0| pos.each_right(dec_visitor{}, idx + 1); 966| 0| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 0| return std::make_tuple(pos.shift(), node, ts, tail); 968| 2.03k| } else { 969| 2.03k| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 2.03k| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 2.03k] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 2.03k| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 2.03k| } 974| 2.03k| } 975| 7.65k| } 976| 7.65k| 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.65k| } 987| 7.65k| } _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.53k| { 992| 2.53k| auto idx = pos.index(last); 993| 2.53k| auto node = pos.node(); 994| 2.53k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 2.53k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 2.53k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 2.53k] | 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.53k| } else { 1002| 2.53k| using std::get; 1003| 2.53k| auto subs = 1004| 2.53k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 2.53k] ------------------ 1005| 2.53k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 2.53k| auto next = get<1>(subs); 1007| 2.53k| auto ts = get<2>(subs); 1008| 2.53k| auto tail = get<3>(subs); 1009| 2.53k| IMMER_TRY { ------------------ | | 49| 2.53k|#define IMMER_TRY try ------------------ 1010| 2.53k| if (next) { ------------------ | Branch (1010:21): [True: 791, False: 1.74k] ------------------ 1011| 791| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 791] ------------------ 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| 791| } else { 1016| 791| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 791| newn->inner()[idx] = next; 1018| 791| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 791] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 791| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 791| } 1022| 1.74k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.04k, False: 702] ------------------ 1023| 1.04k| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 1.04k] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.04k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.04k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 702] | 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| 702| } else { 1034| 702| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 702] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 702| } else { 1038| 702| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 702| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 702] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 702| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 702| } 1043| 702| } 1044| 2.53k| } 1045| 2.53k| 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.53k| } 1055| 2.53k| } _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.60k, False: 3.41k] ------------------ 995| 12.0k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 12.0k, Folded] | Branch (995:25): [True: 6.85k, False: 5.16k] ------------------ 996| 6.85k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 4.96k, False: 1.88k] ------------------ 997| 6.85k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 6.85k| if (Mutating) ------------------ | Branch (998:17): [True: 6.85k, Folded] ------------------ 999| 6.85k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 6.85k| return res; 1001| 6.85k| } else { 1002| 5.16k| using std::get; 1003| 5.16k| auto subs = 1004| 5.16k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.63k, False: 1.52k] ------------------ 1005| 5.16k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 5.16k| auto next = get<1>(subs); 1007| 5.16k| auto ts = get<2>(subs); 1008| 5.16k| auto tail = get<3>(subs); 1009| 5.16k| IMMER_TRY { ------------------ | | 49| 5.16k|#define IMMER_TRY try ------------------ 1010| 5.16k| if (next) { ------------------ | Branch (1010:21): [True: 1.10k, False: 4.06k] ------------------ 1011| 1.10k| if (mutate) { ------------------ | Branch (1011:25): [True: 832, False: 271] ------------------ 1012| 832| node->inner()[idx] = next; 1013| 832| pos.each_right(dec_visitor{}, idx + 1); 1014| 832| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 832| } else { 1016| 271| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 271| newn->inner()[idx] = next; 1018| 271| if (Mutating) ------------------ | Branch (1018:29): [True: 271, Folded] ------------------ 1019| 271| pos.visit(dec_visitor{}); 1020| 271| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 271| } 1022| 4.06k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 4.06k] ------------------ 1023| 0| if (Mutating) ------------------ | Branch (1023:25): [True: 0, Folded] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 4.06k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 4.06k, Folded] | Branch (1026:40): [True: 3.47k, False: 587] | Branch (1026:52): [True: 2.28k, False: 1.18k] ------------------ 1027| 2.28k| auto newn = pos.node()->inner()[0]; 1028| 2.28k| if (!mutate) ------------------ | Branch (1028:25): [True: 715, False: 1.57k] ------------------ 1029| 715| newn->inc(); 1030| 2.28k| if (Mutating) ------------------ | Branch (1030:25): [True: 2.28k, Folded] ------------------ 1031| 2.28k| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 2.28k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 2.28k| } else { 1034| 1.77k| if (mutate) { ------------------ | Branch (1034:25): [True: 1.23k, False: 541] ------------------ 1035| 1.23k| pos.each_right(dec_visitor{}, idx + 1); 1036| 1.23k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.23k| } else { 1038| 541| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 541| if (Mutating) ------------------ | Branch (1039:29): [True: 541, Folded] ------------------ 1040| 541| pos.visit(dec_visitor{}); 1041| 541| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 541| } 1043| 1.77k| } 1044| 5.16k| } 1045| 5.16k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 5.16k| } 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.53k| { 1060| 1.53k| auto old_tail_size = pos.count(); 1061| 1.53k| auto new_tail_size = pos.index(last) + 1; 1062| 1.53k| auto node = pos.node(); 1063| 1.53k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.53k, Folded] | Branch (1063:42): [True: 585, False: 952] ------------------ 1064| 1.53k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 577, False: 960] ------------------ 1065| 577| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 577] ------------------ 1066| 0| node->inc(); 1067| 577| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 960| } else if (mutate) { ------------------ | Branch (1068:20): [True: 492, False: 468] ------------------ 1069| 492| detail::destroy_n(node->leaf() + new_tail_size, 1070| 492| old_tail_size - new_tail_size); 1071| 492| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 492| } else { 1073| 468| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 468| if (Mutating) ------------------ | Branch (1074:17): [True: 468, Folded] ------------------ 1075| 468| pos.visit(dec_visitor{}); 1076| 468| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 468| } 1078| 1.53k| } _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.72k| { 992| 3.72k| auto idx = pos.index(last); 993| 3.72k| auto node = pos.node(); 994| 3.72k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.72k, Folded] | Branch (994:35): [True: 1.75k, False: 1.97k] ------------------ 995| 3.72k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 3.72k, Folded] | Branch (995:25): [True: 1.61k, False: 2.11k] ------------------ 996| 1.61k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 977, False: 635] ------------------ 997| 1.61k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 1.61k| if (Mutating) ------------------ | Branch (998:17): [True: 1.61k, Folded] ------------------ 999| 1.61k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 1.61k| return res; 1001| 2.11k| } else { 1002| 2.11k| using std::get; 1003| 2.11k| auto subs = 1004| 2.11k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 776, False: 1.34k] ------------------ 1005| 2.11k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 2.11k| auto next = get<1>(subs); 1007| 2.11k| auto ts = get<2>(subs); 1008| 2.11k| auto tail = get<3>(subs); 1009| 2.11k| IMMER_TRY { ------------------ | | 49| 2.11k|#define IMMER_TRY try ------------------ 1010| 2.11k| if (next) { ------------------ | Branch (1010:21): [True: 434, False: 1.68k] ------------------ 1011| 434| if (mutate) { ------------------ | Branch (1011:25): [True: 238, False: 196] ------------------ 1012| 238| node->inner()[idx] = next; 1013| 238| pos.each_right(dec_visitor{}, idx + 1); 1014| 238| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 238| } 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.68k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 1.68k] ------------------ 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.68k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 1.68k, Folded] | Branch (1026:40): [True: 1.17k, False: 512] | Branch (1026:52): [True: 555, False: 615] ------------------ 1027| 555| auto newn = pos.node()->inner()[0]; 1028| 555| if (!mutate) ------------------ | Branch (1028:25): [True: 267, False: 288] ------------------ 1029| 267| newn->inc(); 1030| 555| if (Mutating) ------------------ | Branch (1030:25): [True: 555, Folded] ------------------ 1031| 555| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 555| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 1.12k| } else { 1034| 1.12k| if (mutate) { ------------------ | Branch (1034:25): [True: 250, False: 877] ------------------ 1035| 250| pos.each_right(dec_visitor{}, idx + 1); 1036| 250| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 877| } else { 1038| 877| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 877| if (Mutating) ------------------ | Branch (1039:29): [True: 877, Folded] ------------------ 1040| 877| pos.visit(dec_visitor{}); 1041| 877| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 877| } 1043| 1.12k| } 1044| 2.11k| } 1045| 2.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| 2.11k| } 1055| 3.72k| } _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| 677| { 1060| 677| auto old_tail_size = pos.count(); 1061| 677| auto new_tail_size = pos.index(last) + 1; 1062| 677| auto node = pos.node(); 1063| 677| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 677, Folded] | Branch (1063:42): [True: 206, False: 471] ------------------ 1064| 677| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 228, False: 449] ------------------ 1065| 228| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 228] ------------------ 1066| 0| node->inc(); 1067| 228| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 449| } else if (mutate) { ------------------ | Branch (1068:20): [True: 200, False: 249] ------------------ 1069| 200| detail::destroy_n(node->leaf() + new_tail_size, 1070| 200| old_tail_size - new_tail_size); 1071| 200| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 249| } else { 1073| 249| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 249| if (Mutating) ------------------ | Branch (1074:17): [True: 249, Folded] ------------------ 1075| 249| pos.visit(dec_visitor{}); 1076| 249| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 249| } 1078| 677| } _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| 678| { 1378| 678| auto node = pos.node(); 1379| 678| auto idx = pos.index(first); 1380| 678| auto count = pos.count(); 1381| 678| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 678| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 422, False: 256] ------------------ 1384| 678| if (mutate) { ------------------ | Branch (1384:13): [True: 422, False: 256] ------------------ 1385| 422| auto data = node->leaf(); 1386| 422| auto newcount = count - idx; 1387| 422| std::move(data + idx, data + count, data); 1388| 422| detail::destroy_n(data + newcount, idx); 1389| 422| return std::make_tuple(0, node); 1390| 422| } else { 1391| 256| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 256| if (Mutating) ------------------ | Branch (1392:17): [True: 256, Folded] ------------------ 1393| 256| pos.visit(dec_visitor{}); 1394| 256| return std::make_tuple(0, newn); 1395| 256| } 1396| 678| } _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| 38.8k| { 1247| 38.8k| auto idx = pos.subindex(first); 1248| 38.8k| auto count = pos.count(); 1249| 38.8k| auto node = pos.node(); 1250| 38.8k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 38.8k, Folded] | Branch (1250:47): [True: 29.4k, False: 9.36k] ------------------ 1251| 38.8k| auto left_size = pos.size_before(idx); 1252| 38.8k| auto child_size = pos.size_sbh(idx, left_size); 1253| 38.8k| auto dropped_size = first; 1254| 38.8k| auto child_dropped_size = dropped_size - left_size; 1255| 38.8k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 38.8k, Folded] | Branch (1255:25): [True: 37.3k, False: 1.51k] | Branch (1255:45): [True: 8.73k, False: 28.5k] ------------------ 1256| 8.73k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 5.22k, False: 3.51k] ------------------ 1257| 8.73k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 8.73k| if (mutate) ------------------ | Branch (1258:17): [True: 5.22k, False: 3.51k] ------------------ 1259| 5.22k| pos.visit(dec_left_visitor{}, idx); 1260| 3.51k| else if (Mutating) ------------------ | Branch (1260:22): [True: 3.51k, Folded] ------------------ 1261| 3.51k| pos.visit(dec_visitor{}); 1262| 8.73k| return r; 1263| 30.0k| } else { 1264| 30.0k| using std::get; 1265| 30.0k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 24.2k, False: 5.85k] ------------------ 1266| 30.0k| : node_t::make_inner_r_e(e); 1267| 30.0k| auto newr = newn->relaxed(); 1268| 30.0k| auto newcount = count - idx; 1269| 30.0k| auto new_child_size = child_size - child_dropped_size; 1270| 30.0k| IMMER_TRY { ------------------ | | 49| 30.0k|#define IMMER_TRY try ------------------ 1271| 30.0k| auto subs = 1272| 30.0k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 24.2k, False: 5.85k] ------------------ 1273| 30.0k| : pos.towards_sub_oh( 1274| 5.85k| no_collapse_no_mut_t{}, first, idx, e); 1275| 30.0k| if (mutate) ------------------ | Branch (1275:21): [True: 24.2k, False: 5.85k] ------------------ 1276| 24.2k| pos.each_left(dec_visitor{}, idx); 1277| 30.0k| pos.copy_sizes( 1278| 30.0k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 30.0k| std::copy(node->inner() + idx + 1, 1280| 30.0k| node->inner() + count, 1281| 30.0k| newn->inner() + 1); 1282| 30.0k| newn->inner()[0] = get<1>(subs); 1283| 30.0k| newr->d.sizes[0] = new_child_size; 1284| 30.0k| newr->d.count = newcount; 1285| 30.0k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 30.0k, False: 0] ------------------ 1286| 30.0k| if (!mutate) { ------------------ | Branch (1286:21): [True: 5.85k, False: 24.2k] ------------------ 1287| 5.85k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 5.85k| if (Mutating) ------------------ | Branch (1288:25): [True: 5.85k, Folded] ------------------ 1289| 5.85k| pos.visit(dec_visitor{}); 1290| 5.85k| } 1291| 30.0k| return std::make_tuple(pos.shift(), newn); 1292| 30.0k| } 1293| 30.0k| 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| 30.0k| } 1299| 38.8k| } _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.79k| { 1247| 2.79k| auto idx = pos.subindex(first); 1248| 2.79k| auto count = pos.count(); 1249| 2.79k| auto node = pos.node(); 1250| 2.79k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 2.79k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 2.79k| auto left_size = pos.size_before(idx); 1252| 2.79k| auto child_size = pos.size_sbh(idx, left_size); 1253| 2.79k| auto dropped_size = first; 1254| 2.79k| auto child_dropped_size = dropped_size - left_size; 1255| 2.79k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 2.79k, Folded] | Branch (1255:25): [True: 1.56k, False: 1.22k] | Branch (1255:45): [True: 970, False: 598] ------------------ 1256| 970| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 970] ------------------ 1257| 970| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 970| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 970] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 970| else if (Mutating) ------------------ | Branch (1260:22): [Folded, False: 970] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 970| return r; 1263| 1.82k| } else { 1264| 1.82k| using std::get; 1265| 1.82k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 1.82k] ------------------ 1266| 1.82k| : node_t::make_inner_r_e(e); 1267| 1.82k| auto newr = newn->relaxed(); 1268| 1.82k| auto newcount = count - idx; 1269| 1.82k| auto new_child_size = child_size - child_dropped_size; 1270| 1.82k| IMMER_TRY { ------------------ | | 49| 1.82k|#define IMMER_TRY try ------------------ 1271| 1.82k| auto subs = 1272| 1.82k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 1.82k] ------------------ 1273| 1.82k| : pos.towards_sub_oh( 1274| 1.82k| no_collapse_no_mut_t{}, first, idx, e); 1275| 1.82k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 1.82k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 1.82k| pos.copy_sizes( 1278| 1.82k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 1.82k| std::copy(node->inner() + idx + 1, 1280| 1.82k| node->inner() + count, 1281| 1.82k| newn->inner() + 1); 1282| 1.82k| newn->inner()[0] = get<1>(subs); 1283| 1.82k| newr->d.sizes[0] = new_child_size; 1284| 1.82k| newr->d.count = newcount; 1285| 1.82k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 1.82k, False: 0] ------------------ 1286| 1.82k| if (!mutate) { ------------------ | Branch (1286:21): [True: 1.82k, False: 0] ------------------ 1287| 1.82k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 1.82k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 1.82k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 1.82k| } 1291| 1.82k| return std::make_tuple(pos.shift(), newn); 1292| 1.82k| } 1293| 1.82k| 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.82k| } 1299| 2.79k| } _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.71k| { 1304| 2.71k| auto idx = pos.subindex(first); 1305| 2.71k| auto count = pos.count(); 1306| 2.71k| auto node = pos.node(); 1307| 2.71k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.71k] ------------------ 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.71k| auto left_size = pos.size_before(idx); 1313| 2.71k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.71k| auto dropped_size = first; 1315| 2.71k| auto child_dropped_size = dropped_size - left_size; 1316| 2.71k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 2.71k, Folded] | Branch (1316:25): [True: 1.53k, False: 1.18k] | Branch (1316:45): [True: 1.15k, False: 382] ------------------ 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.56k| } else { 1325| 1.56k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 1.56k| auto newcount = count - idx; 1330| 1.56k| auto newn = 1331| 1.56k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.56k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.56k| : node_t::make_inner_r_e(e); 1336| 1.56k| auto newr = newn->relaxed(); 1337| 1.56k| IMMER_TRY { ------------------ | | 49| 1.56k|#define IMMER_TRY try ------------------ 1338| 1.56k| auto subs = 1339| 1.56k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.56k] ------------------ 1340| 1.56k| : pos.towards_sub_oh( 1341| 1.56k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.56k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.56k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.56k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.56k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.56k, False: 0] ------------------ 1346| 1.56k| pos.copy_sizes( 1347| 1.56k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.56k| newr->d.count = newcount; 1349| 1.56k| newn->inner()[0] = get<1>(subs); 1350| 1.56k| std::copy(node->inner() + idx + 1, 1351| 1.56k| node->inner() + count, 1352| 1.56k| newn->inner() + 1); 1353| 1.56k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.56k, False: 0] ------------------ 1354| 1.56k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.56k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.56k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.56k| } 1358| 1.56k| return std::make_tuple(pos.shift(), newn); 1359| 1.56k| } 1360| 1.56k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 1.56k| } 1373| 2.71k| } _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.04k| { 1304| 3.04k| auto idx = pos.subindex(first); 1305| 3.04k| auto count = pos.count(); 1306| 3.04k| auto node = pos.node(); 1307| 3.04k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 3.04k] ------------------ 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.04k| auto left_size = pos.size_before(idx); 1313| 3.04k| auto child_size = pos.size_sbh(idx, left_size); 1314| 3.04k| auto dropped_size = first; 1315| 3.04k| auto child_dropped_size = dropped_size - left_size; 1316| 3.04k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 3.04k, Folded] | Branch (1316:25): [True: 615, False: 2.43k] | Branch (1316:45): [True: 399, False: 216] ------------------ 1317| 399| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 399] ------------------ 1318| 399| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 399| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 399] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 399| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 399] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 399| return r; 1324| 2.64k| } else { 1325| 2.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| 2.64k| auto newcount = count - idx; 1330| 2.64k| auto newn = 1331| 2.64k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 2.64k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 2.64k| : node_t::make_inner_r_e(e); 1336| 2.64k| auto newr = newn->relaxed(); 1337| 2.64k| IMMER_TRY { ------------------ | | 49| 2.64k|#define IMMER_TRY try ------------------ 1338| 2.64k| auto subs = 1339| 2.64k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 2.64k] ------------------ 1340| 2.64k| : pos.towards_sub_oh( 1341| 2.64k| no_collapse_no_mut_t{}, first, idx, e); 1342| 2.64k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 2.64k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 2.64k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 2.64k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 2.64k, False: 0] ------------------ 1346| 2.64k| pos.copy_sizes( 1347| 2.64k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 2.64k| newr->d.count = newcount; 1349| 2.64k| newn->inner()[0] = get<1>(subs); 1350| 2.64k| std::copy(node->inner() + idx + 1, 1351| 2.64k| node->inner() + count, 1352| 2.64k| newn->inner() + 1); 1353| 2.64k| if (!mutate) { ------------------ | Branch (1353:21): [True: 2.64k, False: 0] ------------------ 1354| 2.64k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 2.64k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 2.64k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 2.64k| } 1358| 2.64k| return std::make_tuple(pos.shift(), newn); 1359| 2.64k| } 1360| 2.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| 2.64k| } 1373| 3.04k| } _ZN5immer6detail4rbts16dec_left_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_j: 1209| 309| { 1210| 309| using node_t = node_type; 1211| 309| auto node = p.node(); 1212| 309| if (node->dec()) { ------------------ | Branch (1212:13): [True: 309, False: 0] ------------------ 1213| 309| p.each_left(dec_t{}, idx); 1214| 309| node_t::delete_inner(node, p.count()); 1215| 309| } 1216| 309| } _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.04k| { 1378| 3.04k| auto node = pos.node(); 1379| 3.04k| auto idx = pos.index(first); 1380| 3.04k| auto count = pos.count(); 1381| 3.04k| 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.04k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 464, False: 2.58k] ------------------ 1384| 3.04k| if (mutate) { ------------------ | Branch (1384:13): [True: 464, False: 2.58k] ------------------ 1385| 464| auto data = node->leaf(); 1386| 464| auto newcount = count - idx; 1387| 464| std::move(data + idx, data + count, data); 1388| 464| detail::destroy_n(data + newcount, idx); 1389| 464| return std::make_tuple(0, node); 1390| 2.58k| } else { 1391| 2.58k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 2.58k| if (Mutating) ------------------ | Branch (1392:17): [True: 2.58k, Folded] ------------------ 1393| 2.58k| pos.visit(dec_visitor{}); 1394| 2.58k| return std::make_tuple(0, newn); 1395| 2.58k| } 1396| 3.04k| } _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.02k| { 1304| 2.02k| auto idx = pos.subindex(first); 1305| 2.02k| auto count = pos.count(); 1306| 2.02k| auto node = pos.node(); 1307| 2.02k| 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.02k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 725, False: 1.30k] ------------------ 1312| 2.02k| auto left_size = pos.size_before(idx); 1313| 2.02k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.02k| auto dropped_size = first; 1315| 2.02k| auto child_dropped_size = dropped_size - left_size; 1316| 2.02k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 2.02k] | 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.02k| } else { 1325| 2.02k| 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.02k| auto newcount = count - idx; 1330| 2.02k| auto newn = 1331| 2.02k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 725, False: 1.30k] ------------------ 1332| 725| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 725| norefs_tag{})) relaxed_t, 1334| 725| node) 1335| 2.02k| : node_t::make_inner_r_e(e); 1336| 2.02k| auto newr = newn->relaxed(); 1337| 2.02k| IMMER_TRY { ------------------ | | 49| 2.02k|#define IMMER_TRY try ------------------ 1338| 2.02k| auto subs = 1339| 2.02k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 725, False: 1.30k] ------------------ 1340| 2.02k| : pos.towards_sub_oh( 1341| 1.30k| no_collapse_no_mut_t{}, first, idx, e); 1342| 2.02k| if (mutate) ------------------ | Branch (1342:21): [True: 725, False: 1.30k] ------------------ 1343| 725| pos.each_left(dec_visitor{}, idx); 1344| 2.02k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 2.02k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 2.02k, False: 0] ------------------ 1346| 2.02k| pos.copy_sizes( 1347| 2.02k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 2.02k| newr->d.count = newcount; 1349| 2.02k| newn->inner()[0] = get<1>(subs); 1350| 2.02k| std::copy(node->inner() + idx + 1, 1351| 2.02k| node->inner() + count, 1352| 2.02k| newn->inner() + 1); 1353| 2.02k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.30k, False: 725] ------------------ 1354| 1.30k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.30k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.30k, Folded] ------------------ 1356| 1.30k| pos.visit(dec_visitor{}); 1357| 1.30k| } 1358| 2.02k| return std::make_tuple(pos.shift(), newn); 1359| 2.02k| } 1360| 2.02k| 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.02k| } 1373| 2.02k| } _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| 12.4k| { 1378| 12.4k| auto node = pos.node(); 1379| 12.4k| auto idx = pos.index(first); 1380| 12.4k| auto count = pos.count(); 1381| 12.4k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 12.4k] ------------------ 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| 12.4k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 12.4k] ------------------ 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| 12.4k| } else { 1391| 12.4k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 12.4k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 12.4k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 12.4k| return std::make_tuple(0, newn); 1395| 12.4k| } 1396| 12.4k| } _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.25k| { 1304| 3.25k| auto idx = pos.subindex(first); 1305| 3.25k| auto count = pos.count(); 1306| 3.25k| auto node = pos.node(); 1307| 3.25k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 3.25k] ------------------ 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.25k| auto left_size = pos.size_before(idx); 1313| 3.25k| auto child_size = pos.size_sbh(idx, left_size); 1314| 3.25k| auto dropped_size = first; 1315| 3.25k| auto child_dropped_size = dropped_size - left_size; 1316| 3.25k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 3.25k] | 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.25k| } else { 1325| 3.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| 3.25k| auto newcount = count - idx; 1330| 3.25k| auto newn = 1331| 3.25k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 3.25k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 3.25k| : node_t::make_inner_r_e(e); 1336| 3.25k| auto newr = newn->relaxed(); 1337| 3.25k| IMMER_TRY { ------------------ | | 49| 3.25k|#define IMMER_TRY try ------------------ 1338| 3.25k| auto subs = 1339| 3.25k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 3.25k] ------------------ 1340| 3.25k| : pos.towards_sub_oh( 1341| 3.25k| no_collapse_no_mut_t{}, first, idx, e); 1342| 3.25k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 3.25k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 3.25k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 3.25k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 3.25k, False: 0] ------------------ 1346| 3.25k| pos.copy_sizes( 1347| 3.25k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 3.25k| newr->d.count = newcount; 1349| 3.25k| newn->inner()[0] = get<1>(subs); 1350| 3.25k| std::copy(node->inner() + idx + 1, 1351| 3.25k| node->inner() + count, 1352| 3.25k| newn->inner() + 1); 1353| 3.25k| if (!mutate) { ------------------ | Branch (1353:21): [True: 3.25k, False: 0] ------------------ 1354| 3.25k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 3.25k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 3.25k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 3.25k| } 1358| 3.25k| return std::make_tuple(pos.shift(), newn); 1359| 3.25k| } 1360| 3.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| 3.25k| } 1373| 3.25k| } _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.28k| { 1210| 4.28k| using node_t = node_type; 1211| 4.28k| auto node = p.node(); 1212| 4.28k| if (node->dec()) { ------------------ | Branch (1212:13): [True: 4.28k, False: 0] ------------------ 1213| 4.28k| p.each_left(dec_t{}, idx); 1214| 4.28k| node_t::delete_inner(node, p.count()); 1215| 4.28k| } 1216| 4.28k| } _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| 9.96k| { 1378| 9.96k| auto node = pos.node(); 1379| 9.96k| auto idx = pos.index(first); 1380| 9.96k| auto count = pos.count(); 1381| 9.96k| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 9.96k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 6.40k, False: 3.55k] ------------------ 1384| 9.96k| if (mutate) { ------------------ | Branch (1384:13): [True: 6.40k, False: 3.55k] ------------------ 1385| 6.40k| auto data = node->leaf(); 1386| 6.40k| auto newcount = count - idx; 1387| 6.40k| std::move(data + idx, data + count, data); 1388| 6.40k| detail::destroy_n(data + newcount, idx); 1389| 6.40k| return std::make_tuple(0, node); 1390| 6.40k| } else { 1391| 3.55k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 3.55k| if (Mutating) ------------------ | Branch (1392:17): [True: 3.55k, Folded] ------------------ 1393| 3.55k| pos.visit(dec_visitor{}); 1394| 3.55k| return std::make_tuple(0, newn); 1395| 3.55k| } 1396| 9.96k| } _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: 400, False: 982] ------------------ 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: 400, False: 982] ------------------ 1332| 400| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 400| norefs_tag{})) relaxed_t, 1334| 400| 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: 400, False: 982] ------------------ 1340| 1.38k| : pos.towards_sub_oh( 1341| 982| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.38k| if (mutate) ------------------ | Branch (1342:21): [True: 400, False: 982] ------------------ 1343| 400| 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: 982, False: 400] ------------------ 1354| 982| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 982| if (Mutating) ------------------ | Branch (1355:25): [True: 982, Folded] ------------------ 1356| 982| pos.visit(dec_visitor{}); 1357| 982| } 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| 16.4k| { 1378| 16.4k| auto node = pos.node(); 1379| 16.4k| auto idx = pos.index(first); 1380| 16.4k| auto count = pos.count(); 1381| 16.4k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 16.4k] ------------------ 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| 16.4k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 16.4k] ------------------ 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| 16.4k| } else { 1391| 16.4k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 16.4k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 16.4k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 16.4k| return std::make_tuple(0, newn); 1395| 16.4k| } 1396| 16.4k| } _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.16k| { 1304| 4.16k| auto idx = pos.subindex(first); 1305| 4.16k| auto count = pos.count(); 1306| 4.16k| auto node = pos.node(); 1307| 4.16k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 4.16k] ------------------ 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.16k| auto left_size = pos.size_before(idx); 1313| 4.16k| auto child_size = pos.size_sbh(idx, left_size); 1314| 4.16k| auto dropped_size = first; 1315| 4.16k| auto child_dropped_size = dropped_size - left_size; 1316| 4.16k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 4.16k] | 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.16k| } else { 1325| 4.16k| 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.16k| auto newcount = count - idx; 1330| 4.16k| auto newn = 1331| 4.16k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 4.16k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 4.16k| : node_t::make_inner_r_e(e); 1336| 4.16k| auto newr = newn->relaxed(); 1337| 4.16k| IMMER_TRY { ------------------ | | 49| 4.16k|#define IMMER_TRY try ------------------ 1338| 4.16k| auto subs = 1339| 4.16k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 4.16k] ------------------ 1340| 4.16k| : pos.towards_sub_oh( 1341| 4.16k| no_collapse_no_mut_t{}, first, idx, e); 1342| 4.16k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 4.16k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 4.16k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 4.16k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 4.16k, False: 0] ------------------ 1346| 4.16k| pos.copy_sizes( 1347| 4.16k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 4.16k| newr->d.count = newcount; 1349| 4.16k| newn->inner()[0] = get<1>(subs); 1350| 4.16k| std::copy(node->inner() + idx + 1, 1351| 4.16k| node->inner() + count, 1352| 4.16k| newn->inner() + 1); 1353| 4.16k| if (!mutate) { ------------------ | Branch (1353:21): [True: 4.16k, False: 0] ------------------ 1354| 4.16k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 4.16k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 4.16k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 4.16k| } 1358| 4.16k| return std::make_tuple(pos.shift(), newn); 1359| 4.16k| } 1360| 4.16k| 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.16k| } 1373| 4.16k| } _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.22k| { 1199| 5.22k| using node_t = node_type; 1200| 5.22k| auto node = p.node(); 1201| 5.22k| if (node->dec()) { ------------------ | Branch (1201:13): [True: 5.22k, False: 0] ------------------ 1202| 5.22k| p.each_left(dec_t{}, idx); 1203| 5.22k| node_t::delete_inner_r(node, p.count()); 1204| 5.22k| } 1205| 5.22k| } _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| 157k| { 1247| 157k| auto idx = pos.subindex(first); 1248| 157k| auto count = pos.count(); 1249| 157k| auto node = pos.node(); 1250| 157k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 157k, Folded] | Branch (1250:47): [True: 144k, False: 12.8k] ------------------ 1251| 157k| auto left_size = pos.size_before(idx); 1252| 157k| auto child_size = pos.size_sbh(idx, left_size); 1253| 157k| auto dropped_size = first; 1254| 157k| auto child_dropped_size = dropped_size - left_size; 1255| 157k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 157k] | 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| 157k| } else { 1264| 157k| using std::get; 1265| 157k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 144k, False: 12.8k] ------------------ 1266| 157k| : node_t::make_inner_r_e(e); 1267| 157k| auto newr = newn->relaxed(); 1268| 157k| auto newcount = count - idx; 1269| 157k| auto new_child_size = child_size - child_dropped_size; 1270| 157k| IMMER_TRY { ------------------ | | 49| 157k|#define IMMER_TRY try ------------------ 1271| 157k| auto subs = 1272| 157k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 144k, False: 12.8k] ------------------ 1273| 157k| : pos.towards_sub_oh( 1274| 12.8k| no_collapse_no_mut_t{}, first, idx, e); 1275| 157k| if (mutate) ------------------ | Branch (1275:21): [True: 144k, False: 12.8k] ------------------ 1276| 144k| pos.each_left(dec_visitor{}, idx); 1277| 157k| pos.copy_sizes( 1278| 157k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 157k| std::copy(node->inner() + idx + 1, 1280| 157k| node->inner() + count, 1281| 157k| newn->inner() + 1); 1282| 157k| newn->inner()[0] = get<1>(subs); 1283| 157k| newr->d.sizes[0] = new_child_size; 1284| 157k| newr->d.count = newcount; 1285| 157k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 157k, False: 0] ------------------ 1286| 157k| if (!mutate) { ------------------ | Branch (1286:21): [True: 12.8k, False: 144k] ------------------ 1287| 12.8k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 12.8k| if (Mutating) ------------------ | Branch (1288:25): [True: 12.8k, Folded] ------------------ 1289| 12.8k| pos.visit(dec_visitor{}); 1290| 12.8k| } 1291| 157k| return std::make_tuple(pos.shift(), newn); 1292| 157k| } 1293| 157k| 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| 157k| } 1299| 157k| } _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| 66.3k| { 1247| 66.3k| auto idx = pos.subindex(first); 1248| 66.3k| auto count = pos.count(); 1249| 66.3k| auto node = pos.node(); 1250| 66.3k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 66.3k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 66.3k| auto left_size = pos.size_before(idx); 1252| 66.3k| auto child_size = pos.size_sbh(idx, left_size); 1253| 66.3k| auto dropped_size = first; 1254| 66.3k| auto child_dropped_size = dropped_size - left_size; 1255| 66.3k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 66.3k] | 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| 66.3k| } else { 1264| 66.3k| using std::get; 1265| 66.3k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 66.3k] ------------------ 1266| 66.3k| : node_t::make_inner_r_e(e); 1267| 66.3k| auto newr = newn->relaxed(); 1268| 66.3k| auto newcount = count - idx; 1269| 66.3k| auto new_child_size = child_size - child_dropped_size; 1270| 66.3k| IMMER_TRY { ------------------ | | 49| 66.3k|#define IMMER_TRY try ------------------ 1271| 66.3k| auto subs = 1272| 66.3k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 66.3k] ------------------ 1273| 66.3k| : pos.towards_sub_oh( 1274| 66.3k| no_collapse_no_mut_t{}, first, idx, e); 1275| 66.3k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 66.3k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 66.3k| pos.copy_sizes( 1278| 66.3k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 66.3k| std::copy(node->inner() + idx + 1, 1280| 66.3k| node->inner() + count, 1281| 66.3k| newn->inner() + 1); 1282| 66.3k| newn->inner()[0] = get<1>(subs); 1283| 66.3k| newr->d.sizes[0] = new_child_size; 1284| 66.3k| newr->d.count = newcount; 1285| 66.3k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 66.3k, False: 0] ------------------ 1286| 66.3k| if (!mutate) { ------------------ | Branch (1286:21): [True: 66.3k, False: 0] ------------------ 1287| 66.3k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 66.3k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 66.3k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 66.3k| } 1291| 66.3k| return std::make_tuple(pos.shift(), newn); 1292| 66.3k| } 1293| 66.3k| 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| 66.3k| } 1299| 66.3k| } _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.37k| { 1304| 9.37k| auto idx = pos.subindex(first); 1305| 9.37k| auto count = pos.count(); 1306| 9.37k| auto node = pos.node(); 1307| 9.37k| auto mutate = Mutating ------------------ | Branch (1307:23): [True: 0, Folded] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 9.37k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 7.13k, False: 2.24k] ------------------ 1312| 9.37k| auto left_size = pos.size_before(idx); 1313| 9.37k| auto child_size = pos.size_sbh(idx, left_size); 1314| 9.37k| auto dropped_size = first; 1315| 9.37k| auto child_dropped_size = dropped_size - left_size; 1316| 9.37k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 9.37k, Folded] | Branch (1316:25): [True: 7.11k, False: 2.25k] | Branch (1316:45): [True: 5.33k, False: 1.78k] ------------------ 1317| 5.33k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 4.28k, False: 1.04k] ------------------ 1318| 5.33k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 5.33k| if (mutate) ------------------ | Branch (1319:17): [True: 4.28k, False: 1.04k] ------------------ 1320| 4.28k| pos.visit(dec_left_visitor{}, idx); 1321| 1.04k| else if (Mutating) ------------------ | Branch (1321:22): [True: 1.04k, Folded] ------------------ 1322| 1.04k| pos.visit(dec_visitor{}); 1323| 5.33k| return r; 1324| 5.33k| } else { 1325| 4.04k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 4.04k| auto newcount = count - idx; 1330| 4.04k| auto newn = 1331| 4.04k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 2.84k, False: 1.20k] ------------------ 1332| 2.84k| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 2.84k| norefs_tag{})) relaxed_t, 1334| 2.84k| node) 1335| 4.04k| : node_t::make_inner_r_e(e); 1336| 4.04k| auto newr = newn->relaxed(); 1337| 4.04k| IMMER_TRY { ------------------ | | 49| 4.04k|#define IMMER_TRY try ------------------ 1338| 4.04k| auto subs = 1339| 4.04k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 2.84k, False: 1.20k] ------------------ 1340| 4.04k| : pos.towards_sub_oh( 1341| 1.20k| no_collapse_no_mut_t{}, first, idx, e); 1342| 4.04k| if (mutate) ------------------ | Branch (1342:21): [True: 2.84k, False: 1.20k] ------------------ 1343| 2.84k| pos.each_left(dec_visitor{}, idx); 1344| 4.04k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 4.04k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 4.04k, False: 0] ------------------ 1346| 4.04k| pos.copy_sizes( 1347| 4.04k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 4.04k| newr->d.count = newcount; 1349| 4.04k| newn->inner()[0] = get<1>(subs); 1350| 4.04k| std::copy(node->inner() + idx + 1, 1351| 4.04k| node->inner() + count, 1352| 4.04k| newn->inner() + 1); 1353| 4.04k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.20k, False: 2.84k] ------------------ 1354| 1.20k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.20k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.20k, Folded] ------------------ 1356| 1.20k| pos.visit(dec_visitor{}); 1357| 1.20k| } 1358| 4.04k| return std::make_tuple(pos.shift(), newn); 1359| 4.04k| } 1360| 4.04k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 4.04k| } 1373| 9.37k| } _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.41k, False: 2.08k] ------------------ 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.00k, False: 1.49k] | Branch (1316:45): [True: 1.78k, False: 216] ------------------ 1317| 1.78k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 309, False: 1.47k] ------------------ 1318| 1.78k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 1.78k| if (mutate) ------------------ | Branch (1319:17): [True: 309, False: 1.47k] ------------------ 1320| 309| pos.visit(dec_left_visitor{}, idx); 1321| 1.47k| else if (Mutating) ------------------ | Branch (1321:22): [True: 1.47k, Folded] ------------------ 1322| 1.47k| pos.visit(dec_visitor{}); 1323| 1.78k| return r; 1324| 1.78k| } else { 1325| 1.70k| 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.70k| auto newcount = count - idx; 1330| 1.70k| auto newn = 1331| 1.70k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 1.10k, False: 605] ------------------ 1332| 1.10k| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 1.10k| norefs_tag{})) relaxed_t, 1334| 1.10k| node) 1335| 1.70k| : node_t::make_inner_r_e(e); 1336| 1.70k| auto newr = newn->relaxed(); 1337| 1.70k| IMMER_TRY { ------------------ | | 49| 1.70k|#define IMMER_TRY try ------------------ 1338| 1.70k| auto subs = 1339| 1.70k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 1.10k, False: 605] ------------------ 1340| 1.70k| : pos.towards_sub_oh( 1341| 605| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.70k| if (mutate) ------------------ | Branch (1342:21): [True: 1.10k, False: 605] ------------------ 1343| 1.10k| pos.each_left(dec_visitor{}, idx); 1344| 1.70k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.70k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.70k, False: 0] ------------------ 1346| 1.70k| pos.copy_sizes( 1347| 1.70k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.70k| newr->d.count = newcount; 1349| 1.70k| newn->inner()[0] = get<1>(subs); 1350| 1.70k| std::copy(node->inner() + idx + 1, 1351| 1.70k| node->inner() + count, 1352| 1.70k| newn->inner() + 1); 1353| 1.70k| if (!mutate) { ------------------ | Branch (1353:21): [True: 605, False: 1.10k] ------------------ 1354| 605| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 605| if (Mutating) ------------------ | Branch (1355:25): [True: 605, Folded] ------------------ 1356| 605| pos.visit(dec_visitor{}); 1357| 605| } 1358| 1.70k| return std::make_tuple(pos.shift(), newn); 1359| 1.70k| } 1360| 1.70k| 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.70k| } 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| 10.9k| { 350| 10.9k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 10.9k, False: 0] ------------------ 351| 10.9k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 9.90k, False: 1.06k] ------------------ 352| 10.9k| ? visit_maybe_relaxed_sub(rootl, 353| 9.90k| shiftl, 354| 9.90k| sizel, 355| 9.90k| this_t{}, 356| 9.90k| posr, 357| 9.90k| first, 358| 9.90k| size_t{}) 359| 10.9k| : posr.first_sub_inner( 360| 1.06k| rrb{}, first, rootl, shiftl, sizel); 361| 10.9k| } _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| 26.4k| { 383| 26.4k| auto nl = posl.node(); 384| 26.4k| auto nr = posr.node(); 385| 26.4k| if (nl == nr) ------------------ | Branch (385:13): [True: 8.14k, False: 18.3k] ------------------ 386| 8.14k| return true; 387| 18.3k| auto cl = posl.count(); 388| 18.3k| auto cr = posr.count(); 389| 18.3k| assert(cr > 0); ------------------ | Branch (389:9): [True: 18.3k, False: 0] ------------------ 390| 18.3k| auto sbr = size_t{}; 391| 18.3k| auto i = count_t{}; 392| 18.3k| auto j = count_t{}; 393| 60.2k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 49.3k, False: 10.9k] ------------------ 394| 49.3k| auto sbl = posl.size_before(i); 395| 78.7k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 62.7k, False: 16.0k] | Branch (395:34): [True: 29.4k, False: 33.3k] ------------------ 396| 29.4k| ; 397| 49.3k| auto res = 398| 49.3k| sbl == sbr ------------------ | Branch (398:17): [True: 30.5k, False: 18.7k] ------------------ 399| 49.3k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 49.3k| : posl.nth_sub(i, 401| 18.7k| for_each_chunk_p_visitor{}, 402| 18.7k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 49.3k| if (!res) ------------------ | Branch (403:17): [True: 7.38k, False: 41.9k] ------------------ 404| 7.38k| return false; 405| 49.3k| } 406| 10.9k| return true; 407| 18.3k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 336| 8.84k| { 337| 8.84k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 8.84k| } _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.51k| { 428| 9.51k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 5.15k, False: 4.36k] ------------------ 429| 5.15k| return true; 430| 4.36k| auto cl = posl.count(); 431| 4.36k| auto cr = posr.count(); 432| 4.36k| auto mp = std::min(cl, cr); 433| 4.36k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 3.28k, False: 1.07k] ------------------ 434| 4.36k| posl.node()->leaf() + mp, 435| 4.36k| posr.node()->leaf()) && 436| 3.28k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 2.81k, False: 476] ------------------ 437| 3.28k| posl.node()->leaf() + posl.count(), 438| 3.28k| first + (idx + mp)); 439| 9.51k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESH_RNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 329| 19.7k| { 330| 19.7k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 19.7k| } _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.76k| { 413| 4.76k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 4.76k| } _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.76k| { 383| 4.76k| auto nl = posl.node(); 384| 4.76k| auto nr = posr.node(); 385| 4.76k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 4.76k] ------------------ 386| 0| return true; 387| 4.76k| auto cl = posl.count(); 388| 4.76k| auto cr = posr.count(); 389| 4.76k| assert(cr > 0); ------------------ | Branch (389:9): [True: 4.76k, False: 0] ------------------ 390| 4.76k| auto sbr = size_t{}; 391| 4.76k| auto i = count_t{}; 392| 4.76k| auto j = count_t{}; 393| 13.6k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 11.3k, False: 2.28k] ------------------ 394| 11.3k| auto sbl = posl.size_before(i); 395| 17.7k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 13.1k, False: 4.58k] | Branch (395:34): [True: 6.32k, False: 6.80k] ------------------ 396| 6.32k| ; 397| 11.3k| auto res = 398| 11.3k| sbl == sbr ------------------ | Branch (398:17): [True: 6.94k, False: 4.44k] ------------------ 399| 11.3k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 11.3k| : 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.3k| if (!res) ------------------ | Branch (403:17): [True: 2.47k, False: 8.91k] ------------------ 404| 2.47k| return false; 405| 11.3k| } 406| 2.28k| return true; 407| 4.76k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_15regular_sub_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 336| 3.79k| { 337| 3.79k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 3.79k| } _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.12k| { 428| 7.12k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 4.14k, False: 2.98k] ------------------ 429| 4.14k| return true; 430| 2.98k| auto cl = posl.count(); 431| 2.98k| auto cr = posr.count(); 432| 2.98k| auto mp = std::min(cl, cr); 433| 2.98k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 2.74k, False: 232] ------------------ 434| 2.98k| posl.node()->leaf() + mp, 435| 2.98k| posr.node()->leaf()) && 436| 2.74k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 2.45k, False: 297] ------------------ 437| 2.74k| posl.node()->leaf() + posl.count(), 438| 2.74k| first + (idx + mp)); 439| 7.12k| } _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.39k| { 330| 2.39k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.39k| } _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.82k| { 413| 2.82k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 2.82k| } _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.82k| { 383| 2.82k| auto nl = posl.node(); 384| 2.82k| auto nr = posr.node(); 385| 2.82k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.82k] ------------------ 386| 0| return true; 387| 2.82k| auto cl = posl.count(); 388| 2.82k| auto cr = posr.count(); 389| 2.82k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.82k, False: 0] ------------------ 390| 2.82k| auto sbr = size_t{}; 391| 2.82k| auto i = count_t{}; 392| 2.82k| auto j = count_t{}; 393| 13.1k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 10.6k, False: 2.52k] ------------------ 394| 10.6k| auto sbl = posl.size_before(i); 395| 18.1k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 14.0k, False: 4.09k] | Branch (395:34): [True: 7.49k, False: 6.52k] ------------------ 396| 7.49k| ; 397| 10.6k| auto res = 398| 10.6k| sbl == sbr ------------------ | Branch (398:17): [True: 6.07k, False: 4.53k] ------------------ 399| 10.6k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 10.6k| : posl.nth_sub(i, 401| 4.53k| for_each_chunk_p_visitor{}, 402| 4.53k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 10.6k| if (!res) ------------------ | Branch (403:17): [True: 306, False: 10.3k] ------------------ 404| 306| return false; 405| 10.6k| } 406| 2.52k| return true; 407| 2.82k| } _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| 4.00k| { 337| 4.00k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 4.00k| } _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| 915| { 330| 915| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 915| } _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.15k| { 330| 1.15k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 1.15k| } _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.90k| { 420| 1.90k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 1.90k, False: 0] ------------------ 421| 1.90k| ? this_t::visit_regular(posl, posr.node()) 422| 1.90k| : this_t::visit_regular(posr, posl.node()); 423| 1.90k| } _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.6k| { 444| 10.6k| auto node = pos.node(); 445| 10.6k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 7.01k, False: 3.65k] | Branch (445:33): [True: 1.85k, False: 1.80k] ------------------ 446| 10.6k| } _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.8k| { 451| 13.8k| auto node = pos.node(); 452| 13.8k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 8.92k, False: 4.96k] | Branch (452:33): [True: 2.96k, False: 1.99k] ------------------ 453| 4.96k| node->leaf() + pos.count(), 454| 4.96k| other->leaf()); 455| 13.8k| } _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.86k| { 444| 7.86k| auto node = pos.node(); 445| 7.86k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 2.57k, False: 5.28k] | Branch (445:33): [True: 2.79k, False: 2.49k] ------------------ 446| 7.86k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESE_EEbOT_PT0_: 450| 3.12k| { 451| 3.12k| auto node = pos.node(); 452| 3.12k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.60k, False: 1.51k] | Branch (452:33): [True: 808, False: 711] ------------------ 453| 1.51k| node->leaf() + pos.count(), 454| 1.51k| other->leaf()); 455| 3.12k| } _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.82k| { 444| 3.82k| auto node = pos.node(); 445| 3.82k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 374, False: 3.44k] | Branch (445:33): [True: 2.32k, False: 1.12k] ------------------ 446| 3.82k| } _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| 318k| { 113| 318k| auto data = as_const(pos.node()->leaf()); 114| 318k| return fn(data, data + pos.count()); 115| 318k| } _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.27M| return [iter](auto f, auto e) mutable { 368| 1.27M| if (f == &*iter) { ------------------ | Branch (368:17): [True: 189k, False: 1.08M] ------------------ 369| 189k| iter += e - f; 370| 189k| return true; 371| 189k| } 372| 4.95M| for (; f != e; ++f, ++iter) ------------------ | Branch (372:20): [True: 3.87M, False: 1.08M] ------------------ 373| 3.87M| if (*f != *iter) ------------------ | Branch (373:21): [True: 3.38k, False: 3.87M] ------------------ 374| 3.38k| return false; 375| 1.08M| return true; 376| 1.08M| }; _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| 8.84M| { 54| 8.84M| return pos.towards(this_t{}, idx); 55| 8.84M| } _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| 953k| { 60| 953k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 953k| } _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| 343k| { 54| 343k| return pos.towards(this_t{}, idx); 55| 343k| } _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| 321k| { 60| 321k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 321k| } _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| 925k| { 54| 925k| return pos.towards(this_t{}, idx); 55| 925k| } _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| 22.1k| { 60| 22.1k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 22.1k| } _ZN5immer6detail4rbts18region_for_visitorIiE11visit_innerIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEENSt3__15tupleIJPimmEEEOT_m: 53| 101k| { 54| 101k| return pos.towards(this_t{}, idx); 55| 101k| } _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| 85.7k| { 107| 85.7k| return pos.each_pred(this_t{}, fn); 108| 85.7k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESH_RNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 329| 753| { 330| 753| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 753| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESG_RNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEENSt3__19enable_ifIXnt12is_relaxed_vIT0_EEbE4typeEOT_OSM_OT1_m: 419| 6.58k| { 420| 6.58k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 6.58k, False: 0] ------------------ 421| 6.58k| ? this_t::visit_regular(posl, posr.node()) 422| 6.58k| : this_t::visit_regular(posr, posl.node()); 423| 6.58k| } _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| 938k| { 113| 938k| auto data = as_const(pos.node()->leaf()); 114| 938k| return fn(data, data + pos.count()); 115| 938k| } _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| 18.7k| { 107| 18.7k| return pos.each_pred(this_t{}, fn); 108| 18.7k| } _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| 17.4k| { 113| 17.4k| auto data = as_const(pos.node()->leaf()); 114| 17.4k| return fn(data, data + pos.count()); 115| 17.4k| } _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.53k| { 107| 6.53k| return pos.each_pred(this_t{}, fn); 108| 6.53k| } _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.36k| { 330| 2.36k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.36k| } _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.53k| { 383| 2.53k| auto nl = posl.node(); 384| 2.53k| auto nr = posr.node(); 385| 2.53k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.53k] ------------------ 386| 0| return true; 387| 2.53k| auto cl = posl.count(); 388| 2.53k| auto cr = posr.count(); 389| 2.53k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.53k, False: 0] ------------------ 390| 2.53k| auto sbr = size_t{}; 391| 2.53k| auto i = count_t{}; 392| 2.53k| auto j = count_t{}; 393| 8.40k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 6.65k, False: 1.75k] ------------------ 394| 6.65k| auto sbl = posl.size_before(i); 395| 10.2k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 8.00k, False: 2.26k] | Branch (395:34): [True: 3.61k, False: 4.38k] ------------------ 396| 3.61k| ; 397| 6.65k| auto res = 398| 6.65k| sbl == sbr ------------------ | Branch (398:17): [True: 4.13k, False: 2.51k] ------------------ 399| 6.65k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 6.65k| : posl.nth_sub(i, 401| 2.51k| for_each_chunk_p_visitor{}, 402| 2.51k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 6.65k| if (!res) ------------------ | Branch (403:17): [True: 783, False: 5.87k] ------------------ 404| 783| return false; 405| 6.65k| } 406| 1.75k| return true; 407| 2.53k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 336| 4.80k| { 337| 4.80k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 4.80k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_13full_leaf_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEbOT_OT0_OT1_m: 427| 4.80k| { 428| 4.80k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 2.83k, False: 1.96k] ------------------ 429| 2.83k| return true; 430| 1.96k| auto cl = posl.count(); 431| 1.96k| auto cr = posr.count(); 432| 1.96k| auto mp = std::min(cl, cr); 433| 1.96k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 1.62k, False: 341] ------------------ 434| 1.96k| posl.node()->leaf() + mp, 435| 1.96k| posr.node()->leaf()) && 436| 1.62k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 1.62k, False: 0] ------------------ 437| 1.62k| posl.node()->leaf() + posl.count(), 438| 1.62k| first + (idx + mp)); 439| 4.80k| } _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| 3.05k| { 330| 3.05k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 3.05k| } _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.77k| { 383| 1.77k| auto nl = posl.node(); 384| 1.77k| auto nr = posr.node(); 385| 1.77k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 1.77k] ------------------ 386| 0| return true; 387| 1.77k| auto cl = posl.count(); 388| 1.77k| auto cr = posr.count(); 389| 1.77k| assert(cr > 0); ------------------ | Branch (389:9): [True: 1.77k, False: 0] ------------------ 390| 1.77k| auto sbr = size_t{}; 391| 1.77k| auto i = count_t{}; 392| 1.77k| auto j = count_t{}; 393| 8.04k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 6.61k, False: 1.43k] ------------------ 394| 6.61k| auto sbl = posl.size_before(i); 395| 11.3k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 10.0k, False: 1.38k] | Branch (395:34): [True: 4.76k, False: 5.23k] ------------------ 396| 4.76k| ; 397| 6.61k| auto res = 398| 6.61k| sbl == sbr ------------------ | Branch (398:17): [True: 4.11k, False: 2.50k] ------------------ 399| 6.61k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 6.61k| : posl.nth_sub(i, 401| 2.50k| for_each_chunk_p_visitor{}, 402| 2.50k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 6.61k| if (!res) ------------------ | Branch (403:17): [True: 342, False: 6.27k] ------------------ 404| 342| return false; 405| 6.61k| } 406| 1.43k| return true; 407| 1.77k| } _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.28k| { 420| 1.28k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 1.28k, False: 0] ------------------ 421| 1.28k| ? this_t::visit_regular(posl, posr.node()) 422| 1.28k| : this_t::visit_regular(posr, posl.node()); 423| 1.28k| } _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| 579k| { 107| 579k| return pos.each_pred(this_t{}, fn); 108| 579k| } _ZN5immer6detail4rbts14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaOT_: 366| 32.7k| { 367| 32.7k| return [iter](auto f, auto e) mutable { 368| 32.7k| if (f == &*iter) { 369| 32.7k| iter += e - f; 370| 32.7k| return true; 371| 32.7k| } 372| 32.7k| for (; f != e; ++f, ++iter) 373| 32.7k| if (*f != *iter) 374| 32.7k| return false; 375| 32.7k| return true; 376| 32.7k| }; 377| 32.7k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEESF_EEbOT_OT0_PT1_jm: 349| 1.40k| { 350| 1.40k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 1.40k, False: 0] ------------------ 351| 1.40k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 1.06k, False: 342] ------------------ 352| 1.40k| ? visit_maybe_relaxed_sub(rootl, 353| 1.06k| shiftl, 354| 1.06k| sizel, 355| 1.06k| this_t{}, 356| 1.06k| posr, 357| 1.06k| first, 358| 1.06k| size_t{}) 359| 1.40k| : posr.first_sub_inner( 360| 342| rrb{}, first, rootl, shiftl, sizel); 361| 1.40k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_16rrbtree_iteratorIiSE_Lj2ELj2EEESF_EEbOT_OT0_PT1_jm: 349| 6.75k| { 350| 6.75k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 6.75k, False: 0] ------------------ 351| 6.75k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 6.75k, False: 0] ------------------ 352| 6.75k| ? visit_maybe_relaxed_sub(rootl, 353| 6.75k| shiftl, 354| 6.75k| sizel, 355| 6.75k| this_t{}, 356| 6.75k| posr, 357| 6.75k| first, 358| 6.75k| size_t{}) 359| 6.75k| : posr.first_sub_inner( 360| 0| rrb{}, first, rootl, shiftl, sizel); 361| 6.75k| } _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.21k| { 451| 6.21k| auto node = pos.node(); 452| 6.21k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 2.92k, False: 3.29k] | Branch (452:33): [True: 1.02k, False: 2.26k] ------------------ 453| 3.29k| node->leaf() + pos.count(), 454| 3.29k| other->leaf()); 455| 6.21k| } _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| 29.2M|{ 1839| 29.2M| assert(node); ------------------ | Branch (1839:5): [True: 29.2M, False: 0] ------------------ 1840| 29.2M| auto relaxed = node->relaxed(); 1841| 29.2M| if (relaxed) { ------------------ | Branch (1841:9): [True: 26.7M, False: 2.50M] ------------------ 1842| 26.7M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 26.7M, False: 0] ------------------ 1843| 26.7M| return make_relaxed_pos(node, shift, relaxed) 1844| 26.7M| .visit(v, std::forward(args)...); 1845| 26.7M| } else { 1846| 2.50M| return make_regular_sub_pos(node, shift, size) 1847| 2.50M| .visit(v, std::forward(args)...); 1848| 2.50M| } 1849| 29.2M|} _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| 91.6M|{ 1829| 91.6M| assert(node); ------------------ | Branch (1829:5): [True: 91.6M, False: 0] ------------------ 1830| 91.6M| assert(relaxed); ------------------ | Branch (1830:5): [True: 91.6M, False: 0] ------------------ 1831| 91.6M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1831:5): [True: 91.6M, False: 0] ------------------ 1832| 91.6M| return {node, shift, relaxed}; 1833| 91.6M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1813| 34.2M| { 1814| 34.2M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 34.2M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 1431| 55.9M| node_t* node() const { return node_; } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 1476| 11.1M| { 1477| 11.1M| each_left(v, relaxed_->d.count, args...); 1478| 11.1M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1623| 11.3M| { 1624| 11.3M| auto p = node_->inner(); 1625| 11.3M| auto s = size_t{}; 1626| 11.3M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 1.95M, False: 9.34M] ------------------ 1627| 8.47M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 6.52M, False: 1.95M] ------------------ 1628| 6.52M| IMMER_PREFETCH(p + i + 1); 1629| 6.52M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 6.52M| .visit(v, args...); 1631| 6.52M| s = relaxed_->d.sizes[i]; 1632| 6.52M| assert(s); ------------------ | Branch (1632:17): [True: 6.52M, False: 0] ------------------ 1633| 6.52M| } 1634| 9.34M| } else { 1635| 9.34M| auto ss = shift_ - B; 1636| 37.0M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 27.6M, False: 9.34M] ------------------ 1637| 27.6M| visit_maybe_relaxed_sub( 1638| 27.6M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 27.6M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 27.6M, False: 0] ------------------ 1641| 27.6M| } 1642| 9.34M| } 1643| 11.3M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5countEv: 1430| 53.1M| 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.03M|{ 1045| 6.03M| assert(node); ------------------ | Branch (1045:5): [True: 6.03M, False: 0] ------------------ 1046| 6.03M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1046:5): [True: 6.03M, False: 0] ------------------ 1047| 6.03M| assert(size > 0); ------------------ | Branch (1047:5): [True: 6.03M, False: 0] ------------------ 1048| 6.03M| assert(size <= (branches << shift)); ------------------ | Branch (1048:5): [True: 6.03M, False: 0] ------------------ 1049| 6.03M| return {node, shift, size}; 1050| 6.03M|} _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.11M| 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| 614k| { 826| 614k| return each_regular(*this, v, args...); 827| 614k| } _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| 614k|{ 344| 614k| constexpr auto B = bits; 345| 614k| constexpr auto BL = bits_leaf; 346| 614k| auto n = p.node()->inner(); 347| 614k| auto last = p.count() - 1; 348| 614k| auto e = n + last; 349| 614k| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 51.1k, False: 563k] ------------------ 350| 109k| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 58.7k, False: 51.1k] ------------------ 351| 58.7k| IMMER_PREFETCH(n + 1); 352| 58.7k| make_full_leaf_pos(*n).visit(v, args...); 353| 58.7k| } 354| 51.1k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 563k| } else { 356| 563k| auto ss = p.shift() - B; 357| 1.28M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 723k, False: 563k] ------------------ 358| 723k| make_full_pos(*n, ss).visit(v, args...); 359| 563k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 563k| } 361| 614k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 787| 7.63M| 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.16M|{ 215| 4.16M| assert(node); ------------------ | Branch (215:5): [True: 4.16M, False: 0] ------------------ 216| 4.16M| return {node}; 217| 4.16M|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 207| 1.26M| { 208| 1.26M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.26M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 199| 3.18M| 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.46M| 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.03M|{ 120| 1.03M| assert(node); ------------------ | Branch (120:5): [True: 1.03M, False: 0] ------------------ 121| 1.03M| assert(size > 0); ------------------ | Branch (121:5): [True: 1.03M, False: 0] ------------------ 122| 1.03M| return {node, size}; 123| 1.03M|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 786| 4.42M| 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| 484k| { 113| 484k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 484k| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 104| 1.03M| 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.05M| 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.09M| 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.24M|{ 1413| 6.24M| assert(node); ------------------ | Branch (1413:5): [True: 6.24M, False: 0] ------------------ 1414| 6.24M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1414:5): [True: 6.24M, False: 0] ------------------ 1415| 6.24M| return {node, shift}; 1416| 6.24M|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1405| 3.61M| { 1406| 3.61M| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.61M| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 1159| 4.40M| 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| 246k| { 1186| 246k| auto p = node_->inner(); 1187| 246k| auto e = p + branches; 1188| 246k| if (shift_ == BL) { ------------------ | Branch (1188:13): [True: 189k, False: 57.3k] ------------------ 1189| 946k| for (; p != e; ++p) { ------------------ | Branch (1189:20): [True: 757k, False: 189k] ------------------ 1190| 757k| IMMER_PREFETCH(p + 1); 1191| 757k| make_full_leaf_pos(*p).visit(v, args...); 1192| 757k| } 1193| 189k| } else { 1194| 57.3k| auto ss = shift_ - B; 1195| 286k| for (; p != e; ++p) ------------------ | Branch (1195:20): [True: 229k, False: 57.3k] ------------------ 1196| 229k| make_full_pos(*p, ss).visit(v, args...); 1197| 57.3k| } 1198| 246k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5countEv: 1158| 1.72M| 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.85M|{ 691| 5.85M| assert(node); ------------------ | Branch (691:5): [True: 5.85M, False: 0] ------------------ 692| 5.85M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (692:5): [True: 5.85M, False: 0] ------------------ 693| 5.85M| assert(size > 0); ------------------ | Branch (693:5): [True: 5.85M, False: 0] ------------------ 694| 5.85M| return {node, shift, size}; 695| 5.85M|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 336| 2.47M| { 337| 2.47M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.47M| } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 231| 10.7M| 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.33M| { 244| 2.33M| return each_regular(*this, v, args...); 245| 2.33M| } _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.33M|{ 344| 2.33M| constexpr auto B = bits; 345| 2.33M| constexpr auto BL = bits_leaf; 346| 2.33M| auto n = p.node()->inner(); 347| 2.33M| auto last = p.count() - 1; 348| 2.33M| auto e = n + last; 349| 2.33M| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 426k, False: 1.90M] ------------------ 350| 857k| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 430k, False: 426k] ------------------ 351| 430k| IMMER_PREFETCH(n + 1); 352| 430k| make_full_leaf_pos(*n).visit(v, args...); 353| 430k| } 354| 426k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 1.90M| } else { 356| 1.90M| auto ss = p.shift() - B; 357| 4.55M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 2.64M, False: 1.90M] ------------------ 358| 2.64M| make_full_pos(*n, ss).visit(v, args...); 359| 1.90M| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 1.90M| } 361| 2.33M|} _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 233| 10.2M| shift_t shift() const { return shift_; } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 232| 14.6M| 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.44M| count_t count() const { return index(size_ - 1) + 1; } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 234| 14.1M| 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.02M| 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.30M| 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.68M|{ 65| 1.68M| return {node}; 66| 1.68M|} _ZN5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 57| 1.68M| { 58| 1.68M| return Visitor::visit_regular(*this, std::forward(args)...); 59| 1.68M| } _ZNK5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 41| 1.68M| 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| 17.2M|{ 152| 17.2M| assert(node); ------------------ | Branch (152:5): [True: 17.2M, False: 0] ------------------ 153| 17.2M| assert(count <= branches); ------------------ | Branch (153:5): [True: 17.2M, False: 0] ------------------ 154| 17.2M| return {node, count}; 155| 17.2M|} _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 144| 9.63M| { 145| 9.63M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 9.63M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 136| 14.9M| node_t* node() const { return node_; } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5countEv: 135| 8.49M| 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.59M|{ 89| 1.59M| assert(node); ------------------ | Branch (89:5): [True: 1.59M, False: 0] ------------------ 90| 1.59M| return {node}; 91| 1.59M|} _ZN5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 81| 1.59M| { 82| 1.59M| return Visitor::visit_leaf(*this, std::forward(args)...); 83| 1.59M| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 75| 1.59M| 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.85k| 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| 585k| { 1814| 585k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 585k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 1433| 10.8M| shift_t shift() const { return shift_; } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEj: 1443| 5.69M| { 1444| 5.69M| return size_sbh(offset, size_before(offset)); 1445| 5.69M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8size_sbhEjm: 1448| 6.01M| { 1449| 6.01M| assert(size_before_hint == size_before(offset)); ------------------ | Branch (1449:9): [True: 6.01M, False: 0] ------------------ 1450| 6.01M| return relaxed_->d.sizes[offset] - size_before_hint; 1451| 6.01M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11size_beforeEj: 1438| 16.5M| { 1439| 16.5M| return offset ? relaxed_->d.sizes[offset - 1] : 0; ------------------ | Branch (1439:16): [True: 10.5M, False: 5.92M] ------------------ 1440| 16.5M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11last_oh_cshINS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcT_jmDpOT0_: 1737| 572k| { 1738| 572k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 572k, False: 0] ------------------ 1739| 572k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 572k, False: 0] ------------------ 1740| 572k| auto child = node_->inner()[offset_hint]; 1741| 572k| auto is_leaf = shift_ == BL; 1742| 572k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 572k] ------------------ 1743| 572k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 572k| : visit_maybe_relaxed_sub( 1745| 572k| child, shift_ - B, child_size_hint, v, args...); 1746| 572k| } _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| 572k|{ 1839| 572k| assert(node); ------------------ | Branch (1839:5): [True: 572k, False: 0] ------------------ 1840| 572k| auto relaxed = node->relaxed(); 1841| 572k| if (relaxed) { ------------------ | Branch (1841:9): [True: 353k, False: 219k] ------------------ 1842| 353k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 353k, False: 0] ------------------ 1843| 353k| return make_relaxed_pos(node, shift, relaxed) 1844| 353k| .visit(v, std::forward(args)...); 1845| 353k| } else { 1846| 219k| return make_regular_sub_pos(node, shift, size) 1847| 219k| .visit(v, std::forward(args)...); 1848| 219k| } 1849| 572k|} _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| 219k| { 1037| 219k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 219k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 788| 2.37M| 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| 527k| { 953| 527k| return last_oh_regular(*this, v, offset_hint, args...); 954| 527k| } _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| 527k|{ 678| 527k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 527k, False: 0] ------------------ 679| 527k| constexpr auto B = bits; 680| 527k| constexpr auto BL = bits_leaf; 681| 527k| auto child = p.node()->inner()[offset_hint]; 682| 527k| auto is_leaf = p.shift() == BL; 683| 527k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 527k] ------------------ 684| 527k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 527k| .visit(v, args...); 686| 527k|} _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.29M| { 337| 2.29M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.29M| } _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.76M| { 331| 1.76M| return last_oh_regular(*this, v, offset_hint, args...); 332| 1.76M| } _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.76M|{ 678| 1.76M| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.76M, False: 0] ------------------ 679| 1.76M| constexpr auto B = bits; 680| 1.76M| constexpr auto BL = bits_leaf; 681| 1.76M| auto child = p.node()->inner()[offset_hint]; 682| 1.76M| auto is_leaf = p.shift() == BL; 683| 1.76M| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.76M] ------------------ 684| 1.76M| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.76M| .visit(v, args...); 686| 1.76M|} _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 1432| 20.3M| size_t size() const { return relaxed_->d.sizes[relaxed_->d.count - 1]; } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_DpOT0_: 1036| 330k| { 1037| 330k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 330k| } 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.2k| { 145| 42.2k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 42.2k| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 139| 1.11M| 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| 302k|{ 1839| 302k| assert(node); ------------------ | Branch (1839:5): [True: 302k, False: 0] ------------------ 1840| 302k| auto relaxed = node->relaxed(); 1841| 302k| if (relaxed) { ------------------ | Branch (1841:9): [True: 270k, False: 31.9k] ------------------ 1842| 270k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 270k, False: 0] ------------------ 1843| 270k| return make_relaxed_pos(node, shift, relaxed) 1844| 270k| .visit(v, std::forward(args)...); 1845| 270k| } else { 1846| 31.9k| return make_regular_sub_pos(node, shift, size) 1847| 31.9k| .visit(v, std::forward(args)...); 1848| 31.9k| } 1849| 302k|} 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| 270k| { 1814| 270k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 270k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 1454| 28.8M| { 1455| 28.8M| auto offset = idx >> shift_; 1456| 39.5M| while (relaxed_->d.sizes[offset] <= idx) ------------------ | Branch (1456:16): [True: 10.6M, False: 28.8M] ------------------ 1457| 10.6M| ++offset; 1458| 28.8M| return offset; 1459| 28.8M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7relaxedEv: 1435| 270k| 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| 270k| { 1687| 270k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 270k, False: 0] ------------------ 1688| 270k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 70.9k, False: 199k] ------------------ 1689| 270k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 270k| } 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| 270k| { 1699| 270k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 270k| } 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| 270k| { 1718| 270k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 270k, False: 0] ------------------ 1719| 270k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 70.9k, False: 199k] | Branch (1719:9): [True: 270k, False: 0] ------------------ 1720| 270k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 270k| auto child = node_->inner()[offset_hint]; 1722| 270k| auto is_leaf = shift_ == BL; 1723| 270k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 270k| auto next_idx = idx - left_size_hint; 1725| 270k| return is_leaf ------------------ | Branch (1725:16): [True: 59.3k, False: 210k] ------------------ 1726| 270k| ? make_leaf_sub_pos(child, next_size) 1727| 59.3k| .visit(v, next_idx, args...) 1728| 270k| : visit_maybe_relaxed_sub( 1729| 210k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 270k| } 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| 59.3k| { 145| 59.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 59.3k| } 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| 31.9k| { 1037| 31.9k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 31.9k| } flex-vector.cpp:_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_: 938| 31.9k| { 939| 31.9k| return towards_oh_ch_regular( 940| 31.9k| *this, v, idx, offset_hint, count(), args...); 941| 31.9k| } flex-vector.cpp:_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_14update_visitorISD_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcOSL_T0_mjjDpOT1_: 632| 31.9k|{ 633| 31.9k| constexpr auto B = bits; 634| 31.9k| constexpr auto BL = bits_leaf; 635| 31.9k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 31.9k, False: 0] ------------------ 636| 31.9k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 31.9k, False: 0] ------------------ 637| 31.9k| auto is_leaf = p.shift() == BL; 638| 31.9k| auto child = p.node()->inner()[offset_hint]; 639| 31.9k| auto is_full = offset_hint + 1 != count_hint; 640| 31.9k| return is_full ------------------ | Branch (640:12): [True: 24.5k, False: 7.36k] ------------------ 641| 31.9k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 10.1k, False: 14.3k] ------------------ 642| 24.5k| : make_full_pos(child, p.shift() - B) 643| 14.3k| .visit(v, idx, args...)) 644| 31.9k| : (is_leaf ------------------ | Branch (644:19): [True: 4.10k, False: 3.25k] ------------------ 645| 7.36k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 7.36k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.25k| .visit(v, idx, args...)); 648| 31.9k|} flex-vector.cpp:_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 207| 27.0k| { 208| 27.0k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 27.0k| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 202| 401k| 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| 21.0k| { 1406| 21.0k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 21.0k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 1162| 1.95M| 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| 21.0k| { 1330| 21.0k| return towards_oh(v, idx, offset_hint, args...); 1331| 21.0k| } 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| 21.0k| { 1337| 21.0k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 21.0k, False: 0] ------------------ 1338| 21.0k| auto is_leaf = shift_ == BL; 1339| 21.0k| auto child = node_->inner()[offset_hint]; 1340| 21.0k| return is_leaf ------------------ | Branch (1340:16): [True: 15.2k, False: 5.83k] ------------------ 1341| 21.0k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 21.0k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 21.0k| } 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.86k| { 113| 4.86k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 4.86k| } 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| 3.63k| { 337| 3.63k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.63k| } 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| 3.63k| { 317| 3.63k| return towards_oh_ch_regular( 318| 3.63k| *this, v, idx, offset_hint, count(), args...); 319| 3.63k| } 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| 3.63k|{ 633| 3.63k| constexpr auto B = bits; 634| 3.63k| constexpr auto BL = bits_leaf; 635| 3.63k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.63k, False: 0] ------------------ 636| 3.63k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.63k, False: 0] ------------------ 637| 3.63k| auto is_leaf = p.shift() == BL; 638| 3.63k| auto child = p.node()->inner()[offset_hint]; 639| 3.63k| auto is_full = offset_hint + 1 != count_hint; 640| 3.63k| return is_full ------------------ | Branch (640:12): [True: 2.50k, False: 1.13k] ------------------ 641| 3.63k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.67k, False: 824] ------------------ 642| 2.50k| : make_full_pos(child, p.shift() - B) 643| 824| .visit(v, idx, args...)) 644| 3.63k| : (is_leaf ------------------ | Branch (644:19): [True: 756, False: 376] ------------------ 645| 1.13k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.13k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 376| .visit(v, idx, args...)); 648| 3.63k|} _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| 39.8k|{ 1839| 39.8k| assert(node); ------------------ | Branch (1839:5): [True: 39.8k, False: 0] ------------------ 1840| 39.8k| auto relaxed = node->relaxed(); 1841| 39.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 33.9k, False: 5.95k] ------------------ 1842| 33.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 33.9k, False: 0] ------------------ 1843| 33.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 33.9k| .visit(v, std::forward(args)...); 1845| 33.9k| } else { 1846| 5.95k| return make_regular_sub_pos(node, shift, size) 1847| 5.95k| .visit(v, std::forward(args)...); 1848| 5.95k| } 1849| 39.8k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 33.9k| { 1814| 33.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 33.9k| } _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| 25.1k| { 1687| 25.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 25.1k, False: 0] ------------------ 1688| 25.1k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 25.1k] ------------------ 1689| 25.1k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 25.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1698| 25.1k| { 1699| 25.1k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 25.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1717| 25.1k| { 1718| 25.1k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 25.1k, False: 0] ------------------ 1719| 25.1k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 25.1k] | Branch (1719:9): [True: 25.1k, False: 0] ------------------ 1720| 25.1k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 25.1k| auto child = node_->inner()[offset_hint]; 1722| 25.1k| auto is_leaf = shift_ == BL; 1723| 25.1k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 25.1k| auto next_idx = idx - left_size_hint; 1725| 25.1k| return is_leaf ------------------ | Branch (1725:16): [True: 1.80k, False: 23.3k] ------------------ 1726| 25.1k| ? make_leaf_sub_pos(child, next_size) 1727| 1.80k| .visit(v, next_idx, args...) 1728| 25.1k| : visit_maybe_relaxed_sub( 1729| 23.3k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 25.1k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 144| 1.80k| { 145| 1.80k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.80k| } _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| 19.8k| { 1687| 19.8k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 19.8k, False: 0] ------------------ 1688| 19.8k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 13.1k, False: 6.73k] ------------------ 1689| 19.8k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 19.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| 19.8k| { 1699| 19.8k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 19.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| 19.8k| { 1718| 19.8k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 19.8k, False: 0] ------------------ 1719| 19.8k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 13.1k, False: 6.73k] | Branch (1719:9): [True: 19.8k, False: 0] ------------------ 1720| 19.8k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 19.8k| auto child = node_->inner()[offset_hint]; 1722| 19.8k| auto is_leaf = shift_ == BL; 1723| 19.8k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 19.8k| auto next_idx = idx - left_size_hint; 1725| 19.8k| return is_leaf ------------------ | Branch (1725:16): [True: 4.86k, False: 15.0k] ------------------ 1726| 19.8k| ? make_leaf_sub_pos(child, next_size) 1727| 4.86k| .visit(v, next_idx, args...) 1728| 19.8k| : visit_maybe_relaxed_sub( 1729| 15.0k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 19.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| 4.86k| { 145| 4.86k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.86k| } _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.0k|{ 1839| 15.0k| assert(node); ------------------ | Branch (1839:5): [True: 15.0k, False: 0] ------------------ 1840| 15.0k| auto relaxed = node->relaxed(); 1841| 15.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 11.1k, False: 3.86k] ------------------ 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| 3.86k| return make_regular_sub_pos(node, shift, size) 1847| 3.86k| .visit(v, std::forward(args)...); 1848| 3.86k| } 1849| 15.0k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1813| 11.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_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1036| 3.86k| { 1037| 3.86k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.86k| } _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.41k| { 928| 6.41k| return towards_oh_ch_regular( 929| 6.41k| *this, v, idx, offset_hint, count(), args...); 930| 6.41k| } _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.41k|{ 633| 6.41k| constexpr auto B = bits; 634| 6.41k| constexpr auto BL = bits_leaf; 635| 6.41k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.41k, False: 0] ------------------ 636| 6.41k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.41k, False: 0] ------------------ 637| 6.41k| auto is_leaf = p.shift() == BL; 638| 6.41k| auto child = p.node()->inner()[offset_hint]; 639| 6.41k| auto is_full = offset_hint + 1 != count_hint; 640| 6.41k| return is_full ------------------ | Branch (640:12): [True: 2.18k, False: 4.23k] ------------------ 641| 6.41k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.34k, False: 835] ------------------ 642| 2.18k| : make_full_pos(child, p.shift() - B) 643| 835| .visit(v, idx, args...)) 644| 6.41k| : (is_leaf ------------------ | Branch (644:19): [True: 1.03k, False: 3.19k] ------------------ 645| 4.23k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 4.23k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.19k| .visit(v, idx, args...)); 648| 6.41k|} _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.24k| { 208| 5.24k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.24k| } _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.34k| { 1406| 2.34k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.34k| } _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.46k| { 1337| 3.46k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 3.46k, False: 0] ------------------ 1338| 3.46k| auto is_leaf = shift_ == BL; 1339| 3.46k| auto child = node_->inner()[offset_hint]; 1340| 3.46k| return is_leaf ------------------ | Branch (1340:16): [True: 2.41k, False: 1.05k] ------------------ 1341| 3.46k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 3.46k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 3.46k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 1161| 176k| 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.28k| { 113| 2.28k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.28k| } _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.76k| { 337| 4.76k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.76k| } _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.76k| { 306| 4.76k| return towards_oh_ch_regular( 307| 4.76k| *this, v, idx, offset_hint, count(), args...); 308| 4.76k| } _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.76k|{ 633| 4.76k| constexpr auto B = bits; 634| 4.76k| constexpr auto BL = bits_leaf; 635| 4.76k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.76k, False: 0] ------------------ 636| 4.76k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.76k, False: 0] ------------------ 637| 4.76k| auto is_leaf = p.shift() == BL; 638| 4.76k| auto child = p.node()->inner()[offset_hint]; 639| 4.76k| auto is_full = offset_hint + 1 != count_hint; 640| 4.76k| return is_full ------------------ | Branch (640:12): [True: 1.94k, False: 2.81k] ------------------ 641| 4.76k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.48k, False: 462] ------------------ 642| 1.94k| : make_full_pos(child, p.shift() - B) 643| 462| .visit(v, idx, args...)) 644| 4.76k| : (is_leaf ------------------ | Branch (644:19): [True: 1.24k, False: 1.57k] ------------------ 645| 2.81k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.81k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.57k| .visit(v, idx, args...)); 648| 4.76k|} _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| 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_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 927| 3.40k| { 928| 3.40k| return towards_oh_ch_regular( 929| 3.40k| *this, v, idx, offset_hint, count(), args...); 930| 3.40k| } _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.40k|{ 633| 3.40k| constexpr auto B = bits; 634| 3.40k| constexpr auto BL = bits_leaf; 635| 3.40k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.40k, False: 0] ------------------ 636| 3.40k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.40k, False: 0] ------------------ 637| 3.40k| auto is_leaf = p.shift() == BL; 638| 3.40k| auto child = p.node()->inner()[offset_hint]; 639| 3.40k| auto is_full = offset_hint + 1 != count_hint; 640| 3.40k| return is_full ------------------ | Branch (640:12): [True: 2.75k, False: 653] ------------------ 641| 3.40k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 851, False: 1.90k] ------------------ 642| 2.75k| : make_full_pos(child, p.shift() - B) 643| 1.90k| .visit(v, idx, args...)) 644| 3.40k| : (is_leaf ------------------ | Branch (644:19): [True: 653, False: 0] ------------------ 645| 653| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 653| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 3.40k|} _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.63k| { 208| 1.63k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.63k| } _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.57k| { 1406| 2.57k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.57k| } _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.46k| { 1337| 1.46k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.46k, False: 0] ------------------ 1338| 1.46k| auto is_leaf = shift_ == BL; 1339| 1.46k| auto child = node_->inner()[offset_hint]; 1340| 1.46k| return is_leaf ------------------ | Branch (1340:16): [True: 787, False: 678] ------------------ 1341| 1.46k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.46k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.46k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 112| 653| { 113| 653| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 653| } _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.1k|{ 1839| 21.1k| assert(node); ------------------ | Branch (1839:5): [True: 21.1k, False: 0] ------------------ 1840| 21.1k| auto relaxed = node->relaxed(); 1841| 21.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 14.4k, False: 6.61k] ------------------ 1842| 14.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 14.4k, False: 0] ------------------ 1843| 14.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 14.4k| .visit(v, std::forward(args)...); 1845| 14.4k| } else { 1846| 6.61k| return make_regular_sub_pos(node, shift, size) 1847| 6.61k| .visit(v, std::forward(args)...); 1848| 6.61k| } 1849| 21.1k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 14.4k| { 1814| 14.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 14.4k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8subindexEm: 1434| 9.16M| 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.62k| { 1706| 4.62k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 4.62k, False: 0] ------------------ 1707| 4.62k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 3.87k, False: 751] ------------------ 1708| 4.62k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 4.62k| } _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.62k| { 1718| 4.62k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 4.62k, False: 0] ------------------ 1719| 4.62k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.87k, False: 751] | Branch (1719:9): [True: 4.62k, False: 0] ------------------ 1720| 4.62k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 4.62k| auto child = node_->inner()[offset_hint]; 1722| 4.62k| auto is_leaf = shift_ == BL; 1723| 4.62k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 4.62k| auto next_idx = idx - left_size_hint; 1725| 4.62k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 4.62k] ------------------ 1726| 4.62k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 4.62k| : visit_maybe_relaxed_sub( 1729| 4.62k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 4.62k| } _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| 53.7k| { 1706| 53.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 53.7k, False: 0] ------------------ 1707| 53.7k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 14.5k, False: 39.2k] ------------------ 1708| 53.7k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 53.7k| } _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| 53.7k| { 1718| 53.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 53.7k, False: 0] ------------------ 1719| 53.7k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 14.5k, False: 39.2k] | Branch (1719:9): [True: 53.7k, False: 0] ------------------ 1720| 53.7k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 53.7k| auto child = node_->inner()[offset_hint]; 1722| 53.7k| auto is_leaf = shift_ == BL; 1723| 53.7k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 53.7k| auto next_idx = idx - left_size_hint; 1725| 53.7k| return is_leaf ------------------ | Branch (1725:16): [True: 7.85k, False: 45.8k] ------------------ 1726| 53.7k| ? make_leaf_sub_pos(child, next_size) 1727| 7.85k| .visit(v, next_idx, args...) 1728| 53.7k| : visit_maybe_relaxed_sub( 1729| 45.8k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 53.7k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 144| 7.85k| { 145| 7.85k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.85k| } _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| 45.8k|{ 1839| 45.8k| assert(node); ------------------ | Branch (1839:5): [True: 45.8k, False: 0] ------------------ 1840| 45.8k| auto relaxed = node->relaxed(); 1841| 45.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 43.8k, False: 2.01k] ------------------ 1842| 43.8k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 43.8k, False: 0] ------------------ 1843| 43.8k| return make_relaxed_pos(node, shift, relaxed) 1844| 43.8k| .visit(v, std::forward(args)...); 1845| 43.8k| } else { 1846| 2.01k| return make_regular_sub_pos(node, shift, size) 1847| 2.01k| .visit(v, std::forward(args)...); 1848| 2.01k| } 1849| 45.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| 43.8k| { 1814| 43.8k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 43.8k| } _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.01k| { 1037| 2.01k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.01k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11size_beforeEj: 791| 190k| { 792| 190k| return size_t{offset} << shift_; 793| 190k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8size_sbhEjm: 803| 28.6k| { 804| 28.6k| assert(size_before_hint == size_before(offset)); ------------------ | Branch (804:9): [True: 28.6k, False: 0] ------------------ 805| 28.6k| return offset == subindex(size_ - 1) ? size_ - size_before_hint ------------------ | Branch (805:16): [True: 15.3k, False: 13.3k] ------------------ 806| 28.6k| : size_t{1} << shift_; 807| 28.6k| } _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.37k| { 947| 7.37k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 7.37k| } _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.37k|{ 654| 7.37k| constexpr auto B = bits; 655| 7.37k| constexpr auto BL = bits_leaf; 656| 7.37k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 7.37k, False: 0] ------------------ 657| 7.37k| auto is_leaf = p.shift() == BL; 658| 7.37k| auto child = p.node()->inner()[offset_hint]; 659| 7.37k| auto lsize = offset_hint << p.shift(); 660| 7.37k| auto size = p.this_size(); 661| 7.37k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 7.37k| return is_full ------------------ | Branch (662:12): [True: 7.37k, False: 0] ------------------ 663| 7.37k| ? (is_leaf ------------------ | Branch (663:19): [True: 4.18k, False: 3.18k] ------------------ 664| 7.37k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 7.37k| : make_full_pos(child, p.shift() - B) 666| 3.18k| .visit(v, idx - lsize, args...)) 667| 7.37k| : (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.37k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9this_sizeEv: 794| 28.6k| 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.63k| { 208| 8.63k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 8.63k| } _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.19k| { 1406| 5.19k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 5.19k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8subindexEm: 1163| 18.5k| 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.1k| { 1171| 39.1k| return size_t{offset} << shift_; 1172| 39.1k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8size_sbhEjm: 1166| 18.5k| { 1167| 18.5k| return size_t{1} << shift_; 1168| 18.5k| } _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.45k| { 1349| 6.45k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 6.45k, False: 0] ------------------ 1350| 6.45k| auto is_leaf = shift_ == BL; 1351| 6.45k| auto child = node_->inner()[offset_hint]; 1352| 6.45k| auto lsize = size_t{offset_hint} << shift_; 1353| 6.45k| return is_leaf ------------------ | Branch (1353:16): [True: 4.44k, False: 2.00k] ------------------ 1354| 6.45k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 6.45k| : make_full_pos(child, shift_ - B) 1356| 2.00k| .visit(v, idx - lsize, args...); 1357| 6.45k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10copy_sizesEjjmPm: 1175| 16.0k| { 1176| 16.0k| auto e = sizes + n; 1177| 39.9k| for (; sizes != e; ++sizes) { ------------------ | Branch (1177:16): [True: 23.8k, False: 16.0k] ------------------ 1178| 23.8k| init = *sizes = init + (size_t{1} << shift_); 1179| | assert(init); ------------------ | Branch (1179:13): [True: 23.8k, False: 0] ------------------ 1180| 23.8k| } 1181| 16.0k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 1160| 710k| 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| 210k| { 811| 210k| if (n) { ------------------ | Branch (811:13): [True: 205k, False: 5.16k] ------------------ 812| 205k| auto last = offset + n - 1; 813| 205k| auto e = sizes + n - 1; 814| 410k| for (; sizes != e; ++sizes) { ------------------ | Branch (814:20): [True: 204k, False: 205k] ------------------ 815| 204k| init = *sizes = init + (size_t{1} << shift_); 816| 204k| assert(init); ------------------ | Branch (816:17): [True: 204k, False: 0] ------------------ 817| 204k| } 818| 205k| *sizes = init + size(last); 819| | assert(*sizes); ------------------ | Branch (819:13): [True: 205k, False: 0] ------------------ 820| 205k| } 821| 210k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEj: 797| 220k| { 798| 220k| return offset == subindex(size_ - 1) ? size_ - size_before(offset) ------------------ | Branch (798:16): [True: 113k, False: 107k] ------------------ 799| 220k| : size_t{1} << shift_; 800| 220k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10copy_sizesEjjmPm: 1462| 4.33M| { 1463| 4.33M| auto e = sizes + n; 1464| 4.33M| auto prev = size_before(offset); 1465| 4.33M| auto these = relaxed_->d.sizes + offset; 1466| 12.3M| for (; sizes != e; ++sizes, ++these) { ------------------ | Branch (1466:16): [True: 8.00M, False: 4.33M] ------------------ 1467| 8.00M| auto this_size = *these; 1468| 8.00M| init = *sizes = init + (this_size - prev); 1469| 8.00M| assert(init); ------------------ | Branch (1469:13): [True: 8.00M, False: 0] ------------------ 1470| 8.00M| prev = this_size; 1471| 8.00M| } 1472| 4.33M| } _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.61k| { 1037| 6.61k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.61k| } _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.64k| { 947| 3.64k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 3.64k| } _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.64k|{ 654| 3.64k| constexpr auto B = bits; 655| 3.64k| constexpr auto BL = bits_leaf; 656| 3.64k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 3.64k, False: 0] ------------------ 657| 3.64k| auto is_leaf = p.shift() == BL; 658| 3.64k| auto child = p.node()->inner()[offset_hint]; 659| 3.64k| auto lsize = offset_hint << p.shift(); 660| 3.64k| auto size = p.this_size(); 661| 3.64k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 3.64k| return is_full ------------------ | Branch (662:12): [True: 1.25k, False: 2.39k] ------------------ 663| 3.64k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 1.25k] ------------------ 664| 1.25k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 1.25k| : make_full_pos(child, p.shift() - B) 666| 1.25k| .visit(v, idx - lsize, args...)) 667| 3.64k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 2.39k] ------------------ 668| 2.39k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 2.39k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 2.39k| .visit(v, idx - lsize, args...)); 672| 3.64k|} _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| 303| { 1349| 303| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 303, False: 0] ------------------ 1350| 303| auto is_leaf = shift_ == BL; 1351| 303| auto child = node_->inner()[offset_hint]; 1352| 303| auto lsize = size_t{offset_hint} << shift_; 1353| 303| return is_leaf ------------------ | Branch (1353:16): [True: 0, False: 303] ------------------ 1354| 303| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 303| : make_full_pos(child, shift_ - B) 1356| 303| .visit(v, idx - lsize, args...); 1357| 303| } _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.39k| { 1037| 2.39k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.39k| } _ZN5immer6detail4rbts30make_singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaPT_j: 766| 7.85k|{ 767| 7.85k| assert(leaf); ------------------ | Branch (767:5): [True: 7.85k, False: 0] ------------------ 768| 7.85k| IMMER_ASSERT_TAGGED(leaf->kind() == NodeT::kind_t::leaf); ------------------ | | 68| 7.85k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (768:5): [True: 7.85k, False: 0] ------------------ 769| 7.85k| assert(count > 0); ------------------ | Branch (769:5): [True: 7.85k, False: 0] ------------------ 770| 7.85k| return singleton_regular_sub_pos{leaf, count}; 771| 7.85k|} _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.85k| { 760| 7.85k| return Visitor::visit_regular(*this, std::forward(args)...); 761| 7.85k| } _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.85k|{ 1839| 7.85k| assert(node); ------------------ | Branch (1839:5): [True: 7.85k, False: 0] ------------------ 1840| 7.85k| auto relaxed = node->relaxed(); 1841| 7.85k| if (relaxed) { ------------------ | Branch (1841:9): [True: 5.52k, False: 2.33k] ------------------ 1842| 5.52k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 5.52k, False: 0] ------------------ 1843| 5.52k| return make_relaxed_pos(node, shift, relaxed) 1844| 5.52k| .visit(v, std::forward(args)...); 1845| 5.52k| } else { 1846| 2.33k| return make_regular_sub_pos(node, shift, size) 1847| 2.33k| .visit(v, std::forward(args)...); 1848| 2.33k| } 1849| 7.85k|} _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.52k| { 1814| 5.52k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 5.52k| } _ZNK5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 735| 28.0k| shift_t shift() const { return BL; } _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_: 744| 7.85k| { 745| 7.85k| } _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.33M| { 145| 2.33M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.33M| } _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| 19.7M| { 1814| 19.7M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 19.7M| } _ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_: 707| 2.16M| { 708| 2.16M| } _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.85k| { 745| 7.85k| } _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.33M| { 145| 2.33M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.33M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 137| 2.33M| 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| 19.7M| { 1814| 19.7M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 19.7M| } _ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEEvT_DpOT0_: 707| 2.16M| { 708| 2.16M| } _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| 19.0k| { 1763| 19.0k| auto child = node_->inner()[0]; 1764| 19.0k| auto child_size = relaxed_->d.sizes[0]; 1765| 19.0k| auto is_leaf = shift_ == BL; 1766| 19.0k| assert(child_size); ------------------ | Branch (1766:9): [True: 19.0k, False: 0] ------------------ 1767| 19.0k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 19.0k] ------------------ 1768| 19.0k| : visit_maybe_relaxed_sub( 1769| 19.0k| child, shift_ - B, child_size, v, args...); 1770| 19.0k| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 76| 7.85k| 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.85M| 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| 19.0k|{ 1839| 19.0k| assert(node); ------------------ | Branch (1839:5): [True: 19.0k, False: 0] ------------------ 1840| 19.0k| auto relaxed = node->relaxed(); 1841| 19.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 18.6k, False: 408] ------------------ 1842| 18.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 18.6k, False: 0] ------------------ 1843| 18.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 18.6k| .visit(v, std::forward(args)...); 1845| 18.6k| } else { 1846| 408| return make_regular_sub_pos(node, shift, size) 1847| 408| .visit(v, std::forward(args)...); 1848| 408| } 1849| 19.0k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1813| 18.6k| { 1814| 18.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 18.6k| } _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| 408| { 1037| 408| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 408| } _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| 747| { 971| 747| auto is_leaf = shift_ == BL; 972| 747| auto child = node_->inner()[0]; 973| 747| auto is_full = size_ >= (size_t{1} << shift_); 974| 747| return is_full ------------------ | Branch (974:16): [True: 747, False: 0] ------------------ 975| 747| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 747] ------------------ 976| 747| ? make_full_leaf_pos(child).visit(v, args...) 977| 747| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 747| : (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| 747| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 201| 146k| shift_t shift() const { return 0; } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1405| 1.14k| { 1406| 1.14k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.14k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1361| 396| { 1362| 396| auto is_leaf = shift_ == BL; 1363| 396| auto child = node_->inner()[0]; 1364| 396| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 396] ------------------ 1365| 396| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 396| } _ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_: 711| 139k| { 712| 139k| } _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| 135k| { 1305| 135k| each_i(v, 1, branches, args...); 1306| 135k| } _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| 135k| { 1264| 135k| auto p = node_->inner() + i; 1265| 135k| auto e = node_->inner() + n; 1266| 135k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 71.5k, False: 64.4k] ------------------ 1267| 286k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 214k, False: 71.5k] ------------------ 1268| 214k| IMMER_PREFETCH(p + 1); 1269| 214k| make_full_leaf_pos(*p).visit(v, args...); 1270| 214k| } 1271| 71.5k| } else { 1272| 64.4k| auto ss = shift_ - B; 1273| 257k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 193k, False: 64.4k] ------------------ 1274| 193k| make_full_pos(*p, ss).visit(v, args...); 1275| 64.4k| } 1276| 135k| } _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.00M| { 208| 1.00M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.00M| } _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| 704k| { 1406| 704k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 704k| } _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| 139k| { 712| 139k| } _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| 135k| { 1305| 135k| each_i(v, 1, branches, args...); 1306| 135k| } _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| 135k| { 1264| 135k| auto p = node_->inner() + i; 1265| 135k| auto e = node_->inner() + n; 1266| 135k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 71.5k, False: 64.4k] ------------------ 1267| 286k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 214k, False: 71.5k] ------------------ 1268| 214k| IMMER_PREFETCH(p + 1); 1269| 214k| make_full_leaf_pos(*p).visit(v, args...); 1270| 214k| } 1271| 71.5k| } else { 1272| 64.4k| auto ss = shift_ - B; 1273| 257k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 193k, False: 64.4k] ------------------ 1274| 193k| make_full_pos(*p, ss).visit(v, args...); 1275| 64.4k| } 1276| 135k| } _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.00M| { 208| 1.00M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.00M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 200| 1.00M| 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| 704k| { 1406| 704k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 704k| } _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| 747| { 754| 747| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 747| } _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| 747| { 145| 747| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 747| } _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| 747| { 1371| 747| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 747, False: 0] ------------------ 1372| 747| auto child = node_->inner()[0]; 1373| 747| return make_full_leaf_pos(child).visit(v, args...); 1374| 747| } _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.74k| { 208| 2.74k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 2.74k| } _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| 146k| { 907| 146k| if (count() > 1) ------------------ | Branch (907:13): [True: 130k, False: 15.9k] ------------------ 908| 130k| each_right_sub_(v, 1, args...); 909| 146k| } _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| 130k| { 880| 130k| auto last = count() - 1; 881| 130k| auto lsize = size_ - (last << shift_); 882| 130k| auto n = node()->inner() + i; 883| 130k| auto e = node()->inner() + last; 884| 130k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 58.9k, False: 71.5k] ------------------ 885| 174k| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 115k, False: 58.9k] ------------------ 886| 115k| IMMER_PREFETCH(n + 1); 887| 115k| make_full_leaf_pos(*n).visit(v, args...); 888| 115k| } 889| 58.9k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 71.5k| } else { 891| 71.5k| auto ss = shift_ - B; 892| 184k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 112k, False: 71.5k] ------------------ 893| 112k| make_full_pos(*n, ss).visit(v, args...); 894| 71.5k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 71.5k| } 896| 130k| } _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| 648k| { 1037| 648k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 648k| } _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| 146k| { 907| 146k| if (count() > 1) ------------------ | Branch (907:13): [True: 130k, False: 15.9k] ------------------ 908| 130k| each_right_sub_(v, 1, args...); 909| 146k| } _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| 130k| { 880| 130k| auto last = count() - 1; 881| 130k| auto lsize = size_ - (last << shift_); 882| 130k| auto n = node()->inner() + i; 883| 130k| auto e = node()->inner() + last; 884| 130k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 58.9k, False: 71.5k] ------------------ 885| 174k| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 115k, False: 58.9k] ------------------ 886| 115k| IMMER_PREFETCH(n + 1); 887| 115k| make_full_leaf_pos(*n).visit(v, args...); 888| 115k| } 889| 58.9k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 71.5k| } else { 891| 71.5k| auto ss = shift_ - B; 892| 184k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 112k, False: 71.5k] ------------------ 893| 112k| make_full_pos(*n, ss).visit(v, args...); 894| 71.5k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 71.5k| } 896| 130k| } _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| 648k| { 1037| 648k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 648k| } _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 753| 1.99k| { 754| 1.99k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 1.99k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 144| 1.99k| { 145| 1.99k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.99k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 986| 1.99k| { 987| 1.99k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 1.99k, False: 0] ------------------ 988| 1.99k| auto child = node_->inner()[0]; 989| 1.99k| auto is_full = size_ >= branches; 990| 1.99k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 1.99k, False: 0] ------------------ 991| 1.99k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 1.99k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 144| 5.11k| { 145| 5.11k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.11k| } _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| 2.84M| { 1648| 2.84M| each_right(v, 1, std::forward(args)...); 1649| 2.84M| } _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| 2.84M| { 1654| 2.84M| assert(start > 0); ------------------ | Branch (1654:9): [True: 2.84M, False: 0] ------------------ 1655| 2.84M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 2.84M, False: 0] ------------------ 1656| 2.84M| auto s = relaxed_->d.sizes[start - 1]; 1657| 2.84M| auto p = node_->inner(); 1658| 2.84M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 353k, False: 2.49M] ------------------ 1659| 938k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 585k, False: 353k] ------------------ 1660| 585k| IMMER_PREFETCH(p + i + 1); 1661| 585k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 585k| .visit(v, args...); 1663| 585k| s = relaxed_->d.sizes[i]; 1664| 585k| assert(s); ------------------ | Branch (1664:17): [True: 585k, False: 0] ------------------ 1665| 585k| } 1666| 2.49M| } else { 1667| 2.49M| auto ss = shift_ - B; 1668| 8.91M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 6.41M, False: 2.49M] ------------------ 1669| 6.41M| visit_maybe_relaxed_sub( 1670| 6.41M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 6.41M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 6.41M, False: 0] ------------------ 1673| 6.41M| } 1674| 2.49M| } 1675| 2.84M| } _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| 12.8M|{ 1839| 12.8M| assert(node); ------------------ | Branch (1839:5): [True: 12.8M, False: 0] ------------------ 1840| 12.8M| auto relaxed = node->relaxed(); 1841| 12.8M| if (relaxed) { ------------------ | Branch (1841:9): [True: 12.2M, False: 577k] ------------------ 1842| 12.2M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 12.2M, False: 0] ------------------ 1843| 12.2M| return make_relaxed_pos(node, shift, relaxed) 1844| 12.2M| .visit(v, std::forward(args)...); 1845| 12.2M| } else { 1846| 577k| return make_regular_sub_pos(node, shift, size) 1847| 577k| .visit(v, std::forward(args)...); 1848| 577k| } 1849| 12.8M|} _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| 2.84M| { 1648| 2.84M| each_right(v, 1, std::forward(args)...); 1649| 2.84M| } _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| 2.84M| { 1654| 2.84M| assert(start > 0); ------------------ | Branch (1654:9): [True: 2.84M, False: 0] ------------------ 1655| 2.84M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 2.84M, False: 0] ------------------ 1656| 2.84M| auto s = relaxed_->d.sizes[start - 1]; 1657| 2.84M| auto p = node_->inner(); 1658| 2.84M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 353k, False: 2.49M] ------------------ 1659| 938k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 585k, False: 353k] ------------------ 1660| 585k| IMMER_PREFETCH(p + i + 1); 1661| 585k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 585k| .visit(v, args...); 1663| 585k| s = relaxed_->d.sizes[i]; 1664| 585k| assert(s); ------------------ | Branch (1664:17): [True: 585k, False: 0] ------------------ 1665| 585k| } 1666| 2.49M| } else { 1667| 2.49M| auto ss = shift_ - B; 1668| 8.91M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 6.41M, False: 2.49M] ------------------ 1669| 6.41M| visit_maybe_relaxed_sub( 1670| 6.41M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 6.41M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 6.41M, False: 0] ------------------ 1673| 6.41M| } 1674| 2.49M| } 1675| 2.84M| } _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| 12.8M|{ 1839| 12.8M| assert(node); ------------------ | Branch (1839:5): [True: 12.8M, False: 0] ------------------ 1840| 12.8M| auto relaxed = node->relaxed(); 1841| 12.8M| if (relaxed) { ------------------ | Branch (1841:9): [True: 12.2M, False: 577k] ------------------ 1842| 12.2M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 12.2M, False: 0] ------------------ 1843| 12.2M| return make_relaxed_pos(node, shift, relaxed) 1844| 12.2M| .visit(v, std::forward(args)...); 1845| 12.2M| } else { 1846| 577k| return make_regular_sub_pos(node, shift, size) 1847| 577k| .visit(v, std::forward(args)...); 1848| 577k| } 1849| 12.8M|} _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.11k| { 754| 5.11k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 5.11k| } _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.11k| { 145| 5.11k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.11k| } _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.11k| { 1775| 5.11k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 5.11k, False: 0] ------------------ 1776| 5.11k| auto child = node_->inner()[0]; 1777| 5.11k| auto child_size = relaxed_->d.sizes[0]; 1778| 5.11k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 5.11k| } _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.33k| { 1037| 2.33k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.33k| } _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| 491k|{ 1839| 491k| assert(node); ------------------ | Branch (1839:5): [True: 491k, False: 0] ------------------ 1840| 491k| auto relaxed = node->relaxed(); 1841| 491k| if (relaxed) { ------------------ | Branch (1841:9): [True: 477k, False: 13.9k] ------------------ 1842| 477k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 477k, False: 0] ------------------ 1843| 477k| return make_relaxed_pos(node, shift, relaxed) 1844| 477k| .visit(v, std::forward(args)...); 1845| 477k| } else { 1846| 13.9k| return make_regular_sub_pos(node, shift, size) 1847| 13.9k| .visit(v, std::forward(args)...); 1848| 13.9k| } 1849| 491k|} _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| 477k| { 1814| 477k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 477k| } _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| 477k|{ 1839| 477k| assert(node); ------------------ | Branch (1839:5): [True: 477k, False: 0] ------------------ 1840| 477k| auto relaxed = node->relaxed(); 1841| 477k| if (relaxed) { ------------------ | Branch (1841:9): [True: 452k, False: 25.0k] ------------------ 1842| 452k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 452k, False: 0] ------------------ 1843| 452k| return make_relaxed_pos(node, shift, relaxed) 1844| 452k| .visit(v, std::forward(args)...); 1845| 452k| } else { 1846| 25.0k| return make_regular_sub_pos(node, shift, size) 1847| 25.0k| .visit(v, std::forward(args)...); 1848| 25.0k| } 1849| 477k|} _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| 452k| { 1814| 452k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 452k| } _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.02M| { 1751| 2.02M| auto offset = relaxed_->d.count - 1; 1752| 2.02M| auto child = node_->inner()[offset]; 1753| 2.02M| auto child_size = size(offset); 1754| 2.02M| auto is_leaf = shift_ == BL; 1755| 2.02M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 2.02M] ------------------ 1756| 2.02M| : visit_maybe_relaxed_sub( 1757| 2.02M| child, shift_ - B, child_size, v, args...); 1758| 2.02M| } _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.02M|{ 1839| 2.02M| assert(node); ------------------ | Branch (1839:5): [True: 2.02M, False: 0] ------------------ 1840| 2.02M| auto relaxed = node->relaxed(); 1841| 2.02M| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.02M, False: 2.22k] ------------------ 1842| 2.02M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.02M, False: 0] ------------------ 1843| 2.02M| return make_relaxed_pos(node, shift, relaxed) 1844| 2.02M| .visit(v, std::forward(args)...); 1845| 2.02M| } else { 1846| 2.22k| return make_regular_sub_pos(node, shift, size) 1847| 2.22k| .visit(v, std::forward(args)...); 1848| 2.22k| } 1849| 2.02M|} _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.02M| { 1814| 2.02M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.02M| } _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.81k| { 1037| 5.81k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.81k| } _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.59k| { 959| 3.59k| auto offset = count() - 1; 960| 3.59k| auto child = node_->inner()[offset]; 961| 3.59k| auto is_leaf = shift_ == BL; 962| 3.59k| auto lsize = size_ - (size_t{offset} << shift_); 963| 3.59k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 3.59k] ------------------ 964| 3.59k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 3.59k| .visit(v, args...); 966| 3.59k| } _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| 838k| { 914| 838k| each_left(v, count() - 1, args...); 915| 838k| } _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| 838k| { 874| 838k| return each_left_regular(*this, v, last, args...); 875| 838k| } _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| 838k|{ 576| 838k| constexpr auto B = bits; 577| 838k| constexpr auto BL = bits_leaf; 578| 838k| assert(last < p.count()); ------------------ | Branch (578:5): [True: 838k, False: 0] ------------------ 579| 838k| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 386k, False: 452k] ------------------ 580| 386k| auto n = p.node()->inner(); 581| 386k| auto e = n + last; 582| 1.06M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 676k, False: 386k] ------------------ 583| 676k| IMMER_PREFETCH(n + 1); 584| 676k| make_full_leaf_pos(*n).visit(v, args...); 585| 676k| } 586| 452k| } else { 587| 452k| auto n = p.node()->inner(); 588| 452k| auto e = n + last; 589| 452k| auto ss = p.shift() - B; 590| 850k| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 398k, False: 452k] ------------------ 591| 398k| make_full_pos(*n, ss).visit(v, args...); 592| 452k| } 593| 838k|} _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| 838k| { 914| 838k| each_left(v, count() - 1, args...); 915| 838k| } _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| 838k| { 874| 838k| return each_left_regular(*this, v, last, args...); 875| 838k| } _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| 838k|{ 576| 838k| constexpr auto B = bits; 577| 838k| constexpr auto BL = bits_leaf; 578| 838k| assert(last < p.count()); ------------------ | Branch (578:5): [True: 838k, False: 0] ------------------ 579| 838k| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 386k, False: 452k] ------------------ 580| 386k| auto n = p.node()->inner(); 581| 386k| auto e = n + last; 582| 1.06M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 676k, False: 386k] ------------------ 583| 676k| IMMER_PREFETCH(n + 1); 584| 676k| make_full_leaf_pos(*n).visit(v, args...); 585| 676k| } 586| 452k| } else { 587| 452k| auto n = p.node()->inner(); 588| 452k| auto e = n + last; 589| 452k| auto ss = p.shift() - B; 590| 850k| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 398k, False: 452k] ------------------ 591| 398k| make_full_pos(*n, ss).visit(v, args...); 592| 452k| } 593| 838k|} _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| 706k| { 1763| 706k| auto child = node_->inner()[0]; 1764| 706k| auto child_size = relaxed_->d.sizes[0]; 1765| 706k| auto is_leaf = shift_ == BL; 1766| 706k| assert(child_size); ------------------ | Branch (1766:9): [True: 706k, False: 0] ------------------ 1767| 706k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 706k] ------------------ 1768| 706k| : visit_maybe_relaxed_sub( 1769| 706k| child, shift_ - B, child_size, v, args...); 1770| 706k| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 106| 491k| 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| 706k|{ 1839| 706k| assert(node); ------------------ | Branch (1839:5): [True: 706k, False: 0] ------------------ 1840| 706k| auto relaxed = node->relaxed(); 1841| 706k| if (relaxed) { ------------------ | Branch (1841:9): [True: 602k, False: 103k] ------------------ 1842| 602k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 602k, False: 0] ------------------ 1843| 602k| return make_relaxed_pos(node, shift, relaxed) 1844| 602k| .visit(v, std::forward(args)...); 1845| 602k| } else { 1846| 103k| return make_regular_sub_pos(node, shift, size) 1847| 103k| .visit(v, std::forward(args)...); 1848| 103k| } 1849| 706k|} _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| 602k| { 1814| 602k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 602k| } _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| 103k| { 1037| 103k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 103k| } _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| 781| { 959| 781| auto offset = count() - 1; 960| 781| auto child = node_->inner()[offset]; 961| 781| auto is_leaf = shift_ == BL; 962| 781| auto lsize = size_ - (size_t{offset} << shift_); 963| 781| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 781] ------------------ 964| 781| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 781| .visit(v, args...); 966| 781| } _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.17k| { 1037| 1.17k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.17k| } _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| 63.7k| { 971| 63.7k| auto is_leaf = shift_ == BL; 972| 63.7k| auto child = node_->inner()[0]; 973| 63.7k| auto is_full = size_ >= (size_t{1} << shift_); 974| 63.7k| return is_full ------------------ | Branch (974:16): [True: 63.7k, False: 0] ------------------ 975| 63.7k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 63.7k] ------------------ 976| 63.7k| ? make_full_leaf_pos(child).visit(v, args...) 977| 63.7k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 63.7k| : (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| 63.7k| } _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| 122k| { 1406| 122k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 122k| } _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| 58.5k| { 1362| 58.5k| auto is_leaf = shift_ == BL; 1363| 58.5k| auto child = node_->inner()[0]; 1364| 58.5k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 58.5k] ------------------ 1365| 58.5k| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 58.5k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 958| 122k| { 959| 122k| auto offset = count() - 1; 960| 122k| auto child = node_->inner()[offset]; 961| 122k| auto is_leaf = shift_ == BL; 962| 122k| auto lsize = size_ - (size_t{offset} << shift_); 963| 122k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 64.9k, False: 57.0k] ------------------ 964| 122k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 57.0k| .visit(v, args...); 966| 122k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 144| 70.7k| { 145| 70.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 70.7k| } _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| 70.7k| { 1371| 70.7k| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 70.7k, False: 0] ------------------ 1372| 70.7k| auto child = node_->inner()[0]; 1373| 70.7k| return make_full_leaf_pos(child).visit(v, args...); 1374| 70.7k| } _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| 143k| { 208| 143k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 143k| } _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| 58.3k| { 1037| 58.3k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 58.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_EERSD_EEEDcT_DpOT0_: 958| 111k| { 959| 111k| auto offset = count() - 1; 960| 111k| auto child = node_->inner()[offset]; 961| 111k| auto is_leaf = shift_ == BL; 962| 111k| auto lsize = size_ - (size_t{offset} << shift_); 963| 111k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 62.0k, False: 48.9k] ------------------ 964| 111k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 48.9k| .visit(v, args...); 966| 111k| } _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| 72.8k| { 145| 72.8k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 72.8k| } _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| 72.8k| { 987| 72.8k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 72.8k, False: 0] ------------------ 988| 72.8k| auto child = node_->inner()[0]; 989| 72.8k| auto is_full = size_ >= branches; 990| 72.8k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 72.8k, False: 0] ------------------ 991| 72.8k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 72.8k| } _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| 348k| { 145| 348k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 348k| } _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| 63.1k| { 1037| 63.1k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 63.1k| } _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| 601k| { 959| 601k| auto offset = count() - 1; 960| 601k| auto child = node_->inner()[offset]; 961| 601k| auto is_leaf = shift_ == BL; 962| 601k| auto lsize = size_ - (size_t{offset} << shift_); 963| 601k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 259k, False: 341k] ------------------ 964| 601k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 341k| .visit(v, args...); 966| 601k| } _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| 348k| { 145| 348k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 348k| } _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| 348k| { 1775| 348k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 348k, False: 0] ------------------ 1776| 348k| auto child = node_->inner()[0]; 1777| 348k| auto child_size = relaxed_->d.sizes[0]; 1778| 348k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 348k| } _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| 696k| { 1037| 696k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 696k| } _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.30M| { 1618| 4.30M| each_left(v, relaxed_->d.count - 1, args...); 1619| 4.30M| } _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.30M| { 1624| 4.30M| auto p = node_->inner(); 1625| 4.30M| auto s = size_t{}; 1626| 4.30M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 105k, False: 4.20M] ------------------ 1627| 304k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 199k, False: 105k] ------------------ 1628| 199k| IMMER_PREFETCH(p + i + 1); 1629| 199k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 199k| .visit(v, args...); 1631| 199k| s = relaxed_->d.sizes[i]; 1632| 199k| assert(s); ------------------ | Branch (1632:17): [True: 199k, False: 0] ------------------ 1633| 199k| } 1634| 4.20M| } else { 1635| 4.20M| auto ss = shift_ - B; 1636| 10.6M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 6.43M, False: 4.20M] ------------------ 1637| 6.43M| visit_maybe_relaxed_sub( 1638| 6.43M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 6.43M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 6.43M, False: 0] ------------------ 1641| 6.43M| } 1642| 4.20M| } 1643| 4.30M| } _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.30M| { 1618| 4.30M| each_left(v, relaxed_->d.count - 1, args...); 1619| 4.30M| } _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.30M| { 1624| 4.30M| auto p = node_->inner(); 1625| 4.30M| auto s = size_t{}; 1626| 4.30M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 105k, False: 4.20M] ------------------ 1627| 304k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 199k, False: 105k] ------------------ 1628| 199k| IMMER_PREFETCH(p + i + 1); 1629| 199k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 199k| .visit(v, args...); 1631| 199k| s = relaxed_->d.sizes[i]; 1632| 199k| assert(s); ------------------ | Branch (1632:17): [True: 199k, False: 0] ------------------ 1633| 199k| } 1634| 4.20M| } else { 1635| 4.20M| auto ss = shift_ - B; 1636| 10.6M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 6.43M, False: 4.20M] ------------------ 1637| 6.43M| visit_maybe_relaxed_sub( 1638| 6.43M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 6.43M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 6.43M, False: 0] ------------------ 1641| 6.43M| } 1642| 4.20M| } 1643| 4.30M| } _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.77M| { 1763| 1.77M| auto child = node_->inner()[0]; 1764| 1.77M| auto child_size = relaxed_->d.sizes[0]; 1765| 1.77M| auto is_leaf = shift_ == BL; 1766| 1.77M| assert(child_size); ------------------ | Branch (1766:9): [True: 1.77M, False: 0] ------------------ 1767| 1.77M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 1.77M] ------------------ 1768| 1.77M| : visit_maybe_relaxed_sub( 1769| 1.77M| child, shift_ - B, child_size, v, args...); 1770| 1.77M| } _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.77M|{ 1839| 1.77M| assert(node); ------------------ | Branch (1839:5): [True: 1.77M, False: 0] ------------------ 1840| 1.77M| auto relaxed = node->relaxed(); 1841| 1.77M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.76M, False: 7.46k] ------------------ 1842| 1.76M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.76M, False: 0] ------------------ 1843| 1.76M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.76M| .visit(v, std::forward(args)...); 1845| 1.76M| } else { 1846| 7.46k| return make_regular_sub_pos(node, shift, size) 1847| 7.46k| .visit(v, std::forward(args)...); 1848| 7.46k| } 1849| 1.77M|} _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.76M| { 1814| 1.76M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.76M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 7.46k| { 1037| 7.46k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 7.46k| } _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| 130k| { 1751| 130k| auto offset = relaxed_->d.count - 1; 1752| 130k| auto child = node_->inner()[offset]; 1753| 130k| auto child_size = size(offset); 1754| 130k| auto is_leaf = shift_ == BL; 1755| 130k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 130k] ------------------ 1756| 130k| : visit_maybe_relaxed_sub( 1757| 130k| child, shift_ - B, child_size, v, args...); 1758| 130k| } _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| 130k|{ 1839| 130k| assert(node); ------------------ | Branch (1839:5): [True: 130k, False: 0] ------------------ 1840| 130k| auto relaxed = node->relaxed(); 1841| 130k| if (relaxed) { ------------------ | Branch (1841:9): [True: 129k, False: 390] ------------------ 1842| 129k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 129k, False: 0] ------------------ 1843| 129k| return make_relaxed_pos(node, shift, relaxed) 1844| 129k| .visit(v, std::forward(args)...); 1845| 129k| } else { 1846| 390| return make_regular_sub_pos(node, shift, size) 1847| 390| .visit(v, std::forward(args)...); 1848| 390| } 1849| 130k|} _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| 129k| { 1814| 129k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 129k| } _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| 7.08k| { 971| 7.08k| auto is_leaf = shift_ == BL; 972| 7.08k| auto child = node_->inner()[0]; 973| 7.08k| auto is_full = size_ >= (size_t{1} << shift_); 974| 7.08k| return is_full ------------------ | Branch (974:16): [True: 7.08k, False: 0] ------------------ 975| 7.08k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 7.08k] ------------------ 976| 7.08k| ? make_full_leaf_pos(child).visit(v, args...) 977| 7.08k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 7.08k| : (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| 7.08k| } _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| 12.5k| { 1406| 12.5k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 12.5k| } _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| 5.45k| { 1362| 5.45k| auto is_leaf = shift_ == BL; 1363| 5.45k| auto child = node_->inner()[0]; 1364| 5.45k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 5.45k] ------------------ 1365| 5.45k| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 5.45k| } _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| 12.2k| { 1751| 12.2k| auto offset = relaxed_->d.count - 1; 1752| 12.2k| auto child = node_->inner()[offset]; 1753| 12.2k| auto child_size = size(offset); 1754| 12.2k| auto is_leaf = shift_ == BL; 1755| 12.2k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 5.83k, False: 6.42k] ------------------ 1756| 12.2k| : visit_maybe_relaxed_sub( 1757| 6.42k| child, shift_ - B, child_size, v, args...); 1758| 12.2k| } _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| 6.42k|{ 1839| 6.42k| assert(node); ------------------ | Branch (1839:5): [True: 6.42k, False: 0] ------------------ 1840| 6.42k| auto relaxed = node->relaxed(); 1841| 6.42k| if (relaxed) { ------------------ | Branch (1841:9): [True: 5.17k, False: 1.25k] ------------------ 1842| 5.17k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 5.17k, False: 0] ------------------ 1843| 5.17k| return make_relaxed_pos(node, shift, relaxed) 1844| 5.17k| .visit(v, std::forward(args)...); 1845| 5.17k| } else { 1846| 1.25k| return make_regular_sub_pos(node, shift, size) 1847| 1.25k| .visit(v, std::forward(args)...); 1848| 1.25k| } 1849| 6.42k|} _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| 5.17k| { 1814| 5.17k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 5.17k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1750| 31.4k| { 1751| 31.4k| auto offset = relaxed_->d.count - 1; 1752| 31.4k| auto child = node_->inner()[offset]; 1753| 31.4k| auto child_size = size(offset); 1754| 31.4k| auto is_leaf = shift_ == BL; 1755| 31.4k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 10.8k, False: 20.6k] ------------------ 1756| 31.4k| : visit_maybe_relaxed_sub( 1757| 20.6k| child, shift_ - B, child_size, v, args...); 1758| 31.4k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 20.6k|{ 1839| 20.6k| assert(node); ------------------ | Branch (1839:5): [True: 20.6k, False: 0] ------------------ 1840| 20.6k| auto relaxed = node->relaxed(); 1841| 20.6k| if (relaxed) { ------------------ | Branch (1841:9): [True: 6.40k, False: 14.2k] ------------------ 1842| 6.40k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 6.40k, False: 0] ------------------ 1843| 6.40k| return make_relaxed_pos(node, shift, relaxed) 1844| 6.40k| .visit(v, std::forward(args)...); 1845| 14.2k| } else { 1846| 14.2k| return make_regular_sub_pos(node, shift, size) 1847| 14.2k| .visit(v, std::forward(args)...); 1848| 14.2k| } 1849| 20.6k|} _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| 6.40k| { 1814| 6.40k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 6.40k| } _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.10M| { 1751| 2.10M| auto offset = relaxed_->d.count - 1; 1752| 2.10M| auto child = node_->inner()[offset]; 1753| 2.10M| auto child_size = size(offset); 1754| 2.10M| auto is_leaf = shift_ == BL; 1755| 2.10M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 88.5k, False: 2.01M] ------------------ 1756| 2.10M| : visit_maybe_relaxed_sub( 1757| 2.01M| child, shift_ - B, child_size, v, args...); 1758| 2.10M| } _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.01M|{ 1839| 2.01M| assert(node); ------------------ | Branch (1839:5): [True: 2.01M, False: 0] ------------------ 1840| 2.01M| auto relaxed = node->relaxed(); 1841| 2.01M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.66M, False: 354k] ------------------ 1842| 1.66M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.66M, False: 0] ------------------ 1843| 1.66M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.66M| .visit(v, std::forward(args)...); 1845| 1.66M| } else { 1846| 354k| return make_regular_sub_pos(node, shift, size) 1847| 354k| .visit(v, std::forward(args)...); 1848| 354k| } 1849| 2.01M|} _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.66M| { 1814| 1.66M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.66M| } _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| 25.0k| { 1037| 25.0k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 25.0k| } _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| 13.9k| { 1037| 13.9k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 13.9k| } _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| 13.9k|{ 1839| 13.9k| assert(node); ------------------ | Branch (1839:5): [True: 13.9k, False: 0] ------------------ 1840| 13.9k| auto relaxed = node->relaxed(); 1841| 13.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 5.98k, False: 8.00k] ------------------ 1842| 5.98k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 5.98k, False: 0] ------------------ 1843| 5.98k| return make_relaxed_pos(node, shift, relaxed) 1844| 5.98k| .visit(v, std::forward(args)...); 1845| 8.00k| } else { 1846| 8.00k| return make_regular_sub_pos(node, shift, size) 1847| 8.00k| .visit(v, std::forward(args)...); 1848| 8.00k| } 1849| 13.9k|} _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| 5.98k| { 1814| 5.98k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 5.98k| } _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| 8.00k| { 1037| 8.00k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.00k| } _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| 55.2k| { 1814| 55.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 55.2k| } _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| 50.1k| { 1738| 50.1k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 50.1k, False: 0] ------------------ 1739| 50.1k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 50.1k, False: 0] ------------------ 1740| 50.1k| auto child = node_->inner()[offset_hint]; 1741| 50.1k| auto is_leaf = shift_ == BL; 1742| 50.1k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 50.1k] ------------------ 1743| 50.1k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 50.1k| : visit_maybe_relaxed_sub( 1745| 50.1k| child, shift_ - B, child_size_hint, v, args...); 1746| 50.1k| } _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| 50.1k|{ 1839| 50.1k| assert(node); ------------------ | Branch (1839:5): [True: 50.1k, False: 0] ------------------ 1840| 50.1k| auto relaxed = node->relaxed(); 1841| 50.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 9.36k, False: 40.8k] ------------------ 1842| 9.36k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 9.36k, False: 0] ------------------ 1843| 9.36k| return make_relaxed_pos(node, shift, relaxed) 1844| 9.36k| .visit(v, std::forward(args)...); 1845| 40.8k| } else { 1846| 40.8k| return make_regular_sub_pos(node, shift, size) 1847| 40.8k| .visit(v, std::forward(args)...); 1848| 40.8k| } 1849| 50.1k|} _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| 40.8k| { 1037| 40.8k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 40.8k| } _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| 200k| { 953| 200k| return last_oh_regular(*this, v, offset_hint, args...); 954| 200k| } _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| 200k|{ 678| 200k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 200k, False: 0] ------------------ 679| 200k| constexpr auto B = bits; 680| 200k| constexpr auto BL = bits_leaf; 681| 200k| auto child = p.node()->inner()[offset_hint]; 682| 200k| auto is_leaf = p.shift() == BL; 683| 200k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 200k] ------------------ 684| 200k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 200k| .visit(v, args...); 686| 200k|} _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| 947k| { 337| 947k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 947k| } _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| 746k| { 331| 746k| return last_oh_regular(*this, v, offset_hint, args...); 332| 746k| } _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| 746k|{ 678| 746k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 746k, False: 0] ------------------ 679| 746k| constexpr auto B = bits; 680| 746k| constexpr auto BL = bits_leaf; 681| 746k| auto child = p.node()->inner()[offset_hint]; 682| 746k| auto is_leaf = p.shift() == BL; 683| 746k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 746k] ------------------ 684| 746k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 746k| .visit(v, args...); 686| 746k|} _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.44k| { 331| 1.44k| return last_oh_regular(*this, v, offset_hint, args...); 332| 1.44k| } _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.44k|{ 678| 1.44k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.44k, False: 0] ------------------ 679| 1.44k| constexpr auto B = bits; 680| 1.44k| constexpr auto BL = bits_leaf; 681| 1.44k| auto child = p.node()->inner()[offset_hint]; 682| 1.44k| auto is_leaf = p.shift() == BL; 683| 1.44k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.44k] ------------------ 684| 1.44k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.44k| .visit(v, args...); 686| 1.44k|} _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.73k| { 337| 2.73k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.73k| } _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.28k| { 953| 1.28k| return last_oh_regular(*this, v, offset_hint, args...); 954| 1.28k| } _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.28k|{ 678| 1.28k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.28k, False: 0] ------------------ 679| 1.28k| constexpr auto B = bits; 680| 1.28k| constexpr auto BL = bits_leaf; 681| 1.28k| auto child = p.node()->inner()[offset_hint]; 682| 1.28k| auto is_leaf = p.shift() == BL; 683| 1.28k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.28k] ------------------ 684| 1.28k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.28k| .visit(v, args...); 686| 1.28k|} _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.89k| { 1738| 7.89k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 7.89k, False: 0] ------------------ 1739| 7.89k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 7.89k, False: 0] ------------------ 1740| 7.89k| auto child = node_->inner()[offset_hint]; 1741| 7.89k| auto is_leaf = shift_ == BL; 1742| 7.89k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 7.89k] ------------------ 1743| 7.89k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 7.89k| : visit_maybe_relaxed_sub( 1745| 7.89k| child, shift_ - B, child_size_hint, v, args...); 1746| 7.89k| } _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.89k|{ 1839| 7.89k| assert(node); ------------------ | Branch (1839:5): [True: 7.89k, False: 0] ------------------ 1840| 7.89k| auto relaxed = node->relaxed(); 1841| 7.89k| if (relaxed) { ------------------ | Branch (1841:9): [True: 6.82k, False: 1.07k] ------------------ 1842| 6.82k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 6.82k, False: 0] ------------------ 1843| 6.82k| return make_relaxed_pos(node, shift, relaxed) 1844| 6.82k| .visit(v, std::forward(args)...); 1845| 6.82k| } else { 1846| 1.07k| return make_regular_sub_pos(node, shift, size) 1847| 1.07k| .visit(v, std::forward(args)...); 1848| 1.07k| } 1849| 7.89k|} _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.82k| { 1814| 6.82k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 6.82k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_: 1036| 1.07k| { 1037| 1.07k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.07k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_DpOT0_: 1036| 165k| { 1037| 165k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 165k| } _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| 14.8k|{ 1839| 14.8k| assert(node); ------------------ | Branch (1839:5): [True: 14.8k, False: 0] ------------------ 1840| 14.8k| auto relaxed = node->relaxed(); 1841| 14.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 11.2k, False: 3.66k] ------------------ 1842| 11.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 11.2k, False: 0] ------------------ 1843| 11.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 11.2k| .visit(v, std::forward(args)...); 1845| 11.2k| } else { 1846| 3.66k| return make_regular_sub_pos(node, shift, size) 1847| 3.66k| .visit(v, std::forward(args)...); 1848| 3.66k| } 1849| 14.8k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_DpOT0_: 1813| 11.2k| { 1814| 11.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 11.2k| } _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| 46.5k| { 1687| 46.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 46.5k, False: 0] ------------------ 1688| 46.5k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 9.66k, False: 36.9k] ------------------ 1689| 46.5k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 46.5k| } _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| 46.5k| { 1699| 46.5k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 46.5k| } _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| 46.5k| { 1718| 46.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 46.5k, False: 0] ------------------ 1719| 46.5k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 9.66k, False: 36.9k] | Branch (1719:9): [True: 46.5k, False: 0] ------------------ 1720| 46.5k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 46.5k| auto child = node_->inner()[offset_hint]; 1722| 46.5k| auto is_leaf = shift_ == BL; 1723| 46.5k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 46.5k| auto next_idx = idx - left_size_hint; 1725| 46.5k| return is_leaf ------------------ | Branch (1725:16): [True: 8.05k, False: 38.5k] ------------------ 1726| 46.5k| ? make_leaf_sub_pos(child, next_size) 1727| 8.05k| .visit(v, next_idx, args...) 1728| 46.5k| : visit_maybe_relaxed_sub( 1729| 38.5k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 46.5k| } _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| 8.05k| { 145| 8.05k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 8.05k| } _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| 38.5k|{ 1839| 38.5k| assert(node); ------------------ | Branch (1839:5): [True: 38.5k, False: 0] ------------------ 1840| 38.5k| auto relaxed = node->relaxed(); 1841| 38.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 35.3k, False: 3.14k] ------------------ 1842| 35.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 35.3k, False: 0] ------------------ 1843| 35.3k| return make_relaxed_pos(node, shift, relaxed) 1844| 35.3k| .visit(v, std::forward(args)...); 1845| 35.3k| } else { 1846| 3.14k| return make_regular_sub_pos(node, shift, size) 1847| 3.14k| .visit(v, std::forward(args)...); 1848| 3.14k| } 1849| 38.5k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1813| 35.3k| { 1814| 35.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 35.3k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1036| 3.14k| { 1037| 3.14k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.14k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 938| 6.81k| { 939| 6.81k| return towards_oh_ch_regular( 940| 6.81k| *this, v, idx, offset_hint, count(), args...); 941| 6.81k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_15get_mut_visitorISD_EEJRNSB_5applyIS8_E4type4editERPPSD_EEEDcOT_T0_mjjDpOT1_: 632| 6.81k|{ 633| 6.81k| constexpr auto B = bits; 634| 6.81k| constexpr auto BL = bits_leaf; 635| 6.81k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.81k, False: 0] ------------------ 636| 6.81k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.81k, False: 0] ------------------ 637| 6.81k| auto is_leaf = p.shift() == BL; 638| 6.81k| auto child = p.node()->inner()[offset_hint]; 639| 6.81k| auto is_full = offset_hint + 1 != count_hint; 640| 6.81k| return is_full ------------------ | Branch (640:12): [True: 4.43k, False: 2.37k] ------------------ 641| 6.81k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 715, False: 3.71k] ------------------ 642| 4.43k| : make_full_pos(child, p.shift() - B) 643| 3.71k| .visit(v, idx, args...)) 644| 6.81k| : (is_leaf ------------------ | Branch (644:19): [True: 780, False: 1.59k] ------------------ 645| 2.37k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.37k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.59k| .visit(v, idx, args...)); 648| 6.81k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 207| 5.31k| { 208| 5.31k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.31k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1405| 4.98k| { 1406| 4.98k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 4.98k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 1329| 4.98k| { 1330| 4.98k| return towards_oh(v, idx, offset_hint, args...); 1331| 4.98k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_mjDpOT0_: 1336| 4.98k| { 1337| 4.98k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 4.98k, False: 0] ------------------ 1338| 4.98k| auto is_leaf = shift_ == BL; 1339| 4.98k| auto child = node_->inner()[offset_hint]; 1340| 4.98k| return is_leaf ------------------ | Branch (1340:16): [True: 4.00k, False: 978] ------------------ 1341| 4.98k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 4.98k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 4.98k| } _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.50k| { 113| 1.50k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.50k| } _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.30k| { 337| 2.30k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.30k| } _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.30k| { 317| 2.30k| return towards_oh_ch_regular( 318| 2.30k| *this, v, idx, offset_hint, count(), args...); 319| 2.30k| } _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.30k|{ 633| 2.30k| constexpr auto B = bits; 634| 2.30k| constexpr auto BL = bits_leaf; 635| 2.30k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.30k, False: 0] ------------------ 636| 2.30k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.30k, False: 0] ------------------ 637| 2.30k| auto is_leaf = p.shift() == BL; 638| 2.30k| auto child = p.node()->inner()[offset_hint]; 639| 2.30k| auto is_full = offset_hint + 1 != count_hint; 640| 2.30k| return is_full ------------------ | Branch (640:12): [True: 878, False: 1.42k] ------------------ 641| 2.30k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 587, False: 291] ------------------ 642| 878| : make_full_pos(child, p.shift() - B) 643| 291| .visit(v, idx, args...)) 644| 2.30k| : (is_leaf ------------------ | Branch (644:19): [True: 720, False: 707] ------------------ 645| 1.42k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.42k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 707| .visit(v, idx, args...)); 648| 2.30k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_DpOT0_: 1036| 3.66k| { 1037| 3.66k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.66k| } _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| 68.5k|{ 1839| 68.5k| assert(node); ------------------ | Branch (1839:5): [True: 68.5k, False: 0] ------------------ 1840| 68.5k| auto relaxed = node->relaxed(); 1841| 68.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 56.4k, False: 12.0k] ------------------ 1842| 56.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 56.4k, False: 0] ------------------ 1843| 56.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 56.4k| .visit(v, std::forward(args)...); 1845| 56.4k| } else { 1846| 12.0k| return make_regular_sub_pos(node, shift, size) 1847| 12.0k| .visit(v, std::forward(args)...); 1848| 12.0k| } 1849| 68.5k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 56.4k| { 1814| 56.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 56.4k| } _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| 35.5k| { 1687| 35.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 35.5k, False: 0] ------------------ 1688| 35.5k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 35.5k] ------------------ 1689| 35.5k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 35.5k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 35.5k| { 1699| 35.5k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 35.5k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 35.5k| { 1718| 35.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 35.5k, False: 0] ------------------ 1719| 35.5k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 35.5k] | Branch (1719:9): [True: 35.5k, False: 0] ------------------ 1720| 35.5k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 35.5k| auto child = node_->inner()[offset_hint]; 1722| 35.5k| auto is_leaf = shift_ == BL; 1723| 35.5k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 35.5k| auto next_idx = idx - left_size_hint; 1725| 35.5k| return is_leaf ------------------ | Branch (1725:16): [True: 1.15k, False: 34.4k] ------------------ 1726| 35.5k| ? make_leaf_sub_pos(child, next_size) 1727| 1.15k| .visit(v, next_idx, args...) 1728| 35.5k| : visit_maybe_relaxed_sub( 1729| 34.4k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 35.5k| } _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.15k| { 145| 1.15k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.15k| } _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| 17.9k| { 1687| 17.9k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 17.9k, False: 0] ------------------ 1688| 17.9k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 17.9k] ------------------ 1689| 17.9k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 17.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_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 17.9k| { 1699| 17.9k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 17.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_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 17.9k| { 1718| 17.9k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 17.9k, False: 0] ------------------ 1719| 17.9k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 17.9k] | Branch (1719:9): [True: 17.9k, False: 0] ------------------ 1720| 17.9k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 17.9k| auto child = node_->inner()[offset_hint]; 1722| 17.9k| auto is_leaf = shift_ == BL; 1723| 17.9k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 17.9k| auto next_idx = idx - left_size_hint; 1725| 17.9k| return is_leaf ------------------ | Branch (1725:16): [True: 533, False: 17.4k] ------------------ 1726| 17.9k| ? make_leaf_sub_pos(child, next_size) 1727| 533| .visit(v, next_idx, args...) 1728| 17.9k| : visit_maybe_relaxed_sub( 1729| 17.4k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 17.9k| } _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| 533| { 145| 533| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 533| } _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| 17.4k|{ 1839| 17.4k| assert(node); ------------------ | Branch (1839:5): [True: 17.4k, False: 0] ------------------ 1840| 17.4k| auto relaxed = node->relaxed(); 1841| 17.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 15.9k, False: 1.42k] ------------------ 1842| 15.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 15.9k, False: 0] ------------------ 1843| 15.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 15.9k| .visit(v, std::forward(args)...); 1845| 15.9k| } else { 1846| 1.42k| return make_regular_sub_pos(node, shift, size) 1847| 1.42k| .visit(v, std::forward(args)...); 1848| 1.42k| } 1849| 17.4k|} _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| 15.9k| { 1814| 15.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 15.9k| } _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.42k| { 1037| 1.42k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.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_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 927| 2.28k| { 928| 2.28k| return towards_oh_ch_regular( 929| 2.28k| *this, v, idx, offset_hint, count(), args...); 930| 2.28k| } _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.28k|{ 633| 2.28k| constexpr auto B = bits; 634| 2.28k| constexpr auto BL = bits_leaf; 635| 2.28k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.28k, False: 0] ------------------ 636| 2.28k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.28k, False: 0] ------------------ 637| 2.28k| auto is_leaf = p.shift() == BL; 638| 2.28k| auto child = p.node()->inner()[offset_hint]; 639| 2.28k| auto is_full = offset_hint + 1 != count_hint; 640| 2.28k| return is_full ------------------ | Branch (640:12): [True: 1.88k, False: 395] ------------------ 641| 2.28k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 681, False: 1.20k] ------------------ 642| 1.88k| : make_full_pos(child, p.shift() - B) 643| 1.20k| .visit(v, idx, args...)) 644| 2.28k| : (is_leaf ------------------ | Branch (644:19): [True: 395, False: 0] ------------------ 645| 395| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 395| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 2.28k|} _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.40k| { 208| 1.40k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.40k| } _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.75k| { 1406| 1.75k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.75k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 1.27k| { 1337| 1.27k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.27k, False: 0] ------------------ 1338| 1.27k| auto is_leaf = shift_ == BL; 1339| 1.27k| auto child = node_->inner()[offset_hint]; 1340| 1.27k| return is_leaf ------------------ | Branch (1340:16): [True: 727, False: 548] ------------------ 1341| 1.27k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.27k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.27k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 3.20k| { 1337| 3.20k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 3.20k, False: 0] ------------------ 1338| 3.20k| auto is_leaf = shift_ == BL; 1339| 3.20k| auto child = node_->inner()[offset_hint]; 1340| 3.20k| return is_leaf ------------------ | Branch (1340:16): [True: 2.19k, False: 1.01k] ------------------ 1341| 3.20k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 3.20k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 3.20k| } _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.16k| { 208| 5.16k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.16k| } _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.38k| { 1406| 4.38k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 4.38k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1405| 3.75k| { 1406| 3.75k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.75k| } _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.65k| { 1337| 7.65k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 7.65k, False: 0] ------------------ 1338| 7.65k| auto is_leaf = shift_ == BL; 1339| 7.65k| auto child = node_->inner()[offset_hint]; 1340| 7.65k| return is_leaf ------------------ | Branch (1340:16): [True: 6.19k, False: 1.46k] ------------------ 1341| 7.65k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 7.65k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 7.65k| } _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| 8.68k| { 208| 8.68k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 8.68k| } _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.24k| { 1406| 3.24k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.24k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1310| 4.18k| { 1311| 4.18k| each_i(v, start, branches, args...); 1312| 4.18k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE6each_iINS1_11dec_visitorEJEEEvT_jjDpOT0_: 1263| 6.32k| { 1264| 6.32k| auto p = node_->inner() + i; 1265| 6.32k| auto e = node_->inner() + n; 1266| 6.32k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 3.79k, False: 2.53k] ------------------ 1267| 11.6k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 7.87k, False: 3.79k] ------------------ 1268| 7.87k| IMMER_PREFETCH(p + 1); 1269| 7.87k| make_full_leaf_pos(*p).visit(v, args...); 1270| 7.87k| } 1271| 3.79k| } else { 1272| 2.53k| auto ss = shift_ - B; 1273| 7.67k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 5.14k, False: 2.53k] ------------------ 1274| 5.14k| make_full_pos(*p, ss).visit(v, args...); 1275| 2.53k| } 1276| 6.32k| } _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| 395| { 113| 395| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 395| } _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.64k| { 306| 5.64k| return towards_oh_ch_regular( 307| 5.64k| *this, v, idx, offset_hint, count(), args...); 308| 5.64k| } _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.64k|{ 633| 5.64k| constexpr auto B = bits; 634| 5.64k| constexpr auto BL = bits_leaf; 635| 5.64k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.64k, False: 0] ------------------ 636| 5.64k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.64k, False: 0] ------------------ 637| 5.64k| auto is_leaf = p.shift() == BL; 638| 5.64k| auto child = p.node()->inner()[offset_hint]; 639| 5.64k| auto is_full = offset_hint + 1 != count_hint; 640| 5.64k| return is_full ------------------ | Branch (640:12): [True: 2.84k, False: 2.79k] ------------------ 641| 5.64k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.70k, False: 1.14k] ------------------ 642| 2.84k| : make_full_pos(child, p.shift() - B) 643| 1.14k| .visit(v, idx, args...)) 644| 5.64k| : (is_leaf ------------------ | Branch (644:19): [True: 1.19k, False: 1.60k] ------------------ 645| 2.79k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.79k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.60k| .visit(v, idx, args...)); 648| 5.64k|} _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.19k| { 113| 2.19k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.19k| } _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.25k| { 337| 6.25k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 6.25k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 336| 4.08k| { 337| 4.08k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.08k| } _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.68k| { 306| 3.68k| return towards_oh_ch_regular( 307| 3.68k| *this, v, idx, offset_hint, count(), args...); 308| 3.68k| } _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.68k|{ 633| 3.68k| constexpr auto B = bits; 634| 3.68k| constexpr auto BL = bits_leaf; 635| 3.68k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.68k, False: 0] ------------------ 636| 3.68k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.68k, False: 0] ------------------ 637| 3.68k| auto is_leaf = p.shift() == BL; 638| 3.68k| auto child = p.node()->inner()[offset_hint]; 639| 3.68k| auto is_full = offset_hint + 1 != count_hint; 640| 3.68k| return is_full ------------------ | Branch (640:12): [True: 1.06k, False: 2.62k] ------------------ 641| 3.68k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 716, False: 344] ------------------ 642| 1.06k| : make_full_pos(child, p.shift() - B) 643| 344| .visit(v, idx, args...)) 644| 3.68k| : (is_leaf ------------------ | Branch (644:19): [True: 1.67k, False: 952] ------------------ 645| 2.62k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.62k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 952| .visit(v, idx, args...)); 648| 3.68k|} _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.59k| { 113| 2.59k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.59k| } _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.07k| { 337| 3.07k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.07k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 285| 5.64k| { 286| 5.64k| return each_right_regular(*this, v, start, args...); 287| 5.64k| } _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.64k|{ 598| 5.64k| constexpr auto B = bits; 599| 5.64k| constexpr auto BL = bits_leaf; 600| | 601| 5.64k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 2.89k, False: 2.74k] ------------------ 602| 2.89k| auto n = p.node()->inner() + start; 603| 2.89k| auto last = p.count() - 1; 604| 2.89k| auto e = p.node()->inner() + last; 605| 2.89k| if (n <= e) { ------------------ | Branch (605:13): [True: 1.70k, False: 1.19k] ------------------ 606| 2.98k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 1.27k, False: 1.70k] ------------------ 607| 1.27k| IMMER_PREFETCH(n + 1); 608| 1.27k| make_full_leaf_pos(*n).visit(v, args...); 609| 1.27k| } 610| 1.70k| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 1.70k| } 612| 2.89k| } else { 613| 2.74k| auto n = p.node()->inner() + start; 614| 2.74k| auto last = p.count() - 1; 615| 2.74k| auto e = p.node()->inner() + last; 616| 2.74k| auto ss = p.shift() - B; 617| 2.74k| if (n <= e) { ------------------ | Branch (617:13): [True: 1.14k, False: 1.60k] ------------------ 618| 2.15k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 1.01k, False: 1.14k] ------------------ 619| 1.01k| make_full_pos(*n, ss).visit(v, args...); 620| 1.14k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 1.14k| } 622| 2.74k| } 623| 5.64k|} _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.15k| { 928| 9.15k| return towards_oh_ch_regular( 929| 9.15k| *this, v, idx, offset_hint, count(), args...); 930| 9.15k| } _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.15k|{ 633| 9.15k| constexpr auto B = bits; 634| 9.15k| constexpr auto BL = bits_leaf; 635| 9.15k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 9.15k, False: 0] ------------------ 636| 9.15k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 9.15k, False: 0] ------------------ 637| 9.15k| auto is_leaf = p.shift() == BL; 638| 9.15k| auto child = p.node()->inner()[offset_hint]; 639| 9.15k| auto is_full = offset_hint + 1 != count_hint; 640| 9.15k| return is_full ------------------ | Branch (640:12): [True: 3.50k, False: 5.65k] ------------------ 641| 9.15k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.27k, False: 2.23k] ------------------ 642| 3.50k| : make_full_pos(child, p.shift() - B) 643| 2.23k| .visit(v, idx, args...)) 644| 9.15k| : (is_leaf ------------------ | Branch (644:19): [True: 1.00k, False: 4.65k] ------------------ 645| 5.65k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 5.65k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 4.65k| .visit(v, idx, args...)); 648| 9.15k|} _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.25k| { 928| 6.25k| return towards_oh_ch_regular( 929| 6.25k| *this, v, idx, offset_hint, count(), args...); 930| 6.25k| } _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.25k|{ 633| 6.25k| constexpr auto B = bits; 634| 6.25k| constexpr auto BL = bits_leaf; 635| 6.25k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.25k, False: 0] ------------------ 636| 6.25k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.25k, False: 0] ------------------ 637| 6.25k| auto is_leaf = p.shift() == BL; 638| 6.25k| auto child = p.node()->inner()[offset_hint]; 639| 6.25k| auto is_full = offset_hint + 1 != count_hint; 640| 6.25k| return is_full ------------------ | Branch (640:12): [True: 3.21k, False: 3.03k] ------------------ 641| 6.25k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.78k, False: 1.43k] ------------------ 642| 3.21k| : make_full_pos(child, p.shift() - B) 643| 1.43k| .visit(v, idx, args...)) 644| 6.25k| : (is_leaf ------------------ | Branch (644:19): [True: 921, False: 2.11k] ------------------ 645| 3.03k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.03k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.11k| .visit(v, idx, args...)); 648| 6.25k|} _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.1k| { 868| 14.1k| return each_right_regular(*this, v, start, args...); 869| 14.1k| } _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.1k|{ 598| 14.1k| constexpr auto B = bits; 599| 14.1k| constexpr auto BL = bits_leaf; 600| | 601| 14.1k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 4.01k, False: 10.1k] ------------------ 602| 4.01k| auto n = p.node()->inner() + start; 603| 4.01k| auto last = p.count() - 1; 604| 4.01k| auto e = p.node()->inner() + last; 605| 4.01k| if (n <= e) { ------------------ | Branch (605:13): [True: 2.34k, False: 1.67k] ------------------ 606| 3.60k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 1.26k, False: 2.34k] ------------------ 607| 1.26k| IMMER_PREFETCH(n + 1); 608| 1.26k| make_full_leaf_pos(*n).visit(v, args...); 609| 1.26k| } 610| 2.34k| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 2.34k| } 612| 10.1k| } else { 613| 10.1k| auto n = p.node()->inner() + start; 614| 10.1k| auto last = p.count() - 1; 615| 10.1k| auto e = p.node()->inner() + last; 616| 10.1k| auto ss = p.shift() - B; 617| 10.1k| if (n <= e) { ------------------ | Branch (617:13): [True: 5.45k, False: 4.65k] ------------------ 618| 8.92k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 3.47k, False: 5.45k] ------------------ 619| 3.47k| make_full_pos(*n, ss).visit(v, args...); 620| 5.45k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 5.45k| } 622| 10.1k| } 623| 14.1k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1813| 46.8k| { 1814| 46.8k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 46.8k| } _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| 20.7k| { 1687| 20.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 20.7k, False: 0] ------------------ 1688| 20.7k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 16.5k, False: 4.19k] ------------------ 1689| 20.7k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 20.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_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 20.7k| { 1699| 20.7k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 20.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_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 20.7k| { 1718| 20.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 20.7k, False: 0] ------------------ 1719| 20.7k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 16.5k, False: 4.19k] | Branch (1719:9): [True: 20.7k, False: 0] ------------------ 1720| 20.7k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 20.7k| auto child = node_->inner()[offset_hint]; 1722| 20.7k| auto is_leaf = shift_ == BL; 1723| 20.7k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 20.7k| auto next_idx = idx - left_size_hint; 1725| 20.7k| return is_leaf ------------------ | Branch (1725:16): [True: 3.94k, False: 16.8k] ------------------ 1726| 20.7k| ? make_leaf_sub_pos(child, next_size) 1727| 3.94k| .visit(v, next_idx, args...) 1728| 20.7k| : visit_maybe_relaxed_sub( 1729| 16.8k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 20.7k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 3.94k| { 145| 3.94k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 3.94k| } _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| 16.8k|{ 1839| 16.8k| assert(node); ------------------ | Branch (1839:5): [True: 16.8k, False: 0] ------------------ 1840| 16.8k| auto relaxed = node->relaxed(); 1841| 16.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 10.1k, False: 6.68k] ------------------ 1842| 10.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 10.1k, False: 0] ------------------ 1843| 10.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 10.1k| .visit(v, std::forward(args)...); 1845| 10.1k| } else { 1846| 6.68k| return make_regular_sub_pos(node, shift, size) 1847| 6.68k| .visit(v, std::forward(args)...); 1848| 6.68k| } 1849| 16.8k|} _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| 10.1k| { 1814| 10.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 10.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| 6.68k| { 1037| 6.68k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.68k| } _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.4k| { 1037| 10.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 10.4k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 15.9k| { 1687| 15.9k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 15.9k, False: 0] ------------------ 1688| 15.9k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 9.93k, False: 6.02k] ------------------ 1689| 15.9k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 15.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_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 15.9k| { 1699| 15.9k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 15.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_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 15.9k| { 1718| 15.9k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 15.9k, False: 0] ------------------ 1719| 15.9k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 9.93k, False: 6.02k] | Branch (1719:9): [True: 15.9k, False: 0] ------------------ 1720| 15.9k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 15.9k| auto child = node_->inner()[offset_hint]; 1722| 15.9k| auto is_leaf = shift_ == BL; 1723| 15.9k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 15.9k| auto next_idx = idx - left_size_hint; 1725| 15.9k| return is_leaf ------------------ | Branch (1725:16): [True: 5.77k, False: 10.1k] ------------------ 1726| 15.9k| ? make_leaf_sub_pos(child, next_size) 1727| 5.77k| .visit(v, next_idx, args...) 1728| 15.9k| : visit_maybe_relaxed_sub( 1729| 10.1k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 15.9k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 5.77k| { 145| 5.77k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.77k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 10.1k|{ 1839| 10.1k| assert(node); ------------------ | Branch (1839:5): [True: 10.1k, False: 0] ------------------ 1840| 10.1k| auto relaxed = node->relaxed(); 1841| 10.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.65k, False: 2.53k] ------------------ 1842| 7.65k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.65k, False: 0] ------------------ 1843| 7.65k| return make_relaxed_pos(node, shift, relaxed) 1844| 7.65k| .visit(v, std::forward(args)...); 1845| 7.65k| } else { 1846| 2.53k| return make_regular_sub_pos(node, shift, size) 1847| 2.53k| .visit(v, std::forward(args)...); 1848| 2.53k| } 1849| 10.1k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 7.65k| { 1814| 7.65k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.65k| } _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.53k| { 1037| 2.53k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.53k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1653| 56.3k| { 1654| 56.3k| assert(start > 0); ------------------ | Branch (1654:9): [True: 56.3k, False: 0] ------------------ 1655| 56.3k| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 56.3k, False: 0] ------------------ 1656| 56.3k| auto s = relaxed_->d.sizes[start - 1]; 1657| 56.3k| auto p = node_->inner(); 1658| 56.3k| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 5.09k, False: 51.2k] ------------------ 1659| 13.7k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 8.62k, False: 5.09k] ------------------ 1660| 8.62k| IMMER_PREFETCH(p + i + 1); 1661| 8.62k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 8.62k| .visit(v, args...); 1663| 8.62k| s = relaxed_->d.sizes[i]; 1664| 8.62k| assert(s); ------------------ | Branch (1664:17): [True: 8.62k, False: 0] ------------------ 1665| 8.62k| } 1666| 51.2k| } else { 1667| 51.2k| auto ss = shift_ - B; 1668| 161k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 110k, False: 51.2k] ------------------ 1669| 110k| visit_maybe_relaxed_sub( 1670| 110k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 110k| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 110k, False: 0] ------------------ 1673| 110k| } 1674| 51.2k| } 1675| 56.3k| } _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| 4.96k| { 928| 4.96k| return towards_oh_ch_regular( 929| 4.96k| *this, v, idx, offset_hint, count(), args...); 930| 4.96k| } _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| 4.96k|{ 633| 4.96k| constexpr auto B = bits; 634| 4.96k| constexpr auto BL = bits_leaf; 635| 4.96k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.96k, False: 0] ------------------ 636| 4.96k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.96k, False: 0] ------------------ 637| 4.96k| auto is_leaf = p.shift() == BL; 638| 4.96k| auto child = p.node()->inner()[offset_hint]; 639| 4.96k| auto is_full = offset_hint + 1 != count_hint; 640| 4.96k| return is_full ------------------ | Branch (640:12): [True: 4.28k, False: 677] ------------------ 641| 4.96k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.06k, False: 3.21k] ------------------ 642| 4.28k| : make_full_pos(child, p.shift() - B) 643| 3.21k| .visit(v, idx, args...)) 644| 4.96k| : (is_leaf ------------------ | Branch (644:19): [True: 677, False: 0] ------------------ 645| 677| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 677| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 4.96k|} _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.53k| { 208| 1.53k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.53k| } _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.72k| { 1406| 3.72k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.72k| } _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| 977| { 1337| 977| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 977, False: 0] ------------------ 1338| 977| auto is_leaf = shift_ == BL; 1339| 977| auto child = node_->inner()[offset_hint]; 1340| 977| return is_leaf ------------------ | Branch (1340:16): [True: 468, False: 509] ------------------ 1341| 977| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 977| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 977| } _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| 677| { 113| 677| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 677| } _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| 678| { 145| 678| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 678| } _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| 47.1k|{ 1839| 47.1k| assert(node); ------------------ | Branch (1839:5): [True: 47.1k, False: 0] ------------------ 1840| 47.1k| auto relaxed = node->relaxed(); 1841| 47.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 38.8k, False: 8.27k] ------------------ 1842| 38.8k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 38.8k, False: 0] ------------------ 1843| 38.8k| return make_relaxed_pos(node, shift, relaxed) 1844| 38.8k| .visit(v, std::forward(args)...); 1845| 38.8k| } else { 1846| 8.27k| return make_regular_sub_pos(node, shift, size) 1847| 8.27k| .visit(v, std::forward(args)...); 1848| 8.27k| } 1849| 47.1k|} _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| 38.8k| { 1814| 38.8k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 38.8k| } _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.22k| { 1706| 5.22k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 5.22k, False: 0] ------------------ 1707| 5.22k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 4.56k, False: 654] ------------------ 1708| 5.22k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 5.22k| } _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.22k| { 1718| 5.22k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 5.22k, False: 0] ------------------ 1719| 5.22k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 4.56k, False: 654] | Branch (1719:9): [True: 5.22k, False: 0] ------------------ 1720| 5.22k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 5.22k| auto child = node_->inner()[offset_hint]; 1722| 5.22k| auto is_leaf = shift_ == BL; 1723| 5.22k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 5.22k| auto next_idx = idx - left_size_hint; 1725| 5.22k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 5.22k] ------------------ 1726| 5.22k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 5.22k| : visit_maybe_relaxed_sub( 1729| 5.22k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 5.22k| } _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.48k| { 1706| 4.48k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 4.48k, False: 0] ------------------ 1707| 4.48k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 3.81k, False: 671] ------------------ 1708| 4.48k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 4.48k| } _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.48k| { 1718| 4.48k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 4.48k, False: 0] ------------------ 1719| 4.48k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.81k, False: 671] | Branch (1719:9): [True: 4.48k, False: 0] ------------------ 1720| 4.48k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 4.48k| auto child = node_->inner()[offset_hint]; 1722| 4.48k| auto is_leaf = shift_ == BL; 1723| 4.48k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 4.48k| auto next_idx = idx - left_size_hint; 1725| 4.48k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 4.48k] ------------------ 1726| 4.48k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 4.48k| : visit_maybe_relaxed_sub( 1729| 4.48k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 4.48k| } _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.48k|{ 1839| 4.48k| assert(node); ------------------ | Branch (1839:5): [True: 4.48k, False: 0] ------------------ 1840| 4.48k| auto relaxed = node->relaxed(); 1841| 4.48k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.79k, False: 1.69k] ------------------ 1842| 2.79k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.79k, False: 0] ------------------ 1843| 2.79k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.79k| .visit(v, std::forward(args)...); 1845| 2.79k| } else { 1846| 1.69k| return make_regular_sub_pos(node, shift, size) 1847| 1.69k| .visit(v, std::forward(args)...); 1848| 1.69k| } 1849| 4.48k|} _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.79k| { 1814| 2.79k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.79k| } _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.69k| { 1037| 1.69k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.69k| } _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.19k| { 947| 2.19k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 2.19k| } _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.19k|{ 654| 2.19k| constexpr auto B = bits; 655| 2.19k| constexpr auto BL = bits_leaf; 656| 2.19k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 2.19k, False: 0] ------------------ 657| 2.19k| auto is_leaf = p.shift() == BL; 658| 2.19k| auto child = p.node()->inner()[offset_hint]; 659| 2.19k| auto lsize = offset_hint << p.shift(); 660| 2.19k| auto size = p.this_size(); 661| 2.19k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 2.19k| return is_full ------------------ | Branch (662:12): [True: 1.17k, False: 1.02k] ------------------ 663| 2.19k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 1.17k] ------------------ 664| 1.17k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 1.17k| : make_full_pos(child, p.shift() - B) 666| 1.17k| .visit(v, idx - lsize, args...)) 667| 2.19k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 1.02k] ------------------ 668| 1.02k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 1.02k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 1.02k| .visit(v, idx - lsize, args...)); 672| 2.19k|} _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.04k| { 1406| 3.04k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.04k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1348| 1.87k| { 1349| 1.87k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 1.87k, False: 0] ------------------ 1350| 1.87k| auto is_leaf = shift_ == BL; 1351| 1.87k| auto child = node_->inner()[offset_hint]; 1352| 1.87k| auto lsize = size_t{offset_hint} << shift_; 1353| 1.87k| return is_leaf ------------------ | Branch (1353:16): [True: 0, False: 1.87k] ------------------ 1354| 1.87k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 1.87k| : make_full_pos(child, shift_ - B) 1356| 1.87k| .visit(v, idx - lsize, args...); 1357| 1.87k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1405| 309| { 1406| 309| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 309| } _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.82k| { 1349| 1.82k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 1.82k, False: 0] ------------------ 1350| 1.82k| auto is_leaf = shift_ == BL; 1351| 1.82k| auto child = node_->inner()[offset_hint]; 1352| 1.82k| auto lsize = size_t{offset_hint} << shift_; 1353| 1.82k| return is_leaf ------------------ | Branch (1353:16): [True: 1.12k, False: 699] ------------------ 1354| 1.82k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 1.82k| : make_full_pos(child, shift_ - B) 1356| 699| .visit(v, idx - lsize, args...); 1357| 1.82k| } _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.04k| { 208| 3.04k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.04k| } _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.02k| { 1406| 2.02k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.02k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1348| 7.81k| { 1349| 7.81k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 7.81k, False: 0] ------------------ 1350| 7.81k| auto is_leaf = shift_ == BL; 1351| 7.81k| auto child = node_->inner()[offset_hint]; 1352| 7.81k| auto lsize = size_t{offset_hint} << shift_; 1353| 7.81k| return is_leaf ------------------ | Branch (1353:16): [True: 6.03k, False: 1.78k] ------------------ 1354| 7.81k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 7.81k| : make_full_pos(child, shift_ - B) 1356| 1.78k| .visit(v, idx - lsize, args...); 1357| 7.81k| } _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| 12.4k| { 208| 12.4k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 12.4k| } _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.25k| { 1406| 3.25k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.25k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1316| 2.13k| { 1317| 2.13k| each_i(v, 0, last, args...); 1318| 2.13k| } _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.02k| { 1037| 1.02k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.02k| } _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.28k| { 1037| 4.28k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.28k| } _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.24k| { 947| 3.24k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 3.24k| } _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.24k|{ 654| 3.24k| constexpr auto B = bits; 655| 3.24k| constexpr auto BL = bits_leaf; 656| 3.24k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 3.24k, False: 0] ------------------ 657| 3.24k| auto is_leaf = p.shift() == BL; 658| 3.24k| auto child = p.node()->inner()[offset_hint]; 659| 3.24k| auto lsize = offset_hint << p.shift(); 660| 3.24k| auto size = p.this_size(); 661| 3.24k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 3.24k| return is_full ------------------ | Branch (662:12): [True: 3.24k, False: 0] ------------------ 663| 3.24k| ? (is_leaf ------------------ | Branch (663:19): [True: 1.91k, False: 1.32k] ------------------ 664| 3.24k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 3.24k| : make_full_pos(child, p.shift() - B) 666| 1.32k| .visit(v, idx - lsize, args...)) 667| 3.24k| : (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.24k|} _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| 7.91k| { 947| 7.91k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 7.91k| } _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| 7.91k|{ 654| 7.91k| constexpr auto B = bits; 655| 7.91k| constexpr auto BL = bits_leaf; 656| 7.91k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 7.91k, False: 0] ------------------ 657| 7.91k| auto is_leaf = p.shift() == BL; 658| 7.91k| auto child = p.node()->inner()[offset_hint]; 659| 7.91k| auto lsize = offset_hint << p.shift(); 660| 7.91k| auto size = p.this_size(); 661| 7.91k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 7.91k| return is_full ------------------ | Branch (662:12): [True: 7.91k, False: 0] ------------------ 663| 7.91k| ? (is_leaf ------------------ | Branch (663:19): [True: 6.43k, False: 1.47k] ------------------ 664| 7.91k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 7.91k| : make_full_pos(child, p.shift() - B) 666| 1.47k| .visit(v, idx - lsize, args...)) 667| 7.91k| : (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.91k|} _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.53k| { 874| 7.53k| return each_left_regular(*this, v, last, args...); 875| 7.53k| } _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.53k|{ 576| 7.53k| constexpr auto B = bits; 577| 7.53k| constexpr auto BL = bits_leaf; 578| 7.53k| assert(last < p.count()); ------------------ | Branch (578:5): [True: 7.53k, False: 0] ------------------ 579| 7.53k| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 1.91k, False: 5.61k] ------------------ 580| 1.91k| auto n = p.node()->inner(); 581| 1.91k| auto e = n + last; 582| 3.81k| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 1.89k, False: 1.91k] ------------------ 583| 1.89k| IMMER_PREFETCH(n + 1); 584| 1.89k| make_full_leaf_pos(*n).visit(v, args...); 585| 1.89k| } 586| 5.61k| } else { 587| 5.61k| auto n = p.node()->inner(); 588| 5.61k| auto e = n + last; 589| 5.61k| auto ss = p.shift() - B; 590| 7.75k| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 2.14k, False: 5.61k] ------------------ 591| 2.14k| make_full_pos(*n, ss).visit(v, args...); 592| 5.61k| } 593| 7.53k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1813| 5.22k| { 1814| 5.22k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 5.22k| } _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| 168k| { 1706| 168k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 168k, False: 0] ------------------ 1707| 168k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 9.34k, False: 159k] ------------------ 1708| 168k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 168k| } _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| 168k| { 1718| 168k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 168k, False: 0] ------------------ 1719| 168k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 9.34k, False: 159k] | Branch (1719:9): [True: 168k, False: 0] ------------------ 1720| 168k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 168k| auto child = node_->inner()[offset_hint]; 1722| 168k| auto is_leaf = shift_ == BL; 1723| 168k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 168k| auto next_idx = idx - left_size_hint; 1725| 168k| return is_leaf ------------------ | Branch (1725:16): [True: 9.96k, False: 158k] ------------------ 1726| 168k| ? make_leaf_sub_pos(child, next_size) 1727| 9.96k| .visit(v, next_idx, args...) 1728| 168k| : visit_maybe_relaxed_sub( 1729| 158k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 168k| } _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| 9.96k| { 145| 9.96k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 9.96k| } _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| 158k|{ 1839| 158k| assert(node); ------------------ | Branch (1839:5): [True: 158k, False: 0] ------------------ 1840| 158k| auto relaxed = node->relaxed(); 1841| 158k| if (relaxed) { ------------------ | Branch (1841:9): [True: 157k, False: 1.38k] ------------------ 1842| 157k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 157k, False: 0] ------------------ 1843| 157k| return make_relaxed_pos(node, shift, relaxed) 1844| 157k| .visit(v, std::forward(args)...); 1845| 157k| } else { 1846| 1.38k| return make_regular_sub_pos(node, shift, size) 1847| 1.38k| .visit(v, std::forward(args)...); 1848| 1.38k| } 1849| 158k|} _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| 157k| { 1814| 157k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 157k| } _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| 86.9k| { 1706| 86.9k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 86.9k, False: 0] ------------------ 1707| 86.9k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 29.3k, False: 57.6k] ------------------ 1708| 86.9k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 86.9k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 86.9k| { 1718| 86.9k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 86.9k, False: 0] ------------------ 1719| 86.9k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 29.3k, False: 57.6k] | Branch (1719:9): [True: 86.9k, False: 0] ------------------ 1720| 86.9k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 86.9k| auto child = node_->inner()[offset_hint]; 1722| 86.9k| auto is_leaf = shift_ == BL; 1723| 86.9k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 86.9k| auto next_idx = idx - left_size_hint; 1725| 86.9k| return is_leaf ------------------ | Branch (1725:16): [True: 16.4k, False: 70.5k] ------------------ 1726| 86.9k| ? make_leaf_sub_pos(child, next_size) 1727| 16.4k| .visit(v, next_idx, args...) 1728| 86.9k| : visit_maybe_relaxed_sub( 1729| 70.5k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 86.9k| } _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| 16.4k| { 145| 16.4k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 16.4k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 70.5k|{ 1839| 70.5k| assert(node); ------------------ | Branch (1839:5): [True: 70.5k, False: 0] ------------------ 1840| 70.5k| auto relaxed = node->relaxed(); 1841| 70.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 66.3k, False: 4.16k] ------------------ 1842| 66.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 66.3k, False: 0] ------------------ 1843| 66.3k| return make_relaxed_pos(node, shift, relaxed) 1844| 66.3k| .visit(v, std::forward(args)...); 1845| 66.3k| } else { 1846| 4.16k| return make_regular_sub_pos(node, shift, size) 1847| 4.16k| .visit(v, std::forward(args)...); 1848| 4.16k| } 1849| 70.5k|} _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| 66.3k| { 1814| 66.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 66.3k| } _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.16k| { 1037| 4.16k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.16k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 8.27k| { 1037| 8.27k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.27k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 946| 4.28k| { 947| 4.28k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 4.28k| } _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.28k|{ 654| 4.28k| constexpr auto B = bits; 655| 4.28k| constexpr auto BL = bits_leaf; 656| 4.28k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 4.28k, False: 0] ------------------ 657| 4.28k| auto is_leaf = p.shift() == BL; 658| 4.28k| auto child = p.node()->inner()[offset_hint]; 659| 4.28k| auto lsize = offset_hint << p.shift(); 660| 4.28k| auto size = p.this_size(); 661| 4.28k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 4.28k| return is_full ------------------ | Branch (662:12): [True: 3.18k, False: 1.10k] ------------------ 663| 4.28k| ? (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.28k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 1.10k] ------------------ 668| 1.10k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 1.10k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 1.10k| .visit(v, idx - lsize, args...)); 672| 4.28k|} _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| 309| { 1349| 309| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 309, False: 0] ------------------ 1350| 309| auto is_leaf = shift_ == BL; 1351| 309| auto child = node_->inner()[offset_hint]; 1352| 309| auto lsize = size_t{offset_hint} << shift_; 1353| 309| return is_leaf ------------------ | Branch (1353:16): [True: 0, False: 309] ------------------ 1354| 309| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 309| : make_full_pos(child, shift_ - B) 1356| 309| .visit(v, idx - lsize, args...); 1357| 309| } _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.10k| { 1037| 1.10k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.10k| } _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| 17.7k|{ 1839| 17.7k| assert(node); ------------------ | Branch (1839:5): [True: 17.7k, False: 0] ------------------ 1840| 17.7k| auto relaxed = node->relaxed(); 1841| 17.7k| if (relaxed) { ------------------ | Branch (1841:9): [True: 10.9k, False: 6.75k] ------------------ 1842| 10.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 10.9k, False: 0] ------------------ 1843| 10.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 10.9k| .visit(v, std::forward(args)...); 1845| 10.9k| } else { 1846| 6.75k| return make_regular_sub_pos(node, shift, size) 1847| 6.75k| .visit(v, std::forward(args)...); 1848| 6.75k| } 1849| 17.7k|} _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| 10.9k| { 1814| 10.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 10.9k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcPT_jmT0_DpOT1_: 1838| 10.9k|{ 1839| 10.9k| assert(node); ------------------ | Branch (1839:5): [True: 10.9k, False: 0] ------------------ 1840| 10.9k| auto relaxed = node->relaxed(); 1841| 10.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.71k, False: 3.24k] ------------------ 1842| 7.71k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.71k, False: 0] ------------------ 1843| 7.71k| return make_relaxed_pos(node, shift, relaxed) 1844| 7.71k| .visit(v, std::forward(args)...); 1845| 7.71k| } else { 1846| 3.24k| return make_regular_sub_pos(node, shift, size) 1847| 3.24k| .visit(v, std::forward(args)...); 1848| 3.24k| } 1849| 10.9k|} _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| 7.71k| { 1814| 7.71k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.71k| } _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| 30.5k| { 1794| 30.5k| auto child = node_->inner()[offset]; 1795| 30.5k| auto child_size = size(offset); 1796| 30.5k| auto is_leaf = shift_ == BL; 1797| 30.5k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 8.45k, False: 22.1k] ------------------ 1798| 30.5k| : visit_maybe_relaxed_sub( 1799| 22.1k| child, shift_ - B, child_size, v, args...); 1800| 30.5k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 144| 8.84k| { 145| 8.84k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 8.84k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcjT_DpOT0_: 1804| 8.84k| { 1805| 8.84k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 8.84k, False: 0] ------------------ 1806| 8.84k| auto child = node_->inner()[offset]; 1807| 8.84k| auto child_size = size(offset); 1808| 8.84k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 8.84k| } _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.51k| { 145| 9.51k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 9.51k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcPT_jmT0_DpOT1_: 1838| 22.1k|{ 1839| 22.1k| assert(node); ------------------ | Branch (1839:5): [True: 22.1k, False: 0] ------------------ 1840| 22.1k| auto relaxed = node->relaxed(); 1841| 22.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 19.7k, False: 2.36k] ------------------ 1842| 19.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 19.7k, False: 0] ------------------ 1843| 19.7k| return make_relaxed_pos(node, shift, relaxed) 1844| 19.7k| .visit(v, std::forward(args)...); 1845| 19.7k| } else { 1846| 2.36k| return make_regular_sub_pos(node, shift, size) 1847| 2.36k| .visit(v, std::forward(args)...); 1848| 2.36k| } 1849| 22.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| 19.7k| { 1814| 19.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 19.7k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcjT_DpOT0_: 1793| 19.7k| { 1794| 19.7k| auto child = node_->inner()[offset]; 1795| 19.7k| auto child_size = size(offset); 1796| 19.7k| auto is_leaf = shift_ == BL; 1797| 19.7k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 19.7k] ------------------ 1798| 19.7k| : visit_maybe_relaxed_sub( 1799| 19.7k| child, shift_ - B, child_size, v, args...); 1800| 19.7k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcPT_jmT0_DpOT1_: 1838| 19.7k|{ 1839| 19.7k| assert(node); ------------------ | Branch (1839:5): [True: 19.7k, False: 0] ------------------ 1840| 19.7k| auto relaxed = node->relaxed(); 1841| 19.7k| if (relaxed) { ------------------ | Branch (1841:9): [True: 18.7k, False: 1.03k] ------------------ 1842| 18.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 18.7k, False: 0] ------------------ 1843| 18.7k| return make_relaxed_pos(node, shift, relaxed) 1844| 18.7k| .visit(v, std::forward(args)...); 1845| 18.7k| } else { 1846| 1.03k| return make_regular_sub_pos(node, shift, size) 1847| 1.03k| .visit(v, std::forward(args)...); 1848| 1.03k| } 1849| 19.7k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1813| 18.7k| { 1814| 18.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 18.7k| } _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.51k| { 1037| 1.51k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.51k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcjT_DpOT0_: 1793| 6.94k| { 1794| 6.94k| auto child = node_->inner()[offset]; 1795| 6.94k| auto child_size = size(offset); 1796| 6.94k| auto is_leaf = shift_ == BL; 1797| 6.94k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 3.79k, False: 3.14k] ------------------ 1798| 6.94k| : visit_maybe_relaxed_sub( 1799| 3.14k| child, shift_ - B, child_size, v, args...); 1800| 6.94k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 144| 3.79k| { 145| 3.79k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 3.79k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcjT_DpOT0_: 1025| 3.79k| { 1026| 3.79k| assert(shift_ == BL); ------------------ | Branch (1026:9): [True: 3.79k, False: 0] ------------------ 1027| 3.79k| auto child = node_->inner()[idx]; 1028| 3.79k| auto lsize = size(idx); 1029| 3.79k| auto is_full = idx + 1 < count(); 1030| 3.79k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1030:16): [True: 3.11k, False: 673] ------------------ 1031| 3.79k| : make_leaf_sub_pos(child, lsize).visit(v, args...); 1032| 3.79k| } _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.12k| { 208| 7.12k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 7.12k| } _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.14k|{ 1839| 3.14k| assert(node); ------------------ | Branch (1839:5): [True: 3.14k, False: 0] ------------------ 1840| 3.14k| auto relaxed = node->relaxed(); 1841| 3.14k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.39k, False: 753] ------------------ 1842| 2.39k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.39k, False: 0] ------------------ 1843| 2.39k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.39k| .visit(v, std::forward(args)...); 1845| 2.39k| } else { 1846| 753| return make_regular_sub_pos(node, shift, size) 1847| 753| .visit(v, std::forward(args)...); 1848| 753| } 1849| 3.14k|} _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.39k| { 1814| 2.39k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.39k| } _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.39k| { 1008| 2.39k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 2.39k, False: 0] ------------------ 1009| 2.39k| auto is_leaf = shift_ == BL; 1010| 2.39k| auto child = node_->inner()[idx]; 1011| 2.39k| auto lsize = size(idx); 1012| 2.39k| auto is_full = idx + 1 < count(); 1013| 2.39k| return is_full ------------------ | Branch (1013:16): [True: 1.91k, False: 482] ------------------ 1014| 2.39k| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 1.91k] ------------------ 1015| 1.91k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.91k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 2.39k| : (is_leaf ------------------ | Branch (1017:23): [True: 0, False: 482] ------------------ 1018| 482| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 482| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 482| .visit(v, args...)); 1021| 2.39k| } _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.82k| { 1406| 2.82k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.82k| } _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| 6.07k| { 1794| 6.07k| auto child = node_->inner()[offset]; 1795| 6.07k| auto child_size = size(offset); 1796| 6.07k| auto is_leaf = shift_ == BL; 1797| 6.07k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 4.00k, False: 2.06k] ------------------ 1798| 6.07k| : visit_maybe_relaxed_sub( 1799| 2.06k| child, shift_ - B, child_size, v, args...); 1800| 6.07k| } _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| 4.00k| { 145| 4.00k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.00k| } _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| 4.00k| { 1397| 4.00k| assert(shift_ == BL); ------------------ | Branch (1397:9): [True: 4.00k, False: 0] ------------------ 1398| 4.00k| assert(idx < count()); ------------------ | Branch (1398:9): [True: 4.00k, False: 0] ------------------ 1399| 4.00k| auto child = node_->inner()[idx]; 1400| 4.00k| return make_full_leaf_pos(child).visit(v, args...); 1401| 4.00k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcPT_jmT0_DpOT1_: 1838| 2.06k|{ 1839| 2.06k| assert(node); ------------------ | Branch (1839:5): [True: 2.06k, False: 0] ------------------ 1840| 2.06k| auto relaxed = node->relaxed(); 1841| 2.06k| if (relaxed) { ------------------ | Branch (1841:9): [True: 915, False: 1.15k] ------------------ 1842| 915| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 915, False: 0] ------------------ 1843| 915| return make_relaxed_pos(node, shift, relaxed) 1844| 915| .visit(v, std::forward(args)...); 1845| 1.15k| } 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.06k|} _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| 915| { 1814| 915| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 915| } _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| 915| { 1387| 915| assert(idx < count()); ------------------ | Branch (1387:9): [True: 915, False: 0] ------------------ 1388| 915| auto is_leaf = shift_ == BL; 1389| 915| auto child = node_->inner()[idx]; 1390| 915| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 915] ------------------ 1391| 915| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 915| } _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.15k| { 1037| 1.15k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.15k| } _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.15k| { 1387| 1.15k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 1.15k, False: 0] ------------------ 1388| 1.15k| auto is_leaf = shift_ == BL; 1389| 1.15k| auto child = node_->inner()[idx]; 1390| 1.15k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 1.15k] ------------------ 1391| 1.15k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 1.15k| } _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.90k| { 1406| 1.90k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.90k| } _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.65k| { 1223| 3.65k| auto p = node_->inner(); 1224| 3.65k| auto p2 = other->inner(); 1225| 3.65k| auto e = p + branches; 1226| 3.65k| if (shift_ == BL) { ------------------ | Branch (1226:13): [True: 2.76k, False: 892] ------------------ 1227| 10.8k| for (; p != e; ++p, ++p2) { ------------------ | Branch (1227:20): [True: 9.33k, False: 1.47k] ------------------ 1228| 9.33k| IMMER_PREFETCH(p + 1); 1229| 9.33k| if (!make_full_leaf_pos(*p).visit(v, *p2, args...)) ------------------ | Branch (1229:21): [True: 1.28k, False: 8.04k] ------------------ 1230| 1.28k| return false; 1231| 9.33k| } 1232| 2.76k| } else { 1233| 892| auto ss = shift_ - B; 1234| 3.22k| for (; p != e; ++p, ++p2) ------------------ | Branch (1234:20): [True: 2.85k, False: 378] ------------------ 1235| 2.85k| if (!make_full_pos(*p, ss).visit(v, *p2, args...)) ------------------ | Branch (1235:21): [True: 514, False: 2.33k] ------------------ 1236| 514| return false; 1237| 892| } 1238| 1.85k| return true; 1239| 3.65k| } _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.8k| { 208| 13.8k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 13.8k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 1405| 8.76k| { 1406| 8.76k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 8.76k| } _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.28k| { 838| 5.28k| return each_pred_zip_regular(*this, v, other, args...); 839| 5.28k| } _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.28k|{ 393| 5.28k| constexpr auto B = bits; 394| 5.28k| constexpr auto BL = bits_leaf; 395| | 396| 5.28k| auto n = p.node()->inner(); 397| 5.28k| auto n2 = other->inner(); 398| 5.28k| auto last = p.count() - 1; 399| 5.28k| auto e = n + last; 400| 5.28k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 1.75k, False: 3.53k] ------------------ 401| 4.15k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 2.81k, False: 1.33k] ------------------ 402| 2.81k| IMMER_PREFETCH(n + 1); 403| 2.81k| IMMER_PREFETCH(n2 + 1); 404| 2.81k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 416, False: 2.40k] ------------------ 405| 416| return false; 406| 2.81k| } 407| 1.33k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 3.53k| } else { 409| 3.53k| auto ss = p.shift() - B; 410| 7.01k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 4.35k, False: 2.66k] ------------------ 411| 4.35k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 876, False: 3.47k] ------------------ 412| 876| return false; 413| 2.66k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 3.53k| } 415| 5.28k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 112| 3.12k| { 113| 3.12k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 3.12k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 336| 3.82k| { 337| 3.82k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.82k| } _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.44k| { 256| 3.44k| return each_pred_zip_regular(*this, v, other, args...); 257| 3.44k| } _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.44k|{ 393| 3.44k| constexpr auto B = bits; 394| 3.44k| constexpr auto BL = bits_leaf; 395| | 396| 3.44k| auto n = p.node()->inner(); 397| 3.44k| auto n2 = other->inner(); 398| 3.44k| auto last = p.count() - 1; 399| 3.44k| auto e = n + last; 400| 3.44k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 2.08k, False: 1.36k] ------------------ 401| 3.52k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 1.73k, False: 1.79k] ------------------ 402| 1.73k| IMMER_PREFETCH(n + 1); 403| 1.73k| IMMER_PREFETCH(n2 + 1); 404| 1.73k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 292, False: 1.44k] ------------------ 405| 292| return false; 406| 1.73k| } 407| 1.79k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 2.08k| } else { 409| 1.36k| auto ss = p.shift() - B; 410| 2.72k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 1.56k, False: 1.16k] ------------------ 411| 1.56k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 204, False: 1.35k] ------------------ 412| 204| return false; 413| 1.16k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 1.36k| } 415| 3.44k|} _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.53k| { 1387| 4.53k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 4.53k, False: 0] ------------------ 1388| 4.53k| auto is_leaf = shift_ == BL; 1389| 4.53k| auto child = node_->inner()[idx]; 1390| 4.53k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 3.13k, False: 1.40k] ------------------ 1391| 4.53k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 4.53k| } _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| 318k| { 208| 318k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 318k| } _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.18M|{ 1839| 9.18M| assert(node); ------------------ | Branch (1839:5): [True: 9.18M, False: 0] ------------------ 1840| 9.18M| auto relaxed = node->relaxed(); 1841| 9.18M| if (relaxed) { ------------------ | Branch (1841:9): [True: 8.84M, False: 343k] ------------------ 1842| 8.84M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 8.84M, False: 0] ------------------ 1843| 8.84M| return make_relaxed_pos(node, shift, relaxed) 1844| 8.84M| .visit(v, std::forward(args)...); 1845| 8.84M| } else { 1846| 343k| return make_regular_sub_pos(node, shift, size) 1847| 343k| .visit(v, std::forward(args)...); 1848| 343k| } 1849| 9.18M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1813| 8.84M| { 1814| 8.84M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 8.84M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1679| 8.84M| { 1680| 8.84M| return towards_oh(v, idx, subindex(idx), args...); 1681| 8.84M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_18region_for_visitorIiEEJEEEDcT_mjDpOT0_: 1686| 8.84M| { 1687| 8.84M| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 8.84M, False: 0] ------------------ 1688| 8.84M| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 4.79M, False: 4.04M] ------------------ 1689| 8.84M| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 8.84M| } _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| 8.84M| { 1699| 8.84M| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 8.84M| } _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| 8.84M| { 1718| 8.84M| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 8.84M, False: 0] ------------------ 1719| 8.84M| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 4.79M, False: 4.04M] | Branch (1719:9): [True: 8.84M, False: 0] ------------------ 1720| 8.84M| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 8.84M| auto child = node_->inner()[offset_hint]; 1722| 8.84M| auto is_leaf = shift_ == BL; 1723| 8.84M| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 8.84M| auto next_idx = idx - left_size_hint; 1725| 8.84M| return is_leaf ------------------ | Branch (1725:16): [True: 953k, False: 7.89M] ------------------ 1726| 8.84M| ? make_leaf_sub_pos(child, next_size) 1727| 953k| .visit(v, next_idx, args...) 1728| 8.84M| : visit_maybe_relaxed_sub( 1729| 7.89M| child, shift_ - B, next_size, v, next_idx, args...); 1730| 8.84M| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 144| 953k| { 145| 953k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 953k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1036| 343k| { 1037| 343k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 343k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 919| 343k| { 920| 343k| return towards_oh_ch_regular( 921| 343k| *this, v, idx, index(idx), count(), args...); 922| 343k| } _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| 343k|{ 633| 343k| constexpr auto B = bits; 634| 343k| constexpr auto BL = bits_leaf; 635| 343k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 343k, False: 0] ------------------ 636| 343k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 343k, False: 0] ------------------ 637| 343k| auto is_leaf = p.shift() == BL; 638| 343k| auto child = p.node()->inner()[offset_hint]; 639| 343k| auto is_full = offset_hint + 1 != count_hint; 640| 343k| return is_full ------------------ | Branch (640:12): [True: 251k, False: 92.1k] ------------------ 641| 343k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 41.2k, False: 210k] ------------------ 642| 251k| : make_full_pos(child, p.shift() - B) 643| 210k| .visit(v, idx, args...)) 644| 343k| : (is_leaf ------------------ | Branch (644:19): [True: 15.8k, False: 76.2k] ------------------ 645| 92.1k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 92.1k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 76.2k| .visit(v, idx, args...)); 648| 343k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 207| 321k| { 208| 321k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 321k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1405| 925k| { 1406| 925k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 925k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1322| 925k| { 1323| 925k| return towards_oh(v, idx, index(idx), args...); 1324| 925k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_18region_for_visitorIiEEJEEEDcT_mjDpOT0_: 1336| 925k| { 1337| 925k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 925k, False: 0] ------------------ 1338| 925k| auto is_leaf = shift_ == BL; 1339| 925k| auto child = node_->inner()[offset_hint]; 1340| 925k| return is_leaf ------------------ | Branch (1340:16): [True: 270k, False: 655k] ------------------ 1341| 925k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 925k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 925k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 112| 22.1k| { 113| 22.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 22.1k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 336| 101k| { 337| 101k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 101k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 297| 101k| { 298| 101k| return towards_oh_ch_regular( 299| 101k| *this, v, idx, index(idx), count(), args...); 300| 101k| } _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| 101k|{ 633| 101k| constexpr auto B = bits; 634| 101k| constexpr auto BL = bits_leaf; 635| 101k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 101k, False: 0] ------------------ 636| 101k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 101k, False: 0] ------------------ 637| 101k| auto is_leaf = p.shift() == BL; 638| 101k| auto child = p.node()->inner()[offset_hint]; 639| 101k| auto is_full = offset_hint + 1 != count_hint; 640| 101k| return is_full ------------------ | Branch (640:12): [True: 69.9k, False: 31.2k] ------------------ 641| 101k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 9.94k, False: 59.9k] ------------------ 642| 69.9k| : make_full_pos(child, p.shift() - B) 643| 59.9k| .visit(v, idx, args...)) 644| 101k| : (is_leaf ------------------ | Branch (644:19): [True: 6.31k, False: 24.8k] ------------------ 645| 31.2k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 31.2k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 24.8k| .visit(v, idx, args...)); 648| 101k|} _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| 85.7k| { 1406| 85.7k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 85.7k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 1202| 85.7k| { 1203| 85.7k| auto p = node_->inner(); 1204| 85.7k| auto e = p + branches; 1205| 85.7k| if (shift_ == BL) { ------------------ | Branch (1205:13): [True: 67.7k, False: 18.0k] ------------------ 1206| 336k| for (; p != e; ++p) { ------------------ | Branch (1206:20): [True: 269k, False: 66.8k] ------------------ 1207| 269k| IMMER_PREFETCH(p + 1); 1208| 269k| if (!make_full_leaf_pos(*p).visit(v, args...)) ------------------ | Branch (1208:21): [True: 868, False: 268k] ------------------ 1209| 868| return false; 1210| 269k| } 1211| 67.7k| } else { 1212| 18.0k| auto ss = shift_ - B; 1213| 89.0k| for (; p != e; ++p) ------------------ | Branch (1213:20): [True: 71.4k, False: 17.6k] ------------------ 1214| 71.4k| if (!make_full_pos(*p, ss).visit(v, args...)) ------------------ | Branch (1214:21): [True: 452, False: 71.0k] ------------------ 1215| 452| return false; 1216| 18.0k| } 1217| 84.4k| return true; 1218| 85.7k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1036| 753| { 1037| 753| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 753| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcjT_DpOT0_: 1007| 753| { 1008| 753| assert(idx < count()); ------------------ | Branch (1008:9): [True: 753, False: 0] ------------------ 1009| 753| auto is_leaf = shift_ == BL; 1010| 753| auto child = node_->inner()[idx]; 1011| 753| auto lsize = size(idx); 1012| 753| auto is_full = idx + 1 < count(); 1013| 753| return is_full ------------------ | Branch (1013:16): [True: 753, False: 0] ------------------ 1014| 753| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 753] ------------------ 1015| 753| ? make_full_leaf_pos(child).visit(v, args...) 1016| 753| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 753| : (is_leaf ------------------ | Branch (1017:23): [True: 0, False: 0] ------------------ 1018| 0| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 0| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 0| .visit(v, args...)); 1021| 753| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1036| 1.55k| { 1037| 1.55k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.55k| } _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.60k, False: 2.84k] ------------------ 1014| 4.44k| ? (is_leaf ------------------ | Branch (1014:23): [True: 967, False: 634] ------------------ 1015| 1.60k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.60k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 4.44k| : (is_leaf ------------------ | Branch (1017:23): [True: 1.51k, False: 1.33k] ------------------ 1018| 2.84k| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 2.84k| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 1.33k| .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| 938k| { 145| 938k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 938k| } _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| 18.7k| { 1037| 18.7k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 18.7k| } _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| 18.7k| { 832| 18.7k| return each_pred_regular(*this, v, args...); 833| 18.7k| } _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| 18.7k|{ 366| 18.7k| constexpr auto B = bits; 367| 18.7k| constexpr auto BL = bits_leaf; 368| 18.7k| auto n = p.node()->inner(); 369| 18.7k| auto last = p.count() - 1; 370| 18.7k| auto e = n + last; 371| 18.7k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 13.5k, False: 5.27k] ------------------ 372| 49.6k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 36.3k, False: 13.2k] ------------------ 373| 36.3k| IMMER_PREFETCH(n + 1); 374| 36.3k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 218, False: 36.1k] ------------------ 375| 218| return false; 376| 36.3k| } 377| 13.2k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 13.5k| } else { 379| 5.27k| auto ss = p.shift() - B; 380| 13.4k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 8.78k, False: 4.70k] ------------------ 381| 8.78k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 572, False: 8.21k] ------------------ 382| 572| return false; 383| 4.70k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 5.27k| } 385| 18.7k|} _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| 17.4k| { 113| 17.4k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 17.4k| } _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.53k| { 337| 6.53k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 6.53k| } _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.53k| { 250| 6.53k| return each_pred_regular(*this, v, args...); 251| 6.53k| } _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.53k|{ 366| 6.53k| constexpr auto B = bits; 367| 6.53k| constexpr auto BL = bits_leaf; 368| 6.53k| auto n = p.node()->inner(); 369| 6.53k| auto last = p.count() - 1; 370| 6.53k| auto e = n + last; 371| 6.53k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 4.42k, False: 2.11k] ------------------ 372| 13.0k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 8.82k, False: 4.19k] ------------------ 373| 8.82k| IMMER_PREFETCH(n + 1); 374| 8.82k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 232, False: 8.59k] ------------------ 375| 232| return false; 376| 8.82k| } 377| 4.19k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 4.42k| } else { 379| 2.11k| auto ss = p.shift() - B; 380| 5.31k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 3.47k, False: 1.83k] ------------------ 381| 3.47k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 276, False: 3.19k] ------------------ 382| 276| return false; 383| 1.83k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 2.11k| } 385| 6.53k|} _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.36k| { 1037| 2.36k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.36k| } _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.36k| { 1794| 2.36k| auto child = node_->inner()[offset]; 1795| 2.36k| auto child_size = size(offset); 1796| 2.36k| auto is_leaf = shift_ == BL; 1797| 2.36k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 2.36k] ------------------ 1798| 2.36k| : visit_maybe_relaxed_sub( 1799| 2.36k| child, shift_ - B, child_size, v, args...); 1800| 2.36k| } _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.36k|{ 1839| 2.36k| assert(node); ------------------ | Branch (1839:5): [True: 2.36k, False: 0] ------------------ 1840| 2.36k| auto relaxed = node->relaxed(); 1841| 2.36k| if (relaxed) { ------------------ | Branch (1841:9): [True: 811, False: 1.55k] ------------------ 1842| 811| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 811, False: 0] ------------------ 1843| 811| return make_relaxed_pos(node, shift, relaxed) 1844| 811| .visit(v, std::forward(args)...); 1845| 1.55k| } else { 1846| 1.55k| return make_regular_sub_pos(node, shift, size) 1847| 1.55k| .visit(v, std::forward(args)...); 1848| 1.55k| } 1849| 2.36k|} _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| 811| { 1814| 811| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 811| } _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.13k| { 1008| 4.13k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 4.13k, False: 0] ------------------ 1009| 4.13k| auto is_leaf = shift_ == BL; 1010| 4.13k| auto child = node_->inner()[idx]; 1011| 4.13k| auto lsize = size(idx); 1012| 4.13k| auto is_full = idx + 1 < count(); 1013| 4.13k| return is_full ------------------ | Branch (1013:16): [True: 3.74k, False: 389] ------------------ 1014| 4.13k| ? (is_leaf ------------------ | Branch (1014:23): [True: 2.26k, False: 1.48k] ------------------ 1015| 3.74k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 3.74k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 4.13k| : (is_leaf ------------------ | Branch (1017:23): [True: 389, False: 0] ------------------ 1018| 389| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 389| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 0| .visit(v, args...)); 1021| 4.13k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 207| 4.80k| { 208| 4.80k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 4.80k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_13full_leaf_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcjT_DpOT0_: 1804| 4.80k| { 1805| 4.80k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 4.80k, False: 0] ------------------ 1806| 4.80k| auto child = node_->inner()[offset]; 1807| 4.80k| auto child_size = size(offset); 1808| 4.80k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 4.80k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRNS1_13full_leaf_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 144| 4.80k| { 145| 4.80k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.80k| } _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| 3.05k| { 1406| 3.05k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.05k| } _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| 3.05k| { 1794| 3.05k| auto child = node_->inner()[offset]; 1795| 3.05k| auto child_size = size(offset); 1796| 3.05k| auto is_leaf = shift_ == BL; 1797| 3.05k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 3.05k] ------------------ 1798| 3.05k| : visit_maybe_relaxed_sub( 1799| 3.05k| child, shift_ - B, child_size, v, args...); 1800| 3.05k| } _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| 3.05k|{ 1839| 3.05k| assert(node); ------------------ | Branch (1839:5): [True: 3.05k, False: 0] ------------------ 1840| 3.05k| auto relaxed = node->relaxed(); 1841| 3.05k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.77k, False: 1.28k] ------------------ 1842| 1.77k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.77k, False: 0] ------------------ 1843| 1.77k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.77k| .visit(v, std::forward(args)...); 1845| 1.77k| } else { 1846| 1.28k| return make_regular_sub_pos(node, shift, size) 1847| 1.28k| .visit(v, std::forward(args)...); 1848| 1.28k| } 1849| 3.05k|} _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.77k| { 1814| 1.77k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.77k| } _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| 4.11k| { 1387| 4.11k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 4.11k, False: 0] ------------------ 1388| 4.11k| auto is_leaf = shift_ == BL; 1389| 4.11k| auto child = node_->inner()[idx]; 1390| 4.11k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 2.54k, False: 1.57k] ------------------ 1391| 4.11k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 4.11k| } _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.28k| { 1037| 1.28k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.28k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_24for_each_chunk_p_visitorEJZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEDcjSK_DpOT0_: 1793| 23.7k| { 1794| 23.7k| auto child = node_->inner()[offset]; 1795| 23.7k| auto child_size = size(offset); 1796| 23.7k| auto is_leaf = shift_ == BL; 1797| 23.7k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 8.51k, False: 15.2k] ------------------ 1798| 23.7k| : visit_maybe_relaxed_sub( 1799| 15.2k| child, shift_ - B, child_size, v, args...); 1800| 23.7k| } _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| 596k|{ 1839| 596k| assert(node); ------------------ | Branch (1839:5): [True: 596k, False: 0] ------------------ 1840| 596k| auto relaxed = node->relaxed(); 1841| 596k| if (relaxed) { ------------------ | Branch (1841:9): [True: 579k, False: 17.4k] ------------------ 1842| 579k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 579k, False: 0] ------------------ 1843| 579k| return make_relaxed_pos(node, shift, relaxed) 1844| 579k| .visit(v, std::forward(args)...); 1845| 579k| } else { 1846| 17.4k| return make_regular_sub_pos(node, shift, size) 1847| 17.4k| .visit(v, std::forward(args)...); 1848| 17.4k| } 1849| 596k|} _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| 579k| { 1814| 579k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 579k| } _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| 579k| { 1483| 579k| auto p = node_->inner(); 1484| 579k| auto s = size_t{}; 1485| 579k| auto n = count(); 1486| 579k| if (shift_ == BL) { ------------------ | Branch (1486:13): [True: 277k, False: 302k] ------------------ 1487| 1.20M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1487:39): [True: 928k, False: 276k] ------------------ 1488| 928k| IMMER_PREFETCH(p + i + 1); 1489| 928k| if (!make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) ------------------ | Branch (1489:21): [True: 457, False: 927k] ------------------ 1490| 928k| .visit(v, args...)) 1491| 457| return false; 1492| 927k| s = relaxed_->d.sizes[i]; 1493| 927k| } 1494| 302k| } else { 1495| 302k| auto ss = shift_ - B; 1496| 883k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1496:39): [True: 581k, False: 301k] ------------------ 1497| 581k| if (!visit_maybe_relaxed_sub( ------------------ | Branch (1497:21): [True: 523, False: 580k] ------------------ 1498| 581k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...)) 1499| 523| return false; 1500| 580k| s = relaxed_->d.sizes[i]; 1501| 580k| } 1502| 302k| } 1503| 578k| return true; 1504| 579k| } _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.24k| { 1037| 3.24k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.24k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE15first_sub_innerINS1_14equals_visitor3rrbEJRNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERPSC_RjRmEEEDcT_DpOT0_: 1783| 1.40k| { 1784| 1.40k| assert(shift_ > BL); ------------------ | Branch (1784:9): [True: 1.40k, False: 0] ------------------ 1785| 1.40k| auto child = node_->inner()[0]; 1786| 1.40k| auto child_size = relaxed_->d.sizes[0]; 1787| 1.40k| return visit_maybe_relaxed_sub( 1788| 1.40k| child, shift_ - B, child_size, v, args...); 1789| 1.40k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitor3rrbEJRNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERPSC_RjRmEEEDcPT_jmT0_DpOT1_: 1838| 1.40k|{ 1839| 1.40k| assert(node); ------------------ | Branch (1839:5): [True: 1.40k, False: 0] ------------------ 1840| 1.40k| auto relaxed = node->relaxed(); 1841| 1.40k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.40k, False: 0] ------------------ 1842| 1.40k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.40k, False: 0] ------------------ 1843| 1.40k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.40k| .visit(v, std::forward(args)...); 1845| 1.40k| } else { 1846| 0| return make_regular_sub_pos(node, shift, size) 1847| 0| .visit(v, std::forward(args)...); 1848| 0| } 1849| 1.40k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor3rrbEJRNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERPSC_RjRmEEEDcT_DpOT0_: 1813| 1.40k| { 1814| 1.40k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.40k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcPT_jmT0_DpOT1_: 1838| 6.75k|{ 1839| 6.75k| assert(node); ------------------ | Branch (1839:5): [True: 6.75k, False: 0] ------------------ 1840| 6.75k| auto relaxed = node->relaxed(); 1841| 6.75k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.72k, False: 5.03k] ------------------ 1842| 1.72k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.72k, False: 0] ------------------ 1843| 1.72k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.72k| .visit(v, std::forward(args)...); 1845| 5.03k| } else { 1846| 5.03k| return make_regular_sub_pos(node, shift, size) 1847| 5.03k| .visit(v, std::forward(args)...); 1848| 5.03k| } 1849| 6.75k|} _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.72k| { 1814| 1.72k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.72k| } _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.03k| { 1037| 5.03k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.03k| } _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.75k| { 1037| 6.75k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.75k| } _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.21k| { 145| 6.21k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 6.21k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2Ev: 114| 1.59M| : size{0} 115| 1.59M| , shift{BL} 116| 1.59M| , root{empty_root()} 117| 1.59M| , tail{empty_tail()} 118| 1.59M| { 119| | assert(check_tree()); ------------------ | Branch (119:9): [True: 1.59M, False: 0] ------------------ 120| 1.59M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10empty_rootEv: 61| 1.60M| { 62| 1.60M| static const auto empty_ = [] { 63| 1.60M| constexpr auto size = node_t::sizeof_inner_n(0); 64| 1.60M| static std::aligned_storage_t 65| 1.60M| storage; 66| 1.60M| return node_t::make_inner_n_into(&storage, size, 0u); 67| 1.60M| }(); 68| 1.60M| return empty_->inc(); 69| 1.60M| } _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.59M| { 73| 1.59M| static const auto empty_ = [] { 74| 1.59M| constexpr auto size = node_t::sizeof_leaf_n(0); 75| 1.59M| static std::aligned_storage_t 76| 1.59M| storage; 77| 1.59M| return node_t::make_leaf_n_into(&storage, size, 0u); 78| 1.59M| }(); 79| 1.59M| return empty_->inc(); 80| 1.59M| } _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.15M| { 1373| 3.15M| IMMER_INVALID_STATE_ASSERT(shift <= sizeof(size_t) * 8 - BL); ------------------ | | 32| 3.15M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.15M] | | ------------------ | | 33| 3.15M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1374| 3.15M| IMMER_INVALID_STATE_ASSERT(shift >= BL); ------------------ | | 32| 3.15M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.15M] | | ------------------ | | 33| 3.15M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1375| 3.15M| IMMER_INVALID_STATE_ASSERT(tail_offset() <= size); ------------------ | | 32| 3.15M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.15M] | | ------------------ | | 33| 3.15M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1376| 3.15M| IMMER_INVALID_STATE_ASSERT(tail_size() <= branches); ------------------ | | 32| 3.15M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.15M] | | ------------------ | | 33| 3.15M| 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.15M| return true; 1382| 3.15M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11tail_offsetEv: 197| 15.4M| { 198| 15.4M| auto r = root->relaxed(); 199| 15.4M| assert(r == nullptr || r->d.count); ------------------ | Branch (199:9): [True: 7.94M, False: 7.54M] | Branch (199:9): [True: 7.54M, False: 0] | Branch (199:9): [True: 15.4M, False: 0] ------------------ 200| 15.4M| return r ? r->d.sizes[r->d.count - 1] ------------------ | Branch (200:16): [True: 7.54M, False: 7.94M] ------------------ 201| 15.4M| : size ? (size - 1) & ~mask ------------------ | Branch (201:18): [True: 3.14M, False: 4.80M] ------------------ 202| | /* otherwise */ 203| 7.94M| : 0; 204| 15.4M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9tail_sizeEv: 194| 3.59M| 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.15M| ~rrbtree() { dec(); } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE3decEv: 192| 3.15M| 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.15M| { 209| 3.15M| auto tail_off = tail_offset(); 210| 3.15M| auto tail_size = size - tail_off; 211| | 212| 3.15M| if (tail_off) ------------------ | Branch (212:13): [True: 1.47M, False: 1.68M] ------------------ 213| 1.47M| visit_maybe_relaxed_sub(root, shift, tail_off, v, args...); 214| 1.68M| else 215| 1.68M| make_empty_regular_pos(root).visit(v, args...); 216| | 217| 3.15M| if (tail_size) ------------------ | Branch (217:13): [True: 1.56M, False: 1.59M] ------------------ 218| 1.56M| make_leaf_sub_pos(tail, tail_size).visit(v, args...); 219| 1.59M| else 220| 1.59M| make_empty_leaf_pos(tail).visit(v, args...); 221| 3.15M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9push_backEi: 500| 400k| { 501| 400k| auto ts = tail_size(); 502| 400k| if (ts < branches) { ------------------ | Branch (502:13): [True: 292k, False: 107k] ------------------ 503| 292k| auto new_tail = 504| 292k| node_t::copy_leaf_emplace(tail, ts, std::move(value)); 505| 292k| return {size + 1, shift, root->inc(), new_tail}; 506| 292k| } else { 507| 107k| using std::get; 508| 107k| auto new_tail = node_t::make_leaf_n(1u, std::move(value)); 509| 107k| auto tail_off = tail_offset(); 510| 107k| IMMER_TRY { ------------------ | | 49| 107k|#define IMMER_TRY try ------------------ 511| 107k| auto new_root = 512| 107k| push_tail(root, shift, tail_off, tail, size - tail_off); 513| 107k| tail->inc(); 514| 107k| return {size + 1, get<0>(new_root), get<1>(new_root), new_tail}; 515| 107k| } 516| 107k| IMMER_CATCH (...) { 517| 0| node_t::delete_leaf(new_tail, 1u); 518| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 519| 0| } 520| 107k| } 521| 400k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2EmjPNS1_4nodeIiSA_Lj2ELj2EEESE_: 127| 1.56M| : size{sz} 128| 1.56M| , shift{sh} 129| 1.56M| , root{r} 130| 1.56M| , tail{t} 131| 1.56M| { 132| 1.56M|#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.56M| try { 137| 1.56M| check_tree(); 138| 1.56M| } 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.56M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9push_tailEPNS1_4nodeIiSA_Lj2ELj2EEEjmSE_j: 369| 578k| { 370| 578k| if (auto r = root->relaxed()) { ------------------ | Branch (370:18): [True: 232k, False: 346k] ------------------ 371| 232k| auto new_root = 372| 232k| make_relaxed_pos(root, shift, r) 373| 232k| .visit(push_tail_visitor{}, tail, tail_size); 374| 232k| if (new_root) ------------------ | Branch (374:17): [True: 230k, False: 1.76k] ------------------ 375| 230k| return std::make_tuple(shift, new_root); 376| 1.76k| else { 377| 1.76k| auto new_root = node_t::make_inner_r_n(2); 378| 1.76k| IMMER_TRY { ------------------ | | 49| 1.76k|#define IMMER_TRY try ------------------ 379| 1.76k| auto new_path = node_t::make_path(shift, tail); 380| 1.76k| new_root->inner()[0] = root->inc(); 381| 1.76k| new_root->inner()[1] = new_path; 382| 1.76k| new_root->relaxed()->d.sizes[0] = size; 383| 1.76k| new_root->relaxed()->d.sizes[1] = size + tail_size; 384| 1.76k| assert(size); ------------------ | Branch (384:21): [True: 1.76k, False: 0] ------------------ 385| 1.76k| assert(tail_size); ------------------ | Branch (385:21): [True: 1.76k, False: 0] ------------------ 386| 1.76k| new_root->relaxed()->d.count = 2u; 387| 1.76k| } 388| 1.76k| IMMER_CATCH (...) { 389| 0| node_t::delete_inner_r(new_root, 2); 390| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 391| 0| } 392| 1.76k| return std::make_tuple(shift + B, new_root); 393| 1.76k| } 394| 346k| } else if (size == size_t{branches} << shift) { ------------------ | Branch (394:20): [True: 5.18k, False: 340k] ------------------ 395| 5.18k| auto new_root = node_t::make_inner_n(2); 396| 5.18k| IMMER_TRY { ------------------ | | 49| 5.18k|#define IMMER_TRY try ------------------ 397| 5.18k| auto new_path = node_t::make_path(shift, tail); 398| 5.18k| new_root->inner()[0] = root->inc(); 399| 5.18k| new_root->inner()[1] = new_path; 400| 5.18k| } 401| 5.18k| 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.18k| return std::make_tuple(shift + B, new_root); 406| 340k| } else if (size) { ------------------ | Branch (406:20): [True: 330k, False: 10.2k] ------------------ 407| 330k| auto new_root = make_regular_sub_pos(root, shift, size) 408| 330k| .visit(push_tail_visitor{}, tail); 409| 330k| return std::make_tuple(shift, new_root); 410| 330k| } else { 411| 10.2k| return std::make_tuple(shift, node_t::make_path(shift, tail)); 412| 10.2k| } 413| 578k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2EOSB_: 157| 1.51M| : rrbtree{} 158| 1.51M| { 159| 1.51M| swap(*this, other); 160| 1.51M| } _ZN5immer6detail4rbts4swapERNS1_7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEESC_: 176| 3.46M| { 177| 3.46M| using std::swap; 178| 3.46M| swap(x.size, y.size); 179| 3.46M| swap(x.shift, y.shift); 180| 3.46M| swap(x.root, y.root); 181| 3.46M| swap(x.tail, y.tail); 182| 3.46M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEaSEOSB_: 170| 1.94M| { 171| 1.94M| swap(*this, other); 172| 1.94M| return *this; 173| 1.94M| } 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| 133k| { 581| 133k| auto tail_off = tail_offset(); 582| 133k| if (idx >= tail_off) { ------------------ | Branch (582:13): [True: 42.2k, False: 91.2k] ------------------ 583| 42.2k| auto tail_size = size - tail_off; 584| 42.2k| auto new_tail = 585| 42.2k| make_leaf_sub_pos(tail, tail_size) 586| 42.2k| .visit(update_visitor{}, idx - tail_off, fn); 587| 42.2k| return {size, shift, root->inc(), new_tail}; 588| 91.2k| } else { 589| 91.2k| auto new_root = visit_maybe_relaxed_sub( 590| 91.2k| root, shift, tail_off, update_visitor{}, idx, fn); 591| 91.2k| return {size, shift, new_root, tail->inc()}; 592| 91.2k| } 593| 133k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4takeEm: 647| 22.6k| { 648| 22.6k| auto tail_off = tail_offset(); 649| 22.6k| if (new_size == 0) { ------------------ | Branch (649:13): [True: 3.43k, False: 19.2k] ------------------ 650| 3.43k| return {}; 651| 19.2k| } else if (new_size >= size) { ------------------ | Branch (651:20): [True: 1.04k, False: 18.2k] ------------------ 652| 1.04k| return *this; 653| 18.2k| } else if (new_size > tail_off) { ------------------ | Branch (653:20): [True: 1.72k, False: 16.4k] ------------------ 654| 1.72k| auto new_tail = node_t::copy_leaf(tail, new_size - tail_off); 655| 1.72k| return {new_size, shift, root->inc(), new_tail}; 656| 16.4k| } else { 657| 16.4k| using std::get; 658| 16.4k| auto l = new_size - 1; 659| 16.4k| auto v = slice_right_visitor(); 660| 16.4k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l); 661| 16.4k| auto new_shift = get<0>(r); 662| 16.4k| auto new_root = get<1>(r); 663| 16.4k| auto new_tail = get<3>(r); 664| 16.4k| if (new_root) { ------------------ | Branch (664:17): [True: 12.3k, False: 4.10k] ------------------ 665| 12.3k| IMMER_ASSERT_TAGGED(new_root->compute_shift() == get<0>(r)); ------------------ | | 68| 12.3k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (665:17): [True: 12.3k, False: 0] ------------------ 666| 12.3k| assert(new_root->check(new_shift, new_size - get<2>(r))); ------------------ | Branch (666:17): [True: 12.3k, False: 0] ------------------ 667| 12.3k| return {new_size, new_shift, new_root, new_tail}; 668| 12.3k| } else { 669| 4.10k| return {new_size, BL, empty_root(), new_tail}; 670| 4.10k| } 671| 16.4k| } 672| 22.6k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2ERKSB_: 151| 9.50k| : rrbtree{other.size, other.shift, other.root, other.tail} 152| 9.50k| { 153| 9.50k| inc(); 154| 9.50k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE3incEv: 187| 9.50k| { 188| 9.50k| root->inc(); 189| 9.50k| tail->inc(); 190| 9.50k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4dropEm: 711| 24.2k| { 712| 24.2k| if (elems == 0) { ------------------ | Branch (712:13): [True: 2.28k, False: 21.9k] ------------------ 713| 2.28k| return *this; 714| 21.9k| } else if (elems >= size) { ------------------ | Branch (714:20): [True: 2.00k, False: 19.9k] ------------------ 715| 2.00k| return {}; 716| 19.9k| } else if (elems == tail_offset()) { ------------------ | Branch (716:20): [True: 1.74k, False: 18.2k] ------------------ 717| 1.74k| return {size - elems, BL, empty_root(), tail->inc()}; 718| 18.2k| } else if (elems > tail_offset()) { ------------------ | Branch (718:20): [True: 1.75k, False: 16.4k] ------------------ 719| 1.75k| auto tail_off = tail_offset(); 720| 1.75k| auto new_tail = 721| 1.75k| node_t::copy_leaf(tail, elems - tail_off, size - tail_off); 722| 1.75k| return {size - elems, BL, empty_root(), new_tail}; 723| 16.4k| } else { 724| 16.4k| using std::get; 725| 16.4k| auto v = slice_left_visitor(); 726| 16.4k| auto r = 727| 16.4k| visit_maybe_relaxed_sub(root, shift, tail_offset(), v, elems); 728| 16.4k| auto new_root = get<1>(r); 729| 16.4k| auto new_shift = get<0>(r); 730| 16.4k| return {size - elems, new_shift, new_root, tail->inc()}; 731| 16.4k| } 732| 24.2k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8max_sizeEv: 54| 2.15M| { 55| 2.15M| auto S = sizeof(size_t) * 8; 56| 2.15M| return ((size_t{1} << BL) - std::min(size_t{BL}, size_t{2})) * 57| 2.15M| ipow((size_t{1} << B) - 2, (S - BL) / B); 58| 2.15M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6concatERKSB_: 735| 909k| { 736| 909k| assert(r.size + size <= max_size()); ------------------ | Branch (736:9): [True: 909k, False: 0] ------------------ 737| 909k| using std::get; 738| 909k| if (size == 0) ------------------ | Branch (738:13): [True: 2.38k, False: 906k] ------------------ 739| 2.38k| return r; 740| 906k| else if (r.size == 0) ------------------ | Branch (740:18): [True: 1.82k, False: 904k] ------------------ 741| 1.82k| return *this; 742| 904k| else if (r.tail_offset() == 0) { ------------------ | Branch (742:18): [True: 481k, False: 423k] ------------------ 743| | // just concat the tail, similar to push_back 744| 481k| auto tail_offst = tail_offset(); 745| 481k| auto tail_size = size - tail_offst; 746| 481k| if (tail_size == branches) { ------------------ | Branch (746:17): [True: 137k, False: 344k] ------------------ 747| 137k| auto new_root = 748| 137k| push_tail(root, shift, tail_offst, tail, tail_size); 749| 137k| tail->inc(); 750| 137k| return {size + r.size, 751| 137k| get<0>(new_root), 752| 137k| get<1>(new_root), 753| 137k| r.tail->inc()}; 754| 344k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (754:24): [True: 11.0k, False: 333k] ------------------ 755| 11.0k| auto new_tail = 756| 11.0k| node_t::copy_leaf(tail, tail_size, r.tail, r.size); 757| 11.0k| return {size + r.size, shift, root->inc(), new_tail}; 758| 333k| } else { 759| 333k| auto remaining = branches - tail_size; 760| 333k| auto add_tail = 761| 333k| node_t::copy_leaf(tail, tail_size, r.tail, remaining); 762| 333k| IMMER_TRY { ------------------ | | 49| 333k|#define IMMER_TRY try ------------------ 763| 333k| auto new_tail = 764| 333k| node_t::copy_leaf(r.tail, remaining, r.size); 765| 333k| IMMER_TRY { ------------------ | | 49| 333k|#define IMMER_TRY try ------------------ 766| 333k| auto new_root = push_tail( 767| 333k| root, shift, tail_offst, add_tail, branches); 768| 333k| return {size + r.size, 769| 333k| get<0>(new_root), 770| 333k| get<1>(new_root), 771| 333k| new_tail}; 772| 333k| } 773| 333k| 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| 333k| } 778| 333k| IMMER_CATCH (...) { 779| 0| node_t::delete_leaf(add_tail, branches); 780| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 781| 0| } 782| 333k| } 783| 481k| } else if (tail_offset() == 0) { ------------------ | Branch (783:20): [True: 3.60k, False: 419k] ------------------ 784| 3.60k| auto tail_offst = tail_offset(); 785| 3.60k| auto tail_size = size - tail_offst; 786| 3.60k| auto concated = 787| 3.60k| concat_trees(tail, tail_size, r.root, r.shift, r.tail_offset()); 788| 3.60k| auto new_shift = concated.shift(); 789| 3.60k| auto new_root = concated.node(); 790| 3.60k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 3.60k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (790:13): [True: 3.60k, False: 0] ------------------ 791| 3.60k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (791:13): [True: 3.60k, False: 0] ------------------ 792| 3.60k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 793| 419k| } else { 794| 419k| auto tail_offst = tail_offset(); 795| 419k| auto tail_size = size - tail_offst; 796| 419k| auto concated = concat_trees(root, 797| 419k| shift, 798| 419k| tail_offst, 799| 419k| tail, 800| 419k| tail_size, 801| 419k| r.root, 802| 419k| r.shift, 803| 419k| r.tail_offset()); 804| 419k| auto new_shift = concated.shift(); 805| 419k| auto new_root = concated.node(); 806| 419k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 419k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (806:13): [True: 419k, False: 0] ------------------ 807| 419k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (807:13): [True: 419k, False: 0] ------------------ 808| 419k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 809| 419k| } 810| 909k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13push_back_mutENS9_5applyIS6_E4type4editEi: 478| 31.4k| { 479| 31.4k| auto ts = tail_size(); 480| 31.4k| if (ts < branches) { ------------------ | Branch (480:13): [True: 18.6k, False: 12.7k] ------------------ 481| 18.6k| ensure_mutable_tail(e, ts); 482| 18.6k| new (&tail->leaf()[ts]) T(std::move(value)); 483| 18.6k| } else { 484| 12.7k| using std::get; 485| 12.7k| auto new_tail = node_t::make_leaf_e(e, std::move(value)); 486| 12.7k| auto tail_off = tail_offset(); 487| 12.7k| IMMER_TRY { ------------------ | | 49| 12.7k|#define IMMER_TRY try ------------------ 488| 12.7k| push_tail_mut(e, tail_off, tail, ts); 489| 12.7k| tail = new_tail; 490| 12.7k| } 491| 12.7k| 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.7k| } 496| 31.4k| ++size; 497| 31.4k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE19ensure_mutable_tailENS9_5applyIS6_E4type4editEj: 469| 185k| { 470| 185k| if (!tail->can_mutate(e)) { ------------------ | Branch (470:13): [True: 4.50k, False: 180k] ------------------ 471| 4.50k| auto new_tail = node_t::copy_leaf_e(e, tail, n); 472| 4.50k| dec_leaf(tail, n); 473| 4.50k| tail = new_tail; 474| 4.50k| } 475| 185k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13push_tail_mutENS9_5applyIS6_E4type4editEmPNS1_4nodeIiSA_Lj2ELj2EEEj: 417| 216k| { 418| 216k| if (auto r = root->relaxed()) { ------------------ | Branch (418:18): [True: 45.8k, False: 170k] ------------------ 419| 45.8k| auto new_root = 420| 45.8k| make_relaxed_pos(root, shift, r) 421| 45.8k| .visit(push_tail_mut_visitor{}, e, tail, tail_size); 422| 45.8k| if (new_root) { ------------------ | Branch (422:17): [True: 44.9k, False: 941] ------------------ 423| 44.9k| root = new_root; 424| 44.9k| } else { 425| 941| auto new_root = node_t::make_inner_r_e(e); 426| 941| IMMER_TRY { ------------------ | | 49| 941|#define IMMER_TRY try ------------------ 427| 941| auto new_path = node_t::make_path_e(e, shift, tail); 428| 941| new_root->inner()[0] = root; 429| 941| new_root->inner()[1] = new_path; 430| 941| new_root->relaxed()->d.sizes[0] = tail_off; 431| 941| new_root->relaxed()->d.sizes[1] = tail_off + tail_size; 432| 941| assert(tail_off); ------------------ | Branch (432:21): [True: 941, False: 0] ------------------ 433| 941| assert(tail_size); ------------------ | Branch (433:21): [True: 941, False: 0] ------------------ 434| 941| new_root->relaxed()->d.count = 2u; 435| 941| root = new_root; 436| 941| shift += B; 437| 941| } 438| 941| 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| 941| } 443| 170k| } else if (tail_off == size_t{branches} << shift) { ------------------ | Branch (443:20): [True: 2.23k, False: 168k] ------------------ 444| 2.23k| auto new_root = node_t::make_inner_e(e); 445| 2.23k| IMMER_TRY { ------------------ | | 49| 2.23k|#define IMMER_TRY try ------------------ 446| 2.23k| auto new_path = node_t::make_path_e(e, shift, tail); 447| 2.23k| new_root->inner()[0] = root; 448| 2.23k| new_root->inner()[1] = new_path; 449| 2.23k| root = new_root; 450| 2.23k| shift += B; 451| 2.23k| } 452| 2.23k| IMMER_CATCH (...) { 453| 0| node_t::delete_inner_e(new_root); 454| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 455| 0| } 456| 168k| } else if (tail_off) { ------------------ | Branch (456:20): [True: 165k, False: 2.41k] ------------------ 457| 165k| auto new_root = 458| 165k| make_regular_sub_pos(root, shift, tail_off) 459| 165k| .visit(push_tail_mut_visitor{}, e, tail); 460| 165k| root = new_root; 461| 165k| } else { 462| 2.41k| auto new_root = node_t::make_path_e(e, shift, tail); 463| 2.41k| dec_empty_regular(root); 464| 2.41k| root = new_root; 465| 2.41k| } 466| 216k| } 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| 28.4k| { 574| 28.4k| auto& elem = get_mut(e, idx); 575| 28.4k| elem = std::forward(fn)(std::move(elem)); 576| 28.4k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7get_mutENS9_5applyIS6_E4type4editEm: 539| 28.4k| { 540| 28.4k| auto tail_off = tail_offset(); 541| 28.4k| if (idx >= tail_off) { ------------------ | Branch (541:13): [True: 13.5k, False: 14.8k] ------------------ 542| 13.5k| ensure_mutable_tail(e, size - tail_off); 543| 13.5k| return tail->leaf()[(idx - tail_off) & mask]; 544| 14.8k| } else { 545| 14.8k| return visit_maybe_relaxed_sub(root, 546| 14.8k| shift, 547| 14.8k| tail_off, 548| 14.8k| get_mut_visitor{}, 549| 14.8k| idx, 550| 14.8k| e, 551| 14.8k| &root); 552| 14.8k| } 553| 28.4k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8take_mutENS9_5applyIS6_E4type4editEm: 606| 36.5k| { 607| 36.5k| auto tail_off = tail_offset(); 608| 36.5k| if (new_size == 0) { ------------------ | Branch (608:13): [True: 632, False: 35.9k] ------------------ 609| 632| *this = {}; 610| 35.9k| } else if (new_size >= size) { ------------------ | Branch (610:20): [True: 1.04k, False: 34.9k] ------------------ 611| 1.04k| return; 612| 34.9k| } else if (new_size > tail_off) { ------------------ | Branch (612:20): [True: 854, False: 34.0k] ------------------ 613| 854| auto ts = size - tail_off; 614| 854| auto newts = new_size - tail_off; 615| 854| if (tail->can_mutate(e)) { ------------------ | Branch (615:17): [True: 573, False: 281] ------------------ 616| 573| detail::destroy_n(tail->leaf() + newts, ts - newts); 617| 573| } else { 618| 281| auto new_tail = node_t::copy_leaf_e(e, tail, newts); 619| 281| dec_leaf(tail, ts); 620| 281| tail = new_tail; 621| 281| } 622| 854| size = new_size; 623| 854| return; 624| 34.0k| } else { 625| 34.0k| using std::get; 626| 34.0k| auto l = new_size - 1; 627| 34.0k| auto v = slice_right_mut_visitor(); 628| 34.0k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l, e); 629| 34.0k| auto new_shift = get<0>(r); 630| 34.0k| auto new_root = get<1>(r); 631| 34.0k| auto new_tail = get<3>(r); 632| 34.0k| if (new_root) { ------------------ | Branch (632:17): [True: 28.3k, False: 5.70k] ------------------ 633| 28.3k| root = new_root; 634| 28.3k| shift = new_shift; 635| 28.3k| } else { 636| 5.70k| root = empty_root(); 637| 5.70k| shift = BL; 638| 5.70k| } 639| 34.0k| dec_leaf(tail, size - tail_off); 640| 34.0k| size = new_size; 641| 34.0k| tail = new_tail; 642| 34.0k| return; 643| 34.0k| } 644| 36.5k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8drop_mutENS9_5applyIS6_E4type4editEm: 675| 45.1k| { 676| 45.1k| using std::get; 677| 45.1k| auto tail_off = tail_offset(); 678| 45.1k| if (elems == 0) { ------------------ | Branch (678:13): [True: 1.99k, False: 43.1k] ------------------ 679| 1.99k| return; 680| 43.1k| } else if (elems >= size) { ------------------ | Branch (680:20): [True: 269, False: 42.8k] ------------------ 681| 269| *this = {}; 682| 42.8k| } else if (elems == tail_off) { ------------------ | Branch (682:20): [True: 301, False: 42.5k] ------------------ 683| 301| dec_inner(root, shift, tail_off); 684| 301| shift = BL; 685| 301| root = empty_root(); 686| 301| size -= elems; 687| 301| return; 688| 42.5k| } else if (elems > tail_off) { ------------------ | Branch (688:20): [True: 678, False: 41.8k] ------------------ 689| 678| auto v = slice_left_mut_visitor(); 690| 678| tail = get<1>(make_leaf_sub_pos(tail, size - tail_off) 691| 678| .visit(v, elems - tail_off, e)); 692| 678| if (tail_off) { ------------------ | Branch (692:17): [True: 252, False: 426] ------------------ 693| 252| dec_inner(root, shift, tail_off); 694| 252| shift = BL; 695| 252| root = empty_root(); 696| 252| } 697| 678| size -= elems; 698| 678| return; 699| 41.8k| } else { 700| 41.8k| auto v = slice_left_mut_visitor(); 701| 41.8k| auto r = 702| 41.8k| visit_maybe_relaxed_sub(root, shift, tail_off, v, elems, e); 703| 41.8k| shift = get<0>(r); 704| 41.8k| root = get<1>(r); 705| 41.8k| size -= elems; 706| 41.8k| return; 707| 41.8k| } 708| 45.1k| } _ZN5immer6detail4rbts12concat_mut_lERNS1_7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS9_5applyIS6_E4type4editERKSB_: 816| 260k| { 817| 260k| assert(&l != &r); ------------------ | Branch (817:9): [True: 260k, False: 0] ------------------ 818| 260k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (818:9): [True: 260k, False: 0] ------------------ 819| 260k| using std::get; 820| 260k| if (l.size == 0) ------------------ | Branch (820:13): [True: 296, False: 260k] ------------------ 821| 296| l = r; 822| 260k| else if (r.size == 0) ------------------ | Branch (822:18): [True: 310, False: 260k] ------------------ 823| 310| return; 824| 260k| else if (r.tail_offset() == 0) { ------------------ | Branch (824:18): [True: 201k, False: 58.8k] ------------------ 825| | // just concat the tail, similar to push_back 826| 201k| auto tail_offst = l.tail_offset(); 827| 201k| auto tail_size = l.size - tail_offst; 828| 201k| if (tail_size == branches) { ------------------ | Branch (828:17): [True: 52.4k, False: 148k] ------------------ 829| 52.4k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 830| 52.4k| l.tail = r.tail->inc(); 831| 52.4k| l.size += r.size; 832| 52.4k| return; 833| 148k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (833:24): [True: 1.01k, False: 147k] ------------------ 834| 1.01k| l.ensure_mutable_tail(el, tail_size); 835| 1.01k| detail::uninitialized_copy(r.tail->leaf(), 836| 1.01k| r.tail->leaf() + r.size, 837| 1.01k| l.tail->leaf() + tail_size); 838| 1.01k| l.size += r.size; 839| 1.01k| return; 840| 147k| } else { 841| 147k| auto remaining = branches - tail_size; 842| 147k| l.ensure_mutable_tail(el, tail_size); 843| 147k| detail::uninitialized_copy(r.tail->leaf(), 844| 147k| r.tail->leaf() + remaining, 845| 147k| l.tail->leaf() + tail_size); 846| 147k| IMMER_TRY { ------------------ | | 49| 147k|#define IMMER_TRY try ------------------ 847| 147k| auto new_tail = 848| 147k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 849| 147k| IMMER_TRY { ------------------ | | 49| 147k|#define IMMER_TRY try ------------------ 850| 147k| l.push_tail_mut(el, tail_offst, l.tail, branches); 851| 147k| l.tail = new_tail; 852| 147k| l.size += r.size; 853| 147k| return; 854| 147k| } 855| 147k| 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| 147k| } 860| 147k| 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| 147k| } 865| 201k| } else if (l.tail_offset() == 0) { ------------------ | Branch (865:20): [True: 483, False: 58.3k] ------------------ 866| 483| if (supports_transient_concat) { ------------------ | Branch (866:17): [Folded, False: 483] ------------------ 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| 483| } else { 886| 483| auto tail_offst = l.tail_offset(); 887| 483| auto tail_size = l.size - tail_offst; 888| 483| auto concated = concat_trees( 889| 483| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 890| 483| l = {l.size + r.size, 891| 483| concated.shift(), 892| 483| concated.node(), 893| 483| r.tail->inc()}; 894| 483| assert(l.check_tree()); ------------------ | Branch (894:17): [True: 483, False: 0] ------------------ 895| 483| return; 896| 483| } 897| 58.3k| } else { 898| 58.3k| if (supports_transient_concat) { ------------------ | Branch (898:17): [Folded, False: 58.3k] ------------------ 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| 58.3k| } else { 923| 58.3k| auto tail_offst = l.tail_offset(); 924| 58.3k| auto tail_size = l.size - tail_offst; 925| 58.3k| auto concated = concat_trees(l.root, 926| 58.3k| l.shift, 927| 58.3k| tail_offst, 928| 58.3k| l.tail, 929| 58.3k| tail_size, 930| 58.3k| r.root, 931| 58.3k| r.shift, 932| 58.3k| r.tail_offset()); 933| 58.3k| l = {l.size + r.size, 934| 58.3k| concated.shift(), 935| 58.3k| concated.node(), 936| 58.3k| r.tail->inc()}; 937| 58.3k| } 938| 58.3k| } 939| 260k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEaSERKSB_: 163| 1.97k| { 164| 1.97k| auto next{other}; 165| 1.97k| swap(*this, next); 166| 1.97k| return *this; 167| 1.97k| } _ZN5immer6detail4rbts12concat_mut_rERKNS1_7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERSB_NS9_5applyIS6_E4type4editE: 942| 3.44k| { 943| 3.44k| assert(&l != &r); ------------------ | Branch (943:9): [True: 3.44k, False: 0] ------------------ 944| 3.44k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (944:9): [True: 3.44k, False: 0] ------------------ 945| 3.44k| using std::get; 946| 3.44k| if (r.size == 0) ------------------ | Branch (946:13): [True: 296, False: 3.14k] ------------------ 947| 296| r = std::move(l); 948| 3.14k| else if (l.size == 0) ------------------ | Branch (948:18): [True: 246, False: 2.89k] ------------------ 949| 246| return; 950| 2.89k| else if (r.tail_offset() == 0) { ------------------ | Branch (950:18): [True: 760, False: 2.13k] ------------------ 951| | // just concat the tail, similar to push_back 952| 760| auto tail_offst = l.tail_offset(); 953| 760| auto tail_size = l.size - tail_offst; 954| 760| if (tail_size == branches) { ------------------ | Branch (954:17): [True: 144, False: 616] ------------------ 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| 144| auto res = 959| 144| l.push_tail(l.root, l.shift, tail_offst, l.tail, tail_size); 960| 144| l.tail->inc(); // note: leak if mutably concatenated 961| | // with itself, but this is forbidden 962| | // by the interface 963| 144| r = {l.size + r.size, get<0>(res), get<1>(res), r.tail->inc()}; 964| 144| return; 965| 616| } else if (tail_size + r.size <= branches) { ------------------ | Branch (965:24): [True: 311, False: 305] ------------------ 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| 311| auto new_tail = 974| 311| node_t::copy_leaf(l.tail, tail_size, r.tail, r.size); 975| 311| r = {l.size + r.size, l.shift, l.root->inc(), new_tail}; 976| 311| return; 977| 311| } else { 978| | // like the immutable version 979| 305| auto remaining = branches - tail_size; 980| 305| auto add_tail = node_t::copy_leaf_e( 981| 305| er, l.tail, tail_size, r.tail, remaining); 982| 305| IMMER_TRY { ------------------ | | 49| 305|#define IMMER_TRY try ------------------ 983| 305| auto new_tail = 984| 305| node_t::copy_leaf_e(er, r.tail, remaining, r.size); 985| 305| IMMER_TRY { ------------------ | | 49| 305|#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| 305| auto new_root = l.push_tail(l.root, 990| 305| l.shift, 991| 305| tail_offst, 992| 305| add_tail, 993| 305| branches); 994| 305| r = {l.size + r.size, 995| 305| get<0>(new_root), 996| 305| get<1>(new_root), 997| 305| new_tail}; 998| 305| return; 999| 305| } 1000| 305| 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| 305| } 1005| 305| IMMER_CATCH (...) { 1006| 0| node_t::delete_leaf(add_tail, branches); 1007| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1008| 0| } 1009| 305| } 1010| 2.13k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1010:20): [True: 630, False: 1.50k] ------------------ 1011| 630| if (supports_transient_concat) { ------------------ | Branch (1011:17): [Folded, False: 630] ------------------ 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| 630| } else { 1030| 630| auto tail_offst = l.tail_offset(); 1031| 630| auto tail_size = l.size - tail_offst; 1032| 630| auto concated = concat_trees( 1033| 630| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1034| 630| r = {l.size + r.size, 1035| 630| concated.shift(), 1036| 630| concated.node(), 1037| 630| r.tail->inc()}; 1038| 630| return; 1039| 630| } 1040| 1.50k| } else { 1041| 1.50k| if (supports_transient_concat) { ------------------ | Branch (1041:17): [Folded, False: 1.50k] ------------------ 1042| 0| auto tail_offst = l.tail_offset(); 1043| 0| auto tail_size = l.size - tail_offst; 1044| 0| auto concated = 1045| 0| concat_trees_mut(er, 1046| 0| MemoryPolicy::transience_t::noone, 1047| 0| l.root, 1048| 0| l.shift, 1049| 0| tail_offst, 1050| 0| l.tail, 1051| 0| tail_size, 1052| 0| er, 1053| 0| r.root, 1054| 0| r.shift, 1055| 0| r.tail_offset()); 1056| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 68| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (1056:17): [True: 0, False: 0] ------------------ 1057| 0| concated.node()->compute_shift()); 1058| 0| r.size += l.size; 1059| 0| r.shift = concated.shift(); 1060| 0| r.root = concated.node(); 1061| 0| assert(r.check_tree()); ------------------ | Branch (1061:17): [True: 0, False: 0] ------------------ 1062| 0| return; 1063| 1.50k| } else { 1064| 1.50k| auto tail_offst = l.tail_offset(); 1065| 1.50k| auto tail_size = l.size - tail_offst; 1066| 1.50k| auto concated = concat_trees(l.root, 1067| 1.50k| l.shift, 1068| 1.50k| tail_offst, 1069| 1.50k| l.tail, 1070| 1.50k| tail_size, 1071| 1.50k| r.root, 1072| 1.50k| r.shift, 1073| 1.50k| r.tail_offset()); 1074| 1.50k| r = {l.size + r.size, 1075| 1.50k| concated.shift(), 1076| 1.50k| concated.node(), 1077| 1.50k| r.tail->inc()}; 1078| 1.50k| return; 1079| 1.50k| } 1080| 1.50k| } 1081| 3.44k| } _ZN5immer6detail4rbts15concat_mut_lr_lERNS1_7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS9_5applyIS6_E4type4editESC_SG_: 1084| 22.9k| { 1085| 22.9k| assert(&l != &r); ------------------ | Branch (1085:9): [True: 22.9k, False: 0] ------------------ 1086| 22.9k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (1086:9): [True: 22.9k, False: 0] ------------------ 1087| 22.9k| using std::get; 1088| 22.9k| if (l.size == 0) ------------------ | Branch (1088:13): [True: 1.37k, False: 21.5k] ------------------ 1089| 1.37k| l = r; 1090| 21.5k| else if (r.size == 0) ------------------ | Branch (1090:18): [True: 1.32k, False: 20.2k] ------------------ 1091| 1.32k| return; 1092| 20.2k| else if (r.tail_offset() == 0) { ------------------ | Branch (1092:18): [True: 4.97k, False: 15.3k] ------------------ 1093| | // just concat the tail, similar to push_back 1094| 4.97k| auto tail_offst = l.tail_offset(); 1095| 4.97k| auto tail_size = l.size - tail_offst; 1096| 4.97k| if (tail_size == branches) { ------------------ | Branch (1096:17): [True: 835, False: 4.13k] ------------------ 1097| 835| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 1098| 835| l.tail = r.tail->inc(); 1099| 835| l.size += r.size; 1100| 835| return; 1101| 4.13k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (1101:24): [True: 1.74k, False: 2.39k] ------------------ 1102| 1.74k| l.ensure_mutable_tail(el, tail_size); 1103| 1.74k| if (r.tail->can_mutate(er)) ------------------ | Branch (1103:21): [True: 609, False: 1.13k] ------------------ 1104| 609| detail::uninitialized_move(r.tail->leaf(), 1105| 609| r.tail->leaf() + r.size, 1106| 609| l.tail->leaf() + tail_size); 1107| 1.13k| else 1108| 1.13k| detail::uninitialized_copy(r.tail->leaf(), 1109| 1.13k| r.tail->leaf() + r.size, 1110| 1.13k| l.tail->leaf() + tail_size); 1111| 1.74k| l.size += r.size; 1112| 1.74k| return; 1113| 2.39k| } else { 1114| 2.39k| auto remaining = branches - tail_size; 1115| 2.39k| l.ensure_mutable_tail(el, tail_size); 1116| 2.39k| if (r.tail->can_mutate(er)) ------------------ | Branch (1116:21): [True: 953, False: 1.43k] ------------------ 1117| 953| detail::uninitialized_move(r.tail->leaf(), 1118| 953| r.tail->leaf() + remaining, 1119| 953| l.tail->leaf() + tail_size); 1120| 1.43k| else 1121| 1.43k| detail::uninitialized_copy(r.tail->leaf(), 1122| 1.43k| r.tail->leaf() + remaining, 1123| 1.43k| l.tail->leaf() + tail_size); 1124| 2.39k| IMMER_TRY { ------------------ | | 49| 2.39k|#define IMMER_TRY try ------------------ 1125| 2.39k| auto new_tail = 1126| 2.39k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 1127| 2.39k| IMMER_TRY { ------------------ | | 49| 2.39k|#define IMMER_TRY try ------------------ 1128| 2.39k| l.push_tail_mut(el, tail_offst, l.tail, branches); 1129| 2.39k| l.tail = new_tail; 1130| 2.39k| l.size += r.size; 1131| 2.39k| return; 1132| 2.39k| } 1133| 2.39k| 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.39k| } 1138| 2.39k| 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.39k| } 1143| 15.3k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1143:20): [True: 3.13k, False: 12.1k] ------------------ 1144| 3.13k| if (supports_transient_concat) { ------------------ | Branch (1144:17): [Folded, False: 3.13k] ------------------ 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.13k| } else { 1165| 3.13k| auto tail_offst = l.tail_offset(); 1166| 3.13k| auto tail_size = l.size - tail_offst; 1167| 3.13k| auto concated = concat_trees( 1168| 3.13k| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1169| 3.13k| l = {l.size + r.size, 1170| 3.13k| concated.shift(), 1171| 3.13k| concated.node(), 1172| 3.13k| r.tail->inc()}; 1173| 3.13k| return; 1174| 3.13k| } 1175| 12.1k| } else { 1176| 12.1k| if (supports_transient_concat) { ------------------ | Branch (1176:17): [Folded, False: 12.1k] ------------------ 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.1k| } else { 1200| 12.1k| auto tail_offst = l.tail_offset(); 1201| 12.1k| auto tail_size = l.size - tail_offst; 1202| 12.1k| auto concated = concat_trees(l.root, 1203| 12.1k| l.shift, 1204| 12.1k| tail_offst, 1205| 12.1k| l.tail, 1206| 12.1k| tail_size, 1207| 12.1k| r.root, 1208| 12.1k| r.shift, 1209| 12.1k| r.tail_offset()); 1210| 12.1k| l = {l.size + r.size, 1211| 12.1k| concated.shift(), 1212| 12.1k| concated.node(), 1213| 12.1k| r.tail->inc()}; 1214| 12.1k| return; 1215| 12.1k| } 1216| 12.1k| } 1217| 22.9k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6equalsERKSB_: 315| 28.1k| { 316| 28.1k| using iter_t = rrbtree_iterator; 317| 28.1k| if (size != other.size) ------------------ | Branch (317:13): [True: 9.09k, False: 19.0k] ------------------ 318| 9.09k| return false; 319| 19.0k| if (size == 0) ------------------ | Branch (319:13): [True: 209, False: 18.8k] ------------------ 320| 209| return true; 321| 18.8k| auto tail_off = tail_offset(); 322| 18.8k| auto tail_off_other = other.tail_offset(); 323| | // compare trees 324| 18.8k| if (tail_off > 0 && tail_off_other > 0) { ------------------ | Branch (324:13): [True: 17.9k, False: 900] | Branch (324:29): [True: 17.7k, False: 196] ------------------ 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| 17.7k| if (other.shift >= shift) { ------------------ | Branch (328:17): [True: 16.9k, False: 745] ------------------ 329| 16.9k| if (!visit_maybe_relaxed_sub(other.root, ------------------ | Branch (329:21): [True: 8.11k, False: 8.86k] ------------------ 330| 16.9k| other.shift, 331| 16.9k| tail_off_other, 332| 16.9k| equals_visitor::rrb{}, 333| 16.9k| iter_t{other}, 334| 16.9k| root, 335| 16.9k| shift, 336| 16.9k| tail_off)) 337| 8.11k| return false; 338| 16.9k| } else { 339| 745| if (!visit_maybe_relaxed_sub(root, ------------------ | Branch (339:21): [True: 396, False: 349] ------------------ 340| 745| shift, 341| 745| tail_off, 342| 745| equals_visitor::rrb{}, 343| 745| iter_t{*this}, 344| 745| other.root, 345| 745| other.shift, 346| 745| tail_off_other)) 347| 396| return false; 348| 745| } 349| 17.7k| } 350| 10.3k| return tail_off == tail_off_other ------------------ | Branch (350:16): [True: 6.21k, False: 4.09k] ------------------ 351| 10.3k| ? make_leaf_sub_pos(tail, tail_size()) 352| 6.21k| .visit(equals_visitor{}, other.tail) 353| 10.3k| : tail_off > tail_off_other ------------------ | Branch (353:18): [True: 1.81k, False: 2.28k] ------------------ 354| 4.09k| ? std::equal(tail->leaf(), 355| 1.81k| tail->leaf() + (size - tail_off), 356| 1.81k| other.tail->leaf() + 357| 1.81k| (tail_off - tail_off_other)) 358| | /* otherwise */ 359| 4.09k| : std::equal(tail->leaf(), 360| 2.28k| tail->leaf() + (size - tail_off), 361| 2.28k| iter_t{other} + tail_off); 362| 18.8k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10region_forEm: 524| 1.30M| { 525| 1.30M| using std::get; 526| 1.30M| auto tail_off = tail_offset(); 527| 1.30M| if (idx >= tail_off) { ------------------ | Branch (527:13): [True: 4.30k, False: 1.29M] ------------------ 528| 4.30k| return std::make_tuple(tail->leaf(), tail_off, size); 529| 1.29M| } else { 530| 1.29M| auto subs = visit_maybe_relaxed_sub( 531| 1.29M| root, shift, tail_off, region_for_visitor(), idx); 532| 1.29M| auto first = idx - get<1>(subs); 533| 1.29M| auto end = first + get<2>(subs); 534| 1.29M| return std::make_tuple(get<0>(subs), first, end); 535| 1.29M| } 536| 1.30M| } _ZNK5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11dereferenceEv: 90| 5.16M| { 91| 5.16M| using std::get; 92| 5.16M| if (i_ < get<1>(curr_) || i_ >= get<2>(curr_)) ------------------ | Branch (92:13): [True: 38.6k, False: 5.12M] | Branch (92:35): [True: 1.26M, False: 3.86M] ------------------ 93| 1.30M| curr_ = v_->region_for(i_); 94| 5.16M| return get<0>(curr_)[i_ - get<1>(curr_)]; 95| 5.16M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7advanceEl: 74| 232k| { 75| 232k| using std::get; 76| 232k| assert(n <= 0 || i_ + static_cast(n) <= v_->size); ------------------ | Branch (76:9): [True: 421, False: 231k] | Branch (76:9): [True: 231k, False: 0] | Branch (76:9): [True: 232k, False: 0] ------------------ 77| 232k| assert(n >= 0 || static_cast(-n) <= i_); ------------------ | Branch (77:9): [True: 232k, False: 0] | Branch (77:9): [True: 0, False: 0] | Branch (77:9): [True: 232k, False: 0] ------------------ 78| 232k| i_ += n; 79| 232k| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9incrementEv: 60| 3.88M| { 61| 3.88M| using std::get; 62| 3.88M| assert(i_ < v_->size); ------------------ | Branch (62:9): [True: 3.88M, False: 0] ------------------ 63| 3.88M| ++i_; 64| 3.88M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2ERKNS1_7rrbtreeIiSA_Lj2ELj2EEE: 39| 20.0k| : v_{&v} 40| 20.0k| , i_{0} 41| 20.0k| , curr_{nullptr, ~size_t{}, ~size_t{}} 42| 20.0k| { 43| 20.0k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERmEEEDcDpOT_: 31| 14.4k| { 32| 14.4k| return Deriv::visit_inner(std::forward(args)...); 33| 14.4k| } _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| 43.8k| { 32| 43.8k| return Deriv::visit_inner(std::forward(args)...); 33| 43.8k| } _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.01k| { 38| 2.01k| return Deriv::visit_inner(std::forward(args)...); 39| 2.01k| } _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.19k| { 38| 5.19k| return Deriv::visit_inner(std::forward(args)...); 39| 5.19k| } _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.61k| { 38| 6.61k| return Deriv::visit_inner(std::forward(args)...); 39| 6.61k| } _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.39k| { 38| 2.39k| return Deriv::visit_inner(std::forward(args)...); 39| 2.39k| } _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.85k| { 38| 7.85k| return Deriv::visit_inner(std::forward(args)...); 39| 7.85k| } _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.85k| { 44| 7.85k| return Deriv::visit_node(std::forward(args)...); 45| 7.85k| } _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.52k| { 32| 5.52k| return Deriv::visit_inner(std::forward(args)...); 33| 5.52k| } _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.52k| { 44| 5.52k| return Deriv::visit_node(std::forward(args)...); 45| 5.52k| } _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.33M| { 50| 2.33M| return Deriv::visit_node(std::forward(args)...); 51| 2.33M| } _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| 19.7M| { 32| 19.7M| return Deriv::visit_inner(std::forward(args)...); 33| 19.7M| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE11visit_innerIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_21concat_rebalance_planILj2ELj2EEEEEEDcDpOT_: 43| 19.7M| { 44| 19.7M| return Deriv::visit_node(std::forward(args)...); 45| 19.7M| } _ZN5immer6detail4rbts12visitor_baseINS1_21concat_merger_visitorEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_13concat_mergerISG_EEEEEDcDpOT_: 31| 19.7M| { 32| 19.7M| return Deriv::visit_inner(std::forward(args)...); 33| 19.7M| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 31| 18.6k| { 32| 18.6k| return Deriv::visit_inner(std::forward(args)...); 33| 18.6k| } _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| 408| { 38| 408| return Deriv::visit_inner(std::forward(args)...); 39| 408| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_8full_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 37| 1.14k| { 38| 1.14k| return Deriv::visit_inner(std::forward(args)...); 39| 1.14k| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE10visit_leafIJRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_21concat_rebalance_planILj2ELj2EEEEEEDcDpOT_: 49| 1.00M| { 50| 1.00M| return Deriv::visit_node(std::forward(args)...); 51| 1.00M| } _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| 704k| { 38| 704k| return Deriv::visit_inner(std::forward(args)...); 39| 704k| } _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| 704k| { 44| 704k| return Deriv::visit_node(std::forward(args)...); 45| 704k| } _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| 704k| { 38| 704k| return Deriv::visit_inner(std::forward(args)...); 39| 704k| } _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| 648k| { 38| 648k| return Deriv::visit_inner(std::forward(args)...); 39| 648k| } _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| 648k| { 44| 648k| return Deriv::visit_node(std::forward(args)...); 45| 648k| } _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| 648k| { 38| 648k| return Deriv::visit_inner(std::forward(args)...); 39| 648k| } _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.33k| { 38| 2.33k| return Deriv::visit_inner(std::forward(args)...); 39| 2.33k| } _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.33k| { 44| 2.33k| return Deriv::visit_node(std::forward(args)...); 45| 2.33k| } _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| 477k| { 32| 477k| return Deriv::visit_inner(std::forward(args)...); 33| 477k| } _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| 477k| { 44| 477k| return Deriv::visit_node(std::forward(args)...); 45| 477k| } _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| 452k| { 32| 452k| return Deriv::visit_inner(std::forward(args)...); 33| 452k| } _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| 452k| { 44| 452k| return Deriv::visit_node(std::forward(args)...); 45| 452k| } _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.02M| { 32| 2.02M| return Deriv::visit_inner(std::forward(args)...); 33| 2.02M| } _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.81k| { 38| 5.81k| return Deriv::visit_inner(std::forward(args)...); 39| 5.81k| } _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| 602k| { 32| 602k| return Deriv::visit_inner(std::forward(args)...); 33| 602k| } _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| 103k| { 38| 103k| return Deriv::visit_inner(std::forward(args)...); 39| 103k| } _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.17k| { 38| 1.17k| return Deriv::visit_inner(std::forward(args)...); 39| 1.17k| } _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| 122k| { 38| 122k| return Deriv::visit_inner(std::forward(args)...); 39| 122k| } _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| 58.3k| { 38| 58.3k| return Deriv::visit_inner(std::forward(args)...); 39| 58.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_EESJ_EEEDcDpOT_: 37| 63.1k| { 38| 63.1k| return Deriv::visit_inner(std::forward(args)...); 39| 63.1k| } _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| 696k| { 38| 696k| return Deriv::visit_inner(std::forward(args)...); 39| 696k| } _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.76M| { 32| 1.76M| return Deriv::visit_inner(std::forward(args)...); 33| 1.76M| } _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| 7.46k| { 38| 7.46k| return Deriv::visit_inner(std::forward(args)...); 39| 7.46k| } _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| 129k| { 32| 129k| return Deriv::visit_inner(std::forward(args)...); 33| 129k| } _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| 12.5k| { 38| 12.5k| return Deriv::visit_inner(std::forward(args)...); 39| 12.5k| } _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| 5.17k| { 32| 5.17k| return Deriv::visit_inner(std::forward(args)...); 33| 5.17k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EERNS1_15regular_sub_posISD_EEEEEDcDpOT_: 31| 6.40k| { 32| 6.40k| return Deriv::visit_inner(std::forward(args)...); 33| 6.40k| } _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.66M| { 32| 1.66M| return Deriv::visit_inner(std::forward(args)...); 33| 1.66M| } _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| 25.0k| { 38| 25.0k| return Deriv::visit_inner(std::forward(args)...); 39| 25.0k| } _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| 25.0k| { 44| 25.0k| return Deriv::visit_node(std::forward(args)...); 45| 25.0k| } _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| 13.9k| { 38| 13.9k| return Deriv::visit_inner(std::forward(args)...); 39| 13.9k| } _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| 13.9k| { 44| 13.9k| return Deriv::visit_node(std::forward(args)...); 45| 13.9k| } _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| 5.98k| { 32| 5.98k| return Deriv::visit_inner(std::forward(args)...); 33| 5.98k| } _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| 5.98k| { 44| 5.98k| return Deriv::visit_node(std::forward(args)...); 45| 5.98k| } _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| 8.00k| { 38| 8.00k| return Deriv::visit_inner(std::forward(args)...); 39| 8.00k| } _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| 8.00k| { 44| 8.00k| return Deriv::visit_node(std::forward(args)...); 45| 8.00k| } _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| 10.9k| { 32| 10.9k| return Deriv::visit_inner(std::forward(args)...); 33| 10.9k| } _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| 10.9k| { 44| 10.9k| return Deriv::visit_node(std::forward(args)...); 45| 10.9k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERjSJ_RNS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERmEEEDcDpOT_: 31| 19.7k| { 32| 19.7k| return Deriv::visit_inner(std::forward(args)...); 33| 19.7k| } _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.39k| { 32| 2.39k| return Deriv::visit_inner(std::forward(args)...); 33| 2.39k| } _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| 915| { 32| 915| return Deriv::visit_inner(std::forward(args)...); 33| 915| } _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.15k| { 38| 1.15k| return Deriv::visit_inner(std::forward(args)...); 39| 1.15k| } _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| 8.84M| { 32| 8.84M| return Deriv::visit_inner(std::forward(args)...); 33| 8.84M| } _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| 343k| { 38| 343k| return Deriv::visit_inner(std::forward(args)...); 39| 343k| } _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| 925k| { 38| 925k| return Deriv::visit_inner(std::forward(args)...); 39| 925k| } _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| 101k| { 38| 101k| return Deriv::visit_inner(std::forward(args)...); 39| 101k| } _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| 85.7k| { 38| 85.7k| return Deriv::visit_inner(std::forward(args)...); 39| 85.7k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERjSJ_RNS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERmEEEDcDpOT_: 37| 753| { 38| 753| return Deriv::visit_inner(std::forward(args)...); 39| 753| } _ZN5immer6detail4rbts12visitor_baseINS1_24for_each_chunk_p_visitorEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSF_Lj2ELj2EEEEEDaOT_EUlSN_T0_E_EEEDcDpOT_: 37| 18.7k| { 38| 18.7k| return Deriv::visit_inner(std::forward(args)...); 39| 18.7k| } _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.53k| { 38| 6.53k| return Deriv::visit_inner(std::forward(args)...); 39| 6.53k| } _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.36k| { 38| 2.36k| return Deriv::visit_inner(std::forward(args)...); 39| 2.36k| } _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| 3.05k| { 38| 3.05k| return Deriv::visit_inner(std::forward(args)...); 39| 3.05k| } _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| 579k| { 32| 579k| return Deriv::visit_inner(std::forward(args)...); 33| 579k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERPSH_RjRmEEEDcDpOT_: 31| 1.40k| { 32| 1.40k| return Deriv::visit_inner(std::forward(args)...); 33| 1.40k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE11visit_innerIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERPSH_RjRmEEEDcDpOT_: 43| 1.40k| { 44| 1.40k| return Deriv::visit_node(std::forward(args)...); 45| 1.40k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERKPSH_RKjRmEEEDcDpOT_: 37| 6.75k| { 38| 6.75k| return Deriv::visit_inner(std::forward(args)...); 39| 6.75k| } _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.75k| { 44| 6.75k| return Deriv::visit_node(std::forward(args)...); 45| 6.75k| } _ZN5immer6detail15auto_const_castINS_15refcount_policyEEERT_RKS3_: 143| 112M|{ 144| 112M| return const_cast(x); 145| 112M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7inner_tEPSC_Lb0EE15get_storage_ptrEv: 113| 107M| { 114| 107M| check_base(); 115| 107M| auto* base = static_cast(this); 116| 107M| return reinterpret_cast(base + 1); 117| 107M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7inner_tEPSC_Lb0EE10check_baseEv: 134| 107M| { 135| 107M| static_assert(std::is_standard_layout::value && 136| 107M| !std::is_empty::value, 137| 107M| "Please add 'true' if the derived class is emtpy"); 138| 107M| } _ZN5immer6detail9static_ifILb1EZNS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14delete_inner_rEPSC_jEUlT_E_EENSt3__19enable_ifIXT_EvE4typeEOT0_: 329| 11.1M|{ 330| 11.1M| std::forward(f)(empty_t{}); 331| 11.1M|} _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.5M| { 76| 10.5M| check_base(); 77| 10.5M| return reinterpret_cast(this); 78| 10.5M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6leaf_tEiLb1EE10check_baseEv: 94| 10.5M| { 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.5M| static_assert(std::is_standard_layout::value, 100| 10.5M| "Please remove 'true' if the derived class is non emtpy"); 101| 10.5M| } _ZN5immer6detail18uninitialized_copyIPiS2_S2_EENSt3__19enable_ifIX18can_trivially_copyIT_T1_EES6_E4typeES5_T0_S6_: 236| 1.89M|{ 237| 1.89M| return std::copy(first, last, out); 238| 1.89M|} _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| 270k|{ 345| 270k| return std::forward(f2)(empty_t{}); 346| 270k|} _ZN5immer6detail4ipowImEET_S2_j: 323| 69.0M|{ 324| 69.0M| return pow == 0 ? 1 : num * ipow(num, pow - 1); ------------------ | Branch (324:12): [True: 2.15M, False: 66.8M] ------------------ 325| 69.0M|} _ZN5immer6detail9static_ifILb0EPNS0_3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14relaxed_data_tENS2_6memberISA_NS2_7inheritINSC_5applyIS9_E4type5owneeEvE4typeEE4typeEE4typeEZNSE_24ensure_mutable_relaxed_nENSK_4editEjEUlT_E_ZNSE_24ensure_mutable_relaxed_nEST_jEUlSU_E0_EENSt3__19enable_ifIXntT_ET0_E4typeEOT1_OT2_: 344| 67.4k|{ 345| 67.4k| return std::forward(f2)(empty_t{}); 346| 67.4k|} _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| 121k|{ 330| 121k| std::forward(f)(empty_t{}); 331| 121k|} _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| 8.61k|{ 345| 8.61k| return std::forward(f2)(empty_t{}); 346| 8.61k|} _ZN5immer6detail9destroy_nIPimEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 573|{ 189| 573| return first + n; 190| 573|} _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| 168k|{ 345| 168k| return std::forward(f2)(empty_t{}); 346| 168k|} _ZN5immer6detail18uninitialized_moveIPiS2_EENSt3__19enable_ifIX18can_trivially_copyIT_T0_EES6_E4typeES5_S5_S6_: 210| 1.56k|{ 211| 1.56k| return std::copy(first, last, out); 212| 1.56k|} _ZN5immer6detail8as_constIiEEPKT_PS2_: 29| 1.27M|{ 30| 1.27M| return x; 31| 1.27M|} _ZN5immer6detail4makeINS_15debug_size_heapINS_8cpp_heapEEENS_3boxIiNS_13memory_policyINS_21free_list_heap_policyIS3_Lm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderEJiEEEPT0_DpOT1_: 260| 17.9k|{ 261| 17.9k| auto ptr = Heap::allocate(sizeof(T)); 262| 17.9k| IMMER_TRY { ------------------ | | 49| 17.9k|#define IMMER_TRY try ------------------ 263| 17.9k| return new (ptr) T(std::forward(args)...); 264| 17.9k| } 265| 17.9k| IMMER_CATCH (...) { 266| 0| Heap::deallocate(sizeof(T), ptr); 267| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 268| 0| } 269| 17.9k|} _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2Ev: 96| 71.0k| flex_vector() = default; _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9push_backEi: 246| 400k| { 247| 400k| return impl_.push_back(std::move(value)); 248| 400k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2ENS_6detail4rbts7rrbtreeIiS8_Lj2ELj2EEE: 536| 1.48M| : impl_(std::move(impl)) 537| 1.48M| { 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.48M| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4sizeEv: 181| 2.83M| 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| 133k| { 324| 133k| return impl_.update(index, std::forward(fn)); 325| 133k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4takeEm: 350| 22.6k| { 351| 22.6k| return impl_.take(elems); 352| 22.6k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4dropEm: 376| 24.2k| { 377| 24.2k| return impl_.drop(elems); 378| 24.2k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8max_sizeEv: 90| 1.24M| constexpr static size_type max_size() { return impl_t::max_size(); } _ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEESB_: 403| 909k| { 404| 909k| return l.impl_.concat(r.impl_); 405| 909k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9push_backEi: 251| 31.4k| { 252| 31.4k| return push_back_move(move_t{}, std::move(value)); 253| 31.4k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14push_back_moveENSt3__117integral_constantIbLb1EEEi: 547| 31.4k| { 548| 31.4k| impl_.push_back_mut({}, std::move(value)); 549| 31.4k| return std::move(*this); 550| 31.4k| } 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| 28.4k| { 330| 28.4k| return update_move(move_t{}, index, std::forward(fn)); 331| 28.4k| } 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| 28.4k| { 569| 28.4k| impl_.update_mut({}, index, std::forward(fn)); 570| 28.4k| return std::move(*this); 571| 28.4k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4takeEm: 355| 36.5k| { 356| 36.5k| return take_move(move_t{}, elems); 357| 36.5k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9take_moveENSt3__117integral_constantIbLb1EEEm: 579| 36.5k| { 580| 36.5k| impl_.take_mut({}, elems); 581| 36.5k| return std::move(*this); 582| 36.5k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4dropEm: 381| 45.1k| { 382| 45.1k| return drop_move(move_t{}, elems); 383| 45.1k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9drop_moveENSt3__117integral_constantIbLb1EEEm: 589| 45.1k| { 590| 45.1k| impl_.drop_mut({}, elems); 591| 45.1k| return std::move(*this); 592| 45.1k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERKS9_: 409| 260k| { 410| 260k| return concat_move(move_t{}, std::move(l), r); 411| 260k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_RKS9_: 600| 260k| { 601| 260k| concat_mut_l(l.impl_, {}, r.impl_); 602| 260k| return std::move(l); 603| 260k| } _ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEOS9_: 415| 3.44k| { 416| 3.44k| return concat_move(move_t{}, l, std::move(r)); 417| 3.44k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11concat_moveENSt3__117integral_constantIbLb1EEERKS9_OS9_: 606| 3.44k| { 607| 3.44k| concat_mut_r(l.impl_, r.impl_, {}); 608| 3.44k| return std::move(r); 609| 3.44k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEESA_: 421| 22.9k| { 422| 22.9k| return concat_move(move_t{}, std::move(l), std::move(r)); 423| 22.9k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_SD_: 612| 22.9k| { 613| 22.9k| concat_mut_lr_l(l.impl_, {}, r.impl_, {}); 614| 22.9k| return std::move(l); 615| 22.9k| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEeqERKS9_: 222| 28.1k| { 223| 28.1k| return impl_.equals(other.impl_); 224| 28.1k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5eraseEm: 480| 3.30k| { 481| 3.30k| return take(pos) + drop(pos + 1); 482| 3.30k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6insertEmi: 442| 17.9k| { 443| 17.9k| return take(pos).push_back(std::move(value)) + drop(pos); 444| 17.9k| } _ZN5immer8cpp_heap10deallocateEmPv: 36| 9.81M| static void deallocate(std::size_t, void* data) { ::operator delete(data); } _ZN5immer8cpp_heap8allocateIJEEEPvmDpT_: 27| 9.81M| { 28| 9.81M| return ::operator new(size); 29| 9.81M| } _ZN5immer15debug_size_heapINS_8cpp_heapEE10deallocateIJEEEvmPvDpT_: 57| 9.81M| { 58| 9.81M| auto p = (std::size_t*) (((char*) data) - extra_size); 59| 9.81M| assert(*p == size); ------------------ | Branch (59:9): [True: 9.81M, False: 0] ------------------ 60| 9.81M| Base::deallocate(size + extra_size, p, tags...); 61| 9.81M| } _ZN5immer15debug_size_heapINS_8cpp_heapEE8allocateIJEEEPvmDpT_: 49| 9.81M| { 50| 9.81M| auto p = (std::size_t*) Base::allocate(size + extra_size, tags...); 51| 9.81M| new (p) std::size_t{size}; 52| 9.81M| return ((char*) p) + extra_size; 53| 9.81M| } _ZN5immer14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEE10deallocateIJEEEvmPvDpT_: 56| 10.3M| { 57| 10.3M| assert(size <= Size); ------------------ | Branch (57:9): [True: 10.3M, False: 0] ------------------ 58| | 59| | // we use relaxed, because we are fine with temporarily having 60| | // a few more/less buffers in free list 61| 10.3M| if (head().count.load(std::memory_order_relaxed) >= Limit) { ------------------ | Branch (61:13): [True: 9.79M, False: 563k] ------------------ 62| 9.79M| base_t::deallocate(Size, data); 63| 9.79M| } else { 64| 563k| auto n = static_cast(data); 65| 563k| do { 66| 563k| n->next = head().data; 67| 563k| } while (!head().data.compare_exchange_weak(n->next, n)); ------------------ | Branch (67:22): [True: 0, False: 563k] ------------------ 68| 563k| head().count.fetch_add(1u, std::memory_order_relaxed); 69| 563k| } 70| 10.3M| } _ZN5immer14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEE4headEv: 80| 23.5M| { 81| 23.5M| static head_t head_{{nullptr}, {0}}; 82| 23.5M| return head_; 83| 23.5M| } _ZN5immer14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEE8allocateIJEEEPvmDpT_: 39| 10.3M| { 40| 10.3M| assert(size <= Size); ------------------ | Branch (40:9): [True: 10.3M, False: 0] ------------------ 41| | 42| 10.3M| node_t* n; 43| 10.3M| do { 44| 10.3M| n = head().data; 45| 10.3M| if (!n) { ------------------ | Branch (45:17): [True: 9.80M, False: 562k] ------------------ 46| 9.80M| auto p = base_t::allocate(Size); 47| 9.80M| return p; 48| 9.80M| } 49| 10.3M| } while (!head().data.compare_exchange_weak(n, n->next)); ------------------ | Branch (49:18): [True: 0, False: 562k] ------------------ 50| 562k| head().count.fetch_sub(1u, std::memory_order_relaxed); 51| 562k| return n; 52| 10.3M| } _ZN5immer10split_heapILm56ENS_27thread_local_free_list_heapILm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEEES5_E10deallocateIJEEEvmPvDpT_: 33| 26.8M| { 34| 26.8M| if (size <= Size) ------------------ | Branch (34:13): [True: 26.8M, False: 0] ------------------ 35| 26.8M| SmallHeap::deallocate(size, data, tags...); 36| 0| else 37| 0| BigHeap::deallocate(size, data, tags...); 38| 26.8M| } _ZN5immer10split_heapILm56ENS_27thread_local_free_list_heapILm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEEES5_E8allocateIJEEEPvmDpT_: 26| 15.9M| { 27| 15.9M| return size <= Size ? SmallHeap::allocate(size, tags...) ------------------ | Branch (27:16): [True: 15.9M, False: 0] ------------------ 28| 15.9M| : BigHeap::allocate(size, tags...); 29| 15.9M| } _ZN5immer10split_heapILm56ENS_27thread_local_free_list_heapILm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEEES5_E8allocateIJNS_10norefs_tagEEEEPvmDpT_: 26| 10.8M| { 27| 10.8M| return size <= Size ? SmallHeap::allocate(size, tags...) ------------------ | Branch (27:16): [True: 10.8M, False: 0] ------------------ 28| 10.8M| : BigHeap::allocate(size, tags...); 29| 10.8M| } _ZN5immer6detail30thread_local_free_list_storageINS0_26unsafe_free_list_heap_implIS1_Lm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEEEE4headEv: 35| 135M| { 36| 135M| thread_local static head_t head_{nullptr, 0}; 37| 135M| return head_; 38| 135M| } _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| 26.8M| { 73| 26.8M| assert(size <= Size); ------------------ | Branch (73:9): [True: 26.8M, False: 0] ------------------ 74| | 75| 26.8M| if (storage::head().count >= Limit) ------------------ | Branch (75:13): [True: 10.3M, False: 16.4M] ------------------ 76| 10.3M| base_t::deallocate(Size, data); 77| 16.4M| else { 78| 16.4M| auto n = static_cast(data); 79| 16.4M| n->next = storage::head().data; 80| 16.4M| storage::head().data = n; 81| 16.4M| ++storage::head().count; 82| 16.4M| } 83| 26.8M| } _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| 15.9M| { 58| 15.9M| assert(size <= Size); ------------------ | Branch (58:9): [True: 15.9M, False: 0] ------------------ 59| | 60| 15.9M| auto n = storage::head().data; 61| 15.9M| if (!n) { ------------------ | Branch (61:13): [True: 5.33M, False: 10.5M] ------------------ 62| 5.33M| auto p = base_t::allocate(Size); 63| 5.33M| return p; 64| 5.33M| } 65| 10.5M| --storage::head().count; 66| 10.5M| storage::head().data = n->next; 67| 10.5M| return n; 68| 15.9M| } _ZN5immer6detail26unsafe_free_list_heap_implINS0_30thread_local_free_list_storageELm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEE8allocateIJNS_10norefs_tagEEEEPvmDpT_: 57| 10.8M| { 58| 10.8M| assert(size <= Size); ------------------ | Branch (58:9): [True: 10.8M, False: 0] ------------------ 59| | 60| 10.8M| auto n = storage::head().data; 61| 10.8M| if (!n) { ------------------ | Branch (61:13): [True: 5.02M, False: 5.86M] ------------------ 62| 5.02M| auto p = base_t::allocate(Size); 63| 5.02M| return p; 64| 5.02M| } 65| 5.86M| --storage::head().count; 66| 5.86M| storage::head().data = n->next; 67| 5.86M| return n; 68| 10.8M| } _ZN5immer15refcount_policyC2Ev: 28| 26.8M| : refcount{1} {}; _ZN5immer15refcount_policy3incEv: 34| 41.9M| void inc() { refcount.fetch_add(1, std::memory_order_relaxed); } _ZN5immer15refcount_policy3decEv: 36| 68.7M| bool dec() { return 1 == refcount.fetch_sub(1, std::memory_order_acq_rel); } _ZN5immer15refcount_policy6uniqueEv: 38| 2.05M| bool unique() { return refcount == 1; } _ZNK5immer20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5ownee5ownedEv: 36| 26.8M| bool owned() const { return false; } _ZNK5immer20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5ownee10can_mutateENS6_4editE: 35| 118k| bool can_mutate(edit) const { return false; } _ZN5immer20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeaSENS6_4editE: 34| 597k| ownee& operator=(edit) { return *this; };