1*d7e8ce10SKyungmin Park /* 2*d7e8ce10SKyungmin Park * linux/include/linux/mtd/bbm.h 3*d7e8ce10SKyungmin Park * 4*d7e8ce10SKyungmin Park * NAND family Bad Block Management (BBM) header file 5*d7e8ce10SKyungmin Park * - Bad Block Table (BBT) implementation 6*d7e8ce10SKyungmin Park * 7*d7e8ce10SKyungmin Park * Copyright (c) 2005-2007 Samsung Electronics 8*d7e8ce10SKyungmin Park * Kyungmin Park <kyungmin.park@samsung.com> 9*d7e8ce10SKyungmin Park * 10*d7e8ce10SKyungmin Park * Copyright (c) 2000-2005 11*d7e8ce10SKyungmin Park * Thomas Gleixner <tglx@linuxtronix.de> 12*d7e8ce10SKyungmin Park * 13*d7e8ce10SKyungmin Park * This program is free software; you can redistribute it and/or modify 14*d7e8ce10SKyungmin Park * it under the terms of the GNU General Public License version 2 as 15*d7e8ce10SKyungmin Park * published by the Free Software Foundation. 16*d7e8ce10SKyungmin Park */ 17*d7e8ce10SKyungmin Park #ifndef __LINUX_MTD_BBM_H 18*d7e8ce10SKyungmin Park #define __LINUX_MTD_BBM_H 19*d7e8ce10SKyungmin Park 20*d7e8ce10SKyungmin Park /* The maximum number of NAND chips in an array */ 21*d7e8ce10SKyungmin Park #ifndef NAND_MAX_CHIPS 22*d7e8ce10SKyungmin Park #define NAND_MAX_CHIPS 8 23*d7e8ce10SKyungmin Park #endif 24*d7e8ce10SKyungmin Park 25*d7e8ce10SKyungmin Park /** 26*d7e8ce10SKyungmin Park * struct nand_bbt_descr - bad block table descriptor 27*d7e8ce10SKyungmin Park * @param options options for this descriptor 28*d7e8ce10SKyungmin Park * @param pages the page(s) where we find the bbt, used with 29*d7e8ce10SKyungmin Park * option BBT_ABSPAGE when bbt is searched, 30*d7e8ce10SKyungmin Park * then we store the found bbts pages here. 31*d7e8ce10SKyungmin Park * Its an array and supports up to 8 chips now 32*d7e8ce10SKyungmin Park * @param offs offset of the pattern in the oob area of the page 33*d7e8ce10SKyungmin Park * @param veroffs offset of the bbt version counter in the oob are of the page 34*d7e8ce10SKyungmin Park * @param version version read from the bbt page during scan 35*d7e8ce10SKyungmin Park * @param len length of the pattern, if 0 no pattern check is performed 36*d7e8ce10SKyungmin Park * @param maxblocks maximum number of blocks to search for a bbt. This number of 37*d7e8ce10SKyungmin Park * blocks is reserved at the end of the device 38*d7e8ce10SKyungmin Park * where the tables are written. 39*d7e8ce10SKyungmin Park * @param reserved_block_code if non-0, this pattern denotes a reserved 40*d7e8ce10SKyungmin Park * (rather than bad) block in the stored bbt 41*d7e8ce10SKyungmin Park * @param pattern pattern to identify bad block table or factory marked 42*d7e8ce10SKyungmin Park * good / bad blocks, can be NULL, if len = 0 43*d7e8ce10SKyungmin Park * 44*d7e8ce10SKyungmin Park * Descriptor for the bad block table marker and the descriptor for the 45*d7e8ce10SKyungmin Park * pattern which identifies good and bad blocks. The assumption is made 46*d7e8ce10SKyungmin Park * that the pattern and the version count are always located in the oob area 47*d7e8ce10SKyungmin Park * of the first block. 48*d7e8ce10SKyungmin Park */ 49*d7e8ce10SKyungmin Park struct nand_bbt_descr { 50*d7e8ce10SKyungmin Park int options; 51*d7e8ce10SKyungmin Park int pages[NAND_MAX_CHIPS]; 52*d7e8ce10SKyungmin Park int offs; 53*d7e8ce10SKyungmin Park int veroffs; 54*d7e8ce10SKyungmin Park uint8_t version[NAND_MAX_CHIPS]; 55*d7e8ce10SKyungmin Park int len; 56*d7e8ce10SKyungmin Park int maxblocks; 57*d7e8ce10SKyungmin Park int reserved_block_code; 58*d7e8ce10SKyungmin Park uint8_t *pattern; 59*d7e8ce10SKyungmin Park }; 60*d7e8ce10SKyungmin Park 61*d7e8ce10SKyungmin Park /* Options for the bad block table descriptors */ 62*d7e8ce10SKyungmin Park 63*d7e8ce10SKyungmin Park /* The number of bits used per block in the bbt on the device */ 64*d7e8ce10SKyungmin Park #define NAND_BBT_NRBITS_MSK 0x0000000F 65*d7e8ce10SKyungmin Park #define NAND_BBT_1BIT 0x00000001 66*d7e8ce10SKyungmin Park #define NAND_BBT_2BIT 0x00000002 67*d7e8ce10SKyungmin Park #define NAND_BBT_4BIT 0x00000004 68*d7e8ce10SKyungmin Park #define NAND_BBT_8BIT 0x00000008 69*d7e8ce10SKyungmin Park /* The bad block table is in the last good block of the device */ 70*d7e8ce10SKyungmin Park #define NAND_BBT_LASTBLOCK 0x00000010 71*d7e8ce10SKyungmin Park /* The bbt is at the given page, else we must scan for the bbt */ 72*d7e8ce10SKyungmin Park #define NAND_BBT_ABSPAGE 0x00000020 73*d7e8ce10SKyungmin Park /* The bbt is at the given page, else we must scan for the bbt */ 74*d7e8ce10SKyungmin Park #define NAND_BBT_SEARCH 0x00000040 75*d7e8ce10SKyungmin Park /* bbt is stored per chip on multichip devices */ 76*d7e8ce10SKyungmin Park #define NAND_BBT_PERCHIP 0x00000080 77*d7e8ce10SKyungmin Park /* bbt has a version counter at offset veroffs */ 78*d7e8ce10SKyungmin Park #define NAND_BBT_VERSION 0x00000100 79*d7e8ce10SKyungmin Park /* Create a bbt if none axists */ 80*d7e8ce10SKyungmin Park #define NAND_BBT_CREATE 0x00000200 81*d7e8ce10SKyungmin Park /* Search good / bad pattern through all pages of a block */ 82*d7e8ce10SKyungmin Park #define NAND_BBT_SCANALLPAGES 0x00000400 83*d7e8ce10SKyungmin Park /* Scan block empty during good / bad block scan */ 84*d7e8ce10SKyungmin Park #define NAND_BBT_SCANEMPTY 0x00000800 85*d7e8ce10SKyungmin Park /* Write bbt if neccecary */ 86*d7e8ce10SKyungmin Park #define NAND_BBT_WRITE 0x00001000 87*d7e8ce10SKyungmin Park /* Read and write back block contents when writing bbt */ 88*d7e8ce10SKyungmin Park #define NAND_BBT_SAVECONTENT 0x00002000 89*d7e8ce10SKyungmin Park /* Search good / bad pattern on the first and the second page */ 90*d7e8ce10SKyungmin Park #define NAND_BBT_SCAN2NDPAGE 0x00004000 91*d7e8ce10SKyungmin Park 92*d7e8ce10SKyungmin Park /* The maximum number of blocks to scan for a bbt */ 93*d7e8ce10SKyungmin Park #define NAND_BBT_SCAN_MAXBLOCKS 4 94*d7e8ce10SKyungmin Park 95*d7e8ce10SKyungmin Park /* 96*d7e8ce10SKyungmin Park * Constants for oob configuration 97*d7e8ce10SKyungmin Park */ 98*d7e8ce10SKyungmin Park #define ONENAND_BADBLOCK_POS 0 99*d7e8ce10SKyungmin Park 100*d7e8ce10SKyungmin Park /** 101*d7e8ce10SKyungmin Park * struct bbt_info - [GENERIC] Bad Block Table data structure 102*d7e8ce10SKyungmin Park * @param bbt_erase_shift [INTERN] number of address bits in a bbt entry 103*d7e8ce10SKyungmin Park * @param badblockpos [INTERN] position of the bad block marker in the oob area 104*d7e8ce10SKyungmin Park * @param bbt [INTERN] bad block table pointer 105*d7e8ce10SKyungmin Park * @param badblock_pattern [REPLACEABLE] bad block scan pattern used for initial bad block scan 106*d7e8ce10SKyungmin Park * @param priv [OPTIONAL] pointer to private bbm date 107*d7e8ce10SKyungmin Park */ 108*d7e8ce10SKyungmin Park struct bbm_info { 109*d7e8ce10SKyungmin Park int bbt_erase_shift; 110*d7e8ce10SKyungmin Park int badblockpos; 111*d7e8ce10SKyungmin Park int options; 112*d7e8ce10SKyungmin Park 113*d7e8ce10SKyungmin Park uint8_t *bbt; 114*d7e8ce10SKyungmin Park 115*d7e8ce10SKyungmin Park int (*isbad_bbt) (struct mtd_info * mtd, loff_t ofs, int allowbbt); 116*d7e8ce10SKyungmin Park 117*d7e8ce10SKyungmin Park /* TODO Add more NAND specific fileds */ 118*d7e8ce10SKyungmin Park struct nand_bbt_descr *badblock_pattern; 119*d7e8ce10SKyungmin Park 120*d7e8ce10SKyungmin Park void *priv; 121*d7e8ce10SKyungmin Park }; 122*d7e8ce10SKyungmin Park 123*d7e8ce10SKyungmin Park /* OneNAND BBT interface */ 124*d7e8ce10SKyungmin Park extern int onenand_scan_bbt (struct mtd_info *mtd, struct nand_bbt_descr *bd); 125*d7e8ce10SKyungmin Park extern int onenand_default_bbt (struct mtd_info *mtd); 126*d7e8ce10SKyungmin Park 127*d7e8ce10SKyungmin Park #endif /* __LINUX_MTD_BBM_H */ 128