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/r-cran-fastmap-1.0.1/src/init.c Examining data/r-cran-fastmap-1.0.1/src/lib/tsl/hopscotch_hash.h Examining data/r-cran-fastmap-1.0.1/src/lib/tsl/hopscotch_map.h Examining data/r-cran-fastmap-1.0.1/src/lib/tsl/hopscotch_growth_policy.h Examining data/r-cran-fastmap-1.0.1/src/fastmap.cpp FINAL RESULTS: data/r-cran-fastmap-1.0.1/src/lib/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/r-cran-fastmap-1.0.1/src/lib/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/r-cran-fastmap-1.0.1/src/lib/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/r-cran-fastmap-1.0.1/src/lib/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/r-cran-fastmap-1.0.1/src/lib/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/r-cran-fastmap-1.0.1/src/lib/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/r-cran-fastmap-1.0.1/src/lib/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) ANALYSIS SUMMARY: Hits = 7 Lines analyzed = 3055 in approximately 0.08 seconds (37735 lines/second) Physical Source Lines of Code (SLOC) = 1940 Hits@level = [0] 0 [1] 7 [2] 0 [3] 0 [4] 0 [5] 0 Hits@level+ = [0+] 7 [1+] 7 [2+] 0 [3+] 0 [4+] 0 [5+] 0 Hits/KSLOC@level+ = [0+] 3.60825 [1+] 3.60825 [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.