summaryrefslogtreecommitdiffstats
path: root/cfe/cfe/arch/mips/board/bcm63xx_rom/src/memtest.c
blob: 310fb40f9c1b038c356451829a7ea2415a8fc33d (plain)
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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
/*
 *----------------------------------------------------------------------------*
 *  Collection of Memory Tests.
 *----------------------------------------------------------------------------*
 */

//
// NOTE: Blatant inlining ... (not sure whether caller supports EABI calls).
// WARNING CFE: Must NOT use function calls !!!
//
#define _ALWAYS_INLINE_     __attribute__((always_inline))
#define _INLINE_            inline static

typedef enum memTestResult {
    MEMTEST_FAILURE = 0,
    MEMTEST_SUCCESS,
    MEMTEST_ERROR,
} MemTestResult_t;

/* ------------------------------------------------------------------------- */

#undef PATTERN
#define PATTERN(x)      PATTERN_##x,

/*
 * For each pattern listed, the inverse pattern is also automatically used.
 * E.g. 0x55555555, the inverse of defined 0xAAAAAAAA is covered.
 */
typedef enum pattern {
    PATTERN(0x00000000)
    PATTERN(0xAAAAAAAA)
    PATTERN(0xCCCCCCCC)
    PATTERN(0x77777777)
    PATTERN(0xF0F0F0F0)
    PATTERN(0xFF00FF00)
    PATTERN(0xFFFF0000)
    PATTERN(0x01234567)
    PATTERN(0x89ABCDEF)
    PATTERN_MAX,
} Pattern_t;

#undef PATTERN
#define PATTERN(x)      x,
const uint32_t pattern[] = {
    PATTERN(0x00000000)
    PATTERN(0xAAAAAAAA)
    PATTERN(0xCCCCCCCC)
    PATTERN(0x77777777)
    PATTERN(0xF0F0F0F0)
    PATTERN(0xFF00FF00)
    PATTERN(0xFFFF0000)
    PATTERN(0x01234567)
    PATTERN(0x89ABCDEF)
    PATTERN_MAX,
};

/* ------------------------------------------------------------------------- */

#ifndef NBBY
#define NBBY            8   /* FreeBSD style: Number Bits per BYte */
#endif

/* ------------------------------------------------------------------------- */

#define NBITS(type)             (sizeof(type) * NBBY)
#define NBITVAL(nbits)          (1 << (nbits))
#define MAXBITVAL(nbits)        ( NBITVAL(nbits) - 1)
#define NBITMASK(nbits)         MAXBITVAL(nbits)
#define MAXNBVAL(nbyte)         MAXBITVAL((nbyte) * NBBY)

#define DIVBY(val32,by)         ((val32)>>(by)) 
#define MODBY(val32,by)         ((val32) & ((1 <<(by)) - 1) )

#define IS_POWEROF2(val32)      ( (((val32)-1) & (val32)) == 0 )

#define ROUNDDN(addr, align)    ( (addr) & ~((align) - 1) )
#define ROUNDUP(addr, align)    ( ((addr) + (align) - 1) & ~((align) - 1) )
//#define ROUNDUP(x,y)          ((((x)+((y)-1))/(y))*(y))
#define ALIGN_ADDR(addr, bytes) (void *)( ((uint32_t *)(addr) + (bytes) - 1) \
                                          & ~((bytes) - 1) )
#define IS_ALIGNED(addr, bytes) (((uint32_t)(addr) & ((bytes)-1)) == 0)

#define OFFSET_OF(stype,member) ((uint32_t) &((struct stype *)0)->member)
#define RELOC(base,stype,member)  ((base) + OFFSET_OF(stype, member))

#define RROTATE32(val32)        (((val32) << 31) | ((val32) >>  1))
#define LROTATE32(val32)        (((val32) <<  1) | ((val32) >> 31))

/* ------------------------------------------------------------------------- */

/* Aligned (32bit register) read/write access */
#define RD16(addr16)            (*(volatile uint32_t *)(addr16))
#define WR16(addr16,val16)      (*(volatile uint32_t *)(addr16))=(val16)
#define RD32(addr32)            (*(volatile uint32_t *)(addr32))
#define WR32(addr32,val32)      (*(volatile uint32_t *)(addr32))=(val32)

