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/robin-map-0.6.3/include/tsl/robin_set.h
Examining data/robin-map-0.6.3/include/tsl/robin_hash.h
Examining data/robin-map-0.6.3/include/tsl/robin_growth_policy.h
Examining data/robin-map-0.6.3/include/tsl/robin_map.h
Examining data/robin-map-0.6.3/tests/utils.h
Examining data/robin-map-0.6.3/tests/robin_set_tests.cpp
Examining data/robin-map-0.6.3/tests/custom_allocator_tests.cpp
Examining data/robin-map-0.6.3/tests/robin_map_tests.cpp
Examining data/robin-map-0.6.3/tests/policy_tests.cpp
Examining data/robin-map-0.6.3/tests/main.cpp

FINAL RESULTS:

data/robin-map-0.6.3/include/tsl/robin_hash.h:521:32:  [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.
               const KeyEqual& equal,
data/robin-map-0.6.3/include/tsl/robin_hash.h:526:49:  [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.
                                       KeyEqual(equal),
data/robin-map-0.6.3/include/tsl/robin_hash.h:563:32:  [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.
               const KeyEqual& equal,
data/robin-map-0.6.3/include/tsl/robin_hash.h:568:49:  [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.
                                       KeyEqual(equal),
data/robin-map-0.6.3/include/tsl/robin_map.h:147:42:  [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.
                m_ht(bucket_count, hash, equal, alloc)
data/robin-map-0.6.3/include/tsl/robin_map.h:170:84:  [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.
              const Allocator& alloc = Allocator()): robin_map(bucket_count, hash, equal, alloc)
data/robin-map-0.6.3/include/tsl/robin_map.h:195:67:  [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.
          robin_map(init.begin(), init.end(), bucket_count, hash, equal, alloc)
data/robin-map-0.6.3/include/tsl/robin_set.h:131:46:  [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.
                    m_ht(bucket_count, hash, equal, alloc)
data/robin-map-0.6.3/include/tsl/robin_set.h:154:84:  [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.
              const Allocator& alloc = Allocator()): robin_set(bucket_count, hash, equal, alloc)
data/robin-map-0.6.3/include/tsl/robin_set.h:179:67:  [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.
          robin_set(init.begin(), init.end(), bucket_count, hash, equal, alloc)

ANALYSIS SUMMARY:

Hits = 10
Lines analyzed = 5154 in approximately 0.13 seconds (39284 lines/second)
Physical Source Lines of Code (SLOC) = 3052
Hits@level = [0]   0 [1]  10 [2]   0 [3]   0 [4]   0 [5]   0
Hits@level+ = [0+]  10 [1+]  10 [2+]   0 [3+]   0 [4+]   0 [5+]   0
Hits/KSLOC@level+ = [0+] 3.27654 [1+] 3.27654 [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.