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/libdvbcsa-1.1.0/src/dvbcsa_bs_altivec.h Examining data/libdvbcsa-1.1.0/src/dvbcsa_key.c Examining data/libdvbcsa-1.1.0/src/dvbcsa_bs_block.c Examining data/libdvbcsa-1.1.0/src/dvbcsa_bs_stream.c Examining data/libdvbcsa-1.1.0/src/dvbcsa_bs_uint32.h Examining data/libdvbcsa-1.1.0/src/dvbcsa_bs_key.c Examining data/libdvbcsa-1.1.0/src/dvbcsa_bs_sse.h Examining data/libdvbcsa-1.1.0/src/dvbcsa_bs_transpose64.c Examining data/libdvbcsa-1.1.0/src/dvbcsa_bs.h Examining data/libdvbcsa-1.1.0/src/dvbcsa_bs_transpose128.c Examining data/libdvbcsa-1.1.0/src/dvbcsa_stream.c Examining data/libdvbcsa-1.1.0/src/dvbcsa_pv.h Examining data/libdvbcsa-1.1.0/src/dvbcsa_bs_transpose.c Examining data/libdvbcsa-1.1.0/src/dvbcsa/dvbcsa.h Examining data/libdvbcsa-1.1.0/src/dvbcsa_bs_mmx.h Examining data/libdvbcsa-1.1.0/src/dvbcsa_bs_transpose32.c Examining data/libdvbcsa-1.1.0/src/dvbcsa_block.c Examining data/libdvbcsa-1.1.0/src/dvbcsa_bs_uint64.h Examining data/libdvbcsa-1.1.0/src/dvbcsa_algo.c Examining data/libdvbcsa-1.1.0/src/dvbcsa_bs_algo.c Examining data/libdvbcsa-1.1.0/test/benchbitslice.c Examining data/libdvbcsa-1.1.0/test/testdec.c Examining data/libdvbcsa-1.1.0/test/testbsops.c Examining data/libdvbcsa-1.1.0/test/benchks.c Examining data/libdvbcsa-1.1.0/test/testenc.c Examining data/libdvbcsa-1.1.0/test/benchenc.c Examining data/libdvbcsa-1.1.0/test/benchbitsliceks.c Examining data/libdvbcsa-1.1.0/test/benchdec.c Examining data/libdvbcsa-1.1.0/test/testbitslice.c FINAL RESULTS: data/libdvbcsa-1.1.0/test/benchbitslice.c:58:3: [3] (random) srand: This function is not sufficiently random for security-related functions such as key and nonce creation (CWE-327). Use a more secure technique for acquiring random values. srand(time(0)); data/libdvbcsa-1.1.0/src/dvbcsa/dvbcsa.h:31:18: [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. typedef unsigned char dvbcsa_cw_t[8]; data/libdvbcsa-1.1.0/src/dvbcsa_block.c:104:3: [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(out, W, sizeof(W)); data/libdvbcsa-1.1.0/src/dvbcsa_block.c:136:3: [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(out, W, sizeof(W)); data/libdvbcsa-1.1.0/test/testdec.c:138: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(data, csa_tests[i].in, TS_SIZE); data/libdvbcsa-1.1.0/test/testenc.c:138: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(data, csa_tests[i].out, TS_SIZE); data/libdvbcsa-1.1.0/test/testbsops.c:74:3: [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. equal &= (uint8_t)BS_EXTRACT8(l, i) == (uint8_t)BS_EXTRACT8(r, i); data/libdvbcsa-1.1.0/test/testbsops.c:75:6: [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. if (equal) ANALYSIS SUMMARY: Hits = 8 Lines analyzed = 4629 in approximately 0.17 seconds (27402 lines/second) Physical Source Lines of Code (SLOC) = 3056 Hits@level = [0] 39 [1] 2 [2] 5 [3] 1 [4] 0 [5] 0 Hits@level+ = [0+] 47 [1+] 8 [2+] 6 [3+] 1 [4+] 0 [5+] 0 Hits/KSLOC@level+ = [0+] 15.3796 [1+] 2.6178 [2+] 1.96335 [3+] 0.327225 [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.