/*---------------------------------------------------------------------------*/

/* Forward declaration */
_INLINE_ void fill_memory( uint32_t * addr, uint32_t bytes, uint32_t fill32)
                                                                _ALWAYS_INLINE_;
_INLINE_ void fill_alt_memory(uint32_t * addr, uint32_t bytes,
                            uint32_t fillA32, uint32_t fillB32) _ALWAYS_INLINE_;

void fill_memory( uint32_t * addr, uint32_t bytes, uint32_t fill32)
{
    uint32_t * at, * end_p;
    uint32_t words;
    words = bytes / sizeof(uint32_t);
    if ( words == 0 ) return;

    end_p = addr + words;
    for ( at = addr; at < end_p; at++ )
        WR32( at, fill32 );
}

void fill_alt_memory( uint32_t * addr, uint32_t bytes,
                      uint32_t fillA32, uint32_t fillB32)
{
    uint32_t * at, * end_p;
    uint32_t words;
    words = bytes / sizeof(uint32_t);
    words = ROUNDDN( words, 2 );
    if ( words == 0 ) return;

    end_p = addr + words;
    for ( at = addr; at < end_p; at+=2 )
    {
        WR32( at+0, fillA32 );
        WR32( at+1, fillB32 );
    }
}

/* Forward declaration */
_INLINE_ MemTestResult_t scanWordValue( uint32_t * addr, uint32_t bytes,
                uint32_t pat32 )          _ALWAYS_INLINE_;
_INLINE_ MemTestResult_t scanBulkValue( uint32_t * addr, uint32_t bytes,
                uint32_t pat32 )          _ALWAYS_INLINE_;
_INLINE_ MemTestResult_t scanBulkAltInv( uint32_t * addr, uint32_t bytes,
                uint32_t pat32 )          _ALWAYS_INLINE_;
_INLINE_ MemTestResult_t scanWordSelf( uint32_t * addr, uint32_t bytes )
                                          _ALWAYS_INLINE_;
_INLINE_ MemTestResult_t scanBulkSelf( uint32_t * addr, uint32_t bytes )
                                          _ALWAYS_INLINE_;
_INLINE_ MemTestResult_t slidingAltInv( uint32_t * addr, uint32_t bytes,
                uint32_t pat32 )          _ALWAYS_INLINE_;
_INLINE_ MemTestResult_t slidingDiag( uint32_t * addr, uint32_t bytes,
                uint32_t pat32 )          _ALWAYS_INLINE_;
_INLINE_ MemTestResult_t memoryBulkCopy( uint32_t * saddr, uint32_t * daddr,
                uint32_t bytes )          _ALWAYS_INLINE_;

/*
 *-----------------------------------------------------------------------------
 * Function: scanWordValue
 *
 * Description:
 * 4 Passes are conducted on the memory region.
 * Pass 1. In INcreasing memory address, write a word with value and verify. 
 * Pass 2. In DEcreasing memory address, write a word with value and verify. 
 * Pass 3. In INcreasing memory address, write a word with INVERSE and verify. 
 * Pass 4. In DEcreasing memory address, write a word with INVERSE and verify. 
 * Pass 5. In INcreasing shifted memory address, write word with value verify.
 * Pass 6. In INcreasing shifted memory address, write word with INVERSE verify.
 *
 * Parameters:
 *  addr:   word aligned pointer to memory region
 *  bytes:  size in bytes of memory region to test
 *  pat32:  32bit pattern, e.g. 0x0U, 0xAAAAAAAA, 0xFF00FF00, 0xFFFF0000,
 *                              0xF0F0F0F0, 0xC3C3C3C3, 0x87878787
 *-----------------------------------------------------------------------------
 */
