memtester-4.3.0.tar.gz

/* * 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-2012 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 "types.h" #include "sizes.h" #include "memtester.h" char progress[] = "-\\|/"; #define PROGRESSLEN 4 #define PROGRESSOFTEN 2500 #define ONE 0x00000001L /* 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)); fprintf(stderr, "FAILURE: 0x%08lx != 0x%08lx at physical address " "0x%08lx.\n", (ul) *p1, (ul) *p2, physaddr); } else { fprintf(stderr, "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(" "); fflush(stdout); for (j = 0; j < 16; j++) { printf("\b\b\b\b\b\b\b\b\b\b\b"); p1 = (ulv *) bufa; printf("setting %3u", j); fflush(stdout); 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); fflush(stdout); 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)); fprintf(stderr, "FAILURE: possible bad address line at physical " "address 0x%08lx.\n", physaddr); } else { fprintf(stderr, "FAILURE: possible bad address line at offset " "0x%08lx.\n", (ul) (i * sizeof(ul))); } printf("Skipping to next test...\n"); fflush(stdout); 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"); fflush(stdout); return 0; } int test_random_value(ulv *bufa, ulv *bufb, size_t count) { ulv *p1 = bufa; ulv *p2 = bufb; ul j = 0; size_t i; putchar(' '); fflush(stdout); for (i = 0; i < count; i++) { *p1++ = *p2++ = rand_ul(); if (!(i % PROGRESSOFTEN)) { putchar('\b'); putchar(progress[++j % PROGRESSLEN]); fflush(stdout); } } printf("\b \b"); fflush(stdout); 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(" "); fflush(stdout); for (j = 0; j < 64; j++) { printf("\b\b\b\b\b\b\b\b\b\b\b"); q = (j % 2) == 0 ? UL_ONEBITS : 0; printf("setting %3u", j); fflush(stdout); 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); fflush(stdout); 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"); fflush(stdout); 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(" "); fflush(stdout); for (j = 0; j < 64; j++) { printf("\b\b\b\b\b\b\b\b\b\b\b"); q = (j % 2) == 0 ? CHECKERBOARD1 : CHECKERBOARD2; printf("setting %3u", j); fflush(stdout); 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); fflush(stdout); 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"); fflush(stdout); 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(" "); fflush(stdout); for (j = 0; j < 256; j++) { printf("\b\b\b\b\b\b\b\b\b\b\b"); p1 = (ulv *) bufa; p2 = (ulv *) bufb; printf("setting %3u", j); fflush(stdout); 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); fflush(stdout); 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");