2019-05-29 23:57:41 +00:00
|
|
|
// SPDX-License-Identifier: GPL-2.0-only
|
2008-12-08 11:36:18 +00:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2007 Nokia Corporation
|
|
|
|
*
|
|
|
|
* Test read and write speed of a MTD device.
|
|
|
|
*
|
2011-02-08 10:02:39 +00:00
|
|
|
* Author: Adrian Hunter <adrian.hunter@nokia.com>
|
2008-12-08 11:36:18 +00:00
|
|
|
*/
|
|
|
|
|
2012-10-10 17:40:02 +00:00
|
|
|
#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
|
|
|
|
|
2008-12-08 11:36:18 +00:00
|
|
|
#include <linux/init.h>
|
2015-10-22 14:59:54 +00:00
|
|
|
#include <linux/ktime.h>
|
2008-12-08 11:36:18 +00:00
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/moduleparam.h>
|
|
|
|
#include <linux/err.h>
|
|
|
|
#include <linux/mtd/mtd.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 08:04:11 +00:00
|
|
|
#include <linux/slab.h>
|
2008-12-08 11:36:18 +00:00
|
|
|
#include <linux/sched.h>
|
2012-05-18 15:44:53 +00:00
|
|
|
#include <linux/random.h>
|
2008-12-08 11:36:18 +00:00
|
|
|
|
2013-08-03 09:52:12 +00:00
|
|
|
#include "mtd_test.h"
|
|
|
|
|
2011-10-29 22:11:53 +00:00
|
|
|
static int dev = -EINVAL;
|
2008-12-08 11:36:18 +00:00
|
|
|
module_param(dev, int, S_IRUGO);
|
|
|
|
MODULE_PARM_DESC(dev, "MTD device number to use");
|
|
|
|
|
2011-02-08 10:02:39 +00:00
|
|
|
static int count;
|
|
|
|
module_param(count, int, S_IRUGO);
|
|
|
|
MODULE_PARM_DESC(count, "Maximum number of eraseblocks to use "
|
|
|
|
"(0 means use all)");
|
|
|
|
|
2008-12-08 11:36:18 +00:00
|
|
|
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;
|
2015-10-22 14:59:54 +00:00
|
|
|
static ktime_t start, finish;
|
2008-12-08 11:36:18 +00:00
|
|
|
|
2011-02-08 10:02:40 +00:00
|
|
|
static int multiblock_erase(int ebnum, int blocks)
|
|
|
|
{
|
|
|
|
int err;
|
|
|
|
struct erase_info ei;
|
2014-07-22 02:07:12 +00:00
|
|
|
loff_t addr = (loff_t)ebnum * mtd->erasesize;
|
2011-02-08 10:02:40 +00:00
|
|
|
|
|
|
|
memset(&ei, 0, sizeof(struct erase_info));
|
|
|
|
ei.addr = addr;
|
|
|
|
ei.len = mtd->erasesize * blocks;
|
|
|
|
|
2011-12-23 13:25:39 +00:00
|
|
|
err = mtd_erase(mtd, &ei);
|
2011-02-08 10:02:40 +00:00
|
|
|
if (err) {
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_err("error %d while erasing EB %d, blocks %d\n",
|
2011-02-08 10:02:40 +00:00
|
|
|
err, ebnum, blocks);
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2008-12-08 11:36:18 +00:00
|
|
|
static int write_eraseblock(int ebnum)
|
|
|
|
{
|
2014-07-22 02:07:12 +00:00
|
|
|
loff_t addr = (loff_t)ebnum * mtd->erasesize;
|
2008-12-08 11:36:18 +00:00
|
|
|
|
2013-08-15 13:55:09 +00:00
|
|
|
return mtdtest_write(mtd, addr, mtd->erasesize, iobuf);
|
2008-12-08 11:36:18 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int write_eraseblock_by_page(int ebnum)
|
|
|
|
{
|
|
|
|
int i, err = 0;
|
2014-07-22 02:07:12 +00:00
|
|
|
loff_t addr = (loff_t)ebnum * mtd->erasesize;
|
2008-12-08 11:36:18 +00:00
|
|
|
void *buf = iobuf;
|
|
|
|
|
|
|
|
for (i = 0; i < pgcnt; i++) {
|
2013-08-03 09:52:12 +00:00
|
|
|
err = mtdtest_write(mtd, addr, pgsize, buf);
|
2013-08-15 13:55:09 +00:00
|
|
|
if (err)
|
2008-12-08 11:36:18 +00:00
|
|
|
break;
|
|
|
|
addr += pgsize;
|
|
|
|
buf += pgsize;
|
|
|
|
}
|
|
|
|
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int write_eraseblock_by_2pages(int ebnum)
|
|
|
|
{
|
2013-08-03 09:52:12 +00:00
|
|
|
size_t sz = pgsize * 2;
|
2008-12-08 11:36:18 +00:00
|
|
|
int i, n = pgcnt / 2, err = 0;
|
2014-07-22 02:07:12 +00:00
|
|
|
loff_t addr = (loff_t)ebnum * mtd->erasesize;
|
2008-12-08 11:36:18 +00:00
|
|
|
void *buf = iobuf;
|
|
|
|
|
|
|
|
for (i = 0; i < n; i++) {
|
2013-08-03 09:52:12 +00:00
|
|
|
err = mtdtest_write(mtd, addr, sz, buf);
|
2013-08-15 13:55:09 +00:00
|
|
|
if (err)
|
2008-12-08 11:36:18 +00:00
|
|
|
return err;
|
|
|
|
addr += sz;
|
|
|
|
buf += sz;
|
|
|
|
}
|
2013-08-15 13:55:09 +00:00
|
|
|
if (pgcnt % 2)
|
2013-08-03 09:52:12 +00:00
|
|
|
err = mtdtest_write(mtd, addr, pgsize, buf);
|
2008-12-08 11:36:18 +00:00
|
|
|
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int read_eraseblock(int ebnum)
|
|
|
|
{
|
2014-07-22 02:07:12 +00:00
|
|
|
loff_t addr = (loff_t)ebnum * mtd->erasesize;
|
2008-12-08 11:36:18 +00:00
|
|
|
|
2013-08-15 13:55:08 +00:00
|
|
|
return mtdtest_read(mtd, addr, mtd->erasesize, iobuf);
|
2008-12-08 11:36:18 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int read_eraseblock_by_page(int ebnum)
|
|
|
|
{
|
|
|
|
int i, err = 0;
|
2014-07-22 02:07:12 +00:00
|
|
|
loff_t addr = (loff_t)ebnum * mtd->erasesize;
|
2008-12-08 11:36:18 +00:00
|
|
|
void *buf = iobuf;
|
|
|
|
|
|
|
|
for (i = 0; i < pgcnt; i++) {
|
2013-08-03 09:52:12 +00:00
|
|
|
err = mtdtest_read(mtd, addr, pgsize, buf);
|
2013-08-15 13:55:08 +00:00
|
|
|
if (err)
|
2008-12-08 11:36:18 +00:00
|
|
|
break;
|
|
|
|
addr += pgsize;
|
|
|
|
buf += pgsize;
|
|
|
|
}
|
|
|
|
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int read_eraseblock_by_2pages(int ebnum)
|
|
|
|
{
|
2013-08-03 09:52:12 +00:00
|
|
|
size_t sz = pgsize * 2;
|
2008-12-08 11:36:18 +00:00
|
|
|
int i, n = pgcnt / 2, err = 0;
|
2014-07-22 02:07:12 +00:00
|
|
|
loff_t addr = (loff_t)ebnum * mtd->erasesize;
|
2008-12-08 11:36:18 +00:00
|
|
|
void *buf = iobuf;
|
|
|
|
|
|
|
|
for (i = 0; i < n; i++) {
|
2013-08-03 09:52:12 +00:00
|
|
|
err = mtdtest_read(mtd, addr, sz, buf);
|
2013-08-15 13:55:08 +00:00
|
|
|
if (err)
|
2008-12-08 11:36:18 +00:00
|
|
|
return err;
|
|
|
|
addr += sz;
|
|
|
|
buf += sz;
|
|
|
|
}
|
2013-08-15 13:55:08 +00:00
|
|
|
if (pgcnt % 2)
|
2013-08-03 09:52:12 +00:00
|
|
|
err = mtdtest_read(mtd, addr, pgsize, buf);
|
2008-12-08 11:36:18 +00:00
|
|
|
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void start_timing(void)
|
|
|
|
{
|
2015-10-22 14:59:54 +00:00
|
|
|
start = ktime_get();
|
2008-12-08 11:36:18 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline void stop_timing(void)
|
|
|
|
{
|
2015-10-22 14:59:54 +00:00
|
|
|
finish = ktime_get();
|
2008-12-08 11:36:18 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static long calc_speed(void)
|
|
|
|
{
|
2011-03-07 10:00:46 +00:00
|
|
|
uint64_t k;
|
|
|
|
long ms;
|
2008-12-08 11:36:18 +00:00
|
|
|
|
2015-10-22 14:59:54 +00:00
|
|
|
ms = ktime_ms_delta(finish, start);
|
2011-03-07 10:00:46 +00:00
|
|
|
if (ms == 0)
|
|
|
|
return 0;
|
2015-02-28 10:02:26 +00:00
|
|
|
k = (uint64_t)goodebcnt * (mtd->erasesize / 1024) * 1000;
|
2011-03-07 10:00:46 +00:00
|
|
|
do_div(k, ms);
|
|
|
|
return k;
|
2008-12-08 11:36:18 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int __init mtd_speedtest_init(void)
|
|
|
|
{
|
2011-02-08 10:02:40 +00:00
|
|
|
int err, i, blocks, j, k;
|
2008-12-08 11:36:18 +00:00
|
|
|
long speed;
|
|
|
|
uint64_t tmp;
|
|
|
|
|
|
|
|
printk(KERN_INFO "\n");
|
|
|
|
printk(KERN_INFO "=================================================\n");
|
2011-10-29 22:11:53 +00:00
|
|
|
|
|
|
|
if (dev < 0) {
|
2012-11-09 14:20:58 +00:00
|
|
|
pr_info("Please specify a valid mtd-device via module parameter\n");
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_crit("CAREFUL: This test wipes all data on the specified MTD device!\n");
|
2011-10-29 22:11:53 +00:00
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
2011-02-08 10:02:39 +00:00
|
|
|
if (count)
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_info("MTD device: %d count: %d\n", dev, count);
|
2011-02-08 10:02:39 +00:00
|
|
|
else
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_info("MTD device: %d\n", dev);
|
2008-12-08 11:36:18 +00:00
|
|
|
|
|
|
|
mtd = get_mtd_device(NULL, dev);
|
|
|
|
if (IS_ERR(mtd)) {
|
|
|
|
err = PTR_ERR(mtd);
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_err("error: cannot get MTD device\n");
|
2008-12-08 11:36:18 +00:00
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (mtd->writesize == 1) {
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_info("not NAND flash, assume page size is 512 "
|
2008-12-08 11:36:18 +00:00
|
|
|
"bytes.\n");
|
|
|
|
pgsize = 512;
|
|
|
|
} else
|
|
|
|
pgsize = mtd->writesize;
|
|
|
|
|
|
|
|
tmp = mtd->size;
|
|
|
|
do_div(tmp, mtd->erasesize);
|
|
|
|
ebcnt = tmp;
|
2010-01-06 09:48:18 +00:00
|
|
|
pgcnt = mtd->erasesize / pgsize;
|
2008-12-08 11:36:18 +00:00
|
|
|
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_info("MTD device size %llu, eraseblock size %u, "
|
2008-12-08 11:36:18 +00:00
|
|
|
"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);
|
|
|
|
|
2011-02-08 10:02:39 +00:00
|
|
|
if (count > 0 && count < ebcnt)
|
|
|
|
ebcnt = count;
|
|
|
|
|
2008-12-08 11:36:18 +00:00
|
|
|
err = -ENOMEM;
|
|
|
|
iobuf = kmalloc(mtd->erasesize, GFP_KERNEL);
|
2013-05-02 21:18:51 +00:00
|
|
|
if (!iobuf)
|
2008-12-08 11:36:18 +00:00
|
|
|
goto out;
|
|
|
|
|
2013-02-28 01:05:37 +00:00
|
|
|
prandom_bytes(iobuf, mtd->erasesize);
|
2008-12-08 11:36:18 +00:00
|
|
|
|
2013-08-03 09:52:12 +00:00
|
|
|
bbt = kzalloc(ebcnt, GFP_KERNEL);
|
|
|
|
if (!bbt)
|
|
|
|
goto out;
|
|
|
|
err = mtdtest_scan_for_bad_eraseblocks(mtd, bbt, 0, ebcnt);
|
2008-12-08 11:36:18 +00:00
|
|
|
if (err)
|
|
|
|
goto out;
|
2013-08-03 09:52:12 +00:00
|
|
|
for (i = 0; i < ebcnt; i++) {
|
|
|
|
if (!bbt[i])
|
|
|
|
goodebcnt++;
|
|
|
|
}
|
2008-12-08 11:36:18 +00:00
|
|
|
|
2013-08-03 09:52:12 +00:00
|
|
|
err = mtdtest_erase_good_eraseblocks(mtd, bbt, 0, ebcnt);
|
2008-12-08 11:36:18 +00:00
|
|
|
if (err)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
/* Write all eraseblocks, 1 eraseblock at a time */
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_info("testing eraseblock write speed\n");
|
2008-12-08 11:36:18 +00:00
|
|
|
start_timing();
|
|
|
|
for (i = 0; i < ebcnt; ++i) {
|
|
|
|
if (bbt[i])
|
|
|
|
continue;
|
|
|
|
err = write_eraseblock(i);
|
|
|
|
if (err)
|
|
|
|
goto out;
|
2015-03-29 19:52:06 +00:00
|
|
|
|
|
|
|
err = mtdtest_relax();
|
|
|
|
if (err)
|
|
|
|
goto out;
|
2008-12-08 11:36:18 +00:00
|
|
|
}
|
|
|
|
stop_timing();
|
|
|
|
speed = calc_speed();
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_info("eraseblock write speed is %ld KiB/s\n", speed);
|
2008-12-08 11:36:18 +00:00
|
|
|
|
|
|
|
/* Read all eraseblocks, 1 eraseblock at a time */
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_info("testing eraseblock read speed\n");
|
2008-12-08 11:36:18 +00:00
|
|
|
start_timing();
|
|
|
|
for (i = 0; i < ebcnt; ++i) {
|
|
|
|
if (bbt[i])
|
|
|
|
continue;
|
|
|
|
err = read_eraseblock(i);
|
|
|
|
if (err)
|
|
|
|
goto out;
|
2015-03-29 19:52:06 +00:00
|
|
|
|
|
|
|
err = mtdtest_relax();
|
|
|
|
if (err)
|
|
|
|
goto out;
|
2008-12-08 11:36:18 +00:00
|
|
|
}
|
|
|
|
stop_timing();
|
|
|
|
speed = calc_speed();
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_info("eraseblock read speed is %ld KiB/s\n", speed);
|
2008-12-08 11:36:18 +00:00
|
|
|
|
2013-08-03 09:52:12 +00:00
|
|
|
err = mtdtest_erase_good_eraseblocks(mtd, bbt, 0, ebcnt);
|
2008-12-08 11:36:18 +00:00
|
|
|
if (err)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
/* Write all eraseblocks, 1 page at a time */
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_info("testing page write speed\n");
|
2008-12-08 11:36:18 +00:00
|
|
|
start_timing();
|
|
|
|
for (i = 0; i < ebcnt; ++i) {
|
|
|
|
if (bbt[i])
|
|
|
|
continue;
|
|
|
|
err = write_eraseblock_by_page(i);
|
|
|
|
if (err)
|
|
|
|
goto out;
|
2015-03-29 19:52:06 +00:00
|
|
|
|
|
|
|
err = mtdtest_relax();
|
|
|
|
if (err)
|
|
|
|
goto out;
|
2008-12-08 11:36:18 +00:00
|
|
|
}
|
|
|
|
stop_timing();
|
|
|
|
speed = calc_speed();
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_info("page write speed is %ld KiB/s\n", speed);
|
2008-12-08 11:36:18 +00:00
|
|
|
|
|
|
|
/* Read all eraseblocks, 1 page at a time */
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_info("testing page read speed\n");
|
2008-12-08 11:36:18 +00:00
|
|
|
start_timing();
|
|
|
|
for (i = 0; i < ebcnt; ++i) {
|
|
|
|
if (bbt[i])
|
|
|
|
continue;
|
|
|
|
err = read_eraseblock_by_page(i);
|
|
|
|
if (err)
|
|
|
|
goto out;
|
2015-03-29 19:52:06 +00:00
|
|
|
|
|
|
|
err = mtdtest_relax();
|
|
|
|
if (err)
|
|
|
|
goto out;
|
2008-12-08 11:36:18 +00:00
|
|
|
}
|
|
|
|
stop_timing();
|
|
|
|
speed = calc_speed();
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_info("page read speed is %ld KiB/s\n", speed);
|
2008-12-08 11:36:18 +00:00
|
|
|
|
2013-08-03 09:52:12 +00:00
|
|
|
err = mtdtest_erase_good_eraseblocks(mtd, bbt, 0, ebcnt);
|
2008-12-08 11:36:18 +00:00
|
|
|
if (err)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
/* Write all eraseblocks, 2 pages at a time */
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_info("testing 2 page write speed\n");
|
2008-12-08 11:36:18 +00:00
|
|
|
start_timing();
|
|
|
|
for (i = 0; i < ebcnt; ++i) {
|
|
|
|
if (bbt[i])
|
|
|
|
continue;
|
|
|
|
err = write_eraseblock_by_2pages(i);
|
|
|
|
if (err)
|
|
|
|
goto out;
|
2015-03-29 19:52:06 +00:00
|
|
|
|
|
|
|
err = mtdtest_relax();
|
|
|
|
if (err)
|
|
|
|
goto out;
|
2008-12-08 11:36:18 +00:00
|
|
|
}
|
|
|
|
stop_timing();
|
|
|
|
speed = calc_speed();
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_info("2 page write speed is %ld KiB/s\n", speed);
|
2008-12-08 11:36:18 +00:00
|
|
|
|
|
|
|
/* Read all eraseblocks, 2 pages at a time */
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_info("testing 2 page read speed\n");
|
2008-12-08 11:36:18 +00:00
|
|
|
start_timing();
|
|
|
|
for (i = 0; i < ebcnt; ++i) {
|
|
|
|
if (bbt[i])
|
|
|
|
continue;
|
|
|
|
err = read_eraseblock_by_2pages(i);
|
|
|
|
if (err)
|
|
|
|
goto out;
|
2015-03-29 19:52:06 +00:00
|
|
|
|
|
|
|
err = mtdtest_relax();
|
|
|
|
if (err)
|
|
|
|
goto out;
|
2008-12-08 11:36:18 +00:00
|
|
|
}
|
|
|
|
stop_timing();
|
|
|
|
speed = calc_speed();
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_info("2 page read speed is %ld KiB/s\n", speed);
|
2008-12-08 11:36:18 +00:00
|
|
|
|
|
|
|
/* Erase all eraseblocks */
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_info("Testing erase speed\n");
|
2008-12-08 11:36:18 +00:00
|
|
|
start_timing();
|
2013-08-03 09:52:12 +00:00
|
|
|
err = mtdtest_erase_good_eraseblocks(mtd, bbt, 0, ebcnt);
|
|
|
|
if (err)
|
|
|
|
goto out;
|
2008-12-08 11:36:18 +00:00
|
|
|
stop_timing();
|
|
|
|
speed = calc_speed();
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_info("erase speed is %ld KiB/s\n", speed);
|
2008-12-08 11:36:18 +00:00
|
|
|
|
2011-02-08 10:02:40 +00:00
|
|
|
/* Multi-block erase all eraseblocks */
|
|
|
|
for (k = 1; k < 7; k++) {
|
|
|
|
blocks = 1 << k;
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_info("Testing %dx multi-block erase speed\n",
|
2011-02-08 10:02:40 +00:00
|
|
|
blocks);
|
|
|
|
start_timing();
|
|
|
|
for (i = 0; i < ebcnt; ) {
|
|
|
|
for (j = 0; j < blocks && (i + j) < ebcnt; j++)
|
|
|
|
if (bbt[i + j])
|
|
|
|
break;
|
|
|
|
if (j < 1) {
|
|
|
|
i++;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
err = multiblock_erase(i, j);
|
|
|
|
if (err)
|
|
|
|
goto out;
|
2015-03-29 19:52:06 +00:00
|
|
|
|
|
|
|
err = mtdtest_relax();
|
|
|
|
if (err)
|
|
|
|
goto out;
|
|
|
|
|
2011-02-08 10:02:40 +00:00
|
|
|
i += j;
|
|
|
|
}
|
|
|
|
stop_timing();
|
|
|
|
speed = calc_speed();
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_info("%dx multi-block erase speed is %ld KiB/s\n",
|
2011-02-08 10:02:40 +00:00
|
|
|
blocks, speed);
|
|
|
|
}
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_info("finished\n");
|
2008-12-08 11:36:18 +00:00
|
|
|
out:
|
|
|
|
kfree(iobuf);
|
|
|
|
kfree(bbt);
|
|
|
|
put_mtd_device(mtd);
|
|
|
|
if (err)
|
2012-10-10 17:40:02 +00:00
|
|
|
pr_info("error %d occurred\n", err);
|
2008-12-08 11:36:18 +00:00
|
|
|
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");
|