MemTestResult_t scanWordValue( uint32_t * addr, uint32_t bytes, uint32_t pat32 )
{
    volatile uint32_t * at, * end_p;
    uint32_t expected, read, words;
    uint32_t shift;
    
    if ( ! IS_ALIGNED(addr,4) ) return MEMTEST_ERROR;

    words = bytes / sizeof(uint32_t);    /* in whole words (4byte multiple) */
    if ( words == 0 )
        return MEMTEST_ERROR;

    expected  = pat32;  /* ORIGINAL value */

    /* INCREASING traversal */
    end_p     = addr + words;
    for ( at = addr; at < end_p; at++ )
    {
        WR32( at, expected );
        read = RD32(at);
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
    }

    /* DECREASING traversal */
    end_p     = addr;
    for ( at = addr + words - 1; at >= end_p; at-- )
    {
        WR32( at, expected );
        read = RD32(at);
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
    }

    expected  = ~pat32; /* INVERSE value */

    /* INCREASING traversal */
    end_p     = addr + words;
    for ( at = addr; at < end_p; at++ )
    {
        WR32( at, expected );
        read = RD32(at);
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
    }

    /* DECREASING traversal */
    end_p     = addr;
    for ( at = addr + words - 1; at >= end_p; at-- )
    {
        WR32( at, expected );
        read = RD32(at);
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
    }

    /* PASS 5: Shifting address walk, ORIGINAL */
    expected  = pat32;  /* ORIGINAL value */

    end_p = addr + words;
    shift = sizeof(uint32_t);
    for ( at = addr + shift; at < end_p; shift <<= 1, at = addr + shift )
    {
        WR32( at, expected );
        WR32( addr, ~expected );    /* noise at base addr */
        read = RD32(at);
        if ( read != expected )
        {   
            return MEMTEST_FAILURE;
        }
    }

    expected  = ~pat32;  /* INVERSE value */

    /* PASS 6: Shifting address walk, INVERSE */
    end_p = addr + words;
    shift = sizeof(uint32_t);
    for ( at = addr + shift; at < end_p; shift <<= 1, at = addr + shift )
    {
        WR32( at, expected );
        WR32( addr, ~expected );    /* noise at base addr */
        read = RD32(at);
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
    }

    return MEMTEST_SUCCESS;
}

/*
 *-----------------------------------------------------------------------------
 * Function: scanBulkValue
 *
 * Description:
 * Pass 1. Fill entire memory in INcreasing memory address with value
 *         then in INcreasing memory address read and verify.
 * Pass 2. Fill entire memory in DEcreasing memory address with value
 *         then in DEcreasing memory address read and verify.
 * Pass 3. Fill entire memory in INcreasing memory address with inverse value
 *         then in INcreasing memory address read and verify.
 * Pass 4. Fill entire memory in DEcreasing memory address with inverse value
 *         then in DEcreasing memory address read and verify.
 * Pass 5. INcreasing shifted, ORIGINAL
 * Pass 6. INcreasing shifted, INVERSE
 *
 * Parameters:
 *  addr:   word aligned pointer to memory region
 *  bytes:  size in bytes of memory region to test
 *  pat32:  32bit pattern, e.g. 0x0U, 0xAAAAAAAA, 0xFF00FF00, 0xFFFF0000,
 *                              0xF0F0F0F0, 0xC3C3C3C3, 0x87878787
 *-----------------------------------------------------------------------------
 */
