19 #ifndef EIGEN_MEMORY_H
20 #define EIGEN_MEMORY_H
29 #if defined(__GLIBC__) && ((__GLIBC__>=2 && __GLIBC_MINOR__ >= 8) || __GLIBC__>2) \
31 #define EIGEN_GLIBC_MALLOC_ALREADY_ALIGNED 1
33 #define EIGEN_GLIBC_MALLOC_ALREADY_ALIGNED 0
40 #if defined(__FreeBSD__) && !defined(__arm__) && !defined(__mips__)
41 #define EIGEN_FREEBSD_MALLOC_ALREADY_ALIGNED 1
43 #define EIGEN_FREEBSD_MALLOC_ALREADY_ALIGNED 0
46 #if defined(__APPLE__) \
48 || EIGEN_GLIBC_MALLOC_ALREADY_ALIGNED \
49 || EIGEN_FREEBSD_MALLOC_ALREADY_ALIGNED
50 #define EIGEN_MALLOC_ALREADY_ALIGNED 1
52 #define EIGEN_MALLOC_ALREADY_ALIGNED 0
55 #if ((defined __QNXNTO__) || (defined _GNU_SOURCE) || ((defined _XOPEN_SOURCE) && (_XOPEN_SOURCE >= 600))) \
56 && (defined _POSIX_ADVISORY_INFO) && (_POSIX_ADVISORY_INFO > 0)
57 #define EIGEN_HAS_POSIX_MEMALIGN 1
59 #define EIGEN_HAS_POSIX_MEMALIGN 0
62 #ifdef EIGEN_VECTORIZE_SSE
63 #define EIGEN_HAS_MM_MALLOC 1
65 #define EIGEN_HAS_MM_MALLOC 0
72 inline void throw_std_bad_alloc()
74 #ifdef EIGEN_EXCEPTIONS
75 throw std::bad_alloc();
77 std::size_t huge = -1;
91 inline void* handmade_aligned_malloc(
size_t size)
93 void *original = std::malloc(size+16);
94 if (original == 0)
return 0;
95 void *aligned =
reinterpret_cast<void*
>((
reinterpret_cast<size_t>(original) & ~(
size_t(15))) + 16);
96 *(
reinterpret_cast<void**
>(aligned) - 1) = original;
101 inline void handmade_aligned_free(
void *ptr)
103 if (ptr) std::free(*(reinterpret_cast<void**>(ptr) - 1));
111 inline void* handmade_aligned_realloc(
void* ptr,
size_t size,
size_t = 0)
113 if (ptr == 0)
return handmade_aligned_malloc(size);
114 void *original = *(
reinterpret_cast<void**
>(ptr) - 1);
115 original = std::realloc(original,size+16);
116 if (original == 0)
return 0;
117 void *aligned =
reinterpret_cast<void*
>((
reinterpret_cast<size_t>(original) & ~(
size_t(15))) + 16);
118 *(
reinterpret_cast<void**
>(aligned) - 1) = original;
126 void* aligned_malloc(
size_t size);
127 void aligned_free(
void *ptr);
134 inline void* generic_aligned_realloc(
void* ptr,
size_t size,
size_t old_size)
137 return aligned_malloc(size);
145 void* newptr = aligned_malloc(size);
148 #ifdef EIGEN_HAS_ERRNO
156 std::memcpy(newptr, ptr, (std::min)(size,old_size));
167 #ifdef EIGEN_NO_MALLOC
168 inline void check_that_malloc_is_allowed()
170 eigen_assert(
false &&
"heap allocation is forbidden (EIGEN_NO_MALLOC is defined)");
172 #elif defined EIGEN_RUNTIME_NO_MALLOC
173 inline bool is_malloc_allowed_impl(
bool update,
bool new_value =
false)
175 static bool value =
true;
180 inline bool is_malloc_allowed() {
return is_malloc_allowed_impl(
false); }
181 inline bool set_is_malloc_allowed(
bool new_value) {
return is_malloc_allowed_impl(
true, new_value); }
182 inline void check_that_malloc_is_allowed()
184 eigen_assert(is_malloc_allowed() &&
"heap allocation is forbidden (EIGEN_RUNTIME_NO_MALLOC is defined and g_is_malloc_allowed is false)");
187 inline void check_that_malloc_is_allowed()
194 inline void* aligned_malloc(
size_t size)
196 check_that_malloc_is_allowed();
200 result = std::malloc(size);
201 #elif EIGEN_MALLOC_ALREADY_ALIGNED
202 result = std::malloc(size);
203 #elif EIGEN_HAS_POSIX_MEMALIGN
204 if(posix_memalign(&result, 16, size)) result = 0;
205 #elif EIGEN_HAS_MM_MALLOC
206 result = _mm_malloc(size, 16);
207 #elif defined(_MSC_VER) && (!defined(_WIN32_WCE))
208 result = _aligned_malloc(size, 16);
210 result = handmade_aligned_malloc(size);
214 throw_std_bad_alloc();
220 inline void aligned_free(
void *ptr)
224 #elif EIGEN_MALLOC_ALREADY_ALIGNED
226 #elif EIGEN_HAS_POSIX_MEMALIGN
228 #elif EIGEN_HAS_MM_MALLOC
230 #elif defined(_MSC_VER)
233 handmade_aligned_free(ptr);
242 inline void* aligned_realloc(
void *ptr,
size_t new_size,
size_t old_size)
244 EIGEN_UNUSED_VARIABLE(old_size);
248 result = std::realloc(ptr,new_size);
249 #elif EIGEN_MALLOC_ALREADY_ALIGNED
250 result = std::realloc(ptr,new_size);
251 #elif EIGEN_HAS_POSIX_MEMALIGN
252 result = generic_aligned_realloc(ptr,new_size,old_size);
253 #elif EIGEN_HAS_MM_MALLOC
257 #if defined(_MSC_VER) && defined(_mm_free)
258 result = _aligned_realloc(ptr,new_size,16);
260 result = generic_aligned_realloc(ptr,new_size,old_size);
262 #elif defined(_MSC_VER)
263 result = _aligned_realloc(ptr,new_size,16);
265 result = handmade_aligned_realloc(ptr,new_size,old_size);
268 if (!result && new_size)
269 throw_std_bad_alloc();
281 template<
bool Align>
inline void* conditional_aligned_malloc(
size_t size)
283 return aligned_malloc(size);
286 template<>
inline void* conditional_aligned_malloc<false>(
size_t size)
288 check_that_malloc_is_allowed();
290 void *result = std::malloc(size);
292 throw_std_bad_alloc();
297 template<
bool Align>
inline void conditional_aligned_free(
void *ptr)
302 template<>
inline void conditional_aligned_free<false>(
void *ptr)
307 template<
bool Align>
inline void* conditional_aligned_realloc(
void* ptr,
size_t new_size,
size_t old_size)
309 return aligned_realloc(ptr, new_size, old_size);
312 template<>
inline void* conditional_aligned_realloc<false>(
void* ptr,
size_t new_size, size_t)
314 return std::realloc(ptr, new_size);
324 template<
typename T>
inline T* construct_elements_of_array(T *ptr,
size_t size)
326 for (
size_t i=0; i < size; ++i) ::
new (ptr + i) T;
333 template<
typename T>
inline void destruct_elements_of_array(T *ptr,
size_t size)
337 while(size) ptr[--size].~T();
345 EIGEN_ALWAYS_INLINE
void check_size_for_overflow(
size_t size)
347 if(size >
size_t(-1) /
sizeof(T))
348 throw_std_bad_alloc();
355 template<
typename T>
inline T* aligned_new(
size_t size)
357 check_size_for_overflow<T>(size);
358 T *result =
reinterpret_cast<T*
>(aligned_malloc(
sizeof(T)*size));
359 return construct_elements_of_array(result, size);
362 template<
typename T,
bool Align>
inline T* conditional_aligned_new(
size_t size)
364 check_size_for_overflow<T>(size);
365 T *result =
reinterpret_cast<T*
>(conditional_aligned_malloc<Align>(
sizeof(T)*size));
366 return construct_elements_of_array(result, size);
372 template<
typename T>
inline void aligned_delete(T *ptr,
size_t size)
374 destruct_elements_of_array<T>(ptr, size);
381 template<
typename T,
bool Align>
inline void conditional_aligned_delete(T *ptr,
size_t size)
383 destruct_elements_of_array<T>(ptr, size);
384 conditional_aligned_free<Align>(ptr);
387 template<
typename T,
bool Align>
inline T* conditional_aligned_realloc_new(T* pts,
size_t new_size,
size_t old_size)
389 check_size_for_overflow<T>(new_size);
390 check_size_for_overflow<T>(old_size);
391 if(new_size < old_size)
392 destruct_elements_of_array(pts+new_size, old_size-new_size);
393 T *result =
reinterpret_cast<T*
>(conditional_aligned_realloc<Align>(
reinterpret_cast<void*
>(pts),
sizeof(T)*new_size,
sizeof(T)*old_size));
394 if(new_size > old_size)
395 construct_elements_of_array(result+old_size, new_size-old_size);
400 template<
typename T,
bool Align>
inline T* conditional_aligned_new_auto(
size_t size)
402 check_size_for_overflow<T>(size);
403 T *result =
reinterpret_cast<T*
>(conditional_aligned_malloc<Align>(
sizeof(T)*size));
404 if(NumTraits<T>::RequireInitialization)
405 construct_elements_of_array(result, size);
409 template<
typename T,
bool Align>
inline T* conditional_aligned_realloc_new_auto(T* pts,
size_t new_size,
size_t old_size)
411 check_size_for_overflow<T>(new_size);
412 check_size_for_overflow<T>(old_size);
413 if(NumTraits<T>::RequireInitialization && (new_size < old_size))
414 destruct_elements_of_array(pts+new_size, old_size-new_size);
415 T *result =
reinterpret_cast<T*
>(conditional_aligned_realloc<Align>(
reinterpret_cast<void*
>(pts),
sizeof(T)*new_size,
sizeof(T)*old_size));
416 if(NumTraits<T>::RequireInitialization && (new_size > old_size))
417 construct_elements_of_array(result+old_size, new_size-old_size);
421 template<
typename T,
bool Align>
inline void conditional_aligned_delete_auto(T *ptr,
size_t size)
423 if(NumTraits<T>::RequireInitialization)
424 destruct_elements_of_array<T>(ptr, size);
425 conditional_aligned_free<Align>(ptr);
446 template<
typename Scalar,
typename Index>
447 static inline Index first_aligned(
const Scalar* array, Index size)
449 typedef typename packet_traits<Scalar>::type Packet;
450 enum { PacketSize = packet_traits<Scalar>::size,
451 PacketAlignedMask = PacketSize-1
460 else if(
size_t(array) & (
sizeof(Scalar)-1))
468 return std::min<Index>( (PacketSize - (Index((
size_t(array)/
sizeof(Scalar))) & PacketAlignedMask))
469 & PacketAlignedMask, size);
476 template<
typename T,
bool UseMemcpy>
struct smart_copy_helper;
478 template<
typename T>
void smart_copy(
const T* start,
const T* end, T* target)
480 smart_copy_helper<T,!NumTraits<T>::RequireInitialization>::run(start, end, target);
483 template<
typename T>
struct smart_copy_helper<T,true> {
484 static inline void run(
const T* start,
const T* end, T* target)
485 { memcpy(target, start, std::ptrdiff_t(end)-std::ptrdiff_t(start)); }
488 template<
typename T>
struct smart_copy_helper<T,false> {
489 static inline void run(
const T* start,
const T* end, T* target)
490 { std::copy(start, end, target); }
501 #if (defined __linux__)
502 #define EIGEN_ALLOCA alloca
503 #elif defined(_MSC_VER)
504 #define EIGEN_ALLOCA _alloca
510 template<
typename T>
class aligned_stack_memory_handler
519 aligned_stack_memory_handler(T* ptr,
size_t size,
bool dealloc)
520 : m_ptr(ptr), m_size(size), m_deallocate(dealloc)
522 if(NumTraits<T>::RequireInitialization && m_ptr)
523 Eigen::internal::construct_elements_of_array(m_ptr, size);
525 ~aligned_stack_memory_handler()
527 if(NumTraits<T>::RequireInitialization && m_ptr)
528 Eigen::internal::destruct_elements_of_array<T>(m_ptr, m_size);
530 Eigen::internal::aligned_free(m_ptr);
558 #define EIGEN_ALIGNED_ALLOCA(SIZE) reinterpret_cast<void*>((reinterpret_cast<size_t>(EIGEN_ALLOCA(SIZE+16)) & ~(size_t(15))) + 16)
560 #define EIGEN_ALIGNED_ALLOCA EIGEN_ALLOCA
563 #define ei_declare_aligned_stack_constructed_variable(TYPE,NAME,SIZE,BUFFER) \
564 Eigen::internal::check_size_for_overflow<TYPE>(SIZE); \
565 TYPE* NAME = (BUFFER)!=0 ? (BUFFER) \
566 : reinterpret_cast<TYPE*>( \
567 (sizeof(TYPE)*SIZE<=EIGEN_STACK_ALLOCATION_LIMIT) ? EIGEN_ALIGNED_ALLOCA(sizeof(TYPE)*SIZE) \
568 : Eigen::internal::aligned_malloc(sizeof(TYPE)*SIZE) ); \
569 Eigen::internal::aligned_stack_memory_handler<TYPE> EIGEN_CAT(NAME,_stack_memory_destructor)((BUFFER)==0 ? NAME : 0,SIZE,sizeof(TYPE)*SIZE>EIGEN_STACK_ALLOCATION_LIMIT)
573 #define ei_declare_aligned_stack_constructed_variable(TYPE,NAME,SIZE,BUFFER) \
574 Eigen::internal::check_size_for_overflow<TYPE>(SIZE); \
575 TYPE* NAME = (BUFFER)!=0 ? BUFFER : reinterpret_cast<TYPE*>(Eigen::internal::aligned_malloc(sizeof(TYPE)*SIZE)); \
576 Eigen::internal::aligned_stack_memory_handler<TYPE> EIGEN_CAT(NAME,_stack_memory_destructor)((BUFFER)==0 ? NAME : 0,SIZE,true)
586 #ifdef EIGEN_EXCEPTIONS
587 #define EIGEN_MAKE_ALIGNED_OPERATOR_NEW_NOTHROW(NeedsToAlign) \
588 void* operator new(size_t size, const std::nothrow_t&) throw() { \
589 try { return Eigen::internal::conditional_aligned_malloc<NeedsToAlign>(size); } \
590 catch (...) { return 0; } \
594 #define EIGEN_MAKE_ALIGNED_OPERATOR_NEW_NOTHROW(NeedsToAlign) \
595 void* operator new(size_t size, const std::nothrow_t&) throw() { \
596 return Eigen::internal::conditional_aligned_malloc<NeedsToAlign>(size); \
600 #define EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF(NeedsToAlign) \
601 void *operator new(size_t size) { \
602 return Eigen::internal::conditional_aligned_malloc<NeedsToAlign>(size); \
604 void *operator new[](size_t size) { \
605 return Eigen::internal::conditional_aligned_malloc<NeedsToAlign>(size); \
607 void operator delete(void * ptr) throw() { Eigen::internal::conditional_aligned_free<NeedsToAlign>(ptr); } \
608 void operator delete[](void * ptr) throw() { Eigen::internal::conditional_aligned_free<NeedsToAlign>(ptr); } \
612 static void *operator new(size_t size, void *ptr) { return ::operator new(size,ptr); } \
613 void operator delete(void * memory, void *ptr) throw() { return ::operator delete(memory,ptr); } \
615 EIGEN_MAKE_ALIGNED_OPERATOR_NEW_NOTHROW(NeedsToAlign) \
616 void operator delete(void *ptr, const std::nothrow_t&) throw() { \
617 Eigen::internal::conditional_aligned_free<NeedsToAlign>(ptr); \
619 typedef void eigen_aligned_operator_new_marker_type;
621 #define EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF(NeedsToAlign)
624 #define EIGEN_MAKE_ALIGNED_OPERATOR_NEW EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF(true)
625 #define EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF_VECTORIZABLE_FIXED_SIZE(Scalar,Size) \
626 EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF(bool(((Size)!=Eigen::Dynamic) && ((sizeof(Scalar)*(Size))%16==0)))
650 typedef size_t size_type;
651 typedef std::ptrdiff_t difference_type;
653 typedef const T* const_pointer;
654 typedef T& reference;
655 typedef const T& const_reference;
656 typedef T value_type;
664 pointer address( reference value )
const
669 const_pointer address( const_reference value )
const
691 size_type max_size()
const
693 return (std::numeric_limits<size_type>::max)();
696 pointer allocate( size_type num,
const void* hint = 0 )
698 EIGEN_UNUSED_VARIABLE(hint);
699 internal::check_size_for_overflow<T>(num);
700 return static_cast<pointer
>( internal::aligned_malloc( num *
sizeof(T) ) );
703 void construct( pointer p,
const T& value )
705 ::new( p ) T( value );
709 #if (__cplusplus >= 201103L)
710 template<
typename... Args>
711 void construct(pointer p, Args&&... args)
713 ::new(p) T(std::forward<Args>(args)...);
717 void destroy( pointer p )
722 void deallocate( pointer p, size_type )
724 internal::aligned_free( p );
736 #if !defined(EIGEN_NO_CPUID)
737 # if defined(__GNUC__) && ( defined(__i386__) || defined(__x86_64__) )
738 # if defined(__PIC__) && defined(__i386__)
740 # define EIGEN_CPUID(abcd,func,id) \
741 __asm__ __volatile__ ("xchgl %%ebx, %%esi;cpuid; xchgl %%ebx,%%esi": "=a" (abcd[0]), "=S" (abcd[1]), "=c" (abcd[2]), "=d" (abcd[3]) : "a" (func), "c" (id));
744 # define EIGEN_CPUID(abcd,func,id) \
745 __asm__ __volatile__ ("cpuid": "=a" (abcd[0]), "=b" (abcd[1]), "=c" (abcd[2]), "=d" (abcd[3]) : "a" (func), "c" (id) );
747 # elif defined(_MSC_VER)
748 # if (_MSC_VER > 1500) && ( defined(_M_IX86) || defined(_M_X64) )
749 # define EIGEN_CPUID(abcd,func,id) __cpuidex((int*)abcd,func,id)
758 inline bool cpuid_is_vendor(
int abcd[4],
const char* vendor)
760 return abcd[1]==(
reinterpret_cast<const int*
>(vendor))[0] && abcd[3]==(
reinterpret_cast<const int*
>(vendor))[1] && abcd[2]==(
reinterpret_cast<const int*
>(vendor))[2];
763 inline void queryCacheSizes_intel_direct(
int& l1,
int& l2,
int& l3)
770 abcd[0] = abcd[1] = abcd[2] = abcd[3] = 0;
771 EIGEN_CPUID(abcd,0x4,cache_id);
772 cache_type = (abcd[0] & 0x0F) >> 0;
773 if(cache_type==1||cache_type==3)
775 int cache_level = (abcd[0] & 0xE0) >> 5;
776 int ways = (abcd[1] & 0xFFC00000) >> 22;
777 int partitions = (abcd[1] & 0x003FF000) >> 12;
778 int line_size = (abcd[1] & 0x00000FFF) >> 0;
779 int sets = (abcd[2]);
781 int cache_size = (ways+1) * (partitions+1) * (line_size+1) * (sets+1);
785 case 1: l1 = cache_size;
break;
786 case 2: l2 = cache_size;
break;
787 case 3: l3 = cache_size;
break;
792 }
while(cache_type>0 && cache_id<16);
795 inline void queryCacheSizes_intel_codes(
int& l1,
int& l2,
int& l3)
798 abcd[0] = abcd[1] = abcd[2] = abcd[3] = 0;
800 EIGEN_CPUID(abcd,0x00000002,0);
801 unsigned char * bytes =
reinterpret_cast<unsigned char *
>(abcd)+2;
802 bool check_for_p2_core2 =
false;
803 for(
int i=0; i<14; ++i)
807 case 0x0A: l1 = 8;
break;
808 case 0x0C: l1 = 16;
break;
809 case 0x0E: l1 = 24;
break;
810 case 0x10: l1 = 16;
break;
811 case 0x15: l1 = 16;
break;
812 case 0x2C: l1 = 32;
break;
813 case 0x30: l1 = 32;
break;
814 case 0x60: l1 = 16;
break;
815 case 0x66: l1 = 8;
break;
816 case 0x67: l1 = 16;
break;
817 case 0x68: l1 = 32;
break;
818 case 0x1A: l2 = 96;
break;
819 case 0x22: l3 = 512;
break;
820 case 0x23: l3 = 1024;
break;
821 case 0x25: l3 = 2048;
break;
822 case 0x29: l3 = 4096;
break;
823 case 0x39: l2 = 128;
break;
824 case 0x3A: l2 = 192;
break;
825 case 0x3B: l2 = 128;
break;
826 case 0x3C: l2 = 256;
break;
827 case 0x3D: l2 = 384;
break;
828 case 0x3E: l2 = 512;
break;
829 case 0x40: l2 = 0;
break;
830 case 0x41: l2 = 128;
break;
831 case 0x42: l2 = 256;
break;
832 case 0x43: l2 = 512;
break;
833 case 0x44: l2 = 1024;
break;
834 case 0x45: l2 = 2048;
break;
835 case 0x46: l3 = 4096;
break;
836 case 0x47: l3 = 8192;
break;
837 case 0x48: l2 = 3072;
break;
838 case 0x49:
if(l2!=0) l3 = 4096;
else {check_for_p2_core2=
true; l3 = l2 = 4096;}
break;
839 case 0x4A: l3 = 6144;
break;
840 case 0x4B: l3 = 8192;
break;
841 case 0x4C: l3 = 12288;
break;
842 case 0x4D: l3 = 16384;
break;
843 case 0x4E: l2 = 6144;
break;
844 case 0x78: l2 = 1024;
break;
845 case 0x79: l2 = 128;
break;
846 case 0x7A: l2 = 256;
break;
847 case 0x7B: l2 = 512;
break;
848 case 0x7C: l2 = 1024;
break;
849 case 0x7D: l2 = 2048;
break;
850 case 0x7E: l2 = 256;
break;
851 case 0x7F: l2 = 512;
break;
852 case 0x80: l2 = 512;
break;
853 case 0x81: l2 = 128;
break;
854 case 0x82: l2 = 256;
break;
855 case 0x83: l2 = 512;
break;
856 case 0x84: l2 = 1024;
break;
857 case 0x85: l2 = 2048;
break;
858 case 0x86: l2 = 512;
break;
859 case 0x87: l2 = 1024;
break;
860 case 0x88: l3 = 2048;
break;
861 case 0x89: l3 = 4096;
break;
862 case 0x8A: l3 = 8192;
break;
863 case 0x8D: l3 = 3072;
break;
868 if(check_for_p2_core2 && l2 == l3)
875 inline void queryCacheSizes_intel(
int& l1,
int& l2,
int& l3,
int max_std_funcs)
878 queryCacheSizes_intel_direct(l1,l2,l3);
880 queryCacheSizes_intel_codes(l1,l2,l3);
883 inline void queryCacheSizes_amd(
int& l1,
int& l2,
int& l3)
886 abcd[0] = abcd[1] = abcd[2] = abcd[3] = 0;
887 EIGEN_CPUID(abcd,0x80000005,0);
888 l1 = (abcd[2] >> 24) * 1024;
889 abcd[0] = abcd[1] = abcd[2] = abcd[3] = 0;
890 EIGEN_CPUID(abcd,0x80000006,0);
891 l2 = (abcd[2] >> 16) * 1024;
892 l3 = ((abcd[3] & 0xFFFC000) >> 18) * 512 * 1024;
898 inline void queryCacheSizes(
int& l1,
int& l2,
int& l3)
904 EIGEN_CPUID(abcd,0x0,0);
905 int max_std_funcs = abcd[1];
906 if(cpuid_is_vendor(abcd,
"GenuineIntel"))
907 queryCacheSizes_intel(l1,l2,l3,max_std_funcs);
908 else if(cpuid_is_vendor(abcd,
"AuthenticAMD") || cpuid_is_vendor(abcd,
"AMDisbetter!"))
909 queryCacheSizes_amd(l1,l2,l3);
912 queryCacheSizes_intel(l1,l2,l3,max_std_funcs);
932 inline int queryL1CacheSize()
935 queryCacheSizes(l1,l2,l3);
941 inline int queryTopLevelCacheSize()
943 int l1, l2(-1), l3(-1);
944 queryCacheSizes(l1,l2,l3);
945 return (std::max)(l2,l3);
952 #endif // EIGEN_MEMORY_H