-
Notifications
You must be signed in to change notification settings - Fork 5
/
test_memorypool.h
1553 lines (1322 loc) · 46.4 KB
/
test_memorypool.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// main 함수에서 test()를 실행
//----------------------------------------------------------------
// 필요한 코드 미 포함시 _DEF_PUBLIC_VER를 사용
//#define _DEF_PUBLIC_VER // 공개버전 컴파일 옵션
//----------------------------------------------------------------
// 할당 크기 방식(고정 0 , 가변 1)
// 활성화시 _DEF_USING_MEMORYPOOL_VER 는 3번 또는 30 적용
#define _DEF_USING_RANDOMSIZE_ALLOC 1
// 객체당 크기(고정크기일때 유효)
#define _TYPE_SIZE (256)
//----------------------------------------------------------------
// 메모리풀 사용방법
// 0 메모리풀 사용안함 : 사용자 추가 코드 동작
// 1 상속버전
// 2 _MACRO_ALLOC__FROM_MEMORYPOOL _MACRO_FREE__FROM_MEMORYPOOL
// 3 가변사이즈에 해당되는 메모리풀 접근
// 4 메모리풀 객체에 직접 접근(가장 빠른)
// 13 가변사이즈에 해당되는 메모리풀 접근 - Quick Free(Unsafe)
// 30 가변사이즈에 해당되는 메모리풀 접근(DLL 외부 인터페이스 접근)
// 33 가변사이즈에 해당되는 메모리풀 접근(DLL 외부 인터페이스 접근) - Quick Free(Unsafe) : 약 14% 빠른 해제 버전
#define _DEF_USING_MEMORYPOOL_VER 13
//----------------------------------------------------------------
// alloc / free 전 캐시 무효화 시도
// 이 옵션을 사용하면 alloc 과 alloc 사이, free 와 free 사이에 L1 DATA CAHCE내용을 무효화 시도할 것이다
// 데이터 캐시에 올라와 있는 메모리풀 관련된 것을 제거 하기위해
// 실제 측정결과 옵션을 주고 안주고 차이는 +a 시간이 비슷하게 추가 되었으며
// 메모리풀별로 조금씩 좀더 차이가 난다
// 사용하는 내부 데이터 영향인듯 하다
#define _DEF_USING_CLEAR_CPUCACHE 0
const size_t gc_CpuL1DataCacheSize_per_Core = 16 * 1024;
//----------------------------------------------------------------
#define _DEF_USING_DONT_DELETE 0
//----------------------------------------------------------------
// ▲ 이상, 컴파일 설정
//----------------------------------------------------------------
#if _DEF_USING_RANDOMSIZE_ALLOC
#if _DEF_USING_MEMORYPOOL_VER == 1 || _DEF_USING_MEMORYPOOL_VER == 2 && _DEF_USING_MEMORYPOOL_VER == 4
#undef _DEF_USING_MEMORYPOOL_VER
#define _DEF_USING_MEMORYPOOL_VER 3
#endif
#endif
#ifndef DECLSPEC_CACHEALIGN
#define DECLSPEC_CACHEALIGN __declspec(align(64))
#endif
#if _DEF_USING_CLEAR_CPUCACHE
namespace L1CACHE{
const size_t gc_SizeCacheLine = 64;
const UINT32 g_nData = gc_CpuL1DataCacheSize_per_Core / sizeof(UINT32);
DECLSPEC_CACHEALIGN UINT32 g_Data[g_nData] ={0};
}
void gFN_Clear_CpuCache()
{
const size_t c_Step = L1CACHE::gc_SizeCacheLine / sizeof(L1CACHE::g_Data[0]);
for(size_t i=0; i<L1CACHE::g_nData; i+= c_Step)
{
_mm_prefetch((LPCSTR)L1CACHE::g_Data+i, _MM_HINT_T0);
}
//// 이것이 정상 동작하다면
//// 캐시크기를 n등분하여 n회반복하는 것이 캐시크기전체를 1회 반복하는 것 보다 실행속도가 빠를 것이다
//// -> 테스트 결과, 이것은 의도대로 동작한다
//// 캐시1/4 크기를 4회 반복하는 것 보다 캐시 전체 크기만큼 1회 반복하는 것이 느렸다
//const size_t c_nDivision = 1; // L1캐시 읽기쓰기 1/n
//const size_t c_Step = L1CACHE::gc_SizeCacheLine / sizeof(L1CACHE::g_Data[0]);
//const size_t c_nData = L1CACHE::g_nData / c_nDivision;
//UINT32 ValPrevious = 1;
//for(size_t n=0; n<c_nDivision; n++)
//{
// for(size_t i=0; i<c_nData; i += c_Step)
// {
// L1CACHE::g_Data[i] += ValPrevious;
// ValPrevious = L1CACHE::g_Data[i];
// }
//}
}
#else
#define gFN_Clear_CpuCache __noop
#endif
#ifdef _DEF_PUBLIC_VER
#include <Windows.h>
#include <vector>
#include <stdio.h>
#include <iostream>
#include <bitset>
#include <conio.h>
class CUnCopyAble{};
#if defined(_WIN64)
#define __X86 0
#define __X64 1
#elif defined(_WIN32)
#define __X86 1
#define __X64 0
#else
#error 대상 플렛폼을 추가 하십시오
#endif
#define _Assert(...) __noop
#define _MACRO_BIT_COUNT(n) __popcnt(n)
#if _DEF_USING_MEMORYPOOL_VER != 0 && _DEF_USING_MEMORYPOOL_VER != 30
#pragma message("비공개 사용자가 사용하기 위해 _DEF_USING_MEMORYPOOL_VER = 30이 강제되었습니다. 사용하지 않으려면 0을 적용하십시오")
#undef _DEF_USING_MEMORYPOOL_VER
#define _DEF_USING_MEMORYPOOL_VER 30
#endif
namespace CORE{
HMODULE g_hDLL_Core = 0;
}
template<typename T>
void gFN_Call_Destructor(T* p){
p->~T();
}
#ifndef NEW
#define NEW new
#endif
#define _MACRO_CALL_CONSTRUCTOR(P, T) new(P) T
#define _MACRO_CALL_DESTRUCTOR(P) gFN_Call_Destructor(P)
// 매롱
#define _SAFE_NEW_ARRAY_ALIGNED_CACHELINE(P,T,N) P = (void**)::_aligned_malloc(sizeof(void*)*N, 64)
#define _SAFE_DELETE_ARRAY_ALIGNED_CACHELINE(P,N) ::_aligned_free(P), P=nullptr
#define _MACRO_OUTPUT_DEBUG_STRING_ALWAYS OutputDebugStringA
#define _SAFE_CLOSE_HANDLE(H) CloseHandle(H), H=(HANDLE)12345678
namespace ENGINE{
class CEngine{
public:
CEngine()
{
const LPCSTR szName_CoreDLL =
#if __X64
#ifdef _DEBUG
("Core_x64D.dll");
#else
("Core_x64.dll");
#endif
#elif __X86
#ifdef _DEBUG
("Core_x86D.dll");
#else
("Core_x86.dll");
#endif
#endif
CORE::g_hDLL_Core = LoadLibraryA(szName_CoreDLL);
if(!CORE::g_hDLL_Core)
{
MessageBoxA(NULL, szName_CoreDLL, "Failed Load", MB_ICONERROR);
return;
}
struct TLSTCACHE{
size_t _1;
size_t _2;
static TLSTCACHE& Get()
{
static __declspec(thread) TLSTCACHE _Instance;
return _Instance;
}
};
__interface IHandle{
void __1();
void __2();
void __3();
void __4();
void __5();
void __6();
void __7();
void __8(TLSTCACHE&(*)(void));
};
__interface ICore{
void __1();
IHandle* __2();
};
typedef ICore* (*_TYPE_FN_GetCOre)(void);
_TYPE_FN_GetCOre pFN = reinterpret_cast<_TYPE_FN_GetCOre>(::GetProcAddress(CORE::g_hDLL_Core, "GetCore"));
auto pCore = pFN();
auto pTool = pCore->__2();
pTool->__8(TLSTCACHE::Get);
}
~CEngine()
{
if(CORE::g_hDLL_Core)
::FreeLibrary(CORE::g_hDLL_Core);
}
};
}
#else
#include "../../Output/Engine_include.h"
#include "../../Output/Engine_import.h"
#endif
#include <Psapi.h>
#include <atlpath.h>
#include "DLL_Opener.h"
#ifndef _DEF_CACHELINE_SIZE
#define _DEF_CACHELINE_SIZE 64
#endif
//#define _DEF_TEST_TCMALLOC
#define _DEF_TEST_TBBMALLOC
#ifdef _DEF_TEST_TCMALLOC
#include "e:/lib/tcmalloc/tcmalloc.h"
#pragma comment(lib, "e:/lib/tcmalloc/libtcmalloc_minimal.lib")
#elif defined(_DEF_TEST_TBBMALLOC)
//#include "e:/lib/tbbmalloc/tbbmalloc_proxy.h"
//#pragma comment(lib, "e:/lib/tbbmalloc/tbbmalloc_proxy.lib")
//#pragma comment(linker, "/include:__TBB_malloc_proxy")
typedef void* (*FunctionPTR_Malloc)(size_t);
typedef void (*FunctionPTR_Free)(void*);
FunctionPTR_Malloc scalable_malloc = nullptr;
FunctionPTR_Free scalable_free = nullptr;
struct TBB_Initialize{
CDLL_Opener o;
static LPCSTR s_szName[];
static LPCSTR s_szFileName[];
TBB_Initialize()
{
//Initialize();
}
DECLSPEC_NOINLINE void Initialize(int index_Ver)
{
if(!o.mFN_Load_Library(s_szFileName[index_Ver]))
MessageBoxA(NULL, s_szFileName[index_Ver], "Failed Load", MB_ICONERROR);
scalable_malloc = (FunctionPTR_Malloc)o.mFN_Get_ProcAddress("scalable_malloc");
scalable_free = (FunctionPTR_Free)o.mFN_Get_ProcAddress("scalable_free");
//if(scalable_malloc)
// OutputDebugStringA("linked scalable_malloc\n");
//if(scalable_free)
// OutputDebugStringA("linked scalable_free\n");
}
}tbbload;
LPCSTR TBB_Initialize::s_szName[] =
{
"TBB Ver4.4 20150728",
"TBB Ver4.4 20160128",
};
LPCSTR TBB_Initialize::s_szFileName[] =
{
#if __X86
"tbbmalloc86_44_20150728.dll",
"tbbmalloc86_44_20160128.dll",
#elif __X64
"tbbmalloc64_44_20150728.dll",
"tbbmalloc64_44_20160128.dll",
#else
#error
#endif
};
#endif
namespace CORE{
extern HMODULE g_hDLL_Core;
#if _DEF_USING_DEBUG_MEMORY_LEAK
void*(*CoreAlloc)(size_t, const char*, int) = nullptr;
#else
void*(*CoreAlloc)(size_t) = nullptr;
#endif
void(*CoreFree)(void*)=nullptr;
}
// 2GB
#if __X64
const size_t GuideSize = (size_t)2 * 1024 * 1024 * 1024;
#else
const size_t GuideSize = (size_t)1 * 1024 * 1024 * 1024;
#endif
#if _DEF_USING_RANDOMSIZE_ALLOC
size_t iSizeMin_Rnd;
size_t iSizeMax_Rnd;
std::vector<size_t> vRandomSeed;
#endif
size_t nLoopTest;
size_t iSize_UseMemory;
size_t nTotalCNT;
size_t nCNTPerThread;
BOOL bUsingThread = TRUE;
DWORD nNumThread = 2;
BOOL bUseMemoryPool = FALSE;
volatile LONG g_nCntReady = 0;
const DWORD gc_MaxThread = 32;
HANDLE hThreads[gc_MaxThread] = {NULL};
HANDLE hEvent_Start;
HANDLE hEvents_Done[gc_MaxThread] = {NULL};
BOOL bTest_Value = 1;
class CA{
public:
char data[_TYPE_SIZE];
};
#if _DEF_USING_MEMORYPOOL_VER == 1
class CAm: public UTIL::MEM::CMemoryPoolResource{
public:
char data[_TYPE_SIZE];
};
#else
class CAm{
public:
char data[_TYPE_SIZE];
};
#endif
#if _DEF_USING_RANDOMSIZE_ALLOC
typedef void (*_TYPE_FN_New_Deletel)(void**, size_t);
typedef void (*_TYPE_FN_New_Delete__Pool)(void**, size_t);
#else
typedef void (*_TYPE_FN_New_Deletel)(CA**);
typedef void (*_TYPE_FN_New_Delete__Pool)(CAm**);
#endif
_TYPE_FN_New_Deletel gpFN_NEW_DELETE_OTHER = nullptr;
_TYPE_FN_New_Delete__Pool gpFN_NEW_DELETE_POOL = nullptr;
void _Delay()
{
return;
int r = rand();
if(r == 0)
return;
r &= 0x07;
Sleep(r);
}
// 직접실행창 테스트
size_t FindAddress(void** pTable, size_t nTable, void* pAddress, size_t size)
{
char* pS = (char*)pAddress;
char* pE = pS + size;
size_t cnt=0;
for(size_t i=0; i<nTable; i++)
{
char* pT = (char*)pTable[i];
if(pS <= pT && pT < pE)
{
cnt++;
_MACRO_OUTPUT_DEBUG_STRING("Thread[%u] index = %Iu [0x%IX]\n", ::GetCurrentThreadId(), i, i);
}
}
return cnt;
}
bool memtest(const void* pPTR, char code, size_t size)
{
char* pC = (char*)pPTR;
if(size < 16) {
for(size_t i=0; i<size; i++)
if(*(pC+i) != code)
return false;
return true;
}
while((size_t)pC % sizeof(size_t) != 0)
{
if(*pC != code)
return false;
pC++;
size--;
}
size_t wCode = 0;
for(size_t i=0; i<sizeof(size_t); i++)
wCode = (wCode << 8) | (size_t)(byte)code;
size_t nWord = size / sizeof(size_t);
size_t nChar = size % sizeof(size_t);
size_t* pWord = (size_t*)pC;
size_t* pWordEnd = pWord + nWord;
do{
if(*pWord != wCode)
return false;
pWord++;
}while(pWord < pWordEnd);
pC = (char*)pWord;
char* pCEnd = pC + nChar;
for(;pC < pCEnd;pC++)
{
if(*pC != code)
return false;
}
return true;
}
bool memtest2(const void* pPTR, char code, size_t size)
{
if(size < _DEF_CACHELINE_SIZE)
return memtest(pPTR, code, size);
const char* pC = (char*)pPTR;
const char* pCS_Aligned = (char*)((size_t)pC & ~(_DEF_CACHELINE_SIZE-1));
if(pC != pCS_Aligned)
{
pCS_Aligned += _DEF_CACHELINE_SIZE;
memtest(pC, code, pCS_Aligned - pC);
pC = pCS_Aligned;
}
// 캐시라인 단위 처리
const char* pE = (char*)pPTR + size;
const char* pE_Aligned = (char*)((size_t)pE & ~(_DEF_CACHELINE_SIZE-1));
size_t wCode = 0;
for(size_t i=0; i<sizeof(size_t); i++)
wCode = (wCode << 8) | (size_t)(byte)code;
//DECLSPEC_CACHEALIGN __m128 code128;
//memset(&code128, code, sizeof(code128));
for(; pC != pE_Aligned; pC += _DEF_CACHELINE_SIZE)
{
// 4단계후를 미리 로드
_mm_prefetch(pC+_DEF_CACHELINE_SIZE*4, _MM_HINT_T0);
const size_t* pW = (size_t*)pC;
size_t t = 0;
#define _MACRO_UNROLLING4(i) t |= (wCode ^ pW[i+0]), t |= (wCode ^ pW[i+1]), t |= (wCode ^ pW[i+2]), t |= (wCode ^ pW[i+3])
#if __X86
_MACRO_UNROLLING4(0);
_MACRO_UNROLLING4(4);
_MACRO_UNROLLING4(8);
_MACRO_UNROLLING4(12);
#elif __X64
//const __m128 r1 = _mm_xor_ps(*(__m128*)pC, code128);
//t = r1.m128_u64[0] | r1.m128_u64[1];
//const __m128 r2 = _mm_xor_ps(*(__m128*)(pC+16), code128);
//t |= r2.m128_u64[0], t |= r2.m128_u64[1];
//const __m128 r3 = _mm_xor_ps(*(__m128*)(pC+32), code128);
//t |= r3.m128_u64[0], t |= r3.m128_u64[1];
//const __m128 r4 = _mm_xor_ps(*(__m128*)(pC+48), code128);
//t |= r4.m128_u64[0], t |= r4.m128_u64[1];
//if(t)
// return false;
_MACRO_UNROLLING4(0);
_MACRO_UNROLLING4(4);
#else
#error
#endif
#undef _MACRO_UNROLLING4
if(t)
return false;
}
if(pC == pE)
return true;
// 남은 부분 처리
return memtest(pC, code, pE-pC);
}
void ValueSet(void* val, size_t code, size_t size)
{
//memset(val, code, size);
DWORD tid = ::GetCurrentThreadId();
DWORD* ptid = (DWORD*)val;
*ptid = tid;
UINT32* pindex =(UINT32*)(ptid+1);
*pindex = (UINT32)code;
char* p = (char*)(pindex+1);
memset(p, code&0xff, size-sizeof(DWORD)-sizeof(UINT32));
}
void ValueCheck(void* val, size_t code, size_t size)
{
//if(!memtest2(val, code, size))
// MessageBoxA(NULL, "WTF?", "", MB_ICONERROR);
BOOL Failed = FALSE;
DWORD tid = ::GetCurrentThreadId();
DWORD* ptid = (DWORD*)val;
*ptid = tid;
UINT32* pindex =(UINT32*)(ptid+1);
*pindex = (UINT32)code;
char* p = (char*)(pindex+1);
if(*ptid != tid)
Failed = TRUE;
if(*pindex != (UINT32)code)
Failed = TRUE;
const byte _temp_code = *(byte*)p;
if(!memtest2(p, code&0xff, size-sizeof(DWORD)-sizeof(UINT32)))
Failed = TRUE;
if(Failed)
MessageBoxA(NULL, "WTF?", "", MB_ICONERROR);
}
template<typename T>
void ValueSet(T* p, size_t code)
{
memset(p->data, code&0xff, sizeof(T::data));
}
template<typename T>
void ValueCheck(T* p, size_t code)
{
if(!memtest2(p->data, code&0xff, sizeof(T::data)))
MessageBoxA(NULL, "WTF?", "", MB_ICONERROR);
}
void ValueSet__Default(void* val, size_t size)
{
byte* p = (byte*)val;
byte* pE = p + size;
// TBB의 경우 메모리풀 자체에서 VirtualAlloc후 주소에 값을 쓰지 않는 영역이 많다
// 이때 실제 물리적인 메모리 연결이 일어나지 않기 때문에 실제사용에서의 속도와 차이가 있다
// 이에 따라 시스템 할당단위인 4KB 단위마다 값을 기록해준다
do{
*p = 0;
p += (1024*4);
}while(p < pE);
}
#pragma region 할당 해제 함수
DECLSPEC_NOINLINE void gFN_NEW_DELETE__POOL(CAm** p)
{
typedef CAm T;
#if _DEF_USING_MEMORYPOOL_VER == 4
UTIL::MEM::IMemoryPool* pPool = UTIL::g_pMem->mFN_Get_MemoryPool(sizeof(T));
#endif
for(size_t i=0; i<nCNTPerThread; i++)
{
gFN_Clear_CpuCache();
#if _DEF_USING_MEMORYPOOL_VER == 0
#error //do to
#elif _DEF_USING_MEMORYPOOL_VER == 1
p[i] = NEW T;
#elif _DEF_USING_MEMORYPOOL_VER == 2
_MACRO_ALLOC__FROM_MEMORYPOOL(p[i]);
_MACRO_CALL_CONSTRUCTOR(p[i], T);
#elif _DEF_USING_MEMORYPOOL_VER == 3
p[i] = (T*)_MACRO_ALLOC__FROM_MEMORYPOOL_GENERIC(sizeof(CAm));
_MACRO_CALL_CONSTRUCTOR(p[i], T);
#elif _DEF_USING_MEMORYPOOL_VER == 4
p[i] = (T*)pPool->mFN_Get_Memory(sizeof(T));
_MACRO_CALL_CONSTRUCTOR(p[i], T);
#elif _DEF_USING_MEMORYPOOL_VER == 13
p[i] = (T*)_MACRO_ALLOC__FROM_MEMORYPOOL_GENERIC(sizeof(CAm));
_MACRO_CALL_CONSTRUCTOR(p[i], T);
#elif _DEF_USING_MEMORYPOOL_VER == 30 || _DEF_USING_MEMORYPOOL_VER == 33
#if _DEF_USING_DEBUG_MEMORY_LEAK
p[i] = (T*)CORE::CoreAlloc(sizeof(CAm), __FILE__, __LINE__);
#else
p[i] = (T*)CORE::CoreAlloc(sizeof(CAm));
#endif
_MACRO_CALL_CONSTRUCTOR(p[i], T);
#else
#error
_SAFE_NEW__MEMORYPOOL_MANAGER__FORCEALIGNED(p[i], CAm);
#endif
if(bTest_Value)
ValueSet(p[i], i);
else
ValueSet__Default(p[i], sizeof(CAm::data));
}
_Delay();
#if _DEF_USING_DONT_DELETE
return;
#endif
for(size_t i=0; i<nCNTPerThread; i++)
{
gFN_Clear_CpuCache();
if(bTest_Value)
ValueCheck(p[i], i);
#if _DEF_USING_MEMORYPOOL_VER == 0
#error //do to
#elif _DEF_USING_MEMORYPOOL_VER == 1
delete p[i];
#elif _DEF_USING_MEMORYPOOL_VER == 2
_MACRO_CALL_DESTRUCTOR(p[i]);
_MACRO_FREE__FROM_MEMORYPOOL(p[i]);
#elif _DEF_USING_MEMORYPOOL_VER == 3
_MACRO_CALL_DESTRUCTOR(p[i]);
_MACRO_FREE__FROM_MEMORYPOOL_GENERIC(p[i]);
#elif _DEF_USING_MEMORYPOOL_VER == 4
_MACRO_CALL_DESTRUCTOR(p[i]);
pPool->mFN_Return_Memory(p[i]);
#elif _DEF_USING_MEMORYPOOL_VER == 13
_MACRO_CALL_DESTRUCTOR(p[i]);
_MACRO_FREEQ__FROM_MEMORYPOOL_GENERIC(p[i]);
#elif _DEF_USING_MEMORYPOOL_VER == 30 || _DEF_USING_MEMORYPOOL_VER == 33
_MACRO_CALL_DESTRUCTOR(p[i]);
CORE::CoreFree(p[i]);
#else
#error
_SAFE_DELETE__MEMORYPOOL_MANAGER__FORCEALIGNED(p[i]);
#endif
}
}
DECLSPEC_NOINLINE void gFN_NEW_DELETE_LFH(CA** p)
{
typedef CA T;
for(size_t i=0; i<nCNTPerThread; i++)
{
gFN_Clear_CpuCache();
p[i] = (T*)::malloc(sizeof(T));
_MACRO_CALL_CONSTRUCTOR(p[i], T);
if(bTest_Value)
ValueSet(p[i], i);
else
ValueSet__Default(p[i], sizeof(CA::data));
}
_Delay();
#if _DEF_USING_DONT_DELETE
return;
#endif
for(size_t i=0; i<nCNTPerThread; i++)
{
gFN_Clear_CpuCache();
if(bTest_Value)
ValueCheck(p[i], i);
_MACRO_CALL_DESTRUCTOR(p[i]);
::free(p[i]);
}
}
DECLSPEC_NOINLINE void gFN_NEW_DELETE_TBB(CA** p)
{
typedef CA T;
for(size_t i=0; i<nCNTPerThread; i++)
{
gFN_Clear_CpuCache();
p[i] = (T*)::scalable_malloc(sizeof(T));
_MACRO_CALL_CONSTRUCTOR(p[i], T);
if(bTest_Value)
ValueSet(p[i], i);
else
ValueSet__Default(p[i], sizeof(CA::data));
}
_Delay();
#if _DEF_USING_DONT_DELETE
return;
#endif
for(size_t i=0; i<nCNTPerThread; i++)
{
gFN_Clear_CpuCache();
if(bTest_Value)
ValueCheck(p[i], i);
_MACRO_CALL_DESTRUCTOR(p[i]);
::scalable_free(p[i]);
}
}
#if _DEF_USING_RANDOMSIZE_ALLOC
DECLSPEC_NOINLINE void gFN_NEW_DELETE__POOL(void** p, size_t iS)
{
typedef void T;
for(size_t i=0; i<nCNTPerThread; i++)
{
gFN_Clear_CpuCache();
const size_t size = vRandomSeed[iS+i];
#if _DEF_USING_MEMORYPOOL_VER == 0
#error //do to
#elif _DEF_USING_MEMORYPOOL_VER == 30 || _DEF_USING_MEMORYPOOL_VER == 33
#if _DEF_USING_DEBUG_MEMORY_LEAK
p[i] = (T*)CORE::CoreAlloc(size, __FILE__, __LINE__);
#else
p[i] = (T*)CORE::CoreAlloc(size);
#endif
#elif _DEF_USING_MEMORYPOOL_VER == 13
p[i] = (T*)_MACRO_ALLOC__FROM_MEMORYPOOL_GENERIC(size);
#else
p[i] = (T*)_MACRO_ALLOC__FROM_MEMORYPOOL_GENERIC(size);
#endif
if(bTest_Value)
ValueSet(p[i], i, size);
else
ValueSet__Default(p[i], size);
}
_Delay();
#if _DEF_USING_DONT_DELETE
return;
#endif
for(size_t i=0; i<nCNTPerThread; i++)
{
gFN_Clear_CpuCache();
const size_t size = vRandomSeed[iS+i];
if(bTest_Value)
ValueCheck(p[i], i, size);
#if _DEF_USING_MEMORYPOOL_VER == 0
#error //do to
#elif _DEF_USING_MEMORYPOOL_VER == 30 || _DEF_USING_MEMORYPOOL_VER == 33
CORE::CoreFree(p[i]);
#elif _DEF_USING_MEMORYPOOL_VER == 13
_MACRO_FREEQ__FROM_MEMORYPOOL_GENERIC(p[i]);
#else
_MACRO_FREE__FROM_MEMORYPOOL_GENERIC(p[i]);
#endif
}
}
DECLSPEC_NOINLINE void gFN_NEW_DELETE_LFH(void** p, size_t iS)
{
typedef void T;
for(size_t i=0; i<nCNTPerThread; i++)
{
gFN_Clear_CpuCache();
const size_t size = vRandomSeed[iS+i];
p[i] = ::malloc(size);
if(bTest_Value)
ValueSet(p[i], i, size);
else
ValueSet__Default(p[i], size);
}
_Delay();
#if _DEF_USING_DONT_DELETE
return;
#endif
for(size_t i=0; i<nCNTPerThread; i++)
{
gFN_Clear_CpuCache();
const size_t size = vRandomSeed[iS+i];
if(bTest_Value)
ValueCheck(p[i], i, size);
::free(p[i]);
}
}
DECLSPEC_NOINLINE void gFN_NEW_DELETE_TBB(void** p, size_t iS)
{
typedef void T;
for(size_t i=0; i<nCNTPerThread; i++)
{
gFN_Clear_CpuCache();
const size_t size = vRandomSeed[iS+i];
p[i] = (T*)scalable_malloc(size);
if(bTest_Value)
ValueSet(p[i], i, size);
else
ValueSet__Default(p[i], size);
}
_Delay();
#if _DEF_USING_DONT_DELETE
return;
#endif
for(size_t i=0; i<nCNTPerThread; i++)
{
gFN_Clear_CpuCache();
const size_t size = vRandomSeed[iS+i];
if(bTest_Value)
ValueCheck(p[i], i, size);
scalable_free(p[i]);
}
}
#endif
#if !_DEF_USING_RANDOMSIZE_ALLOC
DECLSPEC_NOINLINE double MainThreadFunction()
{
void** p = nullptr;
_SAFE_NEW_ARRAY_ALIGNED_CACHELINE(p, void*(nullptr), nCNTPerThread);
LONGLONG total = 0;
LARGE_INTEGER TimeBegin, TimeEnd, TimeFrequency;
if(bUseMemoryPool)
{
CAm** pCAm = (CAm**)p;
for(size_t cntLoop=0; cntLoop<nLoopTest; cntLoop++)
{
if(1 < nNumThread)
{
::InterlockedIncrement(&g_nCntReady);
while(g_nCntReady != nNumThread);
g_nCntReady = 0;
for(size_t i=1; i<nNumThread; i++)
::ResetEvent(hEvents_Done[i]);
}
auto prev = ::SetThreadAffinityMask(::GetCurrentThread(), 1);
::QueryPerformanceCounter(&TimeBegin);
SetThreadAffinityMask(::GetCurrentThread(), prev);
if(1 < nNumThread)
::SetEvent(hEvent_Start);
gpFN_NEW_DELETE_POOL(pCAm);
if(1 < nNumThread)
{
::WaitForMultipleObjects(nNumThread-1, hEvents_Done+1, TRUE, INFINITE);
}
prev = ::SetThreadAffinityMask(::GetCurrentThread(), 1);
::QueryPerformanceCounter(&TimeEnd);
::SetThreadAffinityMask(::GetCurrentThread(), prev);
total += (TimeEnd.QuadPart - TimeBegin.QuadPart);
}
}
else
{
CA** pCA = (CA**)p;
for(size_t cntLoop=0; cntLoop<nLoopTest; cntLoop++)
{
if(1 < nNumThread)
{
::InterlockedIncrement(&g_nCntReady);
while(g_nCntReady != nNumThread);
g_nCntReady = 0;
for(size_t i=1; i<nNumThread; i++)
::ResetEvent(hEvents_Done[i]);
}
auto prev = ::SetThreadAffinityMask(::GetCurrentThread(), 1);
::QueryPerformanceCounter(&TimeBegin);
::SetThreadAffinityMask(::GetCurrentThread(), prev);
if(1 < nNumThread)
::SetEvent(hEvent_Start);
gpFN_NEW_DELETE_OTHER(pCA);
if(1 < nNumThread)
{
::WaitForMultipleObjects(nNumThread-1, hEvents_Done+1, TRUE, INFINITE);
}
prev = ::SetThreadAffinityMask(::GetCurrentThread(), 1);
::QueryPerformanceCounter(&TimeEnd);
::SetThreadAffinityMask(::GetCurrentThread(), prev);
total += (TimeEnd.QuadPart - TimeBegin.QuadPart);
}
}
_SAFE_DELETE_ARRAY_ALIGNED_CACHELINE(p, nCNTPerThread);
auto prev = ::SetThreadAffinityMask(::GetCurrentThread(), 1);
::QueryPerformanceFrequency(&TimeFrequency);
::SetThreadAffinityMask(::GetCurrentThread(), prev);
return double(total) / TimeFrequency.QuadPart;
}
unsigned __stdcall ThreadFunction(void* _pParam)
{
size_t id = (size_t)_pParam;
void** p = nullptr;
_SAFE_NEW_ARRAY_ALIGNED_CACHELINE(p, void*, nCNTPerThread);
if(bUseMemoryPool)
{
CAm** pCAm = (CAm**)p;
for(size_t cntLoop=0; cntLoop<nLoopTest; cntLoop++)
{
::InterlockedIncrement(&g_nCntReady);
::WaitForSingleObject(hEvent_Start, INFINITE);
gpFN_NEW_DELETE_POOL(pCAm);
::SetEvent(hEvents_Done[id]);
::ResetEvent(hEvent_Start);
}
}
else
{
CA** pCA = (CA**)p;
for(size_t cntLoop=0; cntLoop<nLoopTest; cntLoop++)
{
::InterlockedIncrement(&g_nCntReady);
::WaitForSingleObject(hEvent_Start, INFINITE);
gpFN_NEW_DELETE_OTHER(pCA);
::SetEvent(hEvents_Done[id]);
::ResetEvent(hEvent_Start);
}
}
_SAFE_DELETE_ARRAY_ALIGNED_CACHELINE(p, nCNTPerThread);
return 0;
}
#else
DECLSPEC_NOINLINE double MainThreadFunction()
{
void** p = nullptr;
_SAFE_NEW_ARRAY_ALIGNED_CACHELINE(p, void*(nullptr), nCNTPerThread);
LONGLONG total = 0;
LARGE_INTEGER TimeBegin, TimeEnd, TimeFrequency;
if(bUseMemoryPool)
{
for(size_t cntLoop=0; cntLoop<nLoopTest; cntLoop++)
{
if(1 < nNumThread)
{
::InterlockedIncrement(&g_nCntReady);
while(g_nCntReady != nNumThread);
g_nCntReady = 0;
for(size_t i=1; i<nNumThread; i++)
::ResetEvent(hEvents_Done[i]);
}
auto prev = ::SetThreadAffinityMask(::GetCurrentThread(), 1);
::QueryPerformanceCounter(&TimeBegin);
SetThreadAffinityMask(::GetCurrentThread(), prev);
if(1 < nNumThread)
::SetEvent(hEvent_Start);
gpFN_NEW_DELETE_POOL(p, 0);
if(1 < nNumThread)
{
::WaitForMultipleObjects(nNumThread-1, hEvents_Done+1, TRUE, INFINITE);
}
prev = ::SetThreadAffinityMask(::GetCurrentThread(), 1);
::QueryPerformanceCounter(&TimeEnd);
::SetThreadAffinityMask(::GetCurrentThread(), prev);
total += (TimeEnd.QuadPart - TimeBegin.QuadPart);
}
}
else
{
for(size_t cntLoop=0; cntLoop<nLoopTest; cntLoop++)
{
if(1 < nNumThread)
{
::InterlockedIncrement(&g_nCntReady);