mtd_pagetest.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633
  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 = -EINVAL;
  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;
  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;
  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 (mtd_is_bitflip(err))
  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 (mtd_is_bitflip(err))
  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. err = mtd_read(mtd, addr, bufsize, &read, twopages);
  127. if (mtd_is_bitflip(err))
  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 (mtd_is_bitflip(err))
  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 (mtd_is_bitflip(err))
  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. err = mtd_read(mtd, addr, bufsize, &read, twopages);
  162. if (mtd_is_bitflip(err))
  163. err = 0;
  164. if (err || read != bufsize) {
  165. printk(PRINT_PREF "error: read failed at %#llx\n",
  166. (long long)addr);
  167. return err;
  168. }
  169. memcpy(boundary, writebuf + mtd->erasesize - pgsize, pgsize);
  170. set_random_data(boundary + pgsize, pgsize);
  171. if (memcmp(twopages, boundary, bufsize)) {
  172. printk(PRINT_PREF "error: verify failed at %#llx\n",
  173. (long long)addr);
  174. errcnt += 1;
  175. }
  176. next = oldnext;
  177. }
  178. return err;
  179. }
  180. static int crosstest(void)
  181. {
  182. size_t read;
  183. int err = 0, i;
  184. loff_t addr, addr0, addrn;
  185. unsigned char *pp1, *pp2, *pp3, *pp4;
  186. printk(PRINT_PREF "crosstest\n");
  187. pp1 = kmalloc(pgsize * 4, GFP_KERNEL);
  188. if (!pp1) {
  189. printk(PRINT_PREF "error: cannot allocate memory\n");
  190. return -ENOMEM;
  191. }
  192. pp2 = pp1 + pgsize;
  193. pp3 = pp2 + pgsize;
  194. pp4 = pp3 + pgsize;
  195. memset(pp1, 0, pgsize * 4);
  196. addr0 = 0;
  197. for (i = 0; i < ebcnt && bbt[i]; ++i)
  198. addr0 += mtd->erasesize;
  199. addrn = mtd->size;
  200. for (i = 0; i < ebcnt && bbt[ebcnt - i - 1]; ++i)
  201. addrn -= mtd->erasesize;
  202. /* Read 2nd-to-last page to pp1 */
  203. addr = addrn - pgsize - pgsize;
  204. err = mtd_read(mtd, addr, pgsize, &read, pp1);
  205. if (mtd_is_bitflip(err))
  206. err = 0;
  207. if (err || read != pgsize) {
  208. printk(PRINT_PREF "error: read failed at %#llx\n",
  209. (long long)addr);
  210. kfree(pp1);
  211. return err;
  212. }
  213. /* Read 3rd-to-last page to pp1 */
  214. addr = addrn - pgsize - pgsize - pgsize;
  215. err = mtd_read(mtd, addr, pgsize, &read, pp1);
  216. if (mtd_is_bitflip(err))
  217. err = 0;
  218. if (err || read != pgsize) {
  219. printk(PRINT_PREF "error: read failed at %#llx\n",
  220. (long long)addr);
  221. kfree(pp1);
  222. return err;
  223. }
  224. /* Read first page to pp2 */
  225. addr = addr0;
  226. printk(PRINT_PREF "reading page at %#llx\n", (long long)addr);
  227. err = mtd_read(mtd, addr, pgsize, &read, pp2);
  228. if (mtd_is_bitflip(err))
  229. err = 0;
  230. if (err || read != pgsize) {
  231. printk(PRINT_PREF "error: read failed at %#llx\n",
  232. (long long)addr);
  233. kfree(pp1);
  234. return err;
  235. }
  236. /* Read last page to pp3 */
  237. addr = addrn - pgsize;
  238. printk(PRINT_PREF "reading page at %#llx\n", (long long)addr);
  239. err = mtd_read(mtd, addr, pgsize, &read, pp3);
  240. if (mtd_is_bitflip(err))
  241. err = 0;
  242. if (err || read != pgsize) {
  243. printk(PRINT_PREF "error: read failed at %#llx\n",
  244. (long long)addr);
  245. kfree(pp1);
  246. return err;
  247. }
  248. /* Read first page again to pp4 */
  249. addr = addr0;
  250. printk(PRINT_PREF "reading page at %#llx\n", (long long)addr);
  251. err = mtd_read(mtd, addr, pgsize, &read, pp4);
  252. if (mtd_is_bitflip(err))
  253. err = 0;
  254. if (err || read != pgsize) {
  255. printk(PRINT_PREF "error: read failed at %#llx\n",
  256. (long long)addr);
  257. kfree(pp1);
  258. return err;
  259. }
  260. /* pp2 and pp4 should be the same */
  261. printk(PRINT_PREF "verifying pages read at %#llx match\n",
  262. (long long)addr0);
  263. if (memcmp(pp2, pp4, pgsize)) {
  264. printk(PRINT_PREF "verify failed!\n");
  265. errcnt += 1;
  266. } else if (!err)
  267. printk(PRINT_PREF "crosstest ok\n");
  268. kfree(pp1);
  269. return err;
  270. }
  271. static int erasecrosstest(void)
  272. {
  273. size_t read, written;
  274. int err = 0, i, ebnum, ebnum2;
  275. loff_t addr0;
  276. char *readbuf = twopages;
  277. printk(PRINT_PREF "erasecrosstest\n");
  278. ebnum = 0;
  279. addr0 = 0;
  280. for (i = 0; i < ebcnt && bbt[i]; ++i) {
  281. addr0 += mtd->erasesize;
  282. ebnum += 1;
  283. }
  284. ebnum2 = ebcnt - 1;
  285. while (ebnum2 && bbt[ebnum2])
  286. ebnum2 -= 1;
  287. printk(PRINT_PREF "erasing block %d\n", ebnum);
  288. err = erase_eraseblock(ebnum);
  289. if (err)
  290. return err;
  291. printk(PRINT_PREF "writing 1st page of block %d\n", ebnum);
  292. set_random_data(writebuf, pgsize);
  293. strcpy(writebuf, "There is no data like this!");
  294. err = mtd_write(mtd, addr0, pgsize, &written, writebuf);
  295. if (err || written != pgsize) {
  296. printk(PRINT_PREF "error: write failed at %#llx\n",
  297. (long long)addr0);
  298. return err ? err : -1;
  299. }
  300. printk(PRINT_PREF "reading 1st page of block %d\n", ebnum);
  301. memset(readbuf, 0, pgsize);
  302. err = mtd_read(mtd, addr0, pgsize, &read, readbuf);
  303. if (mtd_is_bitflip(err))
  304. err = 0;
  305. if (err || read != pgsize) {
  306. printk(PRINT_PREF "error: read failed at %#llx\n",
  307. (long long)addr0);
  308. return err ? err : -1;
  309. }
  310. printk(PRINT_PREF "verifying 1st page of block %d\n", ebnum);
  311. if (memcmp(writebuf, readbuf, pgsize)) {
  312. printk(PRINT_PREF "verify failed!\n");
  313. errcnt += 1;
  314. return -1;
  315. }
  316. printk(PRINT_PREF "erasing block %d\n", ebnum);
  317. err = erase_eraseblock(ebnum);
  318. if (err)
  319. return err;
  320. printk(PRINT_PREF "writing 1st page of block %d\n", ebnum);
  321. set_random_data(writebuf, pgsize);
  322. strcpy(writebuf, "There is no data like this!");
  323. err = mtd_write(mtd, addr0, pgsize, &written, writebuf);
  324. if (err || written != pgsize) {
  325. printk(PRINT_PREF "error: write failed at %#llx\n",
  326. (long long)addr0);
  327. return err ? err : -1;
  328. }
  329. printk(PRINT_PREF "erasing block %d\n", ebnum2);
  330. err = erase_eraseblock(ebnum2);
  331. if (err)
  332. return err;
  333. printk(PRINT_PREF "reading 1st page of block %d\n", ebnum);
  334. memset(readbuf, 0, pgsize);
  335. err = mtd_read(mtd, addr0, pgsize, &read, readbuf);
  336. if (mtd_is_bitflip(err))
  337. err = 0;
  338. if (err || read != pgsize) {
  339. printk(PRINT_PREF "error: read failed at %#llx\n",
  340. (long long)addr0);
  341. return err ? err : -1;
  342. }
  343. printk(PRINT_PREF "verifying 1st page of block %d\n", ebnum);
  344. if (memcmp(writebuf, readbuf, pgsize)) {
  345. printk(PRINT_PREF "verify failed!\n");
  346. errcnt += 1;
  347. return -1;
  348. }
  349. if (!err)
  350. printk(PRINT_PREF "erasecrosstest ok\n");
  351. return err;
  352. }
  353. static int erasetest(void)
  354. {
  355. size_t read, written;
  356. int err = 0, i, ebnum, ok = 1;
  357. loff_t addr0;
  358. printk(PRINT_PREF "erasetest\n");
  359. ebnum = 0;
  360. addr0 = 0;
  361. for (i = 0; i < ebcnt && bbt[i]; ++i) {
  362. addr0 += mtd->erasesize;
  363. ebnum += 1;
  364. }
  365. printk(PRINT_PREF "erasing block %d\n", ebnum);
  366. err = erase_eraseblock(ebnum);
  367. if (err)
  368. return err;
  369. printk(PRINT_PREF "writing 1st page of block %d\n", ebnum);
  370. set_random_data(writebuf, pgsize);
  371. err = mtd_write(mtd, addr0, pgsize, &written, writebuf);
  372. if (err || written != pgsize) {
  373. printk(PRINT_PREF "error: write failed at %#llx\n",
  374. (long long)addr0);
  375. return err ? err : -1;
  376. }
  377. printk(PRINT_PREF "erasing block %d\n", ebnum);
  378. err = erase_eraseblock(ebnum);
  379. if (err)
  380. return err;
  381. printk(PRINT_PREF "reading 1st page of block %d\n", ebnum);
  382. err = mtd_read(mtd, addr0, pgsize, &read, twopages);
  383. if (mtd_is_bitflip(err))
  384. err = 0;
  385. if (err || read != pgsize) {
  386. printk(PRINT_PREF "error: read failed at %#llx\n",
  387. (long long)addr0);
  388. return err ? err : -1;
  389. }
  390. printk(PRINT_PREF "verifying 1st page of block %d is all 0xff\n",
  391. ebnum);
  392. for (i = 0; i < pgsize; ++i)
  393. if (twopages[i] != 0xff) {
  394. printk(PRINT_PREF "verifying all 0xff failed at %d\n",
  395. i);
  396. errcnt += 1;
  397. ok = 0;
  398. break;
  399. }
  400. if (ok && !err)
  401. printk(PRINT_PREF "erasetest ok\n");
  402. return err;
  403. }
  404. static int is_block_bad(int ebnum)
  405. {
  406. loff_t addr = ebnum * mtd->erasesize;
  407. int ret;
  408. ret = mtd_block_isbad(mtd, addr);
  409. if (ret)
  410. printk(PRINT_PREF "block %d is bad\n", ebnum);
  411. return ret;
  412. }
  413. static int scan_for_bad_eraseblocks(void)
  414. {
  415. int i, bad = 0;
  416. bbt = kzalloc(ebcnt, GFP_KERNEL);
  417. if (!bbt) {
  418. printk(PRINT_PREF "error: cannot allocate memory\n");
  419. return -ENOMEM;
  420. }
  421. printk(PRINT_PREF "scanning for bad eraseblocks\n");
  422. for (i = 0; i < ebcnt; ++i) {
  423. bbt[i] = is_block_bad(i) ? 1 : 0;
  424. if (bbt[i])
  425. bad += 1;
  426. cond_resched();
  427. }
  428. printk(PRINT_PREF "scanned %d eraseblocks, %d are bad\n", i, bad);
  429. return 0;
  430. }
  431. static int __init mtd_pagetest_init(void)
  432. {
  433. int err = 0;
  434. uint64_t tmp;
  435. uint32_t i;
  436. printk(KERN_INFO "\n");
  437. printk(KERN_INFO "=================================================\n");
  438. if (dev < 0) {
  439. printk(PRINT_PREF "Please specify a valid mtd-device via module paramter\n");
  440. printk(KERN_CRIT "CAREFUL: This test wipes all data on the specified MTD device!\n");
  441. return -EINVAL;
  442. }
  443. printk(PRINT_PREF "MTD device: %d\n", dev);
  444. mtd = get_mtd_device(NULL, dev);
  445. if (IS_ERR(mtd)) {
  446. err = PTR_ERR(mtd);
  447. printk(PRINT_PREF "error: cannot get MTD device\n");
  448. return err;
  449. }
  450. if (mtd->type != MTD_NANDFLASH) {
  451. printk(PRINT_PREF "this test requires NAND flash\n");
  452. goto out;
  453. }
  454. tmp = mtd->size;
  455. do_div(tmp, mtd->erasesize);
  456. ebcnt = tmp;
  457. pgcnt = mtd->erasesize / mtd->writesize;
  458. pgsize = mtd->writesize;
  459. printk(PRINT_PREF "MTD device size %llu, eraseblock size %u, "
  460. "page size %u, count of eraseblocks %u, pages per "
  461. "eraseblock %u, OOB size %u\n",
  462. (unsigned long long)mtd->size, mtd->erasesize,
  463. pgsize, ebcnt, pgcnt, mtd->oobsize);
  464. err = -ENOMEM;
  465. bufsize = pgsize * 2;
  466. writebuf = kmalloc(mtd->erasesize, GFP_KERNEL);
  467. if (!writebuf) {
  468. printk(PRINT_PREF "error: cannot allocate memory\n");
  469. goto out;
  470. }
  471. twopages = kmalloc(bufsize, GFP_KERNEL);
  472. if (!twopages) {
  473. printk(PRINT_PREF "error: cannot allocate memory\n");
  474. goto out;
  475. }
  476. boundary = kmalloc(bufsize, GFP_KERNEL);
  477. if (!boundary) {
  478. printk(PRINT_PREF "error: cannot allocate memory\n");
  479. goto out;
  480. }
  481. err = scan_for_bad_eraseblocks();
  482. if (err)
  483. goto out;
  484. /* Erase all eraseblocks */
  485. printk(PRINT_PREF "erasing whole device\n");
  486. for (i = 0; i < ebcnt; ++i) {
  487. if (bbt[i])
  488. continue;
  489. err = erase_eraseblock(i);
  490. if (err)
  491. goto out;
  492. cond_resched();
  493. }
  494. printk(PRINT_PREF "erased %u eraseblocks\n", i);
  495. /* Write all eraseblocks */
  496. simple_srand(1);
  497. printk(PRINT_PREF "writing whole device\n");
  498. for (i = 0; i < ebcnt; ++i) {
  499. if (bbt[i])
  500. continue;
  501. err = write_eraseblock(i);
  502. if (err)
  503. goto out;
  504. if (i % 256 == 0)
  505. printk(PRINT_PREF "written up to eraseblock %u\n", i);
  506. cond_resched();
  507. }
  508. printk(PRINT_PREF "written %u eraseblocks\n", i);
  509. /* Check all eraseblocks */
  510. simple_srand(1);
  511. printk(PRINT_PREF "verifying all eraseblocks\n");
  512. for (i = 0; i < ebcnt; ++i) {
  513. if (bbt[i])
  514. continue;
  515. err = verify_eraseblock(i);
  516. if (err)
  517. goto out;
  518. if (i % 256 == 0)
  519. printk(PRINT_PREF "verified up to eraseblock %u\n", i);
  520. cond_resched();
  521. }
  522. printk(PRINT_PREF "verified %u eraseblocks\n", i);
  523. err = crosstest();
  524. if (err)
  525. goto out;
  526. err = erasecrosstest();
  527. if (err)
  528. goto out;
  529. err = erasetest();
  530. if (err)
  531. goto out;
  532. printk(PRINT_PREF "finished with %d errors\n", errcnt);
  533. out:
  534. kfree(bbt);
  535. kfree(boundary);
  536. kfree(twopages);
  537. kfree(writebuf);
  538. put_mtd_device(mtd);
  539. if (err)
  540. printk(PRINT_PREF "error %d occurred\n", err);
  541. printk(KERN_INFO "=================================================\n");
  542. return err;
  543. }
  544. module_init(mtd_pagetest_init);
  545. static void __exit mtd_pagetest_exit(void)
  546. {
  547. return;
  548. }
  549. module_exit(mtd_pagetest_exit);
  550. MODULE_DESCRIPTION("NAND page test");
  551. MODULE_AUTHOR("Adrian Hunter");
  552. MODULE_LICENSE("GPL");