MemTestResult_t scanBulkValue( uint32_t * addr, uint32_t bytes, uint32_t pat32 )
{
    volatile uint32_t * at, * end_p;
    uint32_t expected, read, words;
    uint32_t shift;

    if ( ! IS_ALIGNED(addr,4) ) return MEMTEST_ERROR;

    words = bytes / sizeof(uint32_t);    /* in whole words (4byte multiple) */
    if ( words == 0 ) return MEMTEST_ERROR;

    expected  = pat32;  /* ORIGINAL value */

    /* INCREASING traversal */
    end_p     = addr + words;
    for ( at = addr; at < end_p; at++ )
    {
        WR32( at, expected );
    }
    for ( at = addr; at < end_p; at++ )
    {
        read = RD32(at);
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
    }

    /* DECREASING traversal */
    end_p     = addr;
    for ( at = addr + words - 1; at >= end_p; at-- )
    {
        WR32( at, expected );
    }
    for ( at = addr + words - 1; at >= end_p; at-- )
    {
        read = RD32(at);
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
    }

    expected  = ~pat32; /* INVERSE value */

    /* INCREASING traversal */
    end_p     = addr + words;
    for ( at = addr; at < end_p; at++ )
    {
        WR32( at, expected );
    }
    for ( at = addr; at < end_p; at++ )
    {
        read = RD32(at);
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
    }

    /* DECREASING traversal */
    end_p     = addr;
    for ( at = addr + words - 1; at >= end_p; at-- )
    {
        WR32( at, expected );
    }
    for ( at = addr + words - 1; at >= end_p; at-- )
    {
        read = RD32(at);
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
    }

    /* Pass 5. INCREASING Shifted traversal */
    expected  = pat32;  /* ORIGINAL value */
    end_p     = addr + words;
    shift = sizeof(uint32_t);
    for ( at = addr + shift; at < end_p; shift <<= 1, at = addr + shift )
    {
        WR32( at, expected );
        WR32( addr, ~expected );    /* noise at base addr */
    }
    shift = sizeof(uint32_t);
    for ( at = addr + shift; at < end_p; shift <<= 1, at = addr + shift )
    {
        read = RD32(at);
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
    }

    expected  = ~pat32;  /* INVERSE value */
    end_p     = addr + words;
    shift = sizeof(uint32_t);
    for ( at = addr + shift; at < end_p; shift <<= 1, at = addr + shift )
    {
        WR32( at, expected );
        WR32( addr, ~expected );    /* noise at base addr */
    }
    shift = sizeof(uint32_t);
    for ( at = addr + shift; at < end_p; shift <<= 1, at = addr + shift )
    {
        read = RD32(at);
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
    }

    return MEMTEST_SUCCESS;
}

/*
 *-----------------------------------------------------------------------------
 * Function: scanBulkAltInv
 *
 * Description:
 * Pass 1. Fill entire memory in INcreasing memory address with alternating
 *         value, then in INcreasing memory address read and verify.
 * Pass 2. Fill entire memory in DEcreasing memory address with alternating
 *         value, then in DEcreasing memory address read and verify.
 * Pass 3. Same as one but with shifted address.
 *
 * Parameters:
 *  addr:   word aligned pointer to memory region
 *  bytes:  size in bytes of memory region to test
 *  pat32:  32bit pattern, e.g. 0x0U, 0xAAAAAAAA, 0xFF00FF00, 0xFFFF0000,
 *                              0xF0F0F0F0, 0xC3C3C3C3, 0x87878787
 *-----------------------------------------------------------------------------
 */
MemTestResult_t scanBulkAltInv( uint32_t * addr, uint32_t bytes, uint32_t pat32 )
{
    volatile uint32_t * at, * end_p;
    uint32_t read, words;
    uint32_t shift;

    if ( ! IS_ALIGNED(addr,4) ) return MEMTEST_ERROR;

    words = bytes / sizeof(uint32_t);    /* in whole words (4byte multiple) */
    words = ROUNDDN( words, 2 );
    if ( words == 0 ) return MEMTEST_ERROR;

    /* INCREASING traversal */
    end_p     = addr + words;
    for ( at = addr; at < end_p; at+=2 )
    {
        WR32( at+0,  pat32 );
        WR32( at+1, ~pat32 );
    }
    for ( at = addr; at < end_p; at+=2 )
    {
        read = RD32( at+0 );
        if ( read != pat32 )
        {
            return MEMTEST_FAILURE;
        }
        read = RD32( at+1 );
        if ( read != ~pat32 )
        {
            return MEMTEST_FAILURE;
        }
    }

    /* DECREASING traversal */
    end_p     = addr;
    for ( at = addr + words - 1; at >= end_p; at-=2 )
    {
        WR32( at+0,  pat32 );
        WR32( at+1, ~pat32 );
    }
    for ( at = addr + words - 1; at >= end_p; at-=2 )
    {
        read = RD32( at+0 );
        if ( read != pat32 )
        {
            return MEMTEST_FAILURE;
        }
        read = RD32( at+1 );
        if ( read != ~pat32 )
        {
            return MEMTEST_FAILURE;
        }
    }

    /* INCREASING SHIFTED traversal */
    end_p     = addr + words;
    shift = sizeof(uint32_t);
    for ( at = addr + shift; at < end_p; shift <<= 1, at = addr + shift )
    {
        WR32( at+0,  pat32 );
        WR32( addr, 0 );
        WR32( at+1, ~pat32 );
        WR32( addr, 0 );
    }
    shift = sizeof(uint32_t);
    for ( at = addr + shift; at < end_p; shift <<= 1, at = addr + shift )
    {
        read = RD32( at+0 );
        if ( read != pat32 )
        {
            return MEMTEST_FAILURE;
        }
        read = RD32( at+1 );
        if ( read != ~pat32 )
        {
            return MEMTEST_FAILURE;
        }
    }

    return MEMTEST_SUCCESS;
}


