mtd_pagetest.c 15 KB

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