| Artem Bityutskiy | 72069be | 2008-12-08 13:36:18 +0200 | [diff] [blame] | 1 | /* | 
 | 2 |  * Copyright (C) 2007 Nokia Corporation | 
 | 3 |  * | 
 | 4 |  * This program is free software; you can redistribute it and/or modify it | 
 | 5 |  * under the terms of the GNU General Public License version 2 as published by | 
 | 6 |  * the Free Software Foundation. | 
 | 7 |  * | 
 | 8 |  * This program is distributed in the hope that it will be useful, but WITHOUT | 
 | 9 |  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | 
 | 10 |  * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for | 
 | 11 |  * more details. | 
 | 12 |  * | 
 | 13 |  * You should have received a copy of the GNU General Public License along with | 
 | 14 |  * this program; see the file COPYING. If not, write to the Free Software | 
 | 15 |  * Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. | 
 | 16 |  * | 
 | 17 |  * Test read and write speed of a MTD device. | 
 | 18 |  * | 
 | 19 |  * Author: Adrian Hunter <ext-adrian.hunter@nokia.com> | 
 | 20 |  */ | 
 | 21 |  | 
 | 22 | #include <linux/init.h> | 
 | 23 | #include <linux/module.h> | 
 | 24 | #include <linux/moduleparam.h> | 
 | 25 | #include <linux/err.h> | 
 | 26 | #include <linux/mtd/mtd.h> | 
 | 27 | #include <linux/sched.h> | 
 | 28 |  | 
 | 29 | #define PRINT_PREF KERN_INFO "mtd_speedtest: " | 
 | 30 |  | 
 | 31 | static int dev; | 
 | 32 | module_param(dev, int, S_IRUGO); | 
 | 33 | MODULE_PARM_DESC(dev, "MTD device number to use"); | 
 | 34 |  | 
 | 35 | static struct mtd_info *mtd; | 
 | 36 | static unsigned char *iobuf; | 
 | 37 | static unsigned char *bbt; | 
 | 38 |  | 
 | 39 | static int pgsize; | 
 | 40 | static int ebcnt; | 
 | 41 | static int pgcnt; | 
 | 42 | static int goodebcnt; | 
 | 43 | static struct timeval start, finish; | 
 | 44 | static unsigned long next = 1; | 
 | 45 |  | 
 | 46 | static inline unsigned int simple_rand(void) | 
 | 47 | { | 
 | 48 | 	next = next * 1103515245 + 12345; | 
 | 49 | 	return (unsigned int)((next / 65536) % 32768); | 
 | 50 | } | 
 | 51 |  | 
 | 52 | static inline void simple_srand(unsigned long seed) | 
 | 53 | { | 
 | 54 | 	next = seed; | 
 | 55 | } | 
 | 56 |  | 
 | 57 | static void set_random_data(unsigned char *buf, size_t len) | 
 | 58 | { | 
 | 59 | 	size_t i; | 
 | 60 |  | 
 | 61 | 	for (i = 0; i < len; ++i) | 
 | 62 | 		buf[i] = simple_rand(); | 
 | 63 | } | 
 | 64 |  | 
 | 65 | static int erase_eraseblock(int ebnum) | 
 | 66 | { | 
 | 67 | 	int err; | 
 | 68 | 	struct erase_info ei; | 
 | 69 | 	loff_t addr = ebnum * mtd->erasesize; | 
 | 70 |  | 
 | 71 | 	memset(&ei, 0, sizeof(struct erase_info)); | 
 | 72 | 	ei.mtd  = mtd; | 
 | 73 | 	ei.addr = addr; | 
 | 74 | 	ei.len  = mtd->erasesize; | 
 | 75 |  | 
 | 76 | 	err = mtd->erase(mtd, &ei); | 
 | 77 | 	if (err) { | 
 | 78 | 		printk(PRINT_PREF "error %d while erasing EB %d\n", err, ebnum); | 
 | 79 | 		return err; | 
 | 80 | 	} | 
 | 81 |  | 
 | 82 | 	if (ei.state == MTD_ERASE_FAILED) { | 
 | 83 | 		printk(PRINT_PREF "some erase error occurred at EB %d\n", | 
 | 84 | 		       ebnum); | 
 | 85 | 		return -EIO; | 
 | 86 | 	} | 
 | 87 |  | 
 | 88 | 	return 0; | 
 | 89 | } | 
 | 90 |  | 
 | 91 | static int erase_whole_device(void) | 
 | 92 | { | 
 | 93 | 	int err; | 
 | 94 | 	unsigned int i; | 
 | 95 |  | 
 | 96 | 	for (i = 0; i < ebcnt; ++i) { | 
 | 97 | 		if (bbt[i]) | 
 | 98 | 			continue; | 
 | 99 | 		err = erase_eraseblock(i); | 
 | 100 | 		if (err) | 
 | 101 | 			return err; | 
 | 102 | 		cond_resched(); | 
 | 103 | 	} | 
 | 104 | 	return 0; | 
 | 105 | } | 
 | 106 |  | 
 | 107 | static int write_eraseblock(int ebnum) | 
 | 108 | { | 
 | 109 | 	size_t written = 0; | 
 | 110 | 	int err = 0; | 
 | 111 | 	loff_t addr = ebnum * mtd->erasesize; | 
 | 112 |  | 
 | 113 | 	err = mtd->write(mtd, addr, mtd->erasesize, &written, iobuf); | 
 | 114 | 	if (err || written != mtd->erasesize) { | 
 | 115 | 		printk(PRINT_PREF "error: write failed at %#llx\n", addr); | 
 | 116 | 		if (!err) | 
 | 117 | 			err = -EINVAL; | 
 | 118 | 	} | 
 | 119 |  | 
 | 120 | 	return err; | 
 | 121 | } | 
 | 122 |  | 
 | 123 | static int write_eraseblock_by_page(int ebnum) | 
 | 124 | { | 
 | 125 | 	size_t written = 0; | 
 | 126 | 	int i, err = 0; | 
 | 127 | 	loff_t addr = ebnum * mtd->erasesize; | 
 | 128 | 	void *buf = iobuf; | 
 | 129 |  | 
 | 130 | 	for (i = 0; i < pgcnt; i++) { | 
 | 131 | 		err = mtd->write(mtd, addr, pgsize, &written, buf); | 
 | 132 | 		if (err || written != pgsize) { | 
 | 133 | 			printk(PRINT_PREF "error: write failed at %#llx\n", | 
 | 134 | 			       addr); | 
 | 135 | 			if (!err) | 
 | 136 | 				err = -EINVAL; | 
 | 137 | 			break; | 
 | 138 | 		} | 
 | 139 | 		addr += pgsize; | 
 | 140 | 		buf += pgsize; | 
 | 141 | 	} | 
 | 142 |  | 
 | 143 | 	return err; | 
 | 144 | } | 
 | 145 |  | 
 | 146 | static int write_eraseblock_by_2pages(int ebnum) | 
 | 147 | { | 
 | 148 | 	size_t written = 0, sz = pgsize * 2; | 
 | 149 | 	int i, n = pgcnt / 2, err = 0; | 
 | 150 | 	loff_t addr = ebnum * mtd->erasesize; | 
 | 151 | 	void *buf = iobuf; | 
 | 152 |  | 
 | 153 | 	for (i = 0; i < n; i++) { | 
 | 154 | 		err = mtd->write(mtd, addr, sz, &written, buf); | 
 | 155 | 		if (err || written != sz) { | 
 | 156 | 			printk(PRINT_PREF "error: write failed at %#llx\n", | 
 | 157 | 			       addr); | 
 | 158 | 			if (!err) | 
 | 159 | 				err = -EINVAL; | 
 | 160 | 			return err; | 
 | 161 | 		} | 
 | 162 | 		addr += sz; | 
 | 163 | 		buf += sz; | 
 | 164 | 	} | 
 | 165 | 	if (pgcnt % 2) { | 
 | 166 | 		err = mtd->write(mtd, addr, pgsize, &written, buf); | 
 | 167 | 		if (err || written != pgsize) { | 
 | 168 | 			printk(PRINT_PREF "error: write failed at %#llx\n", | 
 | 169 | 			       addr); | 
 | 170 | 			if (!err) | 
 | 171 | 				err = -EINVAL; | 
 | 172 | 		} | 
 | 173 | 	} | 
 | 174 |  | 
 | 175 | 	return err; | 
 | 176 | } | 
 | 177 |  | 
 | 178 | static int read_eraseblock(int ebnum) | 
 | 179 | { | 
 | 180 | 	size_t read = 0; | 
 | 181 | 	int err = 0; | 
 | 182 | 	loff_t addr = ebnum * mtd->erasesize; | 
 | 183 |  | 
 | 184 | 	err = mtd->read(mtd, addr, mtd->erasesize, &read, iobuf); | 
 | 185 | 	/* Ignore corrected ECC errors */ | 
 | 186 | 	if (err == -EUCLEAN) | 
 | 187 | 		err = 0; | 
 | 188 | 	if (err || read != mtd->erasesize) { | 
 | 189 | 		printk(PRINT_PREF "error: read failed at %#llx\n", addr); | 
 | 190 | 		if (!err) | 
 | 191 | 			err = -EINVAL; | 
 | 192 | 	} | 
 | 193 |  | 
 | 194 | 	return err; | 
 | 195 | } | 
 | 196 |  | 
 | 197 | static int read_eraseblock_by_page(int ebnum) | 
 | 198 | { | 
 | 199 | 	size_t read = 0; | 
 | 200 | 	int i, err = 0; | 
 | 201 | 	loff_t addr = ebnum * mtd->erasesize; | 
 | 202 | 	void *buf = iobuf; | 
 | 203 |  | 
 | 204 | 	for (i = 0; i < pgcnt; i++) { | 
 | 205 | 		err = mtd->read(mtd, addr, pgsize, &read, buf); | 
 | 206 | 		/* Ignore corrected ECC errors */ | 
 | 207 | 		if (err == -EUCLEAN) | 
 | 208 | 			err = 0; | 
 | 209 | 		if (err || read != pgsize) { | 
 | 210 | 			printk(PRINT_PREF "error: read failed at %#llx\n", | 
 | 211 | 			       addr); | 
 | 212 | 			if (!err) | 
 | 213 | 				err = -EINVAL; | 
 | 214 | 			break; | 
 | 215 | 		} | 
 | 216 | 		addr += pgsize; | 
 | 217 | 		buf += pgsize; | 
 | 218 | 	} | 
 | 219 |  | 
 | 220 | 	return err; | 
 | 221 | } | 
 | 222 |  | 
 | 223 | static int read_eraseblock_by_2pages(int ebnum) | 
 | 224 | { | 
 | 225 | 	size_t read = 0, sz = pgsize * 2; | 
 | 226 | 	int i, n = pgcnt / 2, err = 0; | 
 | 227 | 	loff_t addr = ebnum * mtd->erasesize; | 
 | 228 | 	void *buf = iobuf; | 
 | 229 |  | 
 | 230 | 	for (i = 0; i < n; i++) { | 
 | 231 | 		err = mtd->read(mtd, addr, sz, &read, buf); | 
 | 232 | 		/* Ignore corrected ECC errors */ | 
 | 233 | 		if (err == -EUCLEAN) | 
 | 234 | 			err = 0; | 
 | 235 | 		if (err || read != sz) { | 
 | 236 | 			printk(PRINT_PREF "error: read failed at %#llx\n", | 
 | 237 | 			       addr); | 
 | 238 | 			if (!err) | 
 | 239 | 				err = -EINVAL; | 
 | 240 | 			return err; | 
 | 241 | 		} | 
 | 242 | 		addr += sz; | 
 | 243 | 		buf += sz; | 
 | 244 | 	} | 
 | 245 | 	if (pgcnt % 2) { | 
 | 246 | 		err = mtd->read(mtd, addr, pgsize, &read, buf); | 
 | 247 | 		/* Ignore corrected ECC errors */ | 
 | 248 | 		if (err == -EUCLEAN) | 
 | 249 | 			err = 0; | 
 | 250 | 		if (err || read != pgsize) { | 
 | 251 | 			printk(PRINT_PREF "error: read failed at %#llx\n", | 
 | 252 | 			       addr); | 
 | 253 | 			if (!err) | 
 | 254 | 				err = -EINVAL; | 
 | 255 | 		} | 
 | 256 | 	} | 
 | 257 |  | 
 | 258 | 	return err; | 
 | 259 | } | 
 | 260 |  | 
 | 261 | static int is_block_bad(int ebnum) | 
 | 262 | { | 
 | 263 | 	loff_t addr = ebnum * mtd->erasesize; | 
 | 264 | 	int ret; | 
 | 265 |  | 
 | 266 | 	ret = mtd->block_isbad(mtd, addr); | 
 | 267 | 	if (ret) | 
 | 268 | 		printk(PRINT_PREF "block %d is bad\n", ebnum); | 
 | 269 | 	return ret; | 
 | 270 | } | 
 | 271 |  | 
 | 272 | static inline void start_timing(void) | 
 | 273 | { | 
 | 274 | 	do_gettimeofday(&start); | 
 | 275 | } | 
 | 276 |  | 
 | 277 | static inline void stop_timing(void) | 
 | 278 | { | 
 | 279 | 	do_gettimeofday(&finish); | 
 | 280 | } | 
 | 281 |  | 
 | 282 | static long calc_speed(void) | 
 | 283 | { | 
 | 284 | 	long ms, k, speed; | 
 | 285 |  | 
 | 286 | 	ms = (finish.tv_sec - start.tv_sec) * 1000 + | 
 | 287 | 	     (finish.tv_usec - start.tv_usec) / 1000; | 
 | 288 | 	k = goodebcnt * mtd->erasesize / 1024; | 
 | 289 | 	speed = (k * 1000) / ms; | 
 | 290 | 	return speed; | 
 | 291 | } | 
 | 292 |  | 
 | 293 | static int scan_for_bad_eraseblocks(void) | 
 | 294 | { | 
 | 295 | 	int i, bad = 0; | 
 | 296 |  | 
 | 297 | 	bbt = kmalloc(ebcnt, GFP_KERNEL); | 
 | 298 | 	if (!bbt) { | 
 | 299 | 		printk(PRINT_PREF "error: cannot allocate memory\n"); | 
 | 300 | 		return -ENOMEM; | 
 | 301 | 	} | 
 | 302 | 	memset(bbt, 0 , ebcnt); | 
 | 303 |  | 
| Morten Thunberg Svendsen | f5e2bae | 2010-01-06 10:48:18 +0100 | [diff] [blame] | 304 | 	/* NOR flash does not implement block_isbad */ | 
 | 305 | 	if (mtd->block_isbad == NULL) | 
 | 306 | 		goto out; | 
 | 307 |  | 
| Artem Bityutskiy | 72069be | 2008-12-08 13:36:18 +0200 | [diff] [blame] | 308 | 	printk(PRINT_PREF "scanning for bad eraseblocks\n"); | 
 | 309 | 	for (i = 0; i < ebcnt; ++i) { | 
 | 310 | 		bbt[i] = is_block_bad(i) ? 1 : 0; | 
 | 311 | 		if (bbt[i]) | 
 | 312 | 			bad += 1; | 
 | 313 | 		cond_resched(); | 
 | 314 | 	} | 
 | 315 | 	printk(PRINT_PREF "scanned %d eraseblocks, %d are bad\n", i, bad); | 
| Morten Thunberg Svendsen | f5e2bae | 2010-01-06 10:48:18 +0100 | [diff] [blame] | 316 | out: | 
| Artem Bityutskiy | 72069be | 2008-12-08 13:36:18 +0200 | [diff] [blame] | 317 | 	goodebcnt = ebcnt - bad; | 
 | 318 | 	return 0; | 
 | 319 | } | 
 | 320 |  | 
 | 321 | static int __init mtd_speedtest_init(void) | 
 | 322 | { | 
 | 323 | 	int err, i; | 
 | 324 | 	long speed; | 
 | 325 | 	uint64_t tmp; | 
 | 326 |  | 
 | 327 | 	printk(KERN_INFO "\n"); | 
 | 328 | 	printk(KERN_INFO "=================================================\n"); | 
 | 329 | 	printk(PRINT_PREF "MTD device: %d\n", dev); | 
 | 330 |  | 
 | 331 | 	mtd = get_mtd_device(NULL, dev); | 
 | 332 | 	if (IS_ERR(mtd)) { | 
 | 333 | 		err = PTR_ERR(mtd); | 
 | 334 | 		printk(PRINT_PREF "error: cannot get MTD device\n"); | 
 | 335 | 		return err; | 
 | 336 | 	} | 
 | 337 |  | 
 | 338 | 	if (mtd->writesize == 1) { | 
 | 339 | 		printk(PRINT_PREF "not NAND flash, assume page size is 512 " | 
 | 340 | 		       "bytes.\n"); | 
 | 341 | 		pgsize = 512; | 
 | 342 | 	} else | 
 | 343 | 		pgsize = mtd->writesize; | 
 | 344 |  | 
 | 345 | 	tmp = mtd->size; | 
 | 346 | 	do_div(tmp, mtd->erasesize); | 
 | 347 | 	ebcnt = tmp; | 
| Morten Thunberg Svendsen | f5e2bae | 2010-01-06 10:48:18 +0100 | [diff] [blame] | 348 | 	pgcnt = mtd->erasesize / pgsize; | 
| Artem Bityutskiy | 72069be | 2008-12-08 13:36:18 +0200 | [diff] [blame] | 349 |  | 
 | 350 | 	printk(PRINT_PREF "MTD device size %llu, eraseblock size %u, " | 
 | 351 | 	       "page size %u, count of eraseblocks %u, pages per " | 
 | 352 | 	       "eraseblock %u, OOB size %u\n", | 
 | 353 | 	       (unsigned long long)mtd->size, mtd->erasesize, | 
 | 354 | 	       pgsize, ebcnt, pgcnt, mtd->oobsize); | 
 | 355 |  | 
 | 356 | 	err = -ENOMEM; | 
 | 357 | 	iobuf = kmalloc(mtd->erasesize, GFP_KERNEL); | 
 | 358 | 	if (!iobuf) { | 
 | 359 | 		printk(PRINT_PREF "error: cannot allocate memory\n"); | 
 | 360 | 		goto out; | 
 | 361 | 	} | 
 | 362 |  | 
 | 363 | 	simple_srand(1); | 
 | 364 | 	set_random_data(iobuf, mtd->erasesize); | 
 | 365 |  | 
 | 366 | 	err = scan_for_bad_eraseblocks(); | 
 | 367 | 	if (err) | 
 | 368 | 		goto out; | 
 | 369 |  | 
 | 370 | 	err = erase_whole_device(); | 
 | 371 | 	if (err) | 
 | 372 | 		goto out; | 
 | 373 |  | 
 | 374 | 	/* Write all eraseblocks, 1 eraseblock at a time */ | 
 | 375 | 	printk(PRINT_PREF "testing eraseblock write speed\n"); | 
 | 376 | 	start_timing(); | 
 | 377 | 	for (i = 0; i < ebcnt; ++i) { | 
 | 378 | 		if (bbt[i]) | 
 | 379 | 			continue; | 
 | 380 | 		err = write_eraseblock(i); | 
 | 381 | 		if (err) | 
 | 382 | 			goto out; | 
 | 383 | 		cond_resched(); | 
 | 384 | 	} | 
 | 385 | 	stop_timing(); | 
 | 386 | 	speed = calc_speed(); | 
 | 387 | 	printk(PRINT_PREF "eraseblock write speed is %ld KiB/s\n", speed); | 
 | 388 |  | 
 | 389 | 	/* Read all eraseblocks, 1 eraseblock at a time */ | 
 | 390 | 	printk(PRINT_PREF "testing eraseblock read speed\n"); | 
 | 391 | 	start_timing(); | 
 | 392 | 	for (i = 0; i < ebcnt; ++i) { | 
 | 393 | 		if (bbt[i]) | 
 | 394 | 			continue; | 
 | 395 | 		err = read_eraseblock(i); | 
 | 396 | 		if (err) | 
 | 397 | 			goto out; | 
 | 398 | 		cond_resched(); | 
 | 399 | 	} | 
 | 400 | 	stop_timing(); | 
 | 401 | 	speed = calc_speed(); | 
 | 402 | 	printk(PRINT_PREF "eraseblock read speed is %ld KiB/s\n", speed); | 
 | 403 |  | 
 | 404 | 	err = erase_whole_device(); | 
 | 405 | 	if (err) | 
 | 406 | 		goto out; | 
 | 407 |  | 
 | 408 | 	/* Write all eraseblocks, 1 page at a time */ | 
 | 409 | 	printk(PRINT_PREF "testing page write speed\n"); | 
 | 410 | 	start_timing(); | 
 | 411 | 	for (i = 0; i < ebcnt; ++i) { | 
 | 412 | 		if (bbt[i]) | 
 | 413 | 			continue; | 
 | 414 | 		err = write_eraseblock_by_page(i); | 
 | 415 | 		if (err) | 
 | 416 | 			goto out; | 
 | 417 | 		cond_resched(); | 
 | 418 | 	} | 
 | 419 | 	stop_timing(); | 
 | 420 | 	speed = calc_speed(); | 
 | 421 | 	printk(PRINT_PREF "page write speed is %ld KiB/s\n", speed); | 
 | 422 |  | 
 | 423 | 	/* Read all eraseblocks, 1 page at a time */ | 
 | 424 | 	printk(PRINT_PREF "testing page read speed\n"); | 
 | 425 | 	start_timing(); | 
 | 426 | 	for (i = 0; i < ebcnt; ++i) { | 
 | 427 | 		if (bbt[i]) | 
 | 428 | 			continue; | 
 | 429 | 		err = read_eraseblock_by_page(i); | 
 | 430 | 		if (err) | 
 | 431 | 			goto out; | 
 | 432 | 		cond_resched(); | 
 | 433 | 	} | 
 | 434 | 	stop_timing(); | 
 | 435 | 	speed = calc_speed(); | 
 | 436 | 	printk(PRINT_PREF "page read speed is %ld KiB/s\n", speed); | 
 | 437 |  | 
 | 438 | 	err = erase_whole_device(); | 
 | 439 | 	if (err) | 
 | 440 | 		goto out; | 
 | 441 |  | 
 | 442 | 	/* Write all eraseblocks, 2 pages at a time */ | 
 | 443 | 	printk(PRINT_PREF "testing 2 page write speed\n"); | 
 | 444 | 	start_timing(); | 
 | 445 | 	for (i = 0; i < ebcnt; ++i) { | 
 | 446 | 		if (bbt[i]) | 
 | 447 | 			continue; | 
 | 448 | 		err = write_eraseblock_by_2pages(i); | 
 | 449 | 		if (err) | 
 | 450 | 			goto out; | 
 | 451 | 		cond_resched(); | 
 | 452 | 	} | 
 | 453 | 	stop_timing(); | 
 | 454 | 	speed = calc_speed(); | 
 | 455 | 	printk(PRINT_PREF "2 page write speed is %ld KiB/s\n", speed); | 
 | 456 |  | 
 | 457 | 	/* Read all eraseblocks, 2 pages at a time */ | 
 | 458 | 	printk(PRINT_PREF "testing 2 page read speed\n"); | 
 | 459 | 	start_timing(); | 
 | 460 | 	for (i = 0; i < ebcnt; ++i) { | 
 | 461 | 		if (bbt[i]) | 
 | 462 | 			continue; | 
 | 463 | 		err = read_eraseblock_by_2pages(i); | 
 | 464 | 		if (err) | 
 | 465 | 			goto out; | 
 | 466 | 		cond_resched(); | 
 | 467 | 	} | 
 | 468 | 	stop_timing(); | 
 | 469 | 	speed = calc_speed(); | 
 | 470 | 	printk(PRINT_PREF "2 page read speed is %ld KiB/s\n", speed); | 
 | 471 |  | 
 | 472 | 	/* Erase all eraseblocks */ | 
 | 473 | 	printk(PRINT_PREF "Testing erase speed\n"); | 
 | 474 | 	start_timing(); | 
 | 475 | 	for (i = 0; i < ebcnt; ++i) { | 
 | 476 | 		if (bbt[i]) | 
 | 477 | 			continue; | 
 | 478 | 		err = erase_eraseblock(i); | 
 | 479 | 		if (err) | 
 | 480 | 			goto out; | 
 | 481 | 		cond_resched(); | 
 | 482 | 	} | 
 | 483 | 	stop_timing(); | 
 | 484 | 	speed = calc_speed(); | 
 | 485 | 	printk(PRINT_PREF "erase speed is %ld KiB/s\n", speed); | 
 | 486 |  | 
 | 487 | 	printk(PRINT_PREF "finished\n"); | 
 | 488 | out: | 
 | 489 | 	kfree(iobuf); | 
 | 490 | 	kfree(bbt); | 
 | 491 | 	put_mtd_device(mtd); | 
 | 492 | 	if (err) | 
 | 493 | 		printk(PRINT_PREF "error %d occurred\n", err); | 
 | 494 | 	printk(KERN_INFO "=================================================\n"); | 
 | 495 | 	return err; | 
 | 496 | } | 
 | 497 | module_init(mtd_speedtest_init); | 
 | 498 |  | 
 | 499 | static void __exit mtd_speedtest_exit(void) | 
 | 500 | { | 
 | 501 | 	return; | 
 | 502 | } | 
 | 503 | module_exit(mtd_speedtest_exit); | 
 | 504 |  | 
 | 505 | MODULE_DESCRIPTION("Speed test module"); | 
 | 506 | MODULE_AUTHOR("Adrian Hunter"); | 
 | 507 | MODULE_LICENSE("GPL"); |