/*
 *-----------------------------------------------------------------------------
 * Function: scanWordSelf
 *
 * Description:
 * 4 Passes are conducted on the memory region.
 * Pass 1. In INcreasing memory address, write a word with selfaddr and verify. 
 * Pass 2. In DEcreasing memory address, write a word with INVERSE and verify. 
 * Pass 3. In INcreasing memory address, write a word with INVERSE and verify. 
 * Pass 4. In DEcreasing memory address, write a word with selfaddr and verify. 
 * Pass 5. value = ORIGINAL address, INCREASING SHIFTED traversal.
 * Pass 6. value = INVERSE address, INCREASING SHIFTED traversal.
 *
 * In Pass 2 Read+Modify+Write, and in Pass 3, Read+Write is used
 *
 * Parameters:
 *  addr:   word aligned pointer to memory region
 *  bytes:  size in bytes of memory region to test
 *
 *-----------------------------------------------------------------------------
 */
MemTestResult_t scanWordSelf( uint32_t * addr, uint32_t bytes )
{
    volatile uint32_t * at, * end_p;
    uint32_t expected, read, words;
    uint32_t shift;
    
    if ( ! IS_ALIGNED(addr,4) ) return MEMTEST_FAILURE;

    words = bytes / sizeof(uint32_t);    /* in whole words (4byte multiple) */
    if ( words == 0 ) return MEMTEST_ERROR;

    /* ORIGINAL value */

    /* INCREASING traversal */
    end_p     = addr + words;
    for ( at = addr; at < end_p; at++ )
    {
        expected = (uint32_t)at;
        WR32( at, expected );
        read = RD32(at);
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
    }

    /* DECREASING traversal */
    end_p     = addr;
    for ( at = addr + words - 1; at >= end_p; at-- )
    {
        expected = ~( (uint32_t)RD32(at) );
        WR32( at, expected );
        read = RD32(at);
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
    }

    /* INCREASING traversal */
    end_p     = addr + words;
    for ( at = addr; at < end_p; at++ )
    {
        expected = ((uint32_t)RD32(at));
        WR32( at, expected );
        read = RD32(at);
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
    }

    /* DECREASING traversal */
    end_p     = addr;
    for ( at = addr + words - 1; at >= end_p; at-- )
    {
        expected = ~((uint32_t)at);
        WR32( at, expected );
        read = RD32(at);
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
    }

    /* value = ORIGINAL address, INCREASING SHIFTED traversal */
    end_p     = addr + words;
    shift = sizeof(uint32_t);
    for ( at = addr + shift; at < end_p; shift <<= 1, at = addr + shift )
    {
        expected = (uint32_t)at;    /* Not read modify write */
        WR32( at, expected );
        WR32( addr, ~expected );
        read = RD32(at);
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
    }

    /* value = INVERSE address, INCREASING SHIFTED traversal */
    end_p     = addr + words;
    shift = sizeof(uint32_t);
    for ( at = addr + shift; at < end_p; shift <<= 1, at = addr + shift )
    {
        expected = ~(uint32_t)(at); /* Not read modify write */
        WR32( at, expected );
        WR32( addr, ~expected );
        read = RD32(at);
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
    }

    return MEMTEST_SUCCESS;
}

