2008-09-03 08:32:56 +08:00
|
|
|
// This file is part of Eigen, a lightweight C++ template library
|
2009-05-23 02:25:33 +08:00
|
|
|
// for linear algebra.
|
2008-09-03 08:32:56 +08:00
|
|
|
//
|
2010-06-25 05:21:58 +08:00
|
|
|
// Copyright (C) 2008 Gael Guennebaud <gael.guennebaud@inria.fr>
|
2008-09-03 08:32:56 +08:00
|
|
|
//
|
2012-07-14 02:42:47 +08:00
|
|
|
// This Source Code Form is subject to the terms of the Mozilla
|
|
|
|
// Public License v. 2.0. If a copy of the MPL was not distributed
|
|
|
|
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
2008-09-03 08:32:56 +08:00
|
|
|
|
|
|
|
#include "main.h"
|
|
|
|
|
2015-07-29 17:11:23 +08:00
|
|
|
#if EIGEN_MAX_ALIGN_BYTES>0
|
|
|
|
#define ALIGNMENT EIGEN_MAX_ALIGN_BYTES
|
2009-02-05 00:53:03 +08:00
|
|
|
#else
|
|
|
|
#define ALIGNMENT 1
|
|
|
|
#endif
|
|
|
|
|
2014-04-19 03:14:40 +08:00
|
|
|
typedef Matrix<float,8,1> Vector8f;
|
|
|
|
|
2009-01-09 22:56:44 +08:00
|
|
|
void check_handmade_aligned_malloc()
|
|
|
|
{
|
|
|
|
for(int i = 1; i < 1000; i++)
|
|
|
|
{
|
2010-10-25 22:15:22 +08:00
|
|
|
char *p = (char*)internal::handmade_aligned_malloc(i);
|
2009-02-05 00:53:03 +08:00
|
|
|
VERIFY(size_t(p)%ALIGNMENT==0);
|
2009-01-09 22:56:44 +08:00
|
|
|
// if the buffer is wrongly allocated this will give a bad write --> check with valgrind
|
|
|
|
for(int j = 0; j < i; j++) p[j]=0;
|
2010-10-25 22:15:22 +08:00
|
|
|
internal::handmade_aligned_free(p);
|
2009-01-09 22:56:44 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void check_aligned_malloc()
|
|
|
|
{
|
|
|
|
for(int i = 1; i < 1000; i++)
|
|
|
|
{
|
2010-10-25 22:15:22 +08:00
|
|
|
char *p = (char*)internal::aligned_malloc(i);
|
2009-02-05 00:53:03 +08:00
|
|
|
VERIFY(size_t(p)%ALIGNMENT==0);
|
2009-01-09 22:56:44 +08:00
|
|
|
// if the buffer is wrongly allocated this will give a bad write --> check with valgrind
|
|
|
|
for(int j = 0; j < i; j++) p[j]=0;
|
2010-10-25 22:15:22 +08:00
|
|
|
internal::aligned_free(p);
|
2009-01-09 22:56:44 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void check_aligned_new()
|
|
|
|
{
|
|
|
|
for(int i = 1; i < 1000; i++)
|
|
|
|
{
|
2010-10-25 22:15:22 +08:00
|
|
|
float *p = internal::aligned_new<float>(i);
|
2009-02-05 00:53:03 +08:00
|
|
|
VERIFY(size_t(p)%ALIGNMENT==0);
|
2009-01-09 22:56:44 +08:00
|
|
|
// if the buffer is wrongly allocated this will give a bad write --> check with valgrind
|
|
|
|
for(int j = 0; j < i; j++) p[j]=0;
|
2010-10-25 22:15:22 +08:00
|
|
|
internal::aligned_delete(p,i);
|
2009-01-09 22:56:44 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void check_aligned_stack_alloc()
|
|
|
|
{
|
2014-08-04 18:46:00 +08:00
|
|
|
for(int i = 1; i < 400; i++)
|
2009-01-09 22:56:44 +08:00
|
|
|
{
|
2011-03-19 15:51:38 +08:00
|
|
|
ei_declare_aligned_stack_constructed_variable(float,p,i,0);
|
2009-02-05 00:53:03 +08:00
|
|
|
VERIFY(size_t(p)%ALIGNMENT==0);
|
2009-01-09 22:56:44 +08:00
|
|
|
// if the buffer is wrongly allocated this will give a bad write --> check with valgrind
|
|
|
|
for(int j = 0; j < i; j++) p[j]=0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-09-03 08:32:56 +08:00
|
|
|
// test compilation with both a struct and a class...
|
2009-01-08 23:20:21 +08:00
|
|
|
struct MyStruct
|
2008-09-03 08:32:56 +08:00
|
|
|
{
|
2009-01-08 23:37:13 +08:00
|
|
|
EIGEN_MAKE_ALIGNED_OPERATOR_NEW
|
2008-09-03 08:32:56 +08:00
|
|
|
char dummychar;
|
2014-04-19 03:14:40 +08:00
|
|
|
Vector8f avec;
|
2008-09-03 08:32:56 +08:00
|
|
|
};
|
|
|
|
|
2009-01-08 23:20:21 +08:00
|
|
|
class MyClassA
|
2008-09-03 08:32:56 +08:00
|
|
|
{
|
|
|
|
public:
|
2009-01-08 23:37:13 +08:00
|
|
|
EIGEN_MAKE_ALIGNED_OPERATOR_NEW
|
2008-09-03 08:32:56 +08:00
|
|
|
char dummychar;
|
2014-04-19 03:14:40 +08:00
|
|
|
Vector8f avec;
|
2008-09-03 08:32:56 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
template<typename T> void check_dynaligned()
|
|
|
|
{
|
2014-04-19 03:14:40 +08:00
|
|
|
// TODO have to be updated once we support multiple alignment values
|
|
|
|
if(T::SizeAtCompileTime % ALIGNMENT == 0)
|
|
|
|
{
|
|
|
|
T* obj = new T;
|
|
|
|
VERIFY(T::NeedsToAlign==1);
|
|
|
|
VERIFY(size_t(obj)%ALIGNMENT==0);
|
|
|
|
delete obj;
|
|
|
|
}
|
2008-09-03 08:32:56 +08:00
|
|
|
}
|
|
|
|
|
2014-07-30 15:32:35 +08:00
|
|
|
template<typename T> void check_custom_new_delete()
|
|
|
|
{
|
|
|
|
{
|
|
|
|
T* t = new T;
|
|
|
|
delete t;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
|
|
|
std::size_t N = internal::random<std::size_t>(1,10);
|
|
|
|
T* t = new T[N];
|
|
|
|
delete[] t;
|
|
|
|
}
|
|
|
|
|
2015-07-29 17:11:23 +08:00
|
|
|
#if EIGEN_MAX_ALIGN_BYTES>0
|
2014-07-30 15:32:35 +08:00
|
|
|
{
|
|
|
|
T* t = static_cast<T *>((T::operator new)(sizeof(T)));
|
|
|
|
(T::operator delete)(t, sizeof(T));
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
|
|
|
T* t = static_cast<T *>((T::operator new)(sizeof(T)));
|
|
|
|
(T::operator delete)(t);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2008-09-03 08:32:56 +08:00
|
|
|
void test_dynalloc()
|
|
|
|
{
|
2009-01-09 22:56:44 +08:00
|
|
|
// low level dynamic memory allocation
|
|
|
|
CALL_SUBTEST(check_handmade_aligned_malloc());
|
|
|
|
CALL_SUBTEST(check_aligned_malloc());
|
|
|
|
CALL_SUBTEST(check_aligned_new());
|
|
|
|
CALL_SUBTEST(check_aligned_stack_alloc());
|
2008-09-03 08:32:56 +08:00
|
|
|
|
|
|
|
for (int i=0; i<g_repeat*100; ++i)
|
|
|
|
{
|
2014-07-30 15:32:35 +08:00
|
|
|
CALL_SUBTEST( check_custom_new_delete<Vector4f>() );
|
|
|
|
CALL_SUBTEST( check_custom_new_delete<Vector2f>() );
|
|
|
|
CALL_SUBTEST( check_custom_new_delete<Matrix4f>() );
|
|
|
|
CALL_SUBTEST( check_custom_new_delete<MatrixXi>() );
|
2008-09-03 08:32:56 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// check static allocation, who knows ?
|
2015-07-29 17:11:23 +08:00
|
|
|
#if EIGEN_MAX_STATIC_ALIGN_BYTES
|
2015-12-01 05:36:14 +08:00
|
|
|
for (int i=0; i<g_repeat*100; ++i)
|
|
|
|
{
|
|
|
|
CALL_SUBTEST(check_dynaligned<Vector4f>() );
|
|
|
|
CALL_SUBTEST(check_dynaligned<Vector2d>() );
|
|
|
|
CALL_SUBTEST(check_dynaligned<Matrix4f>() );
|
|
|
|
CALL_SUBTEST(check_dynaligned<Vector4d>() );
|
|
|
|
CALL_SUBTEST(check_dynaligned<Vector4i>() );
|
|
|
|
CALL_SUBTEST(check_dynaligned<Vector8f>() );
|
|
|
|
}
|
|
|
|
|
2008-09-03 08:32:56 +08:00
|
|
|
{
|
2009-02-05 00:53:03 +08:00
|
|
|
MyStruct foo0; VERIFY(size_t(foo0.avec.data())%ALIGNMENT==0);
|
|
|
|
MyClassA fooA; VERIFY(size_t(fooA.avec.data())%ALIGNMENT==0);
|
2008-09-03 08:32:56 +08:00
|
|
|
}
|
2011-03-15 16:53:23 +08:00
|
|
|
|
2008-09-03 08:32:56 +08:00
|
|
|
// dynamic allocation, single object
|
|
|
|
for (int i=0; i<g_repeat*100; ++i)
|
|
|
|
{
|
2009-02-05 00:53:03 +08:00
|
|
|
MyStruct *foo0 = new MyStruct(); VERIFY(size_t(foo0->avec.data())%ALIGNMENT==0);
|
|
|
|
MyClassA *fooA = new MyClassA(); VERIFY(size_t(fooA->avec.data())%ALIGNMENT==0);
|
2008-09-03 08:32:56 +08:00
|
|
|
delete foo0;
|
|
|
|
delete fooA;
|
|
|
|
}
|
|
|
|
|
|
|
|
// dynamic allocation, array
|
|
|
|
const int N = 10;
|
|
|
|
for (int i=0; i<g_repeat*100; ++i)
|
|
|
|
{
|
2009-02-05 00:53:03 +08:00
|
|
|
MyStruct *foo0 = new MyStruct[N]; VERIFY(size_t(foo0->avec.data())%ALIGNMENT==0);
|
|
|
|
MyClassA *fooA = new MyClassA[N]; VERIFY(size_t(fooA->avec.data())%ALIGNMENT==0);
|
2008-09-03 08:32:56 +08:00
|
|
|
delete[] foo0;
|
|
|
|
delete[] fooA;
|
|
|
|
}
|
2011-03-15 16:53:23 +08:00
|
|
|
#endif
|
2008-09-03 08:32:56 +08:00
|
|
|
|
|
|
|
}
|