LLVMFuzzerTestOneInput: 18| 8.61k|{ 19| 8.61k| constexpr auto var_count = 8; 20| 8.61k| constexpr auto bits = 2; 21| | 22| 8.61k| using vector_t = 23| 8.61k| immer::flex_vector; 24| 8.61k| using size_t = std::uint8_t; 25| | 26| 8.61k| auto vars = std::array{}; 27| | 28| 8.61k| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; 29| 8.61k| auto is_valid_var_neq = [](auto other) { 30| 8.61k| return [=](auto idx) { 31| 8.61k| return idx >= 0 && idx < var_count && idx != other; 32| 8.61k| }; 33| 8.61k| }; 34| 8.61k| auto is_valid_index = [](auto& v) { 35| 8.61k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 36| 8.61k| }; 37| 8.61k| auto is_valid_size = [](auto& v) { 38| 8.61k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 39| 8.61k| }; 40| 8.61k| auto can_concat = [](auto&& v1, auto&& v2) { 41| 8.61k| return v1.size() + v2.size() < vector_t::max_size(); 42| 8.61k| }; 43| 8.61k| auto can_compare = [](auto&& v) { 44| | // avoid comparing vectors that are too big, and hence, slow to compare 45| 8.61k| return v.size() < (1 << 15); 46| 8.61k| }; 47| 8.61k| return fuzzer_input{data, size}.run([&](auto& in) { 48| 8.61k| enum ops 49| 8.61k| { 50| 8.61k| op_push_back, 51| 8.61k| op_update, 52| 8.61k| op_take, 53| 8.61k| op_drop, 54| 8.61k| op_concat, 55| 8.61k| op_push_back_move, 56| 8.61k| op_update_move, 57| 8.61k| op_take_move, 58| 8.61k| op_drop_move, 59| 8.61k| op_concat_move_l, 60| 8.61k| op_concat_move_r, 61| 8.61k| op_concat_move_lr, 62| 8.61k| op_insert, 63| 8.61k| op_erase, 64| 8.61k| op_compare, 65| 8.61k| }; 66| 8.61k| auto src = read(in, is_valid_var); 67| 8.61k| auto dst = read(in, is_valid_var); 68| 8.61k| switch (read(in)) { 69| 8.61k| case op_push_back: { 70| 8.61k| vars[dst] = vars[src].push_back(42); 71| 8.61k| break; 72| 8.61k| } 73| 8.61k| case op_update: { 74| 8.61k| auto idx = read(in, is_valid_index(vars[src])); 75| 8.61k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 76| 8.61k| break; 77| 8.61k| } 78| 8.61k| case op_take: { 79| 8.61k| auto idx = read(in, is_valid_size(vars[src])); 80| 8.61k| vars[dst] = vars[src].take(idx); 81| 8.61k| break; 82| 8.61k| } 83| 8.61k| case op_drop: { 84| 8.61k| auto idx = read(in, is_valid_size(vars[src])); 85| 8.61k| vars[dst] = vars[src].drop(idx); 86| 8.61k| break; 87| 8.61k| } 88| 8.61k| case op_concat: { 89| 8.61k| auto src2 = read(in, is_valid_var); 90| 8.61k| if (can_concat(vars[src], vars[src2])) 91| 8.61k| vars[dst] = vars[src] + vars[src2]; 92| 8.61k| break; 93| 8.61k| } 94| 8.61k| case op_push_back_move: { 95| 8.61k| vars[dst] = std::move(vars[src]).push_back(21); 96| 8.61k| break; 97| 8.61k| } 98| 8.61k| case op_update_move: { 99| 8.61k| auto idx = read(in, is_valid_index(vars[src])); 100| 8.61k| vars[dst] = 101| 8.61k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 102| 8.61k| break; 103| 8.61k| } 104| 8.61k| case op_take_move: { 105| 8.61k| auto idx = read(in, is_valid_size(vars[src])); 106| 8.61k| vars[dst] = std::move(vars[src]).take(idx); 107| 8.61k| break; 108| 8.61k| } 109| 8.61k| case op_drop_move: { 110| 8.61k| auto idx = read(in, is_valid_size(vars[src])); 111| 8.61k| vars[dst] = std::move(vars[src]).drop(idx); 112| 8.61k| break; 113| 8.61k| } 114| 8.61k| case op_concat_move_l: { 115| 8.61k| auto src2 = read(in, is_valid_var_neq(src)); 116| 8.61k| if (can_concat(vars[src], vars[src2])) 117| 8.61k| vars[dst] = std::move(vars[src]) + vars[src2]; 118| 8.61k| break; 119| 8.61k| } 120| 8.61k| case op_concat_move_r: { 121| 8.61k| auto src2 = read(in, is_valid_var_neq(src)); 122| 8.61k| if (can_concat(vars[src], vars[src2])) 123| 8.61k| vars[dst] = vars[src] + std::move(vars[src2]); 124| 8.61k| break; 125| 8.61k| } 126| 8.61k| case op_concat_move_lr: { 127| 8.61k| auto src2 = read(in, is_valid_var_neq(src)); 128| 8.61k| if (can_concat(vars[src], vars[src2])) 129| 8.61k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 130| 8.61k| break; 131| 8.61k| } 132| 8.61k| case op_compare: { 133| 8.61k| using std::swap; 134| 8.61k| if (can_compare(vars[src]) && vars[src] == vars[dst]) 135| 8.61k| swap(vars[src], vars[dst]); 136| 8.61k| break; 137| 8.61k| } 138| 8.61k| case op_erase: { 139| 8.61k| auto idx = read(in, is_valid_index(vars[src])); 140| 8.61k| vars[dst] = vars[src].erase(idx); 141| 8.61k| break; 142| 8.61k| } 143| 8.61k| case op_insert: { 144| 8.61k| auto idx = read(in, is_valid_size(vars[src])); 145| 8.61k| vars[dst] = vars[src].insert(idx, immer::box{42}); 146| 8.61k| break; 147| 8.61k| } 148| 8.61k| default: 149| 8.61k| break; 150| 8.61k| }; 151| 8.61k| return true; 152| 8.61k| }); 153| 8.61k|} flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_: 47| 1.94M| return fuzzer_input{data, size}.run([&](auto& in) { 48| 1.94M| enum ops 49| 1.94M| { 50| 1.94M| op_push_back, 51| 1.94M| op_update, 52| 1.94M| op_take, 53| 1.94M| op_drop, 54| 1.94M| op_concat, 55| 1.94M| op_push_back_move, 56| 1.94M| op_update_move, 57| 1.94M| op_take_move, 58| 1.94M| op_drop_move, 59| 1.94M| op_concat_move_l, 60| 1.94M| op_concat_move_r, 61| 1.94M| op_concat_move_lr, 62| 1.94M| op_insert, 63| 1.94M| op_erase, 64| 1.94M| op_compare, 65| 1.94M| }; 66| 1.94M| auto src = read(in, is_valid_var); 67| 1.94M| auto dst = read(in, is_valid_var); 68| 1.94M| 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| 116k| case op_update: { ------------------ | Branch (73:9): [True: 116k, False: 1.83M] ------------------ 74| 116k| auto idx = read(in, is_valid_index(vars[src])); 75| 116k| vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); 76| 116k| break; 77| 0| } 78| 1.59k| case op_take: { ------------------ | Branch (78:9): [True: 1.59k, False: 1.94M] ------------------ 79| 1.59k| auto idx = read(in, is_valid_size(vars[src])); 80| 1.59k| vars[dst] = vars[src].take(idx); 81| 1.59k| break; 82| 0| } 83| 3.13k| case op_drop: { ------------------ | Branch (83:9): [True: 3.13k, False: 1.94M] ------------------ 84| 3.13k| auto idx = read(in, is_valid_size(vars[src])); 85| 3.13k| vars[dst] = vars[src].drop(idx); 86| 3.13k| break; 87| 0| } 88| 856k| case op_concat: { ------------------ | Branch (88:9): [True: 856k, False: 1.09M] ------------------ 89| 856k| auto src2 = read(in, is_valid_var); 90| 856k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (90:17): [True: 806k, False: 50.8k] ------------------ 91| 806k| vars[dst] = vars[src] + vars[src2]; 92| 856k| break; 93| 0| } 94| 12.7k| case op_push_back_move: { ------------------ | Branch (94:9): [True: 12.7k, False: 1.93M] ------------------ 95| 12.7k| vars[dst] = std::move(vars[src]).push_back(21); 96| 12.7k| break; 97| 0| } 98| 71.1k| case op_update_move: { ------------------ | Branch (98:9): [True: 71.1k, False: 1.87M] ------------------ 99| 71.1k| auto idx = read(in, is_valid_index(vars[src])); 100| 71.1k| vars[dst] = 101| 71.1k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); 102| 71.1k| break; 103| 0| } 104| 41.1k| case op_take_move: { ------------------ | Branch (104:9): [True: 41.1k, False: 1.90M] ------------------ 105| 41.1k| auto idx = read(in, is_valid_size(vars[src])); 106| 41.1k| vars[dst] = std::move(vars[src]).take(idx); 107| 41.1k| break; 108| 0| } 109| 42.8k| case op_drop_move: { ------------------ | Branch (109:9): [True: 42.8k, False: 1.90M] ------------------ 110| 42.8k| auto idx = read(in, is_valid_size(vars[src])); 111| 42.8k| vars[dst] = std::move(vars[src]).drop(idx); 112| 42.8k| break; 113| 0| } 114| 256k| case op_concat_move_l: { ------------------ | Branch (114:9): [True: 256k, False: 1.69M] ------------------ 115| 256k| auto src2 = read(in, is_valid_var_neq(src)); 116| 256k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (116:17): [True: 248k, False: 7.94k] ------------------ 117| 248k| vars[dst] = std::move(vars[src]) + vars[src2]; 118| 256k| break; 119| 0| } 120| 4.11k| case op_concat_move_r: { ------------------ | Branch (120:9): [True: 4.11k, False: 1.94M] ------------------ 121| 4.11k| auto src2 = read(in, is_valid_var_neq(src)); 122| 4.11k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (122:17): [True: 3.66k, False: 452] ------------------ 123| 3.66k| vars[dst] = vars[src] + std::move(vars[src2]); 124| 4.11k| break; 125| 0| } 126| 2.51k| case op_concat_move_lr: { ------------------ | Branch (126:9): [True: 2.51k, False: 1.94M] ------------------ 127| 2.51k| auto src2 = read(in, is_valid_var_neq(src)); 128| 2.51k| if (can_concat(vars[src], vars[src2])) ------------------ | Branch (128:17): [True: 1.86k, False: 644] ------------------ 129| 1.86k| vars[dst] = std::move(vars[src]) + std::move(vars[src2]); 130| 2.51k| break; 131| 0| } 132| 31.5k| case op_compare: { ------------------ | Branch (132:9): [True: 31.5k, False: 1.91M] ------------------ 133| 31.5k| using std::swap; 134| 31.5k| if (can_compare(vars[src]) && vars[src] == vars[dst]) ------------------ | Branch (134:17): [True: 27.6k, False: 3.94k] | Branch (134:43): [True: 6.29k, False: 21.3k] ------------------ 135| 6.29k| swap(vars[src], vars[dst]); 136| 31.5k| break; 137| 0| } 138| 3.34k| case op_erase: { ------------------ | Branch (138:9): [True: 3.34k, False: 1.94M] ------------------ 139| 3.34k| auto idx = read(in, is_valid_index(vars[src])); 140| 3.34k| vars[dst] = vars[src].erase(idx); 141| 3.34k| break; 142| 0| } 143| 18.9k| case op_insert: { ------------------ | Branch (143:9): [True: 18.9k, False: 1.93M] ------------------ 144| 18.9k| auto idx = read(in, is_valid_size(vars[src])); 145| 18.9k| vars[dst] = vars[src].insert(idx, immer::box{42}); 146| 18.9k| break; 147| 0| } 148| 28.5k| default: ------------------ | Branch (148:9): [True: 28.5k, False: 1.92M] ------------------ 149| 28.5k| break; 150| 1.94M| }; 151| 1.94M| return true; 152| 1.94M| }); flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_0clIcEEDaT_: 28| 5.09M| auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; ------------------ | Branch (28:48): [True: 4.91M, False: 173k] | Branch (28:60): [True: 4.74M, False: 176k] ------------------ 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| 344k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; ------------------ | Branch (35:39): [True: 344k, False: 0] | Branch (35:51): [True: 190k, False: 154k] ------------------ flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaRT_: 34| 190k| auto is_valid_index = [](auto& v) { 35| 190k| return [&](auto idx) { return idx >= 0 && idx < v.size(); }; 36| 190k| }; flex-vector.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E_clIiEEDaS2_: 75| 116k| 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| 120k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; ------------------ | Branch (38:39): [True: 120k, False: 0] | Branch (38:51): [True: 107k, False: 12.7k] ------------------ flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaRT_: 37| 107k| auto is_valid_size = [](auto& v) { 38| 107k| return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; 39| 107k| }; 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.12M| auto can_concat = [](auto&& v1, auto&& v2) { 41| 1.12M| return v1.size() + v2.size() < vector_t::max_size(); 42| 1.12M| }; flex-vector.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_ENKUlS2_E0_clIiEEDaS2_: 101| 71.0k| std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); flex-vector.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_ENKUlS1_E_clIcEEDaS1_: 30| 310k| return [=](auto idx) { 31| 310k| return idx >= 0 && idx < var_count && idx != other; ------------------ | Branch (31:20): [True: 304k, False: 6.64k] | Branch (31:32): [True: 293k, False: 11.0k] | Branch (31:51): [True: 263k, False: 29.7k] ------------------ 32| 310k| }; flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_: 29| 263k| auto is_valid_var_neq = [](auto other) { 30| 263k| return [=](auto idx) { 31| 263k| return idx >= 0 && idx < var_count && idx != other; 32| 263k| }; 33| 263k| }; flex-vector.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_5clIRN5immer11flex_vectorIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaOT_: 43| 31.5k| auto can_compare = [](auto&& v) { 44| | // avoid comparing vectors that are too big, and hence, slow to compare 45| 31.5k| return v.size() < (1 << 15); 46| 31.5k| }; flex-vector.cpp:_ZN12fuzzer_input3runIZ22LLVMFuzzerTestOneInputE3$_6EEiT_: 50| 8.61k| { 51| 8.61k| if (size_ > fuzzer_input_max_size) ------------------ | Branch (51:13): [True: 8, False: 8.60k] ------------------ 52| 8| return 0; 53| 8.60k| try { 54| 1.94M| while (step(*this)) ------------------ | Branch (54:20): [True: 1.94M, False: 8.60k] ------------------ 55| 1.94M| continue; 56| 8.60k| } catch (const no_more_input&) { 57| 8.60k| }; 58| 8.60k| return 0; 59| 8.60k| } flex-vector.cpp:_Z4readIcZ22LLVMFuzzerTestOneInputE3$_0ET_R12fuzzer_inputT0_: 70| 4.74M|{ 71| 4.74M| auto x = read(fz); 72| 5.09M| while (!cond(x)) ------------------ | Branch (72:12): [True: 350k, False: 4.74M] ------------------ 73| 350k| x = read(fz); 74| 4.74M| return x; 75| 4.74M|} _Z4readIcERKT_R12fuzzer_input: 64| 7.35M|{ 65| 7.35M| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 7.35M|} _ZN12fuzzer_input4nextEmm: 40| 7.81M| { 41| 7.81M| auto& p = const_cast(reinterpret_cast(data_)); 42| 7.81M| auto r = std::align(align, size, p, size_); 43| 7.81M| if (r == nullptr) ------------------ | Branch (43:13): [True: 8.60k, False: 7.80M] ------------------ 44| 8.60k| throw no_more_input{}; 45| 7.80M| return next(size); 46| 7.81M| } _ZN12fuzzer_input4nextEm: 30| 7.80M| { 31| 7.80M| if (size_ < size) ------------------ | Branch (31:13): [True: 0, False: 7.80M] ------------------ 32| 0| throw no_more_input{}; 33| 7.80M| auto r = data_; 34| 7.80M| data_ += size; 35| 7.80M| size_ -= size; 36| 7.80M| return r; 37| 7.80M| } flex-vector.cpp:_Z4readIhZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS2_13memory_policyINS2_21free_list_heap_policyINS2_8cpp_heapELm1024EEENS2_15refcount_policyENS2_15spinlock_policyENS2_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaRT_EUlSD_E_ESD_R12fuzzer_inputT0_: 70| 190k|{ 71| 190k| auto x = read(fz); 72| 345k| while (!cond(x)) ------------------ | Branch (72:12): [True: 154k, False: 190k] ------------------ 73| 154k| x = read(fz); 74| 190k| return x; 75| 190k|} _Z4readIhERKT_R12fuzzer_input: 64| 465k|{ 65| 465k| return *reinterpret_cast(fz.next(sizeof(T), alignof(T))); 66| 465k|} 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| 107k|{ 71| 107k| auto x = read(fz); 72| 120k| while (!cond(x)) ------------------ | Branch (72:12): [True: 12.7k, False: 107k] ------------------ 73| 12.7k| x = read(fz); 74| 107k| return x; 75| 107k|} flex-vector.cpp:_Z4readIcZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_EUlS2_E_ES2_R12fuzzer_inputT0_: 70| 263k|{ 71| 263k| auto x = read(fz); 72| 310k| while (!cond(x)) ------------------ | Branch (72:12): [True: 47.3k, False: 263k] ------------------ 73| 47.3k| x = read(fz); 74| 263k| return x; 75| 263k|} _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2IiviEEOT_: 85| 18.9k| : impl_{detail::make(std::forward(arg))} 86| 18.9k| { 87| 18.9k| } _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderC2IJiEEEDpOT_: 47| 18.9k| : value(std::forward(args)...) 48| 18.9k| { 49| 18.9k| } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEcvRKiEv: 142| 18.9k| operator const T&() const { return get(); } _ZNK5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE3getEv: 139| 18.9k| IMMER_NODISCARD const T& get() const { return impl_->value; } _ZN5immer3boxIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEED2Ev: 131| 18.9k| { 132| 18.9k| if (impl_ && impl_->dec()) { ------------------ | Branch (132:13): [True: 18.9k, False: 0] | Branch (132:22): [True: 18.9k, False: 0] ------------------ 133| 18.9k| impl_->~holder(); 134| 18.9k| heap::deallocate(sizeof(holder), impl_); 135| 18.9k| } 136| 18.9k| } _ZN5immer6detail3csl3getINS_15refcount_policyEEEDcRKNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEES3_NS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11impl_data_tENS1_6memberIS3_NS1_7inheritINSC_5applyISA_E4type5owneeEvE4typeEE4typeEE4typeE: 170| 96.4M| { 171| 96.4M| return x.get_(type_t{}); 172| 96.4M| } _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| 96.4M| { 185| 96.4M| return n.get_(t); 186| 96.4M| } _ZNK5immer6detail3csl6memberINS_15refcount_policyENS1_7inheritINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEvE4typeEE4type4get_ENS1_6type_tIS3_EE: 128| 107M| const T& get_(type_t) const { return d; } _ZN5immer6detail3csl3getINS_15refcount_policyEEEDcRKNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEES3_NS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14relaxed_data_tENS1_6memberIS3_NS1_7inheritINSC_5applyISA_E4type5owneeEvE4typeEE4typeEE4typeE: 170| 11.2M| { 171| 11.2M| return x.get_(type_t{}); 172| 11.2M| } _ZNK5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14relaxed_data_tENS1_6memberIS9_NS1_7inheritINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_IS9_EEDcNS1_6type_tIT_EE: 184| 11.2M| { 185| 11.2M| return n.get_(t); 186| 11.2M| } _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| 10.5M| { 166| 10.5M| return x.get_(type_t{}); 167| 10.5M| } _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| 10.5M| { 180| 10.5M| return n.get_(t); 181| 10.5M| } _ZN5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 102| 25.9M| T& get_(type_t) { return *this; } _ZN5immer6detail3csl3getINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEEEDcRNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyIS7_NS_15refcount_policyENS_15spinlock_policyES3_Lb0ELb1EEELj2ELj2EE11impl_data_tENS1_6memberISF_NS1_7inheritISA_vE4typeEE4typeEE4typeE: 165| 15.4M| { 166| 15.4M| return x.get_(type_t{}); 167| 15.4M| } _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.4M| { 180| 15.4M| return n.get_(t); 181| 15.4M| } _ZN5immer6detail3csl3getINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEEEDcRKNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyIS7_NS_15refcount_policyENS_15spinlock_policyES3_Lb0ELb1EEELj2ELj2EE11impl_data_tENS1_6memberISF_NS1_7inheritISA_vE4typeEE4typeEE4typeE: 170| 96.9k| { 171| 96.9k| return x.get_(type_t{}); 172| 96.9k| } _ZNK5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11impl_data_tENS1_6memberIS9_NS1_7inheritINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_ISK_EEDcNS1_6type_tIT_EE: 184| 96.9k| { 185| 96.9k| return n.get_(t); 186| 96.9k| } _ZNK5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE: 103| 96.9k| 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| 4.85M| 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| 4.85M| { 23| 4.85M| return x.dereference(); 24| 4.85M| } _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| 4.89M| { 87| 4.89M| static_assert(std::is_base_of::value, 88| 4.89M| "must pass a derived thing"); 89| 4.89M| return *static_cast(this); 90| 4.89M| } _ZN5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENSt3__126random_access_iterator_tagEiRKilPSF_EpLEl: 151| 233k| { 152| 233k| access_t::advance(derived(), n); 153| 233k| return derived(); 154| 233k| } _ZN5immer6detail20iterator_core_access7advanceIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEElEEDcOT_T0_: 46| 233k| { 47| 233k| return x.advance(d); 48| 233k| } _ZN5immer6detail15iterator_facadeINS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENSt3__126random_access_iterator_tagEiRKilPSF_E7derivedEv: 92| 7.73M| { 93| 7.73M| static_assert(std::is_base_of::value, 94| 7.73M| "must pass a derived thing"); 95| 7.73M| return *static_cast(this); 96| 7.73M| } _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.63M| { 120| 3.63M| access_t::increment(derived()); 121| 3.63M| return derived(); 122| 3.63M| } _ZN5immer6detail20iterator_core_access9incrementIRNS0_4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDcOT_: 28| 3.63M| { 29| 3.63M| return x.increment(); 30| 3.63M| } _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.7k| { 165| 41.7k| auto tmp = derived(); 166| 41.7k| return tmp += n; 167| 41.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE17make_inner_n_intoEPvmj: 213| 2.80M| { 214| 2.80M| assert(n <= branches); ------------------ | Branch (214:9): [True: 2.80M, False: 0] ------------------ 215| 2.80M| assert(size >= sizeof_inner_n(n)); ------------------ | Branch (215:9): [True: 2.80M, False: 0] ------------------ 216| 2.80M| auto p = new (buffer) node_t; 217| 2.80M| p->impl.d.data.inner.relaxed = nullptr; 218| 2.80M|#if IMMER_TAGGED_NODE 219| 2.80M| p->impl.d.kind = node_t::kind_t::inner; 220| 2.80M|#endif 221| 2.80M| return p; 222| 2.80M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14sizeof_inner_nEj: 145| 11.3M| { 146| 11.3M| return keep_headroom ? max_sizeof_inner : sizeof_packed_inner_n(n); ------------------ | Branch (146:16): [True: 11.3M, Folded] ------------------ 147| 11.3M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE3incEv: 956| 26.3M| { 957| 26.3M| refs(this).inc(); 958| 26.3M| return this; 959| 26.3M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4refsEPKSB_: 203| 96.4M| { 204| 96.4M| return auto_const_cast(get(x->impl)); 205| 96.4M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE16make_leaf_n_intoEPvmj: 330| 1.21M| { 331| 1.21M| assert(n <= branches); ------------------ | Branch (331:9): [True: 1.21M, False: 0] ------------------ 332| 1.21M| assert(size >= sizeof_leaf_n(n)); ------------------ | Branch (332:9): [True: 1.21M, False: 0] ------------------ 333| 1.21M| auto p = new (buffer) node_t; 334| 1.21M|#if IMMER_TAGGED_NODE 335| 1.21M| p->impl.d.kind = node_t::kind_t::leaf; 336| 1.21M|#endif 337| 1.21M| return p; 338| 1.21M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13sizeof_leaf_nEj: 160| 5.06M| { 161| 5.06M| return keep_headroom ? max_sizeof_leaf : sizeof_packed_leaf_n(n); ------------------ | Branch (161:16): [True: 5.06M, Folded] ------------------ 162| 5.06M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7relaxedEv: 172| 155M| { 173| 155M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 155M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (173:9): [True: 155M, False: 0] ------------------ 174| 155M| return impl.d.data.inner.relaxed; 175| 155M| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4kindEv: 168| 295M| 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| 54.8M| bool dec() const { return refs(this).dec(); } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5innerEv: 184| 101M| { 185| 101M| IMMER_ASSERT_TAGGED(kind() == kind_t::inner); ------------------ | | 68| 101M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (185:9): [True: 101M, False: 0] ------------------ 186| 101M| return impl.d.data.inner.get_storage_ptr(); 187| 101M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14delete_inner_rEPSB_j: 832| 10.7M| { 833| 10.7M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 10.7M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (833:9): [True: 10.7M, False: 0] ------------------ 834| 10.7M| auto r = p->relaxed(); 835| 10.7M| assert(r); ------------------ | Branch (835:9): [True: 10.7M, False: 0] ------------------ 836| 10.7M| static_if([&](auto) { 837| 10.7M| if (node_t::refs(r).dec()) 838| 10.7M| heap::deallocate(node_t::ownee(r).owned() 839| 10.7M| ? node_t::max_sizeof_relaxed 840| 10.7M| : node_t::sizeof_relaxed_n(n), 841| 10.7M| r); 842| 10.7M| }); 843| 10.7M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner_r ------------------ | Branch (843:26): [True: 0, False: 10.7M] ------------------ 844| 10.7M| : node_t::sizeof_inner_r_n(n), 845| 10.7M| p); 846| 10.7M| } _ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14delete_inner_rEPSB_jENKUlT_E_clINS0_7empty_tEEEDaSD_: 836| 10.7M| static_if([&](auto) { 837| 10.7M| if (node_t::refs(r).dec()) ------------------ | Branch (837:17): [True: 10.4M, False: 290k] ------------------ 838| 10.4M| heap::deallocate(node_t::ownee(r).owned() ------------------ | Branch (838:34): [True: 0, False: 10.4M] ------------------ 839| 10.4M| ? node_t::max_sizeof_relaxed 840| 10.4M| : node_t::sizeof_relaxed_n(n), 841| 10.4M| r); 842| 10.7M| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4refsEPKNS0_3csl10member_twoINSB_14relaxed_data_tENSC_6memberIS7_NSC_7inheritINS9_5applyIS6_E4type5owneeEvE4typeEE4typeEE4typeE: 196| 11.2M| { 197| 11.2M| return auto_const_cast(get(*x)); 198| 11.2M| } _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| 10.5M| 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| 20.6M| { 156| 20.6M| return keep_headroom ? max_sizeof_relaxed : sizeof_packed_relaxed_n(n); ------------------ | Branch (156:16): [True: 20.6M, Folded] ------------------ 157| 20.6M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5owneeEPSB_: 210| 15.4M| 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| 21.2M| { 151| 21.2M| return keep_headroom ? max_sizeof_inner_r : sizeof_packed_inner_r_n(n); ------------------ | Branch (151:16): [True: 21.2M, Folded] ------------------ 152| 21.2M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11delete_leafEPSB_j: 861| 1.41M| { 862| 1.41M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::leaf); ------------------ | | 68| 1.41M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (862:9): [True: 1.41M, False: 0] ------------------ 863| 1.41M| detail::destroy_n(p->leaf(), n); 864| 1.41M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_leaf ------------------ | Branch (864:26): [True: 0, False: 1.41M] ------------------ 865| 1.41M| : node_t::sizeof_leaf_n(n), 866| 1.41M| p); 867| 1.41M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4leafEv: 190| 9.89M| { 191| 9.89M| IMMER_ASSERT_TAGGED(kind() == kind_t::leaf); ------------------ | | 68| 9.89M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (191:9): [True: 9.89M, False: 0] ------------------ 192| 9.89M| return impl.d.data.leaf.get_storage_ptr(); 193| 9.89M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12delete_innerEPSB_j: 808| 2.88M| { 809| 2.88M| IMMER_ASSERT_TAGGED(p->kind() == kind_t::inner); ------------------ | | 68| 2.88M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (809:9): [True: 2.88M, False: 0] ------------------ 810| 2.88M| assert(!p->relaxed()); ------------------ | Branch (810:9): [True: 2.88M, False: 0] ------------------ 811| 2.88M| heap::deallocate(ownee(p).owned() ? node_t::max_sizeof_inner ------------------ | Branch (811:26): [True: 0, False: 2.88M] ------------------ 812| 2.88M| : node_t::sizeof_inner_n(n), 813| 2.88M| p); 814| 2.88M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE17copy_leaf_emplaceIiEEPSB_SD_jOT_: 794| 329k| { 795| 329k| auto dst = copy_leaf_n(n + 1, src, n); 796| 329k| IMMER_TRY { ------------------ | | 49| 329k|#define IMMER_TRY try ------------------ 797| 329k| new (dst->leaf() + n) T(std::forward(x)); 798| 329k| } 799| 329k| 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| 329k| return dst; 805| 329k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11copy_leaf_nEjPSB_j: 696| 329k| { 697| 329k| assert(allocn >= n); ------------------ | Branch (697:9): [True: 329k, False: 0] ------------------ 698| 329k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 329k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (698:9): [True: 329k, False: 0] ------------------ 699| 329k| auto dst = make_leaf_n(allocn); 700| 329k| IMMER_TRY { ------------------ | | 49| 329k|#define IMMER_TRY try ------------------ 701| 329k| detail::uninitialized_copy( 702| 329k| src->leaf(), src->leaf() + n, dst->leaf()); 703| 329k| } 704| 329k| 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| 329k| return dst; 709| 329k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_nEj: 341| 1.21M| { 342| 1.21M| assert(n <= branches); ------------------ | Branch (342:9): [True: 1.21M, False: 0] ------------------ 343| 1.21M| auto m = heap::allocate(sizeof_leaf_n(n)); 344| 1.21M| return make_leaf_n_into(m, sizeof_leaf_n(n), n); 345| 1.21M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_nIiEEPSB_jOT_: 470| 120k| { 471| 120k| assert(n >= 1); ------------------ | Branch (471:9): [True: 120k, False: 0] ------------------ 472| 120k| auto p = make_leaf_n(n); 473| 120k| IMMER_TRY { ------------------ | | 49| 120k|#define IMMER_TRY try ------------------ 474| 120k| new (p->leaf()) T(std::forward(x)); 475| 120k| } 476| 120k| 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| 120k| return p; 481| 120k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13do_copy_innerEPSB_SC_j: 558| 2.58M| { 559| 2.58M| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 2.58M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (559:9): [True: 2.58M, False: 0] ------------------ 560| 2.58M| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 2.58M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (560:9): [True: 2.58M, False: 0] ------------------ 561| 2.58M| auto p = src->inner(); 562| 2.58M| inc_nodes(p, n); 563| 2.58M| std::copy(p, p + n, dst->inner()); 564| 2.58M| return dst; 565| 2.58M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9inc_nodesEPPSB_j: 970| 8.07M| { 971| 21.6M| for (auto i = p, e = i + n; i != e; ++i) ------------------ | Branch (971:37): [True: 13.5M, False: 8.07M] ------------------ 972| 13.5M| refs(*i).inc(); 973| 8.07M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14copy_inner_r_nEjPSB_j: 588| 501k| { 589| 501k| assert(allocn >= n); ------------------ | Branch (589:9): [True: 501k, False: 0] ------------------ 590| 501k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 501k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (590:9): [True: 501k, False: 0] ------------------ 591| 501k| auto dst = make_inner_r_n(allocn); 592| 501k| return do_copy_inner_r(dst, src, n); 593| 501k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE15do_copy_inner_rEPSB_SC_j: 610| 525k| { 611| 525k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 525k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (611:9): [True: 525k, False: 0] ------------------ 612| 525k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 525k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (612:9): [True: 525k, False: 0] ------------------ 613| 525k| auto src_r = src->relaxed(); 614| 525k| auto dst_r = dst->relaxed(); 615| 525k| inc_nodes(src->inner(), n); 616| 525k| std::copy(src->inner(), src->inner() + n, dst->inner()); 617| 525k| std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 618| 525k| dst_r->d.count = n; 619| 525k| return dst; 620| 525k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14make_inner_r_nEj: 243| 10.2M| { 244| 10.2M| assert(n <= branches); ------------------ | Branch (244:9): [True: 10.2M, False: 0] ------------------ 245| 10.2M| auto mp = heap::allocate(sizeof_inner_r_n(n)); 246| 10.2M| auto mr = static_cast(nullptr); 247| 10.2M| if (embed_relaxed) { ------------------ | Branch (247:13): [Folded, False: 10.2M] ------------------ 248| 0| mr = reinterpret_cast(mp) + sizeof_inner_n(n); 249| 10.2M| } else { 250| 10.2M| IMMER_TRY { ------------------ | | 49| 10.2M|#define IMMER_TRY try ------------------ 251| 10.2M| mr = heap::allocate(sizeof_relaxed_n(n), norefs_tag{}); 252| 10.2M| } 253| 10.2M| IMMER_CATCH (...) { 254| 0| heap::deallocate(sizeof_inner_r_n(n), mp); 255| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 256| 0| } 257| 10.2M| } 258| 10.2M| auto p = new (mp) node_t; 259| 10.2M| auto r = new (mr) relaxed_t; 260| 10.2M| r->d.count = 0; 261| 10.2M| p->impl.d.data.inner.relaxed = r; 262| 10.2M|#if IMMER_TAGGED_NODE 263| 10.2M| p->impl.d.kind = node_t::kind_t::inner; 264| 10.2M|#endif 265| 10.2M| return p; 266| 10.2M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9make_pathEjPSB_: 498| 722k| { 499| 722k| IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf); ------------------ | | 68| 722k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (499:9): [True: 722k, False: 0] ------------------ 500| 722k| if (shift == endshift) ------------------ | Branch (500:13): [True: 533k, False: 189k] ------------------ 501| 533k| return node; 502| 189k| else { 503| 189k| auto n = node_t::make_inner_n(1); 504| 189k| IMMER_TRY { ------------------ | | 49| 189k|#define IMMER_TRY try ------------------ 505| 189k| n->inner()[0] = make_path(shift - B, node); 506| 189k| } 507| 189k| 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| 189k| return n; 512| 189k| } 513| 722k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12make_inner_nEj: 224| 2.80M| { 225| 2.80M| assert(n <= branches); ------------------ | Branch (225:9): [True: 2.80M, False: 0] ------------------ 226| 2.80M| auto m = heap::allocate(sizeof_inner_n(n)); 227| 2.80M| return make_inner_n_into(m, sizeof_inner_n(n), n); 228| 2.80M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9copy_leafEPSB_j: 666| 125k| { 667| 125k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 125k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (667:9): [True: 125k, False: 0] ------------------ 668| 125k| auto dst = make_leaf_n(n); 669| 125k| IMMER_TRY { ------------------ | | 49| 125k|#define IMMER_TRY try ------------------ 670| 125k| detail::uninitialized_copy( 671| 125k| src->leaf(), src->leaf() + n, dst->leaf()); 672| 125k| } 673| 125k| 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| 125k| return dst; 678| 125k| } _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| 300k| { 270| 300k| return static_if( 271| 300k| [&](auto) { return node_t::make_inner_r_n(n); }, 272| 300k| [&](auto) { 273| 300k| auto p = 274| 300k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 300k| assert(r->d.count >= n); 276| 300k| node_t::refs(r).inc(); 277| 300k| p->impl.d.data.inner.relaxed = r; 278| 300k|#if IMMER_TAGGED_NODE 279| 300k| p->impl.d.kind = node_t::kind_t::inner; 280| 300k|#endif 281| 300k| return p; 282| 300k| }); 283| 300k| } _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| 300k| [&](auto) { 273| 300k| auto p = 274| 300k| new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t; 275| 300k| assert(r->d.count >= n); ------------------ | Branch (275:17): [True: 300k, False: 0] ------------------ 276| 300k| node_t::refs(r).inc(); 277| 300k| p->impl.d.data.inner.relaxed = r; 278| 300k|#if IMMER_TAGGED_NODE 279| 300k| p->impl.d.kind = node_t::kind_t::inner; 280| 300k|#endif 281| 300k| return p; 282| 300k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE24do_copy_inner_replace_srEPSB_SC_jjSC_: 652| 300k| { 653| 300k| if (embed_relaxed) ------------------ | Branch (653:13): [Folded, False: 300k] ------------------ 654| 0| return do_copy_inner_replace_r(dst, src, n, offset, child); 655| 300k| else { 656| 300k| auto p = src->inner(); 657| 300k| inc_nodes(p, offset); 658| 300k| inc_nodes(p + offset + 1, n - offset - 1); 659| 300k| std::copy(p, p + n, dst->inner()); 660| 300k| dst->inner()[offset] = child; 661| 300k| return dst; 662| 300k| } 663| 300k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE21do_copy_inner_replaceEPSB_SC_jjSC_: 569| 45.9k| { 570| 45.9k| IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner); ------------------ | | 68| 45.9k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (570:9): [True: 45.9k, False: 0] ------------------ 571| 45.9k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 45.9k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (571:9): [True: 45.9k, False: 0] ------------------ 572| 45.9k| auto p = src->inner(); 573| 45.9k| inc_nodes(p, offset); 574| 45.9k| inc_nodes(p + offset + 1, n - offset - 1); 575| 45.9k| std::copy(p, p + n, dst->inner()); 576| 45.9k| dst->inner()[offset] = child; 577| 45.9k| return dst; 578| 45.9k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12copy_inner_nEjPSB_j: 543| 8.40k| { 544| 8.40k| assert(allocn >= n); ------------------ | Branch (544:9): [True: 8.40k, False: 0] ------------------ 545| 8.40k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 8.40k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (545:9): [True: 8.40k, False: 0] ------------------ 546| 8.40k| auto dst = make_inner_n(allocn); 547| 8.40k| return do_copy_inner(dst, src, n); 548| 8.40k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12copy_inner_rEPSB_j: 581| 4.61k| { 582| 4.61k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 4.61k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (582:9): [True: 4.61k, False: 0] ------------------ 583| 4.61k| auto dst = make_inner_r_n(n); 584| 4.61k| return do_copy_inner_r(dst, src, n); 585| 4.61k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13compute_shiftEv: 977| 4.44M| { 978| 4.44M| if (kind() == kind_t::leaf) ------------------ | Branch (978:13): [True: 393k, False: 4.04M] ------------------ 979| 393k| return endshift; 980| 4.04M| else 981| 4.04M| return B + inner()[0]->compute_shift(); 982| 4.44M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5checkEjm: 986| 393k| { 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| 393k| return true; 1023| 393k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9copy_leafEPSB_jj: 778| 313k| { 779| 313k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 313k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (779:9): [True: 313k, False: 0] ------------------ 780| 313k| auto dst = make_leaf_n(last - idx); 781| 313k| IMMER_TRY { ------------------ | | 49| 313k|#define IMMER_TRY try ------------------ 782| 313k| detail::uninitialized_copy( 783| 313k| src->leaf() + idx, src->leaf() + last, dst->leaf()); 784| 313k| } 785| 313k| 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| 313k| return dst; 790| 313k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9copy_leafEPSB_jSC_j: 712| 303k| { 713| 303k| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 303k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (713:9): [True: 303k, False: 0] ------------------ 714| 303k| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 303k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (714:9): [True: 303k, False: 0] ------------------ 715| 303k| auto dst = make_leaf_n(n1 + n2); 716| 303k| IMMER_TRY { ------------------ | | 49| 303k|#define IMMER_TRY try ------------------ 717| 303k| detail::uninitialized_copy( 718| 303k| src1->leaf(), src1->leaf() + n1, dst->leaf()); 719| 303k| } 720| 303k| 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| 303k| IMMER_TRY { ------------------ | | 49| 303k|#define IMMER_TRY try ------------------ 725| 303k| detail::uninitialized_copy( 726| 303k| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 727| 303k| } 728| 303k| 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| 303k| return dst; 734| 303k| } _ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10can_mutateENS9_5applyIS6_E4type4editE: 870| 1.71M| { 871| 1.71M| return refs(this).unique() || ownee(this).can_mutate(e); ------------------ | Branch (871:16): [True: 1.61M, False: 96.9k] | Branch (871:39): [True: 0, False: 96.9k] ------------------ 872| 1.71M| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5owneeEPKSB_: 207| 96.9k| { 208| 96.9k| return get(x->impl); 209| 96.9k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_j: 681| 31.9k| { 682| 31.9k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf); ------------------ | | 68| 31.9k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (682:9): [True: 31.9k, False: 0] ------------------ 683| 31.9k| auto dst = make_leaf_e(e); 684| 31.9k| IMMER_TRY { ------------------ | | 49| 31.9k|#define IMMER_TRY try ------------------ 685| 31.9k| detail::uninitialized_copy( 686| 31.9k| src->leaf(), src->leaf() + n, dst->leaf()); 687| 31.9k| } 688| 31.9k| IMMER_CATCH (...) { 689| 0| heap::deallocate(node_t::max_sizeof_leaf, dst); 690| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 691| 0| } 692| 31.9k| return dst; 693| 31.9k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_eENS9_5applyIS6_E4type4editE: 348| 199k| { 349| 199k| auto p = new (heap::allocate(max_sizeof_leaf)) node_t; 350| 199k| ownee(p) = e; 351| 199k|#if IMMER_TAGGED_NODE 352| 199k| p->impl.d.kind = node_t::kind_t::leaf; 353| 199k|#endif 354| 199k| return p; 355| 199k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11make_leaf_eIiEEPSB_NS9_5applyIS6_E4type4editEOT_: 485| 13.7k| { 486| 13.7k| auto p = make_leaf_e(e); 487| 13.7k| IMMER_TRY { ------------------ | | 49| 13.7k|#define IMMER_TRY try ------------------ 488| 13.7k| new (p->leaf()) T(std::forward(x)); 489| 13.7k| } 490| 13.7k| IMMER_CATCH (...) { 491| 0| heap::deallocate(node_t::max_sizeof_leaf, p); 492| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 493| 0| } 494| 13.7k| return p; 495| 13.7k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEj: 930| 64.6k| { 931| 64.6k| auto src_r = relaxed(); 932| 64.6k| return static_if( 933| 64.6k| [&](auto) { return src_r; }, 934| 64.6k| [&](auto) { 935| 64.6k| if (node_t::refs(src_r).unique() || 936| 64.6k| node_t::ownee(src_r).can_mutate(e)) 937| 64.6k| return src_r; 938| 64.6k| else { 939| 64.6k| auto dst_r = 940| 64.6k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 64.6k| if (src_r) { 942| 64.6k| std::copy( 943| 64.6k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 64.6k| if (node_t::refs(src_r).dec()) 945| 64.6k| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 64.6k| src_r); 947| 64.6k| } 948| 64.6k| dst_r->d.count = n; 949| 64.6k| node_t::ownee(dst_r) = e; 950| 64.6k| return impl.d.data.inner.relaxed = dst_r; 951| 64.6k| } 952| 64.6k| }); 953| 64.6k| } _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| 64.6k| [&](auto) { 935| 64.6k| if (node_t::refs(src_r).unique() || ------------------ | Branch (935:21): [True: 51.6k, False: 12.9k] ------------------ 936| 12.9k| node_t::ownee(src_r).can_mutate(e)) ------------------ | Branch (936:21): [True: 0, False: 12.9k] ------------------ 937| 51.6k| return src_r; 938| 12.9k| else { 939| 12.9k| auto dst_r = 940| 12.9k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 941| 12.9k| if (src_r) { ------------------ | Branch (941:25): [True: 12.9k, False: 0] ------------------ 942| 12.9k| std::copy( 943| 12.9k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 944| 12.9k| if (node_t::refs(src_r).dec()) ------------------ | Branch (944:29): [True: 0, False: 12.9k] ------------------ 945| 0| heap::deallocate(node_t::sizeof_inner_r_n(n), 946| 0| src_r); 947| 12.9k| } 948| 12.9k| dst_r->d.count = n; 949| 12.9k| node_t::ownee(dst_r) = e; 950| 12.9k| return impl.d.data.inner.relaxed = dst_r; 951| 12.9k| } 952| 64.6k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14copy_inner_r_eENS9_5applyIS6_E4type4editEPSB_j: 596| 19.3k| { 597| 19.3k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 19.3k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (597:9): [True: 19.3k, False: 0] ------------------ 598| 19.3k| auto dst = make_inner_r_e(e); 599| 19.3k| return do_copy_inner_r(dst, src, n); 600| 19.3k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14make_inner_r_eENS9_5applyIS6_E4type4editE: 286| 100k| { 287| 100k| auto mp = heap::allocate(max_sizeof_inner_r); 288| 100k| auto mr = static_cast(nullptr); 289| 100k| if (embed_relaxed) { ------------------ | Branch (289:13): [Folded, False: 100k] ------------------ 290| 0| mr = reinterpret_cast(mp) + max_sizeof_inner; 291| 100k| } else { 292| 100k| IMMER_TRY { ------------------ | | 49| 100k|#define IMMER_TRY try ------------------ 293| 100k| mr = heap::allocate(max_sizeof_relaxed, norefs_tag{}); 294| 100k| } 295| 100k| IMMER_CATCH (...) { 296| 0| heap::deallocate(max_sizeof_inner_r, mp); 297| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 298| 0| } 299| 100k| } 300| 100k| auto p = new (mp) node_t; 301| 100k| auto r = new (mr) relaxed_t; 302| 100k| ownee(p) = e; 303| 100k| static_if([&](auto) { node_t::ownee(r) = e; }); 304| 100k| r->d.count = 0; 305| 100k| p->impl.d.data.inner.relaxed = r; 306| 100k|#if IMMER_TAGGED_NODE 307| 100k| p->impl.d.kind = node_t::kind_t::inner; 308| 100k|#endif 309| 100k| return p; 310| 100k| } _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| 100k| 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| 88.0k| { 232| 88.0k| auto m = heap::allocate(max_sizeof_inner); 233| 88.0k| auto p = new (m) node_t; 234| 88.0k| ownee(p) = e; 235| 88.0k| p->impl.d.data.inner.relaxed = nullptr; 236| 88.0k|#if IMMER_TAGGED_NODE 237| 88.0k| p->impl.d.kind = node_t::kind_t::inner; 238| 88.0k|#endif 239| 88.0k| return p; 240| 88.0k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE12copy_inner_eENS9_5applyIS6_E4type4editEPSB_j: 551| 16.2k| { 552| 16.2k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 16.2k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (552:9): [True: 16.2k, False: 0] ------------------ 553| 16.2k| auto dst = make_inner_e(e); 554| 16.2k| return do_copy_inner(dst, src, n); 555| 16.2k| } _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE15copy_inner_sr_eENS9_5applyIS6_E4type4editEPSB_j: 603| 11.3k| { 604| 11.3k| IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner); ------------------ | | 68| 11.3k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (604:9): [True: 11.3k, False: 0] ------------------ 605| 11.3k| auto dst = make_inner_sr_e(e, src->relaxed()); 606| 11.3k| return do_copy_inner_sr(dst, src, n); 607| 11.3k| } _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| 11.3k| { 314| 11.3k| return static_if( 315| 11.3k| [&](auto) { return node_t::make_inner_r_e(e); }, 316| 11.3k| [&](auto) { 317| 11.3k| auto p = 318| 11.3k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 11.3k| node_t::refs(r).inc(); 320| 11.3k| p->impl.d.data.inner.relaxed = r; 321| 11.3k| node_t::ownee(p) = e; 322| 11.3k|#if IMMER_TAGGED_NODE 323| 11.3k| p->impl.d.kind = node_t::kind_t::inner; 324| 11.3k|#endif 325| 11.3k| return p; 326| 11.3k| }); 327| 11.3k| } _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| 11.3k| [&](auto) { 317| 11.3k| auto p = 318| 11.3k| new (heap::allocate(node_t::max_sizeof_inner_r)) node_t; 319| 11.3k| node_t::refs(r).inc(); 320| 11.3k| p->impl.d.data.inner.relaxed = r; 321| 11.3k| node_t::ownee(p) = e; 322| 11.3k|#if IMMER_TAGGED_NODE 323| 11.3k| p->impl.d.kind = node_t::kind_t::inner; 324| 11.3k|#endif 325| 11.3k| return p; 326| 11.3k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE16do_copy_inner_srEPSB_SC_j: 640| 11.3k| { 641| 11.3k| if (embed_relaxed) ------------------ | Branch (641:13): [Folded, False: 11.3k] ------------------ 642| 0| return do_copy_inner_r(dst, src, n); 643| 11.3k| else { 644| 11.3k| inc_nodes(src->inner(), n); 645| 11.3k| std::copy(src->inner(), src->inner() + n, dst->inner()); 646| 11.3k| return dst; 647| 11.3k| } 648| 11.3k| } _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| 198k| { 878| 198k| auto src_r = relaxed(); 879| 198k| return static_if( 880| 198k| [&](auto) { return src_r; }, 881| 198k| [&](auto) { 882| 198k| if (node_t::refs(src_r).unique() || 883| 198k| node_t::ownee(src_r).can_mutate(e)) 884| 198k| return src_r; 885| 198k| else { 886| 198k| auto dst_r = impl.d.data.inner.relaxed = 887| 198k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 198k| if (src_r) { 889| 198k| auto n = dst_r->d.count = src_r->d.count; 890| 198k| std::copy( 891| 198k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 198k| if (node_t::refs(src_r).dec()) 893| 198k| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 198k| src_r); 895| 198k| } 896| 198k| node_t::ownee(dst_r) = e; 897| 198k| return dst_r; 898| 198k| } 899| 198k| }); 900| 198k| } _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| 198k| [&](auto) { 882| 198k| if (node_t::refs(src_r).unique() || ------------------ | Branch (882:21): [True: 189k, False: 9.00k] ------------------ 883| 9.00k| node_t::ownee(src_r).can_mutate(e)) ------------------ | Branch (883:21): [True: 0, False: 9.00k] ------------------ 884| 189k| return src_r; 885| 9.00k| else { 886| 9.00k| auto dst_r = impl.d.data.inner.relaxed = 887| 9.00k| new (heap::allocate(max_sizeof_relaxed)) relaxed_t; 888| 9.00k| if (src_r) { ------------------ | Branch (888:25): [True: 9.00k, False: 0] ------------------ 889| 9.00k| auto n = dst_r->d.count = src_r->d.count; 890| 9.00k| std::copy( 891| 9.00k| src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes); 892| 9.00k| if (node_t::refs(src_r).dec()) ------------------ | Branch (892:29): [True: 0, False: 9.00k] ------------------ 893| 0| heap::deallocate(node_t::sizeof_inner_r_n(n), 894| 0| src_r); 895| 9.00k| } 896| 9.00k| node_t::ownee(dst_r) = e; 897| 9.00k| return dst_r; 898| 9.00k| } 899| 198k| }); _ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jSG_j: 738| 326| { 739| 326| IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf); ------------------ | | 68| 326|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (739:9): [True: 326, False: 0] ------------------ 740| 326| IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf); ------------------ | | 68| 326|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (740:9): [True: 326, False: 0] ------------------ 741| 326| auto dst = make_leaf_e(e); 742| 326| IMMER_TRY { ------------------ | | 49| 326|#define IMMER_TRY try ------------------ 743| 326| detail::uninitialized_copy( 744| 326| src1->leaf(), src1->leaf() + n1, dst->leaf()); 745| 326| } 746| 326| IMMER_CATCH (...) { 747| 0| heap::deallocate(max_sizeof_leaf, dst); 748| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 749| 0| } 750| 326| IMMER_TRY { ------------------ | | 49| 326|#define IMMER_TRY try ------------------ 751| 326| detail::uninitialized_copy( 752| 326| src2->leaf(), src2->leaf() + n2, dst->leaf() + n1); 753| 326| } 754| 326| 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| 326| return dst; 760| 326| } _ZN5immer6detail4rbts11dec_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 523| 32.9M| { 524| 32.9M| using node_t = node_type; 525| 32.9M| auto node = p.node(); 526| 32.9M| if (node->dec()) { ------------------ | Branch (526:13): [True: 10.6M, False: 22.2M] ------------------ 527| 10.6M| p.each(this_t{}); 528| 10.6M| node_t::delete_inner_r(node, p.count()); 529| 10.6M| } 530| 32.9M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 534| 2.24M| { 535| 2.24M| using node_t = node_type; 536| 2.24M| auto node = p.node(); 537| 2.24M| if (node->dec()) { ------------------ | Branch (537:13): [True: 565k, False: 1.67M] ------------------ 538| 565k| p.each(this_t{}); 539| 565k| node_t::delete_inner(node, p.count()); 540| 565k| } 541| 2.24M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 545| 1.13M| { 546| 1.13M| using node_t = node_type; 547| 1.13M| auto node = p.node(); 548| 1.13M| if (node->dec()) { ------------------ | Branch (548:13): [True: 510k, False: 625k] ------------------ 549| 510k| node_t::delete_leaf(node, p.count()); 550| 510k| } 551| 1.13M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 545| 451k| { 546| 451k| using node_t = node_type; 547| 451k| auto node = p.node(); 548| 451k| if (node->dec()) { ------------------ | Branch (548:13): [True: 20.0k, False: 431k] ------------------ 549| 20.0k| node_t::delete_leaf(node, p.count()); 550| 20.0k| } 551| 451k| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 534| 3.26M| { 535| 3.26M| using node_t = node_type; 536| 3.26M| auto node = p.node(); 537| 3.26M| if (node->dec()) { ------------------ | Branch (537:13): [True: 215k, False: 3.04M] ------------------ 538| 215k| p.each(this_t{}); 539| 215k| node_t::delete_inner(node, p.count()); 540| 215k| } 541| 3.26M| } _ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 534| 2.21M| { 535| 2.21M| using node_t = node_type; 536| 2.21M| auto node = p.node(); 537| 2.21M| if (node->dec()) { ------------------ | Branch (537:13): [True: 2.08M, False: 129k] ------------------ 538| 2.08M| p.each(this_t{}); 539| 2.08M| node_t::delete_inner(node, p.count()); 540| 2.08M| } 541| 2.21M| } _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.42M| { 546| 9.42M| using node_t = node_type; 547| 9.42M| auto node = p.node(); 548| 9.42M| if (node->dec()) { ------------------ | Branch (548:13): [True: 885k, False: 8.54M] ------------------ 549| 885k| node_t::delete_leaf(node, p.count()); 550| 885k| } 551| 9.42M| } _ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_: 545| 1.52M| { 546| 1.52M| using node_t = node_type; 547| 1.52M| auto node = p.node(); 548| 1.52M| if (node->dec()) { ------------------ | Branch (548:13): [True: 0, False: 1.52M] ------------------ 549| 0| node_t::delete_leaf(node, p.count()); 550| 0| } 551| 1.52M| } _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| 496k| { 792| 496k| auto level = pos.shift(); 793| 496k| auto idx = pos.count() - 1; 794| 496k| auto children = pos.size(idx); 795| 496k| auto new_idx = 796| 496k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (796:13): [True: 13.0k, False: 483k] | Branch (796:47): [True: 822, False: 482k] ------------------ 797| 496k| auto new_child = static_cast(nullptr); 798| 496k| if (new_idx >= branches) ------------------ | Branch (798:13): [True: 4.58k, False: 491k] ------------------ 799| 4.58k| return nullptr; 800| 491k| else if (idx == new_idx) { ------------------ | Branch (800:18): [True: 482k, False: 9.33k] ------------------ 801| 482k| new_child = pos.last_oh_csh(this_t{}, idx, children, tail, ts); 802| 482k| if (!new_child) { ------------------ | Branch (802:17): [True: 4.17k, False: 478k] ------------------ 803| 4.17k| if (++new_idx < branches) ------------------ | Branch (803:21): [True: 2.75k, False: 1.42k] ------------------ 804| 2.75k| new_child = node_t::make_path(level - B, tail); 805| 1.42k| else 806| 1.42k| return nullptr; 807| 4.17k| } 808| 482k| } else 809| 9.33k| new_child = node_t::make_path(level - B, tail); 810| 490k| IMMER_TRY { ------------------ | | 49| 490k|#define IMMER_TRY try ------------------ 811| 490k| auto count = new_idx + 1; 812| 490k| auto new_parent = 813| 490k| node_t::copy_inner_r_n(count, pos.node(), new_idx); 814| 490k| auto new_relaxed = new_parent->relaxed(); 815| 490k| new_parent->inner()[new_idx] = new_child; 816| 490k| new_relaxed->d.sizes[new_idx] = pos.size() + ts; 817| 490k| new_relaxed->d.count = count; 818| 490k| assert(new_relaxed->d.sizes[new_idx]); ------------------ | Branch (818:13): [True: 490k, False: 0] ------------------ 819| 490k| return new_parent; 820| 490k| } 821| 490k| 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| 490k| } _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| 193k| { 835| 193k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 193k, False: 0] ------------------ 836| 193k| auto idx = pos.index(pos.size() - 1); 837| 193k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 193k| auto count = new_idx + 1; 839| 193k| auto new_parent = node_t::make_inner_n(count); 840| 193k| IMMER_TRY { ------------------ | | 49| 193k|#define IMMER_TRY try ------------------ 841| 193k| new_parent->inner()[new_idx] = 842| 193k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 185k, False: 7.83k] ------------------ 843| | /* otherwise */ 844| 193k| : node_t::make_path(pos.shift() - B, tail); 845| 193k| } 846| 193k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 193k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 193k| } _ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_regularIRNS1_11regular_posISC_EEJEEEPSC_OT_SI_DpOT0_: 834| 2.05M| { 835| 2.05M| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 2.05M, False: 0] ------------------ 836| 2.05M| auto idx = pos.index(pos.size() - 1); 837| 2.05M| auto new_idx = pos.index(pos.size() + branches - 1); 838| 2.05M| auto count = new_idx + 1; 839| 2.05M| auto new_parent = node_t::make_inner_n(count); 840| 2.05M| IMMER_TRY { ------------------ | | 49| 2.05M|#define IMMER_TRY try ------------------ 841| 2.05M| new_parent->inner()[new_idx] = 842| 2.05M| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 1.57M, False: 481k] ------------------ 843| | /* otherwise */ 844| 2.05M| : node_t::make_path(pos.shift() - B, tail); 845| 2.05M| } 846| 2.05M| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 2.05M| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 2.05M| } _ZN5immer6detail4rbts9dec_innerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEvPT_jm: 562| 559|{ 563| 559| visit_maybe_relaxed_sub(node, shift, size, dec_visitor()); 564| 559|} _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| 310k| { 835| 310k| assert((pos.size() & mask) == 0); ------------------ | Branch (835:9): [True: 310k, False: 0] ------------------ 836| 310k| auto idx = pos.index(pos.size() - 1); 837| 310k| auto new_idx = pos.index(pos.size() + branches - 1); 838| 310k| auto count = new_idx + 1; 839| 310k| auto new_parent = node_t::make_inner_n(count); 840| 310k| IMMER_TRY { ------------------ | | 49| 310k|#define IMMER_TRY try ------------------ 841| 310k| new_parent->inner()[new_idx] = 842| 310k| idx == new_idx ? pos.last_oh(this_t{}, idx, tail) ------------------ | Branch (842:17): [True: 295k, False: 14.5k] ------------------ 843| | /* otherwise */ 844| 310k| : node_t::make_path(pos.shift() - B, tail); 845| 310k| } 846| 310k| IMMER_CATCH (...) { 847| 0| node_t::delete_inner(new_parent, count); 848| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 849| 0| } 850| 310k| return node_t::do_copy_inner(new_parent, pos.node(), new_idx); 851| 310k| } 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| 90.4k| { 503| 90.4k| auto offset = pos.index(idx); 504| 90.4k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 90.4k| IMMER_TRY { ------------------ | | 49| 90.4k|#define IMMER_TRY try ------------------ 506| 90.4k| node->leaf()[offset] = 507| 90.4k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 90.4k| return node; 509| 90.4k| } 510| 90.4k| IMMER_CATCH (...) { 511| 0| node_t::delete_leaf(node, pos.count()); 512| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 513| 0| } 514| 90.4k| } 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| 300k| { 467| 300k| auto offset = pos.index(idx); 468| 300k| auto count = pos.count(); 469| 300k| auto node = node_t::make_inner_sr_n(count, pos.relaxed()); 470| 300k| IMMER_TRY { ------------------ | | 49| 300k|#define IMMER_TRY try ------------------ 471| 300k| auto child = pos.towards_oh(this_t{}, idx, offset, fn); 472| 300k| node_t::do_copy_inner_replace_sr( 473| 300k| node, pos.node(), count, offset, child); 474| 300k| return node; 475| 300k| } 476| 300k| IMMER_CATCH (...) { 477| 0| node_t::delete_inner_r(node, count); 478| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 479| 0| } 480| 300k| } flex-vector.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_regularIRNS1_15regular_sub_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 484| 25.9k| { 485| 25.9k| auto offset = pos.index(idx); 486| 25.9k| auto count = pos.count(); 487| 25.9k| auto node = node_t::make_inner_n(count); 488| 25.9k| IMMER_TRY { ------------------ | | 49| 25.9k|#define IMMER_TRY try ------------------ 489| 25.9k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 25.9k| node_t::do_copy_inner_replace( 491| 25.9k| node, pos.node(), count, offset, child); 492| 25.9k| return node; 493| 25.9k| } 494| 25.9k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 25.9k| } flex-vector.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_13full_leaf_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 502| 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.4k| { 485| 16.4k| auto offset = pos.index(idx); 486| 16.4k| auto count = pos.count(); 487| 16.4k| auto node = node_t::make_inner_n(count); 488| 16.4k| IMMER_TRY { ------------------ | | 49| 16.4k|#define IMMER_TRY try ------------------ 489| 16.4k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 16.4k| node_t::do_copy_inner_replace( 491| 16.4k| node, pos.node(), count, offset, child); 492| 16.4k| return node; 493| 16.4k| } 494| 16.4k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 16.4k| } flex-vector.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_8leaf_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_: 502| 4.23k| { 503| 4.23k| auto offset = pos.index(idx); 504| 4.23k| auto node = node_t::copy_leaf(pos.node(), pos.count()); 505| 4.23k| IMMER_TRY { ------------------ | | 49| 4.23k|#define IMMER_TRY try ------------------ 506| 4.23k| node->leaf()[offset] = 507| 4.23k| std::forward(fn)(std::move(node->leaf()[offset])); 508| 4.23k| return node; 509| 4.23k| } 510| 4.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| 4.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| 3.60k| { 485| 3.60k| auto offset = pos.index(idx); 486| 3.60k| auto count = pos.count(); 487| 3.60k| auto node = node_t::make_inner_n(count); 488| 3.60k| IMMER_TRY { ------------------ | | 49| 3.60k|#define IMMER_TRY try ------------------ 489| 3.60k| auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn); 490| 3.60k| node_t::do_copy_inner_replace( 491| 3.60k| node, pos.node(), count, offset, child); 492| 3.60k| return node; 493| 3.60k| } 494| 3.60k| IMMER_CATCH (...) { 495| 0| node_t::delete_inner(node, count); 496| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 497| 0| } 498| 3.60k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1096| 33.4k| { 1097| 33.4k| auto idx = pos.index(last); 1098| 33.4k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [True: 33.4k, Folded] | Branch (1098:25): [True: 24.7k, False: 8.67k] ------------------ 1099| 24.7k| return pos.towards_oh(this_t{}, last, idx); 1100| 24.7k| } else { 1101| 8.67k| using std::get; 1102| 8.67k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 8.67k| auto next = get<1>(subs); 1104| 8.67k| auto ts = get<2>(subs); 1105| 8.67k| auto tail = get<3>(subs); 1106| 8.67k| IMMER_TRY { ------------------ | | 49| 8.67k|#define IMMER_TRY try ------------------ 1107| 8.67k| if (next) { ------------------ | Branch (1107:21): [True: 4.84k, False: 3.83k] ------------------ 1108| 4.84k| auto count = idx + 1; 1109| 4.84k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 4.84k| auto newr = newn->relaxed(); 1111| 4.84k| newn->inner()[idx] = next; 1112| 4.84k| newr->d.sizes[idx] = last + 1 - ts; 1113| 4.84k| newr->d.count = count; 1114| 4.84k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 4.84k, False: 0] ------------------ 1115| 4.84k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 4.84k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 0, False: 3.83k] ------------------ 1117| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 3.83k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [True: 3.83k, Folded] | Branch (1118:40): [True: 2.85k, False: 972] | Branch (1118:52): [True: 2.09k, False: 769] ------------------ 1119| 2.09k| auto newn = pos.node()->inner()[0]; 1120| 2.09k| return std::make_tuple( 1121| 2.09k| pos.shift() - B, newn->inc(), ts, tail); 1122| 2.09k| } else { 1123| 1.74k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 1.74k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 1.74k| } 1126| 8.67k| } 1127| 8.67k| IMMER_CATCH (...) { 1128| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1128:17): [True: 0, False: 0] | Branch (1128:17): [True: 0, False: 0] | Branch (1128:17): [True: 0, False: 0] ------------------ 1129| 0| if (next) ------------------ | Branch (1129:21): [True: 0, False: 0] ------------------ 1130| 0| dec_inner(next, 1131| 0| pos.shift() - B, 1132| 0| last + 1 - ts - pos.size_before(idx)); 1133| 0| if (tail) ------------------ | Branch (1133:21): [True: 0, False: 0] ------------------ 1134| 0| dec_leaf(tail, ts); 1135| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1136| 0| } 1137| 8.67k| } 1138| 33.4k| } _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.03k| { 1182| 2.03k| auto old_tail_size = pos.count(); 1183| 2.03k| auto new_tail_size = pos.index(last) + 1; 1184| 2.03k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.01k, False: 1.02k] ------------------ 1185| 2.03k| ? pos.node()->inc() 1186| 2.03k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 2.03k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 2.03k| } _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.08k| { 1182| 5.08k| auto old_tail_size = pos.count(); 1183| 5.08k| auto new_tail_size = pos.index(last) + 1; 1184| 5.08k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 2.48k, False: 2.59k] ------------------ 1185| 5.08k| ? pos.node()->inc() 1186| 5.08k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 5.08k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 5.08k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1096| 11.3k| { 1097| 11.3k| auto idx = pos.index(last); 1098| 11.3k| if (Collapse && idx == 0) { ------------------ | Branch (1098:13): [Folded, False: 11.3k] | Branch (1098:25): [True: 0, False: 0] ------------------ 1099| 0| return pos.towards_oh(this_t{}, last, idx); 1100| 11.3k| } else { 1101| 11.3k| using std::get; 1102| 11.3k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1103| 11.3k| auto next = get<1>(subs); 1104| 11.3k| auto ts = get<2>(subs); 1105| 11.3k| auto tail = get<3>(subs); 1106| 11.3k| IMMER_TRY { ------------------ | | 49| 11.3k|#define IMMER_TRY try ------------------ 1107| 11.3k| if (next) { ------------------ | Branch (1107:21): [True: 5.79k, False: 5.56k] ------------------ 1108| 5.79k| auto count = idx + 1; 1109| 5.79k| auto newn = node_t::copy_inner_r_n(count, pos.node(), idx); 1110| 5.79k| auto newr = newn->relaxed(); 1111| 5.79k| newn->inner()[idx] = next; 1112| 5.79k| newr->d.sizes[idx] = last + 1 - ts; 1113| 5.79k| newr->d.count = count; 1114| 5.79k| assert(newr->d.sizes[idx]); ------------------ | Branch (1114:21): [True: 5.79k, False: 0] ------------------ 1115| 5.79k| return std::make_tuple(pos.shift(), newn, ts, tail); 1116| 5.79k| } else if (idx == 0) { ------------------ | Branch (1116:28): [True: 2.68k, False: 2.87k] ------------------ 1117| 2.68k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1118| 2.87k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1118:28): [Folded, False: 2.87k] | Branch (1118:40): [True: 0, False: 0] | Branch (1118:52): [True: 0, False: 0] ------------------ 1119| 0| auto newn = pos.node()->inner()[0]; 1120| 0| return std::make_tuple( 1121| 0| pos.shift() - B, newn->inc(), ts, tail); 1122| 2.87k| } else { 1123| 2.87k| auto newn = node_t::copy_inner_r(pos.node(), idx); 1124| 2.87k| return std::make_tuple(pos.shift(), newn, ts, tail); 1125| 2.87k| } 1126| 11.3k| } 1127| 11.3k| IMMER_CATCH (...) { 1128| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1128:17): [True: 0, False: 0] | Branch (1128:17): [True: 0, False: 0] | Branch (1128:17): [True: 0, False: 0] ------------------ 1129| 0| if (next) ------------------ | Branch (1129:21): [True: 0, False: 0] ------------------ 1130| 0| dec_inner(next, 1131| 0| pos.shift() - B, 1132| 0| last + 1 - ts - pos.size_before(idx)); 1133| 0| if (tail) ------------------ | Branch (1133:21): [True: 0, False: 0] ------------------ 1134| 0| dec_leaf(tail, ts); 1135| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1136| 0| } 1137| 11.3k| } 1138| 11.3k| } _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.59k| { 1143| 3.59k| auto idx = pos.index(last); 1144| 3.59k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 3.59k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 3.59k| } else { 1147| 3.59k| using std::get; 1148| 3.59k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 3.59k| auto next = get<1>(subs); 1150| 3.59k| auto ts = get<2>(subs); 1151| 3.59k| auto tail = get<3>(subs); 1152| 3.59k| IMMER_TRY { ------------------ | | 49| 3.59k|#define IMMER_TRY try ------------------ 1153| 3.59k| if (next) { ------------------ | Branch (1153:21): [True: 1.32k, False: 2.26k] ------------------ 1154| 1.32k| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 1.32k| newn->inner()[idx] = next; 1156| 1.32k| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.26k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 1.61k, False: 646] ------------------ 1158| 1.61k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.61k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 646] | 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| 646| } else { 1164| 646| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 646| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 646| } 1167| 3.59k| } 1168| 3.59k| 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.59k| } 1177| 3.59k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 6.25k| { 1182| 6.25k| auto old_tail_size = pos.count(); 1183| 6.25k| auto new_tail_size = pos.index(last) + 1; 1184| 6.25k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 4.34k, False: 1.90k] ------------------ 1185| 6.25k| ? pos.node()->inc() 1186| 6.25k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 6.25k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 6.25k| } _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.66k| { 1143| 2.66k| auto idx = pos.index(last); 1144| 2.66k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 2.66k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 2.66k| } else { 1147| 2.66k| using std::get; 1148| 2.66k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 2.66k| auto next = get<1>(subs); 1150| 2.66k| auto ts = get<2>(subs); 1151| 2.66k| auto tail = get<3>(subs); 1152| 2.66k| IMMER_TRY { ------------------ | | 49| 2.66k|#define IMMER_TRY try ------------------ 1153| 2.66k| if (next) { ------------------ | Branch (1153:21): [True: 315, False: 2.34k] ------------------ 1154| 315| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 315| newn->inner()[idx] = next; 1156| 315| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.34k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 1.51k, False: 838] ------------------ 1158| 1.51k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.51k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 838] | 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| 838| } else { 1164| 838| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 838| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 838| } 1167| 2.66k| } 1168| 2.66k| 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.66k| } 1177| 2.66k| } _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| 1.95k| { 1182| 1.95k| auto old_tail_size = pos.count(); 1183| 1.95k| auto new_tail_size = pos.index(last) + 1; 1184| 1.95k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 1.01k, False: 937] ------------------ 1185| 1.95k| ? pos.node()->inc() 1186| 1.95k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.95k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.95k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE13visit_regularIRNS1_11regular_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 4.30k| { 1143| 4.30k| auto idx = pos.index(last); 1144| 4.30k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [Folded, False: 4.30k] | Branch (1144:25): [True: 0, False: 0] ------------------ 1145| 0| return pos.towards_oh(this_t{}, last, idx); 1146| 4.30k| } else { 1147| 4.30k| using std::get; 1148| 4.30k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 4.30k| auto next = get<1>(subs); 1150| 4.30k| auto ts = get<2>(subs); 1151| 4.30k| auto tail = get<3>(subs); 1152| 4.30k| IMMER_TRY { ------------------ | | 49| 4.30k|#define IMMER_TRY try ------------------ 1153| 4.30k| if (next) { ------------------ | Branch (1153:21): [True: 809, False: 3.49k] ------------------ 1154| 809| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 809| newn->inner()[idx] = next; 1156| 809| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 3.49k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 1.80k, False: 1.69k] ------------------ 1158| 1.80k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.80k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [Folded, False: 1.69k] | 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.69k| } else { 1164| 1.69k| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 1.69k| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 1.69k| } 1167| 4.30k| } 1168| 4.30k| IMMER_CATCH (...) { 1169| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] ------------------ 1170| 0| assert(tail); ------------------ | Branch (1170:17): [True: 0, False: 0] ------------------ 1171| 0| if (next) ------------------ | Branch (1171:21): [True: 0, False: 0] ------------------ 1172| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1173| 0| dec_leaf(tail, ts); 1174| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1175| 0| } 1176| 4.30k| } 1177| 4.30k| } _ZN5immer6detail4rbts8dec_leafINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEvPT_j: 556| 42.9k|{ 557| 42.9k| make_leaf_sub_pos(node, n).visit(dec_visitor{}); 558| 42.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.56k| { 1143| 6.56k| auto idx = pos.index(last); 1144| 6.56k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 6.56k, Folded] | Branch (1144:25): [True: 3.35k, False: 3.20k] ------------------ 1145| 3.35k| return pos.towards_oh(this_t{}, last, idx); 1146| 3.35k| } else { 1147| 3.20k| using std::get; 1148| 3.20k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 3.20k| auto next = get<1>(subs); 1150| 3.20k| auto ts = get<2>(subs); 1151| 3.20k| auto tail = get<3>(subs); 1152| 3.20k| IMMER_TRY { ------------------ | | 49| 3.20k|#define IMMER_TRY try ------------------ 1153| 3.20k| if (next) { ------------------ | Branch (1153:21): [True: 880, False: 2.32k] ------------------ 1154| 880| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 880| newn->inner()[idx] = next; 1156| 880| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 2.32k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 2.32k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 2.32k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 2.32k, Folded] | Branch (1159:40): [True: 1.95k, False: 376] | Branch (1159:52): [True: 1.53k, False: 416] ------------------ 1160| 1.53k| auto newn = pos.node()->inner()[0]; 1161| 1.53k| return std::make_tuple( 1162| 1.53k| pos.shift() - B, newn->inc(), ts, tail); 1163| 1.53k| } else { 1164| 792| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 792| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 792| } 1167| 3.20k| } 1168| 3.20k| 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.20k| } 1177| 6.56k| } _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.28k| { 1182| 1.28k| auto old_tail_size = pos.count(); 1183| 1.28k| auto new_tail_size = pos.index(last) + 1; 1184| 1.28k| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 519, False: 763] ------------------ 1185| 1.28k| ? pos.node()->inc() 1186| 1.28k| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 1.28k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 1.28k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1142| 2.48k| { 1143| 2.48k| auto idx = pos.index(last); 1144| 2.48k| if (Collapse && idx == 0) { ------------------ | Branch (1144:13): [True: 2.48k, Folded] | Branch (1144:25): [True: 1.07k, False: 1.41k] ------------------ 1145| 1.07k| return pos.towards_oh(this_t{}, last, idx); 1146| 1.41k| } else { 1147| 1.41k| using std::get; 1148| 1.41k| auto subs = pos.towards_oh(no_collapse_t{}, last, idx); 1149| 1.41k| auto next = get<1>(subs); 1150| 1.41k| auto ts = get<2>(subs); 1151| 1.41k| auto tail = get<3>(subs); 1152| 1.41k| IMMER_TRY { ------------------ | | 49| 1.41k|#define IMMER_TRY try ------------------ 1153| 1.41k| if (next) { ------------------ | Branch (1153:21): [True: 328, False: 1.08k] ------------------ 1154| 328| auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx); 1155| 328| newn->inner()[idx] = next; 1156| 328| return std::make_tuple(pos.shift(), newn, ts, tail); 1157| 1.08k| } else if (idx == 0) { ------------------ | Branch (1157:28): [True: 0, False: 1.08k] ------------------ 1158| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1159| 1.08k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1159:28): [True: 1.08k, Folded] | Branch (1159:40): [True: 587, False: 497] | Branch (1159:52): [True: 309, False: 278] ------------------ 1160| 309| auto newn = pos.node()->inner()[0]; 1161| 309| return std::make_tuple( 1162| 309| pos.shift() - B, newn->inc(), ts, tail); 1163| 775| } else { 1164| 775| auto newn = node_t::copy_inner_n(idx, pos.node(), idx); 1165| 775| return std::make_tuple(pos.shift(), newn, ts, tail); 1166| 775| } 1167| 1.41k| } 1168| 1.41k| IMMER_CATCH (...) { 1169| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] | Branch (1169:17): [True: 0, False: 0] ------------------ 1170| 0| assert(tail); ------------------ | Branch (1170:17): [True: 0, False: 0] ------------------ 1171| 0| if (next) ------------------ | Branch (1171:21): [True: 0, False: 0] ------------------ 1172| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1173| 0| dec_leaf(tail, ts); 1174| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1175| 0| } 1176| 1.41k| } 1177| 2.48k| } _ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m: 1181| 661| { 1182| 661| auto old_tail_size = pos.count(); 1183| 661| auto new_tail_size = pos.index(last) + 1; 1184| 661| auto new_tail = new_tail_size == old_tail_size ------------------ | Branch (1184:30): [True: 276, False: 385] ------------------ 1185| 661| ? pos.node()->inc() 1186| 661| : node_t::copy_leaf(pos.node(), new_tail_size); 1187| 661| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1188| 661| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE11visit_innerIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 14.6k| { 1415| 14.6k| auto idx = pos.subindex(first); 1416| 14.6k| auto count = pos.count(); 1417| 14.6k| auto left_size = pos.size_before(idx); 1418| 14.6k| auto child_size = pos.size_sbh(idx, left_size); 1419| 14.6k| auto dropped_size = first; 1420| 14.6k| auto child_dropped_size = dropped_size - left_size; 1421| 14.6k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 14.6k, Folded] | Branch (1421:25): [True: 12.8k, False: 1.79k] | Branch (1421:45): [True: 4.19k, False: 8.67k] ------------------ 1422| 4.19k| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 10.4k| } else { 1424| 10.4k| using std::get; 1425| 10.4k| auto n = pos.node(); 1426| 10.4k| auto newc = count - idx; 1427| 10.4k| auto newn = node_t::make_inner_r_n(newc); 1428| 10.4k| IMMER_TRY { ------------------ | | 49| 10.4k|#define IMMER_TRY try ------------------ 1429| 10.4k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 10.4k| auto newr = newn->relaxed(); 1431| 10.4k| newr->d.count = count - idx; 1432| 10.4k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 10.4k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 10.4k, False: 0] ------------------ 1434| 10.4k| pos.copy_sizes(idx + 1, 1435| 10.4k| newr->d.count - 1, 1436| 10.4k| newr->d.sizes[0], 1437| 10.4k| newr->d.sizes + 1); 1438| 10.4k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 10.4k, False: 0] ------------------ 1439| 10.4k| pos.size() - dropped_size); 1440| 10.4k| newn->inner()[0] = get<1>(subs); 1441| 10.4k| std::copy(n->inner() + idx + 1, 1442| 10.4k| n->inner() + count, 1443| 10.4k| newn->inner() + 1); 1444| 10.4k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 10.4k| return std::make_tuple(pos.shift(), newn); 1446| 10.4k| } 1447| 10.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| 10.4k| } 1452| 14.6k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1456| 7.99k| { 1457| 7.99k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 7.99k| return std::make_tuple(0, n); 1459| 7.99k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE11visit_innerIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1414| 40.9k| { 1415| 40.9k| auto idx = pos.subindex(first); 1416| 40.9k| auto count = pos.count(); 1417| 40.9k| auto left_size = pos.size_before(idx); 1418| 40.9k| auto child_size = pos.size_sbh(idx, left_size); 1419| 40.9k| auto dropped_size = first; 1420| 40.9k| auto child_dropped_size = dropped_size - left_size; 1421| 40.9k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 40.9k] | Branch (1421:25): [True: 0, False: 0] | Branch (1421:45): [True: 0, False: 0] ------------------ 1422| 0| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 40.9k| } else { 1424| 40.9k| using std::get; 1425| 40.9k| auto n = pos.node(); 1426| 40.9k| auto newc = count - idx; 1427| 40.9k| auto newn = node_t::make_inner_r_n(newc); 1428| 40.9k| IMMER_TRY { ------------------ | | 49| 40.9k|#define IMMER_TRY try ------------------ 1429| 40.9k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 40.9k| auto newr = newn->relaxed(); 1431| 40.9k| newr->d.count = count - idx; 1432| 40.9k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 40.9k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 40.9k, False: 0] ------------------ 1434| 40.9k| pos.copy_sizes(idx + 1, 1435| 40.9k| newr->d.count - 1, 1436| 40.9k| newr->d.sizes[0], 1437| 40.9k| newr->d.sizes + 1); 1438| 40.9k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 40.9k, False: 0] ------------------ 1439| 40.9k| pos.size() - dropped_size); 1440| 40.9k| newn->inner()[0] = get<1>(subs); 1441| 40.9k| std::copy(n->inner() + idx + 1, 1442| 40.9k| n->inner() + count, 1443| 40.9k| newn->inner() + 1); 1444| 40.9k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 40.9k| return std::make_tuple(pos.shift(), newn); 1446| 40.9k| } 1447| 40.9k| IMMER_CATCH (...) { 1448| 0| node_t::delete_inner_r(newn, newc); 1449| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1450| 0| } 1451| 40.9k| } 1452| 40.9k| } _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.46k| { 1415| 2.46k| auto idx = pos.subindex(first); 1416| 2.46k| auto count = pos.count(); 1417| 2.46k| auto left_size = pos.size_before(idx); 1418| 2.46k| auto child_size = pos.size_sbh(idx, left_size); 1419| 2.46k| auto dropped_size = first; 1420| 2.46k| auto child_dropped_size = dropped_size - left_size; 1421| 2.46k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 2.46k] | 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.46k| } else { 1424| 2.46k| using std::get; 1425| 2.46k| auto n = pos.node(); 1426| 2.46k| auto newc = count - idx; 1427| 2.46k| auto newn = node_t::make_inner_r_n(newc); 1428| 2.46k| IMMER_TRY { ------------------ | | 49| 2.46k|#define IMMER_TRY try ------------------ 1429| 2.46k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 2.46k| auto newr = newn->relaxed(); 1431| 2.46k| newr->d.count = count - idx; 1432| 2.46k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 2.46k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 2.46k, False: 0] ------------------ 1434| 2.46k| pos.copy_sizes(idx + 1, 1435| 2.46k| newr->d.count - 1, 1436| 2.46k| newr->d.sizes[0], 1437| 2.46k| newr->d.sizes + 1); 1438| 2.46k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 2.46k, False: 0] ------------------ 1439| 2.46k| pos.size() - dropped_size); 1440| 2.46k| newn->inner()[0] = get<1>(subs); 1441| 2.46k| std::copy(n->inner() + idx + 1, 1442| 2.46k| n->inner() + count, 1443| 2.46k| newn->inner() + 1); 1444| 2.46k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 2.46k| return std::make_tuple(pos.shift(), newn); 1446| 2.46k| } 1447| 2.46k| 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.46k| } 1452| 2.46k| } _ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m: 1456| 9.18k| { 1457| 9.18k| auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count()); 1458| 9.18k| return std::make_tuple(0, n); 1459| 9.18k| } _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.75k| { 1415| 5.75k| auto idx = pos.subindex(first); 1416| 5.75k| auto count = pos.count(); 1417| 5.75k| auto left_size = pos.size_before(idx); 1418| 5.75k| auto child_size = pos.size_sbh(idx, left_size); 1419| 5.75k| auto dropped_size = first; 1420| 5.75k| auto child_dropped_size = dropped_size - left_size; 1421| 5.75k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [Folded, False: 5.75k] | 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.75k| } else { 1424| 5.75k| using std::get; 1425| 5.75k| auto n = pos.node(); 1426| 5.75k| auto newc = count - idx; 1427| 5.75k| auto newn = node_t::make_inner_r_n(newc); 1428| 5.75k| IMMER_TRY { ------------------ | | 49| 5.75k|#define IMMER_TRY try ------------------ 1429| 5.75k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 5.75k| auto newr = newn->relaxed(); 1431| 5.75k| newr->d.count = count - idx; 1432| 5.75k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 5.75k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 5.75k, False: 0] ------------------ 1434| 5.75k| pos.copy_sizes(idx + 1, 1435| 5.75k| newr->d.count - 1, 1436| 5.75k| newr->d.sizes[0], 1437| 5.75k| newr->d.sizes + 1); 1438| 5.75k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 5.75k, False: 0] ------------------ 1439| 5.75k| pos.size() - dropped_size); 1440| 5.75k| newn->inner()[0] = get<1>(subs); 1441| 5.75k| std::copy(n->inner() + idx + 1, 1442| 5.75k| n->inner() + count, 1443| 5.75k| newn->inner() + 1); 1444| 5.75k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 5.75k| return std::make_tuple(pos.shift(), newn); 1446| 5.75k| } 1447| 5.75k| 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.75k| } 1452| 5.75k| } _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| 8.69k| { 1415| 8.69k| auto idx = pos.subindex(first); 1416| 8.69k| auto count = pos.count(); 1417| 8.69k| auto left_size = pos.size_before(idx); 1418| 8.69k| auto child_size = pos.size_sbh(idx, left_size); 1419| 8.69k| auto dropped_size = first; 1420| 8.69k| auto child_dropped_size = dropped_size - left_size; 1421| 8.69k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 8.69k, Folded] | Branch (1421:25): [True: 5.99k, False: 2.69k] | Branch (1421:45): [True: 3.21k, False: 2.78k] ------------------ 1422| 3.21k| 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| 8.69k| } _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.57k| { 1415| 1.57k| auto idx = pos.subindex(first); 1416| 1.57k| auto count = pos.count(); 1417| 1.57k| auto left_size = pos.size_before(idx); 1418| 1.57k| auto child_size = pos.size_sbh(idx, left_size); 1419| 1.57k| auto dropped_size = first; 1420| 1.57k| auto child_dropped_size = dropped_size - left_size; 1421| 1.57k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1421:13): [True: 1.57k, Folded] | Branch (1421:25): [True: 546, False: 1.02k] | Branch (1421:45): [True: 327, False: 219] ------------------ 1422| 327| return pos.towards_sub_oh(this_t{}, first, idx); 1423| 1.24k| } else { 1424| 1.24k| using std::get; 1425| 1.24k| auto n = pos.node(); 1426| 1.24k| auto newc = count - idx; 1427| 1.24k| auto newn = node_t::make_inner_r_n(newc); 1428| 1.24k| IMMER_TRY { ------------------ | | 49| 1.24k|#define IMMER_TRY try ------------------ 1429| 1.24k| auto subs = pos.towards_sub_oh(no_collapse_t{}, first, idx); 1430| 1.24k| auto newr = newn->relaxed(); 1431| 1.24k| newr->d.count = count - idx; 1432| 1.24k| newr->d.sizes[0] = child_size - child_dropped_size; 1433| 1.24k| assert(newr->d.sizes[0]); ------------------ | Branch (1433:17): [True: 1.24k, False: 0] ------------------ 1434| 1.24k| pos.copy_sizes(idx + 1, 1435| 1.24k| newr->d.count - 1, 1436| 1.24k| newr->d.sizes[0], 1437| 1.24k| newr->d.sizes + 1); 1438| 1.24k| assert(newr->d.sizes[newr->d.count - 1] == ------------------ | Branch (1438:17): [True: 1.24k, False: 0] ------------------ 1439| 1.24k| pos.size() - dropped_size); 1440| 1.24k| newn->inner()[0] = get<1>(subs); 1441| 1.24k| std::copy(n->inner() + idx + 1, 1442| 1.24k| n->inner() + count, 1443| 1.24k| newn->inner() + 1); 1444| 1.24k| node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1); 1445| 1.24k| return std::make_tuple(pos.shift(), newn); 1446| 1.24k| } 1447| 1.24k| 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.24k| } 1452| 1.57k| } _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.74k|{ 2002| 7.74k| return make_singleton_regular_sub_pos(ltail, ltcount) 2003| 7.74k| .visit(concat_trees_left_visitor{}, 2004| 7.74k| empty_leaf_pos{}, 2005| 7.74k| rroot, 2006| 7.74k| rshift, 2007| 7.74k| rsize) 2008| 7.74k| .realize(); 2009| 7.74k|} _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.74k| { 1972| 7.74k| return visit_maybe_relaxed_sub( 1973| 7.74k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 7.74k| } _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.49k| { 1959| 5.49k| return concat_inners(lpos, tpos, rpos); 1960| 5.49k| } _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| 22.6k|{ 1873| 22.6k| auto lshift = lpos.shift(); 1874| 22.6k| auto rshift = rpos.shift(); 1875| 22.6k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 22.6k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 22.6k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 17.5k, False: 5.09k] ------------------ 1879| 17.5k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 17.5k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 17.5k| } else { 1882| 5.09k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 5.09k, False: 0] ------------------ 1883| 5.09k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 5.09k] | Branch (1883:9): [True: 5.09k, False: 0] | Branch (1883:9): [True: 5.09k, False: 0] ------------------ 1884| 5.09k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 5.09k| return concat_rebalance(lpos, cpos, rpos); 1886| 5.09k| } 1887| 22.6k|} _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.06M| { 1513| 5.06M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 477k, False: 4.58M] ------------------ 1514| 477k| auto s = size_t{}; 1515| 1.90M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 1.42M, False: 477k] ------------------ 1516| 1.42M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 1.42M| s = sizes_[i]; 1518| 1.42M| } 1519| 4.58M| } else { 1520| 11.6M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 7.10M, False: 4.58M] ------------------ 1521| 7.10M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 7.10M| .visit(v, args...); 1523| 4.58M| } 1524| 5.06M| } _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.15M| { 1734| 2.15M| auto count = p.count(); 1735| 2.15M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 2.15M, False: 0] ------------------ 1736| 2.15M| plan.counts[plan.n++] = count; 1737| 2.15M| plan.total += count; 1738| 2.15M| } _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| 18.9M| { 1734| 18.9M| auto count = p.count(); 1735| 18.9M| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 18.9M, False: 0] ------------------ 1736| 18.9M| plan.counts[plan.n++] = count; 1737| 18.9M| plan.total += count; 1738| 18.9M| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE7shuffleEj: 1762| 5.06M| { 1763| | // gcc seems to not really understand this code... :( 1764| 5.06M|#if !defined(_MSC_VER) 1765| 5.06M|#pragma GCC diagnostic push 1766| 5.06M|#pragma GCC diagnostic ignored "-Warray-bounds" 1767| 5.06M|#endif 1768| 5.06M| constexpr count_t rrb_extras = 2; 1769| 5.06M| constexpr count_t rrb_invariant = 1; 1770| 5.06M| const auto bits = shift == BL ? BL : B; ------------------ | Branch (1770:43): [True: 477k, False: 4.58M] ------------------ 1771| 5.06M| const auto branches = count_t{1} << bits; 1772| 5.06M| const auto optimal = ((total - 1) >> bits) + 1; 1773| 5.06M| count_t i = 0; 1774| 5.92M| while (n >= optimal + rrb_extras) { ------------------ | Branch (1774:16): [True: 856k, False: 5.06M] ------------------ 1775| | // skip ok nodes 1776| 1.42M| while (counts[i] > branches - rrb_invariant) ------------------ | Branch (1776:20): [True: 566k, False: 856k] ------------------ 1777| 566k| i++; 1778| 856k| assert(i < n); ------------------ | Branch (1778:13): [True: 856k, False: 0] ------------------ 1779| | // short node, redistribute 1780| 856k| auto remaining = counts[i]; 1781| 2.08M| do { 1782| 2.08M| auto next = counts[i + 1]; 1783| 2.08M| auto count = std::min(remaining + next, branches); 1784| 2.08M| counts[i] = count; 1785| 2.08M| assert(counts[i]); ------------------ | Branch (1785:17): [True: 2.08M, False: 0] ------------------ 1786| 2.08M| remaining += next - count; 1787| 2.08M| ++i; 1788| 2.08M| } while (remaining > 0); ------------------ | Branch (1788:22): [True: 1.23M, False: 856k] ------------------ 1789| | // remove node 1790| 856k| std::move(counts + i + 1, counts + n, counts + i); 1791| 856k| --n; 1792| 856k| --i; 1793| 856k| } 1794| 5.06M|#if !defined(_MSC_VER) 1795| 5.06M|#pragma GCC diagnostic pop 1796| 5.06M|#endif 1797| 5.06M| } _ZNK5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 1478| 10.1M| auto shift() const { return shift_; } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEC2EjPjj: 1577| 5.06M| : curr_{counts} 1578| 5.06M| , n_{n} 1579| 5.06M| , result_{ 1580| 5.06M| shift + B, node_t::make_inner_r_n(std::min(n_, branches)), 0} 1581| 5.06M| { 1582| 5.06M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEC2EjPSC_m: 1481| 5.06M| : shift_{s} 1482| 5.06M| , count_{1} 1483| 5.06M| , nodes_{n0} 1484| 5.06M| , sizes_{s0} 1485| 5.06M| { 1486| 5.06M| } _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.06M| { 1513| 5.06M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 477k, False: 4.58M] ------------------ 1514| 477k| auto s = size_t{}; 1515| 1.90M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 1.42M, False: 477k] ------------------ 1516| 1.42M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 1.42M| s = sizes_[i]; 1518| 1.42M| } 1519| 4.58M| } else { 1520| 11.6M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 7.10M, False: 4.58M] ------------------ 1521| 7.10M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 7.10M| .visit(v, args...); 1523| 4.58M| } 1524| 5.06M| } _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.15M| { 1722| 2.15M| merger.merge_leaf(p); 1723| 2.15M| } _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.15M| { 1615| 2.15M| auto from = p.node(); 1616| 2.15M| auto from_size = p.size(); 1617| 2.15M| auto from_count = p.count(); 1618| 2.15M| assert(from_size); ------------------ | Branch (1618:9): [True: 2.15M, False: 0] ------------------ 1619| 2.15M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 2.13M, False: 25.8k] | Branch (1619:21): [True: 2.11M, False: 15.0k] ------------------ 1620| 2.11M| add_child(from, from_size); 1621| 2.11M| from->inc(); 1622| 2.11M| } else { 1623| 40.8k| auto from_offset = count_t{}; 1624| 40.8k| auto from_data = from->leaf(); 1625| 50.6k| do { 1626| 50.6k| if (!to_) { ------------------ | Branch (1626:21): [True: 24.8k, False: 25.8k] ------------------ 1627| 24.8k| to_ = node_t::make_leaf_n(*curr_); 1628| 24.8k| to_offset_ = 0; 1629| 24.8k| } 1630| 50.6k| auto data = to_->leaf(); 1631| 50.6k| auto to_copy = 1632| 50.6k| std::min(from_count - from_offset, *curr_ - to_offset_); 1633| 50.6k| detail::uninitialized_copy(from_data + from_offset, 1634| 50.6k| from_data + from_offset + to_copy, 1635| 50.6k| data + to_offset_); 1636| 50.6k| to_offset_ += to_copy; 1637| 50.6k| from_offset += to_copy; 1638| 50.6k| if (*curr_ == to_offset_) { ------------------ | Branch (1638:21): [True: 24.8k, False: 25.8k] ------------------ 1639| 24.8k| add_child(to_, to_offset_); 1640| 24.8k| to_ = nullptr; 1641| 24.8k| } 1642| 50.6k| } while (from_offset != from_count); ------------------ | Branch (1642:22): [True: 9.83k, False: 40.8k] ------------------ 1643| 40.8k| } 1644| 2.15M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9add_childEPSC_m: 1589| 22.4M| { 1590| 22.4M| assert(size); ------------------ | Branch (1590:9): [True: 22.4M, False: 0] ------------------ 1591| 22.4M| ++curr_; 1592| 22.4M| auto parent = result_.nodes_[result_.count_ - 1]; 1593| 22.4M| auto relaxed = parent->relaxed(); 1594| 22.4M| if (relaxed->d.count == branches) { ------------------ | Branch (1594:13): [True: 2.55M, False: 19.9M] ------------------ 1595| 2.55M| assert(result_.count_ < result_t::max_children); ------------------ | Branch (1595:13): [True: 2.55M, False: 0] ------------------ 1596| 2.55M| n_ -= branches; 1597| 2.55M| parent = node_t::make_inner_r_n(std::min(n_, branches)); 1598| 2.55M| relaxed = parent->relaxed(); 1599| 2.55M| result_.nodes_[result_.count_] = parent; 1600| 2.55M| result_.sizes_[result_.count_] = result_.sizes_[result_.count_ - 1]; 1601| 2.55M| assert(result_.sizes_[result_.count_]); ------------------ | Branch (1601:13): [True: 2.55M, False: 0] ------------------ 1602| 2.55M| ++result_.count_; 1603| 2.55M| } 1604| 22.4M| auto idx = relaxed->d.count++; 1605| 22.4M| result_.sizes_[result_.count_ - 1] += size; 1606| 22.4M| assert(result_.sizes_[result_.count_ - 1]); ------------------ | Branch (1606:9): [True: 22.4M, False: 0] ------------------ 1607| 22.4M| relaxed->d.sizes[idx] = size + (idx ? relaxed->d.sizes[idx - 1] : 0); ------------------ | Branch (1607:41): [True: 14.8M, False: 7.62M] ------------------ 1608| 22.4M| assert(relaxed->d.sizes[idx]); ------------------ | Branch (1608:9): [True: 22.4M, False: 0] ------------------ 1609| 22.4M| parent->inner()[idx] = p; 1610| 22.4M| }; _ZN5immer6detail4rbts21concat_merger_visitor11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_: 1715| 18.9M| { 1716| 18.9M| merger.merge_inner(p); 1717| 18.9M| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11merge_innerIRNS1_11relaxed_posISC_EEEEvOT_: 1648| 18.9M| { 1649| 18.9M| auto from = p.node(); 1650| 18.9M| auto from_size = p.size(); 1651| 18.9M| auto from_count = p.count(); 1652| 18.9M| assert(from_size); ------------------ | Branch (1652:9): [True: 18.9M, False: 0] ------------------ 1653| 18.9M| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 17.0M, False: 1.94M] | Branch (1653:21): [True: 16.2M, False: 829k] ------------------ 1654| 16.2M| add_child(from, from_size); 1655| 16.2M| from->inc(); 1656| 16.2M| } else { 1657| 2.77M| auto from_offset = count_t{}; 1658| 2.77M| auto from_data = from->inner(); 1659| 3.88M| do { 1660| 3.88M| if (!to_) { ------------------ | Branch (1660:21): [True: 1.93M, False: 1.94M] ------------------ 1661| 1.93M| to_ = node_t::make_inner_r_n(*curr_); 1662| 1.93M| to_offset_ = 0; 1663| 1.93M| to_size_ = 0; 1664| 1.93M| } 1665| 3.88M| auto data = to_->inner(); 1666| 3.88M| auto to_copy = 1667| 3.88M| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 3.88M| std::copy(from_data + from_offset, 1669| 3.88M| from_data + from_offset + to_copy, 1670| 3.88M| data + to_offset_); 1671| 3.88M| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 3.88M| auto sizes = to_->relaxed()->d.sizes; 1673| 3.88M| p.copy_sizes( 1674| 3.88M| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 3.88M| to_offset_ += to_copy; 1676| 3.88M| from_offset += to_copy; 1677| 3.88M| to_size_ = sizes[to_offset_ - 1]; 1678| 3.88M| assert(to_size_); ------------------ | Branch (1678:17): [True: 3.88M, False: 0] ------------------ 1679| 3.88M| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 1.93M, False: 1.94M] ------------------ 1680| 1.93M| to_->relaxed()->d.count = to_offset_; 1681| 1.93M| add_child(to_, to_size_); 1682| 1.93M| to_ = nullptr; 1683| 1.93M| } 1684| 3.88M| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 1.10M, False: 2.77M] ------------------ 1685| 2.77M| } 1686| 18.9M| } _ZNK5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE6finishEv: 1689| 5.06M| { 1690| 5.06M| assert(!to_); ------------------ | Branch (1690:9): [True: 5.06M, False: 0] ------------------ 1691| 5.06M| return result_; 1692| 5.06M| } _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.06M| { 1513| 5.06M| if (shift_ == BL) { ------------------ | Branch (1513:13): [True: 477k, False: 4.58M] ------------------ 1514| 477k| auto s = size_t{}; 1515| 1.90M| for (auto i = count_t{0}; i < count_; ++i) { ------------------ | Branch (1515:39): [True: 1.42M, False: 477k] ------------------ 1516| 1.42M| make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...); 1517| 1.42M| s = sizes_[i]; 1518| 1.42M| } 1519| 4.58M| } else { 1520| 11.6M| for (auto i = count_t{0}; i < count_; ++i) ------------------ | Branch (1520:39): [True: 7.10M, False: 4.58M] ------------------ 1521| 7.10M| make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed()) 1522| 7.10M| .visit(v, args...); 1523| 4.58M| } 1524| 5.06M| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEC2EjPSC_mSE_mSE_m: 1503| 469k| : shift_{s} 1504| 469k| , count_{3} 1505| 469k| , nodes_{n0, n1, n2} 1506| 469k| , sizes_{s0, s0 + s1, s0 + s1 + s2} 1507| 469k| { 1508| 469k| } _ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEC2EjPSC_mSE_m: 1489| 7.74k| : shift_{s} 1490| 7.74k| , count_{2} 1491| 7.74k| , nodes_{n0, n1} 1492| 7.74k| , sizes_{s0, s0 + s1} 1493| 7.74k| { 1494| 7.74k| } _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.1k| { 1918| 17.1k| return concat_inners(lpos, tpos, rpos); 1919| 17.1k| } _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| 397| { 1918| 397| return concat_inners(lpos, tpos, rpos); 1919| 397| } _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.64k|{ 1873| 2.64k| auto lshift = lpos.shift(); 1874| 2.64k| auto rshift = rpos.shift(); 1875| 2.64k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 2.64k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 2.64k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 664, False: 1.98k] ------------------ 1879| 664| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 664| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 1.98k| } else { 1882| 1.98k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 1.98k, False: 0] ------------------ 1883| 1.98k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 1.98k] | Branch (1883:9): [True: 1.98k, False: 0] | Branch (1883:9): [True: 1.98k, False: 0] ------------------ 1884| 1.98k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 1.98k| return concat_rebalance(lpos, cpos, rpos); 1886| 1.98k| } 1887| 2.64k|} _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.02k| { 1918| 1.02k| return concat_inners(lpos, tpos, rpos); 1919| 1.02k| } _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.02k|{ 1873| 1.02k| auto lshift = lpos.shift(); 1874| 1.02k| auto rshift = rpos.shift(); 1875| 1.02k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 1.02k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 1.02k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 365, False: 664] ------------------ 1879| 365| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 365| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 664| } else { 1882| 664| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 664, False: 0] ------------------ 1883| 664| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 664] | Branch (1883:9): [True: 664, False: 0] | Branch (1883:9): [True: 664, False: 0] ------------------ 1884| 664| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 664| return concat_rebalance(lpos, cpos, rpos); 1886| 664| } 1887| 1.02k|} _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| 927|{ 1824| 927| auto plan = concat_rebalance_plan{}; 1825| 927| plan.fill(lpos, cpos, rpos); 1826| 927| plan.shuffle(cpos.shift()); 1827| 927| IMMER_TRY { ------------------ | | 49| 927|#define IMMER_TRY try ------------------ 1828| 927| return plan.merge(lpos, cpos, rpos); 1829| 927| } 1830| 927| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 927|} _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| 927| { 1753| 927| assert(n == 0u); ------------------ | Branch (1753:9): [True: 927, False: 0] ------------------ 1754| 927| assert(total == 0u); ------------------ | Branch (1754:9): [True: 927, False: 0] ------------------ 1755| 927| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 927| lpos.each_left_sub(visitor_t{}, *this); 1757| 927| cpos.each_sub(visitor_t{}, *this); 1758| 927| rpos.each_right_sub(visitor_t{}, *this); 1759| 927| } _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| 987k| { 1734| 987k| auto count = p.count(); 1735| 987k| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 987k, False: 0] ------------------ 1736| 987k| plan.counts[plan.n++] = count; 1737| 987k| plan.total += count; 1738| 987k| } _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| 585k| { 1734| 585k| auto count = p.count(); 1735| 585k| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 585k, False: 0] ------------------ 1736| 585k| plan.counts[plan.n++] = count; 1737| 585k| plan.total += count; 1738| 585k| } _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| 927| { 1803| 927| using node_t = node_type; 1804| 927| using merger_t = concat_merger; 1805| 927| using visitor_t = concat_merger_visitor; 1806| 927| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 927| IMMER_TRY { ------------------ | | 49| 927|#define IMMER_TRY try ------------------ 1808| 927| lpos.each_left_sub(visitor_t{}, merger); 1809| 927| cpos.each_sub(visitor_t{}, merger); 1810| 927| rpos.each_right_sub(visitor_t{}, merger); 1811| 927| cpos.each_sub(dec_visitor{}); 1812| 927| return merger.finish(); 1813| 927| } 1814| 927| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 927| } _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| 987k| { 1722| 987k| merger.merge_leaf(p); 1723| 987k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10merge_leafIRNS1_13full_leaf_posISC_EEEEvOT_: 1614| 987k| { 1615| 987k| auto from = p.node(); 1616| 987k| auto from_size = p.size(); 1617| 987k| auto from_count = p.count(); 1618| 987k| assert(from_size); ------------------ | Branch (1618:9): [True: 987k, False: 0] ------------------ 1619| 987k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1619:13): [True: 987k, False: 0] | Branch (1619:21): [True: 987k, False: 0] ------------------ 1620| 987k| add_child(from, from_size); 1621| 987k| from->inc(); 1622| 987k| } 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| 987k| } _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| 585k| { 1716| 585k| merger.merge_inner(p); 1717| 585k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11merge_innerIRNS1_8full_posISC_EEEEvOT_: 1648| 585k| { 1649| 585k| auto from = p.node(); 1650| 585k| auto from_size = p.size(); 1651| 585k| auto from_count = p.count(); 1652| 585k| assert(from_size); ------------------ | Branch (1652:9): [True: 585k, False: 0] ------------------ 1653| 585k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 585k, False: 0] | Branch (1653:21): [True: 585k, False: 0] ------------------ 1654| 585k| add_child(from, from_size); 1655| 585k| from->inc(); 1656| 585k| } 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| 585k| } _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| 664| { 1945| 664| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 664| } _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.64k| { 1925| 2.64k| return concat_leafs(lpos, tpos, rpos); 1926| 2.64k| } _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.64k|{ 1839| 2.64k| static_assert(Node::bits >= 2, ""); 1840| 2.64k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 2.64k, False: 0] ------------------ 1841| 2.64k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 2.64k, False: 0] ------------------ 1842| 2.64k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 2.64k, False: 0] ------------------ 1843| 2.64k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 2.64k] ------------------ 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.64k| else 1854| 2.64k| return { 1855| 2.64k| Node::bits_leaf, 1856| 2.64k| lpos.node()->inc(), 1857| 2.64k| lpos.count(), 1858| 2.64k| rpos.node()->inc(), 1859| 2.64k| rpos.count(), 1860| 2.64k| }; 1861| 2.64k|} _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| 664|{ 1824| 664| auto plan = concat_rebalance_plan{}; 1825| 664| plan.fill(lpos, cpos, rpos); 1826| 664| plan.shuffle(cpos.shift()); 1827| 664| IMMER_TRY { ------------------ | | 49| 664|#define IMMER_TRY try ------------------ 1828| 664| return plan.merge(lpos, cpos, rpos); 1829| 664| } 1830| 664| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 664|} _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| 664| { 1753| 664| assert(n == 0u); ------------------ | Branch (1753:9): [True: 664, False: 0] ------------------ 1754| 664| assert(total == 0u); ------------------ | Branch (1754:9): [True: 664, False: 0] ------------------ 1755| 664| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 664| lpos.each_left_sub(visitor_t{}, *this); 1757| 664| cpos.each_sub(visitor_t{}, *this); 1758| 664| rpos.each_right_sub(visitor_t{}, *this); 1759| 664| } _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| 664| { 1803| 664| using node_t = node_type; 1804| 664| using merger_t = concat_merger; 1805| 664| using visitor_t = concat_merger_visitor; 1806| 664| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 664| IMMER_TRY { ------------------ | | 49| 664|#define IMMER_TRY try ------------------ 1808| 664| lpos.each_left_sub(visitor_t{}, merger); 1809| 664| cpos.each_sub(visitor_t{}, merger); 1810| 664| rpos.each_right_sub(visitor_t{}, merger); 1811| 664| cpos.each_sub(dec_visitor{}); 1812| 664| return merger.finish(); 1813| 664| } 1814| 664| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 664| } _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.94k|{ 1824| 1.94k| auto plan = concat_rebalance_plan{}; 1825| 1.94k| plan.fill(lpos, cpos, rpos); 1826| 1.94k| plan.shuffle(cpos.shift()); 1827| 1.94k| IMMER_TRY { ------------------ | | 49| 1.94k|#define IMMER_TRY try ------------------ 1828| 1.94k| return plan.merge(lpos, cpos, rpos); 1829| 1.94k| } 1830| 1.94k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.94k|} _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.94k| { 1753| 1.94k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.94k, False: 0] ------------------ 1754| 1.94k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.94k, False: 0] ------------------ 1755| 1.94k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.94k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.94k| cpos.each_sub(visitor_t{}, *this); 1758| 1.94k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.94k| } _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| 621k| { 1734| 621k| auto count = p.count(); 1735| 621k| assert(plan.n < Plan::max_children); ------------------ | Branch (1735:9): [True: 621k, False: 0] ------------------ 1736| 621k| plan.counts[plan.n++] = count; 1737| 621k| plan.total += count; 1738| 621k| } _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.94k| { 1803| 1.94k| using node_t = node_type; 1804| 1.94k| using merger_t = concat_merger; 1805| 1.94k| using visitor_t = concat_merger_visitor; 1806| 1.94k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.94k| IMMER_TRY { ------------------ | | 49| 1.94k|#define IMMER_TRY try ------------------ 1808| 1.94k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.94k| cpos.each_sub(visitor_t{}, merger); 1810| 1.94k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.94k| cpos.each_sub(dec_visitor{}); 1812| 1.94k| return merger.finish(); 1813| 1.94k| } 1814| 1.94k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.94k| } _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| 621k| { 1716| 621k| merger.merge_inner(p); 1717| 621k| } _ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11merge_innerIRNS1_15regular_sub_posISC_EEEEvOT_: 1648| 621k| { 1649| 621k| auto from = p.node(); 1650| 621k| auto from_size = p.size(); 1651| 621k| auto from_count = p.count(); 1652| 621k| assert(from_size); ------------------ | Branch (1652:9): [True: 621k, False: 0] ------------------ 1653| 621k| if (!to_ && *curr_ == from_count) { ------------------ | Branch (1653:13): [True: 505k, False: 116k] | Branch (1653:21): [True: 505k, False: 0] ------------------ 1654| 505k| add_child(from, from_size); 1655| 505k| from->inc(); 1656| 505k| } else { 1657| 116k| auto from_offset = count_t{}; 1658| 116k| auto from_data = from->inner(); 1659| 232k| do { 1660| 232k| if (!to_) { ------------------ | Branch (1660:21): [True: 116k, False: 116k] ------------------ 1661| 116k| to_ = node_t::make_inner_r_n(*curr_); 1662| 116k| to_offset_ = 0; 1663| 116k| to_size_ = 0; 1664| 116k| } 1665| 232k| auto data = to_->inner(); 1666| 232k| auto to_copy = 1667| 232k| std::min(from_count - from_offset, *curr_ - to_offset_); 1668| 232k| std::copy(from_data + from_offset, 1669| 232k| from_data + from_offset + to_copy, 1670| 232k| data + to_offset_); 1671| 232k| node_t::inc_nodes(from_data + from_offset, to_copy); 1672| 232k| auto sizes = to_->relaxed()->d.sizes; 1673| 232k| p.copy_sizes( 1674| 232k| from_offset, to_copy, to_size_, sizes + to_offset_); 1675| 232k| to_offset_ += to_copy; 1676| 232k| from_offset += to_copy; 1677| 232k| to_size_ = sizes[to_offset_ - 1]; 1678| 232k| assert(to_size_); ------------------ | Branch (1678:17): [True: 232k, False: 0] ------------------ 1679| 232k| if (*curr_ == to_offset_) { ------------------ | Branch (1679:21): [True: 116k, False: 116k] ------------------ 1680| 116k| to_->relaxed()->d.count = to_offset_; 1681| 116k| add_child(to_, to_size_); 1682| 116k| to_ = nullptr; 1683| 116k| } 1684| 232k| } while (from_offset != from_count); ------------------ | Branch (1684:22): [True: 116k, False: 116k] ------------------ 1685| 116k| } 1686| 621k| } _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.98k| { 1945| 1.98k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 1.98k| } _ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EESH_RNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1924| 5.09k| { 1925| 5.09k| return concat_leafs(lpos, tpos, rpos); 1926| 5.09k| } _ZN5immer6detail4rbts12concat_leafsINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EESF_EENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1838| 5.09k|{ 1839| 5.09k| static_assert(Node::bits >= 2, ""); 1840| 5.09k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 5.09k, False: 0] ------------------ 1841| 5.09k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 5.09k, False: 0] ------------------ 1842| 5.09k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 5.09k, False: 0] ------------------ 1843| 5.09k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 0, False: 5.09k] ------------------ 1844| 0| return { 1845| 0| Node::bits_leaf, 1846| 0| lpos.node()->inc(), 1847| 0| lpos.count(), 1848| 0| tpos.node()->inc(), 1849| 0| tpos.count(), 1850| 0| rpos.node()->inc(), 1851| 0| rpos.count(), 1852| 0| }; 1853| 5.09k| else 1854| 5.09k| return { 1855| 5.09k| Node::bits_leaf, 1856| 5.09k| lpos.node()->inc(), 1857| 5.09k| lpos.count(), 1858| 5.09k| rpos.node()->inc(), 1859| 5.09k| rpos.count(), 1860| 5.09k| }; 1861| 5.09k|} _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.98k|{ 1824| 1.98k| auto plan = concat_rebalance_plan{}; 1825| 1.98k| plan.fill(lpos, cpos, rpos); 1826| 1.98k| plan.shuffle(cpos.shift()); 1827| 1.98k| IMMER_TRY { ------------------ | | 49| 1.98k|#define IMMER_TRY try ------------------ 1828| 1.98k| return plan.merge(lpos, cpos, rpos); 1829| 1.98k| } 1830| 1.98k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 1.98k|} _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.98k| { 1753| 1.98k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 1.98k, False: 0] ------------------ 1754| 1.98k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 1.98k, False: 0] ------------------ 1755| 1.98k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 1.98k| lpos.each_left_sub(visitor_t{}, *this); 1757| 1.98k| cpos.each_sub(visitor_t{}, *this); 1758| 1.98k| rpos.each_right_sub(visitor_t{}, *this); 1759| 1.98k| } _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.98k| { 1803| 1.98k| using node_t = node_type; 1804| 1.98k| using merger_t = concat_merger; 1805| 1.98k| using visitor_t = concat_merger_visitor; 1806| 1.98k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 1.98k| IMMER_TRY { ------------------ | | 49| 1.98k|#define IMMER_TRY try ------------------ 1808| 1.98k| lpos.each_left_sub(visitor_t{}, merger); 1809| 1.98k| cpos.each_sub(visitor_t{}, merger); 1810| 1.98k| rpos.each_right_sub(visitor_t{}, merger); 1811| 1.98k| cpos.each_sub(dec_visitor{}); 1812| 1.98k| return merger.finish(); 1813| 1.98k| } 1814| 1.98k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 1.98k| } _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| 106k|{ 1824| 106k| auto plan = concat_rebalance_plan{}; 1825| 106k| plan.fill(lpos, cpos, rpos); 1826| 106k| plan.shuffle(cpos.shift()); 1827| 106k| IMMER_TRY { ------------------ | | 49| 106k|#define IMMER_TRY try ------------------ 1828| 106k| return plan.merge(lpos, cpos, rpos); 1829| 106k| } 1830| 106k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 106k|} _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| 106k| { 1753| 106k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 106k, False: 0] ------------------ 1754| 106k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 106k, False: 0] ------------------ 1755| 106k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 106k| lpos.each_left_sub(visitor_t{}, *this); 1757| 106k| cpos.each_sub(visitor_t{}, *this); 1758| 106k| rpos.each_right_sub(visitor_t{}, *this); 1759| 106k| } _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| 106k| { 1803| 106k| using node_t = node_type; 1804| 106k| using merger_t = concat_merger; 1805| 106k| using visitor_t = concat_merger_visitor; 1806| 106k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 106k| IMMER_TRY { ------------------ | | 49| 106k|#define IMMER_TRY try ------------------ 1808| 106k| lpos.each_left_sub(visitor_t{}, merger); 1809| 106k| cpos.each_sub(visitor_t{}, merger); 1810| 106k| rpos.each_right_sub(visitor_t{}, merger); 1811| 106k| cpos.each_sub(dec_visitor{}); 1812| 106k| return merger.finish(); 1813| 106k| } 1814| 106k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 106k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1944| 5.09k| { 1945| 5.09k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 5.09k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_11relaxed_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 5.09k|{ 1824| 5.09k| auto plan = concat_rebalance_plan{}; 1825| 5.09k| plan.fill(lpos, cpos, rpos); 1826| 5.09k| plan.shuffle(cpos.shift()); 1827| 5.09k| IMMER_TRY { ------------------ | | 49| 5.09k|#define IMMER_TRY try ------------------ 1828| 5.09k| return plan.merge(lpos, cpos, rpos); 1829| 5.09k| } 1830| 5.09k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 5.09k|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEEvOT_OT0_OT1_: 1752| 5.09k| { 1753| 5.09k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 5.09k, False: 0] ------------------ 1754| 5.09k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 5.09k, False: 0] ------------------ 1755| 5.09k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 5.09k| lpos.each_left_sub(visitor_t{}, *this); 1757| 5.09k| cpos.each_sub(visitor_t{}, *this); 1758| 5.09k| rpos.each_right_sub(visitor_t{}, *this); 1759| 5.09k| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 5.09k| { 1803| 5.09k| using node_t = node_type; 1804| 5.09k| using merger_t = concat_merger; 1805| 5.09k| using visitor_t = concat_merger_visitor; 1806| 5.09k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 5.09k| IMMER_TRY { ------------------ | | 49| 5.09k|#define IMMER_TRY try ------------------ 1808| 5.09k| lpos.each_left_sub(visitor_t{}, merger); 1809| 5.09k| cpos.each_sub(visitor_t{}, merger); 1810| 5.09k| rpos.each_right_sub(visitor_t{}, merger); 1811| 5.09k| cpos.each_sub(dec_visitor{}); 1812| 5.09k| return merger.finish(); 1813| 5.09k| } 1814| 5.09k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 5.09k| } _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.25k| { 1959| 2.25k| return concat_inners(lpos, tpos, rpos); 1960| 2.25k| } _ZNO5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7realizeEv: 1527| 477k| { 1528| 477k| if (count_ > 1) { ------------------ | Branch (1528:13): [True: 36.3k, False: 441k] ------------------ 1529| 36.3k| IMMER_TRY { ------------------ | | 49| 36.3k|#define IMMER_TRY try ------------------ 1530| 36.3k| auto result = node_t::make_inner_r_n(count_); 1531| 36.3k| auto r = result->relaxed(); 1532| 36.3k| r->d.count = count_; 1533| 36.3k| std::copy(nodes_, nodes_ + count_, result->inner()); 1534| 36.3k| std::copy(sizes_, sizes_ + count_, r->d.sizes); 1535| 36.3k| return {result, shift_, r}; 1536| 36.3k| } 1537| 36.3k| IMMER_CATCH (...) { 1538| 0| each_sub(dec_visitor{}); 1539| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1540| 0| } 1541| 441k| } else { 1542| 441k| assert(shift_ >= B + BL); ------------------ | Branch (1542:13): [True: 441k, False: 0] ------------------ 1543| 441k| return {nodes_[0], shift_ - B, nodes_[0]->relaxed()}; 1544| 441k| } 1545| 477k| } _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| 469k|{ 1987| 469k| return visit_maybe_relaxed_sub(lroot, 1988| 469k| lshift, 1989| 469k| lsize, 1990| 469k| concat_trees_left_visitor{}, 1991| 469k| make_leaf_pos(ltail, ltcount), 1992| 469k| rroot, 1993| 469k| rshift, 1994| 469k| rsize) 1995| 469k| .realize(); 1996| 469k|} _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| 455k| { 1972| 455k| return visit_maybe_relaxed_sub( 1973| 455k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 455k| } _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| 439k| { 1959| 439k| return concat_inners(lpos, tpos, rpos); 1960| 439k| } _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.12M|{ 1873| 4.12M| auto lshift = lpos.shift(); 1874| 4.12M| auto rshift = rpos.shift(); 1875| 4.12M| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 1.99M, False: 2.12M] ------------------ 1876| 1.99M| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 1.99M| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 2.12M| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 76.6k, False: 2.04M] ------------------ 1879| 76.6k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 76.6k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 2.04M| } else { 1882| 2.04M| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 2.04M, False: 0] ------------------ 1883| 2.04M| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 2.04M] | Branch (1883:9): [True: 2.04M, False: 0] | Branch (1883:9): [True: 2.04M, False: 0] ------------------ 1884| 2.04M| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 2.04M| return concat_rebalance(lpos, cpos, rpos); 1886| 2.04M| } 1887| 4.12M|} _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| 1.99M| { 1898| 1.99M| return concat_inners(lpos, tpos, rpos); 1899| 1.99M| } _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1897| 4.99k| { 1898| 4.99k| return concat_inners(lpos, tpos, rpos); 1899| 4.99k| } _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| 608k|{ 1873| 608k| auto lshift = lpos.shift(); 1874| 608k| auto rshift = rpos.shift(); 1875| 608k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 3.05k, False: 605k] ------------------ 1876| 3.05k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 3.05k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 605k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 12.5k, False: 592k] ------------------ 1879| 12.5k| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 12.5k| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 592k| } else { 1882| 592k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 592k, False: 0] ------------------ 1883| 592k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 592k] | Branch (1883:9): [True: 592k, False: 0] | Branch (1883:9): [True: 592k, False: 0] ------------------ 1884| 592k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 592k| return concat_rebalance(lpos, cpos, rpos); 1886| 592k| } 1887| 608k|} _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EENS1_12null_sub_posEEENSG_IT_EEOT0_OT1_OT2_: 1823| 3.79k|{ 1824| 3.79k| auto plan = concat_rebalance_plan{}; 1825| 3.79k| plan.fill(lpos, cpos, rpos); 1826| 3.79k| plan.shuffle(cpos.shift()); 1827| 3.79k| IMMER_TRY { ------------------ | | 49| 3.79k|#define IMMER_TRY try ------------------ 1828| 3.79k| return plan.merge(lpos, cpos, rpos); 1829| 3.79k| } 1830| 3.79k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 3.79k|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEEvOT_OT0_OT1_: 1752| 3.79k| { 1753| 3.79k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 3.79k, False: 0] ------------------ 1754| 3.79k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 3.79k, False: 0] ------------------ 1755| 3.79k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 3.79k| lpos.each_left_sub(visitor_t{}, *this); 1757| 3.79k| cpos.each_sub(visitor_t{}, *this); 1758| 3.79k| rpos.each_right_sub(visitor_t{}, *this); 1759| 3.79k| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_: 1802| 3.79k| { 1803| 3.79k| using node_t = node_type; 1804| 3.79k| using merger_t = concat_merger; 1805| 3.79k| using visitor_t = concat_merger_visitor; 1806| 3.79k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 3.79k| IMMER_TRY { ------------------ | | 49| 3.79k|#define IMMER_TRY try ------------------ 1808| 3.79k| lpos.each_left_sub(visitor_t{}, merger); 1809| 3.79k| cpos.each_sub(visitor_t{}, merger); 1810| 3.79k| rpos.each_right_sub(visitor_t{}, merger); 1811| 3.79k| cpos.each_sub(dec_visitor{}); 1812| 3.79k| return merger.finish(); 1813| 3.79k| } 1814| 3.79k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 3.79k| } _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| 596k| { 1918| 596k| return concat_inners(lpos, tpos, rpos); 1919| 596k| } _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| 108k| { 1918| 108k| return concat_inners(lpos, tpos, rpos); 1919| 108k| } _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| 116k|{ 1873| 116k| auto lshift = lpos.shift(); 1874| 116k| auto rshift = rpos.shift(); 1875| 116k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 741, False: 115k] ------------------ 1876| 741| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 741| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 115k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 585, False: 114k] ------------------ 1879| 585| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 585| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 114k| } else { 1882| 114k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 114k, False: 0] ------------------ 1883| 114k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 114k] | Branch (1883:9): [True: 114k, False: 0] | Branch (1883:9): [True: 114k, False: 0] ------------------ 1884| 114k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 114k| return concat_rebalance(lpos, cpos, rpos); 1886| 114k| } 1887| 116k|} _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.15k| { 1898| 1.15k| return concat_inners(lpos, tpos, rpos); 1899| 1.15k| } _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| 100k| { 1918| 100k| return concat_inners(lpos, tpos, rpos); 1919| 100k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 100k|{ 1873| 100k| auto lshift = lpos.shift(); 1874| 100k| auto rshift = rpos.shift(); 1875| 100k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 100k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 100k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 297, False: 99.8k] ------------------ 1879| 297| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 297| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 99.8k| } else { 1882| 99.8k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 99.8k, False: 0] ------------------ 1883| 99.8k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 99.8k] | Branch (1883:9): [True: 99.8k, False: 0] | Branch (1883:9): [True: 99.8k, False: 0] ------------------ 1884| 99.8k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 99.8k| return concat_rebalance(lpos, cpos, rpos); 1886| 99.8k| } 1887| 100k|} _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| 54.1k| { 1945| 54.1k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 54.1k| } _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| 133k| { 1925| 133k| return concat_leafs(lpos, tpos, rpos); 1926| 133k| } _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| 133k|{ 1839| 133k| static_assert(Node::bits >= 2, ""); 1840| 133k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 133k, False: 0] ------------------ 1841| 133k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 133k, False: 0] ------------------ 1842| 133k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 133k, False: 0] ------------------ 1843| 133k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 133k, False: 0] ------------------ 1844| 133k| return { 1845| 133k| Node::bits_leaf, 1846| 133k| lpos.node()->inc(), 1847| 133k| lpos.count(), 1848| 133k| tpos.node()->inc(), 1849| 133k| tpos.count(), 1850| 133k| rpos.node()->inc(), 1851| 133k| rpos.count(), 1852| 133k| }; 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| 133k|} _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| 47.6k| { 1938| 47.6k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 47.6k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSG_IT_EEOT0_OT1_OT2_: 1823| 99.8k|{ 1824| 99.8k| auto plan = concat_rebalance_plan{}; 1825| 99.8k| plan.fill(lpos, cpos, rpos); 1826| 99.8k| plan.shuffle(cpos.shift()); 1827| 99.8k| IMMER_TRY { ------------------ | | 49| 99.8k|#define IMMER_TRY try ------------------ 1828| 99.8k| return plan.merge(lpos, cpos, rpos); 1829| 99.8k| } 1830| 99.8k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 99.8k|} _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| 99.8k| { 1753| 99.8k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 99.8k, False: 0] ------------------ 1754| 99.8k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 99.8k, False: 0] ------------------ 1755| 99.8k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 99.8k| lpos.each_left_sub(visitor_t{}, *this); 1757| 99.8k| cpos.each_sub(visitor_t{}, *this); 1758| 99.8k| rpos.each_right_sub(visitor_t{}, *this); 1759| 99.8k| } _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| 99.8k| { 1803| 99.8k| using node_t = node_type; 1804| 99.8k| using merger_t = concat_merger; 1805| 99.8k| using visitor_t = concat_merger_visitor; 1806| 99.8k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 99.8k| IMMER_TRY { ------------------ | | 49| 99.8k|#define IMMER_TRY try ------------------ 1808| 99.8k| lpos.each_left_sub(visitor_t{}, merger); 1809| 99.8k| cpos.each_sub(visitor_t{}, merger); 1810| 99.8k| rpos.each_right_sub(visitor_t{}, merger); 1811| 99.8k| cpos.each_sub(dec_visitor{}); 1812| 99.8k| return merger.finish(); 1813| 99.8k| } 1814| 99.8k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 99.8k| } _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.7k| { 1945| 79.7k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 79.7k| } _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| 335k| { 1925| 335k| return concat_leafs(lpos, tpos, rpos); 1926| 335k| } _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| 335k|{ 1839| 335k| static_assert(Node::bits >= 2, ""); 1840| 335k| assert(lpos.shift() == tpos.shift()); ------------------ | Branch (1840:5): [True: 335k, False: 0] ------------------ 1841| 335k| assert(lpos.shift() == rpos.shift()); ------------------ | Branch (1841:5): [True: 335k, False: 0] ------------------ 1842| 335k| assert(lpos.shift() == 0); ------------------ | Branch (1842:5): [True: 335k, False: 0] ------------------ 1843| 335k| if (tpos.count() > 0) ------------------ | Branch (1843:9): [True: 335k, False: 0] ------------------ 1844| 335k| return { 1845| 335k| Node::bits_leaf, 1846| 335k| lpos.node()->inc(), 1847| 335k| lpos.count(), 1848| 335k| tpos.node()->inc(), 1849| 335k| tpos.count(), 1850| 335k| rpos.node()->inc(), 1851| 335k| rpos.count(), 1852| 335k| }; 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| 335k|} _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| 51.6k| { 1938| 51.6k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 51.6k| } _ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EESF_EENSG_IT_EEOT0_OT1_OT2_: 1823| 114k|{ 1824| 114k| auto plan = concat_rebalance_plan{}; 1825| 114k| plan.fill(lpos, cpos, rpos); 1826| 114k| plan.shuffle(cpos.shift()); 1827| 114k| IMMER_TRY { ------------------ | | 49| 114k|#define IMMER_TRY try ------------------ 1828| 114k| return plan.merge(lpos, cpos, rpos); 1829| 114k| } 1830| 114k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 114k|} _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| 114k| { 1753| 114k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 114k, False: 0] ------------------ 1754| 114k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 114k, False: 0] ------------------ 1755| 114k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 114k| lpos.each_left_sub(visitor_t{}, *this); 1757| 114k| cpos.each_sub(visitor_t{}, *this); 1758| 114k| rpos.each_right_sub(visitor_t{}, *this); 1759| 114k| } _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| 114k| { 1803| 114k| using node_t = node_type; 1804| 114k| using merger_t = concat_merger; 1805| 114k| using visitor_t = concat_merger_visitor; 1806| 114k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 114k| IMMER_TRY { ------------------ | | 49| 114k|#define IMMER_TRY try ------------------ 1808| 114k| lpos.each_left_sub(visitor_t{}, merger); 1809| 114k| cpos.each_sub(visitor_t{}, merger); 1810| 114k| rpos.each_right_sub(visitor_t{}, merger); 1811| 114k| cpos.each_sub(dec_visitor{}); 1812| 114k| return merger.finish(); 1813| 114k| } 1814| 114k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 114k| } _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| 335k| { 1945| 335k| return rpos.first_sub_leaf(concat_right_visitor{}, lpos, tpos); 1946| 335k| } _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| 691k| { 1938| 691k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 691k| } _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| 592k|{ 1824| 592k| auto plan = concat_rebalance_plan{}; 1825| 592k| plan.fill(lpos, cpos, rpos); 1826| 592k| plan.shuffle(cpos.shift()); 1827| 592k| IMMER_TRY { ------------------ | | 49| 592k|#define IMMER_TRY try ------------------ 1828| 592k| return plan.merge(lpos, cpos, rpos); 1829| 592k| } 1830| 592k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 592k|} _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| 592k| { 1753| 592k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 592k, False: 0] ------------------ 1754| 592k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 592k, False: 0] ------------------ 1755| 592k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 592k| lpos.each_left_sub(visitor_t{}, *this); 1757| 592k| cpos.each_sub(visitor_t{}, *this); 1758| 592k| rpos.each_right_sub(visitor_t{}, *this); 1759| 592k| } _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| 592k| { 1803| 592k| using node_t = node_type; 1804| 592k| using merger_t = concat_merger; 1805| 592k| using visitor_t = concat_merger_visitor; 1806| 592k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 592k| IMMER_TRY { ------------------ | | 49| 592k|#define IMMER_TRY try ------------------ 1808| 592k| lpos.each_left_sub(visitor_t{}, merger); 1809| 592k| cpos.each_sub(visitor_t{}, merger); 1810| 592k| rpos.each_right_sub(visitor_t{}, merger); 1811| 592k| cpos.each_sub(dec_visitor{}); 1812| 592k| return merger.finish(); 1813| 592k| } 1814| 592k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 592k| } _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.06M|{ 1824| 2.06M| auto plan = concat_rebalance_plan{}; 1825| 2.06M| plan.fill(lpos, cpos, rpos); 1826| 2.06M| plan.shuffle(cpos.shift()); 1827| 2.06M| IMMER_TRY { ------------------ | | 49| 2.06M|#define IMMER_TRY try ------------------ 1828| 2.06M| return plan.merge(lpos, cpos, rpos); 1829| 2.06M| } 1830| 2.06M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.06M|} _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.06M| { 1753| 2.06M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.06M, False: 0] ------------------ 1754| 2.06M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.06M, False: 0] ------------------ 1755| 2.06M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.06M| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.06M| cpos.each_sub(visitor_t{}, *this); 1758| 2.06M| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.06M| } _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.06M| { 1803| 2.06M| using node_t = node_type; 1804| 2.06M| using merger_t = concat_merger; 1805| 2.06M| using visitor_t = concat_merger_visitor; 1806| 2.06M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.06M| IMMER_TRY { ------------------ | | 49| 2.06M|#define IMMER_TRY try ------------------ 1808| 2.06M| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.06M| cpos.each_sub(visitor_t{}, merger); 1810| 2.06M| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.06M| cpos.each_sub(dec_visitor{}); 1812| 2.06M| return merger.finish(); 1813| 2.06M| } 1814| 2.06M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.06M| } _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.68M| { 1918| 1.68M| return concat_inners(lpos, tpos, rpos); 1919| 1.68M| } _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| 2.17k| { 1918| 2.17k| return concat_inners(lpos, tpos, rpos); 1919| 2.17k| } _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| 89.1k|{ 1873| 89.1k| auto lshift = lpos.shift(); 1874| 89.1k| auto rshift = rpos.shift(); 1875| 89.1k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 70.6k, False: 18.4k] ------------------ 1876| 70.6k| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 70.6k| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 70.6k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 694, False: 17.7k] ------------------ 1879| 694| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 694| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 17.7k| } else { 1882| 17.7k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 17.7k, False: 0] ------------------ 1883| 17.7k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 17.7k] | Branch (1883:9): [True: 17.7k, False: 0] | Branch (1883:9): [True: 17.7k, False: 0] ------------------ 1884| 17.7k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 17.7k| return concat_rebalance(lpos, cpos, rpos); 1886| 17.7k| } 1887| 89.1k|} _ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1897| 70.2k| { 1898| 70.2k| return concat_inners(lpos, tpos, rpos); 1899| 70.2k| } _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| 3.87k| { 1918| 3.87k| return concat_inners(lpos, tpos, rpos); 1919| 3.87k| } _ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_: 1872| 3.87k|{ 1873| 3.87k| auto lshift = lpos.shift(); 1874| 3.87k| auto rshift = rpos.shift(); 1875| 3.87k| if (lshift > rshift) { ------------------ | Branch (1875:9): [True: 0, False: 3.87k] ------------------ 1876| 0| auto cpos = lpos.last_sub(concat_left_visitor{}, tpos, rpos); 1877| 0| return concat_rebalance(lpos, cpos, null_sub_pos{}); 1878| 3.87k| } else if (lshift < rshift) { ------------------ | Branch (1878:16): [True: 265, False: 3.61k] ------------------ 1879| 265| auto cpos = rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1880| 265| return concat_rebalance(null_sub_pos{}, cpos, rpos); 1881| 3.61k| } else { 1882| 3.61k| assert(lshift == rshift); ------------------ | Branch (1882:9): [True: 3.61k, False: 0] ------------------ 1883| 3.61k| assert(Node::bits_leaf == 0u || lshift > 0); ------------------ | Branch (1883:9): [Folded, False: 3.61k] | Branch (1883:9): [True: 3.61k, False: 0] | Branch (1883:9): [True: 3.61k, False: 0] ------------------ 1884| 3.61k| auto cpos = lpos.last_sub(concat_both_visitor{}, tpos, rpos); 1885| 3.61k| return concat_rebalance(lpos, cpos, rpos); 1886| 3.61k| } 1887| 3.87k|} _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 1.67k| { 1938| 1.67k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 1.67k| } _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| 3.61k|{ 1824| 3.61k| auto plan = concat_rebalance_plan{}; 1825| 3.61k| plan.fill(lpos, cpos, rpos); 1826| 3.61k| plan.shuffle(cpos.shift()); 1827| 3.61k| IMMER_TRY { ------------------ | | 49| 3.61k|#define IMMER_TRY try ------------------ 1828| 3.61k| return plan.merge(lpos, cpos, rpos); 1829| 3.61k| } 1830| 3.61k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 3.61k|} _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| 3.61k| { 1753| 3.61k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 3.61k, False: 0] ------------------ 1754| 3.61k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 3.61k, False: 0] ------------------ 1755| 3.61k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 3.61k| lpos.each_left_sub(visitor_t{}, *this); 1757| 3.61k| cpos.each_sub(visitor_t{}, *this); 1758| 3.61k| rpos.each_right_sub(visitor_t{}, *this); 1759| 3.61k| } _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| 3.61k| { 1803| 3.61k| using node_t = node_type; 1804| 3.61k| using merger_t = concat_merger; 1805| 3.61k| using visitor_t = concat_merger_visitor; 1806| 3.61k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 3.61k| IMMER_TRY { ------------------ | | 49| 3.61k|#define IMMER_TRY try ------------------ 1808| 3.61k| lpos.each_left_sub(visitor_t{}, merger); 1809| 3.61k| cpos.each_sub(visitor_t{}, merger); 1810| 3.61k| rpos.each_right_sub(visitor_t{}, merger); 1811| 3.61k| cpos.each_sub(dec_visitor{}); 1812| 3.61k| return merger.finish(); 1813| 3.61k| } 1814| 3.61k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 3.61k| } _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| 1.24k| { 1938| 1.24k| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 1.24k| } _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| 17.7k|{ 1824| 17.7k| auto plan = concat_rebalance_plan{}; 1825| 17.7k| plan.fill(lpos, cpos, rpos); 1826| 17.7k| plan.shuffle(cpos.shift()); 1827| 17.7k| IMMER_TRY { ------------------ | | 49| 17.7k|#define IMMER_TRY try ------------------ 1828| 17.7k| return plan.merge(lpos, cpos, rpos); 1829| 17.7k| } 1830| 17.7k| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 17.7k|} _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEEvOT_OT0_OT1_: 1752| 17.7k| { 1753| 17.7k| assert(n == 0u); ------------------ | Branch (1753:9): [True: 17.7k, False: 0] ------------------ 1754| 17.7k| assert(total == 0u); ------------------ | Branch (1754:9): [True: 17.7k, False: 0] ------------------ 1755| 17.7k| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 17.7k| lpos.each_left_sub(visitor_t{}, *this); 1757| 17.7k| cpos.each_sub(visitor_t{}, *this); 1758| 17.7k| rpos.each_right_sub(visitor_t{}, *this); 1759| 17.7k| } _ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_: 1802| 17.7k| { 1803| 17.7k| using node_t = node_type; 1804| 17.7k| using merger_t = concat_merger; 1805| 17.7k| using visitor_t = concat_merger_visitor; 1806| 17.7k| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 17.7k| IMMER_TRY { ------------------ | | 49| 17.7k|#define IMMER_TRY try ------------------ 1808| 17.7k| lpos.each_left_sub(visitor_t{}, merger); 1809| 17.7k| cpos.each_sub(visitor_t{}, merger); 1810| 17.7k| rpos.each_right_sub(visitor_t{}, merger); 1811| 17.7k| cpos.each_sub(dec_visitor{}); 1812| 17.7k| return merger.finish(); 1813| 17.7k| } 1814| 17.7k| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 17.7k| } _ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1937| 1.61M| { 1938| 1.61M| return rpos.first_sub(concat_right_visitor{}, lpos, tpos); 1939| 1.61M| } _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.04M|{ 1824| 2.04M| auto plan = concat_rebalance_plan{}; 1825| 2.04M| plan.fill(lpos, cpos, rpos); 1826| 2.04M| plan.shuffle(cpos.shift()); 1827| 2.04M| IMMER_TRY { ------------------ | | 49| 2.04M|#define IMMER_TRY try ------------------ 1828| 2.04M| return plan.merge(lpos, cpos, rpos); 1829| 2.04M| } 1830| 2.04M| IMMER_CATCH (...) { 1831| 0| cpos.each_sub(dec_visitor{}); 1832| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1833| 0| } 1834| 2.04M|} _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.04M| { 1753| 2.04M| assert(n == 0u); ------------------ | Branch (1753:9): [True: 2.04M, False: 0] ------------------ 1754| 2.04M| assert(total == 0u); ------------------ | Branch (1754:9): [True: 2.04M, False: 0] ------------------ 1755| 2.04M| using visitor_t = concat_rebalance_plan_fill_visitor; 1756| 2.04M| lpos.each_left_sub(visitor_t{}, *this); 1757| 2.04M| cpos.each_sub(visitor_t{}, *this); 1758| 2.04M| rpos.each_right_sub(visitor_t{}, *this); 1759| 2.04M| } _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.04M| { 1803| 2.04M| using node_t = node_type; 1804| 2.04M| using merger_t = concat_merger; 1805| 2.04M| using visitor_t = concat_merger_visitor; 1806| 2.04M| auto merger = merger_t{cpos.shift(), counts, n}; 1807| 2.04M| IMMER_TRY { ------------------ | | 49| 2.04M|#define IMMER_TRY try ------------------ 1808| 2.04M| lpos.each_left_sub(visitor_t{}, merger); 1809| 2.04M| cpos.each_sub(visitor_t{}, merger); 1810| 2.04M| rpos.each_right_sub(visitor_t{}, merger); 1811| 2.04M| cpos.each_sub(dec_visitor{}); 1812| 2.04M| return merger.finish(); 1813| 2.04M| } 1814| 2.04M| IMMER_CATCH (...) { 1815| 0| merger.abort(); 1816| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1817| 0| } 1818| 2.04M| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_nodeIRNS1_15regular_sub_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 16.6k| { 1959| 16.6k| return concat_inners(lpos, tpos, rpos); 1960| 16.6k| } _ZN5immer6detail4rbts25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_nodeIRNS1_15regular_sub_posISC_EENS1_8leaf_posISC_EEJRPSC_RjRmEEENS1_17concat_center_posISC_EEOT_OT0_DpOT1_: 1971| 13.9k| { 1972| 13.9k| return visit_maybe_relaxed_sub( 1973| 13.9k| args..., concat_trees_right_visitor{}, lpos, tpos); 1974| 13.9k| } _ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_nodeIRNS1_11relaxed_posISC_EERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_: 1958| 7.02k| { 1959| 7.02k| return concat_inners(lpos, tpos, rpos); 1960| 7.02k| } _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| 6.93k| { 1959| 6.93k| return concat_inners(lpos, tpos, rpos); 1960| 6.93k| } _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.0k| { 681| 50.0k| auto node = pos.node(); 682| 50.0k| auto level = pos.shift(); 683| 50.0k| auto idx = pos.count() - 1; 684| 50.0k| auto children = pos.size(idx); 685| 50.0k| auto new_idx = 686| 50.0k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 2.23k, False: 47.7k] | Branch (686:47): [True: 605, False: 47.1k] ------------------ 687| 50.0k| auto new_child = static_cast(nullptr); 688| 50.0k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [True: 50.0k, Folded] | Branch (688:38): [True: 46.1k, False: 3.89k] ------------------ 689| | 690| 50.0k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 1.20k, False: 48.8k] ------------------ 691| 1.20k| return nullptr; 692| 48.8k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 47.1k, False: 1.63k] ------------------ 693| 47.1k| new_child = 694| 47.1k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 44.4k, False: 2.77k] ------------------ 695| 47.1k| : pos.last_oh_csh( 696| 2.77k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 47.1k| if (!new_child) { ------------------ | Branch (697:17): [True: 838, False: 46.3k] ------------------ 698| 838| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 487, False: 351] ------------------ 699| 487| new_child = node_t::make_path_e(e, level - B, tail); 700| 351| else 701| 351| return nullptr; 702| 838| } 703| 47.1k| } else 704| 1.63k| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 48.4k| if (mutate) { ------------------ | Branch (706:13): [True: 45.8k, False: 2.65k] ------------------ 707| 45.8k| auto count = new_idx + 1; 708| 45.8k| auto relaxed = node->ensure_mutable_relaxed_n(e, new_idx); 709| 45.8k| node->inner()[new_idx] = new_child; 710| 45.8k| relaxed->d.sizes[new_idx] = pos.size() + ts; 711| 45.8k| relaxed->d.count = count; 712| 45.8k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (712:13): [True: 45.8k, False: 0] ------------------ 713| 45.8k| return node; 714| 45.8k| } else { 715| 2.65k| IMMER_TRY { ------------------ | | 49| 2.65k|#define IMMER_TRY try ------------------ 716| 2.65k| auto count = new_idx + 1; 717| 2.65k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 2.65k| auto relaxed = new_node->relaxed(); 719| 2.65k| new_node->inner()[new_idx] = new_child; 720| 2.65k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 2.65k| relaxed->d.count = count; 722| 2.65k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 2.65k, False: 0] ------------------ 723| 2.65k| if (Mutating) ------------------ | Branch (723:21): [True: 2.65k, Folded] ------------------ 724| 2.65k| pos.visit(dec_visitor{}); 725| 2.65k| return new_node; 726| 2.65k| } 727| 2.65k| 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.65k| } 737| 48.4k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEJRjEEEPSC_OT_NSA_5applyIS7_E4type4editESJ_DpOT0_: 741| 34.7k| { 742| 34.7k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 34.7k, False: 0] ------------------ 743| 34.7k| auto node = pos.node(); 744| 34.7k| auto idx = pos.index(pos.size() - 1); 745| 34.7k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 34.7k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 34.7k, Folded] | Branch (746:36): [True: 34.0k, False: 662] ------------------ 747| 34.7k| if (mutate) { ------------------ | Branch (747:13): [True: 34.0k, False: 662] ------------------ 748| 34.0k| node->inner()[new_idx] = 749| 34.0k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 33.2k, False: 792] ------------------ 750| | /* otherwise */ 751| 34.0k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 34.0k| return node; 753| 34.0k| } else { 754| 662| auto new_parent = node_t::make_inner_e(e); 755| 662| IMMER_TRY { ------------------ | | 49| 662|#define IMMER_TRY try ------------------ 756| 662| new_parent->inner()[new_idx] = 757| 662| idx == new_idx ------------------ | Branch (757:21): [True: 337, False: 325] ------------------ 758| 662| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 662| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 662| node_t::do_copy_inner(new_parent, node, new_idx); 762| 662| if (Mutating) ------------------ | Branch (762:21): [True: 662, Folded] ------------------ 763| 662| pos.visit(dec_visitor{}); 764| 662| return new_parent; 765| 662| } 766| 662| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 662| } 771| 34.7k| } _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| 759k| { 742| 759k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 759k, False: 0] ------------------ 743| 759k| auto node = pos.node(); 744| 759k| auto idx = pos.index(pos.size() - 1); 745| 759k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 759k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [True: 759k, Folded] | Branch (746:36): [True: 759k, False: 549] ------------------ 747| 759k| if (mutate) { ------------------ | Branch (747:13): [True: 759k, False: 549] ------------------ 748| 759k| node->inner()[new_idx] = 749| 759k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 591k, False: 167k] ------------------ 750| | /* otherwise */ 751| 759k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 759k| return node; 753| 759k| } else { 754| 549| auto new_parent = node_t::make_inner_e(e); 755| 549| IMMER_TRY { ------------------ | | 49| 549|#define IMMER_TRY try ------------------ 756| 549| new_parent->inner()[new_idx] = 757| 549| idx == new_idx ------------------ | Branch (757:21): [True: 227, False: 322] ------------------ 758| 549| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 549| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 549| node_t::do_copy_inner(new_parent, node, new_idx); 762| 549| if (Mutating) ------------------ | Branch (762:21): [True: 549, Folded] ------------------ 763| 549| pos.visit(dec_visitor{}); 764| 549| return new_parent; 765| 549| } 766| 549| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 549| } 771| 759k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE13visit_regularIRNS1_11regular_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_: 741| 2.73k| { 742| 2.73k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 2.73k, False: 0] ------------------ 743| 2.73k| auto node = pos.node(); 744| 2.73k| auto idx = pos.index(pos.size() - 1); 745| 2.73k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 2.73k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 2.73k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 2.73k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 2.73k] ------------------ 748| 0| node->inner()[new_idx] = 749| 0| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 0, False: 0] ------------------ 750| | /* otherwise */ 751| 0| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 0| return node; 753| 2.73k| } else { 754| 2.73k| auto new_parent = node_t::make_inner_e(e); 755| 2.73k| IMMER_TRY { ------------------ | | 49| 2.73k|#define IMMER_TRY try ------------------ 756| 2.73k| new_parent->inner()[new_idx] = 757| 2.73k| idx == new_idx ------------------ | Branch (757:21): [True: 1.07k, False: 1.65k] ------------------ 758| 2.73k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 2.73k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 2.73k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 2.73k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 2.73k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 2.73k| return new_parent; 765| 2.73k| } 766| 2.73k| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 2.73k| } 771| 2.73k| } _ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEEPSC_OT_NSA_5applyIS7_E4type4editESI_j: 680| 7.43k| { 681| 7.43k| auto node = pos.node(); 682| 7.43k| auto level = pos.shift(); 683| 7.43k| auto idx = pos.count() - 1; 684| 7.43k| auto children = pos.size(idx); 685| 7.43k| auto new_idx = 686| 7.43k| children == size_t{1} << level || level == BL ? idx + 1 : idx; ------------------ | Branch (686:13): [True: 1.26k, False: 6.16k] | Branch (686:47): [True: 424, False: 5.74k] ------------------ 687| 7.43k| auto new_child = static_cast(nullptr); 688| 7.43k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (688:26): [Folded, False: 7.43k] | Branch (688:38): [True: 0, False: 0] ------------------ 689| | 690| 7.43k| if (new_idx >= branches) ------------------ | Branch (690:13): [True: 589, False: 6.84k] ------------------ 691| 589| return nullptr; 692| 6.84k| else if (idx == new_idx) { ------------------ | Branch (692:18): [True: 5.74k, False: 1.10k] ------------------ 693| 5.74k| new_child = 694| 5.74k| mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts) ------------------ | Branch (694:17): [True: 0, False: 5.74k] ------------------ 695| 5.74k| : pos.last_oh_csh( 696| 5.74k| this_no_mut_t{}, idx, children, e, tail, ts); 697| 5.74k| if (!new_child) { ------------------ | Branch (697:17): [True: 607, False: 5.13k] ------------------ 698| 607| if (++new_idx < branches) ------------------ | Branch (698:21): [True: 261, False: 346] ------------------ 699| 261| new_child = node_t::make_path_e(e, level - B, tail); 700| 346| else 701| 346| return nullptr; 702| 607| } 703| 5.74k| } else 704| 1.10k| new_child = node_t::make_path_e(e, level - B, tail); 705| | 706| 6.49k| if (mutate) { ------------------ | Branch (706:13): [True: 0, False: 6.49k] ------------------ 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.49k| } else { 715| 6.49k| IMMER_TRY { ------------------ | | 49| 6.49k|#define IMMER_TRY try ------------------ 716| 6.49k| auto count = new_idx + 1; 717| 6.49k| auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx); 718| 6.49k| auto relaxed = new_node->relaxed(); 719| 6.49k| new_node->inner()[new_idx] = new_child; 720| 6.49k| relaxed->d.sizes[new_idx] = pos.size() + ts; 721| 6.49k| relaxed->d.count = count; 722| 6.49k| assert(relaxed->d.sizes[new_idx]); ------------------ | Branch (722:17): [True: 6.49k, False: 0] ------------------ 723| 6.49k| if (Mutating) ------------------ | Branch (723:21): [Folded, False: 6.49k] ------------------ 724| 0| pos.visit(dec_visitor{}); 725| 6.49k| return new_node; 726| 6.49k| } 727| 6.49k| 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.49k| } 737| 6.49k| } _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.08k| { 742| 1.08k| assert((pos.size() & mask) == 0); ------------------ | Branch (742:9): [True: 1.08k, False: 0] ------------------ 743| 1.08k| auto node = pos.node(); 744| 1.08k| auto idx = pos.index(pos.size() - 1); 745| 1.08k| auto new_idx = pos.index(pos.size() + branches - 1); 746| 1.08k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (746:24): [Folded, False: 1.08k] | Branch (746:36): [True: 0, False: 0] ------------------ 747| 1.08k| if (mutate) { ------------------ | Branch (747:13): [True: 0, False: 1.08k] ------------------ 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.08k| } else { 754| 1.08k| auto new_parent = node_t::make_inner_e(e); 755| 1.08k| IMMER_TRY { ------------------ | | 49| 1.08k|#define IMMER_TRY try ------------------ 756| 1.08k| new_parent->inner()[new_idx] = 757| 1.08k| idx == new_idx ------------------ | Branch (757:21): [True: 655, False: 425] ------------------ 758| 1.08k| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 1.08k| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 1.08k| node_t::do_copy_inner(new_parent, node, new_idx); 762| 1.08k| if (Mutating) ------------------ | Branch (762:21): [Folded, False: 1.08k] ------------------ 763| 0| pos.visit(dec_visitor{}); 764| 1.08k| return new_parent; 765| 1.08k| } 766| 1.08k| 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.08k| } 771| 1.08k| } _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: 139k, False: 688] ------------------ 747| 139k| if (mutate) { ------------------ | Branch (747:13): [True: 139k, False: 688] ------------------ 748| 139k| node->inner()[new_idx] = 749| 139k| idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail) ------------------ | Branch (749:17): [True: 135k, False: 3.93k] ------------------ 750| | /* otherwise */ 751| 139k| : node_t::make_path_e(e, pos.shift() - B, tail); 752| 139k| return node; 753| 139k| } else { 754| 688| auto new_parent = node_t::make_inner_e(e); 755| 688| IMMER_TRY { ------------------ | | 49| 688|#define IMMER_TRY try ------------------ 756| 688| new_parent->inner()[new_idx] = 757| 688| idx == new_idx ------------------ | Branch (757:21): [True: 437, False: 251] ------------------ 758| 688| ? pos.last_oh(this_no_mut_t{}, idx, e, tail) 759| | /* otherwise */ 760| 688| : node_t::make_path_e(e, pos.shift() - B, tail); 761| 688| node_t::do_copy_inner(new_parent, node, new_idx); 762| 688| if (Mutating) ------------------ | Branch (762:21): [True: 688, Folded] ------------------ 763| 688| pos.visit(dec_visitor{}); 764| 688| return new_parent; 765| 688| } 766| 688| IMMER_CATCH (...) { 767| 0| node_t::delete_inner_e(new_parent); 768| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 769| 0| } 770| 688| } 771| 139k| } _ZN5immer6detail4rbts17dec_empty_regularINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEvPT_: 580| 2.04k|{ 581| 2.04k| make_empty_regular_pos(node).visit(dec_visitor()); 582| 2.04k|} _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| 109k| { 596| 109k| auto offset = pos.index(idx); 597| 109k| auto count = pos.count(); 598| 109k| auto node = pos.node(); 599| 109k| if (node->can_mutate(e)) { ------------------ | Branch (599:13): [True: 97.7k, False: 11.3k] ------------------ 600| 97.7k| return pos.towards_oh( 601| 97.7k| this_t{}, idx, offset, e, &node->inner()[offset]); 602| 97.7k| } else { 603| 11.3k| auto new_node = node_t::copy_inner_sr_e(e, node, count); 604| 11.3k| IMMER_TRY { ------------------ | | 49| 11.3k|#define IMMER_TRY try ------------------ 605| 11.3k| auto& res = pos.towards_oh( 606| 11.3k| this_t{}, idx, offset, e, &new_node->inner()[offset]); 607| 11.3k| pos.visit(dec_visitor{}); 608| 11.3k| *location = new_node; 609| 11.3k| return res; 610| 11.3k| } 611| 11.3k| IMMER_CATCH (...) { 612| 0| dec_relaxed(new_node, pos.shift()); 613| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 614| 0| } 615| 11.3k| } 616| 109k| } _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| 31.7k| { 653| 31.7k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 31.7k, False: 0] ------------------ 654| 31.7k| auto node = pos.node(); 655| 31.7k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 29.3k, False: 2.47k] ------------------ 656| 29.3k| return node->leaf()[pos.index(idx)]; 657| 29.3k| } else { 658| 2.47k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 2.47k| pos.visit(dec_visitor{}); 660| 2.47k| *location = new_node; 661| 2.47k| return new_node->leaf()[pos.index(idx)]; 662| 2.47k| } 663| 31.7k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_regularIRNS1_15regular_sub_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 621| 6.93k| { 622| 6.93k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 6.93k, False: 0] ------------------ 623| 6.93k| auto offset = pos.index(idx); 624| 6.93k| auto count = pos.count(); 625| 6.93k| auto node = pos.node(); 626| 6.93k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 5.24k, False: 1.68k] ------------------ 627| 5.24k| return pos.towards_oh_ch( 628| 5.24k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 5.24k| } 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| 6.93k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10visit_leafIRNS1_13full_leaf_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 652| 5.89k| { 653| 5.89k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 5.89k, False: 0] ------------------ 654| 5.89k| auto node = pos.node(); 655| 5.89k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 4.00k, False: 1.88k] ------------------ 656| 4.00k| return node->leaf()[pos.index(idx)]; 657| 4.00k| } else { 658| 1.88k| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 1.88k| pos.visit(dec_visitor{}); 660| 1.88k| *location = new_node; 661| 1.88k| return new_node->leaf()[pos.index(idx)]; 662| 1.88k| } 663| 5.89k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_regularIRNS1_8full_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 621| 4.78k| { 622| 4.78k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 4.78k, False: 0] ------------------ 623| 4.78k| auto offset = pos.index(idx); 624| 4.78k| auto count = pos.count(); 625| 4.78k| auto node = pos.node(); 626| 4.78k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 3.34k, False: 1.44k] ------------------ 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.44k| auto new_node = node_t::copy_inner_e(e, node, count); 631| 1.44k| IMMER_TRY { ------------------ | | 49| 1.44k|#define IMMER_TRY try ------------------ 632| 1.44k| auto& res = pos.towards_oh_ch(this_t{}, 633| 1.44k| idx, 634| 1.44k| offset, 635| 1.44k| count, 636| 1.44k| e, 637| 1.44k| &new_node->inner()[offset]); 638| 1.44k| pos.visit(dec_visitor{}); 639| 1.44k| *location = new_node; 640| 1.44k| return res; 641| 1.44k| } 642| 1.44k| 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.44k| } 647| 4.78k| } _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.03k| { 653| 1.03k| assert(pos.node() == *location); ------------------ | Branch (653:9): [True: 1.03k, False: 0] ------------------ 654| 1.03k| auto node = pos.node(); 655| 1.03k| if (node->can_mutate(e)) { ------------------ | Branch (655:13): [True: 706, False: 333] ------------------ 656| 706| return node->leaf()[pos.index(idx)]; 657| 706| } else { 658| 333| auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count()); 659| 333| pos.visit(dec_visitor{}); 660| 333| *location = new_node; 661| 333| return new_node->leaf()[pos.index(idx)]; 662| 333| } 663| 1.03k| } _ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13visit_regularIRNS1_11regular_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_: 621| 2.56k| { 622| 2.56k| assert(pos.node() == *location); ------------------ | Branch (622:9): [True: 2.56k, False: 0] ------------------ 623| 2.56k| auto offset = pos.index(idx); 624| 2.56k| auto count = pos.count(); 625| 2.56k| auto node = pos.node(); 626| 2.56k| if (node->can_mutate(e)) { ------------------ | Branch (626:13): [True: 2.26k, False: 298] ------------------ 627| 2.26k| return pos.towards_oh_ch( 628| 2.26k| this_t{}, idx, offset, count, e, &node->inner()[offset]); 629| 2.26k| } else { 630| 298| auto new_node = node_t::copy_inner_e(e, node, count); 631| 298| IMMER_TRY { ------------------ | | 49| 298|#define IMMER_TRY try ------------------ 632| 298| auto& res = pos.towards_oh_ch(this_t{}, 633| 298| idx, 634| 298| offset, 635| 298| count, 636| 298| e, 637| 298| &new_node->inner()[offset]); 638| 298| pos.visit(dec_visitor{}); 639| 298| *location = new_node; 640| 298| return res; 641| 298| } 642| 298| 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| 298| } 647| 2.56k| } _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| 64.8k| { 914| 64.8k| auto idx = pos.index(last); 915| 64.8k| auto node = pos.node(); 916| 64.8k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 64.8k, Folded] | Branch (916:35): [True: 56.2k, False: 8.56k] ------------------ 917| 64.8k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 64.8k, Folded] | Branch (917:25): [True: 45.2k, False: 19.5k] ------------------ 918| 45.2k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 40.5k, False: 4.75k] ------------------ 919| 45.2k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 45.2k| if (Mutating) ------------------ | Branch (920:17): [True: 45.2k, Folded] ------------------ 921| 45.2k| pos.visit(dec_right_visitor{}, count_t{1}); 922| 45.2k| return res; 923| 45.2k| } else { 924| 19.5k| using std::get; 925| 19.5k| auto subs = 926| 19.5k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 15.7k, False: 3.81k] ------------------ 927| 19.5k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 19.5k| auto next = get<1>(subs); 929| 19.5k| auto ts = get<2>(subs); 930| 19.5k| auto tail = get<3>(subs); 931| 19.5k| IMMER_TRY { ------------------ | | 49| 19.5k|#define IMMER_TRY try ------------------ 932| 19.5k| if (next) { ------------------ | Branch (932:21): [True: 13.3k, False: 6.22k] ------------------ 933| 13.3k| if (mutate) { ------------------ | Branch (933:25): [True: 11.0k, False: 2.27k] ------------------ 934| 11.0k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 11.0k| pos.each_right(dec_visitor{}, idx + 1); 936| 11.0k| node->inner()[idx] = next; 937| 11.0k| nodr->d.sizes[idx] = last + 1 - ts; 938| 11.0k| nodr->d.count = idx + 1; 939| 11.0k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 11.0k, False: 0] ------------------ 940| 11.0k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 11.0k| } else { 942| 2.27k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 2.27k| auto newr = newn->relaxed(); 944| 2.27k| newn->inner()[idx] = next; 945| 2.27k| newr->d.sizes[idx] = last + 1 - ts; 946| 2.27k| newr->d.count = idx + 1; 947| 2.27k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 2.27k, False: 0] ------------------ 948| 2.27k| if (Mutating) ------------------ | Branch (948:29): [True: 2.27k, Folded] ------------------ 949| 2.27k| pos.visit(dec_visitor{}); 950| 2.27k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 2.27k| } 952| 13.3k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 6.22k] ------------------ 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| 6.22k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 6.22k, Folded] | Branch (956:40): [True: 5.20k, False: 1.01k] | Branch (956:52): [True: 4.35k, False: 847] ------------------ 957| 4.35k| auto newn = pos.node()->inner()[0]; 958| 4.35k| if (!mutate) ------------------ | Branch (958:25): [True: 836, False: 3.51k] ------------------ 959| 836| newn->inc(); 960| 4.35k| if (Mutating) ------------------ | Branch (960:25): [True: 4.35k, Folded] ------------------ 961| 4.35k| pos.visit(dec_right_visitor{}, count_t{2}); 962| 4.35k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 4.35k| } else { 964| 1.86k| if (mutate) { ------------------ | Branch (964:25): [True: 1.16k, False: 705] ------------------ 965| 1.16k| pos.each_right(dec_visitor{}, idx + 1); 966| 1.16k| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 1.16k| return std::make_tuple(pos.shift(), node, ts, tail); 968| 1.16k| } else { 969| 705| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 705| if (Mutating) ------------------ | Branch (970:29): [True: 705, Folded] ------------------ 971| 705| pos.visit(dec_visitor{}); 972| 705| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 705| } 974| 1.86k| } 975| 19.5k| } 976| 19.5k| IMMER_CATCH (...) { 977| 0| assert(!mutate); ------------------ | Branch (977:17): [True: 0, False: 0] ------------------ 978| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] ------------------ 979| 0| if (next) ------------------ | Branch (979:21): [True: 0, False: 0] ------------------ 980| 0| dec_inner(next, 981| 0| pos.shift() - B, 982| 0| last + 1 - ts - pos.size_before(idx)); 983| 0| dec_leaf(tail, ts); 984| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 985| 0| } 986| 19.5k| } 987| 64.8k| } _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.11k| { 1060| 1.11k| auto old_tail_size = pos.count(); 1061| 1.11k| auto new_tail_size = pos.index(last) + 1; 1062| 1.11k| auto node = pos.node(); 1063| 1.11k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.11k, Folded] | Branch (1063:42): [True: 323, False: 795] ------------------ 1064| 1.11k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 295, False: 823] ------------------ 1065| 295| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 295] ------------------ 1066| 0| node->inc(); 1067| 295| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 823| } else if (mutate) { ------------------ | Branch (1068:20): [True: 288, False: 535] ------------------ 1069| 288| detail::destroy_n(node->leaf() + new_tail_size, 1070| 288| old_tail_size - new_tail_size); 1071| 288| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 535| } else { 1073| 535| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 535| if (Mutating) ------------------ | Branch (1074:17): [True: 535, Folded] ------------------ 1075| 535| pos.visit(dec_visitor{}); 1076| 535| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 535| } 1078| 1.11k| } _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| 952| { 1060| 952| auto old_tail_size = pos.count(); 1061| 952| auto new_tail_size = pos.index(last) + 1; 1062| 952| auto node = pos.node(); 1063| 952| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 952] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 952| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 568, False: 384] ------------------ 1065| 568| if (!Mutating) ------------------ | Branch (1065:17): [True: 568, Folded] ------------------ 1066| 568| node->inc(); 1067| 568| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 568| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 384] ------------------ 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| 384| } else { 1073| 384| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 384| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 384] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 384| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 384| } 1078| 952| } _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| 18.6k| { 914| 18.6k| auto idx = pos.index(last); 915| 18.6k| auto node = pos.node(); 916| 18.6k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 18.6k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 18.6k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [True: 18.6k, Folded] | Branch (917:25): [True: 16.5k, False: 2.13k] ------------------ 918| 16.5k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 0, False: 16.5k] ------------------ 919| 16.5k| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 16.5k| if (Mutating) ------------------ | Branch (920:17): [Folded, False: 16.5k] ------------------ 921| 0| pos.visit(dec_right_visitor{}, count_t{1}); 922| 16.5k| return res; 923| 16.5k| } else { 924| 2.13k| using std::get; 925| 2.13k| auto subs = 926| 2.13k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 2.13k] ------------------ 927| 2.13k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 2.13k| auto next = get<1>(subs); 929| 2.13k| auto ts = get<2>(subs); 930| 2.13k| auto tail = get<3>(subs); 931| 2.13k| IMMER_TRY { ------------------ | | 49| 2.13k|#define IMMER_TRY try ------------------ 932| 2.13k| if (next) { ------------------ | Branch (932:21): [True: 632, False: 1.50k] ------------------ 933| 632| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 632] ------------------ 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| 632| } else { 942| 632| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 632| auto newr = newn->relaxed(); 944| 632| newn->inner()[idx] = next; 945| 632| newr->d.sizes[idx] = last + 1 - ts; 946| 632| newr->d.count = idx + 1; 947| 632| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 632, False: 0] ------------------ 948| 632| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 632] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 632| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 632| } 952| 1.50k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 0, False: 1.50k] ------------------ 953| 0| if (Mutating) ------------------ | Branch (953:25): [Folded, False: 0] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 1.50k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [True: 1.50k, Folded] | Branch (956:40): [True: 676, False: 828] | Branch (956:52): [True: 382, False: 294] ------------------ 957| 382| auto newn = pos.node()->inner()[0]; 958| 382| if (!mutate) ------------------ | Branch (958:25): [True: 382, False: 0] ------------------ 959| 382| newn->inc(); 960| 382| if (Mutating) ------------------ | Branch (960:25): [Folded, False: 382] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 382| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 1.12k| } else { 964| 1.12k| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 1.12k] ------------------ 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.12k| } else { 969| 1.12k| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 1.12k| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 1.12k] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 1.12k| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 1.12k| } 974| 1.12k| } 975| 2.13k| } 976| 2.13k| 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.13k| } 987| 18.6k| } _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.66k| { 992| 1.66k| auto idx = pos.index(last); 993| 1.66k| auto node = pos.node(); 994| 1.66k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 1.66k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 1.66k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 1.66k, Folded] | Branch (995:25): [True: 606, False: 1.06k] ------------------ 996| 606| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 606] ------------------ 997| 606| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 606| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 606] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 606| return res; 1001| 1.06k| } else { 1002| 1.06k| using std::get; 1003| 1.06k| auto subs = 1004| 1.06k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 1.06k] ------------------ 1005| 1.06k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.06k| auto next = get<1>(subs); 1007| 1.06k| auto ts = get<2>(subs); 1008| 1.06k| auto tail = get<3>(subs); 1009| 1.06k| IMMER_TRY { ------------------ | | 49| 1.06k|#define IMMER_TRY try ------------------ 1010| 1.06k| if (next) { ------------------ | Branch (1010:21): [True: 224, False: 838] ------------------ 1011| 224| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 224] ------------------ 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| 224| } else { 1016| 224| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 224| newn->inner()[idx] = next; 1018| 224| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 224] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 224| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 224| } 1022| 838| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 838] ------------------ 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| 838| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 838, Folded] | Branch (1026:40): [True: 606, False: 232] | Branch (1026:52): [True: 208, False: 398] ------------------ 1027| 208| auto newn = pos.node()->inner()[0]; 1028| 208| if (!mutate) ------------------ | Branch (1028:25): [True: 208, False: 0] ------------------ 1029| 208| newn->inc(); 1030| 208| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 208] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 208| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 630| } else { 1034| 630| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 630] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 630| } else { 1038| 630| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 630| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 630] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 630| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 630| } 1043| 630| } 1044| 1.06k| } 1045| 1.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| 1.06k| } 1055| 1.66k| } _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.58k| { 1060| 1.58k| auto old_tail_size = pos.count(); 1061| 1.58k| auto new_tail_size = pos.index(last) + 1; 1062| 1.58k| auto node = pos.node(); 1063| 1.58k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 1.58k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 1.58k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 821, False: 764] ------------------ 1065| 821| if (!Mutating) ------------------ | Branch (1065:17): [True: 821, Folded] ------------------ 1066| 821| node->inc(); 1067| 821| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 821| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 764] ------------------ 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| 764| } else { 1073| 764| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 764| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 764] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 764| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 764| } 1078| 1.58k| } _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| 2.19k| { 992| 2.19k| auto idx = pos.index(last); 993| 2.19k| auto node = pos.node(); 994| 2.19k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 2.19k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 2.19k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 2.19k, Folded] | Branch (995:25): [True: 867, False: 1.32k] ------------------ 996| 867| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 867] ------------------ 997| 867| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 867| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 867] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 867| return res; 1001| 1.32k| } else { 1002| 1.32k| using std::get; 1003| 1.32k| auto subs = 1004| 1.32k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 1.32k] ------------------ 1005| 1.32k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 1.32k| auto next = get<1>(subs); 1007| 1.32k| auto ts = get<2>(subs); 1008| 1.32k| auto tail = get<3>(subs); 1009| 1.32k| IMMER_TRY { ------------------ | | 49| 1.32k|#define IMMER_TRY try ------------------ 1010| 1.32k| if (next) { ------------------ | Branch (1010:21): [True: 249, False: 1.07k] ------------------ 1011| 249| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 249] ------------------ 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| 249| } else { 1016| 249| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 249| newn->inner()[idx] = next; 1018| 249| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 249] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 249| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 249| } 1022| 1.07k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 1.07k] ------------------ 1023| 0| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 0] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 0| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.07k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 1.07k, Folded] | Branch (1026:40): [True: 743, False: 332] | Branch (1026:52): [True: 271, False: 472] ------------------ 1027| 271| auto newn = pos.node()->inner()[0]; 1028| 271| if (!mutate) ------------------ | Branch (1028:25): [True: 271, False: 0] ------------------ 1029| 271| newn->inc(); 1030| 271| if (Mutating) ------------------ | Branch (1030:25): [Folded, False: 271] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 271| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 804| } else { 1034| 804| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 804] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 804| } else { 1038| 804| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 804| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 804] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 804| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 804| } 1043| 804| } 1044| 1.32k| } 1045| 1.32k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 1.32k| } 1055| 2.19k| } _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.89k| { 1060| 5.89k| auto old_tail_size = pos.count(); 1061| 5.89k| auto new_tail_size = pos.index(last) + 1; 1062| 5.89k| auto node = pos.node(); 1063| 5.89k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 5.89k, Folded] | Branch (1063:42): [True: 1.20k, False: 4.68k] ------------------ 1064| 5.89k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 1.36k, False: 4.52k] ------------------ 1065| 1.36k| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 1.36k] ------------------ 1066| 0| node->inc(); 1067| 1.36k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 4.52k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 1.13k, False: 3.39k] ------------------ 1069| 1.13k| detail::destroy_n(node->leaf() + new_tail_size, 1070| 1.13k| old_tail_size - new_tail_size); 1071| 1.13k| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 3.39k| } else { 1073| 3.39k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 3.39k| if (Mutating) ------------------ | Branch (1074:17): [True: 3.39k, Folded] ------------------ 1075| 3.39k| pos.visit(dec_visitor{}); 1076| 3.39k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 3.39k| } 1078| 5.89k| } _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.67k| { 992| 4.67k| auto idx = pos.index(last); 993| 4.67k| auto node = pos.node(); 994| 4.67k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 4.67k, Folded] | Branch (994:35): [True: 2.38k, False: 2.28k] ------------------ 995| 4.67k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 4.67k] | 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.67k| } else { 1002| 4.67k| using std::get; 1003| 4.67k| auto subs = 1004| 4.67k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 2.38k, False: 2.28k] ------------------ 1005| 4.67k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 4.67k| auto next = get<1>(subs); 1007| 4.67k| auto ts = get<2>(subs); 1008| 4.67k| auto tail = get<3>(subs); 1009| 4.67k| IMMER_TRY { ------------------ | | 49| 4.67k|#define IMMER_TRY try ------------------ 1010| 4.67k| if (next) { ------------------ | Branch (1010:21): [True: 741, False: 3.93k] ------------------ 1011| 741| if (mutate) { ------------------ | Branch (1011:25): [True: 516, False: 225] ------------------ 1012| 516| node->inner()[idx] = next; 1013| 516| pos.each_right(dec_visitor{}, idx + 1); 1014| 516| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 516| } else { 1016| 225| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 225| newn->inner()[idx] = next; 1018| 225| if (Mutating) ------------------ | Branch (1018:29): [True: 225, Folded] ------------------ 1019| 225| pos.visit(dec_visitor{}); 1020| 225| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 225| } 1022| 3.93k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.53k, False: 2.40k] ------------------ 1023| 1.53k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.53k, Folded] ------------------ 1024| 1.53k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.53k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 2.40k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 2.40k] | 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.40k| } else { 1034| 2.40k| if (mutate) { ------------------ | Branch (1034:25): [True: 1.18k, False: 1.21k] ------------------ 1035| 1.18k| pos.each_right(dec_visitor{}, idx + 1); 1036| 1.18k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.21k| } else { 1038| 1.21k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.21k| if (Mutating) ------------------ | Branch (1039:29): [True: 1.21k, Folded] ------------------ 1040| 1.21k| pos.visit(dec_visitor{}); 1041| 1.21k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.21k| } 1043| 2.40k| } 1044| 4.67k| } 1045| 4.67k| 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.67k| } 1055| 4.67k| } _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.53k| { 879| 3.53k| using node_t = node_type; 880| 3.53k| auto node = p.node(); 881| 3.53k| if (node->dec()) { ------------------ | Branch (881:13): [True: 2.01k, False: 1.51k] ------------------ 882| 2.01k| p.each_right(dec_t{}, idx); 883| 2.01k| node_t::delete_inner(node, p.count()); 884| 2.01k| } 885| 3.53k| } _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| 10.1k| { 1060| 10.1k| auto old_tail_size = pos.count(); 1061| 10.1k| auto new_tail_size = pos.index(last) + 1; 1062| 10.1k| auto node = pos.node(); 1063| 10.1k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 10.1k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 10.1k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 2.84k, False: 7.32k] ------------------ 1065| 2.84k| if (!Mutating) ------------------ | Branch (1065:17): [True: 2.84k, Folded] ------------------ 1066| 2.84k| node->inc(); 1067| 2.84k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 7.32k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 7.32k] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 7.32k| } else { 1073| 7.32k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 7.32k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 7.32k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 7.32k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 7.32k| } 1078| 10.1k| } _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.13k| { 992| 3.13k| auto idx = pos.index(last); 993| 3.13k| auto node = pos.node(); 994| 3.13k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.13k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.13k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.13k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [Folded, False: 0] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 3.13k| } else { 1002| 3.13k| using std::get; 1003| 3.13k| auto subs = 1004| 3.13k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.13k] ------------------ 1005| 3.13k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.13k| auto next = get<1>(subs); 1007| 3.13k| auto ts = get<2>(subs); 1008| 3.13k| auto tail = get<3>(subs); 1009| 3.13k| IMMER_TRY { ------------------ | | 49| 3.13k|#define IMMER_TRY try ------------------ 1010| 3.13k| if (next) { ------------------ | Branch (1010:21): [True: 292, False: 2.84k] ------------------ 1011| 292| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 292] ------------------ 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| 292| } else { 1016| 292| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 292| newn->inner()[idx] = next; 1018| 292| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 292] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 292| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 292| } 1022| 2.84k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.14k, False: 1.69k] ------------------ 1023| 1.14k| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 1.14k] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.14k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.69k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.69k] | 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.69k| } else { 1034| 1.69k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 1.69k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.69k| } else { 1038| 1.69k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.69k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 1.69k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 1.69k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.69k| } 1043| 1.69k| } 1044| 3.13k| } 1045| 3.13k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 3.13k| } 1055| 3.13k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb0EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 414| { 1060| 414| auto old_tail_size = pos.count(); 1061| 414| auto new_tail_size = pos.index(last) + 1; 1062| 414| auto node = pos.node(); 1063| 414| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 414] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 414| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 201, False: 213] ------------------ 1065| 201| if (!Mutating) ------------------ | Branch (1065:17): [True: 201, Folded] ------------------ 1066| 201| node->inc(); 1067| 201| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 213| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 213] ------------------ 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| 213| } else { 1073| 213| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 213| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 213] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 213| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 213| } 1078| 414| } _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.56k| { 1060| 2.56k| auto old_tail_size = pos.count(); 1061| 2.56k| auto new_tail_size = pos.index(last) + 1; 1062| 2.56k| auto node = pos.node(); 1063| 2.56k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 2.56k, Folded] | Branch (1063:42): [True: 326, False: 2.23k] ------------------ 1064| 2.56k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 236, False: 2.32k] ------------------ 1065| 236| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 236] ------------------ 1066| 0| node->inc(); 1067| 236| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 2.32k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 308, False: 2.01k] ------------------ 1069| 308| detail::destroy_n(node->leaf() + new_tail_size, 1070| 308| old_tail_size - new_tail_size); 1071| 308| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 2.01k| } else { 1073| 2.01k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 2.01k| if (Mutating) ------------------ | Branch (1074:17): [True: 2.01k, Folded] ------------------ 1075| 2.01k| pos.visit(dec_visitor{}); 1076| 2.01k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 2.01k| } 1078| 2.56k| } _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.12k| { 992| 6.12k| auto idx = pos.index(last); 993| 6.12k| auto node = pos.node(); 994| 6.12k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 6.12k, Folded] | Branch (994:35): [True: 5.50k, False: 621] ------------------ 995| 6.12k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 6.12k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [True: 0, Folded] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 6.12k| } else { 1002| 6.12k| using std::get; 1003| 6.12k| auto subs = 1004| 6.12k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 5.50k, False: 621] ------------------ 1005| 6.12k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 6.12k| auto next = get<1>(subs); 1007| 6.12k| auto ts = get<2>(subs); 1008| 6.12k| auto tail = get<3>(subs); 1009| 6.12k| IMMER_TRY { ------------------ | | 49| 6.12k|#define IMMER_TRY try ------------------ 1010| 6.12k| if (next) { ------------------ | Branch (1010:21): [True: 1.67k, False: 4.45k] ------------------ 1011| 1.67k| if (mutate) { ------------------ | Branch (1011:25): [True: 1.47k, False: 201] ------------------ 1012| 1.47k| node->inner()[idx] = next; 1013| 1.47k| pos.each_right(dec_visitor{}, idx + 1); 1014| 1.47k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 1.47k| } else { 1016| 201| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 201| newn->inner()[idx] = next; 1018| 201| if (Mutating) ------------------ | Branch (1018:29): [True: 201, Folded] ------------------ 1019| 201| pos.visit(dec_visitor{}); 1020| 201| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 201| } 1022| 4.45k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 3.63k, False: 814] ------------------ 1023| 3.63k| if (Mutating) ------------------ | Branch (1023:25): [True: 3.63k, Folded] ------------------ 1024| 3.63k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 3.63k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 3.63k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 814] | 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| 814| } else { 1034| 814| if (mutate) { ------------------ | Branch (1034:25): [True: 598, False: 216] ------------------ 1035| 598| pos.each_right(dec_visitor{}, idx + 1); 1036| 598| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 598| } else { 1038| 216| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 216| if (Mutating) ------------------ | Branch (1039:29): [True: 216, Folded] ------------------ 1040| 216| pos.visit(dec_visitor{}); 1041| 216| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 216| } 1043| 814| } 1044| 6.12k| } 1045| 6.12k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 6.12k| } 1055| 6.12k| } _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.63k| { 879| 3.63k| using node_t = node_type; 880| 3.63k| auto node = p.node(); 881| 3.63k| if (node->dec()) { ------------------ | Branch (881:13): [True: 3.43k, False: 204] ------------------ 882| 3.43k| p.each_right(dec_t{}, idx); 883| 3.43k| node_t::delete_inner(node, p.count()); 884| 3.43k| } 885| 3.63k| } _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.49k| { 1060| 2.49k| auto old_tail_size = pos.count(); 1061| 2.49k| auto new_tail_size = pos.index(last) + 1; 1062| 2.49k| auto node = pos.node(); 1063| 2.49k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 2.49k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 2.49k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 728, False: 1.76k] ------------------ 1065| 728| if (!Mutating) ------------------ | Branch (1065:17): [True: 728, Folded] ------------------ 1066| 728| node->inc(); 1067| 728| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 1.76k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 1.76k] ------------------ 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.76k| } else { 1073| 1.76k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.76k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 1.76k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 1.76k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.76k| } 1078| 2.49k| } _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.32k| { 992| 3.32k| auto idx = pos.index(last); 993| 3.32k| auto node = pos.node(); 994| 3.32k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.32k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.32k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.32k] | 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.32k| } else { 1002| 3.32k| using std::get; 1003| 3.32k| auto subs = 1004| 3.32k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.32k] ------------------ 1005| 3.32k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.32k| auto next = get<1>(subs); 1007| 3.32k| auto ts = get<2>(subs); 1008| 3.32k| auto tail = get<3>(subs); 1009| 3.32k| IMMER_TRY { ------------------ | | 49| 3.32k|#define IMMER_TRY try ------------------ 1010| 3.32k| if (next) { ------------------ | Branch (1010:21): [True: 424, False: 2.89k] ------------------ 1011| 424| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 424] ------------------ 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| 424| } else { 1016| 424| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 424| newn->inner()[idx] = next; 1018| 424| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 424] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 424| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 424| } 1022| 2.89k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.85k, False: 1.04k] ------------------ 1023| 1.85k| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 1.85k] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.85k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.85k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.04k] | 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.04k| } else { 1034| 1.04k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 1.04k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.04k| } else { 1038| 1.04k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.04k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 1.04k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 1.04k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.04k| } 1043| 1.04k| } 1044| 3.32k| } 1045| 3.32k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 3.32k| } 1055| 3.32k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_j: 867| 53.5k| { 868| 53.5k| using node_t = node_type; 869| 53.5k| auto node = p.node(); 870| 53.5k| if (node->dec()) { ------------------ | Branch (870:13): [True: 46.6k, False: 6.91k] ------------------ 871| 46.6k| p.each_right(dec_t{}, idx); 872| 46.6k| node_t::delete_inner_r(node, p.count()); 873| 46.6k| } 874| 53.5k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 4.44k| { 1060| 4.44k| auto old_tail_size = pos.count(); 1061| 4.44k| auto new_tail_size = pos.index(last) + 1; 1062| 4.44k| auto node = pos.node(); 1063| 4.44k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 4.44k, Folded] | Branch (1063:42): [True: 1.17k, False: 3.27k] ------------------ 1064| 4.44k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 2.08k, False: 2.36k] ------------------ 1065| 2.08k| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 2.08k] ------------------ 1066| 0| node->inc(); 1067| 2.08k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 2.36k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 1.00k, False: 1.35k] ------------------ 1069| 1.00k| detail::destroy_n(node->leaf() + new_tail_size, 1070| 1.00k| old_tail_size - new_tail_size); 1071| 1.00k| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 1.35k| } else { 1073| 1.35k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 1.35k| if (Mutating) ------------------ | Branch (1074:17): [True: 1.35k, Folded] ------------------ 1075| 1.35k| pos.visit(dec_visitor{}); 1076| 1.35k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 1.35k| } 1078| 4.44k| } _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| 12.8k| { 914| 12.8k| auto idx = pos.index(last); 915| 12.8k| auto node = pos.node(); 916| 12.8k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [True: 12.8k, Folded] | Branch (916:35): [True: 9.20k, False: 3.66k] ------------------ 917| 12.8k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 12.8k] | 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| 12.8k| } else { 924| 12.8k| using std::get; 925| 12.8k| auto subs = 926| 12.8k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 9.20k, False: 3.66k] ------------------ 927| 12.8k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 12.8k| auto next = get<1>(subs); 929| 12.8k| auto ts = get<2>(subs); 930| 12.8k| auto tail = get<3>(subs); 931| 12.8k| IMMER_TRY { ------------------ | | 49| 12.8k|#define IMMER_TRY try ------------------ 932| 12.8k| if (next) { ------------------ | Branch (932:21): [True: 6.06k, False: 6.80k] ------------------ 933| 6.06k| if (mutate) { ------------------ | Branch (933:25): [True: 4.34k, False: 1.71k] ------------------ 934| 4.34k| auto nodr = node->ensure_mutable_relaxed_n(e, idx); 935| 4.34k| pos.each_right(dec_visitor{}, idx + 1); 936| 4.34k| node->inner()[idx] = next; 937| 4.34k| nodr->d.sizes[idx] = last + 1 - ts; 938| 4.34k| nodr->d.count = idx + 1; 939| 4.34k| assert(nodr->d.sizes[idx]); ------------------ | Branch (939:25): [True: 4.34k, False: 0] ------------------ 940| 4.34k| return std::make_tuple(pos.shift(), node, ts, tail); 941| 4.34k| } else { 942| 1.71k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 1.71k| auto newr = newn->relaxed(); 944| 1.71k| newn->inner()[idx] = next; 945| 1.71k| newr->d.sizes[idx] = last + 1 - ts; 946| 1.71k| newr->d.count = idx + 1; 947| 1.71k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 1.71k, False: 0] ------------------ 948| 1.71k| if (Mutating) ------------------ | Branch (948:29): [True: 1.71k, Folded] ------------------ 949| 1.71k| pos.visit(dec_visitor{}); 950| 1.71k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 1.71k| } 952| 6.80k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 3.90k, False: 2.89k] ------------------ 953| 3.90k| if (Mutating) ------------------ | Branch (953:25): [True: 3.90k, Folded] ------------------ 954| 3.90k| pos.visit(dec_right_visitor{}, count_t{1}); 955| 3.90k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 3.90k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 2.89k] | Branch (956:40): [True: 0, False: 0] | Branch (956:52): [True: 0, False: 0] ------------------ 957| 0| auto newn = pos.node()->inner()[0]; 958| 0| if (!mutate) ------------------ | Branch (958:25): [True: 0, False: 0] ------------------ 959| 0| newn->inc(); 960| 0| if (Mutating) ------------------ | Branch (960:25): [True: 0, Folded] ------------------ 961| 0| pos.visit(dec_right_visitor{}, count_t{2}); 962| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 963| 2.89k| } else { 964| 2.89k| if (mutate) { ------------------ | Branch (964:25): [True: 2.27k, False: 621] ------------------ 965| 2.27k| pos.each_right(dec_visitor{}, idx + 1); 966| 2.27k| node->ensure_mutable_relaxed_n(e, idx)->d.count = idx; 967| 2.27k| return std::make_tuple(pos.shift(), node, ts, tail); 968| 2.27k| } else { 969| 621| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 621| if (Mutating) ------------------ | Branch (970:29): [True: 621, Folded] ------------------ 971| 621| pos.visit(dec_visitor{}); 972| 621| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 621| } 974| 2.89k| } 975| 12.8k| } 976| 12.8k| 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| 12.8k| } 987| 12.8k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 7.62k| { 992| 7.62k| auto idx = pos.index(last); 993| 7.62k| auto node = pos.node(); 994| 7.62k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 7.62k, Folded] | Branch (994:35): [True: 6.60k, False: 1.02k] ------------------ 995| 7.62k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 7.62k] | Branch (995:25): [True: 0, False: 0] ------------------ 996| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 0, False: 0] ------------------ 997| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 0| if (Mutating) ------------------ | Branch (998:17): [True: 0, Folded] ------------------ 999| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 0| return res; 1001| 7.62k| } else { 1002| 7.62k| using std::get; 1003| 7.62k| auto subs = 1004| 7.62k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 6.60k, False: 1.02k] ------------------ 1005| 7.62k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 7.62k| auto next = get<1>(subs); 1007| 7.62k| auto ts = get<2>(subs); 1008| 7.62k| auto tail = get<3>(subs); 1009| 7.62k| IMMER_TRY { ------------------ | | 49| 7.62k|#define IMMER_TRY try ------------------ 1010| 7.62k| if (next) { ------------------ | Branch (1010:21): [True: 2.85k, False: 4.76k] ------------------ 1011| 2.85k| if (mutate) { ------------------ | Branch (1011:25): [True: 2.55k, False: 299] ------------------ 1012| 2.55k| node->inner()[idx] = next; 1013| 2.55k| pos.each_right(dec_visitor{}, idx + 1); 1014| 2.55k| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 2.55k| } else { 1016| 299| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 299| newn->inner()[idx] = next; 1018| 299| if (Mutating) ------------------ | Branch (1018:29): [True: 299, Folded] ------------------ 1019| 299| pos.visit(dec_visitor{}); 1020| 299| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 299| } 1022| 4.76k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 1.17k, False: 3.58k] ------------------ 1023| 1.17k| if (Mutating) ------------------ | Branch (1023:25): [True: 1.17k, Folded] ------------------ 1024| 1.17k| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 1.17k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 3.58k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 3.58k] | Branch (1026:40): [True: 0, False: 0] | Branch (1026:52): [True: 0, False: 0] ------------------ 1027| 0| auto newn = pos.node()->inner()[0]; 1028| 0| if (!mutate) ------------------ | Branch (1028:25): [True: 0, False: 0] ------------------ 1029| 0| newn->inc(); 1030| 0| if (Mutating) ------------------ | Branch (1030:25): [True: 0, Folded] ------------------ 1031| 0| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 0| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 3.58k| } else { 1034| 3.58k| if (mutate) { ------------------ | Branch (1034:25): [True: 3.21k, False: 373] ------------------ 1035| 3.21k| pos.each_right(dec_visitor{}, idx + 1); 1036| 3.21k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 3.21k| } else { 1038| 373| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 373| if (Mutating) ------------------ | Branch (1039:29): [True: 373, Folded] ------------------ 1040| 373| pos.visit(dec_visitor{}); 1041| 373| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 373| } 1043| 3.58k| } 1044| 7.62k| } 1045| 7.62k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 7.62k| } 1055| 7.62k| } _ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_j: 878| 10.8k| { 879| 10.8k| using node_t = node_type; 880| 10.8k| auto node = p.node(); 881| 10.8k| if (node->dec()) { ------------------ | Branch (881:13): [True: 7.66k, False: 3.17k] ------------------ 882| 7.66k| p.each_right(dec_t{}, idx); 883| 7.66k| node_t::delete_inner(node, p.count()); 884| 7.66k| } 885| 10.8k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 1059| 6.27k| { 1060| 6.27k| auto old_tail_size = pos.count(); 1061| 6.27k| auto new_tail_size = pos.index(last) + 1; 1062| 6.27k| auto node = pos.node(); 1063| 6.27k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [Folded, False: 6.27k] | Branch (1063:42): [True: 0, False: 0] ------------------ 1064| 6.27k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 2.31k, False: 3.96k] ------------------ 1065| 2.31k| if (!Mutating) ------------------ | Branch (1065:17): [True: 2.31k, Folded] ------------------ 1066| 2.31k| node->inc(); 1067| 2.31k| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 3.96k| } else if (mutate) { ------------------ | Branch (1068:20): [True: 0, False: 3.96k] ------------------ 1069| 0| detail::destroy_n(node->leaf() + new_tail_size, 1070| 0| old_tail_size - new_tail_size); 1071| 0| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 3.96k| } else { 1073| 3.96k| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 3.96k| if (Mutating) ------------------ | Branch (1074:17): [Folded, False: 3.96k] ------------------ 1075| 0| pos.visit(dec_visitor{}); 1076| 3.96k| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 3.96k| } 1078| 6.27k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 913| 7.05k| { 914| 7.05k| auto idx = pos.index(last); 915| 7.05k| auto node = pos.node(); 916| 7.05k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (916:23): [Folded, False: 7.05k] | Branch (916:35): [True: 0, False: 0] ------------------ 917| 7.05k| if (Collapse && idx == 0) { ------------------ | Branch (917:13): [Folded, False: 7.05k] | Branch (917:25): [True: 0, False: 0] ------------------ 918| 0| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (918:24): [True: 0, False: 0] ------------------ 919| 0| : pos.towards_oh(no_mut_t{}, last, idx, e); 920| 0| if (Mutating) ------------------ | Branch (920:17): [Folded, False: 0] ------------------ 921| 0| pos.visit(dec_right_visitor{}, count_t{1}); 922| 0| return res; 923| 7.05k| } else { 924| 7.05k| using std::get; 925| 7.05k| auto subs = 926| 7.05k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (926:17): [True: 0, False: 7.05k] ------------------ 927| 7.05k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 928| 7.05k| auto next = get<1>(subs); 929| 7.05k| auto ts = get<2>(subs); 930| 7.05k| auto tail = get<3>(subs); 931| 7.05k| IMMER_TRY { ------------------ | | 49| 7.05k|#define IMMER_TRY try ------------------ 932| 7.05k| if (next) { ------------------ | Branch (932:21): [True: 1.13k, False: 5.91k] ------------------ 933| 1.13k| if (mutate) { ------------------ | Branch (933:25): [True: 0, False: 1.13k] ------------------ 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.13k| } else { 942| 1.13k| auto newn = node_t::copy_inner_r_e(e, node, idx); 943| 1.13k| auto newr = newn->relaxed(); 944| 1.13k| newn->inner()[idx] = next; 945| 1.13k| newr->d.sizes[idx] = last + 1 - ts; 946| 1.13k| newr->d.count = idx + 1; 947| 1.13k| assert(newr->d.sizes[idx]); ------------------ | Branch (947:25): [True: 1.13k, False: 0] ------------------ 948| 1.13k| if (Mutating) ------------------ | Branch (948:29): [Folded, False: 1.13k] ------------------ 949| 0| pos.visit(dec_visitor{}); 950| 1.13k| return std::make_tuple(pos.shift(), newn, ts, tail); 951| 1.13k| } 952| 5.91k| } else if (idx == 0) { ------------------ | Branch (952:28): [True: 3.97k, False: 1.94k] ------------------ 953| 3.97k| if (Mutating) ------------------ | Branch (953:25): [Folded, False: 3.97k] ------------------ 954| 0| pos.visit(dec_right_visitor{}, count_t{1}); 955| 3.97k| return std::make_tuple(pos.shift(), nullptr, ts, tail); 956| 3.97k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (956:28): [Folded, False: 1.94k] | 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.94k| } else { 964| 1.94k| if (mutate) { ------------------ | Branch (964:25): [True: 0, False: 1.94k] ------------------ 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.94k| } else { 969| 1.94k| auto newn = node_t::copy_inner_r_e(e, node, idx); 970| 1.94k| if (Mutating) ------------------ | Branch (970:29): [Folded, False: 1.94k] ------------------ 971| 0| pos.visit(dec_visitor{}); 972| 1.94k| return std::make_tuple(pos.shift(), newn, ts, tail); 973| 1.94k| } 974| 1.94k| } 975| 7.05k| } 976| 7.05k| IMMER_CATCH (...) { 977| 0| assert(!mutate); ------------------ | Branch (977:17): [True: 0, False: 0] ------------------ 978| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] | Branch (978:17): [True: 0, False: 0] ------------------ 979| 0| if (next) ------------------ | Branch (979:21): [True: 0, False: 0] ------------------ 980| 0| dec_inner(next, 981| 0| pos.shift() - B, 982| 0| last + 1 - ts - pos.size_before(idx)); 983| 0| dec_leaf(tail, ts); 984| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 985| 0| } 986| 7.05k| } 987| 7.05k| } _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.33k| { 992| 3.33k| auto idx = pos.index(last); 993| 3.33k| auto node = pos.node(); 994| 3.33k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [Folded, False: 3.33k] | Branch (994:35): [True: 0, False: 0] ------------------ 995| 3.33k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [Folded, False: 3.33k] | 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.33k| } else { 1002| 3.33k| using std::get; 1003| 3.33k| auto subs = 1004| 3.33k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 0, False: 3.33k] ------------------ 1005| 3.33k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 3.33k| auto next = get<1>(subs); 1007| 3.33k| auto ts = get<2>(subs); 1008| 3.33k| auto tail = get<3>(subs); 1009| 3.33k| IMMER_TRY { ------------------ | | 49| 3.33k|#define IMMER_TRY try ------------------ 1010| 3.33k| if (next) { ------------------ | Branch (1010:21): [True: 877, False: 2.46k] ------------------ 1011| 877| if (mutate) { ------------------ | Branch (1011:25): [True: 0, False: 877] ------------------ 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| 877| } else { 1016| 877| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 877| newn->inner()[idx] = next; 1018| 877| if (Mutating) ------------------ | Branch (1018:29): [Folded, False: 877] ------------------ 1019| 0| pos.visit(dec_visitor{}); 1020| 877| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 877| } 1022| 2.46k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 662, False: 1.79k] ------------------ 1023| 662| if (Mutating) ------------------ | Branch (1023:25): [Folded, False: 662] ------------------ 1024| 0| pos.visit(dec_right_visitor{}, count_t{1}); 1025| 662| return std::make_tuple(pos.shift(), nullptr, ts, tail); 1026| 1.79k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [Folded, False: 1.79k] | 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.79k| } else { 1034| 1.79k| if (mutate) { ------------------ | Branch (1034:25): [True: 0, False: 1.79k] ------------------ 1035| 0| pos.each_right(dec_visitor{}, idx + 1); 1036| 0| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.79k| } else { 1038| 1.79k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.79k| if (Mutating) ------------------ | Branch (1039:29): [Folded, False: 1.79k] ------------------ 1040| 0| pos.visit(dec_visitor{}); 1041| 1.79k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.79k| } 1043| 1.79k| } 1044| 3.33k| } 1045| 3.33k| IMMER_CATCH (...) { 1046| 0| assert(!mutate); ------------------ | Branch (1046:17): [True: 0, False: 0] ------------------ 1047| 0| assert(!next || pos.shift() > BL); ------------------ | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] | Branch (1047:17): [True: 0, False: 0] ------------------ 1048| 0| assert(tail); ------------------ | Branch (1048:17): [True: 0, False: 0] ------------------ 1049| 0| if (next) ------------------ | Branch (1049:21): [True: 0, False: 0] ------------------ 1050| 0| dec_regular(next, pos.shift() - B, last + 1 - ts); 1051| 0| dec_leaf(tail, ts); 1052| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1053| 0| } 1054| 3.33k| } 1055| 3.33k| } _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.6k| { 992| 12.6k| auto idx = pos.index(last); 993| 12.6k| auto node = pos.node(); 994| 12.6k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 12.6k, Folded] | Branch (994:35): [True: 8.83k, False: 3.80k] ------------------ 995| 12.6k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 12.6k, Folded] | Branch (995:25): [True: 7.33k, False: 5.30k] ------------------ 996| 7.33k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 5.09k, False: 2.24k] ------------------ 997| 7.33k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 7.33k| if (Mutating) ------------------ | Branch (998:17): [True: 7.33k, Folded] ------------------ 999| 7.33k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 7.33k| return res; 1001| 7.33k| } else { 1002| 5.30k| using std::get; 1003| 5.30k| auto subs = 1004| 5.30k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 3.74k, False: 1.56k] ------------------ 1005| 5.30k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 5.30k| auto next = get<1>(subs); 1007| 5.30k| auto ts = get<2>(subs); 1008| 5.30k| auto tail = get<3>(subs); 1009| 5.30k| IMMER_TRY { ------------------ | | 49| 5.30k|#define IMMER_TRY try ------------------ 1010| 5.30k| if (next) { ------------------ | Branch (1010:21): [True: 1.22k, False: 4.07k] ------------------ 1011| 1.22k| if (mutate) { ------------------ | Branch (1011:25): [True: 765, False: 464] ------------------ 1012| 765| node->inner()[idx] = next; 1013| 765| pos.each_right(dec_visitor{}, idx + 1); 1014| 765| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 765| } else { 1016| 464| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 464| newn->inner()[idx] = next; 1018| 464| if (Mutating) ------------------ | Branch (1018:29): [True: 464, Folded] ------------------ 1019| 464| pos.visit(dec_visitor{}); 1020| 464| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 464| } 1022| 4.07k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 4.07k] ------------------ 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.07k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 4.07k, Folded] | Branch (1026:40): [True: 3.52k, False: 544] | Branch (1026:52): [True: 2.31k, False: 1.21k] ------------------ 1027| 2.31k| auto newn = pos.node()->inner()[0]; 1028| 2.31k| if (!mutate) ------------------ | Branch (1028:25): [True: 580, False: 1.73k] ------------------ 1029| 580| newn->inc(); 1030| 2.31k| if (Mutating) ------------------ | Branch (1030:25): [True: 2.31k, Folded] ------------------ 1031| 2.31k| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 2.31k| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 2.31k| } else { 1034| 1.75k| if (mutate) { ------------------ | Branch (1034:25): [True: 1.23k, False: 516] ------------------ 1035| 1.23k| pos.each_right(dec_visitor{}, idx + 1); 1036| 1.23k| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.23k| } else { 1038| 516| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 516| if (Mutating) ------------------ | Branch (1039:29): [True: 516, Folded] ------------------ 1040| 516| pos.visit(dec_visitor{}); 1041| 516| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 516| } 1043| 1.75k| } 1044| 5.30k| } 1045| 5.30k| 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.30k| } 1055| 12.6k| } _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.43k| { 1060| 1.43k| auto old_tail_size = pos.count(); 1061| 1.43k| auto new_tail_size = pos.index(last) + 1; 1062| 1.43k| auto node = pos.node(); 1063| 1.43k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 1.43k, Folded] | Branch (1063:42): [True: 590, False: 849] ------------------ 1064| 1.43k| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 492, False: 947] ------------------ 1065| 492| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 492] ------------------ 1066| 0| node->inc(); 1067| 492| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 947| } else if (mutate) { ------------------ | Branch (1068:20): [True: 512, False: 435] ------------------ 1069| 512| detail::destroy_n(node->leaf() + new_tail_size, 1070| 512| old_tail_size - new_tail_size); 1071| 512| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 512| } 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.43k| } _ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE: 991| 3.95k| { 992| 3.95k| auto idx = pos.index(last); 993| 3.95k| auto node = pos.node(); 994| 3.95k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (994:23): [True: 3.95k, Folded] | Branch (994:35): [True: 2.03k, False: 1.92k] ------------------ 995| 3.95k| if (Collapse && idx == 0) { ------------------ | Branch (995:13): [True: 3.95k, Folded] | Branch (995:25): [True: 1.48k, False: 2.47k] ------------------ 996| 1.48k| auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e) ------------------ | Branch (996:24): [True: 1.01k, False: 471] ------------------ 997| 1.48k| : pos.towards_oh(no_mut_t{}, last, idx, e); 998| 1.48k| if (Mutating) ------------------ | Branch (998:17): [True: 1.48k, Folded] ------------------ 999| 1.48k| pos.visit(dec_right_visitor{}, count_t{1}); 1000| 1.48k| return res; 1001| 2.47k| } else { 1002| 2.47k| using std::get; 1003| 2.47k| auto subs = 1004| 2.47k| mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e) ------------------ | Branch (1004:17): [True: 1.02k, False: 1.45k] ------------------ 1005| 2.47k| : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e); 1006| 2.47k| auto next = get<1>(subs); 1007| 2.47k| auto ts = get<2>(subs); 1008| 2.47k| auto tail = get<3>(subs); 1009| 2.47k| IMMER_TRY { ------------------ | | 49| 2.47k|#define IMMER_TRY try ------------------ 1010| 2.47k| if (next) { ------------------ | Branch (1010:21): [True: 521, False: 1.95k] ------------------ 1011| 521| if (mutate) { ------------------ | Branch (1011:25): [True: 322, False: 199] ------------------ 1012| 322| node->inner()[idx] = next; 1013| 322| pos.each_right(dec_visitor{}, idx + 1); 1014| 322| return std::make_tuple(pos.shift(), node, ts, tail); 1015| 322| } else { 1016| 199| auto newn = node_t::copy_inner_e(e, node, idx); 1017| 199| newn->inner()[idx] = next; 1018| 199| if (Mutating) ------------------ | Branch (1018:29): [True: 199, Folded] ------------------ 1019| 199| pos.visit(dec_visitor{}); 1020| 199| return std::make_tuple(pos.shift(), newn, ts, tail); 1021| 199| } 1022| 1.95k| } else if (idx == 0) { ------------------ | Branch (1022:28): [True: 0, False: 1.95k] ------------------ 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.95k| } else if (Collapse && idx == 1 && pos.shift() > BL) { ------------------ | Branch (1026:28): [True: 1.95k, Folded] | Branch (1026:40): [True: 1.26k, False: 682] | Branch (1026:52): [True: 521, False: 748] ------------------ 1027| 521| auto newn = pos.node()->inner()[0]; 1028| 521| if (!mutate) ------------------ | Branch (1028:25): [True: 198, False: 323] ------------------ 1029| 198| newn->inc(); 1030| 521| if (Mutating) ------------------ | Branch (1030:25): [True: 521, Folded] ------------------ 1031| 521| pos.visit(dec_right_visitor{}, count_t{2}); 1032| 521| return std::make_tuple(pos.shift() - B, newn, ts, tail); 1033| 1.43k| } else { 1034| 1.43k| if (mutate) { ------------------ | Branch (1034:25): [True: 377, False: 1.05k] ------------------ 1035| 377| pos.each_right(dec_visitor{}, idx + 1); 1036| 377| return std::make_tuple(pos.shift(), node, ts, tail); 1037| 1.05k| } else { 1038| 1.05k| auto newn = node_t::copy_inner_e(e, node, idx); 1039| 1.05k| if (Mutating) ------------------ | Branch (1039:29): [True: 1.05k, Folded] ------------------ 1040| 1.05k| pos.visit(dec_visitor{}); 1041| 1.05k| return std::make_tuple(pos.shift(), newn, ts, tail); 1042| 1.05k| } 1043| 1.43k| } 1044| 2.47k| } 1045| 2.47k| 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.47k| } 1055| 3.95k| } _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| 709| { 1060| 709| auto old_tail_size = pos.count(); 1061| 709| auto new_tail_size = pos.index(last) + 1; 1062| 709| auto node = pos.node(); 1063| 709| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1063:30): [True: 709, Folded] | Branch (1063:42): [True: 216, False: 493] ------------------ 1064| 709| if (new_tail_size == old_tail_size) { ------------------ | Branch (1064:13): [True: 289, False: 420] ------------------ 1065| 289| if (!Mutating) ------------------ | Branch (1065:17): [Folded, False: 289] ------------------ 1066| 0| node->inc(); 1067| 289| return std::make_tuple(0, nullptr, new_tail_size, node); 1068| 420| } else if (mutate) { ------------------ | Branch (1068:20): [True: 203, False: 217] ------------------ 1069| 203| detail::destroy_n(node->leaf() + new_tail_size, 1070| 203| old_tail_size - new_tail_size); 1071| 203| return std::make_tuple(0, nullptr, new_tail_size, node); 1072| 217| } else { 1073| 217| auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size); 1074| 217| if (Mutating) ------------------ | Branch (1074:17): [True: 217, Folded] ------------------ 1075| 217| pos.visit(dec_visitor{}); 1076| 217| return std::make_tuple(0, nullptr, new_tail_size, new_tail); 1077| 217| } 1078| 709| } _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| 712| { 1378| 712| auto node = pos.node(); 1379| 712| auto idx = pos.index(first); 1380| 712| auto count = pos.count(); 1381| 712| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 712| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 411, False: 301] ------------------ 1384| 712| if (mutate) { ------------------ | Branch (1384:13): [True: 411, False: 301] ------------------ 1385| 411| auto data = node->leaf(); 1386| 411| auto newcount = count - idx; 1387| 411| std::move(data + idx, data + count, data); 1388| 411| detail::destroy_n(data + newcount, idx); 1389| 411| return std::make_tuple(0, node); 1390| 411| } else { 1391| 301| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 301| if (Mutating) ------------------ | Branch (1392:17): [True: 301, Folded] ------------------ 1393| 301| pos.visit(dec_visitor{}); 1394| 301| return std::make_tuple(0, newn); 1395| 301| } 1396| 712| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1246| 37.0k| { 1247| 37.0k| auto idx = pos.subindex(first); 1248| 37.0k| auto count = pos.count(); 1249| 37.0k| auto node = pos.node(); 1250| 37.0k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 37.0k, Folded] | Branch (1250:47): [True: 27.7k, False: 9.31k] ------------------ 1251| 37.0k| auto left_size = pos.size_before(idx); 1252| 37.0k| auto child_size = pos.size_sbh(idx, left_size); 1253| 37.0k| auto dropped_size = first; 1254| 37.0k| auto child_dropped_size = dropped_size - left_size; 1255| 37.0k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 37.0k, Folded] | Branch (1255:25): [True: 35.6k, False: 1.43k] | Branch (1255:45): [True: 9.38k, False: 26.2k] ------------------ 1256| 9.38k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 6.25k, False: 3.13k] ------------------ 1257| 9.38k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 9.38k| if (mutate) ------------------ | Branch (1258:17): [True: 6.25k, False: 3.13k] ------------------ 1259| 6.25k| pos.visit(dec_left_visitor{}, idx); 1260| 3.13k| else if (Mutating) ------------------ | Branch (1260:22): [True: 3.13k, Folded] ------------------ 1261| 3.13k| pos.visit(dec_visitor{}); 1262| 9.38k| return r; 1263| 27.6k| } else { 1264| 27.6k| using std::get; 1265| 27.6k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 21.4k, False: 6.17k] ------------------ 1266| 27.6k| : node_t::make_inner_r_e(e); 1267| 27.6k| auto newr = newn->relaxed(); 1268| 27.6k| auto newcount = count - idx; 1269| 27.6k| auto new_child_size = child_size - child_dropped_size; 1270| 27.6k| IMMER_TRY { ------------------ | | 49| 27.6k|#define IMMER_TRY try ------------------ 1271| 27.6k| auto subs = 1272| 27.6k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 21.4k, False: 6.17k] ------------------ 1273| 27.6k| : pos.towards_sub_oh( 1274| 6.17k| no_collapse_no_mut_t{}, first, idx, e); 1275| 27.6k| if (mutate) ------------------ | Branch (1275:21): [True: 21.4k, False: 6.17k] ------------------ 1276| 21.4k| pos.each_left(dec_visitor{}, idx); 1277| 27.6k| pos.copy_sizes( 1278| 27.6k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 27.6k| std::copy(node->inner() + idx + 1, 1280| 27.6k| node->inner() + count, 1281| 27.6k| newn->inner() + 1); 1282| 27.6k| newn->inner()[0] = get<1>(subs); 1283| 27.6k| newr->d.sizes[0] = new_child_size; 1284| 27.6k| newr->d.count = newcount; 1285| 27.6k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 27.6k, False: 0] ------------------ 1286| 27.6k| if (!mutate) { ------------------ | Branch (1286:21): [True: 6.17k, False: 21.4k] ------------------ 1287| 6.17k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 6.17k| if (Mutating) ------------------ | Branch (1288:25): [True: 6.17k, Folded] ------------------ 1289| 6.17k| pos.visit(dec_visitor{}); 1290| 6.17k| } 1291| 27.6k| return std::make_tuple(pos.shift(), newn); 1292| 27.6k| } 1293| 27.6k| IMMER_CATCH (...) { 1294| 0| if (!mutate) ------------------ | Branch (1294:21): [True: 0, False: 0] ------------------ 1295| 0| node_t::delete_inner_r_e(newn); 1296| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1297| 0| } 1298| 27.6k| } 1299| 37.0k| } _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.51k| { 1247| 2.51k| auto idx = pos.subindex(first); 1248| 2.51k| auto count = pos.count(); 1249| 2.51k| auto node = pos.node(); 1250| 2.51k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 2.51k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 2.51k| auto left_size = pos.size_before(idx); 1252| 2.51k| auto child_size = pos.size_sbh(idx, left_size); 1253| 2.51k| auto dropped_size = first; 1254| 2.51k| auto child_dropped_size = dropped_size - left_size; 1255| 2.51k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [True: 2.51k, Folded] | Branch (1255:25): [True: 1.36k, False: 1.14k] | Branch (1255:45): [True: 901, False: 462] ------------------ 1256| 901| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 901] ------------------ 1257| 901| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 901| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 901] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 901| else if (Mutating) ------------------ | Branch (1260:22): [Folded, False: 901] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 901| return r; 1263| 1.60k| } else { 1264| 1.60k| using std::get; 1265| 1.60k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 1.60k] ------------------ 1266| 1.60k| : node_t::make_inner_r_e(e); 1267| 1.60k| auto newr = newn->relaxed(); 1268| 1.60k| auto newcount = count - idx; 1269| 1.60k| auto new_child_size = child_size - child_dropped_size; 1270| 1.60k| IMMER_TRY { ------------------ | | 49| 1.60k|#define IMMER_TRY try ------------------ 1271| 1.60k| auto subs = 1272| 1.60k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 1.60k] ------------------ 1273| 1.60k| : pos.towards_sub_oh( 1274| 1.60k| no_collapse_no_mut_t{}, first, idx, e); 1275| 1.60k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 1.60k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 1.60k| pos.copy_sizes( 1278| 1.60k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 1.60k| std::copy(node->inner() + idx + 1, 1280| 1.60k| node->inner() + count, 1281| 1.60k| newn->inner() + 1); 1282| 1.60k| newn->inner()[0] = get<1>(subs); 1283| 1.60k| newr->d.sizes[0] = new_child_size; 1284| 1.60k| newr->d.count = newcount; 1285| 1.60k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 1.60k, False: 0] ------------------ 1286| 1.60k| if (!mutate) { ------------------ | Branch (1286:21): [True: 1.60k, False: 0] ------------------ 1287| 1.60k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 1.60k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 1.60k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 1.60k| } 1291| 1.60k| return std::make_tuple(pos.shift(), newn); 1292| 1.60k| } 1293| 1.60k| 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.60k| } 1299| 2.51k| } _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.61k| { 1304| 2.61k| auto idx = pos.subindex(first); 1305| 2.61k| auto count = pos.count(); 1306| 2.61k| auto node = pos.node(); 1307| 2.61k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 2.61k] ------------------ 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.61k| auto left_size = pos.size_before(idx); 1313| 2.61k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.61k| auto dropped_size = first; 1315| 2.61k| auto child_dropped_size = dropped_size - left_size; 1316| 2.61k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 2.61k, Folded] | Branch (1316:25): [True: 1.47k, False: 1.14k] | Branch (1316:45): [True: 1.12k, False: 349] ------------------ 1317| 1.12k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 1.12k] ------------------ 1318| 1.12k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 1.12k| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 1.12k] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 1.12k| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 1.12k] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 1.12k| return r; 1324| 1.48k| } else { 1325| 1.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| 1.48k| auto newcount = count - idx; 1330| 1.48k| auto newn = 1331| 1.48k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.48k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.48k| : node_t::make_inner_r_e(e); 1336| 1.48k| auto newr = newn->relaxed(); 1337| 1.48k| IMMER_TRY { ------------------ | | 49| 1.48k|#define IMMER_TRY try ------------------ 1338| 1.48k| auto subs = 1339| 1.48k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.48k] ------------------ 1340| 1.48k| : pos.towards_sub_oh( 1341| 1.48k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.48k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.48k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.48k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.48k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.48k, False: 0] ------------------ 1346| 1.48k| pos.copy_sizes( 1347| 1.48k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.48k| newr->d.count = newcount; 1349| 1.48k| newn->inner()[0] = get<1>(subs); 1350| 1.48k| std::copy(node->inner() + idx + 1, 1351| 1.48k| node->inner() + count, 1352| 1.48k| newn->inner() + 1); 1353| 1.48k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.48k, False: 0] ------------------ 1354| 1.48k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.48k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.48k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.48k| } 1358| 1.48k| return std::make_tuple(pos.shift(), newn); 1359| 1.48k| } 1360| 1.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| 1.48k| } 1373| 2.61k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 3.09k| { 1304| 3.09k| auto idx = pos.subindex(first); 1305| 3.09k| auto count = pos.count(); 1306| 3.09k| auto node = pos.node(); 1307| 3.09k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 3.09k] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 0| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 3.09k| auto left_size = pos.size_before(idx); 1313| 3.09k| auto child_size = pos.size_sbh(idx, left_size); 1314| 3.09k| auto dropped_size = first; 1315| 3.09k| auto child_dropped_size = dropped_size - left_size; 1316| 3.09k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 3.09k, Folded] | Branch (1316:25): [True: 541, False: 2.55k] | Branch (1316:45): [True: 328, False: 213] ------------------ 1317| 328| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 328] ------------------ 1318| 328| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 328| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 328] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 328| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 328] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 328| return r; 1324| 2.76k| } else { 1325| 2.76k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 2.76k| auto newcount = count - idx; 1330| 2.76k| auto newn = 1331| 2.76k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 2.76k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 2.76k| : node_t::make_inner_r_e(e); 1336| 2.76k| auto newr = newn->relaxed(); 1337| 2.76k| IMMER_TRY { ------------------ | | 49| 2.76k|#define IMMER_TRY try ------------------ 1338| 2.76k| auto subs = 1339| 2.76k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 2.76k] ------------------ 1340| 2.76k| : pos.towards_sub_oh( 1341| 2.76k| no_collapse_no_mut_t{}, first, idx, e); 1342| 2.76k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 2.76k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 2.76k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 2.76k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 2.76k, False: 0] ------------------ 1346| 2.76k| pos.copy_sizes( 1347| 2.76k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 2.76k| newr->d.count = newcount; 1349| 2.76k| newn->inner()[0] = get<1>(subs); 1350| 2.76k| std::copy(node->inner() + idx + 1, 1351| 2.76k| node->inner() + count, 1352| 2.76k| newn->inner() + 1); 1353| 2.76k| if (!mutate) { ------------------ | Branch (1353:21): [True: 2.76k, False: 0] ------------------ 1354| 2.76k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 2.76k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 2.76k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 2.76k| } 1358| 2.76k| return std::make_tuple(pos.shift(), newn); 1359| 2.76k| } 1360| 2.76k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 2.76k| } 1373| 3.09k| } _ZN5immer6detail4rbts16dec_left_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_j: 1209| 335| { 1210| 335| using node_t = node_type; 1211| 335| auto node = p.node(); 1212| 335| if (node->dec()) { ------------------ | Branch (1212:13): [True: 335, False: 0] ------------------ 1213| 335| p.each_left(dec_t{}, idx); 1214| 335| node_t::delete_inner(node, p.count()); 1215| 335| } 1216| 335| } _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.31k| { 1378| 3.31k| auto node = pos.node(); 1379| 3.31k| auto idx = pos.index(first); 1380| 3.31k| auto count = pos.count(); 1381| 3.31k| 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.31k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 621, False: 2.69k] ------------------ 1384| 3.31k| if (mutate) { ------------------ | Branch (1384:13): [True: 621, False: 2.69k] ------------------ 1385| 621| auto data = node->leaf(); 1386| 621| auto newcount = count - idx; 1387| 621| std::move(data + idx, data + count, data); 1388| 621| detail::destroy_n(data + newcount, idx); 1389| 621| return std::make_tuple(0, node); 1390| 2.69k| } else { 1391| 2.69k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 2.69k| if (Mutating) ------------------ | Branch (1392:17): [True: 2.69k, Folded] ------------------ 1393| 2.69k| pos.visit(dec_visitor{}); 1394| 2.69k| return std::make_tuple(0, newn); 1395| 2.69k| } 1396| 3.31k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 2.26k| { 1304| 2.26k| auto idx = pos.subindex(first); 1305| 2.26k| auto count = pos.count(); 1306| 2.26k| auto node = pos.node(); 1307| 2.26k| auto mutate = Mutating ------------------ | Branch (1307:23): [True: 0, Folded] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 2.26k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 1.05k, False: 1.21k] ------------------ 1312| 2.26k| auto left_size = pos.size_before(idx); 1313| 2.26k| auto child_size = pos.size_sbh(idx, left_size); 1314| 2.26k| auto dropped_size = first; 1315| 2.26k| auto child_dropped_size = dropped_size - left_size; 1316| 2.26k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 2.26k] | Branch (1316:25): [True: 0, False: 0] | Branch (1316:45): [True: 0, False: 0] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [True: 0, Folded] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 2.26k| } else { 1325| 2.26k| 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.26k| auto newcount = count - idx; 1330| 2.26k| auto newn = 1331| 2.26k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 1.05k, False: 1.21k] ------------------ 1332| 1.05k| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 1.05k| norefs_tag{})) relaxed_t, 1334| 1.05k| node) 1335| 2.26k| : node_t::make_inner_r_e(e); 1336| 2.26k| auto newr = newn->relaxed(); 1337| 2.26k| IMMER_TRY { ------------------ | | 49| 2.26k|#define IMMER_TRY try ------------------ 1338| 2.26k| auto subs = 1339| 2.26k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 1.05k, False: 1.21k] ------------------ 1340| 2.26k| : pos.towards_sub_oh( 1341| 1.21k| no_collapse_no_mut_t{}, first, idx, e); 1342| 2.26k| if (mutate) ------------------ | Branch (1342:21): [True: 1.05k, False: 1.21k] ------------------ 1343| 1.05k| pos.each_left(dec_visitor{}, idx); 1344| 2.26k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 2.26k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 2.26k, False: 0] ------------------ 1346| 2.26k| pos.copy_sizes( 1347| 2.26k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 2.26k| newr->d.count = newcount; 1349| 2.26k| newn->inner()[0] = get<1>(subs); 1350| 2.26k| std::copy(node->inner() + idx + 1, 1351| 2.26k| node->inner() + count, 1352| 2.26k| newn->inner() + 1); 1353| 2.26k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.21k, False: 1.05k] ------------------ 1354| 1.21k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.21k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.21k, Folded] ------------------ 1356| 1.21k| pos.visit(dec_visitor{}); 1357| 1.21k| } 1358| 2.26k| return std::make_tuple(pos.shift(), newn); 1359| 2.26k| } 1360| 2.26k| 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.26k| } 1373| 2.26k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 10.3k| { 1378| 10.3k| auto node = pos.node(); 1379| 10.3k| auto idx = pos.index(first); 1380| 10.3k| auto count = pos.count(); 1381| 10.3k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 10.3k] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 0| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 0, False: 0] ------------------ 1384| 10.3k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 10.3k] ------------------ 1385| 0| auto data = node->leaf(); 1386| 0| auto newcount = count - idx; 1387| 0| std::move(data + idx, data + count, data); 1388| 0| detail::destroy_n(data + newcount, idx); 1389| 0| return std::make_tuple(0, node); 1390| 10.3k| } else { 1391| 10.3k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 10.3k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 10.3k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 10.3k| return std::make_tuple(0, newn); 1395| 10.3k| } 1396| 10.3k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 3.27k| { 1304| 3.27k| auto idx = pos.subindex(first); 1305| 3.27k| auto count = pos.count(); 1306| 3.27k| auto node = pos.node(); 1307| 3.27k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 3.27k] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 0| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 3.27k| auto left_size = pos.size_before(idx); 1313| 3.27k| auto child_size = pos.size_sbh(idx, left_size); 1314| 3.27k| auto dropped_size = first; 1315| 3.27k| auto child_dropped_size = dropped_size - left_size; 1316| 3.27k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 3.27k] | Branch (1316:25): [True: 0, False: 0] | Branch (1316:45): [True: 0, False: 0] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 0] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 3.27k| } else { 1325| 3.27k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 3.27k| auto newcount = count - idx; 1330| 3.27k| auto newn = 1331| 3.27k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 3.27k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 3.27k| : node_t::make_inner_r_e(e); 1336| 3.27k| auto newr = newn->relaxed(); 1337| 3.27k| IMMER_TRY { ------------------ | | 49| 3.27k|#define IMMER_TRY try ------------------ 1338| 3.27k| auto subs = 1339| 3.27k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 3.27k] ------------------ 1340| 3.27k| : pos.towards_sub_oh( 1341| 3.27k| no_collapse_no_mut_t{}, first, idx, e); 1342| 3.27k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 3.27k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 3.27k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 3.27k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 3.27k, False: 0] ------------------ 1346| 3.27k| pos.copy_sizes( 1347| 3.27k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 3.27k| newr->d.count = newcount; 1349| 3.27k| newn->inner()[0] = get<1>(subs); 1350| 3.27k| std::copy(node->inner() + idx + 1, 1351| 3.27k| node->inner() + count, 1352| 3.27k| newn->inner() + 1); 1353| 3.27k| if (!mutate) { ------------------ | Branch (1353:21): [True: 3.27k, False: 0] ------------------ 1354| 3.27k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 3.27k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 3.27k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 3.27k| } 1358| 3.27k| return std::make_tuple(pos.shift(), newn); 1359| 3.27k| } 1360| 3.27k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 3.27k| } 1373| 3.27k| } _ZN5immer6detail4rbts16dec_left_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_j: 1209| 4.24k| { 1210| 4.24k| using node_t = node_type; 1211| 4.24k| auto node = p.node(); 1212| 4.24k| if (node->dec()) { ------------------ | Branch (1212:13): [True: 4.24k, False: 0] ------------------ 1213| 4.24k| p.each_left(dec_t{}, idx); 1214| 4.24k| node_t::delete_inner(node, p.count()); 1215| 4.24k| } 1216| 4.24k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1377| 12.5k| { 1378| 12.5k| auto node = pos.node(); 1379| 12.5k| auto idx = pos.index(first); 1380| 12.5k| auto count = pos.count(); 1381| 12.5k| auto mutate = Mutating && ------------------ | Branch (1381:23): [True: 0, Folded] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 12.5k| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 8.62k, False: 3.92k] ------------------ 1384| 12.5k| if (mutate) { ------------------ | Branch (1384:13): [True: 8.62k, False: 3.92k] ------------------ 1385| 8.62k| auto data = node->leaf(); 1386| 8.62k| auto newcount = count - idx; 1387| 8.62k| std::move(data + idx, data + count, data); 1388| 8.62k| detail::destroy_n(data + newcount, idx); 1389| 8.62k| return std::make_tuple(0, node); 1390| 8.62k| } else { 1391| 3.92k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 3.92k| if (Mutating) ------------------ | Branch (1392:17): [True: 3.92k, Folded] ------------------ 1393| 3.92k| pos.visit(dec_visitor{}); 1394| 3.92k| return std::make_tuple(0, newn); 1395| 3.92k| } 1396| 12.5k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 1.80k| { 1304| 1.80k| auto idx = pos.subindex(first); 1305| 1.80k| auto count = pos.count(); 1306| 1.80k| auto node = pos.node(); 1307| 1.80k| 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.80k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 721, False: 1.08k] ------------------ 1312| 1.80k| auto left_size = pos.size_before(idx); 1313| 1.80k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.80k| auto dropped_size = first; 1315| 1.80k| auto child_dropped_size = dropped_size - left_size; 1316| 1.80k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.80k] | 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.80k| } else { 1325| 1.80k| 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.80k| auto newcount = count - idx; 1330| 1.80k| auto newn = 1331| 1.80k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 721, False: 1.08k] ------------------ 1332| 721| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 721| norefs_tag{})) relaxed_t, 1334| 721| node) 1335| 1.80k| : node_t::make_inner_r_e(e); 1336| 1.80k| auto newr = newn->relaxed(); 1337| 1.80k| IMMER_TRY { ------------------ | | 49| 1.80k|#define IMMER_TRY try ------------------ 1338| 1.80k| auto subs = 1339| 1.80k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 721, False: 1.08k] ------------------ 1340| 1.80k| : pos.towards_sub_oh( 1341| 1.08k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.80k| if (mutate) ------------------ | Branch (1342:21): [True: 721, False: 1.08k] ------------------ 1343| 721| pos.each_left(dec_visitor{}, idx); 1344| 1.80k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.80k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.80k, False: 0] ------------------ 1346| 1.80k| pos.copy_sizes( 1347| 1.80k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.80k| newr->d.count = newcount; 1349| 1.80k| newn->inner()[0] = get<1>(subs); 1350| 1.80k| std::copy(node->inner() + idx + 1, 1351| 1.80k| node->inner() + count, 1352| 1.80k| newn->inner() + 1); 1353| 1.80k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.08k, False: 721] ------------------ 1354| 1.08k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.08k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.08k, Folded] ------------------ 1356| 1.08k| pos.visit(dec_visitor{}); 1357| 1.08k| } 1358| 1.80k| return std::make_tuple(pos.shift(), newn); 1359| 1.80k| } 1360| 1.80k| 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.80k| } 1373| 1.80k| } _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| 12.9k| { 1378| 12.9k| auto node = pos.node(); 1379| 12.9k| auto idx = pos.index(first); 1380| 12.9k| auto count = pos.count(); 1381| 12.9k| auto mutate = Mutating && ------------------ | Branch (1381:23): [Folded, False: 12.9k] ------------------ 1382| 0| std::is_nothrow_move_constructible::value && ------------------ | Branch (1382:23): [True: 0, Folded] ------------------ 1383| 0| node->can_mutate(e); ------------------ | Branch (1383:23): [True: 0, False: 0] ------------------ 1384| 12.9k| if (mutate) { ------------------ | Branch (1384:13): [True: 0, False: 12.9k] ------------------ 1385| 0| auto data = node->leaf(); 1386| 0| auto newcount = count - idx; 1387| 0| std::move(data + idx, data + count, data); 1388| 0| detail::destroy_n(data + newcount, idx); 1389| 0| return std::make_tuple(0, node); 1390| 12.9k| } else { 1391| 12.9k| auto newn = node_t::copy_leaf_e(e, node, idx, count); 1392| 12.9k| if (Mutating) ------------------ | Branch (1392:17): [Folded, False: 12.9k] ------------------ 1393| 0| pos.visit(dec_visitor{}); 1394| 12.9k| return std::make_tuple(0, newn); 1395| 12.9k| } 1396| 12.9k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1303| 1.92k| { 1304| 1.92k| auto idx = pos.subindex(first); 1305| 1.92k| auto count = pos.count(); 1306| 1.92k| auto node = pos.node(); 1307| 1.92k| auto mutate = Mutating ------------------ | Branch (1307:23): [Folded, False: 1.92k] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 0| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 0, False: 0] ------------------ 1312| 1.92k| auto left_size = pos.size_before(idx); 1313| 1.92k| auto child_size = pos.size_sbh(idx, left_size); 1314| 1.92k| auto dropped_size = first; 1315| 1.92k| auto child_dropped_size = dropped_size - left_size; 1316| 1.92k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [Folded, False: 1.92k] | Branch (1316:25): [True: 0, False: 0] | Branch (1316:45): [True: 0, False: 0] ------------------ 1317| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 0, False: 0] ------------------ 1318| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 0| if (mutate) ------------------ | Branch (1319:17): [True: 0, False: 0] ------------------ 1320| 0| pos.visit(dec_left_visitor{}, idx); 1321| 0| else if (Mutating) ------------------ | Branch (1321:22): [Folded, False: 0] ------------------ 1322| 0| pos.visit(dec_visitor{}); 1323| 0| return r; 1324| 1.92k| } else { 1325| 1.92k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 1.92k| auto newcount = count - idx; 1330| 1.92k| auto newn = 1331| 1.92k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 0, False: 1.92k] ------------------ 1332| 0| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 0| norefs_tag{})) relaxed_t, 1334| 0| node) 1335| 1.92k| : node_t::make_inner_r_e(e); 1336| 1.92k| auto newr = newn->relaxed(); 1337| 1.92k| IMMER_TRY { ------------------ | | 49| 1.92k|#define IMMER_TRY try ------------------ 1338| 1.92k| auto subs = 1339| 1.92k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 0, False: 1.92k] ------------------ 1340| 1.92k| : pos.towards_sub_oh( 1341| 1.92k| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.92k| if (mutate) ------------------ | Branch (1342:21): [True: 0, False: 1.92k] ------------------ 1343| 0| pos.each_left(dec_visitor{}, idx); 1344| 1.92k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.92k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.92k, False: 0] ------------------ 1346| 1.92k| pos.copy_sizes( 1347| 1.92k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.92k| newr->d.count = newcount; 1349| 1.92k| newn->inner()[0] = get<1>(subs); 1350| 1.92k| std::copy(node->inner() + idx + 1, 1351| 1.92k| node->inner() + count, 1352| 1.92k| newn->inner() + 1); 1353| 1.92k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.92k, False: 0] ------------------ 1354| 1.92k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.92k| if (Mutating) ------------------ | Branch (1355:25): [Folded, False: 1.92k] ------------------ 1356| 0| pos.visit(dec_visitor{}); 1357| 1.92k| } 1358| 1.92k| return std::make_tuple(pos.shift(), newn); 1359| 1.92k| } 1360| 1.92k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 1.92k| } 1373| 1.92k| } _ZN5immer6detail4rbts16dec_left_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEEvOT_j: 1198| 6.25k| { 1199| 6.25k| using node_t = node_type; 1200| 6.25k| auto node = p.node(); 1201| 6.25k| if (node->dec()) { ------------------ | Branch (1201:13): [True: 6.25k, False: 0] ------------------ 1202| 6.25k| p.each_left(dec_t{}, idx); 1203| 6.25k| node_t::delete_inner_r(node, p.count()); 1204| 6.25k| } 1205| 6.25k| } _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| 184k| { 1247| 184k| auto idx = pos.subindex(first); 1248| 184k| auto count = pos.count(); 1249| 184k| auto node = pos.node(); 1250| 184k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [True: 184k, Folded] | Branch (1250:47): [True: 176k, False: 7.11k] ------------------ 1251| 184k| auto left_size = pos.size_before(idx); 1252| 184k| auto child_size = pos.size_sbh(idx, left_size); 1253| 184k| auto dropped_size = first; 1254| 184k| auto child_dropped_size = dropped_size - left_size; 1255| 184k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 184k] | 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| 184k| } else { 1264| 184k| using std::get; 1265| 184k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 176k, False: 7.11k] ------------------ 1266| 184k| : node_t::make_inner_r_e(e); 1267| 184k| auto newr = newn->relaxed(); 1268| 184k| auto newcount = count - idx; 1269| 184k| auto new_child_size = child_size - child_dropped_size; 1270| 184k| IMMER_TRY { ------------------ | | 49| 184k|#define IMMER_TRY try ------------------ 1271| 184k| auto subs = 1272| 184k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 176k, False: 7.11k] ------------------ 1273| 184k| : pos.towards_sub_oh( 1274| 7.11k| no_collapse_no_mut_t{}, first, idx, e); 1275| 184k| if (mutate) ------------------ | Branch (1275:21): [True: 176k, False: 7.11k] ------------------ 1276| 176k| pos.each_left(dec_visitor{}, idx); 1277| 184k| pos.copy_sizes( 1278| 184k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 184k| std::copy(node->inner() + idx + 1, 1280| 184k| node->inner() + count, 1281| 184k| newn->inner() + 1); 1282| 184k| newn->inner()[0] = get<1>(subs); 1283| 184k| newr->d.sizes[0] = new_child_size; 1284| 184k| newr->d.count = newcount; 1285| 184k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 184k, False: 0] ------------------ 1286| 184k| if (!mutate) { ------------------ | Branch (1286:21): [True: 7.11k, False: 176k] ------------------ 1287| 7.11k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 7.11k| if (Mutating) ------------------ | Branch (1288:25): [True: 7.11k, Folded] ------------------ 1289| 7.11k| pos.visit(dec_visitor{}); 1290| 7.11k| } 1291| 184k| return std::make_tuple(pos.shift(), newn); 1292| 184k| } 1293| 184k| 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| 184k| } 1299| 184k| } _ZN5immer6detail4rbts22slice_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0ELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_mNSA_5applyIS7_E4type4editE: 1246| 51.1k| { 1247| 51.1k| auto idx = pos.subindex(first); 1248| 51.1k| auto count = pos.count(); 1249| 51.1k| auto node = pos.node(); 1250| 51.1k| auto mutate = Mutating && node->can_mutate(e); ------------------ | Branch (1250:35): [Folded, False: 51.1k] | Branch (1250:47): [True: 0, False: 0] ------------------ 1251| 51.1k| auto left_size = pos.size_before(idx); 1252| 51.1k| auto child_size = pos.size_sbh(idx, left_size); 1253| 51.1k| auto dropped_size = first; 1254| 51.1k| auto child_dropped_size = dropped_size - left_size; 1255| 51.1k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1255:13): [Folded, False: 51.1k] | Branch (1255:25): [True: 0, False: 0] | Branch (1255:45): [True: 0, False: 0] ------------------ 1256| 0| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1256:22): [True: 0, False: 0] ------------------ 1257| 0| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1258| 0| if (mutate) ------------------ | Branch (1258:17): [True: 0, False: 0] ------------------ 1259| 0| pos.visit(dec_left_visitor{}, idx); 1260| 0| else if (Mutating) ------------------ | Branch (1260:22): [Folded, False: 0] ------------------ 1261| 0| pos.visit(dec_visitor{}); 1262| 0| return r; 1263| 51.1k| } else { 1264| 51.1k| using std::get; 1265| 51.1k| auto newn = mutate ? (node->ensure_mutable_relaxed(e), node) ------------------ | Branch (1265:29): [True: 0, False: 51.1k] ------------------ 1266| 51.1k| : node_t::make_inner_r_e(e); 1267| 51.1k| auto newr = newn->relaxed(); 1268| 51.1k| auto newcount = count - idx; 1269| 51.1k| auto new_child_size = child_size - child_dropped_size; 1270| 51.1k| IMMER_TRY { ------------------ | | 49| 51.1k|#define IMMER_TRY try ------------------ 1271| 51.1k| auto subs = 1272| 51.1k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1272:21): [True: 0, False: 51.1k] ------------------ 1273| 51.1k| : pos.towards_sub_oh( 1274| 51.1k| no_collapse_no_mut_t{}, first, idx, e); 1275| 51.1k| if (mutate) ------------------ | Branch (1275:21): [True: 0, False: 51.1k] ------------------ 1276| 0| pos.each_left(dec_visitor{}, idx); 1277| 51.1k| pos.copy_sizes( 1278| 51.1k| idx + 1, newcount - 1, new_child_size, newr->d.sizes + 1); 1279| 51.1k| std::copy(node->inner() + idx + 1, 1280| 51.1k| node->inner() + count, 1281| 51.1k| newn->inner() + 1); 1282| 51.1k| newn->inner()[0] = get<1>(subs); 1283| 51.1k| newr->d.sizes[0] = new_child_size; 1284| 51.1k| newr->d.count = newcount; 1285| 51.1k| assert(new_child_size); ------------------ | Branch (1285:17): [True: 51.1k, False: 0] ------------------ 1286| 51.1k| if (!mutate) { ------------------ | Branch (1286:21): [True: 51.1k, False: 0] ------------------ 1287| 51.1k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1288| 51.1k| if (Mutating) ------------------ | Branch (1288:25): [Folded, False: 51.1k] ------------------ 1289| 0| pos.visit(dec_visitor{}); 1290| 51.1k| } 1291| 51.1k| return std::make_tuple(pos.shift(), newn); 1292| 51.1k| } 1293| 51.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| 51.1k| } 1299| 51.1k| } _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.54k| { 1304| 9.54k| auto idx = pos.subindex(first); 1305| 9.54k| auto count = pos.count(); 1306| 9.54k| auto node = pos.node(); 1307| 9.54k| 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.54k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 6.94k, False: 2.59k] ------------------ 1312| 9.54k| auto left_size = pos.size_before(idx); 1313| 9.54k| auto child_size = pos.size_sbh(idx, left_size); 1314| 9.54k| auto dropped_size = first; 1315| 9.54k| auto child_dropped_size = dropped_size - left_size; 1316| 9.54k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 9.54k, Folded] | Branch (1316:25): [True: 7.42k, False: 2.12k] | Branch (1316:45): [True: 5.59k, False: 1.82k] ------------------ 1317| 5.59k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 4.24k, False: 1.35k] ------------------ 1318| 5.59k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 5.59k| if (mutate) ------------------ | Branch (1319:17): [True: 4.24k, False: 1.35k] ------------------ 1320| 4.24k| pos.visit(dec_left_visitor{}, idx); 1321| 1.35k| else if (Mutating) ------------------ | Branch (1321:22): [True: 1.35k, Folded] ------------------ 1322| 1.35k| pos.visit(dec_visitor{}); 1323| 5.59k| return r; 1324| 5.59k| } else { 1325| 3.94k| using std::get; 1326| | // if possible, we convert the node to a relaxed one simply by 1327| | // allocating a `relaxed_t` size table for it... maybe some of this 1328| | // magic should be moved as a `node<...>` static method... 1329| 3.94k| auto newcount = count - idx; 1330| 3.94k| auto newn = 1331| 3.94k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 2.70k, False: 1.24k] ------------------ 1332| 2.70k| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 2.70k| norefs_tag{})) relaxed_t, 1334| 2.70k| node) 1335| 3.94k| : node_t::make_inner_r_e(e); 1336| 3.94k| auto newr = newn->relaxed(); 1337| 3.94k| IMMER_TRY { ------------------ | | 49| 3.94k|#define IMMER_TRY try ------------------ 1338| 3.94k| auto subs = 1339| 3.94k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 2.70k, False: 1.24k] ------------------ 1340| 3.94k| : pos.towards_sub_oh( 1341| 1.24k| no_collapse_no_mut_t{}, first, idx, e); 1342| 3.94k| if (mutate) ------------------ | Branch (1342:21): [True: 2.70k, False: 1.24k] ------------------ 1343| 2.70k| pos.each_left(dec_visitor{}, idx); 1344| 3.94k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 3.94k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 3.94k, False: 0] ------------------ 1346| 3.94k| pos.copy_sizes( 1347| 3.94k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 3.94k| newr->d.count = newcount; 1349| 3.94k| newn->inner()[0] = get<1>(subs); 1350| 3.94k| std::copy(node->inner() + idx + 1, 1351| 3.94k| node->inner() + count, 1352| 3.94k| newn->inner() + 1); 1353| 3.94k| if (!mutate) { ------------------ | Branch (1353:21): [True: 1.24k, False: 2.70k] ------------------ 1354| 1.24k| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 1.24k| if (Mutating) ------------------ | Branch (1355:25): [True: 1.24k, Folded] ------------------ 1356| 1.24k| pos.visit(dec_visitor{}); 1357| 1.24k| } 1358| 3.94k| return std::make_tuple(pos.shift(), newn); 1359| 3.94k| } 1360| 3.94k| IMMER_CATCH (...) { 1361| 0| if (!mutate) ------------------ | Branch (1361:21): [True: 0, False: 0] ------------------ 1362| 0| node_t::delete_inner_r_e(newn); 1363| 0| else { 1364| | // restore the regular node that we were 1365| | // attempting to relax... 1366| 0| node_t::heap::deallocate(node_t::max_sizeof_relaxed, 1367| 0| node->impl.d.data.inner.relaxed); 1368| 0| node->impl.d.data.inner.relaxed = nullptr; 1369| 0| } 1370| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1371| 0| } 1372| 3.94k| } 1373| 9.54k| } _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.43k| { 1304| 3.43k| auto idx = pos.subindex(first); 1305| 3.43k| auto count = pos.count(); 1306| 3.43k| auto node = pos.node(); 1307| 3.43k| auto mutate = Mutating ------------------ | Branch (1307:23): [True: 0, Folded] ------------------ 1308| | // this is more restrictive than actually needed because 1309| | // it causes the algorithm to also avoid mutating the leaf 1310| | // in place 1311| 3.43k| && !node_t::embed_relaxed && node->can_mutate(e); ------------------ | Branch (1311:26): [True: 0, Folded] | Branch (1311:52): [True: 1.44k, False: 1.99k] ------------------ 1312| 3.43k| auto left_size = pos.size_before(idx); 1313| 3.43k| auto child_size = pos.size_sbh(idx, left_size); 1314| 3.43k| auto dropped_size = first; 1315| 3.43k| auto child_dropped_size = dropped_size - left_size; 1316| 3.43k| if (Collapse && pos.shift() > BL && idx == pos.count() - 1) { ------------------ | Branch (1316:13): [True: 3.43k, Folded] | Branch (1316:25): [True: 1.92k, False: 1.51k] | Branch (1316:45): [True: 1.70k, False: 213] ------------------ 1317| 1.70k| auto r = mutate ? pos.towards_sub_oh(this_t{}, first, idx, e) ------------------ | Branch (1317:22): [True: 335, False: 1.37k] ------------------ 1318| 1.70k| : pos.towards_sub_oh(no_mut_t{}, first, idx, e); 1319| 1.70k| if (mutate) ------------------ | Branch (1319:17): [True: 335, False: 1.37k] ------------------ 1320| 335| pos.visit(dec_left_visitor{}, idx); 1321| 1.37k| else if (Mutating) ------------------ | Branch (1321:22): [True: 1.37k, Folded] ------------------ 1322| 1.37k| pos.visit(dec_visitor{}); 1323| 1.70k| return r; 1324| 1.72k| } else { 1325| 1.72k| 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.72k| auto newcount = count - idx; 1330| 1.72k| auto newn = 1331| 1.72k| mutate ? (node->impl.d.data.inner.relaxed = new ( ------------------ | Branch (1331:17): [True: 1.10k, False: 617] ------------------ 1332| 1.10k| node_t::heap::allocate(node_t::max_sizeof_relaxed, 1333| 1.10k| norefs_tag{})) relaxed_t, 1334| 1.10k| node) 1335| 1.72k| : node_t::make_inner_r_e(e); 1336| 1.72k| auto newr = newn->relaxed(); 1337| 1.72k| IMMER_TRY { ------------------ | | 49| 1.72k|#define IMMER_TRY try ------------------ 1338| 1.72k| auto subs = 1339| 1.72k| mutate ? pos.towards_sub_oh(no_collapse_t{}, first, idx, e) ------------------ | Branch (1339:21): [True: 1.10k, False: 617] ------------------ 1340| 1.72k| : pos.towards_sub_oh( 1341| 617| no_collapse_no_mut_t{}, first, idx, e); 1342| 1.72k| if (mutate) ------------------ | Branch (1342:21): [True: 1.10k, False: 617] ------------------ 1343| 1.10k| pos.each_left(dec_visitor{}, idx); 1344| 1.72k| newr->d.sizes[0] = child_size - child_dropped_size; 1345| 1.72k| assert(newr->d.sizes[0]); ------------------ | Branch (1345:17): [True: 1.72k, False: 0] ------------------ 1346| 1.72k| pos.copy_sizes( 1347| 1.72k| idx + 1, newcount - 1, newr->d.sizes[0], newr->d.sizes + 1); 1348| 1.72k| newr->d.count = newcount; 1349| 1.72k| newn->inner()[0] = get<1>(subs); 1350| 1.72k| std::copy(node->inner() + idx + 1, 1351| 1.72k| node->inner() + count, 1352| 1.72k| newn->inner() + 1); 1353| 1.72k| if (!mutate) { ------------------ | Branch (1353:21): [True: 617, False: 1.10k] ------------------ 1354| 617| node_t::inc_nodes(newn->inner() + 1, newcount - 1); 1355| 617| if (Mutating) ------------------ | Branch (1355:25): [True: 617, Folded] ------------------ 1356| 617| pos.visit(dec_visitor{}); 1357| 617| } 1358| 1.72k| return std::make_tuple(pos.shift(), newn); 1359| 1.72k| } 1360| 1.72k| 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.72k| } 1373| 3.43k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_16rrbtree_iteratorIiSE_Lj2ELj2EEESF_EEbOT_OT0_PT1_jm: 349| 11.6k| { 350| 11.6k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 11.6k, False: 0] ------------------ 351| 11.6k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 10.5k, False: 1.11k] ------------------ 352| 11.6k| ? visit_maybe_relaxed_sub(rootl, 353| 10.5k| shiftl, 354| 10.5k| sizel, 355| 10.5k| this_t{}, 356| 10.5k| posr, 357| 10.5k| first, 358| 10.5k| size_t{}) 359| 11.6k| : posr.first_sub_inner( 360| 1.11k| rrb{}, first, rootl, shiftl, sizel); 361| 11.6k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESG_RNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEbOT_OT0_OT1_m: 382| 28.8k| { 383| 28.8k| auto nl = posl.node(); 384| 28.8k| auto nr = posr.node(); 385| 28.8k| if (nl == nr) ------------------ | Branch (385:13): [True: 8.51k, False: 20.3k] ------------------ 386| 8.51k| return true; 387| 20.3k| auto cl = posl.count(); 388| 20.3k| auto cr = posr.count(); 389| 20.3k| assert(cr > 0); ------------------ | Branch (389:9): [True: 20.3k, False: 0] ------------------ 390| 20.3k| auto sbr = size_t{}; 391| 20.3k| auto i = count_t{}; 392| 20.3k| auto j = count_t{}; 393| 61.8k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 51.1k, False: 10.7k] ------------------ 394| 51.1k| 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.1k, False: 15.2k] | Branch (395:34): [True: 29.2k, False: 35.9k] ------------------ 396| 29.2k| ; 397| 51.1k| auto res = 398| 51.1k| sbl == sbr ------------------ | Branch (398:17): [True: 32.8k, False: 18.3k] ------------------ 399| 51.1k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 51.1k| : posl.nth_sub(i, 401| 18.3k| for_each_chunk_p_visitor{}, 402| 18.3k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 51.1k| if (!res) ------------------ | Branch (403:17): [True: 9.64k, False: 41.5k] ------------------ 404| 9.64k| return false; 405| 51.1k| } 406| 10.7k| return true; 407| 20.3k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 336| 9.32k| { 337| 9.32k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 9.32k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESG_RNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEbOT_OT0_OT1_m: 427| 9.89k| { 428| 9.89k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 4.67k, False: 5.21k] ------------------ 429| 4.67k| return true; 430| 5.21k| auto cl = posl.count(); 431| 5.21k| auto cr = posr.count(); 432| 5.21k| auto mp = std::min(cl, cr); 433| 5.21k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 3.80k, False: 1.41k] ------------------ 434| 5.21k| posl.node()->leaf() + mp, 435| 5.21k| posr.node()->leaf()) && 436| 3.80k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 3.38k, False: 422] ------------------ 437| 3.80k| posl.node()->leaf() + posl.count(), 438| 3.80k| first + (idx + mp)); 439| 9.89k| } _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.3k| { 330| 21.3k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 21.3k| } _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.43k| { 413| 4.43k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 4.43k| } _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.43k| { 383| 4.43k| auto nl = posl.node(); 384| 4.43k| auto nr = posr.node(); 385| 4.43k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 4.43k] ------------------ 386| 0| return true; 387| 4.43k| auto cl = posl.count(); 388| 4.43k| auto cr = posr.count(); 389| 4.43k| assert(cr > 0); ------------------ | Branch (389:9): [True: 4.43k, False: 0] ------------------ 390| 4.43k| auto sbr = size_t{}; 391| 4.43k| auto i = count_t{}; 392| 4.43k| auto j = count_t{}; 393| 12.9k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 10.8k, False: 2.13k] ------------------ 394| 10.8k| 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.34k] | Branch (395:34): [True: 6.16k, False: 6.52k] ------------------ 396| 6.16k| ; 397| 10.8k| auto res = 398| 10.8k| sbl == sbr ------------------ | Branch (398:17): [True: 6.60k, False: 4.26k] ------------------ 399| 10.8k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 10.8k| : 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.8k| if (!res) ------------------ | Branch (403:17): [True: 2.29k, False: 8.56k] ------------------ 404| 2.29k| return false; 405| 10.8k| } 406| 2.13k| return true; 407| 4.43k| } _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.61k| { 337| 3.61k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 3.61k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_12leaf_sub_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEbOT_OT0_OT1_m: 427| 7.07k| { 428| 7.07k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 4.26k, False: 2.81k] ------------------ 429| 4.26k| return true; 430| 2.81k| auto cl = posl.count(); 431| 2.81k| auto cr = posr.count(); 432| 2.81k| auto mp = std::min(cl, cr); 433| 2.81k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 2.57k, False: 239] ------------------ 434| 2.81k| posl.node()->leaf() + mp, 435| 2.81k| posr.node()->leaf()) && 436| 2.57k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 2.32k, False: 246] ------------------ 437| 2.57k| posl.node()->leaf() + posl.count(), 438| 2.57k| first + (idx + mp)); 439| 7.07k| } _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.20k| { 330| 2.20k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.20k| } _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.77k| { 413| 2.77k| return this_t::visit_relaxed(posl, posr, first, idx); 414| 2.77k| } _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.77k| { 383| 2.77k| auto nl = posl.node(); 384| 2.77k| auto nr = posr.node(); 385| 2.77k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.77k] ------------------ 386| 0| return true; 387| 2.77k| auto cl = posl.count(); 388| 2.77k| auto cr = posr.count(); 389| 2.77k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.77k, False: 0] ------------------ 390| 2.77k| auto sbr = size_t{}; 391| 2.77k| auto i = count_t{}; 392| 2.77k| auto j = count_t{}; 393| 12.9k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 10.4k, False: 2.40k] ------------------ 394| 10.4k| auto sbl = posl.size_before(i); 395| 17.9k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 13.8k, False: 4.06k] | Branch (395:34): [True: 7.45k, False: 6.43k] ------------------ 396| 7.45k| ; 397| 10.4k| auto res = 398| 10.4k| sbl == sbr ------------------ | Branch (398:17): [True: 5.90k, False: 4.59k] ------------------ 399| 10.4k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 10.4k| : posl.nth_sub(i, 401| 4.59k| for_each_chunk_p_visitor{}, 402| 4.59k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 10.4k| if (!res) ------------------ | Branch (403:17): [True: 373, False: 10.1k] ------------------ 404| 373| return false; 405| 10.4k| } 406| 2.40k| return true; 407| 2.77k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_8full_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 336| 4.02k| { 337| 4.02k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 4.02k| } _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| 882| { 330| 882| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 882| } _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| 998| { 330| 998| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 998| } _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.77k| { 420| 1.77k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 1.77k, False: 0] ------------------ 421| 1.77k| ? this_t::visit_regular(posl, posr.node()) 422| 1.77k| : this_t::visit_regular(posr, posl.node()); 423| 1.77k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESE_EEbOT_PT0_: 443| 8.82k| { 444| 8.82k| auto node = pos.node(); 445| 8.82k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 5.88k, False: 2.94k] | Branch (445:33): [True: 1.50k, False: 1.43k] ------------------ 446| 8.82k| } _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| 11.2k| { 451| 11.2k| auto node = pos.node(); 452| 11.2k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 7.39k, False: 3.85k] | Branch (452:33): [True: 2.11k, False: 1.74k] ------------------ 453| 3.85k| node->leaf() + pos.count(), 454| 3.85k| other->leaf()); 455| 11.2k| } _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.36k| { 444| 7.36k| auto node = pos.node(); 445| 7.36k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 2.43k, False: 4.93k] | Branch (445:33): [True: 2.50k, False: 2.43k] ------------------ 446| 7.36k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESE_EEbOT_PT0_: 450| 3.09k| { 451| 3.09k| auto node = pos.node(); 452| 3.09k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 1.55k, False: 1.54k] | Branch (452:33): [True: 619, False: 921] ------------------ 453| 1.54k| node->leaf() + pos.count(), 454| 1.54k| other->leaf()); 455| 3.09k| } _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.53k| { 444| 3.53k| auto node = pos.node(); 445| 3.53k| return node == other || pos.each_pred_zip(this_t{}, other); ------------------ | Branch (445:16): [True: 336, False: 3.19k] | Branch (445:33): [True: 2.15k, False: 1.04k] ------------------ 446| 3.53k| } _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| 303k| { 113| 303k| auto data = as_const(pos.node()->leaf()); 114| 303k| return fn(data, data + pos.count()); 115| 303k| } _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.21M| return [iter](auto f, auto e) mutable { 368| 1.21M| if (f == &*iter) { ------------------ | Branch (368:17): [True: 191k, False: 1.02M] ------------------ 369| 191k| iter += e - f; 370| 191k| return true; 371| 191k| } 372| 4.64M| for (; f != e; ++f, ++iter) ------------------ | Branch (372:20): [True: 3.62M, False: 1.01M] ------------------ 373| 3.62M| if (*f != *iter) ------------------ | Branch (373:21): [True: 3.54k, False: 3.62M] ------------------ 374| 3.54k| return false; 375| 1.01M| return true; 376| 1.02M| }; _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.52M| { 54| 8.52M| return pos.towards(this_t{}, idx); 55| 8.52M| } _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| 908k| { 60| 908k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 908k| } _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| 327k| { 54| 327k| return pos.towards(this_t{}, idx); 55| 327k| } _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| 305k| { 60| 305k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 305k| } _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| 852k| { 54| 852k| return pos.towards(this_t{}, idx); 55| 852k| } _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| 21.5k| { 60| 21.5k| return std::make_tuple(pos.node()->leaf(), pos.index(idx), pos.count()); 61| 21.5k| } _ZN5immer6detail4rbts18region_for_visitorIiE11visit_innerIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEEENSt3__15tupleIJPimmEEEOT_m: 53| 95.7k| { 54| 95.7k| return pos.towards(this_t{}, idx); 55| 95.7k| } _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| 81.5k| { 107| 81.5k| return pos.each_pred(this_t{}, fn); 108| 81.5k| } _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| 777| { 330| 777| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 777| } _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.32k| { 420| 6.32k| return posl.count() >= posr.count() ------------------ | Branch (420:16): [True: 6.32k, False: 0] ------------------ 421| 6.32k| ? this_t::visit_regular(posl, posr.node()) 422| 6.32k| : this_t::visit_regular(posr, posl.node()); 423| 6.32k| } _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| 893k| { 113| 893k| auto data = as_const(pos.node()->leaf()); 114| 893k| return fn(data, data + pos.count()); 115| 893k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 18.2k| { 107| 18.2k| return pos.each_pred(this_t{}, fn); 108| 18.2k| } _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| 16.8k| { 113| 16.8k| auto data = as_const(pos.node()->leaf()); 114| 16.8k| return fn(data, data + pos.count()); 115| 16.8k| } _ZN5immer6detail4rbts24for_each_chunk_p_visitor11visit_innerIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEDaOT_EUlSL_T0_E_EEbSM_OSN_: 106| 5.91k| { 107| 5.91k| return pos.each_pred(this_t{}, fn); 108| 5.91k| } _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.51k| { 330| 2.51k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.51k| } _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.42k| { 383| 2.42k| auto nl = posl.node(); 384| 2.42k| auto nr = posr.node(); 385| 2.42k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 2.42k] ------------------ 386| 0| return true; 387| 2.42k| auto cl = posl.count(); 388| 2.42k| auto cr = posr.count(); 389| 2.42k| assert(cr > 0); ------------------ | Branch (389:9): [True: 2.42k, False: 0] ------------------ 390| 2.42k| auto sbr = size_t{}; 391| 2.42k| auto i = count_t{}; 392| 2.42k| auto j = count_t{}; 393| 8.04k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 6.45k, False: 1.58k] ------------------ 394| 6.45k| auto sbl = posl.size_before(i); 395| 9.99k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 7.93k, False: 2.06k] | Branch (395:34): [True: 3.53k, False: 4.39k] ------------------ 396| 3.53k| ; 397| 6.45k| auto res = 398| 6.45k| sbl == sbr ------------------ | Branch (398:17): [True: 4.08k, False: 2.37k] ------------------ 399| 6.45k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 6.45k| : posl.nth_sub(i, 401| 2.37k| for_each_chunk_p_visitor{}, 402| 2.37k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 6.45k| if (!res) ------------------ | Branch (403:17): [True: 847, False: 5.61k] ------------------ 404| 847| return false; 405| 6.45k| } 406| 1.58k| return true; 407| 2.42k| } _ZN5immer6detail4rbts14equals_visitor10this_aux_t10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_11relaxed_posISF_EERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEEEEbOT_jOT0_OT1_m: 336| 4.73k| { 337| 4.73k| return posl.nth_sub_leaf(i, this_t{}, posr, first, idx); 338| 4.73k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_13full_leaf_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEbOT_OT0_OT1_m: 427| 4.73k| { 428| 4.73k| if (posl.node() == posr.node()) ------------------ | Branch (428:13): [True: 2.80k, False: 1.93k] ------------------ 429| 2.80k| return true; 430| 1.93k| auto cl = posl.count(); 431| 1.93k| auto cr = posr.count(); 432| 1.93k| auto mp = std::min(cl, cr); 433| 1.93k| return std::equal(posl.node()->leaf(), ------------------ | Branch (433:16): [True: 1.52k, False: 409] ------------------ 434| 1.93k| posl.node()->leaf() + mp, 435| 1.93k| posr.node()->leaf()) && 436| 1.52k| std::equal(posl.node()->leaf() + mp, ------------------ | Branch (436:16): [True: 1.52k, False: 0] ------------------ 437| 1.52k| posl.node()->leaf() + posl.count(), 438| 1.52k| first + (idx + mp)); 439| 4.73k| } _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.65k| { 330| 2.65k| return posl.nth_sub(i, this_t{}, posr, first, idx); 331| 2.65k| } _ZN5immer6detail4rbts14equals_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_8full_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEEbOT_OT0_OT1_m: 382| 1.60k| { 383| 1.60k| auto nl = posl.node(); 384| 1.60k| auto nr = posr.node(); 385| 1.60k| if (nl == nr) ------------------ | Branch (385:13): [True: 0, False: 1.60k] ------------------ 386| 0| return true; 387| 1.60k| auto cl = posl.count(); 388| 1.60k| auto cr = posr.count(); 389| 1.60k| assert(cr > 0); ------------------ | Branch (389:9): [True: 1.60k, False: 0] ------------------ 390| 1.60k| auto sbr = size_t{}; 391| 1.60k| auto i = count_t{}; 392| 1.60k| auto j = count_t{}; 393| 6.99k| for (; i < cl; ++i) { ------------------ | Branch (393:16): [True: 5.80k, False: 1.19k] ------------------ 394| 5.80k| auto sbl = posl.size_before(i); 395| 9.93k| for (; j + 1 < cr && (sbr = posr.size_before(j)) < sbl; ++j) ------------------ | Branch (395:20): [True: 8.79k, False: 1.14k] | Branch (395:34): [True: 4.12k, False: 4.66k] ------------------ 396| 4.12k| ; 397| 5.80k| auto res = 398| 5.80k| sbl == sbr ------------------ | Branch (398:17): [True: 3.67k, False: 2.13k] ------------------ 399| 5.80k| ? posr.nth_sub(j, this_aux_t{}, i, posl, first, idx + sbl) 400| 5.80k| : posl.nth_sub(i, 401| 2.13k| for_each_chunk_p_visitor{}, 402| 2.13k| this_t::equal_chunk_p(first + (idx + sbl))); 403| 5.80k| if (!res) ------------------ | Branch (403:17): [True: 414, False: 5.38k] ------------------ 404| 414| return false; 405| 5.80k| } 406| 1.19k| return true; 407| 1.60k| } _ZN5immer6detail4rbts14equals_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_8full_posISE_EERNS1_16rrbtree_iteratorIiSD_Lj2ELj2EEEEENSt3__19enable_ifIXnt12is_relaxed_vIT0_EEbE4typeEOT_OSP_OT1_m: 419| 1.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| 579k| { 107| 579k| return pos.each_pred(this_t{}, fn); 108| 579k| } _ZN5immer6detail4rbts14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaOT_: 366| 31.7k| { 367| 31.7k| return [iter](auto f, auto e) mutable { 368| 31.7k| if (f == &*iter) { 369| 31.7k| iter += e - f; 370| 31.7k| return true; 371| 31.7k| } 372| 31.7k| for (; f != e; ++f, ++iter) 373| 31.7k| if (*f != *iter) 374| 31.7k| return false; 375| 31.7k| return true; 376| 31.7k| }; 377| 31.7k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_16rrbtree_iteratorIiSE_Lj2ELj2EEESF_EEbOT_OT0_PT1_jm: 349| 1.43k| { 350| 1.43k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 1.43k, False: 0] ------------------ 351| 1.43k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 1.11k, False: 317] ------------------ 352| 1.43k| ? visit_maybe_relaxed_sub(rootl, 353| 1.11k| shiftl, 354| 1.11k| sizel, 355| 1.11k| this_t{}, 356| 1.11k| posr, 357| 1.11k| first, 358| 1.11k| size_t{}) 359| 1.43k| : posr.first_sub_inner( 360| 317| rrb{}, first, rootl, shiftl, sizel); 361| 1.43k| } _ZN5immer6detail4rbts14equals_visitor3rrb10visit_nodeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_16rrbtree_iteratorIiSE_Lj2ELj2EEESF_EEbOT_OT0_PT1_jm: 349| 6.23k| { 350| 6.23k| assert(shiftl <= posr.shift()); ------------------ | Branch (350:13): [True: 6.23k, False: 0] ------------------ 351| 6.23k| return shiftl == posr.shift() ------------------ | Branch (351:20): [True: 6.23k, False: 0] ------------------ 352| 6.23k| ? visit_maybe_relaxed_sub(rootl, 353| 6.23k| shiftl, 354| 6.23k| sizel, 355| 6.23k| this_t{}, 356| 6.23k| posr, 357| 6.23k| first, 358| 6.23k| size_t{}) 359| 6.23k| : posr.first_sub_inner( 360| 0| rrb{}, first, rootl, shiftl, sizel); 361| 6.23k| } _ZN5immer6detail4rbts14equals_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEESE_EEbOT_PT0_: 450| 6.25k| { 451| 6.25k| auto node = pos.node(); 452| 6.25k| return node == other || std::equal(node->leaf(), ------------------ | Branch (452:16): [True: 3.20k, False: 3.05k] | Branch (452:33): [True: 991, False: 2.05k] ------------------ 453| 3.05k| node->leaf() + pos.count(), 454| 3.05k| other->leaf()); 455| 6.25k| } _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| 27.9M|{ 1839| 27.9M| assert(node); ------------------ | Branch (1839:5): [True: 27.9M, False: 0] ------------------ 1840| 27.9M| auto relaxed = node->relaxed(); 1841| 27.9M| if (relaxed) { ------------------ | Branch (1841:9): [True: 25.7M, False: 2.23M] ------------------ 1842| 25.7M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 25.7M, False: 0] ------------------ 1843| 25.7M| return make_relaxed_pos(node, shift, relaxed) 1844| 25.7M| .visit(v, std::forward(args)...); 1845| 25.7M| } else { 1846| 2.23M| return make_regular_sub_pos(node, shift, size) 1847| 2.23M| .visit(v, std::forward(args)...); 1848| 2.23M| } 1849| 27.9M|} _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| 88.3M|{ 1829| 88.3M| assert(node); ------------------ | Branch (1829:5): [True: 88.3M, False: 0] ------------------ 1830| 88.3M| assert(relaxed); ------------------ | Branch (1830:5): [True: 88.3M, False: 0] ------------------ 1831| 88.3M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1831:5): [True: 88.3M, False: 0] ------------------ 1832| 88.3M| return {node, shift, relaxed}; 1833| 88.3M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1813| 32.9M| { 1814| 32.9M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 32.9M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 1431| 53.9M| node_t* node() const { return node_; } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 1476| 10.6M| { 1477| 10.6M| each_left(v, relaxed_->d.count, args...); 1478| 10.6M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1623| 10.8M| { 1624| 10.8M| auto p = node_->inner(); 1625| 10.8M| auto s = size_t{}; 1626| 10.8M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 1.92M, False: 8.93M] ------------------ 1627| 8.34M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 6.42M, False: 1.92M] ------------------ 1628| 6.42M| IMMER_PREFETCH(p + i + 1); 1629| 6.42M| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 6.42M| .visit(v, args...); 1631| 6.42M| s = relaxed_->d.sizes[i]; 1632| 6.42M| assert(s); ------------------ | Branch (1632:17): [True: 6.42M, False: 0] ------------------ 1633| 6.42M| } 1634| 8.93M| } else { 1635| 8.93M| auto ss = shift_ - B; 1636| 35.3M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 26.4M, False: 8.93M] ------------------ 1637| 26.4M| visit_maybe_relaxed_sub( 1638| 26.4M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 26.4M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 26.4M, False: 0] ------------------ 1641| 26.4M| } 1642| 8.93M| } 1643| 10.8M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5countEv: 1430| 51.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| 5.56M|{ 1045| 5.56M| assert(node); ------------------ | Branch (1045:5): [True: 5.56M, False: 0] ------------------ 1046| 5.56M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1046:5): [True: 5.56M, False: 0] ------------------ 1047| 5.56M| assert(size > 0); ------------------ | Branch (1047:5): [True: 5.56M, False: 0] ------------------ 1048| 5.56M| assert(size <= (branches << shift)); ------------------ | Branch (1048:5): [True: 5.56M, False: 0] ------------------ 1049| 5.56M| return {node, shift, size}; 1050| 5.56M|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1036| 2.24M| { 1037| 2.24M| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.24M| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 785| 7.50M| 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| 565k| { 826| 565k| return each_regular(*this, v, args...); 827| 565k| } _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| 565k|{ 344| 565k| constexpr auto B = bits; 345| 565k| constexpr auto BL = bits_leaf; 346| 565k| auto n = p.node()->inner(); 347| 565k| auto last = p.count() - 1; 348| 565k| auto e = n + last; 349| 565k| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 51.0k, False: 514k] ------------------ 350| 106k| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 55.8k, False: 51.0k] ------------------ 351| 55.8k| IMMER_PREFETCH(n + 1); 352| 55.8k| make_full_leaf_pos(*n).visit(v, args...); 353| 55.8k| } 354| 51.0k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 514k| } else { 356| 514k| auto ss = p.shift() - B; 357| 1.19M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 685k, False: 514k] ------------------ 358| 685k| make_full_pos(*n, ss).visit(v, args...); 359| 514k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 514k| } 361| 565k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 787| 7.10M| 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| 3.94M|{ 215| 3.94M| assert(node); ------------------ | Branch (215:5): [True: 3.94M, False: 0] ------------------ 216| 3.94M| return {node}; 217| 3.94M|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 207| 1.13M| { 208| 1.13M| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.13M| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 199| 2.98M| 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.31M| 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| 974k|{ 120| 974k| assert(node); ------------------ | Branch (120:5): [True: 974k, False: 0] ------------------ 121| 974k| assert(size > 0); ------------------ | Branch (121:5): [True: 974k, False: 0] ------------------ 122| 974k| return {node, size}; 123| 974k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 786| 4.02M| 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| 451k| { 113| 451k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 451k| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 104| 978k| 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.01M| 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.04M| 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.53M|{ 1413| 5.53M| assert(node); ------------------ | Branch (1413:5): [True: 5.53M, False: 0] ------------------ 1414| 5.53M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (1414:5): [True: 5.53M, False: 0] ------------------ 1415| 5.53M| return {node, shift}; 1416| 5.53M|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 1405| 3.26M| { 1406| 3.26M| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.26M| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 1159| 3.92M| 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| 215k| { 1186| 215k| auto p = node_->inner(); 1187| 215k| auto e = p + branches; 1188| 215k| if (shift_ == BL) { ------------------ | Branch (1188:13): [True: 165k, False: 49.9k] ------------------ 1189| 825k| for (; p != e; ++p) { ------------------ | Branch (1189:20): [True: 660k, False: 165k] ------------------ 1190| 660k| IMMER_PREFETCH(p + 1); 1191| 660k| make_full_leaf_pos(*p).visit(v, args...); 1192| 660k| } 1193| 165k| } else { 1194| 49.9k| auto ss = shift_ - B; 1195| 249k| for (; p != e; ++p) ------------------ | Branch (1195:20): [True: 199k, False: 49.9k] ------------------ 1196| 199k| make_full_pos(*p, ss).visit(v, args...); 1197| 49.9k| } 1198| 215k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5countEv: 1158| 1.45M| count_t count() const { return branches; } _ZN5immer6detail4rbts16make_regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_11regular_posIT_EEPSE_jm: 690| 5.15M|{ 691| 5.15M| assert(node); ------------------ | Branch (691:5): [True: 5.15M, False: 0] ------------------ 692| 5.15M| assert(shift >= NodeT::bits_leaf); ------------------ | Branch (692:5): [True: 5.15M, False: 0] ------------------ 693| 5.15M| assert(size > 0); ------------------ | Branch (693:5): [True: 5.15M, False: 0] ------------------ 694| 5.15M| return {node, shift, size}; 695| 5.15M|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 336| 2.21M| { 337| 2.21M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.21M| } _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 231| 9.45M| node_t* node() const { return node_; } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4eachINS1_11dec_visitorEJEEEvT_DpOT0_: 243| 2.08M| { 244| 2.08M| return each_regular(*this, v, args...); 245| 2.08M| } _ZN5immer6detail4rbts12each_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_11dec_visitorEJEEEvOT_T0_DpOT1_: 343| 2.08M|{ 344| 2.08M| constexpr auto B = bits; 345| 2.08M| constexpr auto BL = bits_leaf; 346| 2.08M| auto n = p.node()->inner(); 347| 2.08M| auto last = p.count() - 1; 348| 2.08M| auto e = n + last; 349| 2.08M| if (p.shift() == BL) { ------------------ | Branch (349:9): [True: 393k, False: 1.69M] ------------------ 350| 790k| for (; n != e; ++n) { ------------------ | Branch (350:16): [True: 396k, False: 393k] ------------------ 351| 396k| IMMER_PREFETCH(n + 1); 352| 396k| make_full_leaf_pos(*n).visit(v, args...); 353| 396k| } 354| 393k| make_leaf_pos(*n, p.size()).visit(v, args...); 355| 1.69M| } else { 356| 1.69M| auto ss = p.shift() - B; 357| 4.05M| for (; n != e; ++n) ------------------ | Branch (357:16): [True: 2.35M, False: 1.69M] ------------------ 358| 2.35M| make_full_pos(*n, ss).visit(v, args...); 359| 1.69M| make_regular_pos(*n, ss, p.size()).visit(v, args...); 360| 1.69M| } 361| 2.08M|} _ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 233| 9.00M| 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| 12.7M| 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.59M| 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| 12.4M| 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| 8.57M| 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| 8.89M| 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| 16.5M|{ 152| 16.5M| assert(node); ------------------ | Branch (152:5): [True: 16.5M, False: 0] ------------------ 153| 16.5M| assert(count <= branches); ------------------ | Branch (153:5): [True: 16.5M, False: 0] ------------------ 154| 16.5M| return {node, count}; 155| 16.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.42M| { 145| 9.42M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 9.42M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 136| 14.4M| 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| 7.99M| 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.52M|{ 89| 1.52M| assert(node); ------------------ | Branch (89:5): [True: 1.52M, False: 0] ------------------ 90| 1.52M| return {node}; 91| 1.52M|} _ZN5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_: 81| 1.52M| { 82| 1.52M| return Visitor::visit_leaf(*this, std::forward(args)...); 83| 1.52M| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4nodeEv: 75| 1.52M| 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.74k| 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| 496k| { 1814| 496k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 496k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 1433| 10.4M| shift_t shift() const { return shift_; } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEj: 1443| 5.33M| { 1444| 5.33M| return size_sbh(offset, size_before(offset)); 1445| 5.33M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8size_sbhEjm: 1448| 5.66M| { 1449| 5.66M| assert(size_before_hint == size_before(offset)); ------------------ | Branch (1449:9): [True: 5.66M, False: 0] ------------------ 1450| 5.66M| return relaxed_->d.sizes[offset] - size_before_hint; 1451| 5.66M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11size_beforeEj: 1438| 15.6M| { 1439| 15.6M| return offset ? relaxed_->d.sizes[offset - 1] : 0; ------------------ | Branch (1439:16): [True: 10.0M, False: 5.63M] ------------------ 1440| 15.6M| } _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| 482k| { 1738| 482k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 482k, False: 0] ------------------ 1739| 482k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 482k, False: 0] ------------------ 1740| 482k| auto child = node_->inner()[offset_hint]; 1741| 482k| auto is_leaf = shift_ == BL; 1742| 482k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 482k] ------------------ 1743| 482k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 482k| : visit_maybe_relaxed_sub( 1745| 482k| child, shift_ - B, child_size_hint, v, args...); 1746| 482k| } _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| 482k|{ 1839| 482k| assert(node); ------------------ | Branch (1839:5): [True: 482k, False: 0] ------------------ 1840| 482k| auto relaxed = node->relaxed(); 1841| 482k| if (relaxed) { ------------------ | Branch (1841:9): [True: 288k, False: 193k] ------------------ 1842| 288k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 288k, False: 0] ------------------ 1843| 288k| return make_relaxed_pos(node, shift, relaxed) 1844| 288k| .visit(v, std::forward(args)...); 1845| 288k| } else { 1846| 193k| return make_regular_sub_pos(node, shift, size) 1847| 193k| .visit(v, std::forward(args)...); 1848| 193k| } 1849| 482k|} _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| 193k| { 1037| 193k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 193k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 788| 2.17M| 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| 481k| { 953| 481k| return last_oh_regular(*this, v, offset_hint, args...); 954| 481k| } _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| 481k|{ 678| 481k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 481k, False: 0] ------------------ 679| 481k| constexpr auto B = bits; 680| 481k| constexpr auto BL = bits_leaf; 681| 481k| auto child = p.node()->inner()[offset_hint]; 682| 481k| auto is_leaf = p.shift() == BL; 683| 481k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 481k] ------------------ 684| 481k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 481k| .visit(v, args...); 686| 481k|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_DpOT0_: 336| 2.05M| { 337| 2.05M| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.05M| } _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.57M| { 331| 1.57M| return last_oh_regular(*this, v, offset_hint, args...); 332| 1.57M| } _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.57M|{ 678| 1.57M| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.57M, False: 0] ------------------ 679| 1.57M| constexpr auto B = bits; 680| 1.57M| constexpr auto BL = bits_leaf; 681| 1.57M| auto child = p.node()->inner()[offset_hint]; 682| 1.57M| auto is_leaf = p.shift() == BL; 683| 1.57M| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.57M] ------------------ 684| 1.57M| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.57M| .visit(v, args...); 686| 1.57M|} _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 1432| 19.5M| 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| 310k| { 1037| 310k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 310k| } 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| 46.4k| { 145| 46.4k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 46.4k| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 139| 1.08M| 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| 326k|{ 1839| 326k| assert(node); ------------------ | Branch (1839:5): [True: 326k, False: 0] ------------------ 1840| 326k| auto relaxed = node->relaxed(); 1841| 326k| if (relaxed) { ------------------ | Branch (1841:9): [True: 300k, False: 25.9k] ------------------ 1842| 300k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 300k, False: 0] ------------------ 1843| 300k| return make_relaxed_pos(node, shift, relaxed) 1844| 300k| .visit(v, std::forward(args)...); 1845| 300k| } else { 1846| 25.9k| return make_regular_sub_pos(node, shift, size) 1847| 25.9k| .visit(v, std::forward(args)...); 1848| 25.9k| } 1849| 326k|} 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| 300k| { 1814| 300k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 300k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 1454| 28.2M| { 1455| 28.2M| auto offset = idx >> shift_; 1456| 38.8M| while (relaxed_->d.sizes[offset] <= idx) ------------------ | Branch (1456:16): [True: 10.6M, False: 28.2M] ------------------ 1457| 10.6M| ++offset; 1458| 28.2M| return offset; 1459| 28.2M| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7relaxedEv: 1435| 300k| 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| 300k| { 1687| 300k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 300k, False: 0] ------------------ 1688| 300k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 55.6k, False: 245k] ------------------ 1689| 300k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 300k| } 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| 300k| { 1699| 300k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 300k| } 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| 300k| { 1718| 300k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 300k, False: 0] ------------------ 1719| 300k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 55.6k, False: 245k] | Branch (1719:9): [True: 300k, False: 0] ------------------ 1720| 300k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 300k| auto child = node_->inner()[offset_hint]; 1722| 300k| auto is_leaf = shift_ == BL; 1723| 300k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 300k| auto next_idx = idx - left_size_hint; 1725| 300k| return is_leaf ------------------ | Branch (1725:16): [True: 43.9k, False: 256k] ------------------ 1726| 300k| ? make_leaf_sub_pos(child, next_size) 1727| 43.9k| .visit(v, next_idx, args...) 1728| 300k| : visit_maybe_relaxed_sub( 1729| 256k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 300k| } 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| 43.9k| { 145| 43.9k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 43.9k| } flex-vector.cpp:_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 1036| 25.9k| { 1037| 25.9k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 25.9k| } flex-vector.cpp:_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_: 938| 25.9k| { 939| 25.9k| return towards_oh_ch_regular( 940| 25.9k| *this, v, idx, offset_hint, count(), args...); 941| 25.9k| } flex-vector.cpp:_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_14update_visitorISD_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcOSL_T0_mjjDpOT1_: 632| 25.9k|{ 633| 25.9k| constexpr auto B = bits; 634| 25.9k| constexpr auto BL = bits_leaf; 635| 25.9k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 25.9k, False: 0] ------------------ 636| 25.9k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 25.9k, False: 0] ------------------ 637| 25.9k| auto is_leaf = p.shift() == BL; 638| 25.9k| auto child = p.node()->inner()[offset_hint]; 639| 25.9k| auto is_full = offset_hint + 1 != count_hint; 640| 25.9k| return is_full ------------------ | Branch (640:12): [True: 19.5k, False: 6.35k] ------------------ 641| 25.9k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 9.46k, False: 10.0k] ------------------ 642| 19.5k| : make_full_pos(child, p.shift() - B) 643| 10.0k| .visit(v, idx, args...)) 644| 25.9k| : (is_leaf ------------------ | Branch (644:19): [True: 3.12k, False: 3.23k] ------------------ 645| 6.35k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 6.35k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.23k| .visit(v, idx, args...)); 648| 25.9k|} flex-vector.cpp:_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 207| 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| 382k| 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.4k| { 1406| 16.4k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 16.4k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5indexEm: 1162| 1.80M| 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.4k| { 1330| 16.4k| return towards_oh(v, idx, offset_hint, args...); 1331| 16.4k| } 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.4k| { 1337| 16.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 16.4k, False: 0] ------------------ 1338| 16.4k| auto is_leaf = shift_ == BL; 1339| 16.4k| auto child = node_->inner()[offset_hint]; 1340| 16.4k| return is_leaf ------------------ | Branch (1340:16): [True: 11.1k, False: 5.24k] ------------------ 1341| 16.4k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 16.4k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 16.4k| } flex-vector.cpp:_ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_: 112| 4.23k| { 113| 4.23k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 4.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| 3.60k| { 337| 3.60k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.60k| } flex-vector.cpp:_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_: 316| 3.60k| { 317| 3.60k| return towards_oh_ch_regular( 318| 3.60k| *this, v, idx, offset_hint, count(), args...); 319| 3.60k| } flex-vector.cpp:_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_14update_visitorISD_EEJRZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcOSL_T0_mjjDpOT1_: 632| 3.60k|{ 633| 3.60k| constexpr auto B = bits; 634| 3.60k| constexpr auto BL = bits_leaf; 635| 3.60k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.60k, False: 0] ------------------ 636| 3.60k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.60k, False: 0] ------------------ 637| 3.60k| auto is_leaf = p.shift() == BL; 638| 3.60k| auto child = p.node()->inner()[offset_hint]; 639| 3.60k| auto is_full = offset_hint + 1 != count_hint; 640| 3.60k| return is_full ------------------ | Branch (640:12): [True: 2.12k, False: 1.47k] ------------------ 641| 3.60k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.02k, False: 1.10k] ------------------ 642| 2.12k| : make_full_pos(child, p.shift() - B) 643| 1.10k| .visit(v, idx, args...)) 644| 3.60k| : (is_leaf ------------------ | Branch (644:19): [True: 1.11k, False: 368] ------------------ 645| 1.47k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.47k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 368| .visit(v, idx, args...)); 648| 3.60k|} _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| 40.0k|{ 1839| 40.0k| assert(node); ------------------ | Branch (1839:5): [True: 40.0k, False: 0] ------------------ 1840| 40.0k| auto relaxed = node->relaxed(); 1841| 40.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 33.4k, False: 6.56k] ------------------ 1842| 33.4k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 33.4k, False: 0] ------------------ 1843| 33.4k| return make_relaxed_pos(node, shift, relaxed) 1844| 33.4k| .visit(v, std::forward(args)...); 1845| 33.4k| } else { 1846| 6.56k| return make_regular_sub_pos(node, shift, size) 1847| 6.56k| .visit(v, std::forward(args)...); 1848| 6.56k| } 1849| 40.0k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 33.4k| { 1814| 33.4k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 33.4k| } _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| 24.7k| { 1687| 24.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 24.7k, False: 0] ------------------ 1688| 24.7k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 24.7k] ------------------ 1689| 24.7k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 24.7k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1698| 24.7k| { 1699| 24.7k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 24.7k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_: 1717| 24.7k| { 1718| 24.7k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 24.7k, False: 0] ------------------ 1719| 24.7k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 24.7k] | Branch (1719:9): [True: 24.7k, False: 0] ------------------ 1720| 24.7k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 24.7k| auto child = node_->inner()[offset_hint]; 1722| 24.7k| auto is_leaf = shift_ == BL; 1723| 24.7k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 24.7k| auto next_idx = idx - left_size_hint; 1725| 24.7k| return is_leaf ------------------ | Branch (1725:16): [True: 2.03k, False: 22.7k] ------------------ 1726| 24.7k| ? make_leaf_sub_pos(child, next_size) 1727| 2.03k| .visit(v, next_idx, args...) 1728| 24.7k| : visit_maybe_relaxed_sub( 1729| 22.7k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 24.7k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 144| 2.03k| { 145| 2.03k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.03k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 1686| 20.0k| { 1687| 20.0k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 20.0k, False: 0] ------------------ 1688| 20.0k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 13.3k, False: 6.72k] ------------------ 1689| 20.0k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 20.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1698| 20.0k| { 1699| 20.0k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 20.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1717| 20.0k| { 1718| 20.0k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 20.0k, False: 0] ------------------ 1719| 20.0k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 13.3k, False: 6.72k] | Branch (1719:9): [True: 20.0k, False: 0] ------------------ 1720| 20.0k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 20.0k| auto child = node_->inner()[offset_hint]; 1722| 20.0k| auto is_leaf = shift_ == BL; 1723| 20.0k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 20.0k| auto next_idx = idx - left_size_hint; 1725| 20.0k| return is_leaf ------------------ | Branch (1725:16): [True: 5.08k, False: 14.9k] ------------------ 1726| 20.0k| ? make_leaf_sub_pos(child, next_size) 1727| 5.08k| .visit(v, next_idx, args...) 1728| 20.0k| : visit_maybe_relaxed_sub( 1729| 14.9k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 20.0k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 144| 5.08k| { 145| 5.08k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.08k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 14.9k|{ 1839| 14.9k| assert(node); ------------------ | Branch (1839:5): [True: 14.9k, False: 0] ------------------ 1840| 14.9k| auto relaxed = node->relaxed(); 1841| 14.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 11.3k, False: 3.59k] ------------------ 1842| 11.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 11.3k, False: 0] ------------------ 1843| 11.3k| return make_relaxed_pos(node, shift, relaxed) 1844| 11.3k| .visit(v, std::forward(args)...); 1845| 11.3k| } else { 1846| 3.59k| return make_regular_sub_pos(node, shift, size) 1847| 3.59k| .visit(v, std::forward(args)...); 1848| 3.59k| } 1849| 14.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1813| 11.3k| { 1814| 11.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 11.3k| } _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.59k| { 1037| 3.59k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.59k| } _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.79k| { 928| 6.79k| return towards_oh_ch_regular( 929| 6.79k| *this, v, idx, offset_hint, count(), args...); 930| 6.79k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_19slice_right_visitorISD_Lb0EEEJEEEDcOT_T0_mjjDpOT1_: 632| 6.79k|{ 633| 6.79k| constexpr auto B = bits; 634| 6.79k| constexpr auto BL = bits_leaf; 635| 6.79k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.79k, False: 0] ------------------ 636| 6.79k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.79k, False: 0] ------------------ 637| 6.79k| auto is_leaf = p.shift() == BL; 638| 6.79k| auto child = p.node()->inner()[offset_hint]; 639| 6.79k| auto is_full = offset_hint + 1 != count_hint; 640| 6.79k| return is_full ------------------ | Branch (640:12): [True: 2.73k, False: 4.06k] ------------------ 641| 6.79k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.64k, False: 1.09k] ------------------ 642| 2.73k| : make_full_pos(child, p.shift() - B) 643| 1.09k| .visit(v, idx, args...)) 644| 6.79k| : (is_leaf ------------------ | Branch (644:19): [True: 874, False: 3.18k] ------------------ 645| 4.06k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 4.06k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 3.18k| .visit(v, idx, args...)); 648| 6.79k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 207| 6.25k| { 208| 6.25k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 6.25k| } _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.66k| { 1406| 2.66k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.66k| } _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| 4.07k| { 1337| 4.07k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 4.07k, False: 0] ------------------ 1338| 4.07k| auto is_leaf = shift_ == BL; 1339| 4.07k| auto child = node_->inner()[offset_hint]; 1340| 4.07k| return is_leaf ------------------ | Branch (1340:16): [True: 2.96k, False: 1.11k] ------------------ 1341| 4.07k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 4.07k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 4.07k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 1161| 148k| 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| 1.95k| { 113| 1.95k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.95k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 336| 4.30k| { 337| 4.30k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 4.30k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_: 305| 4.30k| { 306| 4.30k| return towards_oh_ch_regular( 307| 4.30k| *this, v, idx, offset_hint, count(), args...); 308| 4.30k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_19slice_right_visitorISD_Lb0EEEJEEEDcOT_T0_mjjDpOT1_: 632| 4.30k|{ 633| 4.30k| constexpr auto B = bits; 634| 4.30k| constexpr auto BL = bits_leaf; 635| 4.30k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 4.30k, False: 0] ------------------ 636| 4.30k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 4.30k, False: 0] ------------------ 637| 4.30k| auto is_leaf = p.shift() == BL; 638| 4.30k| auto child = p.node()->inner()[offset_hint]; 639| 4.30k| auto is_full = offset_hint + 1 != count_hint; 640| 4.30k| return is_full ------------------ | Branch (640:12): [True: 2.11k, False: 2.19k] ------------------ 641| 4.30k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.65k, False: 460] ------------------ 642| 2.11k| : make_full_pos(child, p.shift() - B) 643| 460| .visit(v, idx, args...)) 644| 4.30k| : (is_leaf ------------------ | Branch (644:19): [True: 1.07k, False: 1.11k] ------------------ 645| 2.19k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.19k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.11k| .visit(v, idx, args...)); 648| 4.30k|} _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.56k| { 1037| 6.56k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.56k| } _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.35k| { 928| 3.35k| return towards_oh_ch_regular( 929| 3.35k| *this, v, idx, offset_hint, count(), args...); 930| 3.35k| } _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.35k|{ 633| 3.35k| constexpr auto B = bits; 634| 3.35k| constexpr auto BL = bits_leaf; 635| 3.35k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.35k, False: 0] ------------------ 636| 3.35k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.35k, False: 0] ------------------ 637| 3.35k| auto is_leaf = p.shift() == BL; 638| 3.35k| auto child = p.node()->inner()[offset_hint]; 639| 3.35k| auto is_full = offset_hint + 1 != count_hint; 640| 3.35k| return is_full ------------------ | Branch (640:12): [True: 2.69k, False: 661] ------------------ 641| 3.35k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 765, False: 1.92k] ------------------ 642| 2.69k| : make_full_pos(child, p.shift() - B) 643| 1.92k| .visit(v, idx, args...)) 644| 3.35k| : (is_leaf ------------------ | Branch (644:19): [True: 661, False: 0] ------------------ 645| 661| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 661| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 3.35k|} _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.28k| { 208| 1.28k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.28k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1405| 2.48k| { 1406| 2.48k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.48k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_: 1336| 1.07k| { 1337| 1.07k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.07k, False: 0] ------------------ 1338| 1.07k| auto is_leaf = shift_ == BL; 1339| 1.07k| auto child = node_->inner()[offset_hint]; 1340| 1.07k| return is_leaf ------------------ | Branch (1340:16): [True: 517, False: 554] ------------------ 1341| 1.07k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.07k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.07k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 112| 661| { 113| 661| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 661| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcPT_jmT0_DpOT1_: 1838| 21.3k|{ 1839| 21.3k| assert(node); ------------------ | Branch (1839:5): [True: 21.3k, False: 0] ------------------ 1840| 21.3k| auto relaxed = node->relaxed(); 1841| 21.3k| if (relaxed) { ------------------ | Branch (1841:9): [True: 14.6k, False: 6.71k] ------------------ 1842| 14.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 14.6k, False: 0] ------------------ 1843| 14.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 14.6k| .visit(v, std::forward(args)...); 1845| 14.6k| } else { 1846| 6.71k| return make_regular_sub_pos(node, shift, size) 1847| 6.71k| .visit(v, std::forward(args)...); 1848| 6.71k| } 1849| 21.3k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_: 1813| 14.6k| { 1814| 14.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 14.6k| } _ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8subindexEm: 1434| 8.85M| 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.19k| { 1706| 4.19k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 4.19k, False: 0] ------------------ 1707| 4.19k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 3.52k, False: 673] ------------------ 1708| 4.19k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 4.19k| } _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.19k| { 1718| 4.19k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 4.19k, False: 0] ------------------ 1719| 4.19k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.52k, False: 673] | Branch (1719:9): [True: 4.19k, False: 0] ------------------ 1720| 4.19k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 4.19k| auto child = node_->inner()[offset_hint]; 1722| 4.19k| auto is_leaf = shift_ == BL; 1723| 4.19k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 4.19k| auto next_idx = idx - left_size_hint; 1725| 4.19k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 4.19k] ------------------ 1726| 4.19k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 4.19k| : visit_maybe_relaxed_sub( 1729| 4.19k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 4.19k| } _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| 51.4k| { 1706| 51.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 51.4k, False: 0] ------------------ 1707| 51.4k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 14.6k, False: 36.7k] ------------------ 1708| 51.4k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 51.4k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_: 1717| 51.4k| { 1718| 51.4k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 51.4k, False: 0] ------------------ 1719| 51.4k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 14.6k, False: 36.7k] | Branch (1719:9): [True: 51.4k, False: 0] ------------------ 1720| 51.4k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 51.4k| auto child = node_->inner()[offset_hint]; 1722| 51.4k| auto is_leaf = shift_ == BL; 1723| 51.4k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 51.4k| auto next_idx = idx - left_size_hint; 1725| 51.4k| return is_leaf ------------------ | Branch (1725:16): [True: 7.99k, False: 43.4k] ------------------ 1726| 51.4k| ? make_leaf_sub_pos(child, next_size) 1727| 7.99k| .visit(v, next_idx, args...) 1728| 51.4k| : visit_maybe_relaxed_sub( 1729| 43.4k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 51.4k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 144| 7.99k| { 145| 7.99k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 7.99k| } _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| 43.4k|{ 1839| 43.4k| assert(node); ------------------ | Branch (1839:5): [True: 43.4k, False: 0] ------------------ 1840| 43.4k| auto relaxed = node->relaxed(); 1841| 43.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 40.9k, False: 2.46k] ------------------ 1842| 40.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 40.9k, False: 0] ------------------ 1843| 40.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 40.9k| .visit(v, std::forward(args)...); 1845| 40.9k| } else { 1846| 2.46k| return make_regular_sub_pos(node, shift, size) 1847| 2.46k| .visit(v, std::forward(args)...); 1848| 2.46k| } 1849| 43.4k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_: 1813| 40.9k| { 1814| 40.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 40.9k| } _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.46k| { 1037| 2.46k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.46k| } _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE11size_beforeEj: 791| 204k| { 792| 204k| return size_t{offset} << shift_; 793| 204k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8size_sbhEjm: 803| 27.0k| { 804| 27.0k| assert(size_before_hint == size_before(offset)); ------------------ | Branch (804:9): [True: 27.0k, False: 0] ------------------ 805| 27.0k| return offset == subindex(size_ - 1) ? size_ - size_before_hint ------------------ | Branch (805:16): [True: 15.1k, False: 11.8k] ------------------ 806| 27.0k| : size_t{1} << shift_; 807| 27.0k| } _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.94k| { 947| 7.94k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 7.94k| } _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.94k|{ 654| 7.94k| constexpr auto B = bits; 655| 7.94k| constexpr auto BL = bits_leaf; 656| 7.94k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 7.94k, False: 0] ------------------ 657| 7.94k| auto is_leaf = p.shift() == BL; 658| 7.94k| auto child = p.node()->inner()[offset_hint]; 659| 7.94k| auto lsize = offset_hint << p.shift(); 660| 7.94k| auto size = p.this_size(); 661| 7.94k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 7.94k| return is_full ------------------ | Branch (662:12): [True: 7.94k, False: 0] ------------------ 663| 7.94k| ? (is_leaf ------------------ | Branch (663:19): [True: 4.26k, False: 3.68k] ------------------ 664| 7.94k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 7.94k| : make_full_pos(child, p.shift() - B) 666| 3.68k| .visit(v, idx - lsize, args...)) 667| 7.94k| : (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.94k|} _ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9this_sizeEv: 794| 27.0k| size_t this_size() const { return size_; } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJmEEEDcT_DpOT0_: 207| 9.18k| { 208| 9.18k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 9.18k| } _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.75k| { 1406| 5.75k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 5.75k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8subindexEm: 1163| 19.3k| 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.6k| { 1171| 38.6k| return size_t{offset} << shift_; 1172| 38.6k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8size_sbhEjm: 1166| 19.3k| { 1167| 19.3k| return size_t{1} << shift_; 1168| 19.3k| } _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.99k| { 1349| 6.99k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 6.99k, False: 0] ------------------ 1350| 6.99k| auto is_leaf = shift_ == BL; 1351| 6.99k| auto child = node_->inner()[offset_hint]; 1352| 6.99k| auto lsize = size_t{offset_hint} << shift_; 1353| 6.99k| return is_leaf ------------------ | Branch (1353:16): [True: 4.92k, False: 2.07k] ------------------ 1354| 6.99k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 6.99k| : make_full_pos(child, shift_ - B) 1356| 2.07k| .visit(v, idx - lsize, args...); 1357| 6.99k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10copy_sizesEjjmPm: 1175| 17.0k| { 1176| 17.0k| auto e = sizes + n; 1177| 41.6k| for (; sizes != e; ++sizes) { ------------------ | Branch (1177:16): [True: 24.6k, False: 17.0k] ------------------ 1178| 24.6k| init = *sizes = init + (size_t{1} << shift_); 1179| | assert(init); ------------------ | Branch (1179:13): [True: 24.6k, False: 0] ------------------ 1180| 24.6k| } 1181| 17.0k| } _ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 1160| 592k| 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| 249k| { 811| 249k| if (n) { ------------------ | Branch (811:13): [True: 243k, False: 5.23k] ------------------ 812| 243k| auto last = offset + n - 1; 813| 243k| auto e = sizes + n - 1; 814| 485k| for (; sizes != e; ++sizes) { ------------------ | Branch (814:20): [True: 241k, False: 243k] ------------------ 815| 241k| init = *sizes = init + (size_t{1} << shift_); 816| 241k| assert(init); ------------------ | Branch (816:17): [True: 241k, False: 0] ------------------ 817| 241k| } 818| 243k| *sizes = init + size(last); 819| | assert(*sizes); ------------------ | Branch (819:13): [True: 243k, False: 0] ------------------ 820| 243k| } 821| 249k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEj: 797| 258k| { 798| 258k| return offset == subindex(size_ - 1) ? size_ - size_before(offset) ------------------ | Branch (798:16): [True: 131k, False: 127k] ------------------ 799| 258k| : size_t{1} << shift_; 800| 258k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10copy_sizesEjjmPm: 1462| 4.19M| { 1463| 4.19M| auto e = sizes + n; 1464| 4.19M| auto prev = size_before(offset); 1465| 4.19M| auto these = relaxed_->d.sizes + offset; 1466| 11.9M| for (; sizes != e; ++sizes, ++these) { ------------------ | Branch (1466:16): [True: 7.80M, False: 4.19M] ------------------ 1467| 7.80M| auto this_size = *these; 1468| 7.80M| init = *sizes = init + (this_size - prev); 1469| 7.80M| assert(init); ------------------ | Branch (1469:13): [True: 7.80M, False: 0] ------------------ 1470| 7.80M| prev = this_size; 1471| 7.80M| } 1472| 4.19M| } _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.71k| { 1037| 6.71k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.71k| } _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.21k| { 947| 3.21k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 3.21k| } _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.21k|{ 654| 3.21k| constexpr auto B = bits; 655| 3.21k| constexpr auto BL = bits_leaf; 656| 3.21k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 3.21k, False: 0] ------------------ 657| 3.21k| auto is_leaf = p.shift() == BL; 658| 3.21k| auto child = p.node()->inner()[offset_hint]; 659| 3.21k| auto lsize = offset_hint << p.shift(); 660| 3.21k| auto size = p.this_size(); 661| 3.21k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 3.21k| return is_full ------------------ | Branch (662:12): [True: 1.24k, False: 1.97k] ------------------ 663| 3.21k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 1.24k] ------------------ 664| 1.24k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 1.24k| : make_full_pos(child, p.shift() - B) 666| 1.24k| .visit(v, idx - lsize, args...)) 667| 3.21k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 1.97k] ------------------ 668| 1.97k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 1.97k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 1.97k| .visit(v, idx - lsize, args...)); 672| 3.21k|} _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.57k| { 1406| 1.57k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.57k| } _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| 327| { 1349| 327| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 327, False: 0] ------------------ 1350| 327| auto is_leaf = shift_ == BL; 1351| 327| auto child = node_->inner()[offset_hint]; 1352| 327| auto lsize = size_t{offset_hint} << shift_; 1353| 327| return is_leaf ------------------ | Branch (1353:16): [True: 0, False: 327] ------------------ 1354| 327| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 327| : make_full_pos(child, shift_ - B) 1356| 327| .visit(v, idx - lsize, args...); 1357| 327| } _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| 1.97k| { 1037| 1.97k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.97k| } _ZN5immer6detail4rbts30make_singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEDaPT_j: 766| 7.74k|{ 767| 7.74k| assert(leaf); ------------------ | Branch (767:5): [True: 7.74k, False: 0] ------------------ 768| 7.74k| IMMER_ASSERT_TAGGED(leaf->kind() == NodeT::kind_t::leaf); ------------------ | | 68| 7.74k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (768:5): [True: 7.74k, False: 0] ------------------ 769| 7.74k| assert(count > 0); ------------------ | Branch (769:5): [True: 7.74k, False: 0] ------------------ 770| 7.74k| return singleton_regular_sub_pos{leaf, count}; 771| 7.74k|} _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.74k| { 760| 7.74k| return Visitor::visit_regular(*this, std::forward(args)...); 761| 7.74k| } _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.74k|{ 1839| 7.74k| assert(node); ------------------ | Branch (1839:5): [True: 7.74k, False: 0] ------------------ 1840| 7.74k| auto relaxed = node->relaxed(); 1841| 7.74k| if (relaxed) { ------------------ | Branch (1841:9): [True: 5.49k, False: 2.25k] ------------------ 1842| 5.49k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 5.49k, False: 0] ------------------ 1843| 5.49k| return make_relaxed_pos(node, shift, relaxed) 1844| 5.49k| .visit(v, std::forward(args)...); 1845| 5.49k| } else { 1846| 2.25k| return make_regular_sub_pos(node, shift, size) 1847| 2.25k| .visit(v, std::forward(args)...); 1848| 2.25k| } 1849| 7.74k|} _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.49k| { 1814| 5.49k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 5.49k| } _ZNK5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 735| 26.3k| 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.74k| { 745| 7.74k| } _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.15M| { 145| 2.15M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.15M| } _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| 18.9M| { 1814| 18.9M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 18.9M| } _ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_: 707| 2.07M| { 708| 2.07M| } _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.74k| { 745| 7.74k| } _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.15M| { 145| 2.15M| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 2.15M| } _ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 137| 2.15M| 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| 18.9M| { 1814| 18.9M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 18.9M| } _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.07M| { 708| 2.07M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1762| 17.5k| { 1763| 17.5k| auto child = node_->inner()[0]; 1764| 17.5k| auto child_size = relaxed_->d.sizes[0]; 1765| 17.5k| auto is_leaf = shift_ == BL; 1766| 17.5k| assert(child_size); ------------------ | Branch (1766:9): [True: 17.5k, False: 0] ------------------ 1767| 17.5k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 17.5k] ------------------ 1768| 17.5k| : visit_maybe_relaxed_sub( 1769| 17.5k| child, shift_ - B, child_size, v, args...); 1770| 17.5k| } _ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 76| 7.74k| 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.77M| shift_t shift() const { return 0; } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 17.5k|{ 1839| 17.5k| assert(node); ------------------ | Branch (1839:5): [True: 17.5k, False: 0] ------------------ 1840| 17.5k| auto relaxed = node->relaxed(); 1841| 17.5k| if (relaxed) { ------------------ | Branch (1841:9): [True: 17.1k, False: 397] ------------------ 1842| 17.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 17.1k, False: 0] ------------------ 1843| 17.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 17.1k| .visit(v, std::forward(args)...); 1845| 17.1k| } else { 1846| 397| return make_regular_sub_pos(node, shift, size) 1847| 397| .visit(v, std::forward(args)...); 1848| 397| } 1849| 17.5k|} _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.1k| { 1814| 17.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 17.1k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1036| 397| { 1037| 397| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 397| } _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| 664| { 971| 664| auto is_leaf = shift_ == BL; 972| 664| auto child = node_->inner()[0]; 973| 664| auto is_full = size_ >= (size_t{1} << shift_); 974| 664| return is_full ------------------ | Branch (974:16): [True: 664, False: 0] ------------------ 975| 664| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 664] ------------------ 976| 664| ? make_full_leaf_pos(child).visit(v, args...) 977| 664| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 664| : (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| 664| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 201| 136k| 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.02k| { 1406| 1.02k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.02k| } _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| 365| { 1362| 365| auto is_leaf = shift_ == BL; 1363| 365| auto child = node_->inner()[0]; 1364| 365| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 365] ------------------ 1365| 365| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 365| } _ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_: 711| 109k| { 712| 109k| } _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| 105k| { 1305| 105k| each_i(v, 1, branches, args...); 1306| 105k| } _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| 105k| { 1264| 105k| auto p = node_->inner() + i; 1265| 105k| auto e = node_->inner() + n; 1266| 105k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 54.8k, False: 50.2k] ------------------ 1267| 219k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 164k, False: 54.8k] ------------------ 1268| 164k| IMMER_PREFETCH(p + 1); 1269| 164k| make_full_leaf_pos(*p).visit(v, args...); 1270| 164k| } 1271| 54.8k| } else { 1272| 50.2k| auto ss = shift_ - B; 1273| 200k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 150k, False: 50.2k] ------------------ 1274| 150k| make_full_pos(*p, ss).visit(v, args...); 1275| 50.2k| } 1276| 105k| } _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| 987k| { 208| 987k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 987k| } _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| 585k| { 1406| 585k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 585k| } _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| 109k| { 712| 109k| } _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| 105k| { 1305| 105k| each_i(v, 1, branches, args...); 1306| 105k| } _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| 105k| { 1264| 105k| auto p = node_->inner() + i; 1265| 105k| auto e = node_->inner() + n; 1266| 105k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 54.8k, False: 50.2k] ------------------ 1267| 219k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 164k, False: 54.8k] ------------------ 1268| 164k| IMMER_PREFETCH(p + 1); 1269| 164k| make_full_leaf_pos(*p).visit(v, args...); 1270| 164k| } 1271| 54.8k| } else { 1272| 50.2k| auto ss = shift_ - B; 1273| 200k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 150k, False: 50.2k] ------------------ 1274| 150k| make_full_pos(*p, ss).visit(v, args...); 1275| 50.2k| } 1276| 105k| } _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| 987k| { 208| 987k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 987k| } _ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE4sizeEv: 200| 987k| 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| 585k| { 1406| 585k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 585k| } _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| 664| { 754| 664| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 664| } _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| 664| { 145| 664| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 664| } _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| 664| { 1371| 664| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 664, False: 0] ------------------ 1372| 664| auto child = node_->inner()[0]; 1373| 664| return make_full_leaf_pos(child).visit(v, args...); 1374| 664| } _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.64k| { 208| 2.64k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 2.64k| } _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| 136k| { 907| 136k| if (count() > 1) ------------------ | Branch (907:13): [True: 127k, False: 9.30k] ------------------ 908| 127k| each_right_sub_(v, 1, args...); 909| 136k| } _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| 127k| { 880| 127k| auto last = count() - 1; 881| 127k| auto lsize = size_ - (last << shift_); 882| 127k| auto n = node()->inner() + i; 883| 127k| auto e = node()->inner() + last; 884| 127k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 72.4k, False: 54.8k] ------------------ 885| 213k| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 140k, False: 72.4k] ------------------ 886| 140k| IMMER_PREFETCH(n + 1); 887| 140k| make_full_leaf_pos(*n).visit(v, args...); 888| 140k| } 889| 72.4k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 72.4k| } else { 891| 54.8k| auto ss = shift_ - B; 892| 140k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 85.2k, False: 54.8k] ------------------ 893| 85.2k| make_full_pos(*n, ss).visit(v, args...); 894| 54.8k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 54.8k| } 896| 127k| } _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| 621k| { 1037| 621k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 621k| } _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| 136k| { 907| 136k| if (count() > 1) ------------------ | Branch (907:13): [True: 127k, False: 9.30k] ------------------ 908| 127k| each_right_sub_(v, 1, args...); 909| 136k| } _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| 127k| { 880| 127k| auto last = count() - 1; 881| 127k| auto lsize = size_ - (last << shift_); 882| 127k| auto n = node()->inner() + i; 883| 127k| auto e = node()->inner() + last; 884| 127k| if (shift() == BL) { ------------------ | Branch (884:13): [True: 72.4k, False: 54.8k] ------------------ 885| 213k| for (; n != e; ++n) { ------------------ | Branch (885:20): [True: 140k, False: 72.4k] ------------------ 886| 140k| IMMER_PREFETCH(n + 1); 887| 140k| make_full_leaf_pos(*n).visit(v, args...); 888| 140k| } 889| 72.4k| make_leaf_sub_pos(*n, lsize).visit(v, args...); 890| 72.4k| } else { 891| 54.8k| auto ss = shift_ - B; 892| 140k| for (; n != e; ++n) ------------------ | Branch (892:20): [True: 85.2k, False: 54.8k] ------------------ 893| 85.2k| make_full_pos(*n, ss).visit(v, args...); 894| 54.8k| make_regular_sub_pos(*n, ss, lsize).visit(v, args...); 895| 54.8k| } 896| 127k| } _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| 621k| { 1037| 621k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 621k| } _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.98k| { 754| 1.98k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 1.98k| } _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.98k| { 145| 1.98k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.98k| } _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.98k| { 987| 1.98k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 1.98k, False: 0] ------------------ 988| 1.98k| auto child = node_->inner()[0]; 989| 1.98k| auto is_full = size_ >= branches; 990| 1.98k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 1.98k, False: 0] ------------------ 991| 1.98k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 1.98k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 144| 5.09k| { 145| 5.09k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.09k| } _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.74M| { 1648| 2.74M| each_right(v, 1, std::forward(args)...); 1649| 2.74M| } _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.74M| { 1654| 2.74M| assert(start > 0); ------------------ | Branch (1654:9): [True: 2.74M, False: 0] ------------------ 1655| 2.74M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 2.74M, False: 0] ------------------ 1656| 2.74M| auto s = relaxed_->d.sizes[start - 1]; 1657| 2.74M| auto p = node_->inner(); 1658| 2.74M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 341k, False: 2.40M] ------------------ 1659| 863k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 522k, False: 341k] ------------------ 1660| 522k| IMMER_PREFETCH(p + i + 1); 1661| 522k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 522k| .visit(v, args...); 1663| 522k| s = relaxed_->d.sizes[i]; 1664| 522k| assert(s); ------------------ | Branch (1664:17): [True: 522k, False: 0] ------------------ 1665| 522k| } 1666| 2.40M| } else { 1667| 2.40M| auto ss = shift_ - B; 1668| 8.51M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 6.10M, False: 2.40M] ------------------ 1669| 6.10M| visit_maybe_relaxed_sub( 1670| 6.10M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 6.10M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 6.10M, False: 0] ------------------ 1673| 6.10M| } 1674| 2.40M| } 1675| 2.74M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEDcPT_jmT0_DpOT1_: 1838| 12.4M|{ 1839| 12.4M| assert(node); ------------------ | Branch (1839:5): [True: 12.4M, False: 0] ------------------ 1840| 12.4M| auto relaxed = node->relaxed(); 1841| 12.4M| if (relaxed) { ------------------ | Branch (1841:9): [True: 11.8M, False: 566k] ------------------ 1842| 11.8M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 11.8M, False: 0] ------------------ 1843| 11.8M| return make_relaxed_pos(node, shift, relaxed) 1844| 11.8M| .visit(v, std::forward(args)...); 1845| 11.8M| } else { 1846| 566k| return make_regular_sub_pos(node, shift, size) 1847| 566k| .visit(v, std::forward(args)...); 1848| 566k| } 1849| 12.4M|} _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.74M| { 1648| 2.74M| each_right(v, 1, std::forward(args)...); 1649| 2.74M| } _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.74M| { 1654| 2.74M| assert(start > 0); ------------------ | Branch (1654:9): [True: 2.74M, False: 0] ------------------ 1655| 2.74M| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 2.74M, False: 0] ------------------ 1656| 2.74M| auto s = relaxed_->d.sizes[start - 1]; 1657| 2.74M| auto p = node_->inner(); 1658| 2.74M| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 341k, False: 2.40M] ------------------ 1659| 863k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 522k, False: 341k] ------------------ 1660| 522k| IMMER_PREFETCH(p + i + 1); 1661| 522k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 522k| .visit(v, args...); 1663| 522k| s = relaxed_->d.sizes[i]; 1664| 522k| assert(s); ------------------ | Branch (1664:17): [True: 522k, False: 0] ------------------ 1665| 522k| } 1666| 2.40M| } else { 1667| 2.40M| auto ss = shift_ - B; 1668| 8.51M| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 6.10M, False: 2.40M] ------------------ 1669| 6.10M| visit_maybe_relaxed_sub( 1670| 6.10M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 6.10M| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 6.10M, False: 0] ------------------ 1673| 6.10M| } 1674| 2.40M| } 1675| 2.74M| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 12.4M|{ 1839| 12.4M| assert(node); ------------------ | Branch (1839:5): [True: 12.4M, False: 0] ------------------ 1840| 12.4M| auto relaxed = node->relaxed(); 1841| 12.4M| if (relaxed) { ------------------ | Branch (1841:9): [True: 11.8M, False: 566k] ------------------ 1842| 11.8M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 11.8M, False: 0] ------------------ 1843| 11.8M| return make_relaxed_pos(node, shift, relaxed) 1844| 11.8M| .visit(v, std::forward(args)...); 1845| 11.8M| } else { 1846| 566k| return make_regular_sub_pos(node, shift, size) 1847| 566k| .visit(v, std::forward(args)...); 1848| 566k| } 1849| 12.4M|} _ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 753| 5.09k| { 754| 5.09k| return make_leaf_sub_pos(leaf_, count_).visit(v, args...); 755| 5.09k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 144| 5.09k| { 145| 5.09k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 5.09k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_: 1774| 5.09k| { 1775| 5.09k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 5.09k, False: 0] ------------------ 1776| 5.09k| auto child = node_->inner()[0]; 1777| 5.09k| auto child_size = relaxed_->d.sizes[0]; 1778| 5.09k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 5.09k| } _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.25k| { 1037| 2.25k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.25k| } _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| 469k|{ 1839| 469k| assert(node); ------------------ | Branch (1839:5): [True: 469k, False: 0] ------------------ 1840| 469k| auto relaxed = node->relaxed(); 1841| 469k| if (relaxed) { ------------------ | Branch (1841:9): [True: 455k, False: 13.9k] ------------------ 1842| 455k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 455k, False: 0] ------------------ 1843| 455k| return make_relaxed_pos(node, shift, relaxed) 1844| 455k| .visit(v, std::forward(args)...); 1845| 455k| } else { 1846| 13.9k| return make_regular_sub_pos(node, shift, size) 1847| 13.9k| .visit(v, std::forward(args)...); 1848| 13.9k| } 1849| 469k|} _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| 455k| { 1814| 455k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 455k| } _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| 455k|{ 1839| 455k| assert(node); ------------------ | Branch (1839:5): [True: 455k, False: 0] ------------------ 1840| 455k| auto relaxed = node->relaxed(); 1841| 455k| if (relaxed) { ------------------ | Branch (1841:9): [True: 439k, False: 16.6k] ------------------ 1842| 439k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 439k, False: 0] ------------------ 1843| 439k| return make_relaxed_pos(node, shift, relaxed) 1844| 439k| .visit(v, std::forward(args)...); 1845| 439k| } else { 1846| 16.6k| return make_regular_sub_pos(node, shift, size) 1847| 16.6k| .visit(v, std::forward(args)...); 1848| 16.6k| } 1849| 455k|} _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| 439k| { 1814| 439k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 439k| } _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| 1.99M| { 1751| 1.99M| auto offset = relaxed_->d.count - 1; 1752| 1.99M| auto child = node_->inner()[offset]; 1753| 1.99M| auto child_size = size(offset); 1754| 1.99M| auto is_leaf = shift_ == BL; 1755| 1.99M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 1.99M] ------------------ 1756| 1.99M| : visit_maybe_relaxed_sub( 1757| 1.99M| child, shift_ - B, child_size, v, args...); 1758| 1.99M| } _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| 1.99M|{ 1839| 1.99M| assert(node); ------------------ | Branch (1839:5): [True: 1.99M, False: 0] ------------------ 1840| 1.99M| auto relaxed = node->relaxed(); 1841| 1.99M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.99M, False: 1.93k] ------------------ 1842| 1.99M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.99M, False: 0] ------------------ 1843| 1.99M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.99M| .visit(v, std::forward(args)...); 1845| 1.99M| } else { 1846| 1.93k| return make_regular_sub_pos(node, shift, size) 1847| 1.93k| .visit(v, std::forward(args)...); 1848| 1.93k| } 1849| 1.99M|} _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| 1.99M| { 1814| 1.99M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.99M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 1036| 4.99k| { 1037| 4.99k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.99k| } _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.05k| { 959| 3.05k| auto offset = count() - 1; 960| 3.05k| auto child = node_->inner()[offset]; 961| 3.05k| auto is_leaf = shift_ == BL; 962| 3.05k| auto lsize = size_ - (size_t{offset} << shift_); 963| 3.05k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 3.05k] ------------------ 964| 3.05k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 3.05k| .visit(v, args...); 966| 3.05k| } _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| 811k| { 914| 811k| each_left(v, count() - 1, args...); 915| 811k| } _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| 811k| { 874| 811k| return each_left_regular(*this, v, last, args...); 875| 811k| } _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| 811k|{ 576| 811k| constexpr auto B = bits; 577| 811k| constexpr auto BL = bits_leaf; 578| 811k| assert(last < p.count()); ------------------ | Branch (578:5): [True: 811k, False: 0] ------------------ 579| 811k| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 394k, False: 416k] ------------------ 580| 394k| auto n = p.node()->inner(); 581| 394k| auto e = n + last; 582| 1.07M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 681k, False: 394k] ------------------ 583| 681k| IMMER_PREFETCH(n + 1); 584| 681k| make_full_leaf_pos(*n).visit(v, args...); 585| 681k| } 586| 416k| } else { 587| 416k| auto n = p.node()->inner(); 588| 416k| auto e = n + last; 589| 416k| auto ss = p.shift() - B; 590| 766k| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 350k, False: 416k] ------------------ 591| 350k| make_full_pos(*n, ss).visit(v, args...); 592| 416k| } 593| 811k|} _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| 811k| { 914| 811k| each_left(v, count() - 1, args...); 915| 811k| } _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| 811k| { 874| 811k| return each_left_regular(*this, v, last, args...); 875| 811k| } _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| 811k|{ 576| 811k| constexpr auto B = bits; 577| 811k| constexpr auto BL = bits_leaf; 578| 811k| assert(last < p.count()); ------------------ | Branch (578:5): [True: 811k, False: 0] ------------------ 579| 811k| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 394k, False: 416k] ------------------ 580| 394k| auto n = p.node()->inner(); 581| 394k| auto e = n + last; 582| 1.07M| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 681k, False: 394k] ------------------ 583| 681k| IMMER_PREFETCH(n + 1); 584| 681k| make_full_leaf_pos(*n).visit(v, args...); 585| 681k| } 586| 416k| } else { 587| 416k| auto n = p.node()->inner(); 588| 416k| auto e = n + last; 589| 416k| auto ss = p.shift() - B; 590| 766k| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 350k, False: 416k] ------------------ 591| 350k| make_full_pos(*n, ss).visit(v, args...); 592| 416k| } 593| 811k|} _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| 704k| { 1763| 704k| auto child = node_->inner()[0]; 1764| 704k| auto child_size = relaxed_->d.sizes[0]; 1765| 704k| auto is_leaf = shift_ == BL; 1766| 704k| assert(child_size); ------------------ | Branch (1766:9): [True: 704k, False: 0] ------------------ 1767| 704k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 704k] ------------------ 1768| 704k| : visit_maybe_relaxed_sub( 1769| 704k| child, shift_ - B, child_size, v, args...); 1770| 704k| } _ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5shiftEv: 106| 469k| 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| 704k|{ 1839| 704k| assert(node); ------------------ | Branch (1839:5): [True: 704k, False: 0] ------------------ 1840| 704k| auto relaxed = node->relaxed(); 1841| 704k| if (relaxed) { ------------------ | Branch (1841:9): [True: 596k, False: 108k] ------------------ 1842| 596k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 596k, False: 0] ------------------ 1843| 596k| return make_relaxed_pos(node, shift, relaxed) 1844| 596k| .visit(v, std::forward(args)...); 1845| 596k| } else { 1846| 108k| return make_regular_sub_pos(node, shift, size) 1847| 108k| .visit(v, std::forward(args)...); 1848| 108k| } 1849| 704k|} _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| 596k| { 1814| 596k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 596k| } _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| 108k| { 1037| 108k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 108k| } _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| 741| { 959| 741| auto offset = count() - 1; 960| 741| auto child = node_->inner()[offset]; 961| 741| auto is_leaf = shift_ == BL; 962| 741| auto lsize = size_ - (size_t{offset} << shift_); 963| 741| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 0, False: 741] ------------------ 964| 741| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 741| .visit(v, args...); 966| 741| } _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.15k| { 1037| 1.15k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.15k| } _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| 52.2k| { 971| 52.2k| auto is_leaf = shift_ == BL; 972| 52.2k| auto child = node_->inner()[0]; 973| 52.2k| auto is_full = size_ >= (size_t{1} << shift_); 974| 52.2k| return is_full ------------------ | Branch (974:16): [True: 52.2k, False: 0] ------------------ 975| 52.2k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 52.2k] ------------------ 976| 52.2k| ? make_full_leaf_pos(child).visit(v, args...) 977| 52.2k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 52.2k| : (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| 52.2k| } _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| 100k| { 1406| 100k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 100k| } _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| 47.9k| { 1362| 47.9k| auto is_leaf = shift_ == BL; 1363| 47.9k| auto child = node_->inner()[0]; 1364| 47.9k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 47.9k] ------------------ 1365| 47.9k| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 47.9k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 958| 99.8k| { 959| 99.8k| auto offset = count() - 1; 960| 99.8k| auto child = node_->inner()[offset]; 961| 99.8k| auto is_leaf = shift_ == BL; 962| 99.8k| auto lsize = size_ - (size_t{offset} << shift_); 963| 99.8k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 52.9k, False: 46.9k] ------------------ 964| 99.8k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 46.9k| .visit(v, args...); 966| 99.8k| } _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| 54.1k| { 145| 54.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 54.1k| } _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| 54.1k| { 1371| 54.1k| assert(shift_ == BL); ------------------ | Branch (1371:9): [True: 54.1k, False: 0] ------------------ 1372| 54.1k| auto child = node_->inner()[0]; 1373| 54.1k| return make_full_leaf_pos(child).visit(v, args...); 1374| 54.1k| } _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| 133k| { 208| 133k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 133k| } _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| 47.6k| { 1037| 47.6k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 47.6k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_: 958| 114k| { 959| 114k| auto offset = count() - 1; 960| 114k| auto child = node_->inner()[offset]; 961| 114k| auto is_leaf = shift_ == BL; 962| 114k| auto lsize = size_ - (size_t{offset} << shift_); 963| 114k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 74.0k, False: 40.8k] ------------------ 964| 114k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 40.8k| .visit(v, args...); 966| 114k| } _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.7k| { 145| 79.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 79.7k| } _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.7k| { 987| 79.7k| assert(shift_ == BL); ------------------ | Branch (987:9): [True: 79.7k, False: 0] ------------------ 988| 79.7k| auto child = node_->inner()[0]; 989| 79.7k| auto is_full = size_ >= branches; 990| 79.7k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (990:16): [True: 79.7k, False: 0] ------------------ 991| 79.7k| : make_leaf_sub_pos(child, size_).visit(v, args...); 992| 79.7k| } _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| 335k| { 145| 335k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 335k| } _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| 51.6k| { 1037| 51.6k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 51.6k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_: 958| 592k| { 959| 592k| auto offset = count() - 1; 960| 592k| auto child = node_->inner()[offset]; 961| 592k| auto is_leaf = shift_ == BL; 962| 592k| auto lsize = size_ - (size_t{offset} << shift_); 963| 592k| return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...) ------------------ | Branch (963:16): [True: 267k, False: 324k] ------------------ 964| 592k| : make_regular_sub_pos(child, shift_ - B, lsize) 965| 324k| .visit(v, args...); 966| 592k| } _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| 335k| { 145| 335k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 335k| } _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| 335k| { 1775| 335k| assert(shift_ == BL); ------------------ | Branch (1775:9): [True: 335k, False: 0] ------------------ 1776| 335k| auto child = node_->inner()[0]; 1777| 335k| auto child_size = relaxed_->d.sizes[0]; 1778| 335k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1779| 335k| } _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| 691k| { 1037| 691k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 691k| } _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.13M| { 1618| 4.13M| each_left(v, relaxed_->d.count - 1, args...); 1619| 4.13M| } _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.13M| { 1624| 4.13M| auto p = node_->inner(); 1625| 4.13M| auto s = size_t{}; 1626| 4.13M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 74.9k, False: 4.06M] ------------------ 1627| 214k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 140k, False: 74.9k] ------------------ 1628| 140k| IMMER_PREFETCH(p + i + 1); 1629| 140k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 140k| .visit(v, args...); 1631| 140k| s = relaxed_->d.sizes[i]; 1632| 140k| assert(s); ------------------ | Branch (1632:17): [True: 140k, False: 0] ------------------ 1633| 140k| } 1634| 4.06M| } else { 1635| 4.06M| auto ss = shift_ - B; 1636| 10.3M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 6.33M, False: 4.06M] ------------------ 1637| 6.33M| visit_maybe_relaxed_sub( 1638| 6.33M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 6.33M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 6.33M, False: 0] ------------------ 1641| 6.33M| } 1642| 4.06M| } 1643| 4.13M| } _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.13M| { 1618| 4.13M| each_left(v, relaxed_->d.count - 1, args...); 1619| 4.13M| } _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.13M| { 1624| 4.13M| auto p = node_->inner(); 1625| 4.13M| auto s = size_t{}; 1626| 4.13M| if (shift_ == BL) { ------------------ | Branch (1626:13): [True: 74.9k, False: 4.06M] ------------------ 1627| 214k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1627:39): [True: 140k, False: 74.9k] ------------------ 1628| 140k| IMMER_PREFETCH(p + i + 1); 1629| 140k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1630| 140k| .visit(v, args...); 1631| 140k| s = relaxed_->d.sizes[i]; 1632| 140k| assert(s); ------------------ | Branch (1632:17): [True: 140k, False: 0] ------------------ 1633| 140k| } 1634| 4.06M| } else { 1635| 4.06M| auto ss = shift_ - B; 1636| 10.3M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1636:39): [True: 6.33M, False: 4.06M] ------------------ 1637| 6.33M| visit_maybe_relaxed_sub( 1638| 6.33M| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1639| 6.33M| s = relaxed_->d.sizes[i]; 1640| | assert(s); ------------------ | Branch (1640:17): [True: 6.33M, False: 0] ------------------ 1641| 6.33M| } 1642| 4.06M| } 1643| 4.13M| } _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.68M| { 1763| 1.68M| auto child = node_->inner()[0]; 1764| 1.68M| auto child_size = relaxed_->d.sizes[0]; 1765| 1.68M| auto is_leaf = shift_ == BL; 1766| 1.68M| assert(child_size); ------------------ | Branch (1766:9): [True: 1.68M, False: 0] ------------------ 1767| 1.68M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1767:16): [True: 0, False: 1.68M] ------------------ 1768| 1.68M| : visit_maybe_relaxed_sub( 1769| 1.68M| child, shift_ - B, child_size, v, args...); 1770| 1.68M| } _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.68M|{ 1839| 1.68M| assert(node); ------------------ | Branch (1839:5): [True: 1.68M, False: 0] ------------------ 1840| 1.68M| auto relaxed = node->relaxed(); 1841| 1.68M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.68M, False: 2.17k] ------------------ 1842| 1.68M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.68M, False: 0] ------------------ 1843| 1.68M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.68M| .visit(v, std::forward(args)...); 1845| 1.68M| } else { 1846| 2.17k| return make_regular_sub_pos(node, shift, size) 1847| 2.17k| .visit(v, std::forward(args)...); 1848| 2.17k| } 1849| 1.68M|} _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.68M| { 1814| 1.68M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.68M| } _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| 2.17k| { 1037| 2.17k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.17k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1750| 70.6k| { 1751| 70.6k| auto offset = relaxed_->d.count - 1; 1752| 70.6k| auto child = node_->inner()[offset]; 1753| 70.6k| auto child_size = size(offset); 1754| 70.6k| auto is_leaf = shift_ == BL; 1755| 70.6k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 0, False: 70.6k] ------------------ 1756| 70.6k| : visit_maybe_relaxed_sub( 1757| 70.6k| child, shift_ - B, child_size, v, args...); 1758| 70.6k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 70.6k|{ 1839| 70.6k| assert(node); ------------------ | Branch (1839:5): [True: 70.6k, False: 0] ------------------ 1840| 70.6k| auto relaxed = node->relaxed(); 1841| 70.6k| if (relaxed) { ------------------ | Branch (1841:9): [True: 70.2k, False: 417] ------------------ 1842| 70.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 70.2k, False: 0] ------------------ 1843| 70.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 70.2k| .visit(v, std::forward(args)...); 1845| 70.2k| } else { 1846| 417| return make_regular_sub_pos(node, shift, size) 1847| 417| .visit(v, std::forward(args)...); 1848| 417| } 1849| 70.6k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_: 1813| 70.2k| { 1814| 70.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 70.2k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 970| 1.94k| { 971| 1.94k| auto is_leaf = shift_ == BL; 972| 1.94k| auto child = node_->inner()[0]; 973| 1.94k| auto is_full = size_ >= (size_t{1} << shift_); 974| 1.94k| return is_full ------------------ | Branch (974:16): [True: 1.94k, False: 0] ------------------ 975| 1.94k| ? (is_leaf ------------------ | Branch (975:23): [True: 0, False: 1.94k] ------------------ 976| 1.94k| ? make_full_leaf_pos(child).visit(v, args...) 977| 1.94k| : make_full_pos(child, shift_ - B).visit(v, args...)) 978| 1.94k| : (is_leaf ------------------ | Branch (978:23): [True: 0, False: 0] ------------------ 979| 0| ? make_leaf_sub_pos(child, size_).visit(v, args...) 980| 0| : make_regular_sub_pos(child, shift_ - B, size_) 981| 0| .visit(v, args...)); 982| 1.94k| } _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| 3.87k| { 1406| 3.87k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.87k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1361| 1.93k| { 1362| 1.93k| auto is_leaf = shift_ == BL; 1363| 1.93k| auto child = node_->inner()[0]; 1364| 1.93k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1364:16): [True: 0, False: 1.93k] ------------------ 1365| 1.93k| : make_full_pos(child, shift_ - B).visit(v, args...); 1366| 1.93k| } _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| 3.61k| { 1751| 3.61k| auto offset = relaxed_->d.count - 1; 1752| 3.61k| auto child = node_->inner()[offset]; 1753| 3.61k| auto child_size = size(offset); 1754| 3.61k| auto is_leaf = shift_ == BL; 1755| 3.61k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 1.27k, False: 2.33k] ------------------ 1756| 3.61k| : visit_maybe_relaxed_sub( 1757| 2.33k| child, shift_ - B, child_size, v, args...); 1758| 3.61k| } _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| 2.33k|{ 1839| 2.33k| assert(node); ------------------ | Branch (1839:5): [True: 2.33k, False: 0] ------------------ 1840| 2.33k| auto relaxed = node->relaxed(); 1841| 2.33k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.67k, False: 665] ------------------ 1842| 1.67k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.67k, False: 0] ------------------ 1843| 1.67k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.67k| .visit(v, std::forward(args)...); 1845| 1.67k| } else { 1846| 665| return make_regular_sub_pos(node, shift, size) 1847| 665| .visit(v, std::forward(args)...); 1848| 665| } 1849| 2.33k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_: 1813| 1.67k| { 1814| 1.67k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.67k| } _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| 17.7k| { 1751| 17.7k| auto offset = relaxed_->d.count - 1; 1752| 17.7k| auto child = node_->inner()[offset]; 1753| 17.7k| auto child_size = size(offset); 1754| 17.7k| auto is_leaf = shift_ == BL; 1755| 17.7k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 5.69k, False: 12.0k] ------------------ 1756| 17.7k| : visit_maybe_relaxed_sub( 1757| 12.0k| child, shift_ - B, child_size, v, args...); 1758| 17.7k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 12.0k|{ 1839| 12.0k| assert(node); ------------------ | Branch (1839:5): [True: 12.0k, False: 0] ------------------ 1840| 12.0k| auto relaxed = node->relaxed(); 1841| 12.0k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.24k, False: 10.8k] ------------------ 1842| 1.24k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.24k, False: 0] ------------------ 1843| 1.24k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.24k| .visit(v, std::forward(args)...); 1845| 10.8k| } else { 1846| 10.8k| return make_regular_sub_pos(node, shift, size) 1847| 10.8k| .visit(v, std::forward(args)...); 1848| 10.8k| } 1849| 12.0k|} _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| 1.24k| { 1814| 1.24k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.24k| } _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.04M| { 1751| 2.04M| auto offset = relaxed_->d.count - 1; 1752| 2.04M| auto child = node_->inner()[offset]; 1753| 2.04M| auto child_size = size(offset); 1754| 2.04M| auto is_leaf = shift_ == BL; 1755| 2.04M| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1755:16): [True: 67.9k, False: 1.97M] ------------------ 1756| 2.04M| : visit_maybe_relaxed_sub( 1757| 1.97M| child, shift_ - B, child_size, v, args...); 1758| 2.04M| } _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| 1.97M|{ 1839| 1.97M| assert(node); ------------------ | Branch (1839:5): [True: 1.97M, False: 0] ------------------ 1840| 1.97M| auto relaxed = node->relaxed(); 1841| 1.97M| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.61M, False: 367k] ------------------ 1842| 1.61M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.61M, False: 0] ------------------ 1843| 1.61M| return make_relaxed_pos(node, shift, relaxed) 1844| 1.61M| .visit(v, std::forward(args)...); 1845| 1.61M| } else { 1846| 367k| return make_regular_sub_pos(node, shift, size) 1847| 367k| .visit(v, std::forward(args)...); 1848| 367k| } 1849| 1.97M|} _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.61M| { 1814| 1.61M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.61M| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1036| 16.6k| { 1037| 16.6k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 16.6k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_25concat_trees_left_visitorISC_EEJNS1_8leaf_posISC_EERPSC_RjRmEEEDcT_DpOT0_: 1036| 13.9k| { 1037| 13.9k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 13.9k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_26concat_trees_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_: 1838| 13.9k|{ 1839| 13.9k| assert(node); ------------------ | Branch (1839:5): [True: 13.9k, False: 0] ------------------ 1840| 13.9k| auto relaxed = node->relaxed(); 1841| 13.9k| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.02k, False: 6.93k] ------------------ 1842| 7.02k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.02k, False: 0] ------------------ 1843| 7.02k| return make_relaxed_pos(node, shift, relaxed) 1844| 7.02k| .visit(v, std::forward(args)...); 1845| 7.02k| } else { 1846| 6.93k| return make_regular_sub_pos(node, shift, size) 1847| 6.93k| .visit(v, std::forward(args)...); 1848| 6.93k| } 1849| 13.9k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_: 1813| 7.02k| { 1814| 7.02k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.02k| } _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| 6.93k| { 1037| 6.93k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.93k| } _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.0k| { 1814| 50.0k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 50.0k| } _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| 44.4k| { 1738| 44.4k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 44.4k, False: 0] ------------------ 1739| 44.4k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 44.4k, False: 0] ------------------ 1740| 44.4k| auto child = node_->inner()[offset_hint]; 1741| 44.4k| auto is_leaf = shift_ == BL; 1742| 44.4k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 44.4k] ------------------ 1743| 44.4k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 44.4k| : visit_maybe_relaxed_sub( 1745| 44.4k| child, shift_ - B, child_size_hint, v, args...); 1746| 44.4k| } _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| 44.4k|{ 1839| 44.4k| assert(node); ------------------ | Branch (1839:5): [True: 44.4k, False: 0] ------------------ 1840| 44.4k| auto relaxed = node->relaxed(); 1841| 44.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 9.67k, False: 34.7k] ------------------ 1842| 9.67k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 9.67k, False: 0] ------------------ 1843| 9.67k| return make_relaxed_pos(node, shift, relaxed) 1844| 9.67k| .visit(v, std::forward(args)...); 1845| 34.7k| } else { 1846| 34.7k| return make_regular_sub_pos(node, shift, size) 1847| 34.7k| .visit(v, std::forward(args)...); 1848| 34.7k| } 1849| 44.4k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_: 1036| 34.7k| { 1037| 34.7k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 34.7k| } _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| 168k| { 953| 168k| return last_oh_regular(*this, v, offset_hint, args...); 954| 168k| } _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| 168k|{ 678| 168k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 168k, False: 0] ------------------ 679| 168k| constexpr auto B = bits; 680| 168k| constexpr auto BL = bits_leaf; 681| 168k| auto child = p.node()->inner()[offset_hint]; 682| 168k| auto is_leaf = p.shift() == BL; 683| 168k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 168k] ------------------ 684| 168k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 168k| .visit(v, args...); 686| 168k|} _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| 759k| { 337| 759k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 759k| } _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| 591k| { 331| 591k| return last_oh_regular(*this, v, offset_hint, args...); 332| 591k| } _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| 591k|{ 678| 591k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 591k, False: 0] ------------------ 679| 591k| constexpr auto B = bits; 680| 591k| constexpr auto BL = bits_leaf; 681| 591k| auto child = p.node()->inner()[offset_hint]; 682| 591k| auto is_leaf = p.shift() == BL; 683| 591k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 591k] ------------------ 684| 591k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 591k| .visit(v, args...); 686| 591k|} _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.30k| { 331| 1.30k| return last_oh_regular(*this, v, offset_hint, args...); 332| 1.30k| } _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.30k|{ 678| 1.30k| assert(offset_hint == p.count() - 1); ------------------ | Branch (678:5): [True: 1.30k, False: 0] ------------------ 679| 1.30k| constexpr auto B = bits; 680| 1.30k| constexpr auto BL = bits_leaf; 681| 1.30k| auto child = p.node()->inner()[offset_hint]; 682| 1.30k| auto is_leaf = p.shift() == BL; 683| 1.30k| return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...) ------------------ | Branch (683:12): [True: 0, False: 1.30k] ------------------ 684| 1.30k| : make_regular_pos(child, p.shift() - B, p.size()) 685| 1.30k| .visit(v, args...); 686| 1.30k|} _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_DpOT0_: 336| 2.73k| { 337| 2.73k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.73k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7last_ohINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_jDpOT0_: 952| 1.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.51k| { 1738| 8.51k| assert(offset_hint == count() - 1); ------------------ | Branch (1738:9): [True: 8.51k, False: 0] ------------------ 1739| 8.51k| assert(child_size_hint == size(offset_hint)); ------------------ | Branch (1739:9): [True: 8.51k, False: 0] ------------------ 1740| 8.51k| auto child = node_->inner()[offset_hint]; 1741| 8.51k| auto is_leaf = shift_ == BL; 1742| 8.51k| return is_leaf ------------------ | Branch (1742:16): [True: 0, False: 8.51k] ------------------ 1743| 8.51k| ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...) 1744| 8.51k| : visit_maybe_relaxed_sub( 1745| 8.51k| child, shift_ - B, child_size_hint, v, args...); 1746| 8.51k| } _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.51k|{ 1839| 8.51k| assert(node); ------------------ | Branch (1839:5): [True: 8.51k, False: 0] ------------------ 1840| 8.51k| auto relaxed = node->relaxed(); 1841| 8.51k| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.43k, False: 1.08k] ------------------ 1842| 7.43k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.43k, False: 0] ------------------ 1843| 7.43k| return make_relaxed_pos(node, shift, relaxed) 1844| 7.43k| .visit(v, std::forward(args)...); 1845| 7.43k| } else { 1846| 1.08k| return make_regular_sub_pos(node, shift, size) 1847| 1.08k| .visit(v, std::forward(args)...); 1848| 1.08k| } 1849| 8.51k|} _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.43k| { 1814| 7.43k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.43k| } _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.08k| { 1037| 1.08k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.08k| } _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| 38.7k|{ 1839| 38.7k| assert(node); ------------------ | Branch (1839:5): [True: 38.7k, False: 0] ------------------ 1840| 38.7k| auto relaxed = node->relaxed(); 1841| 38.7k| if (relaxed) { ------------------ | Branch (1841:9): [True: 35.9k, False: 2.78k] ------------------ 1842| 35.9k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 35.9k, False: 0] ------------------ 1843| 35.9k| return make_relaxed_pos(node, shift, relaxed) 1844| 35.9k| .visit(v, std::forward(args)...); 1845| 35.9k| } else { 1846| 2.78k| return make_regular_sub_pos(node, shift, size) 1847| 2.78k| .visit(v, std::forward(args)...); 1848| 2.78k| } 1849| 38.7k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_DpOT0_: 1813| 35.9k| { 1814| 35.9k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 35.9k| } _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| 109k| { 1687| 109k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 109k, False: 0] ------------------ 1688| 109k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 34.9k, False: 74.1k] ------------------ 1689| 109k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 109k| } _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| 109k| { 1699| 109k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 109k| } _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| 109k| { 1718| 109k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 109k, False: 0] ------------------ 1719| 109k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 34.9k, False: 74.1k] | Branch (1719:9): [True: 109k, False: 0] ------------------ 1720| 109k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 109k| auto child = node_->inner()[offset_hint]; 1722| 109k| auto is_leaf = shift_ == BL; 1723| 109k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 109k| auto next_idx = idx - left_size_hint; 1725| 109k| return is_leaf ------------------ | Branch (1725:16): [True: 31.7k, False: 77.3k] ------------------ 1726| 109k| ? make_leaf_sub_pos(child, next_size) 1727| 31.7k| .visit(v, next_idx, args...) 1728| 109k| : visit_maybe_relaxed_sub( 1729| 77.3k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 109k| } _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| 31.7k| { 145| 31.7k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 31.7k| } _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| 77.3k|{ 1839| 77.3k| assert(node); ------------------ | Branch (1839:5): [True: 77.3k, False: 0] ------------------ 1840| 77.3k| auto relaxed = node->relaxed(); 1841| 77.3k| if (relaxed) { ------------------ | Branch (1841:9): [True: 73.2k, False: 4.14k] ------------------ 1842| 73.2k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 73.2k, False: 0] ------------------ 1843| 73.2k| return make_relaxed_pos(node, shift, relaxed) 1844| 73.2k| .visit(v, std::forward(args)...); 1845| 73.2k| } else { 1846| 4.14k| return make_regular_sub_pos(node, shift, size) 1847| 4.14k| .visit(v, std::forward(args)...); 1848| 4.14k| } 1849| 77.3k|} _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| 73.2k| { 1814| 73.2k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 73.2k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1036| 4.14k| { 1037| 4.14k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.14k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 938| 6.93k| { 939| 6.93k| return towards_oh_ch_regular( 940| 6.93k| *this, v, idx, offset_hint, count(), args...); 941| 6.93k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_15get_mut_visitorISD_EEJRNSB_5applyIS8_E4type4editERPPSD_EEEDcOT_T0_mjjDpOT1_: 632| 6.93k|{ 633| 6.93k| constexpr auto B = bits; 634| 6.93k| constexpr auto BL = bits_leaf; 635| 6.93k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.93k, False: 0] ------------------ 636| 6.93k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.93k, False: 0] ------------------ 637| 6.93k| auto is_leaf = p.shift() == BL; 638| 6.93k| auto child = p.node()->inner()[offset_hint]; 639| 6.93k| auto is_full = offset_hint + 1 != count_hint; 640| 6.93k| return is_full ------------------ | Branch (640:12): [True: 4.62k, False: 2.30k] ------------------ 641| 6.93k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.13k, False: 3.48k] ------------------ 642| 4.62k| : make_full_pos(child, p.shift() - B) 643| 3.48k| .visit(v, idx, args...)) 644| 6.93k| : (is_leaf ------------------ | Branch (644:19): [True: 559, False: 1.74k] ------------------ 645| 2.30k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.30k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.74k| .visit(v, idx, args...)); 648| 6.93k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 207| 5.89k| { 208| 5.89k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.89k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 1405| 4.78k| { 1406| 4.78k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 4.78k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 1329| 4.78k| { 1330| 4.78k| return towards_oh(v, idx, offset_hint, args...); 1331| 4.78k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_mjDpOT0_: 1336| 4.78k| { 1337| 4.78k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 4.78k, False: 0] ------------------ 1338| 4.78k| auto is_leaf = shift_ == BL; 1339| 4.78k| auto child = node_->inner()[offset_hint]; 1340| 4.78k| return is_leaf ------------------ | Branch (1340:16): [True: 3.86k, False: 918] ------------------ 1341| 4.78k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 4.78k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 4.78k| } _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.03k| { 113| 1.03k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 1.03k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_: 336| 2.56k| { 337| 2.56k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 2.56k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_: 316| 2.56k| { 317| 2.56k| return towards_oh_ch_regular( 318| 2.56k| *this, v, idx, offset_hint, count(), args...); 319| 2.56k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_15get_mut_visitorISD_EEJRNSB_5applyIS8_E4type4editERPPSD_EEEDcOT_T0_mjjDpOT1_: 632| 2.56k|{ 633| 2.56k| constexpr auto B = bits; 634| 2.56k| constexpr auto BL = bits_leaf; 635| 2.56k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.56k, False: 0] ------------------ 636| 2.56k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.56k, False: 0] ------------------ 637| 2.56k| auto is_leaf = p.shift() == BL; 638| 2.56k| auto child = p.node()->inner()[offset_hint]; 639| 2.56k| auto is_full = offset_hint + 1 != count_hint; 640| 2.56k| return is_full ------------------ | Branch (640:12): [True: 1.26k, False: 1.29k] ------------------ 641| 2.56k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 886, False: 383] ------------------ 642| 1.26k| : make_full_pos(child, p.shift() - B) 643| 383| .visit(v, idx, args...)) 644| 2.56k| : (is_leaf ------------------ | Branch (644:19): [True: 480, False: 817] ------------------ 645| 1.29k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 1.29k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 817| .visit(v, idx, args...)); 648| 2.56k|} _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| 2.78k| { 1037| 2.78k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.78k| } _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| 77.4k|{ 1839| 77.4k| assert(node); ------------------ | Branch (1839:5): [True: 77.4k, False: 0] ------------------ 1840| 77.4k| auto relaxed = node->relaxed(); 1841| 77.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 64.8k, False: 12.6k] ------------------ 1842| 64.8k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 64.8k, False: 0] ------------------ 1843| 64.8k| return make_relaxed_pos(node, shift, relaxed) 1844| 64.8k| .visit(v, std::forward(args)...); 1845| 64.8k| } else { 1846| 12.6k| return make_regular_sub_pos(node, shift, size) 1847| 12.6k| .visit(v, std::forward(args)...); 1848| 12.6k| } 1849| 77.4k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 64.8k| { 1814| 64.8k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 64.8k| } _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| 40.5k| { 1687| 40.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 40.5k, False: 0] ------------------ 1688| 40.5k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 40.5k] ------------------ 1689| 40.5k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 40.5k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 40.5k| { 1699| 40.5k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 40.5k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 40.5k| { 1718| 40.5k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 40.5k, False: 0] ------------------ 1719| 40.5k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 40.5k] | Branch (1719:9): [True: 40.5k, False: 0] ------------------ 1720| 40.5k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 40.5k| auto child = node_->inner()[offset_hint]; 1722| 40.5k| auto is_leaf = shift_ == BL; 1723| 40.5k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 40.5k| auto next_idx = idx - left_size_hint; 1725| 40.5k| return is_leaf ------------------ | Branch (1725:16): [True: 1.11k, False: 39.4k] ------------------ 1726| 40.5k| ? make_leaf_sub_pos(child, next_size) 1727| 1.11k| .visit(v, next_idx, args...) 1728| 40.5k| : visit_maybe_relaxed_sub( 1729| 39.4k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 40.5k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 1.11k| { 145| 1.11k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 1.11k| } _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| 21.2k| { 1687| 21.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 21.2k, False: 0] ------------------ 1688| 21.2k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 0, False: 21.2k] ------------------ 1689| 21.2k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 21.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| 21.2k| { 1699| 21.2k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 21.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| 21.2k| { 1718| 21.2k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 21.2k, False: 0] ------------------ 1719| 21.2k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 0, False: 21.2k] | Branch (1719:9): [True: 21.2k, False: 0] ------------------ 1720| 21.2k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 21.2k| auto child = node_->inner()[offset_hint]; 1722| 21.2k| auto is_leaf = shift_ == BL; 1723| 21.2k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 21.2k| auto next_idx = idx - left_size_hint; 1725| 21.2k| return is_leaf ------------------ | Branch (1725:16): [True: 952, False: 20.3k] ------------------ 1726| 21.2k| ? make_leaf_sub_pos(child, next_size) 1727| 952| .visit(v, next_idx, args...) 1728| 21.2k| : visit_maybe_relaxed_sub( 1729| 20.3k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 21.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| 952| { 145| 952| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 952| } _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| 20.3k|{ 1839| 20.3k| assert(node); ------------------ | Branch (1839:5): [True: 20.3k, False: 0] ------------------ 1840| 20.3k| auto relaxed = node->relaxed(); 1841| 20.3k| if (relaxed) { ------------------ | Branch (1841:9): [True: 18.6k, False: 1.66k] ------------------ 1842| 18.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 18.6k, False: 0] ------------------ 1843| 18.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 18.6k| .visit(v, std::forward(args)...); 1845| 18.6k| } else { 1846| 1.66k| return make_regular_sub_pos(node, shift, size) 1847| 1.66k| .visit(v, std::forward(args)...); 1848| 1.66k| } 1849| 20.3k|} _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| 18.6k| { 1814| 18.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 18.6k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 1.66k| { 1037| 1.66k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.66k| } _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.85k| { 928| 2.85k| return towards_oh_ch_regular( 929| 2.85k| *this, v, idx, offset_hint, count(), args...); 930| 2.85k| } _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.85k|{ 633| 2.85k| constexpr auto B = bits; 634| 2.85k| constexpr auto BL = bits_leaf; 635| 2.85k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 2.85k, False: 0] ------------------ 636| 2.85k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 2.85k, False: 0] ------------------ 637| 2.85k| auto is_leaf = p.shift() == BL; 638| 2.85k| auto child = p.node()->inner()[offset_hint]; 639| 2.85k| auto is_full = offset_hint + 1 != count_hint; 640| 2.85k| return is_full ------------------ | Branch (640:12): [True: 2.43k, False: 414] ------------------ 641| 2.85k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 740, False: 1.69k] ------------------ 642| 2.43k| : make_full_pos(child, p.shift() - B) 643| 1.69k| .visit(v, idx, args...)) 644| 2.85k| : (is_leaf ------------------ | Branch (644:19): [True: 414, False: 0] ------------------ 645| 414| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 414| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 2.85k|} _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.58k| { 208| 1.58k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.58k| } _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| 2.19k| { 1406| 2.19k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.19k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 1.33k| { 1337| 1.33k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.33k, False: 0] ------------------ 1338| 1.33k| auto is_leaf = shift_ == BL; 1339| 1.33k| auto child = node_->inner()[offset_hint]; 1340| 1.33k| return is_leaf ------------------ | Branch (1340:16): [True: 845, False: 493] ------------------ 1341| 1.33k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.33k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.33k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 3.40k| { 1337| 3.40k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 3.40k, False: 0] ------------------ 1338| 3.40k| auto is_leaf = shift_ == BL; 1339| 3.40k| auto child = node_->inner()[offset_hint]; 1340| 3.40k| return is_leaf ------------------ | Branch (1340:16): [True: 2.09k, False: 1.30k] ------------------ 1341| 3.40k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 3.40k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 3.40k| } _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.89k| { 208| 5.89k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 5.89k| } _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.67k| { 1406| 4.67k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 4.67k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1405| 3.53k| { 1406| 3.53k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.53k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1336| 8.19k| { 1337| 8.19k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 8.19k, False: 0] ------------------ 1338| 8.19k| auto is_leaf = shift_ == BL; 1339| 8.19k| auto child = node_->inner()[offset_hint]; 1340| 8.19k| return is_leaf ------------------ | Branch (1340:16): [True: 6.72k, False: 1.47k] ------------------ 1341| 8.19k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 8.19k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 8.19k| } _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| 10.1k| { 208| 10.1k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 10.1k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 3.13k| { 1406| 3.13k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.13k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1310| 4.41k| { 1311| 4.41k| each_i(v, start, branches, args...); 1312| 4.41k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE6each_iINS1_11dec_visitorEJEEEvT_jjDpOT0_: 1263| 6.91k| { 1264| 6.91k| auto p = node_->inner() + i; 1265| 6.91k| auto e = node_->inner() + n; 1266| 6.91k| if (shift_ == BL) { ------------------ | Branch (1266:13): [True: 3.94k, False: 2.96k] ------------------ 1267| 11.9k| for (; p != e; ++p) { ------------------ | Branch (1267:20): [True: 8.04k, False: 3.94k] ------------------ 1268| 8.04k| IMMER_PREFETCH(p + 1); 1269| 8.04k| make_full_leaf_pos(*p).visit(v, args...); 1270| 8.04k| } 1271| 3.94k| } else { 1272| 2.96k| auto ss = shift_ - B; 1273| 8.87k| for (; p != e; ++p) ------------------ | Branch (1273:20): [True: 5.91k, False: 2.96k] ------------------ 1274| 5.91k| make_full_pos(*p, ss).visit(v, args...); 1275| 2.96k| } 1276| 6.91k| } _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| 414| { 113| 414| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 414| } _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.50k| { 306| 5.50k| return towards_oh_ch_regular( 307| 5.50k| *this, v, idx, offset_hint, count(), args...); 308| 5.50k| } _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.50k|{ 633| 5.50k| constexpr auto B = bits; 634| 5.50k| constexpr auto BL = bits_leaf; 635| 5.50k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.50k, False: 0] ------------------ 636| 5.50k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.50k, False: 0] ------------------ 637| 5.50k| auto is_leaf = p.shift() == BL; 638| 5.50k| auto child = p.node()->inner()[offset_hint]; 639| 5.50k| auto is_full = offset_hint + 1 != count_hint; 640| 5.50k| return is_full ------------------ | Branch (640:12): [True: 2.71k, False: 2.78k] ------------------ 641| 5.50k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 1.52k, False: 1.19k] ------------------ 642| 2.71k| : make_full_pos(child, p.shift() - B) 643| 1.19k| .visit(v, idx, args...)) 644| 5.50k| : (is_leaf ------------------ | Branch (644:19): [True: 1.30k, False: 1.48k] ------------------ 645| 2.78k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.78k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 1.48k| .visit(v, idx, args...)); 648| 5.50k|} _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.56k| { 113| 2.56k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.56k| } _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.12k| { 337| 6.12k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 6.12k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 336| 3.63k| { 337| 3.63k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.63k| } _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.94k| { 306| 3.94k| return towards_oh_ch_regular( 307| 3.94k| *this, v, idx, offset_hint, count(), args...); 308| 3.94k| } _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.94k|{ 633| 3.94k| constexpr auto B = bits; 634| 3.94k| constexpr auto BL = bits_leaf; 635| 3.94k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 3.94k, False: 0] ------------------ 636| 3.94k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 3.94k, False: 0] ------------------ 637| 3.94k| auto is_leaf = p.shift() == BL; 638| 3.94k| auto child = p.node()->inner()[offset_hint]; 639| 3.94k| auto is_full = offset_hint + 1 != count_hint; 640| 3.94k| return is_full ------------------ | Branch (640:12): [True: 1.13k, False: 2.81k] ------------------ 641| 3.94k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 785, False: 345] ------------------ 642| 1.13k| : make_full_pos(child, p.shift() - B) 643| 345| .visit(v, idx, args...)) 644| 3.94k| : (is_leaf ------------------ | Branch (644:19): [True: 1.82k, False: 991] ------------------ 645| 2.81k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 2.81k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 991| .visit(v, idx, args...)); 648| 3.94k|} _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.49k| { 113| 2.49k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 2.49k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 336| 3.32k| { 337| 3.32k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.32k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 285| 5.50k| { 286| 5.50k| return each_right_regular(*this, v, start, args...); 287| 5.50k| } _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.50k|{ 598| 5.50k| constexpr auto B = bits; 599| 5.50k| constexpr auto BL = bits_leaf; 600| | 601| 5.50k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 2.82k, False: 2.68k] ------------------ 602| 2.82k| auto n = p.node()->inner() + start; 603| 2.82k| auto last = p.count() - 1; 604| 2.82k| auto e = p.node()->inner() + last; 605| 2.82k| if (n <= e) { ------------------ | Branch (605:13): [True: 1.52k, False: 1.30k] ------------------ 606| 2.66k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 1.13k, False: 1.52k] ------------------ 607| 1.13k| IMMER_PREFETCH(n + 1); 608| 1.13k| make_full_leaf_pos(*n).visit(v, args...); 609| 1.13k| } 610| 1.52k| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 1.52k| } 612| 2.82k| } else { 613| 2.68k| auto n = p.node()->inner() + start; 614| 2.68k| auto last = p.count() - 1; 615| 2.68k| auto e = p.node()->inner() + last; 616| 2.68k| auto ss = p.shift() - B; 617| 2.68k| if (n <= e) { ------------------ | Branch (617:13): [True: 1.19k, False: 1.48k] ------------------ 618| 2.49k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 1.29k, False: 1.19k] ------------------ 619| 1.29k| make_full_pos(*n, ss).visit(v, args...); 620| 1.19k| make_regular_pos(*n, ss, p.size()).visit(v, args...); 621| 1.19k| } 622| 2.68k| } 623| 5.50k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 927| 10.3k| { 928| 10.3k| return towards_oh_ch_regular( 929| 10.3k| *this, v, idx, offset_hint, count(), args...); 930| 10.3k| } _ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_: 632| 10.3k|{ 633| 10.3k| constexpr auto B = bits; 634| 10.3k| constexpr auto BL = bits_leaf; 635| 10.3k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 10.3k, False: 0] ------------------ 636| 10.3k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 10.3k, False: 0] ------------------ 637| 10.3k| auto is_leaf = p.shift() == BL; 638| 10.3k| auto child = p.node()->inner()[offset_hint]; 639| 10.3k| auto is_full = offset_hint + 1 != count_hint; 640| 10.3k| return is_full ------------------ | Branch (640:12): [True: 4.44k, False: 5.90k] ------------------ 641| 10.3k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 2.26k, False: 2.17k] ------------------ 642| 4.44k| : make_full_pos(child, p.shift() - B) 643| 2.17k| .visit(v, idx, args...)) 644| 10.3k| : (is_leaf ------------------ | Branch (644:19): [True: 1.26k, False: 4.64k] ------------------ 645| 5.90k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 5.90k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 4.64k| .visit(v, idx, args...)); 648| 10.3k|} _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.97k| { 928| 6.97k| return towards_oh_ch_regular( 929| 6.97k| *this, v, idx, offset_hint, count(), args...); 930| 6.97k| } _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.97k|{ 633| 6.97k| constexpr auto B = bits; 634| 6.97k| constexpr auto BL = bits_leaf; 635| 6.97k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 6.97k, False: 0] ------------------ 636| 6.97k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 6.97k, False: 0] ------------------ 637| 6.97k| auto is_leaf = p.shift() == BL; 638| 6.97k| auto child = p.node()->inner()[offset_hint]; 639| 6.97k| auto is_full = offset_hint + 1 != count_hint; 640| 6.97k| return is_full ------------------ | Branch (640:12): [True: 3.97k, False: 3.00k] ------------------ 641| 6.97k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 2.65k, False: 1.31k] ------------------ 642| 3.97k| : make_full_pos(child, p.shift() - B) 643| 1.31k| .visit(v, idx, args...)) 644| 6.97k| : (is_leaf ------------------ | Branch (644:19): [True: 674, False: 2.33k] ------------------ 645| 3.00k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 3.00k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 2.33k| .visit(v, idx, args...)); 648| 6.97k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 867| 15.4k| { 868| 15.4k| return each_right_regular(*this, v, start, args...); 869| 15.4k| } _ZN5immer6detail4rbts18each_right_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_11dec_visitorEJEEEvOT_T0_jDpOT1_: 597| 15.4k|{ 598| 15.4k| constexpr auto B = bits; 599| 15.4k| constexpr auto BL = bits_leaf; 600| | 601| 15.4k| if (p.shift() == BL) { ------------------ | Branch (601:9): [True: 5.09k, False: 10.3k] ------------------ 602| 5.09k| auto n = p.node()->inner() + start; 603| 5.09k| auto last = p.count() - 1; 604| 5.09k| auto e = p.node()->inner() + last; 605| 5.09k| if (n <= e) { ------------------ | Branch (605:13): [True: 3.12k, False: 1.97k] ------------------ 606| 5.89k| for (; n != e; ++n) { ------------------ | Branch (606:20): [True: 2.77k, False: 3.12k] ------------------ 607| 2.77k| IMMER_PREFETCH(n + 1); 608| 2.77k| make_full_leaf_pos(*n).visit(v, args...); 609| 2.77k| } 610| 3.12k| make_leaf_pos(*n, p.size()).visit(v, args...); 611| 3.12k| } 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.64k] ------------------ 618| 8.86k| for (; n != e; ++n) ------------------ | Branch (618:20): [True: 3.16k, False: 5.69k] ------------------ 619| 3.16k| 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| 15.4k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1813| 53.5k| { 1814| 53.5k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 53.5k| } _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| 24.9k| { 1687| 24.9k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 24.9k, False: 0] ------------------ 1688| 24.9k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 19.3k, False: 5.57k] ------------------ 1689| 24.9k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 24.9k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 24.9k| { 1699| 24.9k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 24.9k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 24.9k| { 1718| 24.9k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 24.9k, False: 0] ------------------ 1719| 24.9k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 19.3k, False: 5.57k] | Branch (1719:9): [True: 24.9k, False: 0] ------------------ 1720| 24.9k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 24.9k| auto child = node_->inner()[offset_hint]; 1722| 24.9k| auto is_leaf = shift_ == BL; 1723| 24.9k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 24.9k| auto next_idx = idx - left_size_hint; 1725| 24.9k| return is_leaf ------------------ | Branch (1725:16): [True: 4.44k, False: 20.4k] ------------------ 1726| 24.9k| ? make_leaf_sub_pos(child, next_size) 1727| 4.44k| .visit(v, next_idx, args...) 1728| 24.9k| : visit_maybe_relaxed_sub( 1729| 20.4k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 24.9k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 4.44k| { 145| 4.44k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.44k| } _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| 20.4k|{ 1839| 20.4k| assert(node); ------------------ | Branch (1839:5): [True: 20.4k, False: 0] ------------------ 1840| 20.4k| auto relaxed = node->relaxed(); 1841| 20.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 12.8k, False: 7.62k] ------------------ 1842| 12.8k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 12.8k, False: 0] ------------------ 1843| 12.8k| return make_relaxed_pos(node, shift, relaxed) 1844| 12.8k| .visit(v, std::forward(args)...); 1845| 12.8k| } else { 1846| 7.62k| return make_regular_sub_pos(node, shift, size) 1847| 7.62k| .visit(v, std::forward(args)...); 1848| 7.62k| } 1849| 20.4k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 12.8k| { 1814| 12.8k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 12.8k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 7.62k| { 1037| 7.62k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 7.62k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_: 1036| 10.8k| { 1037| 10.8k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 10.8k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1686| 16.6k| { 1687| 16.6k| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 16.6k, False: 0] ------------------ 1688| 16.6k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 9.53k, False: 7.13k] ------------------ 1689| 16.6k| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 16.6k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1698| 16.6k| { 1699| 16.6k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 16.6k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 16.6k| { 1718| 16.6k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 16.6k, False: 0] ------------------ 1719| 16.6k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 9.53k, False: 7.13k] | Branch (1719:9): [True: 16.6k, False: 0] ------------------ 1720| 16.6k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 16.6k| auto child = node_->inner()[offset_hint]; 1722| 16.6k| auto is_leaf = shift_ == BL; 1723| 16.6k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 16.6k| auto next_idx = idx - left_size_hint; 1725| 16.6k| return is_leaf ------------------ | Branch (1725:16): [True: 6.27k, False: 10.3k] ------------------ 1726| 16.6k| ? make_leaf_sub_pos(child, next_size) 1727| 6.27k| .visit(v, next_idx, args...) 1728| 16.6k| : visit_maybe_relaxed_sub( 1729| 10.3k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 16.6k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 6.27k| { 145| 6.27k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 6.27k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 10.3k|{ 1839| 10.3k| assert(node); ------------------ | Branch (1839:5): [True: 10.3k, False: 0] ------------------ 1840| 10.3k| auto relaxed = node->relaxed(); 1841| 10.3k| if (relaxed) { ------------------ | Branch (1841:9): [True: 7.05k, False: 3.33k] ------------------ 1842| 7.05k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 7.05k, False: 0] ------------------ 1843| 7.05k| return make_relaxed_pos(node, shift, relaxed) 1844| 7.05k| .visit(v, std::forward(args)...); 1845| 7.05k| } else { 1846| 3.33k| return make_regular_sub_pos(node, shift, size) 1847| 3.33k| .visit(v, std::forward(args)...); 1848| 3.33k| } 1849| 10.3k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 7.05k| { 1814| 7.05k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 7.05k| } _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.33k| { 1037| 3.33k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.33k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_: 1653| 65.4k| { 1654| 65.4k| assert(start > 0); ------------------ | Branch (1654:9): [True: 65.4k, False: 0] ------------------ 1655| 65.4k| assert(start <= relaxed_->d.count); ------------------ | Branch (1655:9): [True: 65.4k, False: 0] ------------------ 1656| 65.4k| auto s = relaxed_->d.sizes[start - 1]; 1657| 65.4k| auto p = node_->inner(); 1658| 65.4k| if (shift_ == BL) { ------------------ | Branch (1658:13): [True: 5.56k, False: 59.9k] ------------------ 1659| 15.4k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1659:34): [True: 9.87k, False: 5.56k] ------------------ 1660| 9.87k| IMMER_PREFETCH(p + i + 1); 1661| 9.87k| make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) 1662| 9.87k| .visit(v, args...); 1663| 9.87k| s = relaxed_->d.sizes[i]; 1664| 9.87k| assert(s); ------------------ | Branch (1664:17): [True: 9.87k, False: 0] ------------------ 1665| 9.87k| } 1666| 59.9k| } else { 1667| 59.9k| auto ss = shift_ - B; 1668| 187k| for (auto i = start; i < relaxed_->d.count; ++i) { ------------------ | Branch (1668:34): [True: 128k, False: 59.9k] ------------------ 1669| 128k| visit_maybe_relaxed_sub( 1670| 128k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...); 1671| 128k| s = relaxed_->d.sizes[i]; 1672| | assert(s); ------------------ | Branch (1672:17): [True: 128k, False: 0] ------------------ 1673| 128k| } 1674| 59.9k| } 1675| 65.4k| } _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.6k| { 1037| 12.6k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 12.6k| } _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.09k| { 928| 5.09k| return towards_oh_ch_regular( 929| 5.09k| *this, v, idx, offset_hint, count(), args...); 930| 5.09k| } _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.09k|{ 633| 5.09k| constexpr auto B = bits; 634| 5.09k| constexpr auto BL = bits_leaf; 635| 5.09k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 5.09k, False: 0] ------------------ 636| 5.09k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 5.09k, False: 0] ------------------ 637| 5.09k| auto is_leaf = p.shift() == BL; 638| 5.09k| auto child = p.node()->inner()[offset_hint]; 639| 5.09k| auto is_full = offset_hint + 1 != count_hint; 640| 5.09k| return is_full ------------------ | Branch (640:12): [True: 4.38k, False: 709] ------------------ 641| 5.09k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 856, False: 3.52k] ------------------ 642| 4.38k| : make_full_pos(child, p.shift() - B) 643| 3.52k| .visit(v, idx, args...)) 644| 5.09k| : (is_leaf ------------------ | Branch (644:19): [True: 709, False: 0] ------------------ 645| 709| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 709| : make_regular_pos(child, p.shift() - B, p.size()) 647| 0| .visit(v, idx, args...)); 648| 5.09k|} _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.43k| { 208| 1.43k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 1.43k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 3.95k| { 1406| 3.95k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.95k| } _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.01k| { 1337| 1.01k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 1.01k, False: 0] ------------------ 1338| 1.01k| auto is_leaf = shift_ == BL; 1339| 1.01k| auto child = node_->inner()[offset_hint]; 1340| 1.01k| return is_leaf ------------------ | Branch (1340:16): [True: 583, False: 428] ------------------ 1341| 1.01k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 1.01k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 1.01k| } _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| 709| { 113| 709| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 709| } _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| 712| { 145| 712| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 712| } _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| 45.4k|{ 1839| 45.4k| assert(node); ------------------ | Branch (1839:5): [True: 45.4k, False: 0] ------------------ 1840| 45.4k| auto relaxed = node->relaxed(); 1841| 45.4k| if (relaxed) { ------------------ | Branch (1841:9): [True: 37.0k, False: 8.39k] ------------------ 1842| 37.0k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 37.0k, False: 0] ------------------ 1843| 37.0k| return make_relaxed_pos(node, shift, relaxed) 1844| 37.0k| .visit(v, std::forward(args)...); 1845| 37.0k| } else { 1846| 8.39k| return make_regular_sub_pos(node, shift, size) 1847| 8.39k| .visit(v, std::forward(args)...); 1848| 8.39k| } 1849| 45.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| 37.0k| { 1814| 37.0k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 37.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1705| 6.25k| { 1706| 6.25k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 6.25k, False: 0] ------------------ 1707| 6.25k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 5.29k, False: 962] ------------------ 1708| 6.25k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 6.25k| } _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| 6.25k| { 1718| 6.25k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 6.25k, False: 0] ------------------ 1719| 6.25k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 5.29k, False: 962] | Branch (1719:9): [True: 6.25k, False: 0] ------------------ 1720| 6.25k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 6.25k| auto child = node_->inner()[offset_hint]; 1722| 6.25k| auto is_leaf = shift_ == BL; 1723| 6.25k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 6.25k| auto next_idx = idx - left_size_hint; 1725| 6.25k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 6.25k] ------------------ 1726| 6.25k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 6.25k| : visit_maybe_relaxed_sub( 1729| 6.25k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 6.25k| } _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.03k| { 1706| 4.03k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 4.03k, False: 0] ------------------ 1707| 4.03k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 3.37k, False: 664] ------------------ 1708| 4.03k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 4.03k| } _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.03k| { 1718| 4.03k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 4.03k, False: 0] ------------------ 1719| 4.03k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 3.37k, False: 664] | Branch (1719:9): [True: 4.03k, False: 0] ------------------ 1720| 4.03k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 4.03k| auto child = node_->inner()[offset_hint]; 1722| 4.03k| auto is_leaf = shift_ == BL; 1723| 4.03k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 4.03k| auto next_idx = idx - left_size_hint; 1725| 4.03k| return is_leaf ------------------ | Branch (1725:16): [True: 0, False: 4.03k] ------------------ 1726| 4.03k| ? make_leaf_sub_pos(child, next_size) 1727| 0| .visit(v, next_idx, args...) 1728| 4.03k| : visit_maybe_relaxed_sub( 1729| 4.03k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 4.03k| } _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.03k|{ 1839| 4.03k| assert(node); ------------------ | Branch (1839:5): [True: 4.03k, False: 0] ------------------ 1840| 4.03k| auto relaxed = node->relaxed(); 1841| 4.03k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.51k, False: 1.52k] ------------------ 1842| 2.51k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.51k, False: 0] ------------------ 1843| 2.51k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.51k| .visit(v, std::forward(args)...); 1845| 2.51k| } else { 1846| 1.52k| return make_regular_sub_pos(node, shift, size) 1847| 1.52k| .visit(v, std::forward(args)...); 1848| 1.52k| } 1849| 4.03k|} _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.51k| { 1814| 2.51k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.51k| } _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.52k| { 1037| 1.52k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.52k| } _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.47k| { 947| 2.47k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 2.47k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_22slice_left_mut_visitorISD_Lb1ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjDpOT1_: 653| 2.47k|{ 654| 2.47k| constexpr auto B = bits; 655| 2.47k| constexpr auto BL = bits_leaf; 656| 2.47k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 2.47k, False: 0] ------------------ 657| 2.47k| auto is_leaf = p.shift() == BL; 658| 2.47k| auto child = p.node()->inner()[offset_hint]; 659| 2.47k| auto lsize = offset_hint << p.shift(); 660| 2.47k| auto size = p.this_size(); 661| 2.47k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 2.47k| return is_full ------------------ | Branch (662:12): [True: 1.39k, False: 1.08k] ------------------ 663| 2.47k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 1.39k] ------------------ 664| 1.39k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 1.39k| : make_full_pos(child, p.shift() - B) 666| 1.39k| .visit(v, idx - lsize, args...)) 667| 2.47k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 1.08k] ------------------ 668| 1.08k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 1.08k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 1.08k| .visit(v, idx - lsize, args...)); 672| 2.47k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 3.09k| { 1406| 3.09k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.09k| } _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.70k| { 1349| 1.70k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 1.70k, False: 0] ------------------ 1350| 1.70k| auto is_leaf = shift_ == BL; 1351| 1.70k| auto child = node_->inner()[offset_hint]; 1352| 1.70k| auto lsize = size_t{offset_hint} << shift_; 1353| 1.70k| return is_leaf ------------------ | Branch (1353:16): [True: 0, False: 1.70k] ------------------ 1354| 1.70k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 1.70k| : make_full_pos(child, shift_ - B) 1356| 1.70k| .visit(v, idx - lsize, args...); 1357| 1.70k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1405| 335| { 1406| 335| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 335| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 1348| 2.16k| { 1349| 2.16k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 2.16k, False: 0] ------------------ 1350| 2.16k| auto is_leaf = shift_ == BL; 1351| 2.16k| auto child = node_->inner()[offset_hint]; 1352| 2.16k| auto lsize = size_t{offset_hint} << shift_; 1353| 2.16k| return is_leaf ------------------ | Branch (1353:16): [True: 1.26k, False: 894] ------------------ 1354| 2.16k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 2.16k| : make_full_pos(child, shift_ - B) 1356| 894| .visit(v, idx - lsize, args...); 1357| 2.16k| } _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.31k| { 208| 3.31k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 3.31k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 2.26k| { 1406| 2.26k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.26k| } _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.86k| { 1349| 7.86k| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 7.86k, False: 0] ------------------ 1350| 7.86k| auto is_leaf = shift_ == BL; 1351| 7.86k| auto child = node_->inner()[offset_hint]; 1352| 7.86k| auto lsize = size_t{offset_hint} << shift_; 1353| 7.86k| return is_leaf ------------------ | Branch (1353:16): [True: 6.35k, False: 1.51k] ------------------ 1354| 7.86k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 7.86k| : make_full_pos(child, shift_ - B) 1356| 1.51k| .visit(v, idx - lsize, args...); 1357| 7.86k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 207| 10.3k| { 208| 10.3k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 10.3k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1405| 3.27k| { 1406| 3.27k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.27k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_leftINS1_11dec_visitorEJEEEvT_jDpOT0_: 1316| 2.49k| { 1317| 2.49k| each_i(v, 0, last, args...); 1318| 2.49k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb0EEEJmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 1.08k| { 1037| 1.08k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.08k| } _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.24k| { 1037| 4.24k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.24k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 946| 3.42k| { 947| 3.42k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 3.42k| } _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.42k|{ 654| 3.42k| constexpr auto B = bits; 655| 3.42k| constexpr auto BL = bits_leaf; 656| 3.42k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 3.42k, False: 0] ------------------ 657| 3.42k| auto is_leaf = p.shift() == BL; 658| 3.42k| auto child = p.node()->inner()[offset_hint]; 659| 3.42k| auto lsize = offset_hint << p.shift(); 660| 3.42k| auto size = p.this_size(); 661| 3.42k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 3.42k| return is_full ------------------ | Branch (662:12): [True: 3.42k, False: 0] ------------------ 663| 3.42k| ? (is_leaf ------------------ | Branch (663:19): [True: 2.05k, False: 1.37k] ------------------ 664| 3.42k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 3.42k| : make_full_pos(child, p.shift() - B) 666| 1.37k| .visit(v, idx - lsize, args...)) 667| 3.42k| : (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.42k|} _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE14towards_sub_ohINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_: 946| 5.73k| { 947| 5.73k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 5.73k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_22slice_left_mut_visitorISD_Lb0ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjDpOT1_: 653| 5.73k|{ 654| 5.73k| constexpr auto B = bits; 655| 5.73k| constexpr auto BL = bits_leaf; 656| 5.73k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 5.73k, False: 0] ------------------ 657| 5.73k| auto is_leaf = p.shift() == BL; 658| 5.73k| auto child = p.node()->inner()[offset_hint]; 659| 5.73k| auto lsize = offset_hint << p.shift(); 660| 5.73k| auto size = p.this_size(); 661| 5.73k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 5.73k| return is_full ------------------ | Branch (662:12): [True: 5.73k, False: 0] ------------------ 663| 5.73k| ? (is_leaf ------------------ | Branch (663:19): [True: 3.97k, False: 1.75k] ------------------ 664| 5.73k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 5.73k| : make_full_pos(child, p.shift() - B) 666| 1.75k| .visit(v, idx - lsize, args...)) 667| 5.73k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 0] ------------------ 668| 0| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 0| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 0| .visit(v, idx - lsize, args...)); 672| 5.73k|} _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.66k| { 874| 7.66k| return each_left_regular(*this, v, last, args...); 875| 7.66k| } _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.66k|{ 576| 7.66k| constexpr auto B = bits; 577| 7.66k| constexpr auto BL = bits_leaf; 578| 7.66k| assert(last < p.count()); ------------------ | Branch (578:5): [True: 7.66k, False: 0] ------------------ 579| 7.66k| if (p.shift() == BL) { ------------------ | Branch (579:9): [True: 2.05k, False: 5.61k] ------------------ 580| 2.05k| auto n = p.node()->inner(); 581| 2.05k| auto e = n + last; 582| 4.40k| for (; n != e; ++n) { ------------------ | Branch (582:16): [True: 2.35k, False: 2.05k] ------------------ 583| 2.35k| IMMER_PREFETCH(n + 1); 584| 2.35k| make_full_leaf_pos(*n).visit(v, args...); 585| 2.35k| } 586| 5.61k| } else { 587| 5.61k| auto n = p.node()->inner(); 588| 5.61k| auto e = n + last; 589| 5.61k| auto ss = p.shift() - B; 590| 7.69k| for (; n != e; ++n) ------------------ | Branch (590:16): [True: 2.08k, False: 5.61k] ------------------ 591| 2.08k| make_full_pos(*n, ss).visit(v, args...); 592| 5.61k| } 593| 7.66k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_16dec_left_visitorEJRjEEEDcT_DpOT0_: 1813| 6.25k| { 1814| 6.25k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 6.25k| } _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| 198k| { 1706| 198k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 198k, False: 0] ------------------ 1707| 198k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 8.69k, False: 189k] ------------------ 1708| 198k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 198k| } _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| 198k| { 1718| 198k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 198k, False: 0] ------------------ 1719| 198k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 8.69k, False: 189k] | Branch (1719:9): [True: 198k, False: 0] ------------------ 1720| 198k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 198k| auto child = node_->inner()[offset_hint]; 1722| 198k| auto is_leaf = shift_ == BL; 1723| 198k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 198k| auto next_idx = idx - left_size_hint; 1725| 198k| return is_leaf ------------------ | Branch (1725:16): [True: 12.5k, False: 185k] ------------------ 1726| 198k| ? make_leaf_sub_pos(child, next_size) 1727| 12.5k| .visit(v, next_idx, args...) 1728| 198k| : visit_maybe_relaxed_sub( 1729| 185k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 198k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 12.5k| { 145| 12.5k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 12.5k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_22slice_left_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 185k|{ 1839| 185k| assert(node); ------------------ | Branch (1839:5): [True: 185k, False: 0] ------------------ 1840| 185k| auto relaxed = node->relaxed(); 1841| 185k| if (relaxed) { ------------------ | Branch (1841:9): [True: 184k, False: 1.80k] ------------------ 1842| 184k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 184k, False: 0] ------------------ 1843| 184k| return make_relaxed_pos(node, shift, relaxed) 1844| 184k| .visit(v, std::forward(args)...); 1845| 184k| } else { 1846| 1.80k| return make_regular_sub_pos(node, shift, size) 1847| 1.80k| .visit(v, std::forward(args)...); 1848| 1.80k| } 1849| 185k|} _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| 184k| { 1814| 184k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 184k| } _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.80k| { 1037| 1.80k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.80k| } _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| 66.0k| { 1706| 66.0k| assert(offset_hint == index(idx)); ------------------ | Branch (1706:9): [True: 66.0k, False: 0] ------------------ 1707| 66.0k| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1707:26): [True: 20.3k, False: 45.7k] ------------------ 1708| 66.0k| return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...); 1709| 66.0k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_: 1717| 66.0k| { 1718| 66.0k| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 66.0k, False: 0] ------------------ 1719| 66.0k| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 20.3k, False: 45.7k] | Branch (1719:9): [True: 66.0k, False: 0] ------------------ 1720| 66.0k| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 66.0k| auto child = node_->inner()[offset_hint]; 1722| 66.0k| auto is_leaf = shift_ == BL; 1723| 66.0k| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 66.0k| auto next_idx = idx - left_size_hint; 1725| 66.0k| return is_leaf ------------------ | Branch (1725:16): [True: 12.9k, False: 53.1k] ------------------ 1726| 66.0k| ? make_leaf_sub_pos(child, next_size) 1727| 12.9k| .visit(v, next_idx, args...) 1728| 66.0k| : visit_maybe_relaxed_sub( 1729| 53.1k| child, shift_ - B, next_size, v, next_idx, args...); 1730| 66.0k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 144| 12.9k| { 145| 12.9k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 12.9k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_: 1838| 53.1k|{ 1839| 53.1k| assert(node); ------------------ | Branch (1839:5): [True: 53.1k, False: 0] ------------------ 1840| 53.1k| auto relaxed = node->relaxed(); 1841| 53.1k| if (relaxed) { ------------------ | Branch (1841:9): [True: 51.1k, False: 1.92k] ------------------ 1842| 51.1k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 51.1k, False: 0] ------------------ 1843| 51.1k| return make_relaxed_pos(node, shift, relaxed) 1844| 51.1k| .visit(v, std::forward(args)...); 1845| 51.1k| } else { 1846| 1.92k| return make_regular_sub_pos(node, shift, size) 1847| 1.92k| .visit(v, std::forward(args)...); 1848| 1.92k| } 1849| 53.1k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1813| 51.1k| { 1814| 51.1k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 51.1k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 1.92k| { 1037| 1.92k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.92k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_22slice_left_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_: 1036| 8.39k| { 1037| 8.39k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 8.39k| } _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.24k| { 947| 4.24k| return towards_sub_oh_regular(*this, v, idx, offset_hint, args...); 948| 4.24k| } _ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_22slice_left_mut_visitorISD_Lb1ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjDpOT1_: 653| 4.24k|{ 654| 4.24k| constexpr auto B = bits; 655| 4.24k| constexpr auto BL = bits_leaf; 656| 4.24k| assert(offset_hint == p.index(idx)); ------------------ | Branch (656:5): [True: 4.24k, False: 0] ------------------ 657| 4.24k| auto is_leaf = p.shift() == BL; 658| 4.24k| auto child = p.node()->inner()[offset_hint]; 659| 4.24k| auto lsize = offset_hint << p.shift(); 660| 4.24k| auto size = p.this_size(); 661| 4.24k| auto is_full = (size - lsize) >= (size_t{1} << p.shift()); 662| 4.24k| return is_full ------------------ | Branch (662:12): [True: 3.10k, False: 1.14k] ------------------ 663| 4.24k| ? (is_leaf ------------------ | Branch (663:19): [True: 0, False: 3.10k] ------------------ 664| 3.10k| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 665| 3.10k| : make_full_pos(child, p.shift() - B) 666| 3.10k| .visit(v, idx - lsize, args...)) 667| 4.24k| : (is_leaf ------------------ | Branch (667:19): [True: 0, False: 1.14k] ------------------ 668| 1.14k| ? make_leaf_sub_pos(child, size - lsize) 669| 0| .visit(v, idx - lsize, args...) 670| 1.14k| : make_regular_sub_pos(child, p.shift() - B, size - lsize) 671| 1.14k| .visit(v, idx - lsize, args...)); 672| 4.24k|} _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.43k| { 1406| 3.43k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 3.43k| } _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| 335| { 1349| 335| assert(offset_hint == index(idx)); ------------------ | Branch (1349:9): [True: 335, False: 0] ------------------ 1350| 335| auto is_leaf = shift_ == BL; 1351| 335| auto child = node_->inner()[offset_hint]; 1352| 335| auto lsize = size_t{offset_hint} << shift_; 1353| 335| return is_leaf ------------------ | Branch (1353:16): [True: 0, False: 335] ------------------ 1354| 335| ? make_full_leaf_pos(child).visit(v, idx - lsize, args...) 1355| 335| : make_full_pos(child, shift_ - B) 1356| 335| .visit(v, idx - lsize, args...); 1357| 335| } _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.14k| { 1037| 1.14k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.14k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitor3rrbEJNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERKPSC_RKjRmEEEDcPT_jmT0_DpOT1_: 1838| 17.8k|{ 1839| 17.8k| assert(node); ------------------ | Branch (1839:5): [True: 17.8k, False: 0] ------------------ 1840| 17.8k| auto relaxed = node->relaxed(); 1841| 17.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 11.6k, False: 6.23k] ------------------ 1842| 11.6k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 11.6k, False: 0] ------------------ 1843| 11.6k| return make_relaxed_pos(node, shift, relaxed) 1844| 11.6k| .visit(v, std::forward(args)...); 1845| 11.6k| } else { 1846| 6.23k| return make_regular_sub_pos(node, shift, size) 1847| 6.23k| .visit(v, std::forward(args)...); 1848| 6.23k| } 1849| 17.8k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor3rrbEJNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERKPSC_RKjRmEEEDcT_DpOT0_: 1813| 11.6k| { 1814| 11.6k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 11.6k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcPT_jmT0_DpOT1_: 1838| 11.6k|{ 1839| 11.6k| assert(node); ------------------ | Branch (1839:5): [True: 11.6k, False: 0] ------------------ 1840| 11.6k| auto relaxed = node->relaxed(); 1841| 11.6k| if (relaxed) { ------------------ | Branch (1841:9): [True: 8.53k, False: 3.08k] ------------------ 1842| 8.53k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 8.53k, False: 0] ------------------ 1843| 8.53k| return make_relaxed_pos(node, shift, relaxed) 1844| 8.53k| .visit(v, std::forward(args)...); 1845| 8.53k| } else { 1846| 3.08k| return make_regular_sub_pos(node, shift, size) 1847| 3.08k| .visit(v, std::forward(args)...); 1848| 3.08k| } 1849| 11.6k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcT_DpOT0_: 1813| 8.53k| { 1814| 8.53k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 8.53k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcjT_DpOT0_: 1793| 32.8k| { 1794| 32.8k| auto child = node_->inner()[offset]; 1795| 32.8k| auto child_size = size(offset); 1796| 32.8k| auto is_leaf = shift_ == BL; 1797| 32.8k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 8.95k, False: 23.8k] ------------------ 1798| 32.8k| : visit_maybe_relaxed_sub( 1799| 23.8k| child, shift_ - B, child_size, v, args...); 1800| 32.8k| } _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.32k| { 145| 9.32k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 9.32k| } _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.32k| { 1805| 9.32k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 9.32k, False: 0] ------------------ 1806| 9.32k| auto child = node_->inner()[offset]; 1807| 9.32k| auto child_size = size(offset); 1808| 9.32k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 9.32k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 144| 9.89k| { 145| 9.89k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 9.89k| } _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| 23.8k|{ 1839| 23.8k| assert(node); ------------------ | Branch (1839:5): [True: 23.8k, False: 0] ------------------ 1840| 23.8k| auto relaxed = node->relaxed(); 1841| 23.8k| if (relaxed) { ------------------ | Branch (1841:9): [True: 21.3k, False: 2.51k] ------------------ 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| 2.51k| return make_regular_sub_pos(node, shift, size) 1847| 2.51k| .visit(v, std::forward(args)...); 1848| 2.51k| } 1849| 23.8k|} _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.3k| { 1814| 21.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 21.3k| } _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.3k| { 1794| 21.3k| auto child = node_->inner()[offset]; 1795| 21.3k| auto child_size = size(offset); 1796| 21.3k| auto is_leaf = shift_ == BL; 1797| 21.3k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 21.3k] ------------------ 1798| 21.3k| : visit_maybe_relaxed_sub( 1799| 21.3k| child, shift_ - B, child_size, v, args...); 1800| 21.3k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcPT_jmT0_DpOT1_: 1838| 21.3k|{ 1839| 21.3k| assert(node); ------------------ | Branch (1839:5): [True: 21.3k, False: 0] ------------------ 1840| 21.3k| auto relaxed = node->relaxed(); 1841| 21.3k| if (relaxed) { ------------------ | Branch (1841:9): [True: 20.3k, False: 1.03k] ------------------ 1842| 20.3k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 20.3k, False: 0] ------------------ 1843| 20.3k| return make_relaxed_pos(node, shift, relaxed) 1844| 20.3k| .visit(v, std::forward(args)...); 1845| 20.3k| } else { 1846| 1.03k| return make_regular_sub_pos(node, shift, size) 1847| 1.03k| .visit(v, std::forward(args)...); 1848| 1.03k| } 1849| 21.3k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRSD_RNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1813| 20.3k| { 1814| 20.3k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 20.3k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1036| 1.34k| { 1037| 1.34k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.34k| } _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.60k| { 1794| 6.60k| auto child = node_->inner()[offset]; 1795| 6.60k| auto child_size = size(offset); 1796| 6.60k| auto is_leaf = shift_ == BL; 1797| 6.60k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 3.61k, False: 2.98k] ------------------ 1798| 6.60k| : visit_maybe_relaxed_sub( 1799| 2.98k| child, shift_ - B, child_size, v, args...); 1800| 6.60k| } _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.61k| { 145| 3.61k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 3.61k| } _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.61k| { 1026| 3.61k| assert(shift_ == BL); ------------------ | Branch (1026:9): [True: 3.61k, False: 0] ------------------ 1027| 3.61k| auto child = node_->inner()[idx]; 1028| 3.61k| auto lsize = size(idx); 1029| 3.61k| auto is_full = idx + 1 < count(); 1030| 3.61k| return is_full ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1030:16): [True: 3.04k, False: 568] ------------------ 1031| 3.61k| : make_leaf_sub_pos(child, lsize).visit(v, args...); 1032| 3.61k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 207| 7.07k| { 208| 7.07k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 7.07k| } _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.98k|{ 1839| 2.98k| assert(node); ------------------ | Branch (1839:5): [True: 2.98k, False: 0] ------------------ 1840| 2.98k| auto relaxed = node->relaxed(); 1841| 2.98k| if (relaxed) { ------------------ | Branch (1841:9): [True: 2.20k, False: 777] ------------------ 1842| 2.20k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 2.20k, False: 0] ------------------ 1843| 2.20k| return make_relaxed_pos(node, shift, relaxed) 1844| 2.20k| .visit(v, std::forward(args)...); 1845| 2.20k| } else { 1846| 777| return make_regular_sub_pos(node, shift, size) 1847| 777| .visit(v, std::forward(args)...); 1848| 777| } 1849| 2.98k|} _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.20k| { 1814| 2.20k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 2.20k| } _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.20k| { 1008| 2.20k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 2.20k, False: 0] ------------------ 1009| 2.20k| auto is_leaf = shift_ == BL; 1010| 2.20k| auto child = node_->inner()[idx]; 1011| 2.20k| auto lsize = size(idx); 1012| 2.20k| auto is_full = idx + 1 < count(); 1013| 2.20k| return is_full ------------------ | Branch (1013:16): [True: 1.89k, False: 312] ------------------ 1014| 2.20k| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 1.89k] ------------------ 1015| 1.89k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.89k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 2.20k| : (is_leaf ------------------ | Branch (1017:23): [True: 0, False: 312] ------------------ 1018| 312| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 312| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 312| .visit(v, args...)); 1021| 2.20k| } _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.77k| { 1406| 2.77k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.77k| } _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.90k| { 1794| 5.90k| auto child = node_->inner()[offset]; 1795| 5.90k| auto child_size = size(offset); 1796| 5.90k| auto is_leaf = shift_ == BL; 1797| 5.90k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 4.02k, False: 1.88k] ------------------ 1798| 5.90k| : visit_maybe_relaxed_sub( 1799| 1.88k| child, shift_ - B, child_size, v, args...); 1800| 5.90k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 144| 4.02k| { 145| 4.02k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.02k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_12leaf_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcjT_DpOT0_: 1396| 4.02k| { 1397| 4.02k| assert(shift_ == BL); ------------------ | Branch (1397:9): [True: 4.02k, False: 0] ------------------ 1398| 4.02k| assert(idx < count()); ------------------ | Branch (1398:9): [True: 4.02k, False: 0] ------------------ 1399| 4.02k| auto child = node_->inner()[idx]; 1400| 4.02k| return make_full_leaf_pos(child).visit(v, args...); 1401| 4.02k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitor10this_aux_tEJRjRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcPT_jmT0_DpOT1_: 1838| 1.88k|{ 1839| 1.88k| assert(node); ------------------ | Branch (1839:5): [True: 1.88k, False: 0] ------------------ 1840| 1.88k| auto relaxed = node->relaxed(); 1841| 1.88k| if (relaxed) { ------------------ | Branch (1841:9): [True: 882, False: 998] ------------------ 1842| 882| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 882, False: 0] ------------------ 1843| 882| return make_relaxed_pos(node, shift, relaxed) 1844| 882| .visit(v, std::forward(args)...); 1845| 998| } else { 1846| 998| return make_regular_sub_pos(node, shift, size) 1847| 998| .visit(v, std::forward(args)...); 1848| 998| } 1849| 1.88k|} _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| 882| { 1814| 882| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 882| } _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| 882| { 1387| 882| assert(idx < count()); ------------------ | Branch (1387:9): [True: 882, False: 0] ------------------ 1388| 882| auto is_leaf = shift_ == BL; 1389| 882| auto child = node_->inner()[idx]; 1390| 882| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 882] ------------------ 1391| 882| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 882| } _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| 998| { 1037| 998| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 998| } _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| 998| { 1387| 998| assert(idx < count()); ------------------ | Branch (1387:9): [True: 998, False: 0] ------------------ 1388| 998| auto is_leaf = shift_ == BL; 1389| 998| auto child = node_->inner()[idx]; 1390| 998| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 0, False: 998] ------------------ 1391| 998| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 998| } _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.77k| { 1406| 1.77k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 1.77k| } _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| 2.94k| { 1223| 2.94k| auto p = node_->inner(); 1224| 2.94k| auto p2 = other->inner(); 1225| 2.94k| auto e = p + branches; 1226| 2.94k| if (shift_ == BL) { ------------------ | Branch (1226:13): [True: 2.25k, False: 688] ------------------ 1227| 8.43k| for (; p != e; ++p, ++p2) { ------------------ | Branch (1227:20): [True: 7.22k, False: 1.20k] ------------------ 1228| 7.22k| IMMER_PREFETCH(p + 1); 1229| 7.22k| if (!make_full_leaf_pos(*p).visit(v, *p2, args...)) ------------------ | Branch (1229:21): [True: 1.04k, False: 6.17k] ------------------ 1230| 1.04k| return false; 1231| 7.22k| } 1232| 2.25k| } else { 1233| 688| auto ss = shift_ - B; 1234| 2.38k| for (; p != e; ++p, ++p2) ------------------ | Branch (1234:20): [True: 2.08k, False: 300] ------------------ 1235| 2.08k| if (!make_full_pos(*p, ss).visit(v, *p2, args...)) ------------------ | Branch (1235:21): [True: 388, False: 1.69k] ------------------ 1236| 388| return false; 1237| 688| } 1238| 1.50k| return true; 1239| 2.94k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 207| 11.2k| { 208| 11.2k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 11.2k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 1405| 7.05k| { 1406| 7.05k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 7.05k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE13each_pred_zipINS1_14equals_visitorEJEEEbT_PSC_DpOT0_: 837| 4.93k| { 838| 4.93k| return each_pred_zip_regular(*this, v, other, args...); 839| 4.93k| } _ZN5immer6detail4rbts21each_pred_zip_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_14equals_visitorEJEEEbOT_T0_PNSt3__15decayISH_E4type6node_tEDpOT1_: 392| 4.93k|{ 393| 4.93k| constexpr auto B = bits; 394| 4.93k| constexpr auto BL = bits_leaf; 395| | 396| 4.93k| auto n = p.node()->inner(); 397| 4.93k| auto n2 = other->inner(); 398| 4.93k| auto last = p.count() - 1; 399| 4.93k| auto e = n + last; 400| 4.93k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 1.84k, False: 3.09k] ------------------ 401| 4.06k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 2.66k, False: 1.40k] ------------------ 402| 2.66k| IMMER_PREFETCH(n + 1); 403| 2.66k| IMMER_PREFETCH(n2 + 1); 404| 2.66k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 444, False: 2.22k] ------------------ 405| 444| return false; 406| 2.66k| } 407| 1.40k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 3.09k| } else { 409| 3.09k| auto ss = p.shift() - B; 410| 6.17k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 3.69k, False: 2.48k] ------------------ 411| 3.69k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 608, False: 3.08k] ------------------ 412| 608| return false; 413| 2.48k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 3.09k| } 415| 4.93k|} _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 112| 3.09k| { 113| 3.09k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 3.09k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRPSC_EEEDcT_DpOT0_: 336| 3.53k| { 337| 3.53k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 3.53k| } _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.19k| { 256| 3.19k| return each_pred_zip_regular(*this, v, other, args...); 257| 3.19k| } _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.19k|{ 393| 3.19k| constexpr auto B = bits; 394| 3.19k| constexpr auto BL = bits_leaf; 395| | 396| 3.19k| auto n = p.node()->inner(); 397| 3.19k| auto n2 = other->inner(); 398| 3.19k| auto last = p.count() - 1; 399| 3.19k| auto e = n + last; 400| 3.19k| if (p.shift() == BL) { ------------------ | Branch (400:9): [True: 1.94k, False: 1.25k] ------------------ 401| 3.04k| for (; n != e; ++n, ++n2) { ------------------ | Branch (401:16): [True: 1.35k, False: 1.69k] ------------------ 402| 1.35k| IMMER_PREFETCH(n + 1); 403| 1.35k| IMMER_PREFETCH(n2 + 1); 404| 1.35k| if (!make_full_leaf_pos(*n).visit(v, *n2, args...)) ------------------ | Branch (404:17): [True: 254, False: 1.10k] ------------------ 405| 254| return false; 406| 1.35k| } 407| 1.69k| return make_leaf_pos(*n, p.size()).visit(v, *n2, args...); 408| 1.94k| } else { 409| 1.25k| auto ss = p.shift() - B; 410| 2.32k| for (; n != e; ++n, ++n2) ------------------ | Branch (410:16): [True: 1.27k, False: 1.04k] ------------------ 411| 1.27k| if (!make_full_pos(*n, ss).visit(v, *n2, args...)) ------------------ | Branch (411:17): [True: 205, False: 1.07k] ------------------ 412| 205| return false; 413| 1.04k| return make_regular_pos(*n, ss, p.size()).visit(v, *n2, args...); 414| 1.25k| } 415| 3.19k|} _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_24for_each_chunk_p_visitorEJZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEDcjSK_DpOT0_: 1386| 4.59k| { 1387| 4.59k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 4.59k, False: 0] ------------------ 1388| 4.59k| auto is_leaf = shift_ == BL; 1389| 4.59k| auto child = node_->inner()[idx]; 1390| 4.59k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 3.25k, False: 1.33k] ------------------ 1391| 4.59k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 4.59k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 207| 303k| { 208| 303k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 303k| } _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| 8.84M|{ 1839| 8.84M| assert(node); ------------------ | Branch (1839:5): [True: 8.84M, False: 0] ------------------ 1840| 8.84M| auto relaxed = node->relaxed(); 1841| 8.84M| if (relaxed) { ------------------ | Branch (1841:9): [True: 8.52M, False: 327k] ------------------ 1842| 8.52M| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 8.52M, False: 0] ------------------ 1843| 8.52M| return make_relaxed_pos(node, shift, relaxed) 1844| 8.52M| .visit(v, std::forward(args)...); 1845| 8.52M| } else { 1846| 327k| return make_regular_sub_pos(node, shift, size) 1847| 327k| .visit(v, std::forward(args)...); 1848| 327k| } 1849| 8.84M|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1813| 8.52M| { 1814| 8.52M| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 8.52M| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1679| 8.52M| { 1680| 8.52M| return towards_oh(v, idx, subindex(idx), args...); 1681| 8.52M| } _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.52M| { 1687| 8.52M| assert(offset_hint == index(idx)); ------------------ | Branch (1687:9): [True: 8.52M, False: 0] ------------------ 1688| 8.52M| auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0; ------------------ | Branch (1688:26): [True: 4.58M, False: 3.93M] ------------------ 1689| 8.52M| return towards_oh_sbh(v, idx, offset_hint, left_size, args...); 1690| 8.52M| } _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.52M| { 1699| 8.52M| return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...); 1700| 8.52M| } _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.52M| { 1718| 8.52M| assert(offset_hint == index(idx)); ------------------ | Branch (1718:9): [True: 8.52M, False: 0] ------------------ 1719| 8.52M| assert(left_size_hint == ------------------ | Branch (1719:9): [True: 4.58M, False: 3.93M] | Branch (1719:9): [True: 8.52M, False: 0] ------------------ 1720| 8.52M| (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0)); 1721| 8.52M| auto child = node_->inner()[offset_hint]; 1722| 8.52M| auto is_leaf = shift_ == BL; 1723| 8.52M| auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint; 1724| 8.52M| auto next_idx = idx - left_size_hint; 1725| 8.52M| return is_leaf ------------------ | Branch (1725:16): [True: 908k, False: 7.61M] ------------------ 1726| 8.52M| ? make_leaf_sub_pos(child, next_size) 1727| 908k| .visit(v, next_idx, args...) 1728| 8.52M| : visit_maybe_relaxed_sub( 1729| 7.61M| child, shift_ - B, next_size, v, next_idx, args...); 1730| 8.52M| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 144| 908k| { 145| 908k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 908k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1036| 327k| { 1037| 327k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 327k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 919| 327k| { 920| 327k| return towards_oh_ch_regular( 921| 327k| *this, v, idx, index(idx), count(), args...); 922| 327k| } _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| 327k|{ 633| 327k| constexpr auto B = bits; 634| 327k| constexpr auto BL = bits_leaf; 635| 327k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 327k, False: 0] ------------------ 636| 327k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 327k, False: 0] ------------------ 637| 327k| auto is_leaf = p.shift() == BL; 638| 327k| auto child = p.node()->inner()[offset_hint]; 639| 327k| auto is_full = offset_hint + 1 != count_hint; 640| 327k| return is_full ------------------ | Branch (640:12): [True: 238k, False: 89.0k] ------------------ 641| 327k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 41.9k, False: 196k] ------------------ 642| 238k| : make_full_pos(child, p.shift() - B) 643| 196k| .visit(v, idx, args...)) 644| 327k| : (is_leaf ------------------ | Branch (644:19): [True: 16.1k, False: 72.9k] ------------------ 645| 89.0k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 89.0k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 72.9k| .visit(v, idx, args...)); 648| 327k|} _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 207| 305k| { 208| 305k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 305k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 1405| 852k| { 1406| 852k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 852k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 1322| 852k| { 1323| 852k| return towards_oh(v, idx, index(idx), args...); 1324| 852k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE10towards_ohINS1_18region_for_visitorIiEEJEEEDcT_mjDpOT0_: 1336| 852k| { 1337| 852k| assert(offset_hint == index(idx)); ------------------ | Branch (1337:9): [True: 852k, False: 0] ------------------ 1338| 852k| auto is_leaf = shift_ == BL; 1339| 852k| auto child = node_->inner()[offset_hint]; 1340| 852k| return is_leaf ------------------ | Branch (1340:16): [True: 255k, False: 597k] ------------------ 1341| 852k| ? make_full_leaf_pos(child).visit(v, idx, args...) 1342| 852k| : make_full_pos(child, shift_ - B).visit(v, idx, args...); 1343| 852k| } _ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 112| 21.5k| { 113| 21.5k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 21.5k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_18region_for_visitorIiEEJRmEEEDcT_DpOT0_: 336| 95.7k| { 337| 95.7k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 95.7k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7towardsINS1_18region_for_visitorIiEEJEEEDcT_mDpOT0_: 297| 95.7k| { 298| 95.7k| return towards_oh_ch_regular( 299| 95.7k| *this, v, idx, index(idx), count(), args...); 300| 95.7k| } _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| 95.7k|{ 633| 95.7k| constexpr auto B = bits; 634| 95.7k| constexpr auto BL = bits_leaf; 635| 95.7k| assert(offset_hint == p.index(idx)); ------------------ | Branch (635:5): [True: 95.7k, False: 0] ------------------ 636| 95.7k| assert(count_hint == p.count()); ------------------ | Branch (636:5): [True: 95.7k, False: 0] ------------------ 637| 95.7k| auto is_leaf = p.shift() == BL; 638| 95.7k| auto child = p.node()->inner()[offset_hint]; 639| 95.7k| auto is_full = offset_hint + 1 != count_hint; 640| 95.7k| return is_full ------------------ | Branch (640:12): [True: 67.5k, False: 28.2k] ------------------ 641| 95.7k| ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...) ------------------ | Branch (641:19): [True: 8.45k, False: 59.0k] ------------------ 642| 67.5k| : make_full_pos(child, p.shift() - B) 643| 59.0k| .visit(v, idx, args...)) 644| 95.7k| : (is_leaf ------------------ | Branch (644:19): [True: 5.45k, False: 22.7k] ------------------ 645| 28.2k| ? make_leaf_pos(child, p.size()).visit(v, idx, args...) 646| 28.2k| : make_regular_pos(child, p.shift() - B, p.size()) 647| 22.7k| .visit(v, idx, args...)); 648| 95.7k|} _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| 81.5k| { 1406| 81.5k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 81.5k| } _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| 81.5k| { 1203| 81.5k| auto p = node_->inner(); 1204| 81.5k| auto e = p + branches; 1205| 81.5k| if (shift_ == BL) { ------------------ | Branch (1205:13): [True: 64.1k, False: 17.4k] ------------------ 1206| 318k| for (; p != e; ++p) { ------------------ | Branch (1206:20): [True: 255k, False: 63.1k] ------------------ 1207| 255k| IMMER_PREFETCH(p + 1); 1208| 255k| if (!make_full_leaf_pos(*p).visit(v, args...)) ------------------ | Branch (1208:21): [True: 925, False: 254k] ------------------ 1209| 925| return false; 1210| 255k| } 1211| 64.1k| } else { 1212| 17.4k| auto ss = shift_ - B; 1213| 86.2k| for (; p != e; ++p) ------------------ | Branch (1213:20): [True: 69.2k, False: 17.0k] ------------------ 1214| 69.2k| if (!make_full_pos(*p, ss).visit(v, args...)) ------------------ | Branch (1214:21): [True: 414, False: 68.8k] ------------------ 1215| 414| return false; 1216| 17.4k| } 1217| 80.1k| return true; 1218| 81.5k| } _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| 777| { 1037| 777| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 777| } _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| 777| { 1008| 777| assert(idx < count()); ------------------ | Branch (1008:9): [True: 777, False: 0] ------------------ 1009| 777| auto is_leaf = shift_ == BL; 1010| 777| auto child = node_->inner()[idx]; 1011| 777| auto lsize = size(idx); 1012| 777| auto is_full = idx + 1 < count(); 1013| 777| return is_full ------------------ | Branch (1013:16): [True: 777, False: 0] ------------------ 1014| 777| ? (is_leaf ------------------ | Branch (1014:23): [True: 0, False: 777] ------------------ 1015| 777| ? make_full_leaf_pos(child).visit(v, args...) 1016| 777| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 777| : (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| 777| } _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.73k| { 1037| 1.73k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 1.73k| } _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.51k, False: 2.74k] ------------------ 1014| 4.26k| ? (is_leaf ------------------ | Branch (1014:23): [True: 850, False: 668] ------------------ 1015| 1.51k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 1.51k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 4.26k| : (is_leaf ------------------ | Branch (1017:23): [True: 1.41k, False: 1.32k] ------------------ 1018| 2.74k| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 2.74k| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 1.32k| .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| 893k| { 145| 893k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 893k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 1036| 18.2k| { 1037| 18.2k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 18.2k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 831| 18.2k| { 832| 18.2k| return each_pred_regular(*this, v, args...); 833| 18.2k| } _ZN5immer6detail4rbts17each_pred_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSC_Lj2ELj2EEEEEDaOT_EUlSL_T0_E_EEEbSM_SN_DpOT1_: 365| 18.2k|{ 366| 18.2k| constexpr auto B = bits; 367| 18.2k| constexpr auto BL = bits_leaf; 368| 18.2k| auto n = p.node()->inner(); 369| 18.2k| auto last = p.count() - 1; 370| 18.2k| auto e = n + last; 371| 18.2k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 13.5k, False: 4.65k] ------------------ 372| 50.1k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 36.8k, False: 13.3k] ------------------ 373| 36.8k| IMMER_PREFETCH(n + 1); 374| 36.8k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 210, False: 36.6k] ------------------ 375| 210| return false; 376| 36.8k| } 377| 13.3k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 13.5k| } else { 379| 4.65k| auto ss = p.shift() - B; 380| 11.2k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 7.17k, False: 4.05k] ------------------ 381| 7.17k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 598, False: 6.57k] ------------------ 382| 598| return false; 383| 4.05k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 4.65k| } 385| 18.2k|} _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| 16.8k| { 113| 16.8k| return Visitor::visit_leaf(*this, std::forward(args)...); 114| 16.8k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 336| 5.91k| { 337| 5.91k| return Visitor::visit_regular(*this, std::forward(args)...); 338| 5.91k| } _ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 249| 5.91k| { 250| 5.91k| return each_pred_regular(*this, v, args...); 251| 5.91k| } _ZN5immer6detail4rbts17each_pred_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSC_Lj2ELj2EEEEEDaOT_EUlSL_T0_E_EEEbSM_SN_DpOT1_: 365| 5.91k|{ 366| 5.91k| constexpr auto B = bits; 367| 5.91k| constexpr auto BL = bits_leaf; 368| 5.91k| auto n = p.node()->inner(); 369| 5.91k| auto last = p.count() - 1; 370| 5.91k| auto e = n + last; 371| 5.91k| if (p.shift() == BL) { ------------------ | Branch (371:9): [True: 3.74k, False: 2.16k] ------------------ 372| 10.5k| for (; n != e; ++n) { ------------------ | Branch (372:16): [True: 7.04k, False: 3.47k] ------------------ 373| 7.04k| IMMER_PREFETCH(n + 1); 374| 7.04k| if (!make_full_leaf_pos(*n).visit(v, args...)) ------------------ | Branch (374:17): [True: 276, False: 6.76k] ------------------ 375| 276| return false; 376| 7.04k| } 377| 3.47k| return make_leaf_pos(*n, p.size()).visit(v, args...); 378| 3.74k| } else { 379| 2.16k| auto ss = p.shift() - B; 380| 4.95k| for (; n != e; ++n) ------------------ | Branch (380:16): [True: 3.09k, False: 1.85k] ------------------ 381| 3.09k| if (!make_full_pos(*n, ss).visit(v, args...)) ------------------ | Branch (381:17): [True: 305, False: 2.79k] ------------------ 382| 305| return false; 383| 1.85k| return make_regular_pos(*n, ss, p.size()).visit(v, args...); 384| 2.16k| } 385| 5.91k|} _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.51k| { 1037| 2.51k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 2.51k| } _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.51k| { 1794| 2.51k| auto child = node_->inner()[offset]; 1795| 2.51k| auto child_size = size(offset); 1796| 2.51k| auto is_leaf = shift_ == BL; 1797| 2.51k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 2.51k] ------------------ 1798| 2.51k| : visit_maybe_relaxed_sub( 1799| 2.51k| child, shift_ - B, child_size, v, args...); 1800| 2.51k| } _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.51k|{ 1839| 2.51k| assert(node); ------------------ | Branch (1839:5): [True: 2.51k, False: 0] ------------------ 1840| 2.51k| auto relaxed = node->relaxed(); 1841| 2.51k| if (relaxed) { ------------------ | Branch (1841:9): [True: 781, False: 1.73k] ------------------ 1842| 781| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 781, False: 0] ------------------ 1843| 781| return make_relaxed_pos(node, shift, relaxed) 1844| 781| .visit(v, std::forward(args)...); 1845| 1.73k| } else { 1846| 1.73k| return make_regular_sub_pos(node, shift, size) 1847| 1.73k| .visit(v, std::forward(args)...); 1848| 1.73k| } 1849| 2.51k|} _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| 781| { 1814| 781| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 781| } _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.08k| { 1008| 4.08k| assert(idx < count()); ------------------ | Branch (1008:9): [True: 4.08k, False: 0] ------------------ 1009| 4.08k| auto is_leaf = shift_ == BL; 1010| 4.08k| auto child = node_->inner()[idx]; 1011| 4.08k| auto lsize = size(idx); 1012| 4.08k| auto is_full = idx + 1 < count(); 1013| 4.08k| return is_full ------------------ | Branch (1013:16): [True: 3.72k, False: 367] ------------------ 1014| 4.08k| ? (is_leaf ------------------ | Branch (1014:23): [True: 2.24k, False: 1.47k] ------------------ 1015| 3.72k| ? make_full_leaf_pos(child).visit(v, args...) 1016| 3.72k| : make_full_pos(child, shift_ - B).visit(v, args...)) 1017| 4.08k| : (is_leaf ------------------ | Branch (1017:23): [True: 367, False: 0] ------------------ 1018| 367| ? make_leaf_sub_pos(child, lsize).visit(v, args...) 1019| 367| : make_regular_sub_pos(child, shift_ - B, lsize) 1020| 0| .visit(v, args...)); 1021| 4.08k| } _ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 207| 4.73k| { 208| 4.73k| return Visitor::visit_leaf(*this, std::forward(args)...); 209| 4.73k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE12nth_sub_leafINS1_14equals_visitorEJRNS1_13full_leaf_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcjT_DpOT0_: 1804| 4.73k| { 1805| 4.73k| assert(shift_ == BL); ------------------ | Branch (1805:9): [True: 4.73k, False: 0] ------------------ 1806| 4.73k| auto child = node_->inner()[offset]; 1807| 4.73k| auto child_size = size(offset); 1808| 4.73k| return make_leaf_sub_pos(child, child_size).visit(v, args...); 1809| 4.73k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRNS1_13full_leaf_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 144| 4.73k| { 145| 4.73k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 4.73k| } _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.65k| { 1406| 2.65k| return Visitor::visit_regular(*this, std::forward(args)...); 1407| 2.65k| } _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.65k| { 1794| 2.65k| auto child = node_->inner()[offset]; 1795| 2.65k| auto child_size = size(offset); 1796| 2.65k| auto is_leaf = shift_ == BL; 1797| 2.65k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 0, False: 2.65k] ------------------ 1798| 2.65k| : visit_maybe_relaxed_sub( 1799| 2.65k| child, shift_ - B, child_size, v, args...); 1800| 2.65k| } _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.65k|{ 1839| 2.65k| assert(node); ------------------ | Branch (1839:5): [True: 2.65k, False: 0] ------------------ 1840| 2.65k| auto relaxed = node->relaxed(); 1841| 2.65k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.60k, False: 1.04k] ------------------ 1842| 1.60k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.60k, False: 0] ------------------ 1843| 1.60k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.60k| .visit(v, std::forward(args)...); 1845| 1.60k| } else { 1846| 1.04k| return make_regular_sub_pos(node, shift, size) 1847| 1.04k| .visit(v, std::forward(args)...); 1848| 1.04k| } 1849| 2.65k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRNS1_8full_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERmEEEDcT_DpOT0_: 1813| 1.60k| { 1814| 1.60k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.60k| } _ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE7nth_subINS1_14equals_visitor10this_aux_tEJRjRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcjT_DpOT0_: 1386| 3.67k| { 1387| 3.67k| assert(idx < count()); ------------------ | Branch (1387:9): [True: 3.67k, False: 0] ------------------ 1388| 3.67k| auto is_leaf = shift_ == BL; 1389| 3.67k| auto child = node_->inner()[idx]; 1390| 3.67k| return is_leaf ? make_full_leaf_pos(child).visit(v, args...) ------------------ | Branch (1390:16): [True: 2.49k, False: 1.17k] ------------------ 1391| 3.67k| : make_full_pos(child, shift_ - B).visit(v, args...); 1392| 3.67k| } _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| 22.8k| { 1794| 22.8k| auto child = node_->inner()[offset]; 1795| 22.8k| auto child_size = size(offset); 1796| 22.8k| auto is_leaf = shift_ == BL; 1797| 22.8k| return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...) ------------------ | Branch (1797:16): [True: 8.06k, False: 14.7k] ------------------ 1798| 22.8k| : visit_maybe_relaxed_sub( 1799| 14.7k| child, shift_ - B, child_size, v, args...); 1800| 22.8k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSI_T0_E_EEEDcPSI_jmSK_DpOT1_: 1838| 596k|{ 1839| 596k| assert(node); ------------------ | Branch (1839:5): [True: 596k, False: 0] ------------------ 1840| 596k| auto relaxed = node->relaxed(); 1841| 596k| if (relaxed) { ------------------ | Branch (1841:9): [True: 579k, False: 16.8k] ------------------ 1842| 579k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 579k, False: 0] ------------------ 1843| 579k| return make_relaxed_pos(node, shift, relaxed) 1844| 579k| .visit(v, std::forward(args)...); 1845| 579k| } else { 1846| 16.8k| return make_regular_sub_pos(node, shift, size) 1847| 16.8k| .visit(v, std::forward(args)...); 1848| 16.8k| } 1849| 596k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEDcSK_DpOT0_: 1813| 579k| { 1814| 579k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 579k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE9each_predINS1_24for_each_chunk_p_visitorEJRZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEEEDaOT_EUlSK_T0_E_EEEbSK_DpOT0_: 1482| 579k| { 1483| 579k| auto p = node_->inner(); 1484| 579k| auto s = size_t{}; 1485| 579k| auto n = count(); 1486| 579k| if (shift_ == BL) { ------------------ | Branch (1486:13): [True: 264k, False: 314k] ------------------ 1487| 1.14M| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1487:39): [True: 883k, False: 264k] ------------------ 1488| 883k| IMMER_PREFETCH(p + i + 1); 1489| 883k| if (!make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s) ------------------ | Branch (1489:21): [True: 355, False: 883k] ------------------ 1490| 883k| .visit(v, args...)) 1491| 355| return false; 1492| 883k| s = relaxed_->d.sizes[i]; 1493| 883k| } 1494| 314k| } else { 1495| 314k| auto ss = shift_ - B; 1496| 895k| for (auto i = count_t{0}; i < n; ++i) { ------------------ | Branch (1496:39): [True: 581k, False: 314k] ------------------ 1497| 581k| if (!visit_maybe_relaxed_sub( ------------------ | Branch (1497:21): [True: 471, False: 581k] ------------------ 1498| 581k| p[i], ss, relaxed_->d.sizes[i] - s, v, args...)) 1499| 471| return false; 1500| 581k| s = relaxed_->d.sizes[i]; 1501| 581k| } 1502| 314k| } 1503| 578k| return true; 1504| 579k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRNS1_11relaxed_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcT_DpOT0_: 1036| 3.08k| { 1037| 3.08k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 3.08k| } _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE15first_sub_innerINS1_14equals_visitor3rrbEJRNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERPSC_RjRmEEEDcT_DpOT0_: 1783| 1.43k| { 1784| 1.43k| assert(shift_ > BL); ------------------ | Branch (1784:9): [True: 1.43k, False: 0] ------------------ 1785| 1.43k| auto child = node_->inner()[0]; 1786| 1.43k| auto child_size = relaxed_->d.sizes[0]; 1787| 1.43k| return visit_maybe_relaxed_sub( 1788| 1.43k| child, shift_ - B, child_size, v, args...); 1789| 1.43k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitor3rrbEJRNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERPSC_RjRmEEEDcPT_jmT0_DpOT1_: 1838| 1.43k|{ 1839| 1.43k| assert(node); ------------------ | Branch (1839:5): [True: 1.43k, False: 0] ------------------ 1840| 1.43k| auto relaxed = node->relaxed(); 1841| 1.43k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.43k, False: 0] ------------------ 1842| 1.43k| assert(size == relaxed->d.sizes[relaxed->d.count - 1]); ------------------ | Branch (1842:9): [True: 1.43k, False: 0] ------------------ 1843| 1.43k| return make_relaxed_pos(node, shift, relaxed) 1844| 1.43k| .visit(v, std::forward(args)...); 1845| 1.43k| } else { 1846| 0| return make_regular_sub_pos(node, shift, size) 1847| 0| .visit(v, std::forward(args)...); 1848| 0| } 1849| 1.43k|} _ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor3rrbEJRNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERPSC_RjRmEEEDcT_DpOT0_: 1813| 1.43k| { 1814| 1.43k| return Visitor::visit_relaxed(*this, std::forward(args)...); 1815| 1.43k| } _ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS1_14equals_visitorEJRNS1_15regular_sub_posISC_EERNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEEmEEEDcPT_jmT0_DpOT1_: 1838| 6.23k|{ 1839| 6.23k| assert(node); ------------------ | Branch (1839:5): [True: 6.23k, False: 0] ------------------ 1840| 6.23k| auto relaxed = node->relaxed(); 1841| 6.23k| if (relaxed) { ------------------ | Branch (1841:9): [True: 1.64k, False: 4.59k] ------------------ 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.59k| } else { 1846| 4.59k| return make_regular_sub_pos(node, shift, size) 1847| 4.59k| .visit(v, std::forward(args)...); 1848| 4.59k| } 1849| 6.23k|} _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.59k| { 1037| 4.59k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 4.59k| } _ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitor3rrbEJNS1_16rrbtree_iteratorIiSB_Lj2ELj2EEERKPSC_RKjRmEEEDcT_DpOT0_: 1036| 6.23k| { 1037| 6.23k| return Visitor::visit_regular(*this, std::forward(args)...); 1038| 6.23k| } _ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEE5visitINS1_14equals_visitorEJRKPSC_EEEDcT_DpOT0_: 144| 6.25k| { 145| 6.25k| return Visitor::visit_leaf(*this, std::forward(args)...); 146| 6.25k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2Ev: 114| 1.52M| : size{0} 115| 1.52M| , shift{BL} 116| 1.52M| , root{empty_root()} 117| 1.52M| , tail{empty_tail()} 118| 1.52M| { 119| | assert(check_tree()); ------------------ | Branch (119:9): [True: 1.52M, False: 0] ------------------ 120| 1.52M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10empty_rootEv: 61| 1.53M| { 62| 1.53M| static const auto empty_ = [] { 63| 1.53M| constexpr auto size = node_t::sizeof_inner_n(0); 64| 1.53M| static std::aligned_storage_t 65| 1.53M| storage; 66| 1.53M| return node_t::make_inner_n_into(&storage, size, 0u); 67| 1.53M| }(); 68| 1.53M| return empty_->inc(); 69| 1.53M| } _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.52M| { 73| 1.52M| static const auto empty_ = [] { 74| 1.52M| constexpr auto size = node_t::sizeof_leaf_n(0); 75| 1.52M| static std::aligned_storage_t 76| 1.52M| storage; 77| 1.52M| return node_t::make_leaf_n_into(&storage, size, 0u); 78| 1.52M| }(); 79| 1.52M| return empty_->inc(); 80| 1.52M| } _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.04M| { 1373| 3.04M| IMMER_INVALID_STATE_ASSERT(shift <= sizeof(size_t) * 8 - BL); ------------------ | | 32| 3.04M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.04M] | | ------------------ | | 33| 3.04M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1374| 3.04M| IMMER_INVALID_STATE_ASSERT(shift >= BL); ------------------ | | 32| 3.04M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.04M] | | ------------------ | | 33| 3.04M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1375| 3.04M| IMMER_INVALID_STATE_ASSERT(tail_offset() <= size); ------------------ | | 32| 3.04M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.04M] | | ------------------ | | 33| 3.04M| IMMER_THROW(invalid_tree{}) | | ------------------ | | | | 51| 0|#define IMMER_THROW(expr) throw expr | | ------------------ ------------------ 1376| 3.04M| IMMER_INVALID_STATE_ASSERT(tail_size() <= branches); ------------------ | | 32| 3.04M| if (!(expr)) \ | | ------------------ | | | Branch (32:9): [True: 0, False: 3.04M] | | ------------------ | | 33| 3.04M| 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.04M| return true; 1382| 3.04M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11tail_offsetEv: 197| 14.8M| { 198| 14.8M| auto r = root->relaxed(); 199| 14.8M| assert(r == nullptr || r->d.count); ------------------ | Branch (199:9): [True: 7.51M, False: 7.34M] | Branch (199:9): [True: 7.34M, False: 0] | Branch (199:9): [True: 14.8M, False: 0] ------------------ 200| 14.8M| return r ? r->d.sizes[r->d.count - 1] ------------------ | Branch (200:16): [True: 7.34M, False: 7.51M] ------------------ 201| 14.8M| : size ? (size - 1) & ~mask ------------------ | Branch (201:18): [True: 2.91M, False: 4.59M] ------------------ 202| | /* otherwise */ 203| 7.51M| : 0; 204| 14.8M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9tail_sizeEv: 194| 3.52M| 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.04M| ~rrbtree() { dec(); } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE3decEv: 192| 3.04M| 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.04M| { 209| 3.04M| auto tail_off = tail_offset(); 210| 3.04M| auto tail_size = size - tail_off; 211| | 212| 3.04M| if (tail_off) ------------------ | Branch (212:13): [True: 1.42M, False: 1.61M] ------------------ 213| 1.42M| visit_maybe_relaxed_sub(root, shift, tail_off, v, args...); 214| 1.61M| else 215| 1.61M| make_empty_regular_pos(root).visit(v, args...); 216| | 217| 3.04M| if (tail_size) ------------------ | Branch (217:13): [True: 1.51M, False: 1.52M] ------------------ 218| 1.51M| make_leaf_sub_pos(tail, tail_size).visit(v, args...); 219| 1.52M| else 220| 1.52M| make_empty_leaf_pos(tail).visit(v, args...); 221| 3.04M| } _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: 329k, False: 120k] ------------------ 503| 329k| auto new_tail = 504| 329k| node_t::copy_leaf_emplace(tail, ts, std::move(value)); 505| 329k| return {size + 1, shift, root->inc(), new_tail}; 506| 329k| } else { 507| 120k| using std::get; 508| 120k| auto new_tail = node_t::make_leaf_n(1u, std::move(value)); 509| 120k| auto tail_off = tail_offset(); 510| 120k| IMMER_TRY { ------------------ | | 49| 120k|#define IMMER_TRY try ------------------ 511| 120k| auto new_root = 512| 120k| push_tail(root, shift, tail_off, tail, size - tail_off); 513| 120k| tail->inc(); 514| 120k| return {size + 1, get<0>(new_root), get<1>(new_root), new_tail}; 515| 120k| } 516| 120k| IMMER_CATCH (...) { 517| 0| node_t::delete_leaf(new_tail, 1u); 518| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 519| 0| } 520| 120k| } 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| 533k| { 370| 533k| if (auto r = root->relaxed()) { ------------------ | Branch (370:18): [True: 207k, False: 325k] ------------------ 371| 207k| auto new_root = 372| 207k| make_relaxed_pos(root, shift, r) 373| 207k| .visit(push_tail_visitor{}, tail, tail_size); 374| 207k| if (new_root) ------------------ | Branch (374:17): [True: 205k, False: 1.83k] ------------------ 375| 205k| return std::make_tuple(shift, new_root); 376| 1.83k| else { 377| 1.83k| auto new_root = node_t::make_inner_r_n(2); 378| 1.83k| IMMER_TRY { ------------------ | | 49| 1.83k|#define IMMER_TRY try ------------------ 379| 1.83k| auto new_path = node_t::make_path(shift, tail); 380| 1.83k| new_root->inner()[0] = root->inc(); 381| 1.83k| new_root->inner()[1] = new_path; 382| 1.83k| new_root->relaxed()->d.sizes[0] = size; 383| 1.83k| new_root->relaxed()->d.sizes[1] = size + tail_size; 384| 1.83k| assert(size); ------------------ | Branch (384:21): [True: 1.83k, False: 0] ------------------ 385| 1.83k| assert(tail_size); ------------------ | Branch (385:21): [True: 1.83k, False: 0] ------------------ 386| 1.83k| new_root->relaxed()->d.count = 2u; 387| 1.83k| } 388| 1.83k| 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.83k| return std::make_tuple(shift + B, new_root); 393| 1.83k| } 394| 325k| } else if (size == size_t{branches} << shift) { ------------------ | Branch (394:20): [True: 4.85k, False: 320k] ------------------ 395| 4.85k| auto new_root = node_t::make_inner_n(2); 396| 4.85k| IMMER_TRY { ------------------ | | 49| 4.85k|#define IMMER_TRY try ------------------ 397| 4.85k| auto new_path = node_t::make_path(shift, tail); 398| 4.85k| new_root->inner()[0] = root->inc(); 399| 4.85k| new_root->inner()[1] = new_path; 400| 4.85k| } 401| 4.85k| IMMER_CATCH (...) { 402| 0| node_t::delete_inner(new_root, 2); 403| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 404| 0| } 405| 4.85k| return std::make_tuple(shift + B, new_root); 406| 320k| } else if (size) { ------------------ | Branch (406:20): [True: 310k, False: 10.4k] ------------------ 407| 310k| auto new_root = make_regular_sub_pos(root, shift, size) 408| 310k| .visit(push_tail_visitor{}, tail); 409| 310k| return std::make_tuple(shift, new_root); 410| 310k| } else { 411| 10.4k| return std::make_tuple(shift, node_t::make_path(shift, tail)); 412| 10.4k| } 413| 533k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2EOSB_: 157| 1.44M| : rrbtree{} 158| 1.44M| { 159| 1.44M| swap(*this, other); 160| 1.44M| } _ZN5immer6detail4rbts4swapERNS1_7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEESC_: 176| 3.38M| { 177| 3.38M| using std::swap; 178| 3.38M| swap(x.size, y.size); 179| 3.38M| swap(x.shift, y.shift); 180| 3.38M| swap(x.root, y.root); 181| 3.38M| swap(x.tail, y.tail); 182| 3.38M| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEaSEOSB_: 170| 1.93M| { 171| 1.93M| swap(*this, other); 172| 1.93M| return *this; 173| 1.93M| } 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| 116k| { 581| 116k| auto tail_off = tail_offset(); 582| 116k| if (idx >= tail_off) { ------------------ | Branch (582:13): [True: 46.4k, False: 69.8k] ------------------ 583| 46.4k| auto tail_size = size - tail_off; 584| 46.4k| auto new_tail = 585| 46.4k| make_leaf_sub_pos(tail, tail_size) 586| 46.4k| .visit(update_visitor{}, idx - tail_off, fn); 587| 46.4k| return {size, shift, root->inc(), new_tail}; 588| 69.8k| } else { 589| 69.8k| auto new_root = visit_maybe_relaxed_sub( 590| 69.8k| root, shift, tail_off, update_visitor{}, idx, fn); 591| 69.8k| return {size, shift, new_root, tail->inc()}; 592| 69.8k| } 593| 116k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4takeEm: 647| 23.8k| { 648| 23.8k| auto tail_off = tail_offset(); 649| 23.8k| if (new_size == 0) { ------------------ | Branch (649:13): [True: 3.29k, False: 20.5k] ------------------ 650| 3.29k| return {}; 651| 20.5k| } else if (new_size >= size) { ------------------ | Branch (651:20): [True: 1.39k, False: 19.1k] ------------------ 652| 1.39k| return *this; 653| 19.1k| } else if (new_size > tail_off) { ------------------ | Branch (653:20): [True: 1.82k, False: 17.2k] ------------------ 654| 1.82k| auto new_tail = node_t::copy_leaf(tail, new_size - tail_off); 655| 1.82k| return {new_size, shift, root->inc(), new_tail}; 656| 17.2k| } else { 657| 17.2k| using std::get; 658| 17.2k| auto l = new_size - 1; 659| 17.2k| auto v = slice_right_visitor(); 660| 17.2k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l); 661| 17.2k| auto new_shift = get<0>(r); 662| 17.2k| auto new_root = get<1>(r); 663| 17.2k| auto new_tail = get<3>(r); 664| 17.2k| if (new_root) { ------------------ | Branch (664:17): [True: 13.2k, False: 3.97k] ------------------ 665| 13.2k| IMMER_ASSERT_TAGGED(new_root->compute_shift() == get<0>(r)); ------------------ | | 68| 13.2k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (665:17): [True: 13.2k, False: 0] ------------------ 666| 13.2k| assert(new_root->check(new_shift, new_size - get<2>(r))); ------------------ | Branch (666:17): [True: 13.2k, False: 0] ------------------ 667| 13.2k| return {new_size, new_shift, new_root, new_tail}; 668| 13.2k| } else { 669| 3.97k| return {new_size, BL, empty_root(), new_tail}; 670| 3.97k| } 671| 17.2k| } 672| 23.8k| } _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.3k| { 712| 25.3k| if (elems == 0) { ------------------ | Branch (712:13): [True: 2.30k, False: 23.0k] ------------------ 713| 2.30k| return *this; 714| 23.0k| } else if (elems >= size) { ------------------ | Branch (714:20): [True: 2.16k, False: 20.8k] ------------------ 715| 2.16k| return {}; 716| 20.8k| } else if (elems == tail_offset()) { ------------------ | Branch (716:20): [True: 1.67k, False: 19.1k] ------------------ 717| 1.67k| return {size - elems, BL, empty_root(), tail->inc()}; 718| 19.1k| } else if (elems > tail_offset()) { ------------------ | Branch (718:20): [True: 2.00k, False: 17.1k] ------------------ 719| 2.00k| auto tail_off = tail_offset(); 720| 2.00k| auto new_tail = 721| 2.00k| node_t::copy_leaf(tail, elems - tail_off, size - tail_off); 722| 2.00k| return {size - elems, BL, empty_root(), new_tail}; 723| 17.1k| } else { 724| 17.1k| using std::get; 725| 17.1k| auto v = slice_left_visitor(); 726| 17.1k| auto r = 727| 17.1k| visit_maybe_relaxed_sub(root, shift, tail_offset(), v, elems); 728| 17.1k| auto new_root = get<1>(r); 729| 17.1k| auto new_shift = get<0>(r); 730| 17.1k| return {size - elems, new_shift, new_root, tail->inc()}; 731| 17.1k| } 732| 25.3k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8max_sizeEv: 54| 1.92M| { 55| 1.92M| auto S = sizeof(size_t) * 8; 56| 1.92M| return ((size_t{1} << BL) - std::min(size_t{BL}, size_t{2})) * 57| 1.92M| ipow((size_t{1} << B) - 2, (S - BL) / B); 58| 1.92M| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6concatERKSB_: 735| 806k| { 736| 806k| assert(r.size + size <= max_size()); ------------------ | Branch (736:9): [True: 806k, False: 0] ------------------ 737| 806k| using std::get; 738| 806k| if (size == 0) ------------------ | Branch (738:13): [True: 2.56k, False: 803k] ------------------ 739| 2.56k| return r; 740| 803k| else if (r.size == 0) ------------------ | Branch (740:18): [True: 1.65k, False: 801k] ------------------ 741| 1.65k| return *this; 742| 801k| else if (r.tail_offset() == 0) { ------------------ | Branch (742:18): [True: 421k, False: 380k] ------------------ 743| | // just concat the tail, similar to push_back 744| 421k| auto tail_offst = tail_offset(); 745| 421k| auto tail_size = size - tail_offst; 746| 421k| if (tail_size == branches) { ------------------ | Branch (746:17): [True: 118k, False: 303k] ------------------ 747| 118k| auto new_root = 748| 118k| push_tail(root, shift, tail_offst, tail, tail_size); 749| 118k| tail->inc(); 750| 118k| return {size + r.size, 751| 118k| get<0>(new_root), 752| 118k| get<1>(new_root), 753| 118k| r.tail->inc()}; 754| 303k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (754:24): [True: 9.23k, False: 293k] ------------------ 755| 9.23k| auto new_tail = 756| 9.23k| node_t::copy_leaf(tail, tail_size, r.tail, r.size); 757| 9.23k| return {size + r.size, shift, root->inc(), new_tail}; 758| 293k| } else { 759| 293k| auto remaining = branches - tail_size; 760| 293k| auto add_tail = 761| 293k| node_t::copy_leaf(tail, tail_size, r.tail, remaining); 762| 293k| IMMER_TRY { ------------------ | | 49| 293k|#define IMMER_TRY try ------------------ 763| 293k| auto new_tail = 764| 293k| node_t::copy_leaf(r.tail, remaining, r.size); 765| 293k| IMMER_TRY { ------------------ | | 49| 293k|#define IMMER_TRY try ------------------ 766| 293k| auto new_root = push_tail( 767| 293k| root, shift, tail_offst, add_tail, branches); 768| 293k| return {size + r.size, 769| 293k| get<0>(new_root), 770| 293k| get<1>(new_root), 771| 293k| new_tail}; 772| 293k| } 773| 293k| 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| 293k| } 778| 293k| IMMER_CATCH (...) { 779| 0| node_t::delete_leaf(add_tail, branches); 780| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 781| 0| } 782| 293k| } 783| 421k| } else if (tail_offset() == 0) { ------------------ | Branch (783:20): [True: 3.53k, False: 376k] ------------------ 784| 3.53k| auto tail_offst = tail_offset(); 785| 3.53k| auto tail_size = size - tail_offst; 786| 3.53k| auto concated = 787| 3.53k| concat_trees(tail, tail_size, r.root, r.shift, r.tail_offset()); 788| 3.53k| auto new_shift = concated.shift(); 789| 3.53k| auto new_root = concated.node(); 790| 3.53k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 3.53k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (790:13): [True: 3.53k, False: 0] ------------------ 791| 3.53k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (791:13): [True: 3.53k, False: 0] ------------------ 792| 3.53k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 793| 376k| } else { 794| 376k| auto tail_offst = tail_offset(); 795| 376k| auto tail_size = size - tail_offst; 796| 376k| auto concated = concat_trees(root, 797| 376k| shift, 798| 376k| tail_offst, 799| 376k| tail, 800| 376k| tail_size, 801| 376k| r.root, 802| 376k| r.shift, 803| 376k| r.tail_offset()); 804| 376k| auto new_shift = concated.shift(); 805| 376k| auto new_root = concated.node(); 806| 376k| IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift()); ------------------ | | 68| 376k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (806:13): [True: 376k, False: 0] ------------------ 807| 376k| assert(new_root->check(new_shift, size + r.tail_offset())); ------------------ | Branch (807:13): [True: 376k, False: 0] ------------------ 808| 376k| return {size + r.size, new_shift, new_root, r.tail->inc()}; 809| 376k| } 810| 806k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE13push_back_mutENS9_5applyIS6_E4type4editEi: 478| 31.6k| { 479| 31.6k| auto ts = tail_size(); 480| 31.6k| if (ts < branches) { ------------------ | Branch (480:13): [True: 17.9k, False: 13.7k] ------------------ 481| 17.9k| ensure_mutable_tail(e, ts); 482| 17.9k| new (&tail->leaf()[ts]) T(std::move(value)); 483| 17.9k| } else { 484| 13.7k| using std::get; 485| 13.7k| auto new_tail = node_t::make_leaf_e(e, std::move(value)); 486| 13.7k| auto tail_off = tail_offset(); 487| 13.7k| IMMER_TRY { ------------------ | | 49| 13.7k|#define IMMER_TRY try ------------------ 488| 13.7k| push_tail_mut(e, tail_off, tail, ts); 489| 13.7k| tail = new_tail; 490| 13.7k| } 491| 13.7k| IMMER_CATCH (...) { 492| 0| node_t::delete_leaf(new_tail, 1u); 493| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 494| 0| } 495| 13.7k| } 496| 31.6k| ++size; 497| 31.6k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE19ensure_mutable_tailENS9_5applyIS6_E4type4editEj: 469| 175k| { 470| 175k| if (!tail->can_mutate(e)) { ------------------ | Branch (470:13): [True: 4.62k, False: 170k] ------------------ 471| 4.62k| auto new_tail = node_t::copy_leaf_e(e, tail, n); 472| 4.62k| dec_leaf(tail, n); 473| 4.62k| tail = new_tail; 474| 4.62k| } 475| 175k| } _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: 40.3k, False: 144k] ------------------ 419| 40.3k| auto new_root = 420| 40.3k| make_relaxed_pos(root, shift, r) 421| 40.3k| .visit(push_tail_mut_visitor{}, e, tail, tail_size); 422| 40.3k| if (new_root) { ------------------ | Branch (422:17): [True: 39.2k, False: 1.04k] ------------------ 423| 39.2k| root = new_root; 424| 39.2k| } else { 425| 1.04k| auto new_root = node_t::make_inner_r_e(e); 426| 1.04k| IMMER_TRY { ------------------ | | 49| 1.04k|#define IMMER_TRY try ------------------ 427| 1.04k| auto new_path = node_t::make_path_e(e, shift, tail); 428| 1.04k| new_root->inner()[0] = root; 429| 1.04k| new_root->inner()[1] = new_path; 430| 1.04k| new_root->relaxed()->d.sizes[0] = tail_off; 431| 1.04k| new_root->relaxed()->d.sizes[1] = tail_off + tail_size; 432| 1.04k| assert(tail_off); ------------------ | Branch (432:21): [True: 1.04k, False: 0] ------------------ 433| 1.04k| assert(tail_size); ------------------ | Branch (433:21): [True: 1.04k, False: 0] ------------------ 434| 1.04k| new_root->relaxed()->d.count = 2u; 435| 1.04k| root = new_root; 436| 1.04k| shift += B; 437| 1.04k| } 438| 1.04k| IMMER_CATCH (...) { 439| 0| node_t::delete_inner_r_e(new_root); 440| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 441| 0| } 442| 1.04k| } 443| 144k| } else if (tail_off == size_t{branches} << shift) { ------------------ | Branch (443:20): [True: 2.90k, False: 141k] ------------------ 444| 2.90k| auto new_root = node_t::make_inner_e(e); 445| 2.90k| IMMER_TRY { ------------------ | | 49| 2.90k|#define IMMER_TRY try ------------------ 446| 2.90k| auto new_path = node_t::make_path_e(e, shift, tail); 447| 2.90k| new_root->inner()[0] = root; 448| 2.90k| new_root->inner()[1] = new_path; 449| 2.90k| root = new_root; 450| 2.90k| shift += B; 451| 2.90k| } 452| 2.90k| IMMER_CATCH (...) { 453| 0| node_t::delete_inner_e(new_root); 454| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 455| 0| } 456| 141k| } else if (tail_off) { ------------------ | Branch (456:20): [True: 139k, False: 2.04k] ------------------ 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.04k| auto new_root = node_t::make_path_e(e, shift, tail); 463| 2.04k| dec_empty_regular(root); 464| 2.04k| root = new_root; 465| 2.04k| } 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| 71.0k| { 574| 71.0k| auto& elem = get_mut(e, idx); 575| 71.0k| elem = std::forward(fn)(std::move(elem)); 576| 71.0k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7get_mutENS9_5applyIS6_E4type4editEm: 539| 71.0k| { 540| 71.0k| auto tail_off = tail_offset(); 541| 71.0k| if (idx >= tail_off) { ------------------ | Branch (541:13): [True: 32.3k, False: 38.7k] ------------------ 542| 32.3k| ensure_mutable_tail(e, size - tail_off); 543| 32.3k| return tail->leaf()[(idx - tail_off) & mask]; 544| 38.7k| } else { 545| 38.7k| return visit_maybe_relaxed_sub(root, 546| 38.7k| shift, 547| 38.7k| tail_off, 548| 38.7k| get_mut_visitor{}, 549| 38.7k| idx, 550| 38.7k| e, 551| 38.7k| &root); 552| 38.7k| } 553| 71.0k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8take_mutENS9_5applyIS6_E4type4editEm: 606| 41.1k| { 607| 41.1k| auto tail_off = tail_offset(); 608| 41.1k| if (new_size == 0) { ------------------ | Branch (608:13): [True: 690, False: 40.4k] ------------------ 609| 690| *this = {}; 610| 40.4k| } else if (new_size >= size) { ------------------ | Branch (610:20): [True: 1.51k, False: 38.9k] ------------------ 611| 1.51k| return; 612| 38.9k| } else if (new_size > tail_off) { ------------------ | Branch (612:20): [True: 858, False: 38.0k] ------------------ 613| 858| auto ts = size - tail_off; 614| 858| auto newts = new_size - tail_off; 615| 858| if (tail->can_mutate(e)) { ------------------ | Branch (615:17): [True: 571, False: 287] ------------------ 616| 571| detail::destroy_n(tail->leaf() + newts, ts - newts); 617| 571| } else { 618| 287| auto new_tail = node_t::copy_leaf_e(e, tail, newts); 619| 287| dec_leaf(tail, ts); 620| 287| tail = new_tail; 621| 287| } 622| 858| size = new_size; 623| 858| return; 624| 38.0k| } else { 625| 38.0k| using std::get; 626| 38.0k| auto l = new_size - 1; 627| 38.0k| auto v = slice_right_mut_visitor(); 628| 38.0k| auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l, e); 629| 38.0k| auto new_shift = get<0>(r); 630| 38.0k| auto new_root = get<1>(r); 631| 38.0k| auto new_tail = get<3>(r); 632| 38.0k| if (new_root) { ------------------ | Branch (632:17): [True: 31.8k, False: 6.21k] ------------------ 633| 31.8k| root = new_root; 634| 31.8k| shift = new_shift; 635| 31.8k| } else { 636| 6.21k| root = empty_root(); 637| 6.21k| shift = BL; 638| 6.21k| } 639| 38.0k| dec_leaf(tail, size - tail_off); 640| 38.0k| size = new_size; 641| 38.0k| tail = new_tail; 642| 38.0k| return; 643| 38.0k| } 644| 41.1k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8drop_mutENS9_5applyIS6_E4type4editEm: 675| 42.8k| { 676| 42.8k| using std::get; 677| 42.8k| auto tail_off = tail_offset(); 678| 42.8k| if (elems == 0) { ------------------ | Branch (678:13): [True: 2.38k, False: 40.4k] ------------------ 679| 2.38k| return; 680| 40.4k| } else if (elems >= size) { ------------------ | Branch (680:20): [True: 281, False: 40.1k] ------------------ 681| 281| *this = {}; 682| 40.1k| } else if (elems == tail_off) { ------------------ | Branch (682:20): [True: 268, False: 39.8k] ------------------ 683| 268| dec_inner(root, shift, tail_off); 684| 268| shift = BL; 685| 268| root = empty_root(); 686| 268| size -= elems; 687| 268| return; 688| 39.8k| } else if (elems > tail_off) { ------------------ | Branch (688:20): [True: 712, False: 39.1k] ------------------ 689| 712| auto v = slice_left_mut_visitor(); 690| 712| tail = get<1>(make_leaf_sub_pos(tail, size - tail_off) 691| 712| .visit(v, elems - tail_off, e)); 692| 712| if (tail_off) { ------------------ | Branch (692:17): [True: 291, False: 421] ------------------ 693| 291| dec_inner(root, shift, tail_off); 694| 291| shift = BL; 695| 291| root = empty_root(); 696| 291| } 697| 712| size -= elems; 698| 712| return; 699| 39.1k| } else { 700| 39.1k| auto v = slice_left_mut_visitor(); 701| 39.1k| auto r = 702| 39.1k| visit_maybe_relaxed_sub(root, shift, tail_off, v, elems, e); 703| 39.1k| shift = get<0>(r); 704| 39.1k| root = get<1>(r); 705| 39.1k| size -= elems; 706| 39.1k| return; 707| 39.1k| } 708| 42.8k| } _ZN5immer6detail4rbts12concat_mut_lERNS1_7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEENS9_5applyIS6_E4type4editERKSB_: 816| 248k| { 817| 248k| assert(&l != &r); ------------------ | Branch (817:9): [True: 248k, False: 0] ------------------ 818| 248k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (818:9): [True: 248k, False: 0] ------------------ 819| 248k| using std::get; 820| 248k| if (l.size == 0) ------------------ | Branch (820:13): [True: 630, False: 248k] ------------------ 821| 630| l = r; 822| 248k| else if (r.size == 0) ------------------ | Branch (822:18): [True: 556, False: 247k] ------------------ 823| 556| return; 824| 247k| else if (r.tail_offset() == 0) { ------------------ | Branch (824:18): [True: 168k, False: 78.9k] ------------------ 825| | // just concat the tail, similar to push_back 826| 168k| auto tail_offst = l.tail_offset(); 827| 168k| auto tail_size = l.size - tail_offst; 828| 168k| if (tail_size == branches) { ------------------ | Branch (828:17): [True: 47.4k, False: 121k] ------------------ 829| 47.4k| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 830| 47.4k| l.tail = r.tail->inc(); 831| 47.4k| l.size += r.size; 832| 47.4k| return; 833| 121k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (833:24): [True: 722, False: 120k] ------------------ 834| 722| l.ensure_mutable_tail(el, tail_size); 835| 722| detail::uninitialized_copy(r.tail->leaf(), 836| 722| r.tail->leaf() + r.size, 837| 722| l.tail->leaf() + tail_size); 838| 722| l.size += r.size; 839| 722| return; 840| 120k| } else { 841| 120k| auto remaining = branches - tail_size; 842| 120k| l.ensure_mutable_tail(el, tail_size); 843| 120k| detail::uninitialized_copy(r.tail->leaf(), 844| 120k| r.tail->leaf() + remaining, 845| 120k| l.tail->leaf() + tail_size); 846| 120k| IMMER_TRY { ------------------ | | 49| 120k|#define IMMER_TRY try ------------------ 847| 120k| auto new_tail = 848| 120k| node_t::copy_leaf_e(el, r.tail, remaining, r.size); 849| 120k| IMMER_TRY { ------------------ | | 49| 120k|#define IMMER_TRY try ------------------ 850| 120k| l.push_tail_mut(el, tail_offst, l.tail, branches); 851| 120k| l.tail = new_tail; 852| 120k| l.size += r.size; 853| 120k| return; 854| 120k| } 855| 120k| 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| 120k| } 860| 120k| 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| 120k| } 865| 168k| } else if (l.tail_offset() == 0) { ------------------ | Branch (865:20): [True: 471, False: 78.4k] ------------------ 866| 471| if (supports_transient_concat) { ------------------ | Branch (866:17): [Folded, False: 471] ------------------ 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| 471| } else { 886| 471| auto tail_offst = l.tail_offset(); 887| 471| auto tail_size = l.size - tail_offst; 888| 471| auto concated = concat_trees( 889| 471| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 890| 471| l = {l.size + r.size, 891| 471| concated.shift(), 892| 471| concated.node(), 893| 471| r.tail->inc()}; 894| 471| assert(l.check_tree()); ------------------ | Branch (894:17): [True: 471, False: 0] ------------------ 895| 471| return; 896| 471| } 897| 78.4k| } else { 898| 78.4k| if (supports_transient_concat) { ------------------ | Branch (898:17): [Folded, False: 78.4k] ------------------ 899| 0| auto tail_offst = l.tail_offset(); 900| 0| auto tail_size = l.size - tail_offst; 901| 0| assert(l.check_tree()); ------------------ | Branch (901:17): [True: 0, False: 0] ------------------ 902| 0| assert(r.check_tree()); ------------------ | Branch (902:17): [True: 0, False: 0] ------------------ 903| 0| auto concated = 904| 0| concat_trees_mut(el, 905| 0| el, 906| 0| l.root, 907| 0| l.shift, 908| 0| tail_offst, 909| 0| l.tail, 910| 0| tail_size, 911| 0| MemoryPolicy::transience_t::noone, 912| 0| r.root, 913| 0| r.shift, 914| 0| r.tail_offset()); 915| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 68| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (915:17): [True: 0, False: 0] ------------------ 916| 0| concated.node()->compute_shift()); 917| 0| l.size += r.size; 918| 0| l.shift = concated.shift(); 919| 0| l.root = concated.node(); 920| 0| l.tail = r.tail; 921| 0| assert(l.check_tree()); ------------------ | Branch (921:17): [True: 0, False: 0] ------------------ 922| 78.4k| } else { 923| 78.4k| auto tail_offst = l.tail_offset(); 924| 78.4k| auto tail_size = l.size - tail_offst; 925| 78.4k| auto concated = concat_trees(l.root, 926| 78.4k| l.shift, 927| 78.4k| tail_offst, 928| 78.4k| l.tail, 929| 78.4k| tail_size, 930| 78.4k| r.root, 931| 78.4k| r.shift, 932| 78.4k| r.tail_offset()); 933| 78.4k| l = {l.size + r.size, 934| 78.4k| concated.shift(), 935| 78.4k| concated.node(), 936| 78.4k| r.tail->inc()}; 937| 78.4k| } 938| 78.4k| } 939| 248k| } _ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEaSERKSB_: 163| 2.15k| { 164| 2.15k| auto next{other}; 165| 2.15k| swap(*this, next); 166| 2.15k| return *this; 167| 2.15k| } _ZN5immer6detail4rbts12concat_mut_rERKNS1_7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERSB_NS9_5applyIS6_E4type4editE: 942| 3.66k| { 943| 3.66k| assert(&l != &r); ------------------ | Branch (943:9): [True: 3.66k, False: 0] ------------------ 944| 3.66k| assert(r.size < (std::numeric_limits::max() - l.size)); ------------------ | Branch (944:9): [True: 3.66k, False: 0] ------------------ 945| 3.66k| using std::get; 946| 3.66k| if (r.size == 0) ------------------ | Branch (946:13): [True: 280, False: 3.38k] ------------------ 947| 280| r = std::move(l); 948| 3.38k| else if (l.size == 0) ------------------ | Branch (948:18): [True: 252, False: 3.13k] ------------------ 949| 252| return; 950| 3.13k| else if (r.tail_offset() == 0) { ------------------ | Branch (950:18): [True: 999, False: 2.13k] ------------------ 951| | // just concat the tail, similar to push_back 952| 999| auto tail_offst = l.tail_offset(); 953| 999| auto tail_size = l.size - tail_offst; 954| 999| if (tail_size == branches) { ------------------ | Branch (954:17): [True: 255, False: 744] ------------------ 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| 255| auto res = 959| 255| l.push_tail(l.root, l.shift, tail_offst, l.tail, tail_size); 960| 255| l.tail->inc(); // note: leak if mutably concatenated 961| | // with itself, but this is forbidden 962| | // by the interface 963| 255| r = {l.size + r.size, get<0>(res), get<1>(res), r.tail->inc()}; 964| 255| return; 965| 744| } else if (tail_size + r.size <= branches) { ------------------ | Branch (965:24): [True: 418, False: 326] ------------------ 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| 418| auto new_tail = 974| 418| node_t::copy_leaf(l.tail, tail_size, r.tail, r.size); 975| 418| r = {l.size + r.size, l.shift, l.root->inc(), new_tail}; 976| 418| return; 977| 418| } else { 978| | // like the immutable version 979| 326| auto remaining = branches - tail_size; 980| 326| auto add_tail = node_t::copy_leaf_e( 981| 326| er, l.tail, tail_size, r.tail, remaining); 982| 326| IMMER_TRY { ------------------ | | 49| 326|#define IMMER_TRY try ------------------ 983| 326| auto new_tail = 984| 326| node_t::copy_leaf_e(er, r.tail, remaining, r.size); 985| 326| IMMER_TRY { ------------------ | | 49| 326|#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| 326| auto new_root = l.push_tail(l.root, 990| 326| l.shift, 991| 326| tail_offst, 992| 326| add_tail, 993| 326| branches); 994| 326| r = {l.size + r.size, 995| 326| get<0>(new_root), 996| 326| get<1>(new_root), 997| 326| new_tail}; 998| 326| return; 999| 326| } 1000| 326| 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| 326| } 1005| 326| IMMER_CATCH (...) { 1006| 0| node_t::delete_leaf(add_tail, branches); 1007| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 1008| 0| } 1009| 326| } 1010| 2.13k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1010:20): [True: 510, False: 1.62k] ------------------ 1011| 510| if (supports_transient_concat) { ------------------ | Branch (1011:17): [Folded, False: 510] ------------------ 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| 510| } else { 1030| 510| auto tail_offst = l.tail_offset(); 1031| 510| auto tail_size = l.size - tail_offst; 1032| 510| auto concated = concat_trees( 1033| 510| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1034| 510| r = {l.size + r.size, 1035| 510| concated.shift(), 1036| 510| concated.node(), 1037| 510| r.tail->inc()}; 1038| 510| return; 1039| 510| } 1040| 1.62k| } else { 1041| 1.62k| if (supports_transient_concat) { ------------------ | Branch (1041:17): [Folded, False: 1.62k] ------------------ 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.62k| } else { 1064| 1.62k| auto tail_offst = l.tail_offset(); 1065| 1.62k| auto tail_size = l.size - tail_offst; 1066| 1.62k| auto concated = concat_trees(l.root, 1067| 1.62k| l.shift, 1068| 1.62k| tail_offst, 1069| 1.62k| l.tail, 1070| 1.62k| tail_size, 1071| 1.62k| r.root, 1072| 1.62k| r.shift, 1073| 1.62k| r.tail_offset()); 1074| 1.62k| r = {l.size + r.size, 1075| 1.62k| concated.shift(), 1076| 1.62k| concated.node(), 1077| 1.62k| r.tail->inc()}; 1078| 1.62k| return; 1079| 1.62k| } 1080| 1.62k| } 1081| 3.66k| } _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.24k, False: 22.8k] ------------------ 1089| 1.24k| l = r; 1090| 22.8k| else if (r.size == 0) ------------------ | Branch (1090:18): [True: 1.60k, False: 21.2k] ------------------ 1091| 1.60k| return; 1092| 21.2k| else if (r.tail_offset() == 0) { ------------------ | Branch (1092:18): [True: 4.90k, False: 16.3k] ------------------ 1093| | // just concat the tail, similar to push_back 1094| 4.90k| auto tail_offst = l.tail_offset(); 1095| 4.90k| auto tail_size = l.size - tail_offst; 1096| 4.90k| if (tail_size == branches) { ------------------ | Branch (1096:17): [True: 995, False: 3.90k] ------------------ 1097| 995| l.push_tail_mut(el, tail_offst, l.tail, tail_size); 1098| 995| l.tail = r.tail->inc(); 1099| 995| l.size += r.size; 1100| 995| return; 1101| 3.90k| } else if (tail_size + r.size <= branches) { ------------------ | Branch (1101:24): [True: 1.77k, False: 2.13k] ------------------ 1102| 1.77k| l.ensure_mutable_tail(el, tail_size); 1103| 1.77k| if (r.tail->can_mutate(er)) ------------------ | Branch (1103:21): [True: 674, False: 1.10k] ------------------ 1104| 674| detail::uninitialized_move(r.tail->leaf(), 1105| 674| r.tail->leaf() + r.size, 1106| 674| l.tail->leaf() + tail_size); 1107| 1.10k| else 1108| 1.10k| detail::uninitialized_copy(r.tail->leaf(), 1109| 1.10k| r.tail->leaf() + r.size, 1110| 1.10k| l.tail->leaf() + tail_size); 1111| 1.77k| l.size += r.size; 1112| 1.77k| 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: 920, False: 1.21k] ------------------ 1117| 920| detail::uninitialized_move(r.tail->leaf(), 1118| 920| r.tail->leaf() + remaining, 1119| 920| l.tail->leaf() + tail_size); 1120| 1.21k| else 1121| 1.21k| detail::uninitialized_copy(r.tail->leaf(), 1122| 1.21k| r.tail->leaf() + remaining, 1123| 1.21k| 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.3k| } else if (l.tail_offset() == 0) { ------------------ | Branch (1143:20): [True: 3.23k, False: 13.1k] ------------------ 1144| 3.23k| if (supports_transient_concat) { ------------------ | Branch (1144:17): [Folded, False: 3.23k] ------------------ 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.23k| } else { 1165| 3.23k| auto tail_offst = l.tail_offset(); 1166| 3.23k| auto tail_size = l.size - tail_offst; 1167| 3.23k| auto concated = concat_trees( 1168| 3.23k| l.tail, tail_size, r.root, r.shift, r.tail_offset()); 1169| 3.23k| l = {l.size + r.size, 1170| 3.23k| concated.shift(), 1171| 3.23k| concated.node(), 1172| 3.23k| r.tail->inc()}; 1173| 3.23k| return; 1174| 3.23k| } 1175| 13.1k| } else { 1176| 13.1k| if (supports_transient_concat) { ------------------ | Branch (1176:17): [Folded, False: 13.1k] ------------------ 1177| 0| auto tail_offst = l.tail_offset(); 1178| 0| auto tail_size = l.size - tail_offst; 1179| 0| auto concated = concat_trees_mut(el, 1180| 0| el, 1181| 0| l.root, 1182| 0| l.shift, 1183| 0| tail_offst, 1184| 0| l.tail, 1185| 0| tail_size, 1186| 0| er, 1187| 0| r.root, 1188| 0| r.shift, 1189| 0| r.tail_offset()); 1190| 0| IMMER_ASSERT_TAGGED(concated.shift() == ------------------ | | 68| 0|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion) ------------------ | Branch (1190:17): [True: 0, False: 0] ------------------ 1191| 0| concated.node()->compute_shift()); 1192| 0| l.size += r.size; 1193| 0| l.shift = concated.shift(); 1194| 0| l.root = concated.node(); 1195| 0| l.tail = r.tail; 1196| 0| assert(l.check_tree()); ------------------ | Branch (1196:17): [True: 0, False: 0] ------------------ 1197| 0| r.hard_reset(); 1198| 0| return; 1199| 13.1k| } else { 1200| 13.1k| auto tail_offst = l.tail_offset(); 1201| 13.1k| auto tail_size = l.size - tail_offst; 1202| 13.1k| auto concated = concat_trees(l.root, 1203| 13.1k| l.shift, 1204| 13.1k| tail_offst, 1205| 13.1k| l.tail, 1206| 13.1k| tail_size, 1207| 13.1k| r.root, 1208| 13.1k| r.shift, 1209| 13.1k| r.tail_offset()); 1210| 13.1k| l = {l.size + r.size, 1211| 13.1k| concated.shift(), 1212| 13.1k| concated.node(), 1213| 13.1k| r.tail->inc()}; 1214| 13.1k| return; 1215| 13.1k| } 1216| 13.1k| } 1217| 24.0k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6equalsERKSB_: 315| 27.6k| { 316| 27.6k| using iter_t = rrbtree_iterator; 317| 27.6k| if (size != other.size) ------------------ | Branch (317:13): [True: 8.39k, False: 19.2k] ------------------ 318| 8.39k| return false; 319| 19.2k| if (size == 0) ------------------ | Branch (319:13): [True: 210, False: 19.0k] ------------------ 320| 210| return true; 321| 19.0k| auto tail_off = tail_offset(); 322| 19.0k| auto tail_off_other = other.tail_offset(); 323| | // compare trees 324| 19.0k| if (tail_off > 0 && tail_off_other > 0) { ------------------ | Branch (324:13): [True: 18.0k, False: 947] | Branch (324:29): [True: 17.8k, False: 195] ------------------ 325| | // other.shift != shift is a theoretical possibility for 326| | // relaxed trees that sadly we haven't managed to exercise 327| | // in tests yet... 328| 17.8k| if (other.shift >= shift) { ------------------ | Branch (328:17): [True: 17.0k, False: 771] ------------------ 329| 17.0k| if (!visit_maybe_relaxed_sub(other.root, ------------------ | Branch (329:21): [True: 8.51k, False: 8.57k] ------------------ 330| 17.0k| other.shift, 331| 17.0k| tail_off_other, 332| 17.0k| equals_visitor::rrb{}, 333| 17.0k| iter_t{other}, 334| 17.0k| root, 335| 17.0k| shift, 336| 17.0k| tail_off)) 337| 8.51k| return false; 338| 17.0k| } else { 339| 771| if (!visit_maybe_relaxed_sub(root, ------------------ | Branch (339:21): [True: 426, False: 345] ------------------ 340| 771| shift, 341| 771| tail_off, 342| 771| equals_visitor::rrb{}, 343| 771| iter_t{*this}, 344| 771| other.root, 345| 771| other.shift, 346| 771| tail_off_other)) 347| 426| return false; 348| 771| } 349| 17.8k| } 350| 10.0k| return tail_off == tail_off_other ------------------ | Branch (350:16): [True: 6.25k, False: 3.80k] ------------------ 351| 10.0k| ? make_leaf_sub_pos(tail, tail_size()) 352| 6.25k| .visit(equals_visitor{}, other.tail) 353| 10.0k| : tail_off > tail_off_other ------------------ | Branch (353:18): [True: 1.64k, False: 2.16k] ------------------ 354| 3.80k| ? std::equal(tail->leaf(), 355| 1.64k| tail->leaf() + (size - tail_off), 356| 1.64k| other.tail->leaf() + 357| 1.64k| (tail_off - tail_off_other)) 358| | /* otherwise */ 359| 3.80k| : std::equal(tail->leaf(), 360| 2.16k| tail->leaf() + (size - tail_off), 361| 2.16k| iter_t{other} + tail_off); 362| 19.0k| } _ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE10region_forEm: 524| 1.23M| { 525| 1.23M| using std::get; 526| 1.23M| auto tail_off = tail_offset(); 527| 1.23M| if (idx >= tail_off) { ------------------ | Branch (527:13): [True: 3.97k, False: 1.23M] ------------------ 528| 3.97k| return std::make_tuple(tail->leaf(), tail_off, size); 529| 1.23M| } else { 530| 1.23M| auto subs = visit_maybe_relaxed_sub( 531| 1.23M| root, shift, tail_off, region_for_visitor(), idx); 532| 1.23M| auto first = idx - get<1>(subs); 533| 1.23M| auto end = first + get<2>(subs); 534| 1.23M| return std::make_tuple(get<0>(subs), first, end); 535| 1.23M| } 536| 1.23M| } _ZNK5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11dereferenceEv: 90| 4.85M| { 91| 4.85M| using std::get; 92| 4.85M| if (i_ < get<1>(curr_) || i_ >= get<2>(curr_)) ------------------ | Branch (92:13): [True: 37.2k, False: 4.81M] | Branch (92:35): [True: 1.20M, False: 3.61M] ------------------ 93| 1.23M| curr_ = v_->region_for(i_); 94| 4.85M| return get<0>(curr_)[i_ - get<1>(curr_)]; 95| 4.85M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7advanceEl: 74| 233k| { 75| 233k| using std::get; 76| 233k| assert(n <= 0 || i_ + static_cast(n) <= v_->size); ------------------ | Branch (76:9): [True: 428, False: 232k] | Branch (76:9): [True: 232k, False: 0] | Branch (76:9): [True: 233k, False: 0] ------------------ 77| 233k| assert(n >= 0 || static_cast(-n) <= i_); ------------------ | Branch (77:9): [True: 233k, False: 0] | Branch (77:9): [True: 0, False: 0] | Branch (77:9): [True: 233k, False: 0] ------------------ 78| 233k| i_ += n; 79| 233k| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9incrementEv: 60| 3.63M| { 61| 3.63M| using std::get; 62| 3.63M| assert(i_ < v_->size); ------------------ | Branch (62:9): [True: 3.63M, False: 0] ------------------ 63| 3.63M| ++i_; 64| 3.63M| } _ZN5immer6detail4rbts16rrbtree_iteratorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2ERKNS1_7rrbtreeIiSA_Lj2ELj2EEE: 39| 20.0k| : v_{&v} 40| 20.0k| , i_{0} 41| 20.0k| , curr_{nullptr, ~size_t{}, ~size_t{}} 42| 20.0k| { 43| 20.0k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb1EEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERmEEEDcDpOT_: 31| 14.6k| { 32| 14.6k| return Deriv::visit_inner(std::forward(args)...); 33| 14.6k| } _ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEELb0EEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERmEEEDcDpOT_: 31| 40.9k| { 32| 40.9k| return Deriv::visit_inner(std::forward(args)...); 33| 40.9k| } _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.46k| { 38| 2.46k| return Deriv::visit_inner(std::forward(args)...); 39| 2.46k| } _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.75k| { 38| 5.75k| return Deriv::visit_inner(std::forward(args)...); 39| 5.75k| } _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.71k| { 38| 6.71k| return Deriv::visit_inner(std::forward(args)...); 39| 6.71k| } _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.57k| { 38| 1.57k| return Deriv::visit_inner(std::forward(args)...); 39| 1.57k| } _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| 1.97k| { 38| 1.97k| return Deriv::visit_inner(std::forward(args)...); 39| 1.97k| } _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.74k| { 38| 7.74k| return Deriv::visit_inner(std::forward(args)...); 39| 7.74k| } _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.74k| { 44| 7.74k| return Deriv::visit_node(std::forward(args)...); 45| 7.74k| } _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.49k| { 32| 5.49k| return Deriv::visit_inner(std::forward(args)...); 33| 5.49k| } _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.49k| { 44| 5.49k| return Deriv::visit_node(std::forward(args)...); 45| 5.49k| } _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.15M| { 50| 2.15M| return Deriv::visit_node(std::forward(args)...); 51| 2.15M| } _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| 18.9M| { 32| 18.9M| return Deriv::visit_inner(std::forward(args)...); 33| 18.9M| } _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| 18.9M| { 44| 18.9M| return Deriv::visit_node(std::forward(args)...); 45| 18.9M| } _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| 18.9M| { 32| 18.9M| return Deriv::visit_inner(std::forward(args)...); 33| 18.9M| } _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.1k| { 32| 17.1k| return Deriv::visit_inner(std::forward(args)...); 33| 17.1k| } _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| 397| { 38| 397| return Deriv::visit_inner(std::forward(args)...); 39| 397| } _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.02k| { 38| 1.02k| return Deriv::visit_inner(std::forward(args)...); 39| 1.02k| } _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| 987k| { 50| 987k| return Deriv::visit_node(std::forward(args)...); 51| 987k| } _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| 585k| { 38| 585k| return Deriv::visit_inner(std::forward(args)...); 39| 585k| } _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| 585k| { 44| 585k| return Deriv::visit_node(std::forward(args)...); 45| 585k| } _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| 585k| { 38| 585k| return Deriv::visit_inner(std::forward(args)...); 39| 585k| } _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| 621k| { 38| 621k| return Deriv::visit_inner(std::forward(args)...); 39| 621k| } _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| 621k| { 44| 621k| return Deriv::visit_node(std::forward(args)...); 45| 621k| } _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| 621k| { 38| 621k| return Deriv::visit_inner(std::forward(args)...); 39| 621k| } _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.25k| { 38| 2.25k| return Deriv::visit_inner(std::forward(args)...); 39| 2.25k| } _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.25k| { 44| 2.25k| return Deriv::visit_node(std::forward(args)...); 45| 2.25k| } _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| 455k| { 32| 455k| return Deriv::visit_inner(std::forward(args)...); 33| 455k| } _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| 455k| { 44| 455k| return Deriv::visit_node(std::forward(args)...); 45| 455k| } _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| 439k| { 32| 439k| return Deriv::visit_inner(std::forward(args)...); 33| 439k| } _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| 439k| { 44| 439k| return Deriv::visit_node(std::forward(args)...); 45| 439k| } _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| 1.99M| { 32| 1.99M| return Deriv::visit_inner(std::forward(args)...); 33| 1.99M| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EERNS1_11relaxed_posISD_EEEEEDcDpOT_: 37| 4.99k| { 38| 4.99k| return Deriv::visit_inner(std::forward(args)...); 39| 4.99k| } _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| 596k| { 32| 596k| return Deriv::visit_inner(std::forward(args)...); 33| 596k| } _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| 108k| { 38| 108k| return Deriv::visit_inner(std::forward(args)...); 39| 108k| } _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.15k| { 38| 1.15k| return Deriv::visit_inner(std::forward(args)...); 39| 1.15k| } _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| 100k| { 38| 100k| return Deriv::visit_inner(std::forward(args)...); 39| 100k| } _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| 47.6k| { 38| 47.6k| return Deriv::visit_inner(std::forward(args)...); 39| 47.6k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_: 37| 51.6k| { 38| 51.6k| return Deriv::visit_inner(std::forward(args)...); 39| 51.6k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EERNS1_11relaxed_posISD_EEEEEDcDpOT_: 37| 691k| { 38| 691k| return Deriv::visit_inner(std::forward(args)...); 39| 691k| } _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.68M| { 32| 1.68M| return Deriv::visit_inner(std::forward(args)...); 33| 1.68M| } _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| 2.17k| { 38| 2.17k| return Deriv::visit_inner(std::forward(args)...); 39| 2.17k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EERNS1_15regular_sub_posISD_EEEEEDcDpOT_: 31| 70.2k| { 32| 70.2k| return Deriv::visit_inner(std::forward(args)...); 33| 70.2k| } _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| 3.87k| { 38| 3.87k| return Deriv::visit_inner(std::forward(args)...); 39| 3.87k| } _ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EERNS1_8full_posISD_EEEEEDcDpOT_: 31| 1.67k| { 32| 1.67k| return Deriv::visit_inner(std::forward(args)...); 33| 1.67k| } _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| 1.24k| { 32| 1.24k| return Deriv::visit_inner(std::forward(args)...); 33| 1.24k| } _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.61M| { 32| 1.61M| return Deriv::visit_inner(std::forward(args)...); 33| 1.61M| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 37| 16.6k| { 38| 16.6k| return Deriv::visit_inner(std::forward(args)...); 39| 16.6k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 43| 16.6k| { 44| 16.6k| return Deriv::visit_node(std::forward(args)...); 45| 16.6k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 37| 13.9k| { 38| 13.9k| return Deriv::visit_inner(std::forward(args)...); 39| 13.9k| } _ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_: 43| 13.9k| { 44| 13.9k| return Deriv::visit_node(std::forward(args)...); 45| 13.9k| } _ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_: 31| 7.02k| { 32| 7.02k| return Deriv::visit_inner(std::forward(args)...); 33| 7.02k| } _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| 7.02k| { 44| 7.02k| return Deriv::visit_node(std::forward(args)...); 45| 7.02k| } _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| 6.93k| { 38| 6.93k| return Deriv::visit_inner(std::forward(args)...); 39| 6.93k| } _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| 6.93k| { 44| 6.93k| return Deriv::visit_node(std::forward(args)...); 45| 6.93k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERKPSH_RKjRmEEEDcDpOT_: 31| 11.6k| { 32| 11.6k| return Deriv::visit_inner(std::forward(args)...); 33| 11.6k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE11visit_innerIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERKPSH_RKjRmEEEDcDpOT_: 43| 11.6k| { 44| 11.6k| return Deriv::visit_node(std::forward(args)...); 45| 11.6k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERjSJ_RNS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERmEEEDcDpOT_: 31| 21.3k| { 32| 21.3k| return Deriv::visit_inner(std::forward(args)...); 33| 21.3k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor10this_aux_tEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERjRNS1_15regular_sub_posISH_EERNS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERmEEEDcDpOT_: 31| 2.20k| { 32| 2.20k| return Deriv::visit_inner(std::forward(args)...); 33| 2.20k| } _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| 882| { 32| 882| return Deriv::visit_inner(std::forward(args)...); 33| 882| } _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| 998| { 38| 998| return Deriv::visit_inner(std::forward(args)...); 39| 998| } _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.52M| { 32| 8.52M| return Deriv::visit_inner(std::forward(args)...); 33| 8.52M| } _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| 327k| { 38| 327k| return Deriv::visit_inner(std::forward(args)...); 39| 327k| } _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| 852k| { 38| 852k| return Deriv::visit_inner(std::forward(args)...); 39| 852k| } _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| 95.7k| { 38| 95.7k| return Deriv::visit_inner(std::forward(args)...); 39| 95.7k| } _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| 81.5k| { 38| 81.5k| return Deriv::visit_inner(std::forward(args)...); 39| 81.5k| } _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| 777| { 38| 777| return Deriv::visit_inner(std::forward(args)...); 39| 777| } _ZN5immer6detail4rbts12visitor_baseINS1_24for_each_chunk_p_visitorEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSF_Lj2ELj2EEEEEDaOT_EUlSN_T0_E_EEEDcDpOT_: 37| 18.2k| { 38| 18.2k| return Deriv::visit_inner(std::forward(args)...); 39| 18.2k| } _ZN5immer6detail4rbts12visitor_baseINS1_24for_each_chunk_p_visitorEE13visit_regularIJRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSF_Lj2ELj2EEEEEDaOT_EUlSN_T0_E_EEEDcDpOT_: 37| 5.91k| { 38| 5.91k| return Deriv::visit_inner(std::forward(args)...); 39| 5.91k| } _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.51k| { 38| 2.51k| return Deriv::visit_inner(std::forward(args)...); 39| 2.51k| } _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.65k| { 38| 2.65k| return Deriv::visit_inner(std::forward(args)...); 39| 2.65k| } _ZN5immer6detail4rbts12visitor_baseINS1_24for_each_chunk_p_visitorEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERZNS1_14equals_visitor13equal_chunk_pINS1_16rrbtree_iteratorIiSF_Lj2ELj2EEEEEDaOT_EUlSN_T0_E_EEEDcDpOT_: 31| 579k| { 32| 579k| return Deriv::visit_inner(std::forward(args)...); 33| 579k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERPSH_RjRmEEEDcDpOT_: 31| 1.43k| { 32| 1.43k| return Deriv::visit_inner(std::forward(args)...); 33| 1.43k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE11visit_innerIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEERNS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERPSH_RjRmEEEDcDpOT_: 43| 1.43k| { 44| 1.43k| return Deriv::visit_node(std::forward(args)...); 45| 1.43k| } _ZN5immer6detail4rbts12visitor_baseINS1_14equals_visitor3rrbEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEEENS1_16rrbtree_iteratorIiSG_Lj2ELj2EEERKPSH_RKjRmEEEDcDpOT_: 37| 6.23k| { 38| 6.23k| return Deriv::visit_inner(std::forward(args)...); 39| 6.23k| } _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.23k| { 44| 6.23k| return Deriv::visit_node(std::forward(args)...); 45| 6.23k| } _ZN5immer6detail15auto_const_castINS_15refcount_policyEEERT_RKS3_: 143| 107M|{ 144| 107M| return const_cast(x); 145| 107M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7inner_tEPSC_Lb0EE15get_storage_ptrEv: 113| 101M| { 114| 101M| check_base(); 115| 101M| auto* base = static_cast(this); 116| 101M| return reinterpret_cast(base + 1); 117| 101M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE7inner_tEPSC_Lb0EE10check_baseEv: 134| 101M| { 135| 101M| static_assert(std::is_standard_layout::value && 136| 101M| !std::is_empty::value, 137| 101M| "Please add 'true' if the derived class is emtpy"); 138| 101M| } _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| 10.7M|{ 330| 10.7M| std::forward(f)(empty_t{}); 331| 10.7M|} _ZN5immer6detail9destroy_nIPijEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 1.42M|{ 189| 1.42M| return first + n; 190| 1.42M|} _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6leaf_tEiLb1EE15get_storage_ptrEv: 75| 9.89M| { 76| 9.89M| check_base(); 77| 9.89M| return reinterpret_cast(this); 78| 9.89M| } _ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6leaf_tEiLb1EE10check_baseEv: 94| 9.89M| { 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.89M| static_assert(std::is_standard_layout::value, 100| 9.89M| "Please remove 'true' if the derived class is non emtpy"); 101| 9.89M| } _ZN5immer6detail18uninitialized_copyIPiS2_S2_EENSt3__19enable_ifIX18can_trivially_copyIT_T1_EES6_E4typeES5_T0_S6_: 236| 1.73M|{ 237| 1.73M| return std::copy(first, last, out); 238| 1.73M|} _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| 300k|{ 345| 300k| return std::forward(f2)(empty_t{}); 346| 300k|} _ZN5immer6detail4ipowImEET_S2_j: 323| 61.6M|{ 324| 61.6M| return pow == 0 ? 1 : num * ipow(num, pow - 1); ------------------ | Branch (324:12): [True: 1.92M, False: 59.7M] ------------------ 325| 61.6M|} _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| 64.6k|{ 345| 64.6k| return std::forward(f2)(empty_t{}); 346| 64.6k|} _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| 100k|{ 330| 100k| std::forward(f)(empty_t{}); 331| 100k|} _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| 11.3k|{ 345| 11.3k| return std::forward(f2)(empty_t{}); 346| 11.3k|} _ZN5immer6detail9destroy_nIPimEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_: 188| 571|{ 189| 571| return first + n; 190| 571|} _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| 198k|{ 345| 198k| return std::forward(f2)(empty_t{}); 346| 198k|} _ZN5immer6detail18uninitialized_moveIPiS2_EENSt3__19enable_ifIX18can_trivially_copyIT_T0_EES6_E4typeES5_S5_S6_: 210| 1.59k|{ 211| 1.59k| return std::copy(first, last, out); 212| 1.59k|} _ZN5immer6detail8as_constIiEEPKT_PS2_: 29| 1.21M|{ 30| 1.21M| return x; 31| 1.21M|} _ZN5immer6detail4makeINS_15debug_size_heapINS_8cpp_heapEEENS_3boxIiNS_13memory_policyINS_21free_list_heap_policyIS3_Lm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6holderEJiEEEPT0_DpOT1_: 260| 18.9k|{ 261| 18.9k| auto ptr = Heap::allocate(sizeof(T)); 262| 18.9k| IMMER_TRY { ------------------ | | 49| 18.9k|#define IMMER_TRY try ------------------ 263| 18.9k| return new (ptr) T(std::forward(args)...); 264| 18.9k| } 265| 18.9k| IMMER_CATCH (...) { 266| 0| Heap::deallocate(sizeof(T), ptr); 267| 0| IMMER_RETHROW; ------------------ | | 52| 0|#define IMMER_RETHROW throw ------------------ 268| 0| } 269| 18.9k|} _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEC2Ev: 96| 68.9k| 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.42M| : impl_(std::move(impl)) 537| 1.42M| { 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.42M| } _ZNK5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4sizeEv: 181| 2.73M| 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| 116k| { 324| 116k| return impl_.update(index, std::forward(fn)); 325| 116k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4takeEm: 350| 23.8k| { 351| 23.8k| return impl_.take(elems); 352| 23.8k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4dropEm: 376| 25.3k| { 377| 25.3k| return impl_.drop(elems); 378| 25.3k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE8max_sizeEv: 90| 1.12M| 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| 806k| { 404| 806k| return l.impl_.concat(r.impl_); 405| 806k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9push_backEi: 251| 31.6k| { 252| 31.6k| return push_back_move(move_t{}, std::move(value)); 253| 31.6k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE14push_back_moveENSt3__117integral_constantIbLb1EEEi: 547| 31.6k| { 548| 31.6k| impl_.push_back_mut({}, std::move(value)); 549| 31.6k| return std::move(*this); 550| 31.6k| } flex-vector.cpp:_ZNO5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6updateIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSE_E0_EEDcmOSE_: 329| 71.0k| { 330| 71.0k| return update_move(move_t{}, index, std::forward(fn)); 331| 71.0k| } flex-vector.cpp:_ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11update_moveIZZ22LLVMFuzzerTestOneInputENK3$_6clI12fuzzer_inputEEDaRT_EUlSE_E0_EEOS9_NSt3__117integral_constantIbLb1EEEmOSE_: 568| 71.0k| { 569| 71.0k| impl_.update_mut({}, index, std::forward(fn)); 570| 71.0k| return std::move(*this); 571| 71.0k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4takeEm: 355| 41.1k| { 356| 41.1k| return take_move(move_t{}, elems); 357| 41.1k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9take_moveENSt3__117integral_constantIbLb1EEEm: 579| 41.1k| { 580| 41.1k| impl_.take_mut({}, elems); 581| 41.1k| return std::move(*this); 582| 41.1k| } _ZNO5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE4dropEm: 381| 42.8k| { 382| 42.8k| return drop_move(move_t{}, elems); 383| 42.8k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE9drop_moveENSt3__117integral_constantIbLb1EEEm: 589| 42.8k| { 590| 42.8k| impl_.drop_mut({}, elems); 591| 42.8k| return std::move(*this); 592| 42.8k| } _ZN5immerplEONS_11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEERKS9_: 409| 248k| { 410| 248k| return concat_move(move_t{}, std::move(l), r); 411| 248k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11concat_moveENSt3__117integral_constantIbLb1EEEOS9_RKS9_: 600| 248k| { 601| 248k| concat_mut_l(l.impl_, {}, r.impl_); 602| 248k| return std::move(l); 603| 248k| } _ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EEEOS9_: 415| 3.66k| { 416| 3.66k| return concat_move(move_t{}, l, std::move(r)); 417| 3.66k| } _ZN5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE11concat_moveENSt3__117integral_constantIbLb1EEERKS9_OS9_: 606| 3.66k| { 607| 3.66k| concat_mut_r(l.impl_, r.impl_, {}); 608| 3.66k| return std::move(r); 609| 3.66k| } _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| 27.6k| { 223| 27.6k| return impl_.equals(other.impl_); 224| 27.6k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE5eraseEm: 480| 3.32k| { 481| 3.32k| return take(pos) + drop(pos + 1); 482| 3.32k| } _ZNKR5immer11flex_vectorIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEELj2ELj2EE6insertEmi: 442| 18.9k| { 443| 18.9k| return take(pos).push_back(std::move(value)) + drop(pos); 444| 18.9k| } _ZN5immer8cpp_heap10deallocateEmPv: 36| 9.35M| static void deallocate(std::size_t, void* data) { ::operator delete(data); } _ZN5immer8cpp_heap8allocateIJEEEPvmDpT_: 27| 9.35M| { 28| 9.35M| return ::operator new(size); 29| 9.35M| } _ZN5immer15debug_size_heapINS_8cpp_heapEE10deallocateIJEEEvmPvDpT_: 57| 9.35M| { 58| 9.35M| auto p = (std::size_t*) (((char*) data) - extra_size); 59| 9.35M| assert(*p == size); ------------------ | Branch (59:9): [True: 9.35M, False: 0] ------------------ 60| 9.35M| Base::deallocate(size + extra_size, p, tags...); 61| 9.35M| } _ZN5immer15debug_size_heapINS_8cpp_heapEE8allocateIJEEEPvmDpT_: 49| 9.35M| { 50| 9.35M| auto p = (std::size_t*) Base::allocate(size + extra_size, tags...); 51| 9.35M| new (p) std::size_t{size}; 52| 9.35M| return ((char*) p) + extra_size; 53| 9.35M| } _ZN5immer14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEE10deallocateIJEEEvmPvDpT_: 56| 9.92M| { 57| 9.92M| assert(size <= Size); ------------------ | Branch (57:9): [True: 9.92M, False: 0] ------------------ 58| | 59| | // we use relaxed, because we are fine with temporarily having 60| | // a few more/less buffers in free list 61| 9.92M| if (head().count.load(std::memory_order_relaxed) >= Limit) { ------------------ | Branch (61:13): [True: 9.33M, False: 585k] ------------------ 62| 9.33M| base_t::deallocate(Size, data); 63| 9.33M| } else { 64| 585k| auto n = static_cast(data); 65| 585k| do { 66| 585k| n->next = head().data; 67| 585k| } while (!head().data.compare_exchange_weak(n->next, n)); ------------------ | Branch (67:22): [True: 0, False: 585k] ------------------ 68| 585k| head().count.fetch_add(1u, std::memory_order_relaxed); 69| 585k| } 70| 9.92M| } _ZN5immer14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEE4headEv: 80| 22.7M| { 81| 22.7M| static head_t head_{{nullptr}, {0}}; 82| 22.7M| return head_; 83| 22.7M| } _ZN5immer14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEE8allocateIJEEEPvmDpT_: 39| 9.92M| { 40| 9.92M| assert(size <= Size); ------------------ | Branch (40:9): [True: 9.92M, False: 0] ------------------ 41| | 42| 9.92M| node_t* n; 43| 9.92M| do { 44| 9.92M| n = head().data; 45| 9.92M| if (!n) { ------------------ | Branch (45:17): [True: 9.33M, False: 584k] ------------------ 46| 9.33M| auto p = base_t::allocate(Size); 47| 9.33M| return p; 48| 9.33M| } 49| 9.92M| } while (!head().data.compare_exchange_weak(n, n->next)); ------------------ | Branch (49:18): [True: 0, False: 584k] ------------------ 50| 584k| head().count.fetch_sub(1u, std::memory_order_relaxed); 51| 584k| return n; 52| 9.92M| } _ZN5immer10split_heapILm56ENS_27thread_local_free_list_heapILm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEEES5_E10deallocateIJEEEvmPvDpT_: 33| 25.4M| { 34| 25.4M| if (size <= Size) ------------------ | Branch (34:13): [True: 25.4M, False: 0] ------------------ 35| 25.4M| SmallHeap::deallocate(size, data, tags...); 36| 0| else 37| 0| BigHeap::deallocate(size, data, tags...); 38| 25.4M| } _ZN5immer10split_heapILm56ENS_27thread_local_free_list_heapILm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEEES5_E8allocateIJEEEPvmDpT_: 26| 15.0M| { 27| 15.0M| return size <= Size ? SmallHeap::allocate(size, tags...) ------------------ | Branch (27:16): [True: 15.0M, False: 0] ------------------ 28| 15.0M| : BigHeap::allocate(size, tags...); 29| 15.0M| } _ZN5immer10split_heapILm56ENS_27thread_local_free_list_heapILm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEEES5_E8allocateIJNS_10norefs_tagEEEEPvmDpT_: 26| 10.3M| { 27| 10.3M| return size <= Size ? SmallHeap::allocate(size, tags...) ------------------ | Branch (27:16): [True: 10.3M, False: 0] ------------------ 28| 10.3M| : BigHeap::allocate(size, tags...); 29| 10.3M| } _ZN5immer6detail30thread_local_free_list_storageINS0_26unsafe_free_list_heap_implIS1_Lm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEEEE4headEv: 35| 128M| { 36| 128M| thread_local static head_t head_{nullptr, 0}; 37| 128M| return head_; 38| 128M| } _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| 25.4M| { 73| 25.4M| assert(size <= Size); ------------------ | Branch (73:9): [True: 25.4M, False: 0] ------------------ 74| | 75| 25.4M| if (storage::head().count >= Limit) ------------------ | Branch (75:13): [True: 9.92M, False: 15.4M] ------------------ 76| 9.92M| base_t::deallocate(Size, data); 77| 15.4M| else { 78| 15.4M| auto n = static_cast(data); 79| 15.4M| n->next = storage::head().data; 80| 15.4M| storage::head().data = n; 81| 15.4M| ++storage::head().count; 82| 15.4M| } 83| 25.4M| } _ZN5immer6detail26unsafe_free_list_heap_implINS0_30thread_local_free_list_storageELm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEE5clearEv: 86| 1| { 87| 1.02k| while (storage::head().data) { ------------------ | Branch (87:16): [True: 1.02k, False: 1] ------------------ 88| 1.02k| auto n = storage::head().data->next; 89| 1.02k| base_t::deallocate(Size, storage::head().data); 90| 1.02k| storage::head().data = n; 91| 1.02k| --storage::head().count; 92| 1.02k| } 93| 1| } _ZN5immer6detail26unsafe_free_list_heap_implINS0_30thread_local_free_list_storageELm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEE8allocateIJEEEPvmDpT_: 57| 15.0M| { 58| 15.0M| assert(size <= Size); ------------------ | Branch (58:9): [True: 15.0M, False: 0] ------------------ 59| | 60| 15.0M| auto n = storage::head().data; 61| 15.0M| if (!n) { ------------------ | Branch (61:13): [True: 5.08M, False: 9.93M] ------------------ 62| 5.08M| auto p = base_t::allocate(Size); 63| 5.08M| return p; 64| 5.08M| } 65| 9.93M| --storage::head().count; 66| 9.93M| storage::head().data = n->next; 67| 9.93M| return n; 68| 15.0M| } _ZN5immer6detail26unsafe_free_list_heap_implINS0_30thread_local_free_list_storageELm56ELm1024ENS_14free_list_heapILm56ELm1024ENS_15debug_size_heapINS_8cpp_heapEEEEEE8allocateIJNS_10norefs_tagEEEEPvmDpT_: 57| 10.3M| { 58| 10.3M| assert(size <= Size); ------------------ | Branch (58:9): [True: 10.3M, False: 0] ------------------ 59| | 60| 10.3M| auto n = storage::head().data; 61| 10.3M| if (!n) { ------------------ | Branch (61:13): [True: 4.83M, False: 5.55M] ------------------ 62| 4.83M| auto p = base_t::allocate(Size); 63| 4.83M| return p; 64| 4.83M| } 65| 5.55M| --storage::head().count; 66| 5.55M| storage::head().data = n->next; 67| 5.55M| return n; 68| 10.3M| } _ZN5immer15refcount_policyC2Ev: 28| 25.4M| : refcount{1} {}; _ZN5immer15refcount_policy3incEv: 34| 40.1M| void inc() { refcount.fetch_add(1, std::memory_order_relaxed); } _ZN5immer15refcount_policy3decEv: 36| 65.6M| bool dec() { return 1 == refcount.fetch_sub(1, std::memory_order_acq_rel); } _ZN5immer15refcount_policy6uniqueEv: 38| 1.97M| bool unique() { return refcount == 1; } _ZNK5immer20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5ownee5ownedEv: 36| 25.4M| bool owned() const { return false; } _ZNK5immer20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5ownee10can_mutateENS6_4editE: 35| 118k| bool can_mutate(edit) const { return false; } _ZN5immer20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeaSENS6_4editE: 34| 520k| ownee& operator=(edit) { return *this; };