/*
 *-----------------------------------------------------------------------------
 * Function: scanBulkSelf
 *
 * Description:
 * Pass 1. Fill entire memory in INcreasing memory address with self address
 *         then in INcreasing memory address read and verify.
 * Pass 2. Fill entire memory in DEcreasing memory address with self address
 *         then in DEcreasing memory address read and verify.
 * Pass 3. Fill entire memory in INcreasing memory address with inverse addr
 *         then in INcreasing memory address read and verify.
 * Pass 4. Fill entire memory in DEcreasing memory address with inverse addr
 *         then in DEcreasing memory address read and verify.
 * Pass 5. Same as Pass 1 but with shifted address
 * Pass 6. Same as Pass 3 but with shifted address
 *
 * Parameters:
 *  addr:   word aligned pointer to memory region
 *  bytes:  size in bytes of memory region to test
 *-----------------------------------------------------------------------------
 */
MemTestResult_t scanBulkSelf( uint32_t * addr, uint32_t bytes )
{
    volatile uint32_t * at, * end_p;
    uint32_t read, words;
    uint32_t shift;

    if ( ! IS_ALIGNED(addr,4) ) return MEMTEST_ERROR;

    words = bytes / sizeof(uint32_t);    /* in whole words (4byte multiple) */
    if ( words == 0 ) return MEMTEST_ERROR;

    /* INCREASING traversal */
    end_p     = addr + words;
    for ( at = addr; at < end_p; at++ )
    {
        WR32( at, (uint32_t)at );
    }
    for ( at = addr; at < end_p; at++ )
    {
        read = RD32(at);
        if ( read != (uint32_t)at )
        {
            return MEMTEST_FAILURE;
        }
    }

    /* DECREASING traversal */
    end_p     = addr;
    for ( at = addr + words - 1; at >= end_p; at-- )
    {
        WR32( at, (uint32_t)at );
    }
    for ( at = addr + words - 1; at >= end_p; at-- )
    {
        read = RD32(at);
        if ( read != (uint32_t)at )
        {
            return MEMTEST_FAILURE;
        }
    }

    /* INCREASING traversal */
    end_p     = addr + words;
    for ( at = addr; at < end_p; at++ )
    {
        WR32( at, ~((uint32_t)at) );
    }
    for ( at = addr; at < end_p; at++ )
    {
        read = RD32(at);
        if ( read != ~((uint32_t)at) )
        {
            return MEMTEST_FAILURE;
        }
    }

    /* DECREASING traversal */
    end_p     = addr;
    for ( at = addr + words - 1; at >= end_p; at-- )
    {
        WR32( at, ~((uint32_t)at) );
    }
    for ( at = addr + words - 1; at >= end_p; at-- )
    {
        read = RD32(at);
        if ( read != ~((uint32_t)at) )
        {
            return MEMTEST_FAILURE;
        }
    }

    /* INCREASING traversal */
    end_p     = addr + words;
    shift = sizeof(uint32_t);
    for ( at = addr + shift; at < end_p; shift <<= 1, at = addr + shift )
    {
        WR32( at, (uint32_t)at );
        WR32( addr, ~((uint32_t)at) );
    }
    shift = sizeof(uint32_t);
    for ( at = addr + shift; at < end_p; shift <<= 1, at = addr + shift )
    {
        read = RD32(at);
        if ( read != (uint32_t)at )
        {
            return MEMTEST_FAILURE;
        }
    }

    /* INCREASING traversal */
    end_p     = addr + words;
    shift = sizeof(uint32_t);
    for ( at = addr + shift; at < end_p; shift <<= 1, at = addr + shift )
    {
        WR32( at, ~((uint32_t)at) );
        WR32( addr, ((uint32_t)at) );
    }
    shift = sizeof(uint32_t);
    for ( at = addr + shift; at < end_p; shift <<= 1, at = addr + shift )
    {
        read = RD32(at);
        if ( read != ~((uint32_t)at) )
        {
            return MEMTEST_FAILURE;
        }
    }

    return MEMTEST_SUCCESS;
}


