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 6825090a6bSDavid Woodhouse static int file_dirty(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb) 6925090a6bSDavid Woodhouse { 70a6a8bef7SDavid Woodhouse int ret; 71a6a8bef7SDavid Woodhouse 72a6a8bef7SDavid Woodhouse if ((ret = jffs2_prealloc_raw_node_refs(c, jeb, 1))) 73a6a8bef7SDavid Woodhouse return ret; 74a6a8bef7SDavid Woodhouse if ((ret = jffs2_scan_dirty_space(c, jeb, jeb->free_size))) 7525090a6bSDavid Woodhouse return ret; 7625090a6bSDavid Woodhouse /* Turned wasted size into dirty, since we apparently 7725090a6bSDavid Woodhouse think it's recoverable now. */ 7825090a6bSDavid Woodhouse jeb->dirty_size += jeb->wasted_size; 7925090a6bSDavid Woodhouse c->dirty_size += jeb->wasted_size; 8025090a6bSDavid Woodhouse c->wasted_size -= jeb->wasted_size; 8125090a6bSDavid Woodhouse jeb->wasted_size = 0; 8225090a6bSDavid Woodhouse if (VERYDIRTY(c, jeb->dirty_size)) { 8325090a6bSDavid Woodhouse list_add(&jeb->list, &c->very_dirty_list); 8425090a6bSDavid Woodhouse } else { 8525090a6bSDavid Woodhouse list_add(&jeb->list, &c->dirty_list); 8625090a6bSDavid Woodhouse } 8725090a6bSDavid Woodhouse return 0; 8825090a6bSDavid Woodhouse } 8925090a6bSDavid Woodhouse 901da177e4SLinus Torvalds int jffs2_scan_medium(struct jffs2_sb_info *c) 911da177e4SLinus Torvalds { 921da177e4SLinus Torvalds int i, ret; 931da177e4SLinus Torvalds uint32_t empty_blocks = 0, bad_blocks = 0; 941da177e4SLinus Torvalds unsigned char *flashbuf = NULL; 951da177e4SLinus Torvalds uint32_t buf_size = 0; 96e631ddbaSFerenc Havasi struct jffs2_summary *s = NULL; /* summary info collected by the scan process */ 971da177e4SLinus Torvalds #ifndef __ECOS 981da177e4SLinus Torvalds size_t pointlen; 991da177e4SLinus Torvalds 1001da177e4SLinus Torvalds if (c->mtd->point) { 1011da177e4SLinus Torvalds ret = c->mtd->point (c->mtd, 0, c->mtd->size, &pointlen, &flashbuf); 1021da177e4SLinus Torvalds if (!ret && pointlen < c->mtd->size) { 1031da177e4SLinus Torvalds /* Don't muck about if it won't let us point to the whole flash */ 1041da177e4SLinus Torvalds D1(printk(KERN_DEBUG "MTD point returned len too short: 0x%zx\n", pointlen)); 1051da177e4SLinus Torvalds c->mtd->unpoint(c->mtd, flashbuf, 0, c->mtd->size); 1061da177e4SLinus Torvalds flashbuf = NULL; 1071da177e4SLinus Torvalds } 1081da177e4SLinus Torvalds if (ret) 1091da177e4SLinus Torvalds D1(printk(KERN_DEBUG "MTD point failed %d\n", ret)); 1101da177e4SLinus Torvalds } 1111da177e4SLinus Torvalds #endif 1121da177e4SLinus Torvalds if (!flashbuf) { 1131da177e4SLinus Torvalds /* For NAND it's quicker to read a whole eraseblock at a time, 1141da177e4SLinus Torvalds apparently */ 1151da177e4SLinus Torvalds if (jffs2_cleanmarker_oob(c)) 1161da177e4SLinus Torvalds buf_size = c->sector_size; 1171da177e4SLinus Torvalds else 1181da177e4SLinus Torvalds buf_size = PAGE_SIZE; 1191da177e4SLinus Torvalds 1201da177e4SLinus Torvalds /* Respect kmalloc limitations */ 1211da177e4SLinus Torvalds if (buf_size > 128*1024) 1221da177e4SLinus Torvalds buf_size = 128*1024; 1231da177e4SLinus Torvalds 1241da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Allocating readbuf of %d bytes\n", buf_size)); 1251da177e4SLinus Torvalds flashbuf = kmalloc(buf_size, GFP_KERNEL); 1261da177e4SLinus Torvalds if (!flashbuf) 1271da177e4SLinus Torvalds return -ENOMEM; 1281da177e4SLinus Torvalds } 1291da177e4SLinus Torvalds 130e631ddbaSFerenc Havasi if (jffs2_sum_active()) { 131e631ddbaSFerenc Havasi s = kmalloc(sizeof(struct jffs2_summary), GFP_KERNEL); 132e631ddbaSFerenc Havasi if (!s) { 133e631ddbaSFerenc Havasi JFFS2_WARNING("Can't allocate memory for summary\n"); 134e631ddbaSFerenc Havasi return -ENOMEM; 135e631ddbaSFerenc Havasi } 136e631ddbaSFerenc Havasi memset(s, 0, sizeof(struct jffs2_summary)); 137e631ddbaSFerenc Havasi } 138e631ddbaSFerenc Havasi 1391da177e4SLinus Torvalds for (i=0; i<c->nr_blocks; i++) { 1401da177e4SLinus Torvalds struct jffs2_eraseblock *jeb = &c->blocks[i]; 1411da177e4SLinus Torvalds 142e631ddbaSFerenc Havasi /* reset summary info for next eraseblock scan */ 143e631ddbaSFerenc Havasi jffs2_sum_reset_collected(s); 144e631ddbaSFerenc Havasi 145e631ddbaSFerenc Havasi ret = jffs2_scan_eraseblock(c, jeb, buf_size?flashbuf:(flashbuf+jeb->offset), 146e631ddbaSFerenc Havasi buf_size, s); 1471da177e4SLinus Torvalds 1481da177e4SLinus Torvalds if (ret < 0) 1491da177e4SLinus Torvalds goto out; 1501da177e4SLinus Torvalds 151e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_paranoia_check_nolock(c, jeb); 1521da177e4SLinus Torvalds 1531da177e4SLinus Torvalds /* Now decide which list to put it on */ 1541da177e4SLinus Torvalds switch(ret) { 1551da177e4SLinus Torvalds case BLK_STATE_ALLFF: 1561da177e4SLinus Torvalds /* 1571da177e4SLinus Torvalds * Empty block. Since we can't be sure it 1581da177e4SLinus Torvalds * was entirely erased, we just queue it for erase 1591da177e4SLinus Torvalds * again. It will be marked as such when the erase 1601da177e4SLinus Torvalds * is complete. Meanwhile we still count it as empty 1611da177e4SLinus Torvalds * for later checks. 1621da177e4SLinus Torvalds */ 1631da177e4SLinus Torvalds empty_blocks++; 1641da177e4SLinus Torvalds list_add(&jeb->list, &c->erase_pending_list); 1651da177e4SLinus Torvalds c->nr_erasing_blocks++; 1661da177e4SLinus Torvalds break; 1671da177e4SLinus Torvalds 1681da177e4SLinus Torvalds case BLK_STATE_CLEANMARKER: 1691da177e4SLinus Torvalds /* Only a CLEANMARKER node is valid */ 1701da177e4SLinus Torvalds if (!jeb->dirty_size) { 1711da177e4SLinus Torvalds /* It's actually free */ 1721da177e4SLinus Torvalds list_add(&jeb->list, &c->free_list); 1731da177e4SLinus Torvalds c->nr_free_blocks++; 1741da177e4SLinus Torvalds } else { 1751da177e4SLinus Torvalds /* Dirt */ 1761da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Adding all-dirty block at 0x%08x to erase_pending_list\n", jeb->offset)); 1771da177e4SLinus Torvalds list_add(&jeb->list, &c->erase_pending_list); 1781da177e4SLinus Torvalds c->nr_erasing_blocks++; 1791da177e4SLinus Torvalds } 1801da177e4SLinus Torvalds break; 1811da177e4SLinus Torvalds 1821da177e4SLinus Torvalds case BLK_STATE_CLEAN: 1831da177e4SLinus Torvalds /* Full (or almost full) of clean data. Clean list */ 1841da177e4SLinus Torvalds list_add(&jeb->list, &c->clean_list); 1851da177e4SLinus Torvalds break; 1861da177e4SLinus Torvalds 1871da177e4SLinus Torvalds case BLK_STATE_PARTDIRTY: 1881da177e4SLinus Torvalds /* Some data, but not full. Dirty list. */ 1891da177e4SLinus Torvalds /* We want to remember the block with most free space 1901da177e4SLinus Torvalds and stick it in the 'nextblock' position to start writing to it. */ 1911da177e4SLinus Torvalds if (jeb->free_size > min_free(c) && 1921da177e4SLinus Torvalds (!c->nextblock || c->nextblock->free_size < jeb->free_size)) { 1931da177e4SLinus Torvalds /* Better candidate for the next writes to go to */ 1941da177e4SLinus Torvalds if (c->nextblock) { 19525090a6bSDavid Woodhouse ret = file_dirty(c, c->nextblock); 19625090a6bSDavid Woodhouse if (ret) 19725090a6bSDavid Woodhouse return ret; 198e631ddbaSFerenc Havasi /* deleting summary information of the old nextblock */ 199e631ddbaSFerenc Havasi jffs2_sum_reset_collected(c->summary); 2001da177e4SLinus Torvalds } 20125090a6bSDavid Woodhouse /* update collected summary information for the current nextblock */ 202e631ddbaSFerenc Havasi jffs2_sum_move_collected(c, s); 203e631ddbaSFerenc Havasi D1(printk(KERN_DEBUG "jffs2_scan_medium(): new nextblock = 0x%08x\n", jeb->offset)); 2041da177e4SLinus Torvalds c->nextblock = jeb; 2051da177e4SLinus Torvalds } else { 20625090a6bSDavid Woodhouse ret = file_dirty(c, jeb); 20725090a6bSDavid Woodhouse if (ret) 20825090a6bSDavid Woodhouse return ret; 2091da177e4SLinus Torvalds } 2101da177e4SLinus Torvalds break; 2111da177e4SLinus Torvalds 2121da177e4SLinus Torvalds case BLK_STATE_ALLDIRTY: 2131da177e4SLinus Torvalds /* Nothing valid - not even a clean marker. Needs erasing. */ 2141da177e4SLinus Torvalds /* For now we just put it on the erasing list. We'll start the erases later */ 2151da177e4SLinus Torvalds D1(printk(KERN_NOTICE "JFFS2: Erase block at 0x%08x is not formatted. It will be erased\n", jeb->offset)); 2161da177e4SLinus Torvalds list_add(&jeb->list, &c->erase_pending_list); 2171da177e4SLinus Torvalds c->nr_erasing_blocks++; 2181da177e4SLinus Torvalds break; 2191da177e4SLinus Torvalds 2201da177e4SLinus Torvalds case BLK_STATE_BADBLOCK: 2211da177e4SLinus Torvalds D1(printk(KERN_NOTICE "JFFS2: Block at 0x%08x is bad\n", jeb->offset)); 2221da177e4SLinus Torvalds list_add(&jeb->list, &c->bad_list); 2231da177e4SLinus Torvalds c->bad_size += c->sector_size; 2241da177e4SLinus Torvalds c->free_size -= c->sector_size; 2251da177e4SLinus Torvalds bad_blocks++; 2261da177e4SLinus Torvalds break; 2271da177e4SLinus Torvalds default: 2281da177e4SLinus Torvalds printk(KERN_WARNING "jffs2_scan_medium(): unknown block state\n"); 2291da177e4SLinus Torvalds BUG(); 2301da177e4SLinus Torvalds } 2311da177e4SLinus Torvalds } 2321da177e4SLinus Torvalds 2331da177e4SLinus Torvalds /* Nextblock dirty is always seen as wasted, because we cannot recycle it now */ 2341da177e4SLinus Torvalds if (c->nextblock && (c->nextblock->dirty_size)) { 2351da177e4SLinus Torvalds c->nextblock->wasted_size += c->nextblock->dirty_size; 2361da177e4SLinus Torvalds c->wasted_size += c->nextblock->dirty_size; 2371da177e4SLinus Torvalds c->dirty_size -= c->nextblock->dirty_size; 2381da177e4SLinus Torvalds c->nextblock->dirty_size = 0; 2391da177e4SLinus Torvalds } 2402f82ce1eSAndrew Victor #ifdef CONFIG_JFFS2_FS_WRITEBUFFER 241e96fb230SDavid Woodhouse if (!jffs2_can_mark_obsolete(c) && c->wbuf_pagesize && c->nextblock && (c->nextblock->free_size % c->wbuf_pagesize)) { 2421da177e4SLinus Torvalds /* If we're going to start writing into a block which already 2431da177e4SLinus Torvalds contains data, and the end of the data isn't page-aligned, 2441da177e4SLinus Torvalds skip a little and align it. */ 2451da177e4SLinus Torvalds 246daba5cc4SArtem B. Bityutskiy uint32_t skip = c->nextblock->free_size % c->wbuf_pagesize; 2471da177e4SLinus Torvalds 2481da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_scan_medium(): Skipping %d bytes in nextblock to ensure page alignment\n", 2491da177e4SLinus Torvalds skip)); 250046b8b98SDavid Woodhouse jffs2_prealloc_raw_node_refs(c, c->nextblock, 1); 251f560928bSDavid Woodhouse jffs2_scan_dirty_space(c, c->nextblock, skip); 2521da177e4SLinus Torvalds } 2531da177e4SLinus Torvalds #endif 2541da177e4SLinus Torvalds if (c->nr_erasing_blocks) { 2551da177e4SLinus Torvalds if ( !c->used_size && ((c->nr_free_blocks+empty_blocks+bad_blocks)!= c->nr_blocks || bad_blocks == c->nr_blocks) ) { 2561da177e4SLinus Torvalds printk(KERN_NOTICE "Cowardly refusing to erase blocks on filesystem with no valid JFFS2 nodes\n"); 2571da177e4SLinus Torvalds printk(KERN_NOTICE "empty_blocks %d, bad_blocks %d, c->nr_blocks %d\n",empty_blocks,bad_blocks,c->nr_blocks); 2581da177e4SLinus Torvalds ret = -EIO; 2591da177e4SLinus Torvalds goto out; 2601da177e4SLinus Torvalds } 2611da177e4SLinus Torvalds jffs2_erase_pending_trigger(c); 2621da177e4SLinus Torvalds } 2631da177e4SLinus Torvalds ret = 0; 2641da177e4SLinus Torvalds out: 2651da177e4SLinus Torvalds if (buf_size) 2661da177e4SLinus Torvalds kfree(flashbuf); 2671da177e4SLinus Torvalds #ifndef __ECOS 2681da177e4SLinus Torvalds else 2691da177e4SLinus Torvalds c->mtd->unpoint(c->mtd, flashbuf, 0, c->mtd->size); 2701da177e4SLinus Torvalds #endif 2715b5ffbc1SFlorin Malita if (s) 2725b5ffbc1SFlorin Malita kfree(s); 2735b5ffbc1SFlorin Malita 2741da177e4SLinus Torvalds return ret; 2751da177e4SLinus Torvalds } 2761da177e4SLinus Torvalds 277e631ddbaSFerenc Havasi int jffs2_fill_scan_buf (struct jffs2_sb_info *c, void *buf, 2781da177e4SLinus Torvalds uint32_t ofs, uint32_t len) 2791da177e4SLinus Torvalds { 2801da177e4SLinus Torvalds int ret; 2811da177e4SLinus Torvalds size_t retlen; 2821da177e4SLinus Torvalds 2831da177e4SLinus Torvalds ret = jffs2_flash_read(c, ofs, len, &retlen, buf); 2841da177e4SLinus Torvalds if (ret) { 2851da177e4SLinus Torvalds D1(printk(KERN_WARNING "mtd->read(0x%x bytes from 0x%x) returned %d\n", len, ofs, ret)); 2861da177e4SLinus Torvalds return ret; 2871da177e4SLinus Torvalds } 2881da177e4SLinus Torvalds if (retlen < len) { 2891da177e4SLinus Torvalds D1(printk(KERN_WARNING "Read at 0x%x gave only 0x%zx bytes\n", ofs, retlen)); 2901da177e4SLinus Torvalds return -EIO; 2911da177e4SLinus Torvalds } 2921da177e4SLinus Torvalds return 0; 2931da177e4SLinus Torvalds } 2941da177e4SLinus Torvalds 295e631ddbaSFerenc Havasi int jffs2_scan_classify_jeb(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb) 296e631ddbaSFerenc Havasi { 297e631ddbaSFerenc Havasi if ((jeb->used_size + jeb->unchecked_size) == PAD(c->cleanmarker_size) && !jeb->dirty_size 29899988f7bSDavid Woodhouse && (!jeb->first_node || !ref_next(jeb->first_node)) ) 299e631ddbaSFerenc Havasi return BLK_STATE_CLEANMARKER; 300e631ddbaSFerenc Havasi 301e631ddbaSFerenc Havasi /* move blocks with max 4 byte dirty space to cleanlist */ 302e631ddbaSFerenc Havasi else if (!ISDIRTY(c->sector_size - (jeb->used_size + jeb->unchecked_size))) { 303e631ddbaSFerenc Havasi c->dirty_size -= jeb->dirty_size; 304e631ddbaSFerenc Havasi c->wasted_size += jeb->dirty_size; 305e631ddbaSFerenc Havasi jeb->wasted_size += jeb->dirty_size; 306e631ddbaSFerenc Havasi jeb->dirty_size = 0; 307e631ddbaSFerenc Havasi return BLK_STATE_CLEAN; 308e631ddbaSFerenc Havasi } else if (jeb->used_size || jeb->unchecked_size) 309e631ddbaSFerenc Havasi return BLK_STATE_PARTDIRTY; 310e631ddbaSFerenc Havasi else 311e631ddbaSFerenc Havasi return BLK_STATE_ALLDIRTY; 312e631ddbaSFerenc Havasi } 313e631ddbaSFerenc Havasi 314aa98d7cfSKaiGai Kohei #ifdef CONFIG_JFFS2_FS_XATTR 315aa98d7cfSKaiGai Kohei static int jffs2_scan_xattr_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 316aa98d7cfSKaiGai Kohei struct jffs2_raw_xattr *rx, uint32_t ofs, 317aa98d7cfSKaiGai Kohei struct jffs2_summary *s) 318aa98d7cfSKaiGai Kohei { 319aa98d7cfSKaiGai Kohei struct jffs2_xattr_datum *xd; 320c9f700f8SKaiGai Kohei uint32_t xid, version, totlen, crc; 32168270995SDavid Woodhouse int err; 322aa98d7cfSKaiGai Kohei 323aa98d7cfSKaiGai Kohei crc = crc32(0, rx, sizeof(struct jffs2_raw_xattr) - 4); 324aa98d7cfSKaiGai Kohei if (crc != je32_to_cpu(rx->node_crc)) { 325aa98d7cfSKaiGai Kohei JFFS2_WARNING("node CRC failed at %#08x, read=%#08x, calc=%#08x\n", 326aa98d7cfSKaiGai Kohei ofs, je32_to_cpu(rx->node_crc), crc); 32768270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, je32_to_cpu(rx->totlen)))) 32868270995SDavid Woodhouse return err; 329aa98d7cfSKaiGai Kohei return 0; 330aa98d7cfSKaiGai Kohei } 331aa98d7cfSKaiGai Kohei 332c9f700f8SKaiGai Kohei xid = je32_to_cpu(rx->xid); 333c9f700f8SKaiGai Kohei version = je32_to_cpu(rx->version); 334c9f700f8SKaiGai Kohei 335c9f700f8SKaiGai Kohei totlen = sizeof(struct jffs2_raw_xattr); 336c9f700f8SKaiGai Kohei if (version != XDATUM_DELETE_MARKER) 337c9f700f8SKaiGai Kohei totlen += rx->name_len + 1 + je16_to_cpu(rx->value_len); 338c9f700f8SKaiGai Kohei totlen = PAD(totlen); 339aa98d7cfSKaiGai Kohei if (totlen != je32_to_cpu(rx->totlen)) { 340aa98d7cfSKaiGai Kohei JFFS2_WARNING("node length mismatch at %#08x, read=%u, calc=%u\n", 341aa98d7cfSKaiGai Kohei ofs, je32_to_cpu(rx->totlen), totlen); 34268270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, je32_to_cpu(rx->totlen)))) 34368270995SDavid Woodhouse return err; 344aa98d7cfSKaiGai Kohei return 0; 345aa98d7cfSKaiGai Kohei } 346aa98d7cfSKaiGai Kohei 347c9f700f8SKaiGai Kohei xd = jffs2_setup_xattr_datum(c, xid, version); 348c9f700f8SKaiGai Kohei if (IS_ERR(xd)) 349aa98d7cfSKaiGai Kohei return PTR_ERR(xd); 350c9f700f8SKaiGai Kohei 351c9f700f8SKaiGai Kohei if (xd->version > version) { 352c9f700f8SKaiGai Kohei struct jffs2_raw_node_ref *raw 353c9f700f8SKaiGai Kohei = jffs2_link_node_ref(c, jeb, ofs | REF_PRISTINE, totlen, NULL); 354c9f700f8SKaiGai Kohei raw->next_in_ino = xd->node->next_in_ino; 355c9f700f8SKaiGai Kohei xd->node->next_in_ino = raw; 356c9f700f8SKaiGai Kohei } else { 357c9f700f8SKaiGai Kohei xd->version = version; 358aa98d7cfSKaiGai Kohei xd->xprefix = rx->xprefix; 359aa98d7cfSKaiGai Kohei xd->name_len = rx->name_len; 360aa98d7cfSKaiGai Kohei xd->value_len = je16_to_cpu(rx->value_len); 361aa98d7cfSKaiGai Kohei xd->data_crc = je32_to_cpu(rx->data_crc); 362aa98d7cfSKaiGai Kohei 363c9f700f8SKaiGai Kohei jffs2_link_node_ref(c, jeb, ofs | REF_PRISTINE, totlen, (void *)xd); 364c9f700f8SKaiGai Kohei } 365f1f9671bSDavid Woodhouse 366aa98d7cfSKaiGai Kohei if (jffs2_sum_active()) 367aa98d7cfSKaiGai Kohei jffs2_sum_add_xattr_mem(s, rx, ofs - jeb->offset); 368aa98d7cfSKaiGai Kohei dbg_xattr("scaning xdatum at %#08x (xid=%u, version=%u)\n", 369aa98d7cfSKaiGai Kohei ofs, xd->xid, xd->version); 370aa98d7cfSKaiGai Kohei return 0; 371aa98d7cfSKaiGai Kohei } 372aa98d7cfSKaiGai Kohei 373aa98d7cfSKaiGai Kohei static int jffs2_scan_xref_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 374aa98d7cfSKaiGai Kohei struct jffs2_raw_xref *rr, uint32_t ofs, 375aa98d7cfSKaiGai Kohei struct jffs2_summary *s) 376aa98d7cfSKaiGai Kohei { 377aa98d7cfSKaiGai Kohei struct jffs2_xattr_ref *ref; 378aa98d7cfSKaiGai Kohei uint32_t crc; 37968270995SDavid Woodhouse int err; 380aa98d7cfSKaiGai Kohei 381aa98d7cfSKaiGai Kohei crc = crc32(0, rr, sizeof(*rr) - 4); 382aa98d7cfSKaiGai Kohei if (crc != je32_to_cpu(rr->node_crc)) { 383aa98d7cfSKaiGai Kohei JFFS2_WARNING("node CRC failed at %#08x, read=%#08x, calc=%#08x\n", 384aa98d7cfSKaiGai Kohei ofs, je32_to_cpu(rr->node_crc), crc); 38568270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(rr->totlen))))) 38668270995SDavid Woodhouse return err; 387aa98d7cfSKaiGai Kohei return 0; 388aa98d7cfSKaiGai Kohei } 389aa98d7cfSKaiGai Kohei 390aa98d7cfSKaiGai Kohei if (PAD(sizeof(struct jffs2_raw_xref)) != je32_to_cpu(rr->totlen)) { 39189291a9dSDavid Woodhouse JFFS2_WARNING("node length mismatch at %#08x, read=%u, calc=%zd\n", 392aa98d7cfSKaiGai Kohei ofs, je32_to_cpu(rr->totlen), 393aa98d7cfSKaiGai Kohei PAD(sizeof(struct jffs2_raw_xref))); 39468270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, je32_to_cpu(rr->totlen)))) 39568270995SDavid Woodhouse return err; 396aa98d7cfSKaiGai Kohei return 0; 397aa98d7cfSKaiGai Kohei } 398aa98d7cfSKaiGai Kohei 399aa98d7cfSKaiGai Kohei ref = jffs2_alloc_xattr_ref(); 400aa98d7cfSKaiGai Kohei if (!ref) 401aa98d7cfSKaiGai Kohei return -ENOMEM; 402aa98d7cfSKaiGai Kohei 403aa98d7cfSKaiGai Kohei /* BEFORE jffs2_build_xattr_subsystem() called, 404c9f700f8SKaiGai Kohei * and AFTER xattr_ref is marked as a dead xref, 405aa98d7cfSKaiGai Kohei * ref->xid is used to store 32bit xid, xd is not used 406aa98d7cfSKaiGai Kohei * ref->ino is used to store 32bit inode-number, ic is not used 407aa98d7cfSKaiGai Kohei * Thoes variables are declared as union, thus using those 4088f2b6f49SKaiGai Kohei * are exclusive. In a similar way, ref->next is temporarily 409aa98d7cfSKaiGai Kohei * used to chain all xattr_ref object. It's re-chained to 410aa98d7cfSKaiGai Kohei * jffs2_inode_cache in jffs2_build_xattr_subsystem() correctly. 411aa98d7cfSKaiGai Kohei */ 412aa98d7cfSKaiGai Kohei ref->ino = je32_to_cpu(rr->ino); 413aa98d7cfSKaiGai Kohei ref->xid = je32_to_cpu(rr->xid); 414c9f700f8SKaiGai Kohei ref->xseqno = je32_to_cpu(rr->xseqno); 415c9f700f8SKaiGai Kohei if (ref->xseqno > c->highest_xseqno) 416c9f700f8SKaiGai Kohei c->highest_xseqno = (ref->xseqno & ~XREF_DELETE_MARKER); 4178f2b6f49SKaiGai Kohei ref->next = c->xref_temp; 4188f2b6f49SKaiGai Kohei c->xref_temp = ref; 419aa98d7cfSKaiGai Kohei 420c9f700f8SKaiGai Kohei jffs2_link_node_ref(c, jeb, ofs | REF_PRISTINE, PAD(je32_to_cpu(rr->totlen)), (void *)ref); 421f1f9671bSDavid Woodhouse 422aa98d7cfSKaiGai Kohei if (jffs2_sum_active()) 423aa98d7cfSKaiGai Kohei jffs2_sum_add_xref_mem(s, rr, ofs - jeb->offset); 424aa98d7cfSKaiGai Kohei dbg_xattr("scan xref at %#08x (xid=%u, ino=%u)\n", 425aa98d7cfSKaiGai Kohei ofs, ref->xid, ref->ino); 426aa98d7cfSKaiGai Kohei return 0; 427aa98d7cfSKaiGai Kohei } 428aa98d7cfSKaiGai Kohei #endif 429aa98d7cfSKaiGai Kohei 4309641b784SDavid Woodhouse /* Called with 'buf_size == 0' if buf is in fact a pointer _directly_ into 4319641b784SDavid Woodhouse the flash, XIP-style */ 4321da177e4SLinus Torvalds static int jffs2_scan_eraseblock (struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 433e631ddbaSFerenc Havasi unsigned char *buf, uint32_t buf_size, struct jffs2_summary *s) { 4341da177e4SLinus Torvalds struct jffs2_unknown_node *node; 4351da177e4SLinus Torvalds struct jffs2_unknown_node crcnode; 4361da177e4SLinus Torvalds uint32_t ofs, prevofs; 4371da177e4SLinus Torvalds uint32_t hdr_crc, buf_ofs, buf_len; 4381da177e4SLinus Torvalds int err; 4391da177e4SLinus Torvalds int noise = 0; 440e631ddbaSFerenc Havasi 441e631ddbaSFerenc Havasi 4422f82ce1eSAndrew Victor #ifdef CONFIG_JFFS2_FS_WRITEBUFFER 4431da177e4SLinus Torvalds int cleanmarkerfound = 0; 4441da177e4SLinus Torvalds #endif 4451da177e4SLinus Torvalds 4461da177e4SLinus Torvalds ofs = jeb->offset; 4471da177e4SLinus Torvalds prevofs = jeb->offset - 1; 4481da177e4SLinus Torvalds 4491da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_scan_eraseblock(): Scanning block at 0x%x\n", ofs)); 4501da177e4SLinus Torvalds 4512f82ce1eSAndrew Victor #ifdef CONFIG_JFFS2_FS_WRITEBUFFER 4521da177e4SLinus Torvalds if (jffs2_cleanmarker_oob(c)) { 4531da177e4SLinus Torvalds int ret = jffs2_check_nand_cleanmarker(c, jeb); 4541da177e4SLinus Torvalds D2(printk(KERN_NOTICE "jffs_check_nand_cleanmarker returned %d\n",ret)); 4551da177e4SLinus Torvalds /* Even if it's not found, we still scan to see 4561da177e4SLinus Torvalds if the block is empty. We use this information 4571da177e4SLinus Torvalds to decide whether to erase it or not. */ 4581da177e4SLinus Torvalds switch (ret) { 4591da177e4SLinus Torvalds case 0: cleanmarkerfound = 1; break; 4601da177e4SLinus Torvalds case 1: break; 4611da177e4SLinus Torvalds case 2: return BLK_STATE_BADBLOCK; 4621da177e4SLinus Torvalds case 3: return BLK_STATE_ALLDIRTY; /* Block has failed to erase min. once */ 4631da177e4SLinus Torvalds default: return ret; 4641da177e4SLinus Torvalds } 4651da177e4SLinus Torvalds } 4661da177e4SLinus Torvalds #endif 467e631ddbaSFerenc Havasi 468e631ddbaSFerenc Havasi if (jffs2_sum_active()) { 4699641b784SDavid Woodhouse struct jffs2_sum_marker *sm; 4709641b784SDavid Woodhouse void *sumptr = NULL; 4719641b784SDavid Woodhouse uint32_t sumlen; 472e631ddbaSFerenc Havasi 4739641b784SDavid Woodhouse if (!buf_size) { 4749641b784SDavid Woodhouse /* XIP case. Just look, point at the summary if it's there */ 47513ba42dfSDavid Woodhouse sm = (void *)buf + c->sector_size - sizeof(*sm); 476e631ddbaSFerenc Havasi if (je32_to_cpu(sm->magic) == JFFS2_SUM_MAGIC) { 4779641b784SDavid Woodhouse sumptr = buf + je32_to_cpu(sm->offset); 4789641b784SDavid Woodhouse sumlen = c->sector_size - je32_to_cpu(sm->offset); 4799641b784SDavid Woodhouse } 4809641b784SDavid Woodhouse } else { 4819641b784SDavid Woodhouse /* If NAND flash, read a whole page of it. Else just the end */ 4829641b784SDavid Woodhouse if (c->wbuf_pagesize) 4839641b784SDavid Woodhouse buf_len = c->wbuf_pagesize; 4849641b784SDavid Woodhouse else 4859641b784SDavid Woodhouse buf_len = sizeof(*sm); 4869641b784SDavid Woodhouse 4879641b784SDavid Woodhouse /* Read as much as we want into the _end_ of the preallocated buffer */ 4889641b784SDavid Woodhouse err = jffs2_fill_scan_buf(c, buf + buf_size - buf_len, 4899641b784SDavid Woodhouse jeb->offset + c->sector_size - buf_len, 4909641b784SDavid Woodhouse buf_len); 4919641b784SDavid Woodhouse if (err) 4929641b784SDavid Woodhouse return err; 4939641b784SDavid Woodhouse 4949641b784SDavid Woodhouse sm = (void *)buf + buf_size - sizeof(*sm); 4959641b784SDavid Woodhouse if (je32_to_cpu(sm->magic) == JFFS2_SUM_MAGIC) { 4969641b784SDavid Woodhouse sumlen = c->sector_size - je32_to_cpu(sm->offset); 4979641b784SDavid Woodhouse sumptr = buf + buf_size - sumlen; 4989641b784SDavid Woodhouse 4999641b784SDavid Woodhouse /* Now, make sure the summary itself is available */ 5009641b784SDavid Woodhouse if (sumlen > buf_size) { 5019641b784SDavid Woodhouse /* Need to kmalloc for this. */ 5029641b784SDavid Woodhouse sumptr = kmalloc(sumlen, GFP_KERNEL); 5039641b784SDavid Woodhouse if (!sumptr) 5049641b784SDavid Woodhouse return -ENOMEM; 5059641b784SDavid Woodhouse memcpy(sumptr + sumlen - buf_len, buf + buf_size - buf_len, buf_len); 5069641b784SDavid Woodhouse } 5079641b784SDavid Woodhouse if (buf_len < sumlen) { 5089641b784SDavid Woodhouse /* Need to read more so that the entire summary node is present */ 5099641b784SDavid Woodhouse err = jffs2_fill_scan_buf(c, sumptr, 5109641b784SDavid Woodhouse jeb->offset + c->sector_size - sumlen, 5119641b784SDavid Woodhouse sumlen - buf_len); 5129641b784SDavid Woodhouse if (err) 513e631ddbaSFerenc Havasi return err; 514e631ddbaSFerenc Havasi } 515e631ddbaSFerenc Havasi } 516e631ddbaSFerenc Havasi 5179641b784SDavid Woodhouse } 5189641b784SDavid Woodhouse 5199641b784SDavid Woodhouse if (sumptr) { 5209641b784SDavid Woodhouse err = jffs2_sum_scan_sumnode(c, jeb, sumptr, sumlen, &pseudo_random); 5213560160aSDavid Woodhouse 5229641b784SDavid Woodhouse if (buf_size && sumlen > buf_size) 5239641b784SDavid Woodhouse kfree(sumptr); 5243560160aSDavid Woodhouse /* If it returns with a real error, bail. 5253560160aSDavid Woodhouse If it returns positive, that's a block classification 5263560160aSDavid Woodhouse (i.e. BLK_STATE_xxx) so return that too. 5273560160aSDavid Woodhouse If it returns zero, fall through to full scan. */ 5283560160aSDavid Woodhouse if (err) 5293560160aSDavid Woodhouse return err; 5309641b784SDavid Woodhouse } 531e631ddbaSFerenc Havasi } 532e631ddbaSFerenc Havasi 5331da177e4SLinus Torvalds buf_ofs = jeb->offset; 5341da177e4SLinus Torvalds 5351da177e4SLinus Torvalds if (!buf_size) { 5369641b784SDavid Woodhouse /* This is the XIP case -- we're reading _directly_ from the flash chip */ 5371da177e4SLinus Torvalds buf_len = c->sector_size; 5381da177e4SLinus Torvalds } else { 5393be36675SAndrew Victor buf_len = EMPTY_SCAN_SIZE(c->sector_size); 5401da177e4SLinus Torvalds err = jffs2_fill_scan_buf(c, buf, buf_ofs, buf_len); 5411da177e4SLinus Torvalds if (err) 5421da177e4SLinus Torvalds return err; 5431da177e4SLinus Torvalds } 5441da177e4SLinus Torvalds 5451da177e4SLinus Torvalds /* We temporarily use 'ofs' as a pointer into the buffer/jeb */ 5461da177e4SLinus Torvalds ofs = 0; 5471da177e4SLinus Torvalds 5481da177e4SLinus Torvalds /* Scan only 4KiB of 0xFF before declaring it's empty */ 5493be36675SAndrew Victor while(ofs < EMPTY_SCAN_SIZE(c->sector_size) && *(uint32_t *)(&buf[ofs]) == 0xFFFFFFFF) 5501da177e4SLinus Torvalds ofs += 4; 5511da177e4SLinus Torvalds 5523be36675SAndrew Victor if (ofs == EMPTY_SCAN_SIZE(c->sector_size)) { 5532f82ce1eSAndrew Victor #ifdef CONFIG_JFFS2_FS_WRITEBUFFER 5541da177e4SLinus Torvalds if (jffs2_cleanmarker_oob(c)) { 5551da177e4SLinus Torvalds /* scan oob, take care of cleanmarker */ 5561da177e4SLinus Torvalds int ret = jffs2_check_oob_empty(c, jeb, cleanmarkerfound); 5571da177e4SLinus Torvalds D2(printk(KERN_NOTICE "jffs2_check_oob_empty returned %d\n",ret)); 5581da177e4SLinus Torvalds switch (ret) { 5591da177e4SLinus Torvalds case 0: return cleanmarkerfound ? BLK_STATE_CLEANMARKER : BLK_STATE_ALLFF; 5601da177e4SLinus Torvalds case 1: return BLK_STATE_ALLDIRTY; 5611da177e4SLinus Torvalds default: return ret; 5621da177e4SLinus Torvalds } 5631da177e4SLinus Torvalds } 5641da177e4SLinus Torvalds #endif 5651da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Block at 0x%08x is empty (erased)\n", jeb->offset)); 5668f15fd55SAndrew Victor if (c->cleanmarker_size == 0) 5678f15fd55SAndrew Victor return BLK_STATE_CLEANMARKER; /* don't bother with re-erase */ 5688f15fd55SAndrew Victor else 5691da177e4SLinus Torvalds return BLK_STATE_ALLFF; /* OK to erase if all blocks are like this */ 5701da177e4SLinus Torvalds } 5711da177e4SLinus Torvalds if (ofs) { 5721da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Free space at %08x ends at %08x\n", jeb->offset, 5731da177e4SLinus Torvalds jeb->offset + ofs)); 574a6a8bef7SDavid Woodhouse if ((err = jffs2_prealloc_raw_node_refs(c, jeb, 1))) 575a6a8bef7SDavid Woodhouse return err; 57668270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, ofs))) 57768270995SDavid Woodhouse return err; 5781da177e4SLinus Torvalds } 5791da177e4SLinus Torvalds 5801da177e4SLinus Torvalds /* Now ofs is a complete physical flash offset as it always was... */ 5811da177e4SLinus Torvalds ofs += jeb->offset; 5821da177e4SLinus Torvalds 5831da177e4SLinus Torvalds noise = 10; 5841da177e4SLinus Torvalds 585733802d9SArtem B. Bityutskiy dbg_summary("no summary found in jeb 0x%08x. Apply original scan.\n",jeb->offset); 586e631ddbaSFerenc Havasi 5871da177e4SLinus Torvalds scan_more: 5881da177e4SLinus Torvalds while(ofs < jeb->offset + c->sector_size) { 5891da177e4SLinus Torvalds 590e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_paranoia_check_nolock(c, jeb); 5911da177e4SLinus Torvalds 5922f785402SDavid Woodhouse /* Make sure there are node refs available for use */ 593046b8b98SDavid Woodhouse err = jffs2_prealloc_raw_node_refs(c, jeb, 2); 5942f785402SDavid Woodhouse if (err) 5952f785402SDavid Woodhouse return err; 5962f785402SDavid Woodhouse 5971da177e4SLinus Torvalds cond_resched(); 5981da177e4SLinus Torvalds 5991da177e4SLinus Torvalds if (ofs & 3) { 6001da177e4SLinus Torvalds printk(KERN_WARNING "Eep. ofs 0x%08x not word-aligned!\n", ofs); 6011da177e4SLinus Torvalds ofs = PAD(ofs); 6021da177e4SLinus Torvalds continue; 6031da177e4SLinus Torvalds } 6041da177e4SLinus Torvalds if (ofs == prevofs) { 6051da177e4SLinus Torvalds printk(KERN_WARNING "ofs 0x%08x has already been seen. Skipping\n", ofs); 60668270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, 4))) 60768270995SDavid Woodhouse return err; 6081da177e4SLinus Torvalds ofs += 4; 6091da177e4SLinus Torvalds continue; 6101da177e4SLinus Torvalds } 6111da177e4SLinus Torvalds prevofs = ofs; 6121da177e4SLinus Torvalds 6131da177e4SLinus Torvalds if (jeb->offset + c->sector_size < ofs + sizeof(*node)) { 6141da177e4SLinus 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), 6151da177e4SLinus Torvalds jeb->offset, c->sector_size, ofs, sizeof(*node))); 61668270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, (jeb->offset + c->sector_size)-ofs))) 61768270995SDavid Woodhouse return err; 6181da177e4SLinus Torvalds break; 6191da177e4SLinus Torvalds } 6201da177e4SLinus Torvalds 6211da177e4SLinus Torvalds if (buf_ofs + buf_len < ofs + sizeof(*node)) { 6221da177e4SLinus Torvalds buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); 6231da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Fewer than %zd bytes (node header) left to end of buf. Reading 0x%x at 0x%08x\n", 6241da177e4SLinus Torvalds sizeof(struct jffs2_unknown_node), buf_len, ofs)); 6251da177e4SLinus Torvalds err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); 6261da177e4SLinus Torvalds if (err) 6271da177e4SLinus Torvalds return err; 6281da177e4SLinus Torvalds buf_ofs = ofs; 6291da177e4SLinus Torvalds } 6301da177e4SLinus Torvalds 6311da177e4SLinus Torvalds node = (struct jffs2_unknown_node *)&buf[ofs-buf_ofs]; 6321da177e4SLinus Torvalds 6331da177e4SLinus Torvalds if (*(uint32_t *)(&buf[ofs-buf_ofs]) == 0xffffffff) { 6341da177e4SLinus Torvalds uint32_t inbuf_ofs; 6351da177e4SLinus Torvalds uint32_t empty_start; 6361da177e4SLinus Torvalds 6371da177e4SLinus Torvalds empty_start = ofs; 6381da177e4SLinus Torvalds ofs += 4; 6391da177e4SLinus Torvalds 6401da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Found empty flash at 0x%08x\n", ofs)); 6411da177e4SLinus Torvalds more_empty: 6421da177e4SLinus Torvalds inbuf_ofs = ofs - buf_ofs; 6431da177e4SLinus Torvalds while (inbuf_ofs < buf_len) { 6441da177e4SLinus Torvalds if (*(uint32_t *)(&buf[inbuf_ofs]) != 0xffffffff) { 6451da177e4SLinus Torvalds printk(KERN_WARNING "Empty flash at 0x%08x ends at 0x%08x\n", 6461da177e4SLinus Torvalds empty_start, ofs); 64768270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, ofs-empty_start))) 64868270995SDavid Woodhouse return err; 6491da177e4SLinus Torvalds goto scan_more; 6501da177e4SLinus Torvalds } 6511da177e4SLinus Torvalds 6521da177e4SLinus Torvalds inbuf_ofs+=4; 6531da177e4SLinus Torvalds ofs += 4; 6541da177e4SLinus Torvalds } 6551da177e4SLinus Torvalds /* Ran off end. */ 6561da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Empty flash to end of buffer at 0x%08x\n", ofs)); 6571da177e4SLinus Torvalds 6581da177e4SLinus Torvalds /* If we're only checking the beginning of a block with a cleanmarker, 6591da177e4SLinus Torvalds bail now */ 6601da177e4SLinus Torvalds if (buf_ofs == jeb->offset && jeb->used_size == PAD(c->cleanmarker_size) && 66199988f7bSDavid Woodhouse c->cleanmarker_size && !jeb->dirty_size && !ref_next(jeb->first_node)) { 6623be36675SAndrew Victor D1(printk(KERN_DEBUG "%d bytes at start of block seems clean... assuming all clean\n", EMPTY_SCAN_SIZE(c->sector_size))); 6631da177e4SLinus Torvalds return BLK_STATE_CLEANMARKER; 6641da177e4SLinus Torvalds } 6651da177e4SLinus Torvalds 6661da177e4SLinus Torvalds /* See how much more there is to read in this eraseblock... */ 6671da177e4SLinus Torvalds buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); 6681da177e4SLinus Torvalds if (!buf_len) { 6691da177e4SLinus Torvalds /* No more to read. Break out of main loop without marking 6701da177e4SLinus Torvalds this range of empty space as dirty (because it's not) */ 6711da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Empty flash at %08x runs to end of block. Treating as free_space\n", 6721da177e4SLinus Torvalds empty_start)); 6731da177e4SLinus Torvalds break; 6741da177e4SLinus Torvalds } 6751da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Reading another 0x%x at 0x%08x\n", buf_len, ofs)); 6761da177e4SLinus Torvalds err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); 6771da177e4SLinus Torvalds if (err) 6781da177e4SLinus Torvalds return err; 6791da177e4SLinus Torvalds buf_ofs = ofs; 6801da177e4SLinus Torvalds goto more_empty; 6811da177e4SLinus Torvalds } 6821da177e4SLinus Torvalds 6831da177e4SLinus Torvalds if (ofs == jeb->offset && je16_to_cpu(node->magic) == KSAMTIB_CIGAM_2SFFJ) { 6841da177e4SLinus Torvalds printk(KERN_WARNING "Magic bitmask is backwards at offset 0x%08x. Wrong endian filesystem?\n", ofs); 68568270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, 4))) 68668270995SDavid Woodhouse return err; 6871da177e4SLinus Torvalds ofs += 4; 6881da177e4SLinus Torvalds continue; 6891da177e4SLinus Torvalds } 6901da177e4SLinus Torvalds if (je16_to_cpu(node->magic) == JFFS2_DIRTY_BITMASK) { 6911da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Dirty bitmask at 0x%08x\n", ofs)); 69268270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, 4))) 69368270995SDavid Woodhouse return err; 6941da177e4SLinus Torvalds ofs += 4; 6951da177e4SLinus Torvalds continue; 6961da177e4SLinus Torvalds } 6971da177e4SLinus Torvalds if (je16_to_cpu(node->magic) == JFFS2_OLD_MAGIC_BITMASK) { 6981da177e4SLinus Torvalds printk(KERN_WARNING "Old JFFS2 bitmask found at 0x%08x\n", ofs); 6991da177e4SLinus Torvalds printk(KERN_WARNING "You cannot use older JFFS2 filesystems with newer kernels\n"); 70068270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, 4))) 70168270995SDavid Woodhouse return err; 7021da177e4SLinus Torvalds ofs += 4; 7031da177e4SLinus Torvalds continue; 7041da177e4SLinus Torvalds } 7051da177e4SLinus Torvalds if (je16_to_cpu(node->magic) != JFFS2_MAGIC_BITMASK) { 7061da177e4SLinus Torvalds /* OK. We're out of possibilities. Whinge and move on */ 7071da177e4SLinus Torvalds noisy_printk(&noise, "jffs2_scan_eraseblock(): Magic bitmask 0x%04x not found at 0x%08x: 0x%04x instead\n", 7081da177e4SLinus Torvalds JFFS2_MAGIC_BITMASK, ofs, 7091da177e4SLinus Torvalds je16_to_cpu(node->magic)); 71068270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, 4))) 71168270995SDavid Woodhouse return err; 7121da177e4SLinus Torvalds ofs += 4; 7131da177e4SLinus Torvalds continue; 7141da177e4SLinus Torvalds } 7151da177e4SLinus Torvalds /* We seem to have a node of sorts. Check the CRC */ 7161da177e4SLinus Torvalds crcnode.magic = node->magic; 7171da177e4SLinus Torvalds crcnode.nodetype = cpu_to_je16( je16_to_cpu(node->nodetype) | JFFS2_NODE_ACCURATE); 7181da177e4SLinus Torvalds crcnode.totlen = node->totlen; 7191da177e4SLinus Torvalds hdr_crc = crc32(0, &crcnode, sizeof(crcnode)-4); 7201da177e4SLinus Torvalds 7211da177e4SLinus Torvalds if (hdr_crc != je32_to_cpu(node->hdr_crc)) { 7221da177e4SLinus 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", 7231da177e4SLinus Torvalds ofs, je16_to_cpu(node->magic), 7241da177e4SLinus Torvalds je16_to_cpu(node->nodetype), 7251da177e4SLinus Torvalds je32_to_cpu(node->totlen), 7261da177e4SLinus Torvalds je32_to_cpu(node->hdr_crc), 7271da177e4SLinus Torvalds hdr_crc); 72868270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, 4))) 72968270995SDavid Woodhouse return err; 7301da177e4SLinus Torvalds ofs += 4; 7311da177e4SLinus Torvalds continue; 7321da177e4SLinus Torvalds } 7331da177e4SLinus Torvalds 7341da177e4SLinus Torvalds if (ofs + je32_to_cpu(node->totlen) > 7351da177e4SLinus Torvalds jeb->offset + c->sector_size) { 7361da177e4SLinus Torvalds /* Eep. Node goes over the end of the erase block. */ 7371da177e4SLinus Torvalds printk(KERN_WARNING "Node at 0x%08x with length 0x%08x would run over the end of the erase block\n", 7381da177e4SLinus Torvalds ofs, je32_to_cpu(node->totlen)); 7391da177e4SLinus Torvalds printk(KERN_WARNING "Perhaps the file system was created with the wrong erase size?\n"); 74068270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, 4))) 74168270995SDavid Woodhouse return err; 7421da177e4SLinus Torvalds ofs += 4; 7431da177e4SLinus Torvalds continue; 7441da177e4SLinus Torvalds } 7451da177e4SLinus Torvalds 7461da177e4SLinus Torvalds if (!(je16_to_cpu(node->nodetype) & JFFS2_NODE_ACCURATE)) { 7471da177e4SLinus Torvalds /* Wheee. This is an obsoleted node */ 7481da177e4SLinus Torvalds D2(printk(KERN_DEBUG "Node at 0x%08x is obsolete. Skipping\n", ofs)); 74968270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(node->totlen))))) 75068270995SDavid Woodhouse return err; 7511da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 7521da177e4SLinus Torvalds continue; 7531da177e4SLinus Torvalds } 7541da177e4SLinus Torvalds 7551da177e4SLinus Torvalds switch(je16_to_cpu(node->nodetype)) { 7561da177e4SLinus Torvalds case JFFS2_NODETYPE_INODE: 7571da177e4SLinus Torvalds if (buf_ofs + buf_len < ofs + sizeof(struct jffs2_raw_inode)) { 7581da177e4SLinus Torvalds buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); 7591da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Fewer than %zd bytes (inode node) left to end of buf. Reading 0x%x at 0x%08x\n", 7601da177e4SLinus Torvalds sizeof(struct jffs2_raw_inode), buf_len, ofs)); 7611da177e4SLinus Torvalds err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); 7621da177e4SLinus Torvalds if (err) 7631da177e4SLinus Torvalds return err; 7641da177e4SLinus Torvalds buf_ofs = ofs; 7651da177e4SLinus Torvalds node = (void *)buf; 7661da177e4SLinus Torvalds } 767e631ddbaSFerenc Havasi err = jffs2_scan_inode_node(c, jeb, (void *)node, ofs, s); 7681da177e4SLinus Torvalds if (err) return err; 7691da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 7701da177e4SLinus Torvalds break; 7711da177e4SLinus Torvalds 7721da177e4SLinus Torvalds case JFFS2_NODETYPE_DIRENT: 7731da177e4SLinus Torvalds if (buf_ofs + buf_len < ofs + je32_to_cpu(node->totlen)) { 7741da177e4SLinus Torvalds buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); 7751da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Fewer than %d bytes (dirent node) left to end of buf. Reading 0x%x at 0x%08x\n", 7761da177e4SLinus Torvalds je32_to_cpu(node->totlen), buf_len, ofs)); 7771da177e4SLinus Torvalds err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); 7781da177e4SLinus Torvalds if (err) 7791da177e4SLinus Torvalds return err; 7801da177e4SLinus Torvalds buf_ofs = ofs; 7811da177e4SLinus Torvalds node = (void *)buf; 7821da177e4SLinus Torvalds } 783e631ddbaSFerenc Havasi err = jffs2_scan_dirent_node(c, jeb, (void *)node, ofs, s); 7841da177e4SLinus Torvalds if (err) return err; 7851da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 7861da177e4SLinus Torvalds break; 7871da177e4SLinus Torvalds 788aa98d7cfSKaiGai Kohei #ifdef CONFIG_JFFS2_FS_XATTR 789aa98d7cfSKaiGai Kohei case JFFS2_NODETYPE_XATTR: 790aa98d7cfSKaiGai Kohei if (buf_ofs + buf_len < ofs + je32_to_cpu(node->totlen)) { 791aa98d7cfSKaiGai Kohei buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); 792aa98d7cfSKaiGai Kohei D1(printk(KERN_DEBUG "Fewer than %d bytes (xattr node)" 793aa98d7cfSKaiGai Kohei " left to end of buf. Reading 0x%x at 0x%08x\n", 794aa98d7cfSKaiGai Kohei je32_to_cpu(node->totlen), buf_len, ofs)); 795aa98d7cfSKaiGai Kohei err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); 796aa98d7cfSKaiGai Kohei if (err) 797aa98d7cfSKaiGai Kohei return err; 798aa98d7cfSKaiGai Kohei buf_ofs = ofs; 799aa98d7cfSKaiGai Kohei node = (void *)buf; 800aa98d7cfSKaiGai Kohei } 801aa98d7cfSKaiGai Kohei err = jffs2_scan_xattr_node(c, jeb, (void *)node, ofs, s); 802aa98d7cfSKaiGai Kohei if (err) 803aa98d7cfSKaiGai Kohei return err; 804aa98d7cfSKaiGai Kohei ofs += PAD(je32_to_cpu(node->totlen)); 805aa98d7cfSKaiGai Kohei break; 806aa98d7cfSKaiGai Kohei case JFFS2_NODETYPE_XREF: 807aa98d7cfSKaiGai Kohei if (buf_ofs + buf_len < ofs + je32_to_cpu(node->totlen)) { 808aa98d7cfSKaiGai Kohei buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); 809aa98d7cfSKaiGai Kohei D1(printk(KERN_DEBUG "Fewer than %d bytes (xref node)" 810aa98d7cfSKaiGai Kohei " left to end of buf. Reading 0x%x at 0x%08x\n", 811aa98d7cfSKaiGai Kohei je32_to_cpu(node->totlen), buf_len, ofs)); 812aa98d7cfSKaiGai Kohei err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); 813aa98d7cfSKaiGai Kohei if (err) 814aa98d7cfSKaiGai Kohei return err; 815aa98d7cfSKaiGai Kohei buf_ofs = ofs; 816aa98d7cfSKaiGai Kohei node = (void *)buf; 817aa98d7cfSKaiGai Kohei } 818aa98d7cfSKaiGai Kohei err = jffs2_scan_xref_node(c, jeb, (void *)node, ofs, s); 819aa98d7cfSKaiGai Kohei if (err) 820aa98d7cfSKaiGai Kohei return err; 821aa98d7cfSKaiGai Kohei ofs += PAD(je32_to_cpu(node->totlen)); 822aa98d7cfSKaiGai Kohei break; 823aa98d7cfSKaiGai Kohei #endif /* CONFIG_JFFS2_FS_XATTR */ 824aa98d7cfSKaiGai Kohei 8251da177e4SLinus Torvalds case JFFS2_NODETYPE_CLEANMARKER: 8261da177e4SLinus Torvalds D1(printk(KERN_DEBUG "CLEANMARKER node found at 0x%08x\n", ofs)); 8271da177e4SLinus Torvalds if (je32_to_cpu(node->totlen) != c->cleanmarker_size) { 8281da177e4SLinus Torvalds printk(KERN_NOTICE "CLEANMARKER node found at 0x%08x has totlen 0x%x != normal 0x%x\n", 8291da177e4SLinus Torvalds ofs, je32_to_cpu(node->totlen), c->cleanmarker_size); 83068270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, PAD(sizeof(struct jffs2_unknown_node))))) 83168270995SDavid Woodhouse return err; 8321da177e4SLinus Torvalds ofs += PAD(sizeof(struct jffs2_unknown_node)); 8331da177e4SLinus Torvalds } else if (jeb->first_node) { 8341da177e4SLinus Torvalds printk(KERN_NOTICE "CLEANMARKER node found at 0x%08x, not first node in block (0x%08x)\n", ofs, jeb->offset); 83568270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, PAD(sizeof(struct jffs2_unknown_node))))) 83668270995SDavid Woodhouse return err; 8371da177e4SLinus Torvalds ofs += PAD(sizeof(struct jffs2_unknown_node)); 8381da177e4SLinus Torvalds } else { 8392f785402SDavid Woodhouse jffs2_link_node_ref(c, jeb, ofs | REF_NORMAL, c->cleanmarker_size, NULL); 840f1f9671bSDavid Woodhouse 8411da177e4SLinus Torvalds ofs += PAD(c->cleanmarker_size); 8421da177e4SLinus Torvalds } 8431da177e4SLinus Torvalds break; 8441da177e4SLinus Torvalds 8451da177e4SLinus Torvalds case JFFS2_NODETYPE_PADDING: 846e631ddbaSFerenc Havasi if (jffs2_sum_active()) 847e631ddbaSFerenc Havasi jffs2_sum_add_padding_mem(s, je32_to_cpu(node->totlen)); 84868270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(node->totlen))))) 84968270995SDavid Woodhouse return err; 8501da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 8511da177e4SLinus Torvalds break; 8521da177e4SLinus Torvalds 8531da177e4SLinus Torvalds default: 8541da177e4SLinus Torvalds switch (je16_to_cpu(node->nodetype) & JFFS2_COMPAT_MASK) { 8551da177e4SLinus Torvalds case JFFS2_FEATURE_ROCOMPAT: 8561da177e4SLinus Torvalds printk(KERN_NOTICE "Read-only compatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs); 8571da177e4SLinus Torvalds c->flags |= JFFS2_SB_FLAG_RO; 8581da177e4SLinus Torvalds if (!(jffs2_is_readonly(c))) 8591da177e4SLinus Torvalds return -EROFS; 86068270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(node->totlen))))) 86168270995SDavid Woodhouse return err; 8621da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 8631da177e4SLinus Torvalds break; 8641da177e4SLinus Torvalds 8651da177e4SLinus Torvalds case JFFS2_FEATURE_INCOMPAT: 8661da177e4SLinus Torvalds printk(KERN_NOTICE "Incompatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs); 8671da177e4SLinus Torvalds return -EINVAL; 8681da177e4SLinus Torvalds 8691da177e4SLinus Torvalds case JFFS2_FEATURE_RWCOMPAT_DELETE: 8701da177e4SLinus Torvalds D1(printk(KERN_NOTICE "Unknown but compatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs)); 87168270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(node->totlen))))) 87268270995SDavid Woodhouse return err; 8731da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 8741da177e4SLinus Torvalds break; 8751da177e4SLinus Torvalds 8766171586aSDavid Woodhouse case JFFS2_FEATURE_RWCOMPAT_COPY: { 8771da177e4SLinus Torvalds D1(printk(KERN_NOTICE "Unknown but compatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs)); 8786171586aSDavid Woodhouse 8792f785402SDavid Woodhouse jffs2_link_node_ref(c, jeb, ofs | REF_PRISTINE, PAD(je32_to_cpu(node->totlen)), NULL); 8806171586aSDavid Woodhouse 8816171586aSDavid Woodhouse /* We can't summarise nodes we don't grok */ 8826171586aSDavid Woodhouse jffs2_sum_disable_collecting(s); 8831da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 8841da177e4SLinus Torvalds break; 8851da177e4SLinus Torvalds } 8861da177e4SLinus Torvalds } 8871da177e4SLinus Torvalds } 8886171586aSDavid Woodhouse } 8891da177e4SLinus Torvalds 890e631ddbaSFerenc Havasi if (jffs2_sum_active()) { 891e631ddbaSFerenc Havasi if (PAD(s->sum_size + JFFS2_SUMMARY_FRAME_SIZE) > jeb->free_size) { 892733802d9SArtem B. Bityutskiy dbg_summary("There is not enough space for " 893e631ddbaSFerenc Havasi "summary information, disabling for this jeb!\n"); 894e631ddbaSFerenc Havasi jffs2_sum_disable_collecting(s); 895e631ddbaSFerenc Havasi } 896e631ddbaSFerenc Havasi } 8971da177e4SLinus Torvalds 8988b9e9fe8SDavid Woodhouse D1(printk(KERN_DEBUG "Block at 0x%08x: free 0x%08x, dirty 0x%08x, unchecked 0x%08x, used 0x%08x, wasted 0x%08x\n", 8998b9e9fe8SDavid Woodhouse jeb->offset,jeb->free_size, jeb->dirty_size, jeb->unchecked_size, jeb->used_size, jeb->wasted_size)); 9001da177e4SLinus Torvalds 9011da177e4SLinus Torvalds /* mark_node_obsolete can add to wasted !! */ 9021da177e4SLinus Torvalds if (jeb->wasted_size) { 9031da177e4SLinus Torvalds jeb->dirty_size += jeb->wasted_size; 9041da177e4SLinus Torvalds c->dirty_size += jeb->wasted_size; 9051da177e4SLinus Torvalds c->wasted_size -= jeb->wasted_size; 9061da177e4SLinus Torvalds jeb->wasted_size = 0; 9071da177e4SLinus Torvalds } 9081da177e4SLinus Torvalds 909e631ddbaSFerenc Havasi return jffs2_scan_classify_jeb(c, jeb); 9101da177e4SLinus Torvalds } 9111da177e4SLinus Torvalds 912e631ddbaSFerenc Havasi struct jffs2_inode_cache *jffs2_scan_make_ino_cache(struct jffs2_sb_info *c, uint32_t ino) 9131da177e4SLinus Torvalds { 9141da177e4SLinus Torvalds struct jffs2_inode_cache *ic; 9151da177e4SLinus Torvalds 9161da177e4SLinus Torvalds ic = jffs2_get_ino_cache(c, ino); 9171da177e4SLinus Torvalds if (ic) 9181da177e4SLinus Torvalds return ic; 9191da177e4SLinus Torvalds 9201da177e4SLinus Torvalds if (ino > c->highest_ino) 9211da177e4SLinus Torvalds c->highest_ino = ino; 9221da177e4SLinus Torvalds 9231da177e4SLinus Torvalds ic = jffs2_alloc_inode_cache(); 9241da177e4SLinus Torvalds if (!ic) { 9251da177e4SLinus Torvalds printk(KERN_NOTICE "jffs2_scan_make_inode_cache(): allocation of inode cache failed\n"); 9261da177e4SLinus Torvalds return NULL; 9271da177e4SLinus Torvalds } 9281da177e4SLinus Torvalds memset(ic, 0, sizeof(*ic)); 9291da177e4SLinus Torvalds 9301da177e4SLinus Torvalds ic->ino = ino; 9311da177e4SLinus Torvalds ic->nodes = (void *)ic; 9321da177e4SLinus Torvalds jffs2_add_ino_cache(c, ic); 9331da177e4SLinus Torvalds if (ino == 1) 9341da177e4SLinus Torvalds ic->nlink = 1; 9351da177e4SLinus Torvalds return ic; 9361da177e4SLinus Torvalds } 9371da177e4SLinus Torvalds 9381da177e4SLinus Torvalds static int jffs2_scan_inode_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 939e631ddbaSFerenc Havasi struct jffs2_raw_inode *ri, uint32_t ofs, struct jffs2_summary *s) 9401da177e4SLinus Torvalds { 9411da177e4SLinus Torvalds struct jffs2_inode_cache *ic; 9421da177e4SLinus Torvalds uint32_t ino = je32_to_cpu(ri->ino); 94368270995SDavid Woodhouse int err; 9441da177e4SLinus Torvalds 9451da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_scan_inode_node(): Node at 0x%08x\n", ofs)); 9461da177e4SLinus Torvalds 9471da177e4SLinus Torvalds /* We do very little here now. Just check the ino# to which we should attribute 9481da177e4SLinus Torvalds this node; we can do all the CRC checking etc. later. There's a tradeoff here -- 9491da177e4SLinus Torvalds we used to scan the flash once only, reading everything we want from it into 9501da177e4SLinus Torvalds memory, then building all our in-core data structures and freeing the extra 9511da177e4SLinus Torvalds information. Now we allow the first part of the mount to complete a lot quicker, 9521da177e4SLinus Torvalds but we have to go _back_ to the flash in order to finish the CRC checking, etc. 9531da177e4SLinus Torvalds Which means that the _full_ amount of time to get to proper write mode with GC 9541da177e4SLinus Torvalds operational may actually be _longer_ than before. Sucks to be me. */ 9551da177e4SLinus Torvalds 9561da177e4SLinus Torvalds ic = jffs2_get_ino_cache(c, ino); 9571da177e4SLinus Torvalds if (!ic) { 9581da177e4SLinus Torvalds /* Inocache get failed. Either we read a bogus ino# or it's just genuinely the 9591da177e4SLinus Torvalds first node we found for this inode. Do a CRC check to protect against the former 9601da177e4SLinus Torvalds case */ 9611da177e4SLinus Torvalds uint32_t crc = crc32(0, ri, sizeof(*ri)-8); 9621da177e4SLinus Torvalds 9631da177e4SLinus Torvalds if (crc != je32_to_cpu(ri->node_crc)) { 9641da177e4SLinus Torvalds printk(KERN_NOTICE "jffs2_scan_inode_node(): CRC failed on node at 0x%08x: Read 0x%08x, calculated 0x%08x\n", 9651da177e4SLinus Torvalds ofs, je32_to_cpu(ri->node_crc), crc); 9661da177e4SLinus Torvalds /* We believe totlen because the CRC on the node _header_ was OK, just the node itself failed. */ 96768270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(ri->totlen))))) 96868270995SDavid Woodhouse return err; 9691da177e4SLinus Torvalds return 0; 9701da177e4SLinus Torvalds } 9711da177e4SLinus Torvalds ic = jffs2_scan_make_ino_cache(c, ino); 9722f785402SDavid Woodhouse if (!ic) 9731da177e4SLinus Torvalds return -ENOMEM; 9741da177e4SLinus Torvalds } 9751da177e4SLinus Torvalds 9761da177e4SLinus Torvalds /* Wheee. It worked */ 9772f785402SDavid Woodhouse jffs2_link_node_ref(c, jeb, ofs | REF_UNCHECKED, PAD(je32_to_cpu(ri->totlen)), ic); 9781da177e4SLinus Torvalds 9791da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Node is ino #%u, version %d. Range 0x%x-0x%x\n", 9801da177e4SLinus Torvalds je32_to_cpu(ri->ino), je32_to_cpu(ri->version), 9811da177e4SLinus Torvalds je32_to_cpu(ri->offset), 9821da177e4SLinus Torvalds je32_to_cpu(ri->offset)+je32_to_cpu(ri->dsize))); 9831da177e4SLinus Torvalds 9841da177e4SLinus Torvalds pseudo_random += je32_to_cpu(ri->version); 9851da177e4SLinus Torvalds 986e631ddbaSFerenc Havasi if (jffs2_sum_active()) { 987e631ddbaSFerenc Havasi jffs2_sum_add_inode_mem(s, ri, ofs - jeb->offset); 988e631ddbaSFerenc Havasi } 989e631ddbaSFerenc Havasi 9901da177e4SLinus Torvalds return 0; 9911da177e4SLinus Torvalds } 9921da177e4SLinus Torvalds 9931da177e4SLinus Torvalds static int jffs2_scan_dirent_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 994e631ddbaSFerenc Havasi struct jffs2_raw_dirent *rd, uint32_t ofs, struct jffs2_summary *s) 9951da177e4SLinus Torvalds { 9961da177e4SLinus Torvalds struct jffs2_full_dirent *fd; 9971da177e4SLinus Torvalds struct jffs2_inode_cache *ic; 9981da177e4SLinus Torvalds uint32_t crc; 99968270995SDavid Woodhouse int err; 10001da177e4SLinus Torvalds 10011da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_scan_dirent_node(): Node at 0x%08x\n", ofs)); 10021da177e4SLinus Torvalds 10031da177e4SLinus Torvalds /* We don't get here unless the node is still valid, so we don't have to 10041da177e4SLinus Torvalds mask in the ACCURATE bit any more. */ 10051da177e4SLinus Torvalds crc = crc32(0, rd, sizeof(*rd)-8); 10061da177e4SLinus Torvalds 10071da177e4SLinus Torvalds if (crc != je32_to_cpu(rd->node_crc)) { 10081da177e4SLinus Torvalds printk(KERN_NOTICE "jffs2_scan_dirent_node(): Node CRC failed on node at 0x%08x: Read 0x%08x, calculated 0x%08x\n", 10091da177e4SLinus Torvalds ofs, je32_to_cpu(rd->node_crc), crc); 10101da177e4SLinus Torvalds /* We believe totlen because the CRC on the node _header_ was OK, just the node itself failed. */ 101168270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(rd->totlen))))) 101268270995SDavid Woodhouse return err; 10131da177e4SLinus Torvalds return 0; 10141da177e4SLinus Torvalds } 10151da177e4SLinus Torvalds 10161da177e4SLinus Torvalds pseudo_random += je32_to_cpu(rd->version); 10171da177e4SLinus Torvalds 10181da177e4SLinus Torvalds fd = jffs2_alloc_full_dirent(rd->nsize+1); 10191da177e4SLinus Torvalds if (!fd) { 10201da177e4SLinus Torvalds return -ENOMEM; 10211da177e4SLinus Torvalds } 10221da177e4SLinus Torvalds memcpy(&fd->name, rd->name, rd->nsize); 10231da177e4SLinus Torvalds fd->name[rd->nsize] = 0; 10241da177e4SLinus Torvalds 10251da177e4SLinus Torvalds crc = crc32(0, fd->name, rd->nsize); 10261da177e4SLinus Torvalds if (crc != je32_to_cpu(rd->name_crc)) { 10271da177e4SLinus Torvalds printk(KERN_NOTICE "jffs2_scan_dirent_node(): Name CRC failed on node at 0x%08x: Read 0x%08x, calculated 0x%08x\n", 10281da177e4SLinus Torvalds ofs, je32_to_cpu(rd->name_crc), crc); 10291da177e4SLinus Torvalds D1(printk(KERN_NOTICE "Name for which CRC failed is (now) '%s', ino #%d\n", fd->name, je32_to_cpu(rd->ino))); 10301da177e4SLinus Torvalds jffs2_free_full_dirent(fd); 10311da177e4SLinus Torvalds /* FIXME: Why do we believe totlen? */ 10321da177e4SLinus Torvalds /* We believe totlen because the CRC on the node _header_ was OK, just the name failed. */ 103368270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(rd->totlen))))) 103468270995SDavid Woodhouse return err; 10351da177e4SLinus Torvalds return 0; 10361da177e4SLinus Torvalds } 10371da177e4SLinus Torvalds ic = jffs2_scan_make_ino_cache(c, je32_to_cpu(rd->pino)); 10381da177e4SLinus Torvalds if (!ic) { 10391da177e4SLinus Torvalds jffs2_free_full_dirent(fd); 10401da177e4SLinus Torvalds return -ENOMEM; 10411da177e4SLinus Torvalds } 10421da177e4SLinus Torvalds 10432f785402SDavid Woodhouse fd->raw = jffs2_link_node_ref(c, jeb, ofs | REF_PRISTINE, PAD(je32_to_cpu(rd->totlen)), ic); 10441da177e4SLinus Torvalds 10451da177e4SLinus Torvalds fd->next = NULL; 10461da177e4SLinus Torvalds fd->version = je32_to_cpu(rd->version); 10471da177e4SLinus Torvalds fd->ino = je32_to_cpu(rd->ino); 10481da177e4SLinus Torvalds fd->nhash = full_name_hash(fd->name, rd->nsize); 10491da177e4SLinus Torvalds fd->type = rd->type; 10501da177e4SLinus Torvalds jffs2_add_fd_to_list(c, fd, &ic->scan_dents); 10511da177e4SLinus Torvalds 1052e631ddbaSFerenc Havasi if (jffs2_sum_active()) { 1053e631ddbaSFerenc Havasi jffs2_sum_add_dirent_mem(s, rd, ofs - jeb->offset); 1054e631ddbaSFerenc Havasi } 1055e631ddbaSFerenc Havasi 10561da177e4SLinus Torvalds return 0; 10571da177e4SLinus Torvalds } 10581da177e4SLinus Torvalds 10591da177e4SLinus Torvalds static int count_list(struct list_head *l) 10601da177e4SLinus Torvalds { 10611da177e4SLinus Torvalds uint32_t count = 0; 10621da177e4SLinus Torvalds struct list_head *tmp; 10631da177e4SLinus Torvalds 10641da177e4SLinus Torvalds list_for_each(tmp, l) { 10651da177e4SLinus Torvalds count++; 10661da177e4SLinus Torvalds } 10671da177e4SLinus Torvalds return count; 10681da177e4SLinus Torvalds } 10691da177e4SLinus Torvalds 10701da177e4SLinus Torvalds /* Note: This breaks if list_empty(head). I don't care. You 10711da177e4SLinus Torvalds might, if you copy this code and use it elsewhere :) */ 10721da177e4SLinus Torvalds static void rotate_list(struct list_head *head, uint32_t count) 10731da177e4SLinus Torvalds { 10741da177e4SLinus Torvalds struct list_head *n = head->next; 10751da177e4SLinus Torvalds 10761da177e4SLinus Torvalds list_del(head); 10771da177e4SLinus Torvalds while(count--) { 10781da177e4SLinus Torvalds n = n->next; 10791da177e4SLinus Torvalds } 10801da177e4SLinus Torvalds list_add(head, n); 10811da177e4SLinus Torvalds } 10821da177e4SLinus Torvalds 10831da177e4SLinus Torvalds void jffs2_rotate_lists(struct jffs2_sb_info *c) 10841da177e4SLinus Torvalds { 10851da177e4SLinus Torvalds uint32_t x; 10861da177e4SLinus Torvalds uint32_t rotateby; 10871da177e4SLinus Torvalds 10881da177e4SLinus Torvalds x = count_list(&c->clean_list); 10891da177e4SLinus Torvalds if (x) { 10901da177e4SLinus Torvalds rotateby = pseudo_random % x; 10911da177e4SLinus Torvalds rotate_list((&c->clean_list), rotateby); 10921da177e4SLinus Torvalds } 10931da177e4SLinus Torvalds 10941da177e4SLinus Torvalds x = count_list(&c->very_dirty_list); 10951da177e4SLinus Torvalds if (x) { 10961da177e4SLinus Torvalds rotateby = pseudo_random % x; 10971da177e4SLinus Torvalds rotate_list((&c->very_dirty_list), rotateby); 10981da177e4SLinus Torvalds } 10991da177e4SLinus Torvalds 11001da177e4SLinus Torvalds x = count_list(&c->dirty_list); 11011da177e4SLinus Torvalds if (x) { 11021da177e4SLinus Torvalds rotateby = pseudo_random % x; 11031da177e4SLinus Torvalds rotate_list((&c->dirty_list), rotateby); 11041da177e4SLinus Torvalds } 11051da177e4SLinus Torvalds 11061da177e4SLinus Torvalds x = count_list(&c->erasable_list); 11071da177e4SLinus Torvalds if (x) { 11081da177e4SLinus Torvalds rotateby = pseudo_random % x; 11091da177e4SLinus Torvalds rotate_list((&c->erasable_list), rotateby); 11101da177e4SLinus Torvalds } 11111da177e4SLinus Torvalds 11121da177e4SLinus Torvalds if (c->nr_erasing_blocks) { 11131da177e4SLinus Torvalds rotateby = pseudo_random % c->nr_erasing_blocks; 11141da177e4SLinus Torvalds rotate_list((&c->erase_pending_list), rotateby); 11151da177e4SLinus Torvalds } 11161da177e4SLinus Torvalds 11171da177e4SLinus Torvalds if (c->nr_free_blocks) { 11181da177e4SLinus Torvalds rotateby = pseudo_random % c->nr_free_blocks; 11191da177e4SLinus Torvalds rotate_list((&c->free_list), rotateby); 11201da177e4SLinus Torvalds } 11211da177e4SLinus Torvalds } 1122