wdenk | c609719 | 2002-11-03 00:24:07 +0000 | [diff] [blame] | 1 | /* |
| 2 | * (C) Copyright 2002 |
| 3 | * Wolfgang Denk, DENX Software Engineering, wd@denx.de. |
| 4 | * |
| 5 | * See file CREDITS for list of people who contributed to this |
| 6 | * project. |
| 7 | * |
| 8 | * This program is free software; you can redistribute it and/or |
| 9 | * modify it under the terms of the GNU General Public License as |
| 10 | * published by the Free Software Foundation; either version 2 of |
| 11 | * the License, or (at your option) any later version. |
| 12 | * |
| 13 | * This program is distributed in the hope that it will be useful, |
| 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 16 | * GNU General Public License for more details. |
| 17 | * |
| 18 | * You should have received a copy of the GNU General Public License |
| 19 | * along with this program; if not, write to the Free Software |
| 20 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, |
| 21 | * MA 02111-1307 USA |
| 22 | */ |
| 23 | |
| 24 | #include <common.h> |
| 25 | |
| 26 | /* Memory test |
| 27 | * |
| 28 | * General observations: |
| 29 | * o The recommended test sequence is to test the data lines: if they are |
| 30 | * broken, nothing else will work properly. Then test the address |
| 31 | * lines. Finally, test the cells in the memory now that the test |
| 32 | * program knows that the address and data lines work properly. |
| 33 | * This sequence also helps isolate and identify what is faulty. |
| 34 | * |
| 35 | * o For the address line test, it is a good idea to use the base |
| 36 | * address of the lowest memory location, which causes a '1' bit to |
| 37 | * walk through a field of zeros on the address lines and the highest |
| 38 | * memory location, which causes a '0' bit to walk through a field of |
| 39 | * '1's on the address line. |
| 40 | * |
| 41 | * o Floating buses can fool memory tests if the test routine writes |
| 42 | * a value and then reads it back immediately. The problem is, the |
| 43 | * write will charge the residual capacitance on the data bus so the |
| 44 | * bus retains its state briefely. When the test program reads the |
| 45 | * value back immediately, the capacitance of the bus can allow it |
| 46 | * to read back what was written, even though the memory circuitry |
| 47 | * is broken. To avoid this, the test program should write a test |
| 48 | * pattern to the target location, write a different pattern elsewhere |
| 49 | * to charge the residual capacitance in a differnt manner, then read |
| 50 | * the target location back. |
| 51 | * |
| 52 | * o Always read the target location EXACTLY ONCE and save it in a local |
| 53 | * variable. The problem with reading the target location more than |
| 54 | * once is that the second and subsequent reads may work properly, |
| 55 | * resulting in a failed test that tells the poor technician that |
| 56 | * "Memory error at 00000000, wrote aaaaaaaa, read aaaaaaaa" which |
| 57 | * doesn't help him one bit and causes puzzled phone calls. Been there, |
| 58 | * done that. |
| 59 | * |
| 60 | * Data line test: |
| 61 | * --------------- |
| 62 | * This tests data lines for shorts and opens by forcing adjacent data |
| 63 | * to opposite states. Because the data lines could be routed in an |
| 64 | * arbitrary manner the must ensure test patterns ensure that every case |
| 65 | * is tested. By using the following series of binary patterns every |
| 66 | * combination of adjacent bits is test regardless of routing. |
| 67 | * |
| 68 | * ...101010101010101010101010 |
| 69 | * ...110011001100110011001100 |
| 70 | * ...111100001111000011110000 |
| 71 | * ...111111110000000011111111 |
| 72 | * |
| 73 | * Carrying this out, gives us six hex patterns as follows: |
| 74 | * |
| 75 | * 0xaaaaaaaaaaaaaaaa |
| 76 | * 0xcccccccccccccccc |
| 77 | * 0xf0f0f0f0f0f0f0f0 |
| 78 | * 0xff00ff00ff00ff00 |
| 79 | * 0xffff0000ffff0000 |
| 80 | * 0xffffffff00000000 |
| 81 | * |
| 82 | * To test for short and opens to other signals on our boards, we |
| 83 | * simply test with the 1's complemnt of the paterns as well, resulting |
| 84 | * in twelve patterns total. |
| 85 | * |
| 86 | * After writing a test pattern. a special pattern 0x0123456789ABCDEF is |
| 87 | * written to a different address in case the data lines are floating. |
| 88 | * Thus, if a byte lane fails, you will see part of the special |
| 89 | * pattern in that byte lane when the test runs. For example, if the |
| 90 | * xx__xxxxxxxxxxxx byte line fails, you will see aa23aaaaaaaaaaaa |
| 91 | * (for the 'a' test pattern). |
| 92 | * |
| 93 | * Address line test: |
| 94 | * ------------------ |
| 95 | * This function performs a test to verify that all the address lines |
| 96 | * hooked up to the RAM work properly. If there is an address line |
| 97 | * fault, it usually shows up as two different locations in the address |
| 98 | * map (related by the faulty address line) mapping to one physical |
| 99 | * memory storage location. The artifact that shows up is writing to |
| 100 | * the first location "changes" the second location. |
| 101 | * |
| 102 | * To test all address lines, we start with the given base address and |
| 103 | * xor the address with a '1' bit to flip one address line. For each |
| 104 | * test, we shift the '1' bit left to test the next address line. |
| 105 | * |
| 106 | * In the actual code, we start with address sizeof(ulong) since our |
| 107 | * test pattern we use is a ulong and thus, if we tried to test lower |
| 108 | * order address bits, it wouldn't work because our pattern would |
| 109 | * overwrite itself. |
| 110 | * |
| 111 | * Example for a 4 bit address space with the base at 0000: |
| 112 | * 0000 <- base |
| 113 | * 0001 <- test 1 |
| 114 | * 0010 <- test 2 |
| 115 | * 0100 <- test 3 |
| 116 | * 1000 <- test 4 |
| 117 | * Example for a 4 bit address space with the base at 0010: |
| 118 | * 0010 <- base |
| 119 | * 0011 <- test 1 |
| 120 | * 0000 <- (below the base address, skipped) |
| 121 | * 0110 <- test 2 |
| 122 | * 1010 <- test 3 |
| 123 | * |
| 124 | * The test locations are successively tested to make sure that they are |
| 125 | * not "mirrored" onto the base address due to a faulty address line. |
| 126 | * Note that the base and each test location are related by one address |
| 127 | * line flipped. Note that the base address need not be all zeros. |
| 128 | * |
| 129 | * Memory tests 1-4: |
| 130 | * ----------------- |
| 131 | * These tests verify RAM using sequential writes and reads |
| 132 | * to/from RAM. There are several test cases that use different patterns to |
| 133 | * verify RAM. Each test case fills a region of RAM with one pattern and |
| 134 | * then reads the region back and compares its contents with the pattern. |
| 135 | * The following patterns are used: |
| 136 | * |
| 137 | * 1a) zero pattern (0x00000000) |
| 138 | * 1b) negative pattern (0xffffffff) |
| 139 | * 1c) checkerboard pattern (0x55555555) |
| 140 | * 1d) checkerboard pattern (0xaaaaaaaa) |
| 141 | * 2) bit-flip pattern ((1 << (offset % 32)) |
| 142 | * 3) address pattern (offset) |
| 143 | * 4) address pattern (~offset) |
| 144 | * |
| 145 | * Being run in normal mode, the test verifies only small 4Kb |
| 146 | * regions of RAM around each 1Mb boundary. For example, for 64Mb |
| 147 | * RAM the following areas are verified: 0x00000000-0x00000800, |
| 148 | * 0x000ff800-0x00100800, 0x001ff800-0x00200800, ..., 0x03fff800- |
| 149 | * 0x04000000. If the test is run in power-fail mode, it verifies |
| 150 | * the whole RAM. |
| 151 | */ |
| 152 | |
| 153 | #ifdef CONFIG_POST |
| 154 | |
| 155 | #include <post.h> |
| 156 | #include <watchdog.h> |
| 157 | |
| 158 | #if CONFIG_POST & CFG_POST_MEMORY |
| 159 | |
| 160 | /* |
| 161 | * Define INJECT_*_ERRORS for testing error detection in the presence of |
| 162 | * _good_ hardware. |
| 163 | */ |
| 164 | #undef INJECT_DATA_ERRORS |
| 165 | #undef INJECT_ADDRESS_ERRORS |
| 166 | |
| 167 | #ifdef INJECT_DATA_ERRORS |
| 168 | #warning "Injecting data line errors for testing purposes" |
| 169 | #endif |
| 170 | |
| 171 | #ifdef INJECT_ADDRESS_ERRORS |
| 172 | #warning "Injecting address line errors for testing purposes" |
| 173 | #endif |
| 174 | |
| 175 | |
| 176 | /* |
| 177 | * This function performs a double word move from the data at |
| 178 | * the source pointer to the location at the destination pointer. |
| 179 | * This is helpful for testing memory on processors which have a 64 bit |
| 180 | * wide data bus. |
| 181 | * |
| 182 | * On those PowerPC with FPU, use assembly and a floating point move: |
| 183 | * this does a 64 bit move. |
| 184 | * |
| 185 | * For other processors, let the compiler generate the best code it can. |
| 186 | */ |
| 187 | static void move64(unsigned long long *src, unsigned long long *dest) |
| 188 | { |
| 189 | #if defined(CONFIG_MPC8260) || defined(CONFIG_MPC824X) |
| 190 | asm ("lfd 0, 0(3)\n\t" /* fpr0 = *scr */ |
| 191 | "stfd 0, 0(4)" /* *dest = fpr0 */ |
| 192 | : : : "fr0" ); /* Clobbers fr0 */ |
| 193 | return; |
| 194 | #else |
| 195 | *dest = *src; |
| 196 | #endif |
| 197 | } |
| 198 | |
| 199 | /* |
| 200 | * This is 64 bit wide test patterns. Note that they reside in ROM |
| 201 | * (which presumably works) and the tests write them to RAM which may |
| 202 | * not work. |
| 203 | * |
| 204 | * The "otherpattern" is written to drive the data bus to values other |
| 205 | * than the test pattern. This is for detecting floating bus lines. |
| 206 | * |
| 207 | */ |
| 208 | const static unsigned long long pattern[] = { |
| 209 | 0xaaaaaaaaaaaaaaaa, |
| 210 | 0xcccccccccccccccc, |
| 211 | 0xf0f0f0f0f0f0f0f0, |
| 212 | 0xff00ff00ff00ff00, |
| 213 | 0xffff0000ffff0000, |
| 214 | 0xffffffff00000000, |
| 215 | 0x00000000ffffffff, |
| 216 | 0x0000ffff0000ffff, |
| 217 | 0x00ff00ff00ff00ff, |
| 218 | 0x0f0f0f0f0f0f0f0f, |
| 219 | 0x3333333333333333, |
| 220 | 0x5555555555555555}; |
| 221 | const unsigned long long otherpattern = 0x0123456789abcdef; |
| 222 | |
| 223 | |
| 224 | static int memory_post_dataline(unsigned long long * pmem) |
| 225 | { |
| 226 | unsigned long long temp64; |
| 227 | int num_patterns = sizeof(pattern)/ sizeof(pattern[0]); |
| 228 | int i; |
| 229 | unsigned int hi, lo, pathi, patlo; |
| 230 | int ret = 0; |
| 231 | |
| 232 | for ( i = 0; i < num_patterns; i++) { |
| 233 | move64((unsigned long long *)&(pattern[i]), pmem++); |
| 234 | /* |
| 235 | * Put a different pattern on the data lines: otherwise they |
| 236 | * may float long enough to read back what we wrote. |
| 237 | */ |
| 238 | move64((unsigned long long *)&otherpattern, pmem--); |
| 239 | move64(pmem, &temp64); |
| 240 | |
| 241 | #ifdef INJECT_DATA_ERRORS |
| 242 | temp64 ^= 0x00008000; |
| 243 | #endif |
| 244 | |
| 245 | if (temp64 != pattern[i]){ |
| 246 | pathi = (pattern[i]>>32) & 0xffffffff; |
| 247 | patlo = pattern[i] & 0xffffffff; |
| 248 | |
| 249 | hi = (temp64>>32) & 0xffffffff; |
| 250 | lo = temp64 & 0xffffffff; |
| 251 | |
| 252 | post_log ("Memory (date line) error at %08x, " |
| 253 | "wrote %08x%08x, read %08x%08x !\n", |
| 254 | pmem, pathi, patlo, hi, lo); |
| 255 | ret = -1; |
| 256 | } |
| 257 | } |
| 258 | return ret; |
| 259 | } |
| 260 | |
| 261 | static int memory_post_addrline(ulong *testaddr, ulong *base, ulong size) |
| 262 | { |
| 263 | ulong *target; |
| 264 | ulong *end; |
| 265 | ulong readback; |
| 266 | ulong xor; |
| 267 | int ret = 0; |
| 268 | |
| 269 | end = base + size; |
| 270 | xor = 0; |
| 271 | for(xor = sizeof(ulong); xor > 0; xor <<= 1) { |
| 272 | target = (ulong *)((ulong)testaddr ^ xor); |
| 273 | if((target >= base) && (target < end)) { |
| 274 | *testaddr = ~*target; |
| 275 | readback = *target; |
| 276 | |
| 277 | #ifdef INJECT_ADDRESS_ERRORS |
| 278 | if(xor == 0x00008000) { |
| 279 | readback = *testaddr; |
| 280 | } |
| 281 | #endif |
| 282 | if(readback == *testaddr) { |
| 283 | post_log ("Memory (address line) error at %08x<->%08x, " |
| 284 | "XOR value %08x !\n", |
| 285 | testaddr, target, xor); |
| 286 | ret = -1; |
| 287 | } |
| 288 | } |
| 289 | } |
| 290 | return ret; |
| 291 | } |
| 292 | |
| 293 | static int memory_post_test1 (unsigned long start, |
| 294 | unsigned long size, |
| 295 | unsigned long val) |
| 296 | { |
| 297 | unsigned long i; |
| 298 | ulong *mem = (ulong *) start; |
| 299 | ulong readback; |
| 300 | int ret = 0; |
| 301 | |
| 302 | for (i = 0; i < size / sizeof (ulong); i++) { |
| 303 | mem[i] = val; |
| 304 | if (i % 1024 == 0) |
| 305 | WATCHDOG_RESET (); |
| 306 | } |
| 307 | |
| 308 | for (i = 0; i < size / sizeof (ulong) && ret == 0; i++) { |
| 309 | readback = mem[i]; |
| 310 | if (readback != val) { |
| 311 | post_log ("Memory error at %08x, " |
| 312 | "wrote %08x, read %08x !\n", |
| 313 | mem + i, val, readback); |
| 314 | |
| 315 | ret = -1; |
| 316 | break; |
| 317 | } |
| 318 | if (i % 1024 == 0) |
| 319 | WATCHDOG_RESET (); |
| 320 | } |
| 321 | |
| 322 | return ret; |
| 323 | } |
| 324 | |
| 325 | static int memory_post_test2 (unsigned long start, unsigned long size) |
| 326 | { |
| 327 | unsigned long i; |
| 328 | ulong *mem = (ulong *) start; |
| 329 | ulong readback; |
| 330 | int ret = 0; |
| 331 | |
| 332 | for (i = 0; i < size / sizeof (ulong); i++) { |
| 333 | mem[i] = 1 << (i % 32); |
| 334 | if (i % 1024 == 0) |
| 335 | WATCHDOG_RESET (); |
| 336 | } |
| 337 | |
| 338 | for (i = 0; i < size / sizeof (ulong) && ret == 0; i++) { |
| 339 | readback = mem[i]; |
| 340 | if (readback != (1 << (i % 32))) { |
| 341 | post_log ("Memory error at %08x, " |
| 342 | "wrote %08x, read %08x !\n", |
| 343 | mem + i, 1 << (i % 32), readback); |
| 344 | |
| 345 | ret = -1; |
| 346 | break; |
| 347 | } |
| 348 | if (i % 1024 == 0) |
| 349 | WATCHDOG_RESET (); |
| 350 | } |
| 351 | |
| 352 | return ret; |
| 353 | } |
| 354 | |
| 355 | static int memory_post_test3 (unsigned long start, unsigned long size) |
| 356 | { |
| 357 | unsigned long i; |
| 358 | ulong *mem = (ulong *) start; |
| 359 | ulong readback; |
| 360 | int ret = 0; |
| 361 | |
| 362 | for (i = 0; i < size / sizeof (ulong); i++) { |
| 363 | mem[i] = i; |
| 364 | if (i % 1024 == 0) |
| 365 | WATCHDOG_RESET (); |
| 366 | } |
| 367 | |
| 368 | for (i = 0; i < size / sizeof (ulong) && ret == 0; i++) { |
| 369 | readback = mem[i]; |
| 370 | if (readback != i) { |
| 371 | post_log ("Memory error at %08x, " |
| 372 | "wrote %08x, read %08x !\n", |
| 373 | mem + i, i, readback); |
| 374 | |
| 375 | ret = -1; |
| 376 | break; |
| 377 | } |
| 378 | if (i % 1024 == 0) |
| 379 | WATCHDOG_RESET (); |
| 380 | } |
| 381 | |
| 382 | return ret; |
| 383 | } |
| 384 | |
| 385 | static int memory_post_test4 (unsigned long start, unsigned long size) |
| 386 | { |
| 387 | unsigned long i; |
| 388 | ulong *mem = (ulong *) start; |
| 389 | ulong readback; |
| 390 | int ret = 0; |
| 391 | |
| 392 | for (i = 0; i < size / sizeof (ulong); i++) { |
| 393 | mem[i] = ~i; |
| 394 | if (i % 1024 == 0) |
| 395 | WATCHDOG_RESET (); |
| 396 | } |
| 397 | |
| 398 | for (i = 0; i < size / sizeof (ulong) && ret == 0; i++) { |
| 399 | readback = mem[i]; |
| 400 | if (readback != ~i) { |
| 401 | post_log ("Memory error at %08x, " |
| 402 | "wrote %08x, read %08x !\n", |
| 403 | mem + i, ~i, readback); |
| 404 | |
| 405 | ret = -1; |
| 406 | break; |
| 407 | } |
| 408 | if (i % 1024 == 0) |
| 409 | WATCHDOG_RESET (); |
| 410 | } |
| 411 | |
| 412 | return ret; |
| 413 | } |
| 414 | |
| 415 | static int memory_post_tests (unsigned long start, unsigned long size) |
| 416 | { |
| 417 | int ret = 0; |
| 418 | |
| 419 | if (ret == 0) |
| 420 | ret = memory_post_dataline ((long long *)start); |
| 421 | WATCHDOG_RESET (); |
| 422 | if (ret == 0) |
| 423 | ret = memory_post_addrline ((long *)start, (long *)start, size); |
| 424 | WATCHDOG_RESET (); |
| 425 | if (ret == 0) |
| 426 | ret = memory_post_addrline ((long *)(start + size - 8), |
| 427 | (long *)start, size); |
| 428 | WATCHDOG_RESET (); |
| 429 | if (ret == 0) |
| 430 | ret = memory_post_test1 (start, size, 0x00000000); |
| 431 | WATCHDOG_RESET (); |
| 432 | if (ret == 0) |
| 433 | ret = memory_post_test1 (start, size, 0xffffffff); |
| 434 | WATCHDOG_RESET (); |
| 435 | if (ret == 0) |
| 436 | ret = memory_post_test1 (start, size, 0x55555555); |
| 437 | WATCHDOG_RESET (); |
| 438 | if (ret == 0) |
| 439 | ret = memory_post_test1 (start, size, 0xaaaaaaaa); |
| 440 | WATCHDOG_RESET (); |
| 441 | if (ret == 0) |
| 442 | ret = memory_post_test2 (start, size); |
| 443 | WATCHDOG_RESET (); |
| 444 | if (ret == 0) |
| 445 | ret = memory_post_test3 (start, size); |
| 446 | WATCHDOG_RESET (); |
| 447 | if (ret == 0) |
| 448 | ret = memory_post_test4 (start, size); |
| 449 | WATCHDOG_RESET (); |
| 450 | |
| 451 | return ret; |
| 452 | } |
| 453 | |
| 454 | int memory_post_test (int flags) |
| 455 | { |
| 456 | int ret = 0; |
| 457 | DECLARE_GLOBAL_DATA_PTR; |
| 458 | bd_t *bd = gd->bd; |
| 459 | unsigned long memsize = (bd->bi_memsize >= 256 << 20 ? |
| 460 | 256 << 20 : bd->bi_memsize) - (1 << 20); |
| 461 | |
| 462 | |
| 463 | if (flags & POST_POWERFAIL) { |
| 464 | ret = memory_post_tests (CFG_SDRAM_BASE, memsize); |
| 465 | } else { /* POST_POWERNORMAL */ |
| 466 | |
| 467 | unsigned long i; |
| 468 | |
| 469 | for (i = 0; i < (memsize >> 20) && ret == 0; i++) { |
| 470 | if (ret == 0) |
| 471 | ret = memory_post_tests (i << 20, 0x800); |
| 472 | if (ret == 0) |
| 473 | ret = memory_post_tests ((i << 20) + 0xff800, 0x800); |
| 474 | } |
| 475 | } |
| 476 | |
| 477 | return ret; |
| 478 | } |
| 479 | |
| 480 | #endif /* CONFIG_POST & CFG_POST_MEMORY */ |
| 481 | #endif /* CONFIG_POST */ |