/*
 *-----------------------------------------------------------------------------
 * Function: slidingAltInv
 *
 * Description:
 * This is the same as scanBulkAltInv, where in each invocation the value is 
 * rotated to the right. The starting value is usedefined.
 *
 * Parameters:
 *  addr:   word aligned pointer to memory region
 *  bytes:  size in bytes of memory region to test
 *  pat32:  pattern to slide per pass
 *-----------------------------------------------------------------------------
 */
MemTestResult_t slidingAltInv( uint32_t * addr, uint32_t bytes, uint32_t pat32 )
{
    uint32_t sliding_pat32, i;

    if ( pat32 ==  0x0 ) pat32 = 0x80000000;
    if ( pat32 == ~0x0 ) pat32 = 0x7FFFFFFF;

    sliding_pat32 = pat32;

    for ( i=0; i<32; i++ )
    {
        if ( scanBulkAltInv( addr, bytes, sliding_pat32 )
             == MEMTEST_FAILURE )
        {
            return MEMTEST_FAILURE;
        }

        sliding_pat32 = RROTATE32( sliding_pat32 );
    }

    sliding_pat32 = pat32;
    for (i=0; i<32; i++)
    {
        if ( scanBulkAltInv( addr, bytes, sliding_pat32 )
             == MEMTEST_FAILURE )
        {
            return MEMTEST_FAILURE;
        }

        sliding_pat32 = LROTATE32( sliding_pat32 );
    }

    return MEMTEST_SUCCESS;
}

/*
 *-----------------------------------------------------------------------------
 * Function: slidingDiag
 *
 * Description:
 * Pass 1. Fill entire memory in INcreasing memory address with pattern right
 *         shifted. Then read in INcreasing order and verify.
 * Pass 2. Fill entire memory in DEcreasing memory address with inverse of
 *         read value. Then read in DEcreasing order and verify.
 * Pass 3. Fill entire memory in DEcreasing memory address with pattern right
 *         shifted. Then read in DEcreasing order and verify.
 * Pass 4. Fill entire memory in INcreasing memory address with inverse of
 *         read value. Then read in INcreasing order and verify.
 *
 * Parameters:
 *  addr:   word aligned pointer to memory region
 *  bytes:  size in bytes of memory region to test
 *  pat32:  pattern to be filled shifted each write
 *-----------------------------------------------------------------------------
 */
MemTestResult_t slidingDiag( uint32_t * addr, uint32_t bytes, uint32_t pat32 )
{
    volatile uint32_t * at, * end_p;
    uint32_t expected, read = 0, words, last;

    if ( ! IS_ALIGNED(addr,4) ) return MEMTEST_ERROR;

    words = bytes / sizeof(uint32_t);    /* in whole words (4byte multiple) */
    if ( words == 0 ) return MEMTEST_ERROR;


    /* INCREASING traversal */
    expected = pat32;  /* ORIGINAL value */
    end_p = addr + words;
    for ( at = addr; at < end_p; at++ )
    {
        WR32( at, expected );
        expected = RROTATE32( expected );   /* next expected */
    }
    expected = pat32;   /* ORIGINAL value */
    for ( at = addr; at < end_p; at++ )
    {
        read = RD32(at);
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
        expected = RROTATE32( expected );   /* next expected */
    }

    last = ~( read );   /* Starting value for decreasing traversal, next */

    /* DECREASING traversal */
    end_p = addr;
    for ( at = addr + words - 1; at >= end_p; at-- )
    {
        expected = ~( RD32(at) );
        WR32( at, expected );
    }
    expected = last;
    for ( at = addr + words - 1; at >= end_p; at-- )
    {
        read = RD32(at);
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
        expected = LROTATE32( expected );
    }

    /* DECREASING traversal */
    expected = pat32;  /* ORIGINAL value */
    end_p = addr;
    for ( at = addr + words - 1; at >= end_p; at-- )
    {
        WR32( at, expected );
        expected = RROTATE32( expected );   /* next expected */
    }
    expected = pat32;  /* ORIGINAL value */
    for ( at = addr + words - 1; at >= end_p; at-- )
    {
        read = RD32(at);
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
        expected = RROTATE32( expected );   /* next expected */
    }

    last = ~( read );

    /* INCREASING traversal */
    end_p = addr + words;
    for ( at = addr; at < end_p; at++ )
    {
        expected = ~( RD32(at) );
        WR32( at, expected );
    }
    expected = last;
    for ( at = addr; at < end_p; at++ )
    {
        read = RD32(at);
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
        expected = LROTATE32( expected );
    }

    return MEMTEST_SUCCESS;
}

