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/tweeny-3/include/dispatcher.h Examining data/tweeny-3/include/easing.h Examining data/tweeny-3/include/easingresolve.h Examining data/tweeny-3/include/int2type.h Examining data/tweeny-3/include/tween.h Examining data/tweeny-3/include/tweenpoint.h Examining data/tweeny-3/include/tweentraits.h Examining data/tweeny-3/include/tweeny.h FINAL RESULTS: data/tweeny-3/include/tweentraits.h:41:41: [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. template<typename... Ts> struct equal { enum { value = true }; }; data/tweeny-3/include/tweentraits.h:42: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. template<typename T> struct equal<T> { enum { value = true }; }; data/tweeny-3/include/tweentraits.h:43:53: [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. template<typename T, typename... Ts> struct equal<T, T, Ts...> { enum { value = true && equal<Ts...>::value }; }; data/tweeny-3/include/tweentraits.h:43:98: [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. template<typename T, typename... Ts> struct equal<T, T, Ts...> { enum { value = true && equal<Ts...>::value }; }; data/tweeny-3/include/tweentraits.h:44:65: [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. template<typename T, typename U, typename... Ts> struct equal<T, U, Ts...> { enum { value = false }; }; data/tweeny-3/include/tweentraits.h:48:23: [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. template<bool equal, typename... Ts> data/tweeny-3/include/tweentraits.h:67:40: [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. typedef typename valuetype<equal<Ts...>::value, Ts...>::type valuesType; ANALYSIS SUMMARY: Hits = 7 Lines analyzed = 1617 in approximately 0.06 seconds (25674 lines/second) Physical Source Lines of Code (SLOC) = 577 Hits@level = [0] 0 [1] 7 [2] 0 [3] 0 [4] 0 [5] 0 Hits@level+ = [0+] 7 [1+] 7 [2+] 0 [3+] 0 [4+] 0 [5+] 0 Hits/KSLOC@level+ = [0+] 12.1317 [1+] 12.1317 [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.