xref: /aosp_15_r20/external/eigen/test/dynalloc.cpp (revision bf2c37156dfe67e5dfebd6d394bad8b2ab5804d4)
1*bf2c3715SXin Li // This file is part of Eigen, a lightweight C++ template library
2*bf2c3715SXin Li // for linear algebra.
3*bf2c3715SXin Li //
4*bf2c3715SXin Li // Copyright (C) 2008 Gael Guennebaud <[email protected]>
5*bf2c3715SXin Li //
6*bf2c3715SXin Li // This Source Code Form is subject to the terms of the Mozilla
7*bf2c3715SXin Li // Public License v. 2.0. If a copy of the MPL was not distributed
8*bf2c3715SXin Li // with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
9*bf2c3715SXin Li 
10*bf2c3715SXin Li #include "main.h"
11*bf2c3715SXin Li 
12*bf2c3715SXin Li #if EIGEN_MAX_ALIGN_BYTES>0
13*bf2c3715SXin Li #define ALIGNMENT EIGEN_MAX_ALIGN_BYTES
14*bf2c3715SXin Li #else
15*bf2c3715SXin Li #define ALIGNMENT 1
16*bf2c3715SXin Li #endif
17*bf2c3715SXin Li 
18*bf2c3715SXin Li typedef Matrix<float,16,1> Vector16f;
19*bf2c3715SXin Li typedef Matrix<float,8,1> Vector8f;
20*bf2c3715SXin Li 
check_handmade_aligned_malloc()21*bf2c3715SXin Li void check_handmade_aligned_malloc()
22*bf2c3715SXin Li {
23*bf2c3715SXin Li   for(int i = 1; i < 1000; i++)
24*bf2c3715SXin Li   {
25*bf2c3715SXin Li     char *p = (char*)internal::handmade_aligned_malloc(i);
26*bf2c3715SXin Li     VERIFY(internal::UIntPtr(p)%ALIGNMENT==0);
27*bf2c3715SXin Li     // if the buffer is wrongly allocated this will give a bad write --> check with valgrind
28*bf2c3715SXin Li     for(int j = 0; j < i; j++) p[j]=0;
29*bf2c3715SXin Li     internal::handmade_aligned_free(p);
30*bf2c3715SXin Li   }
31*bf2c3715SXin Li }
32*bf2c3715SXin Li 
check_aligned_malloc()33*bf2c3715SXin Li void check_aligned_malloc()
34*bf2c3715SXin Li {
35*bf2c3715SXin Li   for(int i = ALIGNMENT; i < 1000; i++)
36*bf2c3715SXin Li   {
37*bf2c3715SXin Li     char *p = (char*)internal::aligned_malloc(i);
38*bf2c3715SXin Li     VERIFY(internal::UIntPtr(p)%ALIGNMENT==0);
39*bf2c3715SXin Li     // if the buffer is wrongly allocated this will give a bad write --> check with valgrind
40*bf2c3715SXin Li     for(int j = 0; j < i; j++) p[j]=0;
41*bf2c3715SXin Li     internal::aligned_free(p);
42*bf2c3715SXin Li   }
43*bf2c3715SXin Li }
44*bf2c3715SXin Li 
check_aligned_new()45*bf2c3715SXin Li void check_aligned_new()
46*bf2c3715SXin Li {
47*bf2c3715SXin Li   for(int i = ALIGNMENT; i < 1000; i++)
48*bf2c3715SXin Li   {
49*bf2c3715SXin Li     float *p = internal::aligned_new<float>(i);
50*bf2c3715SXin Li     VERIFY(internal::UIntPtr(p)%ALIGNMENT==0);
51*bf2c3715SXin Li     // if the buffer is wrongly allocated this will give a bad write --> check with valgrind
52*bf2c3715SXin Li     for(int j = 0; j < i; j++) p[j]=0;
53*bf2c3715SXin Li     internal::aligned_delete(p,i);
54*bf2c3715SXin Li   }
55*bf2c3715SXin Li }
56*bf2c3715SXin Li 
check_aligned_stack_alloc()57*bf2c3715SXin Li void check_aligned_stack_alloc()
58*bf2c3715SXin Li {
59*bf2c3715SXin Li   for(int i = ALIGNMENT; i < 400; i++)
60*bf2c3715SXin Li   {
61*bf2c3715SXin Li     ei_declare_aligned_stack_constructed_variable(float,p,i,0);
62*bf2c3715SXin Li     VERIFY(internal::UIntPtr(p)%ALIGNMENT==0);
63*bf2c3715SXin Li     // if the buffer is wrongly allocated this will give a bad write --> check with valgrind
64*bf2c3715SXin Li     for(int j = 0; j < i; j++) p[j]=0;
65*bf2c3715SXin Li   }
66*bf2c3715SXin Li }
67*bf2c3715SXin Li 
68*bf2c3715SXin Li 
69*bf2c3715SXin Li // test compilation with both a struct and a class...
70*bf2c3715SXin Li struct MyStruct
71*bf2c3715SXin Li {
72*bf2c3715SXin Li   EIGEN_MAKE_ALIGNED_OPERATOR_NEW
73*bf2c3715SXin Li   char dummychar;
74*bf2c3715SXin Li   Vector16f avec;
75*bf2c3715SXin Li };
76*bf2c3715SXin Li 
77*bf2c3715SXin Li class MyClassA
78*bf2c3715SXin Li {
79*bf2c3715SXin Li   public:
80*bf2c3715SXin Li     EIGEN_MAKE_ALIGNED_OPERATOR_NEW
81*bf2c3715SXin Li     char dummychar;
82*bf2c3715SXin Li     Vector16f avec;
83*bf2c3715SXin Li };
84*bf2c3715SXin Li 
check_dynaligned()85*bf2c3715SXin Li template<typename T> void check_dynaligned()
86*bf2c3715SXin Li {
87*bf2c3715SXin Li   // TODO have to be updated once we support multiple alignment values
88*bf2c3715SXin Li   if(T::SizeAtCompileTime % ALIGNMENT == 0)
89*bf2c3715SXin Li   {
90*bf2c3715SXin Li     T* obj = new T;
91*bf2c3715SXin Li     VERIFY(T::NeedsToAlign==1);
92*bf2c3715SXin Li     VERIFY(internal::UIntPtr(obj)%ALIGNMENT==0);
93*bf2c3715SXin Li     delete obj;
94*bf2c3715SXin Li   }
95*bf2c3715SXin Li }
96*bf2c3715SXin Li 
check_custom_new_delete()97*bf2c3715SXin Li template<typename T> void check_custom_new_delete()
98*bf2c3715SXin Li {
99*bf2c3715SXin Li   {
100*bf2c3715SXin Li     T* t = new T;
101*bf2c3715SXin Li     delete t;
102*bf2c3715SXin Li   }
103*bf2c3715SXin Li 
104*bf2c3715SXin Li   {
105*bf2c3715SXin Li     std::size_t N = internal::random<std::size_t>(1,10);
106*bf2c3715SXin Li     T* t = new T[N];
107*bf2c3715SXin Li     delete[] t;
108*bf2c3715SXin Li   }
109*bf2c3715SXin Li 
110*bf2c3715SXin Li #if EIGEN_MAX_ALIGN_BYTES>0 && (!EIGEN_HAS_CXX17_OVERALIGN)
111*bf2c3715SXin Li   {
112*bf2c3715SXin Li     T* t = static_cast<T *>((T::operator new)(sizeof(T)));
113*bf2c3715SXin Li     (T::operator delete)(t, sizeof(T));
114*bf2c3715SXin Li   }
115*bf2c3715SXin Li 
116*bf2c3715SXin Li   {
117*bf2c3715SXin Li     T* t = static_cast<T *>((T::operator new)(sizeof(T)));
118*bf2c3715SXin Li     (T::operator delete)(t);
119*bf2c3715SXin Li   }
120*bf2c3715SXin Li #endif
121*bf2c3715SXin Li }
122*bf2c3715SXin Li 
EIGEN_DECLARE_TEST(dynalloc)123*bf2c3715SXin Li EIGEN_DECLARE_TEST(dynalloc)
124*bf2c3715SXin Li {
125*bf2c3715SXin Li   // low level dynamic memory allocation
126*bf2c3715SXin Li   CALL_SUBTEST(check_handmade_aligned_malloc());
127*bf2c3715SXin Li   CALL_SUBTEST(check_aligned_malloc());
128*bf2c3715SXin Li   CALL_SUBTEST(check_aligned_new());
129*bf2c3715SXin Li   CALL_SUBTEST(check_aligned_stack_alloc());
130*bf2c3715SXin Li 
131*bf2c3715SXin Li   for (int i=0; i<g_repeat*100; ++i)
132*bf2c3715SXin Li   {
133*bf2c3715SXin Li     CALL_SUBTEST( check_custom_new_delete<Vector4f>() );
134*bf2c3715SXin Li     CALL_SUBTEST( check_custom_new_delete<Vector2f>() );
135*bf2c3715SXin Li     CALL_SUBTEST( check_custom_new_delete<Matrix4f>() );
136*bf2c3715SXin Li     CALL_SUBTEST( check_custom_new_delete<MatrixXi>() );
137*bf2c3715SXin Li   }
138*bf2c3715SXin Li 
139*bf2c3715SXin Li   // check static allocation, who knows ?
140*bf2c3715SXin Li   #if EIGEN_MAX_STATIC_ALIGN_BYTES
141*bf2c3715SXin Li   for (int i=0; i<g_repeat*100; ++i)
142*bf2c3715SXin Li   {
143*bf2c3715SXin Li     CALL_SUBTEST(check_dynaligned<Vector4f>() );
144*bf2c3715SXin Li     CALL_SUBTEST(check_dynaligned<Vector2d>() );
145*bf2c3715SXin Li     CALL_SUBTEST(check_dynaligned<Matrix4f>() );
146*bf2c3715SXin Li     CALL_SUBTEST(check_dynaligned<Vector4d>() );
147*bf2c3715SXin Li     CALL_SUBTEST(check_dynaligned<Vector4i>() );
148*bf2c3715SXin Li     CALL_SUBTEST(check_dynaligned<Vector8f>() );
149*bf2c3715SXin Li     CALL_SUBTEST(check_dynaligned<Vector16f>() );
150*bf2c3715SXin Li   }
151*bf2c3715SXin Li 
152*bf2c3715SXin Li   {
153*bf2c3715SXin Li     MyStruct foo0;  VERIFY(internal::UIntPtr(foo0.avec.data())%ALIGNMENT==0);
154*bf2c3715SXin Li     MyClassA fooA;  VERIFY(internal::UIntPtr(fooA.avec.data())%ALIGNMENT==0);
155*bf2c3715SXin Li   }
156*bf2c3715SXin Li 
157*bf2c3715SXin Li   // dynamic allocation, single object
158*bf2c3715SXin Li   for (int i=0; i<g_repeat*100; ++i)
159*bf2c3715SXin Li   {
160*bf2c3715SXin Li     MyStruct *foo0 = new MyStruct();  VERIFY(internal::UIntPtr(foo0->avec.data())%ALIGNMENT==0);
161*bf2c3715SXin Li     MyClassA *fooA = new MyClassA();  VERIFY(internal::UIntPtr(fooA->avec.data())%ALIGNMENT==0);
162*bf2c3715SXin Li     delete foo0;
163*bf2c3715SXin Li     delete fooA;
164*bf2c3715SXin Li   }
165*bf2c3715SXin Li 
166*bf2c3715SXin Li   // dynamic allocation, array
167*bf2c3715SXin Li   const int N = 10;
168*bf2c3715SXin Li   for (int i=0; i<g_repeat*100; ++i)
169*bf2c3715SXin Li   {
170*bf2c3715SXin Li     MyStruct *foo0 = new MyStruct[N];  VERIFY(internal::UIntPtr(foo0->avec.data())%ALIGNMENT==0);
171*bf2c3715SXin Li     MyClassA *fooA = new MyClassA[N];  VERIFY(internal::UIntPtr(fooA->avec.data())%ALIGNMENT==0);
172*bf2c3715SXin Li     delete[] foo0;
173*bf2c3715SXin Li     delete[] fooA;
174*bf2c3715SXin Li   }
175*bf2c3715SXin Li   #endif
176*bf2c3715SXin Li 
177*bf2c3715SXin Li }
178