eigen/test/sizeoverflow.cpp

82 lines
3.3 KiB
C++

// This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
// Copyright (C) 2011 Benoit Jacob <jacob.benoit.1@gmail.com>
//
// Eigen is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 3 of the License, or (at your option) any later version.
//
// Alternatively, you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; either version 2 of
// the License, or (at your option) any later version.
//
// Eigen is distributed in the hope that it will be useful, but WITHOUT ANY
// WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
// FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License or the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License and a copy of the GNU General Public License along with
// Eigen. If not, see <http://www.gnu.org/licenses/>.
#include "main.h"
#define VERIFY_THROWS_BADALLOC(a) { \
bool threw = false; \
try { \
a; \
} \
catch (std::bad_alloc&) { threw = true; } \
VERIFY(threw && "should have thrown bad_alloc: " #a); \
}
typedef DenseIndex Index;
template<typename MatrixType>
void triggerMatrixBadAlloc(Index rows, Index cols)
{
VERIFY_THROWS_BADALLOC( MatrixType m(rows, cols) );
VERIFY_THROWS_BADALLOC( MatrixType m; m.resize(rows, cols) );
VERIFY_THROWS_BADALLOC( MatrixType m; m.conservativeResize(rows, cols) );
}
template<typename VectorType>
void triggerVectorBadAlloc(Index size)
{
VERIFY_THROWS_BADALLOC( VectorType v(size) );
VERIFY_THROWS_BADALLOC( VectorType v; v.resize(size) );
VERIFY_THROWS_BADALLOC( VectorType v; v.conservativeResize(size) );
}
void test_sizeoverflow()
{
// there are 2 levels of overflow checking. first in PlainObjectBase.h we check for overflow in rows*cols computations.
// this is tested in tests of the form times_itself_gives_0 * times_itself_gives_0
// Then in Memory.h we check for overflow in size * sizeof(T) computations.
// this is tested in tests of the form times_4_gives_0 * sizeof(float)
size_t times_itself_gives_0 = size_t(1) << (8 * sizeof(Index) / 2);
VERIFY(times_itself_gives_0 * times_itself_gives_0 == 0);
size_t times_4_gives_0 = size_t(1) << (8 * sizeof(Index) - 2);
VERIFY(times_4_gives_0 * 4 == 0);
size_t times_8_gives_0 = size_t(1) << (8 * sizeof(Index) - 3);
VERIFY(times_8_gives_0 * 8 == 0);
triggerMatrixBadAlloc<MatrixXf>(times_itself_gives_0, times_itself_gives_0);
triggerMatrixBadAlloc<MatrixXf>(times_itself_gives_0 / 4, times_itself_gives_0);
triggerMatrixBadAlloc<MatrixXf>(times_4_gives_0, 1);
triggerMatrixBadAlloc<MatrixXd>(times_itself_gives_0, times_itself_gives_0);
triggerMatrixBadAlloc<MatrixXd>(times_itself_gives_0 / 8, times_itself_gives_0);
triggerMatrixBadAlloc<MatrixXd>(times_8_gives_0, 1);
triggerVectorBadAlloc<VectorXf>(times_4_gives_0);
triggerVectorBadAlloc<VectorXd>(times_8_gives_0);
}