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-markovchain-0.8.5-2/src/ctmcFittingFunctions.cpp Examining data/r-cran-markovchain-0.8.5-2/src/classesAndMethods.cpp Examining data/r-cran-markovchain-0.8.5-2/src/fitHigherOrder.cpp Examining data/r-cran-markovchain-0.8.5-2/src/probabilistic.cpp Examining data/r-cran-markovchain-0.8.5-2/src/fittingFunctions.cpp Examining data/r-cran-markovchain-0.8.5-2/src/utils.cpp Examining data/r-cran-markovchain-0.8.5-2/src/ctmcClassesAndMethods.cpp Examining data/r-cran-markovchain-0.8.5-2/src/helpers.h Examining data/r-cran-markovchain-0.8.5-2/src/mapFitFunctions.h Examining data/r-cran-markovchain-0.8.5-2/src/multinomCI.cpp Examining data/r-cran-markovchain-0.8.5-2/src/ctmcProbabilistic.cpp Examining data/r-cran-markovchain-0.8.5-2/src/RcppExports.cpp FINAL RESULTS: data/r-cran-markovchain-0.8.5-2/src/utils.cpp:172: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. for (int i = 0; i < a_nrow && equal; ++i) data/r-cran-markovchain-0.8.5-2/src/utils.cpp:173:37: [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. for (int j = 0; j < a_ncol && equal; ++j) data/r-cran-markovchain-0.8.5-2/src/utils.cpp:176:12: [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 = 3 Lines analyzed = 5592 in approximately 0.14 seconds (40900 lines/second) Physical Source Lines of Code (SLOC) = 3587 Hits@level = [0] 0 [1] 3 [2] 0 [3] 0 [4] 0 [5] 0 Hits@level+ = [0+] 3 [1+] 3 [2+] 0 [3+] 0 [4+] 0 [5+] 0 Hits/KSLOC@level+ = [0+] 0.836353 [1+] 0.836353 [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.