mtd_pagetest.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605
  1. /*
  2. * Copyright (C) 2006-2008 Nokia Corporation
  3. *
  4. * This program is free software; you can redistribute it and/or modify it
  5. * under the terms of the GNU General Public License version 2 as published by
  6. * the Free Software Foundation.
  7. *
  8. * This program is distributed in the hope that it will be useful, but WITHOUT
  9. * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  10. * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
  11. * more details.
  12. *
  13. * You should have received a copy of the GNU General Public License along with
  14. * this program; see the file COPYING. If not, write to the Free Software
  15. * Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
  16. *
  17. * Test page read and write on MTD device.
  18. *
  19. * Author: Adrian Hunter <ext-adrian.hunter@nokia.com>
  20. */
  21. #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
  22. #include <asm/div64.h>
  23. #include <linux/init.h>
  24. #include <linux/module.h>
  25. #include <linux/moduleparam.h>
  26. #include <linux/err.h>
  27. #include <linux/mtd/mtd.h>
  28. #include <linux/slab.h>
  29. #include <linux/sched.h>
  30. #include <linux/random.h>
  31. static int dev = -EINVAL;
  32. module_param(dev, int, S_IRUGO);
  33. MODULE_PARM_DESC(dev, "MTD device number to use");
  34. static struct mtd_info *mtd;
  35. static unsigned char *twopages;
  36. static unsigned char *writebuf;
  37. static unsigned char *boundary;
  38. static unsigned char *bbt;
  39. static int pgsize;
  40. static int bufsize;
  41. static int ebcnt;
  42. static int pgcnt;
  43. static int errcnt;
  44. static struct rnd_state rnd_state;
  45. static int erase_eraseblock(int ebnum)
  46. {
  47. int err;
  48. struct erase_info ei;
  49. loff_t addr = ebnum * mtd->erasesize;
  50. memset(&ei, 0, sizeof(struct erase_info));
  51. ei.mtd = mtd;
  52. ei.addr = addr;
  53. ei.len = mtd->erasesize;
  54. err = mtd_erase(mtd, &ei);
  55. if (err) {
  56. pr_err("error %d while erasing EB %d\n", err, ebnum);
  57. return err;
  58. }
  59. if (ei.state == MTD_ERASE_FAILED) {
  60. pr_err("some erase error occurred at EB %d\n",
  61. ebnum);
  62. return -EIO;
  63. }
  64. return 0;
  65. }
  66. static int write_eraseblock(int ebnum)
  67. {
  68. int err = 0;
  69. size_t written;
  70. loff_t addr = ebnum * mtd->erasesize;
  71. prandom_bytes_state(&rnd_state, writebuf, mtd->erasesize);
  72. cond_resched();
  73. err = mtd_write(mtd, addr, mtd->erasesize, &written, writebuf);
  74. if (err || written != mtd->erasesize)
  75. pr_err("error: write failed at %#llx\n",
  76. (long long)addr);
  77. return err;
  78. }
  79. static int verify_eraseblock(int ebnum)
  80. {
  81. uint32_t j;
  82. size_t read;
  83. int err = 0, i;
  84. loff_t addr0, addrn;
  85. loff_t addr = ebnum * mtd->erasesize;
  86. addr0 = 0;
  87. for (i = 0; i < ebcnt && bbt[i]; ++i)
  88. addr0 += mtd->erasesize;
  89. addrn = mtd->size;
  90. for (i = 0; i < ebcnt && bbt[ebcnt - i - 1]; ++i)
  91. addrn -= mtd->erasesize;
  92. prandom_bytes_state(&rnd_state, writebuf, mtd->erasesize);
  93. for (j = 0; j < pgcnt - 1; ++j, addr += pgsize) {
  94. /* Do a read to set the internal dataRAMs to different data */
  95. err = mtd_read(mtd, addr0, bufsize, &read, twopages);
  96. if (mtd_is_bitflip(err))
  97. err = 0;
  98. if (err || read != bufsize) {
  99. pr_err("error: read failed at %#llx\n",
  100. (long long)addr0);
  101. return err;
  102. }
  103. err = mtd_read(mtd, addrn - bufsize, bufsize, &read, twopages);
  104. if (mtd_is_bitflip(err))
  105. err = 0;
  106. if (err || read != bufsize) {
  107. pr_err("error: read failed at %#llx\n",
  108. (long long)(addrn - bufsize));
  109. return err;
  110. }
  111. memset(twopages, 0, bufsize);
  112. err = mtd_read(mtd, addr, bufsize, &read, twopages);
  113. if (mtd_is_bitflip(err))
  114. err = 0;
  115. if (err || read != bufsize) {
  116. pr_err("error: read failed at %#llx\n",
  117. (long long)addr);
  118. break;
  119. }
  120. if (memcmp(twopages, writebuf + (j * pgsize), bufsize)) {
  121. pr_err("error: verify failed at %#llx\n",
  122. (long long)addr);
  123. errcnt += 1;
  124. }
  125. }
  126. /* Check boundary between eraseblocks */
  127. if (addr <= addrn - pgsize - pgsize && !bbt[ebnum + 1]) {
  128. struct rnd_state old_state = rnd_state;
  129. /* Do a read to set the internal dataRAMs to different data */
  130. err = mtd_read(mtd, addr0, bufsize, &read, twopages);
  131. if (mtd_is_bitflip(err))
  132. err = 0;
  133. if (err || read != bufsize) {
  134. pr_err("error: read failed at %#llx\n",
  135. (long long)addr0);
  136. return err;
  137. }
  138. err = mtd_read(mtd, addrn - bufsize, bufsize, &read, twopages);
  139. if (mtd_is_bitflip(err))
  140. err = 0;
  141. if (err || read != bufsize) {
  142. pr_err("error: read failed at %#llx\n",
  143. (long long)(addrn - bufsize));
  144. return err;
  145. }
  146. memset(twopages, 0, bufsize);
  147. err = mtd_read(mtd, addr, bufsize, &read, twopages);
  148. if (mtd_is_bitflip(err))
  149. err = 0;
  150. if (err || read != bufsize) {
  151. pr_err("error: read failed at %#llx\n",
  152. (long long)addr);
  153. return err;
  154. }
  155. memcpy(boundary, writebuf + mtd->erasesize - pgsize, pgsize);
  156. prandom_bytes_state(&rnd_state, boundary + pgsize, pgsize);
  157. if (memcmp(twopages, boundary, bufsize)) {
  158. pr_err("error: verify failed at %#llx\n",
  159. (long long)addr);
  160. errcnt += 1;
  161. }
  162. rnd_state = old_state;
  163. }
  164. return err;
  165. }
  166. static int crosstest(void)
  167. {
  168. size_t read;
  169. int err = 0, i;
  170. loff_t addr, addr0, addrn;
  171. unsigned char *pp1, *pp2, *pp3, *pp4;
  172. pr_info("crosstest\n");
  173. pp1 = kmalloc(pgsize * 4, GFP_KERNEL);
  174. if (!pp1)
  175. return -ENOMEM;
  176. pp2 = pp1 + pgsize;
  177. pp3 = pp2 + pgsize;
  178. pp4 = pp3 + pgsize;
  179. memset(pp1, 0, pgsize * 4);
  180. addr0 = 0;
  181. for (i = 0; i < ebcnt && bbt[i]; ++i)
  182. addr0 += mtd->erasesize;
  183. addrn = mtd->size;
  184. for (i = 0; i < ebcnt && bbt[ebcnt - i - 1]; ++i)
  185. addrn -= mtd->erasesize;
  186. /* Read 2nd-to-last page to pp1 */
  187. addr = addrn - pgsize - pgsize;
  188. err = mtd_read(mtd, addr, pgsize, &read, pp1);
  189. if (mtd_is_bitflip(err))
  190. err = 0;
  191. if (err || read != pgsize) {
  192. pr_err("error: read failed at %#llx\n",
  193. (long long)addr);
  194. kfree(pp1);
  195. return err;
  196. }
  197. /* Read 3rd-to-last page to pp1 */
  198. addr = addrn - pgsize - pgsize - pgsize;
  199. err = mtd_read(mtd, addr, pgsize, &read, pp1);
  200. if (mtd_is_bitflip(err))
  201. err = 0;
  202. if (err || read != pgsize) {
  203. pr_err("error: read failed at %#llx\n",
  204. (long long)addr);
  205. kfree(pp1);
  206. return err;
  207. }
  208. /* Read first page to pp2 */
  209. addr = addr0;
  210. pr_info("reading page at %#llx\n", (long long)addr);
  211. err = mtd_read(mtd, addr, pgsize, &read, pp2);
  212. if (mtd_is_bitflip(err))
  213. err = 0;
  214. if (err || read != pgsize) {
  215. pr_err("error: read failed at %#llx\n",
  216. (long long)addr);
  217. kfree(pp1);
  218. return err;
  219. }
  220. /* Read last page to pp3 */
  221. addr = addrn - pgsize;
  222. pr_info("reading page at %#llx\n", (long long)addr);
  223. err = mtd_read(mtd, addr, pgsize, &read, pp3);
  224. if (mtd_is_bitflip(err))
  225. err = 0;
  226. if (err || read != pgsize) {
  227. pr_err("error: read failed at %#llx\n",
  228. (long long)addr);
  229. kfree(pp1);
  230. return err;
  231. }
  232. /* Read first page again to pp4 */
  233. addr = addr0;
  234. pr_info("reading page at %#llx\n", (long long)addr);
  235. err = mtd_read(mtd, addr, pgsize, &read, pp4);
  236. if (mtd_is_bitflip(err))
  237. err = 0;
  238. if (err || read != pgsize) {
  239. pr_err("error: read failed at %#llx\n",
  240. (long long)addr);
  241. kfree(pp1);
  242. return err;
  243. }
  244. /* pp2 and pp4 should be the same */
  245. pr_info("verifying pages read at %#llx match\n",
  246. (long long)addr0);
  247. if (memcmp(pp2, pp4, pgsize)) {
  248. pr_err("verify failed!\n");
  249. errcnt += 1;
  250. } else if (!err)
  251. pr_info("crosstest ok\n");
  252. kfree(pp1);
  253. return err;
  254. }
  255. static int erasecrosstest(void)
  256. {
  257. size_t read, written;
  258. int err = 0, i, ebnum, ebnum2;
  259. loff_t addr0;
  260. char *readbuf = twopages;
  261. pr_info("erasecrosstest\n");
  262. ebnum = 0;
  263. addr0 = 0;
  264. for (i = 0; i < ebcnt && bbt[i]; ++i) {
  265. addr0 += mtd->erasesize;
  266. ebnum += 1;
  267. }
  268. ebnum2 = ebcnt - 1;
  269. while (ebnum2 && bbt[ebnum2])
  270. ebnum2 -= 1;
  271. pr_info("erasing block %d\n", ebnum);
  272. err = erase_eraseblock(ebnum);
  273. if (err)
  274. return err;
  275. pr_info("writing 1st page of block %d\n", ebnum);
  276. prandom_bytes_state(&rnd_state, writebuf, pgsize);
  277. strcpy(writebuf, "There is no data like this!");
  278. err = mtd_write(mtd, addr0, pgsize, &written, writebuf);
  279. if (err || written != pgsize) {
  280. pr_info("error: write failed at %#llx\n",
  281. (long long)addr0);
  282. return err ? err : -1;
  283. }
  284. pr_info("reading 1st page of block %d\n", ebnum);
  285. memset(readbuf, 0, pgsize);
  286. err = mtd_read(mtd, addr0, pgsize, &read, readbuf);
  287. if (mtd_is_bitflip(err))
  288. err = 0;
  289. if (err || read != pgsize) {
  290. pr_err("error: read failed at %#llx\n",
  291. (long long)addr0);
  292. return err ? err : -1;
  293. }
  294. pr_info("verifying 1st page of block %d\n", ebnum);
  295. if (memcmp(writebuf, readbuf, pgsize)) {
  296. pr_err("verify failed!\n");
  297. errcnt += 1;
  298. return -1;
  299. }
  300. pr_info("erasing block %d\n", ebnum);
  301. err = erase_eraseblock(ebnum);
  302. if (err)
  303. return err;
  304. pr_info("writing 1st page of block %d\n", ebnum);
  305. prandom_bytes_state(&rnd_state, writebuf, pgsize);
  306. strcpy(writebuf, "There is no data like this!");
  307. err = mtd_write(mtd, addr0, pgsize, &written, writebuf);
  308. if (err || written != pgsize) {
  309. pr_err("error: write failed at %#llx\n",
  310. (long long)addr0);
  311. return err ? err : -1;
  312. }
  313. pr_info("erasing block %d\n", ebnum2);
  314. err = erase_eraseblock(ebnum2);
  315. if (err)
  316. return err;
  317. pr_info("reading 1st page of block %d\n", ebnum);
  318. memset(readbuf, 0, pgsize);
  319. err = mtd_read(mtd, addr0, pgsize, &read, readbuf);
  320. if (mtd_is_bitflip(err))
  321. err = 0;
  322. if (err || read != pgsize) {
  323. pr_err("error: read failed at %#llx\n",
  324. (long long)addr0);
  325. return err ? err : -1;
  326. }
  327. pr_info("verifying 1st page of block %d\n", ebnum);
  328. if (memcmp(writebuf, readbuf, pgsize)) {
  329. pr_err("verify failed!\n");
  330. errcnt += 1;
  331. return -1;
  332. }
  333. if (!err)
  334. pr_info("erasecrosstest ok\n");
  335. return err;
  336. }
  337. static int erasetest(void)
  338. {
  339. size_t read, written;
  340. int err = 0, i, ebnum, ok = 1;
  341. loff_t addr0;
  342. pr_info("erasetest\n");
  343. ebnum = 0;
  344. addr0 = 0;
  345. for (i = 0; i < ebcnt && bbt[i]; ++i) {
  346. addr0 += mtd->erasesize;
  347. ebnum += 1;
  348. }
  349. pr_info("erasing block %d\n", ebnum);
  350. err = erase_eraseblock(ebnum);
  351. if (err)
  352. return err;
  353. pr_info("writing 1st page of block %d\n", ebnum);
  354. prandom_bytes_state(&rnd_state, writebuf, pgsize);
  355. err = mtd_write(mtd, addr0, pgsize, &written, writebuf);
  356. if (err || written != pgsize) {
  357. pr_err("error: write failed at %#llx\n",
  358. (long long)addr0);
  359. return err ? err : -1;
  360. }
  361. pr_info("erasing block %d\n", ebnum);
  362. err = erase_eraseblock(ebnum);
  363. if (err)
  364. return err;
  365. pr_info("reading 1st page of block %d\n", ebnum);
  366. err = mtd_read(mtd, addr0, pgsize, &read, twopages);
  367. if (mtd_is_bitflip(err))
  368. err = 0;
  369. if (err || read != pgsize) {
  370. pr_err("error: read failed at %#llx\n",
  371. (long long)addr0);
  372. return err ? err : -1;
  373. }
  374. pr_info("verifying 1st page of block %d is all 0xff\n",
  375. ebnum);
  376. for (i = 0; i < pgsize; ++i)
  377. if (twopages[i] != 0xff) {
  378. pr_err("verifying all 0xff failed at %d\n",
  379. i);
  380. errcnt += 1;
  381. ok = 0;
  382. break;
  383. }
  384. if (ok && !err)
  385. pr_info("erasetest ok\n");
  386. return err;
  387. }
  388. static int is_block_bad(int ebnum)
  389. {
  390. loff_t addr = ebnum * mtd->erasesize;
  391. int ret;
  392. ret = mtd_block_isbad(mtd, addr);
  393. if (ret)
  394. pr_info("block %d is bad\n", ebnum);
  395. return ret;
  396. }
  397. static int scan_for_bad_eraseblocks(void)
  398. {
  399. int i, bad = 0;
  400. bbt = kzalloc(ebcnt, GFP_KERNEL);
  401. if (!bbt)
  402. return -ENOMEM;
  403. pr_info("scanning for bad eraseblocks\n");
  404. for (i = 0; i < ebcnt; ++i) {
  405. bbt[i] = is_block_bad(i) ? 1 : 0;
  406. if (bbt[i])
  407. bad += 1;
  408. cond_resched();
  409. }
  410. pr_info("scanned %d eraseblocks, %d are bad\n", i, bad);
  411. return 0;
  412. }
  413. static int __init mtd_pagetest_init(void)
  414. {
  415. int err = 0;
  416. uint64_t tmp;
  417. uint32_t i;
  418. printk(KERN_INFO "\n");
  419. printk(KERN_INFO "=================================================\n");
  420. if (dev < 0) {
  421. pr_info("Please specify a valid mtd-device via module parameter\n");
  422. pr_crit("CAREFUL: This test wipes all data on the specified MTD device!\n");
  423. return -EINVAL;
  424. }
  425. pr_info("MTD device: %d\n", dev);
  426. mtd = get_mtd_device(NULL, dev);
  427. if (IS_ERR(mtd)) {
  428. err = PTR_ERR(mtd);
  429. pr_err("error: cannot get MTD device\n");
  430. return err;
  431. }
  432. if (mtd->type != MTD_NANDFLASH) {
  433. pr_info("this test requires NAND flash\n");
  434. goto out;
  435. }
  436. tmp = mtd->size;
  437. do_div(tmp, mtd->erasesize);
  438. ebcnt = tmp;
  439. pgcnt = mtd->erasesize / mtd->writesize;
  440. pgsize = mtd->writesize;
  441. pr_info("MTD device size %llu, eraseblock size %u, "
  442. "page size %u, count of eraseblocks %u, pages per "
  443. "eraseblock %u, OOB size %u\n",
  444. (unsigned long long)mtd->size, mtd->erasesize,
  445. pgsize, ebcnt, pgcnt, mtd->oobsize);
  446. err = -ENOMEM;
  447. bufsize = pgsize * 2;
  448. writebuf = kmalloc(mtd->erasesize, GFP_KERNEL);
  449. if (!writebuf)
  450. goto out;
  451. twopages = kmalloc(bufsize, GFP_KERNEL);
  452. if (!twopages)
  453. goto out;
  454. boundary = kmalloc(bufsize, GFP_KERNEL);
  455. if (!boundary)
  456. goto out;
  457. err = scan_for_bad_eraseblocks();
  458. if (err)
  459. goto out;
  460. /* Erase all eraseblocks */
  461. pr_info("erasing whole device\n");
  462. for (i = 0; i < ebcnt; ++i) {
  463. if (bbt[i])
  464. continue;
  465. err = erase_eraseblock(i);
  466. if (err)
  467. goto out;
  468. cond_resched();
  469. }
  470. pr_info("erased %u eraseblocks\n", i);
  471. /* Write all eraseblocks */
  472. prandom_seed_state(&rnd_state, 1);
  473. pr_info("writing whole device\n");
  474. for (i = 0; i < ebcnt; ++i) {
  475. if (bbt[i])
  476. continue;
  477. err = write_eraseblock(i);
  478. if (err)
  479. goto out;
  480. if (i % 256 == 0)
  481. pr_info("written up to eraseblock %u\n", i);
  482. cond_resched();
  483. }
  484. pr_info("written %u eraseblocks\n", i);
  485. /* Check all eraseblocks */
  486. prandom_seed_state(&rnd_state, 1);
  487. pr_info("verifying all eraseblocks\n");
  488. for (i = 0; i < ebcnt; ++i) {
  489. if (bbt[i])
  490. continue;
  491. err = verify_eraseblock(i);
  492. if (err)
  493. goto out;
  494. if (i % 256 == 0)
  495. pr_info("verified up to eraseblock %u\n", i);
  496. cond_resched();
  497. }
  498. pr_info("verified %u eraseblocks\n", i);
  499. err = crosstest();
  500. if (err)
  501. goto out;
  502. err = erasecrosstest();
  503. if (err)
  504. goto out;
  505. err = erasetest();
  506. if (err)
  507. goto out;
  508. pr_info("finished with %d errors\n", errcnt);
  509. out:
  510. kfree(bbt);
  511. kfree(boundary);
  512. kfree(twopages);
  513. kfree(writebuf);
  514. put_mtd_device(mtd);
  515. if (err)
  516. pr_info("error %d occurred\n", err);
  517. printk(KERN_INFO "=================================================\n");
  518. return err;
  519. }
  520. module_init(mtd_pagetest_init);
  521. static void __exit mtd_pagetest_exit(void)
  522. {
  523. return;
  524. }
  525. module_exit(mtd_pagetest_exit);
  526. MODULE_DESCRIPTION("NAND page test");
  527. MODULE_AUTHOR("Adrian Hunter");
  528. MODULE_LICENSE("GPL");