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 225e631ddbaSFerenc Havasi if (jffs2_sum_active() && s) 226e631ddbaSFerenc Havasi kfree(s); 227e631ddbaSFerenc Havasi 2281da177e4SLinus Torvalds /* Nextblock dirty is always seen as wasted, because we cannot recycle it now */ 2291da177e4SLinus Torvalds if (c->nextblock && (c->nextblock->dirty_size)) { 2301da177e4SLinus Torvalds c->nextblock->wasted_size += c->nextblock->dirty_size; 2311da177e4SLinus Torvalds c->wasted_size += c->nextblock->dirty_size; 2321da177e4SLinus Torvalds c->dirty_size -= c->nextblock->dirty_size; 2331da177e4SLinus Torvalds c->nextblock->dirty_size = 0; 2341da177e4SLinus Torvalds } 2352f82ce1eSAndrew Victor #ifdef CONFIG_JFFS2_FS_WRITEBUFFER 236e96fb230SDavid Woodhouse if (!jffs2_can_mark_obsolete(c) && c->wbuf_pagesize && c->nextblock && (c->nextblock->free_size % c->wbuf_pagesize)) { 2371da177e4SLinus Torvalds /* If we're going to start writing into a block which already 2381da177e4SLinus Torvalds contains data, and the end of the data isn't page-aligned, 2391da177e4SLinus Torvalds skip a little and align it. */ 2401da177e4SLinus Torvalds 241daba5cc4SArtem B. Bityutskiy uint32_t skip = c->nextblock->free_size % c->wbuf_pagesize; 2421da177e4SLinus Torvalds 2431da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_scan_medium(): Skipping %d bytes in nextblock to ensure page alignment\n", 2441da177e4SLinus Torvalds skip)); 2451da177e4SLinus Torvalds c->nextblock->wasted_size += skip; 2461da177e4SLinus Torvalds c->wasted_size += skip; 2471da177e4SLinus Torvalds 2481da177e4SLinus Torvalds c->nextblock->free_size -= skip; 2491da177e4SLinus Torvalds c->free_size -= skip; 2501da177e4SLinus Torvalds } 2511da177e4SLinus Torvalds #endif 2521da177e4SLinus Torvalds if (c->nr_erasing_blocks) { 2531da177e4SLinus Torvalds if ( !c->used_size && ((c->nr_free_blocks+empty_blocks+bad_blocks)!= c->nr_blocks || bad_blocks == c->nr_blocks) ) { 2541da177e4SLinus Torvalds printk(KERN_NOTICE "Cowardly refusing to erase blocks on filesystem with no valid JFFS2 nodes\n"); 2551da177e4SLinus Torvalds printk(KERN_NOTICE "empty_blocks %d, bad_blocks %d, c->nr_blocks %d\n",empty_blocks,bad_blocks,c->nr_blocks); 2561da177e4SLinus Torvalds ret = -EIO; 2571da177e4SLinus Torvalds goto out; 2581da177e4SLinus Torvalds } 2591da177e4SLinus Torvalds jffs2_erase_pending_trigger(c); 2601da177e4SLinus Torvalds } 2611da177e4SLinus Torvalds ret = 0; 2621da177e4SLinus Torvalds out: 2631da177e4SLinus Torvalds if (buf_size) 2641da177e4SLinus Torvalds kfree(flashbuf); 2651da177e4SLinus Torvalds #ifndef __ECOS 2661da177e4SLinus Torvalds else 2671da177e4SLinus Torvalds c->mtd->unpoint(c->mtd, flashbuf, 0, c->mtd->size); 2681da177e4SLinus Torvalds #endif 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 3091da177e4SLinus Torvalds static int jffs2_scan_eraseblock (struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 310e631ddbaSFerenc Havasi unsigned char *buf, uint32_t buf_size, struct jffs2_summary *s) { 3111da177e4SLinus Torvalds struct jffs2_unknown_node *node; 3121da177e4SLinus Torvalds struct jffs2_unknown_node crcnode; 313e631ddbaSFerenc Havasi struct jffs2_sum_marker *sm; 3141da177e4SLinus Torvalds uint32_t ofs, prevofs; 3151da177e4SLinus Torvalds uint32_t hdr_crc, buf_ofs, buf_len; 3161da177e4SLinus Torvalds int err; 3171da177e4SLinus Torvalds int noise = 0; 318e631ddbaSFerenc Havasi 319e631ddbaSFerenc Havasi 3202f82ce1eSAndrew Victor #ifdef CONFIG_JFFS2_FS_WRITEBUFFER 3211da177e4SLinus Torvalds int cleanmarkerfound = 0; 3221da177e4SLinus Torvalds #endif 3231da177e4SLinus Torvalds 3241da177e4SLinus Torvalds ofs = jeb->offset; 3251da177e4SLinus Torvalds prevofs = jeb->offset - 1; 3261da177e4SLinus Torvalds 3271da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_scan_eraseblock(): Scanning block at 0x%x\n", ofs)); 3281da177e4SLinus Torvalds 3292f82ce1eSAndrew Victor #ifdef CONFIG_JFFS2_FS_WRITEBUFFER 3301da177e4SLinus Torvalds if (jffs2_cleanmarker_oob(c)) { 3311da177e4SLinus Torvalds int ret = jffs2_check_nand_cleanmarker(c, jeb); 3321da177e4SLinus Torvalds D2(printk(KERN_NOTICE "jffs_check_nand_cleanmarker returned %d\n",ret)); 3331da177e4SLinus Torvalds /* Even if it's not found, we still scan to see 3341da177e4SLinus Torvalds if the block is empty. We use this information 3351da177e4SLinus Torvalds to decide whether to erase it or not. */ 3361da177e4SLinus Torvalds switch (ret) { 3371da177e4SLinus Torvalds case 0: cleanmarkerfound = 1; break; 3381da177e4SLinus Torvalds case 1: break; 3391da177e4SLinus Torvalds case 2: return BLK_STATE_BADBLOCK; 3401da177e4SLinus Torvalds case 3: return BLK_STATE_ALLDIRTY; /* Block has failed to erase min. once */ 3411da177e4SLinus Torvalds default: return ret; 3421da177e4SLinus Torvalds } 3431da177e4SLinus Torvalds } 3441da177e4SLinus Torvalds #endif 345e631ddbaSFerenc Havasi 346e631ddbaSFerenc Havasi if (jffs2_sum_active()) { 347e631ddbaSFerenc Havasi sm = kmalloc(sizeof(struct jffs2_sum_marker), GFP_KERNEL); 348e631ddbaSFerenc Havasi if (!sm) { 349e631ddbaSFerenc Havasi return -ENOMEM; 350e631ddbaSFerenc Havasi } 351e631ddbaSFerenc Havasi 352e631ddbaSFerenc Havasi err = jffs2_fill_scan_buf(c, (unsigned char *) sm, jeb->offset + c->sector_size - 353e631ddbaSFerenc Havasi sizeof(struct jffs2_sum_marker), sizeof(struct jffs2_sum_marker)); 354e631ddbaSFerenc Havasi if (err) { 355e631ddbaSFerenc Havasi kfree(sm); 356e631ddbaSFerenc Havasi return err; 357e631ddbaSFerenc Havasi } 358e631ddbaSFerenc Havasi 359e631ddbaSFerenc Havasi if (je32_to_cpu(sm->magic) == JFFS2_SUM_MAGIC ) { 360e631ddbaSFerenc Havasi err = jffs2_sum_scan_sumnode(c, jeb, je32_to_cpu(sm->offset), &pseudo_random); 361e631ddbaSFerenc Havasi if (err) { 362e631ddbaSFerenc Havasi kfree(sm); 363e631ddbaSFerenc Havasi return err; 364e631ddbaSFerenc Havasi } 365e631ddbaSFerenc Havasi } 366e631ddbaSFerenc Havasi 367e631ddbaSFerenc Havasi kfree(sm); 368e631ddbaSFerenc Havasi 369e631ddbaSFerenc Havasi ofs = jeb->offset; 370e631ddbaSFerenc Havasi prevofs = jeb->offset - 1; 371e631ddbaSFerenc Havasi } 372e631ddbaSFerenc Havasi 3731da177e4SLinus Torvalds buf_ofs = jeb->offset; 3741da177e4SLinus Torvalds 3751da177e4SLinus Torvalds if (!buf_size) { 3761da177e4SLinus Torvalds buf_len = c->sector_size; 377e631ddbaSFerenc Havasi 378e631ddbaSFerenc Havasi if (jffs2_sum_active()) { 379e631ddbaSFerenc Havasi /* must reread because of summary test */ 380e631ddbaSFerenc Havasi err = jffs2_fill_scan_buf(c, buf, buf_ofs, buf_len); 381e631ddbaSFerenc Havasi if (err) 382e631ddbaSFerenc Havasi return err; 383e631ddbaSFerenc Havasi } 384e631ddbaSFerenc Havasi 3851da177e4SLinus Torvalds } else { 3863be36675SAndrew Victor buf_len = EMPTY_SCAN_SIZE(c->sector_size); 3871da177e4SLinus Torvalds err = jffs2_fill_scan_buf(c, buf, buf_ofs, buf_len); 3881da177e4SLinus Torvalds if (err) 3891da177e4SLinus Torvalds return err; 3901da177e4SLinus Torvalds } 3911da177e4SLinus Torvalds 3921da177e4SLinus Torvalds /* We temporarily use 'ofs' as a pointer into the buffer/jeb */ 3931da177e4SLinus Torvalds ofs = 0; 3941da177e4SLinus Torvalds 3951da177e4SLinus Torvalds /* Scan only 4KiB of 0xFF before declaring it's empty */ 3963be36675SAndrew Victor while(ofs < EMPTY_SCAN_SIZE(c->sector_size) && *(uint32_t *)(&buf[ofs]) == 0xFFFFFFFF) 3971da177e4SLinus Torvalds ofs += 4; 3981da177e4SLinus Torvalds 3993be36675SAndrew Victor if (ofs == EMPTY_SCAN_SIZE(c->sector_size)) { 4002f82ce1eSAndrew Victor #ifdef CONFIG_JFFS2_FS_WRITEBUFFER 4011da177e4SLinus Torvalds if (jffs2_cleanmarker_oob(c)) { 4021da177e4SLinus Torvalds /* scan oob, take care of cleanmarker */ 4031da177e4SLinus Torvalds int ret = jffs2_check_oob_empty(c, jeb, cleanmarkerfound); 4041da177e4SLinus Torvalds D2(printk(KERN_NOTICE "jffs2_check_oob_empty returned %d\n",ret)); 4051da177e4SLinus Torvalds switch (ret) { 4061da177e4SLinus Torvalds case 0: return cleanmarkerfound ? BLK_STATE_CLEANMARKER : BLK_STATE_ALLFF; 4071da177e4SLinus Torvalds case 1: return BLK_STATE_ALLDIRTY; 4081da177e4SLinus Torvalds default: return ret; 4091da177e4SLinus Torvalds } 4101da177e4SLinus Torvalds } 4111da177e4SLinus Torvalds #endif 4121da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Block at 0x%08x is empty (erased)\n", jeb->offset)); 4138f15fd55SAndrew Victor if (c->cleanmarker_size == 0) 4148f15fd55SAndrew Victor return BLK_STATE_CLEANMARKER; /* don't bother with re-erase */ 4158f15fd55SAndrew Victor else 4161da177e4SLinus Torvalds return BLK_STATE_ALLFF; /* OK to erase if all blocks are like this */ 4171da177e4SLinus Torvalds } 4181da177e4SLinus Torvalds if (ofs) { 4191da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Free space at %08x ends at %08x\n", jeb->offset, 4201da177e4SLinus Torvalds jeb->offset + ofs)); 4211da177e4SLinus Torvalds DIRTY_SPACE(ofs); 4221da177e4SLinus Torvalds } 4231da177e4SLinus Torvalds 4241da177e4SLinus Torvalds /* Now ofs is a complete physical flash offset as it always was... */ 4251da177e4SLinus Torvalds ofs += jeb->offset; 4261da177e4SLinus Torvalds 4271da177e4SLinus Torvalds noise = 10; 4281da177e4SLinus Torvalds 429733802d9SArtem B. Bityutskiy dbg_summary("no summary found in jeb 0x%08x. Apply original scan.\n",jeb->offset); 430e631ddbaSFerenc Havasi 4311da177e4SLinus Torvalds scan_more: 4321da177e4SLinus Torvalds while(ofs < jeb->offset + c->sector_size) { 4331da177e4SLinus Torvalds 434e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_paranoia_check_nolock(c, jeb); 4351da177e4SLinus Torvalds 4361da177e4SLinus Torvalds cond_resched(); 4371da177e4SLinus Torvalds 4381da177e4SLinus Torvalds if (ofs & 3) { 4391da177e4SLinus Torvalds printk(KERN_WARNING "Eep. ofs 0x%08x not word-aligned!\n", ofs); 4401da177e4SLinus Torvalds ofs = PAD(ofs); 4411da177e4SLinus Torvalds continue; 4421da177e4SLinus Torvalds } 4431da177e4SLinus Torvalds if (ofs == prevofs) { 4441da177e4SLinus Torvalds printk(KERN_WARNING "ofs 0x%08x has already been seen. Skipping\n", ofs); 4451da177e4SLinus Torvalds DIRTY_SPACE(4); 4461da177e4SLinus Torvalds ofs += 4; 4471da177e4SLinus Torvalds continue; 4481da177e4SLinus Torvalds } 4491da177e4SLinus Torvalds prevofs = ofs; 4501da177e4SLinus Torvalds 4511da177e4SLinus Torvalds if (jeb->offset + c->sector_size < ofs + sizeof(*node)) { 4521da177e4SLinus 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), 4531da177e4SLinus Torvalds jeb->offset, c->sector_size, ofs, sizeof(*node))); 4541da177e4SLinus Torvalds DIRTY_SPACE((jeb->offset + c->sector_size)-ofs); 4551da177e4SLinus Torvalds break; 4561da177e4SLinus Torvalds } 4571da177e4SLinus Torvalds 4581da177e4SLinus Torvalds if (buf_ofs + buf_len < ofs + sizeof(*node)) { 4591da177e4SLinus Torvalds buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); 4601da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Fewer than %zd bytes (node header) left to end of buf. Reading 0x%x at 0x%08x\n", 4611da177e4SLinus Torvalds sizeof(struct jffs2_unknown_node), buf_len, ofs)); 4621da177e4SLinus Torvalds err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); 4631da177e4SLinus Torvalds if (err) 4641da177e4SLinus Torvalds return err; 4651da177e4SLinus Torvalds buf_ofs = ofs; 4661da177e4SLinus Torvalds } 4671da177e4SLinus Torvalds 4681da177e4SLinus Torvalds node = (struct jffs2_unknown_node *)&buf[ofs-buf_ofs]; 4691da177e4SLinus Torvalds 4701da177e4SLinus Torvalds if (*(uint32_t *)(&buf[ofs-buf_ofs]) == 0xffffffff) { 4711da177e4SLinus Torvalds uint32_t inbuf_ofs; 4721da177e4SLinus Torvalds uint32_t empty_start; 4731da177e4SLinus Torvalds 4741da177e4SLinus Torvalds empty_start = ofs; 4751da177e4SLinus Torvalds ofs += 4; 4761da177e4SLinus Torvalds 4771da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Found empty flash at 0x%08x\n", ofs)); 4781da177e4SLinus Torvalds more_empty: 4791da177e4SLinus Torvalds inbuf_ofs = ofs - buf_ofs; 4801da177e4SLinus Torvalds while (inbuf_ofs < buf_len) { 4811da177e4SLinus Torvalds if (*(uint32_t *)(&buf[inbuf_ofs]) != 0xffffffff) { 4821da177e4SLinus Torvalds printk(KERN_WARNING "Empty flash at 0x%08x ends at 0x%08x\n", 4831da177e4SLinus Torvalds empty_start, ofs); 4841da177e4SLinus Torvalds DIRTY_SPACE(ofs-empty_start); 4851da177e4SLinus Torvalds goto scan_more; 4861da177e4SLinus Torvalds } 4871da177e4SLinus Torvalds 4881da177e4SLinus Torvalds inbuf_ofs+=4; 4891da177e4SLinus Torvalds ofs += 4; 4901da177e4SLinus Torvalds } 4911da177e4SLinus Torvalds /* Ran off end. */ 4921da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Empty flash to end of buffer at 0x%08x\n", ofs)); 4931da177e4SLinus Torvalds 4941da177e4SLinus Torvalds /* If we're only checking the beginning of a block with a cleanmarker, 4951da177e4SLinus Torvalds bail now */ 4961da177e4SLinus Torvalds if (buf_ofs == jeb->offset && jeb->used_size == PAD(c->cleanmarker_size) && 497b81226c5SArtem B. Bityuckiy c->cleanmarker_size && !jeb->dirty_size && !jeb->first_node->next_phys) { 4983be36675SAndrew Victor D1(printk(KERN_DEBUG "%d bytes at start of block seems clean... assuming all clean\n", EMPTY_SCAN_SIZE(c->sector_size))); 4991da177e4SLinus Torvalds return BLK_STATE_CLEANMARKER; 5001da177e4SLinus Torvalds } 5011da177e4SLinus Torvalds 5021da177e4SLinus Torvalds /* See how much more there is to read in this eraseblock... */ 5031da177e4SLinus Torvalds buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); 5041da177e4SLinus Torvalds if (!buf_len) { 5051da177e4SLinus Torvalds /* No more to read. Break out of main loop without marking 5061da177e4SLinus Torvalds this range of empty space as dirty (because it's not) */ 5071da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Empty flash at %08x runs to end of block. Treating as free_space\n", 5081da177e4SLinus Torvalds empty_start)); 5091da177e4SLinus Torvalds break; 5101da177e4SLinus Torvalds } 5111da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Reading another 0x%x at 0x%08x\n", buf_len, ofs)); 5121da177e4SLinus Torvalds err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); 5131da177e4SLinus Torvalds if (err) 5141da177e4SLinus Torvalds return err; 5151da177e4SLinus Torvalds buf_ofs = ofs; 5161da177e4SLinus Torvalds goto more_empty; 5171da177e4SLinus Torvalds } 5181da177e4SLinus Torvalds 5191da177e4SLinus Torvalds if (ofs == jeb->offset && je16_to_cpu(node->magic) == KSAMTIB_CIGAM_2SFFJ) { 5201da177e4SLinus Torvalds printk(KERN_WARNING "Magic bitmask is backwards at offset 0x%08x. Wrong endian filesystem?\n", ofs); 5211da177e4SLinus Torvalds DIRTY_SPACE(4); 5221da177e4SLinus Torvalds ofs += 4; 5231da177e4SLinus Torvalds continue; 5241da177e4SLinus Torvalds } 5251da177e4SLinus Torvalds if (je16_to_cpu(node->magic) == JFFS2_DIRTY_BITMASK) { 5261da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Dirty bitmask at 0x%08x\n", ofs)); 5271da177e4SLinus Torvalds DIRTY_SPACE(4); 5281da177e4SLinus Torvalds ofs += 4; 5291da177e4SLinus Torvalds continue; 5301da177e4SLinus Torvalds } 5311da177e4SLinus Torvalds if (je16_to_cpu(node->magic) == JFFS2_OLD_MAGIC_BITMASK) { 5321da177e4SLinus Torvalds printk(KERN_WARNING "Old JFFS2 bitmask found at 0x%08x\n", ofs); 5331da177e4SLinus Torvalds printk(KERN_WARNING "You cannot use older JFFS2 filesystems with newer kernels\n"); 5341da177e4SLinus Torvalds DIRTY_SPACE(4); 5351da177e4SLinus Torvalds ofs += 4; 5361da177e4SLinus Torvalds continue; 5371da177e4SLinus Torvalds } 5381da177e4SLinus Torvalds if (je16_to_cpu(node->magic) != JFFS2_MAGIC_BITMASK) { 5391da177e4SLinus Torvalds /* OK. We're out of possibilities. Whinge and move on */ 5401da177e4SLinus Torvalds noisy_printk(&noise, "jffs2_scan_eraseblock(): Magic bitmask 0x%04x not found at 0x%08x: 0x%04x instead\n", 5411da177e4SLinus Torvalds JFFS2_MAGIC_BITMASK, ofs, 5421da177e4SLinus Torvalds je16_to_cpu(node->magic)); 5431da177e4SLinus Torvalds DIRTY_SPACE(4); 5441da177e4SLinus Torvalds ofs += 4; 5451da177e4SLinus Torvalds continue; 5461da177e4SLinus Torvalds } 5471da177e4SLinus Torvalds /* We seem to have a node of sorts. Check the CRC */ 5481da177e4SLinus Torvalds crcnode.magic = node->magic; 5491da177e4SLinus Torvalds crcnode.nodetype = cpu_to_je16( je16_to_cpu(node->nodetype) | JFFS2_NODE_ACCURATE); 5501da177e4SLinus Torvalds crcnode.totlen = node->totlen; 5511da177e4SLinus Torvalds hdr_crc = crc32(0, &crcnode, sizeof(crcnode)-4); 5521da177e4SLinus Torvalds 5531da177e4SLinus Torvalds if (hdr_crc != je32_to_cpu(node->hdr_crc)) { 5541da177e4SLinus 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", 5551da177e4SLinus Torvalds ofs, je16_to_cpu(node->magic), 5561da177e4SLinus Torvalds je16_to_cpu(node->nodetype), 5571da177e4SLinus Torvalds je32_to_cpu(node->totlen), 5581da177e4SLinus Torvalds je32_to_cpu(node->hdr_crc), 5591da177e4SLinus Torvalds hdr_crc); 5601da177e4SLinus Torvalds DIRTY_SPACE(4); 5611da177e4SLinus Torvalds ofs += 4; 5621da177e4SLinus Torvalds continue; 5631da177e4SLinus Torvalds } 5641da177e4SLinus Torvalds 5651da177e4SLinus Torvalds if (ofs + je32_to_cpu(node->totlen) > 5661da177e4SLinus Torvalds jeb->offset + c->sector_size) { 5671da177e4SLinus Torvalds /* Eep. Node goes over the end of the erase block. */ 5681da177e4SLinus Torvalds printk(KERN_WARNING "Node at 0x%08x with length 0x%08x would run over the end of the erase block\n", 5691da177e4SLinus Torvalds ofs, je32_to_cpu(node->totlen)); 5701da177e4SLinus Torvalds printk(KERN_WARNING "Perhaps the file system was created with the wrong erase size?\n"); 5711da177e4SLinus Torvalds DIRTY_SPACE(4); 5721da177e4SLinus Torvalds ofs += 4; 5731da177e4SLinus Torvalds continue; 5741da177e4SLinus Torvalds } 5751da177e4SLinus Torvalds 5761da177e4SLinus Torvalds if (!(je16_to_cpu(node->nodetype) & JFFS2_NODE_ACCURATE)) { 5771da177e4SLinus Torvalds /* Wheee. This is an obsoleted node */ 5781da177e4SLinus Torvalds D2(printk(KERN_DEBUG "Node at 0x%08x is obsolete. Skipping\n", ofs)); 5791da177e4SLinus Torvalds DIRTY_SPACE(PAD(je32_to_cpu(node->totlen))); 5801da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 5811da177e4SLinus Torvalds continue; 5821da177e4SLinus Torvalds } 5831da177e4SLinus Torvalds 5841da177e4SLinus Torvalds switch(je16_to_cpu(node->nodetype)) { 5851da177e4SLinus Torvalds case JFFS2_NODETYPE_INODE: 5861da177e4SLinus Torvalds if (buf_ofs + buf_len < ofs + sizeof(struct jffs2_raw_inode)) { 5871da177e4SLinus Torvalds buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); 5881da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Fewer than %zd bytes (inode node) left to end of buf. Reading 0x%x at 0x%08x\n", 5891da177e4SLinus Torvalds sizeof(struct jffs2_raw_inode), buf_len, ofs)); 5901da177e4SLinus Torvalds err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); 5911da177e4SLinus Torvalds if (err) 5921da177e4SLinus Torvalds return err; 5931da177e4SLinus Torvalds buf_ofs = ofs; 5941da177e4SLinus Torvalds node = (void *)buf; 5951da177e4SLinus Torvalds } 596e631ddbaSFerenc Havasi err = jffs2_scan_inode_node(c, jeb, (void *)node, ofs, s); 5971da177e4SLinus Torvalds if (err) return err; 5981da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 5991da177e4SLinus Torvalds break; 6001da177e4SLinus Torvalds 6011da177e4SLinus Torvalds case JFFS2_NODETYPE_DIRENT: 6021da177e4SLinus Torvalds if (buf_ofs + buf_len < ofs + je32_to_cpu(node->totlen)) { 6031da177e4SLinus Torvalds buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); 6041da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Fewer than %d bytes (dirent node) left to end of buf. Reading 0x%x at 0x%08x\n", 6051da177e4SLinus Torvalds je32_to_cpu(node->totlen), buf_len, ofs)); 6061da177e4SLinus Torvalds err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); 6071da177e4SLinus Torvalds if (err) 6081da177e4SLinus Torvalds return err; 6091da177e4SLinus Torvalds buf_ofs = ofs; 6101da177e4SLinus Torvalds node = (void *)buf; 6111da177e4SLinus Torvalds } 612e631ddbaSFerenc Havasi err = jffs2_scan_dirent_node(c, jeb, (void *)node, ofs, s); 6131da177e4SLinus Torvalds if (err) return err; 6141da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 6151da177e4SLinus Torvalds break; 6161da177e4SLinus Torvalds 6171da177e4SLinus Torvalds case JFFS2_NODETYPE_CLEANMARKER: 6181da177e4SLinus Torvalds D1(printk(KERN_DEBUG "CLEANMARKER node found at 0x%08x\n", ofs)); 6191da177e4SLinus Torvalds if (je32_to_cpu(node->totlen) != c->cleanmarker_size) { 6201da177e4SLinus Torvalds printk(KERN_NOTICE "CLEANMARKER node found at 0x%08x has totlen 0x%x != normal 0x%x\n", 6211da177e4SLinus Torvalds ofs, je32_to_cpu(node->totlen), c->cleanmarker_size); 6221da177e4SLinus Torvalds DIRTY_SPACE(PAD(sizeof(struct jffs2_unknown_node))); 6231da177e4SLinus Torvalds ofs += PAD(sizeof(struct jffs2_unknown_node)); 6241da177e4SLinus Torvalds } else if (jeb->first_node) { 6251da177e4SLinus Torvalds printk(KERN_NOTICE "CLEANMARKER node found at 0x%08x, not first node in block (0x%08x)\n", ofs, jeb->offset); 6261da177e4SLinus Torvalds DIRTY_SPACE(PAD(sizeof(struct jffs2_unknown_node))); 6271da177e4SLinus Torvalds ofs += PAD(sizeof(struct jffs2_unknown_node)); 6281da177e4SLinus Torvalds } else { 6291da177e4SLinus Torvalds struct jffs2_raw_node_ref *marker_ref = jffs2_alloc_raw_node_ref(); 6301da177e4SLinus Torvalds if (!marker_ref) { 6311da177e4SLinus Torvalds printk(KERN_NOTICE "Failed to allocate node ref for clean marker\n"); 6321da177e4SLinus Torvalds return -ENOMEM; 6331da177e4SLinus Torvalds } 6341da177e4SLinus Torvalds marker_ref->next_in_ino = NULL; 6351da177e4SLinus Torvalds marker_ref->next_phys = NULL; 6361da177e4SLinus Torvalds marker_ref->flash_offset = ofs | REF_NORMAL; 6371da177e4SLinus Torvalds marker_ref->__totlen = c->cleanmarker_size; 6381da177e4SLinus Torvalds jeb->first_node = jeb->last_node = marker_ref; 6391da177e4SLinus Torvalds 6401da177e4SLinus Torvalds USED_SPACE(PAD(c->cleanmarker_size)); 6411da177e4SLinus Torvalds ofs += PAD(c->cleanmarker_size); 6421da177e4SLinus Torvalds } 6431da177e4SLinus Torvalds break; 6441da177e4SLinus Torvalds 6451da177e4SLinus Torvalds case JFFS2_NODETYPE_PADDING: 646e631ddbaSFerenc Havasi if (jffs2_sum_active()) 647e631ddbaSFerenc Havasi jffs2_sum_add_padding_mem(s, je32_to_cpu(node->totlen)); 6481da177e4SLinus Torvalds DIRTY_SPACE(PAD(je32_to_cpu(node->totlen))); 6491da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 6501da177e4SLinus Torvalds break; 6511da177e4SLinus Torvalds 6521da177e4SLinus Torvalds default: 6531da177e4SLinus Torvalds switch (je16_to_cpu(node->nodetype) & JFFS2_COMPAT_MASK) { 6541da177e4SLinus Torvalds case JFFS2_FEATURE_ROCOMPAT: 6551da177e4SLinus Torvalds printk(KERN_NOTICE "Read-only compatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs); 6561da177e4SLinus Torvalds c->flags |= JFFS2_SB_FLAG_RO; 6571da177e4SLinus Torvalds if (!(jffs2_is_readonly(c))) 6581da177e4SLinus Torvalds return -EROFS; 6591da177e4SLinus Torvalds DIRTY_SPACE(PAD(je32_to_cpu(node->totlen))); 6601da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 6611da177e4SLinus Torvalds break; 6621da177e4SLinus Torvalds 6631da177e4SLinus Torvalds case JFFS2_FEATURE_INCOMPAT: 6641da177e4SLinus Torvalds printk(KERN_NOTICE "Incompatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs); 6651da177e4SLinus Torvalds return -EINVAL; 6661da177e4SLinus Torvalds 6671da177e4SLinus Torvalds case JFFS2_FEATURE_RWCOMPAT_DELETE: 6681da177e4SLinus Torvalds D1(printk(KERN_NOTICE "Unknown but compatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs)); 6691da177e4SLinus Torvalds DIRTY_SPACE(PAD(je32_to_cpu(node->totlen))); 6701da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 6711da177e4SLinus Torvalds break; 6721da177e4SLinus Torvalds 6731da177e4SLinus Torvalds case JFFS2_FEATURE_RWCOMPAT_COPY: 6741da177e4SLinus Torvalds D1(printk(KERN_NOTICE "Unknown but compatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs)); 6751da177e4SLinus Torvalds USED_SPACE(PAD(je32_to_cpu(node->totlen))); 6761da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 6771da177e4SLinus Torvalds break; 6781da177e4SLinus Torvalds } 6791da177e4SLinus Torvalds } 6801da177e4SLinus Torvalds } 6811da177e4SLinus Torvalds 682e631ddbaSFerenc Havasi if (jffs2_sum_active()) { 683e631ddbaSFerenc Havasi if (PAD(s->sum_size + JFFS2_SUMMARY_FRAME_SIZE) > jeb->free_size) { 684733802d9SArtem B. Bityutskiy dbg_summary("There is not enough space for " 685e631ddbaSFerenc Havasi "summary information, disabling for this jeb!\n"); 686e631ddbaSFerenc Havasi jffs2_sum_disable_collecting(s); 687e631ddbaSFerenc Havasi } 688e631ddbaSFerenc Havasi } 6891da177e4SLinus Torvalds 6901da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Block at 0x%08x: free 0x%08x, dirty 0x%08x, unchecked 0x%08x, used 0x%08x\n", jeb->offset, 6911da177e4SLinus Torvalds jeb->free_size, jeb->dirty_size, jeb->unchecked_size, jeb->used_size)); 6921da177e4SLinus Torvalds 6931da177e4SLinus Torvalds /* mark_node_obsolete can add to wasted !! */ 6941da177e4SLinus Torvalds if (jeb->wasted_size) { 6951da177e4SLinus Torvalds jeb->dirty_size += jeb->wasted_size; 6961da177e4SLinus Torvalds c->dirty_size += jeb->wasted_size; 6971da177e4SLinus Torvalds c->wasted_size -= jeb->wasted_size; 6981da177e4SLinus Torvalds jeb->wasted_size = 0; 6991da177e4SLinus Torvalds } 7001da177e4SLinus Torvalds 701e631ddbaSFerenc Havasi return jffs2_scan_classify_jeb(c, jeb); 7021da177e4SLinus Torvalds } 7031da177e4SLinus Torvalds 704e631ddbaSFerenc Havasi struct jffs2_inode_cache *jffs2_scan_make_ino_cache(struct jffs2_sb_info *c, uint32_t ino) 7051da177e4SLinus Torvalds { 7061da177e4SLinus Torvalds struct jffs2_inode_cache *ic; 7071da177e4SLinus Torvalds 7081da177e4SLinus Torvalds ic = jffs2_get_ino_cache(c, ino); 7091da177e4SLinus Torvalds if (ic) 7101da177e4SLinus Torvalds return ic; 7111da177e4SLinus Torvalds 7121da177e4SLinus Torvalds if (ino > c->highest_ino) 7131da177e4SLinus Torvalds c->highest_ino = ino; 7141da177e4SLinus Torvalds 7151da177e4SLinus Torvalds ic = jffs2_alloc_inode_cache(); 7161da177e4SLinus Torvalds if (!ic) { 7171da177e4SLinus Torvalds printk(KERN_NOTICE "jffs2_scan_make_inode_cache(): allocation of inode cache failed\n"); 7181da177e4SLinus Torvalds return NULL; 7191da177e4SLinus Torvalds } 7201da177e4SLinus Torvalds memset(ic, 0, sizeof(*ic)); 7211da177e4SLinus Torvalds 7221da177e4SLinus Torvalds ic->ino = ino; 7231da177e4SLinus Torvalds ic->nodes = (void *)ic; 7241da177e4SLinus Torvalds jffs2_add_ino_cache(c, ic); 7251da177e4SLinus Torvalds if (ino == 1) 7261da177e4SLinus Torvalds ic->nlink = 1; 7271da177e4SLinus Torvalds return ic; 7281da177e4SLinus Torvalds } 7291da177e4SLinus Torvalds 7301da177e4SLinus Torvalds static int jffs2_scan_inode_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 731e631ddbaSFerenc Havasi struct jffs2_raw_inode *ri, uint32_t ofs, struct jffs2_summary *s) 7321da177e4SLinus Torvalds { 7331da177e4SLinus Torvalds struct jffs2_raw_node_ref *raw; 7341da177e4SLinus Torvalds struct jffs2_inode_cache *ic; 7351da177e4SLinus Torvalds uint32_t ino = je32_to_cpu(ri->ino); 7361da177e4SLinus Torvalds 7371da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_scan_inode_node(): Node at 0x%08x\n", ofs)); 7381da177e4SLinus Torvalds 7391da177e4SLinus Torvalds /* We do very little here now. Just check the ino# to which we should attribute 7401da177e4SLinus Torvalds this node; we can do all the CRC checking etc. later. There's a tradeoff here -- 7411da177e4SLinus Torvalds we used to scan the flash once only, reading everything we want from it into 7421da177e4SLinus Torvalds memory, then building all our in-core data structures and freeing the extra 7431da177e4SLinus Torvalds information. Now we allow the first part of the mount to complete a lot quicker, 7441da177e4SLinus Torvalds but we have to go _back_ to the flash in order to finish the CRC checking, etc. 7451da177e4SLinus Torvalds Which means that the _full_ amount of time to get to proper write mode with GC 7461da177e4SLinus Torvalds operational may actually be _longer_ than before. Sucks to be me. */ 7471da177e4SLinus Torvalds 7481da177e4SLinus Torvalds raw = jffs2_alloc_raw_node_ref(); 7491da177e4SLinus Torvalds if (!raw) { 7501da177e4SLinus Torvalds printk(KERN_NOTICE "jffs2_scan_inode_node(): allocation of node reference failed\n"); 7511da177e4SLinus Torvalds return -ENOMEM; 7521da177e4SLinus Torvalds } 7531da177e4SLinus Torvalds 7541da177e4SLinus Torvalds ic = jffs2_get_ino_cache(c, ino); 7551da177e4SLinus Torvalds if (!ic) { 7561da177e4SLinus Torvalds /* Inocache get failed. Either we read a bogus ino# or it's just genuinely the 7571da177e4SLinus Torvalds first node we found for this inode. Do a CRC check to protect against the former 7581da177e4SLinus Torvalds case */ 7591da177e4SLinus Torvalds uint32_t crc = crc32(0, ri, sizeof(*ri)-8); 7601da177e4SLinus Torvalds 7611da177e4SLinus Torvalds if (crc != je32_to_cpu(ri->node_crc)) { 7621da177e4SLinus Torvalds printk(KERN_NOTICE "jffs2_scan_inode_node(): CRC failed on node at 0x%08x: Read 0x%08x, calculated 0x%08x\n", 7631da177e4SLinus Torvalds ofs, je32_to_cpu(ri->node_crc), crc); 7641da177e4SLinus Torvalds /* We believe totlen because the CRC on the node _header_ was OK, just the node itself failed. */ 7651da177e4SLinus Torvalds DIRTY_SPACE(PAD(je32_to_cpu(ri->totlen))); 7661da177e4SLinus Torvalds jffs2_free_raw_node_ref(raw); 7671da177e4SLinus Torvalds return 0; 7681da177e4SLinus Torvalds } 7691da177e4SLinus Torvalds ic = jffs2_scan_make_ino_cache(c, ino); 7701da177e4SLinus Torvalds if (!ic) { 7711da177e4SLinus Torvalds jffs2_free_raw_node_ref(raw); 7721da177e4SLinus Torvalds return -ENOMEM; 7731da177e4SLinus Torvalds } 7741da177e4SLinus Torvalds } 7751da177e4SLinus Torvalds 7761da177e4SLinus Torvalds /* Wheee. It worked */ 7771da177e4SLinus Torvalds 7781da177e4SLinus Torvalds raw->flash_offset = ofs | REF_UNCHECKED; 7791da177e4SLinus Torvalds raw->__totlen = PAD(je32_to_cpu(ri->totlen)); 7801da177e4SLinus Torvalds raw->next_phys = NULL; 7811da177e4SLinus Torvalds raw->next_in_ino = ic->nodes; 7821da177e4SLinus Torvalds 7831da177e4SLinus Torvalds ic->nodes = raw; 7841da177e4SLinus Torvalds if (!jeb->first_node) 7851da177e4SLinus Torvalds jeb->first_node = raw; 7861da177e4SLinus Torvalds if (jeb->last_node) 7871da177e4SLinus Torvalds jeb->last_node->next_phys = raw; 7881da177e4SLinus Torvalds jeb->last_node = raw; 7891da177e4SLinus Torvalds 7901da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Node is ino #%u, version %d. Range 0x%x-0x%x\n", 7911da177e4SLinus Torvalds je32_to_cpu(ri->ino), je32_to_cpu(ri->version), 7921da177e4SLinus Torvalds je32_to_cpu(ri->offset), 7931da177e4SLinus Torvalds je32_to_cpu(ri->offset)+je32_to_cpu(ri->dsize))); 7941da177e4SLinus Torvalds 7951da177e4SLinus Torvalds pseudo_random += je32_to_cpu(ri->version); 7961da177e4SLinus Torvalds 7971da177e4SLinus Torvalds UNCHECKED_SPACE(PAD(je32_to_cpu(ri->totlen))); 798e631ddbaSFerenc Havasi 799e631ddbaSFerenc Havasi if (jffs2_sum_active()) { 800e631ddbaSFerenc Havasi jffs2_sum_add_inode_mem(s, ri, ofs - jeb->offset); 801e631ddbaSFerenc Havasi } 802e631ddbaSFerenc Havasi 8031da177e4SLinus Torvalds return 0; 8041da177e4SLinus Torvalds } 8051da177e4SLinus Torvalds 8061da177e4SLinus Torvalds static int jffs2_scan_dirent_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 807e631ddbaSFerenc Havasi struct jffs2_raw_dirent *rd, uint32_t ofs, struct jffs2_summary *s) 8081da177e4SLinus Torvalds { 8091da177e4SLinus Torvalds struct jffs2_raw_node_ref *raw; 8101da177e4SLinus Torvalds struct jffs2_full_dirent *fd; 8111da177e4SLinus Torvalds struct jffs2_inode_cache *ic; 8121da177e4SLinus Torvalds uint32_t crc; 8131da177e4SLinus Torvalds 8141da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_scan_dirent_node(): Node at 0x%08x\n", ofs)); 8151da177e4SLinus Torvalds 8161da177e4SLinus Torvalds /* We don't get here unless the node is still valid, so we don't have to 8171da177e4SLinus Torvalds mask in the ACCURATE bit any more. */ 8181da177e4SLinus Torvalds crc = crc32(0, rd, sizeof(*rd)-8); 8191da177e4SLinus Torvalds 8201da177e4SLinus Torvalds if (crc != je32_to_cpu(rd->node_crc)) { 8211da177e4SLinus Torvalds printk(KERN_NOTICE "jffs2_scan_dirent_node(): Node CRC failed on node at 0x%08x: Read 0x%08x, calculated 0x%08x\n", 8221da177e4SLinus Torvalds ofs, je32_to_cpu(rd->node_crc), crc); 8231da177e4SLinus Torvalds /* We believe totlen because the CRC on the node _header_ was OK, just the node itself failed. */ 8241da177e4SLinus Torvalds DIRTY_SPACE(PAD(je32_to_cpu(rd->totlen))); 8251da177e4SLinus Torvalds return 0; 8261da177e4SLinus Torvalds } 8271da177e4SLinus Torvalds 8281da177e4SLinus Torvalds pseudo_random += je32_to_cpu(rd->version); 8291da177e4SLinus Torvalds 8301da177e4SLinus Torvalds fd = jffs2_alloc_full_dirent(rd->nsize+1); 8311da177e4SLinus Torvalds if (!fd) { 8321da177e4SLinus Torvalds return -ENOMEM; 8331da177e4SLinus Torvalds } 8341da177e4SLinus Torvalds memcpy(&fd->name, rd->name, rd->nsize); 8351da177e4SLinus Torvalds fd->name[rd->nsize] = 0; 8361da177e4SLinus Torvalds 8371da177e4SLinus Torvalds crc = crc32(0, fd->name, rd->nsize); 8381da177e4SLinus Torvalds if (crc != je32_to_cpu(rd->name_crc)) { 8391da177e4SLinus Torvalds printk(KERN_NOTICE "jffs2_scan_dirent_node(): Name CRC failed on node at 0x%08x: Read 0x%08x, calculated 0x%08x\n", 8401da177e4SLinus Torvalds ofs, je32_to_cpu(rd->name_crc), crc); 8411da177e4SLinus Torvalds D1(printk(KERN_NOTICE "Name for which CRC failed is (now) '%s', ino #%d\n", fd->name, je32_to_cpu(rd->ino))); 8421da177e4SLinus Torvalds jffs2_free_full_dirent(fd); 8431da177e4SLinus Torvalds /* FIXME: Why do we believe totlen? */ 8441da177e4SLinus Torvalds /* We believe totlen because the CRC on the node _header_ was OK, just the name failed. */ 8451da177e4SLinus Torvalds DIRTY_SPACE(PAD(je32_to_cpu(rd->totlen))); 8461da177e4SLinus Torvalds return 0; 8471da177e4SLinus Torvalds } 8481da177e4SLinus Torvalds raw = jffs2_alloc_raw_node_ref(); 8491da177e4SLinus Torvalds if (!raw) { 8501da177e4SLinus Torvalds jffs2_free_full_dirent(fd); 8511da177e4SLinus Torvalds printk(KERN_NOTICE "jffs2_scan_dirent_node(): allocation of node reference failed\n"); 8521da177e4SLinus Torvalds return -ENOMEM; 8531da177e4SLinus Torvalds } 8541da177e4SLinus Torvalds ic = jffs2_scan_make_ino_cache(c, je32_to_cpu(rd->pino)); 8551da177e4SLinus Torvalds if (!ic) { 8561da177e4SLinus Torvalds jffs2_free_full_dirent(fd); 8571da177e4SLinus Torvalds jffs2_free_raw_node_ref(raw); 8581da177e4SLinus Torvalds return -ENOMEM; 8591da177e4SLinus Torvalds } 8601da177e4SLinus Torvalds 8611da177e4SLinus Torvalds raw->__totlen = PAD(je32_to_cpu(rd->totlen)); 8621da177e4SLinus Torvalds raw->flash_offset = ofs | REF_PRISTINE; 8631da177e4SLinus Torvalds raw->next_phys = NULL; 8641da177e4SLinus Torvalds raw->next_in_ino = ic->nodes; 8651da177e4SLinus Torvalds ic->nodes = raw; 8661da177e4SLinus Torvalds if (!jeb->first_node) 8671da177e4SLinus Torvalds jeb->first_node = raw; 8681da177e4SLinus Torvalds if (jeb->last_node) 8691da177e4SLinus Torvalds jeb->last_node->next_phys = raw; 8701da177e4SLinus Torvalds jeb->last_node = raw; 8711da177e4SLinus Torvalds 8721da177e4SLinus Torvalds fd->raw = raw; 8731da177e4SLinus Torvalds fd->next = NULL; 8741da177e4SLinus Torvalds fd->version = je32_to_cpu(rd->version); 8751da177e4SLinus Torvalds fd->ino = je32_to_cpu(rd->ino); 8761da177e4SLinus Torvalds fd->nhash = full_name_hash(fd->name, rd->nsize); 8771da177e4SLinus Torvalds fd->type = rd->type; 8781da177e4SLinus Torvalds USED_SPACE(PAD(je32_to_cpu(rd->totlen))); 8791da177e4SLinus Torvalds jffs2_add_fd_to_list(c, fd, &ic->scan_dents); 8801da177e4SLinus Torvalds 881e631ddbaSFerenc Havasi if (jffs2_sum_active()) { 882e631ddbaSFerenc Havasi jffs2_sum_add_dirent_mem(s, rd, ofs - jeb->offset); 883e631ddbaSFerenc Havasi } 884e631ddbaSFerenc Havasi 8851da177e4SLinus Torvalds return 0; 8861da177e4SLinus Torvalds } 8871da177e4SLinus Torvalds 8881da177e4SLinus Torvalds static int count_list(struct list_head *l) 8891da177e4SLinus Torvalds { 8901da177e4SLinus Torvalds uint32_t count = 0; 8911da177e4SLinus Torvalds struct list_head *tmp; 8921da177e4SLinus Torvalds 8931da177e4SLinus Torvalds list_for_each(tmp, l) { 8941da177e4SLinus Torvalds count++; 8951da177e4SLinus Torvalds } 8961da177e4SLinus Torvalds return count; 8971da177e4SLinus Torvalds } 8981da177e4SLinus Torvalds 8991da177e4SLinus Torvalds /* Note: This breaks if list_empty(head). I don't care. You 9001da177e4SLinus Torvalds might, if you copy this code and use it elsewhere :) */ 9011da177e4SLinus Torvalds static void rotate_list(struct list_head *head, uint32_t count) 9021da177e4SLinus Torvalds { 9031da177e4SLinus Torvalds struct list_head *n = head->next; 9041da177e4SLinus Torvalds 9051da177e4SLinus Torvalds list_del(head); 9061da177e4SLinus Torvalds while(count--) { 9071da177e4SLinus Torvalds n = n->next; 9081da177e4SLinus Torvalds } 9091da177e4SLinus Torvalds list_add(head, n); 9101da177e4SLinus Torvalds } 9111da177e4SLinus Torvalds 9121da177e4SLinus Torvalds void jffs2_rotate_lists(struct jffs2_sb_info *c) 9131da177e4SLinus Torvalds { 9141da177e4SLinus Torvalds uint32_t x; 9151da177e4SLinus Torvalds uint32_t rotateby; 9161da177e4SLinus Torvalds 9171da177e4SLinus Torvalds x = count_list(&c->clean_list); 9181da177e4SLinus Torvalds if (x) { 9191da177e4SLinus Torvalds rotateby = pseudo_random % x; 9201da177e4SLinus Torvalds rotate_list((&c->clean_list), rotateby); 9211da177e4SLinus Torvalds } 9221da177e4SLinus Torvalds 9231da177e4SLinus Torvalds x = count_list(&c->very_dirty_list); 9241da177e4SLinus Torvalds if (x) { 9251da177e4SLinus Torvalds rotateby = pseudo_random % x; 9261da177e4SLinus Torvalds rotate_list((&c->very_dirty_list), rotateby); 9271da177e4SLinus Torvalds } 9281da177e4SLinus Torvalds 9291da177e4SLinus Torvalds x = count_list(&c->dirty_list); 9301da177e4SLinus Torvalds if (x) { 9311da177e4SLinus Torvalds rotateby = pseudo_random % x; 9321da177e4SLinus Torvalds rotate_list((&c->dirty_list), rotateby); 9331da177e4SLinus Torvalds } 9341da177e4SLinus Torvalds 9351da177e4SLinus Torvalds x = count_list(&c->erasable_list); 9361da177e4SLinus Torvalds if (x) { 9371da177e4SLinus Torvalds rotateby = pseudo_random % x; 9381da177e4SLinus Torvalds rotate_list((&c->erasable_list), rotateby); 9391da177e4SLinus Torvalds } 9401da177e4SLinus Torvalds 9411da177e4SLinus Torvalds if (c->nr_erasing_blocks) { 9421da177e4SLinus Torvalds rotateby = pseudo_random % c->nr_erasing_blocks; 9431da177e4SLinus Torvalds rotate_list((&c->erase_pending_list), rotateby); 9441da177e4SLinus Torvalds } 9451da177e4SLinus Torvalds 9461da177e4SLinus Torvalds if (c->nr_free_blocks) { 9471da177e4SLinus Torvalds rotateby = pseudo_random % c->nr_free_blocks; 9481da177e4SLinus Torvalds rotate_list((&c->free_list), rotateby); 9491da177e4SLinus Torvalds } 9501da177e4SLinus Torvalds } 951