-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmemtest.cpp
More file actions
790 lines (697 loc) · 24.2 KB
/
Copy pathmemtest.cpp
File metadata and controls
790 lines (697 loc) · 24.2 KB
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
/*
* Copyright (C) 2007 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/time.h>
#include <time.h>
#include <unistd.h>
#include <sched.h>
#include <sys/resource.h>
#include <sys/syscall.h>
#include <sys/types.h>
#include <sys/mman.h>
#if 0
const int DCACHE_SIZE = 8*1024;
const int CPU_FREQ_EST = 195;
const int BRANCH_CYCLE = 3;
#else
//const int DCACHE_SIZE = 32*1024;
const int DCACHE_SIZE = 16*1024*1024;/*Harry*/
const int CPU_FREQ_EST = 384;
const int BRANCH_CYCLE = 2;
#endif
//extern "C" void* xmemcpy(void*, void*, size_t);
#define MEMCPY memcpy
typedef long long nsecs_t;
static nsecs_t system_time()
{
struct timespec t;
t.tv_sec = t.tv_nsec = 0;
clock_gettime(CLOCK_MONOTONIC, &t);
return nsecs_t(t.tv_sec)*1000000000LL + t.tv_nsec;
}
nsecs_t loop_overhead(size_t count) __attribute__((noinline));
nsecs_t loop_overhead(size_t count)
{
nsecs_t overhead = -system_time();
do {
asm volatile ("":::"memory");
} while (--count);
overhead += system_time();
return overhead;
}
static void preload(volatile char* addr, size_t s)
{
for (size_t i=0 ; i<s ; i+=32) {
char c = addr[i];
(void)c;
}
}
static void usage(char* p) {
printf( "Usage: %s <test> <options>\n"
"<test> is one of the following:\n"
" cpufreq\n"
" memcpy [perf [fast] | test]\n"
" memset [perf | test]\n"
" memcmp [perf | test]\n"
" strlen [perf | test]\n"
" malloc [fill]\n"
" madvise\n"
" resampler\n"
" crash\n"
" stack (stack smasher)\n"
" crawl\n"
, p);
}
int cpufreq_test(int argc, char** argv);
int memcpy_test(int argc, char** argv);
int memset_test(int argc, char** argv);
int memcmp_test(int argc, char** argv);
int strlen_test(int argc, char** argv);
int malloc_test(int argc, char** argv);
int madvise_test(int argc, char** argv);
int crash_test(int argc, char** argv);
int stack_smasher_test(int argc, char** argv);
int crawl_test(int argc, char** argv);
int fp_test(int argc, char** argv);
#if 0
#pragma mark -
#pragma mark main
#endif
int main(int argc, char** argv)
{
if (argc == 1) {
usage(argv[0]);
return 0;
}
int err = -1;
if (!strcmp(argv[1], "cpufreq")) err = cpufreq_test(argc-1, argv+1);
else if (!strcmp(argv[1], "memcpy")) err = memcpy_test(argc-1, argv+1);
else if (!strcmp(argv[1], "memset")) err = memset_test(argc-1, argv+1);
else if (!strcmp(argv[1], "memcmp")) err = memcmp_test(argc-1, argv+1);
else if (!strcmp(argv[1], "strlen")) err = strlen_test(argc-1, argv+1);
else if (!strcmp(argv[1], "malloc")) err = malloc_test(argc-1, argv+1);
else if (!strcmp(argv[1], "madvise")) err = madvise_test(argc-1, argv+1);
else if (!strcmp(argv[1], "crash")) err = crash_test(argc-1, argv+1);
else if (!strcmp(argv[1], "stack")) err = stack_smasher_test(argc-1, argv+1);
else if (!strcmp(argv[1], "crawl")) err = crawl_test(argc-1, argv+1);
#if 0/*Harry*/
else if (!strcmp(argv[1], "fp")) err = fp_test(argc-1, argv+1);
#endif
if (err) {
usage(argv[0]);
}
return 0;
}
#if 0
#pragma mark -
#pragma mark memcpy
#endif
int validate_memcpy(char* s, char* d, size_t size);
int validate_memset(char* s, char c, size_t size);
int memcpy_test(int argc, char** argv)
{
int option = 0;
if (argc >= 2) {
if (!strcmp(argv[1], "perf")) option = 0;
else if (!strcmp(argv[1], "test")) option = 1;
else return -1;
}
#if 1 /*Harry: I want to add samples*/
//const int MAX_SIZE = 4096*1024; // 4MB
const int MAX_SIZE = 16*1024*1024; // 16MB
#else
const int MAX_SIZE = 1024*1024; // 1MB
#endif
const int CACHED_SPEED_EST = CPU_FREQ_EST*1024*1024; // 150 MB/s
const int UNCACHED_SPEED_EST = (CPU_FREQ_EST/4)*1024*1024; // 60 MB/s
char* src = (char*)malloc(MAX_SIZE+4+8+32);
char* dst = (char*)malloc(MAX_SIZE+4+8+32);
memset(src, 0, MAX_SIZE+4+8+32);
memset(dst, 0, MAX_SIZE+4+8+32);
if (option == 0) {
bool fast = (argc>=3 && !strcmp(argv[2], "fast"));
printf("memcpy() performance test is running, please wait...\n");
fflush(stdout);
usleep(10000);
setpriority(PRIO_PROCESS, 0, -20);
static int FAST_SIZES[] = { 1024, DCACHE_SIZE/2, DCACHE_SIZE, DCACHE_SIZE*2, MAX_SIZE };
struct result_t { int size; float res; };
result_t* results = (result_t*)src;
int nbr = 0;
int size = 0;
for (int i=0 ; ; i++) {
if (!fast) {
if (size<128) size += 8;
#if 0 /*Harry: I want to add samples for assuming cacheline=64B*/
else if (size<32768) size += 64; /*assume L1=32KB, plot cacheline size*/
else if (size<524288) size += 128; /*assume L2=512KB, plot AXI width*/
else size += 256;
#else
else if (size<1024) size += 128;
else if (size<16384) size += 1024;
else size <<= 1;
#endif
} else {
if (size_t(i) >= sizeof(FAST_SIZES)/sizeof(FAST_SIZES[0]))
break;
size = FAST_SIZES[i];
}
if (size > MAX_SIZE) {
break;
}
const int REPEAT = (((size < DCACHE_SIZE) ?
(CACHED_SPEED_EST) : (UNCACHED_SPEED_EST)) / size) / 2;
// ~0.5 second per test
const nsecs_t overhead = loop_overhead(REPEAT);
// tweak to make it a bad case
char* ddd = (char*)((long(dst+31)&~31) + 4);
char* sss = (char*)((long(src+31)&~31) + 28);
for (int offset=0 ; offset<=2 ; offset +=2 ) {
memcpy(dst, src, size); // just make sure to load the caches I/D
nsecs_t t = -system_time();
register int count = REPEAT;
do {
MEMCPY(ddd, sss+offset, size);
} while (--count);
t += system_time() - overhead;
const float throughput = (size*1000000000.0f*REPEAT) / (1024*1024*t);
results[nbr].size = size;
results[nbr].res = throughput;
nbr++;
}
}
printf("%9s %9s %9s\n", "size", "MB/s", "MB/s (nc)");
for (int i=0 ; i<nbr ; i+=2) {
printf("%9d %9ld %9ld\n", results[i].size, (long)results[i].res, (long)results[i+1].res);
}
} else if (option == 1) {
printf("memcpy() validation test is running, please wait...\n");
fflush(stdout);
char* curr = (char*)src;
for (int i=0 ; i<MAX_SIZE ; i++) {
char c = rand();
*curr++ = c != 0x55 ? c : 0xAA;
}
char* s = src + 1024;
char* d = dst + 1024;
int nb = 0;
for (int size=0 ; size<4096 && !nb ; size++) {
nb += validate_memcpy(s, d, size);
for (int o=1 ; o<32 && !nb ; o++) {
nb += validate_memcpy(s+o, d, size);
nb += validate_memcpy(s, d+o, size);
nb += validate_memcpy(s+o, d+o, size);
}
}
if (nb) printf("%d error(s) found\n", nb);
else printf("success!\n");
}
fflush(stdout);
free(dst);
free(src);
return 0;
}
int validate_memcpy(char* s, char* d, size_t size)
{
int nberr = 0;
memset(d-4, 0x55, size+8);
MEMCPY(s, d, size);
if (memcmp(s,d,size)) {
printf("*** memcpy(%p,%p,%zd) destination != source\n",s,d,size);
nberr++;
}
bool r = (d[size]==0x55)&&(d[size+1]==0x55)&&(d[size+2]==0x55)&&(d[size+3]==0x55);
if (!r) {
printf("*** memcpy(%p,%p,%zd) clobbered past end of destination!\n",s,d,size);
nberr++;
}
r = (d[-1]==0x55)&&(d[-2]==0x55)&&(d[-3]==0x55)&&(d[-4]==0x55);
if (!r) {
printf("*** memcpy(%p,%p,%zd) clobbered before start of destination!\n",s,d,size);
nberr++;
}
return nberr;
}
#if 0
#pragma mark -
#pragma mark memset
#endif
int memset_test(int argc, char** argv)
{
int option = 0;
if (argc >= 2) {
if (!strcmp(argv[1], "perf")) option = 0;
else if (!strcmp(argv[1], "test")) option = 1;
else return -1;
}
const int MAX_SIZE = 1024*1024; // 1MB
const int CACHED_SPEED_EST = CPU_FREQ_EST*1024*1024; // 195 MB/s
const int UNCACHED_SPEED_EST = CPU_FREQ_EST*1024*1024; // 195 MB/s
char* dst = (char*)malloc(MAX_SIZE+4+8);
if (option == 0) {
printf("memset() performance test is running, please wait...\n");
fflush(stdout);
usleep(10000);
setpriority(PRIO_PROCESS, 0, -20);
static int FAST_SIZES[] = { 1024, DCACHE_SIZE/2, DCACHE_SIZE, DCACHE_SIZE*2, MAX_SIZE };
const size_t FAST_SIZES_COUNT = sizeof(FAST_SIZES)/sizeof(FAST_SIZES[0]);
struct result_t { int size; float res; };
result_t results[FAST_SIZES_COUNT*2];
int nbr = 0;
int size = 0;
for (int i=0 ; ; i++) {
if (size_t(i) >= sizeof(FAST_SIZES)/sizeof(FAST_SIZES[0]))
break;
size = FAST_SIZES[i];
if (size > MAX_SIZE) {
break;
}
const int REPEAT = (((size < DCACHE_SIZE) ?
(CACHED_SPEED_EST) : (UNCACHED_SPEED_EST)) / size);
// ~0.5 second per test
const nsecs_t overhead = loop_overhead(REPEAT);
for (int j=0 ; j<2 ; j++) {
if (j==0) preload(dst, DCACHE_SIZE*4); // flush D
else preload(dst, size); // load D
nsecs_t t = -system_time();
size_t count = REPEAT;
do {
memset(dst, 0, size);
} while (--count);
t += system_time() - overhead;
const float throughput = (size*1000000000.0f*REPEAT) / (1024*1024*t);
results[nbr].size = size;
results[nbr].res = throughput;
nbr++;
}
}
printf("%9s %9s %9s\n", "size", "MB/s", "MB/s (cached)");
for (int i=0 ; i<nbr ; i+=2) {
printf("%9d %9ld %9ld\n", results[i].size, (long)results[i].res, (long)results[i+1].res);
}
} else if (option == 1) {
printf("memset() validation test is running, please wait...\n");
fflush(stdout);
char* d = dst + 1024;
int nb = 0;
for (int o=1 ; o<32 ; o++) {
for (int size=0 ; size<4096 && !nb ; size++) {
nb += validate_memset(d, char(o), size);
nb += validate_memset(d+o, char(o), size);
}
}
if (nb) printf("%d error(s) found\n", nb);
else printf("success!\n");
}
fflush(stdout);
free(dst);
return 0;
}
int validate_memset(char* d, char c, size_t size)
{
int nberr = 0;
for (size_t i=0; i<size ; d[i++]=0xaa) ;
d[-1] = 0x55;
d[size+1] = 0x55;
memset(d, c, size);
if (d[size+1]!=0x55) {
printf("*** memset(%p,%02x,%zd) clobbered past end of destination!\n",d,(int)c,size);
nberr++;
}
if (d[-1]!=0x55) {
printf("*** memset(%p,%02x,%zd) clobbered before start of destination!\n",d,(int)c,size);
nberr++;
}
for (size_t i=0 ; i<size ; i++) {
if (d[i] != c) {
printf("*** memset(%p,%02x,%zd) failed at offset %zd\n",d,(int)c,size, i);
nberr++;
break;
}
}
return nberr;
}
#if 0
#pragma mark -
#pragma mark memcmp
#endif
static int ref_memcmp(const void *s1, const void *s2, size_t n)
{
const unsigned char *c1 = (const unsigned char *)s1, *c2 = (const unsigned char *)s2;
int d = 0;
while ( n-- ) {
d = (int)*c1++ - (int)*c2++;
if ( d )
break;
}
return (d < 0 ? -1 : (d > 0 ? 1 : 0));
}
int validate_memcmp(const char* s, const char* d, size_t size)
{
int a = ref_memcmp(s, d, size);
int b = memcmp(s, d, size);
b = (b < 0 ? -1 : (b > 0 ? 1 : 0));
//printf("%d, %d\n", a, b);
if (a != b) {
printf("*** memcmp(%p,%p,%zd) failed %d should be %d\n",s,d,size,b,a);
return 1;
}
return 0;
}
int memcmp_test(int argc, char** argv)
{
int option = 0;
if (argc >= 2) {
if (!strcmp(argv[1], "perf")) option = 0;
else if (!strcmp(argv[1], "test")) option = 1;
else return -1;
}
const int MAX_SIZE = 1024*1024; // 1MB
const int CACHED_SPEED_EST = CPU_FREQ_EST*1024*1024; // 150 MB/s
const int UNCACHED_SPEED_EST = (CPU_FREQ_EST/4)*1024*1024; // 60 MB/s
char* src = (char*)malloc(MAX_SIZE+4+8+32);
char* dst = (char*)malloc(MAX_SIZE+4+8+32);
if (option == 0) {
printf("memcmp() performance test is running, please wait...\n");
fflush(stdout);
usleep(10000);
setpriority(PRIO_PROCESS, 0, -20);
static int FAST_SIZES[] = { 1024, DCACHE_SIZE/2, DCACHE_SIZE, DCACHE_SIZE*2, MAX_SIZE };
struct result_t { int size; float res; };
result_t* results = (result_t*)src;
int nbr = 0;
int size = 0;
for (int i=0 ; ; i++) {
if (size_t(i) >= sizeof(FAST_SIZES)/sizeof(FAST_SIZES[0]))
break;
size = FAST_SIZES[i];
if (size > MAX_SIZE) {
break;
}
const int REPEAT = (((size < DCACHE_SIZE) ?
(CACHED_SPEED_EST) : (UNCACHED_SPEED_EST)) / size) / 2;
// ~0.5 second per test
const nsecs_t overhead = loop_overhead(REPEAT);
// tweak to make it a bad case
char* ddd = (char*)((long(dst+31)&~31) + 4);
char* sss = (char*)((long(src+31)&~31) + 28);
for (int offset=0 ; offset<=2 ; offset +=2 ) {
memcpy(ddd, sss+offset, size); // just make sure to load the caches I/D
nsecs_t t = -system_time();
register int count = REPEAT;
char c;
c = memcmp(ddd, sss+offset, size);
//printf("size %d, memcmp -> %d\n", size, (int)c);
do {
c = memcmp(ddd, sss+offset, size);
asm volatile (""::"r"(c):"memory");
} while (--count);
t += system_time() - overhead;
const float throughput = (size*1000000000.0f*REPEAT) / (1024*1024*t);
results[nbr].size = size;
results[nbr].res = throughput;
nbr++;
}
}
printf("%9s %9s %9s\n", "size", "MB/s", "MB/s (nc)");
for (int i=0 ; i<nbr ; i+=2) {
printf("%9d %9ld %9ld\n", results[i].size, (long)results[i].res, (long)results[i+1].res);
}
} else {
printf("memcmp() validation test is running, please wait...\n");
fflush(stdout);
const char* const s = (const char*)src + 1024;
const char* const d = (const char*)dst + 1024;
int nb = 0;
for (int j=0 ; j<32 ; j++) {
char *curr0 = (char*)src;
char *curr1 = (char*)dst;
for (int i=0 ; i<MAX_SIZE ; i++) {
char c = rand();
*curr0++ = c;
*curr1++ = c;
}
if (j) {
src[1024 + j] ^= 0xFF;
}
for (int size=0 ; size<32 && !nb ; size++) {
for (int o=0 ; o<4 ; o++) {
nb += validate_memcmp(s+o, d+o, size);
}
// memmove((char*)d+1, d, size);
for (int o=0 ; o<4 ; o++) {
nb += validate_memcmp(s, d+o, size);
}
}
}
if (nb) printf("%d error(s) found\n", nb);
else printf("success!\n");
}
fflush(stdout);
free(dst);
free(src);
return 0;
}
#if 0
#pragma mark -
#pragma mark strlen
#endif
int strlen_test(int argc, char** argv)
{
int option = 0;
if (argc >= 2) {
if (!strcmp(argv[1], "perf")) option = 0;
else if (!strcmp(argv[1], "test")) option = 1;
else return -1;
}
const int MAX_SIZE = 1024*1024; // 1MB
const int CACHED_SPEED_EST = CPU_FREQ_EST*1024*1024; // 195 MB/s
const int UNCACHED_SPEED_EST = CPU_FREQ_EST*1024*1024; // 195 MB/s
char* str = (char*)calloc(MAX_SIZE+4+8, 1);
if (option == 0) {
printf("strlen() performance test is running, please wait...\n");
fflush(stdout);
usleep(10000);
setpriority(PRIO_PROCESS, 0, -20);
static int FAST_SIZES[] = { 1024, DCACHE_SIZE/2, DCACHE_SIZE, DCACHE_SIZE*2, MAX_SIZE };
const size_t FAST_SIZES_COUNT = sizeof(FAST_SIZES)/sizeof(FAST_SIZES[0]);
struct result_t { int size; float res; };
result_t results[FAST_SIZES_COUNT*2];
int nbr = 0;
int size = 0;
for (int i=0 ; ; i++) {
if (size_t(i) >= sizeof(FAST_SIZES)/sizeof(FAST_SIZES[0]))
break;
size = FAST_SIZES[i];
if (size > MAX_SIZE) {
break;
}
const int REPEAT = (((size < DCACHE_SIZE) ?
(CACHED_SPEED_EST) : (UNCACHED_SPEED_EST)) / size);
// ~0.5 second per test
const nsecs_t overhead = loop_overhead(REPEAT);
for (int j=0 ; j<2 ; j++) {
memset(str, 'A', size-1);
if (j==0) preload(str, DCACHE_SIZE*4); // flush D
else preload(str, size); // load D
nsecs_t t = -system_time();
size_t count = REPEAT;
int c=0;
do {
c = strlen(str);
asm volatile (""::"r"(c):"memory");
} while (--count);
t += system_time() - overhead;
const float throughput = (size*1000000000.0f*REPEAT) / (1024*1024*t);
results[nbr].size = size;
results[nbr].res = throughput;
nbr++;
}
}
printf("%9s %9s %9s\n", "size", "MB/s", "MB/s (cached)");
for (int i=0 ; i<nbr ; i+=2) {
printf("%9d %9ld %9ld\n", results[i].size, (long)results[i].res, (long)results[i+1].res);
}
}
fflush(stdout);
free(str);
return 0;
}
#if 0
#pragma mark -
#pragma mark malloc
#endif
int malloc_test(int argc, char** argv)
{
bool fill = (argc>=2 && !strcmp(argv[1], "fill"));
size_t total = 0;
size_t size = 0x40000000;
while (size) {
void* addr = malloc(size);
if (addr == 0) {
printf("size = %9zd failed\n", size);
size >>= 1;
} else {
total += size;
printf("size = %9zd, addr = %p (total = %9zd (%zd MB))\n",
size, addr, total, total / (1024*1024));
if (fill) {
printf("filling...\n");
fflush(stdout);
memset(addr, 0, size);
}
size = size + (size>>1);
}
}
printf("done. allocated %zd MB\n", total / (1024*1024));
return 0;
}
#if 0
#pragma mark -
#pragma mark madvise
#endif
int madvise_test(int argc, char** argv)
{
for (int i=0 ; i<2 ; i++) {
size_t size = i==0 ? 4096 : 48*1024*1024; // 48 MB
printf("Allocating %zd MB... ", size/(1024*1024)); fflush(stdout);
void* addr1 = mmap(0, size, PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, -1, 0);
printf("%p (%s)\n", addr1, addr1==(void*)-1 ? "failed" : "OK"); fflush(stdout);
printf("touching %p...\n", addr1); fflush(stdout);
memset(addr1, 0x55, size);
printf("advising DONTNEED...\n"); fflush(stdout);
madvise(addr1, size, MADV_DONTNEED);
printf("reading back %p...\n", addr1); fflush(stdout);
if (*(long*)addr1 == 0) {
printf("madvise freed some pages\n");
} else if (*(long*)addr1 == 0x55555555) {
printf("pages are still there\n");
} else {
printf("getting garbage back\n");
}
printf("Allocating %zd MB... ", size/(1024*1024)); fflush(stdout);
void* addr2 = mmap(0, size, PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, -1, 0);
printf("%p (%s)\n", addr2, addr2==(void*)-1 ? "failed" : "OK"); fflush(stdout);
printf("touching %p...\n", addr2); fflush(stdout);
memset(addr2, 0xAA, size);
printf("unmap %p ...\n", addr2); fflush(stdout);
munmap(addr2, size);
printf("touching %p...\n", addr1); fflush(stdout);
memset(addr1, 0x55, size);
printf("unmap %p ...\n", addr1); fflush(stdout);
munmap(addr1, size);
}
printf("Done\n"); fflush(stdout);
return 0;
}
#if 0
#pragma mark -
#pragma mark cpufreq
#endif
int cpufreq_test(int argc, char** argv)
{
struct timespec res;
clock_getres(CLOCK_REALTIME, &res);
printf("CLOCK_REALTIME resolution: %lu ns\n", res.tv_nsec);
clock_getres(CLOCK_MONOTONIC, &res);
printf("CLOCK_MONOTONIC resolution: %lu ns\n", res.tv_nsec);
clock_getres(CLOCK_PROCESS_CPUTIME_ID, &res);
printf("CLOCK_PROCESS_CPUTIME_ID resolution: %lu ns\n", res.tv_nsec);
clock_getres(CLOCK_THREAD_CPUTIME_ID, &res);
printf("CLOCK_THREAD_CPUTIME_ID resolution: %lu ns\n", res.tv_nsec);
#if 0/*Harry*/
if (clock_getres(CLOCK_REALTIME_HR, &res) != 0)
printf("CLOCK_REALTIME_HR resolution: %lu ns\n", res.tv_nsec);
else
printf("CLOCK_REALTIME_HR not supported\n");
if (clock_getres(CLOCK_MONOTONIC_HR, &res) != 0)
printf("CLOCK_MONOTONIC_HR resolution: %lu ns\n", res.tv_nsec);
else
printf("CLOCK_MONOTONIC_HR not supported\n");
#endif
printf("\nEstimating the CPU frequency, please wait...\n");
fflush(stdout);
usleep(10000);
setpriority(PRIO_PROCESS, 0, -20);
const int LOOP_CYCLES = 1+BRANCH_CYCLE; // 1 cycle + 3 cycles for the branch
const size_t REPEAT = CPU_FREQ_EST*1000000; // ~4 seconds (4cycles/loop)
register size_t count = REPEAT;
nsecs_t t = system_time();
do { // this loop generates 1+3 cycles
asm volatile ("":::"memory");
} while (--count);
t = system_time() - t;
const float freq = t ? (1000.0f*float(REPEAT)*LOOP_CYCLES) / t : 0;
printf("this CPU frequency: %ld MHz\n", long(freq+0.5f));
return 0;
}
#if 0
#pragma mark -
#pragma mark crash_test
#endif
int crash_test(int argc, char** argv)
{
printf("about to crash...\n");
#if 0/*Harry*/
asm volatile(
"mov r0, #0 \n"
"mov r1, #1 \n"
"mov r2, #2 \n"
"mov r3, #3 \n"
"ldr r12, [r0] \n"
);
#endif
return 0;
}
int stack_smasher_test(int argc, char** argv)
{
int dummy = 0;
printf("corrupting our stack...\n");
*(volatile long long*)&dummy = 0;
return 0;
}
// --------------------------------------------------------------------
extern "C" void thumb_function_1(int*p);
extern "C" void thumb_function_2(int*p);
extern "C" void arm_function_3(int*p);
extern "C" void arm_function_2(int*p);
extern "C" void arm_function_1(int*p);
void arm_function_3(int*p) {
int a = 0;
#if 0/*Harry*/
thumb_function_2(&a);
#endif
}
void arm_function_2(int*p) {
int a = 0;
#if 0/*Harry*/
thumb_function_1(&a);
#endif
}
void arm_function_1(int*p) {
int a = 0;
#if 0/*Harry*/
arm_function_2(&a);
#endif
}
int crawl_test(int argc, char** argv)
{
int a = 0;
arm_function_1(&a);
return 0;
}