2013-06-03 23:13:51 +00:00
|
|
|
/*
|
2014-04-10 12:04:06 +00:00
|
|
|
* memtest.c
|
2013-06-03 23:13:51 +00:00
|
|
|
*
|
2014-04-10 12:04:06 +00:00
|
|
|
* Copyright (C) 2013 Alexander Aring <aar@pengutronix.de>, Pengutronix
|
2013-06-03 23:13:51 +00:00
|
|
|
*
|
|
|
|
* (C) Copyright 2000
|
|
|
|
* Wolfgang Denk, DENX Software Engineering, wd@denx.de.
|
|
|
|
*
|
|
|
|
* See file CREDITS for list of people who contributed to this
|
|
|
|
* project.
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License version 2
|
|
|
|
* as published by the Free Software Foundation.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <progress.h>
|
|
|
|
#include <common.h>
|
|
|
|
#include <memory.h>
|
|
|
|
#include <types.h>
|
2015-01-08 07:02:20 +00:00
|
|
|
#include <linux/sizes.h>
|
2013-07-10 07:27:06 +00:00
|
|
|
#include <errno.h>
|
2013-06-03 23:13:51 +00:00
|
|
|
#include <memtest.h>
|
2015-10-23 07:39:15 +00:00
|
|
|
#include <malloc.h>
|
2015-10-23 09:06:56 +00:00
|
|
|
#include <mmu.h>
|
2015-10-23 07:39:15 +00:00
|
|
|
|
|
|
|
static int alloc_memtest_region(struct list_head *list,
|
|
|
|
resource_size_t start, resource_size_t size)
|
|
|
|
{
|
|
|
|
struct resource *r_new;
|
|
|
|
struct mem_test_resource *r;
|
|
|
|
|
|
|
|
r = xzalloc(sizeof(struct mem_test_resource));
|
|
|
|
r_new = request_sdram_region("memtest", start, size);
|
|
|
|
if (!r_new)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
r->r = r_new;
|
|
|
|
list_add_tail(&r->list, list);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int mem_test_request_regions(struct list_head *list)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
struct memory_bank *bank;
|
|
|
|
struct resource *r, *r_prev = NULL;
|
|
|
|
resource_size_t start, end, size;
|
|
|
|
|
|
|
|
for_each_memory_bank(bank) {
|
|
|
|
/*
|
|
|
|
* If we don't have any allocated region on bank,
|
|
|
|
* we use the whole bank boundary
|
|
|
|
*/
|
|
|
|
if (list_empty(&bank->res->children)) {
|
|
|
|
start = PAGE_ALIGN(bank->res->start);
|
|
|
|
size = PAGE_ALIGN_DOWN(bank->res->end - start + 1);
|
|
|
|
|
|
|
|
if (size) {
|
|
|
|
ret = alloc_memtest_region(list, start, size);
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
r = list_first_entry(&bank->res->children,
|
|
|
|
struct resource, sibling);
|
|
|
|
start = PAGE_ALIGN(bank->res->start);
|
|
|
|
end = PAGE_ALIGN_DOWN(r->start);
|
|
|
|
r_prev = r;
|
|
|
|
if (start != end) {
|
|
|
|
size = end - start;
|
|
|
|
ret = alloc_memtest_region(list, start, size);
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* We assume that the regions are sorted in this list
|
|
|
|
* So the first element has start boundary on bank->res->start
|
|
|
|
* and the last element hast end boundary on bank->res->end.
|
|
|
|
*
|
|
|
|
* Between used regions. Start from second entry.
|
|
|
|
*/
|
|
|
|
list_for_each_entry_from(r, &bank->res->children, sibling) {
|
|
|
|
start = PAGE_ALIGN(r_prev->end + 1);
|
|
|
|
end = r->start - 1;
|
|
|
|
r_prev = r;
|
|
|
|
if (start >= end)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
size = PAGE_ALIGN_DOWN(end - start + 1);
|
|
|
|
if (size == 0)
|
|
|
|
continue;
|
|
|
|
ret = alloc_memtest_region(list, start, size);
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Do on head element for bank boundary.
|
|
|
|
*/
|
|
|
|
r = list_last_entry(&bank->res->children,
|
|
|
|
struct resource, sibling);
|
|
|
|
start = PAGE_ALIGN(r->end);
|
|
|
|
end = bank->res->end;
|
|
|
|
size = PAGE_ALIGN_DOWN(end - start + 1);
|
|
|
|
if (size && start < end && start > r->end) {
|
|
|
|
ret = alloc_memtest_region(list, start, size);
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void mem_test_release_regions(struct list_head *list)
|
|
|
|
{
|
|
|
|
struct mem_test_resource *r, *r_tmp;
|
|
|
|
|
|
|
|
list_for_each_entry_safe(r, r_tmp, list, list) {
|
|
|
|
/*
|
|
|
|
* Ensure to leave with a cached on non used sdram regions.
|
|
|
|
*/
|
|
|
|
remap_range((void *)r->r->start, r->r->end -
|
2015-10-23 09:06:56 +00:00
|
|
|
r->r->start + 1, MAP_DEFAULT);
|
2015-10-23 07:39:15 +00:00
|
|
|
|
|
|
|
release_sdram_region(r->r);
|
|
|
|
free(r);
|
|
|
|
}
|
|
|
|
}
|
2013-06-03 23:13:51 +00:00
|
|
|
|
2015-10-23 12:51:52 +00:00
|
|
|
struct mem_test_resource *mem_test_biggest_region(struct list_head *list)
|
|
|
|
{
|
|
|
|
struct mem_test_resource *r, *best = NULL;
|
|
|
|
resource_size_t size = 0;
|
|
|
|
|
|
|
|
list_for_each_entry(r, list, list) {
|
|
|
|
resource_size_t now = resource_size(r->r);
|
|
|
|
if (now > size) {
|
|
|
|
size = now;
|
|
|
|
best = r;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return best;
|
|
|
|
}
|
|
|
|
|
2015-05-14 02:54:21 +00:00
|
|
|
static void mem_test_report_failure(const char *failure_description,
|
|
|
|
resource_size_t expected_value,
|
|
|
|
resource_size_t actual_value,
|
|
|
|
volatile resource_size_t *address)
|
|
|
|
{
|
|
|
|
printf("FAILURE (%s): "
|
|
|
|
"expected 0x%08x, actual 0x%08x at address 0x%08x.\n",
|
|
|
|
failure_description, expected_value, actual_value,
|
|
|
|
(resource_size_t)address);
|
|
|
|
}
|
|
|
|
|
2015-05-14 02:54:20 +00:00
|
|
|
int mem_test_bus_integrity(resource_size_t _start,
|
|
|
|
resource_size_t _end)
|
2013-06-03 23:13:51 +00:00
|
|
|
{
|
2015-05-14 02:54:20 +00:00
|
|
|
static const resource_size_t bitpattern[] = {
|
|
|
|
0x00000001, /* single bit */
|
|
|
|
0x00000003, /* two adjacent bits */
|
|
|
|
0x00000007, /* three adjacent bits */
|
|
|
|
0x0000000F, /* four adjacent bits */
|
|
|
|
0x00000005, /* two non-adjacent bits */
|
|
|
|
0x00000015, /* three non-adjacent bits */
|
|
|
|
0x00000055, /* four non-adjacent bits */
|
|
|
|
0xAAAAAAAA, /* alternating 1/0 */
|
|
|
|
};
|
|
|
|
|
|
|
|
volatile resource_size_t *start, *dummy, num_words, val, readback, offset,
|
|
|
|
offset2, pattern, temp, anti_pattern;
|
2013-06-03 23:13:51 +00:00
|
|
|
int i;
|
|
|
|
|
|
|
|
_start = ALIGN(_start, sizeof(resource_size_t));
|
|
|
|
_end = ALIGN_DOWN(_end, sizeof(resource_size_t)) - 1;
|
|
|
|
|
|
|
|
if (_end <= _start)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
start = (resource_size_t *)_start;
|
2015-05-14 02:54:20 +00:00
|
|
|
/*
|
2013-06-03 23:13:51 +00:00
|
|
|
* Point the dummy to start[1]
|
|
|
|
*/
|
|
|
|
dummy = start + 1;
|
|
|
|
num_words = (_end - _start + 1)/sizeof(resource_size_t);
|
|
|
|
|
|
|
|
printf("Starting data line test.\n");
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Data line test: write a pattern to the first
|
|
|
|
* location, write the 1's complement to a 'parking'
|
|
|
|
* address (changes the state of the data bus so a
|
|
|
|
* floating bus doen't give a false OK), and then
|
|
|
|
* read the value back. Note that we read it back
|
|
|
|
* into a variable because the next time we read it,
|
|
|
|
* it might be right (been there, tough to explain to
|
|
|
|
* the quality guys why it prints a failure when the
|
|
|
|
* "is" and "should be" are obviously the same in the
|
|
|
|
* error message).
|
|
|
|
*
|
|
|
|
* Rather than exhaustively testing, we test some
|
|
|
|
* patterns by shifting '1' bits through a field of
|
|
|
|
* '0's and '0' bits through a field of '1's (i.e.
|
|
|
|
* pattern and ~pattern).
|
|
|
|
*/
|
2015-05-14 02:54:18 +00:00
|
|
|
for (i = 0; i < ARRAY_SIZE(bitpattern); i++) {
|
2013-06-03 23:13:51 +00:00
|
|
|
val = bitpattern[i];
|
|
|
|
|
|
|
|
for (; val != 0; val <<= 1) {
|
|
|
|
*start = val;
|
|
|
|
/* clear the test data off of the bus */
|
|
|
|
*dummy = ~val;
|
|
|
|
readback = *start;
|
|
|
|
if (readback != val) {
|
2015-05-14 02:54:21 +00:00
|
|
|
mem_test_report_failure("data line",
|
|
|
|
val, readback, start);
|
2013-06-03 23:13:51 +00:00
|
|
|
return -EIO;
|
|
|
|
}
|
|
|
|
|
|
|
|
*start = ~val;
|
|
|
|
*dummy = val;
|
|
|
|
readback = *start;
|
|
|
|
if (readback != ~val) {
|
2015-05-14 02:54:21 +00:00
|
|
|
mem_test_report_failure("data line",
|
|
|
|
~val, readback, start);
|
2013-06-03 23:13:51 +00:00
|
|
|
return -EIO;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Based on code whose Original Author and Copyright
|
|
|
|
* information follows: Copyright (c) 1998 by Michael
|
|
|
|
* Barr. This software is placed into the public
|
|
|
|
* domain and may be used for any purpose. However,
|
|
|
|
* this notice must not be changed or removed and no
|
|
|
|
* warranty is either expressed or implied by its
|
|
|
|
* publication or distribution.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Address line test
|
|
|
|
*
|
|
|
|
* Description: Test the address bus wiring in a
|
|
|
|
* memory region by performing a walking
|
|
|
|
* 1's test on the relevant bits of the
|
|
|
|
* address and checking for aliasing.
|
|
|
|
* This test will find single-bit
|
|
|
|
* address failures such as stuck -high,
|
|
|
|
* stuck-low, and shorted pins. The base
|
|
|
|
* address and size of the region are
|
|
|
|
* selected by the caller.
|
|
|
|
*
|
|
|
|
* Notes: For best results, the selected base
|
|
|
|
* address should have enough LSB 0's to
|
|
|
|
* guarantee single address bit changes.
|
|
|
|
* For example, to test a 64-Kbyte
|
|
|
|
* region, select a base address on a
|
|
|
|
* 64-Kbyte boundary. Also, select the
|
|
|
|
* region size as a power-of-two if at
|
|
|
|
* all possible.
|
|
|
|
*
|
|
|
|
* ## NOTE ## Be sure to specify start and end
|
|
|
|
* addresses such that num_words has
|
|
|
|
* lots of bits set. For example an
|
|
|
|
* address range of 01000000 02000000 is
|
|
|
|
* bad while a range of 01000000
|
|
|
|
* 01ffffff is perfect.
|
|
|
|
*/
|
|
|
|
|
|
|
|
pattern = 0xAAAAAAAA;
|
|
|
|
anti_pattern = 0x55555555;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Write the default pattern at each of the
|
|
|
|
* power-of-two offsets.
|
|
|
|
*/
|
|
|
|
for (offset = 1; offset <= num_words; offset <<= 1)
|
|
|
|
start[offset] = pattern;
|
|
|
|
|
2015-05-14 02:54:19 +00:00
|
|
|
/*
|
|
|
|
* Now write anti-pattern at offset 0. If during the previous
|
|
|
|
* step one of the address lines got stuck high this
|
|
|
|
* operation would result in a memory cell at power-of-two
|
|
|
|
* offset being set to anti-pattern which hopefully would be
|
|
|
|
* detected byt the loop that follows.
|
|
|
|
*/
|
|
|
|
start[0] = anti_pattern;
|
|
|
|
|
2013-06-03 23:13:51 +00:00
|
|
|
printf("Check for address bits stuck high.\n");
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check for address bits stuck high.
|
|
|
|
*/
|
|
|
|
for (offset = 1; offset <= num_words; offset <<= 1) {
|
|
|
|
temp = start[offset];
|
|
|
|
if (temp != pattern) {
|
2015-05-14 02:54:21 +00:00
|
|
|
mem_test_report_failure("address bit stuck high",
|
|
|
|
pattern, temp, &start[offset]);
|
2013-06-03 23:13:51 +00:00
|
|
|
return -EIO;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-05-14 02:54:19 +00:00
|
|
|
/*
|
|
|
|
Restore original value
|
|
|
|
*/
|
|
|
|
start[0] = pattern;
|
|
|
|
|
2013-06-03 23:13:51 +00:00
|
|
|
printf("Check for address bits stuck "
|
|
|
|
"low or shorted.\n");
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check for address bits stuck low or shorted.
|
|
|
|
*/
|
|
|
|
for (offset2 = 1; offset2 <= num_words; offset2 <<= 1) {
|
|
|
|
start[offset2] = anti_pattern;
|
|
|
|
|
2015-05-14 02:54:19 +00:00
|
|
|
for (offset = 0; offset <= num_words;
|
|
|
|
offset = (offset) ? offset << 1 : 1) {
|
2013-06-03 23:13:51 +00:00
|
|
|
temp = start[offset];
|
|
|
|
|
|
|
|
if ((temp != pattern) &&
|
|
|
|
(offset != offset2)) {
|
2015-05-14 02:54:21 +00:00
|
|
|
mem_test_report_failure(
|
|
|
|
"address bit stuck low or shorted",
|
|
|
|
pattern, temp, &start[offset]);
|
2013-06-03 23:13:51 +00:00
|
|
|
return -EIO;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
start[offset2] = pattern;
|
|
|
|
}
|
|
|
|
|
2015-05-14 02:54:20 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2015-10-27 08:09:09 +00:00
|
|
|
static int update_progress(resource_size_t offset)
|
|
|
|
{
|
|
|
|
/* Only check every 4k to reduce overhead */
|
|
|
|
if (offset & (SZ_4K - 1))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (ctrlc())
|
|
|
|
return -EINTR;
|
|
|
|
|
|
|
|
show_progress(offset);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2015-10-23 09:29:59 +00:00
|
|
|
int mem_test_moving_inversions(resource_size_t _start, resource_size_t _end)
|
2015-05-14 02:54:20 +00:00
|
|
|
{
|
2015-12-04 07:01:59 +00:00
|
|
|
volatile resource_size_t *start, num_words, offset, temp, anti_pattern;
|
2015-10-27 08:09:09 +00:00
|
|
|
int ret;
|
2015-05-14 02:54:20 +00:00
|
|
|
|
|
|
|
_start = ALIGN(_start, sizeof(resource_size_t));
|
|
|
|
_end = ALIGN_DOWN(_end, sizeof(resource_size_t)) - 1;
|
|
|
|
|
|
|
|
if (_end <= _start)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
start = (resource_size_t *)_start;
|
|
|
|
num_words = (_end - _start + 1)/sizeof(resource_size_t);
|
2013-06-03 23:13:51 +00:00
|
|
|
|
2015-10-27 07:54:39 +00:00
|
|
|
printf("Starting moving inversions test of RAM:\n"
|
|
|
|
"Fill with address, compare, fill with inverted address, compare again\n");
|
2013-06-03 23:13:51 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Description: Test the integrity of a physical
|
|
|
|
* memory device by performing an
|
|
|
|
* increment/decrement test over the
|
|
|
|
* entire region. In the process every
|
|
|
|
* storage bit in the device is tested
|
|
|
|
* as a zero and a one. The base address
|
|
|
|
* and the size of the region are
|
|
|
|
* selected by the caller.
|
|
|
|
*/
|
|
|
|
|
2015-10-27 07:54:39 +00:00
|
|
|
init_progression_bar(3 * num_words);
|
|
|
|
|
2015-10-27 07:56:48 +00:00
|
|
|
/* Fill memory with a known pattern */
|
2013-06-03 23:13:51 +00:00
|
|
|
for (offset = 0; offset < num_words; offset++) {
|
2015-10-27 08:09:09 +00:00
|
|
|
ret = update_progress(offset);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
2013-06-03 23:13:51 +00:00
|
|
|
start[offset] = offset + 1;
|
|
|
|
}
|
|
|
|
|
2015-10-27 07:56:48 +00:00
|
|
|
/* Check each location and invert it for the second pass */
|
2013-06-03 23:13:51 +00:00
|
|
|
for (offset = 0; offset < num_words; offset++) {
|
2015-10-27 08:09:09 +00:00
|
|
|
ret = update_progress(num_words + offset);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
2013-06-03 23:13:51 +00:00
|
|
|
|
2015-12-04 07:01:59 +00:00
|
|
|
temp = start[offset];
|
|
|
|
if (temp != (offset + 1)) {
|
|
|
|
printf("\n");
|
|
|
|
mem_test_report_failure("read/write",
|
|
|
|
(offset + 1),
|
|
|
|
temp, &start[offset]);
|
|
|
|
return -EIO;
|
|
|
|
}
|
2015-10-27 08:12:18 +00:00
|
|
|
|
2015-12-04 07:01:59 +00:00
|
|
|
anti_pattern = ~(offset + 1);
|
|
|
|
start[offset] = anti_pattern;
|
2013-06-03 23:13:51 +00:00
|
|
|
}
|
|
|
|
|
2015-10-27 07:56:48 +00:00
|
|
|
/* Check each location for the inverted pattern and zero it */
|
2013-06-03 23:13:51 +00:00
|
|
|
for (offset = 0; offset < num_words; offset++) {
|
2015-10-27 08:09:09 +00:00
|
|
|
ret = update_progress(2 * num_words + offset);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
2013-06-03 23:13:51 +00:00
|
|
|
|
2015-12-04 07:01:59 +00:00
|
|
|
anti_pattern = ~(offset + 1);
|
|
|
|
temp = start[offset];
|
2013-06-03 23:13:51 +00:00
|
|
|
|
2015-12-04 07:01:59 +00:00
|
|
|
if (temp != anti_pattern) {
|
|
|
|
printf("\n");
|
|
|
|
mem_test_report_failure("read/write",
|
|
|
|
anti_pattern,
|
|
|
|
temp, &start[offset]);
|
|
|
|
return -EIO;
|
|
|
|
}
|
2013-06-03 23:13:51 +00:00
|
|
|
|
|
|
|
start[offset] = 0;
|
|
|
|
}
|
2015-10-27 07:54:39 +00:00
|
|
|
show_progress(3 * num_words);
|
2013-06-03 23:13:51 +00:00
|
|
|
|
2015-10-27 07:56:48 +00:00
|
|
|
/* end of progressbar */
|
2013-06-03 23:13:51 +00:00
|
|
|
printf("\n");
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|