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/libsdsl-2.1.1+dfsg/CMakeModules/check_mode_ti.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/document_retrieval/src/build_idx.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/document_retrieval/src/doc_list_index.hpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/document_retrieval/src/doc_list_index_greedy.hpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/document_retrieval/src/doc_list_index_qprobing.hpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/document_retrieval/src/doc_list_index_sada.hpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/document_retrieval/src/doc_list_index_sort.hpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/document_retrieval/src/gen_pattern.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/document_retrieval/src/query_idx.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/document_retrieval/src/size_of_idx.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/document_retrieval/src/word_pat2char_pat.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/indexing_count/src/build_index_sdsl.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/indexing_count/src/genpatterns.c
Examining data/libsdsl-2.1.1+dfsg/benchmark/indexing_count/src/info.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/indexing_count/src/interface.h
Examining data/libsdsl-2.1.1+dfsg/benchmark/indexing_count/src/run_queries_sdsl.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/indexing_extract/src/build_index_sdsl.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/indexing_extract/src/genintervals.c
Examining data/libsdsl-2.1.1+dfsg/benchmark/indexing_extract/src/info.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/indexing_extract/src/interface.h
Examining data/libsdsl-2.1.1+dfsg/benchmark/indexing_extract/src/run_queries_sdsl.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/indexing_locate/src/build_index_sdsl.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/indexing_locate/src/info.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/indexing_locate/src/interface.h
Examining data/libsdsl-2.1.1+dfsg/benchmark/indexing_locate/src/pattern_random.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/indexing_locate/src/run_queries_sdsl.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/lcp/src/create_lcp.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/lcp/src/create_sa_bwt.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/rrr_vector/src/generate_rnd_bitvector.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/rrr_vector/src/rrr_time_and_space.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/self_delimiting_codes/src/sdc_benchmark.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/suffix_trees/src/build_cst.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/suffix_trees/src/depth_stats.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/suffix_trees/src/time_and_space_cst.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/wavelet_trees/src/gen_bwt.cpp
Examining data/libsdsl-2.1.1+dfsg/benchmark/wavelet_trees/src/wt_time_and_space.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/bit-vector.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/c++11-initializer-list.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/construct-in-memory.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/csa-alphabet-strategy.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/cst-bfs-iterator.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/cst-node-child-iterator.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/fm-index.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/fm-rmq-index.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/hugepages.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/int-vector-buffer-iterator.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/int-vector-buffer.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/int-vector-entry.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/int-vector-mapper.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/intersect.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/isa_access.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/k2_treap_in_mem.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/louds-tree.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/memory-visualization.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/node_iterator.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/print_wt.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/range-minimum-queries.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/sa-construct-space-efficient.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/sa-int-construct-from-file.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/sd_vector_benchmark.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/standalone_lcp.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/storage-visualization.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/store_to_file.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/text-statistics.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/uint64-array2int_vector.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/write_structure.cpp
Examining data/libsdsl-2.1.1+dfsg/examples/wt_ap.cpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/bit_vector_il.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/bit_vectors.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/bits.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/bp_support.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/bp_support_algorithm.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/bp_support_g.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/bp_support_gg.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/bp_support_sada.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/coder.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/coder_comma.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/coder_elias_delta.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/coder_elias_gamma.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/coder_fibonacci.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/config.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/construct.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/construct_bwt.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/construct_config.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/construct_isa.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/construct_lcp.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/construct_lcp_helper.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/construct_sa.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/construct_sa_se.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/csa_alphabet_strategy.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/csa_bitcompressed.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/csa_sada.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/csa_sampling_strategy.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/csa_wt.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/cst_fully.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/cst_iterators.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/cst_sada.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/cst_sct3.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/dac_vector.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/enc_vector.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/fast_cache.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/hyb_vector.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_buffer.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_io_wrappers.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_mapper.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/inv_perm_support.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/io.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/iterators.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/k2_treap.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/k2_treap_algorithm.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/k2_treap_helper.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/lcp.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/lcp_bitcompressed.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/lcp_byte.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/lcp_dac.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/lcp_support_sada.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/lcp_support_tree.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/lcp_support_tree2.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/lcp_vlc.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/lcp_wt.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/louds_tree.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/memory_management.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/nearest_neighbour_dictionary.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/nn_dict_dynamic.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/qsufsort.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/ram_filebuf.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/ram_fs.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/rank_support.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/rank_support_scan.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/rank_support_v.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/rank_support_v5.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/raster_img.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/rmq_succinct_sada.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/rmq_succinct_sct.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/rmq_support.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/rmq_support_sparse_table.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/rrr_helper.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/rrr_vector.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/rrr_vector_15.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/sd_vector.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/sdsl_concepts.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/select_support.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/select_support_mcl.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/select_support_scan.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/sfstream.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/sorted_int_stack.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/sorted_multi_stack_support.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/sorted_stack_support.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/structure_tree.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/suffix_array_algorithm.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/suffix_array_helper.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/suffix_arrays.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/suffix_tree_algorithm.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/suffix_tree_helper.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/suffix_trees.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/uint128_t.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/uint256_t.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/uintx_t.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/util.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/vectors.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/vlc_vector.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/wavelet_trees.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/wm_int.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/wt_algorithm.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/wt_ap.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/wt_blcd.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/wt_gmr.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/wt_helper.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/wt_huff.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/wt_hutu.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/wt_int.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/wt_pc.hpp
Examining data/libsdsl-2.1.1+dfsg/include/sdsl/wt_rlmn.hpp
Examining data/libsdsl-2.1.1+dfsg/lib/bits.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/bp_support_algorithm.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/coder_elias_gamma.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/coder_fibonacci.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/config.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/construct_config.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/construct_isa.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/construct_lcp.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/construct_lcp_helper.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/construct_sa.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/construct_sa_se.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/csa_alphabet_strategy.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/io.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/lcp_support_tree.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/louds_tree.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/memory_management.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/nn_dict_dynamic.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/ram_filebuf.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/ram_fs.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/rrr_vector_15.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/sd_vector.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/sfstream.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/uint128_t.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/uint256_t.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/util.cpp
Examining data/libsdsl-2.1.1+dfsg/lib/wt_helper.cpp
Examining data/libsdsl-2.1.1+dfsg/test/bit_vector_generator.cpp
Examining data/libsdsl-2.1.1+dfsg/test/bit_vector_test.cpp
Examining data/libsdsl-2.1.1+dfsg/test/bits_test.cpp
Examining data/libsdsl-2.1.1+dfsg/test/coder_test.cpp
Examining data/libsdsl-2.1.1+dfsg/test/csa_byte_test.cpp
Examining data/libsdsl-2.1.1+dfsg/test/csa_int_test.cpp
Examining data/libsdsl-2.1.1+dfsg/test/cst_byte_test.cpp
Examining data/libsdsl-2.1.1+dfsg/test/cst_helper.hpp
Examining data/libsdsl-2.1.1+dfsg/test/cst_int_test.cpp
Examining data/libsdsl-2.1.1+dfsg/test/int_vector_buffer_test.cpp
Examining data/libsdsl-2.1.1+dfsg/test/int_vector_generator.cpp
Examining data/libsdsl-2.1.1+dfsg/test/int_vector_mapper_test.cpp
Examining data/libsdsl-2.1.1+dfsg/test/int_vector_test.cpp
Examining data/libsdsl-2.1.1+dfsg/test/inv_perm_support_test.cpp
Examining data/libsdsl-2.1.1+dfsg/test/k2_treap_test.cpp
Examining data/libsdsl-2.1.1+dfsg/test/lcp_construct_test.cpp
Examining data/libsdsl-2.1.1+dfsg/test/nn_dict_dynamic_test.cpp
Examining data/libsdsl-2.1.1+dfsg/test/rank_support_test.cpp
Examining data/libsdsl-2.1.1+dfsg/test/replace_int_vector_value.cpp
Examining data/libsdsl-2.1.1+dfsg/test/rmq_test.cpp
Examining data/libsdsl-2.1.1+dfsg/test/sa_construct_test.cpp
Examining data/libsdsl-2.1.1+dfsg/test/sd_vector_test.cpp
Examining data/libsdsl-2.1.1+dfsg/test/search_bidirectional_test.cpp
Examining data/libsdsl-2.1.1+dfsg/test/select_support_test.cpp
Examining data/libsdsl-2.1.1+dfsg/test/sorted_int_stack_test.cpp
Examining data/libsdsl-2.1.1+dfsg/test/sorted_stack_support_test.cpp
Examining data/libsdsl-2.1.1+dfsg/test/wt_byte_test.cpp
Examining data/libsdsl-2.1.1+dfsg/test/wt_int_test.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/cst-search.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/cst-traversal.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/csx-printf.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/document_listing/doc_list_index.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-01.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-02.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-03.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-04.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-05.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-06.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-07.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-08.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-09.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-10.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-11.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-12.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-13.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-14.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-15.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-16.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-17.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-18.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-19.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-20.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-21.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-22.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-23.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-24.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-25.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/expl-26.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/int-vector-buffer.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/rmq-example.cpp
Examining data/libsdsl-2.1.1+dfsg/tutorial/use-a-wavelet-tree.cpp
FINAL RESULTS:
data/libsdsl-2.1.1+dfsg/benchmark/indexing_count/src/run_queries_sdsl.cpp:225:13: [4] (buffer) fscanf:
The scanf() family's %s operation, without a limit specification, permits
buffer overflows (CWE-120, CWE-20). Specify a limit to %s, or use a
different input function.
error = fscanf(stdin, "# number=%lu length=%lu file=%s forbidden=", numpatt,
data/libsdsl-2.1.1+dfsg/benchmark/indexing_extract/src/run_queries_sdsl.cpp:221:13: [4] (buffer) fscanf:
The scanf() family's %s operation, without a limit specification, permits
buffer overflows (CWE-120, CWE-20). Specify a limit to %s, or use a
different input function.
error = fscanf(stdin, "# number=%lu length=%lu file=%s forbidden=", numpatt,
data/libsdsl-2.1.1+dfsg/benchmark/indexing_extract/src/run_queries_sdsl.cpp:251:13: [4] (buffer) fscanf:
The scanf() family's %s operation, without a limit specification, permits
buffer overflows (CWE-120, CWE-20). Specify a limit to %s, or use a
different input function.
error = fscanf(stdin, "# number=%lu length=%lu file=%s\n", &num_pos, &numchars, orig_file);
data/libsdsl-2.1.1+dfsg/benchmark/indexing_locate/src/run_queries_sdsl.cpp:224:13: [4] (buffer) fscanf:
The scanf() family's %s operation, without a limit specification, permits
buffer overflows (CWE-120, CWE-20). Specify a limit to %s, or use a
different input function.
error = fscanf(stdin, "# number=%lu length=%lu file=%s forbidden=", numpatt,
data/libsdsl-2.1.1+dfsg/benchmark/indexing_locate/src/run_queries_sdsl.cpp:254:13: [4] (buffer) fscanf:
The scanf() family's %s operation, without a limit specification, permits
buffer overflows (CWE-120, CWE-20). Specify a limit to %s, or use a
different input function.
error = fscanf(stdin, "# number=%lu length=%lu file=%s\n", &num_pos, &numchars, orig_file);
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_mapper.hpp:352:13: [4] (buffer) sprintf:
Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
vsnprintf.
sprintf(tmp_file_name, "%s/tmp_mapper_file_%lu_XXXXXX.sdsl",dir.c_str(),util::pid());
data/libsdsl-2.1.1+dfsg/include/sdsl/suffix_array_helper.hpp:71:23: [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.
static value_type access(const t_csa& csa,size_type i)
data/libsdsl-2.1.1+dfsg/include/sdsl/suffix_array_helper.hpp:82:23: [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.
static value_type access(const t_csa& csa,size_type i)
data/libsdsl-2.1.1+dfsg/include/sdsl/suffix_array_helper.hpp:116:63: [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.
return traverse_csa_psi_trait<t_csa,t_direction>::access(m_csa,i);
data/libsdsl-2.1.1+dfsg/include/sdsl/suffix_array_helper.hpp:151:23: [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.
static value_type access(const t_csa& csa,size_type i)
data/libsdsl-2.1.1+dfsg/include/sdsl/suffix_array_helper.hpp:163:23: [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.
static value_type access(const t_csa& csa,size_type i)
data/libsdsl-2.1.1+dfsg/include/sdsl/suffix_array_helper.hpp:200:65: [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.
return traverse_csa_saisa_trait<t_csa,t_direction>::access(m_csa,i);
data/libsdsl-2.1.1+dfsg/include/sdsl/suffix_array_helper.hpp:328:23: [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.
static value_type access(const t_csa& csa,size_type i)
data/libsdsl-2.1.1+dfsg/include/sdsl/suffix_array_helper.hpp:341:23: [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.
static value_type access(const t_csa& csa,size_type i)
data/libsdsl-2.1.1+dfsg/include/sdsl/suffix_array_helper.hpp:378:63: [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.
return traverse_csa_wt_traits<t_csa,t_direction>::access(m_csa,i);
data/libsdsl-2.1.1+dfsg/test/bit_vector_test.cpp:47:29: [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.
TYPED_TEST(bit_vector_test, access)
data/libsdsl-2.1.1+dfsg/benchmark/rrr_vector/src/generate_rnd_bitvector.cpp:39:5: [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(17);
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_mapper.hpp:347:24: [3] (tmpfile) GetTempFileName:
Temporary file race condition in certain cases (e.g., if run as SYSTEM in
many versions of Windows) (CWE-377).
auto ret = GetTempFileName(dir.c_str(),"tmp_mapper_file_", 0 ,tmp_file_name);
data/libsdsl-2.1.1+dfsg/lib/sfstream.cpp:38:15: [3] (random) setstate:
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.
this->setstate(std::ios_base::failbit);
data/libsdsl-2.1.1+dfsg/lib/sfstream.cpp:71:21: [3] (random) setstate:
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.
if (fail) this->setstate(std::ios::failbit);
data/libsdsl-2.1.1+dfsg/lib/sfstream.cpp:98:23: [3] (random) setstate:
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.
this->setstate(err);
data/libsdsl-2.1.1+dfsg/lib/sfstream.cpp:103:19: [3] (random) setstate:
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.
this->setstate(err);
data/libsdsl-2.1.1+dfsg/lib/sfstream.cpp:125:23: [3] (random) setstate:
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.
this->setstate(err);
data/libsdsl-2.1.1+dfsg/lib/sfstream.cpp:130:19: [3] (random) setstate:
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.
this->setstate(err);
data/libsdsl-2.1.1+dfsg/lib/sfstream.cpp:168:15: [3] (random) setstate:
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.
this->setstate(std::ios_base::failbit);
data/libsdsl-2.1.1+dfsg/lib/sfstream.cpp:201:21: [3] (random) setstate:
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.
if (fail) this->setstate(std::ios::failbit);
data/libsdsl-2.1.1+dfsg/lib/sfstream.cpp:223:19: [3] (random) setstate:
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.
this->setstate(err);
data/libsdsl-2.1.1+dfsg/lib/sfstream.cpp:249:19: [3] (random) setstate:
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.
this->setstate(err);
data/libsdsl-2.1.1+dfsg/lib/sfstream.cpp:274:19: [3] (random) setstate:
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.
this->setstate(err);
data/libsdsl-2.1.1+dfsg/test/bit_vector_generator.cpp:52:9: [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(4711);
data/libsdsl-2.1.1+dfsg/test/int_vector_generator.cpp:43:9: [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(seed);
data/libsdsl-2.1.1+dfsg/benchmark/document_retrieval/src/query_idx.cpp:13:1: [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.
char buffer[buf_size];
data/libsdsl-2.1.1+dfsg/benchmark/document_retrieval/src/word_pat2char_pat.cpp:12:1: [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.
char buffer[buf_size];
data/libsdsl-2.1.1+dfsg/benchmark/indexing_count/src/genpatterns.c:126:9: [2] (integer) atoi:
Unless checked, the resulting number can exceed the expected range
(CWE-190). If source untrusted, check both minimum and maximum, even if the
input had no minus sign (large numbers can roll over into negative number;
consider saving to an unsigned value if that is intended).
m = atoi(argv[2]);
data/libsdsl-2.1.1+dfsg/benchmark/indexing_count/src/genpatterns.c:134:9: [2] (integer) atoi:
Unless checked, the resulting number can exceed the expected range
(CWE-190). If source untrusted, check both minimum and maximum, even if the
input had no minus sign (large numbers can roll over into negative number;
consider saving to an unsigned value if that is intended).
J = atoi(argv[3]);
data/libsdsl-2.1.1+dfsg/benchmark/indexing_count/src/genpatterns.c:146:13: [2] (misc) fopen:
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).
ifile = fopen(argv[1], "r");
data/libsdsl-2.1.1+dfsg/benchmark/indexing_count/src/genpatterns.c:167:13: [2] (misc) fopen:
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).
ofile = fopen(argv[4], "w");
data/libsdsl-2.1.1+dfsg/benchmark/indexing_extract/src/genintervals.c:66:9: [2] (integer) atoi:
Unless checked, the resulting number can exceed the expected range
(CWE-190). If source untrusted, check both minimum and maximum, even if the
input had no minus sign (large numbers can roll over into negative number;
consider saving to an unsigned value if that is intended).
m = atoi(argv[2]);
data/libsdsl-2.1.1+dfsg/benchmark/indexing_extract/src/genintervals.c:73:9: [2] (integer) atoi:
Unless checked, the resulting number can exceed the expected range
(CWE-190). If source untrusted, check both minimum and maximum, even if the
input had no minus sign (large numbers can roll over into negative number;
consider saving to an unsigned value if that is intended).
J = atoi(argv[3]);
data/libsdsl-2.1.1+dfsg/benchmark/indexing_extract/src/genintervals.c:79:13: [2] (misc) fopen:
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).
ifile = fopen(argv[1],"r");
data/libsdsl-2.1.1+dfsg/benchmark/indexing_extract/src/genintervals.c:100:13: [2] (misc) fopen:
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).
ofile = fopen(argv[4],"w");
data/libsdsl-2.1.1+dfsg/benchmark/rrr_vector/src/generate_rnd_bitvector.cpp:36:30: [2] (integer) atoi:
Unless checked, the resulting number can exceed the expected range
(CWE-190). If source untrusted, check both minimum and maximum, even if the
input had no minus sign (large numbers can roll over into negative number;
consider saving to an unsigned value if that is intended).
const uint64_t density = atoi(argv[2]);
data/libsdsl-2.1.1+dfsg/benchmark/rrr_vector/src/rrr_time_and_space.cpp:63:22: [2] (integer) atoi:
Unless checked, the resulting number can exceed the expected range
(CWE-190). If source untrusted, check both minimum and maximum, even if the
input had no minus sign (large numbers can roll over into negative number;
consider saving to an unsigned value if that is intended).
uint16_t k = atoi(argv[2]);
data/libsdsl-2.1.1+dfsg/examples/fm-index.cpp:26:25: [2] (integer) atoi:
Unless checked, the resulting number can exceed the expected range
(CWE-190). If source untrusted, check both minimum and maximum, even if the
input had no minus sign (large numbers can roll over into negative number;
consider saving to an unsigned value if that is intended).
max_locations = atoi(argv[2]);
data/libsdsl-2.1.1+dfsg/examples/fm-index.cpp:29:24: [2] (integer) atoi:
Unless checked, the resulting number can exceed the expected range
(CWE-190). If source untrusted, check both minimum and maximum, even if the
input had no minus sign (large numbers can roll over into negative number;
consider saving to an unsigned value if that is intended).
post_context = atoi(argv[3]);
data/libsdsl-2.1.1+dfsg/examples/fm-index.cpp:32:23: [2] (integer) atoi:
Unless checked, the resulting number can exceed the expected range
(CWE-190). If source untrusted, check both minimum and maximum, even if the
input had no minus sign (large numbers can roll over into negative number;
consider saving to an unsigned value if that is intended).
pre_context = atoi(argv[4]);
data/libsdsl-2.1.1+dfsg/examples/fm-rmq-index.cpp:52:25: [2] (integer) atoi:
Unless checked, the resulting number can exceed the expected range
(CWE-190). If source untrusted, check both minimum and maximum, even if the
input had no minus sign (large numbers can roll over into negative number;
consider saving to an unsigned value if that is intended).
max_locations = atoi(argv[2]);
data/libsdsl-2.1.1+dfsg/examples/fm-rmq-index.cpp:55:24: [2] (integer) atoi:
Unless checked, the resulting number can exceed the expected range
(CWE-190). If source untrusted, check both minimum and maximum, even if the
input had no minus sign (large numbers can roll over into negative number;
consider saving to an unsigned value if that is intended).
post_context = atoi(argv[3]);
data/libsdsl-2.1.1+dfsg/examples/fm-rmq-index.cpp:58:23: [2] (integer) atoi:
Unless checked, the resulting number can exceed the expected range
(CWE-190). If source untrusted, check both minimum and maximum, even if the
input had no minus sign (large numbers can roll over into negative number;
consider saving to an unsigned value if that is intended).
pre_context = atoi(argv[4]);
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector.hpp:1263:13: [2] (buffer) memcpy:
Does not check for buffer overflows when copying to destination (CWE-120).
Make sure destination can always hold the source data.
if (memcpy(m_data, v.data() ,v.capacity()/8)==nullptr) {
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector.hpp:1276:17: [2] (buffer) memcpy:
Does not check for buffer overflows when copying to destination (CWE-120).
Make sure destination can always hold the source data.
if (memcpy(m_data, v.data() ,v.capacity()/8)==nullptr) {
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_buffer.hpp:156:21: [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).
m_ofile.open(m_filename, mode|std::ios::out|std::ios::binary);
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_buffer.hpp:158:21: [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).
m_ifile.open(m_filename, std::ios::in|std::ios::binary);
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_buffer.hpp:188:21: [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).
m_ifile.open(m_filename, std::ios::in|std::ios::binary);
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_buffer.hpp:189:21: [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).
m_ofile.open(m_filename, std::ios::in|std::ios::out|std::ios::binary);
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_buffer.hpp:215:21: [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).
m_ifile.open(m_filename, std::ios::in|std::ios::binary);
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_buffer.hpp:216:21: [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).
m_ofile.open(m_filename, std::ios::in|std::ios::out|std::ios::binary);
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_buffer.hpp:298:21: [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).
m_ofile.open(m_filename, std::ios::out|std::ios::binary);
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_buffer.hpp:300:21: [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).
m_ifile.open(m_filename, std::ios::in|std::ios::binary);
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_buffer.hpp:380:25: [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).
m_ifile.open(m_filename, std::ios::in|std::ios::binary);
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_buffer.hpp:382:25: [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).
m_ofile.open(m_filename, std::ios::in|std::ios::out|std::ios::binary);
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_buffer.hpp:384:29: [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).
ivb.m_ifile.open(ivb.m_filename, std::ios::in|std::ios::binary);
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_buffer.hpp:386:29: [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).
ivb.m_ofile.open(ivb.m_filename, std::ios::in|std::ios::out|std::ios::binary);
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_mapper.hpp:345:13: [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.
char tmp_file_name[1024] = {0};
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_mapper.hpp:365:13: [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.
char tmp_dir_name[1024] = {0};
data/libsdsl-2.1.1+dfsg/include/sdsl/memory_management.hpp:393:52: [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).
if (!(mode&std::ios_base::out)) return open(filename.c_str(), O_RDONLY);
data/libsdsl-2.1.1+dfsg/include/sdsl/memory_management.hpp:394:25: [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).
else return open(filename.c_str(), O_RDWR);
data/libsdsl-2.1.1+dfsg/include/sdsl/ram_filebuf.hpp:24:9: [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(const std::string s, std::ios_base::openmode mode);
data/libsdsl-2.1.1+dfsg/include/sdsl/sfstream.hpp:32:9: [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(const std::string& file, std::ios_base::openmode mode = std::ios_base::out);
data/libsdsl-2.1.1+dfsg/include/sdsl/sfstream.hpp:62:9: [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(const std::string& file, std::ios_base::openmode mode = std::ios_base::in);
data/libsdsl-2.1.1+dfsg/lib/construct_lcp.cpp:124:14: [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.
unsigned char alphabet[257] = {0};
data/libsdsl-2.1.1+dfsg/lib/construct_lcp.cpp:435:14: [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.
unsigned char alphabet[257] = {0};
data/libsdsl-2.1.1+dfsg/lib/construct_lcp_helper.cpp:72:26: [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).
m_stream.open(m_file_name, std::ios::in | std::ios::out | std::ios::binary | std::ios::trunc);
data/libsdsl-2.1.1+dfsg/lib/construct_lcp_helper.cpp:94:13: [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(m_read_buf, m_write_buf, m_widx+1);
data/libsdsl-2.1.1+dfsg/lib/memory_management.cpp:577:9: [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(newptr,ptr,size);
data/libsdsl-2.1.1+dfsg/lib/ram_filebuf.cpp:26:14: [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).
ram_filebuf::open(const std::string name, std::ios_base::openmode mode)
data/libsdsl-2.1.1+dfsg/lib/sfstream.cpp:18: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(file, mode);
data/libsdsl-2.1.1+dfsg/lib/sfstream.cpp:22:12: [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).
osfstream::open(const std::string& file, std::ios_base::openmode mode)
data/libsdsl-2.1.1+dfsg/lib/sfstream.cpp:30:48: [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).
success = ((ram_filebuf*)m_streambuf)->open(m_file, mode);
data/libsdsl-2.1.1+dfsg/lib/sfstream.cpp:33:49: [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).
success = ((std::filebuf*)m_streambuf)->open(m_file, mode);
data/libsdsl-2.1.1+dfsg/lib/sfstream.cpp:148: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(file, mode);
data/libsdsl-2.1.1+dfsg/lib/sfstream.cpp:152:12: [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).
isfstream::open(const std::string& file, std::ios_base::openmode mode)
data/libsdsl-2.1.1+dfsg/lib/sfstream.cpp:160:48: [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).
success = ((ram_filebuf*)m_streambuf)->open(m_file, mode);
data/libsdsl-2.1.1+dfsg/lib/sfstream.cpp:163:49: [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).
success = ((std::filebuf*)m_streambuf)->open(m_file, mode);
data/libsdsl-2.1.1+dfsg/lib/util.cpp:45:5: [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.
char file_name[_MAX_FNAME] = { 0 };
data/libsdsl-2.1.1+dfsg/lib/util.cpp:62:5: [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.
char dir_name[_MAX_DIR] = { 0 };
data/libsdsl-2.1.1+dfsg/lib/util.cpp:63:5: [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.
char drive[_MAX_DRIVE] = {0};
data/libsdsl-2.1.1+dfsg/lib/util.cpp:110:5: [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.
char buf[4096];
data/libsdsl-2.1.1+dfsg/test/csa_int_test.cpp:237:17: [2] (integer) atoi:
Unless checked, the resulting number can exceed the expected range
(CWE-190). If source untrusted, check both minimum and maximum, even if the
input had no minus sign (large numbers can roll over into negative number;
consider saving to an unsigned value if that is intended).
num_bytes = atoi(argv[2]);
data/libsdsl-2.1.1+dfsg/test/cst_int_test.cpp:478:17: [2] (integer) atoi:
Unless checked, the resulting number can exceed the expected range
(CWE-190). If source untrusted, check both minimum and maximum, even if the
input had no minus sign (large numbers can roll over into negative number;
consider saving to an unsigned value if that is intended).
num_bytes = atoi(argv[2]);
data/libsdsl-2.1.1+dfsg/test/replace_int_vector_value.cpp:17:18: [2] (integer) atoi:
Unless checked, the resulting number can exceed the expected range
(CWE-190). If source untrusted, check both minimum and maximum, even if the
input had no minus sign (large numbers can roll over into negative number;
consider saving to an unsigned value if that is intended).
uint64_t x = atoi(argv[2]);
data/libsdsl-2.1.1+dfsg/test/replace_int_vector_value.cpp:18:18: [2] (integer) atoi:
Unless checked, the resulting number can exceed the expected range
(CWE-190). If source untrusted, check both minimum and maximum, even if the
input had no minus sign (large numbers can roll over into negative number;
consider saving to an unsigned value if that is intended).
uint64_t y = atoi(argv[3]);
data/libsdsl-2.1.1+dfsg/tutorial/csx-printf.cpp:10:1: [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.
char line[BUF_SIZE];
data/libsdsl-2.1.1+dfsg/tutorial/document_listing/doc_list_index.cpp:43:5: [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.
char buffer[64];
data/libsdsl-2.1.1+dfsg/benchmark/indexing_count/src/genpatterns.c:47:11: [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).
len = strlen(forbid);
data/libsdsl-2.1.1+dfsg/benchmark/indexing_count/src/run_queries_sdsl.cpp:237:17: [1] (buffer) fgetc:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
while ((c = fgetc(stdin)) != 0) {
data/libsdsl-2.1.1+dfsg/benchmark/indexing_extract/src/run_queries_sdsl.cpp:233:17: [1] (buffer) fgetc:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
while ((c = fgetc(stdin)) != 0) {
data/libsdsl-2.1.1+dfsg/benchmark/indexing_locate/src/run_queries_sdsl.cpp:236:17: [1] (buffer) fgetc:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
while ((c = fgetc(stdin)) != 0) {
data/libsdsl-2.1.1+dfsg/include/sdsl/coder_fibonacci.hpp:340:29: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
w |= (((*data)>>read)<<buffered);
data/libsdsl-2.1.1+dfsg/include/sdsl/coder_fibonacci.hpp:341:17: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if (read >= buffered) {
data/libsdsl-2.1.1+dfsg/include/sdsl/coder_fibonacci.hpp:343:32: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
buffered += 64-read;
data/libsdsl-2.1.1+dfsg/include/sdsl/coder_fibonacci.hpp:380:26: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
w |= (((*d)>>read)<<buffered);
data/libsdsl-2.1.1+dfsg/include/sdsl/coder_fibonacci.hpp:381:17: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if (read >= buffered) {
data/libsdsl-2.1.1+dfsg/include/sdsl/coder_fibonacci.hpp:388:32: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
buffered += 64-read;
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector.hpp:1551:12: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
in.read((char*) p, conf::SDSL_BLOCK_SIZE*sizeof(uint64_t));
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector.hpp:1555:8: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
in.read((char*) p, ((capacity()>>6)-idx)*sizeof(uint64_t));
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_buffer.hpp:65:25: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
m_ifile.read((char*) m_buffer.data(), (m_buffersize*width())/8);
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_buffer.hpp:96:18: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
uint64_t read(const uint64_t idx)
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_buffer.hpp:414:49: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
return m_int_vector_buffer->read(m_idx);
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_buffer.hpp:433:55: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
uint64_t x = m_int_vector_buffer->read(m_idx);
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_buffer.hpp:449:55: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
uint64_t x = m_int_vector_buffer->read(m_idx);
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_buffer.hpp:465:55: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
uint64_t w = m_int_vector_buffer->read(m_idx);
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_buffer.hpp:473:55: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
uint64_t w = m_int_vector_buffer->read(m_idx);
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_io_wrappers.hpp:94:24: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
in.read((char*)&w, sizeof(uint8_t));
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_mapper.hpp:313:25: [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.
return std::equal(begin(), end(), v.begin());
data/libsdsl-2.1.1+dfsg/include/sdsl/int_vector_mapper.hpp:359:46: [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).
return std::string(tmp_file_name,strlen(tmp_file_name));
data/libsdsl-2.1.1+dfsg/include/sdsl/io.hpp:103:8: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
in.read((char*)&t, sizeof(t));
data/libsdsl-2.1.1+dfsg/include/sdsl/io.hpp:214:20: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
in.read((char*)v.data(), file_size);
data/libsdsl-2.1.1+dfsg/include/sdsl/io.hpp:224:24: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
in.read((char*)buf.data(), block_size);
data/libsdsl-2.1.1+dfsg/include/sdsl/io.hpp:227:44: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
uint8_t* end = begin+read;
data/libsdsl-2.1.1+dfsg/include/sdsl/k2_treap.hpp:201:26: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
auto v = read<uint32_t,uint32_t,uint32_t>(bufs);
data/libsdsl-2.1.1+dfsg/include/sdsl/k2_treap.hpp:204:26: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
auto v = read<uint64_t,uint64_t,uint64_t>(bufs);
data/libsdsl-2.1.1+dfsg/include/sdsl/k2_treap.hpp:211:45: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
read(std::vector<int_vector_buffer<>*>& bufs)
data/libsdsl-2.1.1+dfsg/include/sdsl/lcp_support_tree2.hpp:295:20: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
big_lcp_in.read((char*)&y, sizeof(y));
data/libsdsl-2.1.1+dfsg/include/sdsl/select_support_mcl.hpp:469:8: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
in.read((char*) &m_arg_cnt, sizeof(size_type)/sizeof(char));
data/libsdsl-2.1.1+dfsg/include/sdsl/wt_helper.hpp:125:12: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
in.read((char*) child, 2*sizeof(child[0]));
data/libsdsl-2.1.1+dfsg/include/sdsl/wt_helper.hpp:286:12: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
in.read((char*) m_c_to_leaf, fixed_sigma*sizeof(m_c_to_leaf[0]));
data/libsdsl-2.1.1+dfsg/include/sdsl/wt_helper.hpp:287:12: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
in.read((char*) m_path, fixed_sigma*sizeof(m_path[0]));
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:20:13: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if (n + read <= 64) {
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:21:21: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if (((*d >> read)&bits::lo_set[n]) == bits::lo_set[n])
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:24:20: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if ((*d >> read) == bits::lo_set[64-read]) {// all bits are set to 1
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:24:45: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if ((*d >> read) == bits::lo_set[64-read]) {// all bits are set to 1
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:25:24: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
value = 64-read;
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:27:22: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
n -= (64-read);
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:47:26: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
w |= (((*d)>>read)<<buffered);
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:48:17: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if (read >= buffered) {
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:50:32: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
buffered += 64-read;
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:91:34: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
w |= (((*d)>>read)<<buffered);
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:92:25: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if (read >= buffered) {
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:94:40: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
buffered += 64-read;
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:101:38: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
w |= (((*d)>>read)<<buffered);
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:102:29: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if (read >= buffered) {
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:104:44: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
buffered += 64-read;
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:117:34: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
w |= (((*d)>>read)<<buffered);
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:118:25: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if (read >= buffered) {
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:120:40: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
buffered += 64-read;
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:127:38: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
w |= (((*d)>>read)<<buffered);
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:128:29: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if (read >= buffered) {
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:130:44: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
buffered += 64-read;
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:143:34: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
w |= (((*d)>>read)<<buffered);
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:144:25: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if (read >= buffered) {
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:146:40: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
buffered += 64-read;
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:153:38: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
w |= (((*d)>>read)<<buffered);
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:154:29: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if (read >= buffered) {
data/libsdsl-2.1.1+dfsg/lib/coder_elias_delta.cpp:156:44: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
buffered += 64-read;
data/libsdsl-2.1.1+dfsg/lib/coder_elias_gamma.cpp:20:13: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if (n + read <= 64) {
data/libsdsl-2.1.1+dfsg/lib/coder_elias_gamma.cpp:21:21: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if (((*d >> read)&bits::lo_set[n]) == bits::lo_set[n])
data/libsdsl-2.1.1+dfsg/lib/coder_elias_gamma.cpp:24:20: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if ((*d >> read) == bits::lo_set[64-read]) {// all bits are set to 1
data/libsdsl-2.1.1+dfsg/lib/coder_elias_gamma.cpp:24:45: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if ((*d >> read) == bits::lo_set[64-read]) {// all bits are set to 1
data/libsdsl-2.1.1+dfsg/lib/coder_elias_gamma.cpp:25:24: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
value = 64-read;
data/libsdsl-2.1.1+dfsg/lib/coder_elias_gamma.cpp:27:22: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
n -= (64-read);
data/libsdsl-2.1.1+dfsg/lib/coder_elias_gamma.cpp:47:26: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
w |= (((*d)>>read)<<buffered);
data/libsdsl-2.1.1+dfsg/lib/coder_elias_gamma.cpp:48:17: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if (read >= buffered) {
data/libsdsl-2.1.1+dfsg/lib/coder_elias_gamma.cpp:50:32: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
buffered += 64-read;
data/libsdsl-2.1.1+dfsg/lib/coder_elias_gamma.cpp:76:34: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
w |= (((*d)>>read)<<buffered);
data/libsdsl-2.1.1+dfsg/lib/coder_elias_gamma.cpp:77:25: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if (read >= buffered) {
data/libsdsl-2.1.1+dfsg/lib/coder_elias_gamma.cpp:79:40: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
buffered += 64-read;
data/libsdsl-2.1.1+dfsg/lib/coder_elias_gamma.cpp:86:38: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
w |= (((*d)>>read)<<buffered);
data/libsdsl-2.1.1+dfsg/lib/coder_elias_gamma.cpp:87:29: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if (read >= buffered) {
data/libsdsl-2.1.1+dfsg/lib/coder_elias_gamma.cpp:89:44: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
buffered += 64-read;
data/libsdsl-2.1.1+dfsg/lib/coder_elias_gamma.cpp:102:34: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
w |= (((*d)>>read)<<buffered);
data/libsdsl-2.1.1+dfsg/lib/coder_elias_gamma.cpp:103:25: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if (read >= buffered) {
data/libsdsl-2.1.1+dfsg/lib/coder_elias_gamma.cpp:105:40: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
buffered += 64-read;
data/libsdsl-2.1.1+dfsg/lib/coder_elias_gamma.cpp:112:38: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
w |= (((*d)>>read)<<buffered);
data/libsdsl-2.1.1+dfsg/lib/coder_elias_gamma.cpp:113:29: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if (read >= buffered) {
data/libsdsl-2.1.1+dfsg/lib/coder_elias_gamma.cpp:115:44: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
buffered += 64-read;
data/libsdsl-2.1.1+dfsg/lib/coder_fibonacci.cpp:23:40: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
i = bits::cnt11(*d & ~bits::lo_set[read], carry);
data/libsdsl-2.1.1+dfsg/lib/coder_fibonacci.cpp:31:89: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
bits_to_decode += ((w-1)<<6) + bits::sel11(*(d+w), n-(i-temp), oldcarry) + 65 - read;
data/libsdsl-2.1.1+dfsg/lib/coder_fibonacci.cpp:34:44: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
bits_to_decode = bits::sel11(*d >> read, n)+1;
data/libsdsl-2.1.1+dfsg/lib/coder_fibonacci.cpp:44:26: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
w |= (((*d)>>read)<<buffered);
data/libsdsl-2.1.1+dfsg/lib/coder_fibonacci.cpp:45:17: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if (read >= buffered) {
data/libsdsl-2.1.1+dfsg/lib/coder_fibonacci.cpp:47:32: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
buffered += 64-read;
data/libsdsl-2.1.1+dfsg/lib/coder_fibonacci.cpp:48:39: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
bits_to_decode -= (64-read);
data/libsdsl-2.1.1+dfsg/lib/construct_lcp_helper.cpp:90:22: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
m_stream.read((char*) m_read_buf, m_buffer_size);
data/libsdsl-2.1.1+dfsg/lib/io.cpp:19:18: [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).
uint64_t n = strlen((const char*)v);
data/libsdsl-2.1.1+dfsg/lib/io.cpp:74:8: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
in.read(buf, size);
data/libsdsl-2.1.1+dfsg/lib/memory_management.cpp:630:28: [1] (buffer) mismatch:
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.
auto ps = std::mismatch(ps_str.begin(),ps_str.end(), line.begin());
data/libsdsl-2.1.1+dfsg/lib/memory_management.cpp:634:28: [1] (buffer) mismatch:
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.
auto pf = std::mismatch(pf_str.begin(),pf_str.end(), line.begin());
data/libsdsl-2.1.1+dfsg/test/int_vector_mapper_test.cpp:59: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.
ASSERT_TRUE(std::equal(ivm.begin(),ivm.end(),vec.begin()));
data/libsdsl-2.1.1+dfsg/test/int_vector_mapper_test.cpp:81: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.
ASSERT_TRUE(std::equal(ivm.begin(),ivm.end(),vec.begin()));
data/libsdsl-2.1.1+dfsg/test/int_vector_mapper_test.cpp:105: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.
ASSERT_TRUE(std::equal(ivm.begin(),ivm.end(),vec.begin()));
data/libsdsl-2.1.1+dfsg/test/int_vector_mapper_test.cpp:141: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.
ASSERT_TRUE(std::equal(ivm.begin(),ivm.end(),vec.begin()));
data/libsdsl-2.1.1+dfsg/test/int_vector_mapper_test.cpp:165: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.
ASSERT_TRUE(std::equal(ivm.begin(),ivm.end(),stdvec.begin()));
data/libsdsl-2.1.1+dfsg/test/int_vector_mapper_test.cpp:190: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.
ASSERT_TRUE(std::equal(ivm.begin(),ivm.end(),stdvec.begin()));
data/libsdsl-2.1.1+dfsg/test/int_vector_mapper_test.cpp:208: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.
ASSERT_TRUE(std::equal(ivmc.begin(),ivmc.end(),ivmu.begin()));
data/libsdsl-2.1.1+dfsg/test/int_vector_mapper_test.cpp:209: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.
ASSERT_TRUE(std::equal(ivmc.begin(),ivmc.end(),vec.begin()));
data/libsdsl-2.1.1+dfsg/test/int_vector_mapper_test.cpp:213: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.
ASSERT_TRUE(std::equal(ivmu.begin(),ivmu.end(),vec.begin()));
data/libsdsl-2.1.1+dfsg/test/int_vector_mapper_test.cpp:215: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.
ASSERT_TRUE(std::equal(ivmu.begin(),ivmu.end(),vec.begin()));
data/libsdsl-2.1.1+dfsg/test/int_vector_mapper_test.cpp:222: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.
ASSERT_TRUE(std::equal(ivmc.begin(),ivmc.end(),ivmu.begin()));
data/libsdsl-2.1.1+dfsg/test/int_vector_mapper_test.cpp:240: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.
ASSERT_TRUE(std::equal(bvm.begin(),bvm.end(),bv.begin()));
data/libsdsl-2.1.1+dfsg/test/int_vector_mapper_test.cpp:248: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.
ASSERT_TRUE(std::equal(bvm.begin(),bvm.end(),bv.begin()));
data/libsdsl-2.1.1+dfsg/test/int_vector_mapper_test.cpp:254: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.
ASSERT_TRUE(std::equal(bvm.begin(),bvm.end(),bv.begin()));
data/libsdsl-2.1.1+dfsg/test/int_vector_mapper_test.cpp:277: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.
ASSERT_TRUE(std::equal(tmp_buf.begin(),tmp_buf.end(),vec.begin()));
ANALYSIS SUMMARY:
Hits = 203
Lines analyzed = 58119 in approximately 1.55 seconds (37426 lines/second)
Physical Source Lines of Code (SLOC) = 42681
Hits@level = [0] 227 [1] 109 [2] 63 [3] 15 [4] 16 [5] 0
Hits@level+ = [0+] 430 [1+] 203 [2+] 94 [3+] 31 [4+] 16 [5+] 0
Hits/KSLOC@level+ = [0+] 10.0747 [1+] 4.75621 [2+] 2.20239 [3+] 0.726319 [4+] 0.374874 [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.