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-fnn-1.1.3/src/KNN_mutual_information.cpp Examining data/r-cran-fnn-1.1.3/src/kd_util.cpp Examining data/r-cran-fnn-1.1.3/src/bd_fix_rad_search.cpp Examining data/r-cran-fnn-1.1.3/src/kd_split.cpp Examining data/r-cran-fnn-1.1.3/src/kd_util.h Examining data/r-cran-fnn-1.1.3/src/kd_pr_search.cpp Examining data/r-cran-fnn-1.1.3/src/pr_queue_k.h Examining data/r-cran-fnn-1.1.3/src/KNN_ANN.cpp Examining data/r-cran-fnn-1.1.3/src/init_FNN.c Examining data/r-cran-fnn-1.1.3/src/bd_tree.cpp Examining data/r-cran-fnn-1.1.3/src/bd_tree.h Examining data/r-cran-fnn-1.1.3/src/cover_tree.h Examining data/r-cran-fnn-1.1.3/src/ANN.cpp Examining data/r-cran-fnn-1.1.3/src/kd_pr_search.h Examining data/r-cran-fnn-1.1.3/src/perf.cpp Examining data/r-cran-fnn-1.1.3/src/pr_queue.h Examining data/r-cran-fnn-1.1.3/src/kd_split.h Examining data/r-cran-fnn-1.1.3/src/kd_tree.h Examining data/r-cran-fnn-1.1.3/src/bd_search.cpp Examining data/r-cran-fnn-1.1.3/src/KNN_correlation_distance.cpp Examining data/r-cran-fnn-1.1.3/src/bd_pr_search.cpp Examining data/r-cran-fnn-1.1.3/src/KNN_cover_test.cpp Examining data/r-cran-fnn-1.1.3/src/stack.h Examining data/r-cran-fnn-1.1.3/src/kd_fix_rad_search.cpp Examining data/r-cran-fnn-1.1.3/src/kd_dump.cpp Examining data/r-cran-fnn-1.1.3/src/KNN_cover_tree.cpp Examining data/r-cran-fnn-1.1.3/src/brute.cpp Examining data/r-cran-fnn-1.1.3/src/kd_fix_rad_search.h Examining data/r-cran-fnn-1.1.3/src/kd_search.cpp Examining data/r-cran-fnn-1.1.3/src/kd_tree.cpp Examining data/r-cran-fnn-1.1.3/src/label_point.cpp Examining data/r-cran-fnn-1.1.3/src/label_point.h Examining data/r-cran-fnn-1.1.3/src/include/ANN/ANNperf.h Examining data/r-cran-fnn-1.1.3/src/include/ANN/ANN.h Examining data/r-cran-fnn-1.1.3/src/include/ANN/ANNx.h Examining data/r-cran-fnn-1.1.3/src/kd_search.h FINAL RESULTS: data/r-cran-fnn-1.1.3/src/include/ANN/ANN.h:130:13: [4] (format) printf: If format strings can be influenced by an attacker, they can be exploited (CWE-134). Use a constant for the format specification. #define printf Rprintf data/r-cran-fnn-1.1.3/src/label_point.h:13:13: [4] (format) printf: If format strings can be influenced by an attacker, they can be exploited (CWE-134). Use a constant for the format specification. #define printf Rprintf data/r-cran-fnn-1.1.3/src/KNN_cover_test.cpp:51:12: [2] (integer) atoi: Unless checked, the resulting number can exceed the expected range (CWE-190). If source untrusted, check both minimum and maximum, even if the input had no minus sign (large numbers can roll over into negative number; consider saving to an unsigned value if that is intended). int k = atoi(argv[1]); data/r-cran-fnn-1.1.3/src/kd_dump.cpp:265:2: [2] (buffer) char: Statically-sized arrays can be improperly restricted, leading to potential overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use functions that limit length, or ensure that the size is larger than the maximum possible length. char str[STRING_LEN]; // storage for string data/r-cran-fnn-1.1.3/src/kd_dump.cpp:266:2: [2] (buffer) char: Statically-sized arrays can be improperly restricted, leading to potential overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use functions that limit length, or ensure that the size is larger than the maximum possible length. char version[STRING_LEN]; // ANN version number data/r-cran-fnn-1.1.3/src/kd_dump.cpp:374:2: [2] (buffer) char: Statically-sized arrays can be improperly restricted, leading to potential overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use functions that limit length, or ensure that the size is larger than the maximum possible length. char tag[STRING_LEN]; // tag (leaf, split, shrink) data/r-cran-fnn-1.1.3/src/label_point.h:51:17: [2] (misc) fopen: Check when opening files - can an attacker redirect it (via symlinks), force the opening of special file type (e.g., device files), move things around to create a race condition, control its ancestors, or change its contents? (CWE-362). FILE *input = fopen(filename,"r"); data/r-cran-fnn-1.1.3/src/label_point.h:85:7: [2] (buffer) memcpy: Does not check for buffer overflows when copying to destination (CWE-120). Make sure destination can always hold the source data. memcpy(new_p, p.elements,sizeof(P)*p.index); data/r-cran-fnn-1.1.3/src/label_point.h:62:16: [1] (buffer) getc: Check buffer boundaries if used in a loop including recursive loops (CWE-120, CWE-20). while ( (c = getc(input)) != EOF ) data/r-cran-fnn-1.1.3/src/label_point.h:66:19: [1] (buffer) getc: Check buffer boundaries if used in a loop including recursive loops (CWE-120, CWE-20). while ((c = getc(input)) != '\n' ) data/r-cran-fnn-1.1.3/src/label_point.h:71:10: [1] (buffer) getc: Check buffer boundaries if used in a loop including recursive loops (CWE-120, CWE-20). c = getc(input); ANALYSIS SUMMARY: Hits = 11 Lines analyzed = 7776 in approximately 0.21 seconds (36308 lines/second) Physical Source Lines of Code (SLOC) = 4359 Hits@level = [0] 40 [1] 3 [2] 6 [3] 0 [4] 2 [5] 0 Hits@level+ = [0+] 51 [1+] 11 [2+] 8 [3+] 2 [4+] 2 [5+] 0 Hits/KSLOC@level+ = [0+] 11.6999 [1+] 2.52351 [2+] 1.83528 [3+] 0.458821 [4+] 0.458821 [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.