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-sna-2.6/src/geodist.c Examining data/r-cran-sna-2.6/src/geodist.h Examining data/r-cran-sna-2.6/src/paths.h Examining data/r-cran-sna-2.6/src/components.h Examining data/r-cran-sna-2.6/src/randomgraph.c Examining data/r-cran-sna-2.6/src/gli.h Examining data/r-cran-sna-2.6/src/layout.h Examining data/r-cran-sna-2.6/src/likelihood.c Examining data/r-cran-sna-2.6/src/utils.c Examining data/r-cran-sna-2.6/src/nli.c Examining data/r-cran-sna-2.6/src/triads.h Examining data/r-cran-sna-2.6/src/cohesion.h Examining data/r-cran-sna-2.6/src/utils.h Examining data/r-cran-sna-2.6/src/randomgraph.h Examining data/r-cran-sna-2.6/src/layout.c Examining data/r-cran-sna-2.6/src/cohesion.c Examining data/r-cran-sna-2.6/src/likelihood.h Examining data/r-cran-sna-2.6/src/nli.h Examining data/r-cran-sna-2.6/src/gli.c Examining data/r-cran-sna-2.6/src/paths.c Examining data/r-cran-sna-2.6/src/Rinit.c Examining data/r-cran-sna-2.6/src/components.c Examining data/r-cran-sna-2.6/src/triads.c FINAL RESULTS: data/r-cran-sna-2.6/src/randomgraph.c:28:32: [1] (buffer) mismatch: 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. int ostate,*lb,*ub,converged,mismatch,t,maxiter,n,i,j,k,x,*r,*c,*temp; data/r-cran-sna-2.6/src/randomgraph.c:154:28: [1] (buffer) mismatch: 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(j=0;(j<n)&&(!mismatch);j++) data/r-cran-sna-2.6/src/randomgraph.c:155:30: [1] (buffer) mismatch: 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(k=0;(k<n)&&(!mismatch);k++) data/r-cran-sna-2.6/src/randomgraph.c:158:15: [1] (buffer) mismatch: 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. if(!mismatch){ /*We have a winner!*/ ANALYSIS SUMMARY: Hits = 4 Lines analyzed = 6831 in approximately 0.88 seconds (7779 lines/second) Physical Source Lines of Code (SLOC) = 5078 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+] 0.787712 [1+] 0.787712 [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.