11da177e4SLinus Torvalds /* 21da177e4SLinus Torvalds * JFFS2 -- Journalling Flash File System, Version 2. 31da177e4SLinus Torvalds * 41da177e4SLinus Torvalds * Copyright (C) 2001-2003 Red Hat, Inc. 51da177e4SLinus Torvalds * 61da177e4SLinus Torvalds * Created by David Woodhouse <dwmw2@infradead.org> 71da177e4SLinus Torvalds * 81da177e4SLinus Torvalds * For licensing information, see the file 'LICENCE' in this directory. 91da177e4SLinus Torvalds * 10daba5cc4SArtem B. Bityutskiy * $Id: scan.c,v 1.125 2005/09/30 13:59:13 dedekind Exp $ 111da177e4SLinus Torvalds * 121da177e4SLinus Torvalds */ 131da177e4SLinus Torvalds #include <linux/kernel.h> 141da177e4SLinus Torvalds #include <linux/sched.h> 151da177e4SLinus Torvalds #include <linux/slab.h> 161da177e4SLinus Torvalds #include <linux/mtd/mtd.h> 171da177e4SLinus Torvalds #include <linux/pagemap.h> 181da177e4SLinus Torvalds #include <linux/crc32.h> 191da177e4SLinus Torvalds #include <linux/compiler.h> 201da177e4SLinus Torvalds #include "nodelist.h" 21e631ddbaSFerenc Havasi #include "summary.h" 22e631ddbaSFerenc Havasi #include "debug.h" 231da177e4SLinus Torvalds 243be36675SAndrew Victor #define DEFAULT_EMPTY_SCAN_SIZE 1024 251da177e4SLinus Torvalds 261da177e4SLinus Torvalds #define noisy_printk(noise, args...) do { \ 271da177e4SLinus Torvalds if (*(noise)) { \ 281da177e4SLinus Torvalds printk(KERN_NOTICE args); \ 291da177e4SLinus Torvalds (*(noise))--; \ 301da177e4SLinus Torvalds if (!(*(noise))) { \ 311da177e4SLinus Torvalds printk(KERN_NOTICE "Further such events for this erase block will not be printed\n"); \ 321da177e4SLinus Torvalds } \ 331da177e4SLinus Torvalds } \ 341da177e4SLinus Torvalds } while(0) 351da177e4SLinus Torvalds 361da177e4SLinus Torvalds static uint32_t pseudo_random; 371da177e4SLinus Torvalds 381da177e4SLinus Torvalds static int jffs2_scan_eraseblock (struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 39e631ddbaSFerenc Havasi unsigned char *buf, uint32_t buf_size, struct jffs2_summary *s); 401da177e4SLinus Torvalds 411da177e4SLinus Torvalds /* These helper functions _must_ increase ofs and also do the dirty/used space accounting. 421da177e4SLinus Torvalds * Returning an error will abort the mount - bad checksums etc. should just mark the space 431da177e4SLinus Torvalds * as dirty. 441da177e4SLinus Torvalds */ 451da177e4SLinus Torvalds static int jffs2_scan_inode_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 46e631ddbaSFerenc Havasi struct jffs2_raw_inode *ri, uint32_t ofs, struct jffs2_summary *s); 471da177e4SLinus Torvalds static int jffs2_scan_dirent_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 48e631ddbaSFerenc Havasi struct jffs2_raw_dirent *rd, uint32_t ofs, struct jffs2_summary *s); 491da177e4SLinus Torvalds 501da177e4SLinus Torvalds static inline int min_free(struct jffs2_sb_info *c) 511da177e4SLinus Torvalds { 521da177e4SLinus Torvalds uint32_t min = 2 * sizeof(struct jffs2_raw_inode); 532f82ce1eSAndrew Victor #ifdef CONFIG_JFFS2_FS_WRITEBUFFER 541da177e4SLinus Torvalds if (!jffs2_can_mark_obsolete(c) && min < c->wbuf_pagesize) 551da177e4SLinus Torvalds return c->wbuf_pagesize; 561da177e4SLinus Torvalds #endif 571da177e4SLinus Torvalds return min; 581da177e4SLinus Torvalds 591da177e4SLinus Torvalds } 603be36675SAndrew Victor 613be36675SAndrew Victor static inline uint32_t EMPTY_SCAN_SIZE(uint32_t sector_size) { 623be36675SAndrew Victor if (sector_size < DEFAULT_EMPTY_SCAN_SIZE) 633be36675SAndrew Victor return sector_size; 643be36675SAndrew Victor else 653be36675SAndrew Victor return DEFAULT_EMPTY_SCAN_SIZE; 663be36675SAndrew Victor } 673be36675SAndrew Victor 681da177e4SLinus Torvalds int jffs2_scan_medium(struct jffs2_sb_info *c) 691da177e4SLinus Torvalds { 701da177e4SLinus Torvalds int i, ret; 711da177e4SLinus Torvalds uint32_t empty_blocks = 0, bad_blocks = 0; 721da177e4SLinus Torvalds unsigned char *flashbuf = NULL; 731da177e4SLinus Torvalds uint32_t buf_size = 0; 74e631ddbaSFerenc Havasi struct jffs2_summary *s = NULL; /* summary info collected by the scan process */ 751da177e4SLinus Torvalds #ifndef __ECOS 761da177e4SLinus Torvalds size_t pointlen; 771da177e4SLinus Torvalds 781da177e4SLinus Torvalds if (c->mtd->point) { 791da177e4SLinus Torvalds ret = c->mtd->point (c->mtd, 0, c->mtd->size, &pointlen, &flashbuf); 801da177e4SLinus Torvalds if (!ret && pointlen < c->mtd->size) { 811da177e4SLinus Torvalds /* Don't muck about if it won't let us point to the whole flash */ 821da177e4SLinus Torvalds D1(printk(KERN_DEBUG "MTD point returned len too short: 0x%zx\n", pointlen)); 831da177e4SLinus Torvalds c->mtd->unpoint(c->mtd, flashbuf, 0, c->mtd->size); 841da177e4SLinus Torvalds flashbuf = NULL; 851da177e4SLinus Torvalds } 861da177e4SLinus Torvalds if (ret) 871da177e4SLinus Torvalds D1(printk(KERN_DEBUG "MTD point failed %d\n", ret)); 881da177e4SLinus Torvalds } 891da177e4SLinus Torvalds #endif 901da177e4SLinus Torvalds if (!flashbuf) { 911da177e4SLinus Torvalds /* For NAND it's quicker to read a whole eraseblock at a time, 921da177e4SLinus Torvalds apparently */ 931da177e4SLinus Torvalds if (jffs2_cleanmarker_oob(c)) 941da177e4SLinus Torvalds buf_size = c->sector_size; 951da177e4SLinus Torvalds else 961da177e4SLinus Torvalds buf_size = PAGE_SIZE; 971da177e4SLinus Torvalds 981da177e4SLinus Torvalds /* Respect kmalloc limitations */ 991da177e4SLinus Torvalds if (buf_size > 128*1024) 1001da177e4SLinus Torvalds buf_size = 128*1024; 1011da177e4SLinus Torvalds 1021da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Allocating readbuf of %d bytes\n", buf_size)); 1031da177e4SLinus Torvalds flashbuf = kmalloc(buf_size, GFP_KERNEL); 1041da177e4SLinus Torvalds if (!flashbuf) 1051da177e4SLinus Torvalds return -ENOMEM; 1061da177e4SLinus Torvalds } 1071da177e4SLinus Torvalds 108e631ddbaSFerenc Havasi if (jffs2_sum_active()) { 109e631ddbaSFerenc Havasi s = kmalloc(sizeof(struct jffs2_summary), GFP_KERNEL); 110e631ddbaSFerenc Havasi if (!s) { 111e631ddbaSFerenc Havasi JFFS2_WARNING("Can't allocate memory for summary\n"); 112e631ddbaSFerenc Havasi return -ENOMEM; 113e631ddbaSFerenc Havasi } 114e631ddbaSFerenc Havasi memset(s, 0, sizeof(struct jffs2_summary)); 115e631ddbaSFerenc Havasi } 116e631ddbaSFerenc Havasi 1171da177e4SLinus Torvalds for (i=0; i<c->nr_blocks; i++) { 1181da177e4SLinus Torvalds struct jffs2_eraseblock *jeb = &c->blocks[i]; 1191da177e4SLinus Torvalds 120e631ddbaSFerenc Havasi /* reset summary info for next eraseblock scan */ 121e631ddbaSFerenc Havasi jffs2_sum_reset_collected(s); 122e631ddbaSFerenc Havasi 123e631ddbaSFerenc Havasi ret = jffs2_scan_eraseblock(c, jeb, buf_size?flashbuf:(flashbuf+jeb->offset), 124e631ddbaSFerenc Havasi buf_size, s); 1251da177e4SLinus Torvalds 1261da177e4SLinus Torvalds if (ret < 0) 1271da177e4SLinus Torvalds goto out; 1281da177e4SLinus Torvalds 129e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_paranoia_check_nolock(c, jeb); 1301da177e4SLinus Torvalds 1311da177e4SLinus Torvalds /* Now decide which list to put it on */ 1321da177e4SLinus Torvalds switch(ret) { 1331da177e4SLinus Torvalds case BLK_STATE_ALLFF: 1341da177e4SLinus Torvalds /* 1351da177e4SLinus Torvalds * Empty block. Since we can't be sure it 1361da177e4SLinus Torvalds * was entirely erased, we just queue it for erase 1371da177e4SLinus Torvalds * again. It will be marked as such when the erase 1381da177e4SLinus Torvalds * is complete. Meanwhile we still count it as empty 1391da177e4SLinus Torvalds * for later checks. 1401da177e4SLinus Torvalds */ 1411da177e4SLinus Torvalds empty_blocks++; 1421da177e4SLinus Torvalds list_add(&jeb->list, &c->erase_pending_list); 1431da177e4SLinus Torvalds c->nr_erasing_blocks++; 1441da177e4SLinus Torvalds break; 1451da177e4SLinus Torvalds 1461da177e4SLinus Torvalds case BLK_STATE_CLEANMARKER: 1471da177e4SLinus Torvalds /* Only a CLEANMARKER node is valid */ 1481da177e4SLinus Torvalds if (!jeb->dirty_size) { 1491da177e4SLinus Torvalds /* It's actually free */ 1501da177e4SLinus Torvalds list_add(&jeb->list, &c->free_list); 1511da177e4SLinus Torvalds c->nr_free_blocks++; 1521da177e4SLinus Torvalds } else { 1531da177e4SLinus Torvalds /* Dirt */ 1541da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Adding all-dirty block at 0x%08x to erase_pending_list\n", jeb->offset)); 1551da177e4SLinus Torvalds list_add(&jeb->list, &c->erase_pending_list); 1561da177e4SLinus Torvalds c->nr_erasing_blocks++; 1571da177e4SLinus Torvalds } 1581da177e4SLinus Torvalds break; 1591da177e4SLinus Torvalds 1601da177e4SLinus Torvalds case BLK_STATE_CLEAN: 1611da177e4SLinus Torvalds /* Full (or almost full) of clean data. Clean list */ 1621da177e4SLinus Torvalds list_add(&jeb->list, &c->clean_list); 1631da177e4SLinus Torvalds break; 1641da177e4SLinus Torvalds 1651da177e4SLinus Torvalds case BLK_STATE_PARTDIRTY: 1661da177e4SLinus Torvalds /* Some data, but not full. Dirty list. */ 1671da177e4SLinus Torvalds /* We want to remember the block with most free space 1681da177e4SLinus Torvalds and stick it in the 'nextblock' position to start writing to it. */ 1691da177e4SLinus Torvalds if (jeb->free_size > min_free(c) && 1701da177e4SLinus Torvalds (!c->nextblock || c->nextblock->free_size < jeb->free_size)) { 1711da177e4SLinus Torvalds /* Better candidate for the next writes to go to */ 1721da177e4SLinus Torvalds if (c->nextblock) { 1731da177e4SLinus Torvalds c->nextblock->dirty_size += c->nextblock->free_size + c->nextblock->wasted_size; 1741da177e4SLinus Torvalds c->dirty_size += c->nextblock->free_size + c->nextblock->wasted_size; 1751da177e4SLinus Torvalds c->free_size -= c->nextblock->free_size; 1761da177e4SLinus Torvalds c->wasted_size -= c->nextblock->wasted_size; 1771da177e4SLinus Torvalds c->nextblock->free_size = c->nextblock->wasted_size = 0; 1781da177e4SLinus Torvalds if (VERYDIRTY(c, c->nextblock->dirty_size)) { 1791da177e4SLinus Torvalds list_add(&c->nextblock->list, &c->very_dirty_list); 1801da177e4SLinus Torvalds } else { 1811da177e4SLinus Torvalds list_add(&c->nextblock->list, &c->dirty_list); 1821da177e4SLinus Torvalds } 183e631ddbaSFerenc Havasi /* deleting summary information of the old nextblock */ 184e631ddbaSFerenc Havasi jffs2_sum_reset_collected(c->summary); 1851da177e4SLinus Torvalds } 186e631ddbaSFerenc Havasi /* update collected summary infromation for the current nextblock */ 187e631ddbaSFerenc Havasi jffs2_sum_move_collected(c, s); 188e631ddbaSFerenc Havasi D1(printk(KERN_DEBUG "jffs2_scan_medium(): new nextblock = 0x%08x\n", jeb->offset)); 1891da177e4SLinus Torvalds c->nextblock = jeb; 1901da177e4SLinus Torvalds } else { 1911da177e4SLinus Torvalds jeb->dirty_size += jeb->free_size + jeb->wasted_size; 1921da177e4SLinus Torvalds c->dirty_size += jeb->free_size + jeb->wasted_size; 1931da177e4SLinus Torvalds c->free_size -= jeb->free_size; 1941da177e4SLinus Torvalds c->wasted_size -= jeb->wasted_size; 1951da177e4SLinus Torvalds jeb->free_size = jeb->wasted_size = 0; 1961da177e4SLinus Torvalds if (VERYDIRTY(c, jeb->dirty_size)) { 1971da177e4SLinus Torvalds list_add(&jeb->list, &c->very_dirty_list); 1981da177e4SLinus Torvalds } else { 1991da177e4SLinus Torvalds list_add(&jeb->list, &c->dirty_list); 2001da177e4SLinus Torvalds } 2011da177e4SLinus Torvalds } 2021da177e4SLinus Torvalds break; 2031da177e4SLinus Torvalds 2041da177e4SLinus Torvalds case BLK_STATE_ALLDIRTY: 2051da177e4SLinus Torvalds /* Nothing valid - not even a clean marker. Needs erasing. */ 2061da177e4SLinus Torvalds /* For now we just put it on the erasing list. We'll start the erases later */ 2071da177e4SLinus Torvalds D1(printk(KERN_NOTICE "JFFS2: Erase block at 0x%08x is not formatted. It will be erased\n", jeb->offset)); 2081da177e4SLinus Torvalds list_add(&jeb->list, &c->erase_pending_list); 2091da177e4SLinus Torvalds c->nr_erasing_blocks++; 2101da177e4SLinus Torvalds break; 2111da177e4SLinus Torvalds 2121da177e4SLinus Torvalds case BLK_STATE_BADBLOCK: 2131da177e4SLinus Torvalds D1(printk(KERN_NOTICE "JFFS2: Block at 0x%08x is bad\n", jeb->offset)); 2141da177e4SLinus Torvalds list_add(&jeb->list, &c->bad_list); 2151da177e4SLinus Torvalds c->bad_size += c->sector_size; 2161da177e4SLinus Torvalds c->free_size -= c->sector_size; 2171da177e4SLinus Torvalds bad_blocks++; 2181da177e4SLinus Torvalds break; 2191da177e4SLinus Torvalds default: 2201da177e4SLinus Torvalds printk(KERN_WARNING "jffs2_scan_medium(): unknown block state\n"); 2211da177e4SLinus Torvalds BUG(); 2221da177e4SLinus Torvalds } 2231da177e4SLinus Torvalds } 2241da177e4SLinus Torvalds 2251da177e4SLinus Torvalds /* Nextblock dirty is always seen as wasted, because we cannot recycle it now */ 2261da177e4SLinus Torvalds if (c->nextblock && (c->nextblock->dirty_size)) { 2271da177e4SLinus Torvalds c->nextblock->wasted_size += c->nextblock->dirty_size; 2281da177e4SLinus Torvalds c->wasted_size += c->nextblock->dirty_size; 2291da177e4SLinus Torvalds c->dirty_size -= c->nextblock->dirty_size; 2301da177e4SLinus Torvalds c->nextblock->dirty_size = 0; 2311da177e4SLinus Torvalds } 2322f82ce1eSAndrew Victor #ifdef CONFIG_JFFS2_FS_WRITEBUFFER 233e96fb230SDavid Woodhouse if (!jffs2_can_mark_obsolete(c) && c->wbuf_pagesize && c->nextblock && (c->nextblock->free_size % c->wbuf_pagesize)) { 2341da177e4SLinus Torvalds /* If we're going to start writing into a block which already 2351da177e4SLinus Torvalds contains data, and the end of the data isn't page-aligned, 2361da177e4SLinus Torvalds skip a little and align it. */ 2371da177e4SLinus Torvalds 238daba5cc4SArtem B. Bityutskiy uint32_t skip = c->nextblock->free_size % c->wbuf_pagesize; 2391da177e4SLinus Torvalds 2401da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_scan_medium(): Skipping %d bytes in nextblock to ensure page alignment\n", 2411da177e4SLinus Torvalds skip)); 2421da177e4SLinus Torvalds c->nextblock->wasted_size += skip; 2431da177e4SLinus Torvalds c->wasted_size += skip; 2441da177e4SLinus Torvalds 2451da177e4SLinus Torvalds c->nextblock->free_size -= skip; 2461da177e4SLinus Torvalds c->free_size -= skip; 2471da177e4SLinus Torvalds } 2481da177e4SLinus Torvalds #endif 2491da177e4SLinus Torvalds if (c->nr_erasing_blocks) { 2501da177e4SLinus Torvalds if ( !c->used_size && ((c->nr_free_blocks+empty_blocks+bad_blocks)!= c->nr_blocks || bad_blocks == c->nr_blocks) ) { 2511da177e4SLinus Torvalds printk(KERN_NOTICE "Cowardly refusing to erase blocks on filesystem with no valid JFFS2 nodes\n"); 2521da177e4SLinus Torvalds printk(KERN_NOTICE "empty_blocks %d, bad_blocks %d, c->nr_blocks %d\n",empty_blocks,bad_blocks,c->nr_blocks); 2531da177e4SLinus Torvalds ret = -EIO; 2541da177e4SLinus Torvalds goto out; 2551da177e4SLinus Torvalds } 2561da177e4SLinus Torvalds jffs2_erase_pending_trigger(c); 2571da177e4SLinus Torvalds } 2581da177e4SLinus Torvalds ret = 0; 2591da177e4SLinus Torvalds out: 2601da177e4SLinus Torvalds if (buf_size) 2611da177e4SLinus Torvalds kfree(flashbuf); 2621da177e4SLinus Torvalds #ifndef __ECOS 2631da177e4SLinus Torvalds else 2641da177e4SLinus Torvalds c->mtd->unpoint(c->mtd, flashbuf, 0, c->mtd->size); 2651da177e4SLinus Torvalds #endif 2665b5ffbc1SFlorin Malita if (s) 2675b5ffbc1SFlorin Malita kfree(s); 2685b5ffbc1SFlorin Malita 2691da177e4SLinus Torvalds return ret; 2701da177e4SLinus Torvalds } 2711da177e4SLinus Torvalds 272e631ddbaSFerenc Havasi int jffs2_fill_scan_buf (struct jffs2_sb_info *c, void *buf, 2731da177e4SLinus Torvalds uint32_t ofs, uint32_t len) 2741da177e4SLinus Torvalds { 2751da177e4SLinus Torvalds int ret; 2761da177e4SLinus Torvalds size_t retlen; 2771da177e4SLinus Torvalds 2781da177e4SLinus Torvalds ret = jffs2_flash_read(c, ofs, len, &retlen, buf); 2791da177e4SLinus Torvalds if (ret) { 2801da177e4SLinus Torvalds D1(printk(KERN_WARNING "mtd->read(0x%x bytes from 0x%x) returned %d\n", len, ofs, ret)); 2811da177e4SLinus Torvalds return ret; 2821da177e4SLinus Torvalds } 2831da177e4SLinus Torvalds if (retlen < len) { 2841da177e4SLinus Torvalds D1(printk(KERN_WARNING "Read at 0x%x gave only 0x%zx bytes\n", ofs, retlen)); 2851da177e4SLinus Torvalds return -EIO; 2861da177e4SLinus Torvalds } 2871da177e4SLinus Torvalds return 0; 2881da177e4SLinus Torvalds } 2891da177e4SLinus Torvalds 290e631ddbaSFerenc Havasi int jffs2_scan_classify_jeb(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb) 291e631ddbaSFerenc Havasi { 292e631ddbaSFerenc Havasi if ((jeb->used_size + jeb->unchecked_size) == PAD(c->cleanmarker_size) && !jeb->dirty_size 293e631ddbaSFerenc Havasi && (!jeb->first_node || !jeb->first_node->next_phys) ) 294e631ddbaSFerenc Havasi return BLK_STATE_CLEANMARKER; 295e631ddbaSFerenc Havasi 296e631ddbaSFerenc Havasi /* move blocks with max 4 byte dirty space to cleanlist */ 297e631ddbaSFerenc Havasi else if (!ISDIRTY(c->sector_size - (jeb->used_size + jeb->unchecked_size))) { 298e631ddbaSFerenc Havasi c->dirty_size -= jeb->dirty_size; 299e631ddbaSFerenc Havasi c->wasted_size += jeb->dirty_size; 300e631ddbaSFerenc Havasi jeb->wasted_size += jeb->dirty_size; 301e631ddbaSFerenc Havasi jeb->dirty_size = 0; 302e631ddbaSFerenc Havasi return BLK_STATE_CLEAN; 303e631ddbaSFerenc Havasi } else if (jeb->used_size || jeb->unchecked_size) 304e631ddbaSFerenc Havasi return BLK_STATE_PARTDIRTY; 305e631ddbaSFerenc Havasi else 306e631ddbaSFerenc Havasi return BLK_STATE_ALLDIRTY; 307e631ddbaSFerenc Havasi } 308e631ddbaSFerenc Havasi 3099641b784SDavid Woodhouse /* Called with 'buf_size == 0' if buf is in fact a pointer _directly_ into 3109641b784SDavid Woodhouse the flash, XIP-style */ 3111da177e4SLinus Torvalds static int jffs2_scan_eraseblock (struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 312e631ddbaSFerenc Havasi unsigned char *buf, uint32_t buf_size, struct jffs2_summary *s) { 3131da177e4SLinus Torvalds struct jffs2_unknown_node *node; 3141da177e4SLinus Torvalds struct jffs2_unknown_node crcnode; 3151da177e4SLinus Torvalds uint32_t ofs, prevofs; 3161da177e4SLinus Torvalds uint32_t hdr_crc, buf_ofs, buf_len; 3171da177e4SLinus Torvalds int err; 3181da177e4SLinus Torvalds int noise = 0; 319e631ddbaSFerenc Havasi 320e631ddbaSFerenc Havasi 3212f82ce1eSAndrew Victor #ifdef CONFIG_JFFS2_FS_WRITEBUFFER 3221da177e4SLinus Torvalds int cleanmarkerfound = 0; 3231da177e4SLinus Torvalds #endif 3241da177e4SLinus Torvalds 3251da177e4SLinus Torvalds ofs = jeb->offset; 3261da177e4SLinus Torvalds prevofs = jeb->offset - 1; 3271da177e4SLinus Torvalds 3281da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_scan_eraseblock(): Scanning block at 0x%x\n", ofs)); 3291da177e4SLinus Torvalds 3302f82ce1eSAndrew Victor #ifdef CONFIG_JFFS2_FS_WRITEBUFFER 3311da177e4SLinus Torvalds if (jffs2_cleanmarker_oob(c)) { 3321da177e4SLinus Torvalds int ret = jffs2_check_nand_cleanmarker(c, jeb); 3331da177e4SLinus Torvalds D2(printk(KERN_NOTICE "jffs_check_nand_cleanmarker returned %d\n",ret)); 3341da177e4SLinus Torvalds /* Even if it's not found, we still scan to see 3351da177e4SLinus Torvalds if the block is empty. We use this information 3361da177e4SLinus Torvalds to decide whether to erase it or not. */ 3371da177e4SLinus Torvalds switch (ret) { 3381da177e4SLinus Torvalds case 0: cleanmarkerfound = 1; break; 3391da177e4SLinus Torvalds case 1: break; 3401da177e4SLinus Torvalds case 2: return BLK_STATE_BADBLOCK; 3411da177e4SLinus Torvalds case 3: return BLK_STATE_ALLDIRTY; /* Block has failed to erase min. once */ 3421da177e4SLinus Torvalds default: return ret; 3431da177e4SLinus Torvalds } 3441da177e4SLinus Torvalds } 3451da177e4SLinus Torvalds #endif 346e631ddbaSFerenc Havasi 347e631ddbaSFerenc Havasi if (jffs2_sum_active()) { 3489641b784SDavid Woodhouse struct jffs2_sum_marker *sm; 3499641b784SDavid Woodhouse void *sumptr = NULL; 3509641b784SDavid Woodhouse uint32_t sumlen; 351e631ddbaSFerenc Havasi 3529641b784SDavid Woodhouse if (!buf_size) { 3539641b784SDavid Woodhouse /* XIP case. Just look, point at the summary if it's there */ 3549641b784SDavid Woodhouse sm = (void *)buf + jeb->offset - sizeof(*sm); 355e631ddbaSFerenc Havasi if (je32_to_cpu(sm->magic) == JFFS2_SUM_MAGIC) { 3569641b784SDavid Woodhouse sumptr = buf + je32_to_cpu(sm->offset); 3579641b784SDavid Woodhouse sumlen = c->sector_size - je32_to_cpu(sm->offset); 3589641b784SDavid Woodhouse } 3599641b784SDavid Woodhouse } else { 3609641b784SDavid Woodhouse /* If NAND flash, read a whole page of it. Else just the end */ 3619641b784SDavid Woodhouse if (c->wbuf_pagesize) 3629641b784SDavid Woodhouse buf_len = c->wbuf_pagesize; 3639641b784SDavid Woodhouse else 3649641b784SDavid Woodhouse buf_len = sizeof(*sm); 3659641b784SDavid Woodhouse 3669641b784SDavid Woodhouse /* Read as much as we want into the _end_ of the preallocated buffer */ 3679641b784SDavid Woodhouse err = jffs2_fill_scan_buf(c, buf + buf_size - buf_len, 3689641b784SDavid Woodhouse jeb->offset + c->sector_size - buf_len, 3699641b784SDavid Woodhouse buf_len); 3709641b784SDavid Woodhouse if (err) 3719641b784SDavid Woodhouse return err; 3729641b784SDavid Woodhouse 3739641b784SDavid Woodhouse sm = (void *)buf + buf_size - sizeof(*sm); 3749641b784SDavid Woodhouse if (je32_to_cpu(sm->magic) == JFFS2_SUM_MAGIC) { 3759641b784SDavid Woodhouse sumlen = c->sector_size - je32_to_cpu(sm->offset); 3769641b784SDavid Woodhouse sumptr = buf + buf_size - sumlen; 3779641b784SDavid Woodhouse 3789641b784SDavid Woodhouse /* Now, make sure the summary itself is available */ 3799641b784SDavid Woodhouse if (sumlen > buf_size) { 3809641b784SDavid Woodhouse /* Need to kmalloc for this. */ 3819641b784SDavid Woodhouse sumptr = kmalloc(sumlen, GFP_KERNEL); 3829641b784SDavid Woodhouse if (!sumptr) 3839641b784SDavid Woodhouse return -ENOMEM; 3849641b784SDavid Woodhouse memcpy(sumptr + sumlen - buf_len, buf + buf_size - buf_len, buf_len); 3859641b784SDavid Woodhouse } 3869641b784SDavid Woodhouse if (buf_len < sumlen) { 3879641b784SDavid Woodhouse /* Need to read more so that the entire summary node is present */ 3889641b784SDavid Woodhouse err = jffs2_fill_scan_buf(c, sumptr, 3899641b784SDavid Woodhouse jeb->offset + c->sector_size - sumlen, 3909641b784SDavid Woodhouse sumlen - buf_len); 3919641b784SDavid Woodhouse if (err) 392e631ddbaSFerenc Havasi return err; 393e631ddbaSFerenc Havasi } 394e631ddbaSFerenc Havasi } 395e631ddbaSFerenc Havasi 3969641b784SDavid Woodhouse } 3979641b784SDavid Woodhouse 3989641b784SDavid Woodhouse if (sumptr) { 3999641b784SDavid Woodhouse err = jffs2_sum_scan_sumnode(c, jeb, sumptr, sumlen, &pseudo_random); 4009641b784SDavid Woodhouse if (err) 4019641b784SDavid Woodhouse return err; 4029641b784SDavid Woodhouse if (buf_size && sumlen > buf_size) 4039641b784SDavid Woodhouse kfree(sumptr); 4049641b784SDavid Woodhouse } 405e631ddbaSFerenc Havasi } 406e631ddbaSFerenc Havasi 4071da177e4SLinus Torvalds buf_ofs = jeb->offset; 4081da177e4SLinus Torvalds 4091da177e4SLinus Torvalds if (!buf_size) { 4109641b784SDavid Woodhouse /* This is the XIP case -- we're reading _directly_ from the flash chip */ 4111da177e4SLinus Torvalds buf_len = c->sector_size; 4121da177e4SLinus Torvalds } else { 4133be36675SAndrew Victor buf_len = EMPTY_SCAN_SIZE(c->sector_size); 4141da177e4SLinus Torvalds err = jffs2_fill_scan_buf(c, buf, buf_ofs, buf_len); 4151da177e4SLinus Torvalds if (err) 4161da177e4SLinus Torvalds return err; 4171da177e4SLinus Torvalds } 4181da177e4SLinus Torvalds 4191da177e4SLinus Torvalds /* We temporarily use 'ofs' as a pointer into the buffer/jeb */ 4201da177e4SLinus Torvalds ofs = 0; 4211da177e4SLinus Torvalds 4221da177e4SLinus Torvalds /* Scan only 4KiB of 0xFF before declaring it's empty */ 4233be36675SAndrew Victor while(ofs < EMPTY_SCAN_SIZE(c->sector_size) && *(uint32_t *)(&buf[ofs]) == 0xFFFFFFFF) 4241da177e4SLinus Torvalds ofs += 4; 4251da177e4SLinus Torvalds 4263be36675SAndrew Victor if (ofs == EMPTY_SCAN_SIZE(c->sector_size)) { 4272f82ce1eSAndrew Victor #ifdef CONFIG_JFFS2_FS_WRITEBUFFER 4281da177e4SLinus Torvalds if (jffs2_cleanmarker_oob(c)) { 4291da177e4SLinus Torvalds /* scan oob, take care of cleanmarker */ 4301da177e4SLinus Torvalds int ret = jffs2_check_oob_empty(c, jeb, cleanmarkerfound); 4311da177e4SLinus Torvalds D2(printk(KERN_NOTICE "jffs2_check_oob_empty returned %d\n",ret)); 4321da177e4SLinus Torvalds switch (ret) { 4331da177e4SLinus Torvalds case 0: return cleanmarkerfound ? BLK_STATE_CLEANMARKER : BLK_STATE_ALLFF; 4341da177e4SLinus Torvalds case 1: return BLK_STATE_ALLDIRTY; 4351da177e4SLinus Torvalds default: return ret; 4361da177e4SLinus Torvalds } 4371da177e4SLinus Torvalds } 4381da177e4SLinus Torvalds #endif 4391da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Block at 0x%08x is empty (erased)\n", jeb->offset)); 4408f15fd55SAndrew Victor if (c->cleanmarker_size == 0) 4418f15fd55SAndrew Victor return BLK_STATE_CLEANMARKER; /* don't bother with re-erase */ 4428f15fd55SAndrew Victor else 4431da177e4SLinus Torvalds return BLK_STATE_ALLFF; /* OK to erase if all blocks are like this */ 4441da177e4SLinus Torvalds } 4451da177e4SLinus Torvalds if (ofs) { 4461da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Free space at %08x ends at %08x\n", jeb->offset, 4471da177e4SLinus Torvalds jeb->offset + ofs)); 4481da177e4SLinus Torvalds DIRTY_SPACE(ofs); 4491da177e4SLinus Torvalds } 4501da177e4SLinus Torvalds 4511da177e4SLinus Torvalds /* Now ofs is a complete physical flash offset as it always was... */ 4521da177e4SLinus Torvalds ofs += jeb->offset; 4531da177e4SLinus Torvalds 4541da177e4SLinus Torvalds noise = 10; 4551da177e4SLinus Torvalds 456733802d9SArtem B. Bityutskiy dbg_summary("no summary found in jeb 0x%08x. Apply original scan.\n",jeb->offset); 457e631ddbaSFerenc Havasi 4581da177e4SLinus Torvalds scan_more: 4591da177e4SLinus Torvalds while(ofs < jeb->offset + c->sector_size) { 4601da177e4SLinus Torvalds 461e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_paranoia_check_nolock(c, jeb); 4621da177e4SLinus Torvalds 4631da177e4SLinus Torvalds cond_resched(); 4641da177e4SLinus Torvalds 4651da177e4SLinus Torvalds if (ofs & 3) { 4661da177e4SLinus Torvalds printk(KERN_WARNING "Eep. ofs 0x%08x not word-aligned!\n", ofs); 4671da177e4SLinus Torvalds ofs = PAD(ofs); 4681da177e4SLinus Torvalds continue; 4691da177e4SLinus Torvalds } 4701da177e4SLinus Torvalds if (ofs == prevofs) { 4711da177e4SLinus Torvalds printk(KERN_WARNING "ofs 0x%08x has already been seen. Skipping\n", ofs); 4721da177e4SLinus Torvalds DIRTY_SPACE(4); 4731da177e4SLinus Torvalds ofs += 4; 4741da177e4SLinus Torvalds continue; 4751da177e4SLinus Torvalds } 4761da177e4SLinus Torvalds prevofs = ofs; 4771da177e4SLinus Torvalds 4781da177e4SLinus Torvalds if (jeb->offset + c->sector_size < ofs + sizeof(*node)) { 4791da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Fewer than %zd bytes left to end of block. (%x+%x<%x+%zx) Not reading\n", sizeof(struct jffs2_unknown_node), 4801da177e4SLinus Torvalds jeb->offset, c->sector_size, ofs, sizeof(*node))); 4811da177e4SLinus Torvalds DIRTY_SPACE((jeb->offset + c->sector_size)-ofs); 4821da177e4SLinus Torvalds break; 4831da177e4SLinus Torvalds } 4841da177e4SLinus Torvalds 4851da177e4SLinus Torvalds if (buf_ofs + buf_len < ofs + sizeof(*node)) { 4861da177e4SLinus Torvalds buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); 4871da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Fewer than %zd bytes (node header) left to end of buf. Reading 0x%x at 0x%08x\n", 4881da177e4SLinus Torvalds sizeof(struct jffs2_unknown_node), buf_len, ofs)); 4891da177e4SLinus Torvalds err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); 4901da177e4SLinus Torvalds if (err) 4911da177e4SLinus Torvalds return err; 4921da177e4SLinus Torvalds buf_ofs = ofs; 4931da177e4SLinus Torvalds } 4941da177e4SLinus Torvalds 4951da177e4SLinus Torvalds node = (struct jffs2_unknown_node *)&buf[ofs-buf_ofs]; 4961da177e4SLinus Torvalds 4971da177e4SLinus Torvalds if (*(uint32_t *)(&buf[ofs-buf_ofs]) == 0xffffffff) { 4981da177e4SLinus Torvalds uint32_t inbuf_ofs; 4991da177e4SLinus Torvalds uint32_t empty_start; 5001da177e4SLinus Torvalds 5011da177e4SLinus Torvalds empty_start = ofs; 5021da177e4SLinus Torvalds ofs += 4; 5031da177e4SLinus Torvalds 5041da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Found empty flash at 0x%08x\n", ofs)); 5051da177e4SLinus Torvalds more_empty: 5061da177e4SLinus Torvalds inbuf_ofs = ofs - buf_ofs; 5071da177e4SLinus Torvalds while (inbuf_ofs < buf_len) { 5081da177e4SLinus Torvalds if (*(uint32_t *)(&buf[inbuf_ofs]) != 0xffffffff) { 5091da177e4SLinus Torvalds printk(KERN_WARNING "Empty flash at 0x%08x ends at 0x%08x\n", 5101da177e4SLinus Torvalds empty_start, ofs); 5111da177e4SLinus Torvalds DIRTY_SPACE(ofs-empty_start); 5121da177e4SLinus Torvalds goto scan_more; 5131da177e4SLinus Torvalds } 5141da177e4SLinus Torvalds 5151da177e4SLinus Torvalds inbuf_ofs+=4; 5161da177e4SLinus Torvalds ofs += 4; 5171da177e4SLinus Torvalds } 5181da177e4SLinus Torvalds /* Ran off end. */ 5191da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Empty flash to end of buffer at 0x%08x\n", ofs)); 5201da177e4SLinus Torvalds 5211da177e4SLinus Torvalds /* If we're only checking the beginning of a block with a cleanmarker, 5221da177e4SLinus Torvalds bail now */ 5231da177e4SLinus Torvalds if (buf_ofs == jeb->offset && jeb->used_size == PAD(c->cleanmarker_size) && 524b81226c5SArtem B. Bityuckiy c->cleanmarker_size && !jeb->dirty_size && !jeb->first_node->next_phys) { 5253be36675SAndrew Victor D1(printk(KERN_DEBUG "%d bytes at start of block seems clean... assuming all clean\n", EMPTY_SCAN_SIZE(c->sector_size))); 5261da177e4SLinus Torvalds return BLK_STATE_CLEANMARKER; 5271da177e4SLinus Torvalds } 5281da177e4SLinus Torvalds 5291da177e4SLinus Torvalds /* See how much more there is to read in this eraseblock... */ 5301da177e4SLinus Torvalds buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); 5311da177e4SLinus Torvalds if (!buf_len) { 5321da177e4SLinus Torvalds /* No more to read. Break out of main loop without marking 5331da177e4SLinus Torvalds this range of empty space as dirty (because it's not) */ 5341da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Empty flash at %08x runs to end of block. Treating as free_space\n", 5351da177e4SLinus Torvalds empty_start)); 5361da177e4SLinus Torvalds break; 5371da177e4SLinus Torvalds } 5381da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Reading another 0x%x at 0x%08x\n", buf_len, ofs)); 5391da177e4SLinus Torvalds err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); 5401da177e4SLinus Torvalds if (err) 5411da177e4SLinus Torvalds return err; 5421da177e4SLinus Torvalds buf_ofs = ofs; 5431da177e4SLinus Torvalds goto more_empty; 5441da177e4SLinus Torvalds } 5451da177e4SLinus Torvalds 5461da177e4SLinus Torvalds if (ofs == jeb->offset && je16_to_cpu(node->magic) == KSAMTIB_CIGAM_2SFFJ) { 5471da177e4SLinus Torvalds printk(KERN_WARNING "Magic bitmask is backwards at offset 0x%08x. Wrong endian filesystem?\n", ofs); 5481da177e4SLinus Torvalds DIRTY_SPACE(4); 5491da177e4SLinus Torvalds ofs += 4; 5501da177e4SLinus Torvalds continue; 5511da177e4SLinus Torvalds } 5521da177e4SLinus Torvalds if (je16_to_cpu(node->magic) == JFFS2_DIRTY_BITMASK) { 5531da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Dirty bitmask at 0x%08x\n", ofs)); 5541da177e4SLinus Torvalds DIRTY_SPACE(4); 5551da177e4SLinus Torvalds ofs += 4; 5561da177e4SLinus Torvalds continue; 5571da177e4SLinus Torvalds } 5581da177e4SLinus Torvalds if (je16_to_cpu(node->magic) == JFFS2_OLD_MAGIC_BITMASK) { 5591da177e4SLinus Torvalds printk(KERN_WARNING "Old JFFS2 bitmask found at 0x%08x\n", ofs); 5601da177e4SLinus Torvalds printk(KERN_WARNING "You cannot use older JFFS2 filesystems with newer kernels\n"); 5611da177e4SLinus Torvalds DIRTY_SPACE(4); 5621da177e4SLinus Torvalds ofs += 4; 5631da177e4SLinus Torvalds continue; 5641da177e4SLinus Torvalds } 5651da177e4SLinus Torvalds if (je16_to_cpu(node->magic) != JFFS2_MAGIC_BITMASK) { 5661da177e4SLinus Torvalds /* OK. We're out of possibilities. Whinge and move on */ 5671da177e4SLinus Torvalds noisy_printk(&noise, "jffs2_scan_eraseblock(): Magic bitmask 0x%04x not found at 0x%08x: 0x%04x instead\n", 5681da177e4SLinus Torvalds JFFS2_MAGIC_BITMASK, ofs, 5691da177e4SLinus Torvalds je16_to_cpu(node->magic)); 5701da177e4SLinus Torvalds DIRTY_SPACE(4); 5711da177e4SLinus Torvalds ofs += 4; 5721da177e4SLinus Torvalds continue; 5731da177e4SLinus Torvalds } 5741da177e4SLinus Torvalds /* We seem to have a node of sorts. Check the CRC */ 5751da177e4SLinus Torvalds crcnode.magic = node->magic; 5761da177e4SLinus Torvalds crcnode.nodetype = cpu_to_je16( je16_to_cpu(node->nodetype) | JFFS2_NODE_ACCURATE); 5771da177e4SLinus Torvalds crcnode.totlen = node->totlen; 5781da177e4SLinus Torvalds hdr_crc = crc32(0, &crcnode, sizeof(crcnode)-4); 5791da177e4SLinus Torvalds 5801da177e4SLinus Torvalds if (hdr_crc != je32_to_cpu(node->hdr_crc)) { 5811da177e4SLinus Torvalds noisy_printk(&noise, "jffs2_scan_eraseblock(): Node at 0x%08x {0x%04x, 0x%04x, 0x%08x) has invalid CRC 0x%08x (calculated 0x%08x)\n", 5821da177e4SLinus Torvalds ofs, je16_to_cpu(node->magic), 5831da177e4SLinus Torvalds je16_to_cpu(node->nodetype), 5841da177e4SLinus Torvalds je32_to_cpu(node->totlen), 5851da177e4SLinus Torvalds je32_to_cpu(node->hdr_crc), 5861da177e4SLinus Torvalds hdr_crc); 5871da177e4SLinus Torvalds DIRTY_SPACE(4); 5881da177e4SLinus Torvalds ofs += 4; 5891da177e4SLinus Torvalds continue; 5901da177e4SLinus Torvalds } 5911da177e4SLinus Torvalds 5921da177e4SLinus Torvalds if (ofs + je32_to_cpu(node->totlen) > 5931da177e4SLinus Torvalds jeb->offset + c->sector_size) { 5941da177e4SLinus Torvalds /* Eep. Node goes over the end of the erase block. */ 5951da177e4SLinus Torvalds printk(KERN_WARNING "Node at 0x%08x with length 0x%08x would run over the end of the erase block\n", 5961da177e4SLinus Torvalds ofs, je32_to_cpu(node->totlen)); 5971da177e4SLinus Torvalds printk(KERN_WARNING "Perhaps the file system was created with the wrong erase size?\n"); 5981da177e4SLinus Torvalds DIRTY_SPACE(4); 5991da177e4SLinus Torvalds ofs += 4; 6001da177e4SLinus Torvalds continue; 6011da177e4SLinus Torvalds } 6021da177e4SLinus Torvalds 6031da177e4SLinus Torvalds if (!(je16_to_cpu(node->nodetype) & JFFS2_NODE_ACCURATE)) { 6041da177e4SLinus Torvalds /* Wheee. This is an obsoleted node */ 6051da177e4SLinus Torvalds D2(printk(KERN_DEBUG "Node at 0x%08x is obsolete. Skipping\n", ofs)); 6061da177e4SLinus Torvalds DIRTY_SPACE(PAD(je32_to_cpu(node->totlen))); 6071da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 6081da177e4SLinus Torvalds continue; 6091da177e4SLinus Torvalds } 6101da177e4SLinus Torvalds 6111da177e4SLinus Torvalds switch(je16_to_cpu(node->nodetype)) { 6121da177e4SLinus Torvalds case JFFS2_NODETYPE_INODE: 6131da177e4SLinus Torvalds if (buf_ofs + buf_len < ofs + sizeof(struct jffs2_raw_inode)) { 6141da177e4SLinus Torvalds buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); 6151da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Fewer than %zd bytes (inode node) left to end of buf. Reading 0x%x at 0x%08x\n", 6161da177e4SLinus Torvalds sizeof(struct jffs2_raw_inode), buf_len, ofs)); 6171da177e4SLinus Torvalds err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); 6181da177e4SLinus Torvalds if (err) 6191da177e4SLinus Torvalds return err; 6201da177e4SLinus Torvalds buf_ofs = ofs; 6211da177e4SLinus Torvalds node = (void *)buf; 6221da177e4SLinus Torvalds } 623e631ddbaSFerenc Havasi err = jffs2_scan_inode_node(c, jeb, (void *)node, ofs, s); 6241da177e4SLinus Torvalds if (err) return err; 6251da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 6261da177e4SLinus Torvalds break; 6271da177e4SLinus Torvalds 6281da177e4SLinus Torvalds case JFFS2_NODETYPE_DIRENT: 6291da177e4SLinus Torvalds if (buf_ofs + buf_len < ofs + je32_to_cpu(node->totlen)) { 6301da177e4SLinus Torvalds buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); 6311da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Fewer than %d bytes (dirent node) left to end of buf. Reading 0x%x at 0x%08x\n", 6321da177e4SLinus Torvalds je32_to_cpu(node->totlen), buf_len, ofs)); 6331da177e4SLinus Torvalds err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); 6341da177e4SLinus Torvalds if (err) 6351da177e4SLinus Torvalds return err; 6361da177e4SLinus Torvalds buf_ofs = ofs; 6371da177e4SLinus Torvalds node = (void *)buf; 6381da177e4SLinus Torvalds } 639e631ddbaSFerenc Havasi err = jffs2_scan_dirent_node(c, jeb, (void *)node, ofs, s); 6401da177e4SLinus Torvalds if (err) return err; 6411da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 6421da177e4SLinus Torvalds break; 6431da177e4SLinus Torvalds 6441da177e4SLinus Torvalds case JFFS2_NODETYPE_CLEANMARKER: 6451da177e4SLinus Torvalds D1(printk(KERN_DEBUG "CLEANMARKER node found at 0x%08x\n", ofs)); 6461da177e4SLinus Torvalds if (je32_to_cpu(node->totlen) != c->cleanmarker_size) { 6471da177e4SLinus Torvalds printk(KERN_NOTICE "CLEANMARKER node found at 0x%08x has totlen 0x%x != normal 0x%x\n", 6481da177e4SLinus Torvalds ofs, je32_to_cpu(node->totlen), c->cleanmarker_size); 6491da177e4SLinus Torvalds DIRTY_SPACE(PAD(sizeof(struct jffs2_unknown_node))); 6501da177e4SLinus Torvalds ofs += PAD(sizeof(struct jffs2_unknown_node)); 6511da177e4SLinus Torvalds } else if (jeb->first_node) { 6521da177e4SLinus Torvalds printk(KERN_NOTICE "CLEANMARKER node found at 0x%08x, not first node in block (0x%08x)\n", ofs, jeb->offset); 6531da177e4SLinus Torvalds DIRTY_SPACE(PAD(sizeof(struct jffs2_unknown_node))); 6541da177e4SLinus Torvalds ofs += PAD(sizeof(struct jffs2_unknown_node)); 6551da177e4SLinus Torvalds } else { 6561da177e4SLinus Torvalds struct jffs2_raw_node_ref *marker_ref = jffs2_alloc_raw_node_ref(); 6571da177e4SLinus Torvalds if (!marker_ref) { 6581da177e4SLinus Torvalds printk(KERN_NOTICE "Failed to allocate node ref for clean marker\n"); 6591da177e4SLinus Torvalds return -ENOMEM; 6601da177e4SLinus Torvalds } 6611da177e4SLinus Torvalds marker_ref->next_in_ino = NULL; 6621da177e4SLinus Torvalds marker_ref->next_phys = NULL; 6631da177e4SLinus Torvalds marker_ref->flash_offset = ofs | REF_NORMAL; 6641da177e4SLinus Torvalds marker_ref->__totlen = c->cleanmarker_size; 6651da177e4SLinus Torvalds jeb->first_node = jeb->last_node = marker_ref; 6661da177e4SLinus Torvalds 6671da177e4SLinus Torvalds USED_SPACE(PAD(c->cleanmarker_size)); 6681da177e4SLinus Torvalds ofs += PAD(c->cleanmarker_size); 6691da177e4SLinus Torvalds } 6701da177e4SLinus Torvalds break; 6711da177e4SLinus Torvalds 6721da177e4SLinus Torvalds case JFFS2_NODETYPE_PADDING: 673e631ddbaSFerenc Havasi if (jffs2_sum_active()) 674e631ddbaSFerenc Havasi jffs2_sum_add_padding_mem(s, je32_to_cpu(node->totlen)); 6751da177e4SLinus Torvalds DIRTY_SPACE(PAD(je32_to_cpu(node->totlen))); 6761da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 6771da177e4SLinus Torvalds break; 6781da177e4SLinus Torvalds 6791da177e4SLinus Torvalds default: 6801da177e4SLinus Torvalds switch (je16_to_cpu(node->nodetype) & JFFS2_COMPAT_MASK) { 6811da177e4SLinus Torvalds case JFFS2_FEATURE_ROCOMPAT: 6821da177e4SLinus Torvalds printk(KERN_NOTICE "Read-only compatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs); 6831da177e4SLinus Torvalds c->flags |= JFFS2_SB_FLAG_RO; 6841da177e4SLinus Torvalds if (!(jffs2_is_readonly(c))) 6851da177e4SLinus Torvalds return -EROFS; 6861da177e4SLinus Torvalds DIRTY_SPACE(PAD(je32_to_cpu(node->totlen))); 6871da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 6881da177e4SLinus Torvalds break; 6891da177e4SLinus Torvalds 6901da177e4SLinus Torvalds case JFFS2_FEATURE_INCOMPAT: 6911da177e4SLinus Torvalds printk(KERN_NOTICE "Incompatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs); 6921da177e4SLinus Torvalds return -EINVAL; 6931da177e4SLinus Torvalds 6941da177e4SLinus Torvalds case JFFS2_FEATURE_RWCOMPAT_DELETE: 6951da177e4SLinus Torvalds D1(printk(KERN_NOTICE "Unknown but compatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs)); 6961da177e4SLinus Torvalds DIRTY_SPACE(PAD(je32_to_cpu(node->totlen))); 6971da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 6981da177e4SLinus Torvalds break; 6991da177e4SLinus Torvalds 7001da177e4SLinus Torvalds case JFFS2_FEATURE_RWCOMPAT_COPY: 7011da177e4SLinus Torvalds D1(printk(KERN_NOTICE "Unknown but compatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs)); 7021da177e4SLinus Torvalds USED_SPACE(PAD(je32_to_cpu(node->totlen))); 7031da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 7041da177e4SLinus Torvalds break; 7051da177e4SLinus Torvalds } 7061da177e4SLinus Torvalds } 7071da177e4SLinus Torvalds } 7081da177e4SLinus Torvalds 709e631ddbaSFerenc Havasi if (jffs2_sum_active()) { 710e631ddbaSFerenc Havasi if (PAD(s->sum_size + JFFS2_SUMMARY_FRAME_SIZE) > jeb->free_size) { 711733802d9SArtem B. Bityutskiy dbg_summary("There is not enough space for " 712e631ddbaSFerenc Havasi "summary information, disabling for this jeb!\n"); 713e631ddbaSFerenc Havasi jffs2_sum_disable_collecting(s); 714e631ddbaSFerenc Havasi } 715e631ddbaSFerenc Havasi } 7161da177e4SLinus Torvalds 7171da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Block at 0x%08x: free 0x%08x, dirty 0x%08x, unchecked 0x%08x, used 0x%08x\n", jeb->offset, 7181da177e4SLinus Torvalds jeb->free_size, jeb->dirty_size, jeb->unchecked_size, jeb->used_size)); 7191da177e4SLinus Torvalds 7201da177e4SLinus Torvalds /* mark_node_obsolete can add to wasted !! */ 7211da177e4SLinus Torvalds if (jeb->wasted_size) { 7221da177e4SLinus Torvalds jeb->dirty_size += jeb->wasted_size; 7231da177e4SLinus Torvalds c->dirty_size += jeb->wasted_size; 7241da177e4SLinus Torvalds c->wasted_size -= jeb->wasted_size; 7251da177e4SLinus Torvalds jeb->wasted_size = 0; 7261da177e4SLinus Torvalds } 7271da177e4SLinus Torvalds 728e631ddbaSFerenc Havasi return jffs2_scan_classify_jeb(c, jeb); 7291da177e4SLinus Torvalds } 7301da177e4SLinus Torvalds 731e631ddbaSFerenc Havasi struct jffs2_inode_cache *jffs2_scan_make_ino_cache(struct jffs2_sb_info *c, uint32_t ino) 7321da177e4SLinus Torvalds { 7331da177e4SLinus Torvalds struct jffs2_inode_cache *ic; 7341da177e4SLinus Torvalds 7351da177e4SLinus Torvalds ic = jffs2_get_ino_cache(c, ino); 7361da177e4SLinus Torvalds if (ic) 7371da177e4SLinus Torvalds return ic; 7381da177e4SLinus Torvalds 7391da177e4SLinus Torvalds if (ino > c->highest_ino) 7401da177e4SLinus Torvalds c->highest_ino = ino; 7411da177e4SLinus Torvalds 7421da177e4SLinus Torvalds ic = jffs2_alloc_inode_cache(); 7431da177e4SLinus Torvalds if (!ic) { 7441da177e4SLinus Torvalds printk(KERN_NOTICE "jffs2_scan_make_inode_cache(): allocation of inode cache failed\n"); 7451da177e4SLinus Torvalds return NULL; 7461da177e4SLinus Torvalds } 7471da177e4SLinus Torvalds memset(ic, 0, sizeof(*ic)); 7481da177e4SLinus Torvalds 7491da177e4SLinus Torvalds ic->ino = ino; 7501da177e4SLinus Torvalds ic->nodes = (void *)ic; 7511da177e4SLinus Torvalds jffs2_add_ino_cache(c, ic); 7521da177e4SLinus Torvalds if (ino == 1) 7531da177e4SLinus Torvalds ic->nlink = 1; 7541da177e4SLinus Torvalds return ic; 7551da177e4SLinus Torvalds } 7561da177e4SLinus Torvalds 7571da177e4SLinus Torvalds static int jffs2_scan_inode_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 758e631ddbaSFerenc Havasi struct jffs2_raw_inode *ri, uint32_t ofs, struct jffs2_summary *s) 7591da177e4SLinus Torvalds { 7601da177e4SLinus Torvalds struct jffs2_raw_node_ref *raw; 7611da177e4SLinus Torvalds struct jffs2_inode_cache *ic; 7621da177e4SLinus Torvalds uint32_t ino = je32_to_cpu(ri->ino); 7631da177e4SLinus Torvalds 7641da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_scan_inode_node(): Node at 0x%08x\n", ofs)); 7651da177e4SLinus Torvalds 7661da177e4SLinus Torvalds /* We do very little here now. Just check the ino# to which we should attribute 7671da177e4SLinus Torvalds this node; we can do all the CRC checking etc. later. There's a tradeoff here -- 7681da177e4SLinus Torvalds we used to scan the flash once only, reading everything we want from it into 7691da177e4SLinus Torvalds memory, then building all our in-core data structures and freeing the extra 7701da177e4SLinus Torvalds information. Now we allow the first part of the mount to complete a lot quicker, 7711da177e4SLinus Torvalds but we have to go _back_ to the flash in order to finish the CRC checking, etc. 7721da177e4SLinus Torvalds Which means that the _full_ amount of time to get to proper write mode with GC 7731da177e4SLinus Torvalds operational may actually be _longer_ than before. Sucks to be me. */ 7741da177e4SLinus Torvalds 7751da177e4SLinus Torvalds raw = jffs2_alloc_raw_node_ref(); 7761da177e4SLinus Torvalds if (!raw) { 7771da177e4SLinus Torvalds printk(KERN_NOTICE "jffs2_scan_inode_node(): allocation of node reference failed\n"); 7781da177e4SLinus Torvalds return -ENOMEM; 7791da177e4SLinus Torvalds } 7801da177e4SLinus Torvalds 7811da177e4SLinus Torvalds ic = jffs2_get_ino_cache(c, ino); 7821da177e4SLinus Torvalds if (!ic) { 7831da177e4SLinus Torvalds /* Inocache get failed. Either we read a bogus ino# or it's just genuinely the 7841da177e4SLinus Torvalds first node we found for this inode. Do a CRC check to protect against the former 7851da177e4SLinus Torvalds case */ 7861da177e4SLinus Torvalds uint32_t crc = crc32(0, ri, sizeof(*ri)-8); 7871da177e4SLinus Torvalds 7881da177e4SLinus Torvalds if (crc != je32_to_cpu(ri->node_crc)) { 7891da177e4SLinus Torvalds printk(KERN_NOTICE "jffs2_scan_inode_node(): CRC failed on node at 0x%08x: Read 0x%08x, calculated 0x%08x\n", 7901da177e4SLinus Torvalds ofs, je32_to_cpu(ri->node_crc), crc); 7911da177e4SLinus Torvalds /* We believe totlen because the CRC on the node _header_ was OK, just the node itself failed. */ 7921da177e4SLinus Torvalds DIRTY_SPACE(PAD(je32_to_cpu(ri->totlen))); 7931da177e4SLinus Torvalds jffs2_free_raw_node_ref(raw); 7941da177e4SLinus Torvalds return 0; 7951da177e4SLinus Torvalds } 7961da177e4SLinus Torvalds ic = jffs2_scan_make_ino_cache(c, ino); 7971da177e4SLinus Torvalds if (!ic) { 7981da177e4SLinus Torvalds jffs2_free_raw_node_ref(raw); 7991da177e4SLinus Torvalds return -ENOMEM; 8001da177e4SLinus Torvalds } 8011da177e4SLinus Torvalds } 8021da177e4SLinus Torvalds 8031da177e4SLinus Torvalds /* Wheee. It worked */ 8041da177e4SLinus Torvalds 8051da177e4SLinus Torvalds raw->flash_offset = ofs | REF_UNCHECKED; 8061da177e4SLinus Torvalds raw->__totlen = PAD(je32_to_cpu(ri->totlen)); 8071da177e4SLinus Torvalds raw->next_phys = NULL; 8081da177e4SLinus Torvalds raw->next_in_ino = ic->nodes; 8091da177e4SLinus Torvalds 8101da177e4SLinus Torvalds ic->nodes = raw; 8111da177e4SLinus Torvalds if (!jeb->first_node) 8121da177e4SLinus Torvalds jeb->first_node = raw; 8131da177e4SLinus Torvalds if (jeb->last_node) 8141da177e4SLinus Torvalds jeb->last_node->next_phys = raw; 8151da177e4SLinus Torvalds jeb->last_node = raw; 8161da177e4SLinus Torvalds 8171da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Node is ino #%u, version %d. Range 0x%x-0x%x\n", 8181da177e4SLinus Torvalds je32_to_cpu(ri->ino), je32_to_cpu(ri->version), 8191da177e4SLinus Torvalds je32_to_cpu(ri->offset), 8201da177e4SLinus Torvalds je32_to_cpu(ri->offset)+je32_to_cpu(ri->dsize))); 8211da177e4SLinus Torvalds 8221da177e4SLinus Torvalds pseudo_random += je32_to_cpu(ri->version); 8231da177e4SLinus Torvalds 8241da177e4SLinus Torvalds UNCHECKED_SPACE(PAD(je32_to_cpu(ri->totlen))); 825e631ddbaSFerenc Havasi 826e631ddbaSFerenc Havasi if (jffs2_sum_active()) { 827e631ddbaSFerenc Havasi jffs2_sum_add_inode_mem(s, ri, ofs - jeb->offset); 828e631ddbaSFerenc Havasi } 829e631ddbaSFerenc Havasi 8301da177e4SLinus Torvalds return 0; 8311da177e4SLinus Torvalds } 8321da177e4SLinus Torvalds 8331da177e4SLinus Torvalds static int jffs2_scan_dirent_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 834e631ddbaSFerenc Havasi struct jffs2_raw_dirent *rd, uint32_t ofs, struct jffs2_summary *s) 8351da177e4SLinus Torvalds { 8361da177e4SLinus Torvalds struct jffs2_raw_node_ref *raw; 8371da177e4SLinus Torvalds struct jffs2_full_dirent *fd; 8381da177e4SLinus Torvalds struct jffs2_inode_cache *ic; 8391da177e4SLinus Torvalds uint32_t crc; 8401da177e4SLinus Torvalds 8411da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_scan_dirent_node(): Node at 0x%08x\n", ofs)); 8421da177e4SLinus Torvalds 8431da177e4SLinus Torvalds /* We don't get here unless the node is still valid, so we don't have to 8441da177e4SLinus Torvalds mask in the ACCURATE bit any more. */ 8451da177e4SLinus Torvalds crc = crc32(0, rd, sizeof(*rd)-8); 8461da177e4SLinus Torvalds 8471da177e4SLinus Torvalds if (crc != je32_to_cpu(rd->node_crc)) { 8481da177e4SLinus Torvalds printk(KERN_NOTICE "jffs2_scan_dirent_node(): Node CRC failed on node at 0x%08x: Read 0x%08x, calculated 0x%08x\n", 8491da177e4SLinus Torvalds ofs, je32_to_cpu(rd->node_crc), crc); 8501da177e4SLinus Torvalds /* We believe totlen because the CRC on the node _header_ was OK, just the node itself failed. */ 8511da177e4SLinus Torvalds DIRTY_SPACE(PAD(je32_to_cpu(rd->totlen))); 8521da177e4SLinus Torvalds return 0; 8531da177e4SLinus Torvalds } 8541da177e4SLinus Torvalds 8551da177e4SLinus Torvalds pseudo_random += je32_to_cpu(rd->version); 8561da177e4SLinus Torvalds 8571da177e4SLinus Torvalds fd = jffs2_alloc_full_dirent(rd->nsize+1); 8581da177e4SLinus Torvalds if (!fd) { 8591da177e4SLinus Torvalds return -ENOMEM; 8601da177e4SLinus Torvalds } 8611da177e4SLinus Torvalds memcpy(&fd->name, rd->name, rd->nsize); 8621da177e4SLinus Torvalds fd->name[rd->nsize] = 0; 8631da177e4SLinus Torvalds 8641da177e4SLinus Torvalds crc = crc32(0, fd->name, rd->nsize); 8651da177e4SLinus Torvalds if (crc != je32_to_cpu(rd->name_crc)) { 8661da177e4SLinus Torvalds printk(KERN_NOTICE "jffs2_scan_dirent_node(): Name CRC failed on node at 0x%08x: Read 0x%08x, calculated 0x%08x\n", 8671da177e4SLinus Torvalds ofs, je32_to_cpu(rd->name_crc), crc); 8681da177e4SLinus Torvalds D1(printk(KERN_NOTICE "Name for which CRC failed is (now) '%s', ino #%d\n", fd->name, je32_to_cpu(rd->ino))); 8691da177e4SLinus Torvalds jffs2_free_full_dirent(fd); 8701da177e4SLinus Torvalds /* FIXME: Why do we believe totlen? */ 8711da177e4SLinus Torvalds /* We believe totlen because the CRC on the node _header_ was OK, just the name failed. */ 8721da177e4SLinus Torvalds DIRTY_SPACE(PAD(je32_to_cpu(rd->totlen))); 8731da177e4SLinus Torvalds return 0; 8741da177e4SLinus Torvalds } 8751da177e4SLinus Torvalds raw = jffs2_alloc_raw_node_ref(); 8761da177e4SLinus Torvalds if (!raw) { 8771da177e4SLinus Torvalds jffs2_free_full_dirent(fd); 8781da177e4SLinus Torvalds printk(KERN_NOTICE "jffs2_scan_dirent_node(): allocation of node reference failed\n"); 8791da177e4SLinus Torvalds return -ENOMEM; 8801da177e4SLinus Torvalds } 8811da177e4SLinus Torvalds ic = jffs2_scan_make_ino_cache(c, je32_to_cpu(rd->pino)); 8821da177e4SLinus Torvalds if (!ic) { 8831da177e4SLinus Torvalds jffs2_free_full_dirent(fd); 8841da177e4SLinus Torvalds jffs2_free_raw_node_ref(raw); 8851da177e4SLinus Torvalds return -ENOMEM; 8861da177e4SLinus Torvalds } 8871da177e4SLinus Torvalds 8881da177e4SLinus Torvalds raw->__totlen = PAD(je32_to_cpu(rd->totlen)); 8891da177e4SLinus Torvalds raw->flash_offset = ofs | REF_PRISTINE; 8901da177e4SLinus Torvalds raw->next_phys = NULL; 8911da177e4SLinus Torvalds raw->next_in_ino = ic->nodes; 8921da177e4SLinus Torvalds ic->nodes = raw; 8931da177e4SLinus Torvalds if (!jeb->first_node) 8941da177e4SLinus Torvalds jeb->first_node = raw; 8951da177e4SLinus Torvalds if (jeb->last_node) 8961da177e4SLinus Torvalds jeb->last_node->next_phys = raw; 8971da177e4SLinus Torvalds jeb->last_node = raw; 8981da177e4SLinus Torvalds 8991da177e4SLinus Torvalds fd->raw = raw; 9001da177e4SLinus Torvalds fd->next = NULL; 9011da177e4SLinus Torvalds fd->version = je32_to_cpu(rd->version); 9021da177e4SLinus Torvalds fd->ino = je32_to_cpu(rd->ino); 9031da177e4SLinus Torvalds fd->nhash = full_name_hash(fd->name, rd->nsize); 9041da177e4SLinus Torvalds fd->type = rd->type; 9051da177e4SLinus Torvalds USED_SPACE(PAD(je32_to_cpu(rd->totlen))); 9061da177e4SLinus Torvalds jffs2_add_fd_to_list(c, fd, &ic->scan_dents); 9071da177e4SLinus Torvalds 908e631ddbaSFerenc Havasi if (jffs2_sum_active()) { 909e631ddbaSFerenc Havasi jffs2_sum_add_dirent_mem(s, rd, ofs - jeb->offset); 910e631ddbaSFerenc Havasi } 911e631ddbaSFerenc Havasi 9121da177e4SLinus Torvalds return 0; 9131da177e4SLinus Torvalds } 9141da177e4SLinus Torvalds 9151da177e4SLinus Torvalds static int count_list(struct list_head *l) 9161da177e4SLinus Torvalds { 9171da177e4SLinus Torvalds uint32_t count = 0; 9181da177e4SLinus Torvalds struct list_head *tmp; 9191da177e4SLinus Torvalds 9201da177e4SLinus Torvalds list_for_each(tmp, l) { 9211da177e4SLinus Torvalds count++; 9221da177e4SLinus Torvalds } 9231da177e4SLinus Torvalds return count; 9241da177e4SLinus Torvalds } 9251da177e4SLinus Torvalds 9261da177e4SLinus Torvalds /* Note: This breaks if list_empty(head). I don't care. You 9271da177e4SLinus Torvalds might, if you copy this code and use it elsewhere :) */ 9281da177e4SLinus Torvalds static void rotate_list(struct list_head *head, uint32_t count) 9291da177e4SLinus Torvalds { 9301da177e4SLinus Torvalds struct list_head *n = head->next; 9311da177e4SLinus Torvalds 9321da177e4SLinus Torvalds list_del(head); 9331da177e4SLinus Torvalds while(count--) { 9341da177e4SLinus Torvalds n = n->next; 9351da177e4SLinus Torvalds } 9361da177e4SLinus Torvalds list_add(head, n); 9371da177e4SLinus Torvalds } 9381da177e4SLinus Torvalds 9391da177e4SLinus Torvalds void jffs2_rotate_lists(struct jffs2_sb_info *c) 9401da177e4SLinus Torvalds { 9411da177e4SLinus Torvalds uint32_t x; 9421da177e4SLinus Torvalds uint32_t rotateby; 9431da177e4SLinus Torvalds 9441da177e4SLinus Torvalds x = count_list(&c->clean_list); 9451da177e4SLinus Torvalds if (x) { 9461da177e4SLinus Torvalds rotateby = pseudo_random % x; 9471da177e4SLinus Torvalds rotate_list((&c->clean_list), rotateby); 9481da177e4SLinus Torvalds } 9491da177e4SLinus Torvalds 9501da177e4SLinus Torvalds x = count_list(&c->very_dirty_list); 9511da177e4SLinus Torvalds if (x) { 9521da177e4SLinus Torvalds rotateby = pseudo_random % x; 9531da177e4SLinus Torvalds rotate_list((&c->very_dirty_list), rotateby); 9541da177e4SLinus Torvalds } 9551da177e4SLinus Torvalds 9561da177e4SLinus Torvalds x = count_list(&c->dirty_list); 9571da177e4SLinus Torvalds if (x) { 9581da177e4SLinus Torvalds rotateby = pseudo_random % x; 9591da177e4SLinus Torvalds rotate_list((&c->dirty_list), rotateby); 9601da177e4SLinus Torvalds } 9611da177e4SLinus Torvalds 9621da177e4SLinus Torvalds x = count_list(&c->erasable_list); 9631da177e4SLinus Torvalds if (x) { 9641da177e4SLinus Torvalds rotateby = pseudo_random % x; 9651da177e4SLinus Torvalds rotate_list((&c->erasable_list), rotateby); 9661da177e4SLinus Torvalds } 9671da177e4SLinus Torvalds 9681da177e4SLinus Torvalds if (c->nr_erasing_blocks) { 9691da177e4SLinus Torvalds rotateby = pseudo_random % c->nr_erasing_blocks; 9701da177e4SLinus Torvalds rotate_list((&c->erase_pending_list), rotateby); 9711da177e4SLinus Torvalds } 9721da177e4SLinus Torvalds 9731da177e4SLinus Torvalds if (c->nr_free_blocks) { 9741da177e4SLinus Torvalds rotateby = pseudo_random % c->nr_free_blocks; 9751da177e4SLinus Torvalds rotate_list((&c->free_list), rotateby); 9761da177e4SLinus Torvalds } 9771da177e4SLinus Torvalds } 978