blob: 5fedf4a74f16ca45bfc0c628ca03ae8dc60d53e4 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * drivers/mtd/nand_bbt.c
3 *
4 * Overview:
5 * Bad block table support for the NAND driver
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00006 *
Linus Torvalds1da177e2005-04-16 15:20:36 -07007 * Copyright (C) 2004 Thomas Gleixner (tglx@linutronix.de)
8 *
Linus Torvalds1da177e2005-04-16 15:20:36 -07009 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License version 2 as
11 * published by the Free Software Foundation.
12 *
13 * Description:
14 *
Thomas Gleixner61b03bd2005-11-07 11:15:49 +000015 * When nand_scan_bbt is called, then it tries to find the bad block table
16 * depending on the options in the bbt descriptor(s). If a bbt is found
17 * then the contents are read and the memory based bbt is created. If a
Linus Torvalds1da177e2005-04-16 15:20:36 -070018 * mirrored bbt is selected then the mirror is searched too and the
Thomas Gleixner61b03bd2005-11-07 11:15:49 +000019 * versions are compared. If the mirror has a greater version number
Linus Torvalds1da177e2005-04-16 15:20:36 -070020 * than the mirror bbt is used to build the memory based bbt.
21 * If the tables are not versioned, then we "or" the bad block information.
Thomas Gleixner61b03bd2005-11-07 11:15:49 +000022 * If one of the bbt's is out of date or does not exist it is (re)created.
23 * If no bbt exists at all then the device is scanned for factory marked
24 * good / bad blocks and the bad block tables are created.
Linus Torvalds1da177e2005-04-16 15:20:36 -070025 *
Thomas Gleixner61b03bd2005-11-07 11:15:49 +000026 * For manufacturer created bbts like the one found on M-SYS DOC devices
Linus Torvalds1da177e2005-04-16 15:20:36 -070027 * the bbt is searched and read but never created
28 *
Thomas Gleixner61b03bd2005-11-07 11:15:49 +000029 * The autogenerated bad block table is located in the last good blocks
30 * of the device. The table is mirrored, so it can be updated eventually.
31 * The table is marked in the oob area with an ident pattern and a version
Linus Torvalds1da177e2005-04-16 15:20:36 -070032 * number which indicates which of both tables is more up to date.
33 *
34 * The table uses 2 bits per block
35 * 11b: block is good
36 * 00b: block is factory marked bad
37 * 01b, 10b: block is marked bad due to wear
38 *
39 * The memory bad block table uses the following scheme:
40 * 00b: block is good
41 * 01b: block is marked bad due to wear
42 * 10b: block is reserved (to protect the bbt area)
43 * 11b: block is factory marked bad
Thomas Gleixner61b03bd2005-11-07 11:15:49 +000044 *
Linus Torvalds1da177e2005-04-16 15:20:36 -070045 * Multichip devices like DOC store the bad block info per floor.
46 *
47 * Following assumptions are made:
48 * - bbts start at a page boundary, if autolocated on a block boundary
David Woodhousee0c7d762006-05-13 18:07:53 +010049 * - the space necessary for a bbt in FLASH does not exceed a block boundary
Thomas Gleixner61b03bd2005-11-07 11:15:49 +000050 *
Linus Torvalds1da177e2005-04-16 15:20:36 -070051 */
52
53#include <linux/slab.h>
54#include <linux/types.h>
55#include <linux/mtd/mtd.h>
56#include <linux/mtd/nand.h>
57#include <linux/mtd/nand_ecc.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070058#include <linux/bitops.h>
59#include <linux/delay.h>
David Woodhousec3f8abf2006-05-13 04:03:42 +010060#include <linux/vmalloc.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070061
Thomas Gleixner61b03bd2005-11-07 11:15:49 +000062/**
Linus Torvalds1da177e2005-04-16 15:20:36 -070063 * check_pattern - [GENERIC] check if a pattern is in the buffer
64 * @buf: the buffer to search
65 * @len: the length of buffer to search
66 * @paglen: the pagelength
67 * @td: search pattern descriptor
68 *
69 * Check for a pattern at the given place. Used to search bad block
70 * tables and good / bad block identifiers.
71 * If the SCAN_EMPTY option is set then check, if all bytes except the
72 * pattern area contain 0xff
73 *
74*/
David Woodhousee0c7d762006-05-13 18:07:53 +010075static int check_pattern(uint8_t *buf, int len, int paglen, struct nand_bbt_descr *td)
Linus Torvalds1da177e2005-04-16 15:20:36 -070076{
Artem B. Bityuckiy171650a2005-02-16 17:09:39 +000077 int i, end = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -070078 uint8_t *p = buf;
79
Thomas Gleixnerc9e053652005-06-14 16:39:57 +010080 end = paglen + td->offs;
Linus Torvalds1da177e2005-04-16 15:20:36 -070081 if (td->options & NAND_BBT_SCANEMPTY) {
82 for (i = 0; i < end; i++) {
83 if (p[i] != 0xff)
84 return -1;
85 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +000086 }
Thomas Gleixnerc9e053652005-06-14 16:39:57 +010087 p += end;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +000088
Linus Torvalds1da177e2005-04-16 15:20:36 -070089 /* Compare the pattern */
90 for (i = 0; i < td->len; i++) {
91 if (p[i] != td->pattern[i])
92 return -1;
93 }
94
Brian Norris58373ff2010-07-15 12:15:44 -070095 /* Check both positions 1 and 6 for pattern? */
96 if (td->options & NAND_BBT_SCANBYTE1AND6) {
97 if (td->options & NAND_BBT_SCANEMPTY) {
98 p += td->len;
99 end += NAND_SMALL_BADBLOCK_POS - td->offs;
100 /* Check region between positions 1 and 6 */
101 for (i = 0; i < NAND_SMALL_BADBLOCK_POS - td->offs - td->len;
102 i++) {
103 if (*p++ != 0xff)
104 return -1;
105 }
106 }
107 else {
108 p += NAND_SMALL_BADBLOCK_POS - td->offs;
109 }
110 /* Compare the pattern */
111 for (i = 0; i < td->len; i++) {
112 if (p[i] != td->pattern[i])
113 return -1;
114 }
115 }
116
Linus Torvalds1da177e2005-04-16 15:20:36 -0700117 if (td->options & NAND_BBT_SCANEMPTY) {
Artem B. Bityuckiy171650a2005-02-16 17:09:39 +0000118 p += td->len;
119 end += td->len;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700120 for (i = end; i < len; i++) {
121 if (*p++ != 0xff)
122 return -1;
123 }
124 }
125 return 0;
126}
127
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000128/**
Thomas Gleixnerc9e053652005-06-14 16:39:57 +0100129 * check_short_pattern - [GENERIC] check if a pattern is in the buffer
130 * @buf: the buffer to search
Thomas Gleixnerc9e053652005-06-14 16:39:57 +0100131 * @td: search pattern descriptor
132 *
133 * Check for a pattern at the given place. Used to search bad block
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000134 * tables and good / bad block identifiers. Same as check_pattern, but
Thomas Gleixner19870da2005-07-15 14:53:51 +0100135 * no optional empty check
Thomas Gleixnerc9e053652005-06-14 16:39:57 +0100136 *
137*/
David Woodhousee0c7d762006-05-13 18:07:53 +0100138static int check_short_pattern(uint8_t *buf, struct nand_bbt_descr *td)
Thomas Gleixnerc9e053652005-06-14 16:39:57 +0100139{
140 int i;
141 uint8_t *p = buf;
142
143 /* Compare the pattern */
144 for (i = 0; i < td->len; i++) {
Thomas Gleixner19870da2005-07-15 14:53:51 +0100145 if (p[td->offs + i] != td->pattern[i])
Thomas Gleixnerc9e053652005-06-14 16:39:57 +0100146 return -1;
147 }
Brian Norris58373ff2010-07-15 12:15:44 -0700148 /* Need to check location 1 AND 6? */
149 if (td->options & NAND_BBT_SCANBYTE1AND6) {
150 for (i = 0; i < td->len; i++) {
151 if (p[NAND_SMALL_BADBLOCK_POS + i] != td->pattern[i])
152 return -1;
153 }
154 }
Thomas Gleixnerc9e053652005-06-14 16:39:57 +0100155 return 0;
156}
157
Linus Torvalds1da177e2005-04-16 15:20:36 -0700158/**
159 * read_bbt - [GENERIC] Read the bad block table starting from page
160 * @mtd: MTD device structure
161 * @buf: temporary buffer
162 * @page: the starting page
163 * @num: the number of bbt descriptors to read
164 * @bits: number of bits per block
165 * @offs: offset in the memory table
166 * @reserved_block_code: Pattern to identify reserved blocks
167 *
168 * Read the bad block table starting from page.
169 *
170 */
David Woodhousee0c7d762006-05-13 18:07:53 +0100171static int read_bbt(struct mtd_info *mtd, uint8_t *buf, int page, int num,
172 int bits, int offs, int reserved_block_code)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700173{
174 int res, i, j, act = 0;
175 struct nand_chip *this = mtd->priv;
176 size_t retlen, len, totlen;
177 loff_t from;
178 uint8_t msk = (uint8_t) ((1 << bits) - 1);
179
180 totlen = (num * bits) >> 3;
David Woodhousee0c7d762006-05-13 18:07:53 +0100181 from = ((loff_t) page) << this->page_shift;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000182
Linus Torvalds1da177e2005-04-16 15:20:36 -0700183 while (totlen) {
David Woodhousee0c7d762006-05-13 18:07:53 +0100184 len = min(totlen, (size_t) (1 << this->bbt_erase_shift));
Thomas Gleixner9223a452006-05-23 17:21:03 +0200185 res = mtd->read(mtd, from, len, &retlen, buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700186 if (res < 0) {
187 if (retlen != len) {
David Woodhousee0c7d762006-05-13 18:07:53 +0100188 printk(KERN_INFO "nand_bbt: Error reading bad block table\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700189 return res;
190 }
David Woodhousee0c7d762006-05-13 18:07:53 +0100191 printk(KERN_WARNING "nand_bbt: ECC error while reading bad block table\n");
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000192 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700193
194 /* Analyse data */
195 for (i = 0; i < len; i++) {
196 uint8_t dat = buf[i];
197 for (j = 0; j < 8; j += bits, act += 2) {
198 uint8_t tmp = (dat >> j) & msk;
199 if (tmp == msk)
200 continue;
David Woodhousee0c7d762006-05-13 18:07:53 +0100201 if (reserved_block_code && (tmp == reserved_block_code)) {
Adrian Hunter69423d92008-12-10 13:37:21 +0000202 printk(KERN_DEBUG "nand_read_bbt: Reserved block at 0x%012llx\n",
203 (loff_t)((offs << 2) + (act >> 1)) << this->bbt_erase_shift);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700204 this->bbt[offs + (act >> 3)] |= 0x2 << (act & 0x06);
Thomas Gleixnerf1a28c02006-05-30 00:37:34 +0200205 mtd->ecc_stats.bbtblocks++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700206 continue;
207 }
208 /* Leave it for now, if its matured we can move this
209 * message to MTD_DEBUG_LEVEL0 */
Adrian Hunter69423d92008-12-10 13:37:21 +0000210 printk(KERN_DEBUG "nand_read_bbt: Bad block at 0x%012llx\n",
211 (loff_t)((offs << 2) + (act >> 1)) << this->bbt_erase_shift);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000212 /* Factory marked bad or worn out ? */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700213 if (tmp == 0)
214 this->bbt[offs + (act >> 3)] |= 0x3 << (act & 0x06);
215 else
216 this->bbt[offs + (act >> 3)] |= 0x1 << (act & 0x06);
Thomas Gleixnerf1a28c02006-05-30 00:37:34 +0200217 mtd->ecc_stats.badblocks++;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000218 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700219 }
220 totlen -= len;
221 from += len;
222 }
223 return 0;
224}
225
226/**
227 * read_abs_bbt - [GENERIC] Read the bad block table starting at a given page
228 * @mtd: MTD device structure
229 * @buf: temporary buffer
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000230 * @td: descriptor for the bad block table
Linus Torvalds1da177e2005-04-16 15:20:36 -0700231 * @chip: read the table for a specific chip, -1 read all chips.
232 * Applies only if NAND_BBT_PERCHIP option is set
233 *
234 * Read the bad block table for all chips starting at a given page
235 * We assume that the bbt bits are in consecutive order.
236*/
David Woodhousee0c7d762006-05-13 18:07:53 +0100237static int read_abs_bbt(struct mtd_info *mtd, uint8_t *buf, struct nand_bbt_descr *td, int chip)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700238{
239 struct nand_chip *this = mtd->priv;
240 int res = 0, i;
241 int bits;
242
243 bits = td->options & NAND_BBT_NRBITS_MSK;
244 if (td->options & NAND_BBT_PERCHIP) {
245 int offs = 0;
246 for (i = 0; i < this->numchips; i++) {
247 if (chip == -1 || chip == i)
248 res = read_bbt (mtd, buf, td->pages[i], this->chipsize >> this->bbt_erase_shift, bits, offs, td->reserved_block_code);
249 if (res)
250 return res;
251 offs += this->chipsize >> (this->bbt_erase_shift + 2);
252 }
253 } else {
254 res = read_bbt (mtd, buf, td->pages[0], mtd->size >> this->bbt_erase_shift, bits, 0, td->reserved_block_code);
255 if (res)
256 return res;
257 }
258 return 0;
259}
260
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200261/*
262 * Scan read raw data from flash
263 */
264static int scan_read_raw(struct mtd_info *mtd, uint8_t *buf, loff_t offs,
265 size_t len)
266{
267 struct mtd_oob_ops ops;
Maxim Levitskyb64d39d2010-02-22 20:39:37 +0200268 int res;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200269
270 ops.mode = MTD_OOB_RAW;
271 ops.ooboffs = 0;
272 ops.ooblen = mtd->oobsize;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200273
Maxim Levitskyb64d39d2010-02-22 20:39:37 +0200274
275 while (len > 0) {
276 if (len <= mtd->writesize) {
277 ops.oobbuf = buf + len;
278 ops.datbuf = buf;
279 ops.len = len;
280 return mtd->read_oob(mtd, offs, &ops);
281 } else {
282 ops.oobbuf = buf + mtd->writesize;
283 ops.datbuf = buf;
284 ops.len = mtd->writesize;
285 res = mtd->read_oob(mtd, offs, &ops);
286
287 if (res)
288 return res;
289 }
290
291 buf += mtd->oobsize + mtd->writesize;
292 len -= mtd->writesize;
293 }
294 return 0;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200295}
296
297/*
298 * Scan write data with oob to flash
299 */
300static int scan_write_bbt(struct mtd_info *mtd, loff_t offs, size_t len,
301 uint8_t *buf, uint8_t *oob)
302{
303 struct mtd_oob_ops ops;
304
305 ops.mode = MTD_OOB_PLACE;
306 ops.ooboffs = 0;
307 ops.ooblen = mtd->oobsize;
308 ops.datbuf = buf;
309 ops.oobbuf = oob;
310 ops.len = len;
311
312 return mtd->write_oob(mtd, offs, &ops);
313}
314
Linus Torvalds1da177e2005-04-16 15:20:36 -0700315/**
316 * read_abs_bbts - [GENERIC] Read the bad block table(s) for all chips starting at a given page
317 * @mtd: MTD device structure
318 * @buf: temporary buffer
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000319 * @td: descriptor for the bad block table
Linus Torvalds1da177e2005-04-16 15:20:36 -0700320 * @md: descriptor for the bad block table mirror
321 *
322 * Read the bad block table(s) for all chips starting at a given page
323 * We assume that the bbt bits are in consecutive order.
324 *
325*/
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200326static int read_abs_bbts(struct mtd_info *mtd, uint8_t *buf,
327 struct nand_bbt_descr *td, struct nand_bbt_descr *md)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700328{
329 struct nand_chip *this = mtd->priv;
330
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000331 /* Read the primary version, if available */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700332 if (td->options & NAND_BBT_VERSION) {
Adrian Hunter69423d92008-12-10 13:37:21 +0000333 scan_read_raw(mtd, buf, (loff_t)td->pages[0] << this->page_shift,
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200334 mtd->writesize);
Joern Engel28318772006-05-22 23:18:05 +0200335 td->version[0] = buf[mtd->writesize + td->veroffs];
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200336 printk(KERN_DEBUG "Bad block table at page %d, version 0x%02X\n",
337 td->pages[0], td->version[0]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700338 }
339
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000340 /* Read the mirror version, if available */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700341 if (md && (md->options & NAND_BBT_VERSION)) {
Adrian Hunter69423d92008-12-10 13:37:21 +0000342 scan_read_raw(mtd, buf, (loff_t)md->pages[0] << this->page_shift,
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200343 mtd->writesize);
Joern Engel28318772006-05-22 23:18:05 +0200344 md->version[0] = buf[mtd->writesize + md->veroffs];
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200345 printk(KERN_DEBUG "Bad block table at page %d, version 0x%02X\n",
346 md->pages[0], md->version[0]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700347 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700348 return 1;
349}
350
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200351/*
352 * Scan a given block full
353 */
354static int scan_block_full(struct mtd_info *mtd, struct nand_bbt_descr *bd,
355 loff_t offs, uint8_t *buf, size_t readlen,
356 int scanlen, int len)
357{
358 int ret, j;
359
360 ret = scan_read_raw(mtd, buf, offs, readlen);
361 if (ret)
362 return ret;
363
364 for (j = 0; j < len; j++, buf += scanlen) {
365 if (check_pattern(buf, scanlen, mtd->writesize, bd))
366 return 1;
367 }
368 return 0;
369}
370
371/*
372 * Scan a given block partially
373 */
374static int scan_block_fast(struct mtd_info *mtd, struct nand_bbt_descr *bd,
375 loff_t offs, uint8_t *buf, int len)
376{
377 struct mtd_oob_ops ops;
378 int j, ret;
379
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200380 ops.ooblen = mtd->oobsize;
381 ops.oobbuf = buf;
382 ops.ooboffs = 0;
383 ops.datbuf = NULL;
384 ops.mode = MTD_OOB_PLACE;
385
386 for (j = 0; j < len; j++) {
387 /*
388 * Read the full oob until read_oob is fixed to
389 * handle single byte reads for 16 bit
390 * buswidth
391 */
392 ret = mtd->read_oob(mtd, offs, &ops);
393 if (ret)
394 return ret;
395
396 if (check_short_pattern(buf, bd))
397 return 1;
398
399 offs += mtd->writesize;
400 }
401 return 0;
402}
403
Linus Torvalds1da177e2005-04-16 15:20:36 -0700404/**
405 * create_bbt - [GENERIC] Create a bad block table by scanning the device
406 * @mtd: MTD device structure
407 * @buf: temporary buffer
408 * @bd: descriptor for the good/bad block search pattern
409 * @chip: create the table for a specific chip, -1 read all chips.
410 * Applies only if NAND_BBT_PERCHIP option is set
411 *
412 * Create a bad block table by scanning the device
413 * for the given good/bad block identify pattern
414 */
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200415static int create_bbt(struct mtd_info *mtd, uint8_t *buf,
416 struct nand_bbt_descr *bd, int chip)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700417{
418 struct nand_chip *this = mtd->priv;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200419 int i, numblocks, len, scanlen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700420 int startblock;
421 loff_t from;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200422 size_t readlen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700423
David Woodhousee0c7d762006-05-13 18:07:53 +0100424 printk(KERN_INFO "Scanning device for bad blocks\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700425
426 if (bd->options & NAND_BBT_SCANALLPAGES)
427 len = 1 << (this->bbt_erase_shift - this->page_shift);
Brian Norris58373ff2010-07-15 12:15:44 -0700428 else if (bd->options & NAND_BBT_SCAN2NDPAGE)
429 len = 2;
430 else
431 len = 1;
Artem B. Bityuckiy171650a2005-02-16 17:09:39 +0000432
433 if (!(bd->options & NAND_BBT_SCANEMPTY)) {
434 /* We need only read few bytes from the OOB area */
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200435 scanlen = 0;
Artem B. Bityuckiyeeada242005-02-11 10:14:15 +0000436 readlen = bd->len;
437 } else {
Artem B. Bityuckiy171650a2005-02-16 17:09:39 +0000438 /* Full page content should be read */
Joern Engel28318772006-05-22 23:18:05 +0200439 scanlen = mtd->writesize + mtd->oobsize;
440 readlen = len * mtd->writesize;
Artem B. Bityuckiyeeada242005-02-11 10:14:15 +0000441 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700442
443 if (chip == -1) {
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200444 /* Note that numblocks is 2 * (real numblocks) here, see i+=2
445 * below as it makes shifting and masking less painful */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700446 numblocks = mtd->size >> (this->bbt_erase_shift - 1);
447 startblock = 0;
448 from = 0;
449 } else {
450 if (chip >= this->numchips) {
David Woodhousee0c7d762006-05-13 18:07:53 +0100451 printk(KERN_WARNING "create_bbt(): chipnr (%d) > available chips (%d)\n",
452 chip + 1, this->numchips);
Artem B. Bityuckiy171650a2005-02-16 17:09:39 +0000453 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700454 }
455 numblocks = this->chipsize >> (this->bbt_erase_shift - 1);
456 startblock = chip * numblocks;
457 numblocks += startblock;
Adrian Hunter69423d92008-12-10 13:37:21 +0000458 from = (loff_t)startblock << (this->bbt_erase_shift - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700459 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000460
Brian Norris30fe8112010-06-23 13:36:02 -0700461 if (this->options & NAND_BBT_SCANLASTPAGE)
Kevin Cernekeeb60b08b2010-05-04 20:58:10 -0700462 from += mtd->erasesize - (mtd->writesize * len);
463
Linus Torvalds1da177e2005-04-16 15:20:36 -0700464 for (i = startblock; i < numblocks;) {
Artem B. Bityuckiyeeada242005-02-11 10:14:15 +0000465 int ret;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000466
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200467 if (bd->options & NAND_BBT_SCANALLPAGES)
468 ret = scan_block_full(mtd, bd, from, buf, readlen,
469 scanlen, len);
470 else
471 ret = scan_block_fast(mtd, bd, from, buf, len);
Artem B. Bityuckiy171650a2005-02-16 17:09:39 +0000472
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200473 if (ret < 0)
474 return ret;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000475
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200476 if (ret) {
477 this->bbt[i >> 3] |= 0x03 << (i & 0x6);
Adrian Hunter69423d92008-12-10 13:37:21 +0000478 printk(KERN_WARNING "Bad eraseblock %d at 0x%012llx\n",
479 i >> 1, (unsigned long long)from);
Thomas Gleixnerf1a28c02006-05-30 00:37:34 +0200480 mtd->ecc_stats.badblocks++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700481 }
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200482
Linus Torvalds1da177e2005-04-16 15:20:36 -0700483 i += 2;
484 from += (1 << this->bbt_erase_shift);
485 }
Artem B. Bityuckiyeeada242005-02-11 10:14:15 +0000486 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700487}
488
489/**
490 * search_bbt - [GENERIC] scan the device for a specific bad block table
491 * @mtd: MTD device structure
492 * @buf: temporary buffer
493 * @td: descriptor for the bad block table
494 *
495 * Read the bad block table by searching for a given ident pattern.
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000496 * Search is preformed either from the beginning up or from the end of
Linus Torvalds1da177e2005-04-16 15:20:36 -0700497 * the device downwards. The search starts always at the start of a
498 * block.
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000499 * If the option NAND_BBT_PERCHIP is given, each chip is searched
Linus Torvalds1da177e2005-04-16 15:20:36 -0700500 * for a bbt, which contains the bad block information of this chip.
David Woodhousee0c7d762006-05-13 18:07:53 +0100501 * This is necessary to provide support for certain DOC devices.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700502 *
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000503 * The bbt ident pattern resides in the oob area of the first page
504 * in a block.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700505 */
David Woodhousee0c7d762006-05-13 18:07:53 +0100506static int search_bbt(struct mtd_info *mtd, uint8_t *buf, struct nand_bbt_descr *td)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700507{
508 struct nand_chip *this = mtd->priv;
509 int i, chips;
510 int bits, startblock, block, dir;
Joern Engel28318772006-05-22 23:18:05 +0200511 int scanlen = mtd->writesize + mtd->oobsize;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700512 int bbtblocks;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200513 int blocktopage = this->bbt_erase_shift - this->page_shift;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700514
515 /* Search direction top -> down ? */
516 if (td->options & NAND_BBT_LASTBLOCK) {
David Woodhousee0c7d762006-05-13 18:07:53 +0100517 startblock = (mtd->size >> this->bbt_erase_shift) - 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700518 dir = -1;
519 } else {
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000520 startblock = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700521 dir = 1;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000522 }
523
Linus Torvalds1da177e2005-04-16 15:20:36 -0700524 /* Do we have a bbt per chip ? */
525 if (td->options & NAND_BBT_PERCHIP) {
526 chips = this->numchips;
527 bbtblocks = this->chipsize >> this->bbt_erase_shift;
528 startblock &= bbtblocks - 1;
529 } else {
530 chips = 1;
531 bbtblocks = mtd->size >> this->bbt_erase_shift;
532 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000533
Linus Torvalds1da177e2005-04-16 15:20:36 -0700534 /* Number of bits for each erase block in the bbt */
535 bits = td->options & NAND_BBT_NRBITS_MSK;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000536
Linus Torvalds1da177e2005-04-16 15:20:36 -0700537 for (i = 0; i < chips; i++) {
538 /* Reset version information */
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000539 td->version[i] = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700540 td->pages[i] = -1;
541 /* Scan the maximum number of blocks */
542 for (block = 0; block < td->maxblocks; block++) {
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200543
Linus Torvalds1da177e2005-04-16 15:20:36 -0700544 int actblock = startblock + dir * block;
Adrian Hunter69423d92008-12-10 13:37:21 +0000545 loff_t offs = (loff_t)actblock << this->bbt_erase_shift;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200546
Linus Torvalds1da177e2005-04-16 15:20:36 -0700547 /* Read first page */
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200548 scan_read_raw(mtd, buf, offs, mtd->writesize);
Joern Engel28318772006-05-22 23:18:05 +0200549 if (!check_pattern(buf, scanlen, mtd->writesize, td)) {
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200550 td->pages[i] = actblock << blocktopage;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700551 if (td->options & NAND_BBT_VERSION) {
Joern Engel28318772006-05-22 23:18:05 +0200552 td->version[i] = buf[mtd->writesize + td->veroffs];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700553 }
554 break;
555 }
556 }
557 startblock += this->chipsize >> this->bbt_erase_shift;
558 }
559 /* Check, if we found a bbt for each requested chip */
560 for (i = 0; i < chips; i++) {
561 if (td->pages[i] == -1)
David Woodhousee0c7d762006-05-13 18:07:53 +0100562 printk(KERN_WARNING "Bad block table not found for chip %d\n", i);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700563 else
David Woodhousee0c7d762006-05-13 18:07:53 +0100564 printk(KERN_DEBUG "Bad block table found at page %d, version 0x%02X\n", td->pages[i],
565 td->version[i]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700566 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000567 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700568}
569
570/**
571 * search_read_bbts - [GENERIC] scan the device for bad block table(s)
572 * @mtd: MTD device structure
573 * @buf: temporary buffer
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000574 * @td: descriptor for the bad block table
Linus Torvalds1da177e2005-04-16 15:20:36 -0700575 * @md: descriptor for the bad block table mirror
576 *
577 * Search and read the bad block table(s)
578*/
David Woodhousee0c7d762006-05-13 18:07:53 +0100579static int search_read_bbts(struct mtd_info *mtd, uint8_t * buf, struct nand_bbt_descr *td, struct nand_bbt_descr *md)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700580{
581 /* Search the primary table */
David Woodhousee0c7d762006-05-13 18:07:53 +0100582 search_bbt(mtd, buf, td);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000583
Linus Torvalds1da177e2005-04-16 15:20:36 -0700584 /* Search the mirror table */
585 if (md)
David Woodhousee0c7d762006-05-13 18:07:53 +0100586 search_bbt(mtd, buf, md);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700587
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000588 /* Force result check */
589 return 1;
590}
591
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000592/**
Linus Torvalds1da177e2005-04-16 15:20:36 -0700593 * write_bbt - [GENERIC] (Re)write the bad block table
594 *
595 * @mtd: MTD device structure
596 * @buf: temporary buffer
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000597 * @td: descriptor for the bad block table
Linus Torvalds1da177e2005-04-16 15:20:36 -0700598 * @md: descriptor for the bad block table mirror
599 * @chipsel: selector for a specific chip, -1 for all
600 *
601 * (Re)write the bad block table
602 *
603*/
David Woodhousee0c7d762006-05-13 18:07:53 +0100604static int write_bbt(struct mtd_info *mtd, uint8_t *buf,
Thomas Gleixner9223a452006-05-23 17:21:03 +0200605 struct nand_bbt_descr *td, struct nand_bbt_descr *md,
606 int chipsel)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700607{
608 struct nand_chip *this = mtd->priv;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700609 struct erase_info einfo;
610 int i, j, res, chip = 0;
611 int bits, startblock, dir, page, offs, numblocks, sft, sftmsk;
Thomas Gleixner9223a452006-05-23 17:21:03 +0200612 int nrchips, bbtoffs, pageoffs, ooboffs;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700613 uint8_t msk[4];
614 uint8_t rcode = td->reserved_block_code;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200615 size_t retlen, len = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700616 loff_t to;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200617 struct mtd_oob_ops ops;
618
619 ops.ooblen = mtd->oobsize;
620 ops.ooboffs = 0;
621 ops.datbuf = NULL;
622 ops.mode = MTD_OOB_PLACE;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700623
624 if (!rcode)
625 rcode = 0xff;
626 /* Write bad block table per chip rather than per device ? */
627 if (td->options & NAND_BBT_PERCHIP) {
David Woodhousee0c7d762006-05-13 18:07:53 +0100628 numblocks = (int)(this->chipsize >> this->bbt_erase_shift);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000629 /* Full device write or specific chip ? */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700630 if (chipsel == -1) {
631 nrchips = this->numchips;
632 } else {
633 nrchips = chipsel + 1;
634 chip = chipsel;
635 }
636 } else {
David Woodhousee0c7d762006-05-13 18:07:53 +0100637 numblocks = (int)(mtd->size >> this->bbt_erase_shift);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700638 nrchips = 1;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000639 }
640
Linus Torvalds1da177e2005-04-16 15:20:36 -0700641 /* Loop through the chips */
642 for (; chip < nrchips; chip++) {
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000643
644 /* There was already a version of the table, reuse the page
645 * This applies for absolute placement too, as we have the
Linus Torvalds1da177e2005-04-16 15:20:36 -0700646 * page nr. in td->pages.
647 */
648 if (td->pages[chip] != -1) {
649 page = td->pages[chip];
650 goto write;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000651 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700652
653 /* Automatic placement of the bad block table */
654 /* Search direction top -> down ? */
655 if (td->options & NAND_BBT_LASTBLOCK) {
656 startblock = numblocks * (chip + 1) - 1;
657 dir = -1;
658 } else {
659 startblock = chip * numblocks;
660 dir = 1;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000661 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700662
663 for (i = 0; i < td->maxblocks; i++) {
664 int block = startblock + dir * i;
665 /* Check, if the block is bad */
Thomas Gleixner9223a452006-05-23 17:21:03 +0200666 switch ((this->bbt[block >> 2] >>
667 (2 * (block & 0x03))) & 0x03) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700668 case 0x01:
669 case 0x03:
670 continue;
671 }
Thomas Gleixner9223a452006-05-23 17:21:03 +0200672 page = block <<
673 (this->bbt_erase_shift - this->page_shift);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700674 /* Check, if the block is used by the mirror table */
675 if (!md || md->pages[chip] != page)
676 goto write;
677 }
David Woodhousee0c7d762006-05-13 18:07:53 +0100678 printk(KERN_ERR "No space left to write bad block table\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700679 return -ENOSPC;
David Woodhousee0c7d762006-05-13 18:07:53 +0100680 write:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700681
682 /* Set up shift count and masks for the flash table */
683 bits = td->options & NAND_BBT_NRBITS_MSK;
Thomas Gleixner9223a452006-05-23 17:21:03 +0200684 msk[2] = ~rcode;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700685 switch (bits) {
Thomas Gleixner9223a452006-05-23 17:21:03 +0200686 case 1: sft = 3; sftmsk = 0x07; msk[0] = 0x00; msk[1] = 0x01;
687 msk[3] = 0x01;
688 break;
689 case 2: sft = 2; sftmsk = 0x06; msk[0] = 0x00; msk[1] = 0x01;
690 msk[3] = 0x03;
691 break;
692 case 4: sft = 1; sftmsk = 0x04; msk[0] = 0x00; msk[1] = 0x0C;
693 msk[3] = 0x0f;
694 break;
695 case 8: sft = 0; sftmsk = 0x00; msk[0] = 0x00; msk[1] = 0x0F;
696 msk[3] = 0xff;
697 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700698 default: return -EINVAL;
699 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000700
Linus Torvalds1da177e2005-04-16 15:20:36 -0700701 bbtoffs = chip * (numblocks >> 2);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000702
Linus Torvalds1da177e2005-04-16 15:20:36 -0700703 to = ((loff_t) page) << this->page_shift;
704
Linus Torvalds1da177e2005-04-16 15:20:36 -0700705 /* Must we save the block contents ? */
706 if (td->options & NAND_BBT_SAVECONTENT) {
707 /* Make it block aligned */
708 to &= ~((loff_t) ((1 << this->bbt_erase_shift) - 1));
709 len = 1 << this->bbt_erase_shift;
Thomas Gleixner9223a452006-05-23 17:21:03 +0200710 res = mtd->read(mtd, to, len, &retlen, buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700711 if (res < 0) {
712 if (retlen != len) {
Thomas Gleixner9223a452006-05-23 17:21:03 +0200713 printk(KERN_INFO "nand_bbt: Error "
714 "reading block for writing "
715 "the bad block table\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700716 return res;
717 }
Thomas Gleixner9223a452006-05-23 17:21:03 +0200718 printk(KERN_WARNING "nand_bbt: ECC error "
719 "while reading block for writing "
720 "bad block table\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700721 }
Thomas Gleixner9223a452006-05-23 17:21:03 +0200722 /* Read oob data */
Vitaly Wool70145682006-11-03 18:20:38 +0300723 ops.ooblen = (len >> this->page_shift) * mtd->oobsize;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200724 ops.oobbuf = &buf[len];
725 res = mtd->read_oob(mtd, to + mtd->writesize, &ops);
Vitaly Wool70145682006-11-03 18:20:38 +0300726 if (res < 0 || ops.oobretlen != ops.ooblen)
Thomas Gleixner9223a452006-05-23 17:21:03 +0200727 goto outerr;
728
Linus Torvalds1da177e2005-04-16 15:20:36 -0700729 /* Calc the byte offset in the buffer */
730 pageoffs = page - (int)(to >> this->page_shift);
731 offs = pageoffs << this->page_shift;
732 /* Preset the bbt area with 0xff */
David Woodhousee0c7d762006-05-13 18:07:53 +0100733 memset(&buf[offs], 0xff, (size_t) (numblocks >> sft));
Thomas Gleixner9223a452006-05-23 17:21:03 +0200734 ooboffs = len + (pageoffs * mtd->oobsize);
735
Linus Torvalds1da177e2005-04-16 15:20:36 -0700736 } else {
737 /* Calc length */
738 len = (size_t) (numblocks >> sft);
739 /* Make it page aligned ! */
Thomas Gleixner9223a452006-05-23 17:21:03 +0200740 len = (len + (mtd->writesize - 1)) &
741 ~(mtd->writesize - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700742 /* Preset the buffer with 0xff */
Thomas Gleixner9223a452006-05-23 17:21:03 +0200743 memset(buf, 0xff, len +
744 (len >> this->page_shift)* mtd->oobsize);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700745 offs = 0;
Thomas Gleixner9223a452006-05-23 17:21:03 +0200746 ooboffs = len;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700747 /* Pattern is located in oob area of first page */
Thomas Gleixner9223a452006-05-23 17:21:03 +0200748 memcpy(&buf[ooboffs + td->offs], td->pattern, td->len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700749 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000750
Thomas Gleixner9223a452006-05-23 17:21:03 +0200751 if (td->options & NAND_BBT_VERSION)
752 buf[ooboffs + td->veroffs] = td->version[chip];
753
Linus Torvalds1da177e2005-04-16 15:20:36 -0700754 /* walk through the memory table */
David Woodhousee0c7d762006-05-13 18:07:53 +0100755 for (i = 0; i < numblocks;) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700756 uint8_t dat;
757 dat = this->bbt[bbtoffs + (i >> 2)];
David Woodhousee0c7d762006-05-13 18:07:53 +0100758 for (j = 0; j < 4; j++, i++) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700759 int sftcnt = (i << (3 - sft)) & sftmsk;
760 /* Do not store the reserved bbt blocks ! */
Thomas Gleixner9223a452006-05-23 17:21:03 +0200761 buf[offs + (i >> sft)] &=
762 ~(msk[dat & 0x03] << sftcnt);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700763 dat >>= 2;
764 }
765 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000766
David Woodhousee0c7d762006-05-13 18:07:53 +0100767 memset(&einfo, 0, sizeof(einfo));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700768 einfo.mtd = mtd;
Adrian Hunter69423d92008-12-10 13:37:21 +0000769 einfo.addr = to;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700770 einfo.len = 1 << this->bbt_erase_shift;
David Woodhousee0c7d762006-05-13 18:07:53 +0100771 res = nand_erase_nand(mtd, &einfo, 1);
Thomas Gleixner9223a452006-05-23 17:21:03 +0200772 if (res < 0)
773 goto outerr;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000774
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200775 res = scan_write_bbt(mtd, to, len, buf, &buf[len]);
Thomas Gleixner9223a452006-05-23 17:21:03 +0200776 if (res < 0)
777 goto outerr;
778
Adrian Hunter69423d92008-12-10 13:37:21 +0000779 printk(KERN_DEBUG "Bad block table written to 0x%012llx, version "
780 "0x%02X\n", (unsigned long long)to, td->version[chip]);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000781
Linus Torvalds1da177e2005-04-16 15:20:36 -0700782 /* Mark it as used */
783 td->pages[chip] = page;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000784 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700785 return 0;
Thomas Gleixner9223a452006-05-23 17:21:03 +0200786
787 outerr:
788 printk(KERN_WARNING
789 "nand_bbt: Error while writing bad block table %d\n", res);
790 return res;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700791}
792
793/**
794 * nand_memory_bbt - [GENERIC] create a memory based bad block table
795 * @mtd: MTD device structure
796 * @bd: descriptor for the good/bad block search pattern
797 *
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000798 * The function creates a memory based bbt by scanning the device
Linus Torvalds1da177e2005-04-16 15:20:36 -0700799 * for manufacturer / software marked good / bad blocks
800*/
David Woodhousee0c7d762006-05-13 18:07:53 +0100801static inline int nand_memory_bbt(struct mtd_info *mtd, struct nand_bbt_descr *bd)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700802{
803 struct nand_chip *this = mtd->priv;
804
Artem B. Bityuckiy171650a2005-02-16 17:09:39 +0000805 bd->options &= ~NAND_BBT_SCANEMPTY;
David Woodhouse4bf63fc2006-09-25 17:08:04 +0100806 return create_bbt(mtd, this->buffers->databuf, bd, -1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700807}
808
809/**
David Woodhousee0c7d762006-05-13 18:07:53 +0100810 * check_create - [GENERIC] create and write bbt(s) if necessary
Linus Torvalds1da177e2005-04-16 15:20:36 -0700811 * @mtd: MTD device structure
812 * @buf: temporary buffer
813 * @bd: descriptor for the good/bad block search pattern
814 *
815 * The function checks the results of the previous call to read_bbt
David Woodhousee0c7d762006-05-13 18:07:53 +0100816 * and creates / updates the bbt(s) if necessary
817 * Creation is necessary if no bbt was found for the chip/device
818 * Update is necessary if one of the tables is missing or the
Linus Torvalds1da177e2005-04-16 15:20:36 -0700819 * version nr. of one table is less than the other
820*/
David Woodhousee0c7d762006-05-13 18:07:53 +0100821static int check_create(struct mtd_info *mtd, uint8_t *buf, struct nand_bbt_descr *bd)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700822{
823 int i, chips, writeops, chipsel, res;
824 struct nand_chip *this = mtd->priv;
825 struct nand_bbt_descr *td = this->bbt_td;
826 struct nand_bbt_descr *md = this->bbt_md;
827 struct nand_bbt_descr *rd, *rd2;
828
829 /* Do we have a bbt per chip ? */
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000830 if (td->options & NAND_BBT_PERCHIP)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700831 chips = this->numchips;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000832 else
Linus Torvalds1da177e2005-04-16 15:20:36 -0700833 chips = 1;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000834
Linus Torvalds1da177e2005-04-16 15:20:36 -0700835 for (i = 0; i < chips; i++) {
836 writeops = 0;
837 rd = NULL;
838 rd2 = NULL;
839 /* Per chip or per device ? */
840 chipsel = (td->options & NAND_BBT_PERCHIP) ? i : -1;
841 /* Mirrored table avilable ? */
842 if (md) {
843 if (td->pages[i] == -1 && md->pages[i] == -1) {
844 writeops = 0x03;
845 goto create;
846 }
847
848 if (td->pages[i] == -1) {
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000849 rd = md;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700850 td->version[i] = md->version[i];
851 writeops = 1;
852 goto writecheck;
853 }
854
855 if (md->pages[i] == -1) {
856 rd = td;
857 md->version[i] = td->version[i];
858 writeops = 2;
859 goto writecheck;
860 }
861
862 if (td->version[i] == md->version[i]) {
863 rd = td;
864 if (!(td->options & NAND_BBT_VERSION))
865 rd2 = md;
866 goto writecheck;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000867 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700868
869 if (((int8_t) (td->version[i] - md->version[i])) > 0) {
870 rd = td;
871 md->version[i] = td->version[i];
872 writeops = 2;
873 } else {
874 rd = md;
875 td->version[i] = md->version[i];
876 writeops = 1;
877 }
878
879 goto writecheck;
880
881 } else {
882 if (td->pages[i] == -1) {
883 writeops = 0x01;
884 goto create;
885 }
886 rd = td;
887 goto writecheck;
888 }
David Woodhousee0c7d762006-05-13 18:07:53 +0100889 create:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700890 /* Create the bad block table by scanning the device ? */
891 if (!(td->options & NAND_BBT_CREATE))
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000892 continue;
893
Linus Torvalds1da177e2005-04-16 15:20:36 -0700894 /* Create the table in memory by scanning the chip(s) */
David Woodhousee0c7d762006-05-13 18:07:53 +0100895 create_bbt(mtd, buf, bd, chipsel);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000896
Linus Torvalds1da177e2005-04-16 15:20:36 -0700897 td->version[i] = 1;
898 if (md)
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000899 md->version[i] = 1;
David Woodhousee0c7d762006-05-13 18:07:53 +0100900 writecheck:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700901 /* read back first ? */
902 if (rd)
David Woodhousee0c7d762006-05-13 18:07:53 +0100903 read_abs_bbt(mtd, buf, rd, chipsel);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700904 /* If they weren't versioned, read both. */
905 if (rd2)
David Woodhousee0c7d762006-05-13 18:07:53 +0100906 read_abs_bbt(mtd, buf, rd2, chipsel);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700907
908 /* Write the bad block table to the device ? */
909 if ((writeops & 0x01) && (td->options & NAND_BBT_WRITE)) {
David Woodhousee0c7d762006-05-13 18:07:53 +0100910 res = write_bbt(mtd, buf, td, md, chipsel);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700911 if (res < 0)
912 return res;
913 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000914
Linus Torvalds1da177e2005-04-16 15:20:36 -0700915 /* Write the mirror bad block table to the device ? */
916 if ((writeops & 0x02) && md && (md->options & NAND_BBT_WRITE)) {
David Woodhousee0c7d762006-05-13 18:07:53 +0100917 res = write_bbt(mtd, buf, md, td, chipsel);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700918 if (res < 0)
919 return res;
920 }
921 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000922 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700923}
924
925/**
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000926 * mark_bbt_regions - [GENERIC] mark the bad block table regions
Linus Torvalds1da177e2005-04-16 15:20:36 -0700927 * @mtd: MTD device structure
928 * @td: bad block table descriptor
929 *
930 * The bad block table regions are marked as "bad" to prevent
931 * accidental erasures / writes. The regions are identified by
932 * the mark 0x02.
933*/
David Woodhousee0c7d762006-05-13 18:07:53 +0100934static void mark_bbt_region(struct mtd_info *mtd, struct nand_bbt_descr *td)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700935{
936 struct nand_chip *this = mtd->priv;
937 int i, j, chips, block, nrblocks, update;
938 uint8_t oldval, newval;
939
940 /* Do we have a bbt per chip ? */
941 if (td->options & NAND_BBT_PERCHIP) {
942 chips = this->numchips;
943 nrblocks = (int)(this->chipsize >> this->bbt_erase_shift);
944 } else {
945 chips = 1;
946 nrblocks = (int)(mtd->size >> this->bbt_erase_shift);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000947 }
948
Linus Torvalds1da177e2005-04-16 15:20:36 -0700949 for (i = 0; i < chips; i++) {
950 if ((td->options & NAND_BBT_ABSPAGE) ||
951 !(td->options & NAND_BBT_WRITE)) {
David Woodhousee0c7d762006-05-13 18:07:53 +0100952 if (td->pages[i] == -1)
953 continue;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700954 block = td->pages[i] >> (this->bbt_erase_shift - this->page_shift);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000955 block <<= 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700956 oldval = this->bbt[(block >> 3)];
957 newval = oldval | (0x2 << (block & 0x06));
958 this->bbt[(block >> 3)] = newval;
959 if ((oldval != newval) && td->reserved_block_code)
Adrian Hunter69423d92008-12-10 13:37:21 +0000960 nand_update_bbt(mtd, (loff_t)block << (this->bbt_erase_shift - 1));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700961 continue;
962 }
963 update = 0;
964 if (td->options & NAND_BBT_LASTBLOCK)
965 block = ((i + 1) * nrblocks) - td->maxblocks;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000966 else
Linus Torvalds1da177e2005-04-16 15:20:36 -0700967 block = i * nrblocks;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000968 block <<= 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700969 for (j = 0; j < td->maxblocks; j++) {
970 oldval = this->bbt[(block >> 3)];
971 newval = oldval | (0x2 << (block & 0x06));
972 this->bbt[(block >> 3)] = newval;
David Woodhousee0c7d762006-05-13 18:07:53 +0100973 if (oldval != newval)
974 update = 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700975 block += 2;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000976 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700977 /* If we want reserved blocks to be recorded to flash, and some
978 new ones have been marked, then we need to update the stored
979 bbts. This should only happen once. */
980 if (update && td->reserved_block_code)
Adrian Hunter69423d92008-12-10 13:37:21 +0000981 nand_update_bbt(mtd, (loff_t)(block - 2) << (this->bbt_erase_shift - 1));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700982 }
983}
984
985/**
986 * nand_scan_bbt - [NAND Interface] scan, find, read and maybe create bad block table(s)
987 * @mtd: MTD device structure
988 * @bd: descriptor for the good/bad block search pattern
989 *
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000990 * The function checks, if a bad block table(s) is/are already
Linus Torvalds1da177e2005-04-16 15:20:36 -0700991 * available. If not it scans the device for manufacturer
992 * marked good / bad blocks and writes the bad block table(s) to
993 * the selected place.
994 *
995 * The bad block table memory is allocated here. It must be freed
996 * by calling the nand_free_bbt function.
997 *
998*/
David Woodhousee0c7d762006-05-13 18:07:53 +0100999int nand_scan_bbt(struct mtd_info *mtd, struct nand_bbt_descr *bd)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001000{
1001 struct nand_chip *this = mtd->priv;
1002 int len, res = 0;
1003 uint8_t *buf;
1004 struct nand_bbt_descr *td = this->bbt_td;
1005 struct nand_bbt_descr *md = this->bbt_md;
1006
1007 len = mtd->size >> (this->bbt_erase_shift + 2);
Burman Yan95b93a02006-11-15 21:10:29 +02001008 /* Allocate memory (2bit per block) and clear the memory bad block table */
1009 this->bbt = kzalloc(len, GFP_KERNEL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001010 if (!this->bbt) {
David Woodhousee0c7d762006-05-13 18:07:53 +01001011 printk(KERN_ERR "nand_scan_bbt: Out of memory\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -07001012 return -ENOMEM;
1013 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001014
1015 /* If no primary table decriptor is given, scan the device
1016 * to build a memory based bad block table
1017 */
Artem B. Bityuckiyeeada242005-02-11 10:14:15 +00001018 if (!td) {
1019 if ((res = nand_memory_bbt(mtd, bd))) {
David Woodhousee0c7d762006-05-13 18:07:53 +01001020 printk(KERN_ERR "nand_bbt: Can't scan flash and build the RAM-based BBT\n");
1021 kfree(this->bbt);
Artem B. Bityuckiyeeada242005-02-11 10:14:15 +00001022 this->bbt = NULL;
1023 }
1024 return res;
1025 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001026
1027 /* Allocate a temporary buffer for one eraseblock incl. oob */
1028 len = (1 << this->bbt_erase_shift);
1029 len += (len >> this->page_shift) * mtd->oobsize;
David Woodhousec3f8abf2006-05-13 04:03:42 +01001030 buf = vmalloc(len);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001031 if (!buf) {
David Woodhousee0c7d762006-05-13 18:07:53 +01001032 printk(KERN_ERR "nand_bbt: Out of memory\n");
1033 kfree(this->bbt);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001034 this->bbt = NULL;
1035 return -ENOMEM;
1036 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001037
Linus Torvalds1da177e2005-04-16 15:20:36 -07001038 /* Is the bbt at a given page ? */
1039 if (td->options & NAND_BBT_ABSPAGE) {
David Woodhousee0c7d762006-05-13 18:07:53 +01001040 res = read_abs_bbts(mtd, buf, td, md);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001041 } else {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001042 /* Search the bad block table using a pattern in oob */
David Woodhousee0c7d762006-05-13 18:07:53 +01001043 res = search_read_bbts(mtd, buf, td, md);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001044 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001045
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001046 if (res)
David Woodhousee0c7d762006-05-13 18:07:53 +01001047 res = check_create(mtd, buf, bd);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001048
Linus Torvalds1da177e2005-04-16 15:20:36 -07001049 /* Prevent the bbt regions from erasing / writing */
David Woodhousee0c7d762006-05-13 18:07:53 +01001050 mark_bbt_region(mtd, td);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001051 if (md)
David Woodhousee0c7d762006-05-13 18:07:53 +01001052 mark_bbt_region(mtd, md);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001053
David Woodhousee0c7d762006-05-13 18:07:53 +01001054 vfree(buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001055 return res;
1056}
1057
Linus Torvalds1da177e2005-04-16 15:20:36 -07001058/**
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001059 * nand_update_bbt - [NAND Interface] update bad block table(s)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001060 * @mtd: MTD device structure
1061 * @offs: the offset of the newly marked block
1062 *
1063 * The function updates the bad block table(s)
1064*/
David Woodhousee0c7d762006-05-13 18:07:53 +01001065int nand_update_bbt(struct mtd_info *mtd, loff_t offs)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001066{
1067 struct nand_chip *this = mtd->priv;
1068 int len, res = 0, writeops = 0;
1069 int chip, chipsel;
1070 uint8_t *buf;
1071 struct nand_bbt_descr *td = this->bbt_td;
1072 struct nand_bbt_descr *md = this->bbt_md;
1073
1074 if (!this->bbt || !td)
1075 return -EINVAL;
1076
Linus Torvalds1da177e2005-04-16 15:20:36 -07001077 /* Allocate a temporary buffer for one eraseblock incl. oob */
1078 len = (1 << this->bbt_erase_shift);
1079 len += (len >> this->page_shift) * mtd->oobsize;
David Woodhousee0c7d762006-05-13 18:07:53 +01001080 buf = kmalloc(len, GFP_KERNEL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001081 if (!buf) {
David Woodhousee0c7d762006-05-13 18:07:53 +01001082 printk(KERN_ERR "nand_update_bbt: Out of memory\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -07001083 return -ENOMEM;
1084 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001085
Linus Torvalds1da177e2005-04-16 15:20:36 -07001086 writeops = md != NULL ? 0x03 : 0x01;
1087
1088 /* Do we have a bbt per chip ? */
1089 if (td->options & NAND_BBT_PERCHIP) {
David Woodhousee0c7d762006-05-13 18:07:53 +01001090 chip = (int)(offs >> this->chip_shift);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001091 chipsel = chip;
1092 } else {
1093 chip = 0;
1094 chipsel = -1;
1095 }
1096
1097 td->version[chip]++;
1098 if (md)
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001099 md->version[chip]++;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001100
1101 /* Write the bad block table to the device ? */
1102 if ((writeops & 0x01) && (td->options & NAND_BBT_WRITE)) {
David Woodhousee0c7d762006-05-13 18:07:53 +01001103 res = write_bbt(mtd, buf, td, md, chipsel);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001104 if (res < 0)
1105 goto out;
1106 }
1107 /* Write the mirror bad block table to the device ? */
1108 if ((writeops & 0x02) && md && (md->options & NAND_BBT_WRITE)) {
David Woodhousee0c7d762006-05-13 18:07:53 +01001109 res = write_bbt(mtd, buf, md, td, chipsel);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001110 }
1111
David Woodhousee0c7d762006-05-13 18:07:53 +01001112 out:
1113 kfree(buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001114 return res;
1115}
1116
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001117/* Define some generic bad / good block scan pattern which are used
Artem B. Bityuckiy171650a2005-02-16 17:09:39 +00001118 * while scanning a device for factory marked good / bad blocks. */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001119static uint8_t scan_ff_pattern[] = { 0xff, 0xff };
1120
Linus Torvalds1da177e2005-04-16 15:20:36 -07001121static struct nand_bbt_descr smallpage_flashbased = {
David Woodhouse6943f8a2006-05-13 16:14:26 +01001122 .options = NAND_BBT_SCAN2NDPAGE,
Brian Norrisc7b28e22010-07-13 15:13:00 -07001123 .offs = NAND_SMALL_BADBLOCK_POS,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001124 .len = 1,
1125 .pattern = scan_ff_pattern
1126};
1127
1128static struct nand_bbt_descr largepage_flashbased = {
David Woodhouse6943f8a2006-05-13 16:14:26 +01001129 .options = NAND_BBT_SCAN2NDPAGE,
Brian Norrisc7b28e22010-07-13 15:13:00 -07001130 .offs = NAND_LARGE_BADBLOCK_POS,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001131 .len = 2,
1132 .pattern = scan_ff_pattern
1133};
1134
1135static uint8_t scan_agand_pattern[] = { 0x1C, 0x71, 0xC7, 0x1C, 0x71, 0xC7 };
1136
1137static struct nand_bbt_descr agand_flashbased = {
1138 .options = NAND_BBT_SCANEMPTY | NAND_BBT_SCANALLPAGES,
1139 .offs = 0x20,
1140 .len = 6,
1141 .pattern = scan_agand_pattern
1142};
1143
1144/* Generic flash bbt decriptors
1145*/
1146static uint8_t bbt_pattern[] = {'B', 'b', 't', '0' };
1147static uint8_t mirror_pattern[] = {'1', 't', 'b', 'B' };
1148
1149static struct nand_bbt_descr bbt_main_descr = {
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001150 .options = NAND_BBT_LASTBLOCK | NAND_BBT_CREATE | NAND_BBT_WRITE
Linus Torvalds1da177e2005-04-16 15:20:36 -07001151 | NAND_BBT_2BIT | NAND_BBT_VERSION | NAND_BBT_PERCHIP,
1152 .offs = 8,
1153 .len = 4,
1154 .veroffs = 12,
1155 .maxblocks = 4,
1156 .pattern = bbt_pattern
1157};
1158
1159static struct nand_bbt_descr bbt_mirror_descr = {
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001160 .options = NAND_BBT_LASTBLOCK | NAND_BBT_CREATE | NAND_BBT_WRITE
Linus Torvalds1da177e2005-04-16 15:20:36 -07001161 | NAND_BBT_2BIT | NAND_BBT_VERSION | NAND_BBT_PERCHIP,
1162 .offs = 8,
1163 .len = 4,
1164 .veroffs = 12,
1165 .maxblocks = 4,
1166 .pattern = mirror_pattern
1167};
1168
Brian Norris58373ff2010-07-15 12:15:44 -07001169#define BBT_SCAN_OPTIONS (NAND_BBT_SCANLASTPAGE | NAND_BBT_SCAN2NDPAGE | \
1170 NAND_BBT_SCANBYTE1AND6)
1171/**
1172 * nand_create_default_bbt_descr - [Internal] Creates a BBT descriptor structure
1173 * @this: NAND chip to create descriptor for
1174 *
1175 * This function allocates and initializes a nand_bbt_descr for BBM detection
1176 * based on the properties of "this". The new descriptor is stored in
1177 * this->badblock_pattern. Thus, this->badblock_pattern should be NULL when
1178 * passed to this function.
1179 *
1180 * TODO: Handle other flags, replace other static structs
1181 * (e.g. handle NAND_BBT_FLASH for flash-based BBT,
1182 * replace smallpage_flashbased)
1183 *
1184 */
1185static int nand_create_default_bbt_descr(struct nand_chip *this)
1186{
1187 struct nand_bbt_descr *bd;
1188 if (this->badblock_pattern) {
1189 printk(KERN_WARNING "BBT descr already allocated; not replacing.\n");
1190 return -EINVAL;
1191 }
1192 bd = kzalloc(sizeof(*bd), GFP_KERNEL);
1193 if (!bd) {
1194 printk(KERN_ERR "nand_create_default_bbt_descr: Out of memory\n");
1195 return -ENOMEM;
1196 }
1197 bd->options = this->options & BBT_SCAN_OPTIONS;
1198 bd->offs = this->badblockpos;
1199 bd->len = (this->options & NAND_BUSWIDTH_16) ? 2 : 1;
1200 bd->pattern = scan_ff_pattern;
1201 bd->options |= NAND_BBT_DYNAMICSTRUCT;
1202 this->badblock_pattern = bd;
1203 return 0;
1204}
1205
Linus Torvalds1da177e2005-04-16 15:20:36 -07001206/**
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001207 * nand_default_bbt - [NAND Interface] Select a default bad block table for the device
Linus Torvalds1da177e2005-04-16 15:20:36 -07001208 * @mtd: MTD device structure
1209 *
1210 * This function selects the default bad block table
1211 * support for the device and calls the nand_scan_bbt function
1212 *
1213*/
David Woodhousee0c7d762006-05-13 18:07:53 +01001214int nand_default_bbt(struct mtd_info *mtd)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001215{
1216 struct nand_chip *this = mtd->priv;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001217
1218 /* Default for AG-AND. We must use a flash based
Linus Torvalds1da177e2005-04-16 15:20:36 -07001219 * bad block table as the devices have factory marked
1220 * _good_ blocks. Erasing those blocks leads to loss
1221 * of the good / bad information, so we _must_ store
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001222 * this information in a good / bad table during
Linus Torvalds1da177e2005-04-16 15:20:36 -07001223 * startup
David Woodhousee0c7d762006-05-13 18:07:53 +01001224 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001225 if (this->options & NAND_IS_AND) {
1226 /* Use the default pattern descriptors */
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001227 if (!this->bbt_td) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001228 this->bbt_td = &bbt_main_descr;
1229 this->bbt_md = &bbt_mirror_descr;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001230 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001231 this->options |= NAND_USE_FLASH_BBT;
David Woodhousee0c7d762006-05-13 18:07:53 +01001232 return nand_scan_bbt(mtd, &agand_flashbased);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001233 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001234
Linus Torvalds1da177e2005-04-16 15:20:36 -07001235 /* Is a flash based bad block table requested ? */
1236 if (this->options & NAND_USE_FLASH_BBT) {
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001237 /* Use the default pattern descriptors */
1238 if (!this->bbt_td) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001239 this->bbt_td = &bbt_main_descr;
1240 this->bbt_md = &bbt_mirror_descr;
1241 }
1242 if (!this->badblock_pattern) {
Joern Engel28318772006-05-22 23:18:05 +02001243 this->badblock_pattern = (mtd->writesize > 512) ? &largepage_flashbased : &smallpage_flashbased;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001244 }
1245 } else {
1246 this->bbt_td = NULL;
1247 this->bbt_md = NULL;
Brian Norris58373ff2010-07-15 12:15:44 -07001248 if (!this->badblock_pattern)
1249 nand_create_default_bbt_descr(this);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001250 }
David Woodhousee0c7d762006-05-13 18:07:53 +01001251 return nand_scan_bbt(mtd, this->badblock_pattern);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001252}
1253
1254/**
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001255 * nand_isbad_bbt - [NAND Interface] Check if a block is bad
Linus Torvalds1da177e2005-04-16 15:20:36 -07001256 * @mtd: MTD device structure
1257 * @offs: offset in the device
1258 * @allowbbt: allow access to bad block table region
1259 *
1260*/
David Woodhousee0c7d762006-05-13 18:07:53 +01001261int nand_isbad_bbt(struct mtd_info *mtd, loff_t offs, int allowbbt)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001262{
1263 struct nand_chip *this = mtd->priv;
1264 int block;
David Woodhousee0c7d762006-05-13 18:07:53 +01001265 uint8_t res;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001266
Linus Torvalds1da177e2005-04-16 15:20:36 -07001267 /* Get block number * 2 */
David Woodhousee0c7d762006-05-13 18:07:53 +01001268 block = (int)(offs >> (this->bbt_erase_shift - 1));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001269 res = (this->bbt[block >> 3] >> (block & 0x06)) & 0x03;
1270
David Woodhousee0c7d762006-05-13 18:07:53 +01001271 DEBUG(MTD_DEBUG_LEVEL2, "nand_isbad_bbt(): bbt info for offs 0x%08x: (block %d) 0x%02x\n",
1272 (unsigned int)offs, block >> 1, res);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001273
1274 switch ((int)res) {
David Woodhousee0c7d762006-05-13 18:07:53 +01001275 case 0x00:
1276 return 0;
1277 case 0x01:
1278 return 1;
1279 case 0x02:
1280 return allowbbt ? 0 : 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001281 }
1282 return 1;
1283}
1284
David Woodhousee0c7d762006-05-13 18:07:53 +01001285EXPORT_SYMBOL(nand_scan_bbt);
1286EXPORT_SYMBOL(nand_default_bbt);