/*
 *-----------------------------------------------------------------------------
 * Function: memoryBulkCopy
 *
 * Description:
 * Pass 1. Copy entire ORIGINAL memory in INcreasing memory address, then verify
 * Pass 2. Copy entire ORIGINAL memory in DEcreasing memory address, then verify
 * Pass 3. Copy entire INVERSE  memory in INcreasing memory address, then verify
 * Pass 4. Copy entire INVERSE  memory in DEcreasing memory address, then verify
 *-----------------------------------------------------------------------------
 */
MemTestResult_t memoryBulkCopy( uint32_t * saddr, uint32_t * daddr,
                                uint32_t bytes )
{
    volatile uint32_t * src_p, * dst_p, * end_p; 
    uint32_t expected, read, words;

    if ( ! IS_ALIGNED(saddr,4) ) return MEMTEST_ERROR;
    if ( ! IS_ALIGNED(daddr,4) ) return MEMTEST_ERROR;

    words = bytes / sizeof(uint32_t);    /* in whole words (4byte multiple) */
    if ( words == 0 ) return MEMTEST_ERROR;

    if ( (uint32_t)saddr < (uint32_t)daddr )
    {
        if ( (uint32_t)(saddr + words) > (uint32_t)daddr )
            return MEMTEST_ERROR;
    }
    else if ( (uint32_t)daddr < (uint32_t)saddr )
    {
        if ( (uint32_t)(daddr + words) > (uint32_t)saddr )
            return MEMTEST_ERROR;
    }

    /* INCREASING traversal ORIGINAL */
    end_p = saddr + words;
    for ( src_p = saddr, dst_p = daddr; src_p < end_p; src_p++, dst_p++ )
    {
        expected = RD32( dst_p );
        WR32( src_p, expected );
    }
    for ( src_p = saddr, dst_p = daddr; src_p < end_p; src_p++, dst_p++ )
    {
        expected = RD32( dst_p );
        read = RD32( src_p );
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
    }

    /* DECREASING traversal ORIGINAL */
    end_p = saddr;
    for ( src_p = saddr + words - 1, dst_p = daddr + words - 1;
          src_p >= end_p; src_p--, dst_p-- )
    {
        expected = RD32( dst_p );
        WR32( src_p, expected );
    }
    for ( src_p = saddr + words - 1, dst_p = daddr + words - 1;
          src_p >= end_p; src_p--, dst_p-- )
    {
        expected = RD32( dst_p );
        read = RD32( src_p );
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
    }

    /* INCREASING traversal INVERSE */
    end_p = saddr + words;
    for ( src_p = saddr, dst_p = daddr; src_p < end_p; src_p++, dst_p++ )
    {
        expected = ~( RD32( dst_p ) );
        WR32( src_p, expected );
    }
    for ( src_p = saddr, dst_p = daddr; src_p < end_p; src_p++, dst_p++ )
    {
        expected = ~( RD32( dst_p ) );
        read = RD32( src_p );
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
    }

    /* DECREASING traversal INVERSE */
    end_p = saddr;
    for ( src_p = saddr + words - 1, dst_p = daddr + words - 1;
          src_p >= end_p; src_p--, dst_p-- )
    {
        expected = ~( RD32( dst_p ) );
        WR32( src_p, expected );
    }
    for ( src_p = saddr + words - 1, dst_p = daddr + words - 1;
          src_p >= end_p; src_p--, dst_p-- )
    {
        expected = ~( RD32( dst_p ) );
        read = RD32( src_p );
        if ( read != expected )
        {
            return MEMTEST_FAILURE;
        }
    }

    return MEMTEST_SUCCESS;
}

/*---------------------------------------------------------------------------*/