blob: 469de17107e5f7f5cecdbb300ebe3ca3175414b6 [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>
58#include <linux/mtd/compatmac.h>
59#include <linux/bitops.h>
60#include <linux/delay.h>
David Woodhousec3f8abf2006-05-13 04:03:42 +010061#include <linux/vmalloc.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070062
Thomas Gleixner61b03bd2005-11-07 11:15:49 +000063/**
Linus Torvalds1da177e2005-04-16 15:20:36 -070064 * check_pattern - [GENERIC] check if a pattern is in the buffer
65 * @buf: the buffer to search
66 * @len: the length of buffer to search
67 * @paglen: the pagelength
68 * @td: search pattern descriptor
69 *
70 * Check for a pattern at the given place. Used to search bad block
71 * tables and good / bad block identifiers.
72 * If the SCAN_EMPTY option is set then check, if all bytes except the
73 * pattern area contain 0xff
74 *
75*/
David Woodhousee0c7d762006-05-13 18:07:53 +010076static int check_pattern(uint8_t *buf, int len, int paglen, struct nand_bbt_descr *td)
Linus Torvalds1da177e2005-04-16 15:20:36 -070077{
Artem B. Bityuckiy171650a2005-02-16 17:09:39 +000078 int i, end = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -070079 uint8_t *p = buf;
80
Thomas Gleixnerc9e053652005-06-14 16:39:57 +010081 end = paglen + td->offs;
Linus Torvalds1da177e2005-04-16 15:20:36 -070082 if (td->options & NAND_BBT_SCANEMPTY) {
83 for (i = 0; i < end; i++) {
84 if (p[i] != 0xff)
85 return -1;
86 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +000087 }
Thomas Gleixnerc9e053652005-06-14 16:39:57 +010088 p += end;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +000089
Linus Torvalds1da177e2005-04-16 15:20:36 -070090 /* Compare the pattern */
91 for (i = 0; i < td->len; i++) {
92 if (p[i] != td->pattern[i])
93 return -1;
94 }
95
Brian Norris58373ff2010-07-15 12:15:44 -070096 /* Check both positions 1 and 6 for pattern? */
97 if (td->options & NAND_BBT_SCANBYTE1AND6) {
98 if (td->options & NAND_BBT_SCANEMPTY) {
99 p += td->len;
100 end += NAND_SMALL_BADBLOCK_POS - td->offs;
101 /* Check region between positions 1 and 6 */
102 for (i = 0; i < NAND_SMALL_BADBLOCK_POS - td->offs - td->len;
103 i++) {
104 if (*p++ != 0xff)
105 return -1;
106 }
107 }
108 else {
109 p += NAND_SMALL_BADBLOCK_POS - td->offs;
110 }
111 /* Compare the pattern */
112 for (i = 0; i < td->len; i++) {
113 if (p[i] != td->pattern[i])
114 return -1;
115 }
116 }
117
Linus Torvalds1da177e2005-04-16 15:20:36 -0700118 if (td->options & NAND_BBT_SCANEMPTY) {
Artem B. Bityuckiy171650a2005-02-16 17:09:39 +0000119 p += td->len;
120 end += td->len;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700121 for (i = end; i < len; i++) {
122 if (*p++ != 0xff)
123 return -1;
124 }
125 }
126 return 0;
127}
128
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000129/**
Thomas Gleixnerc9e053652005-06-14 16:39:57 +0100130 * check_short_pattern - [GENERIC] check if a pattern is in the buffer
131 * @buf: the buffer to search
Thomas Gleixnerc9e053652005-06-14 16:39:57 +0100132 * @td: search pattern descriptor
133 *
134 * Check for a pattern at the given place. Used to search bad block
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000135 * tables and good / bad block identifiers. Same as check_pattern, but
Thomas Gleixner19870da2005-07-15 14:53:51 +0100136 * no optional empty check
Thomas Gleixnerc9e053652005-06-14 16:39:57 +0100137 *
138*/
David Woodhousee0c7d762006-05-13 18:07:53 +0100139static int check_short_pattern(uint8_t *buf, struct nand_bbt_descr *td)
Thomas Gleixnerc9e053652005-06-14 16:39:57 +0100140{
141 int i;
142 uint8_t *p = buf;
143
144 /* Compare the pattern */
145 for (i = 0; i < td->len; i++) {
Thomas Gleixner19870da2005-07-15 14:53:51 +0100146 if (p[td->offs + i] != td->pattern[i])
Thomas Gleixnerc9e053652005-06-14 16:39:57 +0100147 return -1;
148 }
Brian Norris58373ff2010-07-15 12:15:44 -0700149 /* Need to check location 1 AND 6? */
150 if (td->options & NAND_BBT_SCANBYTE1AND6) {
151 for (i = 0; i < td->len; i++) {
152 if (p[NAND_SMALL_BADBLOCK_POS + i] != td->pattern[i])
153 return -1;
154 }
155 }
Thomas Gleixnerc9e053652005-06-14 16:39:57 +0100156 return 0;
157}
158
Linus Torvalds1da177e2005-04-16 15:20:36 -0700159/**
160 * read_bbt - [GENERIC] Read the bad block table starting from page
161 * @mtd: MTD device structure
162 * @buf: temporary buffer
163 * @page: the starting page
164 * @num: the number of bbt descriptors to read
165 * @bits: number of bits per block
166 * @offs: offset in the memory table
167 * @reserved_block_code: Pattern to identify reserved blocks
168 *
169 * Read the bad block table starting from page.
170 *
171 */
David Woodhousee0c7d762006-05-13 18:07:53 +0100172static int read_bbt(struct mtd_info *mtd, uint8_t *buf, int page, int num,
173 int bits, int offs, int reserved_block_code)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700174{
175 int res, i, j, act = 0;
176 struct nand_chip *this = mtd->priv;
177 size_t retlen, len, totlen;
178 loff_t from;
179 uint8_t msk = (uint8_t) ((1 << bits) - 1);
180
181 totlen = (num * bits) >> 3;
David Woodhousee0c7d762006-05-13 18:07:53 +0100182 from = ((loff_t) page) << this->page_shift;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000183
Linus Torvalds1da177e2005-04-16 15:20:36 -0700184 while (totlen) {
David Woodhousee0c7d762006-05-13 18:07:53 +0100185 len = min(totlen, (size_t) (1 << this->bbt_erase_shift));
Thomas Gleixner9223a452006-05-23 17:21:03 +0200186 res = mtd->read(mtd, from, len, &retlen, buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700187 if (res < 0) {
188 if (retlen != len) {
David Woodhousee0c7d762006-05-13 18:07:53 +0100189 printk(KERN_INFO "nand_bbt: Error reading bad block table\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700190 return res;
191 }
David Woodhousee0c7d762006-05-13 18:07:53 +0100192 printk(KERN_WARNING "nand_bbt: ECC error while reading bad block table\n");
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000193 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700194
195 /* Analyse data */
196 for (i = 0; i < len; i++) {
197 uint8_t dat = buf[i];
198 for (j = 0; j < 8; j += bits, act += 2) {
199 uint8_t tmp = (dat >> j) & msk;
200 if (tmp == msk)
201 continue;
David Woodhousee0c7d762006-05-13 18:07:53 +0100202 if (reserved_block_code && (tmp == reserved_block_code)) {
Adrian Hunter69423d92008-12-10 13:37:21 +0000203 printk(KERN_DEBUG "nand_read_bbt: Reserved block at 0x%012llx\n",
204 (loff_t)((offs << 2) + (act >> 1)) << this->bbt_erase_shift);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700205 this->bbt[offs + (act >> 3)] |= 0x2 << (act & 0x06);
Thomas Gleixnerf1a28c02006-05-30 00:37:34 +0200206 mtd->ecc_stats.bbtblocks++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700207 continue;
208 }
209 /* Leave it for now, if its matured we can move this
210 * message to MTD_DEBUG_LEVEL0 */
Adrian Hunter69423d92008-12-10 13:37:21 +0000211 printk(KERN_DEBUG "nand_read_bbt: Bad block at 0x%012llx\n",
212 (loff_t)((offs << 2) + (act >> 1)) << this->bbt_erase_shift);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000213 /* Factory marked bad or worn out ? */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700214 if (tmp == 0)
215 this->bbt[offs + (act >> 3)] |= 0x3 << (act & 0x06);
216 else
217 this->bbt[offs + (act >> 3)] |= 0x1 << (act & 0x06);
Thomas Gleixnerf1a28c02006-05-30 00:37:34 +0200218 mtd->ecc_stats.badblocks++;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000219 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700220 }
221 totlen -= len;
222 from += len;
223 }
224 return 0;
225}
226
227/**
228 * read_abs_bbt - [GENERIC] Read the bad block table starting at a given page
229 * @mtd: MTD device structure
230 * @buf: temporary buffer
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000231 * @td: descriptor for the bad block table
Linus Torvalds1da177e2005-04-16 15:20:36 -0700232 * @chip: read the table for a specific chip, -1 read all chips.
233 * Applies only if NAND_BBT_PERCHIP option is set
234 *
235 * Read the bad block table for all chips starting at a given page
236 * We assume that the bbt bits are in consecutive order.
237*/
David Woodhousee0c7d762006-05-13 18:07:53 +0100238static 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 -0700239{
240 struct nand_chip *this = mtd->priv;
241 int res = 0, i;
242 int bits;
243
244 bits = td->options & NAND_BBT_NRBITS_MSK;
245 if (td->options & NAND_BBT_PERCHIP) {
246 int offs = 0;
247 for (i = 0; i < this->numchips; i++) {
248 if (chip == -1 || chip == i)
249 res = read_bbt (mtd, buf, td->pages[i], this->chipsize >> this->bbt_erase_shift, bits, offs, td->reserved_block_code);
250 if (res)
251 return res;
252 offs += this->chipsize >> (this->bbt_erase_shift + 2);
253 }
254 } else {
255 res = read_bbt (mtd, buf, td->pages[0], mtd->size >> this->bbt_erase_shift, bits, 0, td->reserved_block_code);
256 if (res)
257 return res;
258 }
259 return 0;
260}
261
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200262/*
263 * Scan read raw data from flash
264 */
265static int scan_read_raw(struct mtd_info *mtd, uint8_t *buf, loff_t offs,
266 size_t len)
267{
268 struct mtd_oob_ops ops;
Maxim Levitskyb64d39d2010-02-22 20:39:37 +0200269 int res;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200270
271 ops.mode = MTD_OOB_RAW;
272 ops.ooboffs = 0;
273 ops.ooblen = mtd->oobsize;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200274
Maxim Levitskyb64d39d2010-02-22 20:39:37 +0200275
276 while (len > 0) {
277 if (len <= mtd->writesize) {
278 ops.oobbuf = buf + len;
279 ops.datbuf = buf;
280 ops.len = len;
281 return mtd->read_oob(mtd, offs, &ops);
282 } else {
283 ops.oobbuf = buf + mtd->writesize;
284 ops.datbuf = buf;
285 ops.len = mtd->writesize;
286 res = mtd->read_oob(mtd, offs, &ops);
287
288 if (res)
289 return res;
290 }
291
292 buf += mtd->oobsize + mtd->writesize;
293 len -= mtd->writesize;
294 }
295 return 0;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200296}
297
298/*
299 * Scan write data with oob to flash
300 */
301static int scan_write_bbt(struct mtd_info *mtd, loff_t offs, size_t len,
302 uint8_t *buf, uint8_t *oob)
303{
304 struct mtd_oob_ops ops;
305
306 ops.mode = MTD_OOB_PLACE;
307 ops.ooboffs = 0;
308 ops.ooblen = mtd->oobsize;
309 ops.datbuf = buf;
310 ops.oobbuf = oob;
311 ops.len = len;
312
313 return mtd->write_oob(mtd, offs, &ops);
314}
315
Linus Torvalds1da177e2005-04-16 15:20:36 -0700316/**
317 * read_abs_bbts - [GENERIC] Read the bad block table(s) for all chips starting at a given page
318 * @mtd: MTD device structure
319 * @buf: temporary buffer
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000320 * @td: descriptor for the bad block table
Linus Torvalds1da177e2005-04-16 15:20:36 -0700321 * @md: descriptor for the bad block table mirror
322 *
323 * Read the bad block table(s) for all chips starting at a given page
324 * We assume that the bbt bits are in consecutive order.
325 *
326*/
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200327static int read_abs_bbts(struct mtd_info *mtd, uint8_t *buf,
328 struct nand_bbt_descr *td, struct nand_bbt_descr *md)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700329{
330 struct nand_chip *this = mtd->priv;
331
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000332 /* Read the primary version, if available */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700333 if (td->options & NAND_BBT_VERSION) {
Adrian Hunter69423d92008-12-10 13:37:21 +0000334 scan_read_raw(mtd, buf, (loff_t)td->pages[0] << this->page_shift,
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200335 mtd->writesize);
Joern Engel28318772006-05-22 23:18:05 +0200336 td->version[0] = buf[mtd->writesize + td->veroffs];
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200337 printk(KERN_DEBUG "Bad block table at page %d, version 0x%02X\n",
338 td->pages[0], td->version[0]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700339 }
340
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000341 /* Read the mirror version, if available */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700342 if (md && (md->options & NAND_BBT_VERSION)) {
Adrian Hunter69423d92008-12-10 13:37:21 +0000343 scan_read_raw(mtd, buf, (loff_t)md->pages[0] << this->page_shift,
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200344 mtd->writesize);
Joern Engel28318772006-05-22 23:18:05 +0200345 md->version[0] = buf[mtd->writesize + md->veroffs];
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200346 printk(KERN_DEBUG "Bad block table at page %d, version 0x%02X\n",
347 md->pages[0], md->version[0]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700348 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700349 return 1;
350}
351
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200352/*
353 * Scan a given block full
354 */
355static int scan_block_full(struct mtd_info *mtd, struct nand_bbt_descr *bd,
356 loff_t offs, uint8_t *buf, size_t readlen,
357 int scanlen, int len)
358{
359 int ret, j;
360
361 ret = scan_read_raw(mtd, buf, offs, readlen);
362 if (ret)
363 return ret;
364
365 for (j = 0; j < len; j++, buf += scanlen) {
366 if (check_pattern(buf, scanlen, mtd->writesize, bd))
367 return 1;
368 }
369 return 0;
370}
371
372/*
373 * Scan a given block partially
374 */
375static int scan_block_fast(struct mtd_info *mtd, struct nand_bbt_descr *bd,
376 loff_t offs, uint8_t *buf, int len)
377{
378 struct mtd_oob_ops ops;
379 int j, ret;
380
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200381 ops.ooblen = mtd->oobsize;
382 ops.oobbuf = buf;
383 ops.ooboffs = 0;
384 ops.datbuf = NULL;
385 ops.mode = MTD_OOB_PLACE;
386
387 for (j = 0; j < len; j++) {
388 /*
389 * Read the full oob until read_oob is fixed to
390 * handle single byte reads for 16 bit
391 * buswidth
392 */
393 ret = mtd->read_oob(mtd, offs, &ops);
394 if (ret)
395 return ret;
396
397 if (check_short_pattern(buf, bd))
398 return 1;
399
400 offs += mtd->writesize;
401 }
402 return 0;
403}
404
Linus Torvalds1da177e2005-04-16 15:20:36 -0700405/**
406 * create_bbt - [GENERIC] Create a bad block table by scanning the device
407 * @mtd: MTD device structure
408 * @buf: temporary buffer
409 * @bd: descriptor for the good/bad block search pattern
410 * @chip: create the table for a specific chip, -1 read all chips.
411 * Applies only if NAND_BBT_PERCHIP option is set
412 *
413 * Create a bad block table by scanning the device
414 * for the given good/bad block identify pattern
415 */
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200416static int create_bbt(struct mtd_info *mtd, uint8_t *buf,
417 struct nand_bbt_descr *bd, int chip)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700418{
419 struct nand_chip *this = mtd->priv;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200420 int i, numblocks, len, scanlen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700421 int startblock;
422 loff_t from;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200423 size_t readlen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700424
David Woodhousee0c7d762006-05-13 18:07:53 +0100425 printk(KERN_INFO "Scanning device for bad blocks\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700426
427 if (bd->options & NAND_BBT_SCANALLPAGES)
428 len = 1 << (this->bbt_erase_shift - this->page_shift);
Brian Norris58373ff2010-07-15 12:15:44 -0700429 else if (bd->options & NAND_BBT_SCAN2NDPAGE)
430 len = 2;
431 else
432 len = 1;
Artem B. Bityuckiy171650a2005-02-16 17:09:39 +0000433
434 if (!(bd->options & NAND_BBT_SCANEMPTY)) {
435 /* We need only read few bytes from the OOB area */
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200436 scanlen = 0;
Artem B. Bityuckiyeeada242005-02-11 10:14:15 +0000437 readlen = bd->len;
438 } else {
Artem B. Bityuckiy171650a2005-02-16 17:09:39 +0000439 /* Full page content should be read */
Joern Engel28318772006-05-22 23:18:05 +0200440 scanlen = mtd->writesize + mtd->oobsize;
441 readlen = len * mtd->writesize;
Artem B. Bityuckiyeeada242005-02-11 10:14:15 +0000442 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700443
444 if (chip == -1) {
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200445 /* Note that numblocks is 2 * (real numblocks) here, see i+=2
446 * below as it makes shifting and masking less painful */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700447 numblocks = mtd->size >> (this->bbt_erase_shift - 1);
448 startblock = 0;
449 from = 0;
450 } else {
451 if (chip >= this->numchips) {
David Woodhousee0c7d762006-05-13 18:07:53 +0100452 printk(KERN_WARNING "create_bbt(): chipnr (%d) > available chips (%d)\n",
453 chip + 1, this->numchips);
Artem B. Bityuckiy171650a2005-02-16 17:09:39 +0000454 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700455 }
456 numblocks = this->chipsize >> (this->bbt_erase_shift - 1);
457 startblock = chip * numblocks;
458 numblocks += startblock;
Adrian Hunter69423d92008-12-10 13:37:21 +0000459 from = (loff_t)startblock << (this->bbt_erase_shift - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700460 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000461
Brian Norris30fe8112010-06-23 13:36:02 -0700462 if (this->options & NAND_BBT_SCANLASTPAGE)
Kevin Cernekeeb60b08b2010-05-04 20:58:10 -0700463 from += mtd->erasesize - (mtd->writesize * len);
464
Linus Torvalds1da177e2005-04-16 15:20:36 -0700465 for (i = startblock; i < numblocks;) {
Artem B. Bityuckiyeeada242005-02-11 10:14:15 +0000466 int ret;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000467
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200468 if (bd->options & NAND_BBT_SCANALLPAGES)
469 ret = scan_block_full(mtd, bd, from, buf, readlen,
470 scanlen, len);
471 else
472 ret = scan_block_fast(mtd, bd, from, buf, len);
Artem B. Bityuckiy171650a2005-02-16 17:09:39 +0000473
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200474 if (ret < 0)
475 return ret;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000476
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200477 if (ret) {
478 this->bbt[i >> 3] |= 0x03 << (i & 0x6);
Adrian Hunter69423d92008-12-10 13:37:21 +0000479 printk(KERN_WARNING "Bad eraseblock %d at 0x%012llx\n",
480 i >> 1, (unsigned long long)from);
Thomas Gleixnerf1a28c02006-05-30 00:37:34 +0200481 mtd->ecc_stats.badblocks++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700482 }
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200483
Linus Torvalds1da177e2005-04-16 15:20:36 -0700484 i += 2;
485 from += (1 << this->bbt_erase_shift);
486 }
Artem B. Bityuckiyeeada242005-02-11 10:14:15 +0000487 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700488}
489
490/**
491 * search_bbt - [GENERIC] scan the device for a specific bad block table
492 * @mtd: MTD device structure
493 * @buf: temporary buffer
494 * @td: descriptor for the bad block table
495 *
496 * Read the bad block table by searching for a given ident pattern.
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000497 * Search is preformed either from the beginning up or from the end of
Linus Torvalds1da177e2005-04-16 15:20:36 -0700498 * the device downwards. The search starts always at the start of a
499 * block.
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000500 * If the option NAND_BBT_PERCHIP is given, each chip is searched
Linus Torvalds1da177e2005-04-16 15:20:36 -0700501 * for a bbt, which contains the bad block information of this chip.
David Woodhousee0c7d762006-05-13 18:07:53 +0100502 * This is necessary to provide support for certain DOC devices.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700503 *
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000504 * The bbt ident pattern resides in the oob area of the first page
505 * in a block.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700506 */
David Woodhousee0c7d762006-05-13 18:07:53 +0100507static int search_bbt(struct mtd_info *mtd, uint8_t *buf, struct nand_bbt_descr *td)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700508{
509 struct nand_chip *this = mtd->priv;
510 int i, chips;
511 int bits, startblock, block, dir;
Joern Engel28318772006-05-22 23:18:05 +0200512 int scanlen = mtd->writesize + mtd->oobsize;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700513 int bbtblocks;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200514 int blocktopage = this->bbt_erase_shift - this->page_shift;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700515
516 /* Search direction top -> down ? */
517 if (td->options & NAND_BBT_LASTBLOCK) {
David Woodhousee0c7d762006-05-13 18:07:53 +0100518 startblock = (mtd->size >> this->bbt_erase_shift) - 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700519 dir = -1;
520 } else {
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000521 startblock = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700522 dir = 1;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000523 }
524
Linus Torvalds1da177e2005-04-16 15:20:36 -0700525 /* Do we have a bbt per chip ? */
526 if (td->options & NAND_BBT_PERCHIP) {
527 chips = this->numchips;
528 bbtblocks = this->chipsize >> this->bbt_erase_shift;
529 startblock &= bbtblocks - 1;
530 } else {
531 chips = 1;
532 bbtblocks = mtd->size >> this->bbt_erase_shift;
533 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000534
Linus Torvalds1da177e2005-04-16 15:20:36 -0700535 /* Number of bits for each erase block in the bbt */
536 bits = td->options & NAND_BBT_NRBITS_MSK;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000537
Linus Torvalds1da177e2005-04-16 15:20:36 -0700538 for (i = 0; i < chips; i++) {
539 /* Reset version information */
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000540 td->version[i] = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700541 td->pages[i] = -1;
542 /* Scan the maximum number of blocks */
543 for (block = 0; block < td->maxblocks; block++) {
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200544
Linus Torvalds1da177e2005-04-16 15:20:36 -0700545 int actblock = startblock + dir * block;
Adrian Hunter69423d92008-12-10 13:37:21 +0000546 loff_t offs = (loff_t)actblock << this->bbt_erase_shift;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200547
Linus Torvalds1da177e2005-04-16 15:20:36 -0700548 /* Read first page */
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200549 scan_read_raw(mtd, buf, offs, mtd->writesize);
Joern Engel28318772006-05-22 23:18:05 +0200550 if (!check_pattern(buf, scanlen, mtd->writesize, td)) {
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200551 td->pages[i] = actblock << blocktopage;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700552 if (td->options & NAND_BBT_VERSION) {
Joern Engel28318772006-05-22 23:18:05 +0200553 td->version[i] = buf[mtd->writesize + td->veroffs];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700554 }
555 break;
556 }
557 }
558 startblock += this->chipsize >> this->bbt_erase_shift;
559 }
560 /* Check, if we found a bbt for each requested chip */
561 for (i = 0; i < chips; i++) {
562 if (td->pages[i] == -1)
David Woodhousee0c7d762006-05-13 18:07:53 +0100563 printk(KERN_WARNING "Bad block table not found for chip %d\n", i);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700564 else
David Woodhousee0c7d762006-05-13 18:07:53 +0100565 printk(KERN_DEBUG "Bad block table found at page %d, version 0x%02X\n", td->pages[i],
566 td->version[i]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700567 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000568 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700569}
570
571/**
572 * search_read_bbts - [GENERIC] scan the device for bad block table(s)
573 * @mtd: MTD device structure
574 * @buf: temporary buffer
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000575 * @td: descriptor for the bad block table
Linus Torvalds1da177e2005-04-16 15:20:36 -0700576 * @md: descriptor for the bad block table mirror
577 *
578 * Search and read the bad block table(s)
579*/
David Woodhousee0c7d762006-05-13 18:07:53 +0100580static 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 -0700581{
582 /* Search the primary table */
David Woodhousee0c7d762006-05-13 18:07:53 +0100583 search_bbt(mtd, buf, td);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000584
Linus Torvalds1da177e2005-04-16 15:20:36 -0700585 /* Search the mirror table */
586 if (md)
David Woodhousee0c7d762006-05-13 18:07:53 +0100587 search_bbt(mtd, buf, md);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700588
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000589 /* Force result check */
590 return 1;
591}
592
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000593/**
Linus Torvalds1da177e2005-04-16 15:20:36 -0700594 * write_bbt - [GENERIC] (Re)write the bad block table
595 *
596 * @mtd: MTD device structure
597 * @buf: temporary buffer
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000598 * @td: descriptor for the bad block table
Linus Torvalds1da177e2005-04-16 15:20:36 -0700599 * @md: descriptor for the bad block table mirror
600 * @chipsel: selector for a specific chip, -1 for all
601 *
602 * (Re)write the bad block table
603 *
604*/
David Woodhousee0c7d762006-05-13 18:07:53 +0100605static int write_bbt(struct mtd_info *mtd, uint8_t *buf,
Thomas Gleixner9223a452006-05-23 17:21:03 +0200606 struct nand_bbt_descr *td, struct nand_bbt_descr *md,
607 int chipsel)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700608{
609 struct nand_chip *this = mtd->priv;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700610 struct erase_info einfo;
611 int i, j, res, chip = 0;
612 int bits, startblock, dir, page, offs, numblocks, sft, sftmsk;
Thomas Gleixner9223a452006-05-23 17:21:03 +0200613 int nrchips, bbtoffs, pageoffs, ooboffs;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700614 uint8_t msk[4];
615 uint8_t rcode = td->reserved_block_code;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200616 size_t retlen, len = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700617 loff_t to;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200618 struct mtd_oob_ops ops;
619
620 ops.ooblen = mtd->oobsize;
621 ops.ooboffs = 0;
622 ops.datbuf = NULL;
623 ops.mode = MTD_OOB_PLACE;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700624
625 if (!rcode)
626 rcode = 0xff;
627 /* Write bad block table per chip rather than per device ? */
628 if (td->options & NAND_BBT_PERCHIP) {
David Woodhousee0c7d762006-05-13 18:07:53 +0100629 numblocks = (int)(this->chipsize >> this->bbt_erase_shift);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000630 /* Full device write or specific chip ? */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700631 if (chipsel == -1) {
632 nrchips = this->numchips;
633 } else {
634 nrchips = chipsel + 1;
635 chip = chipsel;
636 }
637 } else {
David Woodhousee0c7d762006-05-13 18:07:53 +0100638 numblocks = (int)(mtd->size >> this->bbt_erase_shift);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700639 nrchips = 1;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000640 }
641
Linus Torvalds1da177e2005-04-16 15:20:36 -0700642 /* Loop through the chips */
643 for (; chip < nrchips; chip++) {
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000644
645 /* There was already a version of the table, reuse the page
646 * This applies for absolute placement too, as we have the
Linus Torvalds1da177e2005-04-16 15:20:36 -0700647 * page nr. in td->pages.
648 */
649 if (td->pages[chip] != -1) {
650 page = td->pages[chip];
651 goto write;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000652 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700653
654 /* Automatic placement of the bad block table */
655 /* Search direction top -> down ? */
656 if (td->options & NAND_BBT_LASTBLOCK) {
657 startblock = numblocks * (chip + 1) - 1;
658 dir = -1;
659 } else {
660 startblock = chip * numblocks;
661 dir = 1;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000662 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700663
664 for (i = 0; i < td->maxblocks; i++) {
665 int block = startblock + dir * i;
666 /* Check, if the block is bad */
Thomas Gleixner9223a452006-05-23 17:21:03 +0200667 switch ((this->bbt[block >> 2] >>
668 (2 * (block & 0x03))) & 0x03) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700669 case 0x01:
670 case 0x03:
671 continue;
672 }
Thomas Gleixner9223a452006-05-23 17:21:03 +0200673 page = block <<
674 (this->bbt_erase_shift - this->page_shift);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700675 /* Check, if the block is used by the mirror table */
676 if (!md || md->pages[chip] != page)
677 goto write;
678 }
David Woodhousee0c7d762006-05-13 18:07:53 +0100679 printk(KERN_ERR "No space left to write bad block table\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700680 return -ENOSPC;
David Woodhousee0c7d762006-05-13 18:07:53 +0100681 write:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700682
683 /* Set up shift count and masks for the flash table */
684 bits = td->options & NAND_BBT_NRBITS_MSK;
Thomas Gleixner9223a452006-05-23 17:21:03 +0200685 msk[2] = ~rcode;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700686 switch (bits) {
Thomas Gleixner9223a452006-05-23 17:21:03 +0200687 case 1: sft = 3; sftmsk = 0x07; msk[0] = 0x00; msk[1] = 0x01;
688 msk[3] = 0x01;
689 break;
690 case 2: sft = 2; sftmsk = 0x06; msk[0] = 0x00; msk[1] = 0x01;
691 msk[3] = 0x03;
692 break;
693 case 4: sft = 1; sftmsk = 0x04; msk[0] = 0x00; msk[1] = 0x0C;
694 msk[3] = 0x0f;
695 break;
696 case 8: sft = 0; sftmsk = 0x00; msk[0] = 0x00; msk[1] = 0x0F;
697 msk[3] = 0xff;
698 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700699 default: return -EINVAL;
700 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000701
Linus Torvalds1da177e2005-04-16 15:20:36 -0700702 bbtoffs = chip * (numblocks >> 2);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000703
Linus Torvalds1da177e2005-04-16 15:20:36 -0700704 to = ((loff_t) page) << this->page_shift;
705
Linus Torvalds1da177e2005-04-16 15:20:36 -0700706 /* Must we save the block contents ? */
707 if (td->options & NAND_BBT_SAVECONTENT) {
708 /* Make it block aligned */
709 to &= ~((loff_t) ((1 << this->bbt_erase_shift) - 1));
710 len = 1 << this->bbt_erase_shift;
Thomas Gleixner9223a452006-05-23 17:21:03 +0200711 res = mtd->read(mtd, to, len, &retlen, buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700712 if (res < 0) {
713 if (retlen != len) {
Thomas Gleixner9223a452006-05-23 17:21:03 +0200714 printk(KERN_INFO "nand_bbt: Error "
715 "reading block for writing "
716 "the bad block table\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700717 return res;
718 }
Thomas Gleixner9223a452006-05-23 17:21:03 +0200719 printk(KERN_WARNING "nand_bbt: ECC error "
720 "while reading block for writing "
721 "bad block table\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700722 }
Thomas Gleixner9223a452006-05-23 17:21:03 +0200723 /* Read oob data */
Vitaly Wool70145682006-11-03 18:20:38 +0300724 ops.ooblen = (len >> this->page_shift) * mtd->oobsize;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200725 ops.oobbuf = &buf[len];
726 res = mtd->read_oob(mtd, to + mtd->writesize, &ops);
Vitaly Wool70145682006-11-03 18:20:38 +0300727 if (res < 0 || ops.oobretlen != ops.ooblen)
Thomas Gleixner9223a452006-05-23 17:21:03 +0200728 goto outerr;
729
Linus Torvalds1da177e2005-04-16 15:20:36 -0700730 /* Calc the byte offset in the buffer */
731 pageoffs = page - (int)(to >> this->page_shift);
732 offs = pageoffs << this->page_shift;
733 /* Preset the bbt area with 0xff */
David Woodhousee0c7d762006-05-13 18:07:53 +0100734 memset(&buf[offs], 0xff, (size_t) (numblocks >> sft));
Thomas Gleixner9223a452006-05-23 17:21:03 +0200735 ooboffs = len + (pageoffs * mtd->oobsize);
736
Linus Torvalds1da177e2005-04-16 15:20:36 -0700737 } else {
738 /* Calc length */
739 len = (size_t) (numblocks >> sft);
740 /* Make it page aligned ! */
Thomas Gleixner9223a452006-05-23 17:21:03 +0200741 len = (len + (mtd->writesize - 1)) &
742 ~(mtd->writesize - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700743 /* Preset the buffer with 0xff */
Thomas Gleixner9223a452006-05-23 17:21:03 +0200744 memset(buf, 0xff, len +
745 (len >> this->page_shift)* mtd->oobsize);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700746 offs = 0;
Thomas Gleixner9223a452006-05-23 17:21:03 +0200747 ooboffs = len;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700748 /* Pattern is located in oob area of first page */
Thomas Gleixner9223a452006-05-23 17:21:03 +0200749 memcpy(&buf[ooboffs + td->offs], td->pattern, td->len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700750 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000751
Thomas Gleixner9223a452006-05-23 17:21:03 +0200752 if (td->options & NAND_BBT_VERSION)
753 buf[ooboffs + td->veroffs] = td->version[chip];
754
Linus Torvalds1da177e2005-04-16 15:20:36 -0700755 /* walk through the memory table */
David Woodhousee0c7d762006-05-13 18:07:53 +0100756 for (i = 0; i < numblocks;) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700757 uint8_t dat;
758 dat = this->bbt[bbtoffs + (i >> 2)];
David Woodhousee0c7d762006-05-13 18:07:53 +0100759 for (j = 0; j < 4; j++, i++) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700760 int sftcnt = (i << (3 - sft)) & sftmsk;
761 /* Do not store the reserved bbt blocks ! */
Thomas Gleixner9223a452006-05-23 17:21:03 +0200762 buf[offs + (i >> sft)] &=
763 ~(msk[dat & 0x03] << sftcnt);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700764 dat >>= 2;
765 }
766 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000767
David Woodhousee0c7d762006-05-13 18:07:53 +0100768 memset(&einfo, 0, sizeof(einfo));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700769 einfo.mtd = mtd;
Adrian Hunter69423d92008-12-10 13:37:21 +0000770 einfo.addr = to;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700771 einfo.len = 1 << this->bbt_erase_shift;
David Woodhousee0c7d762006-05-13 18:07:53 +0100772 res = nand_erase_nand(mtd, &einfo, 1);
Thomas Gleixner9223a452006-05-23 17:21:03 +0200773 if (res < 0)
774 goto outerr;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000775
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200776 res = scan_write_bbt(mtd, to, len, buf, &buf[len]);
Thomas Gleixner9223a452006-05-23 17:21:03 +0200777 if (res < 0)
778 goto outerr;
779
Adrian Hunter69423d92008-12-10 13:37:21 +0000780 printk(KERN_DEBUG "Bad block table written to 0x%012llx, version "
781 "0x%02X\n", (unsigned long long)to, td->version[chip]);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000782
Linus Torvalds1da177e2005-04-16 15:20:36 -0700783 /* Mark it as used */
784 td->pages[chip] = page;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000785 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700786 return 0;
Thomas Gleixner9223a452006-05-23 17:21:03 +0200787
788 outerr:
789 printk(KERN_WARNING
790 "nand_bbt: Error while writing bad block table %d\n", res);
791 return res;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700792}
793
794/**
795 * nand_memory_bbt - [GENERIC] create a memory based bad block table
796 * @mtd: MTD device structure
797 * @bd: descriptor for the good/bad block search pattern
798 *
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000799 * The function creates a memory based bbt by scanning the device
Linus Torvalds1da177e2005-04-16 15:20:36 -0700800 * for manufacturer / software marked good / bad blocks
801*/
David Woodhousee0c7d762006-05-13 18:07:53 +0100802static inline int nand_memory_bbt(struct mtd_info *mtd, struct nand_bbt_descr *bd)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700803{
804 struct nand_chip *this = mtd->priv;
805
Artem B. Bityuckiy171650a2005-02-16 17:09:39 +0000806 bd->options &= ~NAND_BBT_SCANEMPTY;
David Woodhouse4bf63fc2006-09-25 17:08:04 +0100807 return create_bbt(mtd, this->buffers->databuf, bd, -1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700808}
809
810/**
David Woodhousee0c7d762006-05-13 18:07:53 +0100811 * check_create - [GENERIC] create and write bbt(s) if necessary
Linus Torvalds1da177e2005-04-16 15:20:36 -0700812 * @mtd: MTD device structure
813 * @buf: temporary buffer
814 * @bd: descriptor for the good/bad block search pattern
815 *
816 * The function checks the results of the previous call to read_bbt
David Woodhousee0c7d762006-05-13 18:07:53 +0100817 * and creates / updates the bbt(s) if necessary
818 * Creation is necessary if no bbt was found for the chip/device
819 * Update is necessary if one of the tables is missing or the
Linus Torvalds1da177e2005-04-16 15:20:36 -0700820 * version nr. of one table is less than the other
821*/
David Woodhousee0c7d762006-05-13 18:07:53 +0100822static int check_create(struct mtd_info *mtd, uint8_t *buf, struct nand_bbt_descr *bd)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700823{
824 int i, chips, writeops, chipsel, res;
825 struct nand_chip *this = mtd->priv;
826 struct nand_bbt_descr *td = this->bbt_td;
827 struct nand_bbt_descr *md = this->bbt_md;
828 struct nand_bbt_descr *rd, *rd2;
829
830 /* Do we have a bbt per chip ? */
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000831 if (td->options & NAND_BBT_PERCHIP)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700832 chips = this->numchips;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000833 else
Linus Torvalds1da177e2005-04-16 15:20:36 -0700834 chips = 1;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000835
Linus Torvalds1da177e2005-04-16 15:20:36 -0700836 for (i = 0; i < chips; i++) {
837 writeops = 0;
838 rd = NULL;
839 rd2 = NULL;
840 /* Per chip or per device ? */
841 chipsel = (td->options & NAND_BBT_PERCHIP) ? i : -1;
842 /* Mirrored table avilable ? */
843 if (md) {
844 if (td->pages[i] == -1 && md->pages[i] == -1) {
845 writeops = 0x03;
846 goto create;
847 }
848
849 if (td->pages[i] == -1) {
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000850 rd = md;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700851 td->version[i] = md->version[i];
852 writeops = 1;
853 goto writecheck;
854 }
855
856 if (md->pages[i] == -1) {
857 rd = td;
858 md->version[i] = td->version[i];
859 writeops = 2;
860 goto writecheck;
861 }
862
863 if (td->version[i] == md->version[i]) {
864 rd = td;
865 if (!(td->options & NAND_BBT_VERSION))
866 rd2 = md;
867 goto writecheck;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000868 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700869
870 if (((int8_t) (td->version[i] - md->version[i])) > 0) {
871 rd = td;
872 md->version[i] = td->version[i];
873 writeops = 2;
874 } else {
875 rd = md;
876 td->version[i] = md->version[i];
877 writeops = 1;
878 }
879
880 goto writecheck;
881
882 } else {
883 if (td->pages[i] == -1) {
884 writeops = 0x01;
885 goto create;
886 }
887 rd = td;
888 goto writecheck;
889 }
David Woodhousee0c7d762006-05-13 18:07:53 +0100890 create:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700891 /* Create the bad block table by scanning the device ? */
892 if (!(td->options & NAND_BBT_CREATE))
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000893 continue;
894
Linus Torvalds1da177e2005-04-16 15:20:36 -0700895 /* Create the table in memory by scanning the chip(s) */
David Woodhousee0c7d762006-05-13 18:07:53 +0100896 create_bbt(mtd, buf, bd, chipsel);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000897
Linus Torvalds1da177e2005-04-16 15:20:36 -0700898 td->version[i] = 1;
899 if (md)
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000900 md->version[i] = 1;
David Woodhousee0c7d762006-05-13 18:07:53 +0100901 writecheck:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700902 /* read back first ? */
903 if (rd)
David Woodhousee0c7d762006-05-13 18:07:53 +0100904 read_abs_bbt(mtd, buf, rd, chipsel);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700905 /* If they weren't versioned, read both. */
906 if (rd2)
David Woodhousee0c7d762006-05-13 18:07:53 +0100907 read_abs_bbt(mtd, buf, rd2, chipsel);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700908
909 /* Write the bad block table to the device ? */
910 if ((writeops & 0x01) && (td->options & NAND_BBT_WRITE)) {
David Woodhousee0c7d762006-05-13 18:07:53 +0100911 res = write_bbt(mtd, buf, td, md, chipsel);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700912 if (res < 0)
913 return res;
914 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000915
Linus Torvalds1da177e2005-04-16 15:20:36 -0700916 /* Write the mirror bad block table to the device ? */
917 if ((writeops & 0x02) && md && (md->options & NAND_BBT_WRITE)) {
David Woodhousee0c7d762006-05-13 18:07:53 +0100918 res = write_bbt(mtd, buf, md, td, chipsel);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700919 if (res < 0)
920 return res;
921 }
922 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000923 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700924}
925
926/**
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000927 * mark_bbt_regions - [GENERIC] mark the bad block table regions
Linus Torvalds1da177e2005-04-16 15:20:36 -0700928 * @mtd: MTD device structure
929 * @td: bad block table descriptor
930 *
931 * The bad block table regions are marked as "bad" to prevent
932 * accidental erasures / writes. The regions are identified by
933 * the mark 0x02.
934*/
David Woodhousee0c7d762006-05-13 18:07:53 +0100935static void mark_bbt_region(struct mtd_info *mtd, struct nand_bbt_descr *td)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700936{
937 struct nand_chip *this = mtd->priv;
938 int i, j, chips, block, nrblocks, update;
939 uint8_t oldval, newval;
940
941 /* Do we have a bbt per chip ? */
942 if (td->options & NAND_BBT_PERCHIP) {
943 chips = this->numchips;
944 nrblocks = (int)(this->chipsize >> this->bbt_erase_shift);
945 } else {
946 chips = 1;
947 nrblocks = (int)(mtd->size >> this->bbt_erase_shift);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000948 }
949
Linus Torvalds1da177e2005-04-16 15:20:36 -0700950 for (i = 0; i < chips; i++) {
951 if ((td->options & NAND_BBT_ABSPAGE) ||
952 !(td->options & NAND_BBT_WRITE)) {
David Woodhousee0c7d762006-05-13 18:07:53 +0100953 if (td->pages[i] == -1)
954 continue;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700955 block = td->pages[i] >> (this->bbt_erase_shift - this->page_shift);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000956 block <<= 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700957 oldval = this->bbt[(block >> 3)];
958 newval = oldval | (0x2 << (block & 0x06));
959 this->bbt[(block >> 3)] = newval;
960 if ((oldval != newval) && td->reserved_block_code)
Adrian Hunter69423d92008-12-10 13:37:21 +0000961 nand_update_bbt(mtd, (loff_t)block << (this->bbt_erase_shift - 1));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700962 continue;
963 }
964 update = 0;
965 if (td->options & NAND_BBT_LASTBLOCK)
966 block = ((i + 1) * nrblocks) - td->maxblocks;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000967 else
Linus Torvalds1da177e2005-04-16 15:20:36 -0700968 block = i * nrblocks;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000969 block <<= 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700970 for (j = 0; j < td->maxblocks; j++) {
971 oldval = this->bbt[(block >> 3)];
972 newval = oldval | (0x2 << (block & 0x06));
973 this->bbt[(block >> 3)] = newval;
David Woodhousee0c7d762006-05-13 18:07:53 +0100974 if (oldval != newval)
975 update = 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700976 block += 2;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000977 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700978 /* If we want reserved blocks to be recorded to flash, and some
979 new ones have been marked, then we need to update the stored
980 bbts. This should only happen once. */
981 if (update && td->reserved_block_code)
Adrian Hunter69423d92008-12-10 13:37:21 +0000982 nand_update_bbt(mtd, (loff_t)(block - 2) << (this->bbt_erase_shift - 1));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700983 }
984}
985
986/**
987 * nand_scan_bbt - [NAND Interface] scan, find, read and maybe create bad block table(s)
988 * @mtd: MTD device structure
989 * @bd: descriptor for the good/bad block search pattern
990 *
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000991 * The function checks, if a bad block table(s) is/are already
Linus Torvalds1da177e2005-04-16 15:20:36 -0700992 * available. If not it scans the device for manufacturer
993 * marked good / bad blocks and writes the bad block table(s) to
994 * the selected place.
995 *
996 * The bad block table memory is allocated here. It must be freed
997 * by calling the nand_free_bbt function.
998 *
999*/
David Woodhousee0c7d762006-05-13 18:07:53 +01001000int nand_scan_bbt(struct mtd_info *mtd, struct nand_bbt_descr *bd)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001001{
1002 struct nand_chip *this = mtd->priv;
1003 int len, res = 0;
1004 uint8_t *buf;
1005 struct nand_bbt_descr *td = this->bbt_td;
1006 struct nand_bbt_descr *md = this->bbt_md;
1007
1008 len = mtd->size >> (this->bbt_erase_shift + 2);
Burman Yan95b93a02006-11-15 21:10:29 +02001009 /* Allocate memory (2bit per block) and clear the memory bad block table */
1010 this->bbt = kzalloc(len, GFP_KERNEL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001011 if (!this->bbt) {
David Woodhousee0c7d762006-05-13 18:07:53 +01001012 printk(KERN_ERR "nand_scan_bbt: Out of memory\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -07001013 return -ENOMEM;
1014 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001015
1016 /* If no primary table decriptor is given, scan the device
1017 * to build a memory based bad block table
1018 */
Artem B. Bityuckiyeeada242005-02-11 10:14:15 +00001019 if (!td) {
1020 if ((res = nand_memory_bbt(mtd, bd))) {
David Woodhousee0c7d762006-05-13 18:07:53 +01001021 printk(KERN_ERR "nand_bbt: Can't scan flash and build the RAM-based BBT\n");
1022 kfree(this->bbt);
Artem B. Bityuckiyeeada242005-02-11 10:14:15 +00001023 this->bbt = NULL;
1024 }
1025 return res;
1026 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001027
1028 /* Allocate a temporary buffer for one eraseblock incl. oob */
1029 len = (1 << this->bbt_erase_shift);
1030 len += (len >> this->page_shift) * mtd->oobsize;
David Woodhousec3f8abf2006-05-13 04:03:42 +01001031 buf = vmalloc(len);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001032 if (!buf) {
David Woodhousee0c7d762006-05-13 18:07:53 +01001033 printk(KERN_ERR "nand_bbt: Out of memory\n");
1034 kfree(this->bbt);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001035 this->bbt = NULL;
1036 return -ENOMEM;
1037 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001038
Linus Torvalds1da177e2005-04-16 15:20:36 -07001039 /* Is the bbt at a given page ? */
1040 if (td->options & NAND_BBT_ABSPAGE) {
David Woodhousee0c7d762006-05-13 18:07:53 +01001041 res = read_abs_bbts(mtd, buf, td, md);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001042 } else {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001043 /* Search the bad block table using a pattern in oob */
David Woodhousee0c7d762006-05-13 18:07:53 +01001044 res = search_read_bbts(mtd, buf, td, md);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001045 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001046
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001047 if (res)
David Woodhousee0c7d762006-05-13 18:07:53 +01001048 res = check_create(mtd, buf, bd);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001049
Linus Torvalds1da177e2005-04-16 15:20:36 -07001050 /* Prevent the bbt regions from erasing / writing */
David Woodhousee0c7d762006-05-13 18:07:53 +01001051 mark_bbt_region(mtd, td);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001052 if (md)
David Woodhousee0c7d762006-05-13 18:07:53 +01001053 mark_bbt_region(mtd, md);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001054
David Woodhousee0c7d762006-05-13 18:07:53 +01001055 vfree(buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001056 return res;
1057}
1058
Linus Torvalds1da177e2005-04-16 15:20:36 -07001059/**
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001060 * nand_update_bbt - [NAND Interface] update bad block table(s)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001061 * @mtd: MTD device structure
1062 * @offs: the offset of the newly marked block
1063 *
1064 * The function updates the bad block table(s)
1065*/
David Woodhousee0c7d762006-05-13 18:07:53 +01001066int nand_update_bbt(struct mtd_info *mtd, loff_t offs)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001067{
1068 struct nand_chip *this = mtd->priv;
1069 int len, res = 0, writeops = 0;
1070 int chip, chipsel;
1071 uint8_t *buf;
1072 struct nand_bbt_descr *td = this->bbt_td;
1073 struct nand_bbt_descr *md = this->bbt_md;
1074
1075 if (!this->bbt || !td)
1076 return -EINVAL;
1077
Linus Torvalds1da177e2005-04-16 15:20:36 -07001078 /* Allocate a temporary buffer for one eraseblock incl. oob */
1079 len = (1 << this->bbt_erase_shift);
1080 len += (len >> this->page_shift) * mtd->oobsize;
David Woodhousee0c7d762006-05-13 18:07:53 +01001081 buf = kmalloc(len, GFP_KERNEL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001082 if (!buf) {
David Woodhousee0c7d762006-05-13 18:07:53 +01001083 printk(KERN_ERR "nand_update_bbt: Out of memory\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -07001084 return -ENOMEM;
1085 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001086
Linus Torvalds1da177e2005-04-16 15:20:36 -07001087 writeops = md != NULL ? 0x03 : 0x01;
1088
1089 /* Do we have a bbt per chip ? */
1090 if (td->options & NAND_BBT_PERCHIP) {
David Woodhousee0c7d762006-05-13 18:07:53 +01001091 chip = (int)(offs >> this->chip_shift);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001092 chipsel = chip;
1093 } else {
1094 chip = 0;
1095 chipsel = -1;
1096 }
1097
1098 td->version[chip]++;
1099 if (md)
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001100 md->version[chip]++;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001101
1102 /* Write the bad block table to the device ? */
1103 if ((writeops & 0x01) && (td->options & NAND_BBT_WRITE)) {
David Woodhousee0c7d762006-05-13 18:07:53 +01001104 res = write_bbt(mtd, buf, td, md, chipsel);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001105 if (res < 0)
1106 goto out;
1107 }
1108 /* Write the mirror bad block table to the device ? */
1109 if ((writeops & 0x02) && md && (md->options & NAND_BBT_WRITE)) {
David Woodhousee0c7d762006-05-13 18:07:53 +01001110 res = write_bbt(mtd, buf, md, td, chipsel);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001111 }
1112
David Woodhousee0c7d762006-05-13 18:07:53 +01001113 out:
1114 kfree(buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001115 return res;
1116}
1117
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001118/* Define some generic bad / good block scan pattern which are used
Artem B. Bityuckiy171650a2005-02-16 17:09:39 +00001119 * while scanning a device for factory marked good / bad blocks. */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001120static uint8_t scan_ff_pattern[] = { 0xff, 0xff };
1121
Linus Torvalds1da177e2005-04-16 15:20:36 -07001122static struct nand_bbt_descr smallpage_flashbased = {
David Woodhouse6943f8a2006-05-13 16:14:26 +01001123 .options = NAND_BBT_SCAN2NDPAGE,
Brian Norrisc7b28e22010-07-13 15:13:00 -07001124 .offs = NAND_SMALL_BADBLOCK_POS,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001125 .len = 1,
1126 .pattern = scan_ff_pattern
1127};
1128
1129static struct nand_bbt_descr largepage_flashbased = {
David Woodhouse6943f8a2006-05-13 16:14:26 +01001130 .options = NAND_BBT_SCAN2NDPAGE,
Brian Norrisc7b28e22010-07-13 15:13:00 -07001131 .offs = NAND_LARGE_BADBLOCK_POS,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001132 .len = 2,
1133 .pattern = scan_ff_pattern
1134};
1135
1136static uint8_t scan_agand_pattern[] = { 0x1C, 0x71, 0xC7, 0x1C, 0x71, 0xC7 };
1137
1138static struct nand_bbt_descr agand_flashbased = {
1139 .options = NAND_BBT_SCANEMPTY | NAND_BBT_SCANALLPAGES,
1140 .offs = 0x20,
1141 .len = 6,
1142 .pattern = scan_agand_pattern
1143};
1144
1145/* Generic flash bbt decriptors
1146*/
1147static uint8_t bbt_pattern[] = {'B', 'b', 't', '0' };
1148static uint8_t mirror_pattern[] = {'1', 't', 'b', 'B' };
1149
1150static struct nand_bbt_descr bbt_main_descr = {
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001151 .options = NAND_BBT_LASTBLOCK | NAND_BBT_CREATE | NAND_BBT_WRITE
Linus Torvalds1da177e2005-04-16 15:20:36 -07001152 | NAND_BBT_2BIT | NAND_BBT_VERSION | NAND_BBT_PERCHIP,
1153 .offs = 8,
1154 .len = 4,
1155 .veroffs = 12,
1156 .maxblocks = 4,
1157 .pattern = bbt_pattern
1158};
1159
1160static struct nand_bbt_descr bbt_mirror_descr = {
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001161 .options = NAND_BBT_LASTBLOCK | NAND_BBT_CREATE | NAND_BBT_WRITE
Linus Torvalds1da177e2005-04-16 15:20:36 -07001162 | NAND_BBT_2BIT | NAND_BBT_VERSION | NAND_BBT_PERCHIP,
1163 .offs = 8,
1164 .len = 4,
1165 .veroffs = 12,
1166 .maxblocks = 4,
1167 .pattern = mirror_pattern
1168};
1169
Brian Norris58373ff2010-07-15 12:15:44 -07001170#define BBT_SCAN_OPTIONS (NAND_BBT_SCANLASTPAGE | NAND_BBT_SCAN2NDPAGE | \
1171 NAND_BBT_SCANBYTE1AND6)
1172/**
1173 * nand_create_default_bbt_descr - [Internal] Creates a BBT descriptor structure
1174 * @this: NAND chip to create descriptor for
1175 *
1176 * This function allocates and initializes a nand_bbt_descr for BBM detection
1177 * based on the properties of "this". The new descriptor is stored in
1178 * this->badblock_pattern. Thus, this->badblock_pattern should be NULL when
1179 * passed to this function.
1180 *
1181 * TODO: Handle other flags, replace other static structs
1182 * (e.g. handle NAND_BBT_FLASH for flash-based BBT,
1183 * replace smallpage_flashbased)
1184 *
1185 */
1186static int nand_create_default_bbt_descr(struct nand_chip *this)
1187{
1188 struct nand_bbt_descr *bd;
1189 if (this->badblock_pattern) {
1190 printk(KERN_WARNING "BBT descr already allocated; not replacing.\n");
1191 return -EINVAL;
1192 }
1193 bd = kzalloc(sizeof(*bd), GFP_KERNEL);
1194 if (!bd) {
1195 printk(KERN_ERR "nand_create_default_bbt_descr: Out of memory\n");
1196 return -ENOMEM;
1197 }
1198 bd->options = this->options & BBT_SCAN_OPTIONS;
1199 bd->offs = this->badblockpos;
1200 bd->len = (this->options & NAND_BUSWIDTH_16) ? 2 : 1;
1201 bd->pattern = scan_ff_pattern;
1202 bd->options |= NAND_BBT_DYNAMICSTRUCT;
1203 this->badblock_pattern = bd;
1204 return 0;
1205}
1206
Linus Torvalds1da177e2005-04-16 15:20:36 -07001207/**
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001208 * nand_default_bbt - [NAND Interface] Select a default bad block table for the device
Linus Torvalds1da177e2005-04-16 15:20:36 -07001209 * @mtd: MTD device structure
1210 *
1211 * This function selects the default bad block table
1212 * support for the device and calls the nand_scan_bbt function
1213 *
1214*/
David Woodhousee0c7d762006-05-13 18:07:53 +01001215int nand_default_bbt(struct mtd_info *mtd)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001216{
1217 struct nand_chip *this = mtd->priv;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001218
1219 /* Default for AG-AND. We must use a flash based
Linus Torvalds1da177e2005-04-16 15:20:36 -07001220 * bad block table as the devices have factory marked
1221 * _good_ blocks. Erasing those blocks leads to loss
1222 * of the good / bad information, so we _must_ store
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001223 * this information in a good / bad table during
Linus Torvalds1da177e2005-04-16 15:20:36 -07001224 * startup
David Woodhousee0c7d762006-05-13 18:07:53 +01001225 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001226 if (this->options & NAND_IS_AND) {
1227 /* Use the default pattern descriptors */
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001228 if (!this->bbt_td) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001229 this->bbt_td = &bbt_main_descr;
1230 this->bbt_md = &bbt_mirror_descr;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001231 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001232 this->options |= NAND_USE_FLASH_BBT;
David Woodhousee0c7d762006-05-13 18:07:53 +01001233 return nand_scan_bbt(mtd, &agand_flashbased);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001234 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001235
Linus Torvalds1da177e2005-04-16 15:20:36 -07001236 /* Is a flash based bad block table requested ? */
1237 if (this->options & NAND_USE_FLASH_BBT) {
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001238 /* Use the default pattern descriptors */
1239 if (!this->bbt_td) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001240 this->bbt_td = &bbt_main_descr;
1241 this->bbt_md = &bbt_mirror_descr;
1242 }
1243 if (!this->badblock_pattern) {
Joern Engel28318772006-05-22 23:18:05 +02001244 this->badblock_pattern = (mtd->writesize > 512) ? &largepage_flashbased : &smallpage_flashbased;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001245 }
1246 } else {
1247 this->bbt_td = NULL;
1248 this->bbt_md = NULL;
Brian Norris58373ff2010-07-15 12:15:44 -07001249 if (!this->badblock_pattern)
1250 nand_create_default_bbt_descr(this);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001251 }
David Woodhousee0c7d762006-05-13 18:07:53 +01001252 return nand_scan_bbt(mtd, this->badblock_pattern);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001253}
1254
1255/**
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001256 * nand_isbad_bbt - [NAND Interface] Check if a block is bad
Linus Torvalds1da177e2005-04-16 15:20:36 -07001257 * @mtd: MTD device structure
1258 * @offs: offset in the device
1259 * @allowbbt: allow access to bad block table region
1260 *
1261*/
David Woodhousee0c7d762006-05-13 18:07:53 +01001262int nand_isbad_bbt(struct mtd_info *mtd, loff_t offs, int allowbbt)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001263{
1264 struct nand_chip *this = mtd->priv;
1265 int block;
David Woodhousee0c7d762006-05-13 18:07:53 +01001266 uint8_t res;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +00001267
Linus Torvalds1da177e2005-04-16 15:20:36 -07001268 /* Get block number * 2 */
David Woodhousee0c7d762006-05-13 18:07:53 +01001269 block = (int)(offs >> (this->bbt_erase_shift - 1));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001270 res = (this->bbt[block >> 3] >> (block & 0x06)) & 0x03;
1271
David Woodhousee0c7d762006-05-13 18:07:53 +01001272 DEBUG(MTD_DEBUG_LEVEL2, "nand_isbad_bbt(): bbt info for offs 0x%08x: (block %d) 0x%02x\n",
1273 (unsigned int)offs, block >> 1, res);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001274
1275 switch ((int)res) {
David Woodhousee0c7d762006-05-13 18:07:53 +01001276 case 0x00:
1277 return 0;
1278 case 0x01:
1279 return 1;
1280 case 0x02:
1281 return allowbbt ? 0 : 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001282 }
1283 return 1;
1284}
1285
David Woodhousee0c7d762006-05-13 18:07:53 +01001286EXPORT_SYMBOL(nand_scan_bbt);
1287EXPORT_SYMBOL(nand_default_bbt);