_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; _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| } _ZN18FuzzedDataProvider15ConsumeIntegralItEET_v: 195| 2.45k|template T FuzzedDataProvider::ConsumeIntegral() { 196| 2.45k| return ConsumeIntegralInRange(std::numeric_limits::min(), 197| 2.45k| std::numeric_limits::max()); 198| 2.45k|} _ZN18FuzzedDataProvider22ConsumeIntegralInRangeItEET_S1_S1_: 205| 2.45k|T FuzzedDataProvider::ConsumeIntegralInRange(T min, T max) { 206| 2.45k| static_assert(std::is_integral_v, "An integral type is required."); 207| 2.45k| static_assert(sizeof(T) <= sizeof(uint64_t), "Unsupported integral type."); 208| | 209| 2.45k| if (min > max) ------------------ | Branch (209:7): [True: 0, False: 2.45k] ------------------ 210| 0| abort(); 211| | 212| | // Use the biggest type possible to hold the range and the result. 213| 2.45k| uint64_t range = static_cast(max) - static_cast(min); 214| 2.45k| uint64_t result = 0; 215| 2.45k| size_t offset = 0; 216| | 217| 4.34k| while (offset < sizeof(T) * CHAR_BIT && (range >> offset) > 0 && ------------------ | Branch (217:10): [True: 3.41k, False: 937] | Branch (217:43): [True: 3.41k, False: 0] ------------------ 218| 3.41k| remaining_bytes_ != 0) { ------------------ | Branch (218:10): [True: 1.89k, False: 1.52k] ------------------ 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| 1.89k| --remaining_bytes_; 226| 1.89k| result = (result << CHAR_BIT) | data_ptr_[remaining_bytes_]; 227| 1.89k| offset += CHAR_BIT; 228| 1.89k| } 229| | 230| | // Avoid division by 0, in case |range + 1| results in overflow. 231| 2.45k| if (range != std::numeric_limits::max()) ------------------ | Branch (231:7): [True: 2.45k, False: 0] ------------------ 232| 2.45k| result = result % (range + 1); 233| | 234| 2.45k| return static_cast(static_cast(min) + result); 235| 2.45k|} _ZN18FuzzedDataProvider15ConsumeIntegralIjEET_v: 195| 2.45k|template T FuzzedDataProvider::ConsumeIntegral() { 196| 2.45k| return ConsumeIntegralInRange(std::numeric_limits::min(), 197| 2.45k| std::numeric_limits::max()); 198| 2.45k|} _ZN18FuzzedDataProvider15ConsumeIntegralIaEET_v: 195| 2.45k|template T FuzzedDataProvider::ConsumeIntegral() { 196| 2.45k| return ConsumeIntegralInRange(std::numeric_limits::min(), 197| 2.45k| std::numeric_limits::max()); 198| 2.45k|} _ZN18FuzzedDataProvider22ConsumeIntegralInRangeIaEET_S1_S1_: 205| 2.45k|T FuzzedDataProvider::ConsumeIntegralInRange(T min, T max) { 206| 2.45k| static_assert(std::is_integral_v, "An integral type is required."); 207| 2.45k| static_assert(sizeof(T) <= sizeof(uint64_t), "Unsupported integral type."); 208| | 209| 2.45k| if (min > max) ------------------ | Branch (209:7): [True: 0, False: 2.45k] ------------------ 210| 0| abort(); 211| | 212| | // Use the biggest type possible to hold the range and the result. 213| 2.45k| uint64_t range = static_cast(max) - static_cast(min); 214| 2.45k| uint64_t result = 0; 215| 2.45k| size_t offset = 0; 216| | 217| 4.89k| while (offset < sizeof(T) * CHAR_BIT && (range >> offset) > 0 && ------------------ | Branch (217:10): [True: 2.45k, False: 2.43k] | Branch (217:43): [True: 2.45k, False: 0] ------------------ 218| 2.45k| remaining_bytes_ != 0) { ------------------ | Branch (218:10): [True: 2.43k, False: 23] ------------------ 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| 2.43k| --remaining_bytes_; 226| 2.43k| result = (result << CHAR_BIT) | data_ptr_[remaining_bytes_]; 227| 2.43k| offset += CHAR_BIT; 228| 2.43k| } 229| | 230| | // Avoid division by 0, in case |range + 1| results in overflow. 231| 2.45k| if (range != std::numeric_limits::max()) ------------------ | Branch (231:7): [True: 2.45k, False: 0] ------------------ 232| 2.45k| result = result % (range + 1); 233| | 234| 2.45k| return static_cast(static_cast(min) + result); 235| 2.45k|} _ZN18FuzzedDataProvider15ConsumeIntegralIsEET_v: 195| 2.45k|template T FuzzedDataProvider::ConsumeIntegral() { 196| 2.45k| return ConsumeIntegralInRange(std::numeric_limits::min(), 197| 2.45k| std::numeric_limits::max()); 198| 2.45k|} _ZN18FuzzedDataProvider22ConsumeIntegralInRangeIsEET_S1_S1_: 205| 2.45k|T FuzzedDataProvider::ConsumeIntegralInRange(T min, T max) { 206| 2.45k| static_assert(std::is_integral_v, "An integral type is required."); 207| 2.45k| static_assert(sizeof(T) <= sizeof(uint64_t), "Unsupported integral type."); 208| | 209| 2.45k| if (min > max) ------------------ | Branch (209:7): [True: 0, False: 2.45k] ------------------ 210| 0| abort(); 211| | 212| | // Use the biggest type possible to hold the range and the result. 213| 2.45k| uint64_t range = static_cast(max) - static_cast(min); 214| 2.45k| uint64_t result = 0; 215| 2.45k| size_t offset = 0; 216| | 217| 6.72k| while (offset < sizeof(T) * CHAR_BIT && (range >> offset) > 0 && ------------------ | Branch (217:10): [True: 4.60k, False: 2.12k] | Branch (217:43): [True: 4.60k, False: 0] ------------------ 218| 4.60k| remaining_bytes_ != 0) { ------------------ | Branch (218:10): [True: 4.27k, False: 337] ------------------ 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| 4.27k| --remaining_bytes_; 226| 4.27k| result = (result << CHAR_BIT) | data_ptr_[remaining_bytes_]; 227| 4.27k| offset += CHAR_BIT; 228| 4.27k| } 229| | 230| | // Avoid division by 0, in case |range + 1| results in overflow. 231| 2.45k| if (range != std::numeric_limits::max()) ------------------ | Branch (231:7): [True: 2.45k, False: 0] ------------------ 232| 2.45k| result = result % (range + 1); 233| | 234| 2.45k| return static_cast(static_cast(min) + result); 235| 2.45k|} _ZN18FuzzedDataProvider15ConsumeIntegralIiEET_v: 195| 2.45k|template T FuzzedDataProvider::ConsumeIntegral() { 196| 2.45k| return ConsumeIntegralInRange(std::numeric_limits::min(), 197| 2.45k| std::numeric_limits::max()); 198| 2.45k|} _ZN18FuzzedDataProviderC2EPKhm: 37| 1.22k| : data_ptr_(data), remaining_bytes_(size) {} _ZN18FuzzedDataProvider15ConsumeIntegralIhEET_v: 195| 2.45k|template T FuzzedDataProvider::ConsumeIntegral() { 196| 2.45k| return ConsumeIntegralInRange(std::numeric_limits::min(), 197| 2.45k| std::numeric_limits::max()); 198| 2.45k|} _ZN18FuzzedDataProvider22ConsumeIntegralInRangeIhEET_S1_S1_: 205| 2.45k|T FuzzedDataProvider::ConsumeIntegralInRange(T min, T max) { 206| 2.45k| static_assert(std::is_integral_v, "An integral type is required."); 207| 2.45k| static_assert(sizeof(T) <= sizeof(uint64_t), "Unsupported integral type."); 208| | 209| 2.45k| if (min > max) ------------------ | Branch (209:7): [True: 0, False: 2.45k] ------------------ 210| 0| abort(); 211| | 212| | // Use the biggest type possible to hold the range and the result. 213| 2.45k| uint64_t range = static_cast(max) - static_cast(min); 214| 2.45k| uint64_t result = 0; 215| 2.45k| size_t offset = 0; 216| | 217| 3.51k| while (offset < sizeof(T) * CHAR_BIT && (range >> offset) > 0 && ------------------ | Branch (217:10): [True: 2.45k, False: 1.05k] | Branch (217:43): [True: 2.45k, False: 0] ------------------ 218| 2.45k| remaining_bytes_ != 0) { ------------------ | Branch (218:10): [True: 1.05k, False: 1.40k] ------------------ 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| 1.05k| --remaining_bytes_; 226| 1.05k| result = (result << CHAR_BIT) | data_ptr_[remaining_bytes_]; 227| 1.05k| offset += CHAR_BIT; 228| 1.05k| } 229| | 230| | // Avoid division by 0, in case |range + 1| results in overflow. 231| 2.45k| if (range != std::numeric_limits::max()) ------------------ | Branch (231:7): [True: 2.45k, False: 0] ------------------ 232| 2.45k| result = result % (range + 1); 233| | 234| 2.45k| return static_cast(static_cast(min) + result); 235| 2.45k|} _ZN18FuzzedDataProvider22ConsumeIntegralInRangeIjEET_S1_S1_: 205| 9.83k|T FuzzedDataProvider::ConsumeIntegralInRange(T min, T max) { 206| 9.83k| static_assert(std::is_integral_v, "An integral type is required."); 207| 9.83k| static_assert(sizeof(T) <= sizeof(uint64_t), "Unsupported integral type."); 208| | 209| 9.83k| if (min > max) ------------------ | Branch (209:7): [True: 0, False: 9.83k] ------------------ 210| 0| abort(); 211| | 212| | // Use the biggest type possible to hold the range and the result. 213| 9.83k| uint64_t range = static_cast(max) - static_cast(min); 214| 9.83k| uint64_t result = 0; 215| 9.83k| size_t offset = 0; 216| | 217| 16.8k| while (offset < sizeof(T) * CHAR_BIT && (range >> offset) > 0 && ------------------ | Branch (217:10): [True: 16.1k, False: 701] | Branch (217:43): [True: 12.0k, False: 4.16k] ------------------ 218| 12.0k| remaining_bytes_ != 0) { ------------------ | Branch (218:10): [True: 7.04k, False: 4.96k] ------------------ 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| 7.04k| --remaining_bytes_; 226| 7.04k| result = (result << CHAR_BIT) | data_ptr_[remaining_bytes_]; 227| 7.04k| offset += CHAR_BIT; 228| 7.04k| } 229| | 230| | // Avoid division by 0, in case |range + 1| results in overflow. 231| 9.83k| if (range != std::numeric_limits::max()) ------------------ | Branch (231:7): [True: 9.83k, False: 0] ------------------ 232| 9.83k| result = result % (range + 1); 233| | 234| 9.83k| return static_cast(static_cast(min) + result); 235| 9.83k|} _ZN18FuzzedDataProvider22ConsumeIntegralInRangeIiEET_S1_S1_: 205| 2.45k|T FuzzedDataProvider::ConsumeIntegralInRange(T min, T max) { 206| 2.45k| static_assert(std::is_integral_v, "An integral type is required."); 207| 2.45k| static_assert(sizeof(T) <= sizeof(uint64_t), "Unsupported integral type."); 208| | 209| 2.45k| if (min > max) ------------------ | Branch (209:7): [True: 0, False: 2.45k] ------------------ 210| 0| abort(); 211| | 212| | // Use the biggest type possible to hold the range and the result. 213| 2.45k| uint64_t range = static_cast(max) - static_cast(min); 214| 2.45k| uint64_t result = 0; 215| 2.45k| size_t offset = 0; 216| | 217| 8.98k| while (offset < sizeof(T) * CHAR_BIT && (range >> offset) > 0 && ------------------ | Branch (217:10): [True: 7.39k, False: 1.59k] | Branch (217:43): [True: 7.39k, False: 0] ------------------ 218| 7.39k| remaining_bytes_ != 0) { ------------------ | Branch (218:10): [True: 6.52k, False: 866] ------------------ 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| 6.52k| --remaining_bytes_; 226| 6.52k| result = (result << CHAR_BIT) | data_ptr_[remaining_bytes_]; 227| 6.52k| offset += CHAR_BIT; 228| 6.52k| } 229| | 230| | // Avoid division by 0, in case |range + 1| results in overflow. 231| 2.45k| if (range != std::numeric_limits::max()) ------------------ | Branch (231:7): [True: 2.45k, False: 0] ------------------ 232| 2.45k| result = result % (range + 1); 233| | 234| 2.45k| return static_cast(static_cast(min) + result); 235| 2.45k|} LLVMFuzzerTestOneInput: 213| 1.22k|{ 214| 1.22k| test_one_input({data, size}); 215| 1.22k| return 0; 216| 1.22k|} fuzz.cpp:_ZL14test_one_inputNSt3__14spanIKhLm18446744073709551615EEE: 84| 1.22k|{ 85| 1.22k| CheckGlobals check{}; 86| 1.22k| (*Assert(g_test_one_input))(buffer); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 87| 1.22k|} _Z20overflow_fuzz_targetNSt3__14spanIKhLm18446744073709551615EEE: 42| 1.22k|{ 43| 1.22k| FuzzedDataProvider fuzzed_data_provider(buffer.data(), buffer.size()); 44| 1.22k| TestOverflow(fuzzed_data_provider); 45| 1.22k| TestOverflow(fuzzed_data_provider); 46| 1.22k| TestOverflow(fuzzed_data_provider); 47| 1.22k| TestOverflow(fuzzed_data_provider); 48| 1.22k| TestOverflow(fuzzed_data_provider); 49| 1.22k| TestOverflow(fuzzed_data_provider); 50| 1.22k|} overflow.cpp:_ZN12_GLOBAL__N_112TestOverflowIalEEvR18FuzzedDataProvider: 18| 1.22k|{ 19| 1.22k| constexpr auto min{std::numeric_limits::min()}; 20| 1.22k| constexpr auto max{std::numeric_limits::max()}; 21| | // Range needs to be at least twice as big to allow two numbers to be added without overflowing. 22| 1.22k| static_assert(min >= std::numeric_limits::min() / 2); 23| 1.22k| static_assert(max <= std::numeric_limits::max() / 2); 24| | 25| 1.22k| auto widen = [](T value) -> W { return value; }; 26| 1.22k| auto clamp = [](W value) -> W { return std::clamp(value, min, max); }; 27| 1.22k| auto check = [](W value) -> std::optional { if (value >= min && value <= max) return value; else return std::nullopt; }; 28| | 29| 1.22k| const T i = fuzzed_data_provider.ConsumeIntegral(); 30| 1.22k| const T j = fuzzed_data_provider.ConsumeIntegral(); 31| 1.22k| const unsigned shift = fuzzed_data_provider.ConsumeIntegralInRange(0, std::numeric_limits::digits - std::numeric_limits::digits); 32| | 33| 1.22k| Assert(clamp(widen(i) + widen(j)) == SaturatingAdd(i, j)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 34| 1.22k| Assert(check(widen(i) + widen(j)) == CheckedAdd(i, j)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 35| | 36| 1.22k| Assert(clamp(widen(i) << shift) == SaturatingLeftShift(i, shift)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 37| 1.22k| Assert(check(widen(i) << shift) == CheckedLeftShift(i, shift)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 38| 1.22k|} overflow.cpp:_ZZN12_GLOBAL__N_112TestOverflowIalEEvR18FuzzedDataProviderENKUllE_clEl: 26| 2.45k| auto clamp = [](W value) -> W { return std::clamp(value, min, max); }; overflow.cpp:_ZZN12_GLOBAL__N_112TestOverflowIalEEvR18FuzzedDataProviderENKUlaE_clEa: 25| 7.37k| auto widen = [](T value) -> W { return value; }; overflow.cpp:_ZZN12_GLOBAL__N_112TestOverflowIalEEvR18FuzzedDataProviderENKUllE0_clEl: 27| 2.45k| auto check = [](W value) -> std::optional { if (value >= min && value <= max) return value; else return std::nullopt; }; ------------------ | Branch (27:56): [True: 1.48k, False: 977] | Branch (27:72): [True: 944, False: 537] ------------------ overflow.cpp:_ZN12_GLOBAL__N_112TestOverflowIslEEvR18FuzzedDataProvider: 18| 1.22k|{ 19| 1.22k| constexpr auto min{std::numeric_limits::min()}; 20| 1.22k| constexpr auto max{std::numeric_limits::max()}; 21| | // Range needs to be at least twice as big to allow two numbers to be added without overflowing. 22| 1.22k| static_assert(min >= std::numeric_limits::min() / 2); 23| 1.22k| static_assert(max <= std::numeric_limits::max() / 2); 24| | 25| 1.22k| auto widen = [](T value) -> W { return value; }; 26| 1.22k| auto clamp = [](W value) -> W { return std::clamp(value, min, max); }; 27| 1.22k| auto check = [](W value) -> std::optional { if (value >= min && value <= max) return value; else return std::nullopt; }; 28| | 29| 1.22k| const T i = fuzzed_data_provider.ConsumeIntegral(); 30| 1.22k| const T j = fuzzed_data_provider.ConsumeIntegral(); 31| 1.22k| const unsigned shift = fuzzed_data_provider.ConsumeIntegralInRange(0, std::numeric_limits::digits - std::numeric_limits::digits); 32| | 33| 1.22k| Assert(clamp(widen(i) + widen(j)) == SaturatingAdd(i, j)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 34| 1.22k| Assert(check(widen(i) + widen(j)) == CheckedAdd(i, j)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 35| | 36| 1.22k| Assert(clamp(widen(i) << shift) == SaturatingLeftShift(i, shift)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 37| 1.22k| Assert(check(widen(i) << shift) == CheckedLeftShift(i, shift)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 38| 1.22k|} overflow.cpp:_ZZN12_GLOBAL__N_112TestOverflowIslEEvR18FuzzedDataProviderENKUllE_clEl: 26| 2.45k| auto clamp = [](W value) -> W { return std::clamp(value, min, max); }; overflow.cpp:_ZZN12_GLOBAL__N_112TestOverflowIslEEvR18FuzzedDataProviderENKUlsE_clEs: 25| 7.37k| auto widen = [](T value) -> W { return value; }; overflow.cpp:_ZZN12_GLOBAL__N_112TestOverflowIslEEvR18FuzzedDataProviderENKUllE0_clEl: 27| 2.45k| auto check = [](W value) -> std::optional { if (value >= min && value <= max) return value; else return std::nullopt; }; ------------------ | Branch (27:56): [True: 1.56k, False: 894] | Branch (27:72): [True: 1.08k, False: 478] ------------------ overflow.cpp:_ZN12_GLOBAL__N_112TestOverflowIilEEvR18FuzzedDataProvider: 18| 1.22k|{ 19| 1.22k| constexpr auto min{std::numeric_limits::min()}; 20| 1.22k| constexpr auto max{std::numeric_limits::max()}; 21| | // Range needs to be at least twice as big to allow two numbers to be added without overflowing. 22| 1.22k| static_assert(min >= std::numeric_limits::min() / 2); 23| 1.22k| static_assert(max <= std::numeric_limits::max() / 2); 24| | 25| 1.22k| auto widen = [](T value) -> W { return value; }; 26| 1.22k| auto clamp = [](W value) -> W { return std::clamp(value, min, max); }; 27| 1.22k| auto check = [](W value) -> std::optional { if (value >= min && value <= max) return value; else return std::nullopt; }; 28| | 29| 1.22k| const T i = fuzzed_data_provider.ConsumeIntegral(); 30| 1.22k| const T j = fuzzed_data_provider.ConsumeIntegral(); 31| 1.22k| const unsigned shift = fuzzed_data_provider.ConsumeIntegralInRange(0, std::numeric_limits::digits - std::numeric_limits::digits); 32| | 33| 1.22k| Assert(clamp(widen(i) + widen(j)) == SaturatingAdd(i, j)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 34| 1.22k| Assert(check(widen(i) + widen(j)) == CheckedAdd(i, j)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 35| | 36| 1.22k| Assert(clamp(widen(i) << shift) == SaturatingLeftShift(i, shift)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 37| 1.22k| Assert(check(widen(i) << shift) == CheckedLeftShift(i, shift)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 38| 1.22k|} overflow.cpp:_ZZN12_GLOBAL__N_112TestOverflowIilEEvR18FuzzedDataProviderENKUllE_clEl: 26| 2.45k| auto clamp = [](W value) -> W { return std::clamp(value, min, max); }; overflow.cpp:_ZZN12_GLOBAL__N_112TestOverflowIilEEvR18FuzzedDataProviderENKUliE_clEi: 25| 7.37k| auto widen = [](T value) -> W { return value; }; overflow.cpp:_ZZN12_GLOBAL__N_112TestOverflowIilEEvR18FuzzedDataProviderENKUllE0_clEl: 27| 2.45k| auto check = [](W value) -> std::optional { if (value >= min && value <= max) return value; else return std::nullopt; }; ------------------ | Branch (27:56): [True: 1.54k, False: 915] | Branch (27:72): [True: 1.25k, False: 287] ------------------ overflow.cpp:_ZN12_GLOBAL__N_112TestOverflowIhmEEvR18FuzzedDataProvider: 18| 1.22k|{ 19| 1.22k| constexpr auto min{std::numeric_limits::min()}; 20| 1.22k| constexpr auto max{std::numeric_limits::max()}; 21| | // Range needs to be at least twice as big to allow two numbers to be added without overflowing. 22| 1.22k| static_assert(min >= std::numeric_limits::min() / 2); 23| 1.22k| static_assert(max <= std::numeric_limits::max() / 2); 24| | 25| 1.22k| auto widen = [](T value) -> W { return value; }; 26| 1.22k| auto clamp = [](W value) -> W { return std::clamp(value, min, max); }; 27| 1.22k| auto check = [](W value) -> std::optional { if (value >= min && value <= max) return value; else return std::nullopt; }; 28| | 29| 1.22k| const T i = fuzzed_data_provider.ConsumeIntegral(); 30| 1.22k| const T j = fuzzed_data_provider.ConsumeIntegral(); 31| 1.22k| const unsigned shift = fuzzed_data_provider.ConsumeIntegralInRange(0, std::numeric_limits::digits - std::numeric_limits::digits); 32| | 33| 1.22k| Assert(clamp(widen(i) + widen(j)) == SaturatingAdd(i, j)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 34| 1.22k| Assert(check(widen(i) + widen(j)) == CheckedAdd(i, j)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 35| | 36| 1.22k| Assert(clamp(widen(i) << shift) == SaturatingLeftShift(i, shift)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 37| 1.22k| Assert(check(widen(i) << shift) == CheckedLeftShift(i, shift)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 38| 1.22k|} overflow.cpp:_ZZN12_GLOBAL__N_112TestOverflowIhmEEvR18FuzzedDataProviderENKUlmE_clEm: 26| 2.45k| auto clamp = [](W value) -> W { return std::clamp(value, min, max); }; overflow.cpp:_ZZN12_GLOBAL__N_112TestOverflowIhmEEvR18FuzzedDataProviderENKUlhE_clEh: 25| 7.37k| auto widen = [](T value) -> W { return value; }; overflow.cpp:_ZZN12_GLOBAL__N_112TestOverflowIhmEEvR18FuzzedDataProviderENKUlmE0_clEm: 27| 2.45k| auto check = [](W value) -> std::optional { if (value >= min && value <= max) return value; else return std::nullopt; }; ------------------ | Branch (27:56): [True: 2.45k, False: 0] | Branch (27:72): [True: 1.95k, False: 505] ------------------ overflow.cpp:_ZN12_GLOBAL__N_112TestOverflowItmEEvR18FuzzedDataProvider: 18| 1.22k|{ 19| 1.22k| constexpr auto min{std::numeric_limits::min()}; 20| 1.22k| constexpr auto max{std::numeric_limits::max()}; 21| | // Range needs to be at least twice as big to allow two numbers to be added without overflowing. 22| 1.22k| static_assert(min >= std::numeric_limits::min() / 2); 23| 1.22k| static_assert(max <= std::numeric_limits::max() / 2); 24| | 25| 1.22k| auto widen = [](T value) -> W { return value; }; 26| 1.22k| auto clamp = [](W value) -> W { return std::clamp(value, min, max); }; 27| 1.22k| auto check = [](W value) -> std::optional { if (value >= min && value <= max) return value; else return std::nullopt; }; 28| | 29| 1.22k| const T i = fuzzed_data_provider.ConsumeIntegral(); 30| 1.22k| const T j = fuzzed_data_provider.ConsumeIntegral(); 31| 1.22k| const unsigned shift = fuzzed_data_provider.ConsumeIntegralInRange(0, std::numeric_limits::digits - std::numeric_limits::digits); 32| | 33| 1.22k| Assert(clamp(widen(i) + widen(j)) == SaturatingAdd(i, j)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 34| 1.22k| Assert(check(widen(i) + widen(j)) == CheckedAdd(i, j)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 35| | 36| 1.22k| Assert(clamp(widen(i) << shift) == SaturatingLeftShift(i, shift)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 37| 1.22k| Assert(check(widen(i) << shift) == CheckedLeftShift(i, shift)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 38| 1.22k|} overflow.cpp:_ZZN12_GLOBAL__N_112TestOverflowItmEEvR18FuzzedDataProviderENKUlmE_clEm: 26| 2.45k| auto clamp = [](W value) -> W { return std::clamp(value, min, max); }; overflow.cpp:_ZZN12_GLOBAL__N_112TestOverflowItmEEvR18FuzzedDataProviderENKUltE_clEt: 25| 7.37k| auto widen = [](T value) -> W { return value; }; overflow.cpp:_ZZN12_GLOBAL__N_112TestOverflowItmEEvR18FuzzedDataProviderENKUlmE0_clEm: 27| 2.45k| auto check = [](W value) -> std::optional { if (value >= min && value <= max) return value; else return std::nullopt; }; ------------------ | Branch (27:56): [True: 2.45k, False: 0] | Branch (27:72): [True: 2.00k, False: 455] ------------------ overflow.cpp:_ZN12_GLOBAL__N_112TestOverflowIjmEEvR18FuzzedDataProvider: 18| 1.22k|{ 19| 1.22k| constexpr auto min{std::numeric_limits::min()}; 20| 1.22k| constexpr auto max{std::numeric_limits::max()}; 21| | // Range needs to be at least twice as big to allow two numbers to be added without overflowing. 22| 1.22k| static_assert(min >= std::numeric_limits::min() / 2); 23| 1.22k| static_assert(max <= std::numeric_limits::max() / 2); 24| | 25| 1.22k| auto widen = [](T value) -> W { return value; }; 26| 1.22k| auto clamp = [](W value) -> W { return std::clamp(value, min, max); }; 27| 1.22k| auto check = [](W value) -> std::optional { if (value >= min && value <= max) return value; else return std::nullopt; }; 28| | 29| 1.22k| const T i = fuzzed_data_provider.ConsumeIntegral(); 30| 1.22k| const T j = fuzzed_data_provider.ConsumeIntegral(); 31| 1.22k| const unsigned shift = fuzzed_data_provider.ConsumeIntegralInRange(0, std::numeric_limits::digits - std::numeric_limits::digits); 32| | 33| 1.22k| Assert(clamp(widen(i) + widen(j)) == SaturatingAdd(i, j)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 34| 1.22k| Assert(check(widen(i) + widen(j)) == CheckedAdd(i, j)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 35| | 36| 1.22k| Assert(clamp(widen(i) << shift) == SaturatingLeftShift(i, shift)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 37| 1.22k| Assert(check(widen(i) << shift) == CheckedLeftShift(i, shift)); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 38| 1.22k|} overflow.cpp:_ZZN12_GLOBAL__N_112TestOverflowIjmEEvR18FuzzedDataProviderENKUlmE_clEm: 26| 2.45k| auto clamp = [](W value) -> W { return std::clamp(value, min, max); }; overflow.cpp:_ZZN12_GLOBAL__N_112TestOverflowIjmEEvR18FuzzedDataProviderENKUljE_clEj: 25| 7.37k| auto widen = [](T value) -> W { return value; }; overflow.cpp:_ZZN12_GLOBAL__N_112TestOverflowIjmEEvR18FuzzedDataProviderENKUlmE0_clEm: 27| 2.45k| auto check = [](W value) -> std::optional { if (value >= min && value <= max) return value; else return std::nullopt; }; ------------------ | Branch (27:56): [True: 2.45k, False: 0] | Branch (27:72): [True: 2.13k, False: 326] ------------------ _ZN12CheckGlobalsC2Ev: 59| 1.22k|CheckGlobals::CheckGlobals() : m_impl(std::make_unique()) {} _ZN12CheckGlobalsD2Ev: 60| 1.23k|CheckGlobals::~CheckGlobals() = default; _ZN16CheckGlobalsImplC2Ev: 17| 1.22k| { 18| 1.22k| g_used_g_prng = false; 19| 1.22k| g_seeded_g_prng_zero = false; 20| 1.22k| g_used_system_time = false; 21| 1.22k| SetMockTime(0s); 22| 1.22k| MockableSteadyClock::ClearMockTime(); 23| 1.22k| } _ZN16CheckGlobalsImplD2Ev: 25| 1.23k| { 26| 1.23k| if (g_used_g_prng && !g_seeded_g_prng_zero) { ------------------ | Branch (26:13): [True: 0, False: 1.23k] | 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| 1.23k| if (g_used_system_time) { ------------------ | Branch (42:13): [True: 0, False: 1.23k] ------------------ 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| 1.23k| } __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| 1.22k|{ 91| 1.22k| if (IS_ASSERT || std::is_constant_evaluated() || G_ABORT_ON_FAILED_ASSUME) { ------------------ | Branch (91:9): [True: 1.22k, Folded] | Branch (91:22): [Folded, False: 0] | Branch (91:54): [True: 0, Folded] ------------------ 92| 1.22k| if (!val) { ------------------ | Branch (92:13): [True: 0, False: 1.22k] ------------------ 93| 0| assertion_fail(loc, assertion); 94| 0| } 95| 1.22k| } 96| 1.22k| return std::forward(val); 97| 1.22k|} _Z22inline_assertion_checkILb1EbEOT0_S1_RKNSt3__115source_locationENS2_17basic_string_viewIcNS2_11char_traitsIcEEEE: 90| 30.7k|{ 91| 30.7k| if (IS_ASSERT || std::is_constant_evaluated() || G_ABORT_ON_FAILED_ASSUME) { ------------------ | Branch (91:9): [True: 30.7k, Folded] | Branch (91:22): [Folded, False: 0] | Branch (91:54): [True: 0, Folded] ------------------ 92| 30.7k| if (!val) { ------------------ | Branch (92:13): [True: 0, False: 30.7k] ------------------ 93| 0| assertion_fail(loc, assertion); 94| 0| } 95| 30.7k| } 96| 30.7k| return std::forward(val); 97| 30.7k|} _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|} _Z13SaturatingAddITkNSt3__18integralEaET_S1_S1_: 45| 1.22k|{ 46| 1.22k| if constexpr (std::numeric_limits::is_signed) { 47| 1.22k| if (i > 0 && j > std::numeric_limits::max() - i) { ------------------ | Branch (47:13): [True: 465, False: 764] | Branch (47:22): [True: 172, False: 293] ------------------ 48| 172| return std::numeric_limits::max(); 49| 172| } 50| 1.05k| if (i < 0 && j < std::numeric_limits::min() - i) { ------------------ | Branch (50:13): [True: 748, False: 309] | Branch (50:22): [True: 424, False: 324] ------------------ 51| 424| return std::numeric_limits::min(); 52| 424| } 53| | } else { 54| | if (std::numeric_limits::max() - i < j) { 55| | return std::numeric_limits::max(); 56| | } 57| | } 58| 633| return i + j; 59| 1.22k|} _Z10CheckedAddIaENSt3__18optionalIT_EES2_S2_: 28| 1.22k|{ 29| 1.22k| if (AdditionOverflow(i, j)) { ------------------ | Branch (29:9): [True: 596, False: 633] ------------------ 30| 596| return std::nullopt; 31| 596| } 32| 633| return i + j; 33| 1.22k|} _Z16AdditionOverflowITkNSt3__18integralEaEbT_S1_: 18| 1.22k|{ 19| 1.22k| if constexpr (std::numeric_limits::is_signed) { 20| 1.22k| return (i > 0 && j > std::numeric_limits::max() - i) || ------------------ | Branch (20:17): [True: 465, False: 764] | Branch (20:26): [True: 172, False: 293] ------------------ 21| 1.05k| (i < 0 && j < std::numeric_limits::min() - i); ------------------ | Branch (21:17): [True: 748, False: 309] | Branch (21:26): [True: 424, False: 324] ------------------ 22| 1.22k| } 23| 0| return std::numeric_limits::max() - i < j; 24| 1.22k|} _Z19SaturatingLeftShiftITkNSt3__18integralEaET_S1_j: 103| 1.22k|{ 104| 1.22k| if (auto result{CheckedLeftShift(input, shift)}) return *result; ------------------ | Branch (104:14): [True: 311, False: 918] ------------------ 105| | // If input << shift is too big to fit in T, return biggest positive or negative 106| | // number that fits. 107| 918| return input < 0 ? std::numeric_limits::min() : std::numeric_limits::max(); ------------------ | Branch (107:12): [True: 553, False: 365] ------------------ 108| 1.22k|} _Z16CheckedLeftShiftITkNSt3__18integralEaENS0_8optionalIT_EES2_j: 84| 2.45k|{ 85| 2.45k| if (shift == 0 || input == 0) return input; ------------------ | Branch (85:9): [True: 522, False: 1.93k] | Branch (85:23): [True: 26, False: 1.91k] ------------------ 86| | // Avoid undefined c++ behaviour if shift is >= number of bits in T. 87| 1.91k| if (shift >= sizeof(T) * CHAR_BIT) return std::nullopt; ------------------ | Branch (87:9): [True: 1.57k, False: 336] ------------------ 88| | // If input << shift is too big to fit in T, return nullopt. 89| 336| if (input > (std::numeric_limits::max() >> shift)) return std::nullopt; ------------------ | Branch (89:9): [True: 90, False: 246] ------------------ 90| 246| if (input < (std::numeric_limits::min() >> shift)) return std::nullopt; ------------------ | Branch (90:9): [True: 172, False: 74] ------------------ 91| 74| return input << shift; 92| 246|} _Z13SaturatingAddITkNSt3__18integralEsET_S1_S1_: 45| 1.22k|{ 46| 1.22k| if constexpr (std::numeric_limits::is_signed) { 47| 1.22k| if (i > 0 && j > std::numeric_limits::max() - i) { ------------------ | Branch (47:13): [True: 447, False: 782] | Branch (47:22): [True: 186, False: 261] ------------------ 48| 186| return std::numeric_limits::max(); 49| 186| } 50| 1.04k| if (i < 0 && j < std::numeric_limits::min() - i) { ------------------ | Branch (50:13): [True: 766, False: 277] | Branch (50:22): [True: 472, False: 294] ------------------ 51| 472| return std::numeric_limits::min(); 52| 472| } 53| | } else { 54| | if (std::numeric_limits::max() - i < j) { 55| | return std::numeric_limits::max(); 56| | } 57| | } 58| 571| return i + j; 59| 1.22k|} _Z10CheckedAddIsENSt3__18optionalIT_EES2_S2_: 28| 1.22k|{ 29| 1.22k| if (AdditionOverflow(i, j)) { ------------------ | Branch (29:9): [True: 658, False: 571] ------------------ 30| 658| return std::nullopt; 31| 658| } 32| 571| return i + j; 33| 1.22k|} _Z16AdditionOverflowITkNSt3__18integralEsEbT_S1_: 18| 1.22k|{ 19| 1.22k| if constexpr (std::numeric_limits::is_signed) { 20| 1.22k| return (i > 0 && j > std::numeric_limits::max() - i) || ------------------ | Branch (20:17): [True: 447, False: 782] | Branch (20:26): [True: 186, False: 261] ------------------ 21| 1.04k| (i < 0 && j < std::numeric_limits::min() - i); ------------------ | Branch (21:17): [True: 766, False: 277] | Branch (21:26): [True: 472, False: 294] ------------------ 22| 1.22k| } 23| 0| return std::numeric_limits::max() - i < j; 24| 1.22k|} _Z19SaturatingLeftShiftITkNSt3__18integralEsET_S1_j: 103| 1.22k|{ 104| 1.22k| if (auto result{CheckedLeftShift(input, shift)}) return *result; ------------------ | Branch (104:14): [True: 515, False: 714] ------------------ 105| | // If input << shift is too big to fit in T, return biggest positive or negative 106| | // number that fits. 107| 714| return input < 0 ? std::numeric_limits::min() : std::numeric_limits::max(); ------------------ | Branch (107:12): [True: 422, False: 292] ------------------ 108| 1.22k|} _Z16CheckedLeftShiftITkNSt3__18integralEsENS0_8optionalIT_EES2_j: 84| 2.45k|{ 85| 2.45k| if (shift == 0 || input == 0) return input; ------------------ | Branch (85:9): [True: 884, False: 1.57k] | Branch (85:23): [True: 22, False: 1.55k] ------------------ 86| | // Avoid undefined c++ behaviour if shift is >= number of bits in T. 87| 1.55k| if (shift >= sizeof(T) * CHAR_BIT) return std::nullopt; ------------------ | Branch (87:9): [True: 656, False: 896] ------------------ 88| | // If input << shift is too big to fit in T, return nullopt. 89| 896| if (input > (std::numeric_limits::max() >> shift)) return std::nullopt; ------------------ | Branch (89:9): [True: 324, False: 572] ------------------ 90| 572| if (input < (std::numeric_limits::min() >> shift)) return std::nullopt; ------------------ | Branch (90:9): [True: 448, False: 124] ------------------ 91| 124| return input << shift; 92| 572|} _Z10CheckedAddIiENSt3__18optionalIT_EES2_S2_: 28| 1.22k|{ 29| 1.22k| if (AdditionOverflow(i, j)) { ------------------ | Branch (29:9): [True: 708, False: 521] ------------------ 30| 708| return std::nullopt; 31| 708| } 32| 521| return i + j; 33| 1.22k|} _Z16AdditionOverflowITkNSt3__18integralEiEbT_S1_: 18| 1.22k|{ 19| 1.22k| if constexpr (std::numeric_limits::is_signed) { 20| 1.22k| return (i > 0 && j > std::numeric_limits::max() - i) || ------------------ | Branch (20:17): [True: 350, False: 879] | Branch (20:26): [True: 94, False: 256] ------------------ 21| 1.13k| (i < 0 && j < std::numeric_limits::min() - i); ------------------ | Branch (21:17): [True: 874, False: 261] | Branch (21:26): [True: 614, False: 260] ------------------ 22| 1.22k| } 23| 0| return std::numeric_limits::max() - i < j; 24| 1.22k|} _Z19SaturatingLeftShiftITkNSt3__18integralEiET_S1_j: 103| 1.22k|{ 104| 1.22k| if (auto result{CheckedLeftShift(input, shift)}) return *result; ------------------ | Branch (104:14): [True: 735, False: 494] ------------------ 105| | // If input << shift is too big to fit in T, return biggest positive or negative 106| | // number that fits. 107| 494| return input < 0 ? std::numeric_limits::min() : std::numeric_limits::max(); ------------------ | Branch (107:12): [True: 301, False: 193] ------------------ 108| 1.22k|} _Z16CheckedLeftShiftITkNSt3__18integralEiENS0_8optionalIT_EES2_j: 84| 2.45k|{ 85| 2.45k| if (shift == 0 || input == 0) return input; ------------------ | Branch (85:9): [True: 1.36k, False: 1.09k] | Branch (85:23): [True: 6, False: 1.08k] ------------------ 86| | // Avoid undefined c++ behaviour if shift is >= number of bits in T. 87| 1.08k| if (shift >= sizeof(T) * CHAR_BIT) return std::nullopt; ------------------ | Branch (87:9): [True: 60, False: 1.02k] ------------------ 88| | // If input << shift is too big to fit in T, return nullopt. 89| 1.02k| if (input > (std::numeric_limits::max() >> shift)) return std::nullopt; ------------------ | Branch (89:9): [True: 368, False: 656] ------------------ 90| 656| if (input < (std::numeric_limits::min() >> shift)) return std::nullopt; ------------------ | Branch (90:9): [True: 560, False: 96] ------------------ 91| 96| return input << shift; 92| 656|} _Z13SaturatingAddITkNSt3__18integralEhET_S1_S1_: 45| 1.22k|{ 46| | if constexpr (std::numeric_limits::is_signed) { 47| | if (i > 0 && j > std::numeric_limits::max() - i) { 48| | return std::numeric_limits::max(); 49| | } 50| | if (i < 0 && j < std::numeric_limits::min() - i) { 51| | return std::numeric_limits::min(); 52| | } 53| 1.22k| } else { 54| 1.22k| if (std::numeric_limits::max() - i < j) { ------------------ | Branch (54:13): [True: 189, False: 1.04k] ------------------ 55| 189| return std::numeric_limits::max(); 56| 189| } 57| 1.22k| } 58| 1.04k| return i + j; 59| 1.22k|} _Z10CheckedAddIhENSt3__18optionalIT_EES2_S2_: 28| 1.22k|{ 29| 1.22k| if (AdditionOverflow(i, j)) { ------------------ | Branch (29:9): [True: 189, False: 1.04k] ------------------ 30| 189| return std::nullopt; 31| 189| } 32| 1.04k| return i + j; 33| 1.22k|} _Z16AdditionOverflowITkNSt3__18integralEhEbT_S1_: 18| 1.22k|{ 19| | if constexpr (std::numeric_limits::is_signed) { 20| | return (i > 0 && j > std::numeric_limits::max() - i) || 21| | (i < 0 && j < std::numeric_limits::min() - i); 22| | } 23| 1.22k| return std::numeric_limits::max() - i < j; 24| 1.22k|} _Z19SaturatingLeftShiftITkNSt3__18integralEhET_S1_j: 103| 1.22k|{ 104| 1.22k| if (auto result{CheckedLeftShift(input, shift)}) return *result; ------------------ | Branch (104:14): [True: 913, False: 316] ------------------ 105| | // If input << shift is too big to fit in T, return biggest positive or negative 106| | // number that fits. 107| 316| return input < 0 ? std::numeric_limits::min() : std::numeric_limits::max(); ------------------ | Branch (107:12): [True: 0, False: 316] ------------------ 108| 1.22k|} _Z16CheckedLeftShiftITkNSt3__18integralEhENS0_8optionalIT_EES2_j: 84| 2.45k|{ 85| 2.45k| if (shift == 0 || input == 0) return input; ------------------ | Branch (85:9): [True: 1.65k, False: 800] | Branch (85:23): [True: 112, False: 688] ------------------ 86| | // Avoid undefined c++ behaviour if shift is >= number of bits in T. 87| 688| if (shift >= sizeof(T) * CHAR_BIT) return std::nullopt; ------------------ | Branch (87:9): [True: 570, False: 118] ------------------ 88| | // If input << shift is too big to fit in T, return nullopt. 89| 118| if (input > (std::numeric_limits::max() >> shift)) return std::nullopt; ------------------ | Branch (89:9): [True: 62, False: 56] ------------------ 90| 56| if (input < (std::numeric_limits::min() >> shift)) return std::nullopt; ------------------ | Branch (90:9): [True: 0, False: 56] ------------------ 91| 56| return input << shift; 92| 56|} _Z13SaturatingAddITkNSt3__18integralEtET_S1_S1_: 45| 1.22k|{ 46| | if constexpr (std::numeric_limits::is_signed) { 47| | if (i > 0 && j > std::numeric_limits::max() - i) { 48| | return std::numeric_limits::max(); 49| | } 50| | if (i < 0 && j < std::numeric_limits::min() - i) { 51| | return std::numeric_limits::min(); 52| | } 53| 1.22k| } else { 54| 1.22k| if (std::numeric_limits::max() - i < j) { ------------------ | Branch (54:13): [True: 185, False: 1.04k] ------------------ 55| 185| return std::numeric_limits::max(); 56| 185| } 57| 1.22k| } 58| 1.04k| return i + j; 59| 1.22k|} _Z10CheckedAddItENSt3__18optionalIT_EES2_S2_: 28| 1.22k|{ 29| 1.22k| if (AdditionOverflow(i, j)) { ------------------ | Branch (29:9): [True: 185, False: 1.04k] ------------------ 30| 185| return std::nullopt; 31| 185| } 32| 1.04k| return i + j; 33| 1.22k|} _Z16AdditionOverflowITkNSt3__18integralEtEbT_S1_: 18| 1.22k|{ 19| | if constexpr (std::numeric_limits::is_signed) { 20| | return (i > 0 && j > std::numeric_limits::max() - i) || 21| | (i < 0 && j < std::numeric_limits::min() - i); 22| | } 23| 1.22k| return std::numeric_limits::max() - i < j; 24| 1.22k|} _Z19SaturatingLeftShiftITkNSt3__18integralEtET_S1_j: 103| 1.22k|{ 104| 1.22k| if (auto result{CheckedLeftShift(input, shift)}) return *result; ------------------ | Branch (104:14): [True: 959, False: 270] ------------------ 105| | // If input << shift is too big to fit in T, return biggest positive or negative 106| | // number that fits. 107| 270| return input < 0 ? std::numeric_limits::min() : std::numeric_limits::max(); ------------------ | Branch (107:12): [True: 0, False: 270] ------------------ 108| 1.22k|} _Z16CheckedLeftShiftITkNSt3__18integralEtENS0_8optionalIT_EES2_j: 84| 2.45k|{ 85| 2.45k| if (shift == 0 || input == 0) return input; ------------------ | Branch (85:9): [True: 1.76k, False: 690] | Branch (85:23): [True: 44, False: 646] ------------------ 86| | // Avoid undefined c++ behaviour if shift is >= number of bits in T. 87| 646| if (shift >= sizeof(T) * CHAR_BIT) return std::nullopt; ------------------ | Branch (87:9): [True: 232, False: 414] ------------------ 88| | // If input << shift is too big to fit in T, return nullopt. 89| 414| if (input > (std::numeric_limits::max() >> shift)) return std::nullopt; ------------------ | Branch (89:9): [True: 308, False: 106] ------------------ 90| 106| if (input < (std::numeric_limits::min() >> shift)) return std::nullopt; ------------------ | Branch (90:9): [True: 0, False: 106] ------------------ 91| 106| return input << shift; 92| 106|} _Z13SaturatingAddITkNSt3__18integralEjET_S1_S1_: 45| 1.22k|{ 46| | if constexpr (std::numeric_limits::is_signed) { 47| | if (i > 0 && j > std::numeric_limits::max() - i) { 48| | return std::numeric_limits::max(); 49| | } 50| | if (i < 0 && j < std::numeric_limits::min() - i) { 51| | return std::numeric_limits::min(); 52| | } 53| 1.22k| } else { 54| 1.22k| if (std::numeric_limits::max() - i < j) { ------------------ | Branch (54:13): [True: 125, False: 1.10k] ------------------ 55| 125| return std::numeric_limits::max(); 56| 125| } 57| 1.22k| } 58| 1.10k| return i + j; 59| 1.22k|} _Z10CheckedAddIjENSt3__18optionalIT_EES2_S2_: 28| 1.22k|{ 29| 1.22k| if (AdditionOverflow(i, j)) { ------------------ | Branch (29:9): [True: 125, False: 1.10k] ------------------ 30| 125| return std::nullopt; 31| 125| } 32| 1.10k| return i + j; 33| 1.22k|} _Z19SaturatingLeftShiftITkNSt3__18integralEjET_S1_j: 103| 1.22k|{ 104| 1.22k| if (auto result{CheckedLeftShift(input, shift)}) return *result; ------------------ | Branch (104:14): [True: 1.02k, False: 201] ------------------ 105| | // If input << shift is too big to fit in T, return biggest positive or negative 106| | // number that fits. 107| 201| return input < 0 ? std::numeric_limits::min() : std::numeric_limits::max(); ------------------ | Branch (107:12): [True: 0, False: 201] ------------------ 108| 1.22k|} _Z16CheckedLeftShiftITkNSt3__18integralEjENS0_8optionalIT_EES2_j: 84| 2.45k|{ 85| 2.45k| if (shift == 0 || input == 0) return input; ------------------ | Branch (85:9): [True: 1.96k, False: 494] | Branch (85:23): [True: 4, False: 490] ------------------ 86| | // Avoid undefined c++ behaviour if shift is >= number of bits in T. 87| 490| if (shift >= sizeof(T) * CHAR_BIT) return std::nullopt; ------------------ | Branch (87:9): [True: 106, False: 384] ------------------ 88| | // If input << shift is too big to fit in T, return nullopt. 89| 384| if (input > (std::numeric_limits::max() >> shift)) return std::nullopt; ------------------ | Branch (89:9): [True: 296, False: 88] ------------------ 90| 88| if (input < (std::numeric_limits::min() >> shift)) return std::nullopt; ------------------ | Branch (90:9): [True: 0, False: 88] ------------------ 91| 88| return input << shift; 92| 88|} _Z16AdditionOverflowITkNSt3__18integralEjEbT_S1_: 18| 1.22k|{ 19| | if constexpr (std::numeric_limits::is_signed) { 20| | return (i > 0 && j > std::numeric_limits::max() - i) || 21| | (i < 0 && j < std::numeric_limits::min() - i); 22| | } 23| 1.22k| return std::numeric_limits::max() - i < j; 24| 1.22k|} _Z13SaturatingAddITkNSt3__18integralEiET_S1_S1_: 45| 1.22k|{ 46| 1.22k| if constexpr (std::numeric_limits::is_signed) { 47| 1.22k| if (i > 0 && j > std::numeric_limits::max() - i) { ------------------ | Branch (47:13): [True: 350, False: 879] | Branch (47:22): [True: 94, False: 256] ------------------ 48| 94| return std::numeric_limits::max(); 49| 94| } 50| 1.13k| if (i < 0 && j < std::numeric_limits::min() - i) { ------------------ | Branch (50:13): [True: 874, False: 261] | Branch (50:22): [True: 614, False: 260] ------------------ 51| 614| return std::numeric_limits::min(); 52| 614| } 53| | } else { 54| | if (std::numeric_limits::max() - i < j) { 55| | return std::numeric_limits::max(); 56| | } 57| | } 58| 521| return i + j; 59| 1.22k|} _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| 1.22k|{ 55| 1.22k| Assert(mock_time_in >= 0s); ------------------ | | 116| 1.22k|#define Assert(val) inline_assertion_check(val, std::source_location::current(), #val) ------------------ 56| 1.22k| g_mock_time.store(mock_time_in, std::memory_order_relaxed); 57| 1.22k|} _ZN19MockableSteadyClock13ClearMockTimeEv: 84| 1.22k|{ 85| 1.22k| g_mock_steady_time.store(0ms, std::memory_order_relaxed); 86| 1.22k|} _ZN19WalletInitInterfaceD2Ev: 25| 2| virtual ~WalletInitInterface() = default;