LLVMFuzzerTestOneInput: 18| 8.71k|{ 19| 8.71k| constexpr auto var_count = 8; 20| 8.71k| constexpr auto bits = 2; 21| | 22| 8.71k| using vector_t = 23| 8.71k| immer::flex_vector; 24| 8.71k| using size_t = std::uint8_t; 25| | 26| 8.71k| auto vars = std::array{}; 27| | 28| 8.71k| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; 29| 8.71k| auto is_valid_var_neq = [](auto other) { 30| 8.71k| return [=](auto idx) { 31| 8.71k| return idx >= 0 && idx < var_count && idx != other; 32| 8.71k| }; 33| 8.71k| }; 34| 8.71k| auto is_valid_index = [](auto& v) { 35| 8.71k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 36| 8.71k| }; 37| 8.71k| auto is_valid_size = [](auto& v) { 38| 8.71k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 39| 8.71k| }; 40| 8.71k| auto can_concat = [](auto&& v1, auto&& v2) { 41| 8.71k| return v1.size() + v2.size() < vector_t::max_size(); 42| 8.71k| }; 43| 8.71k| auto can_compare = [](auto&& v) { 44| | // avoid comparing vectors that are too big, and hence, slow to compare 45| 8.71k| return v.size() < (1 << 15); 46| 8.71k| }; 47| 8.71k| return fuzzer_input{data, size}.run([&](auto& in) { 48| 8.71k| enum ops 49| 8.71k| { 50| 8.71k| op_push_back, 51| 8.71k| op_update, 52| 8.71k| op_take, 53| 8.71k| op_drop, 54| 8.71k| op_concat, 55| 8.71k| op_push_back_move, 56| 8.71k| op_update_move, 57| 8.71k| op_take_move, 58| 8.71k| op_drop_move, 59| 8.71k| op_concat_move_l, 60| 8.71k| op_concat_move_r, 61| 8.71k| op_concat_move_lr, 62| 8.71k| op_insert, 63| 8.71k| op_erase, 64| 8.71k| op_compare, 65| 8.71k| }; 66| 8.71k| auto src = read(in, is_valid_var); 67| 8.71k| auto dst = read(in, is_valid_var); 68| 8.71k| switch (read(in)) { 69| 8.71k| case op_push_back: { 70| 8.71k| vars[dst] = vars[src].push_back(42); 71| 8.71k| break; 72| 8.71k| } 73| 8.71k| case op_update: { 74| 8.71k| auto idx = read(in, is_valid_index(vars[src])); 75| 8.71k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 76| 8.71k| break; 77| 8.71k| } 78| 8.71k| case op_take: { 79| 8.71k| auto idx = read(in, is_valid_size(vars[src])); 80| 8.71k| vars[dst] = vars[src].take(idx); 81| 8.71k| break; 82| 8.71k| } 83| 8.71k| case op_drop: { 84| 8.71k| auto idx = read(in, is_valid_size(vars[src])); 85| 8.71k| vars[dst] = vars[src].drop(idx); 86| 8.71k| break; 87| 8.71k| } 88| 8.71k| case op_concat: { 89| 8.71k| auto src2 = read(in, is_valid_var); 90| 8.71k| if (can_concat(vars[src], vars[src2])) 91| 8.71k| vars[dst] = vars[src] + vars[src2]; 92| 8.71k| break; 93| 8.71k| } 94| 8.71k| case op_push_back_move: { 95| 8.71k| vars[dst] = std::move(vars[src]).push_back(21); 96| 8.71k| break; 97| 8.71k| } 98| 8.71k| case op_update_move: { 99| 8.71k| auto idx = read(in, is_valid_index(vars[src])); 100| 8.71k| vars[dst] = 101| 8.71k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 102| 8.71k| break; 103| 8.71k| } 104| 8.71k| case op_take_move: { 105| 8.71k| auto idx = read(in, is_valid_size(vars[src])); 106| 8.71k| vars[dst] = std::move(vars[src]).take(idx); 107| 8.71k| break; 108| 8.71k| } 109| 8.71k| case op_drop_move: { 110| 8.71k| auto idx = read(in, is_valid_size(vars[src])); 111| 8.71k| vars[dst] = std::move(vars[src]).drop(idx); 112| 8.71k| break; 113| 8.71k| } 114| 8.71k| case op_concat_move_l: { 115| 8.71k| auto src2 = read(in, is_valid_var_neq(src)); 116| 8.71k| if (can_concat(vars[src], vars[src2])) 117| 8.71k| vars[dst] = std::move(vars[src]) + vars[src2]; 118| 8.71k| break; 119| 8.71k| } 120| 8.71k| case op_concat_move_r: { 121| 8.71k| auto src2 = read(in, is_valid_var_neq(src)); 122| 8.71k| if (can_concat(vars[src], vars[src2])) 123| 8.71k| vars[dst] = vars[src] + std::move(vars[src2]); 124| 8.71k| break; 125| 8.71k| } 126| 8.71k| case op_concat_move_lr: { 127| 8.71k| auto src2 = read(in, is_valid_var_neq(src)); 128| 8.71k| if (can_concat(vars[src], vars[src2])) 129| 8.71k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 130| 8.71k| break; 131| 8.71k| } 132| 8.71k| case op_compare: { 133| 8.71k| using std::swap; 134| 8.71k| if (can_compare(vars[src]) && vars[src] == vars[dst]) 135| 8.71k| swap(vars[src], vars[dst]); 136| 8.71k| break; 137| 8.71k| } 138| 8.71k| case op_erase: { 139| 8.71k| auto idx = read(in, is_valid_index(vars[src])); 140| 8.71k| vars[dst] = vars[src].erase(idx); 141| 8.71k| break; 142| 8.71k| } 143| 8.71k| case op_insert: { 144| 8.71k| auto idx = read(in, is_valid_size(vars[src])); 145| 8.71k| vars[dst] = vars[src].insert(idx, immer::box{42}); 146| 8.71k| break; 147| 8.71k| } 148| 8.71k| default: 149| 8.71k| break; 150| 8.71k| }; 151| 8.71k| return true; 152| 8.71k| }); 153| 8.71k|} flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_: 47| 1.95M| return fuzzer_input{data, size}.run([&](auto& in) { 48| 1.95M| enum ops 49| 1.95M| { 50| 1.95M| op_push_back, 51| 1.95M| op_update, 52| 1.95M| op_take, 53| 1.95M| op_drop, 54| 1.95M| op_concat, 55| 1.95M| op_push_back_move, 56| 1.95M| op_update_move, 57| 1.95M| op_take_move, 58| 1.95M| op_drop_move, 59| 1.95M| op_concat_move_l, 60| 1.95M| op_concat_move_r, 61| 1.95M| op_concat_move_lr, 62| 1.95M| op_insert, 63| 1.95M| op_erase, 64| 1.95M| op_compare, 65| 1.95M| }; 66| 1.95M| auto src = read(in, is_valid_var); 67| 1.95M| auto dst = read(in, is_valid_var); 68| 1.95M| switch (read(in)) { 69| 449k| case op_push_back: { ------------------ | Branch (69:9): [True: 449k, False: 1.50M] ------------------ 70| 449k| vars[dst] = vars[src].push_back(42); 71| 449k| break; 72| 0| } 73| 117k| case op_update: { ------------------ | Branch (73:9): [True: 117k, False: 1.83M] ------------------ 74| 117k| auto idx = read(in, is_valid_index(vars[src])); 75| 117k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 76| 117k| break; 77| 0| } 78| 2.04k| case op_take: { ------------------ | Branch (78:9): [True: 2.04k, False: 1.95M] ------------------ 79| 2.04k| auto idx = read(in, is_valid_size(vars[src])); 80| 2.04k| vars[dst] = vars[src].take(idx); 81| 2.04k| break; 82| 0| } 83| 3.35k| case op_drop: { ------------------ | Branch (83:9): [True: 3.35k, False: 1.94M] ------------------ 84| 3.35k| auto idx = read(in, is_valid_size(vars[src])); 85| 3.35k| vars[dst] = vars[src].drop(idx); 86| 3.35k| break; 87| 0| } 88| 878k| case op_concat: { ------------------ | Branch (88:9): [True: 878k, False: 1.07M] ------------------ 89| 878k| auto src2 = read(in, is_valid_var); 90| 878k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (90:17): [True: 815k, False: 62.7k] ------------------ 91| 815k| vars[dst] = vars[src] + vars[src2]; 92| 878k| break; 93| 0| } 94| 13.4k| case op_push_back_move: { ------------------ | Branch (94:9): [True: 13.4k, False: 1.93M] ------------------ 95| 13.4k| vars[dst] = std::move(vars[src]).push_back(21); 96| 13.4k| break; 97| 0| } 98| 53.3k| case op_update_move: { ------------------ | Branch (98:9): [True: 53.3k, False: 1.89M] ------------------ 99| 53.3k| auto idx = read(in, is_valid_index(vars[src])); 100| 53.3k| vars[dst] = 101| 53.3k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 102| 53.3k| break; 103| 0| } 104| 36.8k| case op_take_move: { ------------------ | Branch (104:9): [True: 36.8k, False: 1.91M] ------------------ 105| 36.8k| auto idx = read(in, is_valid_size(vars[src])); 106| 36.8k| vars[dst] = std::move(vars[src]).take(idx); 107| 36.8k| break; 108| 0| } 109| 44.8k| case op_drop_move: { ------------------ | Branch (109:9): [True: 44.8k, False: 1.90M] ------------------ 110| 44.8k| auto idx = read(in, is_valid_size(vars[src])); 111| 44.8k| vars[dst] = std::move(vars[src]).drop(idx); 112| 44.8k| break; 113| 0| } 114| 247k| case op_concat_move_l: { ------------------ | Branch (114:9): [True: 247k, False: 1.70M] ------------------ 115| 247k| auto src2 = read(in, is_valid_var_neq(src)); 116| 247k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (116:17): [True: 238k, False: 8.19k] ------------------ 117| 238k| vars[dst] = std::move(vars[src]) + vars[src2]; 118| 247k| break; 119| 0| } 120| 3.98k| case op_concat_move_r: { ------------------ | Branch (120:9): [True: 3.98k, False: 1.94M] ------------------ 121| 3.98k| auto src2 = read(in, is_valid_var_neq(src)); 122| 3.98k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (122:17): [True: 3.47k, False: 503] ------------------ 123| 3.47k| vars[dst] = vars[src] + std::move(vars[src2]); 124| 3.98k| break; 125| 0| } 126| 2.45k| case op_concat_move_lr: { ------------------ | Branch (126:9): [True: 2.45k, False: 1.95M] ------------------ 127| 2.45k| auto src2 = read(in, is_valid_var_neq(src)); 128| 2.45k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (128:17): [True: 1.63k, False: 818] ------------------ 129| 1.63k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 130| 2.45k| break; 131| 0| } 132| 35.7k| case op_compare: { ------------------ | Branch (132:9): [True: 35.7k, False: 1.91M] ------------------ 133| 35.7k| using std::swap; 134| 35.7k| if (can_compare(vars[src]) && vars[src] == vars[dst]) ------------------ | Branch (134:17): [True: 31.7k, False: 4.06k] | Branch (134:43): [True: 7.90k, False: 23.8k] ------------------ 135| 7.90k| swap(vars[src], vars[dst]); 136| 35.7k| break; 137| 0| } 138| 3.27k| case op_erase: { ------------------ | Branch (138:9): [True: 3.27k, False: 1.94M] ------------------ 139| 3.27k| auto idx = read(in, is_valid_index(vars[src])); 140| 3.27k| vars[dst] = vars[src].erase(idx); 141| 3.27k| break; 142| 0| } 143| 19.1k| case op_insert: { ------------------ | Branch (143:9): [True: 19.1k, False: 1.93M] ------------------ 144| 19.1k| auto idx = read(in, is_valid_size(vars[src])); 145| 19.1k| vars[dst] = vars[src].insert(idx, immer::box{42}); 146| 19.1k| break; 147| 0| } 148| 33.3k| default: ------------------ | Branch (148:9): [True: 33.3k, False: 1.91M] ------------------ 149| 33.3k| break; 150| 1.95M| }; 151| 1.94M| return true; 152| 1.95M| }); flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_0clIcEEDaT_: 28| 5.15M| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; ------------------ | Branch (28:48): [True: 4.97M, False: 181k] | Branch (28:60): [True: 4.76M, False: 203k] ------------------ 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| 208k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; ------------------ | Branch (35:39): [True: 208k, False: 0] | Branch (35:51): [True: 173k, False: 35.0k] ------------------ flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaRT_: 34| 173k| auto is_valid_index = [](auto& v) { 35| 173k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 36| 173k| }; flex-vector.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E_clIiEEDaS2_: 75| 117k| 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| 119k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; ------------------ | Branch (38:39): [True: 119k, False: 0] | Branch (38:51): [True: 106k, False: 13.5k] ------------------ flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaRT_: 37| 106k| auto is_valid_size = [](auto& v) { 38| 106k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 39| 106k| }; flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_4clIRN5immer11flex_vectorIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEELj2ELj2EEESC_EEDaOT_OT0_: 40| 1.13M| auto can_concat = [](auto&& v1, auto&& v2) { 41| 1.13M| return v1.size() + v2.size() < vector_t::max_size(); 42| 1.13M| }; flex-vector.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E0_clIiEEDaS2_: 101| 53.2k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); flex-vector.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_ENKUlS1_E_clIcEEDaS1_: 30| 288k| return [=](auto idx) { 31| 288k| return idx >= 0 && idx < var_count && idx != other; ------------------ | Branch (31:20): [True: 284k, False: 4.66k] | Branch (31:32): [True: 274k, False: 10.2k] | Branch (31:51): [True: 253k, False: 20.5k] ------------------ 32| 288k| }; flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_: 29| 253k| auto is_valid_var_neq = [](auto other) { 30| 253k| return [=](auto idx) { 31| 253k| return idx >= 0 && idx < var_count && idx != other; 32| 253k| }; 33| 253k| }; flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_5clIRN5immer11flex_vectorIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaOT_: 43| 35.7k| auto can_compare = [](auto&& v) { 44| | // avoid comparing vectors that are too big, and hence, slow to compare 45| 35.7k| return v.size() < (1 << 15); 46| 35.7k| }; flex-vector.cpp:_ZN12fuzzer_input3runIZ22LLVMFuzzerTestOneInputE3$_6EEiT_: 50| 8.71k| { 51| 8.71k| if (size_ > fuzzer_input_max_size) ------------------ | Branch (51:13): [True: 7, False: 8.71k] ------------------ 52| 7| return 0; 53| 8.71k| try { 54| 1.95M| while (step(*this)) ------------------ | Branch (54:20): [True: 1.94M, False: 8.71k] ------------------ 55| 1.94M| continue; 56| 8.71k| } catch (const no_more_input&) { 57| 8.71k| }; 58| 8.71k| return 0; 59| 8.71k| } flex-vector.cpp:_Z4readIcZ22LLVMFuzzerTestOneInputE3$_0ET_R12fuzzer_inputT0_: 70| 4.77M|{ 71| 4.77M| auto x = read(fz); 72| 5.16M| while (!cond(x)) ------------------ | Branch (72:12): [True: 384k, False: 4.77M] ------------------ 73| 384k| x = read(fz); 74| 4.77M| return x; 75| 4.77M|} _Z4readIcERKT_R12fuzzer_input: 64| 7.39M|{ 65| 7.39M| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 7.39M|} _ZN12fuzzer_input4nextEmm: 40| 7.72M| { 41| 7.72M| auto& p = const_cast(reinterpret_cast(data_)); 42| 7.72M| auto r = std::align(align, size, p, size_); 43| 7.72M| if (r == nullptr) ------------------ | Branch (43:13): [True: 8.71k, False: 7.71M] ------------------ 44| 8.71k| throw no_more_input{}; 45| 7.71M| return next(size); 46| 7.72M| } _ZN12fuzzer_input4nextEm: 30| 7.71M| { 31| 7.71M| if (size_ < size) ------------------ | Branch (31:13): [True: 0, False: 7.71M] ------------------ 32| 0| throw no_more_input{}; 33| 7.71M| auto r = data_; 34| 7.71M| data_ += size; 35| 7.71M| size_ -= size; 36| 7.71M| return r; 37| 7.71M| } 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| 173k|{ 71| 173k| auto x = read(fz); 72| 208k| while (!cond(x)) ------------------ | Branch (72:12): [True: 35.0k, False: 173k] ------------------ 73| 35.0k| x = read(fz); 74| 173k| return x; 75| 173k|} _Z4readIhERKT_R12fuzzer_input: 64| 328k|{ 65| 328k| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 328k|} flex-vector.cpp:_Z4readIhZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS2_13memory_policyINS2_21free_list_heap_policyINS2_8cpp_heapELm1024EEENS2_15refcount_policyENS2_15spinlock_policyENS2_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaRT_EUlSD_E_ESD_R12fuzzer_inputT0_: 70| 106k|{ 71| 106k| auto x = read(fz); 72| 119k| while (!cond(x)) ------------------ | Branch (72:12): [True: 13.5k, False: 106k] ------------------ 73| 13.5k| x = read(fz); 74| 106k| return x; 75| 106k|} flex-vector.cpp:_Z4readIcZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_EUlS2_E_ES2_R12fuzzer_inputT0_: 70| 253k|{ 71| 253k| auto x = read(fz); 72| 289k| while (!cond(x)) ------------------ | Branch (72:12): [True: 35.4k, False: 253k] ------------------ 73| 35.4k| x = read(fz); 74| 253k| return x; 75| 253k|} _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2IiviEEOT_: 85| 19.1k| : impl_{detail::make(std::forward(arg))} 86| 19.1k| { 87| 19.1k| } _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderC2IJiEEEDpOT_: 47| 19.1k| : value(std::forward(args)...) 48| 19.1k| { 49| 19.1k| } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEcvRKiEv: 142| 19.1k| operator const T&() const { return get(); } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE3getEv: 139| 19.1k| IMMER_NODISCARD const T& get() const { return impl_->value; } _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEED2Ev: 131| 19.1k| { 132| 19.1k| if (impl_ && impl_->dec()) { ------------------ | Branch (132:13): [True: 19.1k, False: 0] | Branch (132:22): [True: 19.1k, False: 0] ------------------ 133| 19.1k| impl_->~holder(); 134| 19.1k| heap::deallocate(sizeof(holder), impl_); 135| 19.1k| } 136| 19.1k| } _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| 113M| const T& get_(type_t) const { return d; } _ZN5immer6detail3csl3getINS_15refcount_policyEEEDcRKNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEES3_NS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14relaxed_data_tENS1_6memberIS3_NS1_7inheritINSC_5applyISA_E4type5owneeEvE4typeEE4typeEE4typeE: 170| 12.1M| { 171| 12.1M| return x.get_(type_t{}); 172| 12.1M| } _ZNK5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14relaxed_data_tENS1_6memberIS9_NS1_7inheritINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_IS9_EEDcNS1_6type_tIT_EE: 184| 12.1M| { 185| 12.1M| return n.get_(t); 186| 12.1M| } _ZN5immer6detail3csl3getINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEEEDcRNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyIS7_NS_15refcount_policyENS_15spinlock_policyES3_Lb0ELb1EEELj2ELj2EE14relaxed_data_tENS1_6memberISF_NS1_7inheritISA_vE4typeEE4typeEE4typeE: 165| 11.4M| { 166| 11.4M| return x.get_(type_t{}); 167| 11.4M| } _ZN5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14relaxed_data_tENS1_6memberIS9_NS1_7inheritINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_ISK_EEDcNS1_6type_tIT_EE: 179| 11.4M| { 180| 11.4M| return n.get_(t); 181| 11.4M| } _ZN5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 102| 27.3M| 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| 15.9M| { 166| 15.9M| return x.get_(type_t{}); 167| 15.9M| } _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| 15.9M| { 180| 15.9M| return n.get_(t); 181| 15.9M| } _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| 102k| { 171| 102k| return x.get_(type_t{}); 172| 102k| } _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| 102k| { 185| 102k| return n.get_(t); 186| 102k| } _ZNK5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 103| 102k| 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.21M| 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.21M| { 23| 5.21M| return x.dereference(); 24| 5.21M| } _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.25M| { 87| 5.25M| static_assert(std::is_base_of::value, 88| 5.25M| "must pass a derived thing"); 89| 5.25M| return *static_cast(this); 90| 5.25M| } _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| 208k| { 152| 208k| access_t::advance(derived(), n); 153| 208k| return derived(); 154| 208k| } _ZN5immer6detail20iterator_core_access7advanceIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEElEEDcOT_T0_: 46| 208k| { 47| 208k| return x.advance(d); 48| 208k| } _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.31M| { 93| 8.31M| static_assert(std::is_base_of::value, 94| 8.31M| "must pass a derived thing"); 95| 8.31M| return *static_cast(this); 96| 8.31M| } _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.94M| { 120| 3.94M| access_t::increment(derived()); 121| 3.94M| return derived(); 122| 3.94M| } _ZN5immer6detail20iterator_core_access9incrementIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDcOT_: 28| 3.94M| { 29| 3.94M| return x.increment(); 30| 3.94M| } _ZNK5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENSt3__126random_access_iterator_tagEiRKilPSF_EplISI_TnNSD_9enable_ifIXsrT_16is_random_accessEbE4typeELb1EEESC_l: 164| 41.9k| { 165| 41.9k| auto tmp = derived(); 166| 41.9k| return tmp += n; 167| 41.9k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE17make_inner_n_intoEPvmj: 213| 2.57M| { 214| 2.57M| assert(n <= branches); ------------------ | Branch (214:9): [True: 2.57M, False: 0] ------------------ 215| 2.57M| assert(size >= sizeof_inner_n(n)); ------------------ | Branch (215:9): [True: 2.57M, False: 0] ------------------ 216| 2.57M| auto p = new (buffer) node_t; 217| 2.57M| p->impl.d.data.inner.relaxed = nullptr; 218| 2.57M|#if IMMER_TAGGED_NODE 219| 2.57M| p->impl.d.kind = node_t::kind_t::inner; 220| 2.57M|#endif 221| 2.57M| return p; 222| 2.57M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14sizeof_inner_nEj: 145| 10.3M| { 146| 10.3M| return keep_headroom ? max_sizeof_inner : sizeof_packed_inner_n(n); ------------------ | Branch (146:16): [True: 10.3M, Folded] ------------------ 147| 10.3M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE3incEv: 956| 27.5M| { 957| 27.5M| refs(this).inc(); 958| 27.5M| return this; 959| 27.5M| } _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.17M| { 331| 1.17M| assert(n <= branches); ------------------ | Branch (331:9): [True: 1.17M, False: 0] ------------------ 332| 1.17M| assert(size >= sizeof_leaf_n(n)); ------------------ | Branch (332:9): [True: 1.17M, False: 0] ------------------ 333| 1.17M| auto p = new (buffer) node_t; 334| 1.17M|#if IMMER_TAGGED_NODE 335| 1.17M| p->impl.d.kind = node_t::kind_t::leaf; 336| 1.17M|#endif 337| 1.17M| return p; 338| 1.17M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13sizeof_leaf_nEj: 160| 4.89M| { 161| 4.89M| return keep_headroom ? max_sizeof_leaf : sizeof_packed_leaf_n(n); ------------------ | Branch (161:16): [True: 4.89M, Folded] ------------------ 162| 4.89M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7relaxedEv: 172| 164M| { 173| 164M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 164M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (173:9): [True: 164M, False: 0] ------------------ 174| 164M| return impl.d.data.inner.relaxed; 175| 164M| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4kindEv: 168| 309M| 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| 106M| { 185| 106M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 106M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (185:9): [True: 106M, False: 0] ------------------ 186| 106M| return impl.d.data.inner.get_storage_ptr(); 187| 106M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14delete_inner_rEPSB_j: 832| 11.5M| { 833| 11.5M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 11.5M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (833:9): [True: 11.5M, False: 0] ------------------ 834| 11.5M| auto r = p->relaxed(); 835| 11.5M| assert(r); ------------------ | Branch (835:9): [True: 11.5M, False: 0] ------------------ 836| 11.5M| static_if([&](auto) { 837| 11.5M| if (node_t::refs(r).dec()) 838| 11.5M| heap::deallocate(node_t::ownee(r).owned() 839| 11.5M| ? node_t::max_sizeof_relaxed 840| 11.5M| : node_t::sizeof_relaxed_n(n), 841| 11.5M| r); 842| 11.5M| }); 843| 11.5M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner_r ------------------ | Branch (843:26): [True: 0, False: 11.5M] ------------------ 844| 11.5M| : node_t::sizeof_inner_r_n(n), 845| 11.5M| p); 846| 11.5M| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14delete_inner_rEPSB_jENKUlT_E_clINS0_7empty_tEEEDaSD_: 836| 11.5M| static_if([&](auto) { 837| 11.5M| if (node_t::refs(r).dec()) ------------------ | Branch (837:17): [True: 11.2M, False: 308k] ------------------ 838| 11.2M| heap::deallocate(node_t::ownee(r).owned() ------------------ | Branch (838:34): [True: 0, False: 11.2M] ------------------ 839| 11.2M| ? node_t::max_sizeof_relaxed 840| 11.2M| : node_t::sizeof_relaxed_n(n), 841| 11.2M| r); 842| 11.5M| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4refsEPKNS0_3csl10member_twoINSB_14relaxed_data_tENSC_6memberIS7_NSC_7inheritINS9_5applyIS6_E4type5owneeEvE4typeEE4typeEE4typeE: 196| 12.1M| { 197| 12.1M| return auto_const_cast(get(*x)); 198| 12.1M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5owneeEPNS0_3csl10member_twoINSB_14relaxed_data_tENSC_6memberIS7_NSC_7inheritINS9_5applyIS6_E4type5owneeEvE4typeEE4typeEE4typeE: 200| 11.4M| static ownee_t& ownee(relaxed_t* x) { return get(*x); } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE16sizeof_relaxed_nEj: 155| 22.2M| { 156| 22.2M| return keep_headroom ? max_sizeof_relaxed : sizeof_packed_relaxed_n(n); ------------------ | Branch (156:16): [True: 22.2M, Folded] ------------------ 157| 22.2M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5owneeEPSB_: 210| 15.9M| 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.9M| { 151| 22.9M| return keep_headroom ? max_sizeof_inner_r : sizeof_packed_inner_r_n(n); ------------------ | Branch (151:16): [True: 22.9M, Folded] ------------------ 152| 22.9M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11delete_leafEPSB_j: 861| 1.37M| { 862| 1.37M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::leaf); ------------------ | | 68| 1.37M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (862:9): [True: 1.37M, False: 0] ------------------ 863| 1.37M| detail::destroy_n(p->leaf(), n); 864| 1.37M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_leaf ------------------ | Branch (864:26): [True: 0, False: 1.37M] ------------------ 865| 1.37M| : node_t::sizeof_leaf_n(n), 866| 1.37M| p); 867| 1.37M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4leafEv: 190| 9.73M| { 191| 9.73M| IMMER_ASSERT_TAGGED(kind() == kind_t::leaf); ------------------ | | 68| 9.73M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (191:9): [True: 9.73M, False: 0] ------------------ 192| 9.73M| return impl.d.data.leaf.get_storage_ptr(); 193| 9.73M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12delete_innerEPSB_j: 808| 2.65M| { 809| 2.65M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 2.65M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (809:9): [True: 2.65M, False: 0] ------------------ 810| 2.65M| assert(!p->relaxed()); ------------------ | Branch (810:9): [True: 2.65M, False: 0] ------------------ 811| 2.65M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner ------------------ | Branch (811:26): [True: 0, False: 2.65M] ------------------ 812| 2.65M| : node_t::sizeof_inner_n(n), 813| 2.65M| p); 814| 2.65M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE17copy_leaf_emplaceIiEEPSB_SD_jOT_: 794| 328k| { 795| 328k| auto dst = copy_leaf_n(n + 1, src, n); 796| 328k| IMMER_TRY { ------------------ | | 49| 328k|#define IMMER_TRY try ------------------ 797| 328k| new (dst->leaf() + n) T(std::forward(x)); 798| 328k| } 799| 328k| 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| 328k| return dst; 805| 328k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11copy_leaf_nEjPSB_j: 696| 328k| { 697| 328k| assert(allocn >= n); ------------------ | Branch (697:9): [True: 328k, False: 0] ------------------ 698| 328k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 328k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (698:9): [True: 328k, False: 0] ------------------ 699| 328k| auto dst = make_leaf_n(allocn); 700| 328k| IMMER_TRY { ------------------ | | 49| 328k|#define IMMER_TRY try ------------------ 701| 328k| detail::uninitialized_copy( 702| 328k| src->leaf(), src->leaf() + n, dst->leaf()); 703| 328k| } 704| 328k| 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| 328k| return dst; 709| 328k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_nEj: 341| 1.17M| { 342| 1.17M| assert(n <= branches); ------------------ | Branch (342:9): [True: 1.17M, False: 0] ------------------ 343| 1.17M| auto m = heap::allocate(sizeof_leaf_n(n)); 344| 1.17M| return make_leaf_n_into(m, sizeof_leaf_n(n), n); 345| 1.17M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_nIiEEPSB_jOT_: 470| 121k| { 471| 121k| assert(n >= 1); ------------------ | Branch (471:9): [True: 121k, False: 0] ------------------ 472| 121k| auto p = make_leaf_n(n); 473| 121k| IMMER_TRY { ------------------ | | 49| 121k|#define IMMER_TRY try ------------------ 474| 121k| new (p->leaf()) T(std::forward(x)); 475| 121k| } 476| 121k| 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| 121k| return p; 481| 121k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13do_copy_innerEPSB_SC_j: 558| 2.36M| { 559| 2.36M| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 2.36M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (559:9): [True: 2.36M, False: 0] ------------------ 560| 2.36M| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 2.36M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (560:9): [True: 2.36M, False: 0] ------------------ 561| 2.36M| auto p = src->inner(); 562| 2.36M| inc_nodes(p, n); 563| 2.36M| std::copy(p, p + n, dst->inner()); 564| 2.36M| return dst; 565| 2.36M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9inc_nodesEPPSB_j: 970| 8.52M| { 971| 22.9M| for (auto i = p, e = i + n; i != e; ++i) ------------------ | Branch (971:37): [True: 14.4M, False: 8.52M] ------------------ 972| 14.4M| refs(*i).inc(); 973| 8.52M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14copy_inner_r_nEjPSB_j: 588| 509k| { 589| 509k| assert(allocn >= n); ------------------ | Branch (589:9): [True: 509k, False: 0] ------------------ 590| 509k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 509k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (590:9): [True: 509k, False: 0] ------------------ 591| 509k| auto dst = make_inner_r_n(allocn); 592| 509k| return do_copy_inner_r(dst, src, n); 593| 509k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE15do_copy_inner_rEPSB_SC_j: 610| 532k| { 611| 532k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 532k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (611:9): [True: 532k, False: 0] ------------------ 612| 532k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 532k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (612:9): [True: 532k, False: 0] ------------------ 613| 532k| auto src_r = src->relaxed(); 614| 532k| auto dst_r = dst->relaxed(); 615| 532k| inc_nodes(src->inner(), n); 616| 532k| std::copy(src->inner(), src->inner() + n, dst->inner()); 617| 532k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 618| 532k| dst_r->d.count = n; 619| 532k| return dst; 620| 532k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14make_inner_r_nEj: 243| 11.0M| { 244| 11.0M| assert(n <= branches); ------------------ | Branch (244:9): [True: 11.0M, False: 0] ------------------ 245| 11.0M| auto mp = heap::allocate(sizeof_inner_r_n(n)); 246| 11.0M| auto mr = static_cast(nullptr); 247| 11.0M| if (embed_relaxed) { ------------------ | Branch (247:13): [Folded, False: 11.0M] ------------------ 248| 0| mr = reinterpret_cast(mp) + sizeof_inner_n(n); 249| 11.0M| } else { 250| 11.0M| IMMER_TRY { ------------------ | | 49| 11.0M|#define IMMER_TRY try ------------------ 251| 11.0M| mr = heap::allocate(sizeof_relaxed_n(n), norefs_tag{}); 252| 11.0M| } 253| 11.0M| IMMER_CATCH (...) { 254| 0| heap::deallocate(sizeof_inner_r_n(n), mp); 255| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 256| 0| } 257| 11.0M| } 258| 11.0M| auto p = new (mp) node_t; 259| 11.0M| auto r = new (mr) relaxed_t; 260| 11.0M| r->d.count = 0; 261| 11.0M| p->impl.d.data.inner.relaxed = r; 262| 11.0M|#if IMMER_TAGGED_NODE 263| 11.0M| p->impl.d.kind = node_t::kind_t::inner; 264| 11.0M|#endif 265| 11.0M| return p; 266| 11.0M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9make_pathEjPSB_: 498| 679k| { 499| 679k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 679k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (499:9): [True: 679k, False: 0] ------------------ 500| 679k| if (shift == endshift) ------------------ | Branch (500:13): [True: 501k, False: 178k] ------------------ 501| 501k| return node; 502| 178k| else { 503| 178k| auto n = node_t::make_inner_n(1); 504| 178k| IMMER_TRY { ------------------ | | 49| 178k|#define IMMER_TRY try ------------------ 505| 178k| n->inner()[0] = make_path(shift - B, node); 506| 178k| } 507| 178k| 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| 178k| return n; 512| 178k| } 513| 679k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12make_inner_nEj: 224| 2.57M| { 225| 2.57M| assert(n <= branches); ------------------ | Branch (225:9): [True: 2.57M, False: 0] ------------------ 226| 2.57M| auto m = heap::allocate(sizeof_inner_n(n)); 227| 2.57M| return make_inner_n_into(m, sizeof_inner_n(n), n); 228| 2.57M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9copy_leafEPSB_j: 666| 127k| { 667| 127k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 127k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (667:9): [True: 127k, False: 0] ------------------ 668| 127k| auto dst = make_leaf_n(n); 669| 127k| IMMER_TRY { ------------------ | | 49| 127k|#define IMMER_TRY try ------------------ 670| 127k| detail::uninitialized_copy( 671| 127k| src->leaf(), src->leaf() + n, dst->leaf()); 672| 127k| } 673| 127k| 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| 127k| return dst; 678| 127k| } _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| 329k| { 270| 329k| return static_if( 271| 329k| [&](auto) { return node_t::make_inner_r_n(n); }, 272| 329k| [&](auto) { 273| 329k| auto p = 274| 329k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 329k| assert(r->d.count >= n); 276| 329k| node_t::refs(r).inc(); 277| 329k| p->impl.d.data.inner.relaxed = r; 278| 329k|#if IMMER_TAGGED_NODE 279| 329k| p->impl.d.kind = node_t::kind_t::inner; 280| 329k|#endif 281| 329k| return p; 282| 329k| }); 283| 329k| } _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| 329k| [&](auto) { 273| 329k| auto p = 274| 329k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 329k| assert(r->d.count >= n); ------------------ | Branch (275:17): [True: 329k, False: 0] ------------------ 276| 329k| node_t::refs(r).inc(); 277| 329k| p->impl.d.data.inner.relaxed = r; 278| 329k|#if IMMER_TAGGED_NODE 279| 329k| p->impl.d.kind = node_t::kind_t::inner; 280| 329k|#endif 281| 329k| return p; 282| 329k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE24do_copy_inner_replace_srEPSB_SC_jjSC_: 652| 329k| { 653| 329k| if (embed_relaxed) ------------------ | Branch (653:13): [Folded, False: 329k] ------------------ 654| 0| return do_copy_inner_replace_r(dst, src, n, offset, child); 655| 329k| else { 656| 329k| auto p = src->inner(); 657| 329k| inc_nodes(p, offset); 658| 329k| inc_nodes(p + offset + 1, n - offset - 1); 659| 329k| std::copy(p, p + n, dst->inner()); 660| 329k| dst->inner()[offset] = child; 661| 329k| return dst; 662| 329k| } 663| 329k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE21do_copy_inner_replaceEPSB_SC_jjSC_: 569| 45.6k| { 570| 45.6k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 45.6k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (570:9): [True: 45.6k, False: 0] ------------------ 571| 45.6k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 45.6k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (571:9): [True: 45.6k, False: 0] ------------------ 572| 45.6k| auto p = src->inner(); 573| 45.6k| inc_nodes(p, offset); 574| 45.6k| inc_nodes(p + offset + 1, n - offset - 1); 575| 45.6k| std::copy(p, p + n, dst->inner()); 576| 45.6k| dst->inner()[offset] = child; 577| 45.6k| return dst; 578| 45.6k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12copy_inner_nEjPSB_j: 543| 9.26k| { 544| 9.26k| assert(allocn >= n); ------------------ | Branch (544:9): [True: 9.26k, False: 0] ------------------ 545| 9.26k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 9.26k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (545:9): [True: 9.26k, False: 0] ------------------ 546| 9.26k| auto dst = make_inner_n(allocn); 547| 9.26k| return do_copy_inner(dst, src, n); 548| 9.26k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12copy_inner_rEPSB_j: 581| 5.10k| { 582| 5.10k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 5.10k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (582:9): [True: 5.10k, False: 0] ------------------ 583| 5.10k| auto dst = make_inner_r_n(n); 584| 5.10k| return do_copy_inner_r(dst, src, n); 585| 5.10k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13compute_shiftEv: 977| 5.02M| { 978| 5.02M| 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.02M| } _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| 290k| { 779| 290k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 290k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (779:9): [True: 290k, False: 0] ------------------ 780| 290k| auto dst = make_leaf_n(last - idx); 781| 290k| IMMER_TRY { ------------------ | | 49| 290k|#define IMMER_TRY try ------------------ 782| 290k| detail::uninitialized_copy( 783| 290k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 784| 290k| } 785| 290k| 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| 290k| return dst; 790| 290k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9copy_leafEPSB_jSC_j: 712| 280k| { 713| 280k| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 280k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (713:9): [True: 280k, False: 0] ------------------ 714| 280k| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 280k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (714:9): [True: 280k, False: 0] ------------------ 715| 280k| auto dst = make_leaf_n(n1 + n2); 716| 280k| IMMER_TRY { ------------------ | | 49| 280k|#define IMMER_TRY try ------------------ 717| 280k| detail::uninitialized_copy( 718| 280k| src1->leaf(), src1->leaf() + n1, dst->leaf()); 719| 280k| } 720| 280k| 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| 280k| IMMER_TRY { ------------------ | | 49| 280k|#define IMMER_TRY try ------------------ 725| 280k| detail::uninitialized_copy( 726| 280k| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 727| 280k| } 728| 280k| 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| 280k| return dst; 734| 280k| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10can_mutateENS9_5applyIS6_E4type4editE: 870| 1.69M| { 871| 1.69M| return refs(this).unique() || ownee(this).can_mutate(e); ------------------ | Branch (871:16): [True: 1.59M, False: 102k] | Branch (871:39): [True: 0, False: 102k] ------------------ 872| 1.69M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5owneeEPKSB_: 207| 102k| { 208| 102k| return get(x->impl); 209| 102k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_j: 681| 32.1k| { 682| 32.1k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 32.1k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (682:9): [True: 32.1k, False: 0] ------------------ 683| 32.1k| auto dst = make_leaf_e(e); 684| 32.1k| IMMER_TRY { ------------------ | | 49| 32.1k|#define IMMER_TRY try ------------------ 685| 32.1k| detail::uninitialized_copy( 686| 32.1k| src->leaf(), src->leaf() + n, dst->leaf()); 687| 32.1k| } 688| 32.1k| IMMER_CATCH (...) { 689| 0| heap::deallocate(node_t::max_sizeof_leaf, dst); 690| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 691| 0| } 692| 32.1k| return dst; 693| 32.1k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_eENS9_5applyIS6_E4type4editE: 348| 198k| { 349| 198k| auto p = new (heap::allocate(max_sizeof_leaf)) node_t; 350| 198k| ownee(p) = e; 351| 198k|#if IMMER_TAGGED_NODE 352| 198k| p->impl.d.kind = node_t::kind_t::leaf; 353| 198k|#endif 354| 198k| return p; 355| 198k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_eIiEEPSB_NS9_5applyIS6_E4type4editEOT_: 485| 13.1k| { 486| 13.1k| auto p = make_leaf_e(e); 487| 13.1k| IMMER_TRY { ------------------ | | 49| 13.1k|#define IMMER_TRY try ------------------ 488| 13.1k| new (p->leaf()) T(std::forward(x)); 489| 13.1k| } 490| 13.1k| IMMER_CATCH (...) { 491| 0| heap::deallocate(node_t::max_sizeof_leaf, p); 492| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 493| 0| } 494| 13.1k| return p; 495| 13.1k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEj: 930| 63.9k| { 931| 63.9k| auto src_r = relaxed(); 932| 63.9k| return static_if( 933| 63.9k| [&](auto) { return src_r; }, 934| 63.9k| [&](auto) { 935| 63.9k| if (node_t::refs(src_r).unique() || 936| 63.9k| node_t::ownee(src_r).can_mutate(e)) 937| 63.9k| return src_r; 938| 63.9k| else { 939| 63.9k| auto dst_r = 940| 63.9k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 63.9k| if (src_r) { 942| 63.9k| std::copy( 943| 63.9k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 63.9k| if (node_t::refs(src_r).dec()) 945| 63.9k| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 63.9k| src_r); 947| 63.9k| } 948| 63.9k| dst_r->d.count = n; 949| 63.9k| node_t::ownee(dst_r) = e; 950| 63.9k| return impl.d.data.inner.relaxed = dst_r; 951| 63.9k| } 952| 63.9k| }); 953| 63.9k| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEjENKUlT_E0_clINS0_7empty_tEEEDaSG_: 934| 63.9k| [&](auto) { 935| 63.9k| if (node_t::refs(src_r).unique() || ------------------ | Branch (935:21): [True: 53.2k, False: 10.6k] ------------------ 936| 10.6k| node_t::ownee(src_r).can_mutate(e)) ------------------ | Branch (936:21): [True: 0, False: 10.6k] ------------------ 937| 53.2k| return src_r; 938| 10.6k| else { 939| 10.6k| auto dst_r = 940| 10.6k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 10.6k| if (src_r) { ------------------ | Branch (941:25): [True: 10.6k, False: 0] ------------------ 942| 10.6k| std::copy( 943| 10.6k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 10.6k| if (node_t::refs(src_r).dec()) ------------------ | Branch (944:29): [True: 0, False: 10.6k] ------------------ 945| 0| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 0| src_r); 947| 10.6k| } 948| 10.6k| dst_r->d.count = n; 949| 10.6k| node_t::ownee(dst_r) = e; 950| 10.6k| return impl.d.data.inner.relaxed = dst_r; 951| 10.6k| } 952| 63.9k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14copy_inner_r_eENS9_5applyIS6_E4type4editEPSB_j: 596| 18.0k| { 597| 18.0k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 18.0k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (597:9): [True: 18.0k, False: 0] ------------------ 598| 18.0k| auto dst = make_inner_r_e(e); 599| 18.0k| return do_copy_inner_r(dst, src, n); 600| 18.0k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14make_inner_r_eENS9_5applyIS6_E4type4editE: 286| 110k| { 287| 110k| auto mp = heap::allocate(max_sizeof_inner_r); 288| 110k| auto mr = static_cast(nullptr); 289| 110k| if (embed_relaxed) { ------------------ | Branch (289:13): [Folded, False: 110k] ------------------ 290| 0| mr = reinterpret_cast(mp) + max_sizeof_inner; 291| 110k| } else { 292| 110k| IMMER_TRY { ------------------ | | 49| 110k|#define IMMER_TRY try ------------------ 293| 110k| mr = heap::allocate(max_sizeof_relaxed, norefs_tag{}); 294| 110k| } 295| 110k| IMMER_CATCH (...) { 296| 0| heap::deallocate(max_sizeof_inner_r, mp); 297| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 298| 0| } 299| 110k| } 300| 110k| auto p = new (mp) node_t; 301| 110k| auto r = new (mr) relaxed_t; 302| 110k| ownee(p) = e; 303| 110k| static_if([&](auto) { node_t::ownee(r) = e; }); 304| 110k| r->d.count = 0; 305| 110k| p->impl.d.data.inner.relaxed = r; 306| 110k|#if IMMER_TAGGED_NODE 307| 110k| p->impl.d.kind = node_t::kind_t::inner; 308| 110k|#endif 309| 110k| return p; 310| 110k| } _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| 110k| 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| 248k| { 517| 248k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 248k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (517:9): [True: 248k, False: 0] ------------------ 518| 248k| if (shift == endshift) ------------------ | Branch (518:13): [True: 185k, False: 63.2k] ------------------ 519| 185k| return node; 520| 63.2k| else { 521| 63.2k| auto n = node_t::make_inner_e(e); 522| 63.2k| IMMER_TRY { ------------------ | | 49| 63.2k|#define IMMER_TRY try ------------------ 523| 63.2k| n->inner()[0] = make_path_e(e, shift - B, node); 524| 63.2k| } 525| 63.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| 63.2k| return n; 530| 63.2k| } 531| 248k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12make_inner_eENS9_5applyIS6_E4type4editE: 231| 87.5k| { 232| 87.5k| auto m = heap::allocate(max_sizeof_inner); 233| 87.5k| auto p = new (m) node_t; 234| 87.5k| ownee(p) = e; 235| 87.5k| p->impl.d.data.inner.relaxed = nullptr; 236| 87.5k|#if IMMER_TAGGED_NODE 237| 87.5k| p->impl.d.kind = node_t::kind_t::inner; 238| 87.5k|#endif 239| 87.5k| return p; 240| 87.5k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12copy_inner_eENS9_5applyIS6_E4type4editEPSB_j: 551| 15.9k| { 552| 15.9k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 15.9k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (552:9): [True: 15.9k, False: 0] ------------------ 553| 15.9k| auto dst = make_inner_e(e); 554| 15.9k| return do_copy_inner(dst, src, n); 555| 15.9k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE15copy_inner_sr_eENS9_5applyIS6_E4type4editEPSB_j: 603| 15.7k| { 604| 15.7k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 15.7k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (604:9): [True: 15.7k, False: 0] ------------------ 605| 15.7k| auto dst = make_inner_sr_e(e, src->relaxed()); 606| 15.7k| return do_copy_inner_sr(dst, src, n); 607| 15.7k| } _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| 15.7k| { 314| 15.7k| return static_if( 315| 15.7k| [&](auto) { return node_t::make_inner_r_e(e); }, 316| 15.7k| [&](auto) { 317| 15.7k| auto p = 318| 15.7k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 15.7k| node_t::refs(r).inc(); 320| 15.7k| p->impl.d.data.inner.relaxed = r; 321| 15.7k| node_t::ownee(p) = e; 322| 15.7k|#if IMMER_TAGGED_NODE 323| 15.7k| p->impl.d.kind = node_t::kind_t::inner; 324| 15.7k|#endif 325| 15.7k| return p; 326| 15.7k| }); 327| 15.7k| } _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| 15.7k| [&](auto) { 317| 15.7k| auto p = 318| 15.7k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 15.7k| node_t::refs(r).inc(); 320| 15.7k| p->impl.d.data.inner.relaxed = r; 321| 15.7k| node_t::ownee(p) = e; 322| 15.7k|#if IMMER_TAGGED_NODE 323| 15.7k| p->impl.d.kind = node_t::kind_t::inner; 324| 15.7k|#endif 325| 15.7k| return p; 326| 15.7k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE16do_copy_inner_srEPSB_SC_j: 640| 15.7k| { 641| 15.7k| if (embed_relaxed) ------------------ | Branch (641:13): [Folded, False: 15.7k] ------------------ 642| 0| return do_copy_inner_r(dst, src, n); 643| 15.7k| else { 644| 15.7k| inc_nodes(src->inner(), n); 645| 15.7k| std::copy(src->inner(), src->inner() + n, dst->inner()); 646| 15.7k| return dst; 647| 15.7k| } 648| 15.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jj: 763| 153k| { 764| 153k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 153k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (764:9): [True: 153k, False: 0] ------------------ 765| 153k| auto dst = make_leaf_e(e); 766| 153k| IMMER_TRY { ------------------ | | 49| 153k|#define IMMER_TRY try ------------------ 767| 153k| detail::uninitialized_copy( 768| 153k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 769| 153k| } 770| 153k| IMMER_CATCH (...) { 771| 0| heap::deallocate(max_sizeof_leaf, dst); 772| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 773| 0| } 774| 153k| return dst; 775| 153k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE22ensure_mutable_relaxedENS9_5applyIS6_E4type4editE: 877| 201k| { 878| 201k| auto src_r = relaxed(); 879| 201k| return static_if( 880| 201k| [&](auto) { return src_r; }, 881| 201k| [&](auto) { 882| 201k| if (node_t::refs(src_r).unique() || 883| 201k| node_t::ownee(src_r).can_mutate(e)) 884| 201k| return src_r; 885| 201k| else { 886| 201k| auto dst_r = impl.d.data.inner.relaxed = 887| 201k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 201k| if (src_r) { 889| 201k| auto n = dst_r->d.count = src_r->d.count; 890| 201k| std::copy( 891| 201k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 201k| if (node_t::refs(src_r).dec()) 893| 201k| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 201k| src_r); 895| 201k| } 896| 201k| node_t::ownee(dst_r) = e; 897| 201k| return dst_r; 898| 201k| } 899| 201k| }); 900| 201k| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE22ensure_mutable_relaxedENS9_5applyIS6_E4type4editEENKUlT_E0_clINS0_7empty_tEEEDaSG_: 881| 201k| [&](auto) { 882| 201k| if (node_t::refs(src_r).unique() || ------------------ | Branch (882:21): [True: 175k, False: 26.4k] ------------------ 883| 26.4k| node_t::ownee(src_r).can_mutate(e)) ------------------ | Branch (883:21): [True: 0, False: 26.4k] ------------------ 884| 175k| return src_r; 885| 26.4k| else { 886| 26.4k| auto dst_r = impl.d.data.inner.relaxed = 887| 26.4k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 26.4k| if (src_r) { ------------------ | Branch (888:25): [True: 26.4k, False: 0] ------------------ 889| 26.4k| auto n = dst_r->d.count = src_r->d.count; 890| 26.4k| std::copy( 891| 26.4k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 26.4k| if (node_t::refs(src_r).dec()) ------------------ | Branch (892:29): [True: 0, False: 26.4k] ------------------ 893| 0| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 0| src_r); 895| 26.4k| } 896| 26.4k| node_t::ownee(dst_r) = e; 897| 26.4k| return dst_r; 898| 26.4k| } 899| 201k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jSG_j: 738| 272| { 739| 272| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 272|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (739:9): [True: 272, False: 0] ------------------ 740| 272| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 272|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (740:9): [True: 272, False: 0] ------------------ 741| 272| auto dst = make_leaf_e(e); 742| 272| IMMER_TRY { ------------------ | | 49| 272|#define IMMER_TRY try ------------------ 743| 272| detail::uninitialized_copy( 744| 272| src1->leaf(), src1->leaf() + n1, dst->leaf()); 745| 272| } 746| 272| IMMER_CATCH (...) { 747| 0| heap::deallocate(max_sizeof_leaf, dst); 748| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 749| 0| } 750| 272| IMMER_TRY { ------------------ | | 49| 272|#define IMMER_TRY try ------------------ 751| 272| detail::uninitialized_copy( 752| 272| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 753| 272| } 754| 272| 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| 272| return dst; 760| 272| } _ZN5immer6detail4rbts11dec_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 523| 35.3M| { 524| 35.3M| using node_t = node_type; 525| 35.3M| auto node = p.node(); 526| 35.3M| if (node->dec()) { ------------------ | Branch (526:13): [True: 11.4M, False: 23.8M] ------------------ 527| 11.4M| p.each(this_t{}); 528| 11.4M| node_t::delete_inner_r(node, p.count()); 529| 11.4M| } 530| 35.3M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 534| 2.49M| { 535| 2.49M| using node_t = node_type; 536| 2.49M| auto node = p.node(); 537| 2.49M| if (node->dec()) { ------------------ | Branch (537:13): [True: 531k, False: 1.96M] ------------------ 538| 531k| p.each(this_t{}); 539| 531k| node_t::delete_inner(node, p.count()); 540| 531k| } 541| 2.49M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 545| 1.08M| { 546| 1.08M| using node_t = node_type; 547| 1.08M| auto node = p.node(); 548| 1.08M| if (node->dec()) { ------------------ | Branch (548:13): [True: 484k, False: 599k] ------------------ 549| 484k| node_t::delete_leaf(node, p.count()); 550| 484k| } 551| 1.08M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 545| 425k| { 546| 425k| using node_t = node_type; 547| 425k| auto node = p.node(); 548| 425k| if (node->dec()) { ------------------ | Branch (548:13): [True: 19.8k, False: 405k] ------------------ 549| 19.8k| node_t::delete_leaf(node, p.count()); 550| 19.8k| } 551| 425k| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 534| 2.96M| { 535| 2.96M| using node_t = node_type; 536| 2.96M| auto node = p.node(); 537| 2.96M| if (node->dec()) { ------------------ | Branch (537:13): [True: 205k, False: 2.76M] ------------------ 538| 205k| p.each(this_t{}); 539| 205k| node_t::delete_inner(node, p.count()); 540| 205k| } 541| 2.96M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 534| 2.02M| { 535| 2.02M| using node_t = node_type; 536| 2.02M| auto node = p.node(); 537| 2.02M| if (node->dec()) { ------------------ | Branch (537:13): [True: 1.90M, False: 121k] ------------------ 538| 1.90M| p.each(this_t{}); 539| 1.90M| node_t::delete_inner(node, p.count()); 540| 1.90M| } 541| 2.02M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 534| 1.62M| { 535| 1.62M| using node_t = node_type; 536| 1.62M| auto node = p.node(); 537| 1.62M| if (node->dec()) { ------------------ | Branch (537:13): [True: 0, False: 1.62M] ------------------ 538| 0| p.each(this_t{}); 539| 0| node_t::delete_inner(node, p.count()); 540| 0| } 541| 1.62M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 545| 9.99M| { 546| 9.99M| using node_t = node_type; 547| 9.99M| auto node = p.node(); 548| 9.99M| if (node->dec()) { ------------------ | Branch (548:13): [True: 869k, False: 9.12M] ------------------ 549| 869k| node_t::delete_leaf(node, p.count()); 550| 869k| } 551| 9.99M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 545| 1.54M| { 546| 1.54M| using node_t = node_type; 547| 1.54M| auto node = p.node(); 548| 1.54M| if (node->dec()) { ------------------ | Branch (548:13): [True: 0, False: 1.54M] ------------------ 549| 0| node_t::delete_leaf(node, p.count()); 550| 0| } 551| 1.54M| } _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| 502k| { 792| 502k| auto level = pos.shift(); 793| 502k| auto idx = pos.count() - 1; 794| 502k| auto children = pos.size(idx); 795| 502k| auto new_idx = 796| 502k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (796:13): [True: 13.0k, False: 489k] | Branch (796:47): [True: 833, False: 489k] ------------------ 797| 502k| auto new_child = static_cast(nullptr); 798| 502k| if (new_idx >= branches) ------------------ | Branch (798:13): [True: 4.66k, False: 498k] ------------------ 799| 4.66k| return nullptr; 800| 498k| else if (idx == new_idx) { ------------------ | Branch (800:18): [True: 489k, False: 9.21k] ------------------ 801| 489k| new_child = pos.last_oh_csh(this_t{}, idx, children, tail, ts); 802| 489k| if (!new_child) { ------------------ | Branch (802:17): [True: 4.14k, False: 484k] ------------------ 803| 4.14k| if (++new_idx < branches) ------------------ | Branch (803:21): [True: 2.76k, False: 1.37k] ------------------ 804| 2.76k| new_child = node_t::make_path(level - B, tail); 805| 1.37k| else 806| 1.37k| return nullptr; 807| 4.14k| } 808| 489k| } else 809| 9.21k| new_child = node_t::make_path(level - B, tail); 810| 496k| IMMER_TRY { ------------------ | | 49| 496k|#define IMMER_TRY try ------------------ 811| 496k| auto count = new_idx + 1; 812| 496k| auto new_parent = 813| 496k| node_t::copy_inner_r_n(count, pos.node(), new_idx); 814| 496k| auto new_relaxed = new_parent->relaxed(); 815| 496k| new_parent->inner()[new_idx] = new_child; 816| 496k| new_relaxed->d.sizes[new_idx] = pos.size() + ts; 817| 496k| new_relaxed->d.count = count; 818| 496k| assert(new_relaxed->d.sizes[new_idx]); ------------------ | Branch (818:13): [True: 496k, False: 0] ------------------ 819| 496k| return new_parent; 820| 496k| } 821| 496k| 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| 496k| } _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| 180k| { 835| 180k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 180k, False: 0] ------------------ 836| 180k| auto idx = pos.index(pos.size() - 1); 837| 180k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 180k| auto count = new_idx + 1; 839| 180k| auto new_parent = node_t::make_inner_n(count); 840| 180k| IMMER_TRY { ------------------ | | 49| 180k|#define IMMER_TRY try ------------------ 841| 180k| new_parent->inner()[new_idx] = 842| 180k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 172k, False: 8.47k] ------------------ 843| | /* otherwise */ 844| 180k| : node_t::make_path(pos.shift() - B, tail); 845| 180k| } 846| 180k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 180k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 180k| } _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| 1.86M| { 835| 1.86M| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 1.86M, False: 0] ------------------ 836| 1.86M| auto idx = pos.index(pos.size() - 1); 837| 1.86M| auto new_idx = pos.index(pos.size() + branches - 1); 838| 1.86M| auto count = new_idx + 1; 839| 1.86M| auto new_parent = node_t::make_inner_n(count); 840| 1.86M| IMMER_TRY { ------------------ | | 49| 1.86M|#define IMMER_TRY try ------------------ 841| 1.86M| new_parent->inner()[new_idx] = 842| 1.86M| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 1.41M, False: 447k] ------------------ 843| | /* otherwise */ 844| 1.86M| : node_t::make_path(pos.shift() - B, tail); 845| 1.86M| } 846| 1.86M| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 1.86M| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 1.86M| } _ZN5immer6detail4rbts9dec_innerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEvPT_jm: 562| 562|{ 563| 562| visit_maybe_relaxed_sub(node, shift, size, dec_visitor()); 564| 562|} _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| 290k| { 835| 290k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 290k, False: 0] ------------------ 836| 290k| auto idx = pos.index(pos.size() - 1); 837| 290k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 290k| auto count = new_idx + 1; 839| 290k| auto new_parent = node_t::make_inner_n(count); 840| 290k| IMMER_TRY { ------------------ | | 49| 290k|#define IMMER_TRY try ------------------ 841| 290k| new_parent->inner()[new_idx] = 842| 290k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 275k, False: 15.3k] ------------------ 843| | /* otherwise */ 844| 290k| : node_t::make_path(pos.shift() - B, tail); 845| 290k| } 846| 290k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 290k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 290k| } 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| 92.3k| { 503| 92.3k| auto offset = pos.index(idx); 504| 92.3k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 92.3k| IMMER_TRY { ------------------ | | 49| 92.3k|#define IMMER_TRY try ------------------ 506| 92.3k| node->leaf()[offset] = 507| 92.3k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 92.3k| return node; 509| 92.3k| } 510| 92.3k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 92.3k| } 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| 329k| { 467| 329k| auto offset = pos.index(idx); 468| 329k| auto count = pos.count(); 469| 329k| auto node = node_t::make_inner_sr_n(count, pos.relaxed()); 470| 329k| IMMER_TRY { ------------------ | | 49| 329k|#define IMMER_TRY try ------------------ 471| 329k| auto child = pos.towards_oh(this_t{}, idx, offset, fn); 472| 329k| node_t::do_copy_inner_replace_sr( 473| 329k| node, pos.node(), count, offset, child); 474| 329k| return node; 475| 329k| } 476| 329k| IMMER_CATCH (...) { 477| 0| node_t::delete_inner_r(node, count); 478| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 479| 0| } 480| 329k| } 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| 24.8k| { 485| 24.8k| auto offset = pos.index(idx); 486| 24.8k| auto count = pos.count(); 487| 24.8k| auto node = node_t::make_inner_n(count); 488| 24.8k| IMMER_TRY { ------------------ | | 49| 24.8k|#define IMMER_TRY try ------------------ 489| 24.8k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 24.8k| node_t::do_copy_inner_replace( 491| 24.8k| node, pos.node(), count, offset, child); 492| 24.8k| return node; 493| 24.8k| } 494| 24.8k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 24.8k| } flex-vector.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_13full_leaf_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 502| 21.6k| { 503| 21.6k| auto offset = pos.index(idx); 504| 21.6k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 21.6k| IMMER_TRY { ------------------ | | 49| 21.6k|#define IMMER_TRY try ------------------ 506| 21.6k| node->leaf()[offset] = 507| 21.6k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 21.6k| return node; 509| 21.6k| } 510| 21.6k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 21.6k| } 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| 16.5k| { 485| 16.5k| auto offset = pos.index(idx); 486| 16.5k| auto count = pos.count(); 487| 16.5k| auto node = node_t::make_inner_n(count); 488| 16.5k| IMMER_TRY { ------------------ | | 49| 16.5k|#define IMMER_TRY try ------------------ 489| 16.5k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 16.5k| node_t::do_copy_inner_replace( 491| 16.5k| node, pos.node(), count, offset, child); 492| 16.5k| return node; 493| 16.5k| } 494| 16.5k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 16.5k| } flex-vector.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_8leaf_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 502| 3.23k| { 503| 3.23k| auto offset = pos.index(idx); 504| 3.23k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 3.23k| IMMER_TRY { ------------------ | | 49| 3.23k|#define IMMER_TRY try ------------------ 506| 3.23k| node->leaf()[offset] = 507| 3.23k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 3.23k| return node; 509| 3.23k| } 510| 3.23k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 3.23k| } flex-vector.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_regularIRNS1_11regular_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 484| 4.23k| { 485| 4.23k| auto offset = pos.index(idx); 486| 4.23k| auto count = pos.count(); 487| 4.23k| auto node = node_t::make_inner_n(count); 488| 4.23k| IMMER_TRY { ------------------ | | 49| 4.23k|#define IMMER_TRY try ------------------ 489| 4.23k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 4.23k| node_t::do_copy_inner_replace( 491| 4.23k| node, pos.node(), count, offset, child); 492| 4.23k| return node; 493| 4.23k| } 494| 4.23k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 4.23k| } _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| 44.5k| { 1097| 44.5k| auto idx = pos.index(last); 1098| 44.5k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [True: 44.5k, Folded] | Branch (1098:25): [True: 34.9k, False: 9.52k] ------------------ 1099| 34.9k| return pos.towards_oh(this_t{}, last, idx); 1100| 34.9k| } else { 1101| 9.52k| using std::get; 1102| 9.52k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 9.52k| auto next = get<1>(subs); 1104| 9.52k| auto ts = get<2>(subs); 1105| 9.52k| auto tail = get<3>(subs); 1106| 9.52k| IMMER_TRY { ------------------ | | 49| 9.52k|#define IMMER_TRY try ------------------ 1107| 9.52k| if (next) { ------------------ | Branch (1107:21): [True: 5.63k, False: 3.89k] ------------------ 1108| 5.63k| auto count = idx + 1; 1109| 5.63k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 5.63k| auto newr = newn->relaxed(); 1111| 5.63k| newn->inner()[idx] = next; 1112| 5.63k| newr->d.sizes[idx] = last + 1 - ts; 1113| 5.63k| newr->d.count = count; 1114| 5.63k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 5.63k, False: 0] ------------------ 1115| 5.63k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 5.63k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 0, False: 3.89k] ------------------ 1117| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 3.89k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [True: 3.89k, Folded] | Branch (1118:40): [True: 3.03k, False: 851] | Branch (1118:52): [True: 2.21k, False: 823] ------------------ 1119| 2.21k| auto newn = pos.node()->inner()[0]; 1120| 2.21k| return std::make_tuple( 1121| 2.21k| pos.shift() - B, newn->inc(), ts, tail); 1122| 2.21k| } else { 1123| 1.67k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 1.67k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 1.67k| } 1126| 9.52k| } 1127| 9.52k| IMMER_CATCH (...) { 1128| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1128:17): [True: 0, False: 0] | Branch (1128:17): [True: 0, False: 0] | Branch (1128:17): [True: 0, False: 0] ------------------ 1129| 0| if (next) ------------------ | Branch (1129:21): [True: 0, False: 0] ------------------ 1130| 0| dec_inner(next, 1131| 0| pos.shift() - B, 1132| 0| last + 1 - ts - pos.size_before(idx)); 1133| 0| if (tail) ------------------ | Branch (1133:21): [True: 0, False: 0] ------------------ 1134| 0| dec_leaf(tail, ts); 1135| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1136| 0| } 1137| 9.52k| } 1138| 44.5k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 2.06k| { 1182| 2.06k| auto old_tail_size = pos.count(); 1183| 2.06k| auto new_tail_size = pos.index(last) + 1; 1184| 2.06k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.15k, False: 909] ------------------ 1185| 2.06k| ? pos.node()->inc() 1186| 2.06k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 2.06k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 2.06k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 5.65k| { 1182| 5.65k| auto old_tail_size = pos.count(); 1183| 5.65k| auto new_tail_size = pos.index(last) + 1; 1184| 5.65k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 2.47k, False: 3.17k] ------------------ 1185| 5.65k| ? pos.node()->inc() 1186| 5.65k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 5.65k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 5.65k| } _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| 12.9k| { 1097| 12.9k| auto idx = pos.index(last); 1098| 12.9k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [Folded, False: 12.9k] | Branch (1098:25): [True: 0, False: 0] ------------------ 1099| 0| return pos.towards_oh(this_t{}, last, idx); 1100| 12.9k| } else { 1101| 12.9k| using std::get; 1102| 12.9k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 12.9k| auto next = get<1>(subs); 1104| 12.9k| auto ts = get<2>(subs); 1105| 12.9k| auto tail = get<3>(subs); 1106| 12.9k| IMMER_TRY { ------------------ | | 49| 12.9k|#define IMMER_TRY try ------------------ 1107| 12.9k| if (next) { ------------------ | Branch (1107:21): [True: 6.76k, False: 6.16k] ------------------ 1108| 6.76k| auto count = idx + 1; 1109| 6.76k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 6.76k| auto newr = newn->relaxed(); 1111| 6.76k| newn->inner()[idx] = next; 1112| 6.76k| newr->d.sizes[idx] = last + 1 - ts; 1113| 6.76k| newr->d.count = count; 1114| 6.76k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 6.76k, False: 0] ------------------ 1115| 6.76k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 6.76k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 2.73k, False: 3.42k] ------------------ 1117| 2.73k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 3.42k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [Folded, False: 3.42k] | Branch (1118:40): [True: 0, False: 0] | Branch (1118:52): [True: 0, False: 0] ------------------ 1119| 0| auto newn = pos.node()->inner()[0]; 1120| 0| return std::make_tuple( 1121| 0| pos.shift() - B, newn->inc(), ts, tail); 1122| 3.42k| } else { 1123| 3.42k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 3.42k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 3.42k| } 1126| 12.9k| } 1127| 12.9k| IMMER_CATCH (...) { 1128| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1128:17): [True: 0, False: 0] | Branch (1128:17): [True: 0, False: 0] | Branch (1128:17): [True: 0, False: 0] ------------------ 1129| 0| if (next) ------------------ | Branch (1129:21): [True: 0, False: 0] ------------------ 1130| 0| dec_inner(next, 1131| 0| pos.shift() - B, 1132| 0| last + 1 - ts - pos.size_before(idx)); 1133| 0| if (tail) ------------------ | Branch (1133:21): [True: 0, False: 0] ------------------ 1134| 0| dec_leaf(tail, ts); 1135| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1136| 0| } 1137| 12.9k| } 1138| 12.9k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 3.87k| { 1143| 3.87k| auto idx = pos.index(last); 1144| 3.87k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 3.87k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 3.87k| } else { 1147| 3.87k| using std::get; 1148| 3.87k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 3.87k| auto next = get<1>(subs); 1150| 3.87k| auto ts = get<2>(subs); 1151| 3.87k| auto tail = get<3>(subs); 1152| 3.87k| IMMER_TRY { ------------------ | | 49| 3.87k|#define IMMER_TRY try ------------------ 1153| 3.87k| if (next) { ------------------ | Branch (1153:21): [True: 1.59k, False: 2.28k] ------------------ 1154| 1.59k| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 1.59k| newn->inner()[idx] = next; 1156| 1.59k| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.28k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 1.66k, False: 616] ------------------ 1158| 1.66k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.66k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 616] | 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| 616| } else { 1164| 616| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 616| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 616| } 1167| 3.87k| } 1168| 3.87k| 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.87k| } 1177| 3.87k| } _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.57k| { 1182| 5.57k| auto old_tail_size = pos.count(); 1183| 5.57k| auto new_tail_size = pos.index(last) + 1; 1184| 5.57k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 3.66k, False: 1.91k] ------------------ 1185| 5.57k| ? pos.node()->inc() 1186| 5.57k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 5.57k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 5.57k| } _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.10k| { 1143| 2.10k| auto idx = pos.index(last); 1144| 2.10k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.10k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.10k| } else { 1147| 2.10k| using std::get; 1148| 2.10k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.10k| auto next = get<1>(subs); 1150| 2.10k| auto ts = get<2>(subs); 1151| 2.10k| auto tail = get<3>(subs); 1152| 2.10k| IMMER_TRY { ------------------ | | 49| 2.10k|#define IMMER_TRY try ------------------ 1153| 2.10k| if (next) { ------------------ | Branch (1153:21): [True: 351, False: 1.74k] ------------------ 1154| 351| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 351| newn->inner()[idx] = next; 1156| 351| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.74k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 800, False: 949] ------------------ 1158| 800| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 949| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 949] | 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| 949| } else { 1164| 949| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 949| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 949| } 1167| 2.10k| } 1168| 2.10k| IMMER_CATCH (...) { 1169| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] ------------------ 1170| 0| assert(tail); ------------------ | Branch (1170:17): [True: 0, False: 0] ------------------ 1171| 0| if (next) ------------------ | Branch (1171:21): [True: 0, False: 0] ------------------ 1172| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1173| 0| dec_leaf(tail, ts); 1174| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1175| 0| } 1176| 2.10k| } 1177| 2.10k| } _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.15k, False: 1.12k] ------------------ 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| 5.25k| { 1143| 5.25k| auto idx = pos.index(last); 1144| 5.25k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 5.25k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 5.25k| } else { 1147| 5.25k| using std::get; 1148| 5.25k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 5.25k| auto next = get<1>(subs); 1150| 5.25k| auto ts = get<2>(subs); 1151| 5.25k| auto tail = get<3>(subs); 1152| 5.25k| IMMER_TRY { ------------------ | | 49| 5.25k|#define IMMER_TRY try ------------------ 1153| 5.25k| if (next) { ------------------ | Branch (1153:21): [True: 1.29k, False: 3.96k] ------------------ 1154| 1.29k| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 1.29k| newn->inner()[idx] = next; 1156| 1.29k| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 3.96k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 2.11k, False: 1.85k] ------------------ 1158| 2.11k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 2.11k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 1.85k] | 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.85k| } else { 1164| 1.85k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.85k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.85k| } 1167| 5.25k| } 1168| 5.25k| IMMER_CATCH (...) { 1169| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] ------------------ 1170| 0| assert(tail); ------------------ | Branch (1170:17): [True: 0, False: 0] ------------------ 1171| 0| if (next) ------------------ | Branch (1171:21): [True: 0, False: 0] ------------------ 1172| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1173| 0| dec_leaf(tail, ts); 1174| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1175| 0| } 1176| 5.25k| } 1177| 5.25k| } _ZN5immer6detail4rbts8dec_leafINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEvPT_j: 556| 39.9k|{ 557| 39.9k| make_leaf_sub_pos(node, n).visit(dec_visitor{}); 558| 39.9k|} _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 6.22k| { 1143| 6.22k| auto idx = pos.index(last); 1144| 6.22k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 6.22k, Folded] | Branch (1144:25): [True: 3.42k, False: 2.80k] ------------------ 1145| 3.42k| return pos.towards_oh(this_t{}, last, idx); 1146| 3.42k| } else { 1147| 2.80k| using std::get; 1148| 2.80k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.80k| auto next = get<1>(subs); 1150| 2.80k| auto ts = get<2>(subs); 1151| 2.80k| auto tail = get<3>(subs); 1152| 2.80k| IMMER_TRY { ------------------ | | 49| 2.80k|#define IMMER_TRY try ------------------ 1153| 2.80k| if (next) { ------------------ | Branch (1153:21): [True: 868, False: 1.93k] ------------------ 1154| 868| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 868| newn->inner()[idx] = next; 1156| 868| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.93k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 1.93k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.93k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 1.93k, Folded] | Branch (1159:40): [True: 1.57k, False: 364] | Branch (1159:52): [True: 1.16k, False: 410] ------------------ 1160| 1.16k| auto newn = pos.node()->inner()[0]; 1161| 1.16k| return std::make_tuple( 1162| 1.16k| pos.shift() - B, newn->inc(), ts, tail); 1163| 1.16k| } else { 1164| 774| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 774| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 774| } 1167| 2.80k| } 1168| 2.80k| 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.80k| } 1177| 6.22k| } _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.56k| { 1182| 1.56k| auto old_tail_size = pos.count(); 1183| 1.56k| auto new_tail_size = pos.index(last) + 1; 1184| 1.56k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 684, False: 880] ------------------ 1185| 1.56k| ? pos.node()->inc() 1186| 1.56k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.56k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.56k| } _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.51k| { 1143| 2.51k| auto idx = pos.index(last); 1144| 2.51k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 2.51k, Folded] | Branch (1144:25): [True: 1.34k, False: 1.17k] ------------------ 1145| 1.34k| return pos.towards_oh(this_t{}, last, idx); 1146| 1.34k| } else { 1147| 1.17k| using std::get; 1148| 1.17k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 1.17k| auto next = get<1>(subs); 1150| 1.17k| auto ts = get<2>(subs); 1151| 1.17k| auto tail = get<3>(subs); 1152| 1.17k| IMMER_TRY { ------------------ | | 49| 1.17k|#define IMMER_TRY try ------------------ 1153| 1.17k| if (next) { ------------------ | Branch (1153:21): [True: 339, False: 838] ------------------ 1154| 339| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 339| newn->inner()[idx] = next; 1156| 339| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 838| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 838] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 838| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 838, Folded] | Branch (1159:40): [True: 487, False: 351] | Branch (1159:52): [True: 205, False: 282] ------------------ 1160| 205| auto newn = pos.node()->inner()[0]; 1161| 205| return std::make_tuple( 1162| 205| pos.shift() - B, newn->inc(), ts, tail); 1163| 633| } else { 1164| 633| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 633| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 633| } 1167| 1.17k| } 1168| 1.17k| 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.17k| } 1177| 2.51k| } _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| 684| { 1182| 684| auto old_tail_size = pos.count(); 1183| 684| auto new_tail_size = pos.index(last) + 1; 1184| 684| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 279, False: 405] ------------------ 1185| 684| ? pos.node()->inc() 1186| 684| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 684| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 684| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE11visit_innerIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 15.7k| { 1415| 15.7k| auto idx = pos.subindex(first); 1416| 15.7k| auto count = pos.count(); 1417| 15.7k| auto left_size = pos.size_before(idx); 1418| 15.7k| auto child_size = pos.size_sbh(idx, left_size); 1419| 15.7k| auto dropped_size = first; 1420| 15.7k| auto child_dropped_size = dropped_size - left_size; 1421| 15.7k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 15.7k, Folded] | Branch (1421:25): [True: 14.3k, False: 1.47k] | Branch (1421:45): [True: 4.62k, False: 9.68k] ------------------ 1422| 4.62k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 11.1k| } else { 1424| 11.1k| using std::get; 1425| 11.1k| auto n = pos.node(); 1426| 11.1k| auto newc = count - idx; 1427| 11.1k| auto newn = node_t::make_inner_r_n(newc); 1428| 11.1k| IMMER_TRY { ------------------ | | 49| 11.1k|#define IMMER_TRY try ------------------ 1429| 11.1k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 11.1k| auto newr = newn->relaxed(); 1431| 11.1k| newr->d.count = count - idx; 1432| 11.1k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 11.1k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 11.1k, False: 0] ------------------ 1434| 11.1k| pos.copy_sizes(idx + 1, 1435| 11.1k| newr->d.count - 1, 1436| 11.1k| newr->d.sizes[0], 1437| 11.1k| newr->d.sizes + 1); 1438| 11.1k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 11.1k, False: 0] ------------------ 1439| 11.1k| pos.size() - dropped_size); 1440| 11.1k| newn->inner()[0] = get<1>(subs); 1441| 11.1k| std::copy(n->inner() + idx + 1, 1442| 11.1k| n->inner() + count, 1443| 11.1k| newn->inner() + 1); 1444| 11.1k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 11.1k| return std::make_tuple(pos.shift(), newn); 1446| 11.1k| } 1447| 11.1k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 11.1k| } 1452| 15.7k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1456| 8.93k| { 1457| 8.93k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 8.93k| return std::make_tuple(0, n); 1459| 8.93k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE11visit_innerIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 54.4k| { 1415| 54.4k| auto idx = pos.subindex(first); 1416| 54.4k| auto count = pos.count(); 1417| 54.4k| auto left_size = pos.size_before(idx); 1418| 54.4k| auto child_size = pos.size_sbh(idx, left_size); 1419| 54.4k| auto dropped_size = first; 1420| 54.4k| auto child_dropped_size = dropped_size - left_size; 1421| 54.4k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 54.4k] | Branch (1421:25): [True: 0, False: 0] | Branch (1421:45): [True: 0, False: 0] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 54.4k| } else { 1424| 54.4k| using std::get; 1425| 54.4k| auto n = pos.node(); 1426| 54.4k| auto newc = count - idx; 1427| 54.4k| auto newn = node_t::make_inner_r_n(newc); 1428| 54.4k| IMMER_TRY { ------------------ | | 49| 54.4k|#define IMMER_TRY try ------------------ 1429| 54.4k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 54.4k| auto newr = newn->relaxed(); 1431| 54.4k| newr->d.count = count - idx; 1432| 54.4k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 54.4k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 54.4k, False: 0] ------------------ 1434| 54.4k| pos.copy_sizes(idx + 1, 1435| 54.4k| newr->d.count - 1, 1436| 54.4k| newr->d.sizes[0], 1437| 54.4k| newr->d.sizes + 1); 1438| 54.4k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 54.4k, False: 0] ------------------ 1439| 54.4k| pos.size() - dropped_size); 1440| 54.4k| newn->inner()[0] = get<1>(subs); 1441| 54.4k| std::copy(n->inner() + idx + 1, 1442| 54.4k| n->inner() + count, 1443| 54.4k| newn->inner() + 1); 1444| 54.4k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 54.4k| return std::make_tuple(pos.shift(), newn); 1446| 54.4k| } 1447| 54.4k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 54.4k| } 1452| 54.4k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE11visit_innerIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 2.23k| { 1415| 2.23k| auto idx = pos.subindex(first); 1416| 2.23k| auto count = pos.count(); 1417| 2.23k| auto left_size = pos.size_before(idx); 1418| 2.23k| auto child_size = pos.size_sbh(idx, left_size); 1419| 2.23k| auto dropped_size = first; 1420| 2.23k| auto child_dropped_size = dropped_size - left_size; 1421| 2.23k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 2.23k] | 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.23k| } else { 1424| 2.23k| using std::get; 1425| 2.23k| auto n = pos.node(); 1426| 2.23k| auto newc = count - idx; 1427| 2.23k| auto newn = node_t::make_inner_r_n(newc); 1428| 2.23k| IMMER_TRY { ------------------ | | 49| 2.23k|#define IMMER_TRY try ------------------ 1429| 2.23k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 2.23k| auto newr = newn->relaxed(); 1431| 2.23k| newr->d.count = count - idx; 1432| 2.23k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 2.23k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 2.23k, False: 0] ------------------ 1434| 2.23k| pos.copy_sizes(idx + 1, 1435| 2.23k| newr->d.count - 1, 1436| 2.23k| newr->d.sizes[0], 1437| 2.23k| newr->d.sizes + 1); 1438| 2.23k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 2.23k, False: 0] ------------------ 1439| 2.23k| pos.size() - dropped_size); 1440| 2.23k| newn->inner()[0] = get<1>(subs); 1441| 2.23k| std::copy(n->inner() + idx + 1, 1442| 2.23k| n->inner() + count, 1443| 2.23k| newn->inner() + 1); 1444| 2.23k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 2.23k| return std::make_tuple(pos.shift(), newn); 1446| 2.23k| } 1447| 2.23k| 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.23k| } 1452| 2.23k| } _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.93k| { 1457| 8.93k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 8.93k| return std::make_tuple(0, n); 1459| 8.93k| } _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.18k| { 1415| 5.18k| auto idx = pos.subindex(first); 1416| 5.18k| auto count = pos.count(); 1417| 5.18k| auto left_size = pos.size_before(idx); 1418| 5.18k| auto child_size = pos.size_sbh(idx, left_size); 1419| 5.18k| auto dropped_size = first; 1420| 5.18k| auto child_dropped_size = dropped_size - left_size; 1421| 5.18k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 5.18k] | 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.18k| } else { 1424| 5.18k| using std::get; 1425| 5.18k| auto n = pos.node(); 1426| 5.18k| auto newc = count - idx; 1427| 5.18k| auto newn = node_t::make_inner_r_n(newc); 1428| 5.18k| IMMER_TRY { ------------------ | | 49| 5.18k|#define IMMER_TRY try ------------------ 1429| 5.18k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 5.18k| auto newr = newn->relaxed(); 1431| 5.18k| newr->d.count = count - idx; 1432| 5.18k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 5.18k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 5.18k, False: 0] ------------------ 1434| 5.18k| pos.copy_sizes(idx + 1, 1435| 5.18k| newr->d.count - 1, 1436| 5.18k| newr->d.sizes[0], 1437| 5.18k| newr->d.sizes + 1); 1438| 5.18k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 5.18k, False: 0] ------------------ 1439| 5.18k| pos.size() - dropped_size); 1440| 5.18k| newn->inner()[0] = get<1>(subs); 1441| 5.18k| std::copy(n->inner() + idx + 1, 1442| 5.18k| n->inner() + count, 1443| 5.18k| newn->inner() + 1); 1444| 5.18k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 5.18k| return std::make_tuple(pos.shift(), newn); 1446| 5.18k| } 1447| 5.18k| 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.18k| } 1452| 5.18k| } _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.39k| { 1415| 9.39k| auto idx = pos.subindex(first); 1416| 9.39k| auto count = pos.count(); 1417| 9.39k| auto left_size = pos.size_before(idx); 1418| 9.39k| auto child_size = pos.size_sbh(idx, left_size); 1419| 9.39k| auto dropped_size = first; 1420| 9.39k| auto child_dropped_size = dropped_size - left_size; 1421| 9.39k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 9.39k, Folded] | Branch (1421:25): [True: 6.48k, False: 2.91k] | Branch (1421:45): [True: 3.92k, False: 2.56k] ------------------ 1422| 3.92k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 5.47k| } else { 1424| 5.47k| using std::get; 1425| 5.47k| auto n = pos.node(); 1426| 5.47k| auto newc = count - idx; 1427| 5.47k| auto newn = node_t::make_inner_r_n(newc); 1428| 5.47k| IMMER_TRY { ------------------ | | 49| 5.47k|#define IMMER_TRY try ------------------ 1429| 5.47k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 5.47k| auto newr = newn->relaxed(); 1431| 5.47k| newr->d.count = count - idx; 1432| 5.47k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 5.47k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 5.47k, False: 0] ------------------ 1434| 5.47k| pos.copy_sizes(idx + 1, 1435| 5.47k| newr->d.count - 1, 1436| 5.47k| newr->d.sizes[0], 1437| 5.47k| newr->d.sizes + 1); 1438| 5.47k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 5.47k, False: 0] ------------------ 1439| 5.47k| pos.size() - dropped_size); 1440| 5.47k| newn->inner()[0] = get<1>(subs); 1441| 5.47k| std::copy(n->inner() + idx + 1, 1442| 5.47k| n->inner() + count, 1443| 5.47k| newn->inner() + 1); 1444| 5.47k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 5.47k| return std::make_tuple(pos.shift(), newn); 1446| 5.47k| } 1447| 5.47k| 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.47k| } 1452| 9.39k| } _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.50k| { 1415| 1.50k| auto idx = pos.subindex(first); 1416| 1.50k| auto count = pos.count(); 1417| 1.50k| auto left_size = pos.size_before(idx); 1418| 1.50k| auto child_size = pos.size_sbh(idx, left_size); 1419| 1.50k| auto dropped_size = first; 1420| 1.50k| auto child_dropped_size = dropped_size - left_size; 1421| 1.50k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 1.50k, Folded] | Branch (1421:25): [True: 476, False: 1.02k] | Branch (1421:45): [True: 272, False: 204] ------------------ 1422| 272| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 1.22k| } else { 1424| 1.22k| using std::get; 1425| 1.22k| auto n = pos.node(); 1426| 1.22k| auto newc = count - idx; 1427| 1.22k| auto newn = node_t::make_inner_r_n(newc); 1428| 1.22k| IMMER_TRY { ------------------ | | 49| 1.22k|#define IMMER_TRY try ------------------ 1429| 1.22k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 1.22k| auto newr = newn->relaxed(); 1431| 1.22k| newr->d.count = count - idx; 1432| 1.22k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 1.22k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 1.22k, False: 0] ------------------ 1434| 1.22k| pos.copy_sizes(idx + 1, 1435| 1.22k| newr->d.count - 1, 1436| 1.22k| newr->d.sizes[0], 1437| 1.22k| newr->d.sizes + 1); 1438| 1.22k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 1.22k, False: 0] ------------------ 1439| 1.22k| pos.size() - dropped_size); 1440| 1.22k| newn->inner()[0] = get<1>(subs); 1441| 1.22k| std::copy(n->inner() + idx + 1, 1442| 1.22k| n->inner() + count, 1443| 1.22k| newn->inner() + 1); 1444| 1.22k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 1.22k| return std::make_tuple(pos.shift(), newn); 1446| 1.22k| } 1447| 1.22k| 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.22k| } 1452| 1.50k| } _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.63k|{ 2002| 7.63k| return make_singleton_regular_sub_pos(ltail, ltcount) 2003| 7.63k| .visit(concat_trees_left_visitor{}, 2004| 7.63k| empty_leaf_pos{}, 2005| 7.63k| rroot, 2006| 7.63k| rshift, 2007| 7.63k| rsize) 2008| 7.63k| .realize(); 2009| 7.63k|} _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.63k| { 1972| 7.63k| return visit_maybe_relaxed_sub( 1973| 7.63k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 7.63k| } _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.34k| { 1959| 5.34k| return concat_inners(lpos, tpos, rpos); 1960| 5.34k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 23.0k|{ 1873| 23.0k| auto lshift = lpos.shift(); 1874| 23.0k| auto rshift = rpos.shift(); 1875| 23.0k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 23.0k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 23.0k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 18.1k, False: 4.96k] ------------------ 1879| 18.1k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 18.1k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 18.1k| } else { 1882| 4.96k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 4.96k, False: 0] ------------------ 1883| 4.96k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 4.96k] | Branch (1883:9): [True: 4.96k, False: 0] | Branch (1883:9): [True: 4.96k, False: 0] ------------------ 1884| 4.96k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 4.96k| return concat_rebalance(lpos, cpos, rpos); 1886| 4.96k| } 1887| 23.0k|} _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8each_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_: 1512| 5.39M| { 1513| 5.39M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 508k, False: 4.88M] ------------------ 1514| 508k| auto s = size_t{}; 1515| 2.02M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 1.51M, False: 508k] ------------------ 1516| 1.51M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 1.51M| s = sizes_[i]; 1518| 1.51M| } 1519| 4.88M| } else { 1520| 12.4M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 7.55M, False: 4.88M] ------------------ 1521| 7.55M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 7.55M| .visit(v, args...); 1523| 4.88M| } 1524| 5.39M| } _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.34M| { 1734| 2.34M| auto count = p.count(); 1735| 2.34M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 2.34M, False: 0] ------------------ 1736| 2.34M| plan.counts[plan.n++] = count; 1737| 2.34M| plan.total += count; 1738| 2.34M| } _ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_21concat_rebalance_planILj2ELj2EEEEEvOT_RT0_: 1733| 20.0M| { 1734| 20.0M| auto count = p.count(); 1735| 20.0M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 20.0M, False: 0] ------------------ 1736| 20.0M| plan.counts[plan.n++] = count; 1737| 20.0M| plan.total += count; 1738| 20.0M| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE7shuffleEj: 1762| 5.39M| { 1763| | // gcc seems to not really understand this code... :( 1764| 5.39M|#if !defined(_MSC_VER) 1765| 5.39M|#pragma GCC diagnostic push 1766| 5.39M|#pragma GCC diagnostic ignored "-Warray-bounds" 1767| 5.39M|#endif 1768| 5.39M| constexpr count_t rrb_extras = 2; 1769| 5.39M| constexpr count_t rrb_invariant = 1; 1770| 5.39M| const auto bits = shift == BL ? BL : B; ------------------ | Branch (1770:43): [True: 508k, False: 4.88M] ------------------ 1771| 5.39M| const auto branches = count_t{1} << bits; 1772| 5.39M| const auto optimal = ((total - 1) >> bits) + 1; 1773| 5.39M| count_t i = 0; 1774| 6.37M| while (n >= optimal + rrb_extras) { ------------------ | Branch (1774:16): [True: 980k, False: 5.39M] ------------------ 1775| | // skip ok nodes 1776| 1.61M| while (counts[i] > branches - rrb_invariant) ------------------ | Branch (1776:20): [True: 634k, False: 980k] ------------------ 1777| 634k| i++; 1778| 980k| assert(i < n); ------------------ | Branch (1778:13): [True: 980k, False: 0] ------------------ 1779| | // short node, redistribute 1780| 980k| auto remaining = counts[i]; 1781| 2.37M| do { 1782| 2.37M| auto next = counts[i + 1]; 1783| 2.37M| auto count = std::min(remaining + next, branches); 1784| 2.37M| counts[i] = count; 1785| 2.37M| assert(counts[i]); ------------------ | Branch (1785:17): [True: 2.37M, False: 0] ------------------ 1786| 2.37M| remaining += next - count; 1787| 2.37M| ++i; 1788| 2.37M| } while (remaining > 0); ------------------ | Branch (1788:22): [True: 1.39M, False: 980k] ------------------ 1789| | // remove node 1790| 980k| std::move(counts + i + 1, counts + n, counts + i); 1791| 980k| --n; 1792| 980k| --i; 1793| 980k| } 1794| 5.39M|#if !defined(_MSC_VER) 1795| 5.39M|#pragma GCC diagnostic pop 1796| 5.39M|#endif 1797| 5.39M| } _ZNK5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 1478| 10.7M| auto shift() const { return shift_; } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEC2EjPjj: 1577| 5.39M| : curr_{counts} 1578| 5.39M| , n_{n} 1579| 5.39M| , result_{ 1580| 5.39M| shift + B, node_t::make_inner_r_n(std::min(n_, branches)), 0} 1581| 5.39M| { 1582| 5.39M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEC2EjPSC_m: 1481| 5.39M| : shift_{s} 1482| 5.39M| , count_{1} 1483| 5.39M| , nodes_{n0} 1484| 5.39M| , sizes_{s0} 1485| 5.39M| { 1486| 5.39M| } _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.39M| { 1513| 5.39M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 508k, False: 4.88M] ------------------ 1514| 508k| auto s = size_t{}; 1515| 2.02M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 1.51M, False: 508k] ------------------ 1516| 1.51M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 1.51M| s = sizes_[i]; 1518| 1.51M| } 1519| 4.88M| } else { 1520| 12.4M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 7.55M, False: 4.88M] ------------------ 1521| 7.55M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 7.55M| .visit(v, args...); 1523| 4.88M| } 1524| 5.39M| } _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.34M| { 1722| 2.34M| merger.merge_leaf(p); 1723| 2.34M| } _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.34M| { 1615| 2.34M| auto from = p.node(); 1616| 2.34M| auto from_size = p.size(); 1617| 2.34M| auto from_count = p.count(); 1618| 2.34M| assert(from_size); ------------------ | Branch (1618:9): [True: 2.34M, False: 0] ------------------ 1619| 2.34M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 2.31M, False: 26.8k] | Branch (1619:21): [True: 2.30M, False: 15.5k] ------------------ 1620| 2.30M| add_child(from, from_size); 1621| 2.30M| from->inc(); 1622| 2.30M| } else { 1623| 42.3k| auto from_offset = count_t{}; 1624| 42.3k| auto from_data = from->leaf(); 1625| 53.0k| do { 1626| 53.0k| if (!to_) { ------------------ | Branch (1626:21): [True: 26.2k, False: 26.8k] ------------------ 1627| 26.2k| to_ = node_t::make_leaf_n(*curr_); 1628| 26.2k| to_offset_ = 0; 1629| 26.2k| } 1630| 53.0k| auto data = to_->leaf(); 1631| 53.0k| auto to_copy = 1632| 53.0k| std::min(from_count - from_offset, *curr_ - to_offset_); 1633| 53.0k| detail::uninitialized_copy(from_data + from_offset, 1634| 53.0k| from_data + from_offset + to_copy, 1635| 53.0k| data + to_offset_); 1636| 53.0k| to_offset_ += to_copy; 1637| 53.0k| from_offset += to_copy; 1638| 53.0k| if (*curr_ == to_offset_) { ------------------ | Branch (1638:21): [True: 26.2k, False: 26.8k] ------------------ 1639| 26.2k| add_child(to_, to_offset_); 1640| 26.2k| to_ = nullptr; 1641| 26.2k| } 1642| 53.0k| } while (from_offset != from_count); ------------------ | Branch (1642:22): [True: 10.7k, False: 42.3k] ------------------ 1643| 42.3k| } 1644| 2.34M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9add_childEPSC_m: 1589| 23.8M| { 1590| 23.8M| assert(size); ------------------ | Branch (1590:9): [True: 23.8M, False: 0] ------------------ 1591| 23.8M| ++curr_; 1592| 23.8M| auto parent = result_.nodes_[result_.count_ - 1]; 1593| 23.8M| auto relaxed = parent->relaxed(); 1594| 23.8M| if (relaxed->d.count == branches) { ------------------ | Branch (1594:13): [True: 2.70M, False: 21.1M] ------------------ 1595| 2.70M| assert(result_.count_ < result_t::max_children); ------------------ | Branch (1595:13): [True: 2.70M, False: 0] ------------------ 1596| 2.70M| n_ -= branches; 1597| 2.70M| parent = node_t::make_inner_r_n(std::min(n_, branches)); 1598| 2.70M| relaxed = parent->relaxed(); 1599| 2.70M| result_.nodes_[result_.count_] = parent; 1600| 2.70M| result_.sizes_[result_.count_] = result_.sizes_[result_.count_ - 1]; 1601| 2.70M| assert(result_.sizes_[result_.count_]); ------------------ | Branch (1601:13): [True: 2.70M, False: 0] ------------------ 1602| 2.70M| ++result_.count_; 1603| 2.70M| } 1604| 23.8M| auto idx = relaxed->d.count++; 1605| 23.8M| result_.sizes_[result_.count_ - 1] += size; 1606| 23.8M| assert(result_.sizes_[result_.count_ - 1]); ------------------ | Branch (1606:9): [True: 23.8M, False: 0] ------------------ 1607| 23.8M| relaxed->d.sizes[idx] = size + (idx ? relaxed->d.sizes[idx - 1] : 0); ------------------ | Branch (1607:41): [True: 15.7M, False: 8.10M] ------------------ 1608| 23.8M| assert(relaxed->d.sizes[idx]); ------------------ | Branch (1608:9): [True: 23.8M, False: 0] ------------------ 1609| 23.8M| parent->inner()[idx] = p; 1610| 23.8M| }; _ZN5immer6detail4rbts21concat_merger_visitor11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1715| 20.0M| { 1716| 20.0M| merger.merge_inner(p); 1717| 20.0M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11merge_innerIRNS1_11relaxed_posISC_EEEEvOT_: 1648| 20.0M| { 1649| 20.0M| auto from = p.node(); 1650| 20.0M| auto from_size = p.size(); 1651| 20.0M| auto from_count = p.count(); 1652| 20.0M| assert(from_size); ------------------ | Branch (1652:9): [True: 20.0M, False: 0] ------------------ 1653| 20.0M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 17.7M, False: 2.24M] | Branch (1653:21): [True: 16.8M, False: 950k] ------------------ 1654| 16.8M| add_child(from, from_size); 1655| 16.8M| from->inc(); 1656| 16.8M| } else { 1657| 3.19M| auto from_offset = count_t{}; 1658| 3.19M| auto from_data = from->inner(); 1659| 4.48M| do { 1660| 4.48M| if (!to_) { ------------------ | Branch (1660:21): [True: 2.23M, False: 2.24M] ------------------ 1661| 2.23M| to_ = node_t::make_inner_r_n(*curr_); 1662| 2.23M| to_offset_ = 0; 1663| 2.23M| to_size_ = 0; 1664| 2.23M| } 1665| 4.48M| auto data = to_->inner(); 1666| 4.48M| auto to_copy = 1667| 4.48M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 4.48M| std::copy(from_data + from_offset, 1669| 4.48M| from_data + from_offset + to_copy, 1670| 4.48M| data + to_offset_); 1671| 4.48M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 4.48M| auto sizes = to_->relaxed()->d.sizes; 1673| 4.48M| p.copy_sizes( 1674| 4.48M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 4.48M| to_offset_ += to_copy; 1676| 4.48M| from_offset += to_copy; 1677| 4.48M| to_size_ = sizes[to_offset_ - 1]; 1678| 4.48M| assert(to_size_); ------------------ | Branch (1678:17): [True: 4.48M, False: 0] ------------------ 1679| 4.48M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 2.23M, False: 2.24M] ------------------ 1680| 2.23M| to_->relaxed()->d.count = to_offset_; 1681| 2.23M| add_child(to_, to_size_); 1682| 2.23M| to_ = nullptr; 1683| 2.23M| } 1684| 4.48M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 1.28M, False: 3.19M] ------------------ 1685| 3.19M| } 1686| 20.0M| } _ZNK5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE6finishEv: 1689| 5.39M| { 1690| 5.39M| assert(!to_); ------------------ | Branch (1690:9): [True: 5.39M, False: 0] ------------------ 1691| 5.39M| return result_; 1692| 5.39M| } _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.39M| { 1513| 5.39M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 508k, False: 4.88M] ------------------ 1514| 508k| auto s = size_t{}; 1515| 2.02M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 1.51M, False: 508k] ------------------ 1516| 1.51M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 1.51M| s = sizes_[i]; 1518| 1.51M| } 1519| 4.88M| } else { 1520| 12.4M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 7.55M, False: 4.88M] ------------------ 1521| 7.55M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 7.55M| .visit(v, args...); 1523| 4.88M| } 1524| 5.39M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEC2EjPSC_mSE_mSE_m: 1503| 500k| : shift_{s} 1504| 500k| , count_{3} 1505| 500k| , nodes_{n0, n1, n2} 1506| 500k| , sizes_{s0, s0 + s1, s0 + s1 + s2} 1507| 500k| { 1508| 500k| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEC2EjPSC_mSE_m: 1489| 7.63k| : shift_{s} 1490| 7.63k| , count_{2} 1491| 7.63k| , nodes_{n0, n1} 1492| 7.63k| , sizes_{s0, s0 + s1} 1493| 7.63k| { 1494| 7.63k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 17.7k| { 1918| 17.7k| return concat_inners(lpos, tpos, rpos); 1919| 17.7k| } _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| 383| { 1918| 383| return concat_inners(lpos, tpos, rpos); 1919| 383| } _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.67k|{ 1873| 2.67k| auto lshift = lpos.shift(); 1874| 2.67k| auto rshift = rpos.shift(); 1875| 2.67k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 2.67k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 2.67k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 821, False: 1.85k] ------------------ 1879| 821| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 821| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.85k| } else { 1882| 1.85k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.85k, False: 0] ------------------ 1883| 1.85k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.85k] | Branch (1883:9): [True: 1.85k, False: 0] | Branch (1883:9): [True: 1.85k, False: 0] ------------------ 1884| 1.85k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.85k| return concat_rebalance(lpos, cpos, rpos); 1886| 1.85k| } 1887| 2.67k|} _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.21k| { 1918| 1.21k| return concat_inners(lpos, tpos, rpos); 1919| 1.21k| } _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.21k|{ 1873| 1.21k| auto lshift = lpos.shift(); 1874| 1.21k| auto rshift = rpos.shift(); 1875| 1.21k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 1.21k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 1.21k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 396, False: 821] ------------------ 1879| 396| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 396| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 821| } else { 1882| 821| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 821, False: 0] ------------------ 1883| 821| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 821] | Branch (1883:9): [True: 821, False: 0] | Branch (1883:9): [True: 821, False: 0] ------------------ 1884| 821| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 821| return concat_rebalance(lpos, cpos, rpos); 1886| 821| } 1887| 1.21k|} _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| 877|{ 1824| 877| auto plan = concat_rebalance_plan{}; 1825| 877| plan.fill(lpos, cpos, rpos); 1826| 877| plan.shuffle(cpos.shift()); 1827| 877| IMMER_TRY { ------------------ | | 49| 877|#define IMMER_TRY try ------------------ 1828| 877| return plan.merge(lpos, cpos, rpos); 1829| 877| } 1830| 877| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 877|} _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| 877| { 1753| 877| assert(n == 0u); ------------------ | Branch (1753:9): [True: 877, False: 0] ------------------ 1754| 877| assert(total == 0u); ------------------ | Branch (1754:9): [True: 877, False: 0] ------------------ 1755| 877| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 877| lpos.each_left_sub(visitor_t{}, *this); 1757| 877| cpos.each_sub(visitor_t{}, *this); 1758| 877| rpos.each_right_sub(visitor_t{}, *this); 1759| 877| } _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.06M| { 1734| 1.06M| auto count = p.count(); 1735| 1.06M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 1.06M, False: 0] ------------------ 1736| 1.06M| plan.counts[plan.n++] = count; 1737| 1.06M| plan.total += count; 1738| 1.06M| } _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| 769k| { 1734| 769k| auto count = p.count(); 1735| 769k| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 769k, False: 0] ------------------ 1736| 769k| plan.counts[plan.n++] = count; 1737| 769k| plan.total += count; 1738| 769k| } _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| 877| { 1803| 877| using node_t = node_type; 1804| 877| using merger_t = concat_merger; 1805| 877| using visitor_t = concat_merger_visitor; 1806| 877| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 877| IMMER_TRY { ------------------ | | 49| 877|#define IMMER_TRY try ------------------ 1808| 877| lpos.each_left_sub(visitor_t{}, merger); 1809| 877| cpos.each_sub(visitor_t{}, merger); 1810| 877| rpos.each_right_sub(visitor_t{}, merger); 1811| 877| cpos.each_sub(dec_visitor{}); 1812| 877| return merger.finish(); 1813| 877| } 1814| 877| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 877| } _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.06M| { 1722| 1.06M| merger.merge_leaf(p); 1723| 1.06M| } _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.06M| { 1615| 1.06M| auto from = p.node(); 1616| 1.06M| auto from_size = p.size(); 1617| 1.06M| auto from_count = p.count(); 1618| 1.06M| assert(from_size); ------------------ | Branch (1618:9): [True: 1.06M, False: 0] ------------------ 1619| 1.06M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 1.06M, False: 0] | Branch (1619:21): [True: 1.06M, False: 0] ------------------ 1620| 1.06M| add_child(from, from_size); 1621| 1.06M| from->inc(); 1622| 1.06M| } 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.06M| } _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| 769k| { 1716| 769k| merger.merge_inner(p); 1717| 769k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11merge_innerIRNS1_8full_posISC_EEEEvOT_: 1648| 769k| { 1649| 769k| auto from = p.node(); 1650| 769k| auto from_size = p.size(); 1651| 769k| auto from_count = p.count(); 1652| 769k| assert(from_size); ------------------ | Branch (1652:9): [True: 769k, False: 0] ------------------ 1653| 769k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 769k, False: 0] | Branch (1653:21): [True: 769k, False: 0] ------------------ 1654| 769k| add_child(from, from_size); 1655| 769k| from->inc(); 1656| 769k| } 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| 769k| } _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| 821| { 1945| 821| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 821| } _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.67k| { 1925| 2.67k| return concat_leafs(lpos, tpos, rpos); 1926| 2.67k| } _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.67k|{ 1839| 2.67k| static_assert(Node::bits >= 2, ""); 1840| 2.67k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 2.67k, False: 0] ------------------ 1841| 2.67k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 2.67k, False: 0] ------------------ 1842| 2.67k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 2.67k, False: 0] ------------------ 1843| 2.67k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 2.67k] ------------------ 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.67k| else 1854| 2.67k| return { 1855| 2.67k| Node::bits_leaf, 1856| 2.67k| lpos.node()->inc(), 1857| 2.67k| lpos.count(), 1858| 2.67k| rpos.node()->inc(), 1859| 2.67k| rpos.count(), 1860| 2.67k| }; 1861| 2.67k|} _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| 821|{ 1824| 821| auto plan = concat_rebalance_plan{}; 1825| 821| plan.fill(lpos, cpos, rpos); 1826| 821| plan.shuffle(cpos.shift()); 1827| 821| IMMER_TRY { ------------------ | | 49| 821|#define IMMER_TRY try ------------------ 1828| 821| return plan.merge(lpos, cpos, rpos); 1829| 821| } 1830| 821| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 821|} _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| 821| { 1753| 821| assert(n == 0u); ------------------ | Branch (1753:9): [True: 821, False: 0] ------------------ 1754| 821| assert(total == 0u); ------------------ | Branch (1754:9): [True: 821, False: 0] ------------------ 1755| 821| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 821| lpos.each_left_sub(visitor_t{}, *this); 1757| 821| cpos.each_sub(visitor_t{}, *this); 1758| 821| rpos.each_right_sub(visitor_t{}, *this); 1759| 821| } _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| 821| { 1803| 821| using node_t = node_type; 1804| 821| using merger_t = concat_merger; 1805| 821| using visitor_t = concat_merger_visitor; 1806| 821| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 821| IMMER_TRY { ------------------ | | 49| 821|#define IMMER_TRY try ------------------ 1808| 821| lpos.each_left_sub(visitor_t{}, merger); 1809| 821| cpos.each_sub(visitor_t{}, merger); 1810| 821| rpos.each_right_sub(visitor_t{}, merger); 1811| 821| cpos.each_sub(dec_visitor{}); 1812| 821| return merger.finish(); 1813| 821| } 1814| 821| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 821| } _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.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_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.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| } _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| 666k| { 1734| 666k| auto count = p.count(); 1735| 666k| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 666k, False: 0] ------------------ 1736| 666k| plan.counts[plan.n++] = count; 1737| 666k| plan.total += count; 1738| 666k| } _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.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| } _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| 666k| { 1716| 666k| merger.merge_inner(p); 1717| 666k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11merge_innerIRNS1_15regular_sub_posISC_EEEEvOT_: 1648| 666k| { 1649| 666k| auto from = p.node(); 1650| 666k| auto from_size = p.size(); 1651| 666k| auto from_count = p.count(); 1652| 666k| assert(from_size); ------------------ | Branch (1652:9): [True: 666k, False: 0] ------------------ 1653| 666k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 564k, False: 101k] | Branch (1653:21): [True: 564k, False: 0] ------------------ 1654| 564k| add_child(from, from_size); 1655| 564k| from->inc(); 1656| 564k| } else { 1657| 101k| auto from_offset = count_t{}; 1658| 101k| auto from_data = from->inner(); 1659| 203k| do { 1660| 203k| if (!to_) { ------------------ | Branch (1660:21): [True: 101k, False: 101k] ------------------ 1661| 101k| to_ = node_t::make_inner_r_n(*curr_); 1662| 101k| to_offset_ = 0; 1663| 101k| to_size_ = 0; 1664| 101k| } 1665| 203k| auto data = to_->inner(); 1666| 203k| auto to_copy = 1667| 203k| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 203k| std::copy(from_data + from_offset, 1669| 203k| from_data + from_offset + to_copy, 1670| 203k| data + to_offset_); 1671| 203k| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 203k| auto sizes = to_->relaxed()->d.sizes; 1673| 203k| p.copy_sizes( 1674| 203k| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 203k| to_offset_ += to_copy; 1676| 203k| from_offset += to_copy; 1677| 203k| to_size_ = sizes[to_offset_ - 1]; 1678| 203k| assert(to_size_); ------------------ | Branch (1678:17): [True: 203k, False: 0] ------------------ 1679| 203k| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 101k, False: 101k] ------------------ 1680| 101k| to_->relaxed()->d.count = to_offset_; 1681| 101k| add_child(to_, to_size_); 1682| 101k| to_ = nullptr; 1683| 101k| } 1684| 203k| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 101k, False: 101k] ------------------ 1685| 101k| } 1686| 666k| } _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.85k| { 1945| 1.85k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 1.85k| } _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| 4.96k| { 1925| 4.96k| return concat_leafs(lpos, tpos, rpos); 1926| 4.96k| } _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| 4.96k|{ 1839| 4.96k| static_assert(Node::bits >= 2, ""); 1840| 4.96k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 4.96k, False: 0] ------------------ 1841| 4.96k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 4.96k, False: 0] ------------------ 1842| 4.96k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 4.96k, False: 0] ------------------ 1843| 4.96k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 4.96k] ------------------ 1844| 0| return { 1845| 0| Node::bits_leaf, 1846| 0| lpos.node()->inc(), 1847| 0| lpos.count(), 1848| 0| tpos.node()->inc(), 1849| 0| tpos.count(), 1850| 0| rpos.node()->inc(), 1851| 0| rpos.count(), 1852| 0| }; 1853| 4.96k| else 1854| 4.96k| return { 1855| 4.96k| Node::bits_leaf, 1856| 4.96k| lpos.node()->inc(), 1857| 4.96k| lpos.count(), 1858| 4.96k| rpos.node()->inc(), 1859| 4.96k| rpos.count(), 1860| 4.96k| }; 1861| 4.96k|} _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.85k|{ 1824| 1.85k| auto plan = concat_rebalance_plan{}; 1825| 1.85k| plan.fill(lpos, cpos, rpos); 1826| 1.85k| plan.shuffle(cpos.shift()); 1827| 1.85k| IMMER_TRY { ------------------ | | 49| 1.85k|#define IMMER_TRY try ------------------ 1828| 1.85k| return plan.merge(lpos, cpos, rpos); 1829| 1.85k| } 1830| 1.85k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.85k|} _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.85k| { 1753| 1.85k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.85k, False: 0] ------------------ 1754| 1.85k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.85k, False: 0] ------------------ 1755| 1.85k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.85k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.85k| cpos.each_sub(visitor_t{}, *this); 1758| 1.85k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.85k| } _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.85k| { 1803| 1.85k| using node_t = node_type; 1804| 1.85k| using merger_t = concat_merger; 1805| 1.85k| using visitor_t = concat_merger_visitor; 1806| 1.85k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.85k| IMMER_TRY { ------------------ | | 49| 1.85k|#define IMMER_TRY try ------------------ 1808| 1.85k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.85k| cpos.each_sub(visitor_t{}, merger); 1810| 1.85k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.85k| cpos.each_sub(dec_visitor{}); 1812| 1.85k| return merger.finish(); 1813| 1.85k| } 1814| 1.85k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.85k| } _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| 125k|{ 1824| 125k| auto plan = concat_rebalance_plan{}; 1825| 125k| plan.fill(lpos, cpos, rpos); 1826| 125k| plan.shuffle(cpos.shift()); 1827| 125k| IMMER_TRY { ------------------ | | 49| 125k|#define IMMER_TRY try ------------------ 1828| 125k| return plan.merge(lpos, cpos, rpos); 1829| 125k| } 1830| 125k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 125k|} _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| 125k| { 1753| 125k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 125k, False: 0] ------------------ 1754| 125k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 125k, False: 0] ------------------ 1755| 125k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 125k| lpos.each_left_sub(visitor_t{}, *this); 1757| 125k| cpos.each_sub(visitor_t{}, *this); 1758| 125k| rpos.each_right_sub(visitor_t{}, *this); 1759| 125k| } _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| 125k| { 1803| 125k| using node_t = node_type; 1804| 125k| using merger_t = concat_merger; 1805| 125k| using visitor_t = concat_merger_visitor; 1806| 125k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 125k| IMMER_TRY { ------------------ | | 49| 125k|#define IMMER_TRY try ------------------ 1808| 125k| lpos.each_left_sub(visitor_t{}, merger); 1809| 125k| cpos.each_sub(visitor_t{}, merger); 1810| 125k| rpos.each_right_sub(visitor_t{}, merger); 1811| 125k| cpos.each_sub(dec_visitor{}); 1812| 125k| return merger.finish(); 1813| 125k| } 1814| 125k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 125k| } _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| 4.96k| { 1945| 4.96k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 4.96k| } _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| 4.96k|{ 1824| 4.96k| auto plan = concat_rebalance_plan{}; 1825| 4.96k| plan.fill(lpos, cpos, rpos); 1826| 4.96k| plan.shuffle(cpos.shift()); 1827| 4.96k| IMMER_TRY { ------------------ | | 49| 4.96k|#define IMMER_TRY try ------------------ 1828| 4.96k| return plan.merge(lpos, cpos, rpos); 1829| 4.96k| } 1830| 4.96k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 4.96k|} _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| 4.96k| { 1753| 4.96k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 4.96k, False: 0] ------------------ 1754| 4.96k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 4.96k, False: 0] ------------------ 1755| 4.96k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 4.96k| lpos.each_left_sub(visitor_t{}, *this); 1757| 4.96k| cpos.each_sub(visitor_t{}, *this); 1758| 4.96k| rpos.each_right_sub(visitor_t{}, *this); 1759| 4.96k| } _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| 4.96k| { 1803| 4.96k| using node_t = node_type; 1804| 4.96k| using merger_t = concat_merger; 1805| 4.96k| using visitor_t = concat_merger_visitor; 1806| 4.96k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 4.96k| IMMER_TRY { ------------------ | | 49| 4.96k|#define IMMER_TRY try ------------------ 1808| 4.96k| lpos.each_left_sub(visitor_t{}, merger); 1809| 4.96k| cpos.each_sub(visitor_t{}, merger); 1810| 4.96k| rpos.each_right_sub(visitor_t{}, merger); 1811| 4.96k| cpos.each_sub(dec_visitor{}); 1812| 4.96k| return merger.finish(); 1813| 4.96k| } 1814| 4.96k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 4.96k| } _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.28k| { 1959| 2.28k| return concat_inners(lpos, tpos, rpos); 1960| 2.28k| } _ZNO5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7realizeEv: 1527| 508k| { 1528| 508k| if (count_ > 1) { ------------------ | Branch (1528:13): [True: 37.5k, False: 471k] ------------------ 1529| 37.5k| IMMER_TRY { ------------------ | | 49| 37.5k|#define IMMER_TRY try ------------------ 1530| 37.5k| auto result = node_t::make_inner_r_n(count_); 1531| 37.5k| auto r = result->relaxed(); 1532| 37.5k| r->d.count = count_; 1533| 37.5k| std::copy(nodes_, nodes_ + count_, result->inner()); 1534| 37.5k| std::copy(sizes_, sizes_ + count_, r->d.sizes); 1535| 37.5k| return {result, shift_, r}; 1536| 37.5k| } 1537| 37.5k| IMMER_CATCH (...) { 1538| 0| each_sub(dec_visitor{}); 1539| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1540| 0| } 1541| 471k| } else { 1542| 471k| assert(shift_ >= B + BL); ------------------ | Branch (1542:13): [True: 471k, False: 0] ------------------ 1543| 471k| return {nodes_[0], shift_ - B, nodes_[0]->relaxed()}; 1544| 471k| } 1545| 508k| } _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| 500k|{ 1987| 500k| return visit_maybe_relaxed_sub(lroot, 1988| 500k| lshift, 1989| 500k| lsize, 1990| 500k| concat_trees_left_visitor{}, 1991| 500k| make_leaf_pos(ltail, ltcount), 1992| 500k| rroot, 1993| 500k| rshift, 1994| 500k| rsize) 1995| 500k| .realize(); 1996| 500k|} _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| 486k| { 1972| 486k| return visit_maybe_relaxed_sub( 1973| 486k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 486k| } _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| 463k| { 1959| 463k| return concat_inners(lpos, tpos, rpos); 1960| 463k| } _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.29M|{ 1873| 4.29M| auto lshift = lpos.shift(); 1874| 4.29M| auto rshift = rpos.shift(); 1875| 4.29M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 2.09M, False: 2.20M] ------------------ 1876| 2.09M| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 2.09M| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 2.20M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 95.7k, False: 2.11M] ------------------ 1879| 95.7k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 95.7k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 2.11M| } else { 1882| 2.11M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 2.11M, False: 0] ------------------ 1883| 2.11M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 2.11M] | Branch (1883:9): [True: 2.11M, False: 0] | Branch (1883:9): [True: 2.11M, False: 0] ------------------ 1884| 2.11M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 2.11M| return concat_rebalance(lpos, cpos, rpos); 1886| 2.11M| } 1887| 4.29M|} _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.08M| { 1898| 2.08M| return concat_inners(lpos, tpos, rpos); 1899| 2.08M| } _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.85k| { 1898| 5.85k| return concat_inners(lpos, tpos, rpos); 1899| 5.85k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 660k|{ 1873| 660k| auto lshift = lpos.shift(); 1874| 660k| auto rshift = rpos.shift(); 1875| 660k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 3.47k, False: 656k] ------------------ 1876| 3.47k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 3.47k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 656k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 11.5k, False: 645k] ------------------ 1879| 11.5k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 11.5k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 645k| } else { 1882| 645k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 645k, False: 0] ------------------ 1883| 645k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 645k] | Branch (1883:9): [True: 645k, False: 0] | Branch (1883:9): [True: 645k, False: 0] ------------------ 1884| 645k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 645k| return concat_rebalance(lpos, cpos, rpos); 1886| 645k| } 1887| 660k|} _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EENS1_12null_sub_posEEENSG_IT_EEOT0_OT1_OT2_: 1823| 4.24k|{ 1824| 4.24k| auto plan = concat_rebalance_plan{}; 1825| 4.24k| plan.fill(lpos, cpos, rpos); 1826| 4.24k| plan.shuffle(cpos.shift()); 1827| 4.24k| IMMER_TRY { ------------------ | | 49| 4.24k|#define IMMER_TRY try ------------------ 1828| 4.24k| return plan.merge(lpos, cpos, rpos); 1829| 4.24k| } 1830| 4.24k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 4.24k|} _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.24k| { 1753| 4.24k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 4.24k, False: 0] ------------------ 1754| 4.24k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 4.24k, False: 0] ------------------ 1755| 4.24k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 4.24k| lpos.each_left_sub(visitor_t{}, *this); 1757| 4.24k| cpos.each_sub(visitor_t{}, *this); 1758| 4.24k| rpos.each_right_sub(visitor_t{}, *this); 1759| 4.24k| } _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.24k| { 1803| 4.24k| using node_t = node_type; 1804| 4.24k| using merger_t = concat_merger; 1805| 4.24k| using visitor_t = concat_merger_visitor; 1806| 4.24k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 4.24k| IMMER_TRY { ------------------ | | 49| 4.24k|#define IMMER_TRY try ------------------ 1808| 4.24k| lpos.each_left_sub(visitor_t{}, merger); 1809| 4.24k| cpos.each_sub(visitor_t{}, merger); 1810| 4.24k| rpos.each_right_sub(visitor_t{}, merger); 1811| 4.24k| cpos.each_sub(dec_visitor{}); 1812| 4.24k| return merger.finish(); 1813| 4.24k| } 1814| 4.24k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 4.24k| } _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| 647k| { 1918| 647k| return concat_inners(lpos, tpos, rpos); 1919| 647k| } _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| 113k| { 1918| 113k| return concat_inners(lpos, tpos, rpos); 1919| 113k| } _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| 122k|{ 1873| 122k| auto lshift = lpos.shift(); 1874| 122k| auto rshift = rpos.shift(); 1875| 122k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 768, False: 121k] ------------------ 1876| 768| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 768| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 121k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 459, False: 120k] ------------------ 1879| 459| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 459| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 120k| } else { 1882| 120k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 120k, False: 0] ------------------ 1883| 120k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 120k] | Branch (1883:9): [True: 120k, False: 0] | Branch (1883:9): [True: 120k, False: 0] ------------------ 1884| 120k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 120k| return concat_rebalance(lpos, cpos, rpos); 1886| 120k| } 1887| 122k|} _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.16k| { 1898| 1.16k| return concat_inners(lpos, tpos, rpos); 1899| 1.16k| } _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| 130k| { 1918| 130k| return concat_inners(lpos, tpos, rpos); 1919| 130k| } _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| 130k|{ 1873| 130k| auto lshift = lpos.shift(); 1874| 130k| auto rshift = rpos.shift(); 1875| 130k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 130k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 130k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 218, False: 130k] ------------------ 1879| 218| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 218| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 130k| } else { 1882| 130k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 130k, False: 0] ------------------ 1883| 130k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 130k] | Branch (1883:9): [True: 130k, False: 0] | Branch (1883:9): [True: 130k, False: 0] ------------------ 1884| 130k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 130k| return concat_rebalance(lpos, cpos, rpos); 1886| 130k| } 1887| 130k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 69.9k| { 1945| 69.9k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 69.9k| } _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| 149k| { 1925| 149k| return concat_leafs(lpos, tpos, rpos); 1926| 149k| } _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| 149k|{ 1839| 149k| static_assert(Node::bits >= 2, ""); 1840| 149k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 149k, False: 0] ------------------ 1841| 149k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 149k, False: 0] ------------------ 1842| 149k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 149k, False: 0] ------------------ 1843| 149k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 149k, False: 0] ------------------ 1844| 149k| return { 1845| 149k| Node::bits_leaf, 1846| 149k| lpos.node()->inc(), 1847| 149k| lpos.count(), 1848| 149k| tpos.node()->inc(), 1849| 149k| tpos.count(), 1850| 149k| rpos.node()->inc(), 1851| 149k| rpos.count(), 1852| 149k| }; 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| 149k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 63.8k| { 1938| 63.8k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 63.8k| } _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| 130k|{ 1824| 130k| auto plan = concat_rebalance_plan{}; 1825| 130k| plan.fill(lpos, cpos, rpos); 1826| 130k| plan.shuffle(cpos.shift()); 1827| 130k| IMMER_TRY { ------------------ | | 49| 130k|#define IMMER_TRY try ------------------ 1828| 130k| return plan.merge(lpos, cpos, rpos); 1829| 130k| } 1830| 130k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 130k|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEEvOT_OT0_OT1_: 1752| 130k| { 1753| 130k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 130k, False: 0] ------------------ 1754| 130k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 130k, False: 0] ------------------ 1755| 130k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 130k| lpos.each_left_sub(visitor_t{}, *this); 1757| 130k| cpos.each_sub(visitor_t{}, *this); 1758| 130k| rpos.each_right_sub(visitor_t{}, *this); 1759| 130k| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 130k| { 1803| 130k| using node_t = node_type; 1804| 130k| using merger_t = concat_merger; 1805| 130k| using visitor_t = concat_merger_visitor; 1806| 130k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 130k| IMMER_TRY { ------------------ | | 49| 130k|#define IMMER_TRY try ------------------ 1808| 130k| lpos.each_left_sub(visitor_t{}, merger); 1809| 130k| cpos.each_sub(visitor_t{}, merger); 1810| 130k| rpos.each_right_sub(visitor_t{}, merger); 1811| 130k| cpos.each_sub(dec_visitor{}); 1812| 130k| return merger.finish(); 1813| 130k| } 1814| 130k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 130k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 79.1k| { 1945| 79.1k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 79.1k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1924| 351k| { 1925| 351k| return concat_leafs(lpos, tpos, rpos); 1926| 351k| } _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| 351k|{ 1839| 351k| static_assert(Node::bits >= 2, ""); 1840| 351k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 351k, False: 0] ------------------ 1841| 351k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 351k, False: 0] ------------------ 1842| 351k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 351k, False: 0] ------------------ 1843| 351k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 351k, False: 0] ------------------ 1844| 351k| return { 1845| 351k| Node::bits_leaf, 1846| 351k| lpos.node()->inc(), 1847| 351k| lpos.count(), 1848| 351k| tpos.node()->inc(), 1849| 351k| tpos.count(), 1850| 351k| rpos.node()->inc(), 1851| 351k| rpos.count(), 1852| 351k| }; 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| 351k|} _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| 65.7k| { 1938| 65.7k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 65.7k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EESF_EENSG_IT_EEOT0_OT1_OT2_: 1823| 120k|{ 1824| 120k| auto plan = concat_rebalance_plan{}; 1825| 120k| plan.fill(lpos, cpos, rpos); 1826| 120k| plan.shuffle(cpos.shift()); 1827| 120k| IMMER_TRY { ------------------ | | 49| 120k|#define IMMER_TRY try ------------------ 1828| 120k| return plan.merge(lpos, cpos, rpos); 1829| 120k| } 1830| 120k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 120k|} _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| 120k| { 1753| 120k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 120k, False: 0] ------------------ 1754| 120k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 120k, False: 0] ------------------ 1755| 120k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 120k| lpos.each_left_sub(visitor_t{}, *this); 1757| 120k| cpos.each_sub(visitor_t{}, *this); 1758| 120k| rpos.each_right_sub(visitor_t{}, *this); 1759| 120k| } _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| 120k| { 1803| 120k| using node_t = node_type; 1804| 120k| using merger_t = concat_merger; 1805| 120k| using visitor_t = concat_merger_visitor; 1806| 120k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 120k| IMMER_TRY { ------------------ | | 49| 120k|#define IMMER_TRY try ------------------ 1808| 120k| lpos.each_left_sub(visitor_t{}, merger); 1809| 120k| cpos.each_sub(visitor_t{}, merger); 1810| 120k| rpos.each_right_sub(visitor_t{}, merger); 1811| 120k| cpos.each_sub(dec_visitor{}); 1812| 120k| return merger.finish(); 1813| 120k| } 1814| 120k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 120k| } _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| 351k| { 1945| 351k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 351k| } _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| 749k| { 1938| 749k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 749k| } _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| 645k|{ 1824| 645k| auto plan = concat_rebalance_plan{}; 1825| 645k| plan.fill(lpos, cpos, rpos); 1826| 645k| plan.shuffle(cpos.shift()); 1827| 645k| IMMER_TRY { ------------------ | | 49| 645k|#define IMMER_TRY try ------------------ 1828| 645k| return plan.merge(lpos, cpos, rpos); 1829| 645k| } 1830| 645k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 645k|} _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| 645k| { 1753| 645k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 645k, False: 0] ------------------ 1754| 645k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 645k, False: 0] ------------------ 1755| 645k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 645k| lpos.each_left_sub(visitor_t{}, *this); 1757| 645k| cpos.each_sub(visitor_t{}, *this); 1758| 645k| rpos.each_right_sub(visitor_t{}, *this); 1759| 645k| } _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| 645k| { 1803| 645k| using node_t = node_type; 1804| 645k| using merger_t = concat_merger; 1805| 645k| using visitor_t = concat_merger_visitor; 1806| 645k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 645k| IMMER_TRY { ------------------ | | 49| 645k|#define IMMER_TRY try ------------------ 1808| 645k| lpos.each_left_sub(visitor_t{}, merger); 1809| 645k| cpos.each_sub(visitor_t{}, merger); 1810| 645k| rpos.each_right_sub(visitor_t{}, merger); 1811| 645k| cpos.each_sub(dec_visitor{}); 1812| 645k| return merger.finish(); 1813| 645k| } 1814| 645k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 645k| } _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.21M|{ 1824| 2.21M| auto plan = concat_rebalance_plan{}; 1825| 2.21M| plan.fill(lpos, cpos, rpos); 1826| 2.21M| plan.shuffle(cpos.shift()); 1827| 2.21M| IMMER_TRY { ------------------ | | 49| 2.21M|#define IMMER_TRY try ------------------ 1828| 2.21M| return plan.merge(lpos, cpos, rpos); 1829| 2.21M| } 1830| 2.21M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.21M|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEEvOT_OT0_OT1_: 1752| 2.21M| { 1753| 2.21M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.21M, False: 0] ------------------ 1754| 2.21M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.21M, False: 0] ------------------ 1755| 2.21M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.21M| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.21M| cpos.each_sub(visitor_t{}, *this); 1758| 2.21M| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.21M| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 2.21M| { 1803| 2.21M| using node_t = node_type; 1804| 2.21M| using merger_t = concat_merger; 1805| 2.21M| using visitor_t = concat_merger_visitor; 1806| 2.21M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.21M| IMMER_TRY { ------------------ | | 49| 2.21M|#define IMMER_TRY try ------------------ 1808| 2.21M| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.21M| cpos.each_sub(visitor_t{}, merger); 1810| 2.21M| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.21M| cpos.each_sub(dec_visitor{}); 1812| 2.21M| return merger.finish(); 1813| 2.21M| } 1814| 2.21M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.21M| } _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.74M| { 1918| 1.74M| return concat_inners(lpos, tpos, rpos); 1919| 1.74M| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 4.59k| { 1918| 4.59k| return concat_inners(lpos, tpos, rpos); 1919| 4.59k| } _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| 152k|{ 1873| 152k| auto lshift = lpos.shift(); 1874| 152k| auto rshift = rpos.shift(); 1875| 152k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 124k, False: 27.7k] ------------------ 1876| 124k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 124k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 124k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 714, False: 26.9k] ------------------ 1879| 714| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 714| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 26.9k| } else { 1882| 26.9k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 26.9k, False: 0] ------------------ 1883| 26.9k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 26.9k] | Branch (1883:9): [True: 26.9k, False: 0] | Branch (1883:9): [True: 26.9k, False: 0] ------------------ 1884| 26.9k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 26.9k| return concat_rebalance(lpos, cpos, rpos); 1886| 26.9k| } 1887| 152k|} _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| 124k| { 1898| 124k| return concat_inners(lpos, tpos, rpos); 1899| 124k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_8full_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1917| 6.09k| { 1918| 6.09k| return concat_inners(lpos, tpos, rpos); 1919| 6.09k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 6.09k|{ 1873| 6.09k| auto lshift = lpos.shift(); 1874| 6.09k| auto rshift = rpos.shift(); 1875| 6.09k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 6.09k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 6.09k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 263, False: 5.83k] ------------------ 1879| 263| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 263| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 5.83k| } else { 1882| 5.83k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 5.83k, False: 0] ------------------ 1883| 5.83k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 5.83k] | Branch (1883:9): [True: 5.83k, False: 0] | Branch (1883:9): [True: 5.83k, False: 0] ------------------ 1884| 5.83k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 5.83k| return concat_rebalance(lpos, cpos, rpos); 1886| 5.83k| } 1887| 6.09k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 2.02k| { 1938| 2.02k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 2.02k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 5.83k|{ 1824| 5.83k| auto plan = concat_rebalance_plan{}; 1825| 5.83k| plan.fill(lpos, cpos, rpos); 1826| 5.83k| plan.shuffle(cpos.shift()); 1827| 5.83k| IMMER_TRY { ------------------ | | 49| 5.83k|#define IMMER_TRY try ------------------ 1828| 5.83k| return plan.merge(lpos, cpos, rpos); 1829| 5.83k| } 1830| 5.83k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 5.83k|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEEvOT_OT0_OT1_: 1752| 5.83k| { 1753| 5.83k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 5.83k, False: 0] ------------------ 1754| 5.83k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 5.83k, False: 0] ------------------ 1755| 5.83k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 5.83k| lpos.each_left_sub(visitor_t{}, *this); 1757| 5.83k| cpos.each_sub(visitor_t{}, *this); 1758| 5.83k| rpos.each_right_sub(visitor_t{}, *this); 1759| 5.83k| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 5.83k| { 1803| 5.83k| using node_t = node_type; 1804| 5.83k| using merger_t = concat_merger; 1805| 5.83k| using visitor_t = concat_merger_visitor; 1806| 5.83k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 5.83k| IMMER_TRY { ------------------ | | 49| 5.83k|#define IMMER_TRY try ------------------ 1808| 5.83k| lpos.each_left_sub(visitor_t{}, merger); 1809| 5.83k| cpos.each_sub(visitor_t{}, merger); 1810| 5.83k| rpos.each_right_sub(visitor_t{}, merger); 1811| 5.83k| cpos.each_sub(dec_visitor{}); 1812| 5.83k| return merger.finish(); 1813| 5.83k| } 1814| 5.83k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 5.83k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 3.09k| { 1938| 3.09k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 3.09k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EERNS1_15regular_sub_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 26.9k|{ 1824| 26.9k| auto plan = concat_rebalance_plan{}; 1825| 26.9k| plan.fill(lpos, cpos, rpos); 1826| 26.9k| plan.shuffle(cpos.shift()); 1827| 26.9k| IMMER_TRY { ------------------ | | 49| 26.9k|#define IMMER_TRY try ------------------ 1828| 26.9k| return plan.merge(lpos, cpos, rpos); 1829| 26.9k| } 1830| 26.9k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 26.9k|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEEvOT_OT0_OT1_: 1752| 26.9k| { 1753| 26.9k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 26.9k, False: 0] ------------------ 1754| 26.9k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 26.9k, False: 0] ------------------ 1755| 26.9k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 26.9k| lpos.each_left_sub(visitor_t{}, *this); 1757| 26.9k| cpos.each_sub(visitor_t{}, *this); 1758| 26.9k| rpos.each_right_sub(visitor_t{}, *this); 1759| 26.9k| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 26.9k| { 1803| 26.9k| using node_t = node_type; 1804| 26.9k| using merger_t = concat_merger; 1805| 26.9k| using visitor_t = concat_merger_visitor; 1806| 26.9k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 26.9k| IMMER_TRY { ------------------ | | 49| 26.9k|#define IMMER_TRY try ------------------ 1808| 26.9k| lpos.each_left_sub(visitor_t{}, merger); 1809| 26.9k| cpos.each_sub(visitor_t{}, merger); 1810| 26.9k| rpos.each_right_sub(visitor_t{}, merger); 1811| 26.9k| cpos.each_sub(dec_visitor{}); 1812| 26.9k| return merger.finish(); 1813| 26.9k| } 1814| 26.9k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 26.9k| } _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.65M| { 1938| 1.65M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 1.65M| } _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.11M|{ 1824| 2.11M| auto plan = concat_rebalance_plan{}; 1825| 2.11M| plan.fill(lpos, cpos, rpos); 1826| 2.11M| plan.shuffle(cpos.shift()); 1827| 2.11M| IMMER_TRY { ------------------ | | 49| 2.11M|#define IMMER_TRY try ------------------ 1828| 2.11M| return plan.merge(lpos, cpos, rpos); 1829| 2.11M| } 1830| 2.11M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.11M|} _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.11M| { 1753| 2.11M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.11M, False: 0] ------------------ 1754| 2.11M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.11M, False: 0] ------------------ 1755| 2.11M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.11M| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.11M| cpos.each_sub(visitor_t{}, *this); 1758| 2.11M| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.11M| } _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.11M| { 1803| 2.11M| using node_t = node_type; 1804| 2.11M| using merger_t = concat_merger; 1805| 2.11M| using visitor_t = concat_merger_visitor; 1806| 2.11M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.11M| IMMER_TRY { ------------------ | | 49| 2.11M|#define IMMER_TRY try ------------------ 1808| 2.11M| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.11M| cpos.each_sub(visitor_t{}, merger); 1810| 2.11M| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.11M| cpos.each_sub(dec_visitor{}); 1812| 2.11M| return merger.finish(); 1813| 2.11M| } 1814| 2.11M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.11M| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_nodeIRNS1_15regular_sub_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 23.5k| { 1959| 23.5k| return concat_inners(lpos, tpos, rpos); 1960| 23.5k| } _ZN5immer6detail4rbts25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_nodeIRNS1_15regular_sub_posISC_EENS1_8leaf_posISC_EEJRPSC_RjRmEEENS1_17concat_center_posISC_EEOT_OT0_DpOT1_: 1971| 14.1k| { 1972| 14.1k| return visit_maybe_relaxed_sub( 1973| 14.1k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 14.1k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_nodeIRNS1_11relaxed_posISC_EERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 6.38k| { 1959| 6.38k| return concat_inners(lpos, tpos, rpos); 1960| 6.38k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_nodeIRNS1_15regular_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 7.80k| { 1959| 7.80k| return concat_inners(lpos, tpos, rpos); 1960| 7.80k| } _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| 50.7k| { 681| 50.7k| auto node = pos.node(); 682| 50.7k| auto level = pos.shift(); 683| 50.7k| auto idx = pos.count() - 1; 684| 50.7k| auto children = pos.size(idx); 685| 50.7k| auto new_idx = 686| 50.7k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 2.18k, False: 48.5k] | Branch (686:47): [True: 523, False: 48.0k] ------------------ 687| 50.7k| auto new_child = static_cast(nullptr); 688| 50.7k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [True: 50.7k, Folded] | Branch (688:38): [True: 47.3k, False: 3.42k] ------------------ 689| | 690| 50.7k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 1.06k, False: 49.6k] ------------------ 691| 1.06k| return nullptr; 692| 49.6k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 48.0k, False: 1.64k] ------------------ 693| 48.0k| new_child = 694| 48.0k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 45.6k, False: 2.40k] ------------------ 695| 48.0k| : pos.last_oh_csh( 696| 2.40k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 48.0k| if (!new_child) { ------------------ | Branch (697:17): [True: 766, False: 47.2k] ------------------ 698| 766| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 414, False: 352] ------------------ 699| 414| new_child = node_t::make_path_e(e, level - B, tail); 700| 352| else 701| 352| return nullptr; 702| 766| } 703| 48.0k| } else 704| 1.64k| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 49.3k| if (mutate) { ------------------ | Branch (706:13): [True: 47.0k, False: 2.30k] ------------------ 707| 47.0k| auto count = new_idx + 1; 708| 47.0k| auto relaxed = node->ensure_mutable_relaxed_n(e, new_idx); 709| 47.0k| node->inner()[new_idx] = new_child; 710| 47.0k| relaxed->d.sizes[new_idx] = pos.size() + ts; 711| 47.0k| relaxed->d.count = count; 712| 47.0k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (712:13): [True: 47.0k, False: 0] ------------------ 713| 47.0k| return node; 714| 47.0k| } else { 715| 2.30k| IMMER_TRY { ------------------ | | 49| 2.30k|#define IMMER_TRY try ------------------ 716| 2.30k| auto count = new_idx + 1; 717| 2.30k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 2.30k| auto relaxed = new_node->relaxed(); 719| 2.30k| new_node->inner()[new_idx] = new_child; 720| 2.30k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 2.30k| relaxed->d.count = count; 722| 2.30k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 2.30k, False: 0] ------------------ 723| 2.30k| if (Mutating) ------------------ | Branch (723:21): [True: 2.30k, Folded] ------------------ 724| 2.30k| pos.visit(dec_visitor{}); 725| 2.30k| return new_node; 726| 2.30k| } 727| 2.30k| 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.30k| } 737| 49.3k| } _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| 36.3k| { 742| 36.3k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 36.3k, False: 0] ------------------ 743| 36.3k| auto node = pos.node(); 744| 36.3k| auto idx = pos.index(pos.size() - 1); 745| 36.3k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 36.3k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 36.3k, Folded] | Branch (746:36): [True: 35.7k, False: 610] ------------------ 747| 36.3k| if (mutate) { ------------------ | Branch (747:13): [True: 35.7k, False: 610] ------------------ 748| 35.7k| node->inner()[new_idx] = 749| 35.7k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 34.8k, False: 821] ------------------ 750| | /* otherwise */ 751| 35.7k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 35.7k| return node; 753| 35.7k| } else { 754| 610| auto new_parent = node_t::make_inner_e(e); 755| 610| IMMER_TRY { ------------------ | | 49| 610|#define IMMER_TRY try ------------------ 756| 610| new_parent->inner()[new_idx] = 757| 610| idx == new_idx ------------------ | Branch (757:21): [True: 347, False: 263] ------------------ 758| 610| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 610| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 610| node_t::do_copy_inner(new_parent, node, new_idx); 762| 610| if (Mutating) ------------------ | Branch (762:21): [True: 610, Folded] ------------------ 763| 610| pos.visit(dec_visitor{}); 764| 610| return new_parent; 765| 610| } 766| 610| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 610| } 771| 36.3k| } _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| 780k| { 742| 780k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 780k, False: 0] ------------------ 743| 780k| auto node = pos.node(); 744| 780k| auto idx = pos.index(pos.size() - 1); 745| 780k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 780k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 780k, Folded] | Branch (746:36): [True: 779k, False: 537] ------------------ 747| 780k| if (mutate) { ------------------ | Branch (747:13): [True: 779k, False: 537] ------------------ 748| 779k| node->inner()[new_idx] = 749| 779k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 610k, False: 169k] ------------------ 750| | /* otherwise */ 751| 779k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 779k| return node; 753| 779k| } 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: 219, False: 318] ------------------ 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| 780k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE13visit_regularIRNS1_11regular_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_: 741| 3.18k| { 742| 3.18k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 3.18k, False: 0] ------------------ 743| 3.18k| auto node = pos.node(); 744| 3.18k| auto idx = pos.index(pos.size() - 1); 745| 3.18k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 3.18k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 3.18k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 3.18k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 3.18k] ------------------ 748| 0| node->inner()[new_idx] = 749| 0| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 0, False: 0] ------------------ 750| | /* otherwise */ 751| 0| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 0| return node; 753| 3.18k| } else { 754| 3.18k| auto new_parent = node_t::make_inner_e(e); 755| 3.18k| IMMER_TRY { ------------------ | | 49| 3.18k|#define IMMER_TRY try ------------------ 756| 3.18k| new_parent->inner()[new_idx] = 757| 3.18k| idx == new_idx ------------------ | Branch (757:21): [True: 1.53k, False: 1.64k] ------------------ 758| 3.18k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 3.18k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 3.18k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 3.18k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 3.18k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 3.18k| return new_parent; 765| 3.18k| } 766| 3.18k| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 3.18k| } 771| 3.18k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEEPSC_OT_NSA_5applyIS7_E4type4editESI_j: 680| 7.36k| { 681| 7.36k| auto node = pos.node(); 682| 7.36k| auto level = pos.shift(); 683| 7.36k| auto idx = pos.count() - 1; 684| 7.36k| auto children = pos.size(idx); 685| 7.36k| auto new_idx = 686| 7.36k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 947, False: 6.41k] | Branch (686:47): [True: 367, False: 6.05k] ------------------ 687| 7.36k| auto new_child = static_cast(nullptr); 688| 7.36k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [Folded, False: 7.36k] | Branch (688:38): [True: 0, False: 0] ------------------ 689| | 690| 7.36k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 559, False: 6.80k] ------------------ 691| 559| return nullptr; 692| 6.80k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 6.05k, False: 755] ------------------ 693| 6.05k| new_child = 694| 6.05k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 0, False: 6.05k] ------------------ 695| 6.05k| : pos.last_oh_csh( 696| 6.05k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 6.05k| if (!new_child) { ------------------ | Branch (697:17): [True: 679, False: 5.37k] ------------------ 698| 679| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 249, False: 430] ------------------ 699| 249| new_child = node_t::make_path_e(e, level - B, tail); 700| 430| else 701| 430| return nullptr; 702| 679| } 703| 6.05k| } else 704| 755| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 6.37k| if (mutate) { ------------------ | Branch (706:13): [True: 0, False: 6.37k] ------------------ 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.37k| } else { 715| 6.37k| IMMER_TRY { ------------------ | | 49| 6.37k|#define IMMER_TRY try ------------------ 716| 6.37k| auto count = new_idx + 1; 717| 6.37k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 6.37k| auto relaxed = new_node->relaxed(); 719| 6.37k| new_node->inner()[new_idx] = new_child; 720| 6.37k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 6.37k| relaxed->d.count = count; 722| 6.37k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 6.37k, False: 0] ------------------ 723| 6.37k| if (Mutating) ------------------ | Branch (723:21): [Folded, False: 6.37k] ------------------ 724| 0| pos.visit(dec_visitor{}); 725| 6.37k| return new_node; 726| 6.37k| } 727| 6.37k| 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.37k| } 737| 6.37k| } _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.09k| { 742| 1.09k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 1.09k, False: 0] ------------------ 743| 1.09k| auto node = pos.node(); 744| 1.09k| auto idx = pos.index(pos.size() - 1); 745| 1.09k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 1.09k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 1.09k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 1.09k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 1.09k] ------------------ 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.09k| } else { 754| 1.09k| auto new_parent = node_t::make_inner_e(e); 755| 1.09k| IMMER_TRY { ------------------ | | 49| 1.09k|#define IMMER_TRY try ------------------ 756| 1.09k| new_parent->inner()[new_idx] = 757| 1.09k| idx == new_idx ------------------ | Branch (757:21): [True: 666, False: 427] ------------------ 758| 1.09k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 1.09k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 1.09k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 1.09k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 1.09k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 1.09k| return new_parent; 765| 1.09k| } 766| 1.09k| 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.09k| } 771| 1.09k| } _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| 139k| { 742| 139k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 139k, False: 0] ------------------ 743| 139k| auto node = pos.node(); 744| 139k| auto idx = pos.index(pos.size() - 1); 745| 139k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 139k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 139k, Folded] | Branch (746:36): [True: 138k, False: 653] ------------------ 747| 139k| if (mutate) { ------------------ | Branch (747:13): [True: 138k, False: 653] ------------------ 748| 138k| node->inner()[new_idx] = 749| 138k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 134k, False: 3.60k] ------------------ 750| | /* otherwise */ 751| 138k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 138k| return node; 753| 138k| } else { 754| 653| auto new_parent = node_t::make_inner_e(e); 755| 653| IMMER_TRY { ------------------ | | 49| 653|#define IMMER_TRY try ------------------ 756| 653| new_parent->inner()[new_idx] = 757| 653| idx == new_idx ------------------ | Branch (757:21): [True: 413, False: 240] ------------------ 758| 653| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 653| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 653| node_t::do_copy_inner(new_parent, node, new_idx); 762| 653| if (Mutating) ------------------ | Branch (762:21): [True: 653, Folded] ------------------ 763| 653| pos.visit(dec_visitor{}); 764| 653| return new_parent; 765| 653| } 766| 653| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 653| } 771| 139k| } _ZN5immer6detail4rbts17dec_empty_regularINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEvPT_: 580| 2.50k|{ 581| 2.50k| make_empty_regular_pos(node).visit(dec_visitor()); 582| 2.50k|} _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_relaxedIRNS1_11relaxed_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 595| 100k| { 596| 100k| auto offset = pos.index(idx); 597| 100k| auto count = pos.count(); 598| 100k| auto node = pos.node(); 599| 100k| if (node->can_mutate(e)) { ------------------ | Branch (599:13): [True: 84.3k, False: 15.7k] ------------------ 600| 84.3k| return pos.towards_oh( 601| 84.3k| this_t{}, idx, offset, e, &node->inner()[offset]); 602| 84.3k| } else { 603| 15.7k| auto new_node = node_t::copy_inner_sr_e(e, node, count); 604| 15.7k| IMMER_TRY { ------------------ | | 49| 15.7k|#define IMMER_TRY try ------------------ 605| 15.7k| auto& res = pos.towards_oh( 606| 15.7k| this_t{}, idx, offset, e, &new_node->inner()[offset]); 607| 15.7k| pos.visit(dec_visitor{}); 608| 15.7k| *location = new_node; 609| 15.7k| return res; 610| 15.7k| } 611| 15.7k| IMMER_CATCH (...) { 612| 0| dec_relaxed(new_node, pos.shift()); 613| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 614| 0| } 615| 15.7k| } 616| 100k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 652| 19.8k| { 653| 19.8k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 19.8k, False: 0] ------------------ 654| 19.8k| auto node = pos.node(); 655| 19.8k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 17.2k, False: 2.54k] ------------------ 656| 17.2k| return node->leaf()[pos.index(idx)]; 657| 17.2k| } else { 658| 2.54k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 2.54k| pos.visit(dec_visitor{}); 660| 2.54k| *location = new_node; 661| 2.54k| return new_node->leaf()[pos.index(idx)]; 662| 2.54k| } 663| 19.8k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_regularIRNS1_15regular_sub_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 621| 8.39k| { 622| 8.39k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 8.39k, False: 0] ------------------ 623| 8.39k| auto offset = pos.index(idx); 624| 8.39k| auto count = pos.count(); 625| 8.39k| auto node = pos.node(); 626| 8.39k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 6.24k, False: 2.14k] ------------------ 627| 6.24k| return pos.towards_oh_ch( 628| 6.24k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 6.24k| } else { 630| 2.14k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 2.14k| IMMER_TRY { ------------------ | | 49| 2.14k|#define IMMER_TRY try ------------------ 632| 2.14k| auto& res = pos.towards_oh_ch(this_t{}, 633| 2.14k| idx, 634| 2.14k| offset, 635| 2.14k| count, 636| 2.14k| e, 637| 2.14k| &new_node->inner()[offset]); 638| 2.14k| pos.visit(dec_visitor{}); 639| 2.14k| *location = new_node; 640| 2.14k| return res; 641| 2.14k| } 642| 2.14k| IMMER_CATCH (...) { 643| 0| dec_regular(new_node, pos.shift(), pos.size()); 644| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 645| 0| } 646| 2.14k| } 647| 8.39k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_13full_leaf_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 652| 7.23k| { 653| 7.23k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 7.23k, False: 0] ------------------ 654| 7.23k| auto node = pos.node(); 655| 7.23k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 4.47k, False: 2.75k] ------------------ 656| 4.47k| return node->leaf()[pos.index(idx)]; 657| 4.47k| } else { 658| 2.75k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 2.75k| pos.visit(dec_visitor{}); 660| 2.75k| *location = new_node; 661| 2.75k| return new_node->leaf()[pos.index(idx)]; 662| 2.75k| } 663| 7.23k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_regularIRNS1_8full_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 621| 5.03k| { 622| 5.03k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 5.03k, False: 0] ------------------ 623| 5.03k| auto offset = pos.index(idx); 624| 5.03k| auto count = pos.count(); 625| 5.03k| auto node = pos.node(); 626| 5.03k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 3.34k, False: 1.68k] ------------------ 627| 3.34k| return pos.towards_oh_ch( 628| 3.34k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 3.34k| } else { 630| 1.68k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.68k| IMMER_TRY { ------------------ | | 49| 1.68k|#define IMMER_TRY try ------------------ 632| 1.68k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.68k| idx, 634| 1.68k| offset, 635| 1.68k| count, 636| 1.68k| e, 637| 1.68k| &new_node->inner()[offset]); 638| 1.68k| pos.visit(dec_visitor{}); 639| 1.68k| *location = new_node; 640| 1.68k| return res; 641| 1.68k| } 642| 1.68k| 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.68k| } 647| 5.03k| } _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.15k| { 653| 1.15k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 1.15k, False: 0] ------------------ 654| 1.15k| auto node = pos.node(); 655| 1.15k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 722, False: 436] ------------------ 656| 722| return node->leaf()[pos.index(idx)]; 657| 722| } else { 658| 436| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 436| pos.visit(dec_visitor{}); 660| 436| *location = new_node; 661| 436| return new_node->leaf()[pos.index(idx)]; 662| 436| } 663| 1.15k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_regularIRNS1_11regular_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 621| 1.91k| { 622| 1.91k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 1.91k, False: 0] ------------------ 623| 1.91k| auto offset = pos.index(idx); 624| 1.91k| auto count = pos.count(); 625| 1.91k| auto node = pos.node(); 626| 1.91k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 1.57k, False: 337] ------------------ 627| 1.57k| return pos.towards_oh_ch( 628| 1.57k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 1.57k| } else { 630| 337| auto new_node = node_t::copy_inner_e(e, node, count); 631| 337| IMMER_TRY { ------------------ | | 49| 337|#define IMMER_TRY try ------------------ 632| 337| auto& res = pos.towards_oh_ch(this_t{}, 633| 337| idx, 634| 337| offset, 635| 337| count, 636| 337| e, 637| 337| &new_node->inner()[offset]); 638| 337| pos.visit(dec_visitor{}); 639| 337| *location = new_node; 640| 337| return res; 641| 337| } 642| 337| 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| 337| } 647| 1.91k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 913| 55.1k| { 914| 55.1k| auto idx = pos.index(last); 915| 55.1k| auto node = pos.node(); 916| 55.1k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 55.1k, Folded] | Branch (916:35): [True: 46.8k, False: 8.26k] ------------------ 917| 55.1k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 55.1k, Folded] | Branch (917:25): [True: 38.9k, False: 16.1k] ------------------ 918| 38.9k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 34.3k, False: 4.63k] ------------------ 919| 38.9k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 38.9k| if (Mutating) ------------------ | Branch (920:17): [True: 38.9k, Folded] ------------------ 921| 38.9k| pos.visit(dec_right_visitor{}, count_t{1}); 922| 38.9k| return res; 923| 38.9k| } else { 924| 16.1k| using std::get; 925| 16.1k| auto subs = 926| 16.1k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 12.5k, False: 3.63k] ------------------ 927| 16.1k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 16.1k| auto next = get<1>(subs); 929| 16.1k| auto ts = get<2>(subs); 930| 16.1k| auto tail = get<3>(subs); 931| 16.1k| IMMER_TRY { ------------------ | | 49| 16.1k|#define IMMER_TRY try ------------------ 932| 16.1k| if (next) { ------------------ | Branch (932:21): [True: 11.6k, False: 4.48k] ------------------ 933| 11.6k| if (mutate) { ------------------ | Branch (933:25): [True: 9.50k, False: 2.17k] ------------------ 934| 9.50k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 9.50k| pos.each_right(dec_visitor{}, idx + 1); 936| 9.50k| node->inner()[idx] = next; 937| 9.50k| nodr->d.sizes[idx] = last + 1 - ts; 938| 9.50k| nodr->d.count = idx + 1; 939| 9.50k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 9.50k, False: 0] ------------------ 940| 9.50k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 9.50k| } else { 942| 2.17k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 2.17k| auto newr = newn->relaxed(); 944| 2.17k| newn->inner()[idx] = next; 945| 2.17k| newr->d.sizes[idx] = last + 1 - ts; 946| 2.17k| newr->d.count = idx + 1; 947| 2.17k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 2.17k, False: 0] ------------------ 948| 2.17k| if (Mutating) ------------------ | Branch (948:29): [True: 2.17k, Folded] ------------------ 949| 2.17k| pos.visit(dec_visitor{}); 950| 2.17k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 2.17k| } 952| 11.6k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 4.48k] ------------------ 953| 0| if (Mutating) ------------------ | Branch (953:25): [True: 0, Folded] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 4.48k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 4.48k, Folded] | Branch (956:40): [True: 3.28k, False: 1.20k] | Branch (956:52): [True: 2.88k, False: 401] ------------------ 957| 2.88k| auto newn = pos.node()->inner()[0]; 958| 2.88k| if (!mutate) ------------------ | Branch (958:25): [True: 942, False: 1.94k] ------------------ 959| 942| newn->inc(); 960| 2.88k| if (Mutating) ------------------ | Branch (960:25): [True: 2.88k, Folded] ------------------ 961| 2.88k| pos.visit(dec_right_visitor{}, count_t{2}); 962| 2.88k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 2.88k| } else { 964| 1.60k| if (mutate) { ------------------ | Branch (964:25): [True: 1.08k, False: 513] ------------------ 965| 1.08k| pos.each_right(dec_visitor{}, idx + 1); 966| 1.08k| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 1.08k| return std::make_tuple(pos.shift(), node, ts, tail); 968| 1.08k| } else { 969| 513| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 513| if (Mutating) ------------------ | Branch (970:29): [True: 513, Folded] ------------------ 971| 513| pos.visit(dec_visitor{}); 972| 513| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 513| } 974| 1.60k| } 975| 16.1k| } 976| 16.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| 16.1k| } 987| 55.1k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 1.10k| { 1060| 1.10k| auto old_tail_size = pos.count(); 1061| 1.10k| auto new_tail_size = pos.index(last) + 1; 1062| 1.10k| auto node = pos.node(); 1063| 1.10k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.10k, Folded] | Branch (1063:42): [True: 292, False: 808] ------------------ 1064| 1.10k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 359, False: 741] ------------------ 1065| 359| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 359] ------------------ 1066| 0| node->inc(); 1067| 359| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 741| } else if (mutate) { ------------------ | Branch (1068:20): [True: 261, False: 480] ------------------ 1069| 261| detail::destroy_n(node->leaf() + new_tail_size, 1070| 261| old_tail_size - new_tail_size); 1071| 261| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 480| } else { 1073| 480| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 480| if (Mutating) ------------------ | Branch (1074:17): [True: 480, Folded] ------------------ 1075| 480| pos.visit(dec_visitor{}); 1076| 480| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 480| } 1078| 1.10k| } _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| 523| { 1060| 523| auto old_tail_size = pos.count(); 1061| 523| auto new_tail_size = pos.index(last) + 1; 1062| 523| auto node = pos.node(); 1063| 523| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 523] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 523| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 252, False: 271] ------------------ 1065| 252| if (!Mutating) ------------------ | Branch (1065:17): [True: 252, Folded] ------------------ 1066| 252| node->inc(); 1067| 252| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 271| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 271] ------------------ 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| 271| } else { 1073| 271| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 271| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 271] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 271| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 271| } 1078| 523| } _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| 21.3k| { 914| 21.3k| auto idx = pos.index(last); 915| 21.3k| auto node = pos.node(); 916| 21.3k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 21.3k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 21.3k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 21.3k, Folded] | Branch (917:25): [True: 18.6k, False: 2.65k] ------------------ 918| 18.6k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 0, False: 18.6k] ------------------ 919| 18.6k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 18.6k| if (Mutating) ------------------ | Branch (920:17): [Folded, False: 18.6k] ------------------ 921| 0| pos.visit(dec_right_visitor{}, count_t{1}); 922| 18.6k| return res; 923| 18.6k| } else { 924| 2.65k| using std::get; 925| 2.65k| auto subs = 926| 2.65k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 2.65k] ------------------ 927| 2.65k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 2.65k| auto next = get<1>(subs); 929| 2.65k| auto ts = get<2>(subs); 930| 2.65k| auto tail = get<3>(subs); 931| 2.65k| IMMER_TRY { ------------------ | | 49| 2.65k|#define IMMER_TRY try ------------------ 932| 2.65k| if (next) { ------------------ | Branch (932:21): [True: 650, False: 2.00k] ------------------ 933| 650| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 650] ------------------ 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| 650| } else { 942| 650| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 650| auto newr = newn->relaxed(); 944| 650| newn->inner()[idx] = next; 945| 650| newr->d.sizes[idx] = last + 1 - ts; 946| 650| newr->d.count = idx + 1; 947| 650| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 650, False: 0] ------------------ 948| 650| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 650] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 650| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 650| } 952| 2.00k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 2.00k] ------------------ 953| 0| if (Mutating) ------------------ | Branch (953:25): [Folded, False: 0] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 2.00k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 2.00k, Folded] | Branch (956:40): [True: 648, False: 1.35k] | Branch (956:52): [True: 412, False: 236] ------------------ 957| 412| auto newn = pos.node()->inner()[0]; 958| 412| if (!mutate) ------------------ | Branch (958:25): [True: 412, False: 0] ------------------ 959| 412| newn->inc(); 960| 412| if (Mutating) ------------------ | Branch (960:25): [Folded, False: 412] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 412| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 1.59k| } else { 964| 1.59k| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 1.59k] ------------------ 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.59k| } else { 969| 1.59k| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 1.59k| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 1.59k] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 1.59k| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 1.59k| } 974| 1.59k| } 975| 2.65k| } 976| 2.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| 2.65k| } 987| 21.3k| } _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.45k| { 992| 1.45k| auto idx = pos.index(last); 993| 1.45k| auto node = pos.node(); 994| 1.45k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.45k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.45k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.45k, Folded] | Branch (995:25): [True: 412, False: 1.04k] ------------------ 996| 412| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 412] ------------------ 997| 412| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 412| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 412] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 412| return res; 1001| 1.04k| } else { 1002| 1.04k| using std::get; 1003| 1.04k| auto subs = 1004| 1.04k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 1.04k] ------------------ 1005| 1.04k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.04k| auto next = get<1>(subs); 1007| 1.04k| auto ts = get<2>(subs); 1008| 1.04k| auto tail = get<3>(subs); 1009| 1.04k| IMMER_TRY { ------------------ | | 49| 1.04k|#define IMMER_TRY try ------------------ 1010| 1.04k| if (next) { ------------------ | Branch (1010:21): [True: 221, False: 823] ------------------ 1011| 221| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 221] ------------------ 1012| 0| node->inner()[idx] = next; 1013| 0| pos.each_right(dec_visitor{}, idx + 1); 1014| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 221| } else { 1016| 221| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 221| newn->inner()[idx] = next; 1018| 221| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 221] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 221| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 221| } 1022| 823| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 823] ------------------ 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| 823| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 823, Folded] | Branch (1026:40): [True: 588, False: 235] | Branch (1026:52): [True: 217, False: 371] ------------------ 1027| 217| auto newn = pos.node()->inner()[0]; 1028| 217| if (!mutate) ------------------ | Branch (1028:25): [True: 217, False: 0] ------------------ 1029| 217| newn->inc(); 1030| 217| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 217] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 217| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 606| } else { 1034| 606| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 606] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 606| } else { 1038| 606| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 606| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 606] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 606| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 606| } 1043| 606| } 1044| 1.04k| } 1045| 1.04k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 1.04k| } 1055| 1.45k| } _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.49k| { 1060| 1.49k| auto old_tail_size = pos.count(); 1061| 1.49k| auto new_tail_size = pos.index(last) + 1; 1062| 1.49k| auto node = pos.node(); 1063| 1.49k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 1.49k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 1.49k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 714, False: 783] ------------------ 1065| 714| if (!Mutating) ------------------ | Branch (1065:17): [True: 714, Folded] ------------------ 1066| 714| node->inc(); 1067| 714| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 783| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 783] ------------------ 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| 783| } else { 1073| 783| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 783| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 783] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 783| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 783| } 1078| 1.49k| } _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.83k| { 992| 1.83k| auto idx = pos.index(last); 993| 1.83k| auto node = pos.node(); 994| 1.83k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.83k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.83k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.83k, Folded] | Branch (995:25): [True: 734, False: 1.09k] ------------------ 996| 734| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 734] ------------------ 997| 734| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 734| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 734] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 734| return res; 1001| 1.09k| } else { 1002| 1.09k| using std::get; 1003| 1.09k| auto subs = 1004| 1.09k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 1.09k] ------------------ 1005| 1.09k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.09k| auto next = get<1>(subs); 1007| 1.09k| auto ts = get<2>(subs); 1008| 1.09k| auto tail = get<3>(subs); 1009| 1.09k| IMMER_TRY { ------------------ | | 49| 1.09k|#define IMMER_TRY try ------------------ 1010| 1.09k| if (next) { ------------------ | Branch (1010:21): [True: 223, False: 876] ------------------ 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| 876| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 876] ------------------ 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| 876| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 876, Folded] | Branch (1026:40): [True: 675, False: 201] | Branch (1026:52): [True: 214, False: 461] ------------------ 1027| 214| auto newn = pos.node()->inner()[0]; 1028| 214| if (!mutate) ------------------ | Branch (1028:25): [True: 214, False: 0] ------------------ 1029| 214| newn->inc(); 1030| 214| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 214] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 214| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 662| } else { 1034| 662| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 662] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 662| } else { 1038| 662| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 662| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 662] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 662| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 662| } 1043| 662| } 1044| 1.09k| } 1045| 1.09k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 1.09k| } 1055| 1.83k| } _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.27k| { 1060| 5.27k| auto old_tail_size = pos.count(); 1061| 5.27k| auto new_tail_size = pos.index(last) + 1; 1062| 5.27k| auto node = pos.node(); 1063| 5.27k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 5.27k, Folded] | Branch (1063:42): [True: 894, False: 4.38k] ------------------ 1064| 5.27k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.64k, False: 3.63k] ------------------ 1065| 1.64k| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 1.64k] ------------------ 1066| 0| node->inc(); 1067| 1.64k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 3.63k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 837, False: 2.80k] ------------------ 1069| 837| detail::destroy_n(node->leaf() + new_tail_size, 1070| 837| old_tail_size - new_tail_size); 1071| 837| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 2.80k| } else { 1073| 2.80k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 2.80k| if (Mutating) ------------------ | Branch (1074:17): [True: 2.80k, Folded] ------------------ 1075| 2.80k| pos.visit(dec_visitor{}); 1076| 2.80k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 2.80k| } 1078| 5.27k| } _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.18k| { 992| 4.18k| auto idx = pos.index(last); 993| 4.18k| auto node = pos.node(); 994| 4.18k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 4.18k, Folded] | Branch (994:35): [True: 2.13k, False: 2.04k] ------------------ 995| 4.18k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 4.18k] | 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.18k| } else { 1002| 4.18k| using std::get; 1003| 4.18k| auto subs = 1004| 4.18k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 2.13k, False: 2.04k] ------------------ 1005| 4.18k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 4.18k| auto next = get<1>(subs); 1007| 4.18k| auto ts = get<2>(subs); 1008| 4.18k| auto tail = get<3>(subs); 1009| 4.18k| IMMER_TRY { ------------------ | | 49| 4.18k|#define IMMER_TRY try ------------------ 1010| 4.18k| if (next) { ------------------ | Branch (1010:21): [True: 686, False: 3.49k] ------------------ 1011| 686| if (mutate) { ------------------ | Branch (1011:25): [True: 423, False: 263] ------------------ 1012| 423| node->inner()[idx] = next; 1013| 423| pos.each_right(dec_visitor{}, idx + 1); 1014| 423| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 423| } else { 1016| 263| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 263| newn->inner()[idx] = next; 1018| 263| if (Mutating) ------------------ | Branch (1018:29): [True: 263, Folded] ------------------ 1019| 263| pos.visit(dec_visitor{}); 1020| 263| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 263| } 1022| 3.49k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.36k, False: 2.12k] ------------------ 1023| 1.36k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.36k, Folded] ------------------ 1024| 1.36k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.36k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 2.12k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 2.12k] | 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.12k| } else { 1034| 2.12k| if (mutate) { ------------------ | Branch (1034:25): [True: 1.02k, False: 1.10k] ------------------ 1035| 1.02k| pos.each_right(dec_visitor{}, idx + 1); 1036| 1.02k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.10k| } else { 1038| 1.10k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.10k| if (Mutating) ------------------ | Branch (1039:29): [True: 1.10k, Folded] ------------------ 1040| 1.10k| pos.visit(dec_visitor{}); 1041| 1.10k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.10k| } 1043| 2.12k| } 1044| 4.18k| } 1045| 4.18k| 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.18k| } 1055| 4.18k| } _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.73k| { 879| 3.73k| using node_t = node_type; 880| 3.73k| auto node = p.node(); 881| 3.73k| if (node->dec()) { ------------------ | Branch (881:13): [True: 2.15k, False: 1.57k] ------------------ 882| 2.15k| p.each_right(dec_t{}, idx); 883| 2.15k| node_t::delete_inner(node, p.count()); 884| 2.15k| } 885| 3.73k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 9.26k| { 1060| 9.26k| auto old_tail_size = pos.count(); 1061| 9.26k| auto new_tail_size = pos.index(last) + 1; 1062| 9.26k| auto node = pos.node(); 1063| 9.26k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 9.26k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 9.26k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 2.73k, False: 6.52k] ------------------ 1065| 2.73k| if (!Mutating) ------------------ | Branch (1065:17): [True: 2.73k, Folded] ------------------ 1066| 2.73k| node->inc(); 1067| 2.73k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 6.52k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 6.52k] ------------------ 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.52k| } else { 1073| 6.52k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 6.52k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 6.52k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 6.52k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 6.52k| } 1078| 9.26k| } _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.20k| { 992| 3.20k| auto idx = pos.index(last); 993| 3.20k| auto node = pos.node(); 994| 3.20k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.20k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.20k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.20k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 0] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 3.20k| } else { 1002| 3.20k| using std::get; 1003| 3.20k| auto subs = 1004| 3.20k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.20k] ------------------ 1005| 3.20k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.20k| auto next = get<1>(subs); 1007| 3.20k| auto ts = get<2>(subs); 1008| 3.20k| auto tail = get<3>(subs); 1009| 3.20k| IMMER_TRY { ------------------ | | 49| 3.20k|#define IMMER_TRY try ------------------ 1010| 3.20k| if (next) { ------------------ | Branch (1010:21): [True: 301, False: 2.90k] ------------------ 1011| 301| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 301] ------------------ 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| 301| } else { 1016| 301| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 301| newn->inner()[idx] = next; 1018| 301| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 301] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 301| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 301| } 1022| 2.90k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.19k, False: 1.71k] ------------------ 1023| 1.19k| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 1.19k] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.19k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.71k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.71k] | 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.71k| } else { 1034| 1.71k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 1.71k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.71k| } else { 1038| 1.71k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.71k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 1.71k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 1.71k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.71k| } 1043| 1.71k| } 1044| 3.20k| } 1045| 3.20k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 3.20k| } 1055| 3.20k| } _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| 409| { 1060| 409| auto old_tail_size = pos.count(); 1061| 409| auto new_tail_size = pos.index(last) + 1; 1062| 409| auto node = pos.node(); 1063| 409| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 409] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 409| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 202, False: 207] ------------------ 1065| 202| if (!Mutating) ------------------ | Branch (1065:17): [True: 202, Folded] ------------------ 1066| 202| node->inc(); 1067| 202| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 207| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 207] ------------------ 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| 207| } else { 1073| 207| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 207| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 207] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 207| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 207| } 1078| 409| } _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.30k| { 1060| 2.30k| auto old_tail_size = pos.count(); 1061| 2.30k| auto new_tail_size = pos.index(last) + 1; 1062| 2.30k| auto node = pos.node(); 1063| 2.30k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 2.30k, Folded] | Branch (1063:42): [True: 392, False: 1.90k] ------------------ 1064| 2.30k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 243, False: 2.05k] ------------------ 1065| 243| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 243] ------------------ 1066| 0| node->inc(); 1067| 243| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 2.05k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 374, False: 1.68k] ------------------ 1069| 374| detail::destroy_n(node->leaf() + new_tail_size, 1070| 374| old_tail_size - new_tail_size); 1071| 374| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.68k| } else { 1073| 1.68k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.68k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.68k, Folded] ------------------ 1075| 1.68k| pos.visit(dec_visitor{}); 1076| 1.68k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.68k| } 1078| 2.30k| } _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.15k| { 992| 6.15k| auto idx = pos.index(last); 993| 6.15k| auto node = pos.node(); 994| 6.15k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 6.15k, Folded] | Branch (994:35): [True: 5.52k, False: 625] ------------------ 995| 6.15k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 6.15k] | 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.15k| } else { 1002| 6.15k| using std::get; 1003| 6.15k| auto subs = 1004| 6.15k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 5.52k, False: 625] ------------------ 1005| 6.15k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 6.15k| auto next = get<1>(subs); 1007| 6.15k| auto ts = get<2>(subs); 1008| 6.15k| auto tail = get<3>(subs); 1009| 6.15k| IMMER_TRY { ------------------ | | 49| 6.15k|#define IMMER_TRY try ------------------ 1010| 6.15k| if (next) { ------------------ | Branch (1010:21): [True: 1.51k, False: 4.64k] ------------------ 1011| 1.51k| if (mutate) { ------------------ | Branch (1011:25): [True: 1.31k, False: 197] ------------------ 1012| 1.31k| node->inner()[idx] = next; 1013| 1.31k| pos.each_right(dec_visitor{}, idx + 1); 1014| 1.31k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 1.31k| } else { 1016| 197| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 197| newn->inner()[idx] = next; 1018| 197| if (Mutating) ------------------ | Branch (1018:29): [True: 197, Folded] ------------------ 1019| 197| pos.visit(dec_visitor{}); 1020| 197| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 197| } 1022| 4.64k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 3.92k, False: 720] ------------------ 1023| 3.92k| if (Mutating) ------------------ | Branch (1023:25): [True: 3.92k, Folded] ------------------ 1024| 3.92k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 3.92k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 3.92k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 720] | 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| 720| } else { 1034| 720| if (mutate) { ------------------ | Branch (1034:25): [True: 507, False: 213] ------------------ 1035| 507| pos.each_right(dec_visitor{}, idx + 1); 1036| 507| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 507| } else { 1038| 213| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 213| if (Mutating) ------------------ | Branch (1039:29): [True: 213, Folded] ------------------ 1040| 213| pos.visit(dec_visitor{}); 1041| 213| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 213| } 1043| 720| } 1044| 6.15k| } 1045| 6.15k| 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.15k| } 1055| 6.15k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_j: 878| 3.92k| { 879| 3.92k| using node_t = node_type; 880| 3.92k| auto node = p.node(); 881| 3.92k| if (node->dec()) { ------------------ | Branch (881:13): [True: 3.70k, False: 215] ------------------ 882| 3.70k| p.each_right(dec_t{}, idx); 883| 3.70k| node_t::delete_inner(node, p.count()); 884| 3.70k| } 885| 3.92k| } _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.64k| { 1060| 2.64k| auto old_tail_size = pos.count(); 1061| 2.64k| auto new_tail_size = pos.index(last) + 1; 1062| 2.64k| auto node = pos.node(); 1063| 2.64k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 2.64k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 2.64k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 787, False: 1.85k] ------------------ 1065| 787| if (!Mutating) ------------------ | Branch (1065:17): [True: 787, Folded] ------------------ 1066| 787| node->inc(); 1067| 787| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.85k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 1.85k] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.85k| } else { 1073| 1.85k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.85k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 1.85k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 1.85k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.85k| } 1078| 2.64k| } _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.19k| { 992| 3.19k| auto idx = pos.index(last); 993| 3.19k| auto node = pos.node(); 994| 3.19k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.19k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.19k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.19k] | 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.19k| } else { 1002| 3.19k| using std::get; 1003| 3.19k| auto subs = 1004| 3.19k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.19k] ------------------ 1005| 3.19k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.19k| auto next = get<1>(subs); 1007| 3.19k| auto ts = get<2>(subs); 1008| 3.19k| auto tail = get<3>(subs); 1009| 3.19k| IMMER_TRY { ------------------ | | 49| 3.19k|#define IMMER_TRY try ------------------ 1010| 3.19k| if (next) { ------------------ | Branch (1010:21): [True: 510, False: 2.68k] ------------------ 1011| 510| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 510] ------------------ 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| 510| } else { 1016| 510| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 510| newn->inner()[idx] = next; 1018| 510| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 510] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 510| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 510| } 1022| 2.68k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.81k, False: 875] ------------------ 1023| 1.81k| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 1.81k] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.81k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.81k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 875] | 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| 875| } else { 1034| 875| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 875] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 875| } else { 1038| 875| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 875| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 875] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 875| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 875| } 1043| 875| } 1044| 3.19k| } 1045| 3.19k| 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.19k| } 1055| 3.19k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_j: 867| 44.2k| { 868| 44.2k| using node_t = node_type; 869| 44.2k| auto node = p.node(); 870| 44.2k| if (node->dec()) { ------------------ | Branch (870:13): [True: 38.0k, False: 6.17k] ------------------ 871| 38.0k| p.each_right(dec_t{}, idx); 872| 38.0k| node_t::delete_inner_r(node, p.count()); 873| 38.0k| } 874| 44.2k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 3.59k| { 1060| 3.59k| auto old_tail_size = pos.count(); 1061| 3.59k| auto new_tail_size = pos.index(last) + 1; 1062| 3.59k| auto node = pos.node(); 1063| 3.59k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 3.59k, Folded] | Branch (1063:42): [True: 1.06k, False: 2.53k] ------------------ 1064| 3.59k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.01k, False: 2.58k] ------------------ 1065| 1.01k| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 1.01k] ------------------ 1066| 0| node->inc(); 1067| 1.01k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 2.58k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 972, False: 1.61k] ------------------ 1069| 972| detail::destroy_n(node->leaf() + new_tail_size, 1070| 972| old_tail_size - new_tail_size); 1071| 972| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.61k| } else { 1073| 1.61k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.61k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.61k, Folded] ------------------ 1075| 1.61k| pos.visit(dec_visitor{}); 1076| 1.61k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.61k| } 1078| 3.59k| } _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.2k| { 914| 10.2k| auto idx = pos.index(last); 915| 10.2k| auto node = pos.node(); 916| 10.2k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 10.2k, Folded] | Branch (916:35): [True: 8.12k, False: 2.14k] ------------------ 917| 10.2k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 10.2k] | 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.2k| } else { 924| 10.2k| using std::get; 925| 10.2k| auto subs = 926| 10.2k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 8.12k, False: 2.14k] ------------------ 927| 10.2k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 10.2k| auto next = get<1>(subs); 929| 10.2k| auto ts = get<2>(subs); 930| 10.2k| auto tail = get<3>(subs); 931| 10.2k| IMMER_TRY { ------------------ | | 49| 10.2k|#define IMMER_TRY try ------------------ 932| 10.2k| if (next) { ------------------ | Branch (932:21): [True: 4.85k, False: 5.41k] ------------------ 933| 4.85k| if (mutate) { ------------------ | Branch (933:25): [True: 3.88k, False: 972] ------------------ 934| 3.88k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 3.88k| pos.each_right(dec_visitor{}, idx + 1); 936| 3.88k| node->inner()[idx] = next; 937| 3.88k| nodr->d.sizes[idx] = last + 1 - ts; 938| 3.88k| nodr->d.count = idx + 1; 939| 3.88k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 3.88k, False: 0] ------------------ 940| 3.88k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 3.88k| } else { 942| 972| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 972| auto newr = newn->relaxed(); 944| 972| newn->inner()[idx] = next; 945| 972| newr->d.sizes[idx] = last + 1 - ts; 946| 972| newr->d.count = idx + 1; 947| 972| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 972, False: 0] ------------------ 948| 972| if (Mutating) ------------------ | Branch (948:29): [True: 972, Folded] ------------------ 949| 972| pos.visit(dec_visitor{}); 950| 972| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 972| } 952| 5.41k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 2.39k, False: 3.02k] ------------------ 953| 2.39k| if (Mutating) ------------------ | Branch (953:25): [True: 2.39k, Folded] ------------------ 954| 2.39k| pos.visit(dec_right_visitor{}, count_t{1}); 955| 2.39k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 3.02k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 3.02k] | Branch (956:40): [True: 0, False: 0] | Branch (956:52): [True: 0, False: 0] ------------------ 957| 0| auto newn = pos.node()->inner()[0]; 958| 0| if (!mutate) ------------------ | Branch (958:25): [True: 0, False: 0] ------------------ 959| 0| newn->inc(); 960| 0| if (Mutating) ------------------ | Branch (960:25): [True: 0, Folded] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 3.02k| } else { 964| 3.02k| if (mutate) { ------------------ | Branch (964:25): [True: 2.43k, False: 582] ------------------ 965| 2.43k| pos.each_right(dec_visitor{}, idx + 1); 966| 2.43k| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 2.43k| return std::make_tuple(pos.shift(), node, ts, tail); 968| 2.43k| } else { 969| 582| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 582| if (Mutating) ------------------ | Branch (970:29): [True: 582, Folded] ------------------ 971| 582| pos.visit(dec_visitor{}); 972| 582| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 582| } 974| 3.02k| } 975| 10.2k| } 976| 10.2k| 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.2k| } 987| 10.2k| } _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.79k| { 992| 6.79k| auto idx = pos.index(last); 993| 6.79k| auto node = pos.node(); 994| 6.79k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 6.79k, Folded] | Branch (994:35): [True: 5.76k, False: 1.03k] ------------------ 995| 6.79k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 6.79k] | 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.79k| } else { 1002| 6.79k| using std::get; 1003| 6.79k| auto subs = 1004| 6.79k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 5.76k, False: 1.03k] ------------------ 1005| 6.79k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 6.79k| auto next = get<1>(subs); 1007| 6.79k| auto ts = get<2>(subs); 1008| 6.79k| auto tail = get<3>(subs); 1009| 6.79k| IMMER_TRY { ------------------ | | 49| 6.79k|#define IMMER_TRY try ------------------ 1010| 6.79k| if (next) { ------------------ | Branch (1010:21): [True: 2.49k, False: 4.30k] ------------------ 1011| 2.49k| if (mutate) { ------------------ | Branch (1011:25): [True: 2.20k, False: 286] ------------------ 1012| 2.20k| node->inner()[idx] = next; 1013| 2.20k| pos.each_right(dec_visitor{}, idx + 1); 1014| 2.20k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 2.20k| } else { 1016| 286| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 286| newn->inner()[idx] = next; 1018| 286| if (Mutating) ------------------ | Branch (1018:29): [True: 286, Folded] ------------------ 1019| 286| pos.visit(dec_visitor{}); 1020| 286| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 286| } 1022| 4.30k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.28k, False: 3.02k] ------------------ 1023| 1.28k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.28k, Folded] ------------------ 1024| 1.28k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.28k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 3.02k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 3.02k] | Branch (1026:40): [True: 0, False: 0] | Branch (1026:52): [True: 0, False: 0] ------------------ 1027| 0| auto newn = pos.node()->inner()[0]; 1028| 0| if (!mutate) ------------------ | Branch (1028:25): [True: 0, False: 0] ------------------ 1029| 0| newn->inc(); 1030| 0| if (Mutating) ------------------ | Branch (1030:25): [True: 0, Folded] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 3.02k| } else { 1034| 3.02k| if (mutate) { ------------------ | Branch (1034:25): [True: 2.61k, False: 409] ------------------ 1035| 2.61k| pos.each_right(dec_visitor{}, idx + 1); 1036| 2.61k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 2.61k| } else { 1038| 409| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 409| if (Mutating) ------------------ | Branch (1039:29): [True: 409, Folded] ------------------ 1040| 409| pos.visit(dec_visitor{}); 1041| 409| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 409| } 1043| 3.02k| } 1044| 6.79k| } 1045| 6.79k| 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.79k| } 1055| 6.79k| } _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| 11.0k| { 879| 11.0k| using node_t = node_type; 880| 11.0k| auto node = p.node(); 881| 11.0k| if (node->dec()) { ------------------ | Branch (881:13): [True: 8.17k, False: 2.91k] ------------------ 882| 8.17k| p.each_right(dec_t{}, idx); 883| 8.17k| node_t::delete_inner(node, p.count()); 884| 8.17k| } 885| 11.0k| } _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.38k| { 1060| 5.38k| auto old_tail_size = pos.count(); 1061| 5.38k| auto new_tail_size = pos.index(last) + 1; 1062| 5.38k| auto node = pos.node(); 1063| 5.38k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 5.38k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 5.38k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.31k, False: 4.07k] ------------------ 1065| 1.31k| if (!Mutating) ------------------ | Branch (1065:17): [True: 1.31k, Folded] ------------------ 1066| 1.31k| node->inc(); 1067| 1.31k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 4.07k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 4.07k] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 4.07k| } else { 1073| 4.07k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 4.07k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 4.07k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 4.07k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 4.07k| } 1078| 5.38k| } _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| 8.40k| { 914| 8.40k| auto idx = pos.index(last); 915| 8.40k| auto node = pos.node(); 916| 8.40k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 8.40k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 8.40k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 8.40k] | 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| 8.40k| } else { 924| 8.40k| using std::get; 925| 8.40k| auto subs = 926| 8.40k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 8.40k] ------------------ 927| 8.40k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 8.40k| auto next = get<1>(subs); 929| 8.40k| auto ts = get<2>(subs); 930| 8.40k| auto tail = get<3>(subs); 931| 8.40k| IMMER_TRY { ------------------ | | 49| 8.40k|#define IMMER_TRY try ------------------ 932| 8.40k| if (next) { ------------------ | Branch (932:21): [True: 1.20k, False: 7.20k] ------------------ 933| 1.20k| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 1.20k] ------------------ 934| 0| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 0| pos.each_right(dec_visitor{}, idx + 1); 936| 0| node->inner()[idx] = next; 937| 0| nodr->d.sizes[idx] = last + 1 - ts; 938| 0| nodr->d.count = idx + 1; 939| 0| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 0, False: 0] ------------------ 940| 0| return std::make_tuple(pos.shift(), node, ts, tail); 941| 1.20k| } else { 942| 1.20k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 1.20k| auto newr = newn->relaxed(); 944| 1.20k| newn->inner()[idx] = next; 945| 1.20k| newr->d.sizes[idx] = last + 1 - ts; 946| 1.20k| newr->d.count = idx + 1; 947| 1.20k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 1.20k, False: 0] ------------------ 948| 1.20k| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 1.20k] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 1.20k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 1.20k| } 952| 7.20k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 5.49k, False: 1.70k] ------------------ 953| 5.49k| if (Mutating) ------------------ | Branch (953:25): [Folded, False: 5.49k] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 5.49k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 5.49k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 1.70k] | Branch (956:40): [True: 0, False: 0] | Branch (956:52): [True: 0, False: 0] ------------------ 957| 0| auto newn = pos.node()->inner()[0]; 958| 0| if (!mutate) ------------------ | Branch (958:25): [True: 0, False: 0] ------------------ 959| 0| newn->inc(); 960| 0| if (Mutating) ------------------ | Branch (960:25): [Folded, False: 0] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 1.70k| } else { 964| 1.70k| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 1.70k] ------------------ 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.70k| } else { 969| 1.70k| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 1.70k| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 1.70k] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 1.70k| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 1.70k| } 974| 1.70k| } 975| 8.40k| } 976| 8.40k| 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| 8.40k| } 987| 8.40k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 3.04k| { 992| 3.04k| auto idx = pos.index(last); 993| 3.04k| auto node = pos.node(); 994| 3.04k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.04k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.04k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.04k] | 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.04k| } else { 1002| 3.04k| using std::get; 1003| 3.04k| auto subs = 1004| 3.04k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.04k] ------------------ 1005| 3.04k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.04k| auto next = get<1>(subs); 1007| 3.04k| auto ts = get<2>(subs); 1008| 3.04k| auto tail = get<3>(subs); 1009| 3.04k| IMMER_TRY { ------------------ | | 49| 3.04k|#define IMMER_TRY try ------------------ 1010| 3.04k| if (next) { ------------------ | Branch (1010:21): [True: 932, False: 2.11k] ------------------ 1011| 932| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 932] ------------------ 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| 932| } else { 1016| 932| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 932| newn->inner()[idx] = next; 1018| 932| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 932] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 932| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 932| } 1022| 2.11k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 954, False: 1.16k] ------------------ 1023| 954| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 954] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 954| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.16k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.16k] | 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.16k| } else { 1034| 1.16k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 1.16k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.16k| } else { 1038| 1.16k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.16k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 1.16k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 1.16k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.16k| } 1043| 1.16k| } 1044| 3.04k| } 1045| 3.04k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 3.04k| } 1055| 3.04k| } _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.5k| { 992| 12.5k| auto idx = pos.index(last); 993| 12.5k| auto node = pos.node(); 994| 12.5k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 12.5k, Folded] | Branch (994:35): [True: 9.20k, False: 3.37k] ------------------ 995| 12.5k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 12.5k, Folded] | Branch (995:25): [True: 7.52k, False: 5.06k] ------------------ 996| 7.52k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 5.55k, False: 1.96k] ------------------ 997| 7.52k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 7.52k| if (Mutating) ------------------ | Branch (998:17): [True: 7.52k, Folded] ------------------ 999| 7.52k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 7.52k| return res; 1001| 7.52k| } else { 1002| 5.06k| using std::get; 1003| 5.06k| auto subs = 1004| 5.06k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.64k, False: 1.41k] ------------------ 1005| 5.06k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 5.06k| auto next = get<1>(subs); 1007| 5.06k| auto ts = get<2>(subs); 1008| 5.06k| auto tail = get<3>(subs); 1009| 5.06k| IMMER_TRY { ------------------ | | 49| 5.06k|#define IMMER_TRY try ------------------ 1010| 5.06k| if (next) { ------------------ | Branch (1010:21): [True: 1.02k, False: 4.03k] ------------------ 1011| 1.02k| if (mutate) { ------------------ | Branch (1011:25): [True: 749, False: 272] ------------------ 1012| 749| node->inner()[idx] = next; 1013| 749| pos.each_right(dec_visitor{}, idx + 1); 1014| 749| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 749| } else { 1016| 272| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 272| newn->inner()[idx] = next; 1018| 272| if (Mutating) ------------------ | Branch (1018:29): [True: 272, Folded] ------------------ 1019| 272| pos.visit(dec_visitor{}); 1020| 272| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 272| } 1022| 4.03k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 4.03k] ------------------ 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.03k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 4.03k, Folded] | Branch (1026:40): [True: 3.45k, False: 583] | Branch (1026:52): [True: 2.28k, False: 1.16k] ------------------ 1027| 2.28k| auto newn = pos.node()->inner()[0]; 1028| 2.28k| if (!mutate) ------------------ | Branch (1028:25): [True: 613, False: 1.67k] ------------------ 1029| 613| 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.75k| if (mutate) { ------------------ | Branch (1034:25): [True: 1.22k, False: 528] ------------------ 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| 528| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 528| if (Mutating) ------------------ | Branch (1039:29): [True: 528, Folded] ------------------ 1040| 528| pos.visit(dec_visitor{}); 1041| 528| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 528| } 1043| 1.75k| } 1044| 5.06k| } 1045| 5.06k| 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.06k| } 1055| 12.5k| } _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.81k| { 1060| 1.81k| auto old_tail_size = pos.count(); 1061| 1.81k| auto new_tail_size = pos.index(last) + 1; 1062| 1.81k| auto node = pos.node(); 1063| 1.81k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.81k, Folded] | Branch (1063:42): [True: 757, False: 1.05k] ------------------ 1064| 1.81k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 925, False: 887] ------------------ 1065| 925| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 925] ------------------ 1066| 0| node->inc(); 1067| 925| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 925| } else if (mutate) { ------------------ | Branch (1068:20): [True: 452, False: 435] ------------------ 1069| 452| detail::destroy_n(node->leaf() + new_tail_size, 1070| 452| old_tail_size - new_tail_size); 1071| 452| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 452| } else { 1073| 435| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 435| if (Mutating) ------------------ | Branch (1074:17): [True: 435, Folded] ------------------ 1075| 435| pos.visit(dec_visitor{}); 1076| 435| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 435| } 1078| 1.81k| } _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| 4.29k| { 992| 4.29k| auto idx = pos.index(last); 993| 4.29k| auto node = pos.node(); 994| 4.29k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 4.29k, Folded] | Branch (994:35): [True: 2.06k, False: 2.22k] ------------------ 995| 4.29k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 4.29k, Folded] | Branch (995:25): [True: 1.85k, False: 2.43k] ------------------ 996| 1.85k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 1.23k, False: 629] ------------------ 997| 1.85k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 1.85k| if (Mutating) ------------------ | Branch (998:17): [True: 1.85k, Folded] ------------------ 999| 1.85k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 1.85k| return res; 1001| 2.43k| } else { 1002| 2.43k| using std::get; 1003| 2.43k| auto subs = 1004| 2.43k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 839, False: 1.59k] ------------------ 1005| 2.43k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 2.43k| auto next = get<1>(subs); 1007| 2.43k| auto ts = get<2>(subs); 1008| 2.43k| auto tail = get<3>(subs); 1009| 2.43k| IMMER_TRY { ------------------ | | 49| 2.43k|#define IMMER_TRY try ------------------ 1010| 2.43k| if (next) { ------------------ | Branch (1010:21): [True: 544, False: 1.89k] ------------------ 1011| 544| if (mutate) { ------------------ | Branch (1011:25): [True: 348, False: 196] ------------------ 1012| 348| node->inner()[idx] = next; 1013| 348| pos.each_right(dec_visitor{}, idx + 1); 1014| 348| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 348| } 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.89k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 1.89k] ------------------ 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.89k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 1.89k, Folded] | Branch (1026:40): [True: 1.37k, False: 519] | Branch (1026:52): [True: 504, False: 867] ------------------ 1027| 504| auto newn = pos.node()->inner()[0]; 1028| 504| if (!mutate) ------------------ | Branch (1028:25): [True: 267, False: 237] ------------------ 1029| 267| newn->inc(); 1030| 504| if (Mutating) ------------------ | Branch (1030:25): [True: 504, Folded] ------------------ 1031| 504| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 504| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 1.38k| } else { 1034| 1.38k| if (mutate) { ------------------ | Branch (1034:25): [True: 254, False: 1.13k] ------------------ 1035| 254| pos.each_right(dec_visitor{}, idx + 1); 1036| 254| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.13k| } else { 1038| 1.13k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.13k| if (Mutating) ------------------ | Branch (1039:29): [True: 1.13k, Folded] ------------------ 1040| 1.13k| pos.visit(dec_visitor{}); 1041| 1.13k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.13k| } 1043| 1.38k| } 1044| 2.43k| } 1045| 2.43k| 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.43k| } 1055| 4.29k| } _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| 682| { 1060| 682| auto old_tail_size = pos.count(); 1061| 682| auto new_tail_size = pos.index(last) + 1; 1062| 682| auto node = pos.node(); 1063| 682| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 682, Folded] | Branch (1063:42): [True: 201, False: 481] ------------------ 1064| 682| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 232, False: 450] ------------------ 1065| 232| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 232] ------------------ 1066| 0| node->inc(); 1067| 232| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 450| } else if (mutate) { ------------------ | Branch (1068:20): [True: 196, False: 254] ------------------ 1069| 196| detail::destroy_n(node->leaf() + new_tail_size, 1070| 196| old_tail_size - new_tail_size); 1071| 196| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 254| } else { 1073| 254| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 254| if (Mutating) ------------------ | Branch (1074:17): [True: 254, Folded] ------------------ 1075| 254| pos.visit(dec_visitor{}); 1076| 254| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 254| } 1078| 682| } _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| 707| { 1378| 707| auto node = pos.node(); 1379| 707| auto idx = pos.index(first); 1380| 707| auto count = pos.count(); 1381| 707| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 707| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 434, False: 273] ------------------ 1384| 707| if (mutate) { ------------------ | Branch (1384:13): [True: 434, False: 273] ------------------ 1385| 434| auto data = node->leaf(); 1386| 434| auto newcount = count - idx; 1387| 434| std::move(data + idx, data + count, data); 1388| 434| detail::destroy_n(data + newcount, idx); 1389| 434| return std::make_tuple(0, node); 1390| 434| } else { 1391| 273| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 273| if (Mutating) ------------------ | Branch (1392:17): [True: 273, Folded] ------------------ 1393| 273| pos.visit(dec_visitor{}); 1394| 273| return std::make_tuple(0, newn); 1395| 273| } 1396| 707| } _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.5k| { 1247| 38.5k| auto idx = pos.subindex(first); 1248| 38.5k| auto count = pos.count(); 1249| 38.5k| auto node = pos.node(); 1250| 38.5k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 38.5k, Folded] | Branch (1250:47): [True: 28.7k, False: 9.78k] ------------------ 1251| 38.5k| auto left_size = pos.size_before(idx); 1252| 38.5k| auto child_size = pos.size_sbh(idx, left_size); 1253| 38.5k| auto dropped_size = first; 1254| 38.5k| auto child_dropped_size = dropped_size - left_size; 1255| 38.5k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 38.5k, Folded] | Branch (1255:25): [True: 36.9k, False: 1.57k] | Branch (1255:45): [True: 8.39k, False: 28.5k] ------------------ 1256| 8.39k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 5.12k, False: 3.26k] ------------------ 1257| 8.39k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 8.39k| if (mutate) ------------------ | Branch (1258:17): [True: 5.12k, False: 3.26k] ------------------ 1259| 5.12k| pos.visit(dec_left_visitor{}, idx); 1260| 3.26k| else if (Mutating) ------------------ | Branch (1260:22): [True: 3.26k, Folded] ------------------ 1261| 3.26k| pos.visit(dec_visitor{}); 1262| 8.39k| return r; 1263| 30.1k| } else { 1264| 30.1k| using std::get; 1265| 30.1k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 23.6k, False: 6.51k] ------------------ 1266| 30.1k| : node_t::make_inner_r_e(e); 1267| 30.1k| auto newr = newn->relaxed(); 1268| 30.1k| auto newcount = count - idx; 1269| 30.1k| auto new_child_size = child_size - child_dropped_size; 1270| 30.1k| IMMER_TRY { ------------------ | | 49| 30.1k|#define IMMER_TRY try ------------------ 1271| 30.1k| auto subs = 1272| 30.1k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 23.6k, False: 6.51k] ------------------ 1273| 30.1k| : pos.towards_sub_oh( 1274| 6.51k| no_collapse_no_mut_t{}, first, idx, e); 1275| 30.1k| if (mutate) ------------------ | Branch (1275:21): [True: 23.6k, False: 6.51k] ------------------ 1276| 23.6k| pos.each_left(dec_visitor{}, idx); 1277| 30.1k| pos.copy_sizes( 1278| 30.1k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 30.1k| std::copy(node->inner() + idx + 1, 1280| 30.1k| node->inner() + count, 1281| 30.1k| newn->inner() + 1); 1282| 30.1k| newn->inner()[0] = get<1>(subs); 1283| 30.1k| newr->d.sizes[0] = new_child_size; 1284| 30.1k| newr->d.count = newcount; 1285| 30.1k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 30.1k, False: 0] ------------------ 1286| 30.1k| if (!mutate) { ------------------ | Branch (1286:21): [True: 6.51k, False: 23.6k] ------------------ 1287| 6.51k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 6.51k| if (Mutating) ------------------ | Branch (1288:25): [True: 6.51k, Folded] ------------------ 1289| 6.51k| pos.visit(dec_visitor{}); 1290| 6.51k| } 1291| 30.1k| return std::make_tuple(pos.shift(), newn); 1292| 30.1k| } 1293| 30.1k| 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.1k| } 1299| 38.5k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1246| 2.71k| { 1247| 2.71k| auto idx = pos.subindex(first); 1248| 2.71k| auto count = pos.count(); 1249| 2.71k| auto node = pos.node(); 1250| 2.71k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 2.71k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 2.71k| auto left_size = pos.size_before(idx); 1252| 2.71k| auto child_size = pos.size_sbh(idx, left_size); 1253| 2.71k| auto dropped_size = first; 1254| 2.71k| auto child_dropped_size = dropped_size - left_size; 1255| 2.71k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 2.71k, Folded] | Branch (1255:25): [True: 1.49k, False: 1.22k] | Branch (1255:45): [True: 1.03k, False: 463] ------------------ 1256| 1.03k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 1.03k] ------------------ 1257| 1.03k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 1.03k| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 1.03k] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 1.03k| else if (Mutating) ------------------ | Branch (1260:22): [Folded, False: 1.03k] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 1.03k| return r; 1263| 1.68k| } else { 1264| 1.68k| using std::get; 1265| 1.68k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 1.68k] ------------------ 1266| 1.68k| : node_t::make_inner_r_e(e); 1267| 1.68k| auto newr = newn->relaxed(); 1268| 1.68k| auto newcount = count - idx; 1269| 1.68k| auto new_child_size = child_size - child_dropped_size; 1270| 1.68k| IMMER_TRY { ------------------ | | 49| 1.68k|#define IMMER_TRY try ------------------ 1271| 1.68k| auto subs = 1272| 1.68k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 1.68k] ------------------ 1273| 1.68k| : pos.towards_sub_oh( 1274| 1.68k| no_collapse_no_mut_t{}, first, idx, e); 1275| 1.68k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 1.68k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 1.68k| pos.copy_sizes( 1278| 1.68k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 1.68k| std::copy(node->inner() + idx + 1, 1280| 1.68k| node->inner() + count, 1281| 1.68k| newn->inner() + 1); 1282| 1.68k| newn->inner()[0] = get<1>(subs); 1283| 1.68k| newr->d.sizes[0] = new_child_size; 1284| 1.68k| newr->d.count = newcount; 1285| 1.68k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 1.68k, False: 0] ------------------ 1286| 1.68k| if (!mutate) { ------------------ | Branch (1286:21): [True: 1.68k, False: 0] ------------------ 1287| 1.68k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 1.68k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 1.68k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 1.68k| } 1291| 1.68k| return std::make_tuple(pos.shift(), newn); 1292| 1.68k| } 1293| 1.68k| IMMER_CATCH (...) { 1294| 0| if (!mutate) ------------------ | Branch (1294:21): [True: 0, False: 0] ------------------ 1295| 0| node_t::delete_inner_r_e(newn); 1296| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1297| 0| } 1298| 1.68k| } 1299| 2.71k| } _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.53k| { 1304| 2.53k| auto idx = pos.subindex(first); 1305| 2.53k| auto count = pos.count(); 1306| 2.53k| auto node = pos.node(); 1307| 2.53k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.53k] ------------------ 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.53k| auto left_size = pos.size_before(idx); 1313| 2.53k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.53k| auto dropped_size = first; 1315| 2.53k| auto child_dropped_size = dropped_size - left_size; 1316| 2.53k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 2.53k, Folded] | Branch (1316:25): [True: 1.31k, False: 1.22k] | Branch (1316:45): [True: 999, False: 317] ------------------ 1317| 999| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 999] ------------------ 1318| 999| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 999| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 999] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 999| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 999] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 999| return r; 1324| 1.53k| } else { 1325| 1.53k| 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.53k| auto newcount = count - idx; 1330| 1.53k| auto newn = 1331| 1.53k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.53k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.53k| : node_t::make_inner_r_e(e); 1336| 1.53k| auto newr = newn->relaxed(); 1337| 1.53k| IMMER_TRY { ------------------ | | 49| 1.53k|#define IMMER_TRY try ------------------ 1338| 1.53k| auto subs = 1339| 1.53k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.53k] ------------------ 1340| 1.53k| : pos.towards_sub_oh( 1341| 1.53k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.53k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.53k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.53k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.53k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.53k, False: 0] ------------------ 1346| 1.53k| pos.copy_sizes( 1347| 1.53k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.53k| newr->d.count = newcount; 1349| 1.53k| newn->inner()[0] = get<1>(subs); 1350| 1.53k| std::copy(node->inner() + idx + 1, 1351| 1.53k| node->inner() + count, 1352| 1.53k| newn->inner() + 1); 1353| 1.53k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.53k, False: 0] ------------------ 1354| 1.53k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.53k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.53k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.53k| } 1358| 1.53k| return std::make_tuple(pos.shift(), newn); 1359| 1.53k| } 1360| 1.53k| 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.53k| } 1373| 2.53k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 2.87k| { 1304| 2.87k| auto idx = pos.subindex(first); 1305| 2.87k| auto count = pos.count(); 1306| 2.87k| auto node = pos.node(); 1307| 2.87k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.87k] ------------------ 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.87k| auto left_size = pos.size_before(idx); 1313| 2.87k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.87k| auto dropped_size = first; 1315| 2.87k| auto child_dropped_size = dropped_size - left_size; 1316| 2.87k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 2.87k, Folded] | Branch (1316:25): [True: 602, False: 2.27k] | Branch (1316:45): [True: 387, False: 215] ------------------ 1317| 387| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 387] ------------------ 1318| 387| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 387| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 387] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 387| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 387] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 387| return r; 1324| 2.48k| } else { 1325| 2.48k| 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.48k| auto newcount = count - idx; 1330| 2.48k| auto newn = 1331| 2.48k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 2.48k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 2.48k| : node_t::make_inner_r_e(e); 1336| 2.48k| auto newr = newn->relaxed(); 1337| 2.48k| IMMER_TRY { ------------------ | | 49| 2.48k|#define IMMER_TRY try ------------------ 1338| 2.48k| auto subs = 1339| 2.48k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 2.48k] ------------------ 1340| 2.48k| : pos.towards_sub_oh( 1341| 2.48k| no_collapse_no_mut_t{}, first, idx, e); 1342| 2.48k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 2.48k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 2.48k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 2.48k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 2.48k, False: 0] ------------------ 1346| 2.48k| pos.copy_sizes( 1347| 2.48k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 2.48k| newr->d.count = newcount; 1349| 2.48k| newn->inner()[0] = get<1>(subs); 1350| 2.48k| std::copy(node->inner() + idx + 1, 1351| 2.48k| node->inner() + count, 1352| 2.48k| newn->inner() + 1); 1353| 2.48k| if (!mutate) { ------------------ | Branch (1353:21): [True: 2.48k, False: 0] ------------------ 1354| 2.48k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 2.48k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 2.48k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 2.48k| } 1358| 2.48k| return std::make_tuple(pos.shift(), newn); 1359| 2.48k| } 1360| 2.48k| 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.48k| } 1373| 2.87k| } _ZN5immer6detail4rbts16dec_left_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_j: 1209| 311| { 1210| 311| using node_t = node_type; 1211| 311| auto node = p.node(); 1212| 311| if (node->dec()) { ------------------ | Branch (1212:13): [True: 311, False: 0] ------------------ 1213| 311| p.each_left(dec_t{}, idx); 1214| 311| node_t::delete_inner(node, p.count()); 1215| 311| } 1216| 311| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb1EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 3.24k| { 1378| 3.24k| auto node = pos.node(); 1379| 3.24k| auto idx = pos.index(first); 1380| 3.24k| auto count = pos.count(); 1381| 3.24k| 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.24k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 560, False: 2.68k] ------------------ 1384| 3.24k| if (mutate) { ------------------ | Branch (1384:13): [True: 560, False: 2.68k] ------------------ 1385| 560| auto data = node->leaf(); 1386| 560| auto newcount = count - idx; 1387| 560| std::move(data + idx, data + count, data); 1388| 560| detail::destroy_n(data + newcount, idx); 1389| 560| return std::make_tuple(0, node); 1390| 2.68k| } else { 1391| 2.68k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 2.68k| if (Mutating) ------------------ | Branch (1392:17): [True: 2.68k, Folded] ------------------ 1393| 2.68k| pos.visit(dec_visitor{}); 1394| 2.68k| return std::make_tuple(0, newn); 1395| 2.68k| } 1396| 3.24k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 1.85k| { 1304| 1.85k| auto idx = pos.subindex(first); 1305| 1.85k| auto count = pos.count(); 1306| 1.85k| auto node = pos.node(); 1307| 1.85k| 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.85k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 670, False: 1.18k] ------------------ 1312| 1.85k| auto left_size = pos.size_before(idx); 1313| 1.85k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.85k| auto dropped_size = first; 1315| 1.85k| auto child_dropped_size = dropped_size - left_size; 1316| 1.85k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.85k] | 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.85k| } else { 1325| 1.85k| 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.85k| auto newcount = count - idx; 1330| 1.85k| auto newn = 1331| 1.85k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 670, False: 1.18k] ------------------ 1332| 670| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 670| norefs_tag{})) relaxed_t, 1334| 670| node) 1335| 1.85k| : node_t::make_inner_r_e(e); 1336| 1.85k| auto newr = newn->relaxed(); 1337| 1.85k| IMMER_TRY { ------------------ | | 49| 1.85k|#define IMMER_TRY try ------------------ 1338| 1.85k| auto subs = 1339| 1.85k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 670, False: 1.18k] ------------------ 1340| 1.85k| : pos.towards_sub_oh( 1341| 1.18k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.85k| if (mutate) ------------------ | Branch (1342:21): [True: 670, False: 1.18k] ------------------ 1343| 670| pos.each_left(dec_visitor{}, idx); 1344| 1.85k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.85k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.85k, False: 0] ------------------ 1346| 1.85k| pos.copy_sizes( 1347| 1.85k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.85k| newr->d.count = newcount; 1349| 1.85k| newn->inner()[0] = get<1>(subs); 1350| 1.85k| std::copy(node->inner() + idx + 1, 1351| 1.85k| node->inner() + count, 1352| 1.85k| newn->inner() + 1); 1353| 1.85k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.18k, False: 670] ------------------ 1354| 1.18k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.18k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.18k, Folded] ------------------ 1356| 1.18k| pos.visit(dec_visitor{}); 1357| 1.18k| } 1358| 1.85k| return std::make_tuple(pos.shift(), newn); 1359| 1.85k| } 1360| 1.85k| 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.85k| } 1373| 1.85k| } _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.2k| { 1378| 12.2k| auto node = pos.node(); 1379| 12.2k| auto idx = pos.index(first); 1380| 12.2k| auto count = pos.count(); 1381| 12.2k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 12.2k] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 0| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 0, False: 0] ------------------ 1384| 12.2k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 12.2k] ------------------ 1385| 0| auto data = node->leaf(); 1386| 0| auto newcount = count - idx; 1387| 0| std::move(data + idx, data + count, data); 1388| 0| detail::destroy_n(data + newcount, idx); 1389| 0| return std::make_tuple(0, node); 1390| 12.2k| } else { 1391| 12.2k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 12.2k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 12.2k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 12.2k| return std::make_tuple(0, newn); 1395| 12.2k| } 1396| 12.2k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 2.87k| { 1304| 2.87k| auto idx = pos.subindex(first); 1305| 2.87k| auto count = pos.count(); 1306| 2.87k| auto node = pos.node(); 1307| 2.87k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.87k] ------------------ 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.87k| auto left_size = pos.size_before(idx); 1313| 2.87k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.87k| auto dropped_size = first; 1315| 2.87k| auto child_dropped_size = dropped_size - left_size; 1316| 2.87k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 2.87k] | Branch (1316:25): [True: 0, False: 0] | Branch (1316:45): [True: 0, False: 0] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 0] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 2.87k| } else { 1325| 2.87k| 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.87k| auto newcount = count - idx; 1330| 2.87k| auto newn = 1331| 2.87k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 2.87k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 2.87k| : node_t::make_inner_r_e(e); 1336| 2.87k| auto newr = newn->relaxed(); 1337| 2.87k| IMMER_TRY { ------------------ | | 49| 2.87k|#define IMMER_TRY try ------------------ 1338| 2.87k| auto subs = 1339| 2.87k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 2.87k] ------------------ 1340| 2.87k| : pos.towards_sub_oh( 1341| 2.87k| no_collapse_no_mut_t{}, first, idx, e); 1342| 2.87k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 2.87k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 2.87k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 2.87k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 2.87k, False: 0] ------------------ 1346| 2.87k| pos.copy_sizes( 1347| 2.87k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 2.87k| newr->d.count = newcount; 1349| 2.87k| newn->inner()[0] = get<1>(subs); 1350| 2.87k| std::copy(node->inner() + idx + 1, 1351| 2.87k| node->inner() + count, 1352| 2.87k| newn->inner() + 1); 1353| 2.87k| if (!mutate) { ------------------ | Branch (1353:21): [True: 2.87k, False: 0] ------------------ 1354| 2.87k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 2.87k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 2.87k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 2.87k| } 1358| 2.87k| return std::make_tuple(pos.shift(), newn); 1359| 2.87k| } 1360| 2.87k| 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.87k| } 1373| 2.87k| } _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.13k| { 1210| 4.13k| using node_t = node_type; 1211| 4.13k| auto node = p.node(); 1212| 4.13k| if (node->dec()) { ------------------ | Branch (1212:13): [True: 4.13k, False: 0] ------------------ 1213| 4.13k| p.each_left(dec_t{}, idx); 1214| 4.13k| node_t::delete_inner(node, p.count()); 1215| 4.13k| } 1216| 4.13k| } _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| 11.8k| { 1378| 11.8k| auto node = pos.node(); 1379| 11.8k| auto idx = pos.index(first); 1380| 11.8k| auto count = pos.count(); 1381| 11.8k| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 11.8k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 8.00k, False: 3.84k] ------------------ 1384| 11.8k| if (mutate) { ------------------ | Branch (1384:13): [True: 8.00k, False: 3.84k] ------------------ 1385| 8.00k| auto data = node->leaf(); 1386| 8.00k| auto newcount = count - idx; 1387| 8.00k| std::move(data + idx, data + count, data); 1388| 8.00k| detail::destroy_n(data + newcount, idx); 1389| 8.00k| return std::make_tuple(0, node); 1390| 8.00k| } else { 1391| 3.84k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 3.84k| if (Mutating) ------------------ | Branch (1392:17): [True: 3.84k, Folded] ------------------ 1393| 3.84k| pos.visit(dec_visitor{}); 1394| 3.84k| return std::make_tuple(0, newn); 1395| 3.84k| } 1396| 11.8k| } _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.55k| { 1304| 1.55k| auto idx = pos.subindex(first); 1305| 1.55k| auto count = pos.count(); 1306| 1.55k| auto node = pos.node(); 1307| 1.55k| 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.55k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 580, False: 976] ------------------ 1312| 1.55k| auto left_size = pos.size_before(idx); 1313| 1.55k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.55k| auto dropped_size = first; 1315| 1.55k| auto child_dropped_size = dropped_size - left_size; 1316| 1.55k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.55k] | 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.55k| } else { 1325| 1.55k| 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.55k| auto newcount = count - idx; 1330| 1.55k| auto newn = 1331| 1.55k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 580, False: 976] ------------------ 1332| 580| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 580| norefs_tag{})) relaxed_t, 1334| 580| node) 1335| 1.55k| : node_t::make_inner_r_e(e); 1336| 1.55k| auto newr = newn->relaxed(); 1337| 1.55k| IMMER_TRY { ------------------ | | 49| 1.55k|#define IMMER_TRY try ------------------ 1338| 1.55k| auto subs = 1339| 1.55k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 580, False: 976] ------------------ 1340| 1.55k| : pos.towards_sub_oh( 1341| 976| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.55k| if (mutate) ------------------ | Branch (1342:21): [True: 580, False: 976] ------------------ 1343| 580| pos.each_left(dec_visitor{}, idx); 1344| 1.55k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.55k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.55k, False: 0] ------------------ 1346| 1.55k| pos.copy_sizes( 1347| 1.55k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.55k| newr->d.count = newcount; 1349| 1.55k| newn->inner()[0] = get<1>(subs); 1350| 1.55k| std::copy(node->inner() + idx + 1, 1351| 1.55k| node->inner() + count, 1352| 1.55k| newn->inner() + 1); 1353| 1.55k| if (!mutate) { ------------------ | Branch (1353:21): [True: 976, False: 580] ------------------ 1354| 976| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 976| if (Mutating) ------------------ | Branch (1355:25): [True: 976, Folded] ------------------ 1356| 976| pos.visit(dec_visitor{}); 1357| 976| } 1358| 1.55k| return std::make_tuple(pos.shift(), newn); 1359| 1.55k| } 1360| 1.55k| 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.55k| } 1373| 1.55k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 14.0k| { 1378| 14.0k| auto node = pos.node(); 1379| 14.0k| auto idx = pos.index(first); 1380| 14.0k| auto count = pos.count(); 1381| 14.0k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 14.0k] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 0| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 0, False: 0] ------------------ 1384| 14.0k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 14.0k] ------------------ 1385| 0| auto data = node->leaf(); 1386| 0| auto newcount = count - idx; 1387| 0| std::move(data + idx, data + count, data); 1388| 0| detail::destroy_n(data + newcount, idx); 1389| 0| return std::make_tuple(0, node); 1390| 14.0k| } else { 1391| 14.0k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 14.0k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 14.0k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 14.0k| return std::make_tuple(0, newn); 1395| 14.0k| } 1396| 14.0k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 4.39k| { 1304| 4.39k| auto idx = pos.subindex(first); 1305| 4.39k| auto count = pos.count(); 1306| 4.39k| auto node = pos.node(); 1307| 4.39k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 4.39k] ------------------ 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.39k| auto left_size = pos.size_before(idx); 1313| 4.39k| auto child_size = pos.size_sbh(idx, left_size); 1314| 4.39k| auto dropped_size = first; 1315| 4.39k| auto child_dropped_size = dropped_size - left_size; 1316| 4.39k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 4.39k] | 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.39k| } else { 1325| 4.39k| 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.39k| auto newcount = count - idx; 1330| 4.39k| auto newn = 1331| 4.39k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 4.39k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 4.39k| : node_t::make_inner_r_e(e); 1336| 4.39k| auto newr = newn->relaxed(); 1337| 4.39k| IMMER_TRY { ------------------ | | 49| 4.39k|#define IMMER_TRY try ------------------ 1338| 4.39k| auto subs = 1339| 4.39k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 4.39k] ------------------ 1340| 4.39k| : pos.towards_sub_oh( 1341| 4.39k| no_collapse_no_mut_t{}, first, idx, e); 1342| 4.39k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 4.39k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 4.39k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 4.39k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 4.39k, False: 0] ------------------ 1346| 4.39k| pos.copy_sizes( 1347| 4.39k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 4.39k| newr->d.count = newcount; 1349| 4.39k| newn->inner()[0] = get<1>(subs); 1350| 4.39k| std::copy(node->inner() + idx + 1, 1351| 4.39k| node->inner() + count, 1352| 4.39k| newn->inner() + 1); 1353| 4.39k| if (!mutate) { ------------------ | Branch (1353:21): [True: 4.39k, False: 0] ------------------ 1354| 4.39k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 4.39k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 4.39k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 4.39k| } 1358| 4.39k| return std::make_tuple(pos.shift(), newn); 1359| 4.39k| } 1360| 4.39k| 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.39k| } 1373| 4.39k| } _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.12k| { 1199| 5.12k| using node_t = node_type; 1200| 5.12k| auto node = p.node(); 1201| 5.12k| if (node->dec()) { ------------------ | Branch (1201:13): [True: 5.12k, False: 0] ------------------ 1202| 5.12k| p.each_left(dec_t{}, idx); 1203| 5.12k| node_t::delete_inner_r(node, p.count()); 1204| 5.12k| } 1205| 5.12k| } _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| 188k| { 1247| 188k| auto idx = pos.subindex(first); 1248| 188k| auto count = pos.count(); 1249| 188k| auto node = pos.node(); 1250| 188k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 188k, Folded] | Branch (1250:47): [True: 178k, False: 10.2k] ------------------ 1251| 188k| auto left_size = pos.size_before(idx); 1252| 188k| auto child_size = pos.size_sbh(idx, left_size); 1253| 188k| auto dropped_size = first; 1254| 188k| auto child_dropped_size = dropped_size - left_size; 1255| 188k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 188k] | 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| 188k| } else { 1264| 188k| using std::get; 1265| 188k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 178k, False: 10.2k] ------------------ 1266| 188k| : node_t::make_inner_r_e(e); 1267| 188k| auto newr = newn->relaxed(); 1268| 188k| auto newcount = count - idx; 1269| 188k| auto new_child_size = child_size - child_dropped_size; 1270| 188k| IMMER_TRY { ------------------ | | 49| 188k|#define IMMER_TRY try ------------------ 1271| 188k| auto subs = 1272| 188k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 178k, False: 10.2k] ------------------ 1273| 188k| : pos.towards_sub_oh( 1274| 10.2k| no_collapse_no_mut_t{}, first, idx, e); 1275| 188k| if (mutate) ------------------ | Branch (1275:21): [True: 178k, False: 10.2k] ------------------ 1276| 178k| pos.each_left(dec_visitor{}, idx); 1277| 188k| pos.copy_sizes( 1278| 188k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 188k| std::copy(node->inner() + idx + 1, 1280| 188k| node->inner() + count, 1281| 188k| newn->inner() + 1); 1282| 188k| newn->inner()[0] = get<1>(subs); 1283| 188k| newr->d.sizes[0] = new_child_size; 1284| 188k| newr->d.count = newcount; 1285| 188k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 188k, False: 0] ------------------ 1286| 188k| if (!mutate) { ------------------ | Branch (1286:21): [True: 10.2k, False: 178k] ------------------ 1287| 10.2k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 10.2k| if (Mutating) ------------------ | Branch (1288:25): [True: 10.2k, Folded] ------------------ 1289| 10.2k| pos.visit(dec_visitor{}); 1290| 10.2k| } 1291| 188k| return std::make_tuple(pos.shift(), newn); 1292| 188k| } 1293| 188k| 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| 188k| } 1299| 188k| } _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| 58.2k| { 1247| 58.2k| auto idx = pos.subindex(first); 1248| 58.2k| auto count = pos.count(); 1249| 58.2k| auto node = pos.node(); 1250| 58.2k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 58.2k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 58.2k| auto left_size = pos.size_before(idx); 1252| 58.2k| auto child_size = pos.size_sbh(idx, left_size); 1253| 58.2k| auto dropped_size = first; 1254| 58.2k| auto child_dropped_size = dropped_size - left_size; 1255| 58.2k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 58.2k] | 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| 58.2k| } else { 1264| 58.2k| using std::get; 1265| 58.2k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 58.2k] ------------------ 1266| 58.2k| : node_t::make_inner_r_e(e); 1267| 58.2k| auto newr = newn->relaxed(); 1268| 58.2k| auto newcount = count - idx; 1269| 58.2k| auto new_child_size = child_size - child_dropped_size; 1270| 58.2k| IMMER_TRY { ------------------ | | 49| 58.2k|#define IMMER_TRY try ------------------ 1271| 58.2k| auto subs = 1272| 58.2k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 58.2k] ------------------ 1273| 58.2k| : pos.towards_sub_oh( 1274| 58.2k| no_collapse_no_mut_t{}, first, idx, e); 1275| 58.2k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 58.2k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 58.2k| pos.copy_sizes( 1278| 58.2k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 58.2k| std::copy(node->inner() + idx + 1, 1280| 58.2k| node->inner() + count, 1281| 58.2k| newn->inner() + 1); 1282| 58.2k| newn->inner()[0] = get<1>(subs); 1283| 58.2k| newr->d.sizes[0] = new_child_size; 1284| 58.2k| newr->d.count = newcount; 1285| 58.2k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 58.2k, False: 0] ------------------ 1286| 58.2k| if (!mutate) { ------------------ | Branch (1286:21): [True: 58.2k, False: 0] ------------------ 1287| 58.2k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 58.2k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 58.2k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 58.2k| } 1291| 58.2k| return std::make_tuple(pos.shift(), newn); 1292| 58.2k| } 1293| 58.2k| IMMER_CATCH (...) { 1294| 0| if (!mutate) ------------------ | Branch (1294:21): [True: 0, False: 0] ------------------ 1295| 0| node_t::delete_inner_r_e(newn); 1296| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1297| 0| } 1298| 58.2k| } 1299| 58.2k| } _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.00k| { 1304| 9.00k| auto idx = pos.subindex(first); 1305| 9.00k| auto count = pos.count(); 1306| 9.00k| auto node = pos.node(); 1307| 9.00k| auto mutate = Mutating ------------------ | Branch (1307:23): [True: 0, Folded] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 9.00k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 6.89k, False: 2.11k] ------------------ 1312| 9.00k| auto left_size = pos.size_before(idx); 1313| 9.00k| auto child_size = pos.size_sbh(idx, left_size); 1314| 9.00k| auto dropped_size = first; 1315| 9.00k| auto child_dropped_size = dropped_size - left_size; 1316| 9.00k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 9.00k, Folded] | Branch (1316:25): [True: 6.72k, False: 2.27k] | Branch (1316:45): [True: 5.19k, False: 1.53k] ------------------ 1317| 5.19k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 4.13k, False: 1.06k] ------------------ 1318| 5.19k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 5.19k| if (mutate) ------------------ | Branch (1319:17): [True: 4.13k, False: 1.06k] ------------------ 1320| 4.13k| pos.visit(dec_left_visitor{}, idx); 1321| 1.06k| else if (Mutating) ------------------ | Branch (1321:22): [True: 1.06k, Folded] ------------------ 1322| 1.06k| pos.visit(dec_visitor{}); 1323| 5.19k| return r; 1324| 5.19k| } else { 1325| 3.81k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 3.81k| auto newcount = count - idx; 1330| 3.81k| auto newn = 1331| 3.81k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 2.76k, False: 1.05k] ------------------ 1332| 2.76k| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 2.76k| norefs_tag{})) relaxed_t, 1334| 2.76k| node) 1335| 3.81k| : node_t::make_inner_r_e(e); 1336| 3.81k| auto newr = newn->relaxed(); 1337| 3.81k| IMMER_TRY { ------------------ | | 49| 3.81k|#define IMMER_TRY try ------------------ 1338| 3.81k| auto subs = 1339| 3.81k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 2.76k, False: 1.05k] ------------------ 1340| 3.81k| : pos.towards_sub_oh( 1341| 1.05k| no_collapse_no_mut_t{}, first, idx, e); 1342| 3.81k| if (mutate) ------------------ | Branch (1342:21): [True: 2.76k, False: 1.05k] ------------------ 1343| 2.76k| pos.each_left(dec_visitor{}, idx); 1344| 3.81k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 3.81k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 3.81k, False: 0] ------------------ 1346| 3.81k| pos.copy_sizes( 1347| 3.81k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 3.81k| newr->d.count = newcount; 1349| 3.81k| newn->inner()[0] = get<1>(subs); 1350| 3.81k| std::copy(node->inner() + idx + 1, 1351| 3.81k| node->inner() + count, 1352| 3.81k| newn->inner() + 1); 1353| 3.81k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.05k, False: 2.76k] ------------------ 1354| 1.05k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.05k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.05k, Folded] ------------------ 1356| 1.05k| pos.visit(dec_visitor{}); 1357| 1.05k| } 1358| 3.81k| return std::make_tuple(pos.shift(), newn); 1359| 3.81k| } 1360| 3.81k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 3.81k| } 1373| 9.00k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 3.37k| { 1304| 3.37k| auto idx = pos.subindex(first); 1305| 3.37k| auto count = pos.count(); 1306| 3.37k| auto node = pos.node(); 1307| 3.37k| auto mutate = Mutating ------------------ | Branch (1307:23): [True: 0, Folded] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 3.37k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 1.40k, False: 1.97k] ------------------ 1312| 3.37k| auto left_size = pos.size_before(idx); 1313| 3.37k| auto child_size = pos.size_sbh(idx, left_size); 1314| 3.37k| auto dropped_size = first; 1315| 3.37k| auto child_dropped_size = dropped_size - left_size; 1316| 3.37k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 3.37k, Folded] | Branch (1316:25): [True: 1.90k, False: 1.46k] | Branch (1316:45): [True: 1.69k, False: 216] ------------------ 1317| 1.69k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 311, False: 1.38k] ------------------ 1318| 1.69k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 1.69k| if (mutate) ------------------ | Branch (1319:17): [True: 311, False: 1.38k] ------------------ 1320| 311| pos.visit(dec_left_visitor{}, idx); 1321| 1.38k| else if (Mutating) ------------------ | Branch (1321:22): [True: 1.38k, Folded] ------------------ 1322| 1.38k| pos.visit(dec_visitor{}); 1323| 1.69k| return r; 1324| 1.69k| } else { 1325| 1.68k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 1.68k| auto newcount = count - idx; 1330| 1.68k| auto newn = 1331| 1.68k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 1.09k, False: 589] ------------------ 1332| 1.09k| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 1.09k| norefs_tag{})) relaxed_t, 1334| 1.09k| node) 1335| 1.68k| : node_t::make_inner_r_e(e); 1336| 1.68k| auto newr = newn->relaxed(); 1337| 1.68k| IMMER_TRY { ------------------ | | 49| 1.68k|#define IMMER_TRY try ------------------ 1338| 1.68k| auto subs = 1339| 1.68k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 1.09k, False: 589] ------------------ 1340| 1.68k| : pos.towards_sub_oh( 1341| 589| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.68k| if (mutate) ------------------ | Branch (1342:21): [True: 1.09k, False: 589] ------------------ 1343| 1.09k| pos.each_left(dec_visitor{}, idx); 1344| 1.68k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.68k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.68k, False: 0] ------------------ 1346| 1.68k| pos.copy_sizes( 1347| 1.68k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.68k| newr->d.count = newcount; 1349| 1.68k| newn->inner()[0] = get<1>(subs); 1350| 1.68k| std::copy(node->inner() + idx + 1, 1351| 1.68k| node->inner() + count, 1352| 1.68k| newn->inner() + 1); 1353| 1.68k| if (!mutate) { ------------------ | Branch (1353:21): [True: 589, False: 1.09k] ------------------ 1354| 589| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 589| if (Mutating) ------------------ | Branch (1355:25): [True: 589, Folded] ------------------ 1356| 589| pos.visit(dec_visitor{}); 1357| 589| } 1358| 1.68k| return std::make_tuple(pos.shift(), newn); 1359| 1.68k| } 1360| 1.68k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 1.68k| } 1373| 3.37k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_16rrbtree_iteratorIiSE_Lj2ELj2EEESF_EEbOT_OT0_PT1_jm: 349| 13.1k| { 350| 13.1k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 13.1k, False: 0] ------------------ 351| 13.1k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 12.0k, False: 1.09k] ------------------ 352| 13.1k| ? visit_maybe_relaxed_sub(rootl, 353| 12.0k| shiftl, 354| 12.0k| sizel, 355| 12.0k| this_t{}, 356| 12.0k| posr, 357| 12.0k| first, 358| 12.0k| size_t{}) 359| 13.1k| : posr.first_sub_inner( 360| 1.09k| rrb{}, first, rootl, shiftl, sizel); 361| 13.1k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESG_RNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEbOT_OT0_OT1_m: 382| 30.6k| { 383| 30.6k| auto nl = posl.node(); 384| 30.6k| auto nr = posr.node(); 385| 30.6k| if (nl == nr) ------------------ | Branch (385:13): [True: 9.72k, False: 20.9k] ------------------ 386| 9.72k| return true; 387| 20.9k| auto cl = posl.count(); 388| 20.9k| auto cr = posr.count(); 389| 20.9k| assert(cr > 0); ------------------ | Branch (389:9): [True: 20.9k, False: 0] ------------------ 390| 20.9k| auto sbr = size_t{}; 391| 20.9k| auto i = count_t{}; 392| 20.9k| auto j = count_t{}; 393| 61.9k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 51.4k, False: 10.4k] ------------------ 394| 51.4k| auto sbl = posl.size_before(i); 395| 80.4k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 65.0k, False: 15.3k] | Branch (395:34): [True: 28.9k, False: 36.0k] ------------------ 396| 28.9k| ; 397| 51.4k| auto res = 398| 51.4k| sbl == sbr ------------------ | Branch (398:17): [True: 33.4k, False: 18.0k] ------------------ 399| 51.4k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 51.4k| : posl.nth_sub(i, 401| 18.0k| for_each_chunk_p_visitor{}, 402| 18.0k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 51.4k| if (!res) ------------------ | Branch (403:17): [True: 10.4k, False: 40.9k] ------------------ 404| 10.4k| return false; 405| 51.4k| } 406| 10.4k| return true; 407| 20.9k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 336| 9.33k| { 337| 9.33k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 9.33k| } _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| 10.0k| { 428| 10.0k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 4.64k, False: 5.36k] ------------------ 429| 4.64k| return true; 430| 5.36k| auto cl = posl.count(); 431| 5.36k| auto cr = posr.count(); 432| 5.36k| auto mp = std::min(cl, cr); 433| 5.36k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 3.42k, False: 1.93k] ------------------ 434| 5.36k| posl.node()->leaf() + mp, 435| 5.36k| posr.node()->leaf()) && 436| 3.42k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 2.89k, False: 538] ------------------ 437| 3.42k| posl.node()->leaf() + posl.count(), 438| 3.42k| first + (idx + mp)); 439| 10.0k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESH_RNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 329| 21.7k| { 330| 21.7k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 21.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.61k| { 413| 4.61k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 4.61k| } _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.61k| { 383| 4.61k| auto nl = posl.node(); 384| 4.61k| auto nr = posr.node(); 385| 4.61k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 4.61k] ------------------ 386| 0| return true; 387| 4.61k| auto cl = posl.count(); 388| 4.61k| auto cr = posr.count(); 389| 4.61k| assert(cr > 0); ------------------ | Branch (389:9): [True: 4.61k, False: 0] ------------------ 390| 4.61k| auto sbr = size_t{}; 391| 4.61k| auto i = count_t{}; 392| 4.61k| auto j = count_t{}; 393| 13.0k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 10.9k, False: 2.14k] ------------------ 394| 10.9k| auto sbl = posl.size_before(i); 395| 17.0k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 12.6k, False: 4.40k] | Branch (395:34): [True: 6.07k, False: 6.55k] ------------------ 396| 6.07k| ; 397| 10.9k| auto res = 398| 10.9k| sbl == sbr ------------------ | Branch (398:17): [True: 6.69k, False: 4.26k] ------------------ 399| 10.9k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 10.9k| : posl.nth_sub(i, 401| 4.26k| for_each_chunk_p_visitor{}, 402| 4.26k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 10.9k| if (!res) ------------------ | Branch (403:17): [True: 2.47k, False: 8.48k] ------------------ 404| 2.47k| return false; 405| 10.9k| } 406| 2.14k| return true; 407| 4.61k| } _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.73k| { 337| 3.73k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 3.73k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_12leaf_sub_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEbOT_OT0_OT1_m: 427| 6.79k| { 428| 6.79k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 3.93k, False: 2.86k] ------------------ 429| 3.93k| return true; 430| 2.86k| auto cl = posl.count(); 431| 2.86k| auto cr = posr.count(); 432| 2.86k| auto mp = std::min(cl, cr); 433| 2.86k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 2.63k, False: 229] ------------------ 434| 2.86k| posl.node()->leaf() + mp, 435| 2.86k| posr.node()->leaf()) && 436| 2.63k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 2.39k, False: 233] ------------------ 437| 2.63k| posl.node()->leaf() + posl.count(), 438| 2.63k| first + (idx + mp)); 439| 6.79k| } _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.22k| { 330| 2.22k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.22k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_11relaxed_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEENSt3__19enable_ifIX12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 412| 2.74k| { 413| 2.74k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 2.74k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_11relaxed_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEbOT_OT0_OT1_m: 382| 2.74k| { 383| 2.74k| auto nl = posl.node(); 384| 2.74k| auto nr = posr.node(); 385| 2.74k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.74k] ------------------ 386| 0| return true; 387| 2.74k| auto cl = posl.count(); 388| 2.74k| auto cr = posr.count(); 389| 2.74k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.74k, False: 0] ------------------ 390| 2.74k| auto sbr = size_t{}; 391| 2.74k| auto i = count_t{}; 392| 2.74k| auto j = count_t{}; 393| 12.8k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 10.4k, False: 2.41k] ------------------ 394| 10.4k| auto sbl = posl.size_before(i); 395| 17.8k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 13.7k, False: 4.12k] | Branch (395:34): [True: 7.41k, False: 6.30k] ------------------ 396| 7.41k| ; 397| 10.4k| auto res = 398| 10.4k| sbl == sbr ------------------ | Branch (398:17): [True: 5.74k, False: 4.69k] ------------------ 399| 10.4k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 10.4k| : posl.nth_sub(i, 401| 4.69k| for_each_chunk_p_visitor{}, 402| 4.69k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 10.4k| if (!res) ------------------ | Branch (403:17): [True: 331, False: 10.1k] ------------------ 404| 331| return false; 405| 10.4k| } 406| 2.41k| return true; 407| 2.74k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_8full_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 336| 3.73k| { 337| 3.73k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 3.73k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_8full_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 329| 905| { 330| 905| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 905| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_8full_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 329| 1.10k| { 330| 1.10k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 1.10k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_15regular_sub_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEENSt3__19enable_ifIXnt12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 419| 1.85k| { 420| 1.85k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 1.85k, False: 0] ------------------ 421| 1.85k| ? this_t::visit_regular(posl, posr.node()) 422| 1.85k| : this_t::visit_regular(posr, posl.node()); 423| 1.85k| } _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: 6.76k, False: 3.91k] | Branch (445:33): [True: 2.06k, False: 1.85k] ------------------ 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| 14.3k| { 451| 14.3k| auto node = pos.node(); 452| 14.3k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 8.75k, False: 5.59k] | Branch (452:33): [True: 3.70k, False: 1.88k] ------------------ 453| 5.59k| node->leaf() + pos.count(), 454| 5.59k| other->leaf()); 455| 14.3k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESE_EEbOT_PT0_: 443| 7.81k| { 444| 7.81k| auto node = pos.node(); 445| 7.81k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 2.74k, False: 5.07k] | Branch (445:33): [True: 2.70k, False: 2.36k] ------------------ 446| 7.81k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESE_EEbOT_PT0_: 450| 2.95k| { 451| 2.95k| auto node = pos.node(); 452| 2.95k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.50k, False: 1.44k] | Branch (452:33): [True: 734, False: 707] ------------------ 453| 1.44k| node->leaf() + pos.count(), 454| 1.44k| other->leaf()); 455| 2.95k| } _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.97k| { 444| 3.97k| auto node = pos.node(); 445| 3.97k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 464, False: 3.51k] | Branch (445:33): [True: 2.33k, False: 1.17k] ------------------ 446| 3.97k| } _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| 351k| { 113| 351k| auto data = as_const(pos.node()->leaf()); 114| 351k| return fn(data, data + pos.count()); 115| 351k| } _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.25M| return [iter](auto f, auto e) mutable { 368| 1.25M| if (f == &*iter) { ------------------ | Branch (368:17): [True: 166k, False: 1.09M] ------------------ 369| 166k| iter += e - f; 370| 166k| return true; 371| 166k| } 372| 5.03M| for (; f != e; ++f, ++iter) ------------------ | Branch (372:20): [True: 3.94M, False: 1.08M] ------------------ 373| 3.94M| if (*f != *iter) ------------------ | Branch (373:21): [True: 3.36k, False: 3.93M] ------------------ 374| 3.36k| return false; 375| 1.08M| return true; 376| 1.09M| }; _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.66M| { 54| 8.66M| return pos.towards(this_t{}, idx); 55| 8.66M| } _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| 904k| { 60| 904k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 904k| } _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| 377k| { 54| 377k| return pos.towards(this_t{}, idx); 55| 377k| } _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| 354k| { 60| 354k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 354k| } _ZN5immer6detail4rbts18region_for_visitorIiE11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEENSt3__15tupleIJPimmEEEOT_m: 53| 1.02M| { 54| 1.02M| return pos.towards(this_t{}, idx); 55| 1.02M| } _ZN5immer6detail4rbts18region_for_visitorIiE10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEENSt3__15tupleIJPimmEEEOT_m: 59| 23.1k| { 60| 23.1k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 23.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| 111k| { 54| 111k| return pos.towards(this_t{}, idx); 55| 111k| } _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| 95.6k| { 107| 95.6k| return pos.each_pred(this_t{}, fn); 108| 95.6k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESH_RNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 329| 744| { 330| 744| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 744| } _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.76k| { 420| 6.76k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 6.76k, False: 0] ------------------ 421| 6.76k| ? this_t::visit_regular(posl, posr.node()) 422| 6.76k| : this_t::visit_regular(posr, posl.node()); 423| 6.76k| } _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| 889k| { 113| 889k| auto data = as_const(pos.node()->leaf()); 114| 889k| return fn(data, data + pos.count()); 115| 889k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 19.5k| { 107| 19.5k| return pos.each_pred(this_t{}, fn); 108| 19.5k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 112| 18.2k| { 113| 18.2k| auto data = as_const(pos.node()->leaf()); 114| 18.2k| return fn(data, data + pos.count()); 115| 18.2k| } _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.47k| { 107| 6.47k| return pos.each_pred(this_t{}, fn); 108| 6.47k| } _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.70k| { 330| 2.70k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.70k| } _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.43k| { 383| 2.43k| auto nl = posl.node(); 384| 2.43k| auto nr = posr.node(); 385| 2.43k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.43k] ------------------ 386| 0| return true; 387| 2.43k| auto cl = posl.count(); 388| 2.43k| auto cr = posr.count(); 389| 2.43k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.43k, False: 0] ------------------ 390| 2.43k| auto sbr = size_t{}; 391| 2.43k| auto i = count_t{}; 392| 2.43k| auto j = count_t{}; 393| 8.27k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 6.59k, False: 1.68k] ------------------ 394| 6.59k| 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.08k, False: 2.18k] | Branch (395:34): [True: 3.67k, False: 4.41k] ------------------ 396| 3.67k| ; 397| 6.59k| auto res = 398| 6.59k| sbl == sbr ------------------ | Branch (398:17): [True: 4.13k, False: 2.45k] ------------------ 399| 6.59k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 6.59k| : posl.nth_sub(i, 401| 2.45k| for_each_chunk_p_visitor{}, 402| 2.45k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 6.59k| if (!res) ------------------ | Branch (403:17): [True: 754, False: 5.83k] ------------------ 404| 754| return false; 405| 6.59k| } 406| 1.68k| return true; 407| 2.43k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 336| 5.05k| { 337| 5.05k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 5.05k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_13full_leaf_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEbOT_OT0_OT1_m: 427| 5.05k| { 428| 5.05k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 3.06k, False: 1.99k] ------------------ 429| 3.06k| return true; 430| 1.99k| auto cl = posl.count(); 431| 1.99k| auto cr = posr.count(); 432| 1.99k| auto mp = std::min(cl, cr); 433| 1.99k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 1.59k, False: 398] ------------------ 434| 1.99k| posl.node()->leaf() + mp, 435| 1.99k| posr.node()->leaf()) && 436| 1.59k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 1.59k, False: 0] ------------------ 437| 1.59k| posl.node()->leaf() + posl.count(), 438| 1.59k| first + (idx + mp)); 439| 5.05k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 329| 2.87k| { 330| 2.87k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.87k| } _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.82k| { 383| 1.82k| auto nl = posl.node(); 384| 1.82k| auto nr = posr.node(); 385| 1.82k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 1.82k] ------------------ 386| 0| return true; 387| 1.82k| auto cl = posl.count(); 388| 1.82k| auto cr = posr.count(); 389| 1.82k| assert(cr > 0); ------------------ | Branch (389:9): [True: 1.82k, False: 0] ------------------ 390| 1.82k| auto sbr = size_t{}; 391| 1.82k| auto i = count_t{}; 392| 1.82k| auto j = count_t{}; 393| 8.28k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 6.78k, False: 1.50k] ------------------ 394| 6.78k| auto sbl = posl.size_before(i); 395| 11.6k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 10.2k, False: 1.48k] | Branch (395:34): [True: 4.90k, False: 5.30k] ------------------ 396| 4.90k| ; 397| 6.78k| auto res = 398| 6.78k| sbl == sbr ------------------ | Branch (398:17): [True: 4.13k, False: 2.64k] ------------------ 399| 6.78k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 6.78k| : posl.nth_sub(i, 401| 2.64k| for_each_chunk_p_visitor{}, 402| 2.64k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 6.78k| if (!res) ------------------ | Branch (403:17): [True: 322, False: 6.45k] ------------------ 404| 322| return false; 405| 6.78k| } 406| 1.50k| return true; 407| 1.82k| } _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.04k| { 420| 1.04k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 1.04k, False: 0] ------------------ 421| 1.04k| ? this_t::visit_regular(posl, posr.node()) 422| 1.04k| : this_t::visit_regular(posr, posl.node()); 423| 1.04k| } _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| 546k| { 107| 546k| return pos.each_pred(this_t{}, fn); 108| 546k| } _ZN5immer6detail4rbts14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaOT_: 366| 32.0k| { 367| 32.0k| return [iter](auto f, auto e) mutable { 368| 32.0k| if (f == &*iter) { 369| 32.0k| iter += e - f; 370| 32.0k| return true; 371| 32.0k| } 372| 32.0k| for (; f != e; ++f, ++iter) 373| 32.0k| if (*f != *iter) 374| 32.0k| return false; 375| 32.0k| return true; 376| 32.0k| }; 377| 32.0k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEESF_EEbOT_OT0_PT1_jm: 349| 1.42k| { 350| 1.42k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 1.42k, False: 0] ------------------ 351| 1.42k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 1.09k, False: 329] ------------------ 352| 1.42k| ? visit_maybe_relaxed_sub(rootl, 353| 1.09k| shiftl, 354| 1.09k| sizel, 355| 1.09k| this_t{}, 356| 1.09k| posr, 357| 1.09k| first, 358| 1.09k| size_t{}) 359| 1.42k| : posr.first_sub_inner( 360| 329| rrb{}, first, rootl, shiftl, sizel); 361| 1.42k| } _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.50k| { 350| 6.50k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 6.50k, False: 0] ------------------ 351| 6.50k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 6.50k, False: 0] ------------------ 352| 6.50k| ? visit_maybe_relaxed_sub(rootl, 353| 6.50k| shiftl, 354| 6.50k| sizel, 355| 6.50k| this_t{}, 356| 6.50k| posr, 357| 6.50k| first, 358| 6.50k| size_t{}) 359| 6.50k| : posr.first_sub_inner( 360| 0| rrb{}, first, rootl, shiftl, sizel); 361| 6.50k| } _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| 7.58k| { 451| 7.58k| auto node = pos.node(); 452| 7.58k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 4.73k, False: 2.85k] | Branch (452:33): [True: 1.04k, False: 1.80k] ------------------ 453| 2.85k| node->leaf() + pos.count(), 454| 2.85k| other->leaf()); 455| 7.58k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_11dec_visitorEJEEEDcPT_jmT0_DpOT1_: 1838| 30.2M|{ 1839| 30.2M| assert(node); ------------------ | Branch (1839:5): [True: 30.2M, False: 0] ------------------ 1840| 30.2M| auto relaxed = node->relaxed(); 1841| 30.2M| if (relaxed) { ------------------ | Branch (1841:9): [True: 27.7M, False: 2.48M] ------------------ 1842| 27.7M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 27.7M, False: 0] ------------------ 1843| 27.7M| return make_relaxed_pos(node, shift, relaxed) 1844| 27.7M| .visit(v, std::forward(args)...); 1845| 27.7M| } else { 1846| 2.48M| return make_regular_sub_pos(node, shift, size) 1847| 2.48M| .visit(v, std::forward(args)...); 1848| 2.48M| } 1849| 30.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| 93.3M|{ 1829| 93.3M| assert(node); ------------------ | Branch (1829:5): [True: 93.3M, False: 0] ------------------ 1830| 93.3M| assert(relaxed); ------------------ | Branch (1830:5): [True: 93.3M, False: 0] ------------------ 1831| 93.3M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1831:5): [True: 93.3M, False: 0] ------------------ 1832| 93.3M| return {node, shift, relaxed}; 1833| 93.3M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1813| 35.3M| { 1814| 35.3M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 35.3M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 1431| 57.4M| 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.4M| { 1477| 11.4M| each_left(v, relaxed_->d.count, args...); 1478| 11.4M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1623| 11.6M| { 1624| 11.6M| auto p = node_->inner(); 1625| 11.6M| auto s = size_t{}; 1626| 11.6M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 2.03M, False: 9.65M] ------------------ 1627| 8.94M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 6.90M, False: 2.03M] ------------------ 1628| 6.90M| IMMER_PREFETCH(p + i + 1); 1629| 6.90M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 6.90M| .visit(v, args...); 1631| 6.90M| s = relaxed_->d.sizes[i]; 1632| 6.90M| assert(s); ------------------ | Branch (1632:17): [True: 6.90M, False: 0] ------------------ 1633| 6.90M| } 1634| 9.65M| } else { 1635| 9.65M| auto ss = shift_ - B; 1636| 38.3M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 28.6M, False: 9.65M] ------------------ 1637| 28.6M| visit_maybe_relaxed_sub( 1638| 28.6M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 28.6M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 28.6M, False: 0] ------------------ 1641| 28.6M| } 1642| 9.65M| } 1643| 11.6M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5countEv: 1430| 54.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.49M| { 1037| 2.49M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.49M| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 785| 7.96M| 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| 531k| { 826| 531k| return each_regular(*this, v, args...); 827| 531k| } _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| 531k|{ 344| 531k| constexpr auto B = bits; 345| 531k| constexpr auto BL = bits_leaf; 346| 531k| auto n = p.node()->inner(); 347| 531k| auto last = p.count() - 1; 348| 531k| auto e = n + last; 349| 531k| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 49.2k, False: 481k] ------------------ 350| 105k| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 56.6k, False: 49.2k] ------------------ 351| 56.6k| IMMER_PREFETCH(n + 1); 352| 56.6k| make_full_leaf_pos(*n).visit(v, args...); 353| 56.6k| } 354| 49.2k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 481k| } else { 356| 481k| auto ss = p.shift() - B; 357| 1.13M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 655k, False: 481k] ------------------ 358| 655k| make_full_pos(*n, ss).visit(v, args...); 359| 481k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 481k| } 361| 531k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 787| 7.58M| 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.15M|{ 215| 4.15M| assert(node); ------------------ | Branch (215:5): [True: 4.15M, False: 0] ------------------ 216| 4.15M| return {node}; 217| 4.15M|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 207| 1.08M| { 208| 1.08M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.08M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 199| 3.12M| 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.55M| 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| 981k|{ 120| 981k| assert(node); ------------------ | Branch (120:5): [True: 981k, False: 0] ------------------ 121| 981k| assert(size > 0); ------------------ | Branch (121:5): [True: 981k, False: 0] ------------------ 122| 981k| return {node, size}; 123| 981k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 786| 3.92M| 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| 425k| { 113| 425k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 425k| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 104| 985k| 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.07M| 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.11M| 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| 5.83M|{ 1413| 5.83M| assert(node); ------------------ | Branch (1413:5): [True: 5.83M, False: 0] ------------------ 1414| 5.83M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1414:5): [True: 5.83M, False: 0] ------------------ 1415| 5.83M| return {node, shift}; 1416| 5.83M|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1405| 2.96M| { 1406| 2.96M| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.96M| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 1159| 3.81M| 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| 205k| { 1186| 205k| auto p = node_->inner(); 1187| 205k| auto e = p + branches; 1188| 205k| if (shift_ == BL) { ------------------ | Branch (1188:13): [True: 157k, False: 47.3k] ------------------ 1189| 789k| for (; p != e; ++p) { ------------------ | Branch (1189:20): [True: 631k, False: 157k] ------------------ 1190| 631k| IMMER_PREFETCH(p + 1); 1191| 631k| make_full_leaf_pos(*p).visit(v, args...); 1192| 631k| } 1193| 157k| } else { 1194| 47.3k| auto ss = shift_ - B; 1195| 236k| for (; p != e; ++p) ------------------ | Branch (1195:20): [True: 189k, False: 47.3k] ------------------ 1196| 189k| make_full_pos(*p, ss).visit(v, args...); 1197| 47.3k| } 1198| 205k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5countEv: 1158| 1.81M| 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| 4.81M|{ 691| 4.81M| assert(node); ------------------ | Branch (691:5): [True: 4.81M, False: 0] ------------------ 692| 4.81M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (692:5): [True: 4.81M, False: 0] ------------------ 693| 4.81M| assert(size > 0); ------------------ | Branch (693:5): [True: 4.81M, False: 0] ------------------ 694| 4.81M| return {node, shift, size}; 695| 4.81M|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 336| 2.02M| { 337| 2.02M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.02M| } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 231| 8.79M| 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| 1.90M| { 244| 1.90M| return each_regular(*this, v, args...); 245| 1.90M| } _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| 1.90M|{ 344| 1.90M| constexpr auto B = bits; 345| 1.90M| constexpr auto BL = bits_leaf; 346| 1.90M| auto n = p.node()->inner(); 347| 1.90M| auto last = p.count() - 1; 348| 1.90M| auto e = n + last; 349| 1.90M| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 368k, False: 1.53M] ------------------ 350| 742k| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 374k, False: 368k] ------------------ 351| 374k| IMMER_PREFETCH(n + 1); 352| 374k| make_full_leaf_pos(*n).visit(v, args...); 353| 374k| } 354| 368k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 1.53M| } else { 356| 1.53M| auto ss = p.shift() - B; 357| 3.63M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 2.10M, False: 1.53M] ------------------ 358| 2.10M| make_full_pos(*n, ss).visit(v, args...); 359| 1.53M| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 1.53M| } 361| 1.90M|} _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 233| 8.39M| 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| 11.9M| 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| 6.13M| 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| 11.6M| count_t index(size_t idx) const { return (idx >> shift_) & mask; } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5countEv: 784| 9.15M| 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.45M| 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.62M|{ 65| 1.62M| return {node}; 66| 1.62M|} _ZN5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 57| 1.62M| { 58| 1.62M| return Visitor::visit_regular(*this, std::forward(args)...); 59| 1.62M| } _ZNK5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 41| 1.62M| 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.5M|{ 152| 17.5M| assert(node); ------------------ | Branch (152:5): [True: 17.5M, False: 0] ------------------ 153| 17.5M| assert(count <= branches); ------------------ | Branch (153:5): [True: 17.5M, False: 0] ------------------ 154| 17.5M| return {node, count}; 155| 17.5M|} _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 144| 9.99M| { 145| 9.99M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 9.99M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 136| 15.2M| node_t* node() const { return node_; } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5countEv: 135| 8.39M| 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.54M|{ 89| 1.54M| assert(node); ------------------ | Branch (89:5): [True: 1.54M, False: 0] ------------------ 90| 1.54M| return {node}; 91| 1.54M|} _ZN5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 81| 1.54M| { 82| 1.54M| return Visitor::visit_leaf(*this, std::forward(args)...); 83| 1.54M| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 75| 1.54M| 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.63k| 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| 502k| { 1814| 502k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 502k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 1433| 11.0M| 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.57M| { 1444| 5.57M| return size_sbh(offset, size_before(offset)); 1445| 5.57M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8size_sbhEjm: 1448| 5.93M| { 1449| 5.93M| assert(size_before_hint == size_before(offset)); ------------------ | Branch (1449:9): [True: 5.93M, False: 0] ------------------ 1450| 5.93M| return relaxed_->d.sizes[offset] - size_before_hint; 1451| 5.93M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11size_beforeEj: 1438| 16.8M| { 1439| 16.8M| return offset ? relaxed_->d.sizes[offset - 1] : 0; ------------------ | Branch (1439:16): [True: 10.5M, False: 6.25M] ------------------ 1440| 16.8M| } _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| 489k| { 1738| 489k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 489k, False: 0] ------------------ 1739| 489k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 489k, False: 0] ------------------ 1740| 489k| auto child = node_->inner()[offset_hint]; 1741| 489k| auto is_leaf = shift_ == BL; 1742| 489k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 489k] ------------------ 1743| 489k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 489k| : visit_maybe_relaxed_sub( 1745| 489k| child, shift_ - B, child_size_hint, v, args...); 1746| 489k| } _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| 489k|{ 1839| 489k| assert(node); ------------------ | Branch (1839:5): [True: 489k, False: 0] ------------------ 1840| 489k| auto relaxed = node->relaxed(); 1841| 489k| if (relaxed) { ------------------ | Branch (1841:9): [True: 308k, False: 180k] ------------------ 1842| 308k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 308k, False: 0] ------------------ 1843| 308k| return make_relaxed_pos(node, shift, relaxed) 1844| 308k| .visit(v, std::forward(args)...); 1845| 308k| } else { 1846| 180k| return make_regular_sub_pos(node, shift, size) 1847| 180k| .visit(v, std::forward(args)...); 1848| 180k| } 1849| 489k|} _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| 180k| { 1037| 180k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 180k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 788| 2.21M| 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| 447k| { 953| 447k| return last_oh_regular(*this, v, offset_hint, args...); 954| 447k| } _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| 447k|{ 678| 447k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 447k, False: 0] ------------------ 679| 447k| constexpr auto B = bits; 680| 447k| constexpr auto BL = bits_leaf; 681| 447k| auto child = p.node()->inner()[offset_hint]; 682| 447k| auto is_leaf = p.shift() == BL; 683| 447k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 447k] ------------------ 684| 447k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 447k| .visit(v, args...); 686| 447k|} _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| 1.86M| { 337| 1.86M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.86M| } _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.41M| { 331| 1.41M| return last_oh_regular(*this, v, offset_hint, args...); 332| 1.41M| } _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.41M|{ 678| 1.41M| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.41M, False: 0] ------------------ 679| 1.41M| constexpr auto B = bits; 680| 1.41M| constexpr auto BL = bits_leaf; 681| 1.41M| auto child = p.node()->inner()[offset_hint]; 682| 1.41M| auto is_leaf = p.shift() == BL; 683| 1.41M| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.41M] ------------------ 684| 1.41M| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.41M| .visit(v, args...); 686| 1.41M|} _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 1432| 20.6M| 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| 290k| { 1037| 290k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 290k| } 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| 35.5k| { 145| 35.5k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 35.5k| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 139| 1.07M| 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| 354k|{ 1839| 354k| assert(node); ------------------ | Branch (1839:5): [True: 354k, False: 0] ------------------ 1840| 354k| auto relaxed = node->relaxed(); 1841| 354k| if (relaxed) { ------------------ | Branch (1841:9): [True: 329k, False: 24.8k] ------------------ 1842| 329k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 329k, False: 0] ------------------ 1843| 329k| return make_relaxed_pos(node, shift, relaxed) 1844| 329k| .visit(v, std::forward(args)...); 1845| 329k| } else { 1846| 24.8k| return make_regular_sub_pos(node, shift, size) 1847| 24.8k| .visit(v, std::forward(args)...); 1848| 24.8k| } 1849| 354k|} 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| 329k| { 1814| 329k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 329k| } _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| 38.7M| while (relaxed_->d.sizes[offset] <= idx) ------------------ | Branch (1456:16): [True: 9.98M, False: 28.8M] ------------------ 1457| 9.98M| ++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| 329k| 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| 329k| { 1687| 329k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 329k, False: 0] ------------------ 1688| 329k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 66.6k, False: 262k] ------------------ 1689| 329k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 329k| } 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| 329k| { 1699| 329k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 329k| } 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| 329k| { 1718| 329k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 329k, False: 0] ------------------ 1719| 329k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 66.6k, False: 262k] | Branch (1719:9): [True: 329k, False: 0] ------------------ 1720| 329k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 329k| auto child = node_->inner()[offset_hint]; 1722| 329k| auto is_leaf = shift_ == BL; 1723| 329k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 329k| auto next_idx = idx - left_size_hint; 1725| 329k| return is_leaf ------------------ | Branch (1725:16): [True: 56.7k, False: 272k] ------------------ 1726| 329k| ? make_leaf_sub_pos(child, next_size) 1727| 56.7k| .visit(v, next_idx, args...) 1728| 329k| : visit_maybe_relaxed_sub( 1729| 272k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 329k| } 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| 56.7k| { 145| 56.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 56.7k| } 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| 24.8k| { 1037| 24.8k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 24.8k| } flex-vector.cpp:_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_: 938| 24.8k| { 939| 24.8k| return towards_oh_ch_regular( 940| 24.8k| *this, v, idx, offset_hint, count(), args...); 941| 24.8k| } flex-vector.cpp:_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_14update_visitorISD_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcOSL_T0_mjjDpOT1_: 632| 24.8k|{ 633| 24.8k| constexpr auto B = bits; 634| 24.8k| constexpr auto BL = bits_leaf; 635| 24.8k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 24.8k, False: 0] ------------------ 636| 24.8k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 24.8k, False: 0] ------------------ 637| 24.8k| auto is_leaf = p.shift() == BL; 638| 24.8k| auto child = p.node()->inner()[offset_hint]; 639| 24.8k| auto is_full = offset_hint + 1 != count_hint; 640| 24.8k| return is_full ------------------ | Branch (640:12): [True: 19.0k, False: 5.84k] ------------------ 641| 24.8k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 8.35k, False: 10.6k] ------------------ 642| 19.0k| : make_full_pos(child, p.shift() - B) 643| 10.6k| .visit(v, idx, args...)) 644| 24.8k| : (is_leaf ------------------ | Branch (644:19): [True: 1.97k, False: 3.87k] ------------------ 645| 5.84k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 5.84k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.87k| .visit(v, idx, args...)); 648| 24.8k|} flex-vector.cpp:_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 207| 21.6k| { 208| 21.6k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 21.6k| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 202| 432k| 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| 16.5k| { 1406| 16.5k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 16.5k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 1162| 2.15M| 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| 16.5k| { 1330| 16.5k| return towards_oh(v, idx, offset_hint, args...); 1331| 16.5k| } flex-vector.cpp:_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjDpOT0_: 1336| 16.5k| { 1337| 16.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 16.5k, False: 0] ------------------ 1338| 16.5k| auto is_leaf = shift_ == BL; 1339| 16.5k| auto child = node_->inner()[offset_hint]; 1340| 16.5k| return is_leaf ------------------ | Branch (1340:16): [True: 11.4k, False: 5.04k] ------------------ 1341| 16.5k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 16.5k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 16.5k| } flex-vector.cpp:_ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 112| 3.23k| { 113| 3.23k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 3.23k| } flex-vector.cpp:_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 336| 4.23k| { 337| 4.23k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.23k| } flex-vector.cpp:_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_: 316| 4.23k| { 317| 4.23k| return towards_oh_ch_regular( 318| 4.23k| *this, v, idx, offset_hint, count(), args...); 319| 4.23k| } flex-vector.cpp:_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_14update_visitorISD_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcOSL_T0_mjjDpOT1_: 632| 4.23k|{ 633| 4.23k| constexpr auto B = bits; 634| 4.23k| constexpr auto BL = bits_leaf; 635| 4.23k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.23k, False: 0] ------------------ 636| 4.23k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.23k, False: 0] ------------------ 637| 4.23k| auto is_leaf = p.shift() == BL; 638| 4.23k| auto child = p.node()->inner()[offset_hint]; 639| 4.23k| auto is_full = offset_hint + 1 != count_hint; 640| 4.23k| return is_full ------------------ | Branch (640:12): [True: 2.61k, False: 1.62k] ------------------ 641| 4.23k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.84k, False: 768] ------------------ 642| 2.61k| : make_full_pos(child, p.shift() - B) 643| 768| .visit(v, idx, args...)) 644| 4.23k| : (is_leaf ------------------ | Branch (644:19): [True: 1.26k, False: 362] ------------------ 645| 1.62k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.62k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 362| .visit(v, idx, args...)); 648| 4.23k|} _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| 50.7k|{ 1839| 50.7k| assert(node); ------------------ | Branch (1839:5): [True: 50.7k, False: 0] ------------------ 1840| 50.7k| auto relaxed = node->relaxed(); 1841| 50.7k| if (relaxed) { ------------------ | Branch (1841:9): [True: 44.5k, False: 6.22k] ------------------ 1842| 44.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 44.5k, False: 0] ------------------ 1843| 44.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 44.5k| .visit(v, std::forward(args)...); 1845| 44.5k| } else { 1846| 6.22k| return make_regular_sub_pos(node, shift, size) 1847| 6.22k| .visit(v, std::forward(args)...); 1848| 6.22k| } 1849| 50.7k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 44.5k| { 1814| 44.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 44.5k| } _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| 34.9k| { 1687| 34.9k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 34.9k, False: 0] ------------------ 1688| 34.9k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 34.9k] ------------------ 1689| 34.9k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 34.9k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1698| 34.9k| { 1699| 34.9k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 34.9k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1717| 34.9k| { 1718| 34.9k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 34.9k, False: 0] ------------------ 1719| 34.9k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 34.9k] | Branch (1719:9): [True: 34.9k, False: 0] ------------------ 1720| 34.9k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 34.9k| auto child = node_->inner()[offset_hint]; 1722| 34.9k| auto is_leaf = shift_ == BL; 1723| 34.9k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 34.9k| auto next_idx = idx - left_size_hint; 1725| 34.9k| return is_leaf ------------------ | Branch (1725:16): [True: 2.06k, False: 32.9k] ------------------ 1726| 34.9k| ? make_leaf_sub_pos(child, next_size) 1727| 2.06k| .visit(v, next_idx, args...) 1728| 34.9k| : visit_maybe_relaxed_sub( 1729| 32.9k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 34.9k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 144| 2.06k| { 145| 2.06k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.06k| } _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| 22.4k| { 1687| 22.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 22.4k, False: 0] ------------------ 1688| 22.4k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 14.9k, False: 7.47k] ------------------ 1689| 22.4k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 22.4k| } _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| 22.4k| { 1699| 22.4k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 22.4k| } _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| 22.4k| { 1718| 22.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 22.4k, False: 0] ------------------ 1719| 22.4k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 14.9k, False: 7.47k] | Branch (1719:9): [True: 22.4k, False: 0] ------------------ 1720| 22.4k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 22.4k| auto child = node_->inner()[offset_hint]; 1722| 22.4k| auto is_leaf = shift_ == BL; 1723| 22.4k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 22.4k| auto next_idx = idx - left_size_hint; 1725| 22.4k| return is_leaf ------------------ | Branch (1725:16): [True: 5.65k, False: 16.8k] ------------------ 1726| 22.4k| ? make_leaf_sub_pos(child, next_size) 1727| 5.65k| .visit(v, next_idx, args...) 1728| 22.4k| : visit_maybe_relaxed_sub( 1729| 16.8k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 22.4k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 144| 5.65k| { 145| 5.65k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.65k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 16.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: 12.9k, False: 3.87k] ------------------ 1842| 12.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 12.9k, False: 0] ------------------ 1843| 12.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 12.9k| .visit(v, std::forward(args)...); 1845| 12.9k| } else { 1846| 3.87k| return make_regular_sub_pos(node, shift, size) 1847| 3.87k| .visit(v, std::forward(args)...); 1848| 3.87k| } 1849| 16.8k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1813| 12.9k| { 1814| 12.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 12.9k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1036| 3.87k| { 1037| 3.87k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.87k| } _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.67k| { 928| 6.67k| return towards_oh_ch_regular( 929| 6.67k| *this, v, idx, offset_hint, count(), args...); 930| 6.67k| } _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.67k|{ 633| 6.67k| constexpr auto B = bits; 634| 6.67k| constexpr auto BL = bits_leaf; 635| 6.67k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.67k, False: 0] ------------------ 636| 6.67k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.67k, False: 0] ------------------ 637| 6.67k| auto is_leaf = p.shift() == BL; 638| 6.67k| auto child = p.node()->inner()[offset_hint]; 639| 6.67k| auto is_full = offset_hint + 1 != count_hint; 640| 6.67k| return is_full ------------------ | Branch (640:12): [True: 2.26k, False: 4.41k] ------------------ 641| 6.67k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.56k, False: 700] ------------------ 642| 2.26k| : make_full_pos(child, p.shift() - B) 643| 700| .visit(v, idx, args...)) 644| 6.67k| : (is_leaf ------------------ | Branch (644:19): [True: 971, False: 3.44k] ------------------ 645| 4.41k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 4.41k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.44k| .visit(v, idx, args...)); 648| 6.67k|} _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.57k| { 208| 5.57k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.57k| } _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.10k| { 1406| 2.10k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.10k| } _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.27k| { 1337| 3.27k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 3.27k, False: 0] ------------------ 1338| 3.27k| auto is_leaf = shift_ == BL; 1339| 3.27k| auto child = node_->inner()[offset_hint]; 1340| 3.27k| return is_leaf ------------------ | Branch (1340:16): [True: 2.26k, False: 1.01k] ------------------ 1341| 3.27k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 3.27k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 3.27k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 1161| 177k| 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| 5.25k| { 337| 5.25k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 5.25k| } _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| 5.25k| { 306| 5.25k| return towards_oh_ch_regular( 307| 5.25k| *this, v, idx, offset_hint, count(), args...); 308| 5.25k| } _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| 5.25k|{ 633| 5.25k| constexpr auto B = bits; 634| 5.25k| constexpr auto BL = bits_leaf; 635| 5.25k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.25k, False: 0] ------------------ 636| 5.25k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.25k, False: 0] ------------------ 637| 5.25k| auto is_leaf = p.shift() == BL; 638| 5.25k| auto child = p.node()->inner()[offset_hint]; 639| 5.25k| auto is_full = offset_hint + 1 != count_hint; 640| 5.25k| return is_full ------------------ | Branch (640:12): [True: 2.13k, False: 3.12k] ------------------ 641| 5.25k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.74k, False: 388] ------------------ 642| 2.13k| : make_full_pos(child, p.shift() - B) 643| 388| .visit(v, idx, args...)) 644| 5.25k| : (is_leaf ------------------ | Branch (644:19): [True: 1.30k, False: 1.81k] ------------------ 645| 3.12k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.12k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.81k| .visit(v, idx, args...)); 648| 5.25k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1036| 6.22k| { 1037| 6.22k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.22k| } _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.42k| { 928| 3.42k| return towards_oh_ch_regular( 929| 3.42k| *this, v, idx, offset_hint, count(), args...); 930| 3.42k| } _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.42k|{ 633| 3.42k| constexpr auto B = bits; 634| 3.42k| constexpr auto BL = bits_leaf; 635| 3.42k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.42k, False: 0] ------------------ 636| 3.42k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.42k, False: 0] ------------------ 637| 3.42k| auto is_leaf = p.shift() == BL; 638| 3.42k| auto child = p.node()->inner()[offset_hint]; 639| 3.42k| auto is_full = offset_hint + 1 != count_hint; 640| 3.42k| return is_full ------------------ | Branch (640:12): [True: 2.74k, False: 684] ------------------ 641| 3.42k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 807, False: 1.93k] ------------------ 642| 2.74k| : make_full_pos(child, p.shift() - B) 643| 1.93k| .visit(v, idx, args...)) 644| 3.42k| : (is_leaf ------------------ | Branch (644:19): [True: 684, False: 0] ------------------ 645| 684| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 684| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 3.42k|} _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.56k| { 208| 1.56k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.56k| } _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.51k| { 1406| 2.51k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.51k| } _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.34k| { 1337| 1.34k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.34k, False: 0] ------------------ 1338| 1.34k| auto is_leaf = shift_ == BL; 1339| 1.34k| auto child = node_->inner()[offset_hint]; 1340| 1.34k| return is_leaf ------------------ | Branch (1340:16): [True: 757, False: 584] ------------------ 1341| 1.34k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.34k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.34k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 112| 684| { 113| 684| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 684| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 22.4k|{ 1839| 22.4k| assert(node); ------------------ | Branch (1839:5): [True: 22.4k, False: 0] ------------------ 1840| 22.4k| auto relaxed = node->relaxed(); 1841| 22.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 15.7k, False: 6.70k] ------------------ 1842| 15.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 15.7k, False: 0] ------------------ 1843| 15.7k| return make_relaxed_pos(node, shift, relaxed) 1844| 15.7k| .visit(v, std::forward(args)...); 1845| 15.7k| } else { 1846| 6.70k| return make_regular_sub_pos(node, shift, size) 1847| 6.70k| .visit(v, std::forward(args)...); 1848| 6.70k| } 1849| 22.4k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 15.7k| { 1814| 15.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 15.7k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8subindexEm: 1434| 9.02M| 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: 750] ------------------ 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: 750] | 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| 65.5k| { 1706| 65.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 65.5k, False: 0] ------------------ 1707| 65.5k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 16.4k, False: 49.0k] ------------------ 1708| 65.5k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 65.5k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1717| 65.5k| { 1718| 65.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 65.5k, False: 0] ------------------ 1719| 65.5k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 16.4k, False: 49.0k] | Branch (1719:9): [True: 65.5k, False: 0] ------------------ 1720| 65.5k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 65.5k| auto child = node_->inner()[offset_hint]; 1722| 65.5k| auto is_leaf = shift_ == BL; 1723| 65.5k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 65.5k| auto next_idx = idx - left_size_hint; 1725| 65.5k| return is_leaf ------------------ | Branch (1725:16): [True: 8.93k, False: 56.6k] ------------------ 1726| 65.5k| ? make_leaf_sub_pos(child, next_size) 1727| 8.93k| .visit(v, next_idx, args...) 1728| 65.5k| : visit_maybe_relaxed_sub( 1729| 56.6k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 65.5k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 144| 8.93k| { 145| 8.93k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 8.93k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 56.6k|{ 1839| 56.6k| assert(node); ------------------ | Branch (1839:5): [True: 56.6k, False: 0] ------------------ 1840| 56.6k| auto relaxed = node->relaxed(); 1841| 56.6k| if (relaxed) { ------------------ | Branch (1841:9): [True: 54.4k, False: 2.23k] ------------------ 1842| 54.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 54.4k, False: 0] ------------------ 1843| 54.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 54.4k| .visit(v, std::forward(args)...); 1845| 54.4k| } else { 1846| 2.23k| return make_regular_sub_pos(node, shift, size) 1847| 2.23k| .visit(v, std::forward(args)...); 1848| 2.23k| } 1849| 56.6k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1813| 54.4k| { 1814| 54.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 54.4k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1036| 2.23k| { 1037| 2.23k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.23k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11size_beforeEj: 791| 196k| { 792| 196k| return size_t{offset} << shift_; 793| 196k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8size_sbhEjm: 803| 29.1k| { 804| 29.1k| assert(size_before_hint == size_before(offset)); ------------------ | Branch (804:9): [True: 29.1k, False: 0] ------------------ 805| 29.1k| return offset == subindex(size_ - 1) ? size_ - size_before_hint ------------------ | Branch (805:16): [True: 15.4k, False: 13.7k] ------------------ 806| 29.1k| : size_t{1} << shift_; 807| 29.1k| } _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.70k| { 947| 7.70k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 7.70k| } _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.70k|{ 654| 7.70k| constexpr auto B = bits; 655| 7.70k| constexpr auto BL = bits_leaf; 656| 7.70k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 7.70k, False: 0] ------------------ 657| 7.70k| auto is_leaf = p.shift() == BL; 658| 7.70k| auto child = p.node()->inner()[offset_hint]; 659| 7.70k| auto lsize = offset_hint << p.shift(); 660| 7.70k| auto size = p.this_size(); 661| 7.70k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 7.70k| return is_full ------------------ | Branch (662:12): [True: 7.70k, False: 0] ------------------ 663| 7.70k| ? (is_leaf ------------------ | Branch (663:19): [True: 4.46k, False: 3.23k] ------------------ 664| 7.70k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 7.70k| : make_full_pos(child, p.shift() - B) 666| 3.23k| .visit(v, idx - lsize, args...)) 667| 7.70k| : (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.70k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9this_sizeEv: 794| 29.1k| 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.93k| { 208| 8.93k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 8.93k| } _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.18k| { 1406| 5.18k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 5.18k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8subindexEm: 1163| 17.6k| count_t subindex(size_t idx) const { return idx >> shift_; } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11size_beforeEj: 1170| 38.3k| { 1171| 38.3k| return size_t{offset} << shift_; 1172| 38.3k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8size_sbhEjm: 1166| 17.6k| { 1167| 17.6k| return size_t{1} << shift_; 1168| 17.6k| } _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.41k| { 1349| 6.41k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 6.41k, False: 0] ------------------ 1350| 6.41k| auto is_leaf = shift_ == BL; 1351| 6.41k| auto child = node_->inner()[offset_hint]; 1352| 6.41k| auto lsize = size_t{offset_hint} << shift_; 1353| 6.41k| return is_leaf ------------------ | Branch (1353:16): [True: 4.46k, False: 1.94k] ------------------ 1354| 6.41k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 6.41k| : make_full_pos(child, shift_ - B) 1356| 1.94k| .visit(v, idx - lsize, args...); 1357| 6.41k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10copy_sizesEjjmPm: 1175| 15.3k| { 1176| 15.3k| auto e = sizes + n; 1177| 37.5k| for (; sizes != e; ++sizes) { ------------------ | Branch (1177:16): [True: 22.2k, False: 15.3k] ------------------ 1178| 22.2k| init = *sizes = init + (size_t{1} << shift_); 1179| | assert(init); ------------------ | Branch (1179:13): [True: 22.2k, False: 0] ------------------ 1180| 22.2k| } 1181| 15.3k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 1160| 775k| 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| 222k| { 811| 222k| if (n) { ------------------ | Branch (811:13): [True: 216k, False: 5.30k] ------------------ 812| 216k| auto last = offset + n - 1; 813| 216k| auto e = sizes + n - 1; 814| 434k| for (; sizes != e; ++sizes) { ------------------ | Branch (814:20): [True: 217k, False: 216k] ------------------ 815| 217k| init = *sizes = init + (size_t{1} << shift_); 816| 217k| assert(init); ------------------ | Branch (816:17): [True: 217k, False: 0] ------------------ 817| 217k| } 818| 216k| *sizes = init + size(last); 819| | assert(*sizes); ------------------ | Branch (819:13): [True: 216k, False: 0] ------------------ 820| 216k| } 821| 222k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEj: 797| 231k| { 798| 231k| return offset == subindex(size_ - 1) ? size_ - size_before(offset) ------------------ | Branch (798:16): [True: 119k, False: 112k] ------------------ 799| 231k| : size_t{1} << shift_; 800| 231k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10copy_sizesEjjmPm: 1462| 4.82M| { 1463| 4.82M| auto e = sizes + n; 1464| 4.82M| auto prev = size_before(offset); 1465| 4.82M| auto these = relaxed_->d.sizes + offset; 1466| 13.8M| for (; sizes != e; ++sizes, ++these) { ------------------ | Branch (1466:16): [True: 8.99M, False: 4.82M] ------------------ 1467| 8.99M| auto this_size = *these; 1468| 8.99M| init = *sizes = init + (this_size - prev); 1469| 8.99M| assert(init); ------------------ | Branch (1469:13): [True: 8.99M, False: 0] ------------------ 1470| 8.99M| prev = this_size; 1471| 8.99M| } 1472| 4.82M| } _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.70k| { 1037| 6.70k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.70k| } _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.92k| { 947| 3.92k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 3.92k| } _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.92k|{ 654| 3.92k| constexpr auto B = bits; 655| 3.92k| constexpr auto BL = bits_leaf; 656| 3.92k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 3.92k, False: 0] ------------------ 657| 3.92k| auto is_leaf = p.shift() == BL; 658| 3.92k| auto child = p.node()->inner()[offset_hint]; 659| 3.92k| auto lsize = offset_hint << p.shift(); 660| 3.92k| auto size = p.this_size(); 661| 3.92k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 3.92k| return is_full ------------------ | Branch (662:12): [True: 1.22k, False: 2.69k] ------------------ 663| 3.92k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 1.22k] ------------------ 664| 1.22k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 1.22k| : make_full_pos(child, p.shift() - B) 666| 1.22k| .visit(v, idx - lsize, args...)) 667| 3.92k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 2.69k] ------------------ 668| 2.69k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 2.69k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 2.69k| .visit(v, idx - lsize, args...)); 672| 3.92k|} _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.50k| { 1406| 1.50k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.50k| } _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| 272| { 1349| 272| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 272, False: 0] ------------------ 1350| 272| auto is_leaf = shift_ == BL; 1351| 272| auto child = node_->inner()[offset_hint]; 1352| 272| auto lsize = size_t{offset_hint} << shift_; 1353| 272| return is_leaf ------------------ | Branch (1353:16): [True: 0, False: 272] ------------------ 1354| 272| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 272| : make_full_pos(child, shift_ - B) 1356| 272| .visit(v, idx - lsize, args...); 1357| 272| } _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.69k| { 1037| 2.69k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.69k| } _ZN5immer6detail4rbts30make_singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaPT_j: 766| 7.63k|{ 767| 7.63k| assert(leaf); ------------------ | Branch (767:5): [True: 7.63k, False: 0] ------------------ 768| 7.63k| IMMER_ASSERT_TAGGED(leaf->kind() == NodeT::kind_t::leaf); ------------------ | | 68| 7.63k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (768:5): [True: 7.63k, False: 0] ------------------ 769| 7.63k| assert(count > 0); ------------------ | Branch (769:5): [True: 7.63k, False: 0] ------------------ 770| 7.63k| return singleton_regular_sub_pos{leaf, count}; 771| 7.63k|} _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.63k| { 760| 7.63k| return Visitor::visit_regular(*this, std::forward(args)...); 761| 7.63k| } _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.63k|{ 1839| 7.63k| assert(node); ------------------ | Branch (1839:5): [True: 7.63k, False: 0] ------------------ 1840| 7.63k| auto relaxed = node->relaxed(); 1841| 7.63k| if (relaxed) { ------------------ | Branch (1841:9): [True: 5.34k, False: 2.28k] ------------------ 1842| 5.34k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 5.34k, False: 0] ------------------ 1843| 5.34k| return make_relaxed_pos(node, shift, relaxed) 1844| 5.34k| .visit(v, std::forward(args)...); 1845| 5.34k| } else { 1846| 2.28k| return make_regular_sub_pos(node, shift, size) 1847| 2.28k| .visit(v, std::forward(args)...); 1848| 2.28k| } 1849| 7.63k|} _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.34k| { 1814| 5.34k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 5.34k| } _ZNK5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 735| 26.9k| shift_t shift() const { return BL; } _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_: 744| 7.63k| { 745| 7.63k| } _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.34M| { 145| 2.34M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.34M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEDcT_DpOT0_: 1813| 20.0M| { 1814| 20.0M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 20.0M| } _ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_: 707| 2.21M| { 708| 2.21M| } _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.63k| { 745| 7.63k| } _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.34M| { 145| 2.34M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.34M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 137| 2.34M| size_t size() const { return count_; } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_: 1813| 20.0M| { 1814| 20.0M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 20.0M| } _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.21M| { 708| 2.21M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1762| 18.1k| { 1763| 18.1k| auto child = node_->inner()[0]; 1764| 18.1k| auto child_size = relaxed_->d.sizes[0]; 1765| 18.1k| auto is_leaf = shift_ == BL; 1766| 18.1k| assert(child_size); ------------------ | Branch (1766:9): [True: 18.1k, False: 0] ------------------ 1767| 18.1k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 18.1k] ------------------ 1768| 18.1k| : visit_maybe_relaxed_sub( 1769| 18.1k| child, shift_ - B, child_size, v, args...); 1770| 18.1k| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 76| 7.63k| 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.88M| shift_t shift() const { return 0; } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 18.1k|{ 1839| 18.1k| assert(node); ------------------ | Branch (1839:5): [True: 18.1k, False: 0] ------------------ 1840| 18.1k| auto relaxed = node->relaxed(); 1841| 18.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 17.7k, False: 383] ------------------ 1842| 17.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 17.7k, False: 0] ------------------ 1843| 17.7k| return make_relaxed_pos(node, shift, relaxed) 1844| 17.7k| .visit(v, std::forward(args)...); 1845| 17.7k| } else { 1846| 383| return make_regular_sub_pos(node, shift, size) 1847| 383| .visit(v, std::forward(args)...); 1848| 383| } 1849| 18.1k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1813| 17.7k| { 1814| 17.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 17.7k| } _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| 383| { 1037| 383| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 383| } _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| 821| { 971| 821| auto is_leaf = shift_ == BL; 972| 821| auto child = node_->inner()[0]; 973| 821| auto is_full = size_ >= (size_t{1} << shift_); 974| 821| return is_full ------------------ | Branch (974:16): [True: 821, False: 0] ------------------ 975| 821| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 821] ------------------ 976| 821| ? make_full_leaf_pos(child).visit(v, args...) 977| 821| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 821| : (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| 821| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 201| 151k| 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.21k| { 1406| 1.21k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.21k| } _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| 128k| { 712| 128k| } _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| 137k| { 1305| 137k| each_i(v, 1, branches, args...); 1306| 137k| } _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| 137k| { 1264| 137k| auto p = node_->inner() + i; 1265| 137k| auto e = node_->inner() + n; 1266| 137k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 70.7k, False: 66.7k] ------------------ 1267| 283k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 212k, False: 70.7k] ------------------ 1268| 212k| IMMER_PREFETCH(p + 1); 1269| 212k| make_full_leaf_pos(*p).visit(v, args...); 1270| 212k| } 1271| 70.7k| } else { 1272| 66.7k| auto ss = shift_ - B; 1273| 267k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 200k, False: 66.7k] ------------------ 1274| 200k| make_full_pos(*p, ss).visit(v, args...); 1275| 66.7k| } 1276| 137k| } _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.06M| { 208| 1.06M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.06M| } _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| 769k| { 1406| 769k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 769k| } _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| 128k| { 712| 128k| } _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| 137k| { 1305| 137k| each_i(v, 1, branches, args...); 1306| 137k| } _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| 137k| { 1264| 137k| auto p = node_->inner() + i; 1265| 137k| auto e = node_->inner() + n; 1266| 137k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 70.7k, False: 66.7k] ------------------ 1267| 283k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 212k, False: 70.7k] ------------------ 1268| 212k| IMMER_PREFETCH(p + 1); 1269| 212k| make_full_leaf_pos(*p).visit(v, args...); 1270| 212k| } 1271| 70.7k| } else { 1272| 66.7k| auto ss = shift_ - B; 1273| 267k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 200k, False: 66.7k] ------------------ 1274| 200k| make_full_pos(*p, ss).visit(v, args...); 1275| 66.7k| } 1276| 137k| } _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.06M| { 208| 1.06M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.06M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 200| 1.06M| 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| 769k| { 1406| 769k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 769k| } _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| 821| { 754| 821| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 821| } _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| 821| { 145| 821| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 821| } _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| 821| { 1371| 821| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 821, False: 0] ------------------ 1372| 821| auto child = node_->inner()[0]; 1373| 821| return make_full_leaf_pos(child).visit(v, args...); 1374| 821| } _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.67k| { 208| 2.67k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 2.67k| } _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| 151k| { 907| 151k| if (count() > 1) ------------------ | Branch (907:13): [True: 132k, False: 19.4k] ------------------ 908| 132k| each_right_sub_(v, 1, args...); 909| 151k| } _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| 132k| { 880| 132k| auto last = count() - 1; 881| 132k| auto lsize = size_ - (last << shift_); 882| 132k| auto n = node()->inner() + i; 883| 132k| auto e = node()->inner() + last; 884| 132k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 61.4k, False: 70.7k] ------------------ 885| 182k| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 120k, False: 61.4k] ------------------ 886| 120k| IMMER_PREFETCH(n + 1); 887| 120k| make_full_leaf_pos(*n).visit(v, args...); 888| 120k| } 889| 61.4k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 70.7k| } else { 891| 70.7k| auto ss = shift_ - B; 892| 191k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 120k, False: 70.7k] ------------------ 893| 120k| make_full_pos(*n, ss).visit(v, args...); 894| 70.7k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 70.7k| } 896| 132k| } _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| 666k| { 1037| 666k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 666k| } _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| 151k| { 907| 151k| if (count() > 1) ------------------ | Branch (907:13): [True: 132k, False: 19.4k] ------------------ 908| 132k| each_right_sub_(v, 1, args...); 909| 151k| } _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| 132k| { 880| 132k| auto last = count() - 1; 881| 132k| auto lsize = size_ - (last << shift_); 882| 132k| auto n = node()->inner() + i; 883| 132k| auto e = node()->inner() + last; 884| 132k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 61.4k, False: 70.7k] ------------------ 885| 182k| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 120k, False: 61.4k] ------------------ 886| 120k| IMMER_PREFETCH(n + 1); 887| 120k| make_full_leaf_pos(*n).visit(v, args...); 888| 120k| } 889| 61.4k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 70.7k| } else { 891| 70.7k| auto ss = shift_ - B; 892| 191k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 120k, False: 70.7k] ------------------ 893| 120k| make_full_pos(*n, ss).visit(v, args...); 894| 70.7k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 70.7k| } 896| 132k| } _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| 666k| { 1037| 666k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 666k| } _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.85k| { 754| 1.85k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 1.85k| } _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.85k| { 145| 1.85k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.85k| } _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.85k| { 987| 1.85k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 1.85k, False: 0] ------------------ 988| 1.85k| auto child = node_->inner()[0]; 989| 1.85k| auto is_full = size_ >= branches; 990| 1.85k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 1.85k, False: 0] ------------------ 991| 1.85k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 1.85k| } _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| 4.96k| { 145| 4.96k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.96k| } _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.88M| { 1648| 2.88M| each_right(v, 1, std::forward(args)...); 1649| 2.88M| } _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.88M| { 1654| 2.88M| assert(start > 0); ------------------ | Branch (1654:9): [True: 2.88M, False: 0] ------------------ 1655| 2.88M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 2.88M, False: 0] ------------------ 1656| 2.88M| auto s = relaxed_->d.sizes[start - 1]; 1657| 2.88M| auto p = node_->inner(); 1658| 2.88M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 356k, False: 2.53M] ------------------ 1659| 948k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 591k, False: 356k] ------------------ 1660| 591k| IMMER_PREFETCH(p + i + 1); 1661| 591k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 591k| .visit(v, args...); 1663| 591k| s = relaxed_->d.sizes[i]; 1664| 591k| assert(s); ------------------ | Branch (1664:17): [True: 591k, False: 0] ------------------ 1665| 591k| } 1666| 2.53M| } else { 1667| 2.53M| auto ss = shift_ - B; 1668| 8.94M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 6.41M, False: 2.53M] ------------------ 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.53M| } 1675| 2.88M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEDcPT_jmT0_DpOT1_: 1838| 13.0M|{ 1839| 13.0M| assert(node); ------------------ | Branch (1839:5): [True: 13.0M, False: 0] ------------------ 1840| 13.0M| auto relaxed = node->relaxed(); 1841| 13.0M| if (relaxed) { ------------------ | Branch (1841:9): [True: 12.4M, False: 595k] ------------------ 1842| 12.4M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 12.4M, False: 0] ------------------ 1843| 12.4M| return make_relaxed_pos(node, shift, relaxed) 1844| 12.4M| .visit(v, std::forward(args)...); 1845| 12.4M| } else { 1846| 595k| return make_regular_sub_pos(node, shift, size) 1847| 595k| .visit(v, std::forward(args)...); 1848| 595k| } 1849| 13.0M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_: 1647| 2.88M| { 1648| 2.88M| each_right(v, 1, std::forward(args)...); 1649| 2.88M| } _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.88M| { 1654| 2.88M| assert(start > 0); ------------------ | Branch (1654:9): [True: 2.88M, False: 0] ------------------ 1655| 2.88M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 2.88M, False: 0] ------------------ 1656| 2.88M| auto s = relaxed_->d.sizes[start - 1]; 1657| 2.88M| auto p = node_->inner(); 1658| 2.88M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 356k, False: 2.53M] ------------------ 1659| 948k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 591k, False: 356k] ------------------ 1660| 591k| IMMER_PREFETCH(p + i + 1); 1661| 591k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 591k| .visit(v, args...); 1663| 591k| s = relaxed_->d.sizes[i]; 1664| 591k| assert(s); ------------------ | Branch (1664:17): [True: 591k, False: 0] ------------------ 1665| 591k| } 1666| 2.53M| } else { 1667| 2.53M| auto ss = shift_ - B; 1668| 8.94M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 6.41M, False: 2.53M] ------------------ 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.53M| } 1675| 2.88M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 13.0M|{ 1839| 13.0M| assert(node); ------------------ | Branch (1839:5): [True: 13.0M, False: 0] ------------------ 1840| 13.0M| auto relaxed = node->relaxed(); 1841| 13.0M| if (relaxed) { ------------------ | Branch (1841:9): [True: 12.4M, False: 595k] ------------------ 1842| 12.4M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 12.4M, False: 0] ------------------ 1843| 12.4M| return make_relaxed_pos(node, shift, relaxed) 1844| 12.4M| .visit(v, std::forward(args)...); 1845| 12.4M| } else { 1846| 595k| return make_regular_sub_pos(node, shift, size) 1847| 595k| .visit(v, std::forward(args)...); 1848| 595k| } 1849| 13.0M|} _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 753| 4.96k| { 754| 4.96k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 4.96k| } _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| 4.96k| { 145| 4.96k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.96k| } _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| 4.96k| { 1775| 4.96k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 4.96k, False: 0] ------------------ 1776| 4.96k| auto child = node_->inner()[0]; 1777| 4.96k| auto child_size = relaxed_->d.sizes[0]; 1778| 4.96k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 4.96k| } _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.28k| { 1037| 2.28k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.28k| } _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| 500k|{ 1839| 500k| assert(node); ------------------ | Branch (1839:5): [True: 500k, False: 0] ------------------ 1840| 500k| auto relaxed = node->relaxed(); 1841| 500k| if (relaxed) { ------------------ | Branch (1841:9): [True: 486k, False: 14.1k] ------------------ 1842| 486k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 486k, False: 0] ------------------ 1843| 486k| return make_relaxed_pos(node, shift, relaxed) 1844| 486k| .visit(v, std::forward(args)...); 1845| 486k| } else { 1846| 14.1k| return make_regular_sub_pos(node, shift, size) 1847| 14.1k| .visit(v, std::forward(args)...); 1848| 14.1k| } 1849| 500k|} _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| 486k| { 1814| 486k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 486k| } _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| 486k|{ 1839| 486k| assert(node); ------------------ | Branch (1839:5): [True: 486k, False: 0] ------------------ 1840| 486k| auto relaxed = node->relaxed(); 1841| 486k| if (relaxed) { ------------------ | Branch (1841:9): [True: 463k, False: 23.5k] ------------------ 1842| 463k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 463k, False: 0] ------------------ 1843| 463k| return make_relaxed_pos(node, shift, relaxed) 1844| 463k| .visit(v, std::forward(args)...); 1845| 463k| } else { 1846| 23.5k| return make_regular_sub_pos(node, shift, size) 1847| 23.5k| .visit(v, std::forward(args)...); 1848| 23.5k| } 1849| 486k|} _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| 463k| { 1814| 463k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 463k| } _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.09M| { 1751| 2.09M| auto offset = relaxed_->d.count - 1; 1752| 2.09M| auto child = node_->inner()[offset]; 1753| 2.09M| auto child_size = size(offset); 1754| 2.09M| auto is_leaf = shift_ == BL; 1755| 2.09M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 2.09M] ------------------ 1756| 2.09M| : visit_maybe_relaxed_sub( 1757| 2.09M| child, shift_ - B, child_size, v, args...); 1758| 2.09M| } _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.09M|{ 1839| 2.09M| assert(node); ------------------ | Branch (1839:5): [True: 2.09M, False: 0] ------------------ 1840| 2.09M| auto relaxed = node->relaxed(); 1841| 2.09M| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.08M, False: 2.38k] ------------------ 1842| 2.08M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.08M, False: 0] ------------------ 1843| 2.08M| return make_relaxed_pos(node, shift, relaxed) 1844| 2.08M| .visit(v, std::forward(args)...); 1845| 2.08M| } else { 1846| 2.38k| return make_regular_sub_pos(node, shift, size) 1847| 2.38k| .visit(v, std::forward(args)...); 1848| 2.38k| } 1849| 2.09M|} _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.08M| { 1814| 2.08M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.08M| } _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.85k| { 1037| 5.85k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 5.85k| } _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.47k| { 959| 3.47k| auto offset = count() - 1; 960| 3.47k| auto child = node_->inner()[offset]; 961| 3.47k| auto is_leaf = shift_ == BL; 962| 3.47k| auto lsize = size_ - (size_t{offset} << shift_); 963| 3.47k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 3.47k] ------------------ 964| 3.47k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 3.47k| .visit(v, args...); 966| 3.47k| } _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| 900k| { 914| 900k| each_left(v, count() - 1, args...); 915| 900k| } _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| 900k| { 874| 900k| return each_left_regular(*this, v, last, args...); 875| 900k| } _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| 900k|{ 576| 900k| constexpr auto B = bits; 577| 900k| constexpr auto BL = bits_leaf; 578| 900k| assert(last < p.count()); ------------------ | Branch (578:5): [True: 900k, False: 0] ------------------ 579| 900k| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 407k, False: 493k] ------------------ 580| 407k| auto n = p.node()->inner(); 581| 407k| auto e = n + last; 582| 1.13M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 727k, False: 407k] ------------------ 583| 727k| IMMER_PREFETCH(n + 1); 584| 727k| make_full_leaf_pos(*n).visit(v, args...); 585| 727k| } 586| 493k| } else { 587| 493k| auto n = p.node()->inner(); 588| 493k| auto e = n + last; 589| 493k| auto ss = p.shift() - B; 590| 941k| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 448k, False: 493k] ------------------ 591| 448k| make_full_pos(*n, ss).visit(v, args...); 592| 493k| } 593| 900k|} _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| 900k| { 914| 900k| each_left(v, count() - 1, args...); 915| 900k| } _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| 900k| { 874| 900k| return each_left_regular(*this, v, last, args...); 875| 900k| } _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| 900k|{ 576| 900k| constexpr auto B = bits; 577| 900k| constexpr auto BL = bits_leaf; 578| 900k| assert(last < p.count()); ------------------ | Branch (578:5): [True: 900k, False: 0] ------------------ 579| 900k| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 407k, False: 493k] ------------------ 580| 407k| auto n = p.node()->inner(); 581| 407k| auto e = n + last; 582| 1.13M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 727k, False: 407k] ------------------ 583| 727k| IMMER_PREFETCH(n + 1); 584| 727k| make_full_leaf_pos(*n).visit(v, args...); 585| 727k| } 586| 493k| } else { 587| 493k| auto n = p.node()->inner(); 588| 493k| auto e = n + last; 589| 493k| auto ss = p.shift() - B; 590| 941k| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 448k, False: 493k] ------------------ 591| 448k| make_full_pos(*n, ss).visit(v, args...); 592| 493k| } 593| 900k|} _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| 761k| { 1763| 761k| auto child = node_->inner()[0]; 1764| 761k| auto child_size = relaxed_->d.sizes[0]; 1765| 761k| auto is_leaf = shift_ == BL; 1766| 761k| assert(child_size); ------------------ | Branch (1766:9): [True: 761k, False: 0] ------------------ 1767| 761k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 761k] ------------------ 1768| 761k| : visit_maybe_relaxed_sub( 1769| 761k| child, shift_ - B, child_size, v, args...); 1770| 761k| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 106| 500k| 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| 761k|{ 1839| 761k| assert(node); ------------------ | Branch (1839:5): [True: 761k, False: 0] ------------------ 1840| 761k| auto relaxed = node->relaxed(); 1841| 761k| if (relaxed) { ------------------ | Branch (1841:9): [True: 647k, False: 113k] ------------------ 1842| 647k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 647k, False: 0] ------------------ 1843| 647k| return make_relaxed_pos(node, shift, relaxed) 1844| 647k| .visit(v, std::forward(args)...); 1845| 647k| } else { 1846| 113k| return make_regular_sub_pos(node, shift, size) 1847| 113k| .visit(v, std::forward(args)...); 1848| 113k| } 1849| 761k|} _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| 647k| { 1814| 647k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 647k| } _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| 113k| { 1037| 113k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 113k| } _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| 768| { 959| 768| auto offset = count() - 1; 960| 768| auto child = node_->inner()[offset]; 961| 768| auto is_leaf = shift_ == BL; 962| 768| auto lsize = size_ - (size_t{offset} << shift_); 963| 768| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 768] ------------------ 964| 768| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 768| .visit(v, args...); 966| 768| } _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.16k| { 1037| 1.16k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.16k| } _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| 66.1k| { 971| 66.1k| auto is_leaf = shift_ == BL; 972| 66.1k| auto child = node_->inner()[0]; 973| 66.1k| auto is_full = size_ >= (size_t{1} << shift_); 974| 66.1k| return is_full ------------------ | Branch (974:16): [True: 66.1k, False: 0] ------------------ 975| 66.1k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 66.1k] ------------------ 976| 66.1k| ? make_full_leaf_pos(child).visit(v, args...) 977| 66.1k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 66.1k| : (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| 66.1k| } _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| 130k| { 1406| 130k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 130k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1361| 64.0k| { 1362| 64.0k| auto is_leaf = shift_ == BL; 1363| 64.0k| auto child = node_->inner()[0]; 1364| 64.0k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 64.0k] ------------------ 1365| 64.0k| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 64.0k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 958| 130k| { 959| 130k| auto offset = count() - 1; 960| 130k| auto child = node_->inner()[offset]; 961| 130k| auto is_leaf = shift_ == BL; 962| 130k| auto lsize = size_ - (size_t{offset} << shift_); 963| 130k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 67.3k, False: 62.6k] ------------------ 964| 130k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 62.6k| .visit(v, args...); 966| 130k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 144| 69.9k| { 145| 69.9k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 69.9k| } _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| 69.9k| { 1371| 69.9k| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 69.9k, False: 0] ------------------ 1372| 69.9k| auto child = node_->inner()[0]; 1373| 69.9k| return make_full_leaf_pos(child).visit(v, args...); 1374| 69.9k| } _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| 149k| { 208| 149k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 149k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 1036| 63.8k| { 1037| 63.8k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 63.8k| } _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| 120k| { 959| 120k| auto offset = count() - 1; 960| 120k| auto child = node_->inner()[offset]; 961| 120k| auto is_leaf = shift_ == BL; 962| 120k| auto lsize = size_ - (size_t{offset} << shift_); 963| 120k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 64.9k, False: 55.9k] ------------------ 964| 120k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 55.9k| .visit(v, args...); 966| 120k| } _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| 79.1k| { 145| 79.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 79.1k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 986| 79.1k| { 987| 79.1k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 79.1k, False: 0] ------------------ 988| 79.1k| auto child = node_->inner()[0]; 989| 79.1k| auto is_full = size_ >= branches; 990| 79.1k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 79.1k, False: 0] ------------------ 991| 79.1k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 79.1k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 144| 351k| { 145| 351k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 351k| } _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| 65.7k| { 1037| 65.7k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 65.7k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 958| 645k| { 959| 645k| auto offset = count() - 1; 960| 645k| auto child = node_->inner()[offset]; 961| 645k| auto is_leaf = shift_ == BL; 962| 645k| auto lsize = size_ - (size_t{offset} << shift_); 963| 645k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 274k, False: 370k] ------------------ 964| 645k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 370k| .visit(v, args...); 966| 645k| } _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| 351k| { 145| 351k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 351k| } _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| 351k| { 1775| 351k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 351k, False: 0] ------------------ 1776| 351k| auto child = node_->inner()[0]; 1777| 351k| auto child_size = relaxed_->d.sizes[0]; 1778| 351k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 351k| } _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| 749k| { 1037| 749k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 749k| } _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.36M| { 1618| 4.36M| each_left(v, relaxed_->d.count - 1, args...); 1619| 4.36M| } _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.36M| { 1624| 4.36M| auto p = node_->inner(); 1625| 4.36M| auto s = size_t{}; 1626| 4.36M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 93.7k, False: 4.26M] ------------------ 1627| 267k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 173k, False: 93.7k] ------------------ 1628| 173k| IMMER_PREFETCH(p + i + 1); 1629| 173k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 173k| .visit(v, args...); 1631| 173k| s = relaxed_->d.sizes[i]; 1632| 173k| assert(s); ------------------ | Branch (1632:17): [True: 173k, False: 0] ------------------ 1633| 173k| } 1634| 4.26M| } else { 1635| 4.26M| auto ss = shift_ - B; 1636| 10.9M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 6.66M, False: 4.26M] ------------------ 1637| 6.66M| visit_maybe_relaxed_sub( 1638| 6.66M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 6.66M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 6.66M, False: 0] ------------------ 1641| 6.66M| } 1642| 4.26M| } 1643| 4.36M| } _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.36M| { 1618| 4.36M| each_left(v, relaxed_->d.count - 1, args...); 1619| 4.36M| } _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.36M| { 1624| 4.36M| auto p = node_->inner(); 1625| 4.36M| auto s = size_t{}; 1626| 4.36M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 93.7k, False: 4.26M] ------------------ 1627| 267k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 173k, False: 93.7k] ------------------ 1628| 173k| IMMER_PREFETCH(p + i + 1); 1629| 173k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 173k| .visit(v, args...); 1631| 173k| s = relaxed_->d.sizes[i]; 1632| 173k| assert(s); ------------------ | Branch (1632:17): [True: 173k, False: 0] ------------------ 1633| 173k| } 1634| 4.26M| } else { 1635| 4.26M| auto ss = shift_ - B; 1636| 10.9M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 6.66M, False: 4.26M] ------------------ 1637| 6.66M| visit_maybe_relaxed_sub( 1638| 6.66M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 6.66M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 6.66M, False: 0] ------------------ 1641| 6.66M| } 1642| 4.26M| } 1643| 4.36M| } _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.75M| { 1763| 1.75M| auto child = node_->inner()[0]; 1764| 1.75M| auto child_size = relaxed_->d.sizes[0]; 1765| 1.75M| auto is_leaf = shift_ == BL; 1766| 1.75M| assert(child_size); ------------------ | Branch (1766:9): [True: 1.75M, False: 0] ------------------ 1767| 1.75M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 1.75M] ------------------ 1768| 1.75M| : visit_maybe_relaxed_sub( 1769| 1.75M| child, shift_ - B, child_size, v, args...); 1770| 1.75M| } _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.75M|{ 1839| 1.75M| assert(node); ------------------ | Branch (1839:5): [True: 1.75M, False: 0] ------------------ 1840| 1.75M| auto relaxed = node->relaxed(); 1841| 1.75M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.74M, False: 4.59k] ------------------ 1842| 1.74M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.74M, False: 0] ------------------ 1843| 1.74M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.74M| .visit(v, std::forward(args)...); 1845| 1.74M| } else { 1846| 4.59k| return make_regular_sub_pos(node, shift, size) 1847| 4.59k| .visit(v, std::forward(args)...); 1848| 4.59k| } 1849| 1.75M|} _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.74M| { 1814| 1.74M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.74M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 4.59k| { 1037| 4.59k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.59k| } _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| 124k| { 1751| 124k| auto offset = relaxed_->d.count - 1; 1752| 124k| auto child = node_->inner()[offset]; 1753| 124k| auto child_size = size(offset); 1754| 124k| auto is_leaf = shift_ == BL; 1755| 124k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 124k] ------------------ 1756| 124k| : visit_maybe_relaxed_sub( 1757| 124k| child, shift_ - B, child_size, v, args...); 1758| 124k| } _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| 124k|{ 1839| 124k| assert(node); ------------------ | Branch (1839:5): [True: 124k, False: 0] ------------------ 1840| 124k| auto relaxed = node->relaxed(); 1841| 124k| if (relaxed) { ------------------ | Branch (1841:9): [True: 124k, False: 399] ------------------ 1842| 124k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 124k, False: 0] ------------------ 1843| 124k| return make_relaxed_pos(node, shift, relaxed) 1844| 124k| .visit(v, std::forward(args)...); 1845| 124k| } else { 1846| 399| return make_regular_sub_pos(node, shift, size) 1847| 399| .visit(v, std::forward(args)...); 1848| 399| } 1849| 124k|} _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| 124k| { 1814| 124k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 124k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 970| 3.80k| { 971| 3.80k| auto is_leaf = shift_ == BL; 972| 3.80k| auto child = node_->inner()[0]; 973| 3.80k| auto is_full = size_ >= (size_t{1} << shift_); 974| 3.80k| return is_full ------------------ | Branch (974:16): [True: 3.80k, False: 0] ------------------ 975| 3.80k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 3.80k] ------------------ 976| 3.80k| ? make_full_leaf_pos(child).visit(v, args...) 977| 3.80k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 3.80k| : (is_leaf ------------------ | Branch (978:23): [True: 0, False: 0] ------------------ 979| 0| ? make_leaf_sub_pos(child, size_).visit(v, args...) 980| 0| : make_regular_sub_pos(child, shift_ - B, size_) 981| 0| .visit(v, args...)); 982| 3.80k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1405| 6.09k| { 1406| 6.09k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 6.09k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1361| 2.28k| { 1362| 2.28k| auto is_leaf = shift_ == BL; 1363| 2.28k| auto child = node_->inner()[0]; 1364| 2.28k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 2.28k] ------------------ 1365| 2.28k| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 2.28k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 1750| 5.83k| { 1751| 5.83k| auto offset = relaxed_->d.count - 1; 1752| 5.83k| auto child = node_->inner()[offset]; 1753| 5.83k| auto child_size = size(offset); 1754| 5.83k| auto is_leaf = shift_ == BL; 1755| 5.83k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 2.60k, False: 3.22k] ------------------ 1756| 5.83k| : visit_maybe_relaxed_sub( 1757| 3.22k| child, shift_ - B, child_size, v, args...); 1758| 5.83k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 3.22k|{ 1839| 3.22k| assert(node); ------------------ | Branch (1839:5): [True: 3.22k, False: 0] ------------------ 1840| 3.22k| auto relaxed = node->relaxed(); 1841| 3.22k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.02k, False: 1.20k] ------------------ 1842| 2.02k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.02k, False: 0] ------------------ 1843| 2.02k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.02k| .visit(v, std::forward(args)...); 1845| 2.02k| } else { 1846| 1.20k| return make_regular_sub_pos(node, shift, size) 1847| 1.20k| .visit(v, std::forward(args)...); 1848| 1.20k| } 1849| 3.22k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 1813| 2.02k| { 1814| 2.02k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.02k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1750| 26.9k| { 1751| 26.9k| auto offset = relaxed_->d.count - 1; 1752| 26.9k| auto child = node_->inner()[offset]; 1753| 26.9k| auto child_size = size(offset); 1754| 26.9k| auto is_leaf = shift_ == BL; 1755| 26.9k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 14.2k, False: 12.7k] ------------------ 1756| 26.9k| : visit_maybe_relaxed_sub( 1757| 12.7k| child, shift_ - B, child_size, v, args...); 1758| 26.9k| } _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| 12.7k|{ 1839| 12.7k| assert(node); ------------------ | Branch (1839:5): [True: 12.7k, False: 0] ------------------ 1840| 12.7k| auto relaxed = node->relaxed(); 1841| 12.7k| if (relaxed) { ------------------ | Branch (1841:9): [True: 3.09k, False: 9.70k] ------------------ 1842| 3.09k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 3.09k, False: 0] ------------------ 1843| 3.09k| return make_relaxed_pos(node, shift, relaxed) 1844| 3.09k| .visit(v, std::forward(args)...); 1845| 9.70k| } else { 1846| 9.70k| return make_regular_sub_pos(node, shift, size) 1847| 9.70k| .visit(v, std::forward(args)...); 1848| 9.70k| } 1849| 12.7k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1813| 3.09k| { 1814| 3.09k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 3.09k| } _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.11M| { 1751| 2.11M| auto offset = relaxed_->d.count - 1; 1752| 2.11M| auto child = node_->inner()[offset]; 1753| 2.11M| auto child_size = size(offset); 1754| 2.11M| auto is_leaf = shift_ == BL; 1755| 2.11M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 76.8k, False: 2.03M] ------------------ 1756| 2.11M| : visit_maybe_relaxed_sub( 1757| 2.03M| child, shift_ - B, child_size, v, args...); 1758| 2.11M| } _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.03M|{ 1839| 2.03M| assert(node); ------------------ | Branch (1839:5): [True: 2.03M, False: 0] ------------------ 1840| 2.03M| auto relaxed = node->relaxed(); 1841| 2.03M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.65M, False: 379k] ------------------ 1842| 1.65M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.65M, False: 0] ------------------ 1843| 1.65M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.65M| .visit(v, std::forward(args)...); 1845| 1.65M| } else { 1846| 379k| return make_regular_sub_pos(node, shift, size) 1847| 379k| .visit(v, std::forward(args)...); 1848| 379k| } 1849| 2.03M|} _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.65M| { 1814| 1.65M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.65M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 23.5k| { 1037| 23.5k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 23.5k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_25concat_trees_left_visitorISC_EEJNS1_8leaf_posISC_EERPSC_RjRmEEEDcT_DpOT0_: 1036| 14.1k| { 1037| 14.1k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 14.1k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_26concat_trees_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 14.1k|{ 1839| 14.1k| assert(node); ------------------ | Branch (1839:5): [True: 14.1k, False: 0] ------------------ 1840| 14.1k| auto relaxed = node->relaxed(); 1841| 14.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 6.38k, False: 7.80k] ------------------ 1842| 6.38k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 6.38k, False: 0] ------------------ 1843| 6.38k| return make_relaxed_pos(node, shift, relaxed) 1844| 6.38k| .visit(v, std::forward(args)...); 1845| 7.80k| } else { 1846| 7.80k| return make_regular_sub_pos(node, shift, size) 1847| 7.80k| .visit(v, std::forward(args)...); 1848| 7.80k| } 1849| 14.1k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1813| 6.38k| { 1814| 6.38k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 6.38k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 7.80k| { 1037| 7.80k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 7.80k| } _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| 50.7k| { 1814| 50.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 50.7k| } _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| 45.6k| { 1738| 45.6k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 45.6k, False: 0] ------------------ 1739| 45.6k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 45.6k, False: 0] ------------------ 1740| 45.6k| auto child = node_->inner()[offset_hint]; 1741| 45.6k| auto is_leaf = shift_ == BL; 1742| 45.6k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 45.6k] ------------------ 1743| 45.6k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 45.6k| : visit_maybe_relaxed_sub( 1745| 45.6k| child, shift_ - B, child_size_hint, v, args...); 1746| 45.6k| } _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| 45.6k|{ 1839| 45.6k| assert(node); ------------------ | Branch (1839:5): [True: 45.6k, False: 0] ------------------ 1840| 45.6k| auto relaxed = node->relaxed(); 1841| 45.6k| if (relaxed) { ------------------ | Branch (1841:9): [True: 9.31k, False: 36.3k] ------------------ 1842| 9.31k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 9.31k, False: 0] ------------------ 1843| 9.31k| return make_relaxed_pos(node, shift, relaxed) 1844| 9.31k| .visit(v, std::forward(args)...); 1845| 36.3k| } else { 1846| 36.3k| return make_regular_sub_pos(node, shift, size) 1847| 36.3k| .visit(v, std::forward(args)...); 1848| 36.3k| } 1849| 45.6k|} _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| 36.3k| { 1037| 36.3k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 36.3k| } _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| 169k| { 953| 169k| return last_oh_regular(*this, v, offset_hint, args...); 954| 169k| } _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| 169k|{ 678| 169k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 169k, False: 0] ------------------ 679| 169k| constexpr auto B = bits; 680| 169k| constexpr auto BL = bits_leaf; 681| 169k| auto child = p.node()->inner()[offset_hint]; 682| 169k| auto is_leaf = p.shift() == BL; 683| 169k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 169k] ------------------ 684| 169k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 169k| .visit(v, args...); 686| 169k|} _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| 780k| { 337| 780k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 780k| } _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| 610k| { 331| 610k| return last_oh_regular(*this, v, offset_hint, args...); 332| 610k| } _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| 610k|{ 678| 610k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 610k, False: 0] ------------------ 679| 610k| constexpr auto B = bits; 680| 610k| constexpr auto BL = bits_leaf; 681| 610k| auto child = p.node()->inner()[offset_hint]; 682| 610k| auto is_leaf = p.shift() == BL; 683| 610k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 610k] ------------------ 684| 610k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 610k| .visit(v, args...); 686| 610k|} _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.75k| { 331| 1.75k| return last_oh_regular(*this, v, offset_hint, args...); 332| 1.75k| } _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.75k|{ 678| 1.75k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.75k, False: 0] ------------------ 679| 1.75k| constexpr auto B = bits; 680| 1.75k| constexpr auto BL = bits_leaf; 681| 1.75k| auto child = p.node()->inner()[offset_hint]; 682| 1.75k| auto is_leaf = p.shift() == BL; 683| 1.75k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.75k] ------------------ 684| 1.75k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.75k| .visit(v, args...); 686| 1.75k|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_DpOT0_: 336| 3.18k| { 337| 3.18k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.18k| } _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.42k| { 953| 1.42k| return last_oh_regular(*this, v, offset_hint, args...); 954| 1.42k| } _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.42k|{ 678| 1.42k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.42k, False: 0] ------------------ 679| 1.42k| constexpr auto B = bits; 680| 1.42k| constexpr auto BL = bits_leaf; 681| 1.42k| auto child = p.node()->inner()[offset_hint]; 682| 1.42k| auto is_leaf = p.shift() == BL; 683| 1.42k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.42k] ------------------ 684| 1.42k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.42k| .visit(v, args...); 686| 1.42k|} _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| 8.45k| { 1738| 8.45k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 8.45k, False: 0] ------------------ 1739| 8.45k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 8.45k, False: 0] ------------------ 1740| 8.45k| auto child = node_->inner()[offset_hint]; 1741| 8.45k| auto is_leaf = shift_ == BL; 1742| 8.45k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 8.45k] ------------------ 1743| 8.45k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 8.45k| : visit_maybe_relaxed_sub( 1745| 8.45k| child, shift_ - B, child_size_hint, v, args...); 1746| 8.45k| } _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| 8.45k|{ 1839| 8.45k| assert(node); ------------------ | Branch (1839:5): [True: 8.45k, False: 0] ------------------ 1840| 8.45k| auto relaxed = node->relaxed(); 1841| 8.45k| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.36k, False: 1.09k] ------------------ 1842| 7.36k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.36k, False: 0] ------------------ 1843| 7.36k| return make_relaxed_pos(node, shift, relaxed) 1844| 7.36k| .visit(v, std::forward(args)...); 1845| 7.36k| } else { 1846| 1.09k| return make_regular_sub_pos(node, shift, size) 1847| 1.09k| .visit(v, std::forward(args)...); 1848| 1.09k| } 1849| 8.45k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_: 1813| 7.36k| { 1814| 7.36k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.36k| } _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.09k| { 1037| 1.09k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.09k| } _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| 139k| { 1037| 139k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 139k| } _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| 28.2k|{ 1839| 28.2k| assert(node); ------------------ | Branch (1839:5): [True: 28.2k, False: 0] ------------------ 1840| 28.2k| auto relaxed = node->relaxed(); 1841| 28.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 24.6k, False: 3.60k] ------------------ 1842| 24.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 24.6k, False: 0] ------------------ 1843| 24.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 24.6k| .visit(v, std::forward(args)...); 1845| 24.6k| } else { 1846| 3.60k| return make_regular_sub_pos(node, shift, size) 1847| 3.60k| .visit(v, std::forward(args)...); 1848| 3.60k| } 1849| 28.2k|} _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| 24.6k| { 1814| 24.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 24.6k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjDpOT0_: 1686| 100k| { 1687| 100k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 100k, False: 0] ------------------ 1688| 100k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 22.0k, False: 77.9k] ------------------ 1689| 100k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 100k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_mjmDpOT0_: 1698| 100k| { 1699| 100k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 100k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_mjmDpOT0_: 1717| 100k| { 1718| 100k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 100k, False: 0] ------------------ 1719| 100k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 22.0k, False: 77.9k] | Branch (1719:9): [True: 100k, False: 0] ------------------ 1720| 100k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 100k| auto child = node_->inner()[offset_hint]; 1722| 100k| auto is_leaf = shift_ == BL; 1723| 100k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 100k| auto next_idx = idx - left_size_hint; 1725| 100k| return is_leaf ------------------ | Branch (1725:16): [True: 19.8k, False: 80.2k] ------------------ 1726| 100k| ? make_leaf_sub_pos(child, next_size) 1727| 19.8k| .visit(v, next_idx, args...) 1728| 100k| : visit_maybe_relaxed_sub( 1729| 80.2k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 100k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 144| 19.8k| { 145| 19.8k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 19.8k| } _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| 80.2k|{ 1839| 80.2k| assert(node); ------------------ | Branch (1839:5): [True: 80.2k, False: 0] ------------------ 1840| 80.2k| auto relaxed = node->relaxed(); 1841| 80.2k| if (relaxed) { ------------------ | Branch (1841:9): [True: 75.4k, False: 4.78k] ------------------ 1842| 75.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 75.4k, False: 0] ------------------ 1843| 75.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 75.4k| .visit(v, std::forward(args)...); 1845| 75.4k| } else { 1846| 4.78k| return make_regular_sub_pos(node, shift, size) 1847| 4.78k| .visit(v, std::forward(args)...); 1848| 4.78k| } 1849| 80.2k|} _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| 75.4k| { 1814| 75.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 75.4k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1036| 4.78k| { 1037| 4.78k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.78k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 938| 8.39k| { 939| 8.39k| return towards_oh_ch_regular( 940| 8.39k| *this, v, idx, offset_hint, count(), args...); 941| 8.39k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_15get_mut_visitorISD_EEJRNSB_5applyIS8_E4type4editERPPSD_EEEDcOT_T0_mjjDpOT1_: 632| 8.39k|{ 633| 8.39k| constexpr auto B = bits; 634| 8.39k| constexpr auto BL = bits_leaf; 635| 8.39k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 8.39k, False: 0] ------------------ 636| 8.39k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 8.39k, False: 0] ------------------ 637| 8.39k| auto is_leaf = p.shift() == BL; 638| 8.39k| auto child = p.node()->inner()[offset_hint]; 639| 8.39k| auto is_full = offset_hint + 1 != count_hint; 640| 8.39k| return is_full ------------------ | Branch (640:12): [True: 6.43k, False: 1.96k] ------------------ 641| 8.39k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 2.53k, False: 3.89k] ------------------ 642| 6.43k| : make_full_pos(child, p.shift() - B) 643| 3.89k| .visit(v, idx, args...)) 644| 8.39k| : (is_leaf ------------------ | Branch (644:19): [True: 610, False: 1.35k] ------------------ 645| 1.96k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.96k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.35k| .visit(v, idx, args...)); 648| 8.39k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 207| 7.23k| { 208| 7.23k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 7.23k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1405| 5.03k| { 1406| 5.03k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 5.03k| } _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| 5.03k| { 1330| 5.03k| return towards_oh(v, idx, offset_hint, args...); 1331| 5.03k| } _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| 5.03k| { 1337| 5.03k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 5.03k, False: 0] ------------------ 1338| 5.03k| auto is_leaf = shift_ == BL; 1339| 5.03k| auto child = node_->inner()[offset_hint]; 1340| 5.03k| return is_leaf ------------------ | Branch (1340:16): [True: 4.16k, False: 868] ------------------ 1341| 5.03k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 5.03k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 5.03k| } _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.15k| { 113| 1.15k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.15k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 336| 1.91k| { 337| 1.91k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 1.91k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 316| 1.91k| { 317| 1.91k| return towards_oh_ch_regular( 318| 1.91k| *this, v, idx, offset_hint, count(), args...); 319| 1.91k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_15get_mut_visitorISD_EEJRNSB_5applyIS8_E4type4editERPPSD_EEEDcOT_T0_mjjDpOT1_: 632| 1.91k|{ 633| 1.91k| constexpr auto B = bits; 634| 1.91k| constexpr auto BL = bits_leaf; 635| 1.91k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 1.91k, False: 0] ------------------ 636| 1.91k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 1.91k, False: 0] ------------------ 637| 1.91k| auto is_leaf = p.shift() == BL; 638| 1.91k| auto child = p.node()->inner()[offset_hint]; 639| 1.91k| auto is_full = offset_hint + 1 != count_hint; 640| 1.91k| return is_full ------------------ | Branch (640:12): [True: 802, False: 1.11k] ------------------ 641| 1.91k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 536, False: 266] ------------------ 642| 802| : make_full_pos(child, p.shift() - B) 643| 266| .visit(v, idx, args...)) 644| 1.91k| : (is_leaf ------------------ | Branch (644:19): [True: 548, False: 565] ------------------ 645| 1.11k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.11k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 565| .visit(v, idx, args...)); 648| 1.91k|} _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.60k| { 1037| 3.60k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.60k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 67.7k|{ 1839| 67.7k| assert(node); ------------------ | Branch (1839:5): [True: 67.7k, False: 0] ------------------ 1840| 67.7k| auto relaxed = node->relaxed(); 1841| 67.7k| if (relaxed) { ------------------ | Branch (1841:9): [True: 55.1k, False: 12.5k] ------------------ 1842| 55.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 55.1k, False: 0] ------------------ 1843| 55.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 55.1k| .visit(v, std::forward(args)...); 1845| 55.1k| } else { 1846| 12.5k| return make_regular_sub_pos(node, shift, size) 1847| 12.5k| .visit(v, std::forward(args)...); 1848| 12.5k| } 1849| 67.7k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 55.1k| { 1814| 55.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 55.1k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 34.3k| { 1687| 34.3k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 34.3k, False: 0] ------------------ 1688| 34.3k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 34.3k] ------------------ 1689| 34.3k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 34.3k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 34.3k| { 1699| 34.3k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 34.3k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 34.3k| { 1718| 34.3k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 34.3k, False: 0] ------------------ 1719| 34.3k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 34.3k] | Branch (1719:9): [True: 34.3k, False: 0] ------------------ 1720| 34.3k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 34.3k| auto child = node_->inner()[offset_hint]; 1722| 34.3k| auto is_leaf = shift_ == BL; 1723| 34.3k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 34.3k| auto next_idx = idx - left_size_hint; 1725| 34.3k| return is_leaf ------------------ | Branch (1725:16): [True: 1.10k, False: 33.2k] ------------------ 1726| 34.3k| ? make_leaf_sub_pos(child, next_size) 1727| 1.10k| .visit(v, next_idx, args...) 1728| 34.3k| : visit_maybe_relaxed_sub( 1729| 33.2k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 34.3k| } _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.10k| { 145| 1.10k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.10k| } _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| 23.2k| { 1687| 23.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 23.2k, False: 0] ------------------ 1688| 23.2k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 23.2k] ------------------ 1689| 23.2k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 23.2k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 23.2k| { 1699| 23.2k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 23.2k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 23.2k| { 1718| 23.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 23.2k, False: 0] ------------------ 1719| 23.2k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 23.2k] | Branch (1719:9): [True: 23.2k, False: 0] ------------------ 1720| 23.2k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 23.2k| auto child = node_->inner()[offset_hint]; 1722| 23.2k| auto is_leaf = shift_ == BL; 1723| 23.2k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 23.2k| auto next_idx = idx - left_size_hint; 1725| 23.2k| return is_leaf ------------------ | Branch (1725:16): [True: 523, False: 22.7k] ------------------ 1726| 23.2k| ? make_leaf_sub_pos(child, next_size) 1727| 523| .visit(v, next_idx, args...) 1728| 23.2k| : visit_maybe_relaxed_sub( 1729| 22.7k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 23.2k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 523| { 145| 523| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 523| } _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| 22.7k|{ 1839| 22.7k| assert(node); ------------------ | Branch (1839:5): [True: 22.7k, False: 0] ------------------ 1840| 22.7k| auto relaxed = node->relaxed(); 1841| 22.7k| if (relaxed) { ------------------ | Branch (1841:9): [True: 21.3k, False: 1.45k] ------------------ 1842| 21.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 21.3k, False: 0] ------------------ 1843| 21.3k| return make_relaxed_pos(node, shift, relaxed) 1844| 21.3k| .visit(v, std::forward(args)...); 1845| 21.3k| } else { 1846| 1.45k| return make_regular_sub_pos(node, shift, size) 1847| 1.45k| .visit(v, std::forward(args)...); 1848| 1.45k| } 1849| 22.7k|} _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| 21.3k| { 1814| 21.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 21.3k| } _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.45k| { 1037| 1.45k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.45k| } _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.37k| { 928| 2.37k| return towards_oh_ch_regular( 929| 2.37k| *this, v, idx, offset_hint, count(), args...); 930| 2.37k| } _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.37k|{ 633| 2.37k| constexpr auto B = bits; 634| 2.37k| constexpr auto BL = bits_leaf; 635| 2.37k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.37k, False: 0] ------------------ 636| 2.37k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.37k, False: 0] ------------------ 637| 2.37k| auto is_leaf = p.shift() == BL; 638| 2.37k| auto child = p.node()->inner()[offset_hint]; 639| 2.37k| auto is_full = offset_hint + 1 != count_hint; 640| 2.37k| return is_full ------------------ | Branch (640:12): [True: 1.96k, False: 409] ------------------ 641| 2.37k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 707, False: 1.26k] ------------------ 642| 1.96k| : make_full_pos(child, p.shift() - B) 643| 1.26k| .visit(v, idx, args...)) 644| 2.37k| : (is_leaf ------------------ | Branch (644:19): [True: 409, False: 0] ------------------ 645| 409| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 409| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 2.37k|} _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.49k| { 208| 1.49k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.49k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 1.83k| { 1406| 1.83k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.83k| } _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.36k| { 1337| 1.36k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.36k, False: 0] ------------------ 1338| 1.36k| auto is_leaf = shift_ == BL; 1339| 1.36k| auto child = node_->inner()[offset_hint]; 1340| 1.36k| return is_leaf ------------------ | Branch (1340:16): [True: 790, False: 573] ------------------ 1341| 1.36k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.36k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.36k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 2.97k| { 1337| 2.97k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 2.97k, False: 0] ------------------ 1338| 2.97k| auto is_leaf = shift_ == BL; 1339| 2.97k| auto child = node_->inner()[offset_hint]; 1340| 2.97k| return is_leaf ------------------ | Branch (1340:16): [True: 1.89k, False: 1.07k] ------------------ 1341| 2.97k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 2.97k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 2.97k| } _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.27k| { 208| 5.27k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.27k| } _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.18k| { 1406| 4.18k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 4.18k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1405| 3.73k| { 1406| 3.73k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.73k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 7.94k| { 1337| 7.94k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 7.94k, False: 0] ------------------ 1338| 7.94k| auto is_leaf = shift_ == BL; 1339| 7.94k| auto child = node_->inner()[offset_hint]; 1340| 7.94k| return is_leaf ------------------ | Branch (1340:16): [True: 6.45k, False: 1.49k] ------------------ 1341| 7.94k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 7.94k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 7.94k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 9.26k| { 208| 9.26k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 9.26k| } _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.20k| { 1406| 3.20k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.20k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1310| 4.20k| { 1311| 4.20k| each_i(v, start, branches, args...); 1312| 4.20k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE6each_iINS1_11dec_visitorEJEEEvT_jjDpOT0_: 1263| 6.27k| { 1264| 6.27k| auto p = node_->inner() + i; 1265| 6.27k| auto e = node_->inner() + n; 1266| 6.27k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 3.61k, False: 2.65k] ------------------ 1267| 11.2k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 7.59k, False: 3.61k] ------------------ 1268| 7.59k| IMMER_PREFETCH(p + 1); 1269| 7.59k| make_full_leaf_pos(*p).visit(v, args...); 1270| 7.59k| } 1271| 3.61k| } else { 1272| 2.65k| auto ss = shift_ - B; 1273| 8.27k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 5.61k, False: 2.65k] ------------------ 1274| 5.61k| make_full_pos(*p, ss).visit(v, args...); 1275| 2.65k| } 1276| 6.27k| } _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| 409| { 113| 409| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 409| } _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.52k| { 306| 5.52k| return towards_oh_ch_regular( 307| 5.52k| *this, v, idx, offset_hint, count(), args...); 308| 5.52k| } _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.52k|{ 633| 5.52k| constexpr auto B = bits; 634| 5.52k| constexpr auto BL = bits_leaf; 635| 5.52k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.52k, False: 0] ------------------ 636| 5.52k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.52k, False: 0] ------------------ 637| 5.52k| auto is_leaf = p.shift() == BL; 638| 5.52k| auto child = p.node()->inner()[offset_hint]; 639| 5.52k| auto is_full = offset_hint + 1 != count_hint; 640| 5.52k| return is_full ------------------ | Branch (640:12): [True: 2.80k, False: 2.72k] ------------------ 641| 5.52k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.73k, False: 1.06k] ------------------ 642| 2.80k| : make_full_pos(child, p.shift() - B) 643| 1.06k| .visit(v, idx, args...)) 644| 5.52k| : (is_leaf ------------------ | Branch (644:19): [True: 1.19k, False: 1.53k] ------------------ 645| 2.72k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.72k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.53k| .visit(v, idx, args...)); 648| 5.52k|} _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.30k| { 113| 2.30k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.30k| } _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.15k| { 337| 6.15k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 6.15k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 336| 3.92k| { 337| 3.92k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.92k| } _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.82k| { 306| 3.82k| return towards_oh_ch_regular( 307| 3.82k| *this, v, idx, offset_hint, count(), args...); 308| 3.82k| } _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.82k|{ 633| 3.82k| constexpr auto B = bits; 634| 3.82k| constexpr auto BL = bits_leaf; 635| 3.82k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.82k, False: 0] ------------------ 636| 3.82k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.82k, False: 0] ------------------ 637| 3.82k| auto is_leaf = p.shift() == BL; 638| 3.82k| auto child = p.node()->inner()[offset_hint]; 639| 3.82k| auto is_full = offset_hint + 1 != count_hint; 640| 3.82k| return is_full ------------------ | Branch (640:12): [True: 996, False: 2.82k] ------------------ 641| 3.82k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 702, False: 294] ------------------ 642| 996| : make_full_pos(child, p.shift() - B) 643| 294| .visit(v, idx, args...)) 644| 3.82k| : (is_leaf ------------------ | Branch (644:19): [True: 1.73k, False: 1.08k] ------------------ 645| 2.82k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.82k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.08k| .visit(v, idx, args...)); 648| 3.82k|} _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.64k| { 113| 2.64k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.64k| } _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.19k| { 337| 3.19k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.19k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 285| 5.52k| { 286| 5.52k| return each_right_regular(*this, v, start, args...); 287| 5.52k| } _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.52k|{ 598| 5.52k| constexpr auto B = bits; 599| 5.52k| constexpr auto BL = bits_leaf; 600| | 601| 5.52k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 2.92k, False: 2.60k] ------------------ 602| 2.92k| auto n = p.node()->inner() + start; 603| 2.92k| auto last = p.count() - 1; 604| 2.92k| auto e = p.node()->inner() + last; 605| 2.92k| if (n <= e) { ------------------ | Branch (605:13): [True: 1.73k, False: 1.19k] ------------------ 606| 3.00k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 1.27k, False: 1.73k] ------------------ 607| 1.27k| IMMER_PREFETCH(n + 1); 608| 1.27k| make_full_leaf_pos(*n).visit(v, args...); 609| 1.27k| } 610| 1.73k| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 1.73k| } 612| 2.92k| } else { 613| 2.60k| auto n = p.node()->inner() + start; 614| 2.60k| auto last = p.count() - 1; 615| 2.60k| auto e = p.node()->inner() + last; 616| 2.60k| auto ss = p.shift() - B; 617| 2.60k| if (n <= e) { ------------------ | Branch (617:13): [True: 1.06k, False: 1.53k] ------------------ 618| 2.13k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 1.06k, False: 1.06k] ------------------ 619| 1.06k| make_full_pos(*n, ss).visit(v, args...); 620| 1.06k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 1.06k| } 622| 2.60k| } 623| 5.52k|} _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.41k| { 928| 9.41k| return towards_oh_ch_regular( 929| 9.41k| *this, v, idx, offset_hint, count(), args...); 930| 9.41k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 9.41k|{ 633| 9.41k| constexpr auto B = bits; 634| 9.41k| constexpr auto BL = bits_leaf; 635| 9.41k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 9.41k, False: 0] ------------------ 636| 9.41k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 9.41k, False: 0] ------------------ 637| 9.41k| auto is_leaf = p.shift() == BL; 638| 9.41k| auto child = p.node()->inner()[offset_hint]; 639| 9.41k| auto is_full = offset_hint + 1 != count_hint; 640| 9.41k| return is_full ------------------ | Branch (640:12): [True: 3.68k, False: 5.72k] ------------------ 641| 9.41k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.64k, False: 2.03k] ------------------ 642| 3.68k| : make_full_pos(child, p.shift() - B) 643| 2.03k| .visit(v, idx, args...)) 644| 9.41k| : (is_leaf ------------------ | Branch (644:19): [True: 1.10k, False: 4.62k] ------------------ 645| 5.72k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 5.72k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 4.62k| .visit(v, idx, args...)); 648| 9.41k|} _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.54k| { 928| 6.54k| return towards_oh_ch_regular( 929| 6.54k| *this, v, idx, offset_hint, count(), args...); 930| 6.54k| } _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.54k|{ 633| 6.54k| constexpr auto B = bits; 634| 6.54k| constexpr auto BL = bits_leaf; 635| 6.54k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.54k, False: 0] ------------------ 636| 6.54k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.54k, False: 0] ------------------ 637| 6.54k| auto is_leaf = p.shift() == BL; 638| 6.54k| auto child = p.node()->inner()[offset_hint]; 639| 6.54k| auto is_full = offset_hint + 1 != count_hint; 640| 6.54k| return is_full ------------------ | Branch (640:12): [True: 3.52k, False: 3.01k] ------------------ 641| 6.54k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 2.10k, False: 1.42k] ------------------ 642| 3.52k| : make_full_pos(child, p.shift() - B) 643| 1.42k| .visit(v, idx, args...)) 644| 6.54k| : (is_leaf ------------------ | Branch (644:19): [True: 909, False: 2.10k] ------------------ 645| 3.01k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.01k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.10k| .visit(v, idx, args...)); 648| 6.54k|} _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.9k| { 868| 14.9k| return each_right_regular(*this, v, start, args...); 869| 14.9k| } _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.9k|{ 598| 14.9k| constexpr auto B = bits; 599| 14.9k| constexpr auto BL = bits_leaf; 600| | 601| 14.9k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 4.65k, False: 10.3k] ------------------ 602| 4.65k| auto n = p.node()->inner() + start; 603| 4.65k| auto last = p.count() - 1; 604| 4.65k| auto e = p.node()->inner() + last; 605| 4.65k| if (n <= e) { ------------------ | Branch (605:13): [True: 2.86k, False: 1.79k] ------------------ 606| 4.85k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 1.99k, False: 2.86k] ------------------ 607| 1.99k| IMMER_PREFETCH(n + 1); 608| 1.99k| make_full_leaf_pos(*n).visit(v, args...); 609| 1.99k| } 610| 2.86k| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 2.86k| } 612| 10.3k| } else { 613| 10.3k| auto n = p.node()->inner() + start; 614| 10.3k| auto last = p.count() - 1; 615| 10.3k| auto e = p.node()->inner() + last; 616| 10.3k| auto ss = p.shift() - B; 617| 10.3k| if (n <= e) { ------------------ | Branch (617:13): [True: 5.69k, False: 4.62k] ------------------ 618| 9.11k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 3.41k, False: 5.69k] ------------------ 619| 3.41k| make_full_pos(*n, ss).visit(v, args...); 620| 5.69k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 5.69k| } 622| 10.3k| } 623| 14.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1813| 44.2k| { 1814| 44.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 44.2k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 20.6k| { 1687| 20.6k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 20.6k, False: 0] ------------------ 1688| 20.6k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 16.4k, False: 4.22k] ------------------ 1689| 20.6k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 20.6k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 20.6k| { 1699| 20.6k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 20.6k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 20.6k| { 1718| 20.6k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 20.6k, False: 0] ------------------ 1719| 20.6k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 16.4k, False: 4.22k] | Branch (1719:9): [True: 20.6k, False: 0] ------------------ 1720| 20.6k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 20.6k| auto child = node_->inner()[offset_hint]; 1722| 20.6k| auto is_leaf = shift_ == BL; 1723| 20.6k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 20.6k| auto next_idx = idx - left_size_hint; 1725| 20.6k| return is_leaf ------------------ | Branch (1725:16): [True: 3.59k, False: 17.0k] ------------------ 1726| 20.6k| ? make_leaf_sub_pos(child, next_size) 1727| 3.59k| .visit(v, next_idx, args...) 1728| 20.6k| : visit_maybe_relaxed_sub( 1729| 17.0k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 20.6k| } _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.59k| { 145| 3.59k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 3.59k| } _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| 17.0k|{ 1839| 17.0k| assert(node); ------------------ | Branch (1839:5): [True: 17.0k, False: 0] ------------------ 1840| 17.0k| auto relaxed = node->relaxed(); 1841| 17.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 10.2k, False: 6.79k] ------------------ 1842| 10.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 10.2k, False: 0] ------------------ 1843| 10.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 10.2k| .visit(v, std::forward(args)...); 1845| 10.2k| } else { 1846| 6.79k| return make_regular_sub_pos(node, shift, size) 1847| 6.79k| .visit(v, std::forward(args)...); 1848| 6.79k| } 1849| 17.0k|} _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.2k| { 1814| 10.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 10.2k| } _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.79k| { 1037| 6.79k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.79k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1036| 11.0k| { 1037| 11.0k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 11.0k| } _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| 16.8k| { 1687| 16.8k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 16.8k, False: 0] ------------------ 1688| 16.8k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 9.53k, False: 7.30k] ------------------ 1689| 16.8k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 16.8k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 16.8k| { 1699| 16.8k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 16.8k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 16.8k| { 1718| 16.8k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 16.8k, False: 0] ------------------ 1719| 16.8k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 9.53k, False: 7.30k] | Branch (1719:9): [True: 16.8k, False: 0] ------------------ 1720| 16.8k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 16.8k| auto child = node_->inner()[offset_hint]; 1722| 16.8k| auto is_leaf = shift_ == BL; 1723| 16.8k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 16.8k| auto next_idx = idx - left_size_hint; 1725| 16.8k| return is_leaf ------------------ | Branch (1725:16): [True: 5.38k, False: 11.4k] ------------------ 1726| 16.8k| ? make_leaf_sub_pos(child, next_size) 1727| 5.38k| .visit(v, next_idx, args...) 1728| 16.8k| : visit_maybe_relaxed_sub( 1729| 11.4k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 16.8k| } _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.38k| { 145| 5.38k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.38k| } _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| 11.4k|{ 1839| 11.4k| assert(node); ------------------ | Branch (1839:5): [True: 11.4k, False: 0] ------------------ 1840| 11.4k| auto relaxed = node->relaxed(); 1841| 11.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 8.40k, False: 3.04k] ------------------ 1842| 8.40k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 8.40k, False: 0] ------------------ 1843| 8.40k| return make_relaxed_pos(node, shift, relaxed) 1844| 8.40k| .visit(v, std::forward(args)...); 1845| 8.40k| } else { 1846| 3.04k| return make_regular_sub_pos(node, shift, size) 1847| 3.04k| .visit(v, std::forward(args)...); 1848| 3.04k| } 1849| 11.4k|} _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| 8.40k| { 1814| 8.40k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 8.40k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 3.04k| { 1037| 3.04k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.04k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1653| 55.0k| { 1654| 55.0k| assert(start > 0); ------------------ | Branch (1654:9): [True: 55.0k, False: 0] ------------------ 1655| 55.0k| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 55.0k, False: 0] ------------------ 1656| 55.0k| auto s = relaxed_->d.sizes[start - 1]; 1657| 55.0k| auto p = node_->inner(); 1658| 55.0k| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 4.69k, False: 50.3k] ------------------ 1659| 11.6k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 6.95k, False: 4.69k] ------------------ 1660| 6.95k| IMMER_PREFETCH(p + i + 1); 1661| 6.95k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 6.95k| .visit(v, args...); 1663| 6.95k| s = relaxed_->d.sizes[i]; 1664| 6.95k| assert(s); ------------------ | Branch (1664:17): [True: 6.95k, False: 0] ------------------ 1665| 6.95k| } 1666| 50.3k| } else { 1667| 50.3k| auto ss = shift_ - B; 1668| 158k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 107k, False: 50.3k] ------------------ 1669| 107k| visit_maybe_relaxed_sub( 1670| 107k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 107k| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 107k, False: 0] ------------------ 1673| 107k| } 1674| 50.3k| } 1675| 55.0k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 12.5k| { 1037| 12.5k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 12.5k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 927| 5.55k| { 928| 5.55k| return towards_oh_ch_regular( 929| 5.55k| *this, v, idx, offset_hint, count(), args...); 930| 5.55k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_23slice_right_mut_visitorISD_Lb1ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 5.55k|{ 633| 5.55k| constexpr auto B = bits; 634| 5.55k| constexpr auto BL = bits_leaf; 635| 5.55k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.55k, False: 0] ------------------ 636| 5.55k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.55k, False: 0] ------------------ 637| 5.55k| auto is_leaf = p.shift() == BL; 638| 5.55k| auto child = p.node()->inner()[offset_hint]; 639| 5.55k| auto is_full = offset_hint + 1 != count_hint; 640| 5.55k| return is_full ------------------ | Branch (640:12): [True: 4.87k, False: 682] ------------------ 641| 5.55k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.21k, False: 3.66k] ------------------ 642| 4.87k| : make_full_pos(child, p.shift() - B) 643| 3.66k| .visit(v, idx, args...)) 644| 5.55k| : (is_leaf ------------------ | Branch (644:19): [True: 682, False: 0] ------------------ 645| 682| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 682| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 5.55k|} _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.81k| { 208| 1.81k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.81k| } _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| 4.29k| { 1406| 4.29k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 4.29k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 1.23k| { 1337| 1.23k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.23k, False: 0] ------------------ 1338| 1.23k| auto is_leaf = shift_ == BL; 1339| 1.23k| auto child = node_->inner()[offset_hint]; 1340| 1.23k| return is_leaf ------------------ | Branch (1340:16): [True: 598, False: 632] ------------------ 1341| 1.23k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.23k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.23k| } _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| 682| { 113| 682| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 682| } _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| 707| { 145| 707| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 707| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 46.4k|{ 1839| 46.4k| assert(node); ------------------ | Branch (1839:5): [True: 46.4k, False: 0] ------------------ 1840| 46.4k| auto relaxed = node->relaxed(); 1841| 46.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 38.5k, False: 7.93k] ------------------ 1842| 38.5k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 38.5k, False: 0] ------------------ 1843| 38.5k| return make_relaxed_pos(node, shift, relaxed) 1844| 38.5k| .visit(v, std::forward(args)...); 1845| 38.5k| } else { 1846| 7.93k| return make_regular_sub_pos(node, shift, size) 1847| 7.93k| .visit(v, std::forward(args)...); 1848| 7.93k| } 1849| 46.4k|} _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.5k| { 1814| 38.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 38.5k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1705| 5.12k| { 1706| 5.12k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 5.12k, False: 0] ------------------ 1707| 5.12k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 4.42k, False: 703] ------------------ 1708| 5.12k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 5.12k| } _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.12k| { 1718| 5.12k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 5.12k, False: 0] ------------------ 1719| 5.12k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 4.42k, False: 703] | Branch (1719:9): [True: 5.12k, False: 0] ------------------ 1720| 5.12k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 5.12k| auto child = node_->inner()[offset_hint]; 1722| 5.12k| auto is_leaf = shift_ == BL; 1723| 5.12k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 5.12k| auto next_idx = idx - left_size_hint; 1725| 5.12k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 5.12k] ------------------ 1726| 5.12k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 5.12k| : visit_maybe_relaxed_sub( 1729| 5.12k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 5.12k| } _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.29k| { 1706| 4.29k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 4.29k, False: 0] ------------------ 1707| 4.29k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 3.64k, False: 659] ------------------ 1708| 4.29k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 4.29k| } _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.29k| { 1718| 4.29k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 4.29k, False: 0] ------------------ 1719| 4.29k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.64k, False: 659] | Branch (1719:9): [True: 4.29k, False: 0] ------------------ 1720| 4.29k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 4.29k| auto child = node_->inner()[offset_hint]; 1722| 4.29k| auto is_leaf = shift_ == BL; 1723| 4.29k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 4.29k| auto next_idx = idx - left_size_hint; 1725| 4.29k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 4.29k] ------------------ 1726| 4.29k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 4.29k| : visit_maybe_relaxed_sub( 1729| 4.29k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 4.29k| } _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.29k|{ 1839| 4.29k| assert(node); ------------------ | Branch (1839:5): [True: 4.29k, False: 0] ------------------ 1840| 4.29k| auto relaxed = node->relaxed(); 1841| 4.29k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.71k, False: 1.58k] ------------------ 1842| 2.71k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.71k, False: 0] ------------------ 1843| 2.71k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.71k| .visit(v, std::forward(args)...); 1845| 2.71k| } else { 1846| 1.58k| return make_regular_sub_pos(node, shift, size) 1847| 1.58k| .visit(v, std::forward(args)...); 1848| 1.58k| } 1849| 4.29k|} _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.71k| { 1814| 2.71k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.71k| } _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.58k| { 1037| 1.58k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.58k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 946| 2.06k| { 947| 2.06k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 2.06k| } _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.06k|{ 654| 2.06k| constexpr auto B = bits; 655| 2.06k| constexpr auto BL = bits_leaf; 656| 2.06k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 2.06k, False: 0] ------------------ 657| 2.06k| auto is_leaf = p.shift() == BL; 658| 2.06k| auto child = p.node()->inner()[offset_hint]; 659| 2.06k| auto lsize = offset_hint << p.shift(); 660| 2.06k| auto size = p.this_size(); 661| 2.06k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 2.06k| return is_full ------------------ | Branch (662:12): [True: 1.10k, False: 954] ------------------ 663| 2.06k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 1.10k] ------------------ 664| 1.10k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 1.10k| : make_full_pos(child, p.shift() - B) 666| 1.10k| .visit(v, idx - lsize, args...)) 667| 2.06k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 954] ------------------ 668| 954| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 954| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 954| .visit(v, idx - lsize, args...)); 672| 2.06k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 2.87k| { 1406| 2.87k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.87k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1348| 1.76k| { 1349| 1.76k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 1.76k, False: 0] ------------------ 1350| 1.76k| auto is_leaf = shift_ == BL; 1351| 1.76k| auto child = node_->inner()[offset_hint]; 1352| 1.76k| auto lsize = size_t{offset_hint} << shift_; 1353| 1.76k| return is_leaf ------------------ | Branch (1353:16): [True: 0, False: 1.76k] ------------------ 1354| 1.76k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 1.76k| : make_full_pos(child, shift_ - B) 1356| 1.76k| .visit(v, idx - lsize, args...); 1357| 1.76k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1405| 311| { 1406| 311| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 311| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1348| 1.76k| { 1349| 1.76k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 1.76k, False: 0] ------------------ 1350| 1.76k| auto is_leaf = shift_ == BL; 1351| 1.76k| auto child = node_->inner()[offset_hint]; 1352| 1.76k| auto lsize = size_t{offset_hint} << shift_; 1353| 1.76k| return is_leaf ------------------ | Branch (1353:16): [True: 1.12k, False: 637] ------------------ 1354| 1.76k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 1.76k| : make_full_pos(child, shift_ - B) 1356| 637| .visit(v, idx - lsize, args...); 1357| 1.76k| } _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.24k| { 208| 3.24k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.24k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 1.85k| { 1406| 1.85k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.85k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1348| 7.14k| { 1349| 7.14k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 7.14k, False: 0] ------------------ 1350| 7.14k| auto is_leaf = shift_ == BL; 1351| 7.14k| auto child = node_->inner()[offset_hint]; 1352| 7.14k| auto lsize = size_t{offset_hint} << shift_; 1353| 7.14k| return is_leaf ------------------ | Branch (1353:16): [True: 5.61k, False: 1.52k] ------------------ 1354| 7.14k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 7.14k| : make_full_pos(child, shift_ - B) 1356| 1.52k| .visit(v, idx - lsize, args...); 1357| 7.14k| } _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.2k| { 208| 12.2k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 12.2k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 2.87k| { 1406| 2.87k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.87k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1316| 2.07k| { 1317| 2.07k| each_i(v, 0, last, args...); 1318| 2.07k| } _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| 954| { 1037| 954| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 954| } _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.13k| { 1037| 4.13k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.13k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 946| 3.34k| { 947| 3.34k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 3.34k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_22slice_left_mut_visitorISD_Lb0ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjDpOT1_: 653| 3.34k|{ 654| 3.34k| constexpr auto B = bits; 655| 3.34k| constexpr auto BL = bits_leaf; 656| 3.34k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 3.34k, False: 0] ------------------ 657| 3.34k| auto is_leaf = p.shift() == BL; 658| 3.34k| auto child = p.node()->inner()[offset_hint]; 659| 3.34k| auto lsize = offset_hint << p.shift(); 660| 3.34k| auto size = p.this_size(); 661| 3.34k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 3.34k| return is_full ------------------ | Branch (662:12): [True: 3.34k, False: 0] ------------------ 663| 3.34k| ? (is_leaf ------------------ | Branch (663:19): [True: 2.11k, False: 1.22k] ------------------ 664| 3.34k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 3.34k| : make_full_pos(child, p.shift() - B) 666| 1.22k| .visit(v, idx - lsize, args...)) 667| 3.34k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 0] ------------------ 668| 0| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 0| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 0| .visit(v, idx - lsize, args...)); 672| 3.34k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 946| 7.96k| { 947| 7.96k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 7.96k| } _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.96k|{ 654| 7.96k| constexpr auto B = bits; 655| 7.96k| constexpr auto BL = bits_leaf; 656| 7.96k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 7.96k, False: 0] ------------------ 657| 7.96k| auto is_leaf = p.shift() == BL; 658| 7.96k| auto child = p.node()->inner()[offset_hint]; 659| 7.96k| auto lsize = offset_hint << p.shift(); 660| 7.96k| auto size = p.this_size(); 661| 7.96k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 7.96k| return is_full ------------------ | Branch (662:12): [True: 7.96k, False: 0] ------------------ 663| 7.96k| ? (is_leaf ------------------ | Branch (663:19): [True: 6.61k, False: 1.35k] ------------------ 664| 7.96k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 7.96k| : make_full_pos(child, p.shift() - B) 666| 1.35k| .visit(v, idx - lsize, args...)) 667| 7.96k| : (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.96k|} _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.47k| { 874| 7.47k| return each_left_regular(*this, v, last, args...); 875| 7.47k| } _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.47k|{ 576| 7.47k| constexpr auto B = bits; 577| 7.47k| constexpr auto BL = bits_leaf; 578| 7.47k| assert(last < p.count()); ------------------ | Branch (578:5): [True: 7.47k, False: 0] ------------------ 579| 7.47k| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 2.11k, False: 5.35k] ------------------ 580| 2.11k| auto n = p.node()->inner(); 581| 2.11k| auto e = n + last; 582| 4.25k| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 2.13k, False: 2.11k] ------------------ 583| 2.13k| IMMER_PREFETCH(n + 1); 584| 2.13k| make_full_leaf_pos(*n).visit(v, args...); 585| 2.13k| } 586| 5.35k| } else { 587| 5.35k| auto n = p.node()->inner(); 588| 5.35k| auto e = n + last; 589| 5.35k| auto ss = p.shift() - B; 590| 7.49k| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 2.14k, False: 5.35k] ------------------ 591| 2.14k| make_full_pos(*n, ss).visit(v, args...); 592| 5.35k| } 593| 7.47k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1813| 5.12k| { 1814| 5.12k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 5.12k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1705| 201k| { 1706| 201k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 201k, False: 0] ------------------ 1707| 201k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 10.5k, False: 191k] ------------------ 1708| 201k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 201k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 201k| { 1718| 201k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 201k, False: 0] ------------------ 1719| 201k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 10.5k, False: 191k] | Branch (1719:9): [True: 201k, False: 0] ------------------ 1720| 201k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 201k| auto child = node_->inner()[offset_hint]; 1722| 201k| auto is_leaf = shift_ == BL; 1723| 201k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 201k| auto next_idx = idx - left_size_hint; 1725| 201k| return is_leaf ------------------ | Branch (1725:16): [True: 11.8k, False: 189k] ------------------ 1726| 201k| ? make_leaf_sub_pos(child, next_size) 1727| 11.8k| .visit(v, next_idx, args...) 1728| 201k| : visit_maybe_relaxed_sub( 1729| 189k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 201k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 11.8k| { 145| 11.8k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 11.8k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 189k|{ 1839| 189k| assert(node); ------------------ | Branch (1839:5): [True: 189k, False: 0] ------------------ 1840| 189k| auto relaxed = node->relaxed(); 1841| 189k| if (relaxed) { ------------------ | Branch (1841:9): [True: 188k, False: 1.55k] ------------------ 1842| 188k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 188k, False: 0] ------------------ 1843| 188k| return make_relaxed_pos(node, shift, relaxed) 1844| 188k| .visit(v, std::forward(args)...); 1845| 188k| } else { 1846| 1.55k| return make_regular_sub_pos(node, shift, size) 1847| 1.55k| .visit(v, std::forward(args)...); 1848| 1.55k| } 1849| 189k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 188k| { 1814| 188k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 188k| } _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.55k| { 1037| 1.55k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.55k| } _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| 76.6k| { 1706| 76.6k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 76.6k, False: 0] ------------------ 1707| 76.6k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 24.9k, False: 51.7k] ------------------ 1708| 76.6k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 76.6k| } _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| 76.6k| { 1718| 76.6k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 76.6k, False: 0] ------------------ 1719| 76.6k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 24.9k, False: 51.7k] | Branch (1719:9): [True: 76.6k, False: 0] ------------------ 1720| 76.6k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 76.6k| auto child = node_->inner()[offset_hint]; 1722| 76.6k| auto is_leaf = shift_ == BL; 1723| 76.6k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 76.6k| auto next_idx = idx - left_size_hint; 1725| 76.6k| return is_leaf ------------------ | Branch (1725:16): [True: 14.0k, False: 62.6k] ------------------ 1726| 76.6k| ? make_leaf_sub_pos(child, next_size) 1727| 14.0k| .visit(v, next_idx, args...) 1728| 76.6k| : visit_maybe_relaxed_sub( 1729| 62.6k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 76.6k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 14.0k| { 145| 14.0k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 14.0k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 62.6k|{ 1839| 62.6k| assert(node); ------------------ | Branch (1839:5): [True: 62.6k, False: 0] ------------------ 1840| 62.6k| auto relaxed = node->relaxed(); 1841| 62.6k| if (relaxed) { ------------------ | Branch (1841:9): [True: 58.2k, False: 4.39k] ------------------ 1842| 58.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 58.2k, False: 0] ------------------ 1843| 58.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 58.2k| .visit(v, std::forward(args)...); 1845| 58.2k| } else { 1846| 4.39k| return make_regular_sub_pos(node, shift, size) 1847| 4.39k| .visit(v, std::forward(args)...); 1848| 4.39k| } 1849| 62.6k|} _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| 58.2k| { 1814| 58.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 58.2k| } _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.39k| { 1037| 4.39k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.39k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 7.93k| { 1037| 7.93k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 7.93k| } _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.13k| { 947| 4.13k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 4.13k| } _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.13k|{ 654| 4.13k| constexpr auto B = bits; 655| 4.13k| constexpr auto BL = bits_leaf; 656| 4.13k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 4.13k, False: 0] ------------------ 657| 4.13k| auto is_leaf = p.shift() == BL; 658| 4.13k| auto child = p.node()->inner()[offset_hint]; 659| 4.13k| auto lsize = offset_hint << p.shift(); 660| 4.13k| auto size = p.this_size(); 661| 4.13k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 4.13k| return is_full ------------------ | Branch (662:12): [True: 3.06k, False: 1.06k] ------------------ 663| 4.13k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 3.06k] ------------------ 664| 3.06k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 3.06k| : make_full_pos(child, p.shift() - B) 666| 3.06k| .visit(v, idx - lsize, args...)) 667| 4.13k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 1.06k] ------------------ 668| 1.06k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 1.06k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 1.06k| .visit(v, idx - lsize, args...)); 672| 4.13k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 3.37k| { 1406| 3.37k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.37k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1348| 311| { 1349| 311| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 311, False: 0] ------------------ 1350| 311| auto is_leaf = shift_ == BL; 1351| 311| auto child = node_->inner()[offset_hint]; 1352| 311| auto lsize = size_t{offset_hint} << shift_; 1353| 311| return is_leaf ------------------ | Branch (1353:16): [True: 0, False: 311] ------------------ 1354| 311| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 311| : make_full_pos(child, shift_ - B) 1356| 311| .visit(v, idx - lsize, args...); 1357| 311| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 1.06k| { 1037| 1.06k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.06k| } _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| 19.6k|{ 1839| 19.6k| assert(node); ------------------ | Branch (1839:5): [True: 19.6k, False: 0] ------------------ 1840| 19.6k| auto relaxed = node->relaxed(); 1841| 19.6k| if (relaxed) { ------------------ | Branch (1841:9): [True: 13.1k, False: 6.50k] ------------------ 1842| 13.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 13.1k, False: 0] ------------------ 1843| 13.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 13.1k| .visit(v, std::forward(args)...); 1845| 13.1k| } else { 1846| 6.50k| return make_regular_sub_pos(node, shift, size) 1847| 6.50k| .visit(v, std::forward(args)...); 1848| 6.50k| } 1849| 19.6k|} _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| 13.1k| { 1814| 13.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 13.1k| } _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| 13.1k|{ 1839| 13.1k| assert(node); ------------------ | Branch (1839:5): [True: 13.1k, False: 0] ------------------ 1840| 13.1k| auto relaxed = node->relaxed(); 1841| 13.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 9.91k, False: 3.21k] ------------------ 1842| 9.91k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 9.91k, False: 0] ------------------ 1843| 9.91k| return make_relaxed_pos(node, shift, relaxed) 1844| 9.91k| .visit(v, std::forward(args)...); 1845| 9.91k| } else { 1846| 3.21k| return make_regular_sub_pos(node, shift, size) 1847| 3.21k| .visit(v, std::forward(args)...); 1848| 3.21k| } 1849| 13.1k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcT_DpOT0_: 1813| 9.91k| { 1814| 9.91k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 9.91k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcjT_DpOT0_: 1793| 33.4k| { 1794| 33.4k| auto child = node_->inner()[offset]; 1795| 33.4k| auto child_size = size(offset); 1796| 33.4k| auto is_leaf = shift_ == BL; 1797| 33.4k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 8.99k, False: 24.4k] ------------------ 1798| 33.4k| : visit_maybe_relaxed_sub( 1799| 24.4k| child, shift_ - B, child_size, v, args...); 1800| 33.4k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 144| 9.33k| { 145| 9.33k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 9.33k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcjT_DpOT0_: 1804| 9.33k| { 1805| 9.33k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 9.33k, False: 0] ------------------ 1806| 9.33k| auto child = node_->inner()[offset]; 1807| 9.33k| auto child_size = size(offset); 1808| 9.33k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 9.33k| } _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| 10.0k| { 145| 10.0k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 10.0k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcPT_jmT0_DpOT1_: 1838| 24.4k|{ 1839| 24.4k| assert(node); ------------------ | Branch (1839:5): [True: 24.4k, False: 0] ------------------ 1840| 24.4k| auto relaxed = node->relaxed(); 1841| 24.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 21.7k, False: 2.70k] ------------------ 1842| 21.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 21.7k, False: 0] ------------------ 1843| 21.7k| return make_relaxed_pos(node, shift, relaxed) 1844| 21.7k| .visit(v, std::forward(args)...); 1845| 21.7k| } else { 1846| 2.70k| return make_regular_sub_pos(node, shift, size) 1847| 2.70k| .visit(v, std::forward(args)...); 1848| 2.70k| } 1849| 24.4k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1813| 21.7k| { 1814| 21.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 21.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| 21.7k| { 1794| 21.7k| auto child = node_->inner()[offset]; 1795| 21.7k| auto child_size = size(offset); 1796| 21.7k| auto is_leaf = shift_ == BL; 1797| 21.7k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 21.7k] ------------------ 1798| 21.7k| : visit_maybe_relaxed_sub( 1799| 21.7k| child, shift_ - B, child_size, v, args...); 1800| 21.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| 21.7k|{ 1839| 21.7k| assert(node); ------------------ | Branch (1839:5): [True: 21.7k, False: 0] ------------------ 1840| 21.7k| auto relaxed = node->relaxed(); 1841| 21.7k| if (relaxed) { ------------------ | Branch (1841:9): [True: 20.7k, False: 1.00k] ------------------ 1842| 20.7k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 20.7k, False: 0] ------------------ 1843| 20.7k| return make_relaxed_pos(node, shift, relaxed) 1844| 20.7k| .visit(v, std::forward(args)...); 1845| 20.7k| } else { 1846| 1.00k| return make_regular_sub_pos(node, shift, size) 1847| 1.00k| .visit(v, std::forward(args)...); 1848| 1.00k| } 1849| 21.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| 20.7k| { 1814| 20.7k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 20.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.39k| { 1037| 1.39k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.39k| } _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.69k| { 1794| 6.69k| auto child = node_->inner()[offset]; 1795| 6.69k| auto child_size = size(offset); 1796| 6.69k| auto is_leaf = shift_ == BL; 1797| 6.69k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 3.73k, False: 2.96k] ------------------ 1798| 6.69k| : visit_maybe_relaxed_sub( 1799| 2.96k| child, shift_ - B, child_size, v, args...); 1800| 6.69k| } _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.73k| { 145| 3.73k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 3.73k| } _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.73k| { 1026| 3.73k| assert(shift_ == BL); ------------------ | Branch (1026:9): [True: 3.73k, False: 0] ------------------ 1027| 3.73k| auto child = node_->inner()[idx]; 1028| 3.73k| auto lsize = size(idx); 1029| 3.73k| auto is_full = idx + 1 < count(); 1030| 3.73k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1030:16): [True: 3.06k, False: 670] ------------------ 1031| 3.73k| : make_leaf_sub_pos(child, lsize).visit(v, args...); 1032| 3.73k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 207| 6.79k| { 208| 6.79k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 6.79k| } _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| 2.96k|{ 1839| 2.96k| assert(node); ------------------ | Branch (1839:5): [True: 2.96k, False: 0] ------------------ 1840| 2.96k| auto relaxed = node->relaxed(); 1841| 2.96k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.22k, False: 744] ------------------ 1842| 2.22k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.22k, False: 0] ------------------ 1843| 2.22k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.22k| .visit(v, std::forward(args)...); 1845| 2.22k| } else { 1846| 744| return make_regular_sub_pos(node, shift, size) 1847| 744| .visit(v, std::forward(args)...); 1848| 744| } 1849| 2.96k|} _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.22k| { 1814| 2.22k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.22k| } _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.22k| { 1008| 2.22k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 2.22k, False: 0] ------------------ 1009| 2.22k| auto is_leaf = shift_ == BL; 1010| 2.22k| auto child = node_->inner()[idx]; 1011| 2.22k| auto lsize = size(idx); 1012| 2.22k| auto is_full = idx + 1 < count(); 1013| 2.22k| return is_full ------------------ | Branch (1013:16): [True: 1.83k, False: 386] ------------------ 1014| 2.22k| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 1.83k] ------------------ 1015| 1.83k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.83k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 2.22k| : (is_leaf ------------------ | Branch (1017:23): [True: 0, False: 386] ------------------ 1018| 386| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 386| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 386| .visit(v, args...)); 1021| 2.22k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1405| 2.74k| { 1406| 2.74k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.74k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcjT_DpOT0_: 1793| 5.74k| { 1794| 5.74k| auto child = node_->inner()[offset]; 1795| 5.74k| auto child_size = size(offset); 1796| 5.74k| auto is_leaf = shift_ == BL; 1797| 5.74k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 3.73k, False: 2.01k] ------------------ 1798| 5.74k| : visit_maybe_relaxed_sub( 1799| 2.01k| child, shift_ - B, child_size, v, args...); 1800| 5.74k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 144| 3.73k| { 145| 3.73k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 3.73k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcjT_DpOT0_: 1396| 3.73k| { 1397| 3.73k| assert(shift_ == BL); ------------------ | Branch (1397:9): [True: 3.73k, False: 0] ------------------ 1398| 3.73k| assert(idx < count()); ------------------ | Branch (1398:9): [True: 3.73k, False: 0] ------------------ 1399| 3.73k| auto child = node_->inner()[idx]; 1400| 3.73k| return make_full_leaf_pos(child).visit(v, args...); 1401| 3.73k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcPT_jmT0_DpOT1_: 1838| 2.01k|{ 1839| 2.01k| assert(node); ------------------ | Branch (1839:5): [True: 2.01k, False: 0] ------------------ 1840| 2.01k| auto relaxed = node->relaxed(); 1841| 2.01k| if (relaxed) { ------------------ | Branch (1841:9): [True: 905, False: 1.10k] ------------------ 1842| 905| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 905, False: 0] ------------------ 1843| 905| return make_relaxed_pos(node, shift, relaxed) 1844| 905| .visit(v, std::forward(args)...); 1845| 1.10k| } else { 1846| 1.10k| return make_regular_sub_pos(node, shift, size) 1847| 1.10k| .visit(v, std::forward(args)...); 1848| 1.10k| } 1849| 2.01k|} _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| 905| { 1814| 905| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 905| } _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| 905| { 1387| 905| assert(idx < count()); ------------------ | Branch (1387:9): [True: 905, False: 0] ------------------ 1388| 905| auto is_leaf = shift_ == BL; 1389| 905| auto child = node_->inner()[idx]; 1390| 905| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 905] ------------------ 1391| 905| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 905| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1036| 1.10k| { 1037| 1.10k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.10k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcjT_DpOT0_: 1386| 1.10k| { 1387| 1.10k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 1.10k, False: 0] ------------------ 1388| 1.10k| auto is_leaf = shift_ == BL; 1389| 1.10k| auto child = node_->inner()[idx]; 1390| 1.10k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 1.10k] ------------------ 1391| 1.10k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 1.10k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1405| 1.85k| { 1406| 1.85k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.85k| } _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.91k| { 1223| 3.91k| auto p = node_->inner(); 1224| 3.91k| auto p2 = other->inner(); 1225| 3.91k| auto e = p + branches; 1226| 3.91k| if (shift_ == BL) { ------------------ | Branch (1226:13): [True: 2.93k, False: 980] ------------------ 1227| 11.8k| for (; p != e; ++p, ++p2) { ------------------ | Branch (1227:20): [True: 10.1k, False: 1.69k] ------------------ 1228| 10.1k| IMMER_PREFETCH(p + 1); 1229| 10.1k| if (!make_full_leaf_pos(*p).visit(v, *p2, args...)) ------------------ | Branch (1229:21): [True: 1.24k, False: 8.92k] ------------------ 1230| 1.24k| return false; 1231| 10.1k| } 1232| 2.93k| } else { 1233| 980| auto ss = shift_ - B; 1234| 3.42k| for (; p != e; ++p, ++p2) ------------------ | Branch (1234:20): [True: 3.05k, False: 371] ------------------ 1235| 3.05k| if (!make_full_pos(*p, ss).visit(v, *p2, args...)) ------------------ | Branch (1235:21): [True: 609, False: 2.44k] ------------------ 1236| 609| return false; 1237| 980| } 1238| 2.06k| return true; 1239| 3.91k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 207| 14.3k| { 208| 14.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 14.3k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 1405| 8.82k| { 1406| 8.82k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 8.82k| } _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.07k| { 838| 5.07k| return each_pred_zip_regular(*this, v, other, args...); 839| 5.07k| } _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.07k|{ 393| 5.07k| constexpr auto B = bits; 394| 5.07k| constexpr auto BL = bits_leaf; 395| | 396| 5.07k| auto n = p.node()->inner(); 397| 5.07k| auto n2 = other->inner(); 398| 5.07k| auto last = p.count() - 1; 399| 5.07k| auto e = n + last; 400| 5.07k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 1.48k, False: 3.59k] ------------------ 401| 3.59k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 2.48k, False: 1.11k] ------------------ 402| 2.48k| IMMER_PREFETCH(n + 1); 403| 2.48k| IMMER_PREFETCH(n2 + 1); 404| 2.48k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 371, False: 2.11k] ------------------ 405| 371| return false; 406| 2.48k| } 407| 1.11k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 3.59k| } else { 409| 3.59k| auto ss = p.shift() - B; 410| 7.06k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 4.28k, False: 2.78k] ------------------ 411| 4.28k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 811, False: 3.47k] ------------------ 412| 811| return false; 413| 2.78k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 3.59k| } 415| 5.07k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 112| 2.95k| { 113| 2.95k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.95k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 336| 3.97k| { 337| 3.97k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.97k| } _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.51k| { 256| 3.51k| return each_pred_zip_regular(*this, v, other, args...); 257| 3.51k| } _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.51k|{ 393| 3.51k| constexpr auto B = bits; 394| 3.51k| constexpr auto BL = bits_leaf; 395| | 396| 3.51k| auto n = p.node()->inner(); 397| 3.51k| auto n2 = other->inner(); 398| 3.51k| auto last = p.count() - 1; 399| 3.51k| auto e = n + last; 400| 3.51k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 2.11k, False: 1.39k] ------------------ 401| 3.53k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 1.69k, False: 1.84k] ------------------ 402| 1.69k| IMMER_PREFETCH(n + 1); 403| 1.69k| IMMER_PREFETCH(n2 + 1); 404| 1.69k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 276, False: 1.41k] ------------------ 405| 276| return false; 406| 1.69k| } 407| 1.84k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 2.11k| } else { 409| 1.39k| auto ss = p.shift() - B; 410| 2.67k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 1.48k, False: 1.19k] ------------------ 411| 1.48k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 203, False: 1.28k] ------------------ 412| 203| return false; 413| 1.19k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 1.39k| } 415| 3.51k|} _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.69k| { 1387| 4.69k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 4.69k, False: 0] ------------------ 1388| 4.69k| auto is_leaf = shift_ == BL; 1389| 4.69k| auto child = node_->inner()[idx]; 1390| 4.69k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 3.19k, False: 1.50k] ------------------ 1391| 4.69k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 4.69k| } _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| 351k| { 208| 351k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 351k| } _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.04M|{ 1839| 9.04M| assert(node); ------------------ | Branch (1839:5): [True: 9.04M, False: 0] ------------------ 1840| 9.04M| auto relaxed = node->relaxed(); 1841| 9.04M| if (relaxed) { ------------------ | Branch (1841:9): [True: 8.66M, False: 377k] ------------------ 1842| 8.66M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 8.66M, False: 0] ------------------ 1843| 8.66M| return make_relaxed_pos(node, shift, relaxed) 1844| 8.66M| .visit(v, std::forward(args)...); 1845| 8.66M| } else { 1846| 377k| return make_regular_sub_pos(node, shift, size) 1847| 377k| .visit(v, std::forward(args)...); 1848| 377k| } 1849| 9.04M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1813| 8.66M| { 1814| 8.66M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 8.66M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1679| 8.66M| { 1680| 8.66M| return towards_oh(v, idx, subindex(idx), args...); 1681| 8.66M| } _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.66M| { 1687| 8.66M| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 8.66M, False: 0] ------------------ 1688| 8.66M| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 4.59M, False: 4.07M] ------------------ 1689| 8.66M| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 8.66M| } _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.66M| { 1699| 8.66M| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 8.66M| } _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.66M| { 1718| 8.66M| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 8.66M, False: 0] ------------------ 1719| 8.66M| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 4.59M, False: 4.07M] | Branch (1719:9): [True: 8.66M, False: 0] ------------------ 1720| 8.66M| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 8.66M| auto child = node_->inner()[offset_hint]; 1722| 8.66M| auto is_leaf = shift_ == BL; 1723| 8.66M| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 8.66M| auto next_idx = idx - left_size_hint; 1725| 8.66M| return is_leaf ------------------ | Branch (1725:16): [True: 904k, False: 7.75M] ------------------ 1726| 8.66M| ? make_leaf_sub_pos(child, next_size) 1727| 904k| .visit(v, next_idx, args...) 1728| 8.66M| : visit_maybe_relaxed_sub( 1729| 7.75M| child, shift_ - B, next_size, v, next_idx, args...); 1730| 8.66M| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 144| 904k| { 145| 904k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 904k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1036| 377k| { 1037| 377k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 377k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 919| 377k| { 920| 377k| return towards_oh_ch_regular( 921| 377k| *this, v, idx, index(idx), count(), args...); 922| 377k| } _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| 377k|{ 633| 377k| constexpr auto B = bits; 634| 377k| constexpr auto BL = bits_leaf; 635| 377k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 377k, False: 0] ------------------ 636| 377k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 377k, False: 0] ------------------ 637| 377k| auto is_leaf = p.shift() == BL; 638| 377k| auto child = p.node()->inner()[offset_hint]; 639| 377k| auto is_full = offset_hint + 1 != count_hint; 640| 377k| return is_full ------------------ | Branch (640:12): [True: 277k, False: 100k] ------------------ 641| 377k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 44.0k, False: 233k] ------------------ 642| 277k| : make_full_pos(child, p.shift() - B) 643| 233k| .visit(v, idx, args...)) 644| 377k| : (is_leaf ------------------ | Branch (644:19): [True: 16.9k, False: 83.8k] ------------------ 645| 100k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 100k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 83.8k| .visit(v, idx, args...)); 648| 377k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 207| 354k| { 208| 354k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 354k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1405| 1.02M| { 1406| 1.02M| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.02M| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1322| 1.02M| { 1323| 1.02M| return towards_oh(v, idx, index(idx), args...); 1324| 1.02M| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_18region_for_visitorIiEEJEEEDcT_mjDpOT0_: 1336| 1.02M| { 1337| 1.02M| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.02M, False: 0] ------------------ 1338| 1.02M| auto is_leaf = shift_ == BL; 1339| 1.02M| auto child = node_->inner()[offset_hint]; 1340| 1.02M| return is_leaf ------------------ | Branch (1340:16): [True: 300k, False: 727k] ------------------ 1341| 1.02M| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.02M| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.02M| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 112| 23.1k| { 113| 23.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 23.1k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 336| 111k| { 337| 111k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 111k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 297| 111k| { 298| 111k| return towards_oh_ch_regular( 299| 111k| *this, v, idx, index(idx), count(), args...); 300| 111k| } _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| 111k|{ 633| 111k| constexpr auto B = bits; 634| 111k| constexpr auto BL = bits_leaf; 635| 111k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 111k, False: 0] ------------------ 636| 111k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 111k, False: 0] ------------------ 637| 111k| auto is_leaf = p.shift() == BL; 638| 111k| auto child = p.node()->inner()[offset_hint]; 639| 111k| auto is_full = offset_hint + 1 != count_hint; 640| 111k| return is_full ------------------ | Branch (640:12): [True: 77.5k, False: 34.0k] ------------------ 641| 111k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 9.87k, False: 67.6k] ------------------ 642| 77.5k| : make_full_pos(child, p.shift() - B) 643| 67.6k| .visit(v, idx, args...)) 644| 111k| : (is_leaf ------------------ | Branch (644:19): [True: 6.24k, False: 27.8k] ------------------ 645| 34.0k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 34.0k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 27.8k| .visit(v, idx, args...)); 648| 111k|} _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| 95.6k| { 1406| 95.6k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 95.6k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 1202| 95.6k| { 1203| 95.6k| auto p = node_->inner(); 1204| 95.6k| auto e = p + branches; 1205| 95.6k| if (shift_ == BL) { ------------------ | Branch (1205:13): [True: 75.1k, False: 20.5k] ------------------ 1206| 373k| for (; p != e; ++p) { ------------------ | Branch (1206:20): [True: 299k, False: 74.2k] ------------------ 1207| 299k| IMMER_PREFETCH(p + 1); 1208| 299k| if (!make_full_leaf_pos(*p).visit(v, args...)) ------------------ | Branch (1208:21): [True: 869, False: 298k] ------------------ 1209| 869| return false; 1210| 299k| } 1211| 75.1k| } else { 1212| 20.5k| auto ss = shift_ - B; 1213| 101k| for (; p != e; ++p) ------------------ | Branch (1213:20): [True: 81.0k, False: 20.0k] ------------------ 1214| 81.0k| if (!make_full_pos(*p, ss).visit(v, args...)) ------------------ | Branch (1214:21): [True: 498, False: 80.5k] ------------------ 1215| 498| return false; 1216| 20.5k| } 1217| 94.2k| return true; 1218| 95.6k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1036| 744| { 1037| 744| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 744| } _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| 744| { 1008| 744| assert(idx < count()); ------------------ | Branch (1008:9): [True: 744, False: 0] ------------------ 1009| 744| auto is_leaf = shift_ == BL; 1010| 744| auto child = node_->inner()[idx]; 1011| 744| auto lsize = size(idx); 1012| 744| auto is_full = idx + 1 < count(); 1013| 744| return is_full ------------------ | Branch (1013:16): [True: 744, False: 0] ------------------ 1014| 744| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 744] ------------------ 1015| 744| ? make_full_leaf_pos(child).visit(v, args...) 1016| 744| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 744| : (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| 744| } _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.91k| { 1037| 1.91k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.91k| } _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.26k| { 1008| 4.26k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 4.26k, False: 0] ------------------ 1009| 4.26k| auto is_leaf = shift_ == BL; 1010| 4.26k| auto child = node_->inner()[idx]; 1011| 4.26k| auto lsize = size(idx); 1012| 4.26k| auto is_full = idx + 1 < count(); 1013| 4.26k| return is_full ------------------ | Branch (1013:16): [True: 1.48k, False: 2.78k] ------------------ 1014| 4.26k| ? (is_leaf ------------------ | Branch (1014:23): [True: 871, False: 610] ------------------ 1015| 1.48k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.48k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 4.26k| : (is_leaf ------------------ | Branch (1017:23): [True: 1.47k, False: 1.31k] ------------------ 1018| 2.78k| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 2.78k| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 1.31k| .visit(v, args...)); 1021| 4.26k| } _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| 889k| { 145| 889k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 889k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 1036| 19.5k| { 1037| 19.5k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 19.5k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 831| 19.5k| { 832| 19.5k| return each_pred_regular(*this, v, args...); 833| 19.5k| } _ZN5immer6detail4rbts17each_pred_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSC_Lj2ELj2EEEEEDaOT_EUlSL_T0_E_EEEbSM_SN_DpOT1_: 365| 19.5k|{ 366| 19.5k| constexpr auto B = bits; 367| 19.5k| constexpr auto BL = bits_leaf; 368| 19.5k| auto n = p.node()->inner(); 369| 19.5k| auto last = p.count() - 1; 370| 19.5k| auto e = n + last; 371| 19.5k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 14.3k, False: 5.14k] ------------------ 372| 53.4k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 39.2k, False: 14.1k] ------------------ 373| 39.2k| IMMER_PREFETCH(n + 1); 374| 39.2k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 207, False: 39.0k] ------------------ 375| 207| return false; 376| 39.2k| } 377| 14.1k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 14.3k| } else { 379| 5.14k| auto ss = p.shift() - B; 380| 13.3k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 8.78k, False: 4.55k] ------------------ 381| 8.78k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 581, False: 8.20k] ------------------ 382| 581| return false; 383| 4.55k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 5.14k| } 385| 19.5k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 112| 18.2k| { 113| 18.2k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 18.2k| } _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.47k| { 337| 6.47k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 6.47k| } _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.47k| { 250| 6.47k| return each_pred_regular(*this, v, args...); 251| 6.47k| } _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.47k|{ 366| 6.47k| constexpr auto B = bits; 367| 6.47k| constexpr auto BL = bits_leaf; 368| 6.47k| auto n = p.node()->inner(); 369| 6.47k| auto last = p.count() - 1; 370| 6.47k| auto e = n + last; 371| 6.47k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 4.29k, False: 2.18k] ------------------ 372| 12.6k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 8.58k, False: 4.05k] ------------------ 373| 8.58k| IMMER_PREFETCH(n + 1); 374| 8.58k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 237, False: 8.34k] ------------------ 375| 237| return false; 376| 8.58k| } 377| 4.05k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 4.29k| } else { 379| 2.18k| auto ss = p.shift() - B; 380| 5.61k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 3.70k, False: 1.91k] ------------------ 381| 3.70k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 268, False: 3.43k] ------------------ 382| 268| return false; 383| 1.91k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 2.18k| } 385| 6.47k|} _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.70k| { 1037| 2.70k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.70k| } _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.70k| { 1794| 2.70k| auto child = node_->inner()[offset]; 1795| 2.70k| auto child_size = size(offset); 1796| 2.70k| auto is_leaf = shift_ == BL; 1797| 2.70k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 2.70k] ------------------ 1798| 2.70k| : visit_maybe_relaxed_sub( 1799| 2.70k| child, shift_ - B, child_size, v, args...); 1800| 2.70k| } _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.70k|{ 1839| 2.70k| assert(node); ------------------ | Branch (1839:5): [True: 2.70k, False: 0] ------------------ 1840| 2.70k| auto relaxed = node->relaxed(); 1841| 2.70k| if (relaxed) { ------------------ | Branch (1841:9): [True: 788, False: 1.91k] ------------------ 1842| 788| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 788, False: 0] ------------------ 1843| 788| return make_relaxed_pos(node, shift, relaxed) 1844| 788| .visit(v, std::forward(args)...); 1845| 1.91k| } else { 1846| 1.91k| return make_regular_sub_pos(node, shift, size) 1847| 1.91k| .visit(v, std::forward(args)...); 1848| 1.91k| } 1849| 2.70k|} _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| 788| { 1814| 788| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 788| } _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.78k, False: 343] ------------------ 1014| 4.13k| ? (is_leaf ------------------ | Branch (1014:23): [True: 2.23k, False: 1.55k] ------------------ 1015| 3.78k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 3.78k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 4.13k| : (is_leaf ------------------ | Branch (1017:23): [True: 343, False: 0] ------------------ 1018| 343| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 343| : 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| 5.05k| { 208| 5.05k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.05k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_13full_leaf_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcjT_DpOT0_: 1804| 5.05k| { 1805| 5.05k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 5.05k, False: 0] ------------------ 1806| 5.05k| auto child = node_->inner()[offset]; 1807| 5.05k| auto child_size = size(offset); 1808| 5.05k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 5.05k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRNS1_13full_leaf_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 144| 5.05k| { 145| 5.05k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.05k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1405| 2.87k| { 1406| 2.87k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.87k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcjT_DpOT0_: 1793| 2.87k| { 1794| 2.87k| auto child = node_->inner()[offset]; 1795| 2.87k| auto child_size = size(offset); 1796| 2.87k| auto is_leaf = shift_ == BL; 1797| 2.87k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 2.87k] ------------------ 1798| 2.87k| : visit_maybe_relaxed_sub( 1799| 2.87k| child, shift_ - B, child_size, v, args...); 1800| 2.87k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcPT_jmT0_DpOT1_: 1838| 2.87k|{ 1839| 2.87k| assert(node); ------------------ | Branch (1839:5): [True: 2.87k, False: 0] ------------------ 1840| 2.87k| auto relaxed = node->relaxed(); 1841| 2.87k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.82k, False: 1.04k] ------------------ 1842| 1.82k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.82k, False: 0] ------------------ 1843| 1.82k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.82k| .visit(v, std::forward(args)...); 1845| 1.82k| } else { 1846| 1.04k| return make_regular_sub_pos(node, shift, size) 1847| 1.04k| .visit(v, std::forward(args)...); 1848| 1.04k| } 1849| 2.87k|} _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.82k| { 1814| 1.82k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.82k| } _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.13k| { 1387| 4.13k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 4.13k, False: 0] ------------------ 1388| 4.13k| auto is_leaf = shift_ == BL; 1389| 4.13k| auto child = node_->inner()[idx]; 1390| 4.13k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 2.81k, False: 1.31k] ------------------ 1391| 4.13k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 4.13k| } _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.04k| { 1037| 1.04k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.04k| } _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.1k| { 1794| 23.1k| auto child = node_->inner()[offset]; 1795| 23.1k| auto child_size = size(offset); 1796| 23.1k| auto is_leaf = shift_ == BL; 1797| 23.1k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 8.01k, False: 15.0k] ------------------ 1798| 23.1k| : visit_maybe_relaxed_sub( 1799| 15.0k| child, shift_ - B, child_size, v, args...); 1800| 23.1k| } _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| 564k|{ 1839| 564k| assert(node); ------------------ | Branch (1839:5): [True: 564k, False: 0] ------------------ 1840| 564k| auto relaxed = node->relaxed(); 1841| 564k| if (relaxed) { ------------------ | Branch (1841:9): [True: 546k, False: 18.2k] ------------------ 1842| 546k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 546k, False: 0] ------------------ 1843| 546k| return make_relaxed_pos(node, shift, relaxed) 1844| 546k| .visit(v, std::forward(args)...); 1845| 546k| } else { 1846| 18.2k| return make_regular_sub_pos(node, shift, size) 1847| 18.2k| .visit(v, std::forward(args)...); 1848| 18.2k| } 1849| 564k|} _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| 546k| { 1814| 546k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 546k| } _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| 546k| { 1483| 546k| auto p = node_->inner(); 1484| 546k| auto s = size_t{}; 1485| 546k| auto n = count(); 1486| 546k| if (shift_ == BL) { ------------------ | Branch (1486:13): [True: 260k, False: 286k] ------------------ 1487| 1.14M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1487:39): [True: 880k, False: 259k] ------------------ 1488| 880k| IMMER_PREFETCH(p + i + 1); 1489| 880k| if (!make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) ------------------ | Branch (1489:21): [True: 382, False: 879k] ------------------ 1490| 880k| .visit(v, args...)) 1491| 382| return false; 1492| 879k| s = relaxed_->d.sizes[i]; 1493| 879k| } 1494| 286k| } else { 1495| 286k| auto ss = shift_ - B; 1496| 835k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1496:39): [True: 549k, False: 285k] ------------------ 1497| 549k| if (!visit_maybe_relaxed_sub( ------------------ | Branch (1497:21): [True: 395, False: 549k] ------------------ 1498| 549k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...)) 1499| 395| return false; 1500| 549k| s = relaxed_->d.sizes[i]; 1501| 549k| } 1502| 286k| } 1503| 545k| return true; 1504| 546k| } _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.21k| { 1037| 3.21k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.21k| } _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.42k| { 1784| 1.42k| assert(shift_ > BL); ------------------ | Branch (1784:9): [True: 1.42k, False: 0] ------------------ 1785| 1.42k| auto child = node_->inner()[0]; 1786| 1.42k| auto child_size = relaxed_->d.sizes[0]; 1787| 1.42k| return visit_maybe_relaxed_sub( 1788| 1.42k| child, shift_ - B, child_size, v, args...); 1789| 1.42k| } _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.42k|{ 1839| 1.42k| assert(node); ------------------ | Branch (1839:5): [True: 1.42k, False: 0] ------------------ 1840| 1.42k| auto relaxed = node->relaxed(); 1841| 1.42k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.42k, False: 0] ------------------ 1842| 1.42k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.42k, False: 0] ------------------ 1843| 1.42k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.42k| .visit(v, std::forward(args)...); 1845| 1.42k| } else { 1846| 0| return make_regular_sub_pos(node, shift, size) 1847| 0| .visit(v, std::forward(args)...); 1848| 0| } 1849| 1.42k|} _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.42k| { 1814| 1.42k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.42k| } _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.50k|{ 1839| 6.50k| assert(node); ------------------ | Branch (1839:5): [True: 6.50k, False: 0] ------------------ 1840| 6.50k| auto relaxed = node->relaxed(); 1841| 6.50k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.64k, False: 4.85k] ------------------ 1842| 1.64k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.64k, False: 0] ------------------ 1843| 1.64k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.64k| .visit(v, std::forward(args)...); 1845| 4.85k| } else { 1846| 4.85k| return make_regular_sub_pos(node, shift, size) 1847| 4.85k| .visit(v, std::forward(args)...); 1848| 4.85k| } 1849| 6.50k|} _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.64k| { 1814| 1.64k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.64k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcT_DpOT0_: 1036| 4.85k| { 1037| 4.85k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.85k| } _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.50k| { 1037| 6.50k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.50k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRKPSC_EEEDcT_DpOT0_: 144| 7.58k| { 145| 7.58k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.58k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2Ev: 114| 1.53M| : size{0} 115| 1.53M| , shift{BL} 116| 1.53M| , root{empty_root()} 117| 1.53M| , tail{empty_tail()} 118| 1.53M| { 119| | assert(check_tree()); ------------------ | Branch (119:9): [True: 1.53M, False: 0] ------------------ 120| 1.53M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10empty_rootEv: 61| 1.55M| { 62| 1.55M| static const auto empty_ = [] { 63| 1.55M| constexpr auto size = node_t::sizeof_inner_n(0); 64| 1.55M| static std::aligned_storage_t 65| 1.55M| storage; 66| 1.55M| return node_t::make_inner_n_into(&storage, size, 0u); 67| 1.55M| }(); 68| 1.55M| return empty_->inc(); 69| 1.55M| } _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.53M| { 73| 1.53M| static const auto empty_ = [] { 74| 1.53M| constexpr auto size = node_t::sizeof_leaf_n(0); 75| 1.53M| static std::aligned_storage_t 76| 1.53M| storage; 77| 1.53M| return node_t::make_leaf_n_into(&storage, size, 0u); 78| 1.53M| }(); 79| 1.53M| return empty_->inc(); 80| 1.53M| } _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.05M| { 1373| 3.05M| IMMER_INVALID_STATE_ASSERT(shift <= sizeof(size_t) * 8 - BL); ------------------ | | 32| 3.05M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.05M] | | ------------------ | | 33| 3.05M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1374| 3.05M| IMMER_INVALID_STATE_ASSERT(shift >= BL); ------------------ | | 32| 3.05M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.05M] | | ------------------ | | 33| 3.05M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1375| 3.05M| IMMER_INVALID_STATE_ASSERT(tail_offset() <= size); ------------------ | | 32| 3.05M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.05M] | | ------------------ | | 33| 3.05M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1376| 3.05M| IMMER_INVALID_STATE_ASSERT(tail_size() <= branches); ------------------ | | 32| 3.05M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.05M] | | ------------------ | | 33| 3.05M| 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.05M| return true; 1382| 3.05M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11tail_offsetEv: 197| 15.0M| { 198| 15.0M| auto r = root->relaxed(); 199| 15.0M| assert(r == nullptr || r->d.count); ------------------ | Branch (199:9): [True: 7.44M, False: 7.59M] | Branch (199:9): [True: 7.59M, False: 0] | Branch (199:9): [True: 15.0M, False: 0] ------------------ 200| 15.0M| return r ? r->d.sizes[r->d.count - 1] ------------------ | Branch (200:16): [True: 7.59M, False: 7.44M] ------------------ 201| 15.0M| : size ? (size - 1) & ~mask ------------------ | Branch (201:18): [True: 2.80M, False: 4.63M] ------------------ 202| | /* otherwise */ 203| 7.44M| : 0; 204| 15.0M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9tail_sizeEv: 194| 3.54M| 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.05M| ~rrbtree() { dec(); } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE3decEv: 192| 3.05M| 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.05M| { 209| 3.05M| auto tail_off = tail_offset(); 210| 3.05M| auto tail_size = size - tail_off; 211| | 212| 3.05M| if (tail_off) ------------------ | Branch (212:13): [True: 1.43M, False: 1.62M] ------------------ 213| 1.43M| visit_maybe_relaxed_sub(root, shift, tail_off, v, args...); 214| 1.62M| else 215| 1.62M| make_empty_regular_pos(root).visit(v, args...); 216| | 217| 3.05M| if (tail_size) ------------------ | Branch (217:13): [True: 1.51M, False: 1.54M] ------------------ 218| 1.51M| make_leaf_sub_pos(tail, tail_size).visit(v, args...); 219| 1.54M| else 220| 1.54M| make_empty_leaf_pos(tail).visit(v, args...); 221| 3.05M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9push_backEi: 500| 449k| { 501| 449k| auto ts = tail_size(); 502| 449k| if (ts < branches) { ------------------ | Branch (502:13): [True: 328k, False: 121k] ------------------ 503| 328k| auto new_tail = 504| 328k| node_t::copy_leaf_emplace(tail, ts, std::move(value)); 505| 328k| return {size + 1, shift, root->inc(), new_tail}; 506| 328k| } else { 507| 121k| using std::get; 508| 121k| auto new_tail = node_t::make_leaf_n(1u, std::move(value)); 509| 121k| auto tail_off = tail_offset(); 510| 121k| IMMER_TRY { ------------------ | | 49| 121k|#define IMMER_TRY try ------------------ 511| 121k| auto new_root = 512| 121k| push_tail(root, shift, tail_off, tail, size - tail_off); 513| 121k| tail->inc(); 514| 121k| return {size + 1, get<0>(new_root), get<1>(new_root), new_tail}; 515| 121k| } 516| 121k| IMMER_CATCH (...) { 517| 0| node_t::delete_leaf(new_tail, 1u); 518| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 519| 0| } 520| 121k| } 521| 449k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2EmjPNS1_4nodeIiSA_Lj2ELj2EEESE_: 127| 1.51M| : size{sz} 128| 1.51M| , shift{sh} 129| 1.51M| , root{r} 130| 1.51M| , tail{t} 131| 1.51M| { 132| 1.51M|#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.51M| try { 137| 1.51M| check_tree(); 138| 1.51M| } 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.51M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9push_tailEPNS1_4nodeIiSA_Lj2ELj2EEEjmSE_j: 369| 501k| { 370| 501k| if (auto r = root->relaxed()) { ------------------ | Branch (370:18): [True: 194k, False: 306k] ------------------ 371| 194k| auto new_root = 372| 194k| make_relaxed_pos(root, shift, r) 373| 194k| .visit(push_tail_visitor{}, tail, tail_size); 374| 194k| if (new_root) ------------------ | Branch (374:17): [True: 192k, False: 1.90k] ------------------ 375| 192k| return std::make_tuple(shift, new_root); 376| 1.90k| else { 377| 1.90k| auto new_root = node_t::make_inner_r_n(2); 378| 1.90k| IMMER_TRY { ------------------ | | 49| 1.90k|#define IMMER_TRY try ------------------ 379| 1.90k| auto new_path = node_t::make_path(shift, tail); 380| 1.90k| new_root->inner()[0] = root->inc(); 381| 1.90k| new_root->inner()[1] = new_path; 382| 1.90k| new_root->relaxed()->d.sizes[0] = size; 383| 1.90k| new_root->relaxed()->d.sizes[1] = size + tail_size; 384| 1.90k| assert(size); ------------------ | Branch (384:21): [True: 1.90k, False: 0] ------------------ 385| 1.90k| assert(tail_size); ------------------ | Branch (385:21): [True: 1.90k, False: 0] ------------------ 386| 1.90k| new_root->relaxed()->d.count = 2u; 387| 1.90k| } 388| 1.90k| 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.90k| return std::make_tuple(shift + B, new_root); 393| 1.90k| } 394| 306k| } else if (size == size_t{branches} << shift) { ------------------ | Branch (394:20): [True: 5.22k, False: 301k] ------------------ 395| 5.22k| auto new_root = node_t::make_inner_n(2); 396| 5.22k| IMMER_TRY { ------------------ | | 49| 5.22k|#define IMMER_TRY try ------------------ 397| 5.22k| auto new_path = node_t::make_path(shift, tail); 398| 5.22k| new_root->inner()[0] = root->inc(); 399| 5.22k| new_root->inner()[1] = new_path; 400| 5.22k| } 401| 5.22k| 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.22k| return std::make_tuple(shift + B, new_root); 406| 301k| } else if (size) { ------------------ | Branch (406:20): [True: 290k, False: 10.4k] ------------------ 407| 290k| auto new_root = make_regular_sub_pos(root, shift, size) 408| 290k| .visit(push_tail_visitor{}, tail); 409| 290k| return std::make_tuple(shift, new_root); 410| 290k| } else { 411| 10.4k| return std::make_tuple(shift, node_t::make_path(shift, tail)); 412| 10.4k| } 413| 501k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2EOSB_: 157| 1.46M| : rrbtree{} 158| 1.46M| { 159| 1.46M| swap(*this, other); 160| 1.46M| } _ZN5immer6detail4rbts4swapERNS1_7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEESC_: 176| 3.37M| { 177| 3.37M| using std::swap; 178| 3.37M| swap(x.size, y.size); 179| 3.37M| swap(x.shift, y.shift); 180| 3.37M| swap(x.root, y.root); 181| 3.37M| swap(x.tail, y.tail); 182| 3.37M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEaSEOSB_: 170| 1.90M| { 171| 1.90M| swap(*this, other); 172| 1.90M| return *this; 173| 1.90M| } 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| 117k| { 581| 117k| auto tail_off = tail_offset(); 582| 117k| if (idx >= tail_off) { ------------------ | Branch (582:13): [True: 35.5k, False: 81.6k] ------------------ 583| 35.5k| auto tail_size = size - tail_off; 584| 35.5k| auto new_tail = 585| 35.5k| make_leaf_sub_pos(tail, tail_size) 586| 35.5k| .visit(update_visitor{}, idx - tail_off, fn); 587| 35.5k| return {size, shift, root->inc(), new_tail}; 588| 81.6k| } else { 589| 81.6k| auto new_root = visit_maybe_relaxed_sub( 590| 81.6k| root, shift, tail_off, update_visitor{}, idx, fn); 591| 81.6k| return {size, shift, new_root, tail->inc()}; 592| 81.6k| } 593| 117k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4takeEm: 647| 24.4k| { 648| 24.4k| auto tail_off = tail_offset(); 649| 24.4k| if (new_size == 0) { ------------------ | Branch (649:13): [True: 3.58k, False: 20.8k] ------------------ 650| 3.58k| return {}; 651| 20.8k| } else if (new_size >= size) { ------------------ | Branch (651:20): [True: 1.09k, False: 19.7k] ------------------ 652| 1.09k| return *this; 653| 19.7k| } else if (new_size > tail_off) { ------------------ | Branch (653:20): [True: 1.90k, False: 17.8k] ------------------ 654| 1.90k| auto new_tail = node_t::copy_leaf(tail, new_size - tail_off); 655| 1.90k| return {new_size, shift, root->inc(), new_tail}; 656| 17.8k| } else { 657| 17.8k| using std::get; 658| 17.8k| auto l = new_size - 1; 659| 17.8k| auto v = slice_right_visitor(); 660| 17.8k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l); 661| 17.8k| auto new_shift = get<0>(r); 662| 17.8k| auto new_root = get<1>(r); 663| 17.8k| auto new_tail = get<3>(r); 664| 17.8k| if (new_root) { ------------------ | Branch (664:17): [True: 13.5k, False: 4.31k] ------------------ 665| 13.5k| IMMER_ASSERT_TAGGED(new_root->compute_shift() == get<0>(r)); ------------------ | | 68| 13.5k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (665:17): [True: 13.5k, False: 0] ------------------ 666| 13.5k| assert(new_root->check(new_shift, new_size - get<2>(r))); ------------------ | Branch (666:17): [True: 13.5k, False: 0] ------------------ 667| 13.5k| return {new_size, new_shift, new_root, new_tail}; 668| 13.5k| } else { 669| 4.31k| return {new_size, BL, empty_root(), new_tail}; 670| 4.31k| } 671| 17.8k| } 672| 24.4k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2ERKSB_: 151| 10.0k| : rrbtree{other.size, other.shift, other.root, other.tail} 152| 10.0k| { 153| 10.0k| inc(); 154| 10.0k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE3incEv: 187| 10.0k| { 188| 10.0k| root->inc(); 189| 10.0k| tail->inc(); 190| 10.0k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4dropEm: 711| 25.7k| { 712| 25.7k| if (elems == 0) { ------------------ | Branch (712:13): [True: 2.45k, False: 23.2k] ------------------ 713| 2.45k| return *this; 714| 23.2k| } else if (elems >= size) { ------------------ | Branch (714:20): [True: 1.87k, False: 21.3k] ------------------ 715| 1.87k| return {}; 716| 21.3k| } else if (elems == tail_offset()) { ------------------ | Branch (716:20): [True: 1.69k, False: 19.6k] ------------------ 717| 1.69k| return {size - elems, BL, empty_root(), tail->inc()}; 718| 19.6k| } else if (elems > tail_offset()) { ------------------ | Branch (718:20): [True: 1.82k, False: 17.8k] ------------------ 719| 1.82k| auto tail_off = tail_offset(); 720| 1.82k| auto new_tail = 721| 1.82k| node_t::copy_leaf(tail, elems - tail_off, size - tail_off); 722| 1.82k| return {size - elems, BL, empty_root(), new_tail}; 723| 17.8k| } else { 724| 17.8k| using std::get; 725| 17.8k| auto v = slice_left_visitor(); 726| 17.8k| auto r = 727| 17.8k| visit_maybe_relaxed_sub(root, shift, tail_offset(), v, elems); 728| 17.8k| auto new_root = get<1>(r); 729| 17.8k| auto new_shift = get<0>(r); 730| 17.8k| return {size - elems, new_shift, new_root, tail->inc()}; 731| 17.8k| } 732| 25.7k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8max_sizeEv: 54| 1.94M| { 55| 1.94M| auto S = sizeof(size_t) * 8; 56| 1.94M| return ((size_t{1} << BL) - std::min(size_t{BL}, size_t{2})) * 57| 1.94M| ipow((size_t{1} << B) - 2, (S - BL) / B); 58| 1.94M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6concatERKSB_: 735| 815k| { 736| 815k| assert(r.size + size <= max_size()); ------------------ | Branch (736:9): [True: 815k, False: 0] ------------------ 737| 815k| using std::get; 738| 815k| if (size == 0) ------------------ | Branch (738:13): [True: 2.55k, False: 812k] ------------------ 739| 2.55k| return r; 740| 812k| else if (r.size == 0) ------------------ | Branch (740:18): [True: 1.67k, False: 811k] ------------------ 741| 1.67k| return *this; 742| 811k| else if (r.tail_offset() == 0) { ------------------ | Branch (742:18): [True: 388k, False: 422k] ------------------ 743| | // just concat the tail, similar to push_back 744| 388k| auto tail_offst = tail_offset(); 745| 388k| auto tail_size = size - tail_offst; 746| 388k| if (tail_size == branches) { ------------------ | Branch (746:17): [True: 109k, False: 279k] ------------------ 747| 109k| auto new_root = 748| 109k| push_tail(root, shift, tail_offst, tail, tail_size); 749| 109k| tail->inc(); 750| 109k| return {size + r.size, 751| 109k| get<0>(new_root), 752| 109k| get<1>(new_root), 753| 109k| r.tail->inc()}; 754| 279k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (754:24): [True: 9.28k, False: 270k] ------------------ 755| 9.28k| auto new_tail = 756| 9.28k| node_t::copy_leaf(tail, tail_size, r.tail, r.size); 757| 9.28k| return {size + r.size, shift, root->inc(), new_tail}; 758| 270k| } else { 759| 270k| auto remaining = branches - tail_size; 760| 270k| auto add_tail = 761| 270k| node_t::copy_leaf(tail, tail_size, r.tail, remaining); 762| 270k| IMMER_TRY { ------------------ | | 49| 270k|#define IMMER_TRY try ------------------ 763| 270k| auto new_tail = 764| 270k| node_t::copy_leaf(r.tail, remaining, r.size); 765| 270k| IMMER_TRY { ------------------ | | 49| 270k|#define IMMER_TRY try ------------------ 766| 270k| auto new_root = push_tail( 767| 270k| root, shift, tail_offst, add_tail, branches); 768| 270k| return {size + r.size, 769| 270k| get<0>(new_root), 770| 270k| get<1>(new_root), 771| 270k| new_tail}; 772| 270k| } 773| 270k| 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| 270k| } 778| 270k| IMMER_CATCH (...) { 779| 0| node_t::delete_leaf(add_tail, branches); 780| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 781| 0| } 782| 270k| } 783| 422k| } else if (tail_offset() == 0) { ------------------ | Branch (783:20): [True: 3.33k, False: 418k] ------------------ 784| 3.33k| auto tail_offst = tail_offset(); 785| 3.33k| auto tail_size = size - tail_offst; 786| 3.33k| auto concated = 787| 3.33k| concat_trees(tail, tail_size, r.root, r.shift, r.tail_offset()); 788| 3.33k| auto new_shift = concated.shift(); 789| 3.33k| auto new_root = concated.node(); 790| 3.33k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 3.33k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (790:13): [True: 3.33k, False: 0] ------------------ 791| 3.33k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (791:13): [True: 3.33k, False: 0] ------------------ 792| 3.33k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 793| 418k| } else { 794| 418k| auto tail_offst = tail_offset(); 795| 418k| auto tail_size = size - tail_offst; 796| 418k| auto concated = concat_trees(root, 797| 418k| shift, 798| 418k| tail_offst, 799| 418k| tail, 800| 418k| tail_size, 801| 418k| r.root, 802| 418k| r.shift, 803| 418k| r.tail_offset()); 804| 418k| auto new_shift = concated.shift(); 805| 418k| auto new_root = concated.node(); 806| 418k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 418k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (806:13): [True: 418k, False: 0] ------------------ 807| 418k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (807:13): [True: 418k, False: 0] ------------------ 808| 418k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 809| 418k| } 810| 815k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13push_back_mutENS9_5applyIS6_E4type4editEi: 478| 32.5k| { 479| 32.5k| auto ts = tail_size(); 480| 32.5k| if (ts < branches) { ------------------ | Branch (480:13): [True: 19.3k, False: 13.1k] ------------------ 481| 19.3k| ensure_mutable_tail(e, ts); 482| 19.3k| new (&tail->leaf()[ts]) T(std::move(value)); 483| 19.3k| } else { 484| 13.1k| using std::get; 485| 13.1k| auto new_tail = node_t::make_leaf_e(e, std::move(value)); 486| 13.1k| auto tail_off = tail_offset(); 487| 13.1k| IMMER_TRY { ------------------ | | 49| 13.1k|#define IMMER_TRY try ------------------ 488| 13.1k| push_tail_mut(e, tail_off, tail, ts); 489| 13.1k| tail = new_tail; 490| 13.1k| } 491| 13.1k| IMMER_CATCH (...) { 492| 0| node_t::delete_leaf(new_tail, 1u); 493| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 494| 0| } 495| 13.1k| } 496| 32.5k| ++size; 497| 32.5k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE19ensure_mutable_tailENS9_5applyIS6_E4type4editEj: 469| 167k| { 470| 167k| if (!tail->can_mutate(e)) { ------------------ | Branch (470:13): [True: 5.15k, False: 162k] ------------------ 471| 5.15k| auto new_tail = node_t::copy_leaf_e(e, tail, n); 472| 5.15k| dec_leaf(tail, n); 473| 5.15k| tail = new_tail; 474| 5.15k| } 475| 167k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13push_tail_mutENS9_5applyIS6_E4type4editEmPNS1_4nodeIiSA_Lj2ELj2EEEj: 417| 185k| { 418| 185k| if (auto r = root->relaxed()) { ------------------ | Branch (418:18): [True: 41.4k, False: 143k] ------------------ 419| 41.4k| auto new_root = 420| 41.4k| make_relaxed_pos(root, shift, r) 421| 41.4k| .visit(push_tail_mut_visitor{}, e, tail, tail_size); 422| 41.4k| if (new_root) { ------------------ | Branch (422:17): [True: 40.4k, False: 965] ------------------ 423| 40.4k| root = new_root; 424| 40.4k| } else { 425| 965| auto new_root = node_t::make_inner_r_e(e); 426| 965| IMMER_TRY { ------------------ | | 49| 965|#define IMMER_TRY try ------------------ 427| 965| auto new_path = node_t::make_path_e(e, shift, tail); 428| 965| new_root->inner()[0] = root; 429| 965| new_root->inner()[1] = new_path; 430| 965| new_root->relaxed()->d.sizes[0] = tail_off; 431| 965| new_root->relaxed()->d.sizes[1] = tail_off + tail_size; 432| 965| assert(tail_off); ------------------ | Branch (432:21): [True: 965, False: 0] ------------------ 433| 965| assert(tail_size); ------------------ | Branch (433:21): [True: 965, False: 0] ------------------ 434| 965| new_root->relaxed()->d.count = 2u; 435| 965| root = new_root; 436| 965| shift += B; 437| 965| } 438| 965| 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| 965| } 443| 143k| } else if (tail_off == size_t{branches} << shift) { ------------------ | Branch (443:20): [True: 2.30k, False: 141k] ------------------ 444| 2.30k| auto new_root = node_t::make_inner_e(e); 445| 2.30k| IMMER_TRY { ------------------ | | 49| 2.30k|#define IMMER_TRY try ------------------ 446| 2.30k| auto new_path = node_t::make_path_e(e, shift, tail); 447| 2.30k| new_root->inner()[0] = root; 448| 2.30k| new_root->inner()[1] = new_path; 449| 2.30k| root = new_root; 450| 2.30k| shift += B; 451| 2.30k| } 452| 2.30k| IMMER_CATCH (...) { 453| 0| node_t::delete_inner_e(new_root); 454| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 455| 0| } 456| 141k| } else if (tail_off) { ------------------ | Branch (456:20): [True: 139k, False: 2.50k] ------------------ 457| 139k| auto new_root = 458| 139k| make_regular_sub_pos(root, shift, tail_off) 459| 139k| .visit(push_tail_mut_visitor{}, e, tail); 460| 139k| root = new_root; 461| 139k| } else { 462| 2.50k| auto new_root = node_t::make_path_e(e, shift, tail); 463| 2.50k| dec_empty_regular(root); 464| 2.50k| root = new_root; 465| 2.50k| } 466| 185k| } 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| 53.2k| { 574| 53.2k| auto& elem = get_mut(e, idx); 575| 53.2k| elem = std::forward(fn)(std::move(elem)); 576| 53.2k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7get_mutENS9_5applyIS6_E4type4editEm: 539| 53.2k| { 540| 53.2k| auto tail_off = tail_offset(); 541| 53.2k| if (idx >= tail_off) { ------------------ | Branch (541:13): [True: 25.0k, False: 28.2k] ------------------ 542| 25.0k| ensure_mutable_tail(e, size - tail_off); 543| 25.0k| return tail->leaf()[(idx - tail_off) & mask]; 544| 28.2k| } else { 545| 28.2k| return visit_maybe_relaxed_sub(root, 546| 28.2k| shift, 547| 28.2k| tail_off, 548| 28.2k| get_mut_visitor{}, 549| 28.2k| idx, 550| 28.2k| e, 551| 28.2k| &root); 552| 28.2k| } 553| 53.2k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8take_mutENS9_5applyIS6_E4type4editEm: 606| 36.8k| { 607| 36.8k| auto tail_off = tail_offset(); 608| 36.8k| if (new_size == 0) { ------------------ | Branch (608:13): [True: 569, False: 36.2k] ------------------ 609| 569| *this = {}; 610| 36.2k| } else if (new_size >= size) { ------------------ | Branch (610:20): [True: 1.02k, False: 35.2k] ------------------ 611| 1.02k| return; 612| 35.2k| } else if (new_size > tail_off) { ------------------ | Branch (612:20): [True: 750, False: 34.4k] ------------------ 613| 750| auto ts = size - tail_off; 614| 750| auto newts = new_size - tail_off; 615| 750| if (tail->can_mutate(e)) { ------------------ | Branch (615:17): [True: 441, False: 309] ------------------ 616| 441| detail::destroy_n(tail->leaf() + newts, ts - newts); 617| 441| } else { 618| 309| auto new_tail = node_t::copy_leaf_e(e, tail, newts); 619| 309| dec_leaf(tail, ts); 620| 309| tail = new_tail; 621| 309| } 622| 750| size = new_size; 623| 750| return; 624| 34.4k| } else { 625| 34.4k| using std::get; 626| 34.4k| auto l = new_size - 1; 627| 34.4k| auto v = slice_right_mut_visitor(); 628| 34.4k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l, e); 629| 34.4k| auto new_shift = get<0>(r); 630| 34.4k| auto new_root = get<1>(r); 631| 34.4k| auto new_tail = get<3>(r); 632| 34.4k| if (new_root) { ------------------ | Branch (632:17): [True: 28.4k, False: 6.02k] ------------------ 633| 28.4k| root = new_root; 634| 28.4k| shift = new_shift; 635| 28.4k| } else { 636| 6.02k| root = empty_root(); 637| 6.02k| shift = BL; 638| 6.02k| } 639| 34.4k| dec_leaf(tail, size - tail_off); 640| 34.4k| size = new_size; 641| 34.4k| tail = new_tail; 642| 34.4k| return; 643| 34.4k| } 644| 36.8k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8drop_mutENS9_5applyIS6_E4type4editEm: 675| 44.7k| { 676| 44.7k| using std::get; 677| 44.7k| auto tail_off = tail_offset(); 678| 44.7k| if (elems == 0) { ------------------ | Branch (678:13): [True: 2.14k, False: 42.6k] ------------------ 679| 2.14k| return; 680| 42.6k| } else if (elems >= size) { ------------------ | Branch (680:20): [True: 277, False: 42.3k] ------------------ 681| 277| *this = {}; 682| 42.3k| } else if (elems == tail_off) { ------------------ | Branch (682:20): [True: 297, False: 42.0k] ------------------ 683| 297| dec_inner(root, shift, tail_off); 684| 297| shift = BL; 685| 297| root = empty_root(); 686| 297| size -= elems; 687| 297| return; 688| 42.0k| } else if (elems > tail_off) { ------------------ | Branch (688:20): [True: 707, False: 41.3k] ------------------ 689| 707| auto v = slice_left_mut_visitor(); 690| 707| tail = get<1>(make_leaf_sub_pos(tail, size - tail_off) 691| 707| .visit(v, elems - tail_off, e)); 692| 707| if (tail_off) { ------------------ | Branch (692:17): [True: 265, False: 442] ------------------ 693| 265| dec_inner(root, shift, tail_off); 694| 265| shift = BL; 695| 265| root = empty_root(); 696| 265| } 697| 707| size -= elems; 698| 707| return; 699| 41.3k| } else { 700| 41.3k| auto v = slice_left_mut_visitor(); 701| 41.3k| auto r = 702| 41.3k| visit_maybe_relaxed_sub(root, shift, tail_off, v, elems, e); 703| 41.3k| shift = get<0>(r); 704| 41.3k| root = get<1>(r); 705| 41.3k| size -= elems; 706| 41.3k| return; 707| 41.3k| } 708| 44.7k| } _ZN5immer6detail4rbts12concat_mut_lERNS1_7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS9_5applyIS6_E4type4editERKSB_: 816| 238k| { 817| 238k| assert(&l != &r); ------------------ | Branch (817:9): [True: 238k, False: 0] ------------------ 818| 238k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (818:9): [True: 238k, False: 0] ------------------ 819| 238k| using std::get; 820| 238k| if (l.size == 0) ------------------ | Branch (820:13): [True: 688, False: 238k] ------------------ 821| 688| l = r; 822| 238k| else if (r.size == 0) ------------------ | Branch (822:18): [True: 620, False: 237k] ------------------ 823| 620| return; 824| 237k| else if (r.tail_offset() == 0) { ------------------ | Branch (824:18): [True: 169k, False: 67.6k] ------------------ 825| | // just concat the tail, similar to push_back 826| 169k| auto tail_offst = l.tail_offset(); 827| 169k| auto tail_size = l.size - tail_offst; 828| 169k| if (tail_size == branches) { ------------------ | Branch (828:17): [True: 51.1k, False: 118k] ------------------ 829| 51.1k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 830| 51.1k| l.tail = r.tail->inc(); 831| 51.1k| l.size += r.size; 832| 51.1k| return; 833| 118k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (833:24): [True: 1.01k, False: 117k] ------------------ 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| 117k| } else { 841| 117k| auto remaining = branches - tail_size; 842| 117k| l.ensure_mutable_tail(el, tail_size); 843| 117k| detail::uninitialized_copy(r.tail->leaf(), 844| 117k| r.tail->leaf() + remaining, 845| 117k| l.tail->leaf() + tail_size); 846| 117k| IMMER_TRY { ------------------ | | 49| 117k|#define IMMER_TRY try ------------------ 847| 117k| auto new_tail = 848| 117k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 849| 117k| IMMER_TRY { ------------------ | | 49| 117k|#define IMMER_TRY try ------------------ 850| 117k| l.push_tail_mut(el, tail_offst, l.tail, branches); 851| 117k| l.tail = new_tail; 852| 117k| l.size += r.size; 853| 117k| return; 854| 117k| } 855| 117k| 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| 117k| } 860| 117k| 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| 117k| } 865| 169k| } else if (l.tail_offset() == 0) { ------------------ | Branch (865:20): [True: 473, False: 67.2k] ------------------ 866| 473| if (supports_transient_concat) { ------------------ | Branch (866:17): [Folded, False: 473] ------------------ 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| 473| } else { 886| 473| auto tail_offst = l.tail_offset(); 887| 473| auto tail_size = l.size - tail_offst; 888| 473| auto concated = concat_trees( 889| 473| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 890| 473| l = {l.size + r.size, 891| 473| concated.shift(), 892| 473| concated.node(), 893| 473| r.tail->inc()}; 894| 473| assert(l.check_tree()); ------------------ | Branch (894:17): [True: 473, False: 0] ------------------ 895| 473| return; 896| 473| } 897| 67.2k| } else { 898| 67.2k| if (supports_transient_concat) { ------------------ | Branch (898:17): [Folded, False: 67.2k] ------------------ 899| 0| auto tail_offst = l.tail_offset(); 900| 0| auto tail_size = l.size - tail_offst; 901| 0| assert(l.check_tree()); ------------------ | Branch (901:17): [True: 0, False: 0] ------------------ 902| 0| assert(r.check_tree()); ------------------ | Branch (902:17): [True: 0, False: 0] ------------------ 903| 0| auto concated = 904| 0| concat_trees_mut(el, 905| 0| el, 906| 0| l.root, 907| 0| l.shift, 908| 0| tail_offst, 909| 0| l.tail, 910| 0| tail_size, 911| 0| MemoryPolicy::transience_t::noone, 912| 0| r.root, 913| 0| r.shift, 914| 0| r.tail_offset()); 915| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 68| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (915:17): [True: 0, False: 0] ------------------ 916| 0| concated.node()->compute_shift()); 917| 0| l.size += r.size; 918| 0| l.shift = concated.shift(); 919| 0| l.root = concated.node(); 920| 0| l.tail = r.tail; 921| 0| assert(l.check_tree()); ------------------ | Branch (921:17): [True: 0, False: 0] ------------------ 922| 67.2k| } else { 923| 67.2k| auto tail_offst = l.tail_offset(); 924| 67.2k| auto tail_size = l.size - tail_offst; 925| 67.2k| auto concated = concat_trees(l.root, 926| 67.2k| l.shift, 927| 67.2k| tail_offst, 928| 67.2k| l.tail, 929| 67.2k| tail_size, 930| 67.2k| r.root, 931| 67.2k| r.shift, 932| 67.2k| r.tail_offset()); 933| 67.2k| l = {l.size + r.size, 934| 67.2k| concated.shift(), 935| 67.2k| concated.node(), 936| 67.2k| r.tail->inc()}; 937| 67.2k| } 938| 67.2k| } 939| 238k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEaSERKSB_: 163| 2.23k| { 164| 2.23k| auto next{other}; 165| 2.23k| swap(*this, next); 166| 2.23k| return *this; 167| 2.23k| } _ZN5immer6detail4rbts12concat_mut_rERKNS1_7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERSB_NS9_5applyIS6_E4type4editE: 942| 3.47k| { 943| 3.47k| assert(&l != &r); ------------------ | Branch (943:9): [True: 3.47k, False: 0] ------------------ 944| 3.47k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (944:9): [True: 3.47k, False: 0] ------------------ 945| 3.47k| using std::get; 946| 3.47k| if (r.size == 0) ------------------ | Branch (946:13): [True: 292, False: 3.18k] ------------------ 947| 292| r = std::move(l); 948| 3.18k| else if (l.size == 0) ------------------ | Branch (948:18): [True: 245, False: 2.94k] ------------------ 949| 245| return; 950| 2.94k| else if (r.tail_offset() == 0) { ------------------ | Branch (950:18): [True: 857, False: 2.08k] ------------------ 951| | // just concat the tail, similar to push_back 952| 857| auto tail_offst = l.tail_offset(); 953| 857| auto tail_size = l.size - tail_offst; 954| 857| if (tail_size == branches) { ------------------ | Branch (954:17): [True: 161, False: 696] ------------------ 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| 161| auto res = 959| 161| l.push_tail(l.root, l.shift, tail_offst, l.tail, tail_size); 960| 161| l.tail->inc(); // note: leak if mutably concatenated 961| | // with itself, but this is forbidden 962| | // by the interface 963| 161| r = {l.size + r.size, get<0>(res), get<1>(res), r.tail->inc()}; 964| 161| return; 965| 696| } else if (tail_size + r.size <= branches) { ------------------ | Branch (965:24): [True: 424, False: 272] ------------------ 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| 424| auto new_tail = 974| 424| node_t::copy_leaf(l.tail, tail_size, r.tail, r.size); 975| 424| r = {l.size + r.size, l.shift, l.root->inc(), new_tail}; 976| 424| return; 977| 424| } else { 978| | // like the immutable version 979| 272| auto remaining = branches - tail_size; 980| 272| auto add_tail = node_t::copy_leaf_e( 981| 272| er, l.tail, tail_size, r.tail, remaining); 982| 272| IMMER_TRY { ------------------ | | 49| 272|#define IMMER_TRY try ------------------ 983| 272| auto new_tail = 984| 272| node_t::copy_leaf_e(er, r.tail, remaining, r.size); 985| 272| IMMER_TRY { ------------------ | | 49| 272|#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| 272| auto new_root = l.push_tail(l.root, 990| 272| l.shift, 991| 272| tail_offst, 992| 272| add_tail, 993| 272| branches); 994| 272| r = {l.size + r.size, 995| 272| get<0>(new_root), 996| 272| get<1>(new_root), 997| 272| new_tail}; 998| 272| return; 999| 272| } 1000| 272| 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| 272| } 1005| 272| IMMER_CATCH (...) { 1006| 0| node_t::delete_leaf(add_tail, branches); 1007| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1008| 0| } 1009| 272| } 1010| 2.08k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1010:20): [True: 634, False: 1.45k] ------------------ 1011| 634| if (supports_transient_concat) { ------------------ | Branch (1011:17): [Folded, False: 634] ------------------ 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| 634| } else { 1030| 634| auto tail_offst = l.tail_offset(); 1031| 634| auto tail_size = l.size - tail_offst; 1032| 634| auto concated = concat_trees( 1033| 634| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1034| 634| r = {l.size + r.size, 1035| 634| concated.shift(), 1036| 634| concated.node(), 1037| 634| r.tail->inc()}; 1038| 634| return; 1039| 634| } 1040| 1.45k| } else { 1041| 1.45k| if (supports_transient_concat) { ------------------ | Branch (1041:17): [Folded, False: 1.45k] ------------------ 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.45k| } else { 1064| 1.45k| auto tail_offst = l.tail_offset(); 1065| 1.45k| auto tail_size = l.size - tail_offst; 1066| 1.45k| auto concated = concat_trees(l.root, 1067| 1.45k| l.shift, 1068| 1.45k| tail_offst, 1069| 1.45k| l.tail, 1070| 1.45k| tail_size, 1071| 1.45k| r.root, 1072| 1.45k| r.shift, 1073| 1.45k| r.tail_offset()); 1074| 1.45k| r = {l.size + r.size, 1075| 1.45k| concated.shift(), 1076| 1.45k| concated.node(), 1077| 1.45k| r.tail->inc()}; 1078| 1.45k| return; 1079| 1.45k| } 1080| 1.45k| } 1081| 3.47k| } _ZN5immer6detail4rbts15concat_mut_lr_lERNS1_7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS9_5applyIS6_E4type4editESC_SG_: 1084| 24.0k| { 1085| 24.0k| assert(&l != &r); ------------------ | Branch (1085:9): [True: 24.0k, False: 0] ------------------ 1086| 24.0k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (1086:9): [True: 24.0k, False: 0] ------------------ 1087| 24.0k| using std::get; 1088| 24.0k| if (l.size == 0) ------------------ | Branch (1088:13): [True: 1.25k, False: 22.7k] ------------------ 1089| 1.25k| l = r; 1090| 22.7k| else if (r.size == 0) ------------------ | Branch (1090:18): [True: 1.22k, False: 21.5k] ------------------ 1091| 1.22k| return; 1092| 21.5k| else if (r.tail_offset() == 0) { ------------------ | Branch (1092:18): [True: 5.02k, False: 16.5k] ------------------ 1093| | // just concat the tail, similar to push_back 1094| 5.02k| auto tail_offst = l.tail_offset(); 1095| 5.02k| auto tail_size = l.size - tail_offst; 1096| 5.02k| if (tail_size == branches) { ------------------ | Branch (1096:17): [True: 964, False: 4.05k] ------------------ 1097| 964| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 1098| 964| l.tail = r.tail->inc(); 1099| 964| l.size += r.size; 1100| 964| return; 1101| 4.05k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (1101:24): [True: 1.91k, False: 2.13k] ------------------ 1102| 1.91k| l.ensure_mutable_tail(el, tail_size); 1103| 1.91k| if (r.tail->can_mutate(er)) ------------------ | Branch (1103:21): [True: 691, False: 1.22k] ------------------ 1104| 691| detail::uninitialized_move(r.tail->leaf(), 1105| 691| r.tail->leaf() + r.size, 1106| 691| l.tail->leaf() + tail_size); 1107| 1.22k| else 1108| 1.22k| detail::uninitialized_copy(r.tail->leaf(), 1109| 1.22k| r.tail->leaf() + r.size, 1110| 1.22k| l.tail->leaf() + tail_size); 1111| 1.91k| l.size += r.size; 1112| 1.91k| return; 1113| 2.13k| } else { 1114| 2.13k| auto remaining = branches - tail_size; 1115| 2.13k| l.ensure_mutable_tail(el, tail_size); 1116| 2.13k| if (r.tail->can_mutate(er)) ------------------ | Branch (1116:21): [True: 763, False: 1.37k] ------------------ 1117| 763| detail::uninitialized_move(r.tail->leaf(), 1118| 763| r.tail->leaf() + remaining, 1119| 763| l.tail->leaf() + tail_size); 1120| 1.37k| else 1121| 1.37k| detail::uninitialized_copy(r.tail->leaf(), 1122| 1.37k| r.tail->leaf() + remaining, 1123| 1.37k| l.tail->leaf() + tail_size); 1124| 2.13k| IMMER_TRY { ------------------ | | 49| 2.13k|#define IMMER_TRY try ------------------ 1125| 2.13k| auto new_tail = 1126| 2.13k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 1127| 2.13k| IMMER_TRY { ------------------ | | 49| 2.13k|#define IMMER_TRY try ------------------ 1128| 2.13k| l.push_tail_mut(el, tail_offst, l.tail, branches); 1129| 2.13k| l.tail = new_tail; 1130| 2.13k| l.size += r.size; 1131| 2.13k| return; 1132| 2.13k| } 1133| 2.13k| 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.13k| } 1138| 2.13k| 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.13k| } 1143| 16.5k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1143:20): [True: 3.19k, False: 13.3k] ------------------ 1144| 3.19k| if (supports_transient_concat) { ------------------ | Branch (1144:17): [Folded, False: 3.19k] ------------------ 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.19k| } else { 1165| 3.19k| auto tail_offst = l.tail_offset(); 1166| 3.19k| auto tail_size = l.size - tail_offst; 1167| 3.19k| auto concated = concat_trees( 1168| 3.19k| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1169| 3.19k| l = {l.size + r.size, 1170| 3.19k| concated.shift(), 1171| 3.19k| concated.node(), 1172| 3.19k| r.tail->inc()}; 1173| 3.19k| return; 1174| 3.19k| } 1175| 13.3k| } else { 1176| 13.3k| if (supports_transient_concat) { ------------------ | Branch (1176:17): [Folded, False: 13.3k] ------------------ 1177| 0| auto tail_offst = l.tail_offset(); 1178| 0| auto tail_size = l.size - tail_offst; 1179| 0| auto concated = concat_trees_mut(el, 1180| 0| el, 1181| 0| l.root, 1182| 0| l.shift, 1183| 0| tail_offst, 1184| 0| l.tail, 1185| 0| tail_size, 1186| 0| er, 1187| 0| r.root, 1188| 0| r.shift, 1189| 0| r.tail_offset()); 1190| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 68| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (1190:17): [True: 0, False: 0] ------------------ 1191| 0| concated.node()->compute_shift()); 1192| 0| l.size += r.size; 1193| 0| l.shift = concated.shift(); 1194| 0| l.root = concated.node(); 1195| 0| l.tail = r.tail; 1196| 0| assert(l.check_tree()); ------------------ | Branch (1196:17): [True: 0, False: 0] ------------------ 1197| 0| r.hard_reset(); 1198| 0| return; 1199| 13.3k| } else { 1200| 13.3k| auto tail_offst = l.tail_offset(); 1201| 13.3k| auto tail_size = l.size - tail_offst; 1202| 13.3k| auto concated = concat_trees(l.root, 1203| 13.3k| l.shift, 1204| 13.3k| tail_offst, 1205| 13.3k| l.tail, 1206| 13.3k| tail_size, 1207| 13.3k| r.root, 1208| 13.3k| r.shift, 1209| 13.3k| r.tail_offset()); 1210| 13.3k| l = {l.size + r.size, 1211| 13.3k| concated.shift(), 1212| 13.3k| concated.node(), 1213| 13.3k| r.tail->inc()}; 1214| 13.3k| return; 1215| 13.3k| } 1216| 13.3k| } 1217| 24.0k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6equalsERKSB_: 315| 31.7k| { 316| 31.7k| using iter_t = rrbtree_iterator; 317| 31.7k| if (size != other.size) ------------------ | Branch (317:13): [True: 10.7k, False: 20.9k] ------------------ 318| 10.7k| return false; 319| 20.9k| if (size == 0) ------------------ | Branch (319:13): [True: 210, False: 20.7k] ------------------ 320| 210| return true; 321| 20.7k| auto tail_off = tail_offset(); 322| 20.7k| auto tail_off_other = other.tail_offset(); 323| | // compare trees 324| 20.7k| if (tail_off > 0 && tail_off_other > 0) { ------------------ | Branch (324:13): [True: 19.8k, False: 916] | Branch (324:29): [True: 19.6k, False: 198] ------------------ 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| 19.6k| if (other.shift >= shift) { ------------------ | Branch (328:17): [True: 18.8k, False: 749] ------------------ 329| 18.8k| if (!visit_maybe_relaxed_sub(other.root, ------------------ | Branch (329:21): [True: 8.90k, False: 9.98k] ------------------ 330| 18.8k| other.shift, 331| 18.8k| tail_off_other, 332| 18.8k| equals_visitor::rrb{}, 333| 18.8k| iter_t{other}, 334| 18.8k| root, 335| 18.8k| shift, 336| 18.8k| tail_off)) 337| 8.90k| return false; 338| 18.8k| } else { 339| 749| if (!visit_maybe_relaxed_sub(root, ------------------ | Branch (339:21): [True: 392, False: 357] ------------------ 340| 749| shift, 341| 749| tail_off, 342| 749| equals_visitor::rrb{}, 343| 749| iter_t{*this}, 344| 749| other.root, 345| 749| other.shift, 346| 749| tail_off_other)) 347| 392| return false; 348| 749| } 349| 19.6k| } 350| 11.4k| return tail_off == tail_off_other ------------------ | Branch (350:16): [True: 7.58k, False: 3.86k] ------------------ 351| 11.4k| ? make_leaf_sub_pos(tail, tail_size()) 352| 7.58k| .visit(equals_visitor{}, other.tail) 353| 11.4k| : tail_off > tail_off_other ------------------ | Branch (353:18): [True: 1.62k, False: 2.24k] ------------------ 354| 3.86k| ? std::equal(tail->leaf(), 355| 1.62k| tail->leaf() + (size - tail_off), 356| 1.62k| other.tail->leaf() + 357| 1.62k| (tail_off - tail_off_other)) 358| | /* otherwise */ 359| 3.86k| : std::equal(tail->leaf(), 360| 2.24k| tail->leaf() + (size - tail_off), 361| 2.24k| iter_t{other} + tail_off); 362| 20.7k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10region_forEm: 524| 1.28M| { 525| 1.28M| using std::get; 526| 1.28M| auto tail_off = tail_offset(); 527| 1.28M| if (idx >= tail_off) { ------------------ | Branch (527:13): [True: 4.01k, False: 1.28M] ------------------ 528| 4.01k| return std::make_tuple(tail->leaf(), tail_off, size); 529| 1.28M| } else { 530| 1.28M| auto subs = visit_maybe_relaxed_sub( 531| 1.28M| root, shift, tail_off, region_for_visitor(), idx); 532| 1.28M| auto first = idx - get<1>(subs); 533| 1.28M| auto end = first + get<2>(subs); 534| 1.28M| return std::make_tuple(get<0>(subs), first, end); 535| 1.28M| } 536| 1.28M| } _ZNK5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11dereferenceEv: 90| 5.21M| { 91| 5.21M| using std::get; 92| 5.21M| if (i_ < get<1>(curr_) || i_ >= get<2>(curr_)) ------------------ | Branch (92:13): [True: 37.8k, False: 5.17M] | Branch (92:35): [True: 1.24M, False: 3.92M] ------------------ 93| 1.28M| curr_ = v_->region_for(i_); 94| 5.21M| return get<0>(curr_)[i_ - get<1>(curr_)]; 95| 5.21M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7advanceEl: 74| 208k| { 75| 208k| using std::get; 76| 208k| assert(n <= 0 || i_ + static_cast(n) <= v_->size); ------------------ | Branch (76:9): [True: 413, False: 208k] | Branch (76:9): [True: 208k, False: 0] | Branch (76:9): [True: 208k, False: 0] ------------------ 77| 208k| assert(n >= 0 || static_cast(-n) <= i_); ------------------ | Branch (77:9): [True: 208k, False: 0] | Branch (77:9): [True: 0, False: 0] | Branch (77:9): [True: 208k, False: 0] ------------------ 78| 208k| i_ += n; 79| 208k| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9incrementEv: 60| 3.94M| { 61| 3.94M| using std::get; 62| 3.94M| assert(i_ < v_->size); ------------------ | Branch (62:9): [True: 3.94M, False: 0] ------------------ 63| 3.94M| ++i_; 64| 3.94M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2ERKNS1_7rrbtreeIiSA_Lj2ELj2EEE: 39| 21.8k| : v_{&v} 40| 21.8k| , i_{0} 41| 21.8k| , curr_{nullptr, ~size_t{}, ~size_t{}} 42| 21.8k| { 43| 21.8k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERmEEEDcDpOT_: 31| 15.7k| { 32| 15.7k| return Deriv::visit_inner(std::forward(args)...); 33| 15.7k| } _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| 54.4k| { 32| 54.4k| return Deriv::visit_inner(std::forward(args)...); 33| 54.4k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EEEE13visit_regularIJRNS1_15regular_sub_posISD_EERmEEEDcDpOT_: 37| 2.23k| { 38| 2.23k| return Deriv::visit_inner(std::forward(args)...); 39| 2.23k| } _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.18k| { 38| 5.18k| return Deriv::visit_inner(std::forward(args)...); 39| 5.18k| } _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.70k| { 38| 6.70k| return Deriv::visit_inner(std::forward(args)...); 39| 6.70k| } _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.50k| { 38| 1.50k| return Deriv::visit_inner(std::forward(args)...); 39| 1.50k| } _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.69k| { 38| 2.69k| return Deriv::visit_inner(std::forward(args)...); 39| 2.69k| } _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.63k| { 38| 7.63k| return Deriv::visit_inner(std::forward(args)...); 39| 7.63k| } _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.63k| { 44| 7.63k| return Deriv::visit_node(std::forward(args)...); 45| 7.63k| } _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.34k| { 32| 5.34k| return Deriv::visit_inner(std::forward(args)...); 33| 5.34k| } _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.34k| { 44| 5.34k| return Deriv::visit_node(std::forward(args)...); 45| 5.34k| } _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.34M| { 50| 2.34M| return Deriv::visit_node(std::forward(args)...); 51| 2.34M| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_21concat_rebalance_planILj2ELj2EEEEEEDcDpOT_: 31| 20.0M| { 32| 20.0M| return Deriv::visit_inner(std::forward(args)...); 33| 20.0M| } _ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE11visit_innerIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_21concat_rebalance_planILj2ELj2EEEEEEDcDpOT_: 43| 20.0M| { 44| 20.0M| return Deriv::visit_node(std::forward(args)...); 45| 20.0M| } _ZN5immer6detail4rbts12visitor_baseINS1_21concat_merger_visitorEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_13concat_mergerISG_EEEEEDcDpOT_: 31| 20.0M| { 32| 20.0M| return Deriv::visit_inner(std::forward(args)...); 33| 20.0M| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_: 31| 17.7k| { 32| 17.7k| return Deriv::visit_inner(std::forward(args)...); 33| 17.7k| } _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| 383| { 38| 383| return Deriv::visit_inner(std::forward(args)...); 39| 383| } _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.21k| { 38| 1.21k| return Deriv::visit_inner(std::forward(args)...); 39| 1.21k| } _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.06M| { 50| 1.06M| return Deriv::visit_node(std::forward(args)...); 51| 1.06M| } _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| 769k| { 38| 769k| return Deriv::visit_inner(std::forward(args)...); 39| 769k| } _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| 769k| { 44| 769k| return Deriv::visit_node(std::forward(args)...); 45| 769k| } _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| 769k| { 38| 769k| return Deriv::visit_inner(std::forward(args)...); 39| 769k| } _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| 666k| { 38| 666k| return Deriv::visit_inner(std::forward(args)...); 39| 666k| } _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| 666k| { 44| 666k| return Deriv::visit_node(std::forward(args)...); 45| 666k| } _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| 666k| { 38| 666k| return Deriv::visit_inner(std::forward(args)...); 39| 666k| } _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.28k| { 38| 2.28k| return Deriv::visit_inner(std::forward(args)...); 39| 2.28k| } _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.28k| { 44| 2.28k| return Deriv::visit_node(std::forward(args)...); 45| 2.28k| } _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| 486k| { 32| 486k| return Deriv::visit_inner(std::forward(args)...); 33| 486k| } _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| 486k| { 44| 486k| return Deriv::visit_node(std::forward(args)...); 45| 486k| } _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| 463k| { 32| 463k| return Deriv::visit_inner(std::forward(args)...); 33| 463k| } _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| 463k| { 44| 463k| return Deriv::visit_node(std::forward(args)...); 45| 463k| } _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.08M| { 32| 2.08M| return Deriv::visit_inner(std::forward(args)...); 33| 2.08M| } _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.85k| { 38| 5.85k| return Deriv::visit_inner(std::forward(args)...); 39| 5.85k| } _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| 647k| { 32| 647k| return Deriv::visit_inner(std::forward(args)...); 33| 647k| } _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| 113k| { 38| 113k| return Deriv::visit_inner(std::forward(args)...); 39| 113k| } _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.16k| { 38| 1.16k| return Deriv::visit_inner(std::forward(args)...); 39| 1.16k| } _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| 130k| { 38| 130k| return Deriv::visit_inner(std::forward(args)...); 39| 130k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EERNS1_8full_posISD_EEEEEDcDpOT_: 37| 63.8k| { 38| 63.8k| return Deriv::visit_inner(std::forward(args)...); 39| 63.8k| } _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| 65.7k| { 38| 65.7k| return Deriv::visit_inner(std::forward(args)...); 39| 65.7k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EERNS1_11relaxed_posISD_EEEEEDcDpOT_: 37| 749k| { 38| 749k| return Deriv::visit_inner(std::forward(args)...); 39| 749k| } _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.74M| { 32| 1.74M| return Deriv::visit_inner(std::forward(args)...); 33| 1.74M| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 4.59k| { 38| 4.59k| return Deriv::visit_inner(std::forward(args)...); 39| 4.59k| } _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| 124k| { 32| 124k| return Deriv::visit_inner(std::forward(args)...); 33| 124k| } _ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_8full_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 6.09k| { 38| 6.09k| return Deriv::visit_inner(std::forward(args)...); 39| 6.09k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EERNS1_8full_posISD_EEEEEDcDpOT_: 31| 2.02k| { 32| 2.02k| return Deriv::visit_inner(std::forward(args)...); 33| 2.02k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EERNS1_15regular_sub_posISD_EEEEEDcDpOT_: 31| 3.09k| { 32| 3.09k| return Deriv::visit_inner(std::forward(args)...); 33| 3.09k| } _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.65M| { 32| 1.65M| return Deriv::visit_inner(std::forward(args)...); 33| 1.65M| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 23.5k| { 38| 23.5k| return Deriv::visit_inner(std::forward(args)...); 39| 23.5k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 23.5k| { 44| 23.5k| return Deriv::visit_node(std::forward(args)...); 45| 23.5k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 37| 14.1k| { 38| 14.1k| return Deriv::visit_inner(std::forward(args)...); 39| 14.1k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 43| 14.1k| { 44| 14.1k| return Deriv::visit_node(std::forward(args)...); 45| 14.1k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 31| 6.38k| { 32| 6.38k| return Deriv::visit_inner(std::forward(args)...); 33| 6.38k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 6.38k| { 44| 6.38k| return Deriv::visit_node(std::forward(args)...); 45| 6.38k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 7.80k| { 38| 7.80k| return Deriv::visit_inner(std::forward(args)...); 39| 7.80k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 7.80k| { 44| 7.80k| return Deriv::visit_node(std::forward(args)...); 45| 7.80k| } _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| 13.1k| { 32| 13.1k| return Deriv::visit_inner(std::forward(args)...); 33| 13.1k| } _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| 13.1k| { 44| 13.1k| return Deriv::visit_node(std::forward(args)...); 45| 13.1k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERjSJ_RNS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERmEEEDcDpOT_: 31| 21.7k| { 32| 21.7k| return Deriv::visit_inner(std::forward(args)...); 33| 21.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.22k| { 32| 2.22k| return Deriv::visit_inner(std::forward(args)...); 33| 2.22k| } _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| 905| { 32| 905| return Deriv::visit_inner(std::forward(args)...); 33| 905| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERjRNS1_8full_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERmEEEDcDpOT_: 37| 1.10k| { 38| 1.10k| return Deriv::visit_inner(std::forward(args)...); 39| 1.10k| } _ZN5immer6detail4rbts12visitor_baseINS1_18region_for_visitorIiEEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERmEEEDcDpOT_: 31| 8.66M| { 32| 8.66M| return Deriv::visit_inner(std::forward(args)...); 33| 8.66M| } _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| 377k| { 38| 377k| return Deriv::visit_inner(std::forward(args)...); 39| 377k| } _ZN5immer6detail4rbts12visitor_baseINS1_18region_for_visitorIiEEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERmEEEDcDpOT_: 37| 1.02M| { 38| 1.02M| return Deriv::visit_inner(std::forward(args)...); 39| 1.02M| } _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| 111k| { 38| 111k| return Deriv::visit_inner(std::forward(args)...); 39| 111k| } _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| 95.6k| { 38| 95.6k| return Deriv::visit_inner(std::forward(args)...); 39| 95.6k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERjSJ_RNS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERmEEEDcDpOT_: 37| 744| { 38| 744| return Deriv::visit_inner(std::forward(args)...); 39| 744| } _ZN5immer6detail4rbts12visitor_baseINS1_24for_each_chunk_p_visitorEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSF_Lj2ELj2EEEEEDaOT_EUlSN_T0_E_EEEDcDpOT_: 37| 19.5k| { 38| 19.5k| return Deriv::visit_inner(std::forward(args)...); 39| 19.5k| } _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.47k| { 38| 6.47k| return Deriv::visit_inner(std::forward(args)...); 39| 6.47k| } _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.70k| { 38| 2.70k| return Deriv::visit_inner(std::forward(args)...); 39| 2.70k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERjRNS1_11relaxed_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERmEEEDcDpOT_: 37| 2.87k| { 38| 2.87k| return Deriv::visit_inner(std::forward(args)...); 39| 2.87k| } _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| 546k| { 32| 546k| return Deriv::visit_inner(std::forward(args)...); 33| 546k| } _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.42k| { 32| 1.42k| return Deriv::visit_inner(std::forward(args)...); 33| 1.42k| } _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.42k| { 44| 1.42k| return Deriv::visit_node(std::forward(args)...); 45| 1.42k| } _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.50k| { 38| 6.50k| return Deriv::visit_inner(std::forward(args)...); 39| 6.50k| } _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.50k| { 44| 6.50k| return Deriv::visit_node(std::forward(args)...); 45| 6.50k| } _ZN5immer6detail15auto_const_castINS_15refcount_policyEEERT_RKS3_: 143| 113M|{ 144| 113M| return const_cast(x); 145| 113M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7inner_tEPSC_Lb0EE15get_storage_ptrEv: 113| 106M| { 114| 106M| check_base(); 115| 106M| auto* base = static_cast(this); 116| 106M| return reinterpret_cast(base + 1); 117| 106M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7inner_tEPSC_Lb0EE10check_baseEv: 134| 106M| { 135| 106M| static_assert(std::is_standard_layout::value && 136| 106M| !std::is_empty::value, 137| 106M| "Please add 'true' if the derived class is emtpy"); 138| 106M| } _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.5M|{ 330| 11.5M| std::forward(f)(empty_t{}); 331| 11.5M|} _ZN5immer6detail9destroy_nIPijEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 1.38M|{ 189| 1.38M| return first + n; 190| 1.38M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6leaf_tEiLb1EE15get_storage_ptrEv: 75| 9.73M| { 76| 9.73M| check_base(); 77| 9.73M| return reinterpret_cast(this); 78| 9.73M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6leaf_tEiLb1EE10check_baseEv: 94| 9.73M| { 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| 9.73M| static_assert(std::is_standard_layout::value, 100| 9.73M| "Please remove 'true' if the derived class is non emtpy"); 101| 9.73M| } _ZN5immer6detail18uninitialized_copyIPiS2_S2_EENSt3__19enable_ifIX18can_trivially_copyIT_T1_EES6_E4typeES5_T0_S6_: 236| 1.66M|{ 237| 1.66M| return std::copy(first, last, out); 238| 1.66M|} _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| 329k|{ 345| 329k| return std::forward(f2)(empty_t{}); 346| 329k|} _ZN5immer6detail4ipowImEET_S2_j: 323| 62.3M|{ 324| 62.3M| return pow == 0 ? 1 : num * ipow(num, pow - 1); ------------------ | Branch (324:12): [True: 1.94M, False: 60.3M] ------------------ 325| 62.3M|} _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| 63.9k|{ 345| 63.9k| return std::forward(f2)(empty_t{}); 346| 63.9k|} _ZN5immer6detail9static_ifILb1EZNS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14make_inner_r_eENSA_5applyIS7_E4type4editEEUlT_E_EENSt3__19enable_ifIXT_EvE4typeEOT0_: 329| 110k|{ 330| 110k| std::forward(f)(empty_t{}); 331| 110k|} _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| 15.7k|{ 345| 15.7k| return std::forward(f2)(empty_t{}); 346| 15.7k|} _ZN5immer6detail9destroy_nIPimEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 441|{ 189| 441| return first + n; 190| 441|} _ZN5immer6detail9static_ifILb0EPNS0_3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14relaxed_data_tENS2_6memberISA_NS2_7inheritINSC_5applyIS9_E4type5owneeEvE4typeEE4typeEE4typeEZNSE_22ensure_mutable_relaxedENSK_4editEEUlT_E_ZNSE_22ensure_mutable_relaxedEST_EUlSU_E0_EENSt3__19enable_ifIXntT_ET0_E4typeEOT1_OT2_: 344| 201k|{ 345| 201k| return std::forward(f2)(empty_t{}); 346| 201k|} _ZN5immer6detail18uninitialized_moveIPiS2_EENSt3__19enable_ifIX18can_trivially_copyIT_T0_EES6_E4typeES5_S5_S6_: 210| 1.45k|{ 211| 1.45k| return std::copy(first, last, out); 212| 1.45k|} _ZN5immer6detail8as_constIiEEPKT_PS2_: 29| 1.25M|{ 30| 1.25M| return x; 31| 1.25M|} _ZN5immer6detail4makeINS_15debug_size_heapINS_8cpp_heapEEENS_3boxIiNS_13memory_policyINS_21free_list_heap_policyIS3_Lm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderEJiEEEPT0_DpOT1_: 260| 19.1k|{ 261| 19.1k| auto ptr = Heap::allocate(sizeof(T)); 262| 19.1k| IMMER_TRY { ------------------ | | 49| 19.1k|#define IMMER_TRY try ------------------ 263| 19.1k| return new (ptr) T(std::forward(args)...); 264| 19.1k| } 265| 19.1k| IMMER_CATCH (...) { 266| 0| Heap::deallocate(sizeof(T), ptr); 267| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 268| 0| } 269| 19.1k|} _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2Ev: 96| 69.7k| flex_vector() = default; _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9push_backEi: 246| 449k| { 247| 449k| return impl_.push_back(std::move(value)); 248| 449k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2ENS_6detail4rbts7rrbtreeIiS8_Lj2ELj2EEE: 536| 1.43M| : impl_(std::move(impl)) 537| 1.43M| { 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.43M| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4sizeEv: 181| 2.62M| 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| 117k| { 324| 117k| return impl_.update(index, std::forward(fn)); 325| 117k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4takeEm: 350| 24.4k| { 351| 24.4k| return impl_.take(elems); 352| 24.4k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4dropEm: 376| 25.7k| { 377| 25.7k| return impl_.drop(elems); 378| 25.7k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8max_sizeEv: 90| 1.13M| 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| 815k| { 404| 815k| return l.impl_.concat(r.impl_); 405| 815k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9push_backEi: 251| 32.5k| { 252| 32.5k| return push_back_move(move_t{}, std::move(value)); 253| 32.5k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14push_back_moveENSt3__117integral_constantIbLb1EEEi: 547| 32.5k| { 548| 32.5k| impl_.push_back_mut({}, std::move(value)); 549| 32.5k| return std::move(*this); 550| 32.5k| } flex-vector.cpp:_ZNO5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6updateIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSE_E0_EEDcmOSE_: 329| 53.2k| { 330| 53.2k| return update_move(move_t{}, index, std::forward(fn)); 331| 53.2k| } 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| 53.2k| { 569| 53.2k| impl_.update_mut({}, index, std::forward(fn)); 570| 53.2k| return std::move(*this); 571| 53.2k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4takeEm: 355| 36.8k| { 356| 36.8k| return take_move(move_t{}, elems); 357| 36.8k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9take_moveENSt3__117integral_constantIbLb1EEEm: 579| 36.8k| { 580| 36.8k| impl_.take_mut({}, elems); 581| 36.8k| return std::move(*this); 582| 36.8k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4dropEm: 381| 44.7k| { 382| 44.7k| return drop_move(move_t{}, elems); 383| 44.7k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9drop_moveENSt3__117integral_constantIbLb1EEEm: 589| 44.7k| { 590| 44.7k| impl_.drop_mut({}, elems); 591| 44.7k| return std::move(*this); 592| 44.7k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERKS9_: 409| 238k| { 410| 238k| return concat_move(move_t{}, std::move(l), r); 411| 238k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_RKS9_: 600| 238k| { 601| 238k| concat_mut_l(l.impl_, {}, r.impl_); 602| 238k| return std::move(l); 603| 238k| } _ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEOS9_: 415| 3.47k| { 416| 3.47k| return concat_move(move_t{}, l, std::move(r)); 417| 3.47k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11concat_moveENSt3__117integral_constantIbLb1EEERKS9_OS9_: 606| 3.47k| { 607| 3.47k| concat_mut_r(l.impl_, r.impl_, {}); 608| 3.47k| return std::move(r); 609| 3.47k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEESA_: 421| 24.0k| { 422| 24.0k| return concat_move(move_t{}, std::move(l), std::move(r)); 423| 24.0k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_SD_: 612| 24.0k| { 613| 24.0k| concat_mut_lr_l(l.impl_, {}, r.impl_, {}); 614| 24.0k| return std::move(l); 615| 24.0k| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEeqERKS9_: 222| 31.7k| { 223| 31.7k| return impl_.equals(other.impl_); 224| 31.7k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5eraseEm: 480| 3.25k| { 481| 3.25k| return take(pos) + drop(pos + 1); 482| 3.25k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6insertEmi: 442| 19.1k| { 443| 19.1k| return take(pos).push_back(std::move(value)) + drop(pos); 444| 19.1k| } _ZN5immer8cpp_heap10deallocateEmPv: 36| 10.0M| static void deallocate(std::size_t, void* data) { ::operator delete(data); } _ZN5immer8cpp_heap8allocateIJEEEPvmDpT_: 27| 10.0M| { 28| 10.0M| return ::operator new(size); 29| 10.0M| } _ZN5immer15debug_size_heapINS_8cpp_heapEE10deallocateIJEEEvmPvDpT_: 57| 10.0M| { 58| 10.0M| auto p = (std::size_t*) (((char*) data) - extra_size); 59| 10.0M| assert(*p == size); ------------------ | Branch (59:9): [True: 10.0M, False: 0] ------------------ 60| 10.0M| Base::deallocate(size + extra_size, p, tags...); 61| 10.0M| } _ZN5immer15debug_size_heapINS_8cpp_heapEE8allocateIJEEEPvmDpT_: 49| 10.0M| { 50| 10.0M| auto p = (std::size_t*) Base::allocate(size + extra_size, tags...); 51| 10.0M| new (p) std::size_t{size}; 52| 10.0M| return ((char*) p) + extra_size; 53| 10.0M| } _ZN5immer14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEE10deallocateIJEEEvmPvDpT_: 56| 10.6M| { 57| 10.6M| assert(size <= Size); ------------------ | Branch (57:9): [True: 10.6M, 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.6M| if (head().count.load(std::memory_order_relaxed) >= Limit) { ------------------ | Branch (61:13): [True: 10.0M, False: 549k] ------------------ 62| 10.0M| base_t::deallocate(Size, data); 63| 10.0M| } else { 64| 549k| auto n = static_cast(data); 65| 549k| do { 66| 549k| n->next = head().data; 67| 549k| } while (!head().data.compare_exchange_weak(n->next, n)); ------------------ | Branch (67:22): [True: 0, False: 549k] ------------------ 68| 549k| head().count.fetch_add(1u, std::memory_order_relaxed); 69| 549k| } 70| 10.6M| } _ZN5immer14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEE4headEv: 80| 23.9M| { 81| 23.9M| static head_t head_{{nullptr}, {0}}; 82| 23.9M| return head_; 83| 23.9M| } _ZN5immer14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEE8allocateIJEEEPvmDpT_: 39| 10.6M| { 40| 10.6M| assert(size <= Size); ------------------ | Branch (40:9): [True: 10.6M, False: 0] ------------------ 41| | 42| 10.6M| node_t* n; 43| 10.6M| do { 44| 10.6M| n = head().data; 45| 10.6M| if (!n) { ------------------ | Branch (45:17): [True: 10.0M, False: 548k] ------------------ 46| 10.0M| auto p = base_t::allocate(Size); 47| 10.0M| return p; 48| 10.0M| } 49| 10.6M| } while (!head().data.compare_exchange_weak(n, n->next)); ------------------ | Branch (49:18): [True: 0, False: 548k] ------------------ 50| 548k| head().count.fetch_sub(1u, std::memory_order_relaxed); 51| 548k| return n; 52| 10.6M| } _ZN5immer10split_heapILm56ENS_27thread_local_free_list_heapILm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEEES5_E10deallocateIJEEEvmPvDpT_: 33| 26.7M| { 34| 26.7M| if (size <= Size) ------------------ | Branch (34:13): [True: 26.7M, False: 0] ------------------ 35| 26.7M| SmallHeap::deallocate(size, data, tags...); 36| 0| else 37| 0| BigHeap::deallocate(size, data, tags...); 38| 26.7M| } _ZN5immer10split_heapILm56ENS_27thread_local_free_list_heapILm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEEES5_E8allocateIJEEEPvmDpT_: 26| 15.6M| { 27| 15.6M| return size <= Size ? SmallHeap::allocate(size, tags...) ------------------ | Branch (27:16): [True: 15.6M, False: 0] ------------------ 28| 15.6M| : BigHeap::allocate(size, tags...); 29| 15.6M| } _ZN5immer10split_heapILm56ENS_27thread_local_free_list_heapILm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEEES5_E8allocateIJNS_10norefs_tagEEEEPvmDpT_: 26| 11.1M| { 27| 11.1M| return size <= Size ? SmallHeap::allocate(size, tags...) ------------------ | Branch (27:16): [True: 11.1M, False: 0] ------------------ 28| 11.1M| : BigHeap::allocate(size, tags...); 29| 11.1M| } _ZN5immer6detail30thread_local_free_list_storageINS0_26unsafe_free_list_heap_implIS1_Lm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEEEE4headEv: 35| 134M| { 36| 134M| thread_local static head_t head_{nullptr, 0}; 37| 134M| return head_; 38| 134M| } _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.7M| { 73| 26.7M| assert(size <= Size); ------------------ | Branch (73:9): [True: 26.7M, False: 0] ------------------ 74| | 75| 26.7M| if (storage::head().count >= Limit) ------------------ | Branch (75:13): [True: 10.6M, False: 16.1M] ------------------ 76| 10.6M| base_t::deallocate(Size, data); 77| 16.1M| else { 78| 16.1M| auto n = static_cast(data); 79| 16.1M| n->next = storage::head().data; 80| 16.1M| storage::head().data = n; 81| 16.1M| ++storage::head().count; 82| 16.1M| } 83| 26.7M| } _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.6M| { 58| 15.6M| assert(size <= Size); ------------------ | Branch (58:9): [True: 15.6M, False: 0] ------------------ 59| | 60| 15.6M| auto n = storage::head().data; 61| 15.6M| if (!n) { ------------------ | Branch (61:13): [True: 5.42M, False: 10.1M] ------------------ 62| 5.42M| auto p = base_t::allocate(Size); 63| 5.42M| return p; 64| 5.42M| } 65| 10.1M| --storage::head().count; 66| 10.1M| storage::head().data = n->next; 67| 10.1M| return n; 68| 15.6M| } _ZN5immer6detail26unsafe_free_list_heap_implINS0_30thread_local_free_list_storageELm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEE8allocateIJNS_10norefs_tagEEEEPvmDpT_: 57| 11.1M| { 58| 11.1M| assert(size <= Size); ------------------ | Branch (58:9): [True: 11.1M, False: 0] ------------------ 59| | 60| 11.1M| auto n = storage::head().data; 61| 11.1M| if (!n) { ------------------ | Branch (61:13): [True: 5.18M, False: 5.99M] ------------------ 62| 5.18M| auto p = base_t::allocate(Size); 63| 5.18M| return p; 64| 5.18M| } 65| 5.99M| --storage::head().count; 66| 5.99M| storage::head().data = n->next; 67| 5.99M| return n; 68| 11.1M| } _ZN5immer15refcount_policyC2Ev: 28| 26.8M| : refcount{1} {}; _ZN5immer15refcount_policy3incEv: 34| 42.3M| void inc() { refcount.fetch_add(1, std::memory_order_relaxed); } _ZN5immer15refcount_policy3decEv: 36| 69.1M| bool dec() { return 1 == refcount.fetch_sub(1, std::memory_order_acq_rel); } _ZN5immer15refcount_policy6uniqueEv: 38| 1.96M| bool unique() { return refcount == 1; } _ZNK5immer20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5ownee5ownedEv: 36| 26.7M| bool owned() const { return false; } _ZNK5immer20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5ownee10can_mutateENS6_4editE: 35| 140k| bool can_mutate(edit) const { return false; } _ZN5immer20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeaSENS6_4editE: 34| 561k| ownee& operator=(edit) { return *this; };