nandpagetest.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598
  1. /*
  2. * Copyright (C) 2006-2008 Nokia Corporation
  3. * Copyright (C) 2016 sigma star gmbh
  4. *
  5. * This program is free software; you can redistribute it and/or modify it
  6. * under the terms of the GNU General Public License version 2 as published by
  7. * the Free Software Foundation.
  8. *
  9. * This program is distributed in the hope that it will be useful, but WITHOUT
  10. * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11. * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
  12. * more details.
  13. *
  14. * You should have received a copy of the GNU General Public License along with
  15. * this program; see the file COPYING. If not, write to the Free Software
  16. * Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
  17. *
  18. * Test page read and write on MTD device.
  19. *
  20. * Author: David Oberhollenzer <david.oberhollenzer@sigma-star.at>
  21. *
  22. * Based on linux pagetest.c
  23. * Author: Adrian Hunter <ext-adrian.hunter@nokia.com>
  24. */
  25. #define PROGRAM_NAME "nandpagetest"
  26. #include <mtd/mtd-user.h>
  27. #include <unistd.h>
  28. #include <stdlib.h>
  29. #include <libmtd.h>
  30. #include <getopt.h>
  31. #include <stdio.h>
  32. #include <fcntl.h>
  33. #include <time.h>
  34. #include "common.h"
  35. #define KEEP_CONTENTS 0x01
  36. #define SEED_SET 0x02
  37. static struct mtd_dev_info mtd;
  38. static const char *mtddev;
  39. static libmtd_t mtd_desc;
  40. static unsigned char *bbt=NULL, *writebuf=NULL, *backup=NULL;
  41. static unsigned char *twopages=NULL, *boundary=NULL;
  42. static int peb = -1, seed = -1, skip = -1, ebcnt = -1, flags = 0;
  43. static int fd, bufsize, pgsize, pgcnt;
  44. static unsigned int rnd_state;
  45. static const struct option options[] = {
  46. { "help", no_argument, NULL, 'h' },
  47. { "keep", no_argument, NULL, 'k' },
  48. { "peb", required_argument, NULL, 'b' },
  49. { "count", required_argument, NULL, 'c' },
  50. { "skip", required_argument, NULL, 's' },
  51. { "seed", required_argument, NULL, 'S' },
  52. { NULL, 0, NULL, 0 },
  53. };
  54. static NORETURN void usage(int status)
  55. {
  56. fputs(
  57. "Usage: "PROGRAM_NAME" [OPTIONS] <device>\n\n"
  58. "Options:\n"
  59. " -h, --help Display this help output\n"
  60. " -b, --peb <num> Index of the first erase block to use\n"
  61. " -c, --count <num> Number of erase blocks to use (at least 2, default all)\n"
  62. " -s, --skip <num> Number of erase blocks to skip\n"
  63. " -S, --seed <num> Seed for pseudor random number generator\n"
  64. " -k, --keep Restore existing contents after test\n",
  65. status==EXIT_SUCCESS ? stdout : stderr);
  66. exit(status);
  67. }
  68. static long read_num(int opt, const char *arg)
  69. {
  70. char *end;
  71. long num;
  72. num = strtol(arg, &end, 0);
  73. if (!end || *end != '\0') {
  74. fprintf(stderr, "-%c: expected integer argument\n", opt);
  75. exit(EXIT_FAILURE);
  76. }
  77. return num;
  78. }
  79. static void process_options(int argc, char **argv)
  80. {
  81. int c;
  82. while (1) {
  83. c = getopt_long(argc, argv, "hb:c:s:Sk", options, NULL);
  84. if (c == -1)
  85. break;
  86. switch (c) {
  87. case 'b':
  88. if (peb >= 0)
  89. goto failmulti;
  90. peb = read_num(c, optarg);
  91. if (peb < 0)
  92. goto failarg;
  93. break;
  94. case 'c':
  95. if (ebcnt >= 0)
  96. goto failmulti;
  97. ebcnt = read_num(c, optarg);
  98. if (ebcnt < 0)
  99. goto failarg;
  100. break;
  101. case 's':
  102. if (skip >= 0)
  103. goto failmulti;
  104. skip = read_num(c, optarg);
  105. if (skip < 0)
  106. goto failarg;
  107. break;
  108. case 'S':
  109. if (flags & SEED_SET)
  110. goto failmulti;
  111. seed = read_num(c, optarg);
  112. flags |= SEED_SET;
  113. break;
  114. case 'k':
  115. if (flags & KEEP_CONTENTS)
  116. goto failmulti;
  117. flags |= KEEP_CONTENTS;
  118. break;
  119. case 'h':
  120. usage(EXIT_SUCCESS);
  121. default:
  122. exit(EXIT_FAILURE);
  123. }
  124. }
  125. if (optind < argc)
  126. mtddev = argv[optind++];
  127. else
  128. errmsg_die("No device specified!\n");
  129. if (optind < argc)
  130. usage(EXIT_FAILURE);
  131. if (ebcnt >= 0 && ebcnt < 2)
  132. errmsg_die("Cannot run with less than two blocks.");
  133. if (peb < 0)
  134. peb = 0;
  135. if (!(flags & SEED_SET))
  136. seed = time(NULL);
  137. if (skip < 0)
  138. skip = 0;
  139. return;
  140. failmulti:
  141. errmsg_die("'-%c' specified more than once!", c);
  142. failarg:
  143. errmsg_die("Invalid argument for '-%c'!", c);
  144. }
  145. static int write_eraseblock(int ebnum)
  146. {
  147. int i;
  148. for (i = 0; i < mtd.eb_size; ++i)
  149. writebuf[i] = rand_r(&rnd_state);
  150. return mtd_write(mtd_desc, &mtd, fd, ebnum, 0,
  151. writebuf, mtd.eb_size, NULL, 0, 0);
  152. }
  153. static void get_first_and_last_block(int *first, int *last)
  154. {
  155. int i;
  156. *first = peb;
  157. for (i = 0; i < ebcnt && bbt[i]; ++i)
  158. *first += skip + 1;
  159. *last = peb + (ebcnt - 1) * (skip + 1);
  160. for (i = 0; i < ebcnt && bbt[ebcnt - i - 1]; ++i)
  161. *last -= skip + 1;
  162. }
  163. /* Do a read to set the internal dataRAMs to different data */
  164. static int flush_data_rams(int eb0, int ebn)
  165. {
  166. int err;
  167. err = mtd_read(&mtd, fd, eb0, 0, twopages, bufsize);
  168. if (err)
  169. return err;
  170. err = mtd_read(&mtd, fd, ebn, mtd.eb_size-bufsize,
  171. twopages, bufsize);
  172. if (err)
  173. return err;
  174. memset(twopages, 0, bufsize);
  175. return 0;
  176. }
  177. static int verify_eraseblock(int ebnum)
  178. {
  179. int err = 0, i, ret = 0, eb0, ebn, rd, diff;
  180. loff_t offset = 0, addr, addrn;
  181. unsigned int j, old_state;
  182. for (i = 0; i < mtd.eb_size; ++i)
  183. writebuf[i] = rand_r(&rnd_state);
  184. get_first_and_last_block(&eb0, &ebn);
  185. for (j = 0; j < pgcnt - 1; ++j, offset += pgsize) {
  186. err = flush_data_rams(eb0, ebn);
  187. if (err)
  188. return err;
  189. err = mtd_read(&mtd, fd, ebnum, offset, twopages, bufsize);
  190. if (err)
  191. break;
  192. if (memcmp(twopages, writebuf + (j * pgsize), bufsize)) {
  193. fprintf(stderr, "error: verify failed at block %d, page %ld\n",
  194. ebnum, ((long)offset) / pgsize );
  195. ret = -1;
  196. }
  197. }
  198. /* Check boundary between eraseblocks */
  199. addr = (loff_t)ebnum*mtd.eb_size + offset;
  200. addrn = (loff_t)ebn*mtd.eb_size + mtd.eb_size - 2*pgsize;
  201. if (addr <= addrn && !mtd_is_bad(&mtd, fd, ebnum+1)) {
  202. old_state = rnd_state;
  203. err = flush_data_rams(eb0, ebn);
  204. if (err)
  205. return err;
  206. if (lseek(fd, addr, SEEK_SET) != addr) {
  207. fprintf(stderr, "cannot seek mtd%d to offset %lld",
  208. mtd.mtd_num, (long long)addr);
  209. return -1;
  210. }
  211. for (rd = 0; rd < bufsize; rd += diff) {
  212. diff = read(fd, twopages + rd, bufsize - rd);
  213. if (diff < 0) {
  214. fprintf(stderr, "cannot read %d bytes from mtd%d "
  215. "(eraseblock %d, offset %d)",
  216. bufsize-rd, mtd.mtd_num, ebnum,
  217. (int)offset+rd);
  218. return -1;
  219. }
  220. }
  221. memcpy(boundary, writebuf + mtd.eb_size - pgsize, pgsize);
  222. for (j = 0; j < pgsize; ++j)
  223. (boundary + pgsize)[j] = rand_r(&rnd_state);
  224. if (memcmp(twopages, boundary, bufsize)) {
  225. fprintf(stderr, "error: verify failed at block %d, page %ld\n",
  226. ebnum, ((long)offset) / pgsize );
  227. ret = -1;
  228. }
  229. rnd_state = old_state;
  230. }
  231. return ret;
  232. }
  233. static int crosstest(void)
  234. {
  235. unsigned char *pp1, *pp2, *pp3, *pp4;
  236. int eb0, ebn, err = 0, offset;
  237. puts("crosstest");
  238. pp1 = xzalloc(pgsize * 4);
  239. if (!pp1)
  240. return -ENOMEM;
  241. pp2 = pp1 + pgsize;
  242. pp3 = pp2 + pgsize;
  243. pp4 = pp3 + pgsize;
  244. get_first_and_last_block(&eb0, &ebn);
  245. /* Read 2nd-to-last page to pp1 */
  246. err = mtd_read(&mtd, fd, ebn, mtd.eb_size - 2*pgsize, pp1, pgsize);
  247. if (err)
  248. goto out;
  249. /* Read 3rd-to-last page to pp1 */
  250. err = mtd_read(&mtd, fd, ebn, mtd.eb_size - 3*pgsize, pp1, pgsize);
  251. if (err)
  252. goto out;
  253. /* Read first page to pp2 */
  254. printf("reading page at block %d, page %d\n", eb0, 0);
  255. err = mtd_read(&mtd, fd, eb0, 0, pp2, pgsize);
  256. if (err)
  257. goto out;
  258. /* Read last page to pp3 */
  259. offset = mtd.eb_size - pgsize;
  260. printf("reading page at block %d, page %d\n", ebn, offset/pgsize);
  261. err = mtd_read(&mtd, fd, ebn, offset, pp3, pgsize);
  262. if (err)
  263. goto out;
  264. /* Read first page again to pp4 */
  265. printf("reading page at block %d, page %d\n", eb0, 0);
  266. err = mtd_read(&mtd, fd, eb0, 0, pp4, pgsize);
  267. if (err)
  268. goto out;
  269. /* pp2 and pp4 should be the same */
  270. printf("verifying pages read at block %d match\n", eb0);
  271. if (memcmp(pp2, pp4, pgsize)) {
  272. fputs("verify failed!\n", stderr);
  273. err = -1;
  274. } else {
  275. puts("crosstest ok");
  276. }
  277. out:
  278. free(pp1);
  279. return err;
  280. }
  281. static int erasecrosstest(void)
  282. {
  283. unsigned char *readbuf = twopages;
  284. int err = 0, i, eb0, ebn;
  285. puts("erasecrosstest");
  286. get_first_and_last_block(&eb0, &ebn);
  287. printf("erasing block %d\n", eb0);
  288. err = mtd_erase(mtd_desc, &mtd, fd, eb0);
  289. if (err)
  290. return err;
  291. printf("writing 1st page of block %d\n", eb0);
  292. for (i = 0; i < pgsize; ++i)
  293. writebuf[i] = rand_r(&rnd_state);
  294. strcpy((char*)writebuf, "There is no data like this!");
  295. err = mtd_write(mtd_desc, &mtd, fd, eb0, 0, writebuf, pgsize, NULL, 0, 0);
  296. if (err)
  297. return err;
  298. printf("reading 1st page of block %d\n", eb0);
  299. memset(readbuf, 0, pgsize);
  300. err = mtd_read(&mtd, fd, eb0, 0, readbuf, pgsize);
  301. if (err)
  302. return err;
  303. printf("verifying 1st page of block %d\n", eb0);
  304. if (memcmp(writebuf, readbuf, pgsize)) {
  305. fputs("verify failed!\n", stderr);
  306. return -1;
  307. }
  308. printf("erasing block %d\n", eb0);
  309. err = mtd_erase(mtd_desc, &mtd, fd, eb0);
  310. if (err)
  311. return err;
  312. printf("writing 1st page of block %d\n", eb0);
  313. for (i = 0; i < pgsize; ++i)
  314. writebuf[i] = rand_r(&rnd_state);
  315. strcpy((char*)writebuf, "There is no data like this!");
  316. err = mtd_write(mtd_desc, &mtd, fd, eb0, 0, writebuf, pgsize, NULL, 0, 0);
  317. if (err)
  318. return err;
  319. printf("erasing block %d\n", ebn);
  320. err = mtd_erase(mtd_desc, &mtd, fd, ebn);
  321. if (err)
  322. return err;
  323. printf("reading 1st page of block %d\n", eb0);
  324. memset(readbuf, 0, pgsize);
  325. err = mtd_read(&mtd, fd, eb0, 0, readbuf, pgsize);
  326. if (err)
  327. return err;
  328. printf("verifying 1st page of block %d\n", eb0);
  329. if (memcmp(writebuf, readbuf, pgsize)) {
  330. fputs("verify failed!\n", stderr);
  331. return -1;
  332. }
  333. puts("erasecrosstest ok");
  334. return 0;
  335. }
  336. static int erasetest(void)
  337. {
  338. int err = 0, i, ebnum, ebn;
  339. puts("erasetest");
  340. get_first_and_last_block(&ebnum, &ebn);
  341. printf("erasing block %d\n", ebnum);
  342. err = mtd_erase(mtd_desc, &mtd, fd, ebnum);
  343. if (err)
  344. return err;
  345. printf("writing 1st page of block %d\n", ebnum);
  346. for (i = 0; i < pgsize; ++i)
  347. writebuf[i] = rand_r(&rnd_state);
  348. err = mtd_write(mtd_desc, &mtd, fd, ebnum, 0,
  349. writebuf, pgsize, NULL, 0, 0);
  350. if (err)
  351. return err;
  352. printf("erasing block %d\n", ebnum);
  353. err = mtd_erase(mtd_desc, &mtd, fd, ebnum);
  354. if (err)
  355. return err;
  356. printf("reading 1st page of block %d\n", ebnum);
  357. err = mtd_read(&mtd, fd, ebnum, 0, twopages, pgsize);
  358. if (err)
  359. return err;
  360. printf("verifying 1st page of block %d is all 0xff\n", ebnum);
  361. for (i = 0; i < pgsize; ++i) {
  362. if (twopages[i] != 0xff) {
  363. fprintf(stderr, "verifying all 0xff failed at %d\n", i);
  364. return -1;
  365. }
  366. }
  367. puts("erasetest ok");
  368. return 0;
  369. }
  370. int main(int argc, char **argv)
  371. {
  372. int i, eb, err = 0, status = EXIT_FAILURE;
  373. unsigned char *backupptr;
  374. process_options(argc, argv);
  375. mtd_desc = libmtd_open();
  376. if (!mtd_desc)
  377. return errmsg("can't initialize libmtd");
  378. if (mtd_get_dev_info(mtd_desc, mtddev, &mtd) < 0)
  379. return errmsg("mtd_get_dev_info failed");
  380. if (mtd.type!=MTD_MLCNANDFLASH && mtd.type!=MTD_NANDFLASH)
  381. return errmsg("%s is not a NAND flash!", mtddev);
  382. pgsize = mtd.min_io_size;
  383. pgcnt = mtd.eb_size / pgsize;
  384. bufsize = pgsize * 2;
  385. if (ebcnt < 0)
  386. ebcnt = (mtd.eb_cnt - peb) / (skip + 1);
  387. if (peb >= mtd.eb_cnt)
  388. return errmsg("physical erase block %d is out of range!", peb);
  389. eb = peb + (ebcnt - 1)*(skip + 1);
  390. if (eb >= mtd.eb_cnt)
  391. return errmsg("last physical erase block %d is out of range!", eb);
  392. writebuf = xmalloc(mtd.eb_size);
  393. twopages = xmalloc(bufsize);
  394. boundary = xmalloc(bufsize);
  395. bbt = xzalloc(ebcnt);
  396. if ((fd = open(mtddev, O_RDWR)) == -1) {
  397. perror(mtddev);
  398. goto out_cleanup;
  399. }
  400. /* find bad blocks */
  401. for (i = 0; i < ebcnt; ++i) {
  402. eb = peb + i*(skip+1);
  403. bbt[i] = mtd_is_bad(&mtd, fd, eb);
  404. if (bbt[i])
  405. printf("ignoring bad erase block %d\n", eb);
  406. }
  407. /* create block backup */
  408. if (flags & KEEP_CONTENTS) {
  409. eb = 0;
  410. for (i = 0; i < ebcnt; ++i) {
  411. if (!bbt[i])
  412. ++eb;
  413. }
  414. backup = malloc(mtd.eb_size * eb);
  415. if (!backup) {
  416. fprintf(stderr, "not enough memory to keep block contents!\n");
  417. goto out_cleanup;
  418. }
  419. printf("reading %d blocks into memory\n", eb);
  420. backupptr = backup;
  421. for (i = 0; i < ebcnt; ++i) {
  422. if (bbt[i])
  423. continue;
  424. eb = peb + i*(skip+1);
  425. err = mtd_read(&mtd, fd, eb, 0, backupptr, mtd.eb_size);
  426. if (err) {
  427. fprintf(stderr, "error reading block %d!\n", eb);
  428. goto out_cleanup;
  429. }
  430. backupptr += mtd.eb_size;
  431. }
  432. }
  433. /* Erase all eraseblocks */
  434. puts("erasing all blocks");
  435. for (i = 0; i < ebcnt; ++i) {
  436. if (bbt[i])
  437. continue;
  438. eb = peb + i*(skip+1);
  439. if (mtd_erase(mtd_desc, &mtd, fd, eb)) {
  440. fprintf(stderr, "error erasing block %d\n", eb);
  441. goto out;
  442. }
  443. }
  444. printf("erased %u eraseblocks\n", ebcnt);
  445. /* Write all eraseblocks */
  446. rnd_state = seed;
  447. puts("writing all blocks");
  448. for (i = 0; i < ebcnt; ++i) {
  449. if (bbt[i])
  450. continue;
  451. eb = peb + i*(skip+1);
  452. err = write_eraseblock(eb);
  453. if (err)
  454. goto out;
  455. if (i % 256 == 0)
  456. printf("written up to eraseblock %u\n", i);
  457. }
  458. printf("written %u eraseblocks\n", i);
  459. /* Check all eraseblocks */
  460. rnd_state = seed;
  461. puts("verifying all eraseblocks");
  462. for (i = 0; i < ebcnt; ++i) {
  463. eb = peb + i*(skip+1);
  464. if (bbt[i])
  465. continue;
  466. err = verify_eraseblock(eb);
  467. if (err)
  468. goto out;
  469. if (i % 256 == 0)
  470. printf("verified up to eraseblock %u\n", i);
  471. }
  472. printf("verified %u eraseblocks\n", i);
  473. if (ebcnt > 1) {
  474. if (crosstest())
  475. goto out;
  476. } else {
  477. printf("skipping erasecrosstest, 2 erase blocks needed\n");
  478. }
  479. if (erasecrosstest())
  480. goto out;
  481. if (erasetest())
  482. goto out;
  483. status = EXIT_SUCCESS;
  484. out:
  485. /* restore block backup */
  486. if (flags & KEEP_CONTENTS) {
  487. puts("restoring original contents");
  488. backupptr = backup;
  489. for (i = 0; i < ebcnt; ++i) {
  490. if (bbt[i])
  491. continue;
  492. eb = peb + i*(skip+1);
  493. if (mtd_erase(mtd_desc, &mtd, fd, eb)) {
  494. fprintf(stderr, "error erasing block %d!\n", eb);
  495. status = EXIT_FAILURE;
  496. }
  497. err = mtd_write(mtd_desc, &mtd, fd, eb, 0,
  498. backupptr, mtd.eb_size, NULL, 0, 0);
  499. if (err) {
  500. fprintf(stderr, "error restoring block %d!\n", eb);
  501. status = EXIT_FAILURE;
  502. }
  503. backupptr += mtd.eb_size;
  504. }
  505. }
  506. out_cleanup:
  507. free(bbt);
  508. free(boundary);
  509. free(twopages);
  510. free(writebuf);
  511. free(backup);
  512. close(fd);
  513. return status;
  514. }