Merge branch 'master' of git://git.infradead.org/users/dedekind/mtd-tests-2.6
Conflicts: drivers/mtd/Makefile
This commit is contained in:
David Woodhouse
commit
572acc4127
|
|
@ -45,6 +45,14 @@ config MTD_PARTITIONS
|
|||
devices. Partitioning on NFTL 'devices' is a different - that's the
|
||||
'normal' form of partitioning used on a block device.
|
||||
|
||||
config MTD_TESTS
|
||||
tristate "MTD tests support"
|
||||
depends on m
|
||||
help
|
||||
This option includes various MTD tests into compilation. The tests
|
||||
should normally be compiled as kernel modules. The modules perform
|
||||
various checks and verifications when loaded.
|
||||
|
||||
config MTD_REDBOOT_PARTS
|
||||
tristate "RedBoot partition table parsing"
|
||||
depends on MTD_PARTITIONS
|
||||
|
|
|
|||
|
|
@ -29,6 +29,6 @@ obj-$(CONFIG_MTD_OOPS) += mtdoops.o
|
|||
nftl-objs := nftlcore.o nftlmount.o
|
||||
inftl-objs := inftlcore.o inftlmount.o
|
||||
|
||||
obj-y += chips/ lpddr/ maps/ devices/ nand/ onenand/
|
||||
obj-y += chips/ lpddr/ maps/ devices/ nand/ onenand/ tests/
|
||||
|
||||
obj-$(CONFIG_MTD_UBI) += ubi/
|
||||
|
|
|
|||
|
|
@ -0,0 +1,7 @@
|
|||
obj-$(CONFIG_MTD_TESTS) += mtd_oobtest.o
|
||||
obj-$(CONFIG_MTD_TESTS) += mtd_pagetest.o
|
||||
obj-$(CONFIG_MTD_TESTS) += mtd_readtest.o
|
||||
obj-$(CONFIG_MTD_TESTS) += mtd_speedtest.o
|
||||
obj-$(CONFIG_MTD_TESTS) += mtd_stresstest.o
|
||||
obj-$(CONFIG_MTD_TESTS) += mtd_subpagetest.o
|
||||
obj-$(CONFIG_MTD_TESTS) += mtd_torturetest.o
|
||||
|
|
@ -0,0 +1,742 @@
|
|||
/*
|
||||
* Copyright (C) 2006-2008 Nokia Corporation
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License version 2 as published by
|
||||
* the Free Software Foundation.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful, but WITHOUT
|
||||
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
|
||||
* more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License along with
|
||||
* this program; see the file COPYING. If not, write to the Free Software
|
||||
* Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
||||
*
|
||||
* Test OOB read and write on MTD device.
|
||||
*
|
||||
* Author: Adrian Hunter <ext-adrian.hunter@nokia.com>
|
||||
*/
|
||||
|
||||
#include <asm/div64.h>
|
||||
#include <linux/init.h>
|
||||
#include <linux/module.h>
|
||||
#include <linux/moduleparam.h>
|
||||
#include <linux/err.h>
|
||||
#include <linux/mtd/mtd.h>
|
||||
#include <linux/sched.h>
|
||||
|
||||
#define PRINT_PREF KERN_INFO "mtd_oobtest: "
|
||||
|
||||
static int dev;
|
||||
module_param(dev, int, S_IRUGO);
|
||||
MODULE_PARM_DESC(dev, "MTD device number to use");
|
||||
|
||||
static struct mtd_info *mtd;
|
||||
static unsigned char *readbuf;
|
||||
static unsigned char *writebuf;
|
||||
static unsigned char *bbt;
|
||||
|
||||
static int ebcnt;
|
||||
static int pgcnt;
|
||||
static int errcnt;
|
||||
static int use_offset;
|
||||
static int use_len;
|
||||
static int use_len_max;
|
||||
static int vary_offset;
|
||||
static unsigned long next = 1;
|
||||
|
||||
static inline unsigned int simple_rand(void)
|
||||
{
|
||||
next = next * 1103515245 + 12345;
|
||||
return (unsigned int)((next / 65536) % 32768);
|
||||
}
|
||||
|
||||
static inline void simple_srand(unsigned long seed)
|
||||
{
|
||||
next = seed;
|
||||
}
|
||||
|
||||
static void set_random_data(unsigned char *buf, size_t len)
|
||||
{
|
||||
size_t i;
|
||||
|
||||
for (i = 0; i < len; ++i)
|
||||
buf[i] = simple_rand();
|
||||
}
|
||||
|
||||
static int erase_eraseblock(int ebnum)
|
||||
{
|
||||
int err;
|
||||
struct erase_info ei;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
|
||||
memset(&ei, 0, sizeof(struct erase_info));
|
||||
ei.mtd = mtd;
|
||||
ei.addr = addr;
|
||||
ei.len = mtd->erasesize;
|
||||
|
||||
err = mtd->erase(mtd, &ei);
|
||||
if (err) {
|
||||
printk(PRINT_PREF "error %d while erasing EB %d\n", err, ebnum);
|
||||
return err;
|
||||
}
|
||||
|
||||
if (ei.state == MTD_ERASE_FAILED) {
|
||||
printk(PRINT_PREF "some erase error occurred at EB %d\n",
|
||||
ebnum);
|
||||
return -EIO;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int erase_whole_device(void)
|
||||
{
|
||||
int err;
|
||||
unsigned int i;
|
||||
|
||||
printk(PRINT_PREF "erasing whole device\n");
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
if (bbt[i])
|
||||
continue;
|
||||
err = erase_eraseblock(i);
|
||||
if (err)
|
||||
return err;
|
||||
cond_resched();
|
||||
}
|
||||
printk(PRINT_PREF "erased %u eraseblocks\n", i);
|
||||
return 0;
|
||||
}
|
||||
|
||||
static void do_vary_offset(void)
|
||||
{
|
||||
use_len -= 1;
|
||||
if (use_len < 1) {
|
||||
use_offset += 1;
|
||||
if (use_offset >= use_len_max)
|
||||
use_offset = 0;
|
||||
use_len = use_len_max - use_offset;
|
||||
}
|
||||
}
|
||||
|
||||
static int write_eraseblock(int ebnum)
|
||||
{
|
||||
int i;
|
||||
struct mtd_oob_ops ops;
|
||||
int err = 0;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
|
||||
for (i = 0; i < pgcnt; ++i, addr += mtd->writesize) {
|
||||
set_random_data(writebuf, use_len);
|
||||
ops.mode = MTD_OOB_AUTO;
|
||||
ops.len = 0;
|
||||
ops.retlen = 0;
|
||||
ops.ooblen = use_len;
|
||||
ops.oobretlen = 0;
|
||||
ops.ooboffs = use_offset;
|
||||
ops.datbuf = 0;
|
||||
ops.oobbuf = writebuf;
|
||||
err = mtd->write_oob(mtd, addr, &ops);
|
||||
if (err || ops.oobretlen != use_len) {
|
||||
printk(PRINT_PREF "error: writeoob failed at %#llx\n",
|
||||
(long long)addr);
|
||||
printk(PRINT_PREF "error: use_len %d, use_offset %d\n",
|
||||
use_len, use_offset);
|
||||
errcnt += 1;
|
||||
return err ? err : -1;
|
||||
}
|
||||
if (vary_offset)
|
||||
do_vary_offset();
|
||||
}
|
||||
|
||||
return err;
|
||||
}
|
||||
|
||||
static int write_whole_device(void)
|
||||
{
|
||||
int err;
|
||||
unsigned int i;
|
||||
|
||||
printk(PRINT_PREF "writing OOBs of whole device\n");
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
if (bbt[i])
|
||||
continue;
|
||||
err = write_eraseblock(i);
|
||||
if (err)
|
||||
return err;
|
||||
if (i % 256 == 0)
|
||||
printk(PRINT_PREF "written up to eraseblock %u\n", i);
|
||||
cond_resched();
|
||||
}
|
||||
printk(PRINT_PREF "written %u eraseblocks\n", i);
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int verify_eraseblock(int ebnum)
|
||||
{
|
||||
int i;
|
||||
struct mtd_oob_ops ops;
|
||||
int err = 0;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
|
||||
for (i = 0; i < pgcnt; ++i, addr += mtd->writesize) {
|
||||
set_random_data(writebuf, use_len);
|
||||
ops.mode = MTD_OOB_AUTO;
|
||||
ops.len = 0;
|
||||
ops.retlen = 0;
|
||||
ops.ooblen = use_len;
|
||||
ops.oobretlen = 0;
|
||||
ops.ooboffs = use_offset;
|
||||
ops.datbuf = 0;
|
||||
ops.oobbuf = readbuf;
|
||||
err = mtd->read_oob(mtd, addr, &ops);
|
||||
if (err || ops.oobretlen != use_len) {
|
||||
printk(PRINT_PREF "error: readoob failed at %#llx\n",
|
||||
(long long)addr);
|
||||
errcnt += 1;
|
||||
return err ? err : -1;
|
||||
}
|
||||
if (memcmp(readbuf, writebuf, use_len)) {
|
||||
printk(PRINT_PREF "error: verify failed at %#llx\n",
|
||||
(long long)addr);
|
||||
errcnt += 1;
|
||||
if (errcnt > 1000) {
|
||||
printk(PRINT_PREF "error: too many errors\n");
|
||||
return -1;
|
||||
}
|
||||
}
|
||||
if (use_offset != 0 || use_len < mtd->ecclayout->oobavail) {
|
||||
int k;
|
||||
|
||||
ops.mode = MTD_OOB_AUTO;
|
||||
ops.len = 0;
|
||||
ops.retlen = 0;
|
||||
ops.ooblen = mtd->ecclayout->oobavail;
|
||||
ops.oobretlen = 0;
|
||||
ops.ooboffs = 0;
|
||||
ops.datbuf = 0;
|
||||
ops.oobbuf = readbuf;
|
||||
err = mtd->read_oob(mtd, addr, &ops);
|
||||
if (err || ops.oobretlen != mtd->ecclayout->oobavail) {
|
||||
printk(PRINT_PREF "error: readoob failed at "
|
||||
"%#llx\n", (long long)addr);
|
||||
errcnt += 1;
|
||||
return err ? err : -1;
|
||||
}
|
||||
if (memcmp(readbuf + use_offset, writebuf, use_len)) {
|
||||
printk(PRINT_PREF "error: verify failed at "
|
||||
"%#llx\n", (long long)addr);
|
||||
errcnt += 1;
|
||||
if (errcnt > 1000) {
|
||||
printk(PRINT_PREF "error: too many "
|
||||
"errors\n");
|
||||
return -1;
|
||||
}
|
||||
}
|
||||
for (k = 0; k < use_offset; ++k)
|
||||
if (readbuf[k] != 0xff) {
|
||||
printk(PRINT_PREF "error: verify 0xff "
|
||||
"failed at %#llx\n",
|
||||
(long long)addr);
|
||||
errcnt += 1;
|
||||
if (errcnt > 1000) {
|
||||
printk(PRINT_PREF "error: too "
|
||||
"many errors\n");
|
||||
return -1;
|
||||
}
|
||||
}
|
||||
for (k = use_offset + use_len;
|
||||
k < mtd->ecclayout->oobavail; ++k)
|
||||
if (readbuf[k] != 0xff) {
|
||||
printk(PRINT_PREF "error: verify 0xff "
|
||||
"failed at %#llx\n",
|
||||
(long long)addr);
|
||||
errcnt += 1;
|
||||
if (errcnt > 1000) {
|
||||
printk(PRINT_PREF "error: too "
|
||||
"many errors\n");
|
||||
return -1;
|
||||
}
|
||||
}
|
||||
}
|
||||
if (vary_offset)
|
||||
do_vary_offset();
|
||||
}
|
||||
return err;
|
||||
}
|
||||
|
||||
static int verify_eraseblock_in_one_go(int ebnum)
|
||||
{
|
||||
struct mtd_oob_ops ops;
|
||||
int err = 0;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
size_t len = mtd->ecclayout->oobavail * pgcnt;
|
||||
|
||||
set_random_data(writebuf, len);
|
||||
ops.mode = MTD_OOB_AUTO;
|
||||
ops.len = 0;
|
||||
ops.retlen = 0;
|
||||
ops.ooblen = len;
|
||||
ops.oobretlen = 0;
|
||||
ops.ooboffs = 0;
|
||||
ops.datbuf = 0;
|
||||
ops.oobbuf = readbuf;
|
||||
err = mtd->read_oob(mtd, addr, &ops);
|
||||
if (err || ops.oobretlen != len) {
|
||||
printk(PRINT_PREF "error: readoob failed at %#llx\n",
|
||||
(long long)addr);
|
||||
errcnt += 1;
|
||||
return err ? err : -1;
|
||||
}
|
||||
if (memcmp(readbuf, writebuf, len)) {
|
||||
printk(PRINT_PREF "error: verify failed at %#llx\n",
|
||||
(long long)addr);
|
||||
errcnt += 1;
|
||||
if (errcnt > 1000) {
|
||||
printk(PRINT_PREF "error: too many errors\n");
|
||||
return -1;
|
||||
}
|
||||
}
|
||||
|
||||
return err;
|
||||
}
|
||||
|
||||
static int verify_all_eraseblocks(void)
|
||||
{
|
||||
int err;
|
||||
unsigned int i;
|
||||
|
||||
printk(PRINT_PREF "verifying all eraseblocks\n");
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
if (bbt[i])
|
||||
continue;
|
||||
err = verify_eraseblock(i);
|
||||
if (err)
|
||||
return err;
|
||||
if (i % 256 == 0)
|
||||
printk(PRINT_PREF "verified up to eraseblock %u\n", i);
|
||||
cond_resched();
|
||||
}
|
||||
printk(PRINT_PREF "verified %u eraseblocks\n", i);
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int is_block_bad(int ebnum)
|
||||
{
|
||||
int ret;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
|
||||
ret = mtd->block_isbad(mtd, addr);
|
||||
if (ret)
|
||||
printk(PRINT_PREF "block %d is bad\n", ebnum);
|
||||
return ret;
|
||||
}
|
||||
|
||||
static int scan_for_bad_eraseblocks(void)
|
||||
{
|
||||
int i, bad = 0;
|
||||
|
||||
bbt = kmalloc(ebcnt, GFP_KERNEL);
|
||||
if (!bbt) {
|
||||
printk(PRINT_PREF "error: cannot allocate memory\n");
|
||||
return -ENOMEM;
|
||||
}
|
||||
memset(bbt, 0 , ebcnt);
|
||||
|
||||
printk(PRINT_PREF "scanning for bad eraseblocks\n");
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
bbt[i] = is_block_bad(i) ? 1 : 0;
|
||||
if (bbt[i])
|
||||
bad += 1;
|
||||
cond_resched();
|
||||
}
|
||||
printk(PRINT_PREF "scanned %d eraseblocks, %d are bad\n", i, bad);
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int __init mtd_oobtest_init(void)
|
||||
{
|
||||
int err = 0;
|
||||
unsigned int i;
|
||||
uint64_t tmp;
|
||||
struct mtd_oob_ops ops;
|
||||
loff_t addr = 0, addr0;
|
||||
|
||||
printk(KERN_INFO "\n");
|
||||
printk(KERN_INFO "=================================================\n");
|
||||
printk(PRINT_PREF "MTD device: %d\n", dev);
|
||||
|
||||
mtd = get_mtd_device(NULL, dev);
|
||||
if (IS_ERR(mtd)) {
|
||||
err = PTR_ERR(mtd);
|
||||
printk(PRINT_PREF "error: cannot get MTD device\n");
|
||||
return err;
|
||||
}
|
||||
|
||||
if (mtd->type != MTD_NANDFLASH) {
|
||||
printk(PRINT_PREF "this test requires NAND flash\n");
|
||||
goto out;
|
||||
}
|
||||
|
||||
tmp = mtd->size;
|
||||
do_div(tmp, mtd->erasesize);
|
||||
ebcnt = tmp;
|
||||
pgcnt = mtd->erasesize / mtd->writesize;
|
||||
|
||||
printk(PRINT_PREF "MTD device size %llu, eraseblock size %u, "
|
||||
"page size %u, count of eraseblocks %u, pages per "
|
||||
"eraseblock %u, OOB size %u\n",
|
||||
(unsigned long long)mtd->size, mtd->erasesize,
|
||||
mtd->writesize, ebcnt, pgcnt, mtd->oobsize);
|
||||
|
||||
err = -ENOMEM;
|
||||
mtd->erasesize = mtd->erasesize;
|
||||
readbuf = kmalloc(mtd->erasesize, GFP_KERNEL);
|
||||
if (!readbuf) {
|
||||
printk(PRINT_PREF "error: cannot allocate memory\n");
|
||||
goto out;
|
||||
}
|
||||
writebuf = kmalloc(mtd->erasesize, GFP_KERNEL);
|
||||
if (!writebuf) {
|
||||
printk(PRINT_PREF "error: cannot allocate memory\n");
|
||||
goto out;
|
||||
}
|
||||
|
||||
err = scan_for_bad_eraseblocks();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
use_offset = 0;
|
||||
use_len = mtd->ecclayout->oobavail;
|
||||
use_len_max = mtd->ecclayout->oobavail;
|
||||
vary_offset = 0;
|
||||
|
||||
/* First test: write all OOB, read it back and verify */
|
||||
printk(PRINT_PREF "test 1 of 5\n");
|
||||
|
||||
err = erase_whole_device();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
simple_srand(1);
|
||||
err = write_whole_device();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
simple_srand(1);
|
||||
err = verify_all_eraseblocks();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
/*
|
||||
* Second test: write all OOB, a block at a time, read it back and
|
||||
* verify.
|
||||
*/
|
||||
printk(PRINT_PREF "test 2 of 5\n");
|
||||
|
||||
err = erase_whole_device();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
simple_srand(3);
|
||||
err = write_whole_device();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
/* Check all eraseblocks */
|
||||
simple_srand(3);
|
||||
printk(PRINT_PREF "verifying all eraseblocks\n");
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
if (bbt[i])
|
||||
continue;
|
||||
err = verify_eraseblock_in_one_go(i);
|
||||
if (err)
|
||||
goto out;
|
||||
if (i % 256 == 0)
|
||||
printk(PRINT_PREF "verified up to eraseblock %u\n", i);
|
||||
cond_resched();
|
||||
}
|
||||
printk(PRINT_PREF "verified %u eraseblocks\n", i);
|
||||
|
||||
/*
|
||||
* Third test: write OOB at varying offsets and lengths, read it back
|
||||
* and verify.
|
||||
*/
|
||||
printk(PRINT_PREF "test 3 of 5\n");
|
||||
|
||||
err = erase_whole_device();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
/* Write all eraseblocks */
|
||||
use_offset = 0;
|
||||
use_len = mtd->ecclayout->oobavail;
|
||||
use_len_max = mtd->ecclayout->oobavail;
|
||||
vary_offset = 1;
|
||||
simple_srand(5);
|
||||
printk(PRINT_PREF "writing OOBs of whole device\n");
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
if (bbt[i])
|
||||
continue;
|
||||
err = write_eraseblock(i);
|
||||
if (err)
|
||||
goto out;
|
||||
if (i % 256 == 0)
|
||||
printk(PRINT_PREF "written up to eraseblock %u\n", i);
|
||||
cond_resched();
|
||||
}
|
||||
printk(PRINT_PREF "written %u eraseblocks\n", i);
|
||||
|
||||
/* Check all eraseblocks */
|
||||
use_offset = 0;
|
||||
use_len = mtd->ecclayout->oobavail;
|
||||
use_len_max = mtd->ecclayout->oobavail;
|
||||
vary_offset = 1;
|
||||
simple_srand(5);
|
||||
err = verify_all_eraseblocks();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
use_offset = 0;
|
||||
use_len = mtd->ecclayout->oobavail;
|
||||
use_len_max = mtd->ecclayout->oobavail;
|
||||
vary_offset = 0;
|
||||
|
||||
/* Fourth test: try to write off end of device */
|
||||
printk(PRINT_PREF "test 4 of 5\n");
|
||||
|
||||
err = erase_whole_device();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
addr0 = 0;
|
||||
for (i = 0; bbt[i] && i < ebcnt; ++i)
|
||||
addr0 += mtd->erasesize;
|
||||
|
||||
/* Attempt to write off end of OOB */
|
||||
ops.mode = MTD_OOB_AUTO;
|
||||
ops.len = 0;
|
||||
ops.retlen = 0;
|
||||
ops.ooblen = 1;
|
||||
ops.oobretlen = 0;
|
||||
ops.ooboffs = mtd->ecclayout->oobavail;
|
||||
ops.datbuf = 0;
|
||||
ops.oobbuf = writebuf;
|
||||
printk(PRINT_PREF "attempting to start write past end of OOB\n");
|
||||
printk(PRINT_PREF "an error is expected...\n");
|
||||
err = mtd->write_oob(mtd, addr0, &ops);
|
||||
if (err) {
|
||||
printk(PRINT_PREF "error occurred as expected\n");
|
||||
err = 0;
|
||||
} else {
|
||||
printk(PRINT_PREF "error: can write past end of OOB\n");
|
||||
errcnt += 1;
|
||||
}
|
||||
|
||||
/* Attempt to read off end of OOB */
|
||||
ops.mode = MTD_OOB_AUTO;
|
||||
ops.len = 0;
|
||||
ops.retlen = 0;
|
||||
ops.ooblen = 1;
|
||||
ops.oobretlen = 0;
|
||||
ops.ooboffs = mtd->ecclayout->oobavail;
|
||||
ops.datbuf = 0;
|
||||
ops.oobbuf = readbuf;
|
||||
printk(PRINT_PREF "attempting to start read past end of OOB\n");
|
||||
printk(PRINT_PREF "an error is expected...\n");
|
||||
err = mtd->read_oob(mtd, addr0, &ops);
|
||||
if (err) {
|
||||
printk(PRINT_PREF "error occurred as expected\n");
|
||||
err = 0;
|
||||
} else {
|
||||
printk(PRINT_PREF "error: can read past end of OOB\n");
|
||||
errcnt += 1;
|
||||
}
|
||||
|
||||
if (bbt[ebcnt - 1])
|
||||
printk(PRINT_PREF "skipping end of device tests because last "
|
||||
"block is bad\n");
|
||||
else {
|
||||
/* Attempt to write off end of device */
|
||||
ops.mode = MTD_OOB_AUTO;
|
||||
ops.len = 0;
|
||||
ops.retlen = 0;
|
||||
ops.ooblen = mtd->ecclayout->oobavail + 1;
|
||||
ops.oobretlen = 0;
|
||||
ops.ooboffs = 0;
|
||||
ops.datbuf = 0;
|
||||
ops.oobbuf = writebuf;
|
||||
printk(PRINT_PREF "attempting to write past end of device\n");
|
||||
printk(PRINT_PREF "an error is expected...\n");
|
||||
err = mtd->write_oob(mtd, mtd->size - mtd->writesize, &ops);
|
||||
if (err) {
|
||||
printk(PRINT_PREF "error occurred as expected\n");
|
||||
err = 0;
|
||||
} else {
|
||||
printk(PRINT_PREF "error: wrote past end of device\n");
|
||||
errcnt += 1;
|
||||
}
|
||||
|
||||
/* Attempt to read off end of device */
|
||||
ops.mode = MTD_OOB_AUTO;
|
||||
ops.len = 0;
|
||||
ops.retlen = 0;
|
||||
ops.ooblen = mtd->ecclayout->oobavail + 1;
|
||||
ops.oobretlen = 0;
|
||||
ops.ooboffs = 0;
|
||||
ops.datbuf = 0;
|
||||
ops.oobbuf = readbuf;
|
||||
printk(PRINT_PREF "attempting to read past end of device\n");
|
||||
printk(PRINT_PREF "an error is expected...\n");
|
||||
err = mtd->read_oob(mtd, mtd->size - mtd->writesize, &ops);
|
||||
if (err) {
|
||||
printk(PRINT_PREF "error occurred as expected\n");
|
||||
err = 0;
|
||||
} else {
|
||||
printk(PRINT_PREF "error: read past end of device\n");
|
||||
errcnt += 1;
|
||||
}
|
||||
|
||||
err = erase_eraseblock(ebcnt - 1);
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
/* Attempt to write off end of device */
|
||||
ops.mode = MTD_OOB_AUTO;
|
||||
ops.len = 0;
|
||||
ops.retlen = 0;
|
||||
ops.ooblen = mtd->ecclayout->oobavail;
|
||||
ops.oobretlen = 0;
|
||||
ops.ooboffs = 1;
|
||||
ops.datbuf = 0;
|
||||
ops.oobbuf = writebuf;
|
||||
printk(PRINT_PREF "attempting to write past end of device\n");
|
||||
printk(PRINT_PREF "an error is expected...\n");
|
||||
err = mtd->write_oob(mtd, mtd->size - mtd->writesize, &ops);
|
||||
if (err) {
|
||||
printk(PRINT_PREF "error occurred as expected\n");
|
||||
err = 0;
|
||||
} else {
|
||||
printk(PRINT_PREF "error: wrote past end of device\n");
|
||||
errcnt += 1;
|
||||
}
|
||||
|
||||
/* Attempt to read off end of device */
|
||||
ops.mode = MTD_OOB_AUTO;
|
||||
ops.len = 0;
|
||||
ops.retlen = 0;
|
||||
ops.ooblen = mtd->ecclayout->oobavail;
|
||||
ops.oobretlen = 0;
|
||||
ops.ooboffs = 1;
|
||||
ops.datbuf = 0;
|
||||
ops.oobbuf = readbuf;
|
||||
printk(PRINT_PREF "attempting to read past end of device\n");
|
||||
printk(PRINT_PREF "an error is expected...\n");
|
||||
err = mtd->read_oob(mtd, mtd->size - mtd->writesize, &ops);
|
||||
if (err) {
|
||||
printk(PRINT_PREF "error occurred as expected\n");
|
||||
err = 0;
|
||||
} else {
|
||||
printk(PRINT_PREF "error: read past end of device\n");
|
||||
errcnt += 1;
|
||||
}
|
||||
}
|
||||
|
||||
/* Fifth test: write / read across block boundaries */
|
||||
printk(PRINT_PREF "test 5 of 5\n");
|
||||
|
||||
/* Erase all eraseblocks */
|
||||
err = erase_whole_device();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
/* Write all eraseblocks */
|
||||
simple_srand(11);
|
||||
printk(PRINT_PREF "writing OOBs of whole device\n");
|
||||
for (i = 0; i < ebcnt - 1; ++i) {
|
||||
int cnt = 2;
|
||||
int pg;
|
||||
size_t sz = mtd->ecclayout->oobavail;
|
||||
if (bbt[i] || bbt[i + 1])
|
||||
continue;
|
||||
addr = (i + 1) * mtd->erasesize - mtd->writesize;
|
||||
for (pg = 0; pg < cnt; ++pg) {
|
||||
set_random_data(writebuf, sz);
|
||||
ops.mode = MTD_OOB_AUTO;
|
||||
ops.len = 0;
|
||||
ops.retlen = 0;
|
||||
ops.ooblen = sz;
|
||||
ops.oobretlen = 0;
|
||||
ops.ooboffs = 0;
|
||||
ops.datbuf = 0;
|
||||
ops.oobbuf = writebuf;
|
||||
err = mtd->write_oob(mtd, addr, &ops);
|
||||
if (err)
|
||||
goto out;
|
||||
if (i % 256 == 0)
|
||||
printk(PRINT_PREF "written up to eraseblock "
|
||||
"%u\n", i);
|
||||
cond_resched();
|
||||
addr += mtd->writesize;
|
||||
}
|
||||
}
|
||||
printk(PRINT_PREF "written %u eraseblocks\n", i);
|
||||
|
||||
/* Check all eraseblocks */
|
||||
simple_srand(11);
|
||||
printk(PRINT_PREF "verifying all eraseblocks\n");
|
||||
for (i = 0; i < ebcnt - 1; ++i) {
|
||||
if (bbt[i] || bbt[i + 1])
|
||||
continue;
|
||||
set_random_data(writebuf, mtd->ecclayout->oobavail * 2);
|
||||
addr = (i + 1) * mtd->erasesize - mtd->writesize;
|
||||
ops.mode = MTD_OOB_AUTO;
|
||||
ops.len = 0;
|
||||
ops.retlen = 0;
|
||||
ops.ooblen = mtd->ecclayout->oobavail * 2;
|
||||
ops.oobretlen = 0;
|
||||
ops.ooboffs = 0;
|
||||
ops.datbuf = 0;
|
||||
ops.oobbuf = readbuf;
|
||||
err = mtd->read_oob(mtd, addr, &ops);
|
||||
if (err)
|
||||
goto out;
|
||||
if (memcmp(readbuf, writebuf, mtd->ecclayout->oobavail * 2)) {
|
||||
printk(PRINT_PREF "error: verify failed at %#llx\n",
|
||||
(long long)addr);
|
||||
errcnt += 1;
|
||||
if (errcnt > 1000) {
|
||||
printk(PRINT_PREF "error: too many errors\n");
|
||||
goto out;
|
||||
}
|
||||
}
|
||||
if (i % 256 == 0)
|
||||
printk(PRINT_PREF "verified up to eraseblock %u\n", i);
|
||||
cond_resched();
|
||||
}
|
||||
printk(PRINT_PREF "verified %u eraseblocks\n", i);
|
||||
|
||||
printk(PRINT_PREF "finished with %d errors\n", errcnt);
|
||||
out:
|
||||
kfree(bbt);
|
||||
kfree(writebuf);
|
||||
kfree(readbuf);
|
||||
put_mtd_device(mtd);
|
||||
if (err)
|
||||
printk(PRINT_PREF "error %d occurred\n", err);
|
||||
printk(KERN_INFO "=================================================\n");
|
||||
return err;
|
||||
}
|
||||
module_init(mtd_oobtest_init);
|
||||
|
||||
static void __exit mtd_oobtest_exit(void)
|
||||
{
|
||||
return;
|
||||
}
|
||||
module_exit(mtd_oobtest_exit);
|
||||
|
||||
MODULE_DESCRIPTION("Out-of-band test module");
|
||||
MODULE_AUTHOR("Adrian Hunter");
|
||||
MODULE_LICENSE("GPL");
|
||||
|
|
@ -0,0 +1,632 @@
|
|||
/*
|
||||
* Copyright (C) 2006-2008 Nokia Corporation
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License version 2 as published by
|
||||
* the Free Software Foundation.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful, but WITHOUT
|
||||
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
|
||||
* more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License along with
|
||||
* this program; see the file COPYING. If not, write to the Free Software
|
||||
* Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
||||
*
|
||||
* Test page read and write on MTD device.
|
||||
*
|
||||
* Author: Adrian Hunter <ext-adrian.hunter@nokia.com>
|
||||
*/
|
||||
|
||||
#include <asm/div64.h>
|
||||
#include <linux/init.h>
|
||||
#include <linux/module.h>
|
||||
#include <linux/moduleparam.h>
|
||||
#include <linux/err.h>
|
||||
#include <linux/mtd/mtd.h>
|
||||
#include <linux/sched.h>
|
||||
|
||||
#define PRINT_PREF KERN_INFO "mtd_pagetest: "
|
||||
|
||||
static int dev;
|
||||
module_param(dev, int, S_IRUGO);
|
||||
MODULE_PARM_DESC(dev, "MTD device number to use");
|
||||
|
||||
static struct mtd_info *mtd;
|
||||
static unsigned char *twopages;
|
||||
static unsigned char *writebuf;
|
||||
static unsigned char *boundary;
|
||||
static unsigned char *bbt;
|
||||
|
||||
static int pgsize;
|
||||
static int bufsize;
|
||||
static int ebcnt;
|
||||
static int pgcnt;
|
||||
static int errcnt;
|
||||
static unsigned long next = 1;
|
||||
|
||||
static inline unsigned int simple_rand(void)
|
||||
{
|
||||
next = next * 1103515245 + 12345;
|
||||
return (unsigned int)((next / 65536) % 32768);
|
||||
}
|
||||
|
||||
static inline void simple_srand(unsigned long seed)
|
||||
{
|
||||
next = seed;
|
||||
}
|
||||
|
||||
static void set_random_data(unsigned char *buf, size_t len)
|
||||
{
|
||||
size_t i;
|
||||
|
||||
for (i = 0; i < len; ++i)
|
||||
buf[i] = simple_rand();
|
||||
}
|
||||
|
||||
static int erase_eraseblock(int ebnum)
|
||||
{
|
||||
int err;
|
||||
struct erase_info ei;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
|
||||
memset(&ei, 0, sizeof(struct erase_info));
|
||||
ei.mtd = mtd;
|
||||
ei.addr = addr;
|
||||
ei.len = mtd->erasesize;
|
||||
|
||||
err = mtd->erase(mtd, &ei);
|
||||
if (err) {
|
||||
printk(PRINT_PREF "error %d while erasing EB %d\n", err, ebnum);
|
||||
return err;
|
||||
}
|
||||
|
||||
if (ei.state == MTD_ERASE_FAILED) {
|
||||
printk(PRINT_PREF "some erase error occurred at EB %d\n",
|
||||
ebnum);
|
||||
return -EIO;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int write_eraseblock(int ebnum)
|
||||
{
|
||||
int err = 0;
|
||||
size_t written = 0;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
|
||||
set_random_data(writebuf, mtd->erasesize);
|
||||
cond_resched();
|
||||
err = mtd->write(mtd, addr, mtd->erasesize, &written, writebuf);
|
||||
if (err || written != mtd->erasesize)
|
||||
printk(PRINT_PREF "error: write failed at %#llx\n",
|
||||
(long long)addr);
|
||||
|
||||
return err;
|
||||
}
|
||||
|
||||
static int verify_eraseblock(int ebnum)
|
||||
{
|
||||
uint32_t j;
|
||||
size_t read = 0;
|
||||
int err = 0, i;
|
||||
loff_t addr0, addrn;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
|
||||
addr0 = 0;
|
||||
for (i = 0; bbt[i] && i < ebcnt; ++i)
|
||||
addr0 += mtd->erasesize;
|
||||
|
||||
addrn = mtd->size;
|
||||
for (i = 0; bbt[ebcnt - i - 1] && i < ebcnt; ++i)
|
||||
addrn -= mtd->erasesize;
|
||||
|
||||
set_random_data(writebuf, mtd->erasesize);
|
||||
for (j = 0; j < pgcnt - 1; ++j, addr += pgsize) {
|
||||
/* Do a read to set the internal dataRAMs to different data */
|
||||
err = mtd->read(mtd, addr0, bufsize, &read, twopages);
|
||||
if (err == -EUCLEAN)
|
||||
err = 0;
|
||||
if (err || read != bufsize) {
|
||||
printk(PRINT_PREF "error: read failed at %#llx\n",
|
||||
(long long)addr0);
|
||||
return err;
|
||||
}
|
||||
err = mtd->read(mtd, addrn - bufsize, bufsize, &read, twopages);
|
||||
if (err == -EUCLEAN)
|
||||
err = 0;
|
||||
if (err || read != bufsize) {
|
||||
printk(PRINT_PREF "error: read failed at %#llx\n",
|
||||
(long long)(addrn - bufsize));
|
||||
return err;
|
||||
}
|
||||
memset(twopages, 0, bufsize);
|
||||
read = 0;
|
||||
err = mtd->read(mtd, addr, bufsize, &read, twopages);
|
||||
if (err == -EUCLEAN)
|
||||
err = 0;
|
||||
if (err || read != bufsize) {
|
||||
printk(PRINT_PREF "error: read failed at %#llx\n",
|
||||
(long long)addr);
|
||||
break;
|
||||
}
|
||||
if (memcmp(twopages, writebuf + (j * pgsize), bufsize)) {
|
||||
printk(PRINT_PREF "error: verify failed at %#llx\n",
|
||||
(long long)addr);
|
||||
errcnt += 1;
|
||||
}
|
||||
}
|
||||
/* Check boundary between eraseblocks */
|
||||
if (addr <= addrn - pgsize - pgsize && !bbt[ebnum + 1]) {
|
||||
unsigned long oldnext = next;
|
||||
/* Do a read to set the internal dataRAMs to different data */
|
||||
err = mtd->read(mtd, addr0, bufsize, &read, twopages);
|
||||
if (err == -EUCLEAN)
|
||||
err = 0;
|
||||
if (err || read != bufsize) {
|
||||
printk(PRINT_PREF "error: read failed at %#llx\n",
|
||||
(long long)addr0);
|
||||
return err;
|
||||
}
|
||||
err = mtd->read(mtd, addrn - bufsize, bufsize, &read, twopages);
|
||||
if (err == -EUCLEAN)
|
||||
err = 0;
|
||||
if (err || read != bufsize) {
|
||||
printk(PRINT_PREF "error: read failed at %#llx\n",
|
||||
(long long)(addrn - bufsize));
|
||||
return err;
|
||||
}
|
||||
memset(twopages, 0, bufsize);
|
||||
read = 0;
|
||||
err = mtd->read(mtd, addr, bufsize, &read, twopages);
|
||||
if (err == -EUCLEAN)
|
||||
err = 0;
|
||||
if (err || read != bufsize) {
|
||||
printk(PRINT_PREF "error: read failed at %#llx\n",
|
||||
(long long)addr);
|
||||
return err;
|
||||
}
|
||||
memcpy(boundary, writebuf + mtd->erasesize - pgsize, pgsize);
|
||||
set_random_data(boundary + pgsize, pgsize);
|
||||
if (memcmp(twopages, boundary, bufsize)) {
|
||||
printk(PRINT_PREF "error: verify failed at %#llx\n",
|
||||
(long long)addr);
|
||||
errcnt += 1;
|
||||
}
|
||||
next = oldnext;
|
||||
}
|
||||
return err;
|
||||
}
|
||||
|
||||
static int crosstest(void)
|
||||
{
|
||||
size_t read = 0;
|
||||
int err = 0, i;
|
||||
loff_t addr, addr0, addrn;
|
||||
unsigned char *pp1, *pp2, *pp3, *pp4;
|
||||
|
||||
printk(PRINT_PREF "crosstest\n");
|
||||
pp1 = kmalloc(pgsize * 4, GFP_KERNEL);
|
||||
if (!pp1) {
|
||||
printk(PRINT_PREF "error: cannot allocate memory\n");
|
||||
return -ENOMEM;
|
||||
}
|
||||
pp2 = pp1 + pgsize;
|
||||
pp3 = pp2 + pgsize;
|
||||
pp4 = pp3 + pgsize;
|
||||
memset(pp1, 0, pgsize * 4);
|
||||
|
||||
addr0 = 0;
|
||||
for (i = 0; bbt[i] && i < ebcnt; ++i)
|
||||
addr0 += mtd->erasesize;
|
||||
|
||||
addrn = mtd->size;
|
||||
for (i = 0; bbt[ebcnt - i - 1] && i < ebcnt; ++i)
|
||||
addrn -= mtd->erasesize;
|
||||
|
||||
/* Read 2nd-to-last page to pp1 */
|
||||
read = 0;
|
||||
addr = addrn - pgsize - pgsize;
|
||||
err = mtd->read(mtd, addr, pgsize, &read, pp1);
|
||||
if (err == -EUCLEAN)
|
||||
err = 0;
|
||||
if (err || read != pgsize) {
|
||||
printk(PRINT_PREF "error: read failed at %#llx\n",
|
||||
(long long)addr);
|
||||
kfree(pp1);
|
||||
return err;
|
||||
}
|
||||
|
||||
/* Read 3rd-to-last page to pp1 */
|
||||
read = 0;
|
||||
addr = addrn - pgsize - pgsize - pgsize;
|
||||
err = mtd->read(mtd, addr, pgsize, &read, pp1);
|
||||
if (err == -EUCLEAN)
|
||||
err = 0;
|
||||
if (err || read != pgsize) {
|
||||
printk(PRINT_PREF "error: read failed at %#llx\n",
|
||||
(long long)addr);
|
||||
kfree(pp1);
|
||||
return err;
|
||||
}
|
||||
|
||||
/* Read first page to pp2 */
|
||||
read = 0;
|
||||
addr = addr0;
|
||||
printk(PRINT_PREF "reading page at %#llx\n", (long long)addr);
|
||||
err = mtd->read(mtd, addr, pgsize, &read, pp2);
|
||||
if (err == -EUCLEAN)
|
||||
err = 0;
|
||||
if (err || read != pgsize) {
|
||||
printk(PRINT_PREF "error: read failed at %#llx\n",
|
||||
(long long)addr);
|
||||
kfree(pp1);
|
||||
return err;
|
||||
}
|
||||
|
||||
/* Read last page to pp3 */
|
||||
read = 0;
|
||||
addr = addrn - pgsize;
|
||||
printk(PRINT_PREF "reading page at %#llx\n", (long long)addr);
|
||||
err = mtd->read(mtd, addr, pgsize, &read, pp3);
|
||||
if (err == -EUCLEAN)
|
||||
err = 0;
|
||||
if (err || read != pgsize) {
|
||||
printk(PRINT_PREF "error: read failed at %#llx\n",
|
||||
(long long)addr);
|
||||
kfree(pp1);
|
||||
return err;
|
||||
}
|
||||
|
||||
/* Read first page again to pp4 */
|
||||
read = 0;
|
||||
addr = addr0;
|
||||
printk(PRINT_PREF "reading page at %#llx\n", (long long)addr);
|
||||
err = mtd->read(mtd, addr, pgsize, &read, pp4);
|
||||
if (err == -EUCLEAN)
|
||||
err = 0;
|
||||
if (err || read != pgsize) {
|
||||
printk(PRINT_PREF "error: read failed at %#llx\n",
|
||||
(long long)addr);
|
||||
kfree(pp1);
|
||||
return err;
|
||||
}
|
||||
|
||||
/* pp2 and pp4 should be the same */
|
||||
printk(PRINT_PREF "verifying pages read at %#llx match\n",
|
||||
(long long)addr0);
|
||||
if (memcmp(pp2, pp4, pgsize)) {
|
||||
printk(PRINT_PREF "verify failed!\n");
|
||||
errcnt += 1;
|
||||
} else if (!err)
|
||||
printk(PRINT_PREF "crosstest ok\n");
|
||||
kfree(pp1);
|
||||
return err;
|
||||
}
|
||||
|
||||
static int erasecrosstest(void)
|
||||
{
|
||||
size_t read = 0, written = 0;
|
||||
int err = 0, i, ebnum, ok = 1, ebnum2;
|
||||
loff_t addr0;
|
||||
char *readbuf = twopages;
|
||||
|
||||
printk(PRINT_PREF "erasecrosstest\n");
|
||||
|
||||
ebnum = 0;
|
||||
addr0 = 0;
|
||||
for (i = 0; bbt[i] && i < ebcnt; ++i) {
|
||||
addr0 += mtd->erasesize;
|
||||
ebnum += 1;
|
||||
}
|
||||
|
||||
ebnum2 = ebcnt - 1;
|
||||
while (ebnum2 && bbt[ebnum2])
|
||||
ebnum2 -= 1;
|
||||
|
||||
printk(PRINT_PREF "erasing block %d\n", ebnum);
|
||||
err = erase_eraseblock(ebnum);
|
||||
if (err)
|
||||
return err;
|
||||
|
||||
printk(PRINT_PREF "writing 1st page of block %d\n", ebnum);
|
||||
set_random_data(writebuf, pgsize);
|
||||
strcpy(writebuf, "There is no data like this!");
|
||||
err = mtd->write(mtd, addr0, pgsize, &written, writebuf);
|
||||
if (err || written != pgsize) {
|
||||
printk(PRINT_PREF "error: write failed at %#llx\n",
|
||||
(long long)addr0);
|
||||
return err ? err : -1;
|
||||
}
|
||||
|
||||
printk(PRINT_PREF "reading 1st page of block %d\n", ebnum);
|
||||
memset(readbuf, 0, pgsize);
|
||||
err = mtd->read(mtd, addr0, pgsize, &read, readbuf);
|
||||
if (err == -EUCLEAN)
|
||||
err = 0;
|
||||
if (err || read != pgsize) {
|
||||
printk(PRINT_PREF "error: read failed at %#llx\n",
|
||||
(long long)addr0);
|
||||
return err ? err : -1;
|
||||
}
|
||||
|
||||
printk(PRINT_PREF "verifying 1st page of block %d\n", ebnum);
|
||||
if (memcmp(writebuf, readbuf, pgsize)) {
|
||||
printk(PRINT_PREF "verify failed!\n");
|
||||
errcnt += 1;
|
||||
ok = 0;
|
||||
return err;
|
||||
}
|
||||
|
||||
printk(PRINT_PREF "erasing block %d\n", ebnum);
|
||||
err = erase_eraseblock(ebnum);
|
||||
if (err)
|
||||
return err;
|
||||
|
||||
printk(PRINT_PREF "writing 1st page of block %d\n", ebnum);
|
||||
set_random_data(writebuf, pgsize);
|
||||
strcpy(writebuf, "There is no data like this!");
|
||||
err = mtd->write(mtd, addr0, pgsize, &written, writebuf);
|
||||
if (err || written != pgsize) {
|
||||
printk(PRINT_PREF "error: write failed at %#llx\n",
|
||||
(long long)addr0);
|
||||
return err ? err : -1;
|
||||
}
|
||||
|
||||
printk(PRINT_PREF "erasing block %d\n", ebnum2);
|
||||
err = erase_eraseblock(ebnum2);
|
||||
if (err)
|
||||
return err;
|
||||
|
||||
printk(PRINT_PREF "reading 1st page of block %d\n", ebnum);
|
||||
memset(readbuf, 0, pgsize);
|
||||
err = mtd->read(mtd, addr0, pgsize, &read, readbuf);
|
||||
if (err == -EUCLEAN)
|
||||
err = 0;
|
||||
if (err || read != pgsize) {
|
||||
printk(PRINT_PREF "error: read failed at %#llx\n",
|
||||
(long long)addr0);
|
||||
return err ? err : -1;
|
||||
}
|
||||
|
||||
printk(PRINT_PREF "verifying 1st page of block %d\n", ebnum);
|
||||
if (memcmp(writebuf, readbuf, pgsize)) {
|
||||
printk(PRINT_PREF "verify failed!\n");
|
||||
errcnt += 1;
|
||||
ok = 0;
|
||||
}
|
||||
|
||||
if (ok && !err)
|
||||
printk(PRINT_PREF "erasecrosstest ok\n");
|
||||
return err;
|
||||
}
|
||||
|
||||
static int erasetest(void)
|
||||
{
|
||||
size_t read = 0, written = 0;
|
||||
int err = 0, i, ebnum, ok = 1;
|
||||
loff_t addr0;
|
||||
|
||||
printk(PRINT_PREF "erasetest\n");
|
||||
|
||||
ebnum = 0;
|
||||
addr0 = 0;
|
||||
for (i = 0; bbt[i] && i < ebcnt; ++i) {
|
||||
addr0 += mtd->erasesize;
|
||||
ebnum += 1;
|
||||
}
|
||||
|
||||
printk(PRINT_PREF "erasing block %d\n", ebnum);
|
||||
err = erase_eraseblock(ebnum);
|
||||
if (err)
|
||||
return err;
|
||||
|
||||
printk(PRINT_PREF "writing 1st page of block %d\n", ebnum);
|
||||
set_random_data(writebuf, pgsize);
|
||||
err = mtd->write(mtd, addr0, pgsize, &written, writebuf);
|
||||
if (err || written != pgsize) {
|
||||
printk(PRINT_PREF "error: write failed at %#llx\n",
|
||||
(long long)addr0);
|
||||
return err ? err : -1;
|
||||
}
|
||||
|
||||
printk(PRINT_PREF "erasing block %d\n", ebnum);
|
||||
err = erase_eraseblock(ebnum);
|
||||
if (err)
|
||||
return err;
|
||||
|
||||
printk(PRINT_PREF "reading 1st page of block %d\n", ebnum);
|
||||
err = mtd->read(mtd, addr0, pgsize, &read, twopages);
|
||||
if (err == -EUCLEAN)
|
||||
err = 0;
|
||||
if (err || read != pgsize) {
|
||||
printk(PRINT_PREF "error: read failed at %#llx\n",
|
||||
(long long)addr0);
|
||||
return err ? err : -1;
|
||||
}
|
||||
|
||||
printk(PRINT_PREF "verifying 1st page of block %d is all 0xff\n",
|
||||
ebnum);
|
||||
for (i = 0; i < pgsize; ++i)
|
||||
if (twopages[i] != 0xff) {
|
||||
printk(PRINT_PREF "verifying all 0xff failed at %d\n",
|
||||
i);
|
||||
errcnt += 1;
|
||||
ok = 0;
|
||||
break;
|
||||
}
|
||||
|
||||
if (ok && !err)
|
||||
printk(PRINT_PREF "erasetest ok\n");
|
||||
|
||||
return err;
|
||||
}
|
||||
|
||||
static int is_block_bad(int ebnum)
|
||||
{
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
int ret;
|
||||
|
||||
ret = mtd->block_isbad(mtd, addr);
|
||||
if (ret)
|
||||
printk(PRINT_PREF "block %d is bad\n", ebnum);
|
||||
return ret;
|
||||
}
|
||||
|
||||
static int scan_for_bad_eraseblocks(void)
|
||||
{
|
||||
int i, bad = 0;
|
||||
|
||||
bbt = kmalloc(ebcnt, GFP_KERNEL);
|
||||
if (!bbt) {
|
||||
printk(PRINT_PREF "error: cannot allocate memory\n");
|
||||
return -ENOMEM;
|
||||
}
|
||||
memset(bbt, 0 , ebcnt);
|
||||
|
||||
printk(PRINT_PREF "scanning for bad eraseblocks\n");
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
bbt[i] = is_block_bad(i) ? 1 : 0;
|
||||
if (bbt[i])
|
||||
bad += 1;
|
||||
cond_resched();
|
||||
}
|
||||
printk(PRINT_PREF "scanned %d eraseblocks, %d are bad\n", i, bad);
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int __init mtd_pagetest_init(void)
|
||||
{
|
||||
int err = 0;
|
||||
uint64_t tmp;
|
||||
uint32_t i;
|
||||
|
||||
printk(KERN_INFO "\n");
|
||||
printk(KERN_INFO "=================================================\n");
|
||||
printk(PRINT_PREF "MTD device: %d\n", dev);
|
||||
|
||||
mtd = get_mtd_device(NULL, dev);
|
||||
if (IS_ERR(mtd)) {
|
||||
err = PTR_ERR(mtd);
|
||||
printk(PRINT_PREF "error: cannot get MTD device\n");
|
||||
return err;
|
||||
}
|
||||
|
||||
if (mtd->type != MTD_NANDFLASH) {
|
||||
printk(PRINT_PREF "this test requires NAND flash\n");
|
||||
goto out;
|
||||
}
|
||||
|
||||
tmp = mtd->size;
|
||||
do_div(tmp, mtd->erasesize);
|
||||
ebcnt = tmp;
|
||||
pgcnt = mtd->erasesize / mtd->writesize;
|
||||
|
||||
printk(PRINT_PREF "MTD device size %llu, eraseblock size %u, "
|
||||
"page size %u, count of eraseblocks %u, pages per "
|
||||
"eraseblock %u, OOB size %u\n",
|
||||
(unsigned long long)mtd->size, mtd->erasesize,
|
||||
pgsize, ebcnt, pgcnt, mtd->oobsize);
|
||||
|
||||
err = -ENOMEM;
|
||||
bufsize = pgsize * 2;
|
||||
writebuf = kmalloc(mtd->erasesize, GFP_KERNEL);
|
||||
if (!writebuf) {
|
||||
printk(PRINT_PREF "error: cannot allocate memory\n");
|
||||
goto out;
|
||||
}
|
||||
twopages = kmalloc(bufsize, GFP_KERNEL);
|
||||
if (!twopages) {
|
||||
printk(PRINT_PREF "error: cannot allocate memory\n");
|
||||
goto out;
|
||||
}
|
||||
boundary = kmalloc(bufsize, GFP_KERNEL);
|
||||
if (!boundary) {
|
||||
printk(PRINT_PREF "error: cannot allocate memory\n");
|
||||
goto out;
|
||||
}
|
||||
|
||||
err = scan_for_bad_eraseblocks();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
/* Erase all eraseblocks */
|
||||
printk(PRINT_PREF "erasing whole device\n");
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
if (bbt[i])
|
||||
continue;
|
||||
err = erase_eraseblock(i);
|
||||
if (err)
|
||||
goto out;
|
||||
cond_resched();
|
||||
}
|
||||
printk(PRINT_PREF "erased %u eraseblocks\n", i);
|
||||
|
||||
/* Write all eraseblocks */
|
||||
simple_srand(1);
|
||||
printk(PRINT_PREF "writing whole device\n");
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
if (bbt[i])
|
||||
continue;
|
||||
err = write_eraseblock(i);
|
||||
if (err)
|
||||
goto out;
|
||||
if (i % 256 == 0)
|
||||
printk(PRINT_PREF "written up to eraseblock %u\n", i);
|
||||
cond_resched();
|
||||
}
|
||||
printk(PRINT_PREF "written %u eraseblocks\n", i);
|
||||
|
||||
/* Check all eraseblocks */
|
||||
simple_srand(1);
|
||||
printk(PRINT_PREF "verifying all eraseblocks\n");
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
if (bbt[i])
|
||||
continue;
|
||||
err = verify_eraseblock(i);
|
||||
if (err)
|
||||
goto out;
|
||||
if (i % 256 == 0)
|
||||
printk(PRINT_PREF "verified up to eraseblock %u\n", i);
|
||||
cond_resched();
|
||||
}
|
||||
printk(PRINT_PREF "verified %u eraseblocks\n", i);
|
||||
|
||||
err = crosstest();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
err = erasecrosstest();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
err = erasetest();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
printk(PRINT_PREF "finished with %d errors\n", errcnt);
|
||||
out:
|
||||
|
||||
kfree(bbt);
|
||||
kfree(boundary);
|
||||
kfree(twopages);
|
||||
kfree(writebuf);
|
||||
put_mtd_device(mtd);
|
||||
if (err)
|
||||
printk(PRINT_PREF "error %d occurred\n", err);
|
||||
printk(KERN_INFO "=================================================\n");
|
||||
return err;
|
||||
}
|
||||
module_init(mtd_pagetest_init);
|
||||
|
||||
static void __exit mtd_pagetest_exit(void)
|
||||
{
|
||||
return;
|
||||
}
|
||||
module_exit(mtd_pagetest_exit);
|
||||
|
||||
MODULE_DESCRIPTION("NAND page test");
|
||||
MODULE_AUTHOR("Adrian Hunter");
|
||||
MODULE_LICENSE("GPL");
|
||||
|
|
@ -0,0 +1,253 @@
|
|||
/*
|
||||
* Copyright (C) 2006-2008 Nokia Corporation
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License version 2 as published by
|
||||
* the Free Software Foundation.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful, but WITHOUT
|
||||
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
|
||||
* more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License along with
|
||||
* this program; see the file COPYING. If not, write to the Free Software
|
||||
* Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
||||
*
|
||||
* Check MTD device read.
|
||||
*
|
||||
* Author: Adrian Hunter <ext-adrian.hunter@nokia.com>
|
||||
*/
|
||||
|
||||
#include <linux/init.h>
|
||||
#include <linux/module.h>
|
||||
#include <linux/moduleparam.h>
|
||||
#include <linux/err.h>
|
||||
#include <linux/mtd/mtd.h>
|
||||
#include <linux/sched.h>
|
||||
|
||||
#define PRINT_PREF KERN_INFO "mtd_readtest: "
|
||||
|
||||
static int dev;
|
||||
module_param(dev, int, S_IRUGO);
|
||||
MODULE_PARM_DESC(dev, "MTD device number to use");
|
||||
|
||||
static struct mtd_info *mtd;
|
||||
static unsigned char *iobuf;
|
||||
static unsigned char *iobuf1;
|
||||
static unsigned char *bbt;
|
||||
|
||||
static int pgsize;
|
||||
static int ebcnt;
|
||||
static int pgcnt;
|
||||
|
||||
static int read_eraseblock_by_page(int ebnum)
|
||||
{
|
||||
size_t read = 0;
|
||||
int i, ret, err = 0;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
void *buf = iobuf;
|
||||
void *oobbuf = iobuf1;
|
||||
|
||||
for (i = 0; i < pgcnt; i++) {
|
||||
memset(buf, 0 , pgcnt);
|
||||
ret = mtd->read(mtd, addr, pgsize, &read, buf);
|
||||
if (ret == -EUCLEAN)
|
||||
ret = 0;
|
||||
if (ret || read != pgsize) {
|
||||
printk(PRINT_PREF "error: read failed at %#llx\n",
|
||||
(long long)addr);
|
||||
if (!err)
|
||||
err = ret;
|
||||
if (!err)
|
||||
err = -EINVAL;
|
||||
}
|
||||
if (mtd->oobsize) {
|
||||
struct mtd_oob_ops ops;
|
||||
|
||||
ops.mode = MTD_OOB_PLACE;
|
||||
ops.len = 0;
|
||||
ops.retlen = 0;
|
||||
ops.ooblen = mtd->oobsize;
|
||||
ops.oobretlen = 0;
|
||||
ops.ooboffs = 0;
|
||||
ops.datbuf = 0;
|
||||
ops.oobbuf = oobbuf;
|
||||
ret = mtd->read_oob(mtd, addr, &ops);
|
||||
if (ret || ops.oobretlen != mtd->oobsize) {
|
||||
printk(PRINT_PREF "error: read oob failed at "
|
||||
"%#llx\n", (long long)addr);
|
||||
if (!err)
|
||||
err = ret;
|
||||
if (!err)
|
||||
err = -EINVAL;
|
||||
}
|
||||
oobbuf += mtd->oobsize;
|
||||
}
|
||||
addr += pgsize;
|
||||
buf += pgsize;
|
||||
}
|
||||
|
||||
return err;
|
||||
}
|
||||
|
||||
static void dump_eraseblock(int ebnum)
|
||||
{
|
||||
int i, j, n;
|
||||
char line[128];
|
||||
int pg, oob;
|
||||
|
||||
printk(PRINT_PREF "dumping eraseblock %d\n", ebnum);
|
||||
n = mtd->erasesize;
|
||||
for (i = 0; i < n;) {
|
||||
char *p = line;
|
||||
|
||||
p += sprintf(p, "%05x: ", i);
|
||||
for (j = 0; j < 32 && i < n; j++, i++)
|
||||
p += sprintf(p, "%02x", (unsigned int)iobuf[i]);
|
||||
printk(KERN_CRIT "%s\n", line);
|
||||
cond_resched();
|
||||
}
|
||||
if (!mtd->oobsize)
|
||||
return;
|
||||
printk(PRINT_PREF "dumping oob from eraseblock %d\n", ebnum);
|
||||
n = mtd->oobsize;
|
||||
for (pg = 0, i = 0; pg < pgcnt; pg++)
|
||||
for (oob = 0; oob < n;) {
|
||||
char *p = line;
|
||||
|
||||
p += sprintf(p, "%05x: ", i);
|
||||
for (j = 0; j < 32 && oob < n; j++, oob++, i++)
|
||||
p += sprintf(p, "%02x",
|
||||
(unsigned int)iobuf1[i]);
|
||||
printk(KERN_CRIT "%s\n", line);
|
||||
cond_resched();
|
||||
}
|
||||
}
|
||||
|
||||
static int is_block_bad(int ebnum)
|
||||
{
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
int ret;
|
||||
|
||||
ret = mtd->block_isbad(mtd, addr);
|
||||
if (ret)
|
||||
printk(PRINT_PREF "block %d is bad\n", ebnum);
|
||||
return ret;
|
||||
}
|
||||
|
||||
static int scan_for_bad_eraseblocks(void)
|
||||
{
|
||||
int i, bad = 0;
|
||||
|
||||
bbt = kmalloc(ebcnt, GFP_KERNEL);
|
||||
if (!bbt) {
|
||||
printk(PRINT_PREF "error: cannot allocate memory\n");
|
||||
return -ENOMEM;
|
||||
}
|
||||
memset(bbt, 0 , ebcnt);
|
||||
|
||||
printk(PRINT_PREF "scanning for bad eraseblocks\n");
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
bbt[i] = is_block_bad(i) ? 1 : 0;
|
||||
if (bbt[i])
|
||||
bad += 1;
|
||||
cond_resched();
|
||||
}
|
||||
printk(PRINT_PREF "scanned %d eraseblocks, %d are bad\n", i, bad);
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int __init mtd_readtest_init(void)
|
||||
{
|
||||
uint64_t tmp;
|
||||
int err, i;
|
||||
|
||||
printk(KERN_INFO "\n");
|
||||
printk(KERN_INFO "=================================================\n");
|
||||
printk(PRINT_PREF "MTD device: %d\n", dev);
|
||||
|
||||
mtd = get_mtd_device(NULL, dev);
|
||||
if (IS_ERR(mtd)) {
|
||||
err = PTR_ERR(mtd);
|
||||
printk(PRINT_PREF "error: Cannot get MTD device\n");
|
||||
return err;
|
||||
}
|
||||
|
||||
if (mtd->writesize == 1) {
|
||||
printk(PRINT_PREF "not NAND flash, assume page size is 512 "
|
||||
"bytes.\n");
|
||||
pgsize = 512;
|
||||
} else
|
||||
pgsize = mtd->writesize;
|
||||
|
||||
tmp = mtd->size;
|
||||
do_div(tmp, mtd->erasesize);
|
||||
ebcnt = tmp;
|
||||
pgcnt = mtd->erasesize / mtd->writesize;
|
||||
|
||||
printk(PRINT_PREF "MTD device size %llu, eraseblock size %u, "
|
||||
"page size %u, count of eraseblocks %u, pages per "
|
||||
"eraseblock %u, OOB size %u\n",
|
||||
(unsigned long long)mtd->size, mtd->erasesize,
|
||||
pgsize, ebcnt, pgcnt, mtd->oobsize);
|
||||
|
||||
err = -ENOMEM;
|
||||
iobuf = kmalloc(mtd->erasesize, GFP_KERNEL);
|
||||
if (!iobuf) {
|
||||
printk(PRINT_PREF "error: cannot allocate memory\n");
|
||||
goto out;
|
||||
}
|
||||
iobuf1 = kmalloc(mtd->erasesize, GFP_KERNEL);
|
||||
if (!iobuf1) {
|
||||
printk(PRINT_PREF "error: cannot allocate memory\n");
|
||||
goto out;
|
||||
}
|
||||
|
||||
err = scan_for_bad_eraseblocks();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
/* Read all eraseblocks 1 page at a time */
|
||||
printk(PRINT_PREF "testing page read\n");
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
int ret;
|
||||
|
||||
if (bbt[i])
|
||||
continue;
|
||||
ret = read_eraseblock_by_page(i);
|
||||
if (ret) {
|
||||
dump_eraseblock(i);
|
||||
if (!err)
|
||||
err = ret;
|
||||
}
|
||||
cond_resched();
|
||||
}
|
||||
|
||||
if (err)
|
||||
printk(PRINT_PREF "finished with errors\n");
|
||||
else
|
||||
printk(PRINT_PREF "finished\n");
|
||||
|
||||
out:
|
||||
|
||||
kfree(iobuf);
|
||||
kfree(iobuf1);
|
||||
kfree(bbt);
|
||||
put_mtd_device(mtd);
|
||||
if (err)
|
||||
printk(PRINT_PREF "error %d occurred\n", err);
|
||||
printk(KERN_INFO "=================================================\n");
|
||||
return err;
|
||||
}
|
||||
module_init(mtd_readtest_init);
|
||||
|
||||
static void __exit mtd_readtest_exit(void)
|
||||
{
|
||||
return;
|
||||
}
|
||||
module_exit(mtd_readtest_exit);
|
||||
|
||||
MODULE_DESCRIPTION("Read test module");
|
||||
MODULE_AUTHOR("Adrian Hunter");
|
||||
MODULE_LICENSE("GPL");
|
||||
|
|
@ -0,0 +1,502 @@
|
|||
/*
|
||||
* Copyright (C) 2007 Nokia Corporation
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License version 2 as published by
|
||||
* the Free Software Foundation.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful, but WITHOUT
|
||||
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
|
||||
* more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License along with
|
||||
* this program; see the file COPYING. If not, write to the Free Software
|
||||
* Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
||||
*
|
||||
* Test read and write speed of a MTD device.
|
||||
*
|
||||
* Author: Adrian Hunter <ext-adrian.hunter@nokia.com>
|
||||
*/
|
||||
|
||||
#include <linux/init.h>
|
||||
#include <linux/module.h>
|
||||
#include <linux/moduleparam.h>
|
||||
#include <linux/err.h>
|
||||
#include <linux/mtd/mtd.h>
|
||||
#include <linux/sched.h>
|
||||
|
||||
#define PRINT_PREF KERN_INFO "mtd_speedtest: "
|
||||
|
||||
static int dev;
|
||||
module_param(dev, int, S_IRUGO);
|
||||
MODULE_PARM_DESC(dev, "MTD device number to use");
|
||||
|
||||
static struct mtd_info *mtd;
|
||||
static unsigned char *iobuf;
|
||||
static unsigned char *bbt;
|
||||
|
||||
static int pgsize;
|
||||
static int ebcnt;
|
||||
static int pgcnt;
|
||||
static int goodebcnt;
|
||||
static struct timeval start, finish;
|
||||
static unsigned long next = 1;
|
||||
|
||||
static inline unsigned int simple_rand(void)
|
||||
{
|
||||
next = next * 1103515245 + 12345;
|
||||
return (unsigned int)((next / 65536) % 32768);
|
||||
}
|
||||
|
||||
static inline void simple_srand(unsigned long seed)
|
||||
{
|
||||
next = seed;
|
||||
}
|
||||
|
||||
static void set_random_data(unsigned char *buf, size_t len)
|
||||
{
|
||||
size_t i;
|
||||
|
||||
for (i = 0; i < len; ++i)
|
||||
buf[i] = simple_rand();
|
||||
}
|
||||
|
||||
static int erase_eraseblock(int ebnum)
|
||||
{
|
||||
int err;
|
||||
struct erase_info ei;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
|
||||
memset(&ei, 0, sizeof(struct erase_info));
|
||||
ei.mtd = mtd;
|
||||
ei.addr = addr;
|
||||
ei.len = mtd->erasesize;
|
||||
|
||||
err = mtd->erase(mtd, &ei);
|
||||
if (err) {
|
||||
printk(PRINT_PREF "error %d while erasing EB %d\n", err, ebnum);
|
||||
return err;
|
||||
}
|
||||
|
||||
if (ei.state == MTD_ERASE_FAILED) {
|
||||
printk(PRINT_PREF "some erase error occurred at EB %d\n",
|
||||
ebnum);
|
||||
return -EIO;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int erase_whole_device(void)
|
||||
{
|
||||
int err;
|
||||
unsigned int i;
|
||||
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
if (bbt[i])
|
||||
continue;
|
||||
err = erase_eraseblock(i);
|
||||
if (err)
|
||||
return err;
|
||||
cond_resched();
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int write_eraseblock(int ebnum)
|
||||
{
|
||||
size_t written = 0;
|
||||
int err = 0;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
|
||||
err = mtd->write(mtd, addr, mtd->erasesize, &written, iobuf);
|
||||
if (err || written != mtd->erasesize) {
|
||||
printk(PRINT_PREF "error: write failed at %#llx\n", addr);
|
||||
if (!err)
|
||||
err = -EINVAL;
|
||||
}
|
||||
|
||||
return err;
|
||||
}
|
||||
|
||||
static int write_eraseblock_by_page(int ebnum)
|
||||
{
|
||||
size_t written = 0;
|
||||
int i, err = 0;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
void *buf = iobuf;
|
||||
|
||||
for (i = 0; i < pgcnt; i++) {
|
||||
err = mtd->write(mtd, addr, pgsize, &written, buf);
|
||||
if (err || written != pgsize) {
|
||||
printk(PRINT_PREF "error: write failed at %#llx\n",
|
||||
addr);
|
||||
if (!err)
|
||||
err = -EINVAL;
|
||||
break;
|
||||
}
|
||||
addr += pgsize;
|
||||
buf += pgsize;
|
||||
}
|
||||
|
||||
return err;
|
||||
}
|
||||
|
||||
static int write_eraseblock_by_2pages(int ebnum)
|
||||
{
|
||||
size_t written = 0, sz = pgsize * 2;
|
||||
int i, n = pgcnt / 2, err = 0;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
void *buf = iobuf;
|
||||
|
||||
for (i = 0; i < n; i++) {
|
||||
err = mtd->write(mtd, addr, sz, &written, buf);
|
||||
if (err || written != sz) {
|
||||
printk(PRINT_PREF "error: write failed at %#llx\n",
|
||||
addr);
|
||||
if (!err)
|
||||
err = -EINVAL;
|
||||
return err;
|
||||
}
|
||||
addr += sz;
|
||||
buf += sz;
|
||||
}
|
||||
if (pgcnt % 2) {
|
||||
err = mtd->write(mtd, addr, pgsize, &written, buf);
|
||||
if (err || written != pgsize) {
|
||||
printk(PRINT_PREF "error: write failed at %#llx\n",
|
||||
addr);
|
||||
if (!err)
|
||||
err = -EINVAL;
|
||||
}
|
||||
}
|
||||
|
||||
return err;
|
||||
}
|
||||
|
||||
static int read_eraseblock(int ebnum)
|
||||
{
|
||||
size_t read = 0;
|
||||
int err = 0;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
|
||||
err = mtd->read(mtd, addr, mtd->erasesize, &read, iobuf);
|
||||
/* Ignore corrected ECC errors */
|
||||
if (err == -EUCLEAN)
|
||||
err = 0;
|
||||
if (err || read != mtd->erasesize) {
|
||||
printk(PRINT_PREF "error: read failed at %#llx\n", addr);
|
||||
if (!err)
|
||||
err = -EINVAL;
|
||||
}
|
||||
|
||||
return err;
|
||||
}
|
||||
|
||||
static int read_eraseblock_by_page(int ebnum)
|
||||
{
|
||||
size_t read = 0;
|
||||
int i, err = 0;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
void *buf = iobuf;
|
||||
|
||||
for (i = 0; i < pgcnt; i++) {
|
||||
err = mtd->read(mtd, addr, pgsize, &read, buf);
|
||||
/* Ignore corrected ECC errors */
|
||||
if (err == -EUCLEAN)
|
||||
err = 0;
|
||||
if (err || read != pgsize) {
|
||||
printk(PRINT_PREF "error: read failed at %#llx\n",
|
||||
addr);
|
||||
if (!err)
|
||||
err = -EINVAL;
|
||||
break;
|
||||
}
|
||||
addr += pgsize;
|
||||
buf += pgsize;
|
||||
}
|
||||
|
||||
return err;
|
||||
}
|
||||
|
||||
static int read_eraseblock_by_2pages(int ebnum)
|
||||
{
|
||||
size_t read = 0, sz = pgsize * 2;
|
||||
int i, n = pgcnt / 2, err = 0;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
void *buf = iobuf;
|
||||
|
||||
for (i = 0; i < n; i++) {
|
||||
err = mtd->read(mtd, addr, sz, &read, buf);
|
||||
/* Ignore corrected ECC errors */
|
||||
if (err == -EUCLEAN)
|
||||
err = 0;
|
||||
if (err || read != sz) {
|
||||
printk(PRINT_PREF "error: read failed at %#llx\n",
|
||||
addr);
|
||||
if (!err)
|
||||
err = -EINVAL;
|
||||
return err;
|
||||
}
|
||||
addr += sz;
|
||||
buf += sz;
|
||||
}
|
||||
if (pgcnt % 2) {
|
||||
err = mtd->read(mtd, addr, pgsize, &read, buf);
|
||||
/* Ignore corrected ECC errors */
|
||||
if (err == -EUCLEAN)
|
||||
err = 0;
|
||||
if (err || read != pgsize) {
|
||||
printk(PRINT_PREF "error: read failed at %#llx\n",
|
||||
addr);
|
||||
if (!err)
|
||||
err = -EINVAL;
|
||||
}
|
||||
}
|
||||
|
||||
return err;
|
||||
}
|
||||
|
||||
static int is_block_bad(int ebnum)
|
||||
{
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
int ret;
|
||||
|
||||
ret = mtd->block_isbad(mtd, addr);
|
||||
if (ret)
|
||||
printk(PRINT_PREF "block %d is bad\n", ebnum);
|
||||
return ret;
|
||||
}
|
||||
|
||||
static inline void start_timing(void)
|
||||
{
|
||||
do_gettimeofday(&start);
|
||||
}
|
||||
|
||||
static inline void stop_timing(void)
|
||||
{
|
||||
do_gettimeofday(&finish);
|
||||
}
|
||||
|
||||
static long calc_speed(void)
|
||||
{
|
||||
long ms, k, speed;
|
||||
|
||||
ms = (finish.tv_sec - start.tv_sec) * 1000 +
|
||||
(finish.tv_usec - start.tv_usec) / 1000;
|
||||
k = goodebcnt * mtd->erasesize / 1024;
|
||||
speed = (k * 1000) / ms;
|
||||
return speed;
|
||||
}
|
||||
|
||||
static int scan_for_bad_eraseblocks(void)
|
||||
{
|
||||
int i, bad = 0;
|
||||
|
||||
bbt = kmalloc(ebcnt, GFP_KERNEL);
|
||||
if (!bbt) {
|
||||
printk(PRINT_PREF "error: cannot allocate memory\n");
|
||||
return -ENOMEM;
|
||||
}
|
||||
memset(bbt, 0 , ebcnt);
|
||||
|
||||
printk(PRINT_PREF "scanning for bad eraseblocks\n");
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
bbt[i] = is_block_bad(i) ? 1 : 0;
|
||||
if (bbt[i])
|
||||
bad += 1;
|
||||
cond_resched();
|
||||
}
|
||||
printk(PRINT_PREF "scanned %d eraseblocks, %d are bad\n", i, bad);
|
||||
goodebcnt = ebcnt - bad;
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int __init mtd_speedtest_init(void)
|
||||
{
|
||||
int err, i;
|
||||
long speed;
|
||||
uint64_t tmp;
|
||||
|
||||
printk(KERN_INFO "\n");
|
||||
printk(KERN_INFO "=================================================\n");
|
||||
printk(PRINT_PREF "MTD device: %d\n", dev);
|
||||
|
||||
mtd = get_mtd_device(NULL, dev);
|
||||
if (IS_ERR(mtd)) {
|
||||
err = PTR_ERR(mtd);
|
||||
printk(PRINT_PREF "error: cannot get MTD device\n");
|
||||
return err;
|
||||
}
|
||||
|
||||
if (mtd->writesize == 1) {
|
||||
printk(PRINT_PREF "not NAND flash, assume page size is 512 "
|
||||
"bytes.\n");
|
||||
pgsize = 512;
|
||||
} else
|
||||
pgsize = mtd->writesize;
|
||||
|
||||
tmp = mtd->size;
|
||||
do_div(tmp, mtd->erasesize);
|
||||
ebcnt = tmp;
|
||||
pgcnt = mtd->erasesize / mtd->writesize;
|
||||
|
||||
printk(PRINT_PREF "MTD device size %llu, eraseblock size %u, "
|
||||
"page size %u, count of eraseblocks %u, pages per "
|
||||
"eraseblock %u, OOB size %u\n",
|
||||
(unsigned long long)mtd->size, mtd->erasesize,
|
||||
pgsize, ebcnt, pgcnt, mtd->oobsize);
|
||||
|
||||
err = -ENOMEM;
|
||||
iobuf = kmalloc(mtd->erasesize, GFP_KERNEL);
|
||||
if (!iobuf) {
|
||||
printk(PRINT_PREF "error: cannot allocate memory\n");
|
||||
goto out;
|
||||
}
|
||||
|
||||
simple_srand(1);
|
||||
set_random_data(iobuf, mtd->erasesize);
|
||||
|
||||
err = scan_for_bad_eraseblocks();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
err = erase_whole_device();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
/* Write all eraseblocks, 1 eraseblock at a time */
|
||||
printk(PRINT_PREF "testing eraseblock write speed\n");
|
||||
start_timing();
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
if (bbt[i])
|
||||
continue;
|
||||
err = write_eraseblock(i);
|
||||
if (err)
|
||||
goto out;
|
||||
cond_resched();
|
||||
}
|
||||
stop_timing();
|
||||
speed = calc_speed();
|
||||
printk(PRINT_PREF "eraseblock write speed is %ld KiB/s\n", speed);
|
||||
|
||||
/* Read all eraseblocks, 1 eraseblock at a time */
|
||||
printk(PRINT_PREF "testing eraseblock read speed\n");
|
||||
start_timing();
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
if (bbt[i])
|
||||
continue;
|
||||
err = read_eraseblock(i);
|
||||
if (err)
|
||||
goto out;
|
||||
cond_resched();
|
||||
}
|
||||
stop_timing();
|
||||
speed = calc_speed();
|
||||
printk(PRINT_PREF "eraseblock read speed is %ld KiB/s\n", speed);
|
||||
|
||||
err = erase_whole_device();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
/* Write all eraseblocks, 1 page at a time */
|
||||
printk(PRINT_PREF "testing page write speed\n");
|
||||
start_timing();
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
if (bbt[i])
|
||||
continue;
|
||||
err = write_eraseblock_by_page(i);
|
||||
if (err)
|
||||
goto out;
|
||||
cond_resched();
|
||||
}
|
||||
stop_timing();
|
||||
speed = calc_speed();
|
||||
printk(PRINT_PREF "page write speed is %ld KiB/s\n", speed);
|
||||
|
||||
/* Read all eraseblocks, 1 page at a time */
|
||||
printk(PRINT_PREF "testing page read speed\n");
|
||||
start_timing();
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
if (bbt[i])
|
||||
continue;
|
||||
err = read_eraseblock_by_page(i);
|
||||
if (err)
|
||||
goto out;
|
||||
cond_resched();
|
||||
}
|
||||
stop_timing();
|
||||
speed = calc_speed();
|
||||
printk(PRINT_PREF "page read speed is %ld KiB/s\n", speed);
|
||||
|
||||
err = erase_whole_device();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
/* Write all eraseblocks, 2 pages at a time */
|
||||
printk(PRINT_PREF "testing 2 page write speed\n");
|
||||
start_timing();
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
if (bbt[i])
|
||||
continue;
|
||||
err = write_eraseblock_by_2pages(i);
|
||||
if (err)
|
||||
goto out;
|
||||
cond_resched();
|
||||
}
|
||||
stop_timing();
|
||||
speed = calc_speed();
|
||||
printk(PRINT_PREF "2 page write speed is %ld KiB/s\n", speed);
|
||||
|
||||
/* Read all eraseblocks, 2 pages at a time */
|
||||
printk(PRINT_PREF "testing 2 page read speed\n");
|
||||
start_timing();
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
if (bbt[i])
|
||||
continue;
|
||||
err = read_eraseblock_by_2pages(i);
|
||||
if (err)
|
||||
goto out;
|
||||
cond_resched();
|
||||
}
|
||||
stop_timing();
|
||||
speed = calc_speed();
|
||||
printk(PRINT_PREF "2 page read speed is %ld KiB/s\n", speed);
|
||||
|
||||
/* Erase all eraseblocks */
|
||||
printk(PRINT_PREF "Testing erase speed\n");
|
||||
start_timing();
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
if (bbt[i])
|
||||
continue;
|
||||
err = erase_eraseblock(i);
|
||||
if (err)
|
||||
goto out;
|
||||
cond_resched();
|
||||
}
|
||||
stop_timing();
|
||||
speed = calc_speed();
|
||||
printk(PRINT_PREF "erase speed is %ld KiB/s\n", speed);
|
||||
|
||||
printk(PRINT_PREF "finished\n");
|
||||
out:
|
||||
kfree(iobuf);
|
||||
kfree(bbt);
|
||||
put_mtd_device(mtd);
|
||||
if (err)
|
||||
printk(PRINT_PREF "error %d occurred\n", err);
|
||||
printk(KERN_INFO "=================================================\n");
|
||||
return err;
|
||||
}
|
||||
module_init(mtd_speedtest_init);
|
||||
|
||||
static void __exit mtd_speedtest_exit(void)
|
||||
{
|
||||
return;
|
||||
}
|
||||
module_exit(mtd_speedtest_exit);
|
||||
|
||||
MODULE_DESCRIPTION("Speed test module");
|
||||
MODULE_AUTHOR("Adrian Hunter");
|
||||
MODULE_LICENSE("GPL");
|
||||
|
|
@ -0,0 +1,330 @@
|
|||
/*
|
||||
* Copyright (C) 2006-2008 Nokia Corporation
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License version 2 as published by
|
||||
* the Free Software Foundation.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful, but WITHOUT
|
||||
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
|
||||
* more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License along with
|
||||
* this program; see the file COPYING. If not, write to the Free Software
|
||||
* Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
||||
*
|
||||
* Test random reads, writes and erases on MTD device.
|
||||
*
|
||||
* Author: Adrian Hunter <ext-adrian.hunter@nokia.com>
|
||||
*/
|
||||
|
||||
#include <linux/init.h>
|
||||
#include <linux/module.h>
|
||||
#include <linux/moduleparam.h>
|
||||
#include <linux/err.h>
|
||||
#include <linux/mtd/mtd.h>
|
||||
#include <linux/sched.h>
|
||||
#include <linux/vmalloc.h>
|
||||
|
||||
#define PRINT_PREF KERN_INFO "mtd_stresstest: "
|
||||
|
||||
static int dev;
|
||||
module_param(dev, int, S_IRUGO);
|
||||
MODULE_PARM_DESC(dev, "MTD device number to use");
|
||||
|
||||
static int count = 10000;
|
||||
module_param(count, int, S_IRUGO);
|
||||
MODULE_PARM_DESC(count, "Number of operations to do (default is 10000)");
|
||||
|
||||
static struct mtd_info *mtd;
|
||||
static unsigned char *writebuf;
|
||||
static unsigned char *readbuf;
|
||||
static unsigned char *bbt;
|
||||
static int *offsets;
|
||||
|
||||
static int pgsize;
|
||||
static int bufsize;
|
||||
static int ebcnt;
|
||||
static int pgcnt;
|
||||
static unsigned long next = 1;
|
||||
|
||||
static inline unsigned int simple_rand(void)
|
||||
{
|
||||
next = next * 1103515245 + 12345;
|
||||
return (unsigned int)((next / 65536) % 32768);
|
||||
}
|
||||
|
||||
static inline void simple_srand(unsigned long seed)
|
||||
{
|
||||
next = seed;
|
||||
}
|
||||
|
||||
static int rand_eb(void)
|
||||
{
|
||||
int eb;
|
||||
|
||||
again:
|
||||
if (ebcnt < 32768)
|
||||
eb = simple_rand();
|
||||
else
|
||||
eb = (simple_rand() << 15) | simple_rand();
|
||||
/* Read or write up 2 eraseblocks at a time - hence 'ebcnt - 1' */
|
||||
eb %= (ebcnt - 1);
|
||||
if (bbt[eb])
|
||||
goto again;
|
||||
return eb;
|
||||
}
|
||||
|
||||
static int rand_offs(void)
|
||||
{
|
||||
int offs;
|
||||
|
||||
if (bufsize < 32768)
|
||||
offs = simple_rand();
|
||||
else
|
||||
offs = (simple_rand() << 15) | simple_rand();
|
||||
offs %= bufsize;
|
||||
return offs;
|
||||
}
|
||||
|
||||
static int rand_len(int offs)
|
||||
{
|
||||
int len;
|
||||
|
||||
if (bufsize < 32768)
|
||||
len = simple_rand();
|
||||
else
|
||||
len = (simple_rand() << 15) | simple_rand();
|
||||
len %= (bufsize - offs);
|
||||
return len;
|
||||
}
|
||||
|
||||
static int erase_eraseblock(int ebnum)
|
||||
{
|
||||
int err;
|
||||
struct erase_info ei;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
|
||||
memset(&ei, 0, sizeof(struct erase_info));
|
||||
ei.mtd = mtd;
|
||||
ei.addr = addr;
|
||||
ei.len = mtd->erasesize;
|
||||
|
||||
err = mtd->erase(mtd, &ei);
|
||||
if (unlikely(err)) {
|
||||
printk(PRINT_PREF "error %d while erasing EB %d\n", err, ebnum);
|
||||
return err;
|
||||
}
|
||||
|
||||
if (unlikely(ei.state == MTD_ERASE_FAILED)) {
|
||||
printk(PRINT_PREF "some erase error occurred at EB %d\n",
|
||||
ebnum);
|
||||
return -EIO;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int is_block_bad(int ebnum)
|
||||
{
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
int ret;
|
||||
|
||||
ret = mtd->block_isbad(mtd, addr);
|
||||
if (ret)
|
||||
printk(PRINT_PREF "block %d is bad\n", ebnum);
|
||||
return ret;
|
||||
}
|
||||
|
||||
static int do_read(void)
|
||||
{
|
||||
size_t read = 0;
|
||||
int eb = rand_eb();
|
||||
int offs = rand_offs();
|
||||
int len = rand_len(offs), err;
|
||||
loff_t addr;
|
||||
|
||||
if (bbt[eb + 1]) {
|
||||
if (offs >= mtd->erasesize)
|
||||
offs -= mtd->erasesize;
|
||||
if (offs + len > mtd->erasesize)
|
||||
len = mtd->erasesize - offs;
|
||||
}
|
||||
addr = eb * mtd->erasesize + offs;
|
||||
err = mtd->read(mtd, addr, len, &read, readbuf);
|
||||
if (err == -EUCLEAN)
|
||||
err = 0;
|
||||
if (unlikely(err || read != len)) {
|
||||
printk(PRINT_PREF "error: read failed at 0x%llx\n",
|
||||
(long long)addr);
|
||||
if (!err)
|
||||
err = -EINVAL;
|
||||
return err;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int do_write(void)
|
||||
{
|
||||
int eb = rand_eb(), offs, err, len;
|
||||
size_t written = 0;
|
||||
loff_t addr;
|
||||
|
||||
offs = offsets[eb];
|
||||
if (offs >= mtd->erasesize) {
|
||||
err = erase_eraseblock(eb);
|
||||
if (err)
|
||||
return err;
|
||||
offs = offsets[eb] = 0;
|
||||
}
|
||||
len = rand_len(offs);
|
||||
len = ((len + pgsize - 1) / pgsize) * pgsize;
|
||||
if (offs + len > mtd->erasesize) {
|
||||
if (bbt[eb + 1])
|
||||
len = mtd->erasesize - offs;
|
||||
else {
|
||||
err = erase_eraseblock(eb + 1);
|
||||
if (err)
|
||||
return err;
|
||||
offsets[eb + 1] = 0;
|
||||
}
|
||||
}
|
||||
addr = eb * mtd->erasesize + offs;
|
||||
err = mtd->write(mtd, addr, len, &written, writebuf);
|
||||
if (unlikely(err || written != len)) {
|
||||
printk(PRINT_PREF "error: write failed at 0x%llx\n",
|
||||
(long long)addr);
|
||||
if (!err)
|
||||
err = -EINVAL;
|
||||
return err;
|
||||
}
|
||||
offs += len;
|
||||
while (offs > mtd->erasesize) {
|
||||
offsets[eb++] = mtd->erasesize;
|
||||
offs -= mtd->erasesize;
|
||||
}
|
||||
offsets[eb] = offs;
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int do_operation(void)
|
||||
{
|
||||
if (simple_rand() & 1)
|
||||
return do_read();
|
||||
else
|
||||
return do_write();
|
||||
}
|
||||
|
||||
static int scan_for_bad_eraseblocks(void)
|
||||
{
|
||||
int i, bad = 0;
|
||||
|
||||
bbt = kmalloc(ebcnt, GFP_KERNEL);
|
||||
if (!bbt) {
|
||||
printk(PRINT_PREF "error: cannot allocate memory\n");
|
||||
return -ENOMEM;
|
||||
}
|
||||
memset(bbt, 0 , ebcnt);
|
||||
|
||||
printk(PRINT_PREF "scanning for bad eraseblocks\n");
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
bbt[i] = is_block_bad(i) ? 1 : 0;
|
||||
if (bbt[i])
|
||||
bad += 1;
|
||||
cond_resched();
|
||||
}
|
||||
printk(PRINT_PREF "scanned %d eraseblocks, %d are bad\n", i, bad);
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int __init mtd_stresstest_init(void)
|
||||
{
|
||||
int err;
|
||||
int i, op;
|
||||
uint64_t tmp;
|
||||
|
||||
printk(KERN_INFO "\n");
|
||||
printk(KERN_INFO "=================================================\n");
|
||||
printk(PRINT_PREF "MTD device: %d\n", dev);
|
||||
|
||||
mtd = get_mtd_device(NULL, dev);
|
||||
if (IS_ERR(mtd)) {
|
||||
err = PTR_ERR(mtd);
|
||||
printk(PRINT_PREF "error: cannot get MTD device\n");
|
||||
return err;
|
||||
}
|
||||
|
||||
if (mtd->writesize == 1) {
|
||||
printk(PRINT_PREF "not NAND flash, assume page size is 512 "
|
||||
"bytes.\n");
|
||||
pgsize = 512;
|
||||
} else
|
||||
pgsize = mtd->writesize;
|
||||
|
||||
tmp = mtd->size;
|
||||
do_div(tmp, mtd->erasesize);
|
||||
ebcnt = tmp;
|
||||
pgcnt = mtd->erasesize / mtd->writesize;
|
||||
|
||||
printk(PRINT_PREF "MTD device size %llu, eraseblock size %u, "
|
||||
"page size %u, count of eraseblocks %u, pages per "
|
||||
"eraseblock %u, OOB size %u\n",
|
||||
(unsigned long long)mtd->size, mtd->erasesize,
|
||||
pgsize, ebcnt, pgcnt, mtd->oobsize);
|
||||
|
||||
/* Read or write up 2 eraseblocks at a time */
|
||||
bufsize = mtd->erasesize * 2;
|
||||
|
||||
err = -ENOMEM;
|
||||
readbuf = vmalloc(bufsize);
|
||||
writebuf = vmalloc(bufsize);
|
||||
offsets = kmalloc(ebcnt * sizeof(int), GFP_KERNEL);
|
||||
if (!readbuf || !writebuf || !offsets) {
|
||||
printk(PRINT_PREF "error: cannot allocate memory\n");
|
||||
goto out;
|
||||
}
|
||||
for (i = 0; i < ebcnt; i++)
|
||||
offsets[i] = mtd->erasesize;
|
||||
simple_srand(current->pid);
|
||||
for (i = 0; i < bufsize; i++)
|
||||
writebuf[i] = simple_rand();
|
||||
|
||||
err = scan_for_bad_eraseblocks();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
/* Do operations */
|
||||
printk(PRINT_PREF "doing operations\n");
|
||||
for (op = 0; op < count; op++) {
|
||||
if ((op & 1023) == 0)
|
||||
printk(PRINT_PREF "%d operations done\n", op);
|
||||
err = do_operation();
|
||||
if (err)
|
||||
goto out;
|
||||
cond_resched();
|
||||
}
|
||||
printk(PRINT_PREF "finished, %d operations done\n", op);
|
||||
|
||||
out:
|
||||
kfree(offsets);
|
||||
kfree(bbt);
|
||||
vfree(writebuf);
|
||||
vfree(readbuf);
|
||||
put_mtd_device(mtd);
|
||||
if (err)
|
||||
printk(PRINT_PREF "error %d occurred\n", err);
|
||||
printk(KERN_INFO "=================================================\n");
|
||||
return err;
|
||||
}
|
||||
module_init(mtd_stresstest_init);
|
||||
|
||||
static void __exit mtd_stresstest_exit(void)
|
||||
{
|
||||
return;
|
||||
}
|
||||
module_exit(mtd_stresstest_exit);
|
||||
|
||||
MODULE_DESCRIPTION("Stress test module");
|
||||
MODULE_AUTHOR("Adrian Hunter");
|
||||
MODULE_LICENSE("GPL");
|
||||
|
|
@ -0,0 +1,525 @@
|
|||
/*
|
||||
* Copyright (C) 2006-2007 Nokia Corporation
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License version 2 as published by
|
||||
* the Free Software Foundation.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful, but WITHOUT
|
||||
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
|
||||
* more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License along with
|
||||
* this program; see the file COPYING. If not, write to the Free Software
|
||||
* Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
||||
*
|
||||
* Test sub-page read and write on MTD device.
|
||||
* Author: Adrian Hunter <ext-adrian.hunter@nokia.com>
|
||||
*
|
||||
*/
|
||||
|
||||
#include <linux/init.h>
|
||||
#include <linux/module.h>
|
||||
#include <linux/moduleparam.h>
|
||||
#include <linux/err.h>
|
||||
#include <linux/mtd/mtd.h>
|
||||
#include <linux/sched.h>
|
||||
|
||||
#define PRINT_PREF KERN_INFO "mtd_subpagetest: "
|
||||
|
||||
static int dev;
|
||||
module_param(dev, int, S_IRUGO);
|
||||
MODULE_PARM_DESC(dev, "MTD device number to use");
|
||||
|
||||
static struct mtd_info *mtd;
|
||||
static unsigned char *writebuf;
|
||||
static unsigned char *readbuf;
|
||||
static unsigned char *bbt;
|
||||
|
||||
static int subpgsize;
|
||||
static int bufsize;
|
||||
static int ebcnt;
|
||||
static int pgcnt;
|
||||
static int errcnt;
|
||||
static unsigned long next = 1;
|
||||
|
||||
static inline unsigned int simple_rand(void)
|
||||
{
|
||||
next = next * 1103515245 + 12345;
|
||||
return (unsigned int)((next / 65536) % 32768);
|
||||
}
|
||||
|
||||
static inline void simple_srand(unsigned long seed)
|
||||
{
|
||||
next = seed;
|
||||
}
|
||||
|
||||
static void set_random_data(unsigned char *buf, size_t len)
|
||||
{
|
||||
size_t i;
|
||||
|
||||
for (i = 0; i < len; ++i)
|
||||
buf[i] = simple_rand();
|
||||
}
|
||||
|
||||
static inline void clear_data(unsigned char *buf, size_t len)
|
||||
{
|
||||
memset(buf, 0, len);
|
||||
}
|
||||
|
||||
static int erase_eraseblock(int ebnum)
|
||||
{
|
||||
int err;
|
||||
struct erase_info ei;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
|
||||
memset(&ei, 0, sizeof(struct erase_info));
|
||||
ei.mtd = mtd;
|
||||
ei.addr = addr;
|
||||
ei.len = mtd->erasesize;
|
||||
|
||||
err = mtd->erase(mtd, &ei);
|
||||
if (err) {
|
||||
printk(PRINT_PREF "error %d while erasing EB %d\n", err, ebnum);
|
||||
return err;
|
||||
}
|
||||
|
||||
if (ei.state == MTD_ERASE_FAILED) {
|
||||
printk(PRINT_PREF "some erase error occurred at EB %d\n",
|
||||
ebnum);
|
||||
return -EIO;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int erase_whole_device(void)
|
||||
{
|
||||
int err;
|
||||
unsigned int i;
|
||||
|
||||
printk(PRINT_PREF "erasing whole device\n");
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
if (bbt[i])
|
||||
continue;
|
||||
err = erase_eraseblock(i);
|
||||
if (err)
|
||||
return err;
|
||||
cond_resched();
|
||||
}
|
||||
printk(PRINT_PREF "erased %u eraseblocks\n", i);
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int write_eraseblock(int ebnum)
|
||||
{
|
||||
size_t written = 0;
|
||||
int err = 0;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
|
||||
set_random_data(writebuf, subpgsize);
|
||||
err = mtd->write(mtd, addr, subpgsize, &written, writebuf);
|
||||
if (unlikely(err || written != subpgsize)) {
|
||||
printk(PRINT_PREF "error: write failed at %#llx\n",
|
||||
(long long)addr);
|
||||
if (written != subpgsize) {
|
||||
printk(PRINT_PREF " write size: %#x\n", subpgsize);
|
||||
printk(PRINT_PREF " written: %#x\n", written);
|
||||
}
|
||||
return err ? err : -1;
|
||||
}
|
||||
|
||||
addr += subpgsize;
|
||||
|
||||
set_random_data(writebuf, subpgsize);
|
||||
err = mtd->write(mtd, addr, subpgsize, &written, writebuf);
|
||||
if (unlikely(err || written != subpgsize)) {
|
||||
printk(PRINT_PREF "error: write failed at %#llx\n",
|
||||
(long long)addr);
|
||||
if (written != subpgsize) {
|
||||
printk(PRINT_PREF " write size: %#x\n", subpgsize);
|
||||
printk(PRINT_PREF " written: %#x\n", written);
|
||||
}
|
||||
return err ? err : -1;
|
||||
}
|
||||
|
||||
return err;
|
||||
}
|
||||
|
||||
static int write_eraseblock2(int ebnum)
|
||||
{
|
||||
size_t written = 0;
|
||||
int err = 0, k;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
|
||||
for (k = 1; k < 33; ++k) {
|
||||
if (addr + (subpgsize * k) > (ebnum + 1) * mtd->erasesize)
|
||||
break;
|
||||
set_random_data(writebuf, subpgsize * k);
|
||||
err = mtd->write(mtd, addr, subpgsize * k, &written, writebuf);
|
||||
if (unlikely(err || written != subpgsize * k)) {
|
||||
printk(PRINT_PREF "error: write failed at %#llx\n",
|
||||
(long long)addr);
|
||||
if (written != subpgsize) {
|
||||
printk(PRINT_PREF " write size: %#x\n",
|
||||
subpgsize * k);
|
||||
printk(PRINT_PREF " written: %#08x\n",
|
||||
written);
|
||||
}
|
||||
return err ? err : -1;
|
||||
}
|
||||
addr += subpgsize * k;
|
||||
}
|
||||
|
||||
return err;
|
||||
}
|
||||
|
||||
static void print_subpage(unsigned char *p)
|
||||
{
|
||||
int i, j;
|
||||
|
||||
for (i = 0; i < subpgsize; ) {
|
||||
for (j = 0; i < subpgsize && j < 32; ++i, ++j)
|
||||
printk("%02x", *p++);
|
||||
printk("\n");
|
||||
}
|
||||
}
|
||||
|
||||
static int verify_eraseblock(int ebnum)
|
||||
{
|
||||
size_t read = 0;
|
||||
int err = 0;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
|
||||
set_random_data(writebuf, subpgsize);
|
||||
clear_data(readbuf, subpgsize);
|
||||
read = 0;
|
||||
err = mtd->read(mtd, addr, subpgsize, &read, readbuf);
|
||||
if (unlikely(err || read != subpgsize)) {
|
||||
if (err == -EUCLEAN && read == subpgsize) {
|
||||
printk(PRINT_PREF "ECC correction at %#llx\n",
|
||||
(long long)addr);
|
||||
err = 0;
|
||||
} else {
|
||||
printk(PRINT_PREF "error: read failed at %#llx\n",
|
||||
(long long)addr);
|
||||
return err ? err : -1;
|
||||
}
|
||||
}
|
||||
if (unlikely(memcmp(readbuf, writebuf, subpgsize))) {
|
||||
printk(PRINT_PREF "error: verify failed at %#llx\n",
|
||||
(long long)addr);
|
||||
printk(PRINT_PREF "------------- written----------------\n");
|
||||
print_subpage(writebuf);
|
||||
printk(PRINT_PREF "------------- read ------------------\n");
|
||||
print_subpage(readbuf);
|
||||
printk(PRINT_PREF "-------------------------------------\n");
|
||||
errcnt += 1;
|
||||
}
|
||||
|
||||
addr += subpgsize;
|
||||
|
||||
set_random_data(writebuf, subpgsize);
|
||||
clear_data(readbuf, subpgsize);
|
||||
read = 0;
|
||||
err = mtd->read(mtd, addr, subpgsize, &read, readbuf);
|
||||
if (unlikely(err || read != subpgsize)) {
|
||||
if (err == -EUCLEAN && read == subpgsize) {
|
||||
printk(PRINT_PREF "ECC correction at %#llx\n",
|
||||
(long long)addr);
|
||||
err = 0;
|
||||
} else {
|
||||
printk(PRINT_PREF "error: read failed at %#llx\n",
|
||||
(long long)addr);
|
||||
return err ? err : -1;
|
||||
}
|
||||
}
|
||||
if (unlikely(memcmp(readbuf, writebuf, subpgsize))) {
|
||||
printk(PRINT_PREF "error: verify failed at %#llx\n",
|
||||
(long long)addr);
|
||||
printk(PRINT_PREF "------------- written----------------\n");
|
||||
print_subpage(writebuf);
|
||||
printk(PRINT_PREF "------------- read ------------------\n");
|
||||
print_subpage(readbuf);
|
||||
printk(PRINT_PREF "-------------------------------------\n");
|
||||
errcnt += 1;
|
||||
}
|
||||
|
||||
return err;
|
||||
}
|
||||
|
||||
static int verify_eraseblock2(int ebnum)
|
||||
{
|
||||
size_t read = 0;
|
||||
int err = 0, k;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
|
||||
for (k = 1; k < 33; ++k) {
|
||||
if (addr + (subpgsize * k) > (ebnum + 1) * mtd->erasesize)
|
||||
break;
|
||||
set_random_data(writebuf, subpgsize * k);
|
||||
clear_data(readbuf, subpgsize * k);
|
||||
read = 0;
|
||||
err = mtd->read(mtd, addr, subpgsize * k, &read, readbuf);
|
||||
if (unlikely(err || read != subpgsize * k)) {
|
||||
if (err == -EUCLEAN && read == subpgsize * k) {
|
||||
printk(PRINT_PREF "ECC correction at %#llx\n",
|
||||
(long long)addr);
|
||||
err = 0;
|
||||
} else {
|
||||
printk(PRINT_PREF "error: read failed at "
|
||||
"%#llx\n", (long long)addr);
|
||||
return err ? err : -1;
|
||||
}
|
||||
}
|
||||
if (unlikely(memcmp(readbuf, writebuf, subpgsize * k))) {
|
||||
printk(PRINT_PREF "error: verify failed at %#llx\n",
|
||||
(long long)addr);
|
||||
errcnt += 1;
|
||||
}
|
||||
addr += subpgsize * k;
|
||||
}
|
||||
|
||||
return err;
|
||||
}
|
||||
|
||||
static int verify_eraseblock_ff(int ebnum)
|
||||
{
|
||||
uint32_t j;
|
||||
size_t read = 0;
|
||||
int err = 0;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
|
||||
memset(writebuf, 0xff, subpgsize);
|
||||
for (j = 0; j < mtd->erasesize / subpgsize; ++j) {
|
||||
clear_data(readbuf, subpgsize);
|
||||
read = 0;
|
||||
err = mtd->read(mtd, addr, subpgsize, &read, readbuf);
|
||||
if (unlikely(err || read != subpgsize)) {
|
||||
if (err == -EUCLEAN && read == subpgsize) {
|
||||
printk(PRINT_PREF "ECC correction at %#llx\n",
|
||||
(long long)addr);
|
||||
err = 0;
|
||||
} else {
|
||||
printk(PRINT_PREF "error: read failed at "
|
||||
"%#llx\n", (long long)addr);
|
||||
return err ? err : -1;
|
||||
}
|
||||
}
|
||||
if (unlikely(memcmp(readbuf, writebuf, subpgsize))) {
|
||||
printk(PRINT_PREF "error: verify 0xff failed at "
|
||||
"%#llx\n", (long long)addr);
|
||||
errcnt += 1;
|
||||
}
|
||||
addr += subpgsize;
|
||||
}
|
||||
|
||||
return err;
|
||||
}
|
||||
|
||||
static int verify_all_eraseblocks_ff(void)
|
||||
{
|
||||
int err;
|
||||
unsigned int i;
|
||||
|
||||
printk(PRINT_PREF "verifying all eraseblocks for 0xff\n");
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
if (bbt[i])
|
||||
continue;
|
||||
err = verify_eraseblock_ff(i);
|
||||
if (err)
|
||||
return err;
|
||||
if (i % 256 == 0)
|
||||
printk(PRINT_PREF "verified up to eraseblock %u\n", i);
|
||||
cond_resched();
|
||||
}
|
||||
printk(PRINT_PREF "verified %u eraseblocks\n", i);
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int is_block_bad(int ebnum)
|
||||
{
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
int ret;
|
||||
|
||||
ret = mtd->block_isbad(mtd, addr);
|
||||
if (ret)
|
||||
printk(PRINT_PREF "block %d is bad\n", ebnum);
|
||||
return ret;
|
||||
}
|
||||
|
||||
static int scan_for_bad_eraseblocks(void)
|
||||
{
|
||||
int i, bad = 0;
|
||||
|
||||
bbt = kmalloc(ebcnt, GFP_KERNEL);
|
||||
if (!bbt) {
|
||||
printk(PRINT_PREF "error: cannot allocate memory\n");
|
||||
return -ENOMEM;
|
||||
}
|
||||
memset(bbt, 0 , ebcnt);
|
||||
|
||||
printk(PRINT_PREF "scanning for bad eraseblocks\n");
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
bbt[i] = is_block_bad(i) ? 1 : 0;
|
||||
if (bbt[i])
|
||||
bad += 1;
|
||||
cond_resched();
|
||||
}
|
||||
printk(PRINT_PREF "scanned %d eraseblocks, %d are bad\n", i, bad);
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int __init mtd_subpagetest_init(void)
|
||||
{
|
||||
int err = 0;
|
||||
uint32_t i;
|
||||
uint64_t tmp;
|
||||
|
||||
printk(KERN_INFO "\n");
|
||||
printk(KERN_INFO "=================================================\n");
|
||||
printk(PRINT_PREF "MTD device: %d\n", dev);
|
||||
|
||||
mtd = get_mtd_device(NULL, dev);
|
||||
if (IS_ERR(mtd)) {
|
||||
err = PTR_ERR(mtd);
|
||||
printk(PRINT_PREF "error: cannot get MTD device\n");
|
||||
return err;
|
||||
}
|
||||
|
||||
if (mtd->type != MTD_NANDFLASH) {
|
||||
printk(PRINT_PREF "this test requires NAND flash\n");
|
||||
goto out;
|
||||
}
|
||||
|
||||
subpgsize = mtd->writesize >> mtd->subpage_sft;
|
||||
printk(PRINT_PREF "MTD device size %llu, eraseblock size %u, "
|
||||
"page size %u, subpage size %u, count of eraseblocks %u, "
|
||||
"pages per eraseblock %u, OOB size %u\n",
|
||||
(unsigned long long)mtd->size, mtd->erasesize,
|
||||
mtd->writesize, subpgsize, ebcnt, pgcnt, mtd->oobsize);
|
||||
|
||||
err = -ENOMEM;
|
||||
bufsize = subpgsize * 32;
|
||||
writebuf = kmalloc(bufsize, GFP_KERNEL);
|
||||
if (!writebuf) {
|
||||
printk(PRINT_PREF "error: cannot allocate memory\n");
|
||||
goto out;
|
||||
}
|
||||
readbuf = kmalloc(bufsize, GFP_KERNEL);
|
||||
if (!readbuf) {
|
||||
printk(PRINT_PREF "error: cannot allocate memory\n");
|
||||
goto out;
|
||||
}
|
||||
|
||||
tmp = mtd->size;
|
||||
do_div(tmp, mtd->erasesize);
|
||||
ebcnt = tmp;
|
||||
pgcnt = mtd->erasesize / mtd->writesize;
|
||||
|
||||
err = scan_for_bad_eraseblocks();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
err = erase_whole_device();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
printk(PRINT_PREF "writing whole device\n");
|
||||
simple_srand(1);
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
if (bbt[i])
|
||||
continue;
|
||||
err = write_eraseblock(i);
|
||||
if (unlikely(err))
|
||||
goto out;
|
||||
if (i % 256 == 0)
|
||||
printk(PRINT_PREF "written up to eraseblock %u\n", i);
|
||||
cond_resched();
|
||||
}
|
||||
printk(PRINT_PREF "written %u eraseblocks\n", i);
|
||||
|
||||
simple_srand(1);
|
||||
printk(PRINT_PREF "verifying all eraseblocks\n");
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
if (bbt[i])
|
||||
continue;
|
||||
err = verify_eraseblock(i);
|
||||
if (unlikely(err))
|
||||
goto out;
|
||||
if (i % 256 == 0)
|
||||
printk(PRINT_PREF "verified up to eraseblock %u\n", i);
|
||||
cond_resched();
|
||||
}
|
||||
printk(PRINT_PREF "verified %u eraseblocks\n", i);
|
||||
|
||||
err = erase_whole_device();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
err = verify_all_eraseblocks_ff();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
/* Write all eraseblocks */
|
||||
simple_srand(3);
|
||||
printk(PRINT_PREF "writing whole device\n");
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
if (bbt[i])
|
||||
continue;
|
||||
err = write_eraseblock2(i);
|
||||
if (unlikely(err))
|
||||
goto out;
|
||||
if (i % 256 == 0)
|
||||
printk(PRINT_PREF "written up to eraseblock %u\n", i);
|
||||
cond_resched();
|
||||
}
|
||||
printk(PRINT_PREF "written %u eraseblocks\n", i);
|
||||
|
||||
/* Check all eraseblocks */
|
||||
simple_srand(3);
|
||||
printk(PRINT_PREF "verifying all eraseblocks\n");
|
||||
for (i = 0; i < ebcnt; ++i) {
|
||||
if (bbt[i])
|
||||
continue;
|
||||
err = verify_eraseblock2(i);
|
||||
if (unlikely(err))
|
||||
goto out;
|
||||
if (i % 256 == 0)
|
||||
printk(PRINT_PREF "verified up to eraseblock %u\n", i);
|
||||
cond_resched();
|
||||
}
|
||||
printk(PRINT_PREF "verified %u eraseblocks\n", i);
|
||||
|
||||
err = erase_whole_device();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
err = verify_all_eraseblocks_ff();
|
||||
if (err)
|
||||
goto out;
|
||||
|
||||
printk(PRINT_PREF "finished with %d errors\n", errcnt);
|
||||
|
||||
out:
|
||||
kfree(bbt);
|
||||
kfree(readbuf);
|
||||
kfree(writebuf);
|
||||
put_mtd_device(mtd);
|
||||
if (err)
|
||||
printk(PRINT_PREF "error %d occurred\n", err);
|
||||
printk(KERN_INFO "=================================================\n");
|
||||
return err;
|
||||
}
|
||||
module_init(mtd_subpagetest_init);
|
||||
|
||||
static void __exit mtd_subpagetest_exit(void)
|
||||
{
|
||||
return;
|
||||
}
|
||||
module_exit(mtd_subpagetest_exit);
|
||||
|
||||
MODULE_DESCRIPTION("Subpage test module");
|
||||
MODULE_AUTHOR("Adrian Hunter");
|
||||
MODULE_LICENSE("GPL");
|
||||
|
|
@ -0,0 +1,530 @@
|
|||
/*
|
||||
* Copyright (C) 2006-2008 Artem Bityutskiy
|
||||
* Copyright (C) 2006-2008 Jarkko Lavinen
|
||||
* Copyright (C) 2006-2008 Adrian Hunter
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License version 2 as published by
|
||||
* the Free Software Foundation.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful, but WITHOUT
|
||||
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
|
||||
* more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License along with
|
||||
* this program; see the file COPYING. If not, write to the Free Software
|
||||
* Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
||||
*
|
||||
* Authors: Artem Bityutskiy, Jarkko Lavinen, Adria Hunter
|
||||
*
|
||||
* WARNING: this test program may kill your flash and your device. Do not
|
||||
* use it unless you know what you do. Authors are not responsible for any
|
||||
* damage caused by this program.
|
||||
*/
|
||||
|
||||
#include <linux/init.h>
|
||||
#include <linux/module.h>
|
||||
#include <linux/moduleparam.h>
|
||||
#include <linux/err.h>
|
||||
#include <linux/mtd/mtd.h>
|
||||
#include <linux/sched.h>
|
||||
|
||||
#define PRINT_PREF KERN_INFO "mtd_torturetest: "
|
||||
#define RETRIES 3
|
||||
|
||||
static int eb = 8;
|
||||
module_param(eb, int, S_IRUGO);
|
||||
MODULE_PARM_DESC(eb, "eraseblock number within the selected MTD device");
|
||||
|
||||
static int ebcnt = 32;
|
||||
module_param(ebcnt, int, S_IRUGO);
|
||||
MODULE_PARM_DESC(ebcnt, "number of consecutive eraseblocks to torture");
|
||||
|
||||
static int pgcnt;
|
||||
module_param(pgcnt, int, S_IRUGO);
|
||||
MODULE_PARM_DESC(pgcnt, "number of pages per eraseblock to torture (0 => all)");
|
||||
|
||||
static int dev;
|
||||
module_param(dev, int, S_IRUGO);
|
||||
MODULE_PARM_DESC(dev, "MTD device number to use");
|
||||
|
||||
static int gran = 512;
|
||||
module_param(gran, int, S_IRUGO);
|
||||
MODULE_PARM_DESC(gran, "how often the status information should be printed");
|
||||
|
||||
static int check = 1;
|
||||
module_param(check, int, S_IRUGO);
|
||||
MODULE_PARM_DESC(check, "if the written data should be checked");
|
||||
|
||||
static unsigned int cycles_count;
|
||||
module_param(cycles_count, uint, S_IRUGO);
|
||||
MODULE_PARM_DESC(cycles_count, "how many erase cycles to do "
|
||||
"(infinite by default)");
|
||||
|
||||
static struct mtd_info *mtd;
|
||||
|
||||
/* This buffer contains 0x555555...0xAAAAAA... pattern */
|
||||
static unsigned char *patt_5A5;
|
||||
/* This buffer contains 0xAAAAAA...0x555555... pattern */
|
||||
static unsigned char *patt_A5A;
|
||||
/* This buffer contains all 0xFF bytes */
|
||||
static unsigned char *patt_FF;
|
||||
/* This a temporary buffer is use when checking data */
|
||||
static unsigned char *check_buf;
|
||||
/* How many erase cycles were done */
|
||||
static unsigned int erase_cycles;
|
||||
|
||||
static int pgsize;
|
||||
static struct timeval start, finish;
|
||||
|
||||
static void report_corrupt(unsigned char *read, unsigned char *written);
|
||||
|
||||
static inline void start_timing(void)
|
||||
{
|
||||
do_gettimeofday(&start);
|
||||
}
|
||||
|
||||
static inline void stop_timing(void)
|
||||
{
|
||||
do_gettimeofday(&finish);
|
||||
}
|
||||
|
||||
/*
|
||||
* Erase eraseblock number @ebnum.
|
||||
*/
|
||||
static inline int erase_eraseblock(int ebnum)
|
||||
{
|
||||
int err;
|
||||
struct erase_info ei;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
|
||||
memset(&ei, 0, sizeof(struct erase_info));
|
||||
ei.mtd = mtd;
|
||||
ei.addr = addr;
|
||||
ei.len = mtd->erasesize;
|
||||
|
||||
err = mtd->erase(mtd, &ei);
|
||||
if (err) {
|
||||
printk(PRINT_PREF "error %d while erasing EB %d\n", err, ebnum);
|
||||
return err;
|
||||
}
|
||||
|
||||
if (ei.state == MTD_ERASE_FAILED) {
|
||||
printk(PRINT_PREF "some erase error occurred at EB %d\n",
|
||||
ebnum);
|
||||
return -EIO;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
/*
|
||||
* Check that the contents of eraseblock number @enbum is equivalent to the
|
||||
* @buf buffer.
|
||||
*/
|
||||
static inline int check_eraseblock(int ebnum, unsigned char *buf)
|
||||
{
|
||||
int err, retries = 0;
|
||||
size_t read = 0;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
size_t len = mtd->erasesize;
|
||||
|
||||
if (pgcnt) {
|
||||
addr = (ebnum + 1) * mtd->erasesize - pgcnt * pgsize;
|
||||
len = pgcnt * pgsize;
|
||||
}
|
||||
|
||||
retry:
|
||||
err = mtd->read(mtd, addr, len, &read, check_buf);
|
||||
if (err == -EUCLEAN)
|
||||
printk(PRINT_PREF "single bit flip occurred at EB %d "
|
||||
"MTD reported that it was fixed.\n", ebnum);
|
||||
else if (err) {
|
||||
printk(PRINT_PREF "error %d while reading EB %d, "
|
||||
"read %zd\n", err, ebnum, read);
|
||||
return err;
|
||||
}
|
||||
|
||||
if (read != len) {
|
||||
printk(PRINT_PREF "failed to read %zd bytes from EB %d, "
|
||||
"read only %zd, but no error reported\n",
|
||||
len, ebnum, read);
|
||||
return -EIO;
|
||||
}
|
||||
|
||||
if (memcmp(buf, check_buf, len)) {
|
||||
printk(PRINT_PREF "read wrong data from EB %d\n", ebnum);
|
||||
report_corrupt(check_buf, buf);
|
||||
|
||||
if (retries++ < RETRIES) {
|
||||
/* Try read again */
|
||||
yield();
|
||||
printk(PRINT_PREF "re-try reading data from EB %d\n",
|
||||
ebnum);
|
||||
goto retry;
|
||||
} else {
|
||||
printk(PRINT_PREF "retried %d times, still errors, "
|
||||
"give-up\n", RETRIES);
|
||||
return -EINVAL;
|
||||
}
|
||||
}
|
||||
|
||||
if (retries != 0)
|
||||
printk(PRINT_PREF "only attempt number %d was OK (!!!)\n",
|
||||
retries);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
static inline int write_pattern(int ebnum, void *buf)
|
||||
{
|
||||
int err;
|
||||
size_t written = 0;
|
||||
loff_t addr = ebnum * mtd->erasesize;
|
||||
size_t len = mtd->erasesize;
|
||||
|
||||
if (pgcnt) {
|
||||
addr = (ebnum + 1) * mtd->erasesize - pgcnt * pgsize;
|
||||
len = pgcnt * pgsize;
|
||||
}
|
||||
err = mtd->write(mtd, addr, len, &written, buf);
|
||||
if (err) {
|
||||
printk(PRINT_PREF "error %d while writing EB %d, written %zd"
|
||||
" bytes\n", err, ebnum, written);
|
||||
return err;
|
||||
}
|
||||
if (written != len) {
|
||||
printk(PRINT_PREF "written only %zd bytes of %zd, but no error"
|
||||
" reported\n", written, len);
|
||||
return -EIO;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int __init tort_init(void)
|
||||
{
|
||||
int err = 0, i, infinite = !cycles_count;
|
||||
int bad_ebs[ebcnt];
|
||||
|
||||
printk(KERN_INFO "\n");
|
||||
printk(KERN_INFO "=================================================\n");
|
||||
printk(PRINT_PREF "Warning: this program is trying to wear out your "
|
||||
"flash, stop it if this is not wanted.\n");
|
||||
printk(PRINT_PREF "MTD device: %d\n", dev);
|
||||
printk(PRINT_PREF "torture %d eraseblocks (%d-%d) of mtd%d\n",
|
||||
ebcnt, eb, eb + ebcnt - 1, dev);
|
||||
if (pgcnt)
|
||||
printk(PRINT_PREF "torturing just %d pages per eraseblock\n",
|
||||
pgcnt);
|
||||
printk(PRINT_PREF "write verify %s\n", check ? "enabled" : "disabled");
|
||||
|
||||
mtd = get_mtd_device(NULL, dev);
|
||||
if (IS_ERR(mtd)) {
|
||||
err = PTR_ERR(mtd);
|
||||
printk(PRINT_PREF "error: cannot get MTD device\n");
|
||||
return err;
|
||||
}
|
||||
|
||||
if (mtd->writesize == 1) {
|
||||
printk(PRINT_PREF "not NAND flash, assume page size is 512 "
|
||||
"bytes.\n");
|
||||
pgsize = 512;
|
||||
} else
|
||||
pgsize = mtd->writesize;
|
||||
|
||||
if (pgcnt && (pgcnt > mtd->erasesize / pgsize || pgcnt < 0)) {
|
||||
printk(PRINT_PREF "error: invalid pgcnt value %d\n", pgcnt);
|
||||
goto out_mtd;
|
||||
}
|
||||
|
||||
err = -ENOMEM;
|
||||
patt_5A5 = kmalloc(mtd->erasesize, GFP_KERNEL);
|
||||
if (!patt_5A5) {
|
||||
printk(PRINT_PREF "error: cannot allocate memory\n");
|
||||
goto out_mtd;
|
||||
}
|
||||
|
||||
patt_A5A = kmalloc(mtd->erasesize, GFP_KERNEL);
|
||||
if (!patt_A5A) {
|
||||
printk(PRINT_PREF "error: cannot allocate memory\n");
|
||||
goto out_patt_5A5;
|
||||
}
|
||||
|
||||
patt_FF = kmalloc(mtd->erasesize, GFP_KERNEL);
|
||||
if (!patt_FF) {
|
||||
printk(PRINT_PREF "error: cannot allocate memory\n");
|
||||
goto out_patt_A5A;
|
||||
}
|
||||
|
||||
check_buf = kmalloc(mtd->erasesize, GFP_KERNEL);
|
||||
if (!check_buf) {
|
||||
printk(PRINT_PREF "error: cannot allocate memory\n");
|
||||
goto out_patt_FF;
|
||||
}
|
||||
|
||||
err = 0;
|
||||
|
||||
/* Initialize patterns */
|
||||
memset(patt_FF, 0xFF, mtd->erasesize);
|
||||
for (i = 0; i < mtd->erasesize / pgsize; i++) {
|
||||
if (!(i & 1)) {
|
||||
memset(patt_5A5 + i * pgsize, 0x55, pgsize);
|
||||
memset(patt_A5A + i * pgsize, 0xAA, pgsize);
|
||||
} else {
|
||||
memset(patt_5A5 + i * pgsize, 0xAA, pgsize);
|
||||
memset(patt_A5A + i * pgsize, 0x55, pgsize);
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
* Check if there is a bad eraseblock among those we are going to test.
|
||||
*/
|
||||
memset(&bad_ebs[0], 0, sizeof(int) * ebcnt);
|
||||
if (mtd->block_isbad) {
|
||||
for (i = eb; i < eb + ebcnt; i++) {
|
||||
err = mtd->block_isbad(mtd,
|
||||
(loff_t)i * mtd->erasesize);
|
||||
|
||||
if (err < 0) {
|
||||
printk(PRINT_PREF "block_isbad() returned %d "
|
||||
"for EB %d\n", err, i);
|
||||
goto out;
|
||||
}
|
||||
|
||||
if (err) {
|
||||
printk("EB %d is bad. Skip it.\n", i);
|
||||
bad_ebs[i - eb] = 1;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
start_timing();
|
||||
while (1) {
|
||||
int i;
|
||||
void *patt;
|
||||
|
||||
/* Erase all eraseblocks */
|
||||
for (i = eb; i < eb + ebcnt; i++) {
|
||||
if (bad_ebs[i - eb])
|
||||
continue;
|
||||
err = erase_eraseblock(i);
|
||||
if (err)
|
||||
goto out;
|
||||
cond_resched();
|
||||
}
|
||||
|
||||
/* Check if the eraseblocks contain only 0xFF bytes */
|
||||
if (check) {
|
||||
for (i = eb; i < eb + ebcnt; i++) {
|
||||
if (bad_ebs[i - eb])
|
||||
continue;
|
||||
err = check_eraseblock(i, patt_FF);
|
||||
if (err) {
|
||||
printk(PRINT_PREF "verify failed"
|
||||
" for 0xFF... pattern\n");
|
||||
goto out;
|
||||
}
|
||||
cond_resched();
|
||||
}
|
||||
}
|
||||
|
||||
/* Write the pattern */
|
||||
for (i = eb; i < eb + ebcnt; i++) {
|
||||
if (bad_ebs[i - eb])
|
||||
continue;
|
||||
if ((eb + erase_cycles) & 1)
|
||||
patt = patt_5A5;
|
||||
else
|
||||
patt = patt_A5A;
|
||||
err = write_pattern(i, patt);
|
||||
if (err)
|
||||
goto out;
|
||||
cond_resched();
|
||||
}
|
||||
|
||||
/* Verify what we wrote */
|
||||
if (check) {
|
||||
for (i = eb; i < eb + ebcnt; i++) {
|
||||
if (bad_ebs[i - eb])
|
||||
continue;
|
||||
if ((eb + erase_cycles) & 1)
|
||||
patt = patt_5A5;
|
||||
else
|
||||
patt = patt_A5A;
|
||||
err = check_eraseblock(i, patt);
|
||||
if (err) {
|
||||
printk(PRINT_PREF "verify failed for %s"
|
||||
" pattern\n",
|
||||
((eb + erase_cycles) & 1) ?
|
||||
"0x55AA55..." : "0xAA55AA...");
|
||||
goto out;
|
||||
}
|
||||
cond_resched();
|
||||
}
|
||||
}
|
||||
|
||||
erase_cycles += 1;
|
||||
|
||||
if (erase_cycles % gran == 0) {
|
||||
long ms;
|
||||
|
||||
stop_timing();
|
||||
ms = (finish.tv_sec - start.tv_sec) * 1000 +
|
||||
(finish.tv_usec - start.tv_usec) / 1000;
|
||||
printk(PRINT_PREF "%08u erase cycles done, took %lu "
|
||||
"milliseconds (%lu seconds)\n",
|
||||
erase_cycles, ms, ms / 1000);
|
||||
start_timing();
|
||||
}
|
||||
|
||||
if (!infinite && --cycles_count == 0)
|
||||
break;
|
||||
}
|
||||
out:
|
||||
|
||||
printk(PRINT_PREF "finished after %u erase cycles\n",
|
||||
erase_cycles);
|
||||
kfree(check_buf);
|
||||
out_patt_FF:
|
||||
kfree(patt_FF);
|
||||
out_patt_A5A:
|
||||
kfree(patt_A5A);
|
||||
out_patt_5A5:
|
||||
kfree(patt_5A5);
|
||||
out_mtd:
|
||||
put_mtd_device(mtd);
|
||||
if (err)
|
||||
printk(PRINT_PREF "error %d occurred during torturing\n", err);
|
||||
printk(KERN_INFO "=================================================\n");
|
||||
return err;
|
||||
}
|
||||
module_init(tort_init);
|
||||
|
||||
static void __exit tort_exit(void)
|
||||
{
|
||||
return;
|
||||
}
|
||||
module_exit(tort_exit);
|
||||
|
||||
static int countdiffs(unsigned char *buf, unsigned char *check_buf,
|
||||
unsigned offset, unsigned len, unsigned *bytesp,
|
||||
unsigned *bitsp);
|
||||
static void print_bufs(unsigned char *read, unsigned char *written, int start,
|
||||
int len);
|
||||
|
||||
/*
|
||||
* Report the detailed information about how the read EB differs from what was
|
||||
* written.
|
||||
*/
|
||||
static void report_corrupt(unsigned char *read, unsigned char *written)
|
||||
{
|
||||
int i;
|
||||
int bytes, bits, pages, first;
|
||||
int offset, len;
|
||||
size_t check_len = mtd->erasesize;
|
||||
|
||||
if (pgcnt)
|
||||
check_len = pgcnt * pgsize;
|
||||
|
||||
bytes = bits = pages = 0;
|
||||
for (i = 0; i < check_len; i += pgsize)
|
||||
if (countdiffs(written, read, i, pgsize, &bytes,
|
||||
&bits) >= 0)
|
||||
pages++;
|
||||
|
||||
printk(PRINT_PREF "verify fails on %d pages, %d bytes/%d bits\n",
|
||||
pages, bytes, bits);
|
||||
printk(PRINT_PREF "The following is a list of all differences between"
|
||||
" what was read from flash and what was expected\n");
|
||||
|
||||
for (i = 0; i < check_len; i += pgsize) {
|
||||
cond_resched();
|
||||
bytes = bits = 0;
|
||||
first = countdiffs(written, read, i, pgsize, &bytes,
|
||||
&bits);
|
||||
if (first < 0)
|
||||
continue;
|
||||
|
||||
printk("-------------------------------------------------------"
|
||||
"----------------------------------\n");
|
||||
|
||||
printk(PRINT_PREF "Page %d has %d bytes/%d bits failing verify,"
|
||||
" starting at offset 0x%x\n",
|
||||
(mtd->erasesize - check_len + i) / pgsize,
|
||||
bytes, bits, first);
|
||||
|
||||
offset = first & ~0x7;
|
||||
len = ((first + bytes) | 0x7) + 1 - offset;
|
||||
|
||||
print_bufs(read, written, offset, len);
|
||||
}
|
||||
}
|
||||
|
||||
static void print_bufs(unsigned char *read, unsigned char *written, int start,
|
||||
int len)
|
||||
{
|
||||
int i = 0, j1, j2;
|
||||
char *diff;
|
||||
|
||||
printk("Offset Read Written\n");
|
||||
while (i < len) {
|
||||
printk("0x%08x: ", start + i);
|
||||
diff = " ";
|
||||
for (j1 = 0; j1 < 8 && i + j1 < len; j1++) {
|
||||
printk(" %02x", read[start + i + j1]);
|
||||
if (read[start + i + j1] != written[start + i + j1])
|
||||
diff = "***";
|
||||
}
|
||||
|
||||
while (j1 < 8) {
|
||||
printk(" ");
|
||||
j1 += 1;
|
||||
}
|
||||
|
||||
printk(" %s ", diff);
|
||||
|
||||
for (j2 = 0; j2 < 8 && i + j2 < len; j2++)
|
||||
printk(" %02x", written[start + i + j2]);
|
||||
printk("\n");
|
||||
i += 8;
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
* Count the number of differing bytes and bits and return the first differing
|
||||
* offset.
|
||||
*/
|
||||
static int countdiffs(unsigned char *buf, unsigned char *check_buf,
|
||||
unsigned offset, unsigned len, unsigned *bytesp,
|
||||
unsigned *bitsp)
|
||||
{
|
||||
unsigned i, bit;
|
||||
int first = -1;
|
||||
|
||||
for (i = offset; i < offset + len; i++)
|
||||
if (buf[i] != check_buf[i]) {
|
||||
first = i;
|
||||
break;
|
||||
}
|
||||
|
||||
while (i < offset + len) {
|
||||
if (buf[i] != check_buf[i]) {
|
||||
(*bytesp)++;
|
||||
bit = 1;
|
||||
while (bit < 256) {
|
||||
if ((buf[i] & bit) != (check_buf[i] & bit))
|
||||
(*bitsp)++;
|
||||
bit <<= 1;
|
||||
}
|
||||
}
|
||||
i++;
|
||||
}
|
||||
|
||||
return first;
|
||||
}
|
||||
|
||||
MODULE_DESCRIPTION("Eraseblock torturing module");
|
||||
MODULE_AUTHOR("Artem Bityutskiy, Jarkko Lavinen, Adrian Hunter");
|
||||
MODULE_LICENSE("GPL");
|
||||
Loading…
Reference in New Issue