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/sched.h>
  28. #define PRINT_PREF KERN_INFO "mtd_pagetest: "
  29. static int dev;
  30. module_param(dev, int, S_IRUGO);
  31. MODULE_PARM_DESC(dev, "MTD device number to use");
  32. static struct mtd_info *mtd;
  33. static unsigned char *twopages;
  34. static unsigned char *writebuf;
  35. static unsigned char *boundary;
  36. static unsigned char *bbt;
  37. static int pgsize;
  38. static int bufsize;
  39. static int ebcnt;
  40. static int pgcnt;
  41. static int errcnt;
  42. static unsigned long next = 1;
  43. static inline unsigned int simple_rand(void)
  44. {
  45. next = next * 1103515245 + 12345;
  46. return (unsigned int)((next / 65536) % 32768);
  47. }
  48. static inline void simple_srand(unsigned long seed)
  49. {
  50. next = seed;
  51. }
  52. static void set_random_data(unsigned char *buf, size_t len)
  53. {
  54. size_t i;
  55. for (i = 0; i < len; ++i)
  56. buf[i] = simple_rand();
  57. }
  58. static int erase_eraseblock(int ebnum)
  59. {
  60. int err;
  61. struct erase_info ei;
  62. loff_t addr = ebnum * mtd->erasesize;
  63. memset(&ei, 0, sizeof(struct erase_info));
  64. ei.mtd = mtd;
  65. ei.addr = addr;
  66. ei.len = mtd->erasesize;
  67. err = mtd->erase(mtd, &ei);
  68. if (err) {
  69. printk(PRINT_PREF "error %d while erasing EB %d\n", err, ebnum);
  70. return err;
  71. }
  72. if (ei.state == MTD_ERASE_FAILED) {
  73. printk(PRINT_PREF "some erase error occurred at EB %d\n",
  74. ebnum);
  75. return -EIO;
  76. }
  77. return 0;
  78. }
  79. static int write_eraseblock(int ebnum)
  80. {
  81. int err = 0;
  82. size_t written = 0;
  83. loff_t addr = ebnum * mtd->erasesize;
  84. set_random_data(writebuf, mtd->erasesize);
  85. cond_resched();
  86. err = mtd->write(mtd, addr, mtd->erasesize, &written, writebuf);
  87. if (err || written != mtd->erasesize)
  88. printk(PRINT_PREF "error: write failed at %#llx\n",
  89. (long long)addr);
  90. return err;
  91. }
  92. static int verify_eraseblock(int ebnum)
  93. {
  94. uint32_t j;
  95. size_t read = 0;
  96. int err = 0, i;
  97. loff_t addr0, addrn;
  98. loff_t addr = ebnum * mtd->erasesize;
  99. addr0 = 0;
  100. for (i = 0; bbt[i] && i < ebcnt; ++i)
  101. addr0 += mtd->erasesize;
  102. addrn = mtd->size;
  103. for (i = 0; bbt[ebcnt - i - 1] && i < ebcnt; ++i)
  104. addrn -= mtd->erasesize;
  105. set_random_data(writebuf, mtd->erasesize);
  106. for (j = 0; j < pgcnt - 1; ++j, addr += pgsize) {
  107. /* Do a read to set the internal dataRAMs to different data */
  108. err = mtd->read(mtd, addr0, bufsize, &read, twopages);
  109. if (err == -EUCLEAN)
  110. err = 0;
  111. if (err || read != bufsize) {
  112. printk(PRINT_PREF "error: read failed at %#llx\n",
  113. (long long)addr0);
  114. return err;
  115. }
  116. err = mtd->read(mtd, addrn - bufsize, bufsize, &read, twopages);
  117. if (err == -EUCLEAN)
  118. err = 0;
  119. if (err || read != bufsize) {
  120. printk(PRINT_PREF "error: read failed at %#llx\n",
  121. (long long)(addrn - bufsize));
  122. return err;
  123. }
  124. memset(twopages, 0, bufsize);
  125. read = 0;
  126. err = mtd->read(mtd, addr, bufsize, &read, twopages);
  127. if (err == -EUCLEAN)
  128. err = 0;
  129. if (err || read != bufsize) {
  130. printk(PRINT_PREF "error: read failed at %#llx\n",
  131. (long long)addr);
  132. break;
  133. }
  134. if (memcmp(twopages, writebuf + (j * pgsize), bufsize)) {
  135. printk(PRINT_PREF "error: verify failed at %#llx\n",
  136. (long long)addr);
  137. errcnt += 1;
  138. }
  139. }
  140. /* Check boundary between eraseblocks */
  141. if (addr <= addrn - pgsize - pgsize && !bbt[ebnum + 1]) {
  142. unsigned long oldnext = next;
  143. /* Do a read to set the internal dataRAMs to different data */
  144. err = mtd->read(mtd, addr0, bufsize, &read, twopages);
  145. if (err == -EUCLEAN)
  146. err = 0;
  147. if (err || read != bufsize) {
  148. printk(PRINT_PREF "error: read failed at %#llx\n",
  149. (long long)addr0);
  150. return err;
  151. }
  152. err = mtd->read(mtd, addrn - bufsize, bufsize, &read, twopages);
  153. if (err == -EUCLEAN)
  154. err = 0;
  155. if (err || read != bufsize) {
  156. printk(PRINT_PREF "error: read failed at %#llx\n",
  157. (long long)(addrn - bufsize));
  158. return err;
  159. }
  160. memset(twopages, 0, bufsize);
  161. read = 0;
  162. err = mtd->read(mtd, addr, bufsize, &read, twopages);
  163. if (err == -EUCLEAN)
  164. err = 0;
  165. if (err || read != bufsize) {
  166. printk(PRINT_PREF "error: read failed at %#llx\n",
  167. (long long)addr);
  168. return err;
  169. }
  170. memcpy(boundary, writebuf + mtd->erasesize - pgsize, pgsize);
  171. set_random_data(boundary + pgsize, pgsize);
  172. if (memcmp(twopages, boundary, bufsize)) {
  173. printk(PRINT_PREF "error: verify failed at %#llx\n",
  174. (long long)addr);
  175. errcnt += 1;
  176. }
  177. next = oldnext;
  178. }
  179. return err;
  180. }
  181. static int crosstest(void)
  182. {
  183. size_t read = 0;
  184. int err = 0, i;
  185. loff_t addr, addr0, addrn;
  186. unsigned char *pp1, *pp2, *pp3, *pp4;
  187. printk(PRINT_PREF "crosstest\n");
  188. pp1 = kmalloc(pgsize * 4, GFP_KERNEL);
  189. if (!pp1) {
  190. printk(PRINT_PREF "error: cannot allocate memory\n");
  191. return -ENOMEM;
  192. }
  193. pp2 = pp1 + pgsize;
  194. pp3 = pp2 + pgsize;
  195. pp4 = pp3 + pgsize;
  196. memset(pp1, 0, pgsize * 4);
  197. addr0 = 0;
  198. for (i = 0; bbt[i] && i < ebcnt; ++i)
  199. addr0 += mtd->erasesize;
  200. addrn = mtd->size;
  201. for (i = 0; bbt[ebcnt - i - 1] && i < ebcnt; ++i)
  202. addrn -= mtd->erasesize;
  203. /* Read 2nd-to-last page to pp1 */
  204. read = 0;
  205. addr = addrn - pgsize - pgsize;
  206. err = mtd->read(mtd, addr, pgsize, &read, pp1);
  207. if (err == -EUCLEAN)
  208. err = 0;
  209. if (err || read != pgsize) {
  210. printk(PRINT_PREF "error: read failed at %#llx\n",
  211. (long long)addr);
  212. kfree(pp1);
  213. return err;
  214. }
  215. /* Read 3rd-to-last page to pp1 */
  216. read = 0;
  217. addr = addrn - pgsize - pgsize - pgsize;
  218. err = mtd->read(mtd, addr, pgsize, &read, pp1);
  219. if (err == -EUCLEAN)
  220. err = 0;
  221. if (err || read != pgsize) {
  222. printk(PRINT_PREF "error: read failed at %#llx\n",
  223. (long long)addr);
  224. kfree(pp1);
  225. return err;
  226. }
  227. /* Read first page to pp2 */
  228. read = 0;
  229. addr = addr0;
  230. printk(PRINT_PREF "reading page at %#llx\n", (long long)addr);
  231. err = mtd->read(mtd, addr, pgsize, &read, pp2);
  232. if (err == -EUCLEAN)
  233. err = 0;
  234. if (err || read != pgsize) {
  235. printk(PRINT_PREF "error: read failed at %#llx\n",
  236. (long long)addr);
  237. kfree(pp1);
  238. return err;
  239. }
  240. /* Read last page to pp3 */
  241. read = 0;
  242. addr = addrn - pgsize;
  243. printk(PRINT_PREF "reading page at %#llx\n", (long long)addr);
  244. err = mtd->read(mtd, addr, pgsize, &read, pp3);
  245. if (err == -EUCLEAN)
  246. err = 0;
  247. if (err || read != pgsize) {
  248. printk(PRINT_PREF "error: read failed at %#llx\n",
  249. (long long)addr);
  250. kfree(pp1);
  251. return err;
  252. }
  253. /* Read first page again to pp4 */
  254. read = 0;
  255. addr = addr0;
  256. printk(PRINT_PREF "reading page at %#llx\n", (long long)addr);
  257. err = mtd->read(mtd, addr, pgsize, &read, pp4);
  258. if (err == -EUCLEAN)
  259. err = 0;
  260. if (err || read != pgsize) {
  261. printk(PRINT_PREF "error: read failed at %#llx\n",
  262. (long long)addr);
  263. kfree(pp1);
  264. return err;
  265. }
  266. /* pp2 and pp4 should be the same */
  267. printk(PRINT_PREF "verifying pages read at %#llx match\n",
  268. (long long)addr0);
  269. if (memcmp(pp2, pp4, pgsize)) {
  270. printk(PRINT_PREF "verify failed!\n");
  271. errcnt += 1;
  272. } else if (!err)
  273. printk(PRINT_PREF "crosstest ok\n");
  274. kfree(pp1);
  275. return err;
  276. }
  277. static int erasecrosstest(void)
  278. {
  279. size_t read = 0, written = 0;
  280. int err = 0, i, ebnum, ok = 1, ebnum2;
  281. loff_t addr0;
  282. char *readbuf = twopages;
  283. printk(PRINT_PREF "erasecrosstest\n");
  284. ebnum = 0;
  285. addr0 = 0;
  286. for (i = 0; bbt[i] && i < ebcnt; ++i) {
  287. addr0 += mtd->erasesize;
  288. ebnum += 1;
  289. }
  290. ebnum2 = ebcnt - 1;
  291. while (ebnum2 && bbt[ebnum2])
  292. ebnum2 -= 1;
  293. printk(PRINT_PREF "erasing block %d\n", ebnum);
  294. err = erase_eraseblock(ebnum);
  295. if (err)
  296. return err;
  297. printk(PRINT_PREF "writing 1st page of block %d\n", ebnum);
  298. set_random_data(writebuf, pgsize);
  299. strcpy(writebuf, "There is no data like this!");
  300. err = mtd->write(mtd, addr0, pgsize, &written, writebuf);
  301. if (err || written != pgsize) {
  302. printk(PRINT_PREF "error: write failed at %#llx\n",
  303. (long long)addr0);
  304. return err ? err : -1;
  305. }
  306. printk(PRINT_PREF "reading 1st page of block %d\n", ebnum);
  307. memset(readbuf, 0, pgsize);
  308. err = mtd->read(mtd, addr0, pgsize, &read, readbuf);
  309. if (err == -EUCLEAN)
  310. err = 0;
  311. if (err || read != pgsize) {
  312. printk(PRINT_PREF "error: read failed at %#llx\n",
  313. (long long)addr0);
  314. return err ? err : -1;
  315. }
  316. printk(PRINT_PREF "verifying 1st page of block %d\n", ebnum);
  317. if (memcmp(writebuf, readbuf, pgsize)) {
  318. printk(PRINT_PREF "verify failed!\n");
  319. errcnt += 1;
  320. ok = 0;
  321. return err;
  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. ok = 0;
  355. }
  356. if (ok && !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; bbt[i] && i < ebcnt; ++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 = kmalloc(ebcnt, GFP_KERNEL);
  424. if (!bbt) {
  425. printk(PRINT_PREF "error: cannot allocate memory\n");
  426. return -ENOMEM;
  427. }
  428. memset(bbt, 0 , ebcnt);
  429. printk(PRINT_PREF "scanning for bad eraseblocks\n");
  430. for (i = 0; i < ebcnt; ++i) {
  431. bbt[i] = is_block_bad(i) ? 1 : 0;
  432. if (bbt[i])
  433. bad += 1;
  434. cond_resched();
  435. }
  436. printk(PRINT_PREF "scanned %d eraseblocks, %d are bad\n", i, bad);
  437. return 0;
  438. }
  439. static int __init mtd_pagetest_init(void)
  440. {
  441. int err = 0;
  442. uint64_t tmp;
  443. uint32_t i;
  444. printk(KERN_INFO "\n");
  445. printk(KERN_INFO "=================================================\n");
  446. printk(PRINT_PREF "MTD device: %d\n", dev);
  447. mtd = get_mtd_device(NULL, dev);
  448. if (IS_ERR(mtd)) {
  449. err = PTR_ERR(mtd);
  450. printk(PRINT_PREF "error: cannot get MTD device\n");
  451. return err;
  452. }
  453. if (mtd->type != MTD_NANDFLASH) {
  454. printk(PRINT_PREF "this test requires NAND flash\n");
  455. goto out;
  456. }
  457. tmp = mtd->size;
  458. do_div(tmp, mtd->erasesize);
  459. ebcnt = tmp;
  460. pgcnt = mtd->erasesize / 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");