diff options
author | David Woodhouse <David.Woodhouse@intel.com> | 2009-01-05 11:24:55 -0500 |
---|---|---|
committer | David Woodhouse <David.Woodhouse@intel.com> | 2009-01-05 11:24:55 -0500 |
commit | 572acc41274522b865440d0644d5f986e3c83755 (patch) | |
tree | e1f6f2968299d35de6ef4ec04524f65d28342b1a /drivers/mtd | |
parent | 60f26520e7bd4479dbebf77317c45fc2255ba2e8 (diff) | |
parent | 9faa8153bef4d82395e6ff7f87cb7c457055007c (diff) |
Merge branch 'master' of git://git.infradead.org/users/dedekind/mtd-tests-2.6
Conflicts:
drivers/mtd/Makefile
Diffstat (limited to 'drivers/mtd')
-rw-r--r-- | drivers/mtd/Kconfig | 8 | ||||
-rw-r--r-- | drivers/mtd/Makefile | 2 | ||||
-rw-r--r-- | drivers/mtd/tests/Makefile | 7 | ||||
-rw-r--r-- | drivers/mtd/tests/mtd_oobtest.c | 742 | ||||
-rw-r--r-- | drivers/mtd/tests/mtd_pagetest.c | 632 | ||||
-rw-r--r-- | drivers/mtd/tests/mtd_readtest.c | 253 | ||||
-rw-r--r-- | drivers/mtd/tests/mtd_speedtest.c | 502 | ||||
-rw-r--r-- | drivers/mtd/tests/mtd_stresstest.c | 330 | ||||
-rw-r--r-- | drivers/mtd/tests/mtd_subpagetest.c | 525 | ||||
-rw-r--r-- | drivers/mtd/tests/mtd_torturetest.c | 530 |
10 files changed, 3530 insertions, 1 deletions
diff --git a/drivers/mtd/Kconfig b/drivers/mtd/Kconfig index ad20dc3128b9..7d04fb9ddcaa 100644 --- a/drivers/mtd/Kconfig +++ b/drivers/mtd/Kconfig | |||
@@ -45,6 +45,14 @@ config MTD_PARTITIONS | |||
45 | devices. Partitioning on NFTL 'devices' is a different - that's the | 45 | devices. Partitioning on NFTL 'devices' is a different - that's the |
46 | 'normal' form of partitioning used on a block device. | 46 | 'normal' form of partitioning used on a block device. |
47 | 47 | ||
48 | config MTD_TESTS | ||
49 | tristate "MTD tests support" | ||
50 | depends on m | ||
51 | help | ||
52 | This option includes various MTD tests into compilation. The tests | ||
53 | should normally be compiled as kernel modules. The modules perform | ||
54 | various checks and verifications when loaded. | ||
55 | |||
48 | config MTD_REDBOOT_PARTS | 56 | config MTD_REDBOOT_PARTS |
49 | tristate "RedBoot partition table parsing" | 57 | tristate "RedBoot partition table parsing" |
50 | depends on MTD_PARTITIONS | 58 | depends on MTD_PARTITIONS |
diff --git a/drivers/mtd/Makefile b/drivers/mtd/Makefile index 7fb3dfbb4579..4521b1ecce45 100644 --- a/drivers/mtd/Makefile +++ b/drivers/mtd/Makefile | |||
@@ -29,6 +29,6 @@ obj-$(CONFIG_MTD_OOPS) += mtdoops.o | |||
29 | nftl-objs := nftlcore.o nftlmount.o | 29 | nftl-objs := nftlcore.o nftlmount.o |
30 | inftl-objs := inftlcore.o inftlmount.o | 30 | inftl-objs := inftlcore.o inftlmount.o |
31 | 31 | ||
32 | obj-y += chips/ lpddr/ maps/ devices/ nand/ onenand/ | 32 | obj-y += chips/ lpddr/ maps/ devices/ nand/ onenand/ tests/ |
33 | 33 | ||
34 | obj-$(CONFIG_MTD_UBI) += ubi/ | 34 | obj-$(CONFIG_MTD_UBI) += ubi/ |
diff --git a/drivers/mtd/tests/Makefile b/drivers/mtd/tests/Makefile new file mode 100644 index 000000000000..c1d501335006 --- /dev/null +++ b/drivers/mtd/tests/Makefile | |||
@@ -0,0 +1,7 @@ | |||
1 | obj-$(CONFIG_MTD_TESTS) += mtd_oobtest.o | ||
2 | obj-$(CONFIG_MTD_TESTS) += mtd_pagetest.o | ||
3 | obj-$(CONFIG_MTD_TESTS) += mtd_readtest.o | ||
4 | obj-$(CONFIG_MTD_TESTS) += mtd_speedtest.o | ||
5 | obj-$(CONFIG_MTD_TESTS) += mtd_stresstest.o | ||
6 | obj-$(CONFIG_MTD_TESTS) += mtd_subpagetest.o | ||
7 | obj-$(CONFIG_MTD_TESTS) += mtd_torturetest.o | ||
diff --git a/drivers/mtd/tests/mtd_oobtest.c b/drivers/mtd/tests/mtd_oobtest.c new file mode 100644 index 000000000000..afbc3f8126db --- /dev/null +++ b/drivers/mtd/tests/mtd_oobtest.c | |||
@@ -0,0 +1,742 @@ | |||
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 OOB read and write on MTD device. | ||
18 | * | ||
19 | * Author: Adrian Hunter <ext-adrian.hunter@nokia.com> | ||
20 | */ | ||
21 | |||
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/sched.h> | ||
29 | |||
30 | #define PRINT_PREF KERN_INFO "mtd_oobtest: " | ||
31 | |||
32 | static int dev; | ||
33 | module_param(dev, int, S_IRUGO); | ||
34 | MODULE_PARM_DESC(dev, "MTD device number to use"); | ||
35 | |||
36 | static struct mtd_info *mtd; | ||
37 | static unsigned char *readbuf; | ||
38 | static unsigned char *writebuf; | ||
39 | static unsigned char *bbt; | ||
40 | |||
41 | static int ebcnt; | ||
42 | static int pgcnt; | ||
43 | static int errcnt; | ||
44 | static int use_offset; | ||
45 | static int use_len; | ||
46 | static int use_len_max; | ||
47 | static int vary_offset; | ||
48 | static unsigned long next = 1; | ||
49 | |||
50 | static inline unsigned int simple_rand(void) | ||
51 | { | ||
52 | next = next * 1103515245 + 12345; | ||
53 | return (unsigned int)((next / 65536) % 32768); | ||
54 | } | ||
55 | |||
56 | static inline void simple_srand(unsigned long seed) | ||
57 | { | ||
58 | next = seed; | ||
59 | } | ||
60 | |||
61 | static void set_random_data(unsigned char *buf, size_t len) | ||
62 | { | ||
63 | size_t i; | ||
64 | |||
65 | for (i = 0; i < len; ++i) | ||
66 | buf[i] = simple_rand(); | ||
67 | } | ||
68 | |||
69 | static int erase_eraseblock(int ebnum) | ||
70 | { | ||
71 | int err; | ||
72 | struct erase_info ei; | ||
73 | loff_t addr = ebnum * mtd->erasesize; | ||
74 | |||
75 | memset(&ei, 0, sizeof(struct erase_info)); | ||
76 | ei.mtd = mtd; | ||
77 | ei.addr = addr; | ||
78 | ei.len = mtd->erasesize; | ||
79 | |||
80 | err = mtd->erase(mtd, &ei); | ||
81 | if (err) { | ||
82 | printk(PRINT_PREF "error %d while erasing EB %d\n", err, ebnum); | ||
83 | return err; | ||
84 | } | ||
85 | |||
86 | if (ei.state == MTD_ERASE_FAILED) { | ||
87 | printk(PRINT_PREF "some erase error occurred at EB %d\n", | ||
88 | ebnum); | ||
89 | return -EIO; | ||
90 | } | ||
91 | |||
92 | return 0; | ||
93 | } | ||
94 | |||
95 | static int erase_whole_device(void) | ||
96 | { | ||
97 | int err; | ||
98 | unsigned int i; | ||
99 | |||
100 | printk(PRINT_PREF "erasing whole device\n"); | ||
101 | for (i = 0; i < ebcnt; ++i) { | ||
102 | if (bbt[i]) | ||
103 | continue; | ||
104 | err = erase_eraseblock(i); | ||
105 | if (err) | ||
106 | return err; | ||
107 | cond_resched(); | ||
108 | } | ||
109 | printk(PRINT_PREF "erased %u eraseblocks\n", i); | ||
110 | return 0; | ||
111 | } | ||
112 | |||
113 | static void do_vary_offset(void) | ||
114 | { | ||
115 | use_len -= 1; | ||
116 | if (use_len < 1) { | ||
117 | use_offset += 1; | ||
118 | if (use_offset >= use_len_max) | ||
119 | use_offset = 0; | ||
120 | use_len = use_len_max - use_offset; | ||
121 | } | ||
122 | } | ||
123 | |||
124 | static int write_eraseblock(int ebnum) | ||
125 | { | ||
126 | int i; | ||
127 | struct mtd_oob_ops ops; | ||
128 | int err = 0; | ||
129 | loff_t addr = ebnum * mtd->erasesize; | ||
130 | |||
131 | for (i = 0; i < pgcnt; ++i, addr += mtd->writesize) { | ||
132 | set_random_data(writebuf, use_len); | ||
133 | ops.mode = MTD_OOB_AUTO; | ||
134 | ops.len = 0; | ||
135 | ops.retlen = 0; | ||
136 | ops.ooblen = use_len; | ||
137 | ops.oobretlen = 0; | ||
138 | ops.ooboffs = use_offset; | ||
139 | ops.datbuf = 0; | ||
140 | ops.oobbuf = writebuf; | ||
141 | err = mtd->write_oob(mtd, addr, &ops); | ||
142 | if (err || ops.oobretlen != use_len) { | ||
143 | printk(PRINT_PREF "error: writeoob failed at %#llx\n", | ||
144 | (long long)addr); | ||
145 | printk(PRINT_PREF "error: use_len %d, use_offset %d\n", | ||
146 | use_len, use_offset); | ||
147 | errcnt += 1; | ||
148 | return err ? err : -1; | ||
149 | } | ||
150 | if (vary_offset) | ||
151 | do_vary_offset(); | ||
152 | } | ||
153 | |||
154 | return err; | ||
155 | } | ||
156 | |||
157 | static int write_whole_device(void) | ||
158 | { | ||
159 | int err; | ||
160 | unsigned int i; | ||
161 | |||
162 | printk(PRINT_PREF "writing OOBs of whole device\n"); | ||
163 | for (i = 0; i < ebcnt; ++i) { | ||
164 | if (bbt[i]) | ||
165 | continue; | ||
166 | err = write_eraseblock(i); | ||
167 | if (err) | ||
168 | return err; | ||
169 | if (i % 256 == 0) | ||
170 | printk(PRINT_PREF "written up to eraseblock %u\n", i); | ||
171 | cond_resched(); | ||
172 | } | ||
173 | printk(PRINT_PREF "written %u eraseblocks\n", i); | ||
174 | return 0; | ||
175 | } | ||
176 | |||
177 | static int verify_eraseblock(int ebnum) | ||
178 | { | ||
179 | int i; | ||
180 | struct mtd_oob_ops ops; | ||
181 | int err = 0; | ||
182 | loff_t addr = ebnum * mtd->erasesize; | ||
183 | |||
184 | for (i = 0; i < pgcnt; ++i, addr += mtd->writesize) { | ||
185 | set_random_data(writebuf, use_len); | ||
186 | ops.mode = MTD_OOB_AUTO; | ||
187 | ops.len = 0; | ||
188 | ops.retlen = 0; | ||
189 | ops.ooblen = use_len; | ||
190 | ops.oobretlen = 0; | ||
191 | ops.ooboffs = use_offset; | ||
192 | ops.datbuf = 0; | ||
193 | ops.oobbuf = readbuf; | ||
194 | err = mtd->read_oob(mtd, addr, &ops); | ||
195 | if (err || ops.oobretlen != use_len) { | ||
196 | printk(PRINT_PREF "error: readoob failed at %#llx\n", | ||
197 | (long long)addr); | ||
198 | errcnt += 1; | ||
199 | return err ? err : -1; | ||
200 | } | ||
201 | if (memcmp(readbuf, writebuf, use_len)) { | ||
202 | printk(PRINT_PREF "error: verify failed at %#llx\n", | ||
203 | (long long)addr); | ||
204 | errcnt += 1; | ||
205 | if (errcnt > 1000) { | ||
206 | printk(PRINT_PREF "error: too many errors\n"); | ||
207 | return -1; | ||
208 | } | ||
209 | } | ||
210 | if (use_offset != 0 || use_len < mtd->ecclayout->oobavail) { | ||
211 | int k; | ||
212 | |||
213 | ops.mode = MTD_OOB_AUTO; | ||
214 | ops.len = 0; | ||
215 | ops.retlen = 0; | ||
216 | ops.ooblen = mtd->ecclayout->oobavail; | ||
217 | ops.oobretlen = 0; | ||
218 | ops.ooboffs = 0; | ||
219 | ops.datbuf = 0; | ||
220 | ops.oobbuf = readbuf; | ||
221 | err = mtd->read_oob(mtd, addr, &ops); | ||
222 | if (err || ops.oobretlen != mtd->ecclayout->oobavail) { | ||
223 | printk(PRINT_PREF "error: readoob failed at " | ||
224 | "%#llx\n", (long long)addr); | ||
225 | errcnt += 1; | ||
226 | return err ? err : -1; | ||
227 | } | ||
228 | if (memcmp(readbuf + use_offset, writebuf, use_len)) { | ||
229 | printk(PRINT_PREF "error: verify failed at " | ||
230 | "%#llx\n", (long long)addr); | ||
231 | errcnt += 1; | ||
232 | if (errcnt > 1000) { | ||
233 | printk(PRINT_PREF "error: too many " | ||
234 | "errors\n"); | ||
235 | return -1; | ||
236 | } | ||
237 | } | ||
238 | for (k = 0; k < use_offset; ++k) | ||
239 | if (readbuf[k] != 0xff) { | ||
240 | printk(PRINT_PREF "error: verify 0xff " | ||
241 | "failed at %#llx\n", | ||
242 | (long long)addr); | ||
243 | errcnt += 1; | ||
244 | if (errcnt > 1000) { | ||
245 | printk(PRINT_PREF "error: too " | ||
246 | "many errors\n"); | ||
247 | return -1; | ||
248 | } | ||
249 | } | ||
250 | for (k = use_offset + use_len; | ||
251 | k < mtd->ecclayout->oobavail; ++k) | ||
252 | if (readbuf[k] != 0xff) { | ||
253 | printk(PRINT_PREF "error: verify 0xff " | ||
254 | "failed at %#llx\n", | ||
255 | (long long)addr); | ||
256 | errcnt += 1; | ||
257 | if (errcnt > 1000) { | ||
258 | printk(PRINT_PREF "error: too " | ||
259 | "many errors\n"); | ||
260 | return -1; | ||
261 | } | ||
262 | } | ||
263 | } | ||
264 | if (vary_offset) | ||
265 | do_vary_offset(); | ||
266 | } | ||
267 | return err; | ||
268 | } | ||
269 | |||
270 | static int verify_eraseblock_in_one_go(int ebnum) | ||
271 | { | ||
272 | struct mtd_oob_ops ops; | ||
273 | int err = 0; | ||
274 | loff_t addr = ebnum * mtd->erasesize; | ||
275 | size_t len = mtd->ecclayout->oobavail * pgcnt; | ||
276 | |||
277 | set_random_data(writebuf, len); | ||
278 | ops.mode = MTD_OOB_AUTO; | ||
279 | ops.len = 0; | ||
280 | ops.retlen = 0; | ||
281 | ops.ooblen = len; | ||
282 | ops.oobretlen = 0; | ||
283 | ops.ooboffs = 0; | ||
284 | ops.datbuf = 0; | ||
285 | ops.oobbuf = readbuf; | ||
286 | err = mtd->read_oob(mtd, addr, &ops); | ||
287 | if (err || ops.oobretlen != len) { | ||
288 | printk(PRINT_PREF "error: readoob failed at %#llx\n", | ||
289 | (long long)addr); | ||
290 | errcnt += 1; | ||
291 | return err ? err : -1; | ||
292 | } | ||
293 | if (memcmp(readbuf, writebuf, len)) { | ||
294 | printk(PRINT_PREF "error: verify failed at %#llx\n", | ||
295 | (long long)addr); | ||
296 | errcnt += 1; | ||
297 | if (errcnt > 1000) { | ||
298 | printk(PRINT_PREF "error: too many errors\n"); | ||
299 | return -1; | ||
300 | } | ||
301 | } | ||
302 | |||
303 | return err; | ||
304 | } | ||
305 | |||
306 | static int verify_all_eraseblocks(void) | ||
307 | { | ||
308 | int err; | ||
309 | unsigned int i; | ||
310 | |||
311 | printk(PRINT_PREF "verifying all eraseblocks\n"); | ||
312 | for (i = 0; i < ebcnt; ++i) { | ||
313 | if (bbt[i]) | ||
314 | continue; | ||
315 | err = verify_eraseblock(i); | ||
316 | if (err) | ||
317 | return err; | ||
318 | if (i % 256 == 0) | ||
319 | printk(PRINT_PREF "verified up to eraseblock %u\n", i); | ||
320 | cond_resched(); | ||
321 | } | ||
322 | printk(PRINT_PREF "verified %u eraseblocks\n", i); | ||
323 | return 0; | ||
324 | } | ||
325 | |||
326 | static int is_block_bad(int ebnum) | ||
327 | { | ||
328 | int ret; | ||
329 | loff_t addr = ebnum * mtd->erasesize; | ||
330 | |||
331 | ret = mtd->block_isbad(mtd, addr); | ||
332 | if (ret) | ||
333 | printk(PRINT_PREF "block %d is bad\n", ebnum); | ||
334 | return ret; | ||
335 | } | ||
336 | |||
337 | static int scan_for_bad_eraseblocks(void) | ||
338 | { | ||
339 | int i, bad = 0; | ||
340 | |||
341 | bbt = kmalloc(ebcnt, GFP_KERNEL); | ||
342 | if (!bbt) { | ||
343 | printk(PRINT_PREF "error: cannot allocate memory\n"); | ||
344 | return -ENOMEM; | ||
345 | } | ||
346 | memset(bbt, 0 , ebcnt); | ||
347 | |||
348 | printk(PRINT_PREF "scanning for bad eraseblocks\n"); | ||
349 | for (i = 0; i < ebcnt; ++i) { | ||
350 | bbt[i] = is_block_bad(i) ? 1 : 0; | ||
351 | if (bbt[i]) | ||
352 | bad += 1; | ||
353 | cond_resched(); | ||
354 | } | ||
355 | printk(PRINT_PREF "scanned %d eraseblocks, %d are bad\n", i, bad); | ||
356 | return 0; | ||
357 | } | ||
358 | |||
359 | static int __init mtd_oobtest_init(void) | ||
360 | { | ||
361 | int err = 0; | ||
362 | unsigned int i; | ||
363 | uint64_t tmp; | ||
364 | struct mtd_oob_ops ops; | ||
365 | loff_t addr = 0, addr0; | ||
366 | |||
367 | printk(KERN_INFO "\n"); | ||
368 | printk(KERN_INFO "=================================================\n"); | ||
369 | printk(PRINT_PREF "MTD device: %d\n", dev); | ||
370 | |||
371 | mtd = get_mtd_device(NULL, dev); | ||
372 | if (IS_ERR(mtd)) { | ||
373 | err = PTR_ERR(mtd); | ||
374 | printk(PRINT_PREF "error: cannot get MTD device\n"); | ||
375 | return err; | ||
376 | } | ||
377 | |||
378 | if (mtd->type != MTD_NANDFLASH) { | ||
379 | printk(PRINT_PREF "this test requires NAND flash\n"); | ||
380 | goto out; | ||
381 | } | ||
382 | |||
383 | tmp = mtd->size; | ||
384 | do_div(tmp, mtd->erasesize); | ||
385 | ebcnt = tmp; | ||
386 | pgcnt = mtd->erasesize / mtd->writesize; | ||
387 | |||
388 | printk(PRINT_PREF "MTD device size %llu, eraseblock size %u, " | ||
389 | "page size %u, count of eraseblocks %u, pages per " | ||
390 | "eraseblock %u, OOB size %u\n", | ||
391 | (unsigned long long)mtd->size, mtd->erasesize, | ||
392 | mtd->writesize, ebcnt, pgcnt, mtd->oobsize); | ||
393 | |||
394 | err = -ENOMEM; | ||
395 | mtd->erasesize = mtd->erasesize; | ||
396 | readbuf = kmalloc(mtd->erasesize, GFP_KERNEL); | ||
397 | if (!readbuf) { | ||
398 | printk(PRINT_PREF "error: cannot allocate memory\n"); | ||
399 | goto out; | ||
400 | } | ||
401 | writebuf = kmalloc(mtd->erasesize, GFP_KERNEL); | ||
402 | if (!writebuf) { | ||
403 | printk(PRINT_PREF "error: cannot allocate memory\n"); | ||
404 | goto out; | ||
405 | } | ||
406 | |||
407 | err = scan_for_bad_eraseblocks(); | ||
408 | if (err) | ||
409 | goto out; | ||
410 | |||
411 | use_offset = 0; | ||
412 | use_len = mtd->ecclayout->oobavail; | ||
413 | use_len_max = mtd->ecclayout->oobavail; | ||
414 | vary_offset = 0; | ||
415 | |||
416 | /* First test: write all OOB, read it back and verify */ | ||
417 | printk(PRINT_PREF "test 1 of 5\n"); | ||
418 | |||
419 | err = erase_whole_device(); | ||
420 | if (err) | ||
421 | goto out; | ||
422 | |||
423 | simple_srand(1); | ||
424 | err = write_whole_device(); | ||
425 | if (err) | ||
426 | goto out; | ||
427 | |||
428 | simple_srand(1); | ||
429 | err = verify_all_eraseblocks(); | ||
430 | if (err) | ||
431 | goto out; | ||
432 | |||
433 | /* | ||
434 | * Second test: write all OOB, a block at a time, read it back and | ||
435 | * verify. | ||
436 | */ | ||
437 | printk(PRINT_PREF "test 2 of 5\n"); | ||
438 | |||
439 | err = erase_whole_device(); | ||
440 | if (err) | ||
441 | goto out; | ||
442 | |||
443 | simple_srand(3); | ||
444 | err = write_whole_device(); | ||
445 | if (err) | ||
446 | goto out; | ||
447 | |||
448 | /* Check all eraseblocks */ | ||
449 | simple_srand(3); | ||
450 | printk(PRINT_PREF "verifying all eraseblocks\n"); | ||
451 | for (i = 0; i < ebcnt; ++i) { | ||
452 | if (bbt[i]) | ||
453 | continue; | ||
454 | err = verify_eraseblock_in_one_go(i); | ||
455 | if (err) | ||
456 | goto out; | ||
457 | if (i % 256 == 0) | ||
458 | printk(PRINT_PREF "verified up to eraseblock %u\n", i); | ||
459 | cond_resched(); | ||
460 | } | ||
461 | printk(PRINT_PREF "verified %u eraseblocks\n", i); | ||
462 | |||
463 | /* | ||
464 | * Third test: write OOB at varying offsets and lengths, read it back | ||
465 | * and verify. | ||
466 | */ | ||
467 | printk(PRINT_PREF "test 3 of 5\n"); | ||
468 | |||
469 | err = erase_whole_device(); | ||
470 | if (err) | ||
471 | goto out; | ||
472 | |||
473 | /* Write all eraseblocks */ | ||
474 | use_offset = 0; | ||
475 | use_len = mtd->ecclayout->oobavail; | ||
476 | use_len_max = mtd->ecclayout->oobavail; | ||
477 | vary_offset = 1; | ||
478 | simple_srand(5); | ||
479 | printk(PRINT_PREF "writing OOBs of whole device\n"); | ||
480 | for (i = 0; i < ebcnt; ++i) { | ||
481 | if (bbt[i]) | ||
482 | continue; | ||
483 | err = write_eraseblock(i); | ||
484 | if (err) | ||
485 | goto out; | ||
486 | if (i % 256 == 0) | ||
487 | printk(PRINT_PREF "written up to eraseblock %u\n", i); | ||
488 | cond_resched(); | ||
489 | } | ||
490 | printk(PRINT_PREF "written %u eraseblocks\n", i); | ||
491 | |||
492 | /* Check all eraseblocks */ | ||
493 | use_offset = 0; | ||
494 | use_len = mtd->ecclayout->oobavail; | ||
495 | use_len_max = mtd->ecclayout->oobavail; | ||
496 | vary_offset = 1; | ||
497 | simple_srand(5); | ||
498 | err = verify_all_eraseblocks(); | ||
499 | if (err) | ||
500 | goto out; | ||
501 | |||
502 | use_offset = 0; | ||
503 | use_len = mtd->ecclayout->oobavail; | ||
504 | use_len_max = mtd->ecclayout->oobavail; | ||
505 | vary_offset = 0; | ||
506 | |||
507 | /* Fourth test: try to write off end of device */ | ||
508 | printk(PRINT_PREF "test 4 of 5\n"); | ||
509 | |||
510 | err = erase_whole_device(); | ||
511 | if (err) | ||
512 | goto out; | ||
513 | |||
514 | addr0 = 0; | ||
515 | for (i = 0; bbt[i] && i < ebcnt; ++i) | ||
516 | addr0 += mtd->erasesize; | ||
517 | |||
518 | /* Attempt to write off end of OOB */ | ||
519 | ops.mode = MTD_OOB_AUTO; | ||
520 | ops.len = 0; | ||
521 | ops.retlen = 0; | ||
522 | ops.ooblen = 1; | ||
523 | ops.oobretlen = 0; | ||
524 | ops.ooboffs = mtd->ecclayout->oobavail; | ||
525 | ops.datbuf = 0; | ||
526 | ops.oobbuf = writebuf; | ||
527 | printk(PRINT_PREF "attempting to start write past end of OOB\n"); | ||
528 | printk(PRINT_PREF "an error is expected...\n"); | ||
529 | err = mtd->write_oob(mtd, addr0, &ops); | ||
530 | if (err) { | ||
531 | printk(PRINT_PREF "error occurred as expected\n"); | ||
532 | err = 0; | ||
533 | } else { | ||
534 | printk(PRINT_PREF "error: can write past end of OOB\n"); | ||
535 | errcnt += 1; | ||
536 | } | ||
537 | |||
538 | /* Attempt to read off end of OOB */ | ||
539 | ops.mode = MTD_OOB_AUTO; | ||
540 | ops.len = 0; | ||
541 | ops.retlen = 0; | ||
542 | ops.ooblen = 1; | ||
543 | ops.oobretlen = 0; | ||
544 | ops.ooboffs = mtd->ecclayout->oobavail; | ||
545 | ops.datbuf = 0; | ||
546 | ops.oobbuf = readbuf; | ||
547 | printk(PRINT_PREF "attempting to start read past end of OOB\n"); | ||
548 | printk(PRINT_PREF "an error is expected...\n"); | ||
549 | err = mtd->read_oob(mtd, addr0, &ops); | ||
550 | if (err) { | ||
551 | printk(PRINT_PREF "error occurred as expected\n"); | ||
552 | err = 0; | ||
553 | } else { | ||
554 | printk(PRINT_PREF "error: can read past end of OOB\n"); | ||
555 | errcnt += 1; | ||
556 | } | ||
557 | |||
558 | if (bbt[ebcnt - 1]) | ||
559 | printk(PRINT_PREF "skipping end of device tests because last " | ||
560 | "block is bad\n"); | ||
561 | else { | ||
562 | /* Attempt to write off end of device */ | ||
563 | ops.mode = MTD_OOB_AUTO; | ||
564 | ops.len = 0; | ||
565 | ops.retlen = 0; | ||
566 | ops.ooblen = mtd->ecclayout->oobavail + 1; | ||
567 | ops.oobretlen = 0; | ||
568 | ops.ooboffs = 0; | ||
569 | ops.datbuf = 0; | ||
570 | ops.oobbuf = writebuf; | ||
571 | printk(PRINT_PREF "attempting to write past end of device\n"); | ||
572 | printk(PRINT_PREF "an error is expected...\n"); | ||
573 | err = mtd->write_oob(mtd, mtd->size - mtd->writesize, &ops); | ||
574 | if (err) { | ||
575 | printk(PRINT_PREF "error occurred as expected\n"); | ||
576 | err = 0; | ||
577 | } else { | ||
578 | printk(PRINT_PREF "error: wrote past end of device\n"); | ||
579 | errcnt += 1; | ||
580 | } | ||
581 | |||
582 | /* Attempt to read off end of device */ | ||
583 | ops.mode = MTD_OOB_AUTO; | ||
584 | ops.len = 0; | ||
585 | ops.retlen = 0; | ||
586 | ops.ooblen = mtd->ecclayout->oobavail + 1; | ||
587 | ops.oobretlen = 0; | ||
588 | ops.ooboffs = 0; | ||
589 | ops.datbuf = 0; | ||
590 | ops.oobbuf = readbuf; | ||
591 | printk(PRINT_PREF "attempting to read past end of device\n"); | ||
592 | printk(PRINT_PREF "an error is expected...\n"); | ||
593 | err = mtd->read_oob(mtd, mtd->size - mtd->writesize, &ops); | ||
594 | if (err) { | ||
595 | printk(PRINT_PREF "error occurred as expected\n"); | ||
596 | err = 0; | ||
597 | } else { | ||
598 | printk(PRINT_PREF "error: read past end of device\n"); | ||
599 | errcnt += 1; | ||
600 | } | ||
601 | |||
602 | err = erase_eraseblock(ebcnt - 1); | ||
603 | if (err) | ||
604 | goto out; | ||
605 | |||
606 | /* Attempt to write off end of device */ | ||
607 | ops.mode = MTD_OOB_AUTO; | ||
608 | ops.len = 0; | ||
609 | ops.retlen = 0; | ||
610 | ops.ooblen = mtd->ecclayout->oobavail; | ||
611 | ops.oobretlen = 0; | ||
612 | ops.ooboffs = 1; | ||
613 | ops.datbuf = 0; | ||
614 | ops.oobbuf = writebuf; | ||
615 | printk(PRINT_PREF "attempting to write past end of device\n"); | ||
616 | printk(PRINT_PREF "an error is expected...\n"); | ||
617 | err = mtd->write_oob(mtd, mtd->size - mtd->writesize, &ops); | ||
618 | if (err) { | ||
619 | printk(PRINT_PREF "error occurred as expected\n"); | ||
620 | err = 0; | ||
621 | } else { | ||
622 | printk(PRINT_PREF "error: wrote past end of device\n"); | ||
623 | errcnt += 1; | ||
624 | } | ||
625 | |||
626 | /* Attempt to read off end of device */ | ||
627 | ops.mode = MTD_OOB_AUTO; | ||
628 | ops.len = 0; | ||
629 | ops.retlen = 0; | ||
630 | ops.ooblen = mtd->ecclayout->oobavail; | ||
631 | ops.oobretlen = 0; | ||
632 | ops.ooboffs = 1; | ||
633 | ops.datbuf = 0; | ||
634 | ops.oobbuf = readbuf; | ||
635 | printk(PRINT_PREF "attempting to read past end of device\n"); | ||
636 | printk(PRINT_PREF "an error is expected...\n"); | ||
637 | err = mtd->read_oob(mtd, mtd->size - mtd->writesize, &ops); | ||
638 | if (err) { | ||
639 | printk(PRINT_PREF "error occurred as expected\n"); | ||
640 | err = 0; | ||
641 | } else { | ||
642 | printk(PRINT_PREF "error: read past end of device\n"); | ||
643 | errcnt += 1; | ||
644 | } | ||
645 | } | ||
646 | |||
647 | /* Fifth test: write / read across block boundaries */ | ||
648 | printk(PRINT_PREF "test 5 of 5\n"); | ||
649 | |||
650 | /* Erase all eraseblocks */ | ||
651 | err = erase_whole_device(); | ||
652 | if (err) | ||
653 | goto out; | ||
654 | |||
655 | /* Write all eraseblocks */ | ||
656 | simple_srand(11); | ||
657 | printk(PRINT_PREF "writing OOBs of whole device\n"); | ||
658 | for (i = 0; i < ebcnt - 1; ++i) { | ||
659 | int cnt = 2; | ||
660 | int pg; | ||
661 | size_t sz = mtd->ecclayout->oobavail; | ||
662 | if (bbt[i] || bbt[i + 1]) | ||
663 | continue; | ||
664 | addr = (i + 1) * mtd->erasesize - mtd->writesize; | ||
665 | for (pg = 0; pg < cnt; ++pg) { | ||
666 | set_random_data(writebuf, sz); | ||
667 | ops.mode = MTD_OOB_AUTO; | ||
668 | ops.len = 0; | ||
669 | ops.retlen = 0; | ||
670 | ops.ooblen = sz; | ||
671 | ops.oobretlen = 0; | ||
672 | ops.ooboffs = 0; | ||
673 | ops.datbuf = 0; | ||
674 | ops.oobbuf = writebuf; | ||
675 | err = mtd->write_oob(mtd, addr, &ops); | ||
676 | if (err) | ||
677 | goto out; | ||
678 | if (i % 256 == 0) | ||
679 | printk(PRINT_PREF "written up to eraseblock " | ||
680 | "%u\n", i); | ||
681 | cond_resched(); | ||
682 | addr += mtd->writesize; | ||
683 | } | ||
684 | } | ||
685 | printk(PRINT_PREF "written %u eraseblocks\n", i); | ||
686 | |||
687 | /* Check all eraseblocks */ | ||
688 | simple_srand(11); | ||
689 | printk(PRINT_PREF "verifying all eraseblocks\n"); | ||
690 | for (i = 0; i < ebcnt - 1; ++i) { | ||
691 | if (bbt[i] || bbt[i + 1]) | ||
692 | continue; | ||
693 | set_random_data(writebuf, mtd->ecclayout->oobavail * 2); | ||
694 | addr = (i + 1) * mtd->erasesize - mtd->writesize; | ||
695 | ops.mode = MTD_OOB_AUTO; | ||
696 | ops.len = 0; | ||
697 | ops.retlen = 0; | ||
698 | ops.ooblen = mtd->ecclayout->oobavail * 2; | ||
699 | ops.oobretlen = 0; | ||
700 | ops.ooboffs = 0; | ||
701 | ops.datbuf = 0; | ||
702 | ops.oobbuf = readbuf; | ||
703 | err = mtd->read_oob(mtd, addr, &ops); | ||
704 | if (err) | ||
705 | goto out; | ||
706 | if (memcmp(readbuf, writebuf, mtd->ecclayout->oobavail * 2)) { | ||
707 | printk(PRINT_PREF "error: verify failed at %#llx\n", | ||
708 | (long long)addr); | ||
709 | errcnt += 1; | ||
710 | if (errcnt > 1000) { | ||
711 | printk(PRINT_PREF "error: too many errors\n"); | ||
712 | goto out; | ||
713 | } | ||
714 | } | ||
715 | if (i % 256 == 0) | ||
716 | printk(PRINT_PREF "verified up to eraseblock %u\n", i); | ||
717 | cond_resched(); | ||
718 | } | ||
719 | printk(PRINT_PREF "verified %u eraseblocks\n", i); | ||
720 | |||
721 | printk(PRINT_PREF "finished with %d errors\n", errcnt); | ||
722 | out: | ||
723 | kfree(bbt); | ||
724 | kfree(writebuf); | ||
725 | kfree(readbuf); | ||
726 | put_mtd_device(mtd); | ||
727 | if (err) | ||
728 | printk(PRINT_PREF "error %d occurred\n", err); | ||
729 | printk(KERN_INFO "=================================================\n"); | ||
730 | return err; | ||
731 | } | ||
732 | module_init(mtd_oobtest_init); | ||
733 | |||
734 | static void __exit mtd_oobtest_exit(void) | ||
735 | { | ||
736 | return; | ||
737 | } | ||
738 | module_exit(mtd_oobtest_exit); | ||
739 | |||
740 | MODULE_DESCRIPTION("Out-of-band test module"); | ||
741 | MODULE_AUTHOR("Adrian Hunter"); | ||
742 | MODULE_LICENSE("GPL"); | ||
diff --git a/drivers/mtd/tests/mtd_pagetest.c b/drivers/mtd/tests/mtd_pagetest.c new file mode 100644 index 000000000000..9648818b9e2c --- /dev/null +++ b/drivers/mtd/tests/mtd_pagetest.c | |||
@@ -0,0 +1,632 @@ | |||
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 | |||
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/sched.h> | ||
29 | |||
30 | #define PRINT_PREF KERN_INFO "mtd_pagetest: " | ||
31 | |||
32 | static int dev; | ||
33 | module_param(dev, int, S_IRUGO); | ||
34 | MODULE_PARM_DESC(dev, "MTD device number to use"); | ||
35 | |||
36 | static struct mtd_info *mtd; | ||
37 | static unsigned char *twopages; | ||
38 | static unsigned char *writebuf; | ||
39 | static unsigned char *boundary; | ||
40 | static unsigned char *bbt; | ||
41 | |||
42 | static int pgsize; | ||
43 | static int bufsize; | ||
44 | static int ebcnt; | ||
45 | static int pgcnt; | ||
46 | static int errcnt; | ||
47 | static unsigned long next = 1; | ||
48 | |||
49 | static inline unsigned int simple_rand(void) | ||
50 | { | ||
51 | next = next * 1103515245 + 12345; | ||
52 | return (unsigned int)((next / 65536) % 32768); | ||
53 | } | ||
54 | |||
55 | static inline void simple_srand(unsigned long seed) | ||
56 | { | ||
57 | next = seed; | ||
58 | } | ||
59 | |||
60 | static void set_random_data(unsigned char *buf, size_t len) | ||
61 | { | ||
62 | size_t i; | ||
63 | |||
64 | for (i = 0; i < len; ++i) | ||
65 | buf[i] = simple_rand(); | ||
66 | } | ||
67 | |||
68 | static int erase_eraseblock(int ebnum) | ||
69 | { | ||
70 | int err; | ||
71 | struct erase_info ei; | ||
72 | loff_t addr = ebnum * mtd->erasesize; | ||
73 | |||
74 | memset(&ei, 0, sizeof(struct erase_info)); | ||
75 | ei.mtd = mtd; | ||
76 | ei.addr = addr; | ||
77 | ei.len = mtd->erasesize; | ||
78 | |||
79 | err = mtd->erase(mtd, &ei); | ||
80 | if (err) { | ||
81 | printk(PRINT_PREF "error %d while erasing EB %d\n", err, ebnum); | ||
82 | return err; | ||
83 | } | ||
84 | |||
85 | if (ei.state == MTD_ERASE_FAILED) { | ||
86 | printk(PRINT_PREF "some erase error occurred at EB %d\n", | ||
87 | ebnum); | ||
88 | return -EIO; | ||
89 | } | ||
90 | |||
91 | return 0; | ||
92 | } | ||
93 | |||
94 | static int write_eraseblock(int ebnum) | ||
95 | { | ||
96 | int err = 0; | ||
97 | size_t written = 0; | ||
98 | loff_t addr = ebnum * mtd->erasesize; | ||
99 | |||
100 | set_random_data(writebuf, mtd->erasesize); | ||
101 | cond_resched(); | ||
102 | err = mtd->write(mtd, addr, mtd->erasesize, &written, writebuf); | ||
103 | if (err || written != mtd->erasesize) | ||
104 | printk(PRINT_PREF "error: write failed at %#llx\n", | ||
105 | (long long)addr); | ||
106 | |||
107 | return err; | ||
108 | } | ||
109 | |||
110 | static int verify_eraseblock(int ebnum) | ||
111 | { | ||
112 | uint32_t j; | ||
113 | size_t read = 0; | ||
114 | int err = 0, i; | ||
115 | loff_t addr0, addrn; | ||
116 | loff_t addr = ebnum * mtd->erasesize; | ||
117 | |||
118 | addr0 = 0; | ||
119 | for (i = 0; bbt[i] && i < ebcnt; ++i) | ||
120 | addr0 += mtd->erasesize; | ||
121 | |||
122 | addrn = mtd->size; | ||
123 | for (i = 0; bbt[ebcnt - i - 1] && i < ebcnt; ++i) | ||
124 | addrn -= mtd->erasesize; | ||
125 | |||
126 | set_random_data(writebuf, mtd->erasesize); | ||
127 | for (j = 0; j < pgcnt - 1; ++j, addr += pgsize) { | ||
128 | /* Do a read to set the internal dataRAMs to different data */ | ||
129 | err = mtd->read(mtd, addr0, bufsize, &read, twopages); | ||
130 | if (err == -EUCLEAN) | ||
131 | err = 0; | ||
132 | if (err || read != bufsize) { | ||
133 | printk(PRINT_PREF "error: read failed at %#llx\n", | ||
134 | (long long)addr0); | ||
135 | return err; | ||
136 | } | ||
137 | err = mtd->read(mtd, addrn - bufsize, bufsize, &read, twopages); | ||
138 | if (err == -EUCLEAN) | ||
139 | err = 0; | ||
140 | if (err || read != bufsize) { | ||
141 | printk(PRINT_PREF "error: read failed at %#llx\n", | ||
142 | (long long)(addrn - bufsize)); | ||
143 | return err; | ||
144 | } | ||
145 | memset(twopages, 0, bufsize); | ||
146 | read = 0; | ||
147 | err = mtd->read(mtd, addr, bufsize, &read, twopages); | ||
148 | if (err == -EUCLEAN) | ||
149 | err = 0; | ||
150 | if (err || read != bufsize) { | ||
151 | printk(PRINT_PREF "error: read failed at %#llx\n", | ||
152 | (long long)addr); | ||
153 | break; | ||
154 | } | ||
155 | if (memcmp(twopages, writebuf + (j * pgsize), bufsize)) { | ||
156 | printk(PRINT_PREF "error: verify failed at %#llx\n", | ||
157 | (long long)addr); | ||
158 | errcnt += 1; | ||
159 | } | ||
160 | } | ||
161 | /* Check boundary between eraseblocks */ | ||
162 | if (addr <= addrn - pgsize - pgsize && !bbt[ebnum + 1]) { | ||
163 | unsigned long oldnext = next; | ||
164 | /* Do a read to set the internal dataRAMs to different data */ | ||
165 | err = mtd->read(mtd, addr0, bufsize, &read, twopages); | ||
166 | if (err == -EUCLEAN) | ||
167 | err = 0; | ||
168 | if (err || read != bufsize) { | ||
169 | printk(PRINT_PREF "error: read failed at %#llx\n", | ||
170 | (long long)addr0); | ||
171 | return err; | ||
172 | } | ||
173 | err = mtd->read(mtd, addrn - bufsize, bufsize, &read, twopages); | ||
174 | if (err == -EUCLEAN) | ||
175 | err = 0; | ||
176 | if (err || read != bufsize) { | ||
177 | printk(PRINT_PREF "error: read failed at %#llx\n", | ||
178 | (long long)(addrn - bufsize)); | ||
179 | return err; | ||
180 | } | ||
181 | memset(twopages, 0, bufsize); | ||
182 | read = 0; | ||
183 | err = mtd->read(mtd, addr, bufsize, &read, twopages); | ||
184 | if (err == -EUCLEAN) | ||
185 | err = 0; | ||
186 | if (err || read != bufsize) { | ||
187 | printk(PRINT_PREF "error: read failed at %#llx\n", | ||
188 | (long long)addr); | ||
189 | return err; | ||
190 | } | ||
191 | memcpy(boundary, writebuf + mtd->erasesize - pgsize, pgsize); | ||
192 | set_random_data(boundary + pgsize, pgsize); | ||
193 | if (memcmp(twopages, boundary, bufsize)) { | ||
194 | printk(PRINT_PREF "error: verify failed at %#llx\n", | ||
195 | (long long)addr); | ||
196 | errcnt += 1; | ||
197 | } | ||
198 | next = oldnext; | ||
199 | } | ||
200 | return err; | ||
201 | } | ||
202 | |||
203 | static int crosstest(void) | ||
204 | { | ||
205 | size_t read = 0; | ||
206 | int err = 0, i; | ||
207 | loff_t addr, addr0, addrn; | ||
208 | unsigned char *pp1, *pp2, *pp3, *pp4; | ||
209 | |||
210 | printk(PRINT_PREF "crosstest\n"); | ||
211 | pp1 = kmalloc(pgsize * 4, GFP_KERNEL); | ||
212 | if (!pp1) { | ||
213 | printk(PRINT_PREF "error: cannot allocate memory\n"); | ||
214 | return -ENOMEM; | ||
215 | } | ||
216 | pp2 = pp1 + pgsize; | ||
217 | pp3 = pp2 + pgsize; | ||
218 | pp4 = pp3 + pgsize; | ||
219 | memset(pp1, 0, pgsize * 4); | ||
220 | |||
221 | addr0 = 0; | ||
222 | for (i = 0; bbt[i] && i < ebcnt; ++i) | ||
223 | addr0 += mtd->erasesize; | ||
224 | |||
225 | addrn = mtd->size; | ||
226 | for (i = 0; bbt[ebcnt - i - 1] && i < ebcnt; ++i) | ||
227 | addrn -= mtd->erasesize; | ||
228 | |||
229 | /* Read 2nd-to-last page to pp1 */ | ||
230 | read = 0; | ||
231 | addr = addrn - pgsize - pgsize; | ||
232 | err = mtd->read(mtd, addr, pgsize, &read, pp1); | ||
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 | |||
242 | /* Read 3rd-to-last page to pp1 */ | ||
243 | read = 0; | ||
244 | addr = addrn - pgsize - pgsize - pgsize; | ||
245 | err = mtd->read(mtd, addr, pgsize, &read, pp1); | ||
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 | |||
255 | /* Read first page to pp2 */ | ||
256 | read = 0; | ||
257 | addr = addr0; | ||
258 | printk(PRINT_PREF "reading page at %#llx\n", (long long)addr); | ||
259 | err = mtd->read(mtd, addr, pgsize, &read, pp2); | ||
260 | if (err == -EUCLEAN) | ||
261 | err = 0; | ||
262 | if (err || read != pgsize) { | ||
263 | printk(PRINT_PREF "error: read failed at %#llx\n", | ||
264 | (long long)addr); | ||
265 | kfree(pp1); | ||
266 | return err; | ||
267 | } | ||
268 | |||
269 | /* Read last page to pp3 */ | ||
270 | read = 0; | ||
271 | addr = addrn - pgsize; | ||
272 | printk(PRINT_PREF "reading page at %#llx\n", (long long)addr); | ||
273 | err = mtd->read(mtd, addr, pgsize, &read, pp3); | ||
274 | if (err == -EUCLEAN) | ||
275 | err = 0; | ||
276 | if (err || read != pgsize) { | ||
277 | printk(PRINT_PREF "error: read failed at %#llx\n", | ||
278 | (long long)addr); | ||
279 | kfree(pp1); | ||
280 | return err; | ||
281 | } | ||
282 | |||
283 | /* Read first page again to pp4 */ | ||
284 | read = 0; | ||
285 | addr = addr0; | ||
286 | printk(PRINT_PREF "reading page at %#llx\n", (long long)addr); | ||
287 | err = mtd->read(mtd, addr, pgsize, &read, pp4); | ||
288 | if (err == -EUCLEAN) | ||
289 | err = 0; | ||
290 | if (err || read != pgsize) { | ||
291 | printk(PRINT_PREF "error: read failed at %#llx\n", | ||
292 | (long long)addr); | ||
293 | kfree(pp1); | ||
294 | return err; | ||
295 | } | ||
296 | |||
297 | /* pp2 and pp4 should be the same */ | ||
298 | printk(PRINT_PREF "verifying pages read at %#llx match\n", | ||
299 | (long long)addr0); | ||
300 | if (memcmp(pp2, pp4, pgsize)) { | ||
301 | printk(PRINT_PREF "verify failed!\n"); | ||
302 | errcnt += 1; | ||
303 | } else if (!err) | ||
304 | printk(PRINT_PREF "crosstest ok\n"); | ||
305 | kfree(pp1); | ||
306 | return err; | ||
307 | } | ||
308 | |||
309 | static int erasecrosstest(void) | ||
310 | { | ||
311 | size_t read = 0, written = 0; | ||
312 | int err = 0, i, ebnum, ok = 1, ebnum2; | ||
313 | loff_t addr0; | ||
314 | char *readbuf = twopages; | ||
315 | |||
316 | printk(PRINT_PREF "erasecrosstest\n"); | ||
317 | |||
318 | ebnum = 0; | ||
319 | addr0 = 0; | ||
320 | for (i = 0; bbt[i] && i < ebcnt; ++i) { | ||
321 | addr0 += mtd->erasesize; | ||
322 | ebnum += 1; | ||
323 | } | ||
324 | |||
325 | ebnum2 = ebcnt - 1; | ||
326 | while (ebnum2 && bbt[ebnum2]) | ||
327 | ebnum2 -= 1; | ||
328 | |||
329 | printk(PRINT_PREF "erasing block %d\n", ebnum); | ||
330 | err = erase_eraseblock(ebnum); | ||
331 | if (err) | ||
332 | return err; | ||
333 | |||
334 | printk(PRINT_PREF "writing 1st page of block %d\n", ebnum); | ||
335 | set_random_data(writebuf, pgsize); | ||
336 | strcpy(writebuf, "There is no data like this!"); | ||
337 | err = mtd->write(mtd, addr0, pgsize, &written, writebuf); | ||
338 | if (err || written != pgsize) { | ||
339 | printk(PRINT_PREF "error: write failed at %#llx\n", | ||
340 | (long long)addr0); | ||
341 | return err ? err : -1; | ||
342 | } | ||
343 | |||
344 | printk(PRINT_PREF "reading 1st page of block %d\n", ebnum); | ||
345 | memset(readbuf, 0, pgsize); | ||
346 | err = mtd->read(mtd, addr0, pgsize, &read, readbuf); | ||
347 | if (err == -EUCLEAN) | ||
348 | err = 0; | ||
349 | if (err || read != pgsize) { | ||
350 | printk(PRINT_PREF "error: read failed at %#llx\n", | ||
351 | (long long)addr0); | ||
352 | return err ? err : -1; | ||
353 | } | ||
354 | |||
355 | printk(PRINT_PREF "verifying 1st page of block %d\n", ebnum); | ||
356 | if (memcmp(writebuf, readbuf, pgsize)) { | ||
357 | printk(PRINT_PREF "verify failed!\n"); | ||
358 | errcnt += 1; | ||
359 | ok = 0; | ||
360 | return err; | ||
361 | } | ||
362 | |||
363 | printk(PRINT_PREF "erasing block %d\n", ebnum); | ||
364 | err = erase_eraseblock(ebnum); | ||
365 | if (err) | ||
366 | return err; | ||
367 | |||
368 | printk(PRINT_PREF "writing 1st page of block %d\n", ebnum); | ||
369 | set_random_data(writebuf, pgsize); | ||
370 | strcpy(writebuf, "There is no data like this!"); | ||
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 | |||
378 | printk(PRINT_PREF "erasing block %d\n", ebnum2); | ||
379 | err = erase_eraseblock(ebnum2); | ||
380 | if (err) | ||
381 | return err; | ||
382 | |||
383 | printk(PRINT_PREF "reading 1st page of block %d\n", ebnum); | ||
384 | memset(readbuf, 0, pgsize); | ||
385 | err = mtd->read(mtd, addr0, pgsize, &read, readbuf); | ||
386 | if (err == -EUCLEAN) | ||
387 | err = 0; | ||
388 | if (err || read != pgsize) { | ||
389 | printk(PRINT_PREF "error: read failed at %#llx\n", | ||
390 | (long long)addr0); | ||
391 | return err ? err : -1; | ||
392 | } | ||
393 | |||
394 | printk(PRINT_PREF "verifying 1st page of block %d\n", ebnum); | ||
395 | if (memcmp(writebuf, readbuf, pgsize)) { | ||
396 | printk(PRINT_PREF "verify failed!\n"); | ||
397 | errcnt += 1; | ||
398 | ok = 0; | ||
399 | } | ||
400 | |||
401 | if (ok && !err) | ||
402 | printk(PRINT_PREF "erasecrosstest ok\n"); | ||
403 | return err; | ||
404 | } | ||
405 | |||
406 | static int erasetest(void) | ||
407 | { | ||
408 | size_t read = 0, written = 0; | ||
409 | int err = 0, i, ebnum, ok = 1; | ||
410 | loff_t addr0; | ||
411 | |||
412 | printk(PRINT_PREF "erasetest\n"); | ||
413 | |||
414 | ebnum = 0; | ||
415 | addr0 = 0; | ||
416 | for (i = 0; bbt[i] && i < ebcnt; ++i) { | ||
417 | addr0 += mtd->erasesize; | ||
418 | ebnum += 1; | ||
419 | } | ||
420 | |||
421 | printk(PRINT_PREF "erasing block %d\n", ebnum); | ||
422 | err = erase_eraseblock(ebnum); | ||
423 | if (err) | ||
424 | return err; | ||
425 | |||
426 | printk(PRINT_PREF "writing 1st page of block %d\n", ebnum); | ||
427 | set_random_data(writebuf, pgsize); | ||
428 | err = mtd->write(mtd, addr0, pgsize, &written, writebuf); | ||
429 | if (err || written != pgsize) { | ||
430 | printk(PRINT_PREF "error: write failed at %#llx\n", | ||
431 | (long long)addr0); | ||
432 | return err ? err : -1; | ||
433 | } | ||
434 | |||
435 | printk(PRINT_PREF "erasing block %d\n", ebnum); | ||
436 | err = erase_eraseblock(ebnum); | ||
437 | if (err) | ||
438 | return err; | ||
439 | |||
440 | printk(PRINT_PREF "reading 1st page of block %d\n", ebnum); | ||
441 | err = mtd->read(mtd, addr0, pgsize, &read, twopages); | ||
442 | if (err == -EUCLEAN) | ||
443 | err = 0; | ||
444 | if (err || read != pgsize) { | ||
445 | printk(PRINT_PREF "error: read failed at %#llx\n", | ||
446 | (long long)addr0); | ||
447 | return err ? err : -1; | ||
448 | } | ||
449 | |||
450 | printk(PRINT_PREF "verifying 1st page of block %d is all 0xff\n", | ||
451 | ebnum); | ||
452 | for (i = 0; i < pgsize; ++i) | ||
453 | if (twopages[i] != 0xff) { | ||
454 | printk(PRINT_PREF "verifying all 0xff failed at %d\n", | ||
455 | i); | ||
456 | errcnt += 1; | ||
457 | ok = 0; | ||
458 | break; | ||
459 | } | ||
460 | |||
461 | if (ok && !err) | ||
462 | printk(PRINT_PREF "erasetest ok\n"); | ||
463 | |||
464 | return err; | ||
465 | } | ||
466 | |||
467 | static int is_block_bad(int ebnum) | ||
468 | { | ||
469 | loff_t addr = ebnum * mtd->erasesize; | ||
470 | int ret; | ||
471 | |||
472 | ret = mtd->block_isbad(mtd, addr); | ||
473 | if (ret) | ||
474 | printk(PRINT_PREF "block %d is bad\n", ebnum); | ||
475 | return ret; | ||
476 | } | ||
477 | |||
478 | static int scan_for_bad_eraseblocks(void) | ||
479 | { | ||
480 | int i, bad = 0; | ||
481 | |||
482 | bbt = kmalloc(ebcnt, GFP_KERNEL); | ||
483 | if (!bbt) { | ||
484 | printk(PRINT_PREF "error: cannot allocate memory\n"); | ||
485 | return -ENOMEM; | ||
486 | } | ||
487 | memset(bbt, 0 , ebcnt); | ||
488 | |||
489 | printk(PRINT_PREF "scanning for bad eraseblocks\n"); | ||
490 | for (i = 0; i < ebcnt; ++i) { | ||
491 | bbt[i] = is_block_bad(i) ? 1 : 0; | ||
492 | if (bbt[i]) | ||
493 | bad += 1; | ||
494 | cond_resched(); | ||
495 | } | ||
496 | printk(PRINT_PREF "scanned %d eraseblocks, %d are bad\n", i, bad); | ||
497 | return 0; | ||
498 | } | ||
499 | |||
500 | static int __init mtd_pagetest_init(void) | ||
501 | { | ||
502 | int err = 0; | ||
503 | uint64_t tmp; | ||
504 | uint32_t i; | ||
505 | |||
506 | printk(KERN_INFO "\n"); | ||
507 | printk(KERN_INFO "=================================================\n"); | ||
508 | printk(PRINT_PREF "MTD device: %d\n", dev); | ||
509 | |||
510 | mtd = get_mtd_device(NULL, dev); | ||
511 | if (IS_ERR(mtd)) { | ||
512 | err = PTR_ERR(mtd); | ||
513 | printk(PRINT_PREF "error: cannot get MTD device\n"); | ||
514 | return err; | ||
515 | } | ||
516 | |||
517 | if (mtd->type != MTD_NANDFLASH) { | ||
518 | printk(PRINT_PREF "this test requires NAND flash\n"); | ||
519 | goto out; | ||
520 | } | ||
521 | |||
522 | tmp = mtd->size; | ||
523 | do_div(tmp, mtd->erasesize); | ||
524 | ebcnt = tmp; | ||
525 | pgcnt = mtd->erasesize / mtd->writesize; | ||
526 | |||
527 | printk(PRINT_PREF "MTD device size %llu, eraseblock size %u, " | ||
528 | "page size %u, count of eraseblocks %u, pages per " | ||
529 | "eraseblock %u, OOB size %u\n", | ||
530 | (unsigned long long)mtd->size, mtd->erasesize, | ||
531 | pgsize, ebcnt, pgcnt, mtd->oobsize); | ||
532 | |||
533 | err = -ENOMEM; | ||
534 | bufsize = pgsize * 2; | ||
535 | writebuf = kmalloc(mtd->erasesize, GFP_KERNEL); | ||
536 | if (!writebuf) { | ||
537 | printk(PRINT_PREF "error: cannot allocate memory\n"); | ||
538 | goto out; | ||
539 | } | ||
540 | twopages = kmalloc(bufsize, GFP_KERNEL); | ||
541 | if (!twopages) { | ||
542 | printk(PRINT_PREF "error: cannot allocate memory\n"); | ||
543 | goto out; | ||
544 | } | ||
545 | boundary = kmalloc(bufsize, GFP_KERNEL); | ||
546 | if (!boundary) { | ||
547 | printk(PRINT_PREF "error: cannot allocate memory\n"); | ||
548 | goto out; | ||
549 | } | ||
550 | |||
551 | err = scan_for_bad_eraseblocks(); | ||
552 | if (err) | ||
553 | goto out; | ||
554 | |||
555 | /* Erase all eraseblocks */ | ||
556 | printk(PRINT_PREF "erasing whole device\n"); | ||
557 | for (i = 0; i < ebcnt; ++i) { | ||
558 | if (bbt[i]) | ||
559 | continue; | ||
560 | err = erase_eraseblock(i); | ||
561 | if (err) | ||
562 | goto out; | ||
563 | cond_resched(); | ||
564 | } | ||
565 | printk(PRINT_PREF "erased %u eraseblocks\n", i); | ||
566 | |||
567 | /* Write all eraseblocks */ | ||
568 | simple_srand(1); | ||
569 | printk(PRINT_PREF "writing whole device\n"); | ||
570 | for (i = 0; i < ebcnt; ++i) { | ||
571 | if (bbt[i]) | ||
572 | continue; | ||
573 | err = write_eraseblock(i); | ||
574 | if (err) | ||
575 | goto out; | ||
576 | if (i % 256 == 0) | ||
577 | printk(PRINT_PREF "written up to eraseblock %u\n", i); | ||
578 | cond_resched(); | ||
579 | } | ||
580 | printk(PRINT_PREF "written %u eraseblocks\n", i); | ||
581 | |||
582 | /* Check all eraseblocks */ | ||
583 | simple_srand(1); | ||
584 | printk(PRINT_PREF "verifying all eraseblocks\n"); | ||
585 | for (i = 0; i < ebcnt; ++i) { | ||
586 | if (bbt[i]) | ||
587 | continue; | ||
588 | err = verify_eraseblock(i); | ||
589 | if (err) | ||
590 | goto out; | ||
591 | if (i % 256 == 0) | ||
592 | printk(PRINT_PREF "verified up to eraseblock %u\n", i); | ||
593 | cond_resched(); | ||
594 | } | ||
595 | printk(PRINT_PREF "verified %u eraseblocks\n", i); | ||
596 | |||
597 | err = crosstest(); | ||
598 | if (err) | ||
599 | goto out; | ||
600 | |||
601 | err = erasecrosstest(); | ||
602 | if (err) | ||
603 | goto out; | ||
604 | |||
605 | err = erasetest(); | ||
606 | if (err) | ||
607 | goto out; | ||
608 | |||
609 | printk(PRINT_PREF "finished with %d errors\n", errcnt); | ||
610 | out: | ||
611 | |||
612 | kfree(bbt); | ||
613 | kfree(boundary); | ||
614 | kfree(twopages); | ||
615 | kfree(writebuf); | ||
616 | put_mtd_device(mtd); | ||
617 | if (err) | ||
618 | printk(PRINT_PREF "error %d occurred\n", err); | ||
619 | printk(KERN_INFO "=================================================\n"); | ||
620 | return err; | ||
621 | } | ||
622 | module_init(mtd_pagetest_init); | ||
623 | |||
624 | static void __exit mtd_pagetest_exit(void) | ||
625 | { | ||
626 | return; | ||
627 | } | ||
628 | module_exit(mtd_pagetest_exit); | ||
629 | |||
630 | MODULE_DESCRIPTION("NAND page test"); | ||
631 | MODULE_AUTHOR("Adrian Hunter"); | ||
632 | MODULE_LICENSE("GPL"); | ||
diff --git a/drivers/mtd/tests/mtd_readtest.c b/drivers/mtd/tests/mtd_readtest.c new file mode 100644 index 000000000000..645e77fdc63d --- /dev/null +++ b/drivers/mtd/tests/mtd_readtest.c | |||
@@ -0,0 +1,253 @@ | |||
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 | * Check MTD device read. | ||
18 | * | ||
19 | * Author: Adrian Hunter <ext-adrian.hunter@nokia.com> | ||
20 | */ | ||
21 | |||
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 | |||
29 | #define PRINT_PREF KERN_INFO "mtd_readtest: " | ||
30 | |||
31 | static int dev; | ||
32 | module_param(dev, int, S_IRUGO); | ||
33 | MODULE_PARM_DESC(dev, "MTD device number to use"); | ||
34 | |||
35 | static struct mtd_info *mtd; | ||
36 | static unsigned char *iobuf; | ||
37 | static unsigned char *iobuf1; | ||
38 | static unsigned char *bbt; | ||
39 | |||
40 | static int pgsize; | ||
41 | static int ebcnt; | ||
42 | static int pgcnt; | ||
43 | |||
44 | static int read_eraseblock_by_page(int ebnum) | ||
45 | { | ||
46 | size_t read = 0; | ||
47 | int i, ret, err = 0; | ||
48 | loff_t addr = ebnum * mtd->erasesize; | ||
49 | void *buf = iobuf; | ||
50 | void *oobbuf = iobuf1; | ||
51 | |||
52 | for (i = 0; i < pgcnt; i++) { | ||
53 | memset(buf, 0 , pgcnt); | ||
54 | ret = mtd->read(mtd, addr, pgsize, &read, buf); | ||
55 | if (ret == -EUCLEAN) | ||
56 | ret = 0; | ||
57 | if (ret || read != pgsize) { | ||
58 | printk(PRINT_PREF "error: read failed at %#llx\n", | ||
59 | (long long)addr); | ||
60 | if (!err) | ||
61 | err = ret; | ||
62 | if (!err) | ||
63 | err = -EINVAL; | ||
64 | } | ||
65 | if (mtd->oobsize) { | ||
66 | struct mtd_oob_ops ops; | ||
67 | |||
68 | ops.mode = MTD_OOB_PLACE; | ||
69 | ops.len = 0; | ||
70 | ops.retlen = 0; | ||
71 | ops.ooblen = mtd->oobsize; | ||
72 | ops.oobretlen = 0; | ||
73 | ops.ooboffs = 0; | ||
74 | ops.datbuf = 0; | ||
75 | ops.oobbuf = oobbuf; | ||
76 | ret = mtd->read_oob(mtd, addr, &ops); | ||
77 | if (ret || ops.oobretlen != mtd->oobsize) { | ||
78 | printk(PRINT_PREF "error: read oob failed at " | ||
79 | "%#llx\n", (long long)addr); | ||
80 | if (!err) | ||
81 | err = ret; | ||
82 | if (!err) | ||
83 | err = -EINVAL; | ||
84 | } | ||
85 | oobbuf += mtd->oobsize; | ||
86 | } | ||
87 | addr += pgsize; | ||
88 | buf += pgsize; | ||
89 | } | ||
90 | |||
91 | return err; | ||
92 | } | ||
93 | |||
94 | static void dump_eraseblock(int ebnum) | ||
95 | { | ||
96 | int i, j, n; | ||
97 | char line[128]; | ||
98 | int pg, oob; | ||
99 | |||
100 | printk(PRINT_PREF "dumping eraseblock %d\n", ebnum); | ||
101 | n = mtd->erasesize; | ||
102 | for (i = 0; i < n;) { | ||
103 | char *p = line; | ||
104 | |||
105 | p += sprintf(p, "%05x: ", i); | ||
106 | for (j = 0; j < 32 && i < n; j++, i++) | ||
107 | p += sprintf(p, "%02x", (unsigned int)iobuf[i]); | ||
108 | printk(KERN_CRIT "%s\n", line); | ||
109 | cond_resched(); | ||
110 | } | ||
111 | if (!mtd->oobsize) | ||
112 | return; | ||
113 | printk(PRINT_PREF "dumping oob from eraseblock %d\n", ebnum); | ||
114 | n = mtd->oobsize; | ||
115 | for (pg = 0, i = 0; pg < pgcnt; pg++) | ||
116 | for (oob = 0; oob < n;) { | ||
117 | char *p = line; | ||
118 | |||
119 | p += sprintf(p, "%05x: ", i); | ||
120 | for (j = 0; j < 32 && oob < n; j++, oob++, i++) | ||
121 | p += sprintf(p, "%02x", | ||
122 | (unsigned int)iobuf1[i]); | ||
123 | printk(KERN_CRIT "%s\n", line); | ||
124 | cond_resched(); | ||
125 | } | ||
126 | } | ||
127 | |||
128 | static int is_block_bad(int ebnum) | ||
129 | { | ||
130 | loff_t addr = ebnum * mtd->erasesize; | ||
131 | int ret; | ||
132 | |||
133 | ret = mtd->block_isbad(mtd, addr); | ||
134 | if (ret) | ||
135 | printk(PRINT_PREF "block %d is bad\n", ebnum); | ||
136 | return ret; | ||
137 | } | ||
138 | |||
139 | static int scan_for_bad_eraseblocks(void) | ||
140 | { | ||
141 | int i, bad = 0; | ||
142 | |||
143 | bbt = kmalloc(ebcnt, GFP_KERNEL); | ||
144 | if (!bbt) { | ||
145 | printk(PRINT_PREF "error: cannot allocate memory\n"); | ||
146 | return -ENOMEM; | ||
147 | } | ||
148 | memset(bbt, 0 , ebcnt); | ||
149 | |||
150 | printk(PRINT_PREF "scanning for bad eraseblocks\n"); | ||
151 | for (i = 0; i < ebcnt; ++i) { | ||
152 | bbt[i] = is_block_bad(i) ? 1 : 0; | ||
153 | if (bbt[i]) | ||
154 | bad += 1; | ||
155 | cond_resched(); | ||
156 | } | ||
157 | printk(PRINT_PREF "scanned %d eraseblocks, %d are bad\n", i, bad); | ||
158 | return 0; | ||
159 | } | ||
160 | |||
161 | static int __init mtd_readtest_init(void) | ||
162 | { | ||
163 | uint64_t tmp; | ||
164 | int err, i; | ||
165 | |||
166 | printk(KERN_INFO "\n"); | ||
167 | printk(KERN_INFO "=================================================\n"); | ||
168 | printk(PRINT_PREF "MTD device: %d\n", dev); | ||
169 | |||
170 | mtd = get_mtd_device(NULL, dev); | ||
171 | if (IS_ERR(mtd)) { | ||
172 | err = PTR_ERR(mtd); | ||
173 | printk(PRINT_PREF "error: Cannot get MTD device\n"); | ||
174 | return err; | ||
175 | } | ||
176 | |||
177 | if (mtd->writesize == 1) { | ||
178 | printk(PRINT_PREF "not NAND flash, assume page size is 512 " | ||
179 | "bytes.\n"); | ||
180 | pgsize = 512; | ||
181 | } else | ||
182 | pgsize = mtd->writesize; | ||
183 | |||
184 | tmp = mtd->size; | ||
185 | do_div(tmp, mtd->erasesize); | ||
186 | ebcnt = tmp; | ||
187 | pgcnt = mtd->erasesize / mtd->writesize; | ||
188 | |||
189 | printk(PRINT_PREF "MTD device size %llu, eraseblock size %u, " | ||
190 | "page size %u, count of eraseblocks %u, pages per " | ||
191 | "eraseblock %u, OOB size %u\n", | ||
192 | (unsigned long long)mtd->size, mtd->erasesize, | ||
193 | pgsize, ebcnt, pgcnt, mtd->oobsize); | ||
194 | |||
195 | err = -ENOMEM; | ||
196 | iobuf = kmalloc(mtd->erasesize, GFP_KERNEL); | ||
197 | if (!iobuf) { | ||
198 | printk(PRINT_PREF "error: cannot allocate memory\n"); | ||
199 | goto out; | ||
200 | } | ||
201 | iobuf1 = kmalloc(mtd->erasesize, GFP_KERNEL); | ||
202 | if (!iobuf1) { | ||
203 | printk(PRINT_PREF "error: cannot allocate memory\n"); | ||
204 | goto out; | ||
205 | } | ||
206 | |||
207 | err = scan_for_bad_eraseblocks(); | ||
208 | if (err) | ||
209 | goto out; | ||
210 | |||
211 | /* Read all eraseblocks 1 page at a time */ | ||
212 | printk(PRINT_PREF "testing page read\n"); | ||
213 | for (i = 0; i < ebcnt; ++i) { | ||
214 | int ret; | ||
215 | |||
216 | if (bbt[i]) | ||
217 | continue; | ||
218 | ret = read_eraseblock_by_page(i); | ||
219 | if (ret) { | ||
220 | dump_eraseblock(i); | ||
221 | if (!err) | ||
222 | err = ret; | ||
223 | } | ||
224 | cond_resched(); | ||
225 | } | ||
226 | |||
227 | if (err) | ||
228 | printk(PRINT_PREF "finished with errors\n"); | ||
229 | else | ||
230 | printk(PRINT_PREF "finished\n"); | ||
231 | |||
232 | out: | ||
233 | |||
234 | kfree(iobuf); | ||
235 | kfree(iobuf1); | ||
236 | kfree(bbt); | ||
237 | put_mtd_device(mtd); | ||
238 | if (err) | ||
239 | printk(PRINT_PREF "error %d occurred\n", err); | ||
240 | printk(KERN_INFO "=================================================\n"); | ||
241 | return err; | ||
242 | } | ||
243 | module_init(mtd_readtest_init); | ||
244 | |||
245 | static void __exit mtd_readtest_exit(void) | ||
246 | { | ||
247 | return; | ||
248 | } | ||
249 | module_exit(mtd_readtest_exit); | ||
250 | |||
251 | MODULE_DESCRIPTION("Read test module"); | ||
252 | MODULE_AUTHOR("Adrian Hunter"); | ||
253 | MODULE_LICENSE("GPL"); | ||
diff --git a/drivers/mtd/tests/mtd_speedtest.c b/drivers/mtd/tests/mtd_speedtest.c new file mode 100644 index 000000000000..141363a7e805 --- /dev/null +++ b/drivers/mtd/tests/mtd_speedtest.c | |||
@@ -0,0 +1,502 @@ | |||
1 | /* | ||
2 | * Copyright (C) 2007 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 read and write speed of a MTD device. | ||
18 | * | ||
19 | * Author: Adrian Hunter <ext-adrian.hunter@nokia.com> | ||
20 | */ | ||
21 | |||
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 | |||
29 | #define PRINT_PREF KERN_INFO "mtd_speedtest: " | ||
30 | |||
31 | static int dev; | ||
32 | module_param(dev, int, S_IRUGO); | ||
33 | MODULE_PARM_DESC(dev, "MTD device number to use"); | ||
34 | |||
35 | static struct mtd_info *mtd; | ||
36 | static unsigned char *iobuf; | ||
37 | static unsigned char *bbt; | ||
38 | |||
39 | static int pgsize; | ||
40 | static int ebcnt; | ||
41 | static int pgcnt; | ||
42 | static int goodebcnt; | ||
43 | static struct timeval start, finish; | ||
44 | static unsigned long next = 1; | ||
45 | |||
46 | static inline unsigned int simple_rand(void) | ||
47 | { | ||
48 | next = next * 1103515245 + 12345; | ||
49 | return (unsigned int)((next / 65536) % 32768); | ||
50 | } | ||
51 | |||
52 | static inline void simple_srand(unsigned long seed) | ||
53 | { | ||
54 | next = seed; | ||
55 | } | ||
56 | |||
57 | static void set_random_data(unsigned char *buf, size_t len) | ||
58 | { | ||
59 | size_t i; | ||
60 | |||
61 | for (i = 0; i < len; ++i) | ||
62 | buf[i] = simple_rand(); | ||
63 | } | ||
64 | |||
65 | static int erase_eraseblock(int ebnum) | ||
66 | { | ||
67 | int err; | ||
68 | struct erase_info ei; | ||
69 | loff_t addr = ebnum * mtd->erasesize; | ||
70 | |||
71 | memset(&ei, 0, sizeof(struct erase_info)); | ||
72 | ei.mtd = mtd; | ||
73 | ei.addr = addr; | ||
74 | ei.len = mtd->erasesize; | ||
75 | |||
76 | err = mtd->erase(mtd, &ei); | ||
77 | if (err) { | ||
78 | printk(PRINT_PREF "error %d while erasing EB %d\n", err, ebnum); | ||
79 | return err; | ||
80 | } | ||
81 | |||
82 | if (ei.state == MTD_ERASE_FAILED) { | ||
83 | printk(PRINT_PREF "some erase error occurred at EB %d\n", | ||
84 | ebnum); | ||
85 | return -EIO; | ||
86 | } | ||
87 | |||
88 | return 0; | ||
89 | } | ||
90 | |||
91 | static int erase_whole_device(void) | ||
92 | { | ||
93 | int err; | ||
94 | unsigned int i; | ||
95 | |||
96 | for (i = 0; i < ebcnt; ++i) { | ||
97 | if (bbt[i]) | ||
98 | continue; | ||
99 | err = erase_eraseblock(i); | ||
100 | if (err) | ||
101 | return err; | ||
102 | cond_resched(); | ||
103 | } | ||
104 | return 0; | ||
105 | } | ||
106 | |||
107 | static int write_eraseblock(int ebnum) | ||
108 | { | ||
109 | size_t written = 0; | ||
110 | int err = 0; | ||
111 | loff_t addr = ebnum * mtd->erasesize; | ||
112 | |||
113 | err = mtd->write(mtd, addr, mtd->erasesize, &written, iobuf); | ||
114 | if (err || written != mtd->erasesize) { | ||
115 | printk(PRINT_PREF "error: write failed at %#llx\n", addr); | ||
116 | if (!err) | ||
117 | err = -EINVAL; | ||
118 | } | ||
119 | |||
120 | return err; | ||
121 | } | ||
122 | |||
123 | static int write_eraseblock_by_page(int ebnum) | ||
124 | { | ||
125 | size_t written = 0; | ||
126 | int i, err = 0; | ||
127 | loff_t addr = ebnum * mtd->erasesize; | ||
128 | void *buf = iobuf; | ||
129 | |||
130 | for (i = 0; i < pgcnt; i++) { | ||
131 | err = mtd->write(mtd, addr, pgsize, &written, buf); | ||
132 | if (err || written != pgsize) { | ||
133 | printk(PRINT_PREF "error: write failed at %#llx\n", | ||
134 | addr); | ||
135 | if (!err) | ||
136 | err = -EINVAL; | ||
137 | break; | ||
138 | } | ||
139 | addr += pgsize; | ||
140 | buf += pgsize; | ||
141 | } | ||
142 | |||
143 | return err; | ||
144 | } | ||
145 | |||
146 | static int write_eraseblock_by_2pages(int ebnum) | ||
147 | { | ||
148 | size_t written = 0, sz = pgsize * 2; | ||
149 | int i, n = pgcnt / 2, err = 0; | ||
150 | loff_t addr = ebnum * mtd->erasesize; | ||
151 | void *buf = iobuf; | ||
152 | |||
153 | for (i = 0; i < n; i++) { | ||
154 | err = mtd->write(mtd, addr, sz, &written, buf); | ||
155 | if (err || written != sz) { | ||
156 | printk(PRINT_PREF "error: write failed at %#llx\n", | ||
157 | addr); | ||
158 | if (!err) | ||
159 | err = -EINVAL; | ||
160 | return err; | ||
161 | } | ||
162 | addr += sz; | ||
163 | buf += sz; | ||
164 | } | ||
165 | if (pgcnt % 2) { | ||
166 | err = mtd->write(mtd, addr, pgsize, &written, buf); | ||
167 | if (err || written != pgsize) { | ||
168 | printk(PRINT_PREF "error: write failed at %#llx\n", | ||
169 | addr); | ||
170 | if (!err) | ||
171 | err = -EINVAL; | ||
172 | } | ||
173 | } | ||
174 | |||
175 | return err; | ||
176 | } | ||
177 | |||
178 | static int read_eraseblock(int ebnum) | ||
179 | { | ||
180 | size_t read = 0; | ||
181 | int err = 0; | ||
182 | loff_t addr = ebnum * mtd->erasesize; | ||
183 | |||
184 | err = mtd->read(mtd, addr, mtd->erasesize, &read, iobuf); | ||
185 | /* Ignore corrected ECC errors */ | ||
186 | if (err == -EUCLEAN) | ||
187 | err = 0; | ||
188 | if (err || read != mtd->erasesize) { | ||
189 | printk(PRINT_PREF "error: read failed at %#llx\n", addr); | ||
190 | if (!err) | ||
191 | err = -EINVAL; | ||
192 | } | ||
193 | |||
194 | return err; | ||
195 | } | ||
196 | |||
197 | static int read_eraseblock_by_page(int ebnum) | ||
198 | { | ||
199 | size_t read = 0; | ||
200 | int i, err = 0; | ||
201 | loff_t addr = ebnum * mtd->erasesize; | ||
202 | void *buf = iobuf; | ||
203 | |||
204 | for (i = 0; i < pgcnt; i++) { | ||
205 | err = mtd->read(mtd, addr, pgsize, &read, buf); | ||
206 | /* Ignore corrected ECC errors */ | ||
207 | if (err == -EUCLEAN) | ||
208 | err = 0; | ||
209 | if (err || read != pgsize) { | ||
210 | printk(PRINT_PREF "error: read failed at %#llx\n", | ||
211 | addr); | ||
212 | if (!err) | ||
213 | err = -EINVAL; | ||
214 | break; | ||
215 | } | ||
216 | addr += pgsize; | ||
217 | buf += pgsize; | ||
218 | } | ||
219 | |||
220 | return err; | ||
221 | } | ||
222 | |||
223 | static int read_eraseblock_by_2pages(int ebnum) | ||
224 | { | ||
225 | size_t read = 0, sz = pgsize * 2; | ||
226 | int i, n = pgcnt / 2, err = 0; | ||
227 | loff_t addr = ebnum * mtd->erasesize; | ||
228 | void *buf = iobuf; | ||
229 | |||
230 | for (i = 0; i < n; i++) { | ||
231 | err = mtd->read(mtd, addr, sz, &read, buf); | ||
232 | /* Ignore corrected ECC errors */ | ||
233 | if (err == -EUCLEAN) | ||
234 | err = 0; | ||
235 | if (err || read != sz) { | ||
236 | printk(PRINT_PREF "error: read failed at %#llx\n", | ||
237 | addr); | ||
238 | if (!err) | ||
239 | err = -EINVAL; | ||
240 | return err; | ||
241 | } | ||
242 | addr += sz; | ||
243 | buf += sz; | ||
244 | } | ||
245 | if (pgcnt % 2) { | ||
246 | err = mtd->read(mtd, addr, pgsize, &read, buf); | ||
247 | /* Ignore corrected ECC errors */ | ||
248 | if (err == -EUCLEAN) | ||
249 | err = 0; | ||
250 | if (err || read != pgsize) { | ||
251 | printk(PRINT_PREF "error: read failed at %#llx\n", | ||
252 | addr); | ||
253 | if (!err) | ||
254 | err = -EINVAL; | ||
255 | } | ||
256 | } | ||
257 | |||
258 | return err; | ||
259 | } | ||
260 | |||
261 | static int is_block_bad(int ebnum) | ||
262 | { | ||
263 | loff_t addr = ebnum * mtd->erasesize; | ||
264 | int ret; | ||
265 | |||
266 | ret = mtd->block_isbad(mtd, addr); | ||
267 | if (ret) | ||
268 | printk(PRINT_PREF "block %d is bad\n", ebnum); | ||
269 | return ret; | ||
270 | } | ||
271 | |||
272 | static inline void start_timing(void) | ||
273 | { | ||
274 | do_gettimeofday(&start); | ||
275 | } | ||
276 | |||
277 | static inline void stop_timing(void) | ||
278 | { | ||
279 | do_gettimeofday(&finish); | ||
280 | } | ||
281 | |||
282 | static long calc_speed(void) | ||
283 | { | ||
284 | long ms, k, speed; | ||
285 | |||
286 | ms = (finish.tv_sec - start.tv_sec) * 1000 + | ||
287 | (finish.tv_usec - start.tv_usec) / 1000; | ||
288 | k = goodebcnt * mtd->erasesize / 1024; | ||
289 | speed = (k * 1000) / ms; | ||
290 | return speed; | ||
291 | } | ||
292 | |||
293 | static int scan_for_bad_eraseblocks(void) | ||
294 | { | ||
295 | int i, bad = 0; | ||
296 | |||
297 | bbt = kmalloc(ebcnt, GFP_KERNEL); | ||
298 | if (!bbt) { | ||
299 | printk(PRINT_PREF "error: cannot allocate memory\n"); | ||
300 | return -ENOMEM; | ||
301 | } | ||
302 | memset(bbt, 0 , ebcnt); | ||
303 | |||
304 | printk(PRINT_PREF "scanning for bad eraseblocks\n"); | ||
305 | for (i = 0; i < ebcnt; ++i) { | ||
306 | bbt[i] = is_block_bad(i) ? 1 : 0; | ||
307 | if (bbt[i]) | ||
308 | bad += 1; | ||
309 | cond_resched(); | ||
310 | } | ||
311 | printk(PRINT_PREF "scanned %d eraseblocks, %d are bad\n", i, bad); | ||
312 | goodebcnt = ebcnt - bad; | ||
313 | return 0; | ||
314 | } | ||
315 | |||
316 | static int __init mtd_speedtest_init(void) | ||
317 | { | ||
318 | int err, i; | ||
319 | long speed; | ||
320 | uint64_t tmp; | ||
321 | |||
322 | printk(KERN_INFO "\n"); | ||
323 | printk(KERN_INFO "=================================================\n"); | ||
324 | printk(PRINT_PREF "MTD device: %d\n", dev); | ||
325 | |||
326 | mtd = get_mtd_device(NULL, dev); | ||
327 | if (IS_ERR(mtd)) { | ||
328 | err = PTR_ERR(mtd); | ||
329 | printk(PRINT_PREF "error: cannot get MTD device\n"); | ||
330 | return err; | ||
331 | } | ||
332 | |||
333 | if (mtd->writesize == 1) { | ||
334 | printk(PRINT_PREF "not NAND flash, assume page size is 512 " | ||
335 | "bytes.\n"); | ||
336 | pgsize = 512; | ||
337 | } else | ||
338 | pgsize = mtd->writesize; | ||
339 | |||
340 | tmp = mtd->size; | ||
341 | do_div(tmp, mtd->erasesize); | ||
342 | ebcnt = tmp; | ||
343 | pgcnt = mtd->erasesize / mtd->writesize; | ||
344 | |||
345 | printk(PRINT_PREF "MTD device size %llu, eraseblock size %u, " | ||
346 | "page size %u, count of eraseblocks %u, pages per " | ||
347 | "eraseblock %u, OOB size %u\n", | ||
348 | (unsigned long long)mtd->size, mtd->erasesize, | ||
349 | pgsize, ebcnt, pgcnt, mtd->oobsize); | ||
350 | |||
351 | err = -ENOMEM; | ||
352 | iobuf = kmalloc(mtd->erasesize, GFP_KERNEL); | ||
353 | if (!iobuf) { | ||
354 | printk(PRINT_PREF "error: cannot allocate memory\n"); | ||
355 | goto out; | ||
356 | } | ||
357 | |||
358 | simple_srand(1); | ||
359 | set_random_data(iobuf, mtd->erasesize); | ||
360 | |||
361 | err = scan_for_bad_eraseblocks(); | ||
362 | if (err) | ||
363 | goto out; | ||
364 | |||
365 | err = erase_whole_device(); | ||
366 | if (err) | ||
367 | goto out; | ||
368 | |||
369 | /* Write all eraseblocks, 1 eraseblock at a time */ | ||
370 | printk(PRINT_PREF "testing eraseblock write speed\n"); | ||
371 | start_timing(); | ||
372 | for (i = 0; i < ebcnt; ++i) { | ||
373 | if (bbt[i]) | ||
374 | continue; | ||
375 | err = write_eraseblock(i); | ||
376 | if (err) | ||
377 | goto out; | ||
378 | cond_resched(); | ||
379 | } | ||
380 | stop_timing(); | ||
381 | speed = calc_speed(); | ||
382 | printk(PRINT_PREF "eraseblock write speed is %ld KiB/s\n", speed); | ||
383 | |||
384 | /* Read all eraseblocks, 1 eraseblock at a time */ | ||
385 | printk(PRINT_PREF "testing eraseblock read speed\n"); | ||
386 | start_timing(); | ||
387 | for (i = 0; i < ebcnt; ++i) { | ||
388 | if (bbt[i]) | ||
389 | continue; | ||
390 | err = read_eraseblock(i); | ||
391 | if (err) | ||
392 | goto out; | ||
393 | cond_resched(); | ||
394 | } | ||
395 | stop_timing(); | ||
396 | speed = calc_speed(); | ||
397 | printk(PRINT_PREF "eraseblock read speed is %ld KiB/s\n", speed); | ||
398 | |||
399 | err = erase_whole_device(); | ||
400 | if (err) | ||
401 | goto out; | ||
402 | |||
403 | /* Write all eraseblocks, 1 page at a time */ | ||
404 | printk(PRINT_PREF "testing page write speed\n"); | ||
405 | start_timing(); | ||
406 | for (i = 0; i < ebcnt; ++i) { | ||
407 | if (bbt[i]) | ||
408 | continue; | ||
409 | err = write_eraseblock_by_page(i); | ||
410 | if (err) | ||
411 | goto out; | ||
412 | cond_resched(); | ||
413 | } | ||
414 | stop_timing(); | ||
415 | speed = calc_speed(); | ||
416 | printk(PRINT_PREF "page write speed is %ld KiB/s\n", speed); | ||
417 | |||
418 | /* Read all eraseblocks, 1 page at a time */ | ||
419 | printk(PRINT_PREF "testing page read speed\n"); | ||
420 | start_timing(); | ||
421 | for (i = 0; i < ebcnt; ++i) { | ||
422 | if (bbt[i]) | ||
423 | continue; | ||
424 | err = read_eraseblock_by_page(i); | ||
425 | if (err) | ||
426 | goto out; | ||
427 | cond_resched(); | ||
428 | } | ||
429 | stop_timing(); | ||
430 | speed = calc_speed(); | ||
431 | printk(PRINT_PREF "page read speed is %ld KiB/s\n", speed); | ||
432 | |||
433 | err = erase_whole_device(); | ||
434 | if (err) | ||
435 | goto out; | ||
436 | |||
437 | /* Write all eraseblocks, 2 pages at a time */ | ||
438 | printk(PRINT_PREF "testing 2 page write speed\n"); | ||
439 | start_timing(); | ||
440 | for (i = 0; i < ebcnt; ++i) { | ||
441 | if (bbt[i]) | ||
442 | continue; | ||
443 | err = write_eraseblock_by_2pages(i); | ||
444 | if (err) | ||
445 | goto out; | ||
446 | cond_resched(); | ||
447 | } | ||
448 | stop_timing(); | ||
449 | speed = calc_speed(); | ||
450 | printk(PRINT_PREF "2 page write speed is %ld KiB/s\n", speed); | ||
451 | |||
452 | /* Read all eraseblocks, 2 pages at a time */ | ||
453 | printk(PRINT_PREF "testing 2 page read speed\n"); | ||
454 | start_timing(); | ||
455 | for (i = 0; i < ebcnt; ++i) { | ||
456 | if (bbt[i]) | ||
457 | continue; | ||
458 | err = read_eraseblock_by_2pages(i); | ||
459 | if (err) | ||
460 | goto out; | ||
461 | cond_resched(); | ||
462 | } | ||
463 | stop_timing(); | ||
464 | speed = calc_speed(); | ||
465 | printk(PRINT_PREF "2 page read speed is %ld KiB/s\n", speed); | ||
466 | |||
467 | /* Erase all eraseblocks */ | ||
468 | printk(PRINT_PREF "Testing erase speed\n"); | ||
469 | start_timing(); | ||
470 | for (i = 0; i < ebcnt; ++i) { | ||
471 | if (bbt[i]) | ||
472 | continue; | ||
473 | err = erase_eraseblock(i); | ||
474 | if (err) | ||
475 | goto out; | ||
476 | cond_resched(); | ||
477 | } | ||
478 | stop_timing(); | ||
479 | speed = calc_speed(); | ||
480 | printk(PRINT_PREF "erase speed is %ld KiB/s\n", speed); | ||
481 | |||
482 | printk(PRINT_PREF "finished\n"); | ||
483 | out: | ||
484 | kfree(iobuf); | ||
485 | kfree(bbt); | ||
486 | put_mtd_device(mtd); | ||
487 | if (err) | ||
488 | printk(PRINT_PREF "error %d occurred\n", err); | ||
489 | printk(KERN_INFO "=================================================\n"); | ||
490 | return err; | ||
491 | } | ||
492 | module_init(mtd_speedtest_init); | ||
493 | |||
494 | static void __exit mtd_speedtest_exit(void) | ||
495 | { | ||
496 | return; | ||
497 | } | ||
498 | module_exit(mtd_speedtest_exit); | ||
499 | |||
500 | MODULE_DESCRIPTION("Speed test module"); | ||
501 | MODULE_AUTHOR("Adrian Hunter"); | ||
502 | MODULE_LICENSE("GPL"); | ||
diff --git a/drivers/mtd/tests/mtd_stresstest.c b/drivers/mtd/tests/mtd_stresstest.c new file mode 100644 index 000000000000..63920476b57a --- /dev/null +++ b/drivers/mtd/tests/mtd_stresstest.c | |||
@@ -0,0 +1,330 @@ | |||
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 random reads, writes and erases on MTD device. | ||
18 | * | ||
19 | * Author: Adrian Hunter <ext-adrian.hunter@nokia.com> | ||
20 | */ | ||
21 | |||
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 | #include <linux/vmalloc.h> | ||
29 | |||
30 | #define PRINT_PREF KERN_INFO "mtd_stresstest: " | ||
31 | |||
32 | static int dev; | ||
33 | module_param(dev, int, S_IRUGO); | ||
34 | MODULE_PARM_DESC(dev, "MTD device number to use"); | ||
35 | |||
36 | static int count = 10000; | ||
37 | module_param(count, int, S_IRUGO); | ||
38 | MODULE_PARM_DESC(count, "Number of operations to do (default is 10000)"); | ||
39 | |||
40 | static struct mtd_info *mtd; | ||
41 | static unsigned char *writebuf; | ||
42 | static unsigned char *readbuf; | ||
43 | static unsigned char *bbt; | ||
44 | static int *offsets; | ||
45 | |||
46 | static int pgsize; | ||
47 | static int bufsize; | ||
48 | static int ebcnt; | ||
49 | static int pgcnt; | ||
50 | static unsigned long next = 1; | ||
51 | |||
52 | static inline unsigned int simple_rand(void) | ||
53 | { | ||
54 | next = next * 1103515245 + 12345; | ||
55 | return (unsigned int)((next / 65536) % 32768); | ||
56 | } | ||
57 | |||
58 | static inline void simple_srand(unsigned long seed) | ||
59 | { | ||
60 | next = seed; | ||
61 | } | ||
62 | |||
63 | static int rand_eb(void) | ||
64 | { | ||
65 | int eb; | ||
66 | |||
67 | again: | ||
68 | if (ebcnt < 32768) | ||
69 | eb = simple_rand(); | ||
70 | else | ||
71 | eb = (simple_rand() << 15) | simple_rand(); | ||
72 | /* Read or write up 2 eraseblocks at a time - hence 'ebcnt - 1' */ | ||
73 | eb %= (ebcnt - 1); | ||
74 | if (bbt[eb]) | ||
75 | goto again; | ||
76 | return eb; | ||
77 | } | ||
78 | |||
79 | static int rand_offs(void) | ||
80 | { | ||
81 | int offs; | ||
82 | |||
83 | if (bufsize < 32768) | ||
84 | offs = simple_rand(); | ||
85 | else | ||
86 | offs = (simple_rand() << 15) | simple_rand(); | ||
87 | offs %= bufsize; | ||
88 | return offs; | ||
89 | } | ||
90 | |||
91 | static int rand_len(int offs) | ||
92 | { | ||
93 | int len; | ||
94 | |||
95 | if (bufsize < 32768) | ||
96 | len = simple_rand(); | ||
97 | else | ||
98 | len = (simple_rand() << 15) | simple_rand(); | ||
99 | len %= (bufsize - offs); | ||
100 | return len; | ||
101 | } | ||
102 | |||
103 | static int erase_eraseblock(int ebnum) | ||
104 | { | ||
105 | int err; | ||
106 | struct erase_info ei; | ||
107 | loff_t addr = ebnum * mtd->erasesize; | ||
108 | |||
109 | memset(&ei, 0, sizeof(struct erase_info)); | ||
110 | ei.mtd = mtd; | ||
111 | ei.addr = addr; | ||
112 | ei.len = mtd->erasesize; | ||
113 | |||
114 | err = mtd->erase(mtd, &ei); | ||
115 | if (unlikely(err)) { | ||
116 | printk(PRINT_PREF "error %d while erasing EB %d\n", err, ebnum); | ||
117 | return err; | ||
118 | } | ||
119 | |||
120 | if (unlikely(ei.state == MTD_ERASE_FAILED)) { | ||
121 | printk(PRINT_PREF "some erase error occurred at EB %d\n", | ||
122 | ebnum); | ||
123 | return -EIO; | ||
124 | } | ||
125 | |||
126 | return 0; | ||
127 | } | ||
128 | |||
129 | static int is_block_bad(int ebnum) | ||
130 | { | ||
131 | loff_t addr = ebnum * mtd->erasesize; | ||
132 | int ret; | ||
133 | |||
134 | ret = mtd->block_isbad(mtd, addr); | ||
135 | if (ret) | ||
136 | printk(PRINT_PREF "block %d is bad\n", ebnum); | ||
137 | return ret; | ||
138 | } | ||
139 | |||
140 | static int do_read(void) | ||
141 | { | ||
142 | size_t read = 0; | ||
143 | int eb = rand_eb(); | ||
144 | int offs = rand_offs(); | ||
145 | int len = rand_len(offs), err; | ||
146 | loff_t addr; | ||
147 | |||
148 | if (bbt[eb + 1]) { | ||
149 | if (offs >= mtd->erasesize) | ||
150 | offs -= mtd->erasesize; | ||
151 | if (offs + len > mtd->erasesize) | ||
152 | len = mtd->erasesize - offs; | ||
153 | } | ||
154 | addr = eb * mtd->erasesize + offs; | ||
155 | err = mtd->read(mtd, addr, len, &read, readbuf); | ||
156 | if (err == -EUCLEAN) | ||
157 | err = 0; | ||
158 | if (unlikely(err || read != len)) { | ||
159 | printk(PRINT_PREF "error: read failed at 0x%llx\n", | ||
160 | (long long)addr); | ||
161 | if (!err) | ||
162 | err = -EINVAL; | ||
163 | return err; | ||
164 | } | ||
165 | return 0; | ||
166 | } | ||
167 | |||
168 | static int do_write(void) | ||
169 | { | ||
170 | int eb = rand_eb(), offs, err, len; | ||
171 | size_t written = 0; | ||
172 | loff_t addr; | ||
173 | |||
174 | offs = offsets[eb]; | ||
175 | if (offs >= mtd->erasesize) { | ||
176 | err = erase_eraseblock(eb); | ||
177 | if (err) | ||
178 | return err; | ||
179 | offs = offsets[eb] = 0; | ||
180 | } | ||
181 | len = rand_len(offs); | ||
182 | len = ((len + pgsize - 1) / pgsize) * pgsize; | ||
183 | if (offs + len > mtd->erasesize) { | ||
184 | if (bbt[eb + 1]) | ||
185 | len = mtd->erasesize - offs; | ||
186 | else { | ||
187 | err = erase_eraseblock(eb + 1); | ||
188 | if (err) | ||
189 | return err; | ||
190 | offsets[eb + 1] = 0; | ||
191 | } | ||
192 | } | ||
193 | addr = eb * mtd->erasesize + offs; | ||
194 | err = mtd->write(mtd, addr, len, &written, writebuf); | ||
195 | if (unlikely(err || written != len)) { | ||
196 | printk(PRINT_PREF "error: write failed at 0x%llx\n", | ||
197 | (long long)addr); | ||
198 | if (!err) | ||
199 | err = -EINVAL; | ||
200 | return err; | ||
201 | } | ||
202 | offs += len; | ||
203 | while (offs > mtd->erasesize) { | ||
204 | offsets[eb++] = mtd->erasesize; | ||
205 | offs -= mtd->erasesize; | ||
206 | } | ||
207 | offsets[eb] = offs; | ||
208 | return 0; | ||
209 | } | ||
210 | |||
211 | static int do_operation(void) | ||
212 | { | ||
213 | if (simple_rand() & 1) | ||
214 | return do_read(); | ||
215 | else | ||
216 | return do_write(); | ||
217 | } | ||
218 | |||
219 | static int scan_for_bad_eraseblocks(void) | ||
220 | { | ||
221 | int i, bad = 0; | ||
222 | |||
223 | bbt = kmalloc(ebcnt, GFP_KERNEL); | ||
224 | if (!bbt) { | ||
225 | printk(PRINT_PREF "error: cannot allocate memory\n"); | ||
226 | return -ENOMEM; | ||
227 | } | ||
228 | memset(bbt, 0 , ebcnt); | ||
229 | |||
230 | printk(PRINT_PREF "scanning for bad eraseblocks\n"); | ||
231 | for (i = 0; i < ebcnt; ++i) { | ||
232 | bbt[i] = is_block_bad(i) ? 1 : 0; | ||
233 | if (bbt[i]) | ||
234 | bad += 1; | ||
235 | cond_resched(); | ||
236 | } | ||
237 | printk(PRINT_PREF "scanned %d eraseblocks, %d are bad\n", i, bad); | ||
238 | return 0; | ||
239 | } | ||
240 | |||
241 | static int __init mtd_stresstest_init(void) | ||
242 | { | ||
243 | int err; | ||
244 | int i, op; | ||
245 | uint64_t tmp; | ||
246 | |||
247 | printk(KERN_INFO "\n"); | ||
248 | printk(KERN_INFO "=================================================\n"); | ||
249 | printk(PRINT_PREF "MTD device: %d\n", dev); | ||
250 | |||
251 | mtd = get_mtd_device(NULL, dev); | ||
252 | if (IS_ERR(mtd)) { | ||
253 | err = PTR_ERR(mtd); | ||
254 | printk(PRINT_PREF "error: cannot get MTD device\n"); | ||
255 | return err; | ||
256 | } | ||
257 | |||
258 | if (mtd->writesize == 1) { | ||
259 | printk(PRINT_PREF "not NAND flash, assume page size is 512 " | ||
260 | "bytes.\n"); | ||
261 | pgsize = 512; | ||
262 | } else | ||
263 | pgsize = mtd->writesize; | ||
264 | |||
265 | tmp = mtd->size; | ||
266 | do_div(tmp, mtd->erasesize); | ||
267 | ebcnt = tmp; | ||
268 | pgcnt = mtd->erasesize / mtd->writesize; | ||
269 | |||
270 | printk(PRINT_PREF "MTD device size %llu, eraseblock size %u, " | ||
271 | "page size %u, count of eraseblocks %u, pages per " | ||
272 | "eraseblock %u, OOB size %u\n", | ||
273 | (unsigned long long)mtd->size, mtd->erasesize, | ||
274 | pgsize, ebcnt, pgcnt, mtd->oobsize); | ||
275 | |||
276 | /* Read or write up 2 eraseblocks at a time */ | ||
277 | bufsize = mtd->erasesize * 2; | ||
278 | |||
279 | err = -ENOMEM; | ||
280 | readbuf = vmalloc(bufsize); | ||
281 | writebuf = vmalloc(bufsize); | ||
282 | offsets = kmalloc(ebcnt * sizeof(int), GFP_KERNEL); | ||
283 | if (!readbuf || !writebuf || !offsets) { | ||
284 | printk(PRINT_PREF "error: cannot allocate memory\n"); | ||
285 | goto out; | ||
286 | } | ||
287 | for (i = 0; i < ebcnt; i++) | ||
288 | offsets[i] = mtd->erasesize; | ||
289 | simple_srand(current->pid); | ||
290 | for (i = 0; i < bufsize; i++) | ||
291 | writebuf[i] = simple_rand(); | ||
292 | |||
293 | err = scan_for_bad_eraseblocks(); | ||
294 | if (err) | ||
295 | goto out; | ||
296 | |||
297 | /* Do operations */ | ||
298 | printk(PRINT_PREF "doing operations\n"); | ||
299 | for (op = 0; op < count; op++) { | ||
300 | if ((op & 1023) == 0) | ||
301 | printk(PRINT_PREF "%d operations done\n", op); | ||
302 | err = do_operation(); | ||
303 | if (err) | ||
304 | goto out; | ||
305 | cond_resched(); | ||
306 | } | ||
307 | printk(PRINT_PREF "finished, %d operations done\n", op); | ||
308 | |||
309 | out: | ||
310 | kfree(offsets); | ||
311 | kfree(bbt); | ||
312 | vfree(writebuf); | ||
313 | vfree(readbuf); | ||
314 | put_mtd_device(mtd); | ||
315 | if (err) | ||
316 | printk(PRINT_PREF "error %d occurred\n", err); | ||
317 | printk(KERN_INFO "=================================================\n"); | ||
318 | return err; | ||
319 | } | ||
320 | module_init(mtd_stresstest_init); | ||
321 | |||
322 | static void __exit mtd_stresstest_exit(void) | ||
323 | { | ||
324 | return; | ||
325 | } | ||
326 | module_exit(mtd_stresstest_exit); | ||
327 | |||
328 | MODULE_DESCRIPTION("Stress test module"); | ||
329 | MODULE_AUTHOR("Adrian Hunter"); | ||
330 | MODULE_LICENSE("GPL"); | ||
diff --git a/drivers/mtd/tests/mtd_subpagetest.c b/drivers/mtd/tests/mtd_subpagetest.c new file mode 100644 index 000000000000..4c5e04d0b328 --- /dev/null +++ b/drivers/mtd/tests/mtd_subpagetest.c | |||
@@ -0,0 +1,525 @@ | |||
1 | /* | ||
2 | * Copyright (C) 2006-2007 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 sub-page read and write on MTD device. | ||
18 | * Author: Adrian Hunter <ext-adrian.hunter@nokia.com> | ||
19 | * | ||
20 | */ | ||
21 | |||
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 | |||
29 | #define PRINT_PREF KERN_INFO "mtd_subpagetest: " | ||
30 | |||
31 | static int dev; | ||
32 | module_param(dev, int, S_IRUGO); | ||
33 | MODULE_PARM_DESC(dev, "MTD device number to use"); | ||
34 | |||
35 | static struct mtd_info *mtd; | ||
36 | static unsigned char *writebuf; | ||
37 | static unsigned char *readbuf; | ||
38 | static unsigned char *bbt; | ||
39 | |||
40 | static int subpgsize; | ||
41 | static int bufsize; | ||
42 | static int ebcnt; | ||
43 | static int pgcnt; | ||
44 | static int errcnt; | ||
45 | static unsigned long next = 1; | ||
46 | |||
47 | static inline unsigned int simple_rand(void) | ||
48 | { | ||
49 | next = next * 1103515245 + 12345; | ||
50 | return (unsigned int)((next / 65536) % 32768); | ||
51 | } | ||
52 | |||
53 | static inline void simple_srand(unsigned long seed) | ||
54 | { | ||
55 | next = seed; | ||
56 | } | ||
57 | |||
58 | static void set_random_data(unsigned char *buf, size_t len) | ||
59 | { | ||
60 | size_t i; | ||
61 | |||
62 | for (i = 0; i < len; ++i) | ||
63 | buf[i] = simple_rand(); | ||
64 | } | ||
65 | |||
66 | static inline void clear_data(unsigned char *buf, size_t len) | ||
67 | { | ||
68 | memset(buf, 0, len); | ||
69 | } | ||
70 | |||
71 | static int erase_eraseblock(int ebnum) | ||
72 | { | ||
73 | int err; | ||
74 | struct erase_info ei; | ||
75 | loff_t addr = ebnum * mtd->erasesize; | ||
76 | |||
77 | memset(&ei, 0, sizeof(struct erase_info)); | ||
78 | ei.mtd = mtd; | ||
79 | ei.addr = addr; | ||
80 | ei.len = mtd->erasesize; | ||
81 | |||
82 | err = mtd->erase(mtd, &ei); | ||
83 | if (err) { | ||
84 | printk(PRINT_PREF "error %d while erasing EB %d\n", err, ebnum); | ||
85 | return err; | ||
86 | } | ||
87 | |||
88 | if (ei.state == MTD_ERASE_FAILED) { | ||
89 | printk(PRINT_PREF "some erase error occurred at EB %d\n", | ||
90 | ebnum); | ||
91 | return -EIO; | ||
92 | } | ||
93 | |||
94 | return 0; | ||
95 | } | ||
96 | |||
97 | static int erase_whole_device(void) | ||
98 | { | ||
99 | int err; | ||
100 | unsigned int i; | ||
101 | |||
102 | printk(PRINT_PREF "erasing whole device\n"); | ||
103 | for (i = 0; i < ebcnt; ++i) { | ||
104 | if (bbt[i]) | ||
105 | continue; | ||
106 | err = erase_eraseblock(i); | ||
107 | if (err) | ||
108 | return err; | ||
109 | cond_resched(); | ||
110 | } | ||
111 | printk(PRINT_PREF "erased %u eraseblocks\n", i); | ||
112 | return 0; | ||
113 | } | ||
114 | |||
115 | static int write_eraseblock(int ebnum) | ||
116 | { | ||
117 | size_t written = 0; | ||
118 | int err = 0; | ||
119 | loff_t addr = ebnum * mtd->erasesize; | ||
120 | |||
121 | set_random_data(writebuf, subpgsize); | ||
122 | err = mtd->write(mtd, addr, subpgsize, &written, writebuf); | ||
123 | if (unlikely(err || written != subpgsize)) { | ||
124 | printk(PRINT_PREF "error: write failed at %#llx\n", | ||
125 | (long long)addr); | ||
126 | if (written != subpgsize) { | ||
127 | printk(PRINT_PREF " write size: %#x\n", subpgsize); | ||
128 | printk(PRINT_PREF " written: %#x\n", written); | ||
129 | } | ||
130 | return err ? err : -1; | ||
131 | } | ||
132 | |||
133 | addr += subpgsize; | ||
134 | |||
135 | set_random_data(writebuf, subpgsize); | ||
136 | err = mtd->write(mtd, addr, subpgsize, &written, writebuf); | ||
137 | if (unlikely(err || written != subpgsize)) { | ||
138 | printk(PRINT_PREF "error: write failed at %#llx\n", | ||
139 | (long long)addr); | ||
140 | if (written != subpgsize) { | ||
141 | printk(PRINT_PREF " write size: %#x\n", subpgsize); | ||
142 | printk(PRINT_PREF " written: %#x\n", written); | ||
143 | } | ||
144 | return err ? err : -1; | ||
145 | } | ||
146 | |||
147 | return err; | ||
148 | } | ||
149 | |||
150 | static int write_eraseblock2(int ebnum) | ||
151 | { | ||
152 | size_t written = 0; | ||
153 | int err = 0, k; | ||
154 | loff_t addr = ebnum * mtd->erasesize; | ||
155 | |||
156 | for (k = 1; k < 33; ++k) { | ||
157 | if (addr + (subpgsize * k) > (ebnum + 1) * mtd->erasesize) | ||
158 | break; | ||
159 | set_random_data(writebuf, subpgsize * k); | ||
160 | err = mtd->write(mtd, addr, subpgsize * k, &written, writebuf); | ||
161 | if (unlikely(err || written != subpgsize * k)) { | ||
162 | printk(PRINT_PREF "error: write failed at %#llx\n", | ||
163 | (long long)addr); | ||
164 | if (written != subpgsize) { | ||
165 | printk(PRINT_PREF " write size: %#x\n", | ||
166 | subpgsize * k); | ||
167 | printk(PRINT_PREF " written: %#08x\n", | ||
168 | written); | ||
169 | } | ||
170 | return err ? err : -1; | ||
171 | } | ||
172 | addr += subpgsize * k; | ||
173 | } | ||
174 | |||
175 | return err; | ||
176 | } | ||
177 | |||
178 | static void print_subpage(unsigned char *p) | ||
179 | { | ||
180 | int i, j; | ||
181 | |||
182 | for (i = 0; i < subpgsize; ) { | ||
183 | for (j = 0; i < subpgsize && j < 32; ++i, ++j) | ||
184 | printk("%02x", *p++); | ||
185 | printk("\n"); | ||
186 | } | ||
187 | } | ||
188 | |||
189 | static int verify_eraseblock(int ebnum) | ||
190 | { | ||
191 | size_t read = 0; | ||
192 | int err = 0; | ||
193 | loff_t addr = ebnum * mtd->erasesize; | ||
194 | |||
195 | set_random_data(writebuf, subpgsize); | ||
196 | clear_data(readbuf, subpgsize); | ||
197 | read = 0; | ||
198 | err = mtd->read(mtd, addr, subpgsize, &read, readbuf); | ||
199 | if (unlikely(err || read != subpgsize)) { | ||
200 | if (err == -EUCLEAN && read == subpgsize) { | ||
201 | printk(PRINT_PREF "ECC correction at %#llx\n", | ||
202 | (long long)addr); | ||
203 | err = 0; | ||
204 | } else { | ||
205 | printk(PRINT_PREF "error: read failed at %#llx\n", | ||
206 | (long long)addr); | ||
207 | return err ? err : -1; | ||
208 | } | ||
209 | } | ||
210 | if (unlikely(memcmp(readbuf, writebuf, subpgsize))) { | ||
211 | printk(PRINT_PREF "error: verify failed at %#llx\n", | ||
212 | (long long)addr); | ||
213 | printk(PRINT_PREF "------------- written----------------\n"); | ||
214 | print_subpage(writebuf); | ||
215 | printk(PRINT_PREF "------------- read ------------------\n"); | ||
216 | print_subpage(readbuf); | ||
217 | printk(PRINT_PREF "-------------------------------------\n"); | ||
218 | errcnt += 1; | ||
219 | } | ||
220 | |||
221 | addr += subpgsize; | ||
222 | |||
223 | set_random_data(writebuf, subpgsize); | ||
224 | clear_data(readbuf, subpgsize); | ||
225 | read = 0; | ||
226 | err = mtd->read(mtd, addr, subpgsize, &read, readbuf); | ||
227 | if (unlikely(err || read != subpgsize)) { | ||
228 | if (err == -EUCLEAN && read == subpgsize) { | ||
229 | printk(PRINT_PREF "ECC correction at %#llx\n", | ||
230 | (long long)addr); | ||
231 | err = 0; | ||
232 | } else { | ||
233 | printk(PRINT_PREF "error: read failed at %#llx\n", | ||
234 | (long long)addr); | ||
235 | return err ? err : -1; | ||
236 | } | ||
237 | } | ||
238 | if (unlikely(memcmp(readbuf, writebuf, subpgsize))) { | ||
239 | printk(PRINT_PREF "error: verify failed at %#llx\n", | ||
240 | (long long)addr); | ||
241 | printk(PRINT_PREF "------------- written----------------\n"); | ||
242 | print_subpage(writebuf); | ||
243 | printk(PRINT_PREF "------------- read ------------------\n"); | ||
244 | print_subpage(readbuf); | ||
245 | printk(PRINT_PREF "-------------------------------------\n"); | ||
246 | errcnt += 1; | ||
247 | } | ||
248 | |||
249 | return err; | ||
250 | } | ||
251 | |||
252 | static int verify_eraseblock2(int ebnum) | ||
253 | { | ||
254 | size_t read = 0; | ||
255 | int err = 0, k; | ||
256 | loff_t addr = ebnum * mtd->erasesize; | ||
257 | |||
258 | for (k = 1; k < 33; ++k) { | ||
259 | if (addr + (subpgsize * k) > (ebnum + 1) * mtd->erasesize) | ||
260 | break; | ||
261 | set_random_data(writebuf, subpgsize * k); | ||
262 | clear_data(readbuf, subpgsize * k); | ||
263 | read = 0; | ||
264 | err = mtd->read(mtd, addr, subpgsize * k, &read, readbuf); | ||
265 | if (unlikely(err || read != subpgsize * k)) { | ||
266 | if (err == -EUCLEAN && read == subpgsize * k) { | ||
267 | printk(PRINT_PREF "ECC correction at %#llx\n", | ||
268 | (long long)addr); | ||
269 | err = 0; | ||
270 | } else { | ||
271 | printk(PRINT_PREF "error: read failed at " | ||
272 | "%#llx\n", (long long)addr); | ||
273 | return err ? err : -1; | ||
274 | } | ||
275 | } | ||
276 | if (unlikely(memcmp(readbuf, writebuf, subpgsize * k))) { | ||
277 | printk(PRINT_PREF "error: verify failed at %#llx\n", | ||
278 | (long long)addr); | ||
279 | errcnt += 1; | ||
280 | } | ||
281 | addr += subpgsize * k; | ||
282 | } | ||
283 | |||
284 | return err; | ||
285 | } | ||
286 | |||
287 | static int verify_eraseblock_ff(int ebnum) | ||
288 | { | ||
289 | uint32_t j; | ||
290 | size_t read = 0; | ||
291 | int err = 0; | ||
292 | loff_t addr = ebnum * mtd->erasesize; | ||
293 | |||
294 | memset(writebuf, 0xff, subpgsize); | ||
295 | for (j = 0; j < mtd->erasesize / subpgsize; ++j) { | ||
296 | clear_data(readbuf, subpgsize); | ||
297 | read = 0; | ||
298 | err = mtd->read(mtd, addr, subpgsize, &read, readbuf); | ||
299 | if (unlikely(err || read != subpgsize)) { | ||
300 | if (err == -EUCLEAN && read == subpgsize) { | ||
301 | printk(PRINT_PREF "ECC correction at %#llx\n", | ||
302 | (long long)addr); | ||
303 | err = 0; | ||
304 | } else { | ||
305 | printk(PRINT_PREF "error: read failed at " | ||
306 | "%#llx\n", (long long)addr); | ||
307 | return err ? err : -1; | ||
308 | } | ||
309 | } | ||
310 | if (unlikely(memcmp(readbuf, writebuf, subpgsize))) { | ||
311 | printk(PRINT_PREF "error: verify 0xff failed at " | ||
312 | "%#llx\n", (long long)addr); | ||
313 | errcnt += 1; | ||
314 | } | ||
315 | addr += subpgsize; | ||
316 | } | ||
317 | |||
318 | return err; | ||
319 | } | ||
320 | |||
321 | static int verify_all_eraseblocks_ff(void) | ||
322 | { | ||
323 | int err; | ||
324 | unsigned int i; | ||
325 | |||
326 | printk(PRINT_PREF "verifying all eraseblocks for 0xff\n"); | ||
327 | for (i = 0; i < ebcnt; ++i) { | ||
328 | if (bbt[i]) | ||
329 | continue; | ||
330 | err = verify_eraseblock_ff(i); | ||
331 | if (err) | ||
332 | return err; | ||
333 | if (i % 256 == 0) | ||
334 | printk(PRINT_PREF "verified up to eraseblock %u\n", i); | ||
335 | cond_resched(); | ||
336 | } | ||
337 | printk(PRINT_PREF "verified %u eraseblocks\n", i); | ||
338 | return 0; | ||
339 | } | ||
340 | |||
341 | static int is_block_bad(int ebnum) | ||
342 | { | ||
343 | loff_t addr = ebnum * mtd->erasesize; | ||
344 | int ret; | ||
345 | |||
346 | ret = mtd->block_isbad(mtd, addr); | ||
347 | if (ret) | ||
348 | printk(PRINT_PREF "block %d is bad\n", ebnum); | ||
349 | return ret; | ||
350 | } | ||
351 | |||
352 | static int scan_for_bad_eraseblocks(void) | ||
353 | { | ||
354 | int i, bad = 0; | ||
355 | |||
356 | bbt = kmalloc(ebcnt, GFP_KERNEL); | ||
357 | if (!bbt) { | ||
358 | printk(PRINT_PREF "error: cannot allocate memory\n"); | ||
359 | return -ENOMEM; | ||
360 | } | ||
361 | memset(bbt, 0 , ebcnt); | ||
362 | |||
363 | printk(PRINT_PREF "scanning for bad eraseblocks\n"); | ||
364 | for (i = 0; i < ebcnt; ++i) { | ||
365 | bbt[i] = is_block_bad(i) ? 1 : 0; | ||
366 | if (bbt[i]) | ||
367 | bad += 1; | ||
368 | cond_resched(); | ||
369 | } | ||
370 | printk(PRINT_PREF "scanned %d eraseblocks, %d are bad\n", i, bad); | ||
371 | return 0; | ||
372 | } | ||
373 | |||
374 | static int __init mtd_subpagetest_init(void) | ||
375 | { | ||
376 | int err = 0; | ||
377 | uint32_t i; | ||
378 | uint64_t tmp; | ||
379 | |||
380 | printk(KERN_INFO "\n"); | ||
381 | printk(KERN_INFO "=================================================\n"); | ||
382 | printk(PRINT_PREF "MTD device: %d\n", dev); | ||
383 | |||
384 | mtd = get_mtd_device(NULL, dev); | ||
385 | if (IS_ERR(mtd)) { | ||
386 | err = PTR_ERR(mtd); | ||
387 | printk(PRINT_PREF "error: cannot get MTD device\n"); | ||
388 | return err; | ||
389 | } | ||
390 | |||
391 | if (mtd->type != MTD_NANDFLASH) { | ||
392 | printk(PRINT_PREF "this test requires NAND flash\n"); | ||
393 | goto out; | ||
394 | } | ||
395 | |||
396 | subpgsize = mtd->writesize >> mtd->subpage_sft; | ||
397 | printk(PRINT_PREF "MTD device size %llu, eraseblock size %u, " | ||
398 | "page size %u, subpage size %u, count of eraseblocks %u, " | ||
399 | "pages per eraseblock %u, OOB size %u\n", | ||
400 | (unsigned long long)mtd->size, mtd->erasesize, | ||
401 | mtd->writesize, subpgsize, ebcnt, pgcnt, mtd->oobsize); | ||
402 | |||
403 | err = -ENOMEM; | ||
404 | bufsize = subpgsize * 32; | ||
405 | writebuf = kmalloc(bufsize, GFP_KERNEL); | ||
406 | if (!writebuf) { | ||
407 | printk(PRINT_PREF "error: cannot allocate memory\n"); | ||
408 | goto out; | ||
409 | } | ||
410 | readbuf = kmalloc(bufsize, GFP_KERNEL); | ||
411 | if (!readbuf) { | ||
412 | printk(PRINT_PREF "error: cannot allocate memory\n"); | ||
413 | goto out; | ||
414 | } | ||
415 | |||
416 | tmp = mtd->size; | ||
417 | do_div(tmp, mtd->erasesize); | ||
418 | ebcnt = tmp; | ||
419 | pgcnt = mtd->erasesize / mtd->writesize; | ||
420 | |||
421 | err = scan_for_bad_eraseblocks(); | ||
422 | if (err) | ||
423 | goto out; | ||
424 | |||
425 | err = erase_whole_device(); | ||
426 | if (err) | ||
427 | goto out; | ||
428 | |||
429 | printk(PRINT_PREF "writing whole device\n"); | ||
430 | simple_srand(1); | ||
431 | for (i = 0; i < ebcnt; ++i) { | ||
432 | if (bbt[i]) | ||
433 | continue; | ||
434 | err = write_eraseblock(i); | ||
435 | if (unlikely(err)) | ||
436 | goto out; | ||
437 | if (i % 256 == 0) | ||
438 | printk(PRINT_PREF "written up to eraseblock %u\n", i); | ||
439 | cond_resched(); | ||
440 | } | ||
441 | printk(PRINT_PREF "written %u eraseblocks\n", i); | ||
442 | |||
443 | simple_srand(1); | ||
444 | printk(PRINT_PREF "verifying all eraseblocks\n"); | ||
445 | for (i = 0; i < ebcnt; ++i) { | ||
446 | if (bbt[i]) | ||
447 | continue; | ||
448 | err = verify_eraseblock(i); | ||
449 | if (unlikely(err)) | ||
450 | goto out; | ||
451 | if (i % 256 == 0) | ||
452 | printk(PRINT_PREF "verified up to eraseblock %u\n", i); | ||
453 | cond_resched(); | ||
454 | } | ||
455 | printk(PRINT_PREF "verified %u eraseblocks\n", i); | ||
456 | |||
457 | err = erase_whole_device(); | ||
458 | if (err) | ||
459 | goto out; | ||
460 | |||
461 | err = verify_all_eraseblocks_ff(); | ||
462 | if (err) | ||
463 | goto out; | ||
464 | |||
465 | /* Write all eraseblocks */ | ||
466 | simple_srand(3); | ||
467 | printk(PRINT_PREF "writing whole device\n"); | ||
468 | for (i = 0; i < ebcnt; ++i) { | ||
469 | if (bbt[i]) | ||
470 | continue; | ||
471 | err = write_eraseblock2(i); | ||
472 | if (unlikely(err)) | ||
473 | goto out; | ||
474 | if (i % 256 == 0) | ||
475 | printk(PRINT_PREF "written up to eraseblock %u\n", i); | ||
476 | cond_resched(); | ||
477 | } | ||
478 | printk(PRINT_PREF "written %u eraseblocks\n", i); | ||
479 | |||
480 | /* Check all eraseblocks */ | ||
481 | simple_srand(3); | ||
482 | printk(PRINT_PREF "verifying all eraseblocks\n"); | ||
483 | for (i = 0; i < ebcnt; ++i) { | ||
484 | if (bbt[i]) | ||
485 | continue; | ||
486 | err = verify_eraseblock2(i); | ||
487 | if (unlikely(err)) | ||
488 | goto out; | ||
489 | if (i % 256 == 0) | ||
490 | printk(PRINT_PREF "verified up to eraseblock %u\n", i); | ||
491 | cond_resched(); | ||
492 | } | ||
493 | printk(PRINT_PREF "verified %u eraseblocks\n", i); | ||
494 | |||
495 | err = erase_whole_device(); | ||
496 | if (err) | ||
497 | goto out; | ||
498 | |||
499 | err = verify_all_eraseblocks_ff(); | ||
500 | if (err) | ||
501 | goto out; | ||
502 | |||
503 | printk(PRINT_PREF "finished with %d errors\n", errcnt); | ||
504 | |||
505 | out: | ||
506 | kfree(bbt); | ||
507 | kfree(readbuf); | ||
508 | kfree(writebuf); | ||
509 | put_mtd_device(mtd); | ||
510 | if (err) | ||
511 | printk(PRINT_PREF "error %d occurred\n", err); | ||
512 | printk(KERN_INFO "=================================================\n"); | ||
513 | return err; | ||
514 | } | ||
515 | module_init(mtd_subpagetest_init); | ||
516 | |||
517 | static void __exit mtd_subpagetest_exit(void) | ||
518 | { | ||
519 | return; | ||
520 | } | ||
521 | module_exit(mtd_subpagetest_exit); | ||
522 | |||
523 | MODULE_DESCRIPTION("Subpage test module"); | ||
524 | MODULE_AUTHOR("Adrian Hunter"); | ||
525 | MODULE_LICENSE("GPL"); | ||
diff --git a/drivers/mtd/tests/mtd_torturetest.c b/drivers/mtd/tests/mtd_torturetest.c new file mode 100644 index 000000000000..2928d9e84eae --- /dev/null +++ b/drivers/mtd/tests/mtd_torturetest.c | |||
@@ -0,0 +1,530 @@ | |||
1 | /* | ||
2 | * Copyright (C) 2006-2008 Artem Bityutskiy | ||
3 | * Copyright (C) 2006-2008 Jarkko Lavinen | ||
4 | * Copyright (C) 2006-2008 Adrian Hunter | ||
5 | * | ||
6 | * This program is free software; you can redistribute it and/or modify it | ||
7 | * under the terms of the GNU General Public License version 2 as published by | ||
8 | * the Free Software Foundation. | ||
9 | * | ||
10 | * This program is distributed in the hope that it will be useful, but WITHOUT | ||
11 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | ||
12 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for | ||
13 | * more details. | ||
14 | * | ||
15 | * You should have received a copy of the GNU General Public License along with | ||
16 | * this program; see the file COPYING. If not, write to the Free Software | ||
17 | * Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. | ||
18 | * | ||
19 | * Authors: Artem Bityutskiy, Jarkko Lavinen, Adria Hunter | ||
20 | * | ||
21 | * WARNING: this test program may kill your flash and your device. Do not | ||
22 | * use it unless you know what you do. Authors are not responsible for any | ||
23 | * damage caused by this program. | ||
24 | */ | ||
25 | |||
26 | #include <linux/init.h> | ||
27 | #include <linux/module.h> | ||
28 | #include <linux/moduleparam.h> | ||
29 | #include <linux/err.h> | ||
30 | #include <linux/mtd/mtd.h> | ||
31 | #include <linux/sched.h> | ||
32 | |||
33 | #define PRINT_PREF KERN_INFO "mtd_torturetest: " | ||
34 | #define RETRIES 3 | ||
35 | |||
36 | static int eb = 8; | ||
37 | module_param(eb, int, S_IRUGO); | ||
38 | MODULE_PARM_DESC(eb, "eraseblock number within the selected MTD device"); | ||
39 | |||
40 | static int ebcnt = 32; | ||
41 | module_param(ebcnt, int, S_IRUGO); | ||
42 | MODULE_PARM_DESC(ebcnt, "number of consecutive eraseblocks to torture"); | ||
43 | |||
44 | static int pgcnt; | ||
45 | module_param(pgcnt, int, S_IRUGO); | ||
46 | MODULE_PARM_DESC(pgcnt, "number of pages per eraseblock to torture (0 => all)"); | ||
47 | |||
48 | static int dev; | ||
49 | module_param(dev, int, S_IRUGO); | ||
50 | MODULE_PARM_DESC(dev, "MTD device number to use"); | ||
51 | |||
52 | static int gran = 512; | ||
53 | module_param(gran, int, S_IRUGO); | ||
54 | MODULE_PARM_DESC(gran, "how often the status information should be printed"); | ||
55 | |||
56 | static int check = 1; | ||
57 | module_param(check, int, S_IRUGO); | ||
58 | MODULE_PARM_DESC(check, "if the written data should be checked"); | ||
59 | |||
60 | static unsigned int cycles_count; | ||
61 | module_param(cycles_count, uint, S_IRUGO); | ||
62 | MODULE_PARM_DESC(cycles_count, "how many erase cycles to do " | ||
63 | "(infinite by default)"); | ||
64 | |||
65 | static struct mtd_info *mtd; | ||
66 | |||
67 | /* This buffer contains 0x555555...0xAAAAAA... pattern */ | ||
68 | static unsigned char *patt_5A5; | ||
69 | /* This buffer contains 0xAAAAAA...0x555555... pattern */ | ||
70 | static unsigned char *patt_A5A; | ||
71 | /* This buffer contains all 0xFF bytes */ | ||
72 | static unsigned char *patt_FF; | ||
73 | /* This a temporary buffer is use when checking data */ | ||
74 | static unsigned char *check_buf; | ||
75 | /* How many erase cycles were done */ | ||
76 | static unsigned int erase_cycles; | ||
77 | |||
78 | static int pgsize; | ||
79 | static struct timeval start, finish; | ||
80 | |||
81 | static void report_corrupt(unsigned char *read, unsigned char *written); | ||
82 | |||
83 | static inline void start_timing(void) | ||
84 | { | ||
85 | do_gettimeofday(&start); | ||
86 | } | ||
87 | |||
88 | static inline void stop_timing(void) | ||
89 | { | ||
90 | do_gettimeofday(&finish); | ||
91 | } | ||
92 | |||
93 | /* | ||
94 | * Erase eraseblock number @ebnum. | ||
95 | */ | ||
96 | static inline int erase_eraseblock(int ebnum) | ||
97 | { | ||
98 | int err; | ||
99 | struct erase_info ei; | ||
100 | loff_t addr = ebnum * mtd->erasesize; | ||
101 | |||
102 | memset(&ei, 0, sizeof(struct erase_info)); | ||
103 | ei.mtd = mtd; | ||
104 | ei.addr = addr; | ||
105 | ei.len = mtd->erasesize; | ||
106 | |||
107 | err = mtd->erase(mtd, &ei); | ||
108 | if (err) { | ||
109 | printk(PRINT_PREF "error %d while erasing EB %d\n", err, ebnum); | ||
110 | return err; | ||
111 | } | ||
112 | |||
113 | if (ei.state == MTD_ERASE_FAILED) { | ||
114 | printk(PRINT_PREF "some erase error occurred at EB %d\n", | ||
115 | ebnum); | ||
116 | return -EIO; | ||
117 | } | ||
118 | |||
119 | return 0; | ||
120 | } | ||
121 | |||
122 | /* | ||
123 | * Check that the contents of eraseblock number @enbum is equivalent to the | ||
124 | * @buf buffer. | ||
125 | */ | ||
126 | static inline int check_eraseblock(int ebnum, unsigned char *buf) | ||
127 | { | ||
128 | int err, retries = 0; | ||
129 | size_t read = 0; | ||
130 | loff_t addr = ebnum * mtd->erasesize; | ||
131 | size_t len = mtd->erasesize; | ||
132 | |||
133 | if (pgcnt) { | ||
134 | addr = (ebnum + 1) * mtd->erasesize - pgcnt * pgsize; | ||
135 | len = pgcnt * pgsize; | ||
136 | } | ||
137 | |||
138 | retry: | ||
139 | err = mtd->read(mtd, addr, len, &read, check_buf); | ||
140 | if (err == -EUCLEAN) | ||
141 | printk(PRINT_PREF "single bit flip occurred at EB %d " | ||
142 | "MTD reported that it was fixed.\n", ebnum); | ||
143 | else if (err) { | ||
144 | printk(PRINT_PREF "error %d while reading EB %d, " | ||
145 | "read %zd\n", err, ebnum, read); | ||
146 | return err; | ||
147 | } | ||
148 | |||
149 | if (read != len) { | ||
150 | printk(PRINT_PREF "failed to read %zd bytes from EB %d, " | ||
151 | "read only %zd, but no error reported\n", | ||
152 | len, ebnum, read); | ||
153 | return -EIO; | ||
154 | } | ||
155 | |||
156 | if (memcmp(buf, check_buf, len)) { | ||
157 | printk(PRINT_PREF "read wrong data from EB %d\n", ebnum); | ||
158 | report_corrupt(check_buf, buf); | ||
159 | |||
160 | if (retries++ < RETRIES) { | ||
161 | /* Try read again */ | ||
162 | yield(); | ||
163 | printk(PRINT_PREF "re-try reading data from EB %d\n", | ||
164 | ebnum); | ||
165 | goto retry; | ||
166 | } else { | ||
167 | printk(PRINT_PREF "retried %d times, still errors, " | ||
168 | "give-up\n", RETRIES); | ||
169 | return -EINVAL; | ||
170 | } | ||
171 | } | ||
172 | |||
173 | if (retries != 0) | ||
174 | printk(PRINT_PREF "only attempt number %d was OK (!!!)\n", | ||
175 | retries); | ||
176 | |||
177 | return 0; | ||
178 | } | ||
179 | |||
180 | static inline int write_pattern(int ebnum, void *buf) | ||
181 | { | ||
182 | int err; | ||
183 | size_t written = 0; | ||
184 | loff_t addr = ebnum * mtd->erasesize; | ||
185 | size_t len = mtd->erasesize; | ||
186 | |||
187 | if (pgcnt) { | ||
188 | addr = (ebnum + 1) * mtd->erasesize - pgcnt * pgsize; | ||
189 | len = pgcnt * pgsize; | ||
190 | } | ||
191 | err = mtd->write(mtd, addr, len, &written, buf); | ||
192 | if (err) { | ||
193 | printk(PRINT_PREF "error %d while writing EB %d, written %zd" | ||
194 | " bytes\n", err, ebnum, written); | ||
195 | return err; | ||
196 | } | ||
197 | if (written != len) { | ||
198 | printk(PRINT_PREF "written only %zd bytes of %zd, but no error" | ||
199 | " reported\n", written, len); | ||
200 | return -EIO; | ||
201 | } | ||
202 | |||
203 | return 0; | ||
204 | } | ||
205 | |||
206 | static int __init tort_init(void) | ||
207 | { | ||
208 | int err = 0, i, infinite = !cycles_count; | ||
209 | int bad_ebs[ebcnt]; | ||
210 | |||
211 | printk(KERN_INFO "\n"); | ||
212 | printk(KERN_INFO "=================================================\n"); | ||
213 | printk(PRINT_PREF "Warning: this program is trying to wear out your " | ||
214 | "flash, stop it if this is not wanted.\n"); | ||
215 | printk(PRINT_PREF "MTD device: %d\n", dev); | ||
216 | printk(PRINT_PREF "torture %d eraseblocks (%d-%d) of mtd%d\n", | ||
217 | ebcnt, eb, eb + ebcnt - 1, dev); | ||
218 | if (pgcnt) | ||
219 | printk(PRINT_PREF "torturing just %d pages per eraseblock\n", | ||
220 | pgcnt); | ||
221 | printk(PRINT_PREF "write verify %s\n", check ? "enabled" : "disabled"); | ||
222 | |||
223 | mtd = get_mtd_device(NULL, dev); | ||
224 | if (IS_ERR(mtd)) { | ||
225 | err = PTR_ERR(mtd); | ||
226 | printk(PRINT_PREF "error: cannot get MTD device\n"); | ||
227 | return err; | ||
228 | } | ||
229 | |||
230 | if (mtd->writesize == 1) { | ||
231 | printk(PRINT_PREF "not NAND flash, assume page size is 512 " | ||
232 | "bytes.\n"); | ||
233 | pgsize = 512; | ||
234 | } else | ||
235 | pgsize = mtd->writesize; | ||
236 | |||
237 | if (pgcnt && (pgcnt > mtd->erasesize / pgsize || pgcnt < 0)) { | ||
238 | printk(PRINT_PREF "error: invalid pgcnt value %d\n", pgcnt); | ||
239 | goto out_mtd; | ||
240 | } | ||
241 | |||
242 | err = -ENOMEM; | ||
243 | patt_5A5 = kmalloc(mtd->erasesize, GFP_KERNEL); | ||
244 | if (!patt_5A5) { | ||
245 | printk(PRINT_PREF "error: cannot allocate memory\n"); | ||
246 | goto out_mtd; | ||
247 | } | ||
248 | |||
249 | patt_A5A = kmalloc(mtd->erasesize, GFP_KERNEL); | ||
250 | if (!patt_A5A) { | ||
251 | printk(PRINT_PREF "error: cannot allocate memory\n"); | ||
252 | goto out_patt_5A5; | ||
253 | } | ||
254 | |||
255 | patt_FF = kmalloc(mtd->erasesize, GFP_KERNEL); | ||
256 | if (!patt_FF) { | ||
257 | printk(PRINT_PREF "error: cannot allocate memory\n"); | ||
258 | goto out_patt_A5A; | ||
259 | } | ||
260 | |||
261 | check_buf = kmalloc(mtd->erasesize, GFP_KERNEL); | ||
262 | if (!check_buf) { | ||
263 | printk(PRINT_PREF "error: cannot allocate memory\n"); | ||
264 | goto out_patt_FF; | ||
265 | } | ||
266 | |||
267 | err = 0; | ||
268 | |||
269 | /* Initialize patterns */ | ||
270 | memset(patt_FF, 0xFF, mtd->erasesize); | ||
271 | for (i = 0; i < mtd->erasesize / pgsize; i++) { | ||
272 | if (!(i & 1)) { | ||
273 | memset(patt_5A5 + i * pgsize, 0x55, pgsize); | ||
274 | memset(patt_A5A + i * pgsize, 0xAA, pgsize); | ||
275 | } else { | ||
276 | memset(patt_5A5 + i * pgsize, 0xAA, pgsize); | ||
277 | memset(patt_A5A + i * pgsize, 0x55, pgsize); | ||
278 | } | ||
279 | } | ||
280 | |||
281 | /* | ||
282 | * Check if there is a bad eraseblock among those we are going to test. | ||
283 | */ | ||
284 | memset(&bad_ebs[0], 0, sizeof(int) * ebcnt); | ||
285 | if (mtd->block_isbad) { | ||
286 | for (i = eb; i < eb + ebcnt; i++) { | ||
287 | err = mtd->block_isbad(mtd, | ||
288 | (loff_t)i * mtd->erasesize); | ||
289 | |||
290 | if (err < 0) { | ||
291 | printk(PRINT_PREF "block_isbad() returned %d " | ||
292 | "for EB %d\n", err, i); | ||
293 | goto out; | ||
294 | } | ||
295 | |||
296 | if (err) { | ||
297 | printk("EB %d is bad. Skip it.\n", i); | ||
298 | bad_ebs[i - eb] = 1; | ||
299 | } | ||
300 | } | ||
301 | } | ||
302 | |||
303 | start_timing(); | ||
304 | while (1) { | ||
305 | int i; | ||
306 | void *patt; | ||
307 | |||
308 | /* Erase all eraseblocks */ | ||
309 | for (i = eb; i < eb + ebcnt; i++) { | ||
310 | if (bad_ebs[i - eb]) | ||
311 | continue; | ||
312 | err = erase_eraseblock(i); | ||
313 | if (err) | ||
314 | goto out; | ||
315 | cond_resched(); | ||
316 | } | ||
317 | |||
318 | /* Check if the eraseblocks contain only 0xFF bytes */ | ||
319 | if (check) { | ||
320 | for (i = eb; i < eb + ebcnt; i++) { | ||
321 | if (bad_ebs[i - eb]) | ||
322 | continue; | ||
323 | err = check_eraseblock(i, patt_FF); | ||
324 | if (err) { | ||
325 | printk(PRINT_PREF "verify failed" | ||
326 | " for 0xFF... pattern\n"); | ||
327 | goto out; | ||
328 | } | ||
329 | cond_resched(); | ||
330 | } | ||
331 | } | ||
332 | |||
333 | /* Write the pattern */ | ||
334 | for (i = eb; i < eb + ebcnt; i++) { | ||
335 | if (bad_ebs[i - eb]) | ||
336 | continue; | ||
337 | if ((eb + erase_cycles) & 1) | ||
338 | patt = patt_5A5; | ||
339 | else | ||
340 | patt = patt_A5A; | ||
341 | err = write_pattern(i, patt); | ||
342 | if (err) | ||
343 | goto out; | ||
344 | cond_resched(); | ||
345 | } | ||
346 | |||
347 | /* Verify what we wrote */ | ||
348 | if (check) { | ||
349 | for (i = eb; i < eb + ebcnt; i++) { | ||
350 | if (bad_ebs[i - eb]) | ||
351 | continue; | ||
352 | if ((eb + erase_cycles) & 1) | ||
353 | patt = patt_5A5; | ||
354 | else | ||
355 | patt = patt_A5A; | ||
356 | err = check_eraseblock(i, patt); | ||
357 | if (err) { | ||
358 | printk(PRINT_PREF "verify failed for %s" | ||
359 | " pattern\n", | ||
360 | ((eb + erase_cycles) & 1) ? | ||
361 | "0x55AA55..." : "0xAA55AA..."); | ||
362 | goto out; | ||
363 | } | ||
364 | cond_resched(); | ||
365 | } | ||
366 | } | ||
367 | |||
368 | erase_cycles += 1; | ||
369 | |||
370 | if (erase_cycles % gran == 0) { | ||
371 | long ms; | ||
372 | |||
373 | stop_timing(); | ||
374 | ms = (finish.tv_sec - start.tv_sec) * 1000 + | ||
375 | (finish.tv_usec - start.tv_usec) / 1000; | ||
376 | printk(PRINT_PREF "%08u erase cycles done, took %lu " | ||
377 | "milliseconds (%lu seconds)\n", | ||
378 | erase_cycles, ms, ms / 1000); | ||
379 | start_timing(); | ||
380 | } | ||
381 | |||
382 | if (!infinite && --cycles_count == 0) | ||
383 | break; | ||
384 | } | ||
385 | out: | ||
386 | |||
387 | printk(PRINT_PREF "finished after %u erase cycles\n", | ||
388 | erase_cycles); | ||
389 | kfree(check_buf); | ||
390 | out_patt_FF: | ||
391 | kfree(patt_FF); | ||
392 | out_patt_A5A: | ||
393 | kfree(patt_A5A); | ||
394 | out_patt_5A5: | ||
395 | kfree(patt_5A5); | ||
396 | out_mtd: | ||
397 | put_mtd_device(mtd); | ||
398 | if (err) | ||
399 | printk(PRINT_PREF "error %d occurred during torturing\n", err); | ||
400 | printk(KERN_INFO "=================================================\n"); | ||
401 | return err; | ||
402 | } | ||
403 | module_init(tort_init); | ||
404 | |||
405 | static void __exit tort_exit(void) | ||
406 | { | ||
407 | return; | ||
408 | } | ||
409 | module_exit(tort_exit); | ||
410 | |||
411 | static int countdiffs(unsigned char *buf, unsigned char *check_buf, | ||
412 | unsigned offset, unsigned len, unsigned *bytesp, | ||
413 | unsigned *bitsp); | ||
414 | static void print_bufs(unsigned char *read, unsigned char *written, int start, | ||
415 | int len); | ||
416 | |||
417 | /* | ||
418 | * Report the detailed information about how the read EB differs from what was | ||
419 | * written. | ||
420 | */ | ||
421 | static void report_corrupt(unsigned char *read, unsigned char *written) | ||
422 | { | ||
423 | int i; | ||
424 | int bytes, bits, pages, first; | ||
425 | int offset, len; | ||
426 | size_t check_len = mtd->erasesize; | ||
427 | |||
428 | if (pgcnt) | ||
429 | check_len = pgcnt * pgsize; | ||
430 | |||
431 | bytes = bits = pages = 0; | ||
432 | for (i = 0; i < check_len; i += pgsize) | ||
433 | if (countdiffs(written, read, i, pgsize, &bytes, | ||
434 | &bits) >= 0) | ||
435 | pages++; | ||
436 | |||
437 | printk(PRINT_PREF "verify fails on %d pages, %d bytes/%d bits\n", | ||
438 | pages, bytes, bits); | ||
439 | printk(PRINT_PREF "The following is a list of all differences between" | ||
440 | " what was read from flash and what was expected\n"); | ||
441 | |||
442 | for (i = 0; i < check_len; i += pgsize) { | ||
443 | cond_resched(); | ||
444 | bytes = bits = 0; | ||
445 | first = countdiffs(written, read, i, pgsize, &bytes, | ||
446 | &bits); | ||
447 | if (first < 0) | ||
448 | continue; | ||
449 | |||
450 | printk("-------------------------------------------------------" | ||
451 | "----------------------------------\n"); | ||
452 | |||
453 | printk(PRINT_PREF "Page %d has %d bytes/%d bits failing verify," | ||
454 | " starting at offset 0x%x\n", | ||
455 | (mtd->erasesize - check_len + i) / pgsize, | ||
456 | bytes, bits, first); | ||
457 | |||
458 | offset = first & ~0x7; | ||
459 | len = ((first + bytes) | 0x7) + 1 - offset; | ||
460 | |||
461 | print_bufs(read, written, offset, len); | ||
462 | } | ||
463 | } | ||
464 | |||
465 | static void print_bufs(unsigned char *read, unsigned char *written, int start, | ||
466 | int len) | ||
467 | { | ||
468 | int i = 0, j1, j2; | ||
469 | char *diff; | ||
470 | |||
471 | printk("Offset Read Written\n"); | ||
472 | while (i < len) { | ||
473 | printk("0x%08x: ", start + i); | ||
474 | diff = " "; | ||
475 | for (j1 = 0; j1 < 8 && i + j1 < len; j1++) { | ||
476 | printk(" %02x", read[start + i + j1]); | ||
477 | if (read[start + i + j1] != written[start + i + j1]) | ||
478 | diff = "***"; | ||
479 | } | ||
480 | |||
481 | while (j1 < 8) { | ||
482 | printk(" "); | ||
483 | j1 += 1; | ||
484 | } | ||
485 | |||
486 | printk(" %s ", diff); | ||
487 | |||
488 | for (j2 = 0; j2 < 8 && i + j2 < len; j2++) | ||
489 | printk(" %02x", written[start + i + j2]); | ||
490 | printk("\n"); | ||
491 | i += 8; | ||
492 | } | ||
493 | } | ||
494 | |||
495 | /* | ||
496 | * Count the number of differing bytes and bits and return the first differing | ||
497 | * offset. | ||
498 | */ | ||
499 | static int countdiffs(unsigned char *buf, unsigned char *check_buf, | ||
500 | unsigned offset, unsigned len, unsigned *bytesp, | ||
501 | unsigned *bitsp) | ||
502 | { | ||
503 | unsigned i, bit; | ||
504 | int first = -1; | ||
505 | |||
506 | for (i = offset; i < offset + len; i++) | ||
507 | if (buf[i] != check_buf[i]) { | ||
508 | first = i; | ||
509 | break; | ||
510 | } | ||
511 | |||
512 | while (i < offset + len) { | ||
513 | if (buf[i] != check_buf[i]) { | ||
514 | (*bytesp)++; | ||
515 | bit = 1; | ||
516 | while (bit < 256) { | ||
517 | if ((buf[i] & bit) != (check_buf[i] & bit)) | ||
518 | (*bitsp)++; | ||
519 | bit <<= 1; | ||
520 | } | ||
521 | } | ||
522 | i++; | ||
523 | } | ||
524 | |||
525 | return first; | ||
526 | } | ||
527 | |||
528 | MODULE_DESCRIPTION("Eraseblock torturing module"); | ||
529 | MODULE_AUTHOR("Artem Bityutskiy, Jarkko Lavinen, Adrian Hunter"); | ||
530 | MODULE_LICENSE("GPL"); | ||