OmniNX/Horizon-OC
2
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
d72e05259ae56546fb30532402ba7a61ba63508d
Horizon-OC/Source/MemTesterNX/source/tests.c

533 lines
14 KiB
C
Executable File
Raw Blame History

/*
* Very simple but very effective user-space memory tester.
* Originally by Simon Kirby <sim@stormix.com> <sim@neato.org>
* Version 2 by Charles Cazabon <charlesc-memtester@pyropus.ca>
* Version 3 not publicly released.
* Version 4 rewrite:
* Copyright (C) 2004-2020 Charles Cazabon <charlesc-memtester@pyropus.ca>
* Licensed under the terms of the GNU General Public License version 2 (only).
* See the file COPYING for details.
*
* This file contains the functions for the actual tests, called from the
* main routine in memtester.c. See other comments in that file.
*
*/
#include <sys/types.h>
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include <string.h>
#include "tests.h"
#include "types.h"
#include "sizes.h"
#include "memtester.h"
#include <switch.h>
extern unsigned short dividend;
char progress[] = "-\\|/";
#define PROGRESSLEN 4
#define PROGRESSOFTEN 2000000
#define ONE 0x00000001L
union {
unsigned char bytes[UL_LEN/8];
ul val;
} mword8;
union {
unsigned short u16s[UL_LEN/16];
ul val;
} mword16;
/* Function definitions. */
int compare_regions(ulv *bufa, ulv *bufb, size_t count) {
int r = 0;
size_t i;
ulv *p1 = bufa;
ulv *p2 = bufb;
// off_t physaddr;
for (i = 0; i < count; i++, p1++, p2++) {
if (*p1 != *p2) {
// if (use_phys) {
// physaddr = physaddrbase + (i * sizeof(ul));
// printf("FAILURE: 0x%08lx != 0x%08lx at physical address 0x%08lx.\n", (ul) *p1, (ul) *p2, physaddr);
// } else {
// printf("FAILURE: 0x%08lx != 0x%08lx at offset 0x%08lx.\n", (ul) *p1, (ul) *p2, (ul) (i * sizeof(ul)));
// }
/* // printf("Skipping to next test..."); */
r = -1;
}
}
return r;
}
int test_stuck_address(ulv *bufa, size_t count) {
ulv *p1 = bufa;
unsigned int j;
size_t i;
// off_t physaddr;
// printf(" ");
for (j = 0; j < (16 / dividend) ; j++) {
// printf("\b\b\b\b\b\b\b\b\b\b\b");
p1 = (ulv *) bufa;
// printf("setting %3u", j);
for (i = 0; i < count; i++) {
*p1 = ((j + i) % 2) == 0 ? (ul) p1 : ~((ul) p1);
*p1++;
}
// printf("\b\b\b\b\b\b\b\b\b\b\b");
// printf("testing %3u", j);
p1 = (ulv *) bufa;
for (i = 0; i < count; i++, p1++) {
if (*p1 != (((j + i) % 2) == 0 ? (ul) p1 : ~((ul) p1))) {
// if (use_phys) {
// physaddr = physaddrbase + (i * sizeof(ul));
// printf("FAILURE: possible bad address line at physical address 0x%08lx.\n", physaddr);
// } else {
// printf("FAILURE: possible bad address line at offset 0x%08lx.\n", (ul) (i * sizeof(ul)));
// }
// printf("Skipping to next test...\n");
return -1;
}
}
}
// printf("\b\b\b\b\b\b\b\b\b\b\b \b\b\b\b\b\b\b\b\b\b\b");
return 0;
}
int test_stress_memcpy(ulv *bufa, ulv *bufb, size_t count) {
unsigned int j;
int q = rand_ul();
memset((void*)bufa, q, count*sizeof(ul));
memset((void*)bufb, q, count*sizeof(ul));
for (j = 0; j < 128; j++) {
memcpy((void*)bufa, (void*)bufb, count*sizeof(ul));
}
return memcmp((void*)bufa, (void*)bufb, count*sizeof(ul));
}
int test_stress_memset(ulv *bufa, ulv *bufb, size_t count) {
unsigned int j;
for (j = 0; j < 128; j++) {
int q = rand_ul();
memset((void*)bufa, q, count*sizeof(ul));
memset((void*)bufb, q, count*sizeof(ul));
}
return memcmp((void*)bufa, (void*)bufb, count*sizeof(ul));
}
int test_stress_memcmp(ulv *bufa, ulv *bufb, size_t count) {
ulv *p1 = bufa;
ulv *p2 = bufb;
unsigned int j;
int q = rand_ul();
memset((void*)bufa, q, count*sizeof(ul));
memset((void*)bufb, q, count*sizeof(ul));
int rc = 0;
for (j = 0; j < 32; j++) {
// Trick compiler so that it won't skip memcmp
*p1++ = *p2++ = rand_ul();
rc = memcmp((void*)bufa, (void*)bufb, count*sizeof(ul));
if (rc)
return rc;
}
return rc;
}
int test_random_value(ulv *bufa, ulv *bufb, size_t count) {
ulv *p1 = bufa;
ulv *p2 = bufb;
// ul j = 0;
size_t i;
// putchar(' ');
for (i = 0; i < count; i++) {
*p1++ = *p2++ = rand_ul();
if (!(i % PROGRESSOFTEN)) {
// putchar('\b');
// putchar(progress[++j % PROGRESSLEN]);
}
}
// printf("\b \b");
return compare_regions(bufa, bufb, count);
}
int test_xor_comparison(ulv *bufa, ulv *bufb, size_t count) {
ulv *p1 = bufa;
ulv *p2 = bufb;
size_t i;
ul q = rand_ul();
for (i = 0; i < count; i++) {
*p1++ ^= q;
*p2++ ^= q;
}
return compare_regions(bufa, bufb, count);
}
int test_sub_comparison(ulv *bufa, ulv *bufb, size_t count) {
ulv *p1 = bufa;
ulv *p2 = bufb;
size_t i;
ul q = rand_ul();
for (i = 0; i < count; i++) {
*p1++ -= q;
*p2++ -= q;
}
return compare_regions(bufa, bufb, count);
}
int test_mul_comparison(ulv *bufa, ulv *bufb, size_t count) {
ulv *p1 = bufa;
ulv *p2 = bufb;
size_t i;
ul q = rand_ul();
for (i = 0; i < count; i++) {
*p1++ *= q;
*p2++ *= q;
}
return compare_regions(bufa, bufb, count);
}
int test_div_comparison(ulv *bufa, ulv *bufb, size_t count) {
ulv *p1 = bufa;
ulv *p2 = bufb;
size_t i;
ul q = rand_ul();
for (i = 0; i < count; i++) {
if (!q) {
q++;
}
*p1++ /= q;
*p2++ /= q;
}
return compare_regions(bufa, bufb, count);
}
int test_or_comparison(ulv *bufa, ulv *bufb, size_t count) {
ulv *p1 = bufa;
ulv *p2 = bufb;
size_t i;
ul q = rand_ul();
for (i = 0; i < count; i++) {
*p1++ |= q;
*p2++ |= q;
}
return compare_regions(bufa, bufb, count);
}
int test_and_comparison(ulv *bufa, ulv *bufb, size_t count) {
ulv *p1 = bufa;
ulv *p2 = bufb;
size_t i;
ul q = rand_ul();
for (i = 0; i < count; i++) {
*p1++ &= q;
*p2++ &= q;
}
return compare_regions(bufa, bufb, count);
}
int test_seqinc_comparison(ulv *bufa, ulv *bufb, size_t count) {
ulv *p1 = bufa;
ulv *p2 = bufb;
size_t i;
ul q = rand_ul();
for (i = 0; i < count; i++) {
*p1++ = *p2++ = (i + q);
}
return compare_regions(bufa, bufb, count);
}
int test_solidbits_comparison(ulv *bufa, ulv *bufb, size_t count) {
ulv *p1 = bufa;
ulv *p2 = bufb;
unsigned int j;
ul q;
size_t i;
// printf(" ");
for (j = 0; j < (64 / dividend / dividend); j++) {
// printf("\b\b\b\b\b\b\b\b\b\b\b");
q = (j % 2) == 0 ? UL_ONEBITS : 0;
// printf("setting %3u", j);
p1 = (ulv *) bufa;
p2 = (ulv *) bufb;
for (i = 0; i < count; i++) {
*p1++ = *p2++ = (i % 2) == 0 ? q : ~q;
}
// printf("\b\b\b\b\b\b\b\b\b\b\b");
// printf("testing %3u", j);
if (compare_regions(bufa, bufb, count)) {
return -1;
}
}
// printf("\b\b\b\b\b\b\b\b\b\b\b \b\b\b\b\b\b\b\b\b\b\b");
return 0;
}
int test_checkerboard_comparison(ulv *bufa, ulv *bufb, size_t count) {
ulv *p1 = bufa;
ulv *p2 = bufb;
unsigned int j;
ul q;
size_t i;
// printf(" ");
for (j = 0; j < (64 / dividend / dividend); j++) {
// printf("\b\b\b\b\b\b\b\b\b\b\b");
q = (j % 2) == 0 ? CHECKERBOARD1 : CHECKERBOARD2;
// printf("setting %3u", j);
p1 = (ulv *) bufa;
p2 = (ulv *) bufb;
for (i = 0; i < count; i++) {
*p1++ = *p2++ = (i % 2) == 0 ? q : ~q;
}
// printf("\b\b\b\b\b\b\b\b\b\b\b");
// printf("testing %3u", j);
if (compare_regions(bufa, bufb, count)) {
return -1;
}
}
// printf("\b\b\b\b\b\b\b\b\b\b\b \b\b\b\b\b\b\b\b\b\b\b");
return 0;
}
int test_blockseq_comparison(ulv *bufa, ulv *bufb, size_t count) {
ulv *p1 = bufa;
ulv *p2 = bufb;
unsigned int j;
size_t i;
// printf(" ");
for (j = 0; j < (64 / dividend / dividend) ; j++) {
// printf("\b\b\b\b\b\b\b\b\b\b\b");
p1 = (ulv *) bufa;
p2 = (ulv *) bufb;
// printf("setting %3u", j);
for (i = 0; i < count; i++) {
*p1++ = *p2++ = (ul) UL_BYTE(j);
}
// printf("\b\b\b\b\b\b\b\b\b\b\b");
// printf("testing %3u", j);
if (compare_regions(bufa, bufb, count)) {
return -1;
}
}
// printf("\b\b\b\b\b\b\b\b\b\b\b \b\b\b\b\b\b\b\b\b\b\b");
return 0;
}
int test_walkbits0_comparison(ulv *bufa, ulv *bufb, size_t count) {
ulv *p1 = bufa;
ulv *p2 = bufb;
unsigned int j;
size_t i;
// printf(" ");
for (j = 0; j < (UL_LEN * 2 / dividend / dividend); j++) {
// printf("\b\b\b\b\b\b\b\b\b\b\b");
p1 = (ulv *) bufa;
p2 = (ulv *) bufb;
// printf("setting %3u", j);
for (i = 0; i < count; i++) {
if (j < UL_LEN) { /* Walk it up. */
*p1++ = *p2++ = ONE << j;
} else { /* Walk it back down. */
*p1++ = *p2++ = ONE << (UL_LEN * 2 - j - 1);
}
}
// printf("\b\b\b\b\b\b\b\b\b\b\b");
// printf("testing %3u", j);
if (compare_regions(bufa, bufb, count)) {
return -1;
}
}
// printf("\b\b\b\b\b\b\b\b\b\b\b \b\b\b\b\b\b\b\b\b\b\b");
return 0;
}
int test_walkbits1_comparison(ulv *bufa, ulv *bufb, size_t count) {
ulv *p1 = bufa;
ulv *p2 = bufb;
unsigned int j;
size_t i;
// printf(" ");
for (j = 0; j < (UL_LEN * 2 / dividend / dividend); j++) {
// printf("\b\b\b\b\b\b\b\b\b\b\b");
p1 = (ulv *) bufa;
p2 = (ulv *) bufb;
// printf("setting %3u", j);
for (i = 0; i < count; i++) {
if (j < UL_LEN) { /* Walk it up. */
*p1++ = *p2++ = UL_ONEBITS ^ (ONE << j);
} else { /* Walk it back down. */
*p1++ = *p2++ = UL_ONEBITS ^ (ONE << (UL_LEN * 2 - j - 1));
}
}
// printf("\b\b\b\b\b\b\b\b\b\b\b");
// printf("testing %3u", j);
if (compare_regions(bufa, bufb, count)) {
return -1;
}
}
// printf("\b\b\b\b\b\b\b\b\b\b\b \b\b\b\b\b\b\b\b\b\b\b");
return 0;
}
int test_bitspread_comparison(ulv *bufa, ulv *bufb, size_t count) {
ulv *p1 = bufa;
ulv *p2 = bufb;
unsigned int j;
size_t i;
// printf(" ");
for (j = 0; j < (UL_LEN * 2 / dividend / dividend); j++) {
// printf("\b\b\b\b\b\b\b\b\b\b\b");
p1 = (ulv *) bufa;
p2 = (ulv *) bufb;
// printf("setting %3u", j);
for (i = 0; i < count; i++) {
if (j < UL_LEN) { /* Walk it up. */
*p1++ = *p2++ = (i % 2 == 0)
? (ONE << j) | (ONE << (j + 2))
: UL_ONEBITS ^ ((ONE << j)
| (ONE << (j + 2)));
} else { /* Walk it back down. */
*p1++ = *p2++ = (i % 2 == 0)
? (ONE << (UL_LEN * 2 - 1 - j)) | (ONE << (UL_LEN * 2 + 1 - j))
: UL_ONEBITS ^ (ONE << (UL_LEN * 2 - 1 - j)
| (ONE << (UL_LEN * 2 + 1 - j)));
}
}
// printf("\b\b\b\b\b\b\b\b\b\b\b");
// printf("testing %3u", j);
if (compare_regions(bufa, bufb, count)) {
return -1;
}
}
// printf("\b\b\b\b\b\b\b\b\b\b\b \b\b\b\b\b\b\b\b\b\b\b");
return 0;
}
int test_bitflip_comparison(ulv *bufa, ulv *bufb, size_t count) {
ulv *p1 = bufa;
ulv *p2 = bufb;
unsigned int j, k;
ul q;
size_t i;
// printf(" ");
for (k = 0; k < (UL_LEN / dividend / dividend); k++) {
q = ONE << k;
for (j = 0; j < 8; j++) {
// printf("\b\b\b\b\b\b\b\b\b\b\b");
q = ~q;
// printf("setting %3u", k * 8 + j);
p1 = (ulv *) bufa;
p2 = (ulv *) bufb;
for (i = 0; i < count; i++) {
*p1++ = *p2++ = (i % 2) == 0 ? q : ~q;
}
// printf("\b\b\b\b\b\b\b\b\b\b\b");
// printf("testing %3u", k * 8 + j);
if (compare_regions(bufa, bufb, count)) {
return -1;
}
}
}
// printf("\b\b\b\b\b\b\b\b\b\b\b \b\b\b\b\b\b\b\b\b\b\b");
return 0;
}
#ifdef TEST_NARROW_WRITES
int test_8bit_wide_random(ulv* bufa, ulv* bufb, size_t count) {
u8v *p1, *t;
ulv *p2;
int attempt;
unsigned int b, j = 0;
size_t i;
// putchar(' ');
for (attempt = 0; attempt < 2; attempt++) {
if (attempt & 1) {
p1 = (u8v *) bufa;
p2 = bufb;
} else {
p1 = (u8v *) bufb;
p2 = bufa;
}
for (i = 0; i < count; i++) {
t = mword8.bytes;
*p2++ = mword8.val = rand_ul();
for (b=0; b < UL_LEN/8; b++) {
*p1++ = *t++;
}
if (!(i % PROGRESSOFTEN)) {
// putchar('\b');
// putchar(progress[++j % PROGRESSLEN]);
}
}
if (compare_regions(bufa, bufb, count)) {
return -1;
}
}
// printf("\b \b");
return 0;
}
int test_16bit_wide_random(ulv* bufa, ulv* bufb, size_t count) {
u16v *p1, *t;
ulv *p2;
int attempt;
unsigned int b, j = 0;
size_t i;
// putchar( ' ' );
for (attempt = 0; attempt < 2; attempt++) {
if (attempt & 1) {
p1 = (u16v *) bufa;
p2 = bufb;
} else {
p1 = (u16v *) bufb;
p2 = bufa;
}
for (i = 0; i < count; i++) {
t = mword16.u16s;
*p2++ = mword16.val = rand_ul();
for (b = 0; b < UL_LEN/16; b++) {
*p1++ = *t++;
}
if (!(i % PROGRESSOFTEN)) {
// putchar('\b');
// putchar(progress[++j % PROGRESSLEN]);
}
}
if (compare_regions(bufa, bufb, count)) {
return -1;
}
}
// printf("\b \b");
return 0;
}
#endif
Reference in New Issue View Git Blame Copy Permalink