Flawfinder version 2.0.10, (C) 2001-2019 David A. Wheeler. Number of rules (primarily dangerous function names) in C/C++ ruleset: 223 Examining data/hopscotch-map-2.3.0/include/tsl/bhopscotch_map.h Examining data/hopscotch-map-2.3.0/include/tsl/bhopscotch_set.h Examining data/hopscotch-map-2.3.0/include/tsl/hopscotch_growth_policy.h Examining data/hopscotch-map-2.3.0/include/tsl/hopscotch_hash.h Examining data/hopscotch-map-2.3.0/include/tsl/hopscotch_map.h Examining data/hopscotch-map-2.3.0/include/tsl/hopscotch_set.h Examining data/hopscotch-map-2.3.0/tests/custom_allocator_tests.cpp Examining data/hopscotch-map-2.3.0/tests/hopscotch_map_tests.cpp Examining data/hopscotch-map-2.3.0/tests/hopscotch_set_tests.cpp Examining data/hopscotch-map-2.3.0/tests/main.cpp Examining data/hopscotch-map-2.3.0/tests/policy_tests.cpp Examining data/hopscotch-map-2.3.0/tests/utils.h FINAL RESULTS: data/hopscotch-map-2.3.0/include/tsl/bhopscotch_map.h:135:50: [1] (buffer) equal: Function does not check the second iterator for over-read conditions (CWE-126). This function is often discouraged by most C++ coding standards in favor of its safer alternatives provided since C++14. Consider using a form of this function that checks the second iterator before potentially overflowing it. m_ht(bucket_count, hash, equal, alloc, ht::DEFAULT_MAX_LOAD_FACTOR, comp) data/hopscotch-map-2.3.0/include/tsl/bhopscotch_map.h:158:92: [1] (buffer) equal: Function does not check the second iterator for over-read conditions (CWE-126). This function is often discouraged by most C++ coding standards in favor of its safer alternatives provided since C++14. Consider using a form of this function that checks the second iterator before potentially overflowing it. const Allocator& alloc = Allocator()) : bhopscotch_map(bucket_count, hash, equal, alloc) data/hopscotch-map-2.3.0/include/tsl/bhopscotch_map.h:183:82: [1] (buffer) equal: Function does not check the second iterator for over-read conditions (CWE-126). This function is often discouraged by most C++ coding standards in favor of its safer alternatives provided since C++14. Consider using a form of this function that checks the second iterator before potentially overflowing it. bhopscotch_map(init.begin(), init.end(), bucket_count, hash, equal, alloc) data/hopscotch-map-2.3.0/include/tsl/bhopscotch_set.h:118:50: [1] (buffer) equal: Function does not check the second iterator for over-read conditions (CWE-126). This function is often discouraged by most C++ coding standards in favor of its safer alternatives provided since C++14. Consider using a form of this function that checks the second iterator before potentially overflowing it. m_ht(bucket_count, hash, equal, alloc, ht::DEFAULT_MAX_LOAD_FACTOR, comp) data/hopscotch-map-2.3.0/include/tsl/bhopscotch_set.h:141:92: [1] (buffer) equal: Function does not check the second iterator for over-read conditions (CWE-126). This function is often discouraged by most C++ coding standards in favor of its safer alternatives provided since C++14. Consider using a form of this function that checks the second iterator before potentially overflowing it. const Allocator& alloc = Allocator()) : bhopscotch_set(bucket_count, hash, equal, alloc) data/hopscotch-map-2.3.0/include/tsl/bhopscotch_set.h:166:82: [1] (buffer) equal: Function does not check the second iterator for over-read conditions (CWE-126). This function is often discouraged by most C++ coding standards in favor of its safer alternatives provided since C++14. Consider using a form of this function that checks the second iterator before potentially overflowing it. bhopscotch_set(init.begin(), init.end(), bucket_count, hash, equal, alloc) data/hopscotch-map-2.3.0/include/tsl/hopscotch_hash.h:599:35: [1] (buffer) equal: Function does not check the second iterator for over-read conditions (CWE-126). This function is often discouraged by most C++ coding standards in favor of its safer alternatives provided since C++14. Consider using a form of this function that checks the second iterator before potentially overflowing it. const KeyEqual& equal, data/hopscotch-map-2.3.0/include/tsl/hopscotch_hash.h:602:54: [1] (buffer) equal: Function does not check the second iterator for over-read conditions (CWE-126). This function is often discouraged by most C++ coding standards in favor of its safer alternatives provided since C++14. Consider using a form of this function that checks the second iterator before potentially overflowing it. KeyEqual(equal), data/hopscotch-map-2.3.0/include/tsl/hopscotch_hash.h:636:35: [1] (buffer) equal: Function does not check the second iterator for over-read conditions (CWE-126). This function is often discouraged by most C++ coding standards in favor of its safer alternatives provided since C++14. Consider using a form of this function that checks the second iterator before potentially overflowing it. const KeyEqual& equal, data/hopscotch-map-2.3.0/include/tsl/hopscotch_hash.h:640:68: [1] (buffer) equal: Function does not check the second iterator for over-read conditions (CWE-126). This function is often discouraged by most C++ coding standards in favor of its safer alternatives provided since C++14. Consider using a form of this function that checks the second iterator before potentially overflowing it. KeyEqual(equal), data/hopscotch-map-2.3.0/include/tsl/hopscotch_map.h:146:50: [1] (buffer) equal: Function does not check the second iterator for over-read conditions (CWE-126). This function is often discouraged by most C++ coding standards in favor of its safer alternatives provided since C++14. Consider using a form of this function that checks the second iterator before potentially overflowing it. m_ht(bucket_count, hash, equal, alloc, ht::DEFAULT_MAX_LOAD_FACTOR) data/hopscotch-map-2.3.0/include/tsl/hopscotch_map.h:169:91: [1] (buffer) equal: Function does not check the second iterator for over-read conditions (CWE-126). This function is often discouraged by most C++ coding standards in favor of its safer alternatives provided since C++14. Consider using a form of this function that checks the second iterator before potentially overflowing it. const Allocator& alloc = Allocator()) : hopscotch_map(bucket_count, hash, equal, alloc) data/hopscotch-map-2.3.0/include/tsl/hopscotch_map.h:194:81: [1] (buffer) equal: Function does not check the second iterator for over-read conditions (CWE-126). This function is often discouraged by most C++ coding standards in favor of its safer alternatives provided since C++14. Consider using a form of this function that checks the second iterator before potentially overflowing it. hopscotch_map(init.begin(), init.end(), bucket_count, hash, equal, alloc) data/hopscotch-map-2.3.0/include/tsl/hopscotch_set.h:130:50: [1] (buffer) equal: Function does not check the second iterator for over-read conditions (CWE-126). This function is often discouraged by most C++ coding standards in favor of its safer alternatives provided since C++14. Consider using a form of this function that checks the second iterator before potentially overflowing it. m_ht(bucket_count, hash, equal, alloc, ht::DEFAULT_MAX_LOAD_FACTOR) data/hopscotch-map-2.3.0/include/tsl/hopscotch_set.h:153:91: [1] (buffer) equal: Function does not check the second iterator for over-read conditions (CWE-126). This function is often discouraged by most C++ coding standards in favor of its safer alternatives provided since C++14. Consider using a form of this function that checks the second iterator before potentially overflowing it. const Allocator& alloc = Allocator()) : hopscotch_set(bucket_count, hash, equal, alloc) data/hopscotch-map-2.3.0/include/tsl/hopscotch_set.h:178:81: [1] (buffer) equal: Function does not check the second iterator for over-read conditions (CWE-126). This function is often discouraged by most C++ coding standards in favor of its safer alternatives provided since C++14. Consider using a form of this function that checks the second iterator before potentially overflowing it. hopscotch_set(init.begin(), init.end(), bucket_count, hash, equal, alloc) ANALYSIS SUMMARY: Hits = 16 Lines analyzed = 6749 in approximately 0.23 seconds (29771 lines/second) Physical Source Lines of Code (SLOC) = 3934 Hits@level = [0] 0 [1] 16 [2] 0 [3] 0 [4] 0 [5] 0 Hits@level+ = [0+] 16 [1+] 16 [2+] 0 [3+] 0 [4+] 0 [5+] 0 Hits/KSLOC@level+ = [0+] 4.06711 [1+] 4.06711 [2+] 0 [3+] 0 [4+] 0 [5+] 0 Dot directories skipped = 1 (--followdotdir overrides) Minimum risk level = 1 Not every hit is necessarily a security vulnerability. There may be other security vulnerabilities; review your code! See 'Secure Programming HOWTO' (https://dwheeler.com/secure-programs) for more information.