forked from ComputationalRadiationPhysics/cuda_memtest
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathtests.cu
1622 lines (1249 loc) · 43.5 KB
/
tests.cu
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
/*
* Illinois Open Source License
*
* University of Illinois/NCSA
* Open Source License
*
* Copyright 2009, University of Illinois. All rights reserved.
*
* Developed by:
*
* Innovative Systems Lab
* National Center for Supercomputing Applications
* http://www.ncsa.uiuc.edu/AboutUs/Directorates/ISL.html
*
* Permission is hereby granted, free of charge, to any person obtaining a copy of
* this software and associated documentation files (the "Software"), to deal with
* the Software without restriction, including without limitation the rights to use,
* copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the
* Software, and to permit persons to whom the Software is furnished to do so, subject
* to the following conditions:
*
* * Redistributions of source code must retain the above copyright notice, this list
* of conditions and the following disclaimers.
*
* * Redistributions in binary form must reproduce the above copyright notice, this list
* of conditions and the following disclaimers in the documentation and/or other materials
* provided with the distribution.
*
* * Neither the names of the Innovative Systems Lab, the National Center for Supercomputing
* Applications, nor the names of its contributors may be used to endorse or promote products
* derived from this Software without specific prior written permission.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
* PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE CONTRIBUTORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT
* OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS WITH THE SOFTWARE.
*/
#include <cstdio>
#include "misc.h"
#include <cuda.h>
#include <sys/time.h>
#include <unistd.h>
static __thread unsigned long* err_addr;
static __thread unsigned long* err_expect;
static __thread unsigned long* err_current;
static __thread unsigned long* err_second_read;
static __thread unsigned int* err_count;
static __thread unsigned int unreported_errors=0;
__thread struct timeval last_report_time;
extern unsigned int report_interval;
__thread unsigned int firsttime=1;
__thread char time_buf[128];
extern unsigned exit_on_error ;
extern unsigned int email_notification;
extern char emails[];
extern unsigned int global_pattern;
extern unsigned long global_pattern_long;
extern unsigned int num_iterations;
extern unsigned int num_passes;
extern char driver_info[MAX_STR_LEN];
#define MAX_ERR_RECORD_COUNT 10
#ifdef SM_10
#define atomicAdd(x, y) do{ (*x) = (*x) + y ;}while(0)
#define RECORD_ERR(err, p, expect, current) do{ \
atomicAdd(err, 1); \
}while(0)
#else
#define RECORD_ERR(err, p, expect, current) do{ \
unsigned int idx = atomicAdd(err, 1); \
idx = idx % MAX_ERR_RECORD_COUNT; \
err_addr[idx] = (unsigned long)p; \
err_expect[idx] = (unsigned long)expect; \
err_current[idx] = (unsigned long)current; \
err_second_read[idx] = (unsigned long)(*p); \
}while(0)
#endif
#define MAX_ITERATION 3
char*
time_string(void)
{
struct timeval tv;
gettimeofday(&tv, NULL);
struct tm tm;
if (localtime_r(&tv.tv_sec, &tm) == NULL){
fprintf(stderr, "ERROR: in getting time\n");
exit(ERR_GENERAL);
}
sprintf(time_buf, "%02d/%02d/%04d %02d:%02d:%02d",
tm.tm_mon + 1, tm.tm_mday, tm.tm_year + 1900,tm.tm_hour, tm.tm_min, tm.tm_sec);
return time_buf;
}
unsigned int
error_checking(const char* msg, unsigned int blockidx)
{
unsigned int err = 0;
unsigned long host_err_addr[MAX_ERR_RECORD_COUNT];
unsigned long host_err_expect[MAX_ERR_RECORD_COUNT];
unsigned long host_err_current[MAX_ERR_RECORD_COUNT];
unsigned long host_err_second_read[MAX_ERR_RECORD_COUNT];
unsigned int i;
cudaMemcpy((void*)&err, (void*)err_count, sizeof(unsigned int), cudaMemcpyDeviceToHost);CUERR;
cudaMemcpy((void*)&host_err_addr[0], (void*)err_addr, sizeof(unsigned long)*MAX_ERR_RECORD_COUNT, cudaMemcpyDeviceToHost);CUERR;
cudaMemcpy((void*)&host_err_expect[0], (void*)err_expect, sizeof(unsigned long)*MAX_ERR_RECORD_COUNT, cudaMemcpyDeviceToHost);CUERR;
cudaMemcpy((void*)&host_err_current[0], (void*)err_current, sizeof(unsigned long)*MAX_ERR_RECORD_COUNT, cudaMemcpyDeviceToHost);CUERR;
cudaMemcpy((void*)&host_err_second_read[0], (void*)err_second_read, sizeof(unsigned long)*MAX_ERR_RECORD_COUNT, cudaMemcpyDeviceToHost);CUERR;
#define ERR_MSG_LENGTH 4096
char error_msg[ERR_MSG_LENGTH];
char* emsg = error_msg;
if (err){
emsg += sprintf(emsg, "Unreported errors since last email: %d\n", unreported_errors);
FPRINTF("ERROR: %s", driver_info);
emsg += sprintf(emsg, "ERROR: %s", driver_info);
#if !defined(NVML_DEVICE_SERIAL_BUFFER_SIZE)
char devSerialNum[] = "unknown (no NVML found)";
#else
char devSerialNum[NVML_DEVICE_SERIAL_BUFFER_SIZE];
get_serial_number( gpu_idx, devSerialNum );
#endif
FPRINTF("ERROR: The unit serial number is %s\n", devSerialNum);
emsg += sprintf(emsg, "ERROR: The unit serial number is %s\n", devSerialNum);
FPRINTF("ERROR: (%s) %d errors found in block %d\n", msg, err, blockidx);
emsg += sprintf(emsg, "ERROR: (%s) %d errors found in block %d\n", msg, err, blockidx);
FPRINTF("ERROR: the last %d error addresses are:\t", MIN(MAX_ERR_RECORD_COUNT, err));
emsg += sprintf(emsg, "ERROR: the last %d error addresses are:\t", MIN(MAX_ERR_RECORD_COUNT, err));
for (i =0;i < MIN(MAX_ERR_RECORD_COUNT, err); i++){
fprintf(stderr, "%p\t", (void*)host_err_addr[i]);
emsg += sprintf(emsg, "%p\t", (void*)host_err_addr[i]);
}
fprintf(stderr, "\n");
emsg += sprintf(emsg, "\n");
for (i =0; i < MIN(MAX_ERR_RECORD_COUNT, err); i++){
FPRINTF("ERROR: %dth error, expected value=0x%lx, current value=0x%lx, diff=0x%lx (second_read=0x%lx, expect=0x%lx, diff with expected value=0x%lx)\n",
i, host_err_expect[i], host_err_current[i], host_err_expect[i] ^ host_err_current[i],
host_err_second_read[i], host_err_expect[i] , host_err_expect[i] ^ host_err_second_read[i]);
emsg += sprintf(emsg, "ERROR: %dth error, expected value=0x%lx, current value=0x%lx, diff=0x%lx (second_read=0x%lx, expect=0x%lx, diff with expected value=0x%lx)\n",
i, host_err_expect[i], host_err_current[i], host_err_expect[i] ^ host_err_current[i],
host_err_second_read[i], host_err_expect[i], host_err_expect[i] ^ host_err_second_read[i]);
}
if (email_notification){
struct timeval tv;
gettimeofday(&tv, NULL);
if ( firsttime || TDIFF(tv, last_report_time) > report_interval) {
FPRINTF("ERROR: reporting this error to %s\n", emails);
#define CMD_LENGTH (ERR_MSG_LENGTH + 256)
char cmd[CMD_LENGTH];
error_msg[ERR_MSG_LENGTH -1] = 0;
snprintf(cmd, CMD_LENGTH, "echo \"%s cuda_memtest errors found in %s[%d]\n%s\" |%s -s \" cuda_memtest errors found in %s[%d]\" %s",
time_string(), hostname,gpu_idx, error_msg, MAILFILE, hostname,gpu_idx, emails );
int sendMailResult = system(cmd);
if(sendMailResult != 0){
FPRINTF("ERROR: can not send the error report via mail to %s, '%s' returned an error\n", emails, MAILFILE);
}
firsttime = 0;
unreported_errors = 0;
last_report_time = tv;
}else{
FPRINTF("ERROR: this error is not email reported\n");
unreported_errors ++;
}
}
cudaMemset(err_count, 0, sizeof(unsigned int));CUERR;
cudaMemset((void*)&err_addr[0], 0, sizeof(unsigned long)*MAX_ERR_RECORD_COUNT);CUERR;
cudaMemset((void*)&err_expect[0], 0, sizeof(unsigned long)*MAX_ERR_RECORD_COUNT);CUERR;
cudaMemset((void*)&err_current[0], 0, sizeof(unsigned long)*MAX_ERR_RECORD_COUNT);CUERR;
if (exit_on_error){
cudaDeviceReset();
exit(ERR_BAD_STATE);
}
}
return err;
}
unsigned int
get_random_num(void)
{
struct timeval t0;
if (gettimeofday(&t0, NULL) !=0){
fprintf(stderr, "ERROR: gettimeofday() failed\n");
exit(ERR_GENERAL);
}
unsigned int seed= (unsigned int)t0.tv_sec;
srand(seed);
return rand_r(&seed);
}
uint64_t
get_random_num_long(void)
{
struct timeval t0;
if (gettimeofday(&t0, NULL) !=0){
fprintf(stderr, "ERROR: gettimeofday() failed\n");
exit(ERR_GENERAL);
}
unsigned int seed= (unsigned int)t0.tv_sec;
srand(seed);
unsigned int a = rand_r(&seed);
unsigned int b = rand_r(&seed);
uint64_t ret = ((uint64_t)a) << 32;
ret |= ((uint64_t)b);
return ret;
}
__global__ void
kernel_move_inv_write(char* _ptr, char* end_ptr, unsigned int pattern)
{
unsigned int i;
unsigned int* ptr = (unsigned int*) (_ptr + blockIdx.x*BLOCKSIZE);
if (ptr >= (unsigned int*) end_ptr) {
return;
}
for (i = 0;i < BLOCKSIZE/sizeof(unsigned int); i++){
ptr[i] = pattern;
}
return;
}
__global__ void
kernel_move_inv_readwrite(char* _ptr, char* end_ptr, unsigned int p1, unsigned int p2, unsigned int* err,
unsigned long* err_addr, unsigned long* err_expect, unsigned long* err_current, unsigned long* err_second_read)
{
unsigned int i;
unsigned int* ptr = (unsigned int*) (_ptr + blockIdx.x*BLOCKSIZE);
if (ptr >= (unsigned int*) end_ptr) {
return;
}
for (i = 0;i < BLOCKSIZE/sizeof(unsigned int); i++){
if (ptr[i] != p1){
RECORD_ERR(err, &ptr[i], p1, ptr[i]);
}
ptr[i] = p2;
}
return;
}
__global__ void
kernel_move_inv_read(char* _ptr, char* end_ptr, unsigned int pattern, unsigned int* err,
unsigned long* err_addr, unsigned long* err_expect, unsigned long* err_current, unsigned long* err_second_read )
{
unsigned int i;
unsigned int* ptr = (unsigned int*) (_ptr + blockIdx.x*BLOCKSIZE);
if (ptr >= (unsigned int*) end_ptr) {
return;
}
for (i = 0;i < BLOCKSIZE/sizeof(unsigned int); i++){
if (ptr[i] != pattern){
RECORD_ERR(err, &ptr[i], pattern, ptr[i]);
}
}
return;
}
unsigned int
move_inv_test(char* ptr, unsigned int tot_num_blocks, unsigned int p1, unsigned p2)
{
unsigned int i;
unsigned int err = 0;
char* end_ptr = ptr + tot_num_blocks* BLOCKSIZE;
for (i= 0;i < tot_num_blocks; i+= GRIDSIZE){
dim3 grid;
grid.x= GRIDSIZE;
kernel_move_inv_write<<<grid, 1>>>(ptr + i*BLOCKSIZE, end_ptr, p1); SYNC_CUERR;
SHOW_PROGRESS("move_inv_write", i, tot_num_blocks);
}
for (i=0;i < tot_num_blocks; i+= GRIDSIZE){
dim3 grid;
grid.x= GRIDSIZE;
kernel_move_inv_readwrite<<<grid, 1>>>(ptr + i*BLOCKSIZE, end_ptr, p1, p2, err_count, err_addr, err_expect, err_current, err_second_read); SYNC_CUERR;
err += error_checking("move_inv_readwrite", i);
SHOW_PROGRESS("move_inv_readwrite", i, tot_num_blocks);
}
for (i=0;i < tot_num_blocks; i+= GRIDSIZE){
dim3 grid;
grid.x= GRIDSIZE;
kernel_move_inv_read<<<grid, 1>>>(ptr + i*BLOCKSIZE, end_ptr, p2, err_count, err_addr, err_expect, err_current, err_second_read); SYNC_CUERR;
err += error_checking("move_inv_read", i);
SHOW_PROGRESS("move_inv_read", i, tot_num_blocks);
}
return err;
}
/*
* Test0 [Walking 1 bit]
* This test changes one bit a time in memory address to see it
* goes to a different memory location. It is designed to test
* the address wires.
*/
/*
__global__ void
kernel_test0_write(char* _ptr, char* end_ptr, unsigned int pattern,
unsigned int* err, unsigned long* err_addr,
unsigned long* err_expect, unsigned long* err_current, unsigned long* err_second_read)
{
unsigned int i;
unsigned int* ptr = (unsigned int*) (_ptr + blockIdx.x*BLOCKSIZE);
if (ptr >= (unsigned int*) end_ptr) {
return;
}
for (i = 0;i < BLOCKSIZE/sizeof(unsigned int); i++){
ptr[i] = pattern;
}
return;
}
__global__ void
kernel_test0_readwrite(char* _ptr, char* end_ptr, unsigned int pattern, unsigned int prev_pattern,
unsigned int* err, unsigned long* err_addr,
unsigned long* err_expect, unsigned long* err_current, unsigned long* err_second_read)
{
unsigned int i;
unsigned int* ptr = (unsigned int*) (_ptr + blockIdx.x*BLOCKSIZE);
if (ptr >= (unsigned int*) end_ptr) {
return;
}
for (i = 0;i < BLOCKSIZE/sizeof(unsigned int); i++){
if (ptr[i] != prev_pattern){
RECORD_ERR(err, &ptr[i], prev_pattern, ptr[i]);
}
ptr[i] = pattern;
}
return;
}
void
test0(char* ptr, unsigned int tot_num_blocks)
{
unsigned int i,j;
char* end_ptr = ptr + tot_num_blocks* BLOCKSIZE;
for (i=0;i < tot_num_blocks; i+= GRIDSIZE){
dim3 grid;
grid.x= GRIDSIZE;
unsigned int prev_pattern = 0;
//the first iteration
unsigned int pattern = 1;
kernel_test0_write<<<grid, 1>>>(ptr + i*BLOCKSIZE, end_ptr, pattern, err_count, err_addr, err_expect, err_current, err_second_read); CUERR;
prev_pattern =pattern;
for (j =1; j < 32; j++){
pattern = 1 << j;
kernel_test0_readwrite<<<grid, 1>>>(ptr + i*BLOCKSIZE, end_ptr, pattern, prev_pattern, err_count, err_addr, err_expect, err_current, err_second_read); CUERR;
prev_pattern = pattern;
}
error_checking(__FUNCTION__, i);
SHOW_PROGRESS(__FUNCTION__, i, tot_num_blocks);
}
return;
}
*/
__global__ void
kernel_test0_global_write(char* _ptr, char* _end_ptr)
{
unsigned int* ptr = (unsigned int*)_ptr;
unsigned int* end_ptr = (unsigned int*)_end_ptr;
unsigned int* orig_ptr = ptr;
unsigned int pattern = 1;
unsigned long mask = 4;
*ptr = pattern;
while(ptr < end_ptr){
ptr = (unsigned int*) ( ((unsigned long)orig_ptr) | mask);
if (ptr == orig_ptr){
mask = mask <<1;
continue;
}
if (ptr >= end_ptr){
break;
}
*ptr = pattern;
pattern = pattern << 1;
mask = mask << 1;
}
return;
}
__global__ void
kernel_test0_global_read(char* _ptr, char* _end_ptr, unsigned int* err, unsigned long* err_addr,
unsigned long* err_expect, unsigned long* err_current, unsigned long* err_second_read)
{
unsigned int* ptr = (unsigned int*)_ptr;
unsigned int* end_ptr = (unsigned int*)_end_ptr;
unsigned int* orig_ptr = ptr;
unsigned int pattern = 1;
unsigned long mask = 4;
if (*ptr != pattern){
RECORD_ERR(err, ptr, pattern, *ptr);
}
while(ptr < end_ptr){
ptr = (unsigned int*) ( ((unsigned long)orig_ptr) | mask);
if (ptr == orig_ptr){
mask = mask <<1;
continue;
}
if (ptr >= end_ptr){
break;
}
if (*ptr != pattern){
RECORD_ERR(err, ptr, pattern, *ptr);
}
pattern = pattern << 1;
mask = mask << 1;
}
return;
}
__global__ void
kernel_test0_write(char* _ptr, char* end_ptr)
{
unsigned int* orig_ptr = (unsigned int*) (_ptr + blockIdx.x*BLOCKSIZE);;
unsigned int* ptr = orig_ptr;
if (ptr >= (unsigned int*) end_ptr) {
return;
}
unsigned int* block_end = orig_ptr + BLOCKSIZE/sizeof(unsigned int);
unsigned int pattern = 1;
unsigned long mask = 4;
*ptr = pattern;
while(ptr < block_end){
ptr = (unsigned int*) ( ((unsigned long)orig_ptr) | mask);
if (ptr == orig_ptr){
mask = mask <<1;
continue;
}
if (ptr >= block_end){
break;
}
*ptr = pattern;
pattern = pattern << 1;
mask = mask << 1;
}
return;
}
__global__ void
kernel_test0_read(char* _ptr, char* end_ptr, unsigned int* err, unsigned long* err_addr,
unsigned long* err_expect, unsigned long* err_current, unsigned long* err_second_read)
{
unsigned int* orig_ptr = (unsigned int*) (_ptr + blockIdx.x*BLOCKSIZE);;
unsigned int* ptr = orig_ptr;
if (ptr >= (unsigned int*) end_ptr) {
return;
}
unsigned int* block_end = orig_ptr + BLOCKSIZE/sizeof(unsigned int);
unsigned int pattern = 1;
unsigned long mask = 4;
if (*ptr != pattern){
RECORD_ERR(err, ptr, pattern, *ptr);
}
while(ptr < block_end){
ptr = (unsigned int*) ( ((unsigned long)orig_ptr) | mask);
if (ptr == orig_ptr){
mask = mask <<1;
continue;
}
if (ptr >= block_end){
break;
}
if (*ptr != pattern){
RECORD_ERR(err, ptr, pattern, *ptr);
}
pattern = pattern << 1;
mask = mask << 1;
}
return;
}
void
test0(char* ptr, unsigned int tot_num_blocks)
{
unsigned int i;
char* end_ptr = ptr + tot_num_blocks* BLOCKSIZE;
//test global address
kernel_test0_global_write<<<1, 1>>>(ptr, end_ptr); SYNC_CUERR;
kernel_test0_global_read<<<1, 1>>>(ptr, end_ptr, err_count, err_addr, err_expect, err_current, err_second_read); SYNC_CUERR;
error_checking("test0 on global address", 0);
for(unsigned int ite = 0;ite < num_iterations; ite++){
for (i=0;i < tot_num_blocks; i+= GRIDSIZE){
dim3 grid;
grid.x= GRIDSIZE;
kernel_test0_write<<<grid, 1>>>(ptr + i*BLOCKSIZE, end_ptr); SYNC_CUERR;
SHOW_PROGRESS("test0 on writing", i, tot_num_blocks);
}
for (i=0;i < tot_num_blocks; i+= GRIDSIZE){
dim3 grid;
grid.x= GRIDSIZE;
kernel_test0_read<<<grid, 1>>>(ptr + i*BLOCKSIZE, end_ptr, err_count, err_addr, err_expect, err_current, err_second_read); SYNC_CUERR;
error_checking(__FUNCTION__, i);
SHOW_PROGRESS("test0 on reading", i, tot_num_blocks);
}
}
return;
}
/*********************************************************************************
* test1
* Each Memory location is filled with its own address. The next kernel checks if the
* value in each memory location still agrees with the address.
*
********************************************************************************/
__global__ void
kernel_test1_write(char* _ptr, char* end_ptr, unsigned int* err)
{
unsigned int i;
unsigned long* ptr = (unsigned long*) (_ptr + blockIdx.x*BLOCKSIZE);
if (ptr >= (unsigned long*) end_ptr) {
return;
}
for (i = 0;i < BLOCKSIZE/sizeof(unsigned long); i++){
ptr[i] =(unsigned long) & ptr[i];
}
return;
}
__global__ void
kernel_test1_read(char* _ptr, char* end_ptr, unsigned int* err, unsigned long* err_addr,
unsigned long* err_expect, unsigned long* err_current, unsigned long* err_second_read)
{
unsigned int i;
unsigned long* ptr = (unsigned long*) (_ptr + blockIdx.x*BLOCKSIZE);
if (ptr >= (unsigned long*) end_ptr) {
return;
}
for (i = 0;i < BLOCKSIZE/sizeof(unsigned long); i++){
if (ptr[i] != (unsigned long)& ptr[i]){
RECORD_ERR(err, &ptr[i], (unsigned long)&ptr[i], ptr[i]);
}
}
return;
}
void
test1(char* ptr, unsigned int tot_num_blocks)
{
unsigned int i;
char* end_ptr = ptr + tot_num_blocks* BLOCKSIZE;
for (i=0;i < tot_num_blocks; i+= GRIDSIZE){
dim3 grid;
grid.x= GRIDSIZE;
kernel_test1_write<<<grid, 1>>>(ptr + i*BLOCKSIZE, end_ptr, err_count); SYNC_CUERR;
SHOW_PROGRESS("test1 on writing", i, tot_num_blocks);
}
for (i=0;i < tot_num_blocks; i+= GRIDSIZE){
dim3 grid;
grid.x= GRIDSIZE;
kernel_test1_read<<<grid, 1>>>(ptr + i*BLOCKSIZE, end_ptr, err_count, err_addr, err_expect, err_current, err_second_read); SYNC_CUERR;
error_checking("test1 on reading", i);
SHOW_PROGRESS("test1 on reading", i, tot_num_blocks);
}
return;
}
/******************************************************************************
* Test 2 [Moving inversions, ones&zeros]
* This test uses the moving inversions algorithm with patterns of all
* ones and zeros.
*
****************************************************************************/
void
test2(char* ptr, unsigned int tot_num_blocks)
{
unsigned int p1 = 0;
unsigned int p2 = ~p1;
DEBUG_PRINTF("Test2: Moving inversions test, with pattern 0x%x and 0x%x\n", p1, p2);
move_inv_test(ptr, tot_num_blocks, p1, p2);
DEBUG_PRINTF("Test2: Moving inversions test, with pattern 0x%x and 0x%x\n", p2, p1);
move_inv_test(ptr, tot_num_blocks, p2, p1);
}
/*************************************************************************
*
* Test 3 [Moving inversions, 8 bit pat]
* This is the same as test 1 but uses a 8 bit wide pattern of
* "walking" ones and zeros. This test will better detect subtle errors
* in "wide" memory chips.
*
**************************************************************************/
void
test3(char* ptr, unsigned int tot_num_blocks)
{
unsigned int p0=0x80;
unsigned int p1 = p0 | (p0 << 8) | (p0 << 16) | (p0 << 24);
unsigned int p2 = ~p1;
DEBUG_PRINTF("Test3: Moving inversions test, with pattern 0x%x and 0x%x\n", p1, p2);
move_inv_test(ptr, tot_num_blocks, p1, p2);
DEBUG_PRINTF("Test3: Moving inversions test, with pattern 0x%x and 0x%x\n", p2, p1);
move_inv_test(ptr, tot_num_blocks, p2, p1);
}
/************************************************************************************
* Test 4 [Moving inversions, random pattern]
* Test 4 uses the same algorithm as test 1 but the data pattern is a
* random number and it's complement. This test is particularly effective
* in finding difficult to detect data sensitive errors. A total of 60
* patterns are used. The random number sequence is different with each pass
* so multiple passes increase effectiveness.
*
*************************************************************************************/
void
test4(char* ptr, unsigned int tot_num_blocks)
{
unsigned int p1;
if (global_pattern == 0){
p1 = get_random_num();
}else{
p1 = global_pattern;
}
unsigned int p2 = ~p1;
unsigned int err = 0;
unsigned int iteration = 0;
DEBUG_PRINTF("Test4: Moving inversions test, with random pattern 0x%x and 0x%x\n", p1, p2);
repeat:
err += move_inv_test(ptr, tot_num_blocks, p1, p2);
if (err == 0 && iteration == 0){
return;
}
if (iteration < MAX_ITERATION){
PRINTF("%dth repeating test4 because there are %d errors found in last run\n", iteration, err);
iteration++;
err = 0;
goto repeat;
}
}
/************************************************************************************
* Test 5 [Block move, 64 moves]
* This test stresses memory by moving block memories. Memory is initialized
* with shifting patterns that are inverted every 8 bytes. Then blocks
* of memory are moved around. After the moves
* are completed the data patterns are checked. Because the data is checked
* only after the memory moves are completed it is not possible to know
* where the error occurred. The addresses reported are only for where the
* bad pattern was found.
*
*
*************************************************************************************/
__global__ void
kernel_test5_init(char* _ptr, char* end_ptr)
{
unsigned int i;
unsigned int* ptr = (unsigned int*) (_ptr + blockIdx.x*BLOCKSIZE);
if (ptr >= (unsigned int*) end_ptr) {
return;
}
unsigned int p1 = 1;
for (i = 0;i < BLOCKSIZE/sizeof(unsigned int); i+=16){
unsigned int p2 = ~p1;
ptr[i] = p1;
ptr[i+1] = p1;
ptr[i+2] = p2;
ptr[i+3] = p2;
ptr[i+4] = p1;
ptr[i+5] = p1;
ptr[i+6] = p2;
ptr[i+7] = p2;
ptr[i+8] = p1;
ptr[i+9] = p1;
ptr[i+10] = p2;
ptr[i+11] = p2;
ptr[i+12] = p1;
ptr[i+13] = p1;
ptr[i+14] = p2;
ptr[i+15] = p2;
p1 = p1<<1;
if (p1 == 0){
p1 = 1;
}
}
return;
}
__global__ void
kernel_test5_move(char* _ptr, char* end_ptr)
{
unsigned int i;
unsigned int* ptr = (unsigned int*) (_ptr + blockIdx.x*BLOCKSIZE);
if (ptr >= (unsigned int*) end_ptr) {
return;
}
unsigned int half_count = BLOCKSIZE/sizeof(unsigned int)/2;
unsigned int* ptr_mid = ptr + half_count;
for (i = 0;i < half_count; i++){
ptr_mid[i] = ptr[i];
}
for (i=0;i < half_count - 8; i++){
ptr[i + 8] = ptr_mid[i];
}
for (i=0;i < 8; i++){
ptr[i] = ptr_mid[half_count - 8 + i];
}
return;
}
__global__ void
kernel_test5_check(char* _ptr, char* end_ptr, unsigned int* err, unsigned long* err_addr,
unsigned long* err_expect, unsigned long* err_current, unsigned long* err_second_read)
{
unsigned int i;
unsigned int* ptr = (unsigned int*) (_ptr + blockIdx.x*BLOCKSIZE);
if (ptr >= (unsigned int*) end_ptr) {
return;
}
for (i=0;i < BLOCKSIZE/sizeof(unsigned int); i+=2){
if (ptr[i] != ptr[i+1]){
RECORD_ERR(err, &ptr[i], ptr[i+1], ptr[i]);
}
}
return;
}
void
test5(char* ptr, unsigned int tot_num_blocks)
{
unsigned int i;
char* end_ptr = ptr + tot_num_blocks* BLOCKSIZE;
for (i=0;i < tot_num_blocks; i+= GRIDSIZE){
dim3 grid;
grid.x= GRIDSIZE;
kernel_test5_init<<<grid, 1>>>(ptr + i*BLOCKSIZE, end_ptr); SYNC_CUERR;
SHOW_PROGRESS("test5[init]", i, tot_num_blocks);
}
for (i=0;i < tot_num_blocks; i+= GRIDSIZE){
dim3 grid;
grid.x= GRIDSIZE;
kernel_test5_move<<<grid, 1>>>(ptr + i*BLOCKSIZE, end_ptr); SYNC_CUERR;
SHOW_PROGRESS("test5[move]", i, tot_num_blocks);
}
for (i=0;i < tot_num_blocks; i+= GRIDSIZE){
dim3 grid;
grid.x= GRIDSIZE;
kernel_test5_check<<<grid, 1>>>(ptr + i*BLOCKSIZE, end_ptr, err_count, err_addr, err_expect, err_current, err_second_read); SYNC_CUERR;
error_checking("test5[check]", i);
SHOW_PROGRESS("test5[check]", i, tot_num_blocks);
}
return;
}
/*****************************************************************************************
* Test 6 [Moving inversions, 32 bit pat]
* This is a variation of the moving inversions algorithm that shifts the data
* pattern left one bit for each successive address. The starting bit position
* is shifted left for each pass. To use all possible data patterns 32 passes
* are required. This test is quite effective at detecting data sensitive
* errors but the execution time is long.
*
***************************************************************************************/
__global__ void
kernel_movinv32_write(char* _ptr, char* end_ptr, unsigned int pattern,
unsigned int lb, unsigned int sval, unsigned int offset)
{
unsigned int i;
unsigned int* ptr = (unsigned int*) (_ptr + blockIdx.x*BLOCKSIZE);
if (ptr >= (unsigned int*) end_ptr) {
return;
}
unsigned int k = offset;
unsigned pat = pattern;
for (i = 0;i < BLOCKSIZE/sizeof(unsigned int); i++){
ptr[i] = pat;
k++;
if (k >= 32){
k=0;
pat = lb;
}else{
pat = pat << 1;
pat |= sval;
}
}
return;
}
__global__ void
kernel_movinv32_readwrite(char* _ptr, char* end_ptr, unsigned int pattern,
unsigned int lb, unsigned int sval, unsigned int offset, unsigned int * err,
unsigned long* err_addr, unsigned long* err_expect, unsigned long* err_current, unsigned long* err_second_read)
{
unsigned int i;
unsigned int* ptr = (unsigned int*) (_ptr + blockIdx.x*BLOCKSIZE);
if (ptr >= (unsigned int*) end_ptr) {
return;
}
unsigned int k = offset;
unsigned pat = pattern;
for (i = 0;i < BLOCKSIZE/sizeof(unsigned int); i++){
if (ptr[i] != pat){
RECORD_ERR(err, &ptr[i], pat, ptr[i]);
}
ptr[i] = ~pat;
k++;
if (k >= 32){
k=0;
pat = lb;
}else{
pat = pat << 1;
pat |= sval;
}
}