_ZN11ArgsManagerD2Ev: 130| 2|ArgsManager::~ArgsManager() = default; _ZN15ChaCha20AlignedD2Ev: 42| 4|{ 43| 4| memory_cleanse(input, sizeof(input)); 44| 4|} _ZN8ChaCha20D2Ev: 332| 4|{ 333| 4| memory_cleanse(m_buffer.data(), m_buffer.size()); 334| 4|} _ZN9ChainCodeD2Ev: 28| 2| ~ChainCode() { memory_cleanse(data(), size()); } _ZN11CNetCleanupD2Ev: 3676| 2| { 3677| |#ifdef WIN32 3678| | // Shutdown Windows Sockets 3679| | WSACleanup(); 3680| |#endif 3681| 2| } _ZNK9prevectorILj16EhjiE9is_directEv: 126| 16| bool is_direct() const { return _size <= N; } _ZN9prevectorILj16EhjiED2Ev: 422| 16| ~prevector() { 423| 16| if (!is_direct()) { ------------------ | Branch (423:13): [True: 0, False: 16] ------------------ 424| 0| free(_union.indirect_contents.indirect); 425| 0| _union.indirect_contents.indirect = nullptr; 426| 0| } 427| 16| } _ZNK9prevectorILj36EhjiE9is_directEv: 126| 14| bool is_direct() const { return _size <= N; } _ZN9prevectorILj36EhjiED2Ev: 422| 14| ~prevector() { 423| 14| if (!is_direct()) { ------------------ | Branch (423:13): [True: 0, False: 14] ------------------ 424| 0| free(_union.indirect_contents.indirect); 425| 0| _union.indirect_contents.indirect = nullptr; 426| 0| } 427| 14| } random.cpp:_ZN12_GLOBAL__N_18RNGStateD2Ev: 367| 2| ~RNGState() = default; _ZN20BaseSignatureCheckerD2Ev: 298| 2| virtual ~BaseSignatureChecker() = default; _ZN6script5ConstERKNSt3__112basic_stringIcNS0_11char_traitsIcEENS0_9allocatorIcEEEERNS0_4spanIKcLm18446744073709551615EEEb: 14| 712|{ 15| 712| if ((size_t)sp.size() >= str.size() && std::equal(str.begin(), str.end(), sp.begin())) { ------------------ | Branch (15:9): [True: 661, False: 51] | Branch (15:44): [True: 401, False: 260] ------------------ 16| 401| if (skip) sp = sp.subspan(str.size()); ------------------ | Branch (16:13): [True: 401, False: 0] ------------------ 17| 401| return true; 18| 401| } 19| 311| return false; 20| 712|} _ZN6script4FuncERKNSt3__112basic_stringIcNS0_11char_traitsIcEENS0_9allocatorIcEEEERNS0_4spanIKcLm18446744073709551615EEE: 23| 712|{ 24| 712| if ((size_t)sp.size() >= str.size() + 2 && sp[str.size()] == '(' && sp[sp.size() - 1] == ')' && std::equal(str.begin(), str.end(), sp.begin())) { ------------------ | Branch (24:9): [True: 360, False: 352] | Branch (24:48): [True: 176, False: 184] | Branch (24:73): [True: 131, False: 45] | Branch (24:101): [True: 82, False: 49] ------------------ 25| 82| sp = sp.subspan(str.size() + 1, sp.size() - str.size() - 2); 26| 82| return true; 27| 82| } 28| 630| return false; 29| 712|} _ZN6script4ExprERNSt3__14spanIKcLm18446744073709551615EEE: 32| 712|{ 33| 712| int level = 0; 34| 712| auto it = sp.begin(); 35| 8.01M| while (it != sp.end()) { ------------------ | Branch (35:12): [True: 8.01M, False: 582] ------------------ 36| 8.01M| if (*it == '(' || *it == '{') { ------------------ | Branch (36:13): [True: 7.10k, False: 8.00M] | Branch (36:27): [True: 1.12M, False: 6.87M] ------------------ 37| 1.13M| ++level; 38| 6.87M| } else if (level && (*it == ')' || *it == '}')) { ------------------ | Branch (38:20): [True: 3.10M, False: 3.77M] | Branch (38:30): [True: 2.51k, False: 3.10M] | Branch (38:44): [True: 935, False: 3.10M] ------------------ 39| 3.45k| --level; 40| 6.87M| } else if (level == 0 && (*it == ')' || *it == '}' || *it == ',')) { ------------------ | Branch (40:20): [True: 3.77M, False: 3.10M] | Branch (40:35): [True: 88, False: 3.77M] | Branch (40:49): [True: 19, False: 3.77M] | Branch (40:63): [True: 23, False: 3.77M] ------------------ 41| 130| break; 42| 130| } 43| 8.01M| ++it; 44| 8.01M| } 45| 712| std::span ret = sp.first(it - sp.begin()); 46| 712| sp = sp.subspan(it - sp.begin()); 47| 712| return ret; 48| 712|} _ZN20BaseSignatureCreatorD2Ev: 41| 4| virtual ~BaseSignatureCreator() = default; _ZN15SigningProviderD2Ev: 170| 2| virtual ~SigningProvider() = default; random.cpp:_ZN16secure_allocatorIN12_GLOBAL__N_18RNGStateEE10deallocateEPS1_m: 37| 2| { 38| 2| if (p != nullptr) { ------------------ | Branch (38:13): [True: 2, False: 0] ------------------ 39| 2| memory_cleanse(p, sizeof(T) * n); 40| 2| } 41| 2| LockedPoolManager::Instance().free(p); 42| 2| } _Z14memory_cleansePvm: 15| 14|{ 16| |#if defined(WIN32) 17| | /* SecureZeroMemory is guaranteed not to be optimized out. */ 18| | SecureZeroMemory(ptr, len); 19| |#else 20| 14| std::memset(ptr, 0, len); 21| | 22| | /* Memory barrier that scares the compiler away from optimizing out the memset. 23| | * 24| | * Quoting Adam Langley in commit ad1907fe73334d6c696c8539646c21b11178f20f 25| | * in BoringSSL (ISC License): 26| | * As best as we can tell, this is sufficient to break any optimisations that 27| | * might try to eliminate "superfluous" memsets. 28| | * This method is used in memzero_explicit() the Linux kernel, too. Its advantage is that it 29| | * is pretty efficient because the compiler can still implement the memset() efficiently, 30| | * just not remove it entirely. See "Dead Store Elimination (Still) Considered Harmful" by 31| | * Yang et al. (USENIX Security 2017) for more background. 32| | */ 33| 14| __asm__ __volatile__("" : : "r"(ptr) : "memory"); 34| 14|#endif 35| 14|} _ZN5ArenaD2Ev: 48| 2|Arena::~Arena() = default; _ZN5Arena4freeEPv: 87| 2|{ 88| | // Freeing the nullptr pointer is OK. 89| 2| if (ptr == nullptr) { ------------------ | Branch (89:9): [True: 0, False: 2] ------------------ 90| 0| return; 91| 0| } 92| | 93| | // Remove chunk from used map 94| 2| auto i = chunks_used.find(ptr); 95| 2| if (i == chunks_used.end()) { ------------------ | Branch (95:9): [True: 0, False: 2] ------------------ 96| 0| throw std::runtime_error("Arena: invalid or double free"); 97| 0| } 98| 2| auto freed = std::make_pair(static_cast(i->first), i->second); 99| 2| chunks_used.erase(i); 100| | 101| | // coalesce freed with previous chunk 102| 2| auto prev = chunks_free_end.find(freed.first); 103| 2| if (prev != chunks_free_end.end()) { ------------------ | Branch (103:9): [True: 2, False: 0] ------------------ 104| 2| freed.first -= prev->second->first; 105| 2| freed.second += prev->second->first; 106| 2| size_to_free_chunk.erase(prev->second); 107| 2| chunks_free_end.erase(prev); 108| 2| } 109| | 110| | // coalesce freed with chunk after freed 111| 2| auto next = chunks_free.find(freed.first + freed.second); 112| 2| if (next != chunks_free.end()) { ------------------ | Branch (112:9): [True: 0, False: 2] ------------------ 113| 0| freed.second += next->second->first; 114| 0| size_to_free_chunk.erase(next->second); 115| 0| chunks_free.erase(next); 116| 0| } 117| | 118| | // Add/set space with coalesced free chunk 119| 2| auto it = size_to_free_chunk.emplace(freed.second, freed.first); 120| 2| chunks_free[freed.first] = it; 121| 2| chunks_free_end[freed.first + freed.second] = it; 122| 2|} _ZN24PosixLockedPageAllocator10FreeLockedEPvm: 254| 2|{ 255| 2| len = align_up(len, page_size); 256| 2| memory_cleanse(addr, len); 257| 2| munlock(addr, len); 258| 2| munmap(addr, len); 259| 2|} _ZN10LockedPoolD2Ev: 283| 2|LockedPool::~LockedPool() = default; _ZN10LockedPool4freeEPv: 308| 2|{ 309| 2| std::lock_guard lock(mutex); 310| | // TODO we can do better than this linear search by keeping a map of arena 311| | // extents to arena, and looking up the address. 312| 2| for (auto &arena: arenas) { ------------------ | Branch (312:21): [True: 2, False: 0] ------------------ 313| 2| if (arena.addressInArena(ptr)) { ------------------ | Branch (313:13): [True: 2, False: 0] ------------------ 314| 2| arena.free(ptr); 315| 2| return; 316| 2| } 317| 2| } 318| 0| throw std::runtime_error("LockedPool: invalid address not pointing to any arena"); 319| 2|} _ZN10LockedPool15LockedPageArenaD2Ev: 370| 2|{ 371| 2| allocator->FreeLocked(base, size); 372| 2|} _ZN17LockedPoolManager8InstanceEv: 405| 2|{ 406| 2| static std::once_flag init_flag; 407| 2| std::call_once(init_flag, LockedPoolManager::CreateInstance); 408| 2| return *LockedPoolManager::_instance; 409| 2|} lockedpool.cpp:_ZL8align_upmm: 32| 2|{ 33| 2| return (x + align - 1) & ~(align - 1); 34| 2|} _ZNK5Arena14addressInArenaEPv: 90| 2| bool addressInArena(void *ptr) const { return ptr >= base && ptr < end; } ------------------ | Branch (90:51): [True: 2, False: 0] | Branch (90:66): [True: 2, False: 0] ------------------ _ZN19LockedPageAllocatorD2Ev: 22| 2| virtual ~LockedPageAllocator() = default; _ZN14AnnotatedMixinINSt3__115recursive_mutexEED2Ev: 96| 2| ~AnnotatedMixin() { 97| 2| DeleteLock((void*)this); 98| 2| } _ZN14AnnotatedMixinINSt3__15mutexEED2Ev: 96| 64| ~AnnotatedMixin() { 97| 64| DeleteLock((void*)this); 98| 64| } _Z10DeleteLockPv: 74| 66|inline void DeleteLock(void* cs) {} _Z17MaybeCheckNotHeldR14AnnotatedMixinINSt3__15mutexEE: 258| 30|inline Mutex& MaybeCheckNotHeld(Mutex& cs) EXCLUSIVE_LOCKS_REQUIRED(!cs) LOCK_RETURNED(cs) { return cs; } _ZN10UniqueLockI14AnnotatedMixinINSt3__15mutexEEEC2ERS3_PKcS7_ib: 181| 30| UniqueLock(MutexType& mutexIn, const char* pszName, const char* pszFile, int nLine, bool fTry = false) EXCLUSIVE_LOCK_FUNCTION(mutexIn) : Base(mutexIn, std::defer_lock) 182| 30| { 183| 30| if (fTry) ------------------ | Branch (183:13): [True: 0, False: 30] ------------------ 184| 0| TryEnter(pszName, pszFile, nLine); 185| 30| else 186| 30| Enter(pszName, pszFile, nLine); 187| 30| } _Z13EnterCriticalINSt3__15mutexEEvPKcS3_iPT_b: 67| 30|inline void EnterCritical(const char* pszName, const char* pszFile, int nLine, MutexType* cs, bool fTry = false) {} _Z13LeaveCriticalv: 68| 30|inline void LeaveCritical() {} _ZN10UniqueLockI14AnnotatedMixinINSt3__15mutexEEE5EnterEPKcS6_i: 159| 30| { 160| 30| EnterCritical(pszName, pszFile, nLine, Base::mutex()); 161| |#ifdef DEBUG_LOCKCONTENTION 162| | if (!Base::try_lock()) { 163| | ContendedLock(pszName, pszFile, nLine, static_cast(*this)); 164| | } 165| |#else 166| 30| Base::lock(); 167| 30|#endif 168| 30| } _ZN10UniqueLockI14AnnotatedMixinINSt3__15mutexEEED2Ev: 201| 30| { 202| 30| if (Base::owns_lock()) ------------------ | Branch (202:13): [True: 30, False: 0] ------------------ 203| 30| LeaveCritical(); 204| 30| } _ZN18FuzzedDataProvider29ConsumeRemainingBytesAsStringEv: 188| 712|inline std::string FuzzedDataProvider::ConsumeRemainingBytesAsString() { 189| 712| return ConsumeBytesAsString(remaining_bytes_); 190| 712|} _ZN18FuzzedDataProvider15ConsumeIntegralImEET_v: 195| 712|template T FuzzedDataProvider::ConsumeIntegral() { 196| 712| return ConsumeIntegralInRange(std::numeric_limits::min(), 197| 712| std::numeric_limits::max()); 198| 712|} _ZN18FuzzedDataProviderC2EPKhm: 37| 712| : data_ptr_(data), remaining_bytes_(size) {} _ZN18FuzzedDataProvider20ConsumeBytesAsStringEm: 137| 1.42k|inline std::string FuzzedDataProvider::ConsumeBytesAsString(size_t num_bytes) { 138| 1.42k| static_assert(sizeof(std::string::value_type) == sizeof(uint8_t), 139| 1.42k| "ConsumeBytesAsString cannot convert the data to a string."); 140| | 141| 1.42k| num_bytes = std::min(num_bytes, remaining_bytes_); 142| 1.42k| std::string result( 143| 1.42k| reinterpret_cast(data_ptr_), num_bytes); 144| 1.42k| Advance(num_bytes); 145| 1.42k| return result; 146| 1.42k|} _ZN18FuzzedDataProvider7AdvanceEm: 343| 1.42k|inline void FuzzedDataProvider::Advance(size_t num_bytes) { 344| 1.42k| if (num_bytes > remaining_bytes_) ------------------ | Branch (344:7): [True: 0, False: 1.42k] ------------------ 345| 0| abort(); 346| | 347| 1.42k| data_ptr_ += num_bytes; 348| 1.42k| remaining_bytes_ -= num_bytes; 349| 1.42k|} _ZN18FuzzedDataProvider22ConsumeIntegralInRangeImEET_S1_S1_: 205| 712|T FuzzedDataProvider::ConsumeIntegralInRange(T min, T max) { 206| 712| static_assert(std::is_integral_v, "An integral type is required."); 207| 712| static_assert(sizeof(T) <= sizeof(uint64_t), "Unsupported integral type."); 208| | 209| 712| if (min > max) ------------------ | Branch (209:7): [True: 0, False: 712] ------------------ 210| 0| abort(); 211| | 212| | // Use the biggest type possible to hold the range and the result. 213| 712| uint64_t range = static_cast(max) - static_cast(min); 214| 712| uint64_t result = 0; 215| 712| size_t offset = 0; 216| | 217| 6.08k| while (offset < sizeof(T) * CHAR_BIT && (range >> offset) > 0 && ------------------ | Branch (217:10): [True: 5.45k, False: 637] | Branch (217:43): [True: 5.45k, False: 0] ------------------ 218| 5.45k| remaining_bytes_ != 0) { ------------------ | Branch (218:10): [True: 5.37k, False: 75] ------------------ 219| | // Pull bytes off the end of the seed data. Experimentally, this seems to 220| | // allow the fuzzer to more easily explore the input space. This makes 221| | // sense, since it works by modifying inputs that caused new code to run, 222| | // and this data is often used to encode length of data read by 223| | // |ConsumeBytes|. Separating out read lengths makes it easier modify the 224| | // contents of the data that is actually read. 225| 5.37k| --remaining_bytes_; 226| 5.37k| result = (result << CHAR_BIT) | data_ptr_[remaining_bytes_]; 227| 5.37k| offset += CHAR_BIT; 228| 5.37k| } 229| | 230| | // Avoid division by 0, in case |range + 1| results in overflow. 231| 712| if (range != std::numeric_limits::max()) ------------------ | Branch (231:7): [True: 0, False: 712] ------------------ 232| 0| result = result % (range + 1); 233| | 234| 712| return static_cast(static_cast(min) + result); 235| 712|} LLVMFuzzerTestOneInput: 213| 712|{ 214| 712| test_one_input({data, size}); 215| 712| return 0; 216| 712|} fuzz.cpp:_ZL14test_one_inputNSt3__14spanIKhLm18446744073709551615EEE: 84| 712|{ 85| 712| CheckGlobals check{}; 86| 712| (*Assert(g_test_one_input))(buffer); ------------------ | | 116| 712|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 87| 712|} _Z26script_parsing_fuzz_targetNSt3__14spanIKhLm18446744073709551615EEE: 14| 712|{ 15| 712| FuzzedDataProvider fuzzed_data_provider(buffer.data(), buffer.size()); 16| 712| const size_t query_size = fuzzed_data_provider.ConsumeIntegral(); 17| 712| const std::string query = fuzzed_data_provider.ConsumeBytesAsString(std::min(query_size, 1_MiB)); 18| 712| const std::string span_str = fuzzed_data_provider.ConsumeRemainingBytesAsString(); 19| 712| const std::span const_span{span_str}; 20| | 21| 712| std::span mut_span = const_span; 22| 712| (void)script::Const(query, mut_span); 23| | 24| 712| mut_span = const_span; 25| 712| (void)script::Func(query, mut_span); 26| | 27| 712| mut_span = const_span; 28| 712| (void)script::Expr(mut_span); 29| | 30| 712| if (!query.empty()) { ------------------ | Branch (30:9): [True: 368, False: 344] ------------------ 31| 368| mut_span = const_span; 32| 368| (void)Split(mut_span, query.front()); 33| 368| } 34| 712|} _ZN12CheckGlobalsC2Ev: 59| 712|CheckGlobals::CheckGlobals() : m_impl(std::make_unique()) {} _ZN12CheckGlobalsD2Ev: 60| 714|CheckGlobals::~CheckGlobals() = default; _ZN16CheckGlobalsImplC2Ev: 17| 712| { 18| 712| g_used_g_prng = false; 19| 712| g_seeded_g_prng_zero = false; 20| 712| g_used_system_time = false; 21| 712| SetMockTime(0s); 22| 712| MockableSteadyClock::ClearMockTime(); 23| 712| } _ZN16CheckGlobalsImplD2Ev: 25| 714| { 26| 714| if (g_used_g_prng && !g_seeded_g_prng_zero) { ------------------ | Branch (26:13): [True: 0, False: 714] | Branch (26:30): [True: 0, False: 0] ------------------ 27| 0| std::cerr << "\n\n" 28| 0| "The current fuzz target used the global random state.\n\n" 29| | 30| 0| "This is acceptable, but requires the fuzz target to call \n" 31| 0| "SeedRandomStateForTest(SeedRand::ZEROS) in the first line \n" 32| 0| "of the FUZZ_TARGET function.\n\n" 33| | 34| 0| "An alternative solution would be to avoid any use of globals.\n\n" 35| | 36| 0| "Without a solution, fuzz instability and non-determinism can lead \n" 37| 0| "to non-reproducible bugs or inefficient fuzzing.\n\n" 38| 0| << std::endl; 39| 0| std::abort(); // Abort, because AFL may try to recover from a std::exit 40| 0| } 41| | 42| 714| if (g_used_system_time) { ------------------ | Branch (42:13): [True: 0, False: 714] ------------------ 43| 0| std::cerr << "\n\n" 44| 0| "The current fuzz target accessed system time.\n\n" 45| | 46| 0| "This is acceptable, but requires the fuzz target to use \n" 47| 0| "a FakeNodeClock, FakeSteadyClock or call \n" 48| 0| "SetMockTime() at the \n" "beginning of processing the \n" 49| 0| "fuzz input.\n\n" 50| | 51| 0| "Without setting mock time, time-dependent behavior can lead \n" 52| 0| "to non-reproducible bugs or inefficient fuzzing.\n\n" 53| 0| << std::endl; 54| 0| std::abort(); 55| 0| } 56| 714| } __gcov_reset: 13| 2|extern "C" __attribute__((weak)) void __gcov_reset(void) {} _ZN9base_blobILj256EE4dataEv: 99| 2| constexpr unsigned char* data() { return m_data.data(); } _ZN9base_blobILj256EE4sizeEv: 107| 2| static constexpr unsigned int size() { return WIDTH; } _ZN10btcsignals6signalIFvvENS_10null_valueEED2Ev: 175| 6| ~signal() = default; _ZN10btcsignals6signalIFv20SynchronizationStatellbENS_10null_valueEED2Ev: 175| 2| ~signal() = default; _ZN10btcsignals6signalIFv20SynchronizationStateRK11CBlockIndexdENS_10null_valueEED2Ev: 175| 2| ~signal() = default; _ZN10btcsignals6signalIFvRKNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEibENS_10null_valueEED2Ev: 175| 2| ~signal() = default; _ZN10btcsignals6signalIFvbENS_10null_valueEED2Ev: 175| 2| ~signal() = default; _ZN10btcsignals6signalIFviENS_10null_valueEED2Ev: 175| 2| ~signal() = default; _ZN10btcsignals6signalIFvRKNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEENS_10null_valueEED2Ev: 175| 2| ~signal() = default; _ZN10btcsignals6signalIFbRK13bilingual_strRKNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEjENS_6any_ofEED2Ev: 175| 2| ~signal() = default; _ZN10btcsignals6signalIFvRK13bilingual_strjENS_10null_valueEED2Ev: 175| 2| ~signal() = default; _Z22inline_assertion_checkILb1ERPKNSt3__18functionIFvNS0_4spanIKhLm18446744073709551615EEEEEEEOT0_SB_RKNS0_15source_locationENS0_17basic_string_viewIcNS0_11char_traitsIcEEEE: 90| 712|{ 91| 712| if (IS_ASSERT || std::is_constant_evaluated() || G_ABORT_ON_FAILED_ASSUME) { ------------------ | Branch (91:9): [True: 712, Folded] | Branch (91:22): [Folded, False: 0] | Branch (91:54): [True: 0, Folded] ------------------ 92| 712| if (!val) { ------------------ | Branch (92:13): [True: 0, False: 712] ------------------ 93| 0| assertion_fail(loc, assertion); 94| 0| } 95| 712| } 96| 712| return std::forward(val); 97| 712|} _Z22inline_assertion_checkILb1EbEOT0_S1_RKNSt3__115source_locationENS2_17basic_string_viewIcNS2_11char_traitsIcEEEE: 90| 712|{ 91| 712| if (IS_ASSERT || std::is_constant_evaluated() || G_ABORT_ON_FAILED_ASSUME) { ------------------ | Branch (91:9): [True: 712, Folded] | Branch (91:22): [Folded, False: 0] | Branch (91:54): [True: 0, Folded] ------------------ 92| 712| if (!val) { ------------------ | Branch (92:13): [True: 0, False: 712] ------------------ 93| 0| assertion_fail(loc, assertion); 94| 0| } 95| 712| } 96| 712| return std::forward(val); 97| 712|} _Z22inline_assertion_checkILb0EbEOT0_S1_RKNSt3__115source_locationENS2_17basic_string_viewIcNS2_11char_traitsIcEEEE: 90| 10|{ 91| 10| if (IS_ASSERT || std::is_constant_evaluated() || G_ABORT_ON_FAILED_ASSUME) { ------------------ | Branch (91:9): [Folded, False: 0] | Branch (91:22): [Folded, False: 0] | Branch (91:54): [True: 0, Folded] ------------------ 92| 10| if (!val) { ------------------ | Branch (92:13): [True: 0, False: 10] ------------------ 93| 0| assertion_fail(loc, assertion); 94| 0| } 95| 10| } 96| 10| return std::forward(val); 97| 10|} _ZN4util5SplitINSt3__14spanIKcLm18446744073709551615EEEEENS1_6vectorIT_NS1_9allocatorIS6_EEEERKS4_cb: 148| 368|{ 149| 368| return Split(sp, std::string_view{&sep, 1}, include_sep); 150| 368|} _ZN4util5SplitINSt3__14spanIKcLm18446744073709551615EEEEENS1_6vectorIT_NS1_9allocatorIS6_EEEERKS4_NS1_17basic_string_viewIcNS1_11char_traitsIcEEEEb: 120| 368|{ 121| 368| std::vector ret; 122| 368| auto it = sp.begin(); 123| 368| auto start = it; 124| 7.48M| while (it != sp.end()) { ------------------ | Branch (124:12): [True: 7.48M, False: 368] ------------------ 125| 7.48M| if (separators.find(*it) != std::string::npos) { ------------------ | Branch (125:13): [True: 1.86M, False: 5.62M] ------------------ 126| 1.86M| if (include_sep) { ------------------ | Branch (126:17): [True: 0, False: 1.86M] ------------------ 127| 0| ret.emplace_back(start, it + 1); 128| 1.86M| } else { 129| 1.86M| ret.emplace_back(start, it); 130| 1.86M| } 131| 1.86M| start = it + 1; 132| 1.86M| } 133| 7.48M| ++it; 134| 7.48M| } 135| 368| ret.emplace_back(start, it); 136| 368| return ret; 137| 368|} _ZN16CThreadInterruptD2Ev: 32| 4| virtual ~CThreadInterrupt() = default; _ZN10ThreadPoolD2Ev: 93| 10| { 94| 10| Stop(); // In case it hasn't been stopped. 95| 10| } _ZN10ThreadPool4StopEv: 129| 10| { 130| | // Notify workers and join them 131| 10| std::vector threads_to_join; 132| 10| { 133| 10| LOCK(m_mutex); ------------------ | | 268| 10|#define LOCK(cs) UniqueLock BITCOIN_UNIQUE_NAME(criticalblock)(MaybeCheckNotHeld(cs), #cs, __FILE__, __LINE__) | | ------------------ | | | | 11| 10|#define BITCOIN_UNIQUE_NAME(name) PASTE2(name, __COUNTER__) | | | | ------------------ | | | | | | 9| 10|#define PASTE2(x, y) PASTE(x, y) | | | | | | ------------------ | | | | | | | | 8| 10|#define PASTE(x, y) x ## y | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 134| | // Ensure Stop() is not called from a worker thread while workers are still registered, 135| | // otherwise a self-join deadlock would occur. 136| 10| auto id = std::this_thread::get_id(); 137| 10| for (const auto& worker : m_workers) assert(worker.get_id() != id); ------------------ | Branch (137:37): [True: 0, False: 10] | Branch (137:50): [True: 0, False: 0] ------------------ 138| | // Early shutdown to return right away on any concurrent Submit() call 139| 10| m_interrupt = true; 140| 10| threads_to_join.swap(m_workers); 141| 10| } 142| 0| m_cv.notify_all(); 143| | // Help draining queue 144| 10| while (ProcessTask()) {} ------------------ | Branch (144:16): [True: 0, False: 10] ------------------ 145| | // Free resources 146| 10| for (auto& worker : threads_to_join) worker.join(); ------------------ | Branch (146:27): [True: 0, False: 10] ------------------ 147| | 148| | // Since we currently wait for tasks completion, sanity-check empty queue 149| 10| LOCK(m_mutex); ------------------ | | 268| 10|#define LOCK(cs) UniqueLock BITCOIN_UNIQUE_NAME(criticalblock)(MaybeCheckNotHeld(cs), #cs, __FILE__, __LINE__) | | ------------------ | | | | 11| 10|#define BITCOIN_UNIQUE_NAME(name) PASTE2(name, __COUNTER__) | | | | ------------------ | | | | | | 9| 10|#define PASTE2(x, y) PASTE(x, y) | | | | | | ------------------ | | | | | | | | 8| 10|#define PASTE(x, y) x ## y | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 150| 10| Assume(m_work_queue.empty()); ------------------ | | 128| 10|#define Assume(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 151| | // Re-allow Start() now that all workers have exited 152| 10| m_interrupt = false; 153| 10| } _ZN10ThreadPool11ProcessTaskEv: 244| 10| { 245| 10| std::packaged_task task; 246| 10| { 247| 10| LOCK(m_mutex); ------------------ | | 268| 10|#define LOCK(cs) UniqueLock BITCOIN_UNIQUE_NAME(criticalblock)(MaybeCheckNotHeld(cs), #cs, __FILE__, __LINE__) | | ------------------ | | | | 11| 10|#define BITCOIN_UNIQUE_NAME(name) PASTE2(name, __COUNTER__) | | | | ------------------ | | | | | | 9| 10|#define PASTE2(x, y) PASTE(x, y) | | | | | | ------------------ | | | | | | | | 8| 10|#define PASTE(x, y) x ## y | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 248| 10| if (m_work_queue.empty()) return false; ------------------ | Branch (248:17): [True: 10, False: 0] ------------------ 249| | 250| | // Pop the task 251| 0| task = std::move(m_work_queue.front()); 252| 0| m_work_queue.pop(); 253| 0| } 254| 0| task(); 255| 0| return true; 256| 10| } _Z11SetMockTimeNSt3__16chrono8durationIxNS_5ratioILl1ELl1EEEEE: 54| 712|{ 55| 712| Assert(mock_time_in >= 0s); ------------------ | | 116| 712|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 56| 712| g_mock_time.store(mock_time_in, std::memory_order_relaxed); 57| 712|} _ZN19MockableSteadyClock13ClearMockTimeEv: 84| 712|{ 85| 712| g_mock_steady_time.store(0ms, std::memory_order_relaxed); 86| 712|} _ZN19WalletInitInterfaceD2Ev: 25| 2| virtual ~WalletInitInterface() = default;