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/bigint-2010.04.30/BigInteger.cc Examining data/bigint-2010.04.30/BigIntegerAlgorithms.cc Examining data/bigint-2010.04.30/BigIntegerUtils.cc Examining data/bigint-2010.04.30/BigUnsigned.cc Examining data/bigint-2010.04.30/BigUnsignedInABase.cc Examining data/bigint-2010.04.30/sample.cc Examining data/bigint-2010.04.30/testsuite.cc FINAL RESULTS: data/bigint-2010.04.30/BigInteger.cc:144:10: [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. return equal; // Two zeros are equal data/bigint-2010.04.30/BigInteger.cc:184:8: [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. case equal: data/bigint-2010.04.30/BigInteger.cc:223:8: [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. case equal: data/bigint-2010.04.30/BigUnsigned.cc:88:10: [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. return equal; ANALYSIS SUMMARY: Hits = 4 Lines analyzed = 1798 in approximately 0.07 seconds (26240 lines/second) Physical Source Lines of Code (SLOC) = 1076 Hits@level = [0] 0 [1] 4 [2] 0 [3] 0 [4] 0 [5] 0 Hits@level+ = [0+] 4 [1+] 4 [2+] 0 [3+] 0 [4+] 0 [5+] 0 Hits/KSLOC@level+ = [0+] 3.71747 [1+] 3.71747 [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.