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/tiledarray-0.6.0/examples/cc/ccd.cpp
Examining data/tiledarray-0.6.0/examples/cc/ccsd.cpp
Examining data/tiledarray-0.6.0/examples/cc/input_data.cpp
Examining data/tiledarray-0.6.0/examples/cc/input_data.h
Examining data/tiledarray-0.6.0/examples/demo/demo.cpp
Examining data/tiledarray-0.6.0/examples/dgemm/blas.cpp
Examining data/tiledarray-0.6.0/examples/dgemm/eigen.cpp
Examining data/tiledarray-0.6.0/examples/dgemm/ta_asymm_dense.cpp
Examining data/tiledarray-0.6.0/examples/dgemm/ta_band.cpp
Examining data/tiledarray-0.6.0/examples/dgemm/ta_cc_abcd.cpp
Examining data/tiledarray-0.6.0/examples/dgemm/ta_dense.cpp
Examining data/tiledarray-0.6.0/examples/dgemm/ta_dense_new_tile.cpp
Examining data/tiledarray-0.6.0/examples/dgemm/ta_dense_nonuniform.cpp
Examining data/tiledarray-0.6.0/examples/dgemm/ta_elem_dense.cpp
Examining data/tiledarray-0.6.0/examples/dgemm/ta_sparse.cpp
Examining data/tiledarray-0.6.0/examples/dgemm/ta_sparse_grow.cpp
Examining data/tiledarray-0.6.0/examples/fock/ta_k_build.cpp
Examining data/tiledarray-0.6.0/examples/mpi_tests/mpi_bandwidth.c
Examining data/tiledarray-0.6.0/examples/mpi_tests/mpi_latency.c
Examining data/tiledarray-0.6.0/examples/pmap_test/pmap.cpp
Examining data/tiledarray-0.6.0/examples/vector_tests/vector.cpp
Examining data/tiledarray-0.6.0/src/TiledArray/algebra/conjgrad.h
Examining data/tiledarray-0.6.0/src/TiledArray/algebra/diis.h
Examining data/tiledarray-0.6.0/src/TiledArray/algebra/utils.h
Examining data/tiledarray-0.6.0/src/TiledArray/array_impl.cpp
Examining data/tiledarray-0.6.0/src/TiledArray/array_impl.h
Examining data/tiledarray-0.6.0/src/TiledArray/bitset.h
Examining data/tiledarray-0.6.0/src/TiledArray/block_range.h
Parsing failed to find end of parameter list; semicolon terminated it in (lower_bound.begin(), lower_bound.end(), range.lobound_data(),
[](const size_type l, const size_type r) { return l >= r; }));
TA_ASSERT(std::equal(upper_bound.begin(), upper_bound.end(
Parsing failed to find end of parameter list; semicolon terminated it in (upper_bound.begin(), upper_bound.end(), lower_bound.begin(),
[](const size_type l, const size_type r) { return l > r; }));
TA_ASSERT(std::equal(upper_bound.begin(), upper_bound.end(),
Parsing failed to find end of parameter list; semicolon terminated it in (upper_bound.begin(), upper_bound.end(), range.upbound_data(),
[](const size_type l, const size_type r) { return l <= r; }));
// Initialize the block range data members
data_ =
Examining data/tiledarray-0.6.0/src/TiledArray/conversions/clone.h
Examining data/tiledarray-0.6.0/src/TiledArray/conversions/dense_to_sparse.h
Examining data/tiledarray-0.6.0/src/TiledArray/conversions/eigen.h
Examining data/tiledarray-0.6.0/src/TiledArray/conversions/foreach.h
Examining data/tiledarray-0.6.0/src/TiledArray/conversions/make_array.h
Examining data/tiledarray-0.6.0/src/TiledArray/conversions/sparse_to_dense.h
Examining data/tiledarray-0.6.0/src/TiledArray/conversions/to_new_tile_type.h
Examining data/tiledarray-0.6.0/src/TiledArray/conversions/truncate.h
Examining data/tiledarray-0.6.0/src/TiledArray/dense_shape.h
Examining data/tiledarray-0.6.0/src/TiledArray/dist_array.cpp
Examining data/tiledarray-0.6.0/src/TiledArray/dist_array.h
Examining data/tiledarray-0.6.0/src/TiledArray/dist_eval/array_eval.h
Examining data/tiledarray-0.6.0/src/TiledArray/dist_eval/binary_eval.h
Examining data/tiledarray-0.6.0/src/TiledArray/dist_eval/contraction_eval.h
Examining data/tiledarray-0.6.0/src/TiledArray/dist_eval/dist_eval.h
Examining data/tiledarray-0.6.0/src/TiledArray/dist_eval/unary_eval.h
Examining data/tiledarray-0.6.0/src/TiledArray/distributed_storage.h
Examining data/tiledarray-0.6.0/src/TiledArray/elemental.h
Examining data/tiledarray-0.6.0/src/TiledArray/error.h
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/add_engine.h
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/add_expr.h
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/binary_engine.h
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/binary_expr.h
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/blk_tsr_engine.h
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/blk_tsr_expr.h
Parsing failed to find end of parameter list; semicolon terminated it in (std::begin(lower_bound_), std::end(lower_bound_),
array_.trange().tiles_range().lobound_data(),
[] (std::size_t l, std::size_t r) { return l >= r; });
Parsing failed to find end of parameter list; semicolon terminated it in (std::begin(upper_bound_), std::end(upper_bound_),
array_.trange().tiles_range().upbound_data(),
[] (std::size_t l, std::size_t r) { return l <= r; });
Parsing failed to find end of parameter list; semicolon terminated it in (std::begin(lower_bound_), std::end(lower_bound_),
std::begin(upper_bound_),
[] (std::size_t l, std::size_t r) { return l < r; });
if(! lower_upper_boun
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/cont_engine.h
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/expr.h
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/expr_engine.h
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/expr_trace.h
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/leaf_engine.h
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/mult_engine.h
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/mult_expr.h
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/scal_engine.h
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/scal_expr.h
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/scal_tsr_engine.h
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/scal_tsr_expr.h
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/subt_engine.h
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/subt_expr.h
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/tsr_engine.h
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/tsr_expr.h
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/unary_engine.h
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/unary_expr.h
Examining data/tiledarray-0.6.0/src/TiledArray/expressions/variable_list.h
Examining data/tiledarray-0.6.0/src/TiledArray/madness.h
Examining data/tiledarray-0.6.0/src/TiledArray/math/blas.h
Examining data/tiledarray-0.6.0/src/TiledArray/math/eigen.h
Examining data/tiledarray-0.6.0/src/TiledArray/math/gemm_helper.h
Examining data/tiledarray-0.6.0/src/TiledArray/math/outer.h
Examining data/tiledarray-0.6.0/src/TiledArray/math/parallel_gemm.h
Examining data/tiledarray-0.6.0/src/TiledArray/math/partial_reduce.h
Examining data/tiledarray-0.6.0/src/TiledArray/math/transpose.h
Examining data/tiledarray-0.6.0/src/TiledArray/math/vector_op.h
Examining data/tiledarray-0.6.0/src/TiledArray/perm_index.h
Examining data/tiledarray-0.6.0/src/TiledArray/permutation.h
Examining data/tiledarray-0.6.0/src/TiledArray/pmap/blocked_pmap.h
Examining data/tiledarray-0.6.0/src/TiledArray/pmap/cyclic_pmap.h
Examining data/tiledarray-0.6.0/src/TiledArray/pmap/hash_pmap.h
Examining data/tiledarray-0.6.0/src/TiledArray/pmap/pmap.h
Examining data/tiledarray-0.6.0/src/TiledArray/pmap/replicated_pmap.h
Examining data/tiledarray-0.6.0/src/TiledArray/policies/dense_policy.h
Examining data/tiledarray-0.6.0/src/TiledArray/policies/sparse_policy.h
Examining data/tiledarray-0.6.0/src/TiledArray/proc_grid.h
Examining data/tiledarray-0.6.0/src/TiledArray/range.h
Examining data/tiledarray-0.6.0/src/TiledArray/range_iterator.h
Examining data/tiledarray-0.6.0/src/TiledArray/reduce_task.h
Examining data/tiledarray-0.6.0/src/TiledArray/replicator.h
Examining data/tiledarray-0.6.0/src/TiledArray/shape.h
Examining data/tiledarray-0.6.0/src/TiledArray/size_array.h
Examining data/tiledarray-0.6.0/src/TiledArray/sparse_shape.cpp
Examining data/tiledarray-0.6.0/src/TiledArray/sparse_shape.h
Examining data/tiledarray-0.6.0/src/TiledArray/symm/irrep.h
Examining data/tiledarray-0.6.0/src/TiledArray/symm/permutation.h
Examining data/tiledarray-0.6.0/src/TiledArray/symm/permutation_group.h
Examining data/tiledarray-0.6.0/src/TiledArray/symm/representation.h
Examining data/tiledarray-0.6.0/src/TiledArray/tensor.h
Examining data/tiledarray-0.6.0/src/TiledArray/tensor/complex.h
Examining data/tiledarray-0.6.0/src/TiledArray/tensor/kernels.h
Examining data/tiledarray-0.6.0/src/TiledArray/tensor/operators.h
Examining data/tiledarray-0.6.0/src/TiledArray/tensor/permute.h
Examining data/tiledarray-0.6.0/src/TiledArray/tensor/shift_wrapper.h
Examining data/tiledarray-0.6.0/src/TiledArray/tensor/tensor.cpp
Examining data/tiledarray-0.6.0/src/TiledArray/tensor/tensor.h
Examining data/tiledarray-0.6.0/src/TiledArray/tensor/tensor_interface.h
Examining data/tiledarray-0.6.0/src/TiledArray/tensor/tensor_map.h
Examining data/tiledarray-0.6.0/src/TiledArray/tensor/type_traits.h
Examining data/tiledarray-0.6.0/src/TiledArray/tensor/utility.h
Examining data/tiledarray-0.6.0/src/TiledArray/tensor_impl.cpp
Examining data/tiledarray-0.6.0/src/TiledArray/tensor_impl.h
Examining data/tiledarray-0.6.0/src/TiledArray/tile.h
Examining data/tiledarray-0.6.0/src/TiledArray/tile_op/add.h
Examining data/tiledarray-0.6.0/src/TiledArray/tile_op/binary_reduction.h
Examining data/tiledarray-0.6.0/src/TiledArray/tile_op/binary_wrapper.h
Examining data/tiledarray-0.6.0/src/TiledArray/tile_op/contract_reduce.h
Examining data/tiledarray-0.6.0/src/TiledArray/tile_op/mult.h
Examining data/tiledarray-0.6.0/src/TiledArray/tile_op/neg.h
Examining data/tiledarray-0.6.0/src/TiledArray/tile_op/noop.h
Examining data/tiledarray-0.6.0/src/TiledArray/tile_op/reduce_wrapper.h
Examining data/tiledarray-0.6.0/src/TiledArray/tile_op/scal.h
Examining data/tiledarray-0.6.0/src/TiledArray/tile_op/shift.h
Examining data/tiledarray-0.6.0/src/TiledArray/tile_op/subt.h
Examining data/tiledarray-0.6.0/src/TiledArray/tile_op/tile_interface.h
Examining data/tiledarray-0.6.0/src/TiledArray/tile_op/unary_reduction.h
Examining data/tiledarray-0.6.0/src/TiledArray/tile_op/unary_wrapper.h
Examining data/tiledarray-0.6.0/src/TiledArray/tiled_range.h
Examining data/tiledarray-0.6.0/src/TiledArray/tiled_range1.h
Examining data/tiledarray-0.6.0/src/TiledArray/transform_iterator.h
Examining data/tiledarray-0.6.0/src/TiledArray/type_traits.h
Examining data/tiledarray-0.6.0/src/TiledArray/utility.h
Examining data/tiledarray-0.6.0/src/TiledArray/val_array.h
Examining data/tiledarray-0.6.0/src/TiledArray/zero_tensor.h
Examining data/tiledarray-0.6.0/src/tiledarray.h
Examining data/tiledarray-0.6.0/src/tiledarray_fwd.h
Examining data/tiledarray-0.6.0/tests/array_fixture.h
Examining data/tiledarray-0.6.0/tests/array_impl.cpp
Examining data/tiledarray-0.6.0/tests/bitset.cpp
Examining data/tiledarray-0.6.0/tests/block_range.cpp
Parsing failed to find end of parameter list; semicolon terminated it in (lower.begin(), lower.end(), upper.begin(),
[] (std::size_t l, std::size_t r0) { return l < r0; })) {
// Check that the sub-block is constructed without exceptions
BOOST_CHE
Parsing failed to find end of parameter list; semicolon terminated it in (lower.begin(), lower.end(), upper.begin(),
[] (std::size_t l, std::size_t r) { return l < r; })) {
// Check that the sub-block is constructed without exceptions
BOOST_CHECK
Examining data/tiledarray-0.6.0/tests/blocked_pmap.cpp
Examining data/tiledarray-0.6.0/tests/cyclic_pmap.cpp
Examining data/tiledarray-0.6.0/tests/dense_shape.cpp
Examining data/tiledarray-0.6.0/tests/dist_array.cpp
Examining data/tiledarray-0.6.0/tests/dist_eval_array_eval.cpp
Examining data/tiledarray-0.6.0/tests/dist_eval_binary_eval.cpp
Examining data/tiledarray-0.6.0/tests/dist_eval_contraction_eval.cpp
Examining data/tiledarray-0.6.0/tests/dist_eval_unary_eval.cpp
Examining data/tiledarray-0.6.0/tests/dist_op_communicator.cpp
Examining data/tiledarray-0.6.0/tests/dist_op_dist_cache.cpp
Examining data/tiledarray-0.6.0/tests/dist_op_group.cpp
Examining data/tiledarray-0.6.0/tests/distributed_storage.cpp
Examining data/tiledarray-0.6.0/tests/eigen.cpp
Examining data/tiledarray-0.6.0/tests/elemental.cpp
Examining data/tiledarray-0.6.0/tests/expressions.cpp
Examining data/tiledarray-0.6.0/tests/global_fixture.h
Examining data/tiledarray-0.6.0/tests/hash_pmap.cpp
Examining data/tiledarray-0.6.0/tests/iteration_test.h
Examining data/tiledarray-0.6.0/tests/math_blas.cpp
Examining data/tiledarray-0.6.0/tests/math_outer.cpp
Examining data/tiledarray-0.6.0/tests/math_partial_reduce.cpp
Examining data/tiledarray-0.6.0/tests/math_transpose.cpp
Examining data/tiledarray-0.6.0/tests/perm_index.cpp
Examining data/tiledarray-0.6.0/tests/permutation.cpp
Examining data/tiledarray-0.6.0/tests/proc_grid.cpp
Examining data/tiledarray-0.6.0/tests/range.cpp
Examining data/tiledarray-0.6.0/tests/range_fixture.h
Examining data/tiledarray-0.6.0/tests/reduce_task.cpp
Examining data/tiledarray-0.6.0/tests/replicated_pmap.cpp
Examining data/tiledarray-0.6.0/tests/sparse_shape.cpp
Examining data/tiledarray-0.6.0/tests/sparse_shape_fixture.h
Examining data/tiledarray-0.6.0/tests/symm_irrep.cpp
Examining data/tiledarray-0.6.0/tests/symm_permutation_group.cpp
Examining data/tiledarray-0.6.0/tests/symm_representation.cpp
Examining data/tiledarray-0.6.0/tests/ta_test.cpp
Examining data/tiledarray-0.6.0/tests/tensor.cpp
Examining data/tiledarray-0.6.0/tests/tensor_fixture.h
Examining data/tiledarray-0.6.0/tests/tensor_impl.cpp
Examining data/tiledarray-0.6.0/tests/tensor_of_tensor.cpp
Examining data/tiledarray-0.6.0/tests/tensor_shift_wrapper.cpp
Examining data/tiledarray-0.6.0/tests/tensor_tensor_view.cpp
Parsing failed to find end of parameter list; semicolon terminated it in (lower.begin(), lower.end(), upper.begin(),
[] (std::size_t l, std::size_t r) { return l < r; })) {
// Check that the sub-block is constructed without exceptions
BOOST_CHECK
Parsing failed to find end of parameter list; semicolon terminated it in (lower.begin(), lower.end(), upper.begin(),
[] (std::size_t l, std::size_t r) { return l < r; })) {
// Check that the sub-block is constructed without exceptions
BOOST_CHECK
Parsing failed to find end of parameter list; semicolon terminated it in (lower.begin(), lower.end(), upper.begin(),
[] (std::size_t l, std::size_t r) { return l < r; })) {
TensorView<int> view = t.block(lower,upper);
Tensor<int> tensor = random_
Parsing failed to find end of parameter list; semicolon terminated it in (lower.begin(), lower.end(), upper.begin(),
[] (std::size_t l, std::size_t r) { return l < r; })) {
TensorView<int> view = t.block(lower,upper);
BOOST_CHECK_NO_THROW(Tensor<
Parsing failed to find end of parameter list; semicolon terminated it in (lower.begin(), lower.end(), upper.begin(),
[] (std::size_t l, std::size_t r) { return l < r; })) {
TensorView<int> view = t.block(lower,upper);
Tensor<int> tensor(Range(low
Parsing failed to find end of parameter list; semicolon terminated it in (lower.begin(), lower.end(), upper.begin(),
[] (std::size_t l, std::size_t r) { return l < r; })) {
// Check that the sub-block is constructed without exceptions
TensorView<
Parsing failed to find end of parameter list; semicolon terminated it in (lower.begin(), lower.end(), upper.begin(),
[] (std::size_t l, std::size_t r) { return l < r; })) {
// Check that the sub-block is constructed without exceptions
BOOST_CHECK
Parsing failed to find end of parameter list; semicolon terminated it in (lower.begin(), lower.end(), upper.begin(),
[] (std::size_t l, std::size_t r) { return l < r; })) {
// Check that the sub-block is constructed without exceptions
TensorView<
Parsing failed to find end of parameter list; semicolon terminated it in (lower.begin(), lower.end(), upper.begin(),
[] (std::size_t l, std::size_t r) { return l < r; })) {
// Check that the sub-block is constructed without exceptions
TensorView<
Examining data/tiledarray-0.6.0/tests/tile_op_add.cpp
Examining data/tiledarray-0.6.0/tests/tile_op_contract_reduce.cpp
Examining data/tiledarray-0.6.0/tests/tile_op_mult.cpp
Examining data/tiledarray-0.6.0/tests/tile_op_neg.cpp
Examining data/tiledarray-0.6.0/tests/tile_op_noop.cpp
Examining data/tiledarray-0.6.0/tests/tile_op_scal.cpp
Examining data/tiledarray-0.6.0/tests/tile_op_scal_add.cpp
Examining data/tiledarray-0.6.0/tests/tile_op_scal_mult.cpp
Examining data/tiledarray-0.6.0/tests/tile_op_scal_subt.cpp
Examining data/tiledarray-0.6.0/tests/tile_op_subt.cpp
Examining data/tiledarray-0.6.0/tests/transform_iterator.cpp
Examining data/tiledarray-0.6.0/tests/utility.cpp
Examining data/tiledarray-0.6.0/tests/variable_list.cpp
Examining data/tiledarray-0.6.0/tests/tiled_range1.cpp
Examining data/tiledarray-0.6.0/tests/tiled_range.cpp
FINAL RESULTS:
data/tiledarray-0.6.0/examples/dgemm/ta_sparse.cpp:188:13: [4] (format) printf:
If format strings can be influenced by an attacker, they can be exploited
(CWE-134). Use a constant for the format specification.
printf(ss.str().c_str());
data/tiledarray-0.6.0/src/TiledArray/dist_eval/contraction_eval.h:383:9: [4] (format) printf:
If format strings can be influenced by an attacker, they can be exploited
(CWE-134). Use a constant for the format specification.
printf(ss.str().c_str());
data/tiledarray-0.6.0/src/TiledArray/dist_eval/contraction_eval.h:639:9: [4] (format) printf:
If format strings can be influenced by an attacker, they can be exploited
(CWE-134). Use a constant for the format specification.
printf(ss.str().c_str());
data/tiledarray-0.6.0/src/TiledArray/dist_eval/contraction_eval.h:706:9: [4] (format) printf:
If format strings can be influenced by an attacker, they can be exploited
(CWE-134). Use a constant for the format specification.
printf(ss.str().c_str());
data/tiledarray-0.6.0/src/TiledArray/dist_eval/contraction_eval.h:809:9: [4] (format) printf:
If format strings can be influenced by an attacker, they can be exploited
(CWE-134). Use a constant for the format specification.
printf(ss.str().c_str());
data/tiledarray-0.6.0/examples/dgemm/ta_dense_nonuniform.cpp:63:11: [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.
world.srand(42);
data/tiledarray-0.6.0/examples/dgemm/ta_sparse.cpp:123:17: [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.
world.srand(time(NULL));
data/tiledarray-0.6.0/examples/dgemm/ta_sparse_grow.cpp:114:17: [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.
world.srand(time(NULL));
data/tiledarray-0.6.0/src/TiledArray/dist_eval/contraction_eval.h:115:34: [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* max_memory = getenv("TA_SUMMA_MAX_MEMORY");
data/tiledarray-0.6.0/src/TiledArray/dist_eval/contraction_eval.h:150:33: [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* max_depth = getenv("TA_SUMMA_MAX_DEPTH");
data/tiledarray-0.6.0/tests/bitset.cpp:365:25: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/bitset.cpp:531:25: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/bitset.cpp:565:25: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/bitset.cpp:598:25: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/bitset.cpp:632:25: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/bitset.cpp:665:25: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/bitset.cpp:685:25: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/bitset.cpp:701:25: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/eigen.cpp:52:25: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/eigen.cpp:81:25: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/eigen.cpp:128:25: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/eigen.cpp:211:27: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/eigen.cpp:243:27: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/eigen.cpp:285:27: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/eigen.cpp:314:27: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/elemental.cpp:62:25: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/elemental.cpp:85:25: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/expressions.cpp:86:27: [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.
GlobalFixture::world->srand(seed);
data/tiledarray-0.6.0/tests/math_blas.cpp:41:27: [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.
GlobalFixture::world->srand(seed);
data/tiledarray-0.6.0/tests/math_outer.cpp:44:27: [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.
GlobalFixture::world->srand(seed);
data/tiledarray-0.6.0/tests/math_outer.cpp:51:27: [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.
GlobalFixture::world->srand(seed);
data/tiledarray-0.6.0/tests/math_partial_reduce.cpp:43:27: [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.
GlobalFixture::world->srand(seed);
data/tiledarray-0.6.0/tests/math_transpose.cpp:49:25: [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.
GlobalFixture::world->srand(1764);
data/tiledarray-0.6.0/tests/math_transpose.cpp:87:25: [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.
GlobalFixture::world->srand(1764);
data/tiledarray-0.6.0/tests/math_transpose.cpp:126:25: [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.
GlobalFixture::world->srand(1764);
data/tiledarray-0.6.0/tests/proc_grid.cpp:45:25: [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.
GlobalFixture::world->srand(time(NULL));
data/tiledarray-0.6.0/tests/proc_grid.cpp:203:25: [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.
GlobalFixture::world->srand(time(NULL));
data/tiledarray-0.6.0/tests/sparse_shape_fixture.h:54:29: [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.
GlobalFixture::world->srand(seed);
data/tiledarray-0.6.0/tests/tensor_fixture.h:53:27: [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.
GlobalFixture::world->srand(seed);
data/tiledarray-0.6.0/tests/tensor_fixture.h:66:27: [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.
GlobalFixture::world->srand(seed);
data/tiledarray-0.6.0/tests/tensor_fixture.h:73:27: [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.
GlobalFixture::world->srand(seed);
data/tiledarray-0.6.0/tests/tile_op_add.cpp:41:27: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/tile_op_mult.cpp:41:27: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/tile_op_neg.cpp:40:27: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/tile_op_noop.cpp:40:27: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/tile_op_scal.cpp:40:27: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/tile_op_scal_add.cpp:41:27: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/tile_op_scal_mult.cpp:41:27: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/tile_op_scal_subt.cpp:41:27: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/tests/tile_op_subt.cpp:41:27: [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.
GlobalFixture::world->srand(27);
data/tiledarray-0.6.0/examples/dgemm/blas.cpp:29:28: [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 matrix_size = atol(argv[1]);
data/tiledarray-0.6.0/examples/dgemm/blas.cpp:34:36: [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 repeat = (argc >= 3 ? atol(argv[2]) : 5);
data/tiledarray-0.6.0/examples/dgemm/eigen.cpp:30:28: [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 matrix_size = atol(argv[1]);
data/tiledarray-0.6.0/examples/dgemm/eigen.cpp:35:36: [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 repeat = (argc >= 3 ? atol(argv[2]) : 5);
data/tiledarray-0.6.0/examples/dgemm/ta_asymm_dense.cpp:32:25: [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 row_size = atol(argv[1]);
data/tiledarray-0.6.0/examples/dgemm/ta_asymm_dense.cpp:33:31: [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 row_block_size = atol(argv[2]);
data/tiledarray-0.6.0/examples/dgemm/ta_asymm_dense.cpp:34:25: [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 col_size = atol(argv[3]);
data/tiledarray-0.6.0/examples/dgemm/ta_asymm_dense.cpp:35:31: [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 col_block_size = atol(argv[4]);
data/tiledarray-0.6.0/examples/dgemm/ta_asymm_dense.cpp:48:36: [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 repeat = (argc >= 6 ? atol(argv[5]) : 5);
data/tiledarray-0.6.0/examples/dgemm/ta_band.cpp:36:30: [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 matrix_size = atol(argv[1]);
data/tiledarray-0.6.0/examples/dgemm/ta_band.cpp:37:29: [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 block_size = atol(argv[2]);
data/tiledarray-0.6.0/examples/dgemm/ta_band.cpp:38:29: [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 band_width = atol(argv[3]);
data/tiledarray-0.6.0/examples/dgemm/ta_band.cpp:59:38: [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 repeat = (argc >= 5 ? atol(argv[4]) : 5);
data/tiledarray-0.6.0/examples/dgemm/ta_cc_abcd.cpp:85:24: [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 n_occ = atol(argv[1]);
data/tiledarray-0.6.0/examples/dgemm/ta_cc_abcd.cpp:86: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 nblk_occ = atol(argv[2]);
data/tiledarray-0.6.0/examples/dgemm/ta_cc_abcd.cpp:87:25: [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 n_uocc = atol(argv[3]);
data/tiledarray-0.6.0/examples/dgemm/ta_cc_abcd.cpp:88:28: [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 nblk_uocc = atol(argv[4]);
data/tiledarray-0.6.0/examples/dgemm/ta_cc_abcd.cpp:113:38: [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 repeat = (argc >= 6 ? atol(argv[5]) : 5);
data/tiledarray-0.6.0/examples/dgemm/ta_dense.cpp:53:30: [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 matrix_size = atol(argv[1]);
data/tiledarray-0.6.0/examples/dgemm/ta_dense.cpp:54:29: [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 block_size = atol(argv[2]);
data/tiledarray-0.6.0/examples/dgemm/ta_dense.cpp:67:38: [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 repeat = (argc >= 4 ? atol(argv[3]) : 5);
data/tiledarray-0.6.0/examples/dgemm/ta_dense_new_tile.cpp:50:34: [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 matrix_size = atol(argv[1]);
data/tiledarray-0.6.0/examples/dgemm/ta_dense_new_tile.cpp:51:33: [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 block_size = atol(argv[2]);
data/tiledarray-0.6.0/examples/dgemm/ta_dense_new_tile.cpp:65:42: [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 repeat = (argc >= 4 ? atol(argv[3]) : 5);
data/tiledarray-0.6.0/examples/dgemm/ta_dense_nonuniform.cpp:36:30: [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 matrix_size = atol(argv[1]);
data/tiledarray-0.6.0/examples/dgemm/ta_dense_nonuniform.cpp:37:29: [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 block_size = atol(argv[2]);
data/tiledarray-0.6.0/examples/dgemm/ta_dense_nonuniform.cpp:50:38: [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 repeat = (argc >= 4 ? atol(argv[3]) : 5);
data/tiledarray-0.6.0/examples/dgemm/ta_elem_dense.cpp:52:28: [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 matrix_size = atol(argv[1]);
data/tiledarray-0.6.0/examples/dgemm/ta_elem_dense.cpp:53: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 block_size = atol(argv[2]);
data/tiledarray-0.6.0/examples/dgemm/ta_elem_dense.cpp:66:36: [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 repeat = (argc >= 4 ? atol(argv[3]) : 5);
data/tiledarray-0.6.0/examples/dgemm/ta_sparse.cpp:57:30: [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 matrix_size = atol(argv[1]);
data/tiledarray-0.6.0/examples/dgemm/ta_sparse.cpp:58:29: [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 block_size = atol(argv[2]);
data/tiledarray-0.6.0/examples/dgemm/ta_sparse.cpp:71:38: [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 repeat = (argc >= 4 ? atol(argv[3]) : 4);
data/tiledarray-0.6.0/examples/dgemm/ta_sparse_grow.cpp:42:30: [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 matrix_size = atol(argv[1]);
data/tiledarray-0.6.0/examples/dgemm/ta_sparse_grow.cpp:43:29: [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 block_size = atol(argv[2]);
data/tiledarray-0.6.0/examples/dgemm/ta_sparse_grow.cpp:56:38: [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 repeat = (argc >= 4 ? atol(argv[3]) : 4);
data/tiledarray-0.6.0/examples/fock/ta_k_build.cpp:36:24: [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 ao_size = atol(argv[1]);
data/tiledarray-0.6.0/examples/fock/ta_k_build.cpp:37:28: [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 ao_blk_size = atol(argv[2]);
data/tiledarray-0.6.0/examples/fock/ta_k_build.cpp:38:25: [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 occ_size = atol(argv[3]);
data/tiledarray-0.6.0/examples/fock/ta_k_build.cpp:39:29: [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 occ_blk_size = atol(argv[4]);
data/tiledarray-0.6.0/examples/fock/ta_k_build.cpp:40:24: [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 df_size = atol(argv[5]);
data/tiledarray-0.6.0/examples/fock/ta_k_build.cpp:41:28: [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 df_blk_size = atol(argv[6]);
data/tiledarray-0.6.0/examples/fock/ta_k_build.cpp:62:36: [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 repeat = (argc >= 8 ? atol(argv[7]) : 5);
data/tiledarray-0.6.0/examples/mpi_tests/mpi_bandwidth.c:30:3: [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 msgbuf[ENDSIZE], host[MPI_MAX_PROCESSOR_NAME],
data/tiledarray-0.6.0/src/TiledArray/math/vector_op.h:688:12: [2] (buffer) memcpy:
Does not check for buffer overflows when copying to destination (CWE-120).
Make sure destination can always hold the source data.
std::memcpy(result, arg, n * sizeof(T));
data/tiledarray-0.6.0/src/TiledArray/perm_index.h:102:11: [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(weights_, other.weights_, (ndim_ + ndim_) * sizeof(std::size_t));
data/tiledarray-0.6.0/src/TiledArray/perm_index.h:129: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(weights_, other.weights_, bytes);
data/tiledarray-0.6.0/src/TiledArray/range.h:303: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(data_, other.data_, (sizeof(size_type) << 2) * other.rank_);
data/tiledarray-0.6.0/src/TiledArray/range.h:337:11: [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(data_, other.data_, (sizeof(size_type) << 2) * rank_);
data/tiledarray-0.6.0/src/TiledArray/range.h:358:7: [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(data_, other.data_, (sizeof(size_type) << 2) * rank_);
data/tiledarray-0.6.0/src/TiledArray/range.h:848:12: [2] (buffer) memcpy:
Does not check for buffer overflows when copying to destination (CWE-120).
Make sure destination can always hold the source data.
std::memcpy(temp_lower, data_, (sizeof(size_type) << 1) * rank_);
data/tiledarray-0.6.0/src/TiledArray/block_range.h:48:22: [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.
TA_ASSERT(std::equal(lower_bound.begin(), lower_bound.end(), range.lobound_data(),
data/tiledarray-0.6.0/src/TiledArray/block_range.h:50:22: [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.
TA_ASSERT(std::equal(upper_bound.begin(), upper_bound.end(), lower_bound.begin(),
data/tiledarray-0.6.0/src/TiledArray/block_range.h:52:22: [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.
TA_ASSERT(std::equal(upper_bound.begin(), upper_bound.end(), range.upbound_data(),
data/tiledarray-0.6.0/src/TiledArray/expressions/blk_tsr_expr.h:149:18: [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.
std::equal(std::begin(lower_bound_), std::end(lower_bound_),
data/tiledarray-0.6.0/src/TiledArray/expressions/blk_tsr_expr.h:153:18: [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.
std::equal(std::begin(upper_bound_), std::end(upper_bound_),
data/tiledarray-0.6.0/src/TiledArray/expressions/blk_tsr_expr.h:168:18: [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.
std::equal(std::begin(lower_bound_), std::end(lower_bound_),
data/tiledarray-0.6.0/src/TiledArray/expressions/leaf_engine.h:103:26: [1] (buffer) is_permutation:
Function does not check the second iterator for over-read conditions
(CWE-126). This function is often discouraged by most C++ coding standards
in favor of its safer alternatives provided since C++14. Consider using a
form of this function that checks the second iterator before potentially
overflowing it.
if(! target_vars.is_permutation(vars_)) {
data/tiledarray-0.6.0/src/TiledArray/expressions/mult_engine.h:195:40: [1] (buffer) is_permutation:
Function does not check the second iterator for over-read conditions
(CWE-126). This function is often discouraged by most C++ coding standards
in favor of its safer alternatives provided since C++14. Consider using a
form of this function that checks the second iterator before potentially
overflowing it.
if(BinaryEngine_::left_.vars().is_permutation(BinaryEngine_::right_.vars())) {
data/tiledarray-0.6.0/src/TiledArray/expressions/mult_engine.h:209:40: [1] (buffer) is_permutation:
Function does not check the second iterator for over-read conditions
(CWE-126). This function is often discouraged by most C++ coding standards
in favor of its safer alternatives provided since C++14. Consider using a
form of this function that checks the second iterator before potentially
overflowing it.
if(BinaryEngine_::left_.vars().is_permutation(BinaryEngine_::right_.vars())) {
data/tiledarray-0.6.0/src/TiledArray/expressions/mult_engine.h:402:40: [1] (buffer) is_permutation:
Function does not check the second iterator for over-read conditions
(CWE-126). This function is often discouraged by most C++ coding standards
in favor of its safer alternatives provided since C++14. Consider using a
form of this function that checks the second iterator before potentially
overflowing it.
if(BinaryEngine_::left_.vars().is_permutation(BinaryEngine_::right_.vars())) {
data/tiledarray-0.6.0/src/TiledArray/expressions/mult_engine.h:416:40: [1] (buffer) is_permutation:
Function does not check the second iterator for over-read conditions
(CWE-126). This function is often discouraged by most C++ coding standards
in favor of its safer alternatives provided since C++14. Consider using a
form of this function that checks the second iterator before potentially
overflowing it.
if(BinaryEngine_::left_.vars().is_permutation(BinaryEngine_::right_.vars())) {
data/tiledarray-0.6.0/src/TiledArray/expressions/variable_list.h:207:12: [1] (buffer) is_permutation:
Function does not check the second iterator for over-read conditions
(CWE-126). This function is often discouraged by most C++ coding standards
in favor of its safer alternatives provided since C++14. Consider using a
form of this function that checks the second iterator before potentially
overflowing it.
bool is_permutation(const VariableList& other) const {
data/tiledarray-0.6.0/src/TiledArray/expressions/variable_list.h:290:45: [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 (v0.dim() == v1.dim()) && std::equal(v0.begin(), v0.end(), v1.begin());
data/tiledarray-0.6.0/src/TiledArray/math/gemm_helper.h:206:21: [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(left + left_.outer[0], left + left_.outer[1], result);
data/tiledarray-0.6.0/src/TiledArray/math/gemm_helper.h:221:21: [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(right + right_.outer[0], right + right_.outer[1],
data/tiledarray-0.6.0/src/TiledArray/math/gemm_helper.h:237:21: [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(left + left_.inner[0], left + left_.inner[1],
data/tiledarray-0.6.0/src/TiledArray/permutation.h:395: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.
&& std::equal(p1.data().begin(), p1.data().end(), p2.data().begin());
data/tiledarray-0.6.0/src/TiledArray/tensor/shift_wrapper.h:124:16: [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.
std::equal(left.range().extent_data(),
data/tiledarray-0.6.0/src/TiledArray/tensor/utility.h:116:39: [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 (rank1 == rank2) && std::equal(extent1, extent1 + rank1, extent2);
data/tiledarray-0.6.0/src/TiledArray/tiled_range.h:303:14: [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.
std::equal(r1.data().begin(), r1.data().end(), r2.data().begin());
data/tiledarray-0.6.0/src/TiledArray/tiled_range1.h:222: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(r1.begin(), r1.end(), r2.begin()) &&
data/tiledarray-0.6.0/src/TiledArray/transform_iterator.h:176:16: [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 equal(other);
data/tiledarray-0.6.0/src/TiledArray/transform_iterator.h:190:18: [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 ! equal(other);
data/tiledarray-0.6.0/src/TiledArray/transform_iterator.h:227:12: [1] (buffer) equal:
Function does not check the second iterator for over-read conditions
(CWE-126). This function is often discouraged by most C++ coding standards
in favor of its safer alternatives provided since C++14. Consider using a
form of this function that checks the second iterator before potentially
overflowing it.
bool equal(const BinaryTransformIterator<It1, It2, Op>& other) const {
data/tiledarray-0.6.0/src/TiledArray/transform_iterator.h:346:16: [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 equal(other);
data/tiledarray-0.6.0/src/TiledArray/transform_iterator.h:358:18: [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 ! equal(other);
data/tiledarray-0.6.0/src/TiledArray/transform_iterator.h:390:12: [1] (buffer) equal:
Function does not check the second iterator for over-read conditions
(CWE-126). This function is often discouraged by most C++ coding standards
in favor of its safer alternatives provided since C++14. Consider using a
form of this function that checks the second iterator before potentially
overflowing it.
bool equal(const UnaryTransformIterator<It, Op>& other) const {
data/tiledarray-0.6.0/tests/block_range.cpp:59:15: [1] (buffer) equal:
Function does not check the second iterator for over-read conditions
(CWE-126). This function is often discouraged by most C++ coding standards
in favor of its safer alternatives provided since C++14. Consider using a
form of this function that checks the second iterator before potentially
overflowing it.
if(std::equal(lower.begin(), lower.end(), upper.begin(),
data/tiledarray-0.6.0/tests/block_range.cpp:117:15: [1] (buffer) equal:
Function does not check the second iterator for over-read conditions
(CWE-126). This function is often discouraged by most C++ coding standards
in favor of its safer alternatives provided since C++14. Consider using a
form of this function that checks the second iterator before potentially
overflowing it.
if(std::equal(lower.begin(), lower.end(), upper.begin(),
data/tiledarray-0.6.0/tests/tensor_tensor_view.cpp:76:15: [1] (buffer) equal:
Function does not check the second iterator for over-read conditions
(CWE-126). This function is often discouraged by most C++ coding standards
in favor of its safer alternatives provided since C++14. Consider using a
form of this function that checks the second iterator before potentially
overflowing it.
if(std::equal(lower.begin(), lower.end(), upper.begin(),
data/tiledarray-0.6.0/tests/tensor_tensor_view.cpp:119:15: [1] (buffer) equal:
Function does not check the second iterator for over-read conditions
(CWE-126). This function is often discouraged by most C++ coding standards
in favor of its safer alternatives provided since C++14. Consider using a
form of this function that checks the second iterator before potentially
overflowing it.
if(std::equal(lower.begin(), lower.end(), upper.begin(),
data/tiledarray-0.6.0/tests/tensor_tensor_view.cpp:186:15: [1] (buffer) equal:
Function does not check the second iterator for over-read conditions
(CWE-126). This function is often discouraged by most C++ coding standards
in favor of its safer alternatives provided since C++14. Consider using a
form of this function that checks the second iterator before potentially
overflowing it.
if(std::equal(lower.begin(), lower.end(), upper.begin(),
data/tiledarray-0.6.0/tests/tensor_tensor_view.cpp:222:15: [1] (buffer) equal:
Function does not check the second iterator for over-read conditions
(CWE-126). This function is often discouraged by most C++ coding standards
in favor of its safer alternatives provided since C++14. Consider using a
form of this function that checks the second iterator before potentially
overflowing it.
if(std::equal(lower.begin(), lower.end(), upper.begin(),
data/tiledarray-0.6.0/tests/tensor_tensor_view.cpp:254:15: [1] (buffer) equal:
Function does not check the second iterator for over-read conditions
(CWE-126). This function is often discouraged by most C++ coding standards
in favor of its safer alternatives provided since C++14. Consider using a
form of this function that checks the second iterator before potentially
overflowing it.
if(std::equal(lower.begin(), lower.end(), upper.begin(),
data/tiledarray-0.6.0/tests/tensor_tensor_view.cpp:286:15: [1] (buffer) equal:
Function does not check the second iterator for over-read conditions
(CWE-126). This function is often discouraged by most C++ coding standards
in favor of its safer alternatives provided since C++14. Consider using a
form of this function that checks the second iterator before potentially
overflowing it.
if(std::equal(lower.begin(), lower.end(), upper.begin(),
data/tiledarray-0.6.0/tests/tensor_tensor_view.cpp:321:15: [1] (buffer) equal:
Function does not check the second iterator for over-read conditions
(CWE-126). This function is often discouraged by most C++ coding standards
in favor of its safer alternatives provided since C++14. Consider using a
form of this function that checks the second iterator before potentially
overflowing it.
if(std::equal(lower.begin(), lower.end(), upper.begin(),
data/tiledarray-0.6.0/tests/tensor_tensor_view.cpp:356:15: [1] (buffer) equal:
Function does not check the second iterator for over-read conditions
(CWE-126). This function is often discouraged by most C++ coding standards
in favor of its safer alternatives provided since C++14. Consider using a
form of this function that checks the second iterator before potentially
overflowing it.
if(std::equal(lower.begin(), lower.end(), upper.begin(),
data/tiledarray-0.6.0/tests/tensor_tensor_view.cpp:387:15: [1] (buffer) equal:
Function does not check the second iterator for over-read conditions
(CWE-126). This function is often discouraged by most C++ coding standards
in favor of its safer alternatives provided since C++14. Consider using a
form of this function that checks the second iterator before potentially
overflowing it.
if(std::equal(lower.begin(), lower.end(), upper.begin(),
ANALYSIS SUMMARY:
Hits = 139
Lines analyzed = 59769 in approximately 1.50 seconds (39754 lines/second)
Physical Source Lines of Code (SLOC) = 31915
Hits@level = [0] 47 [1] 38 [2] 51 [3] 45 [4] 5 [5] 0
Hits@level+ = [0+] 186 [1+] 139 [2+] 101 [3+] 50 [4+] 5 [5+] 0
Hits/KSLOC@level+ = [0+] 5.82798 [1+] 4.35532 [2+] 3.16466 [3+] 1.56666 [4+] 0.156666 [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.