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/ordered-map-1.0.0/include/tsl/ordered_hash.h
Examining data/ordered-map-1.0.0/include/tsl/ordered_map.h
Examining data/ordered-map-1.0.0/include/tsl/ordered_set.h
Examining data/ordered-map-1.0.0/tests/custom_allocator_tests.cpp
Examining data/ordered-map-1.0.0/tests/main.cpp
Examining data/ordered-map-1.0.0/tests/ordered_map_tests.cpp
Examining data/ordered-map-1.0.0/tests/ordered_set_tests.cpp
Examining data/ordered-map-1.0.0/tests/utils.h

FINAL RESULTS:

data/ordered-map-1.0.0/include/tsl/ordered_hash.h:444:34:  [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/ordered-map-1.0.0/include/tsl/ordered_hash.h:447:51:  [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/ordered-map-1.0.0/include/tsl/ordered_map.h:142:47:  [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, ht::DEFAULT_MAX_LOAD_FACTOR)
data/ordered-map-1.0.0/include/tsl/ordered_map.h:165:88:  [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()): ordered_map(bucket_count, hash, equal, alloc)
data/ordered-map-1.0.0/include/tsl/ordered_map.h:190:71:  [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.
            ordered_map(init.begin(), init.end(), bucket_count, hash, equal, alloc)
data/ordered-map-1.0.0/include/tsl/ordered_set.h:126:50:  [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, ht::DEFAULT_MAX_LOAD_FACTOR)
data/ordered-map-1.0.0/include/tsl/ordered_set.h:149:88:  [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()): ordered_set(bucket_count, hash, equal, alloc)
data/ordered-map-1.0.0/include/tsl/ordered_set.h:174:71:  [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.
            ordered_set(init.begin(), init.end(), bucket_count, hash, equal, alloc)
data/ordered-map-1.0.0/tests/utils.h:295:19:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        m_istream.read(chars.data(), str_size);
data/ordered-map-1.0.0/tests/utils.h:310:19:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        m_istream.read(reinterpret_cast<char*>(&val), sizeof(val));

ANALYSIS SUMMARY:

Hits = 10
Lines analyzed = 5423 in approximately 0.16 seconds (33343 lines/second)
Physical Source Lines of Code (SLOC) = 3123
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.20205 [1+] 3.20205 [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.