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/libstxxl-1.4.1/misc/cmake/TestWindowsFSeek.c
Examining data/libstxxl-1.4.1/misc/cmake/TestFileOffsetBits.c
Examining data/libstxxl-1.4.1/include/stxxl/version.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/version.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/defines.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/utils/malloc.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/compat/type_traits.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/compat/unique_ptr.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/compat/hash_map.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/libstxxl.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/deprecated.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/namespace.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/simple_vector.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/new_alloc.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/types.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/exithandler.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/is_sorted.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/aligned_alloc.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/mutex.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/binary_buffer.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/state.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/utils.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/tmeta.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/timer.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/semaphore.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/seed.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/addressable_queues.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/condition_variable.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/counting_ptr.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/uint_types.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/log.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/external_shared_ptr.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/exceptions.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/rand.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/onoff_switch.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/cmdline.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/tuple.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/settings.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/common/error_handling.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/mng/adaptor.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/mng/block_alloc.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/mng/disk_allocator.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/mng/config.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/mng/typed_block.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/mng/buf_ostream.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/mng/buf_istream.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/mng/block_prefetcher.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/mng/prefetch_pool.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/mng/buf_istream_reverse.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/mng/bid.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/mng/block_manager.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/mng/buf_writer.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/mng/block_alloc_interleaved.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/mng/read_write_pool.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/mng/write_pool.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/mng/block_scheduler.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/verbose.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/stream/unique.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/stream/sort_stream.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/stream/stream.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/stream/choose.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/stream/sorted_runs.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/syscall_file.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/request.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/request_queue_impl_worker.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/create_file.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/linuxaio_request.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/request_queue_impl_1q.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/file.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/disk_queued_file.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/wfs_file_base.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/iostats.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/request_queue_impl_qwqr.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/mem_file.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/disk_queues.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/request_operations.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/simdisk_file.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/linuxaio_file.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/fileperblock_file.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/ufs_file_base.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/request_with_state.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/request_with_waiters.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/completion_handler.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/io.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/mmap_file.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/request_interface.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/boostfd_file.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/request_queue.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/serving_request.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/wincall_file.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/linuxaio_queue.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/io/wbtl_file.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/matrix.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/pager.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/sequence.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/pq_mergers.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/queue.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/hash_map/block_cache.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/hash_map/iterator.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/hash_map/tuning.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/hash_map/iterator_map.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/hash_map/hash_map.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/hash_map/util.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/matrix_low_level.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/pq_ext_merger.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/stack.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/btree/leaf.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/btree/node_cache.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/btree/node.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/btree/btree.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/btree/iterator.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/btree/iterator_map.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/btree/root_node.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/deque.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/sorter.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/pq_losertree.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/map.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/vector.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/pq_helpers.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/matrix_arithmetic.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/unordered_map.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/containers/priority_queue.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/algo/adaptor.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/algo/losertree.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/algo/ksort.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/algo/async_schedule.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/algo/inmemsort.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/algo/sort_base.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/algo/intksort.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/algo/random_shuffle.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/algo/run_cursor.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/algo/sort.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/algo/stable_ksort.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/algo/sort_helper.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/algo/scan.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/msvc_compatibility.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/singleton.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/parallel.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/noncopyable.h
Examining data/libstxxl-1.4.1/include/stxxl/bits/unused.h
Examining data/libstxxl-1.4.1/include/stxxl.h
Examining data/libstxxl-1.4.1/examples/applications/skew3.cpp
Examining data/libstxxl-1.4.1/examples/common/cmdline.cpp
Examining data/libstxxl-1.4.1/examples/stream/stream1.cpp
Examining data/libstxxl-1.4.1/examples/containers/map1.cpp
Examining data/libstxxl-1.4.1/examples/containers/stack2.cpp
Examining data/libstxxl-1.4.1/examples/containers/matrix1.cpp
Examining data/libstxxl-1.4.1/examples/containers/vector1.cpp
Examining data/libstxxl-1.4.1/examples/containers/unordered_map1.cpp
Examining data/libstxxl-1.4.1/examples/containers/vector2.cpp
Examining data/libstxxl-1.4.1/examples/containers/queue2.cpp
Examining data/libstxxl-1.4.1/examples/containers/sequence1.cpp
Examining data/libstxxl-1.4.1/examples/containers/pqueue2.cpp
Examining data/libstxxl-1.4.1/examples/containers/sorter2.cpp
Examining data/libstxxl-1.4.1/examples/containers/deque1.cpp
Examining data/libstxxl-1.4.1/examples/containers/stack1.cpp
Examining data/libstxxl-1.4.1/examples/containers/copy_file.cpp
Examining data/libstxxl-1.4.1/examples/containers/deque2.cpp
Examining data/libstxxl-1.4.1/examples/containers/sorter1.cpp
Examining data/libstxxl-1.4.1/examples/containers/queue1.cpp
Examining data/libstxxl-1.4.1/examples/containers/pqueue1.cpp
Examining data/libstxxl-1.4.1/examples/containers/vector_buf.cpp
Examining data/libstxxl-1.4.1/examples/algo/phonebills.cpp
Examining data/libstxxl-1.4.1/examples/algo/copy_and_sort_file.cpp
Examining data/libstxxl-1.4.1/examples/algo/sort_file.cpp
Examining data/libstxxl-1.4.1/examples/algo/phonebills_genlog.cpp
Examining data/libstxxl-1.4.1/tests/common/test_binary_buffer.cpp
Examining data/libstxxl-1.4.1/tests/common/test_globals.cpp
Examining data/libstxxl-1.4.1/tests/common/test_counting_ptr.cpp
Examining data/libstxxl-1.4.1/tests/common/test_manyunits2.cpp
Examining data/libstxxl-1.4.1/tests/common/test_cmdline.cpp
Examining data/libstxxl-1.4.1/tests/common/test_tuple.cpp
Examining data/libstxxl-1.4.1/tests/common/test_log2.cpp
Examining data/libstxxl-1.4.1/tests/common/test_random.cpp
Examining data/libstxxl-1.4.1/tests/common/test_manyunits.cpp
Examining data/libstxxl-1.4.1/tests/common/test_uint_types.cpp
Examining data/libstxxl-1.4.1/tests/common/test_external_shared_ptr.cpp
Examining data/libstxxl-1.4.1/tests/mng/test_aligned.cpp
Examining data/libstxxl-1.4.1/tests/mng/test_buf_streams.cpp
Examining data/libstxxl-1.4.1/tests/mng/test_pool_pair.cpp
Examining data/libstxxl-1.4.1/tests/mng/test_block_alloc_strategy.cpp
Examining data/libstxxl-1.4.1/tests/mng/test_block_manager2.cpp
Examining data/libstxxl-1.4.1/tests/mng/test_read_write_pool.cpp
Examining data/libstxxl-1.4.1/tests/mng/test_block_manager1.cpp
Examining data/libstxxl-1.4.1/tests/mng/test_block_manager.cpp
Examining data/libstxxl-1.4.1/tests/mng/test_config.cpp
Examining data/libstxxl-1.4.1/tests/mng/test_bmlayer.cpp
Examining data/libstxxl-1.4.1/tests/mng/test_prefetch_pool.cpp
Examining data/libstxxl-1.4.1/tests/mng/test_write_pool.cpp
Examining data/libstxxl-1.4.1/tests/mng/test_block_scheduler.cpp
Examining data/libstxxl-1.4.1/tests/stream/test_sorted_runs.cpp
Examining data/libstxxl-1.4.1/tests/stream/test_materialize.cpp
Examining data/libstxxl-1.4.1/tests/stream/test_loop.cpp
Examining data/libstxxl-1.4.1/tests/stream/test_stream.cpp
Examining data/libstxxl-1.4.1/tests/stream/test_naive_transpose.cpp
Examining data/libstxxl-1.4.1/tests/stream/test_stream1.cpp
Examining data/libstxxl-1.4.1/tests/stream/test_push_sort.cpp
Examining data/libstxxl-1.4.1/tests/io/test_io.cpp
Examining data/libstxxl-1.4.1/tests/io/test_cancel.cpp
Examining data/libstxxl-1.4.1/tests/io/test_io_sizes.cpp
Examining data/libstxxl-1.4.1/tests/io/test_mmap.cpp
Examining data/libstxxl-1.4.1/tests/io/test_sim_disk.cpp
Examining data/libstxxl-1.4.1/tests/containers/test_map_random.cpp
Examining data/libstxxl-1.4.1/tests/containers/test_stack.cpp
Examining data/libstxxl-1.4.1/tests/containers/map_test_handlers.h
Examining data/libstxxl-1.4.1/tests/containers/test_map.cpp
Examining data/libstxxl-1.4.1/tests/containers/test_vector_export.cpp
Examining data/libstxxl-1.4.1/tests/containers/test_queue2.cpp
Examining data/libstxxl-1.4.1/tests/containers/test_migr_stack.cpp
Examining data/libstxxl-1.4.1/tests/containers/test_queue.cpp
Examining data/libstxxl-1.4.1/tests/containers/test_ext_merger2.cpp
Examining data/libstxxl-1.4.1/tests/containers/test_sequence.cpp
Examining data/libstxxl-1.4.1/tests/containers/test_vector.cpp
Examining data/libstxxl-1.4.1/tests/containers/hash_map/test_hash_map_iterators.cpp
Examining data/libstxxl-1.4.1/tests/containers/hash_map/test_hash_map_block_cache.cpp
Examining data/libstxxl-1.4.1/tests/containers/hash_map/test_hash_map_reader_writer.cpp
Examining data/libstxxl-1.4.1/tests/containers/hash_map/test_hash_map.cpp
Examining data/libstxxl-1.4.1/tests/containers/btree/test_btree_insert_scan.cpp
Examining data/libstxxl-1.4.1/tests/containers/btree/test_btree_insert_erase.cpp
Examining data/libstxxl-1.4.1/tests/containers/btree/test_btree.cpp
Examining data/libstxxl-1.4.1/tests/containers/btree/test_btree_const_scan.cpp
Examining data/libstxxl-1.4.1/tests/containers/btree/test_btree_insert_find.cpp
Examining data/libstxxl-1.4.1/tests/containers/test_matrix.cpp
Examining data/libstxxl-1.4.1/tests/containers/test_vector_buf.cpp
Examining data/libstxxl-1.4.1/tests/containers/test_sorter.cpp
Examining data/libstxxl-1.4.1/tests/containers/test_ext_merger.cpp
Examining data/libstxxl-1.4.1/tests/containers/test_many_stacks.cpp
Examining data/libstxxl-1.4.1/tests/containers/test_deque.cpp
Examining data/libstxxl-1.4.1/tests/containers/test_pqueue.cpp
Examining data/libstxxl-1.4.1/tests/containers/test_vector_sizes.cpp
Examining data/libstxxl-1.4.1/tests/containers/test_iterators.cpp
Examining data/libstxxl-1.4.1/tests/algo/test_scan.cpp
Examining data/libstxxl-1.4.1/tests/algo/test_bad_cmp.cpp
Examining data/libstxxl-1.4.1/tests/algo/test_sort.cpp
Examining data/libstxxl-1.4.1/tests/algo/test_sort_all_parameters.cpp
Examining data/libstxxl-1.4.1/tests/algo/test_sort_all_parameters.h
Examining data/libstxxl-1.4.1/tests/algo/test_random_shuffle.cpp
Examining data/libstxxl-1.4.1/tests/algo/test_ksort_all_parameters.cpp
Examining data/libstxxl-1.4.1/tests/algo/test_stable_ksort.cpp
Examining data/libstxxl-1.4.1/tests/algo/test_asch.cpp
Examining data/libstxxl-1.4.1/tests/algo/test_stable_ksort_all_parameters.cpp
Examining data/libstxxl-1.4.1/tests/algo/test_parallel_sort.cpp
Examining data/libstxxl-1.4.1/tests/algo/test_ksort.cpp
Examining data/libstxxl-1.4.1/lib/common/utils.cpp
Examining data/libstxxl-1.4.1/lib/common/verbose.cpp
Examining data/libstxxl-1.4.1/lib/common/exithandler.cpp
Examining data/libstxxl-1.4.1/lib/common/version.cpp
Examining data/libstxxl-1.4.1/lib/common/cmdline.cpp
Examining data/libstxxl-1.4.1/lib/common/rand.cpp
Examining data/libstxxl-1.4.1/lib/common/log.cpp
Examining data/libstxxl-1.4.1/lib/common/seed.cpp
Examining data/libstxxl-1.4.1/lib/mng/disk_allocator.cpp
Examining data/libstxxl-1.4.1/lib/mng/block_manager.cpp
Examining data/libstxxl-1.4.1/lib/mng/config.cpp
Examining data/libstxxl-1.4.1/lib/io/iostats.cpp
Examining data/libstxxl-1.4.1/lib/io/boostfd_file.cpp
Examining data/libstxxl-1.4.1/lib/io/request_queue_impl_qwqr.cpp
Examining data/libstxxl-1.4.1/lib/io/linuxaio_file.cpp
Examining data/libstxxl-1.4.1/lib/io/linuxaio_queue.cpp
Examining data/libstxxl-1.4.1/lib/io/fileperblock_file.cpp
Examining data/libstxxl-1.4.1/lib/io/linuxaio_request.cpp
Examining data/libstxxl-1.4.1/lib/io/request_with_waiters.cpp
Examining data/libstxxl-1.4.1/lib/io/request_queue_impl_1q.cpp
Examining data/libstxxl-1.4.1/lib/io/request_with_state.cpp
Examining data/libstxxl-1.4.1/lib/io/syscall_file.cpp
Examining data/libstxxl-1.4.1/lib/io/create_file.cpp
Examining data/libstxxl-1.4.1/lib/io/wincall_file.cpp
Examining data/libstxxl-1.4.1/lib/io/disk_queued_file.cpp
Examining data/libstxxl-1.4.1/lib/io/ufs_file_base.cpp
Examining data/libstxxl-1.4.1/lib/io/simdisk_file.cpp
Examining data/libstxxl-1.4.1/lib/io/serving_request.cpp
Examining data/libstxxl-1.4.1/lib/io/wbtl_file.cpp
Examining data/libstxxl-1.4.1/lib/io/request_queue_impl_worker.cpp
Examining data/libstxxl-1.4.1/lib/io/mmap_file.cpp
Examining data/libstxxl-1.4.1/lib/io/mem_file.cpp
Examining data/libstxxl-1.4.1/lib/io/file.cpp
Examining data/libstxxl-1.4.1/lib/io/request.cpp
Examining data/libstxxl-1.4.1/lib/io/ufs_platform.h
Examining data/libstxxl-1.4.1/lib/io/wfs_file_base.cpp
Examining data/libstxxl-1.4.1/lib/algo/async_schedule.cpp
Examining data/libstxxl-1.4.1/local/test1.cpp
Examining data/libstxxl-1.4.1/local/test2.cpp
Examining data/libstxxl-1.4.1/tools/benchmark_pqueue.cpp
Examining data/libstxxl-1.4.1/tools/extras/iobench_scatter_in_place.cpp
Examining data/libstxxl-1.4.1/tools/extras/benchmark_disk_and_flash.cpp
Examining data/libstxxl-1.4.1/tools/extras/pq_param.cpp
Examining data/libstxxl-1.4.1/tools/mallinfo.cpp
Examining data/libstxxl-1.4.1/tools/stxxl_tool.cpp
Examining data/libstxxl-1.4.1/tools/benchmark_sort.cpp
Examining data/libstxxl-1.4.1/tools/mlock.cpp
Examining data/libstxxl-1.4.1/tools/create_files.cpp
Examining data/libstxxl-1.4.1/tools/benchmark_disks_random.cpp
Examining data/libstxxl-1.4.1/tools/benchmark_files.cpp
Examining data/libstxxl-1.4.1/tools/benchmarks/pq_benchmark.cpp
Examining data/libstxxl-1.4.1/tools/benchmarks/monotonic_pq.cpp
Examining data/libstxxl-1.4.1/tools/benchmarks/tpie_stack_benchmark.cpp
Examining data/libstxxl-1.4.1/tools/benchmarks/stack_benchmark.cpp
Examining data/libstxxl-1.4.1/tools/benchmarks/benchmark_naive_matrix.cpp
Examining data/libstxxl-1.4.1/tools/benchmarks/matrix_benchmark.cpp
Examining data/libstxxl-1.4.1/tools/benchmarks/berkeley_db_benchmark.cpp
Examining data/libstxxl-1.4.1/tools/benchmarks/app_config.h
Examining data/libstxxl-1.4.1/tools/benchmark_disks.cpp
FINAL RESULTS:
data/libstxxl-1.4.1/include/stxxl/bits/msvc_compatibility.h:28:9: [4] (format) snprintf:
If format strings can be influenced by an attacker, they can be exploited,
and note that sprintf variations do not always \0-terminate (CWE-134). Use
a constant for the format specification.
#define snprintf _snprintf
data/libstxxl-1.4.1/include/stxxl/bits/msvc_compatibility.h:28:18: [4] (format) _snprintf:
If format strings can be influenced by an attacker, they can be exploited,
and note that sprintf variations do not always \0-terminate (CWE-134). Use
a constant for the format specification.
#define snprintf _snprintf
data/libstxxl-1.4.1/examples/containers/deque2.cpp:21:18: [3] (random) random:
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.
unsigned int random, p, x;
data/libstxxl-1.4.1/examples/containers/deque2.cpp:31:29: [3] (random) random:
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.
my_deque.push_front(random);
data/libstxxl-1.4.1/examples/containers/queue2.cpp:24:18: [3] (random) random:
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.
unsigned int random;
data/libstxxl-1.4.1/examples/containers/queue2.cpp:32:23: [3] (random) random:
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.
my_queue.push(random);
data/libstxxl-1.4.1/examples/containers/stack2.cpp:24:28: [3] (random) random:
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.
stxxl::random_number<> random;
data/libstxxl-1.4.1/examples/containers/stack2.cpp:32:26: [3] (random) random:
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.
a_stack.push(random(123456789));
data/libstxxl-1.4.1/include/stxxl/bits/containers/pager.h:31:5: [3] (random) random:
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.
random,
data/libstxxl-1.4.1/lib/common/log.cpp:24:32: [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* log_filename = getenv("STXXLLOGFILE");
data/libstxxl-1.4.1/lib/common/log.cpp:26:35: [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* errlog_filename = getenv("STXXLERRLOGFILE");
data/libstxxl-1.4.1/lib/common/log.cpp:29: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* waitlog_filename = getenv("STXXLWAITLOGFILE");
data/libstxxl-1.4.1/lib/mng/config.cpp:73:28: [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* stxxlcfg = getenv("STXXLCFG");
data/libstxxl-1.4.1/lib/mng/config.cpp:79:28: [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* hostname = getenv("HOSTNAME");
data/libstxxl-1.4.1/lib/mng/config.cpp:80:24: [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* home = getenv("HOME");
data/libstxxl-1.4.1/lib/mng/config.cpp:84:28: [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* hostname = getenv("COMPUTERNAME");
data/libstxxl-1.4.1/lib/mng/config.cpp:85:24: [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* home = getenv("APPDATA");
data/libstxxl-1.4.1/local/test1.cpp:40:32: [3] (random) random:
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.
stxxl::random_number32 random;
data/libstxxl-1.4.1/local/test1.cpp:43:30: [3] (random) random:
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.
vector.push_back(random());
data/libstxxl-1.4.1/local/test2.cpp:42:32: [3] (random) random:
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.
stxxl::random_number32 random;
data/libstxxl-1.4.1/local/test2.cpp:45:25: [3] (random) random:
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.
sorter.push(random() * random());
data/libstxxl-1.4.1/local/test2.cpp:45:36: [3] (random) random:
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.
sorter.push(random() * random());
data/libstxxl-1.4.1/tests/containers/test_sequence.cpp:21:28: [3] (random) random:
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.
stxxl::random_number32 random;
data/libstxxl-1.4.1/tests/containers/test_sequence.cpp:27:26: [3] (random) random:
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.
unsigned curOP = random() % 6;
data/libstxxl-1.4.1/tests/containers/test_sequence.cpp:28:26: [3] (random) random:
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.
unsigned value = random();
data/libstxxl-1.4.1/tools/benchmark_disks_random.cpp:111: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((unsigned int)time(NULL));
data/libstxxl-1.4.1/tools/benchmarks/monotonic_pq.cpp:262: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(5);
data/libstxxl-1.4.1/examples/algo/copy_and_sort_file.cpp:31: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 m_data[128 - sizeof(key_type)];
data/libstxxl-1.4.1/examples/algo/phonebills.cpp:162:41: [2] (integer) atol:
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 stxxl::internal_size_type M = atol(argv[2]) * 1024 * 1024;
data/libstxxl-1.4.1/examples/algo/phonebills_genlog.cpp:70:35: [2] (integer) atol:
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).
stxxl::internal_size_type M = atol(argv[3]) * 1024 * 1024;
data/libstxxl-1.4.1/examples/algo/phonebills_genlog.cpp:72:27: [2] (integer) atol:
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 long av_calls = atol(argv[2]);
data/libstxxl-1.4.1/examples/algo/sort_file.cpp:30: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 m_data[128 - sizeof(key_type)];
data/libstxxl-1.4.1/examples/containers/copy_file.cpp:113:32: [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).
int method = (argc >= 4) ? atoi(argv[3]) : 3;
data/libstxxl-1.4.1/examples/containers/vector_buf.cpp:126: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).
int multi = (argc >= 2 ? atoi(argv[1]) : 64);
data/libstxxl-1.4.1/include/stxxl/bits/common/binary_buffer.h:178: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(m_data, data, len);
data/libstxxl-1.4.1/include/stxxl/bits/common/binary_buffer.h:248: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(m_data + m_size, data, len);
data/libstxxl-1.4.1/include/stxxl/bits/common/binary_buffer.h:549: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(outdata, m_data + m_curr, datalen);
data/libstxxl-1.4.1/include/stxxl/bits/common/external_shared_ptr.h:60: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 data[sizeof(P)];
data/libstxxl-1.4.1/include/stxxl/bits/common/simple_vector.h:148: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((void*)m_array, (void*)tmp,
data/libstxxl-1.4.1/include/stxxl/bits/containers/pq_losertree.h:527: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(target, current[0], length * sizeof(Element));
data/libstxxl-1.4.1/lib/common/log.cpp:25:17: [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).
log_stream_.open(log_filename == NULL ? "stxxl.log" : log_filename);
data/libstxxl-1.4.1/lib/common/log.cpp:27:20: [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).
errlog_stream_.open(errlog_filename == NULL ? "stxxl.errlog" : errlog_filename);
data/libstxxl-1.4.1/lib/common/verbose.cpp:43:9: [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 tstr[23]; /* "[364:23:59:59.999999] " */
data/libstxxl-1.4.1/lib/common/verbose.cpp:57:9: [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 tstr[32];
data/libstxxl-1.4.1/lib/io/boostfd_file.cpp:166:16: [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_file_des.open(filename, boostfd_mode); // also compiles with earlier Boost versions, but differs semantically
data/libstxxl-1.4.1/lib/io/boostfd_file.cpp:168:16: [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_file_des.open(filename, boostfd_mode, boostfd_mode);
data/libstxxl-1.4.1/lib/io/mem_file.cpp:31: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(buffer, m_ptr + offset, bytes);
data/libstxxl-1.4.1/lib/io/mem_file.cpp:36: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(m_ptr + offset, buffer, bytes);
data/libstxxl-1.4.1/lib/io/mem_file.cpp:78: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(m_ptr + offset, uninitialized, STXXL_BLOCK_ALIGN);
data/libstxxl-1.4.1/lib/io/mem_file.cpp:84: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(m_ptr + offset, uninitialized, (size_t)size);
data/libstxxl-1.4.1/lib/io/mmap_file.cpp:55: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(buffer, mem, bytes);
data/libstxxl-1.4.1/lib/io/mmap_file.cpp:59: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(mem, buffer, bytes);
data/libstxxl-1.4.1/lib/io/simdisk_file.cpp:185: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(buffer, mem, bytes);
data/libstxxl-1.4.1/lib/io/simdisk_file.cpp:189: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(mem, buffer, bytes);
data/libstxxl-1.4.1/lib/io/ufs_file_base.cpp:99:23: [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 ((file_des = ::open(filename.c_str(), flags, perms)) >= 0)
data/libstxxl-1.4.1/lib/io/ufs_file_base.cpp:113:27: [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 ((file_des = ::open(filename.c_str(), flags, perms)) >= 0)
data/libstxxl-1.4.1/lib/io/wbtl_file.cpp:218: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(buffer, write_buffer[curbuf] + (physical_offset - buffer_address[curbuf]), bytes);
data/libstxxl-1.4.1/lib/io/wbtl_file.cpp:227: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(buffer, write_buffer[1 - curbuf] + (physical_offset - buffer_address[1 - curbuf]), bytes);
data/libstxxl-1.4.1/lib/io/wbtl_file.cpp:289:5: [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(write_buffer[curbuf] + curpos, buffer, bytes);
data/libstxxl-1.4.1/lib/io/wfs_file_base.cpp:127:9: [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[32768], * part;
data/libstxxl-1.4.1/tests/algo/test_asch.cpp:28:19: [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 int D = atoi(argv[1]);
data/libstxxl-1.4.1/tests/algo/test_asch.cpp:29:19: [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 int L = atoi(argv[2]);
data/libstxxl-1.4.1/tests/algo/test_asch.cpp:30:31: [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 stxxl::int_type m = atoi(argv[3]);
data/libstxxl-1.4.1/tests/algo/test_asch.cpp:31: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).
stxxl::ran32State = atoi(argv[4]);
data/libstxxl-1.4.1/tests/algo/test_bad_cmp.cpp:79:48: [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 stxxl::int_type SIZE = (argc >= 2) ? atoi(argv[1]) : 16;
data/libstxxl-1.4.1/tests/algo/test_ksort.cpp:26: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 m_data[32 - 2 * sizeof(key_type1)];
data/libstxxl-1.4.1/tests/algo/test_ksort_all_parameters.cpp:106:20: [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).
int sort_mem = atoi(argv[2]) * MB;
data/libstxxl-1.4.1/tests/algo/test_ksort_all_parameters.cpp:107:20: [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).
int strategy = atoi(argv[3]);
data/libstxxl-1.4.1/tests/algo/test_ksort_all_parameters.cpp:108: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).
int block_size = atoi(argv[4]);
data/libstxxl-1.4.1/tests/algo/test_parallel_sort.cpp:50: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 m_data[RECORD_SIZE - 2 * sizeof(key_type)];
data/libstxxl-1.4.1/tests/algo/test_parallel_sort.cpp:167:42: [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).
unsigned long megabytes_to_process = atoi(argv[1]);
data/libstxxl-1.4.1/tests/algo/test_parallel_sort.cpp:168:13: [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).
int p = atoi(argv[2]);
data/libstxxl-1.4.1/tests/algo/test_parallel_sort.cpp:169:51: [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).
unsigned_type memory_to_use = (unsigned_type)(atoi(argv[3]) * megabyte);
data/libstxxl-1.4.1/tests/algo/test_sort.cpp:28: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 m_data[RECORD_SIZE - sizeof(key_type)];
data/libstxxl-1.4.1/tests/algo/test_sort_all_parameters.cpp:102:20: [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).
int sort_mem = atoi(argv[2]) * MB;
data/libstxxl-1.4.1/tests/algo/test_sort_all_parameters.cpp:103:20: [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).
int strategy = atoi(argv[3]);
data/libstxxl-1.4.1/tests/algo/test_sort_all_parameters.cpp:104: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).
int block_size = atoi(argv[4]);
data/libstxxl-1.4.1/tests/algo/test_sort_all_parameters.h:21: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 m_data[n];
data/libstxxl-1.4.1/tests/algo/test_stable_ksort.cpp:26: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 m_data[128 - sizeof(key_type)];
data/libstxxl-1.4.1/tests/algo/test_stable_ksort_all_parameters.cpp:105:20: [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).
int sort_mem = atoi(argv[2]) * MB;
data/libstxxl-1.4.1/tests/algo/test_stable_ksort_all_parameters.cpp:106:20: [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).
int strategy = atoi(argv[3]);
data/libstxxl-1.4.1/tests/algo/test_stable_ksort_all_parameters.cpp:107: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).
int block_size = atoi(argv[4]);
data/libstxxl-1.4.1/tests/containers/btree/test_btree.cpp:53:21: [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).
unsigned nins = atoi(argv[1]);
data/libstxxl-1.4.1/tests/containers/btree/test_btree_const_scan.cpp:32: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 filler[24];
data/libstxxl-1.4.1/tests/containers/btree/test_btree_const_scan.cpp:95:27: [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 unsigned nins = atoi(argv[1]);
data/libstxxl-1.4.1/tests/containers/btree/test_btree_insert_erase.cpp:64:26: [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 int log_nins = atoi(argv[1]);
data/libstxxl-1.4.1/tests/containers/btree/test_btree_insert_find.cpp:61:26: [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 int log_nins = atoi(argv[1]);
data/libstxxl-1.4.1/tests/containers/btree/test_btree_insert_scan.cpp:63:26: [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 int log_nins = atoi(argv[1]);
data/libstxxl-1.4.1/tests/containers/test_many_stacks.cpp:34:52: [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).
ext_stack_type* my_stacks = new ext_stack_type[atoi(argv[1])];
data/libstxxl-1.4.1/tests/containers/test_map.cpp:52:33: [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).
int max_mult = (argc > 1) ? atoi(argv[1]) : 256;
data/libstxxl-1.4.1/tests/containers/test_map_random.cpp:96: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).
stxxl::uint64 MAX_STEP = atoi(argv[1]);
data/libstxxl-1.4.1/tests/containers/test_pqueue.cpp:28: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 data[RECORD_SIZE - sizeof(key_type)];
data/libstxxl-1.4.1/tests/containers/test_queue2.cpp:34: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).
stxxl::int64 megabytes = atoi(argv[1]);
data/libstxxl-1.4.1/tests/containers/test_sorter.cpp:26: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 m_data[RECORD_SIZE - sizeof(key_type)];
data/libstxxl-1.4.1/tests/containers/test_stack.cpp:128:31: [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).
simple_test(my_stack, atoi(argv[1]) * 4 * 4096 / sizeof(int));
data/libstxxl-1.4.1/tests/containers/test_stack.cpp:136:31: [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).
simple_test(my_stack, atoi(argv[1]) * 4 * 4096 / sizeof(int));
data/libstxxl-1.4.1/tests/containers/test_stack.cpp:143:28: [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).
size_t test_size = atoi(argv[1]) * 4 * 4096 / sizeof(int);
data/libstxxl-1.4.1/tests/containers/test_vector_buf.cpp:270:29: [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).
int size = (argc > 1) ? atoi(argv[1]) : 16;
data/libstxxl-1.4.1/tests/io/test_io_sizes.cpp:31: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).
unsigned_type max_size = atoi(argv[3]);
data/libstxxl-1.4.1/tests/mng/test_bmlayer.cpp:23: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 chars[5];
data/libstxxl-1.4.1/tests/mng/test_pool_pair.cpp:25: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 chars[5];
data/libstxxl-1.4.1/tests/mng/test_prefetch_pool.cpp:25: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 chars[5];
data/libstxxl-1.4.1/tests/mng/test_read_write_pool.cpp:24: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 chars[5];
data/libstxxl-1.4.1/tests/mng/test_write_pool.cpp:25: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 chars[5];
data/libstxxl-1.4.1/tools/benchmark_pqueue.cpp:53: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 data[MY_TYPE_SIZE - sizeof(uint32_pair_type)];
data/libstxxl-1.4.1/tools/benchmark_sort.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 junk[16 + 32];
data/libstxxl-1.4.1/tools/benchmarks/berkeley_db_benchmark.cpp:74: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 keybuf[KEY_SIZE];
data/libstxxl-1.4.1/tools/benchmarks/berkeley_db_benchmark.cpp:117: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 databuf[DATA_SIZE];
data/libstxxl-1.4.1/tools/benchmarks/berkeley_db_benchmark.cpp:238: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).
db.open(NULL, // Transaction pointer
data/libstxxl-1.4.1/tools/benchmarks/berkeley_db_benchmark.cpp:1003: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).
db.open(NULL, // Transaction pointer
data/libstxxl-1.4.1/tools/benchmarks/berkeley_db_benchmark.cpp:1232:19: [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).
int version = atoi(argv[1]);
data/libstxxl-1.4.1/tools/benchmarks/monotonic_pq.cpp:47: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 data[RECORD_SIZE - 2 * sizeof(key_type)];
data/libstxxl-1.4.1/tools/benchmarks/monotonic_pq.cpp:49: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 data[RECORD_SIZE - sizeof(key_type)];
data/libstxxl-1.4.1/tools/benchmarks/monotonic_pq.cpp:155:31: [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).
unsigned long megabytes = atoi(argv[1]);
data/libstxxl-1.4.1/tools/benchmarks/monotonic_pq.cpp:157: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).
int num_threads = atoi(argv[2]);
data/libstxxl-1.4.1/tools/benchmarks/pq_benchmark.cpp:243:19: [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).
int version = atoi(argv[1]);
data/libstxxl-1.4.1/tools/benchmarks/stack_benchmark.cpp:38: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 data[RECORD_SIZE];
data/libstxxl-1.4.1/tools/benchmarks/stack_benchmark.cpp:192:19: [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).
int variant = atoi(argv[1]);
data/libstxxl-1.4.1/tools/benchmarks/tpie_stack_benchmark.cpp:46: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 data[RECORD_SIZE];
data/libstxxl-1.4.1/tools/benchmarks/tpie_stack_benchmark.cpp:146:19: [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).
int version = atoi(argv[1]);
data/libstxxl-1.4.1/tools/extras/benchmark_disk_and_flash.cpp:99:59: [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).
stxxl::int64 offset = stxxl::int64(GB) * stxxl::int64(atoi(argv[1]));
data/libstxxl-1.4.1/tools/extras/benchmark_disk_and_flash.cpp:100:59: [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).
stxxl::int64 length = stxxl::int64(GB) * stxxl::int64(atoi(argv[2]));
data/libstxxl-1.4.1/tools/extras/iobench_scatter_in_place.cpp:119:21: [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 cfn[4096]; // PATH_MAX
data/libstxxl-1.4.1/tools/stxxl_tool.cpp:141: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 progsub[256];
data/libstxxl-1.4.1/include/stxxl/bits/algo/inmemsort.h:41:29: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[i] = blocks[i].read(*(first.bid() + i));
data/libstxxl-1.4.1/include/stxxl/bits/algo/ksort.h:114:24: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
* req = block->read(bid);
data/libstxxl-1.4.1/include/stxxl/bits/algo/ksort.h:223:35: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
read_reqs[i] = Blocks1[i].read(bids[i]);
data/libstxxl-1.4.1/include/stxxl/bits/algo/ksort.h:370:37: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[j] = blocks[j].read((*runs[irun])[off + j].bid);
data/libstxxl-1.4.1/include/stxxl/bits/algo/ksort.h:762:36: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
req = first_block->read(*first.bid());
data/libstxxl-1.4.1/include/stxxl/bits/algo/ksort.h:767:35: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
req = last_block->read(*last.bid());
data/libstxxl-1.4.1/include/stxxl/bits/algo/ksort.h:809:40: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[0] = first_block->read(first_bid);
data/libstxxl-1.4.1/include/stxxl/bits/algo/ksort.h:810:47: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[1] = sorted_first_block->read((*(out->begin())).bid);
data/libstxxl-1.4.1/include/stxxl/bits/algo/ksort.h:813:39: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[0] = last_block->read(last_bid);
data/libstxxl-1.4.1/include/stxxl/bits/algo/ksort.h:814:46: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[1] = sorted_last_block->read(((*out)[out->size() - 1]).bid);
data/libstxxl-1.4.1/include/stxxl/bits/algo/ksort.h:868:36: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
req = first_block->read(*first.bid());
data/libstxxl-1.4.1/include/stxxl/bits/algo/ksort.h:900:40: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[0] = first_block->read(first_bid);
data/libstxxl-1.4.1/include/stxxl/bits/algo/ksort.h:901:47: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[1] = sorted_first_block->read((*(out->begin())).bid);
data/libstxxl-1.4.1/include/stxxl/bits/algo/ksort.h:946:35: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
req = last_block->read(*last.bid());
data/libstxxl-1.4.1/include/stxxl/bits/algo/ksort.h:975:39: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[0] = last_block->read(last_bid);
data/libstxxl-1.4.1/include/stxxl/bits/algo/ksort.h:976:46: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[1] = sorted_last_block->read(((*out)[out->size() - 1]).bid);
data/libstxxl-1.4.1/include/stxxl/bits/algo/sort.h:60:24: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
* req = block->read(bid);
data/libstxxl-1.4.1/include/stxxl/bits/algo/sort.h:109:36: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
read_reqs1[i] = Blocks1[i].read(bids1[i]);
data/libstxxl-1.4.1/include/stxxl/bits/algo/sort.h:118:36: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
read_reqs2[i] = Blocks2[i].read(bids2[i]);
data/libstxxl-1.4.1/include/stxxl/bits/algo/sort.h:233:37: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[j] = blocks[j].read((*runs[irun])[j + off].bid);
data/libstxxl-1.4.1/include/stxxl/bits/algo/sort.h:712:36: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
req = first_block->read(*first.bid());
data/libstxxl-1.4.1/include/stxxl/bits/algo/sort.h:717:35: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
req = last_block->read(*last.bid());
data/libstxxl-1.4.1/include/stxxl/bits/algo/sort.h:759:40: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[0] = first_block->read(first_bid);
data/libstxxl-1.4.1/include/stxxl/bits/algo/sort.h:760:47: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[1] = sorted_first_block->read((*(out->begin())).bid);
data/libstxxl-1.4.1/include/stxxl/bits/algo/sort.h:765:39: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[0] = last_block->read(last_bid);
data/libstxxl-1.4.1/include/stxxl/bits/algo/sort.h:766:46: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[1] = sorted_last_block->read(((*out)[out->size() - 1]).bid);
data/libstxxl-1.4.1/include/stxxl/bits/algo/sort.h:821:36: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
req = first_block->read(*first.bid());
data/libstxxl-1.4.1/include/stxxl/bits/algo/sort.h:853:40: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[0] = first_block->read(first_bid);
data/libstxxl-1.4.1/include/stxxl/bits/algo/sort.h:854:47: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[1] = sorted_first_block->read((*(out->begin())).bid);
data/libstxxl-1.4.1/include/stxxl/bits/algo/sort.h:901:35: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
req = last_block->read(*last.bid());
data/libstxxl-1.4.1/include/stxxl/bits/algo/sort.h:930:39: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[0] = last_block->read(last_bid);
data/libstxxl-1.4.1/include/stxxl/bits/algo/sort.h:931:46: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[1] = sorted_last_block->read(((*out)[out->size() - 1]).bid);
data/libstxxl-1.4.1/include/stxxl/bits/algo/stable_ksort.h:324:26: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
req = block->read(*first.bid());
data/libstxxl-1.4.1/include/stxxl/bits/algo/stable_ksort.h:343:35: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs1[i] = blocks1[i].read(bucket_bids[0][i]);
data/libstxxl-1.4.1/include/stxxl/bits/algo/stable_ksort.h:347:35: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs2[i] = blocks2[i].read(bucket_bids[1][i]);
data/libstxxl-1.4.1/include/stxxl/bits/algo/stable_ksort.h:423:43: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs1[i] = blocks1[i].read(bucket_bids[bucket2submit][i]);
data/libstxxl-1.4.1/include/stxxl/bits/algo/stable_ksort.h:444:38: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
request_ptr req = block->read(*last.bid());
data/libstxxl-1.4.1/include/stxxl/bits/common/binary_buffer.h:546:28: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
inline binary_reader & read(void* outdata, size_t datalen)
data/libstxxl-1.4.1/include/stxxl/bits/common/binary_buffer.h:557:24: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
inline std::string read(size_t datalen)
data/libstxxl-1.4.1/include/stxxl/bits/common/binary_buffer.h:630:16: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
return read(len);
data/libstxxl-1.4.1/include/stxxl/bits/containers/btree/btree.h:1114:41: [1] (buffer) equal:
Function does not check the second iterator for over-read conditions
(CWE-126). This function is often discouraged by most C++ coding standards
in favor of its safer alternatives provided since C++14. Consider using a
form of this function that checks the second iterator before potentially
overflowing it.
return a.size() == b.size() && std::equal(a.begin(), a.end(), b.begin());
data/libstxxl-1.4.1/include/stxxl/bits/containers/btree/leaf.h:246:36: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
request_ptr req = m_block->read(bid);
data/libstxxl-1.4.1/include/stxxl/bits/containers/btree/leaf.h:254:25: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
return m_block->read(bid);
data/libstxxl-1.4.1/include/stxxl/bits/containers/btree/node.h:271:36: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
request_ptr req = m_block->read(bid);
data/libstxxl-1.4.1/include/stxxl/bits/containers/btree/node.h:279:25: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
return m_block->read(bid);
data/libstxxl-1.4.1/include/stxxl/bits/containers/deque.h:699:17: [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(a.begin(), a.end(), b.begin());
data/libstxxl-1.4.1/include/stxxl/bits/containers/hash_map/block_cache.h:342:48: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs_[i_block] = blocks_[i_block]->read(bid);
data/libstxxl-1.4.1/include/stxxl/bits/containers/hash_map/block_cache.h:423:50: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
request_ptr req = ((*block)[i_subblock]).read(subblock_bid);
data/libstxxl-1.4.1/include/stxxl/bits/containers/hash_map/block_cache.h:467:44: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs_[i_block] = blocks_[i_block]->read(bid);
data/libstxxl-1.4.1/include/stxxl/bits/containers/pq_ext_merger.h:244:35: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
merger->pool->read(block, bid)->wait();
data/libstxxl-1.4.1/include/stxxl/bits/containers/pq_ext_merger.h:712:31: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
pool->read(state.block, bid)->wait();
data/libstxxl-1.4.1/include/stxxl/bits/containers/queue.h:322:37: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
request_ptr req = pool->read(front_block, bids.front());
data/libstxxl-1.4.1/include/stxxl/bits/containers/sequence.h:411:39: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
request_ptr req = m_pool->read(m_front_block, m_bids.front());
data/libstxxl-1.4.1/include/stxxl/bits/containers/sequence.h:470:39: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
request_ptr req = m_pool->read(m_back_block, m_bids.back());
data/libstxxl-1.4.1/include/stxxl/bits/containers/sequence.h:659:54: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
request_ptr req = m_sequence.m_pool->read(m_current_block, *m_next_bid);
data/libstxxl-1.4.1/include/stxxl/bits/containers/sequence.h:790:54: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
request_ptr req = m_sequence.m_pool->read(m_current_block, *m_next_bid);
data/libstxxl-1.4.1/include/stxxl/bits/containers/stack.h:260:53: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
requests[i] = (front_page + i)->read(*(--cur_bid));
data/libstxxl-1.4.1/include/stxxl/bits/containers/stack.h:516:58: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
requests[i] = (overlap_buffers + i)->read(*(--cur_bid));
data/libstxxl-1.4.1/include/stxxl/bits/containers/stack.h:756:19: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
pool->read(cache, last_block)->wait();
data/libstxxl-1.4.1/include/stxxl/bits/containers/vector.h:1611:37: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[j] = (*m_cache)[i].read(m_bids[block_no]);
data/libstxxl-1.4.1/include/stxxl/bits/containers/vector.h:1793:41: [1] (buffer) equal:
Function does not check the second iterator for over-read conditions
(CWE-126). This function is often discouraged by most C++ coding standards
in favor of its safer alternatives provided since C++14. Consider using a
form of this function that checks the second iterator before potentially
overflowing it.
return a.size() == b.size() && std::equal(a.begin(), a.end(), b.begin());
data/libstxxl-1.4.1/include/stxxl/bits/mng/block_prefetcher.h:145:44: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
read_reqs[i] = read_buffers[i].read(
data/libstxxl-1.4.1/include/stxxl/bits/mng/block_prefetcher.h:183:56: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
read_reqs[ibuffer] = read_buffers[ibuffer].read(
data/libstxxl-1.4.1/include/stxxl/bits/mng/block_scheduler.h:148:31: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
return internal_data->read(external_data, on_cmpl);
data/libstxxl-1.4.1/include/stxxl/bits/mng/prefetch_pool.h:132:38: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
request_ptr req = block->read(bid);
data/libstxxl-1.4.1/include/stxxl/bits/mng/prefetch_pool.h:163:38: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
request_ptr req = block->read(bid);
data/libstxxl-1.4.1/include/stxxl/bits/mng/prefetch_pool.h:200:17: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
request_ptr read(block_type*& block, bid_type bid)
data/libstxxl-1.4.1/include/stxxl/bits/mng/prefetch_pool.h:207:27: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
return block->read(bid);
data/libstxxl-1.4.1/include/stxxl/bits/mng/prefetch_pool.h:220:17: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
request_ptr read(block_type*& block, bid_type bid, write_pool<block_type>& w_pool)
data/libstxxl-1.4.1/include/stxxl/bits/mng/prefetch_pool.h:249:23: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
return block->read(bid);
data/libstxxl-1.4.1/include/stxxl/bits/mng/read_write_pool.h:149:17: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
request_ptr read(block_type*& block, bid_type bid)
data/libstxxl-1.4.1/include/stxxl/bits/mng/read_write_pool.h:151:24: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
return p_pool->read(block, bid, *w_pool);
data/libstxxl-1.4.1/include/stxxl/bits/mng/typed_block.h:295:17: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
request_ptr read(const bid_type& bid,
data/libstxxl-1.4.1/include/stxxl/bits/stream/sort_stream.h:888:33: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[j] = blocks[j].read(sruns->runs[irun][j].bid);
data/libstxxl-1.4.1/lib/io/boostfd_file.cpp:57:45: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
std::streamsize rc = m_file_des.read((char*)buffer, bytes);
data/libstxxl-1.4.1/lib/io/simdisk_file.cpp:205:5: [1] (obsolete) usleep:
This C routine is considered obsolete (as opposed to the shell command by
the same name). The interaction of this function with SIGALRM and other
timer functions such as sleep(), alarm(), setitimer(), and nanosleep() is
unspecified (CWE-676). Use nanosleep(2) or setitimer(2) instead.
usleep((useconds_t)((delay - seconds_to_wait) * 1000000.));
data/libstxxl-1.4.1/lib/io/syscall_file.cpp:57:25: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if ((rc = ::read(file_des, cbuffer, (unsigned int)bytes)) <= 0)
data/libstxxl-1.4.1/lib/io/syscall_file.cpp:59:25: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
if ((rc = ::read(file_des, cbuffer, bytes)) <= 0)
data/libstxxl-1.4.1/tests/containers/hash_map/test_hash_map_reader_writer.cpp:61:45: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
stxxl::request_ptr req = block->read(bids[i_block]);
data/libstxxl-1.4.1/tests/containers/hash_map/test_hash_map_reader_writer.cpp:128:45: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
stxxl::request_ptr req = block->read(bids[i_block]);
data/libstxxl-1.4.1/tests/containers/test_deque.cpp:102: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.
STXXL_CHECK(std::equal(XXLDeque.begin(), XXLDeque.end(), STDDeque.begin() _STXXL_FORCE_SEQUENTIAL));
data/libstxxl-1.4.1/tests/mng/test_block_manager.cpp:71:26: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[i] = block->read(bids[i], my_handler());
data/libstxxl-1.4.1/tests/mng/test_block_scheduler.cpp:221:13: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
int_bl->read(ext_bl)->wait();
data/libstxxl-1.4.1/tests/mng/test_bmlayer.cpp:64:26: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[i] = block->read(bids[i], my_handler());
data/libstxxl-1.4.1/tests/mng/test_bmlayer.cpp:109:10: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
pool.read(blk, bid)->wait();
data/libstxxl-1.4.1/tests/mng/test_pool_pair.cpp:56:16: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
p_pool.read(blk, bid)->wait();
data/libstxxl-1.4.1/tests/mng/test_pool_pair.cpp:69:16: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
p_pool.read(blk, bid)->wait();
data/libstxxl-1.4.1/tests/mng/test_pool_pair.cpp:101:16: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
p_pool.read(blk, bid)->wait();
data/libstxxl-1.4.1/tests/mng/test_pool_pair.cpp:133:16: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
p_pool.read(blk, bid)->wait();
data/libstxxl-1.4.1/tests/mng/test_prefetch_pool.cpp:47:10: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
pool.read(blk, bids[0])->wait();
data/libstxxl-1.4.1/tests/mng/test_prefetch_pool.cpp:48:10: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
pool.read(blk, bids[1])->wait();
data/libstxxl-1.4.1/tests/mng/test_read_write_pool.cpp:53:14: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
pool.read(blk, bid)->wait();
data/libstxxl-1.4.1/tests/mng/test_read_write_pool.cpp:66:14: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
pool.read(blk, bid)->wait();
data/libstxxl-1.4.1/tests/mng/test_read_write_pool.cpp:96:14: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
pool.read(blk, bid)->wait();
data/libstxxl-1.4.1/tests/mng/test_read_write_pool.cpp:126:14: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
pool.read(blk, bid)->wait();
data/libstxxl-1.4.1/tools/benchmark_disks.cpp:140:41: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[j] = buffer[j].read(blocks[num_total_blocks + j]);
data/libstxxl-1.4.1/tools/benchmark_disks_random.cpp:118:35: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
reqs[j] = buffer->read(blocks[j], print_number(j));
data/libstxxl-1.4.1/tools/benchmark_files.cpp:64:9: [1] (obsolete) usleep:
This C routine is considered obsolete (as opposed to the shell command by
the same name). The interaction of this function with SIGALRM and other
timer functions such as sleep(), alarm(), setitimer(), and nanosleep() is
unspecified (CWE-676). Use nanosleep(2) or setitimer(2) instead.
usleep(POLL_DELAY);
data/libstxxl-1.4.1/tools/create_files.cpp:60:9: [1] (obsolete) usleep:
This C routine is considered obsolete (as opposed to the shell command by
the same name). The interaction of this function with SIGALRM and other
timer functions such as sleep(), alarm(), setitimer(), and nanosleep() is
unspecified (CWE-676). Use nanosleep(2) or setitimer(2) instead.
usleep(POLL_DELAY);
data/libstxxl-1.4.1/tools/stxxl_tool.cpp:117:44: [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).
shortlen = std::max(shortlen, (int)strlen(subtools[i].name));
ANALYSIS SUMMARY:
Hits = 224
Lines analyzed = 72010 in approximately 1.54 seconds (46614 lines/second)
Physical Source Lines of Code (SLOC) = 49162
Hits@level = [0] 7 [1] 100 [2] 97 [3] 25 [4] 2 [5] 0
Hits@level+ = [0+] 231 [1+] 224 [2+] 124 [3+] 27 [4+] 2 [5+] 0
Hits/KSLOC@level+ = [0+] 4.69875 [1+] 4.55636 [2+] 2.52227 [3+] 0.549205 [4+] 0.0406818 [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.