blob: 587297e435546387b0ea9d2ad1a0db40a96054c1 [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
Sebastian Andrzej Siewiordf5b4e32010-09-29 19:43:51 +0200164 * @td: the bbt describtion table
Linus Torvalds1da177e2005-04-16 15:20:36 -0700165 * @offs: offset in the memory table
Linus Torvalds1da177e2005-04-16 15:20:36 -0700166 *
167 * Read the bad block table starting from page.
168 *
169 */
David Woodhousee0c7d762006-05-13 18:07:53 +0100170static int read_bbt(struct mtd_info *mtd, uint8_t *buf, int page, int num,
Sebastian Andrzej Siewiordf5b4e32010-09-29 19:43:51 +0200171 struct nand_bbt_descr *td, int offs)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700172{
173 int res, i, j, act = 0;
174 struct nand_chip *this = mtd->priv;
175 size_t retlen, len, totlen;
176 loff_t from;
Sebastian Andrzej Siewiordf5b4e32010-09-29 19:43:51 +0200177 int bits = td->options & NAND_BBT_NRBITS_MSK;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700178 uint8_t msk = (uint8_t) ((1 << bits) - 1);
Sebastian Andrzej Siewiordf5b4e32010-09-29 19:43:51 +0200179 int reserved_block_code = td->reserved_block_code;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700180
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;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700242
Linus Torvalds1da177e2005-04-16 15:20:36 -0700243 if (td->options & NAND_BBT_PERCHIP) {
244 int offs = 0;
245 for (i = 0; i < this->numchips; i++) {
246 if (chip == -1 || chip == i)
Sebastian Andrzej Siewiordf5b4e32010-09-29 19:43:51 +0200247 res = read_bbt(mtd, buf, td->pages[i],
248 this->chipsize >> this->bbt_erase_shift,
249 td, offs);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700250 if (res)
251 return res;
252 offs += this->chipsize >> (this->bbt_erase_shift + 2);
253 }
254 } else {
Sebastian Andrzej Siewiordf5b4e32010-09-29 19:43:51 +0200255 res = read_bbt(mtd, buf, td->pages[0],
256 mtd->size >> this->bbt_erase_shift, td, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700257 if (res)
258 return res;
259 }
260 return 0;
261}
262
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200263/*
264 * Scan read raw data from flash
265 */
266static int scan_read_raw(struct mtd_info *mtd, uint8_t *buf, loff_t offs,
267 size_t len)
268{
269 struct mtd_oob_ops ops;
Maxim Levitskyb64d39d2010-02-22 20:39:37 +0200270 int res;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200271
272 ops.mode = MTD_OOB_RAW;
273 ops.ooboffs = 0;
274 ops.ooblen = mtd->oobsize;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200275
Maxim Levitskyb64d39d2010-02-22 20:39:37 +0200276
277 while (len > 0) {
278 if (len <= mtd->writesize) {
279 ops.oobbuf = buf + len;
280 ops.datbuf = buf;
281 ops.len = len;
282 return mtd->read_oob(mtd, offs, &ops);
283 } else {
284 ops.oobbuf = buf + mtd->writesize;
285 ops.datbuf = buf;
286 ops.len = mtd->writesize;
287 res = mtd->read_oob(mtd, offs, &ops);
288
289 if (res)
290 return res;
291 }
292
293 buf += mtd->oobsize + mtd->writesize;
294 len -= mtd->writesize;
295 }
296 return 0;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200297}
298
299/*
300 * Scan write data with oob to flash
301 */
302static int scan_write_bbt(struct mtd_info *mtd, loff_t offs, size_t len,
303 uint8_t *buf, uint8_t *oob)
304{
305 struct mtd_oob_ops ops;
306
307 ops.mode = MTD_OOB_PLACE;
308 ops.ooboffs = 0;
309 ops.ooblen = mtd->oobsize;
310 ops.datbuf = buf;
311 ops.oobbuf = oob;
312 ops.len = len;
313
314 return mtd->write_oob(mtd, offs, &ops);
315}
316
Linus Torvalds1da177e2005-04-16 15:20:36 -0700317/**
318 * read_abs_bbts - [GENERIC] Read the bad block table(s) for all chips starting at a given page
319 * @mtd: MTD device structure
320 * @buf: temporary buffer
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000321 * @td: descriptor for the bad block table
Linus Torvalds1da177e2005-04-16 15:20:36 -0700322 * @md: descriptor for the bad block table mirror
323 *
324 * Read the bad block table(s) for all chips starting at a given page
325 * We assume that the bbt bits are in consecutive order.
326 *
327*/
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200328static int read_abs_bbts(struct mtd_info *mtd, uint8_t *buf,
329 struct nand_bbt_descr *td, struct nand_bbt_descr *md)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700330{
331 struct nand_chip *this = mtd->priv;
332
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000333 /* Read the primary version, if available */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700334 if (td->options & NAND_BBT_VERSION) {
Adrian Hunter69423d92008-12-10 13:37:21 +0000335 scan_read_raw(mtd, buf, (loff_t)td->pages[0] << this->page_shift,
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200336 mtd->writesize);
Joern Engel28318772006-05-22 23:18:05 +0200337 td->version[0] = buf[mtd->writesize + td->veroffs];
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200338 printk(KERN_DEBUG "Bad block table at page %d, version 0x%02X\n",
339 td->pages[0], td->version[0]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700340 }
341
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000342 /* Read the mirror version, if available */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700343 if (md && (md->options & NAND_BBT_VERSION)) {
Adrian Hunter69423d92008-12-10 13:37:21 +0000344 scan_read_raw(mtd, buf, (loff_t)md->pages[0] << this->page_shift,
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200345 mtd->writesize);
Joern Engel28318772006-05-22 23:18:05 +0200346 md->version[0] = buf[mtd->writesize + md->veroffs];
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200347 printk(KERN_DEBUG "Bad block table at page %d, version 0x%02X\n",
348 md->pages[0], md->version[0]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700349 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700350 return 1;
351}
352
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200353/*
354 * Scan a given block full
355 */
356static int scan_block_full(struct mtd_info *mtd, struct nand_bbt_descr *bd,
357 loff_t offs, uint8_t *buf, size_t readlen,
358 int scanlen, int len)
359{
360 int ret, j;
361
362 ret = scan_read_raw(mtd, buf, offs, readlen);
363 if (ret)
364 return ret;
365
366 for (j = 0; j < len; j++, buf += scanlen) {
367 if (check_pattern(buf, scanlen, mtd->writesize, bd))
368 return 1;
369 }
370 return 0;
371}
372
373/*
374 * Scan a given block partially
375 */
376static int scan_block_fast(struct mtd_info *mtd, struct nand_bbt_descr *bd,
377 loff_t offs, uint8_t *buf, int len)
378{
379 struct mtd_oob_ops ops;
380 int j, ret;
381
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200382 ops.ooblen = mtd->oobsize;
383 ops.oobbuf = buf;
384 ops.ooboffs = 0;
385 ops.datbuf = NULL;
386 ops.mode = MTD_OOB_PLACE;
387
388 for (j = 0; j < len; j++) {
389 /*
390 * Read the full oob until read_oob is fixed to
391 * handle single byte reads for 16 bit
392 * buswidth
393 */
394 ret = mtd->read_oob(mtd, offs, &ops);
395 if (ret)
396 return ret;
397
398 if (check_short_pattern(buf, bd))
399 return 1;
400
401 offs += mtd->writesize;
402 }
403 return 0;
404}
405
Linus Torvalds1da177e2005-04-16 15:20:36 -0700406/**
407 * create_bbt - [GENERIC] Create a bad block table by scanning the device
408 * @mtd: MTD device structure
409 * @buf: temporary buffer
410 * @bd: descriptor for the good/bad block search pattern
411 * @chip: create the table for a specific chip, -1 read all chips.
412 * Applies only if NAND_BBT_PERCHIP option is set
413 *
414 * Create a bad block table by scanning the device
415 * for the given good/bad block identify pattern
416 */
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200417static int create_bbt(struct mtd_info *mtd, uint8_t *buf,
418 struct nand_bbt_descr *bd, int chip)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700419{
420 struct nand_chip *this = mtd->priv;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200421 int i, numblocks, len, scanlen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700422 int startblock;
423 loff_t from;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200424 size_t readlen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700425
David Woodhousee0c7d762006-05-13 18:07:53 +0100426 printk(KERN_INFO "Scanning device for bad blocks\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700427
428 if (bd->options & NAND_BBT_SCANALLPAGES)
429 len = 1 << (this->bbt_erase_shift - this->page_shift);
Brian Norris58373ff2010-07-15 12:15:44 -0700430 else if (bd->options & NAND_BBT_SCAN2NDPAGE)
431 len = 2;
432 else
433 len = 1;
Artem B. Bityuckiy171650a2005-02-16 17:09:39 +0000434
435 if (!(bd->options & NAND_BBT_SCANEMPTY)) {
436 /* We need only read few bytes from the OOB area */
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200437 scanlen = 0;
Artem B. Bityuckiyeeada242005-02-11 10:14:15 +0000438 readlen = bd->len;
439 } else {
Artem B. Bityuckiy171650a2005-02-16 17:09:39 +0000440 /* Full page content should be read */
Joern Engel28318772006-05-22 23:18:05 +0200441 scanlen = mtd->writesize + mtd->oobsize;
442 readlen = len * mtd->writesize;
Artem B. Bityuckiyeeada242005-02-11 10:14:15 +0000443 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700444
445 if (chip == -1) {
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200446 /* Note that numblocks is 2 * (real numblocks) here, see i+=2
447 * below as it makes shifting and masking less painful */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700448 numblocks = mtd->size >> (this->bbt_erase_shift - 1);
449 startblock = 0;
450 from = 0;
451 } else {
452 if (chip >= this->numchips) {
David Woodhousee0c7d762006-05-13 18:07:53 +0100453 printk(KERN_WARNING "create_bbt(): chipnr (%d) > available chips (%d)\n",
454 chip + 1, this->numchips);
Artem B. Bityuckiy171650a2005-02-16 17:09:39 +0000455 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700456 }
457 numblocks = this->chipsize >> (this->bbt_erase_shift - 1);
458 startblock = chip * numblocks;
459 numblocks += startblock;
Adrian Hunter69423d92008-12-10 13:37:21 +0000460 from = (loff_t)startblock << (this->bbt_erase_shift - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700461 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000462
Brian Norris30fe8112010-06-23 13:36:02 -0700463 if (this->options & NAND_BBT_SCANLASTPAGE)
Kevin Cernekeeb60b08b2010-05-04 20:58:10 -0700464 from += mtd->erasesize - (mtd->writesize * len);
465
Linus Torvalds1da177e2005-04-16 15:20:36 -0700466 for (i = startblock; i < numblocks;) {
Artem B. Bityuckiyeeada242005-02-11 10:14:15 +0000467 int ret;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000468
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200469 if (bd->options & NAND_BBT_SCANALLPAGES)
470 ret = scan_block_full(mtd, bd, from, buf, readlen,
471 scanlen, len);
472 else
473 ret = scan_block_fast(mtd, bd, from, buf, len);
Artem B. Bityuckiy171650a2005-02-16 17:09:39 +0000474
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200475 if (ret < 0)
476 return ret;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000477
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200478 if (ret) {
479 this->bbt[i >> 3] |= 0x03 << (i & 0x6);
Adrian Hunter69423d92008-12-10 13:37:21 +0000480 printk(KERN_WARNING "Bad eraseblock %d at 0x%012llx\n",
481 i >> 1, (unsigned long long)from);
Thomas Gleixnerf1a28c02006-05-30 00:37:34 +0200482 mtd->ecc_stats.badblocks++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700483 }
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200484
Linus Torvalds1da177e2005-04-16 15:20:36 -0700485 i += 2;
486 from += (1 << this->bbt_erase_shift);
487 }
Artem B. Bityuckiyeeada242005-02-11 10:14:15 +0000488 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700489}
490
491/**
492 * search_bbt - [GENERIC] scan the device for a specific bad block table
493 * @mtd: MTD device structure
494 * @buf: temporary buffer
495 * @td: descriptor for the bad block table
496 *
497 * Read the bad block table by searching for a given ident pattern.
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000498 * Search is preformed either from the beginning up or from the end of
Linus Torvalds1da177e2005-04-16 15:20:36 -0700499 * the device downwards. The search starts always at the start of a
500 * block.
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000501 * If the option NAND_BBT_PERCHIP is given, each chip is searched
Linus Torvalds1da177e2005-04-16 15:20:36 -0700502 * for a bbt, which contains the bad block information of this chip.
David Woodhousee0c7d762006-05-13 18:07:53 +0100503 * This is necessary to provide support for certain DOC devices.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700504 *
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000505 * The bbt ident pattern resides in the oob area of the first page
506 * in a block.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700507 */
David Woodhousee0c7d762006-05-13 18:07:53 +0100508static int search_bbt(struct mtd_info *mtd, uint8_t *buf, struct nand_bbt_descr *td)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700509{
510 struct nand_chip *this = mtd->priv;
511 int i, chips;
512 int bits, startblock, block, dir;
Joern Engel28318772006-05-22 23:18:05 +0200513 int scanlen = mtd->writesize + mtd->oobsize;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700514 int bbtblocks;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200515 int blocktopage = this->bbt_erase_shift - this->page_shift;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700516
517 /* Search direction top -> down ? */
518 if (td->options & NAND_BBT_LASTBLOCK) {
David Woodhousee0c7d762006-05-13 18:07:53 +0100519 startblock = (mtd->size >> this->bbt_erase_shift) - 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700520 dir = -1;
521 } else {
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000522 startblock = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700523 dir = 1;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000524 }
525
Linus Torvalds1da177e2005-04-16 15:20:36 -0700526 /* Do we have a bbt per chip ? */
527 if (td->options & NAND_BBT_PERCHIP) {
528 chips = this->numchips;
529 bbtblocks = this->chipsize >> this->bbt_erase_shift;
530 startblock &= bbtblocks - 1;
531 } else {
532 chips = 1;
533 bbtblocks = mtd->size >> this->bbt_erase_shift;
534 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000535
Linus Torvalds1da177e2005-04-16 15:20:36 -0700536 /* Number of bits for each erase block in the bbt */
537 bits = td->options & NAND_BBT_NRBITS_MSK;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000538
Linus Torvalds1da177e2005-04-16 15:20:36 -0700539 for (i = 0; i < chips; i++) {
540 /* Reset version information */
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000541 td->version[i] = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700542 td->pages[i] = -1;
543 /* Scan the maximum number of blocks */
544 for (block = 0; block < td->maxblocks; block++) {
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200545
Linus Torvalds1da177e2005-04-16 15:20:36 -0700546 int actblock = startblock + dir * block;
Adrian Hunter69423d92008-12-10 13:37:21 +0000547 loff_t offs = (loff_t)actblock << this->bbt_erase_shift;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200548
Linus Torvalds1da177e2005-04-16 15:20:36 -0700549 /* Read first page */
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200550 scan_read_raw(mtd, buf, offs, mtd->writesize);
Joern Engel28318772006-05-22 23:18:05 +0200551 if (!check_pattern(buf, scanlen, mtd->writesize, td)) {
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200552 td->pages[i] = actblock << blocktopage;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700553 if (td->options & NAND_BBT_VERSION) {
Joern Engel28318772006-05-22 23:18:05 +0200554 td->version[i] = buf[mtd->writesize + td->veroffs];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700555 }
556 break;
557 }
558 }
559 startblock += this->chipsize >> this->bbt_erase_shift;
560 }
561 /* Check, if we found a bbt for each requested chip */
562 for (i = 0; i < chips; i++) {
563 if (td->pages[i] == -1)
David Woodhousee0c7d762006-05-13 18:07:53 +0100564 printk(KERN_WARNING "Bad block table not found for chip %d\n", i);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700565 else
David Woodhousee0c7d762006-05-13 18:07:53 +0100566 printk(KERN_DEBUG "Bad block table found at page %d, version 0x%02X\n", td->pages[i],
567 td->version[i]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700568 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000569 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700570}
571
572/**
573 * search_read_bbts - [GENERIC] scan the device for bad block table(s)
574 * @mtd: MTD device structure
575 * @buf: temporary buffer
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000576 * @td: descriptor for the bad block table
Linus Torvalds1da177e2005-04-16 15:20:36 -0700577 * @md: descriptor for the bad block table mirror
578 *
579 * Search and read the bad block table(s)
580*/
David Woodhousee0c7d762006-05-13 18:07:53 +0100581static 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 -0700582{
583 /* Search the primary table */
David Woodhousee0c7d762006-05-13 18:07:53 +0100584 search_bbt(mtd, buf, td);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000585
Linus Torvalds1da177e2005-04-16 15:20:36 -0700586 /* Search the mirror table */
587 if (md)
David Woodhousee0c7d762006-05-13 18:07:53 +0100588 search_bbt(mtd, buf, md);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700589
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000590 /* Force result check */
591 return 1;
592}
593
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000594/**
Linus Torvalds1da177e2005-04-16 15:20:36 -0700595 * write_bbt - [GENERIC] (Re)write the bad block table
596 *
597 * @mtd: MTD device structure
598 * @buf: temporary buffer
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000599 * @td: descriptor for the bad block table
Linus Torvalds1da177e2005-04-16 15:20:36 -0700600 * @md: descriptor for the bad block table mirror
601 * @chipsel: selector for a specific chip, -1 for all
602 *
603 * (Re)write the bad block table
604 *
605*/
David Woodhousee0c7d762006-05-13 18:07:53 +0100606static int write_bbt(struct mtd_info *mtd, uint8_t *buf,
Thomas Gleixner9223a452006-05-23 17:21:03 +0200607 struct nand_bbt_descr *td, struct nand_bbt_descr *md,
608 int chipsel)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700609{
610 struct nand_chip *this = mtd->priv;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700611 struct erase_info einfo;
612 int i, j, res, chip = 0;
613 int bits, startblock, dir, page, offs, numblocks, sft, sftmsk;
Thomas Gleixner9223a452006-05-23 17:21:03 +0200614 int nrchips, bbtoffs, pageoffs, ooboffs;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700615 uint8_t msk[4];
616 uint8_t rcode = td->reserved_block_code;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200617 size_t retlen, len = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700618 loff_t to;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200619 struct mtd_oob_ops ops;
620
621 ops.ooblen = mtd->oobsize;
622 ops.ooboffs = 0;
623 ops.datbuf = NULL;
624 ops.mode = MTD_OOB_PLACE;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700625
626 if (!rcode)
627 rcode = 0xff;
628 /* Write bad block table per chip rather than per device ? */
629 if (td->options & NAND_BBT_PERCHIP) {
David Woodhousee0c7d762006-05-13 18:07:53 +0100630 numblocks = (int)(this->chipsize >> this->bbt_erase_shift);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000631 /* Full device write or specific chip ? */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700632 if (chipsel == -1) {
633 nrchips = this->numchips;
634 } else {
635 nrchips = chipsel + 1;
636 chip = chipsel;
637 }
638 } else {
David Woodhousee0c7d762006-05-13 18:07:53 +0100639 numblocks = (int)(mtd->size >> this->bbt_erase_shift);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700640 nrchips = 1;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000641 }
642
Linus Torvalds1da177e2005-04-16 15:20:36 -0700643 /* Loop through the chips */
644 for (; chip < nrchips; chip++) {
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000645
646 /* There was already a version of the table, reuse the page
647 * This applies for absolute placement too, as we have the
Linus Torvalds1da177e2005-04-16 15:20:36 -0700648 * page nr. in td->pages.
649 */
650 if (td->pages[chip] != -1) {
651 page = td->pages[chip];
652 goto write;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000653 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700654
655 /* Automatic placement of the bad block table */
656 /* Search direction top -> down ? */
657 if (td->options & NAND_BBT_LASTBLOCK) {
658 startblock = numblocks * (chip + 1) - 1;
659 dir = -1;
660 } else {
661 startblock = chip * numblocks;
662 dir = 1;
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000663 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700664
665 for (i = 0; i < td->maxblocks; i++) {
666 int block = startblock + dir * i;
667 /* Check, if the block is bad */
Thomas Gleixner9223a452006-05-23 17:21:03 +0200668 switch ((this->bbt[block >> 2] >>
669 (2 * (block & 0x03))) & 0x03) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700670 case 0x01:
671 case 0x03:
672 continue;
673 }
Thomas Gleixner9223a452006-05-23 17:21:03 +0200674 page = block <<
675 (this->bbt_erase_shift - this->page_shift);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700676 /* Check, if the block is used by the mirror table */
677 if (!md || md->pages[chip] != page)
678 goto write;
679 }
David Woodhousee0c7d762006-05-13 18:07:53 +0100680 printk(KERN_ERR "No space left to write bad block table\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700681 return -ENOSPC;
David Woodhousee0c7d762006-05-13 18:07:53 +0100682 write:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700683
684 /* Set up shift count and masks for the flash table */
685 bits = td->options & NAND_BBT_NRBITS_MSK;
Thomas Gleixner9223a452006-05-23 17:21:03 +0200686 msk[2] = ~rcode;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700687 switch (bits) {
Thomas Gleixner9223a452006-05-23 17:21:03 +0200688 case 1: sft = 3; sftmsk = 0x07; msk[0] = 0x00; msk[1] = 0x01;
689 msk[3] = 0x01;
690 break;
691 case 2: sft = 2; sftmsk = 0x06; msk[0] = 0x00; msk[1] = 0x01;
692 msk[3] = 0x03;
693 break;
694 case 4: sft = 1; sftmsk = 0x04; msk[0] = 0x00; msk[1] = 0x0C;
695 msk[3] = 0x0f;
696 break;
697 case 8: sft = 0; sftmsk = 0x00; msk[0] = 0x00; msk[1] = 0x0F;
698 msk[3] = 0xff;
699 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700700 default: return -EINVAL;
701 }
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000702
Linus Torvalds1da177e2005-04-16 15:20:36 -0700703 bbtoffs = chip * (numblocks >> 2);
Thomas Gleixner61b03bd2005-11-07 11:15:49 +0000704
Linus Torvalds1da177e2005-04-16 15:20:36 -0700705 to = ((loff_t) page) << this->page_shift;
706
Linus Torvalds1da177e2005-04-16 15:20:36 -0700707 /* Must we save the block contents ? */
708 if (td->options & NAND_BBT_SAVECONTENT) {
709 /* Make it block aligned */
710 to &= ~((loff_t) ((1 << this->bbt_erase_shift) - 1));
711 len = 1 << this->bbt_erase_shift;
Thomas Gleixner9223a452006-05-23 17:21:03 +0200712 res = mtd->read(mtd, to, len, &retlen, buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700713 if (res < 0) {
714 if (retlen != len) {
Thomas Gleixner9223a452006-05-23 17:21:03 +0200715 printk(KERN_INFO "nand_bbt: Error "
716 "reading block for writing "
717 "the bad block table\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700718 return res;
719 }
Thomas Gleixner9223a452006-05-23 17:21:03 +0200720 printk(KERN_WARNING "nand_bbt: ECC error "
721 "while reading block for writing "
722 "bad block table\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700723 }
Thomas Gleixner9223a452006-05-23 17:21:03 +0200724 /* Read oob data */
Vitaly Wool70145682006-11-03 18:20:38 +0300725 ops.ooblen = (len >> this->page_shift) * mtd->oobsize;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200726 ops.oobbuf = &buf[len];
727 res = mtd->read_oob(mtd, to + mtd->writesize, &ops);
Vitaly Wool70145682006-11-03 18:20:38 +0300728 if (res < 0 || ops.oobretlen != ops.ooblen)
Thomas Gleixner9223a452006-05-23 17:21:03 +0200729 goto outerr;
730
Linus Torvalds1da177e2005-04-16 15:20:36 -0700731 /* Calc the byte offset in the buffer */
732 pageoffs = page - (int)(to >> this->page_shift);
733 offs = pageoffs << this->page_shift;
734 /* Preset the bbt area with 0xff */
David Woodhousee0c7d762006-05-13 18:07:53 +0100735 memset(&buf[offs], 0xff, (size_t) (numblocks >> sft));
Thomas Gleixner9223a452006-05-23 17:21:03 +0200736 ooboffs = len + (pageoffs * mtd->oobsize);
737
Linus Torvalds1da177e2005-04-16 15:20:36 -0700738 } else {
739 /* Calc length */
740 len = (size_t) (numblocks >> sft);
741 /* Make it page aligned ! */
Sebastian Andrzej Siewiorcda32092010-09-29 19:43:50 +0200742 len = ALIGN(len, mtd->writesize);
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);