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/libixion-0.16.1/src/table_handler.cpp
Examining data/libixion-0.16.1/src/sort_input_parser.hpp
Examining data/libixion-0.16.1/src/session_handler.hpp
Examining data/libixion-0.16.1/src/session_handler.cpp
Examining data/libixion-0.16.1/src/sort_input_parser.cpp
Examining data/libixion-0.16.1/src/model_parser.hpp
Examining data/libixion-0.16.1/src/include/depth_first_search.hpp
Examining data/libixion-0.16.1/src/table_handler.hpp
Examining data/libixion-0.16.1/src/libixion/exceptions.cpp
Examining data/libixion-0.16.1/src/libixion/queue_entry.hpp
Examining data/libixion-0.16.1/src/libixion/model_context_impl.hpp
Examining data/libixion-0.16.1/src/libixion/dirty_cell_tracker_test.cpp
Examining data/libixion-0.16.1/src/libixion/concrete_formula_tokens.cpp
Examining data/libixion-0.16.1/src/libixion/formula_parser.hpp
Examining data/libixion-0.16.1/src/libixion/model_types.cpp
Examining data/libixion-0.16.1/src/libixion/formula_interpreter.hpp
Examining data/libixion-0.16.1/src/libixion/cell_access.cpp
Examining data/libixion-0.16.1/src/libixion/ixion_test_track_deps.cpp
Examining data/libixion-0.16.1/src/libixion/formula_functions.hpp
Examining data/libixion-0.16.1/src/libixion/model_types.hpp
Examining data/libixion-0.16.1/src/libixion/dirty_cell_tracker.cpp
Examining data/libixion-0.16.1/src/libixion/formula_tokens.cpp
Examining data/libixion-0.16.1/src/libixion/address.cpp
Examining data/libixion-0.16.1/src/libixion/ixion_test.cpp
Examining data/libixion-0.16.1/src/libixion/compute_engine_cuda.cpp
Examining data/libixion-0.16.1/src/libixion/global.cpp
Examining data/libixion-0.16.1/src/libixion/formula_functions.cpp
Examining data/libixion-0.16.1/src/libixion/model_context.cpp
Examining data/libixion-0.16.1/src/libixion/mem_str_buf.cpp
Examining data/libixion-0.16.1/src/libixion/address_iterator.cpp
Examining data/libixion-0.16.1/src/libixion/formula_name_resolver.cpp
Examining data/libixion-0.16.1/src/libixion/formula_value_stack.cpp
Examining data/libixion-0.16.1/src/libixion/cell_queue_manager.cpp
Examining data/libixion-0.16.1/src/libixion/named_expressions_iterator.cpp
Examining data/libixion-0.16.1/src/libixion/utils.hpp
Examining data/libixion-0.16.1/src/libixion/utils.cpp
Examining data/libixion-0.16.1/src/libixion/document.cpp
Examining data/libixion-0.16.1/src/libixion/lexer_tokens.hpp
Examining data/libixion-0.16.1/src/libixion/formula_calc.cpp
Examining data/libixion-0.16.1/src/libixion/workbook.cpp
Examining data/libixion-0.16.1/src/libixion/formula_lexer.hpp
Examining data/libixion-0.16.1/src/libixion/cell_queue_manager.hpp
Examining data/libixion-0.16.1/src/libixion/queue_entry.cpp
Examining data/libixion-0.16.1/src/libixion/formula_parser.cpp
Examining data/libixion-0.16.1/src/libixion/table.cpp
Examining data/libixion-0.16.1/src/libixion/formula_interpreter.cpp
Examining data/libixion-0.16.1/src/libixion/matrix.cpp
Examining data/libixion-0.16.1/src/libixion/formula_value_stack.hpp
Examining data/libixion-0.16.1/src/libixion/model_iterator.cpp
Examining data/libixion-0.16.1/src/libixion/interface.cpp
Examining data/libixion-0.16.1/src/libixion/cell.cpp
Examining data/libixion-0.16.1/src/libixion/calc_status.cpp
Examining data/libixion-0.16.1/src/libixion/document_test.cpp
Examining data/libixion-0.16.1/src/libixion/types.cpp
Examining data/libixion-0.16.1/src/libixion/module.cpp
Examining data/libixion-0.16.1/src/libixion/config.cpp
Examining data/libixion-0.16.1/src/libixion/compute_engine_test.cpp
Examining data/libixion-0.16.1/src/libixion/compute_engine.cpp
Examining data/libixion-0.16.1/src/libixion/compute_engine_cuda.hpp
Examining data/libixion-0.16.1/src/libixion/formula_lexer.cpp
Examining data/libixion-0.16.1/src/libixion/lexer_tokens.cpp
Examining data/libixion-0.16.1/src/libixion/debug.cpp
Examining data/libixion-0.16.1/src/libixion/formula_function_opcode.cpp
Examining data/libixion-0.16.1/src/libixion/calc_status.hpp
Examining data/libixion-0.16.1/src/libixion/debug.hpp
Examining data/libixion-0.16.1/src/libixion/info.cpp
Examining data/libixion-0.16.1/src/libixion/model_context_impl.cpp
Examining data/libixion-0.16.1/src/libixion/concrete_formula_tokens.hpp
Examining data/libixion-0.16.1/src/libixion/workbook.hpp
Examining data/libixion-0.16.1/src/libixion/formula.cpp
Examining data/libixion-0.16.1/src/libixion/formula_result.cpp
Examining data/libixion-0.16.1/src/python/sheet.cpp
Examining data/libixion-0.16.1/src/python/python.cpp
Examining data/libixion-0.16.1/src/python/global.cpp
Examining data/libixion-0.16.1/src/python/document.hpp
Examining data/libixion-0.16.1/src/python/document.cpp
Examining data/libixion-0.16.1/src/python/sheet.hpp
Examining data/libixion-0.16.1/src/python/global.hpp
Examining data/libixion-0.16.1/src/ixion_parser.cpp
Examining data/libixion-0.16.1/src/ixion_sorter.cpp
Examining data/libixion-0.16.1/src/model_parser.cpp
Examining data/libixion-0.16.1/src/ixion_formula_tokenizer.cpp
Examining data/libixion-0.16.1/doc_example/section_examples/cell_access.cpp
Examining data/libixion-0.16.1/doc_example/model_context_simple.cpp
Examining data/libixion-0.16.1/doc_example/document_simple.cpp
Examining data/libixion-0.16.1/include/ixion/formula.hpp
Examining data/libixion-0.16.1/include/ixion/model_iterator.hpp
Examining data/libixion-0.16.1/include/ixion/types.hpp
Examining data/libixion-0.16.1/include/ixion/module.hpp
Examining data/libixion-0.16.1/include/ixion/exceptions.hpp
Examining data/libixion-0.16.1/include/ixion/formula_result.hpp
Examining data/libixion-0.16.1/include/ixion/named_expressions_iterator.hpp
Examining data/libixion-0.16.1/include/ixion/matrix.hpp
Examining data/libixion-0.16.1/include/ixion/env.hpp
Examining data/libixion-0.16.1/include/ixion/document.hpp
Examining data/libixion-0.16.1/include/ixion/info.hpp
Examining data/libixion-0.16.1/include/ixion/formula_opcode.hpp
Examining data/libixion-0.16.1/include/ixion/model_context.hpp
Examining data/libixion-0.16.1/include/ixion/macros.hpp
Examining data/libixion-0.16.1/include/ixion/formula_tokens.hpp
Examining data/libixion-0.16.1/include/ixion/dirty_cell_tracker.hpp
Examining data/libixion-0.16.1/include/ixion/table.hpp
Examining data/libixion-0.16.1/include/ixion/compute_engine.hpp
Examining data/libixion-0.16.1/include/ixion/formula_name_resolver.hpp
Examining data/libixion-0.16.1/include/ixion/interface/session_handler.hpp
Examining data/libixion-0.16.1/include/ixion/interface/table_handler.hpp
Examining data/libixion-0.16.1/include/ixion/interface/formula_model_access.hpp
Examining data/libixion-0.16.1/include/ixion/formula_tokens_fwd.hpp
Examining data/libixion-0.16.1/include/ixion/cell_access.hpp
Examining data/libixion-0.16.1/include/ixion/address_iterator.hpp
Examining data/libixion-0.16.1/include/ixion/column_store_type.hpp
Examining data/libixion-0.16.1/include/ixion/global.hpp
Examining data/libixion-0.16.1/include/ixion/address.hpp
Examining data/libixion-0.16.1/include/ixion/mem_str_buf.hpp
Examining data/libixion-0.16.1/include/ixion/cell.hpp
Examining data/libixion-0.16.1/include/ixion/formula_function_opcode.hpp
Examining data/libixion-0.16.1/include/ixion/config.hpp
FINAL RESULTS:
data/libixion-0.16.1/doc_example/section_examples/cell_access.cpp:9:6: [4] (race) access:
This usually indicates a security flaw. If an attacker can change anything
along the path between the call to access() and the file's actual use
(e.g., by moving files), the attacker can exploit the race condition
(CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
and try to open the file directly.
void access(const ixion::cell_access& ca)
data/libixion-0.16.1/doc_example/section_examples/cell_access.cpp:56:5: [4] (race) access:
This usually indicates a security flaw. If an attacker can change anything
along the path between the call to access() and the file's actual use
(e.g., by moving files), the attacker can exploit the race condition
(CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
and try to open the file directly.
access(ca);
data/libixion-0.16.1/doc_example/section_examples/cell_access.cpp:69:5: [4] (race) access:
This usually indicates a security flaw. If an attacker can change anything
along the path between the call to access() and the file's actual use
(e.g., by moving files), the attacker can exploit the race condition
(CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
and try to open the file directly.
access(ca);
data/libixion-0.16.1/src/libixion/module.cpp:36:36: [3] (buffer) getenv:
Environment variables are untrustable input if they can be set by an
attacker. They can have any content and length, and the same variable can
be set more than once (CWE-807, CWE-20). Check environment variables
carefully before using them.
const char* module_path = std::getenv("IXION_MODULE_PATH");
data/libixion-0.16.1/src/libixion/formula_lexer.cpp:150:36: [2] (misc) open:
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).
op(lexer_opcode_t::open);
data/libixion-0.16.1/src/libixion/formula_parser.cpp:67:34: [2] (misc) open:
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).
case lexer_opcode_t::open:
data/libixion-0.16.1/src/libixion/formula_parser.cpp:135:30: [2] (misc) open:
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).
case lexer_opcode_t::open:
data/libixion-0.16.1/src/libixion/lexer_tokens.cpp:64:30: [2] (misc) open:
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).
case lexer_opcode_t::open: return "open";
data/libixion-0.16.1/src/libixion/lexer_tokens.cpp:137:30: [2] (misc) open:
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).
case lexer_opcode_t::open:
data/libixion-0.16.1/src/libixion/lexer_tokens.hpp:50:5: [2] (misc) open:
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).
open,
data/libixion-0.16.1/src/libixion/matrix.cpp:244:26: [2] (buffer) memcpy:
Does not check for buffer overflows when copying to destination (CWE-120).
Make sure destination can always hold the source data.
std::memcpy(dest, src, sizeof(double)*node.size);
data/libixion-0.16.1/src/libixion/document.cpp:52:20: [1] (buffer) strlen:
Does not handle strings that are not \0-terminated; if given one it may
perform an over-read (it could cause a crash if unprotected) (CWE-126).
value.n = std::strlen(p);
data/libixion-0.16.1/src/libixion/document_test.cpp:22: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.
bool equal(double v1, double v2)
data/libixion-0.16.1/src/libixion/document_test.cpp:54:12: [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.
assert(equal(v, 3.6));
data/libixion-0.16.1/src/libixion/document_test.cpp:59:12: [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.
assert(equal(v, 2.4));
data/libixion-0.16.1/src/libixion/formula_lexer.cpp:141:36: [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.
op(lexer_opcode_t::equal);
data/libixion-0.16.1/src/libixion/formula_parser.cpp:74: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.
case lexer_opcode_t::equal:
data/libixion-0.16.1/src/libixion/formula_parser.cpp:132:30: [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.
case lexer_opcode_t::equal:
data/libixion-0.16.1/src/libixion/formula_parser.cpp:221: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.
case lexer_opcode_t::equal:
data/libixion-0.16.1/src/libixion/formula_parser.cpp:240:57: [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 (get_token().get_opcode() == lexer_opcode_t::equal)
data/libixion-0.16.1/src/libixion/ixion_test.cpp:64:50: [1] (buffer) strlen:
Does not handle strings that are not \0-terminated; if given one it may
perform an over-read (it could cause a crash if unprotected) (CWE-126).
double v = global::to_double(tests[i].s, strlen(tests[i].s));
data/libixion-0.16.1/src/libixion/ixion_test.cpp:1201:16: [1] (buffer) strlen:
Does not handle strings that are not \0-terminated; if given one it may
perform an over-read (it could cause a crash if unprotected) (CWE-126).
size_t n = strlen(p);
data/libixion-0.16.1/src/libixion/ixion_test.cpp:1348:52: [1] (buffer) strlen:
Does not handle strings that are not \0-terminated; if given one it may
perform an over-read (it could cause a crash if unprotected) (CWE-126).
formula_name_t t = resolver->resolve(name, strlen(name), abs_address_t());
data/libixion-0.16.1/src/libixion/ixion_test.cpp:1357:52: [1] (buffer) strlen:
Does not handle strings that are not \0-terminated; if given one it may
perform an over-read (it could cause a crash if unprotected) (CWE-126).
formula_name_t t = resolver->resolve(name, strlen(name), abs_address_t());
data/libixion-0.16.1/src/libixion/ixion_test.cpp:1366:77: [1] (buffer) strlen:
Does not handle strings that are not \0-terminated; if given one it may
perform an over-read (it could cause a crash if unprotected) (CWE-126).
formula_tokens_t tokens = parse_formula_string(cxt, pos, resolver, exp, strlen(exp));
data/libixion-0.16.1/src/libixion/ixion_test.cpp:1427:82: [1] (buffer) strlen:
Does not handle strings that are not \0-terminated; if given one it may
perform an over-read (it could cause a crash if unprotected) (CWE-126).
formula_tokens_t tokens = parse_formula_string(cxt, pos, *resolver, exp, strlen(exp));
data/libixion-0.16.1/src/libixion/ixion_test.cpp:2064:20: [1] (buffer) strlen:
Does not handle strings that are not \0-terminated; if given one it may
perform an over-read (it could cause a crash if unprotected) (CWE-126).
size_t n = strlen(p);
data/libixion-0.16.1/src/libixion/ixion_test.cpp:2205:78: [1] (buffer) strlen:
Does not handle strings that are not \0-terminated; if given one it may
perform an over-read (it could cause a crash if unprotected) (CWE-126).
formula_tokens_t tokens = parse_formula_string(cxt, pos, *resolver, exp, strlen(exp));
data/libixion-0.16.1/src/libixion/lexer_tokens.cpp:60:30: [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.
case lexer_opcode_t::equal: return "equal";
data/libixion-0.16.1/src/libixion/lexer_tokens.cpp:131:30: [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.
case lexer_opcode_t::equal:
data/libixion-0.16.1/src/libixion/lexer_tokens.hpp:45:5: [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,
data/libixion-0.16.1/src/libixion/mem_str_buf.cpp:34:61: [1] (buffer) strlen:
Does not handle strings that are not \0-terminated; if given one it may
perform an over-read (it could cause a crash if unprotected) (CWE-126).
mem_str_buf::mem_str_buf(const char* p) : mp_buf(p), m_size(strlen(p)) {}
data/libixion-0.16.1/src/libixion/mem_str_buf.cpp:99:9: [1] (buffer) strlen:
Does not handle strings that are not \0-terminated; if given one it may
perform an over-read (it could cause a crash if unprotected) (CWE-126).
if (strlen(s) != m_size)
data/libixion-0.16.1/src/libixion/model_context_impl.cpp:299:63: [1] (buffer) strlen:
Does not handle strings that are not \0-terminated; if given one it may
perform an over-read (it could cause a crash if unprotected) (CWE-126).
set_string_cell(pos, c.value.string, std::strlen(c.value.string));
data/libixion-0.16.1/src/python/document.cpp:108:58: [1] (buffer) strlen:
Does not handle strings that are not \0-terminated; if given one it may
perform an over-read (it could cause a crash if unprotected) (CWE-126).
sd->m_sheet_index = cxt.append_sheet(sheet_name, strlen(sheet_name));
data/libixion-0.16.1/src/python/sheet.cpp:126:35: [1] (buffer) strlen:
Does not handle strings that are not \0-terminated; if given one it may
perform an over-read (it could cause a crash if unprotected) (CWE-126).
cxt.set_string_cell(pos, val, strlen(val));
data/libixion-0.16.1/src/python/sheet.cpp:157:59: [1] (buffer) strlen:
Does not handle strings that are not \0-terminated; if given one it may
perform an over-read (it could cause a crash if unprotected) (CWE-126).
cxt, pos, *sd->m_global->m_resolver, formula, strlen(formula));
ANALYSIS SUMMARY:
Hits = 37
Lines analyzed = 24256 in approximately 0.55 seconds (43797 lines/second)
Physical Source Lines of Code (SLOC) = 17477
Hits@level = [0] 0 [1] 26 [2] 7 [3] 1 [4] 3 [5] 0
Hits@level+ = [0+] 37 [1+] 37 [2+] 11 [3+] 4 [4+] 3 [5+] 0
Hits/KSLOC@level+ = [0+] 2.11707 [1+] 2.11707 [2+] 0.629399 [3+] 0.228872 [4+] 0.171654 [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.