11da177e4SLinus Torvalds /* 21da177e4SLinus Torvalds * JFFS2 -- Journalling Flash File System, Version 2. 31da177e4SLinus Torvalds * 4c00c310eSDavid Woodhouse * Copyright © 2001-2007 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 * 101da177e4SLinus Torvalds */ 11c00c310eSDavid Woodhouse 121da177e4SLinus Torvalds #include <linux/kernel.h> 131da177e4SLinus Torvalds #include <linux/sched.h> 141da177e4SLinus Torvalds #include <linux/slab.h> 151da177e4SLinus Torvalds #include <linux/mtd/mtd.h> 161da177e4SLinus Torvalds #include <linux/pagemap.h> 171da177e4SLinus Torvalds #include <linux/crc32.h> 181da177e4SLinus Torvalds #include <linux/compiler.h> 191da177e4SLinus Torvalds #include "nodelist.h" 20e631ddbaSFerenc Havasi #include "summary.h" 21e631ddbaSFerenc Havasi #include "debug.h" 221da177e4SLinus Torvalds 233be36675SAndrew Victor #define DEFAULT_EMPTY_SCAN_SIZE 1024 241da177e4SLinus Torvalds 251da177e4SLinus Torvalds #define noisy_printk(noise, args...) do { \ 261da177e4SLinus Torvalds if (*(noise)) { \ 271da177e4SLinus Torvalds printk(KERN_NOTICE args); \ 281da177e4SLinus Torvalds (*(noise))--; \ 291da177e4SLinus Torvalds if (!(*(noise))) { \ 301da177e4SLinus Torvalds printk(KERN_NOTICE "Further such events for this erase block will not be printed\n"); \ 311da177e4SLinus Torvalds } \ 321da177e4SLinus Torvalds } \ 331da177e4SLinus Torvalds } while(0) 341da177e4SLinus Torvalds 351da177e4SLinus Torvalds static uint32_t pseudo_random; 361da177e4SLinus Torvalds 371da177e4SLinus Torvalds static int jffs2_scan_eraseblock (struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 38e631ddbaSFerenc Havasi unsigned char *buf, uint32_t buf_size, struct jffs2_summary *s); 391da177e4SLinus Torvalds 401da177e4SLinus Torvalds /* These helper functions _must_ increase ofs and also do the dirty/used space accounting. 411da177e4SLinus Torvalds * Returning an error will abort the mount - bad checksums etc. should just mark the space 421da177e4SLinus Torvalds * as dirty. 431da177e4SLinus Torvalds */ 441da177e4SLinus Torvalds static int jffs2_scan_inode_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 45e631ddbaSFerenc Havasi struct jffs2_raw_inode *ri, uint32_t ofs, struct jffs2_summary *s); 461da177e4SLinus Torvalds static int jffs2_scan_dirent_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 47e631ddbaSFerenc Havasi struct jffs2_raw_dirent *rd, uint32_t ofs, struct jffs2_summary *s); 481da177e4SLinus Torvalds 491da177e4SLinus Torvalds static inline int min_free(struct jffs2_sb_info *c) 501da177e4SLinus Torvalds { 511da177e4SLinus Torvalds uint32_t min = 2 * sizeof(struct jffs2_raw_inode); 522f82ce1eSAndrew Victor #ifdef CONFIG_JFFS2_FS_WRITEBUFFER 531da177e4SLinus Torvalds if (!jffs2_can_mark_obsolete(c) && min < c->wbuf_pagesize) 541da177e4SLinus Torvalds return c->wbuf_pagesize; 551da177e4SLinus Torvalds #endif 561da177e4SLinus Torvalds return min; 571da177e4SLinus Torvalds 581da177e4SLinus Torvalds } 593be36675SAndrew Victor 603be36675SAndrew Victor static inline uint32_t EMPTY_SCAN_SIZE(uint32_t sector_size) { 613be36675SAndrew Victor if (sector_size < DEFAULT_EMPTY_SCAN_SIZE) 623be36675SAndrew Victor return sector_size; 633be36675SAndrew Victor else 643be36675SAndrew Victor return DEFAULT_EMPTY_SCAN_SIZE; 653be36675SAndrew Victor } 663be36675SAndrew Victor 6725090a6bSDavid Woodhouse static int file_dirty(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb) 6825090a6bSDavid Woodhouse { 69a6a8bef7SDavid Woodhouse int ret; 70a6a8bef7SDavid Woodhouse 71a6a8bef7SDavid Woodhouse if ((ret = jffs2_prealloc_raw_node_refs(c, jeb, 1))) 72a6a8bef7SDavid Woodhouse return ret; 73a6a8bef7SDavid Woodhouse if ((ret = jffs2_scan_dirty_space(c, jeb, jeb->free_size))) 7425090a6bSDavid Woodhouse return ret; 7525090a6bSDavid Woodhouse /* Turned wasted size into dirty, since we apparently 7625090a6bSDavid Woodhouse think it's recoverable now. */ 7725090a6bSDavid Woodhouse jeb->dirty_size += jeb->wasted_size; 7825090a6bSDavid Woodhouse c->dirty_size += jeb->wasted_size; 7925090a6bSDavid Woodhouse c->wasted_size -= jeb->wasted_size; 8025090a6bSDavid Woodhouse jeb->wasted_size = 0; 8125090a6bSDavid Woodhouse if (VERYDIRTY(c, jeb->dirty_size)) { 8225090a6bSDavid Woodhouse list_add(&jeb->list, &c->very_dirty_list); 8325090a6bSDavid Woodhouse } else { 8425090a6bSDavid Woodhouse list_add(&jeb->list, &c->dirty_list); 8525090a6bSDavid Woodhouse } 8625090a6bSDavid Woodhouse return 0; 8725090a6bSDavid Woodhouse } 8825090a6bSDavid Woodhouse 891da177e4SLinus Torvalds int jffs2_scan_medium(struct jffs2_sb_info *c) 901da177e4SLinus Torvalds { 911da177e4SLinus Torvalds int i, ret; 921da177e4SLinus Torvalds uint32_t empty_blocks = 0, bad_blocks = 0; 931da177e4SLinus Torvalds unsigned char *flashbuf = NULL; 941da177e4SLinus Torvalds uint32_t buf_size = 0; 95e631ddbaSFerenc Havasi struct jffs2_summary *s = NULL; /* summary info collected by the scan process */ 961da177e4SLinus Torvalds #ifndef __ECOS 971da177e4SLinus Torvalds size_t pointlen; 981da177e4SLinus Torvalds 991da177e4SLinus Torvalds if (c->mtd->point) { 1001da177e4SLinus Torvalds ret = c->mtd->point (c->mtd, 0, c->mtd->size, &pointlen, &flashbuf); 1011da177e4SLinus Torvalds if (!ret && pointlen < c->mtd->size) { 1021da177e4SLinus Torvalds /* Don't muck about if it won't let us point to the whole flash */ 1031da177e4SLinus Torvalds D1(printk(KERN_DEBUG "MTD point returned len too short: 0x%zx\n", pointlen)); 10459d8235bSAndy Lowe c->mtd->unpoint(c->mtd, flashbuf, 0, pointlen); 1051da177e4SLinus Torvalds flashbuf = NULL; 1061da177e4SLinus Torvalds } 1071da177e4SLinus Torvalds if (ret) 1081da177e4SLinus Torvalds D1(printk(KERN_DEBUG "MTD point failed %d\n", ret)); 1091da177e4SLinus Torvalds } 1101da177e4SLinus Torvalds #endif 1111da177e4SLinus Torvalds if (!flashbuf) { 1121da177e4SLinus Torvalds /* For NAND it's quicker to read a whole eraseblock at a time, 1131da177e4SLinus Torvalds apparently */ 1141da177e4SLinus Torvalds if (jffs2_cleanmarker_oob(c)) 1151da177e4SLinus Torvalds buf_size = c->sector_size; 1161da177e4SLinus Torvalds else 1171da177e4SLinus Torvalds buf_size = PAGE_SIZE; 1181da177e4SLinus Torvalds 1191da177e4SLinus Torvalds /* Respect kmalloc limitations */ 1201da177e4SLinus Torvalds if (buf_size > 128*1024) 1211da177e4SLinus Torvalds buf_size = 128*1024; 1221da177e4SLinus Torvalds 1231da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Allocating readbuf of %d bytes\n", buf_size)); 1241da177e4SLinus Torvalds flashbuf = kmalloc(buf_size, GFP_KERNEL); 1251da177e4SLinus Torvalds if (!flashbuf) 1261da177e4SLinus Torvalds return -ENOMEM; 1271da177e4SLinus Torvalds } 1281da177e4SLinus Torvalds 129e631ddbaSFerenc Havasi if (jffs2_sum_active()) { 1303d375d9eSYan Burman s = kzalloc(sizeof(struct jffs2_summary), GFP_KERNEL); 131e631ddbaSFerenc Havasi if (!s) { 13285de3d9bSAmit Choudhary kfree(flashbuf); 133e631ddbaSFerenc Havasi JFFS2_WARNING("Can't allocate memory for summary\n"); 134e631ddbaSFerenc Havasi return -ENOMEM; 135e631ddbaSFerenc Havasi } 136e631ddbaSFerenc Havasi } 137e631ddbaSFerenc Havasi 1381da177e4SLinus Torvalds for (i=0; i<c->nr_blocks; i++) { 1391da177e4SLinus Torvalds struct jffs2_eraseblock *jeb = &c->blocks[i]; 1401da177e4SLinus Torvalds 141a2166b93SArtem Bityutskiy cond_resched(); 142a2166b93SArtem Bityutskiy 143e631ddbaSFerenc Havasi /* reset summary info for next eraseblock scan */ 144e631ddbaSFerenc Havasi jffs2_sum_reset_collected(s); 145e631ddbaSFerenc Havasi 146e631ddbaSFerenc Havasi ret = jffs2_scan_eraseblock(c, jeb, buf_size?flashbuf:(flashbuf+jeb->offset), 147e631ddbaSFerenc Havasi buf_size, s); 1481da177e4SLinus Torvalds 1491da177e4SLinus Torvalds if (ret < 0) 1501da177e4SLinus Torvalds goto out; 1511da177e4SLinus Torvalds 152e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_paranoia_check_nolock(c, jeb); 1531da177e4SLinus Torvalds 1541da177e4SLinus Torvalds /* Now decide which list to put it on */ 1551da177e4SLinus Torvalds switch(ret) { 1561da177e4SLinus Torvalds case BLK_STATE_ALLFF: 1571da177e4SLinus Torvalds /* 1581da177e4SLinus Torvalds * Empty block. Since we can't be sure it 1591da177e4SLinus Torvalds * was entirely erased, we just queue it for erase 1601da177e4SLinus Torvalds * again. It will be marked as such when the erase 1611da177e4SLinus Torvalds * is complete. Meanwhile we still count it as empty 1621da177e4SLinus Torvalds * for later checks. 1631da177e4SLinus Torvalds */ 1641da177e4SLinus Torvalds empty_blocks++; 1651da177e4SLinus Torvalds list_add(&jeb->list, &c->erase_pending_list); 1661da177e4SLinus Torvalds c->nr_erasing_blocks++; 1671da177e4SLinus Torvalds break; 1681da177e4SLinus Torvalds 1691da177e4SLinus Torvalds case BLK_STATE_CLEANMARKER: 1701da177e4SLinus Torvalds /* Only a CLEANMARKER node is valid */ 1711da177e4SLinus Torvalds if (!jeb->dirty_size) { 1721da177e4SLinus Torvalds /* It's actually free */ 1731da177e4SLinus Torvalds list_add(&jeb->list, &c->free_list); 1741da177e4SLinus Torvalds c->nr_free_blocks++; 1751da177e4SLinus Torvalds } else { 1761da177e4SLinus Torvalds /* Dirt */ 1771da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Adding all-dirty block at 0x%08x to erase_pending_list\n", jeb->offset)); 1781da177e4SLinus Torvalds list_add(&jeb->list, &c->erase_pending_list); 1791da177e4SLinus Torvalds c->nr_erasing_blocks++; 1801da177e4SLinus Torvalds } 1811da177e4SLinus Torvalds break; 1821da177e4SLinus Torvalds 1831da177e4SLinus Torvalds case BLK_STATE_CLEAN: 1841da177e4SLinus Torvalds /* Full (or almost full) of clean data. Clean list */ 1851da177e4SLinus Torvalds list_add(&jeb->list, &c->clean_list); 1861da177e4SLinus Torvalds break; 1871da177e4SLinus Torvalds 1881da177e4SLinus Torvalds case BLK_STATE_PARTDIRTY: 1891da177e4SLinus Torvalds /* Some data, but not full. Dirty list. */ 1901da177e4SLinus Torvalds /* We want to remember the block with most free space 1911da177e4SLinus Torvalds and stick it in the 'nextblock' position to start writing to it. */ 1921da177e4SLinus Torvalds if (jeb->free_size > min_free(c) && 1931da177e4SLinus Torvalds (!c->nextblock || c->nextblock->free_size < jeb->free_size)) { 1941da177e4SLinus Torvalds /* Better candidate for the next writes to go to */ 1951da177e4SLinus Torvalds if (c->nextblock) { 19625090a6bSDavid Woodhouse ret = file_dirty(c, c->nextblock); 19725090a6bSDavid Woodhouse if (ret) 19825090a6bSDavid Woodhouse return ret; 199e631ddbaSFerenc Havasi /* deleting summary information of the old nextblock */ 200e631ddbaSFerenc Havasi jffs2_sum_reset_collected(c->summary); 2011da177e4SLinus Torvalds } 20225090a6bSDavid Woodhouse /* update collected summary information for the current nextblock */ 203e631ddbaSFerenc Havasi jffs2_sum_move_collected(c, s); 204e631ddbaSFerenc Havasi D1(printk(KERN_DEBUG "jffs2_scan_medium(): new nextblock = 0x%08x\n", jeb->offset)); 2051da177e4SLinus Torvalds c->nextblock = jeb; 2061da177e4SLinus Torvalds } else { 20725090a6bSDavid Woodhouse ret = file_dirty(c, jeb); 20825090a6bSDavid Woodhouse if (ret) 20925090a6bSDavid Woodhouse return ret; 2101da177e4SLinus Torvalds } 2111da177e4SLinus Torvalds break; 2121da177e4SLinus Torvalds 2131da177e4SLinus Torvalds case BLK_STATE_ALLDIRTY: 2141da177e4SLinus Torvalds /* Nothing valid - not even a clean marker. Needs erasing. */ 2151da177e4SLinus Torvalds /* For now we just put it on the erasing list. We'll start the erases later */ 2161da177e4SLinus Torvalds D1(printk(KERN_NOTICE "JFFS2: Erase block at 0x%08x is not formatted. It will be erased\n", jeb->offset)); 2171da177e4SLinus Torvalds list_add(&jeb->list, &c->erase_pending_list); 2181da177e4SLinus Torvalds c->nr_erasing_blocks++; 2191da177e4SLinus Torvalds break; 2201da177e4SLinus Torvalds 2211da177e4SLinus Torvalds case BLK_STATE_BADBLOCK: 2221da177e4SLinus Torvalds D1(printk(KERN_NOTICE "JFFS2: Block at 0x%08x is bad\n", jeb->offset)); 2231da177e4SLinus Torvalds list_add(&jeb->list, &c->bad_list); 2241da177e4SLinus Torvalds c->bad_size += c->sector_size; 2251da177e4SLinus Torvalds c->free_size -= c->sector_size; 2261da177e4SLinus Torvalds bad_blocks++; 2271da177e4SLinus Torvalds break; 2281da177e4SLinus Torvalds default: 2291da177e4SLinus Torvalds printk(KERN_WARNING "jffs2_scan_medium(): unknown block state\n"); 2301da177e4SLinus Torvalds BUG(); 2311da177e4SLinus Torvalds } 2321da177e4SLinus Torvalds } 2331da177e4SLinus Torvalds 2341da177e4SLinus Torvalds /* Nextblock dirty is always seen as wasted, because we cannot recycle it now */ 2351da177e4SLinus Torvalds if (c->nextblock && (c->nextblock->dirty_size)) { 2361da177e4SLinus Torvalds c->nextblock->wasted_size += c->nextblock->dirty_size; 2371da177e4SLinus Torvalds c->wasted_size += c->nextblock->dirty_size; 2381da177e4SLinus Torvalds c->dirty_size -= c->nextblock->dirty_size; 2391da177e4SLinus Torvalds c->nextblock->dirty_size = 0; 2401da177e4SLinus Torvalds } 2412f82ce1eSAndrew Victor #ifdef CONFIG_JFFS2_FS_WRITEBUFFER 242e96fb230SDavid Woodhouse if (!jffs2_can_mark_obsolete(c) && c->wbuf_pagesize && c->nextblock && (c->nextblock->free_size % c->wbuf_pagesize)) { 2431da177e4SLinus Torvalds /* If we're going to start writing into a block which already 2441da177e4SLinus Torvalds contains data, and the end of the data isn't page-aligned, 2451da177e4SLinus Torvalds skip a little and align it. */ 2461da177e4SLinus Torvalds 247daba5cc4SArtem B. Bityutskiy uint32_t skip = c->nextblock->free_size % c->wbuf_pagesize; 2481da177e4SLinus Torvalds 2491da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_scan_medium(): Skipping %d bytes in nextblock to ensure page alignment\n", 2501da177e4SLinus Torvalds skip)); 251046b8b98SDavid Woodhouse jffs2_prealloc_raw_node_refs(c, c->nextblock, 1); 252f560928bSDavid Woodhouse jffs2_scan_dirty_space(c, c->nextblock, skip); 2531da177e4SLinus Torvalds } 2541da177e4SLinus Torvalds #endif 2551da177e4SLinus Torvalds if (c->nr_erasing_blocks) { 2561da177e4SLinus Torvalds if ( !c->used_size && ((c->nr_free_blocks+empty_blocks+bad_blocks)!= c->nr_blocks || bad_blocks == c->nr_blocks) ) { 2571da177e4SLinus Torvalds printk(KERN_NOTICE "Cowardly refusing to erase blocks on filesystem with no valid JFFS2 nodes\n"); 2581da177e4SLinus Torvalds printk(KERN_NOTICE "empty_blocks %d, bad_blocks %d, c->nr_blocks %d\n",empty_blocks,bad_blocks,c->nr_blocks); 2591da177e4SLinus Torvalds ret = -EIO; 2601da177e4SLinus Torvalds goto out; 2611da177e4SLinus Torvalds } 2621da177e4SLinus Torvalds jffs2_erase_pending_trigger(c); 2631da177e4SLinus Torvalds } 2641da177e4SLinus Torvalds ret = 0; 2651da177e4SLinus Torvalds out: 2661da177e4SLinus Torvalds if (buf_size) 2671da177e4SLinus Torvalds kfree(flashbuf); 2681da177e4SLinus Torvalds #ifndef __ECOS 2691da177e4SLinus Torvalds else 2701da177e4SLinus Torvalds c->mtd->unpoint(c->mtd, flashbuf, 0, c->mtd->size); 2711da177e4SLinus Torvalds #endif 2725b5ffbc1SFlorin Malita if (s) 2735b5ffbc1SFlorin Malita kfree(s); 2745b5ffbc1SFlorin Malita 2751da177e4SLinus Torvalds return ret; 2761da177e4SLinus Torvalds } 2771da177e4SLinus Torvalds 278c05d52c7SAdrian Bunk static int jffs2_fill_scan_buf(struct jffs2_sb_info *c, void *buf, 2791da177e4SLinus Torvalds uint32_t ofs, uint32_t len) 2801da177e4SLinus Torvalds { 2811da177e4SLinus Torvalds int ret; 2821da177e4SLinus Torvalds size_t retlen; 2831da177e4SLinus Torvalds 2841da177e4SLinus Torvalds ret = jffs2_flash_read(c, ofs, len, &retlen, buf); 2851da177e4SLinus Torvalds if (ret) { 2861da177e4SLinus Torvalds D1(printk(KERN_WARNING "mtd->read(0x%x bytes from 0x%x) returned %d\n", len, ofs, ret)); 2871da177e4SLinus Torvalds return ret; 2881da177e4SLinus Torvalds } 2891da177e4SLinus Torvalds if (retlen < len) { 2901da177e4SLinus Torvalds D1(printk(KERN_WARNING "Read at 0x%x gave only 0x%zx bytes\n", ofs, retlen)); 2911da177e4SLinus Torvalds return -EIO; 2921da177e4SLinus Torvalds } 2931da177e4SLinus Torvalds return 0; 2941da177e4SLinus Torvalds } 2951da177e4SLinus Torvalds 296e631ddbaSFerenc Havasi int jffs2_scan_classify_jeb(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb) 297e631ddbaSFerenc Havasi { 298e631ddbaSFerenc Havasi if ((jeb->used_size + jeb->unchecked_size) == PAD(c->cleanmarker_size) && !jeb->dirty_size 29999988f7bSDavid Woodhouse && (!jeb->first_node || !ref_next(jeb->first_node)) ) 300e631ddbaSFerenc Havasi return BLK_STATE_CLEANMARKER; 301e631ddbaSFerenc Havasi 302e631ddbaSFerenc Havasi /* move blocks with max 4 byte dirty space to cleanlist */ 303e631ddbaSFerenc Havasi else if (!ISDIRTY(c->sector_size - (jeb->used_size + jeb->unchecked_size))) { 304e631ddbaSFerenc Havasi c->dirty_size -= jeb->dirty_size; 305e631ddbaSFerenc Havasi c->wasted_size += jeb->dirty_size; 306e631ddbaSFerenc Havasi jeb->wasted_size += jeb->dirty_size; 307e631ddbaSFerenc Havasi jeb->dirty_size = 0; 308e631ddbaSFerenc Havasi return BLK_STATE_CLEAN; 309e631ddbaSFerenc Havasi } else if (jeb->used_size || jeb->unchecked_size) 310e631ddbaSFerenc Havasi return BLK_STATE_PARTDIRTY; 311e631ddbaSFerenc Havasi else 312e631ddbaSFerenc Havasi return BLK_STATE_ALLDIRTY; 313e631ddbaSFerenc Havasi } 314e631ddbaSFerenc Havasi 315aa98d7cfSKaiGai Kohei #ifdef CONFIG_JFFS2_FS_XATTR 316aa98d7cfSKaiGai Kohei static int jffs2_scan_xattr_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 317aa98d7cfSKaiGai Kohei struct jffs2_raw_xattr *rx, uint32_t ofs, 318aa98d7cfSKaiGai Kohei struct jffs2_summary *s) 319aa98d7cfSKaiGai Kohei { 320aa98d7cfSKaiGai Kohei struct jffs2_xattr_datum *xd; 321c9f700f8SKaiGai Kohei uint32_t xid, version, totlen, crc; 32268270995SDavid Woodhouse int err; 323aa98d7cfSKaiGai Kohei 324aa98d7cfSKaiGai Kohei crc = crc32(0, rx, sizeof(struct jffs2_raw_xattr) - 4); 325aa98d7cfSKaiGai Kohei if (crc != je32_to_cpu(rx->node_crc)) { 326aa98d7cfSKaiGai Kohei JFFS2_WARNING("node CRC failed at %#08x, read=%#08x, calc=%#08x\n", 327aa98d7cfSKaiGai Kohei ofs, je32_to_cpu(rx->node_crc), crc); 32868270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, je32_to_cpu(rx->totlen)))) 32968270995SDavid Woodhouse return err; 330aa98d7cfSKaiGai Kohei return 0; 331aa98d7cfSKaiGai Kohei } 332aa98d7cfSKaiGai Kohei 333c9f700f8SKaiGai Kohei xid = je32_to_cpu(rx->xid); 334c9f700f8SKaiGai Kohei version = je32_to_cpu(rx->version); 335c9f700f8SKaiGai Kohei 3368a13695cSKaiGai Kohei totlen = PAD(sizeof(struct jffs2_raw_xattr) 3378a13695cSKaiGai Kohei + rx->name_len + 1 + je16_to_cpu(rx->value_len)); 338aa98d7cfSKaiGai Kohei if (totlen != je32_to_cpu(rx->totlen)) { 339aa98d7cfSKaiGai Kohei JFFS2_WARNING("node length mismatch at %#08x, read=%u, calc=%u\n", 340aa98d7cfSKaiGai Kohei ofs, je32_to_cpu(rx->totlen), totlen); 34168270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, je32_to_cpu(rx->totlen)))) 34268270995SDavid Woodhouse return err; 343aa98d7cfSKaiGai Kohei return 0; 344aa98d7cfSKaiGai Kohei } 345aa98d7cfSKaiGai Kohei 346c9f700f8SKaiGai Kohei xd = jffs2_setup_xattr_datum(c, xid, version); 347c9f700f8SKaiGai Kohei if (IS_ERR(xd)) 348aa98d7cfSKaiGai Kohei return PTR_ERR(xd); 349c9f700f8SKaiGai Kohei 350c9f700f8SKaiGai Kohei if (xd->version > version) { 351c9f700f8SKaiGai Kohei struct jffs2_raw_node_ref *raw 352c9f700f8SKaiGai Kohei = jffs2_link_node_ref(c, jeb, ofs | REF_PRISTINE, totlen, NULL); 353c9f700f8SKaiGai Kohei raw->next_in_ino = xd->node->next_in_ino; 354c9f700f8SKaiGai Kohei xd->node->next_in_ino = raw; 355c9f700f8SKaiGai Kohei } else { 356c9f700f8SKaiGai Kohei xd->version = version; 357aa98d7cfSKaiGai Kohei xd->xprefix = rx->xprefix; 358aa98d7cfSKaiGai Kohei xd->name_len = rx->name_len; 359aa98d7cfSKaiGai Kohei xd->value_len = je16_to_cpu(rx->value_len); 360aa98d7cfSKaiGai Kohei xd->data_crc = je32_to_cpu(rx->data_crc); 361aa98d7cfSKaiGai Kohei 362c9f700f8SKaiGai Kohei jffs2_link_node_ref(c, jeb, ofs | REF_PRISTINE, totlen, (void *)xd); 363c9f700f8SKaiGai Kohei } 364f1f9671bSDavid Woodhouse 365aa98d7cfSKaiGai Kohei if (jffs2_sum_active()) 366aa98d7cfSKaiGai Kohei jffs2_sum_add_xattr_mem(s, rx, ofs - jeb->offset); 367aa98d7cfSKaiGai Kohei dbg_xattr("scaning xdatum at %#08x (xid=%u, version=%u)\n", 368aa98d7cfSKaiGai Kohei ofs, xd->xid, xd->version); 369aa98d7cfSKaiGai Kohei return 0; 370aa98d7cfSKaiGai Kohei } 371aa98d7cfSKaiGai Kohei 372aa98d7cfSKaiGai Kohei static int jffs2_scan_xref_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 373aa98d7cfSKaiGai Kohei struct jffs2_raw_xref *rr, uint32_t ofs, 374aa98d7cfSKaiGai Kohei struct jffs2_summary *s) 375aa98d7cfSKaiGai Kohei { 376aa98d7cfSKaiGai Kohei struct jffs2_xattr_ref *ref; 377aa98d7cfSKaiGai Kohei uint32_t crc; 37868270995SDavid Woodhouse int err; 379aa98d7cfSKaiGai Kohei 380aa98d7cfSKaiGai Kohei crc = crc32(0, rr, sizeof(*rr) - 4); 381aa98d7cfSKaiGai Kohei if (crc != je32_to_cpu(rr->node_crc)) { 382aa98d7cfSKaiGai Kohei JFFS2_WARNING("node CRC failed at %#08x, read=%#08x, calc=%#08x\n", 383aa98d7cfSKaiGai Kohei ofs, je32_to_cpu(rr->node_crc), crc); 38468270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(rr->totlen))))) 38568270995SDavid Woodhouse return err; 386aa98d7cfSKaiGai Kohei return 0; 387aa98d7cfSKaiGai Kohei } 388aa98d7cfSKaiGai Kohei 389aa98d7cfSKaiGai Kohei if (PAD(sizeof(struct jffs2_raw_xref)) != je32_to_cpu(rr->totlen)) { 39089291a9dSDavid Woodhouse JFFS2_WARNING("node length mismatch at %#08x, read=%u, calc=%zd\n", 391aa98d7cfSKaiGai Kohei ofs, je32_to_cpu(rr->totlen), 392aa98d7cfSKaiGai Kohei PAD(sizeof(struct jffs2_raw_xref))); 39368270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, je32_to_cpu(rr->totlen)))) 39468270995SDavid Woodhouse return err; 395aa98d7cfSKaiGai Kohei return 0; 396aa98d7cfSKaiGai Kohei } 397aa98d7cfSKaiGai Kohei 398aa98d7cfSKaiGai Kohei ref = jffs2_alloc_xattr_ref(); 399aa98d7cfSKaiGai Kohei if (!ref) 400aa98d7cfSKaiGai Kohei return -ENOMEM; 401aa98d7cfSKaiGai Kohei 402aa98d7cfSKaiGai Kohei /* BEFORE jffs2_build_xattr_subsystem() called, 403c9f700f8SKaiGai Kohei * and AFTER xattr_ref is marked as a dead xref, 404aa98d7cfSKaiGai Kohei * ref->xid is used to store 32bit xid, xd is not used 405aa98d7cfSKaiGai Kohei * ref->ino is used to store 32bit inode-number, ic is not used 406aa98d7cfSKaiGai Kohei * Thoes variables are declared as union, thus using those 4078f2b6f49SKaiGai Kohei * are exclusive. In a similar way, ref->next is temporarily 408aa98d7cfSKaiGai Kohei * used to chain all xattr_ref object. It's re-chained to 409aa98d7cfSKaiGai Kohei * jffs2_inode_cache in jffs2_build_xattr_subsystem() correctly. 410aa98d7cfSKaiGai Kohei */ 411aa98d7cfSKaiGai Kohei ref->ino = je32_to_cpu(rr->ino); 412aa98d7cfSKaiGai Kohei ref->xid = je32_to_cpu(rr->xid); 413c9f700f8SKaiGai Kohei ref->xseqno = je32_to_cpu(rr->xseqno); 414c9f700f8SKaiGai Kohei if (ref->xseqno > c->highest_xseqno) 415c9f700f8SKaiGai Kohei c->highest_xseqno = (ref->xseqno & ~XREF_DELETE_MARKER); 4168f2b6f49SKaiGai Kohei ref->next = c->xref_temp; 4178f2b6f49SKaiGai Kohei c->xref_temp = ref; 418aa98d7cfSKaiGai Kohei 419c9f700f8SKaiGai Kohei jffs2_link_node_ref(c, jeb, ofs | REF_PRISTINE, PAD(je32_to_cpu(rr->totlen)), (void *)ref); 420f1f9671bSDavid Woodhouse 421aa98d7cfSKaiGai Kohei if (jffs2_sum_active()) 422aa98d7cfSKaiGai Kohei jffs2_sum_add_xref_mem(s, rr, ofs - jeb->offset); 423aa98d7cfSKaiGai Kohei dbg_xattr("scan xref at %#08x (xid=%u, ino=%u)\n", 424aa98d7cfSKaiGai Kohei ofs, ref->xid, ref->ino); 425aa98d7cfSKaiGai Kohei return 0; 426aa98d7cfSKaiGai Kohei } 427aa98d7cfSKaiGai Kohei #endif 428aa98d7cfSKaiGai Kohei 4299641b784SDavid Woodhouse /* Called with 'buf_size == 0' if buf is in fact a pointer _directly_ into 4309641b784SDavid Woodhouse the flash, XIP-style */ 4311da177e4SLinus Torvalds static int jffs2_scan_eraseblock (struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 432e631ddbaSFerenc Havasi unsigned char *buf, uint32_t buf_size, struct jffs2_summary *s) { 4331da177e4SLinus Torvalds struct jffs2_unknown_node *node; 4341da177e4SLinus Torvalds struct jffs2_unknown_node crcnode; 4351da177e4SLinus Torvalds uint32_t ofs, prevofs; 4361da177e4SLinus Torvalds uint32_t hdr_crc, buf_ofs, buf_len; 4371da177e4SLinus Torvalds int err; 4381da177e4SLinus Torvalds int noise = 0; 439e631ddbaSFerenc Havasi 440e631ddbaSFerenc Havasi 4412f82ce1eSAndrew Victor #ifdef CONFIG_JFFS2_FS_WRITEBUFFER 4421da177e4SLinus Torvalds int cleanmarkerfound = 0; 4431da177e4SLinus Torvalds #endif 4441da177e4SLinus Torvalds 4451da177e4SLinus Torvalds ofs = jeb->offset; 4461da177e4SLinus Torvalds prevofs = jeb->offset - 1; 4471da177e4SLinus Torvalds 4481da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_scan_eraseblock(): Scanning block at 0x%x\n", ofs)); 4491da177e4SLinus Torvalds 4502f82ce1eSAndrew Victor #ifdef CONFIG_JFFS2_FS_WRITEBUFFER 4511da177e4SLinus Torvalds if (jffs2_cleanmarker_oob(c)) { 452a7a6ace1SArtem Bityutskiy int ret; 453a7a6ace1SArtem Bityutskiy 454a7a6ace1SArtem Bityutskiy if (c->mtd->block_isbad(c->mtd, jeb->offset)) 455a7a6ace1SArtem Bityutskiy return BLK_STATE_BADBLOCK; 456a7a6ace1SArtem Bityutskiy 457a7a6ace1SArtem Bityutskiy ret = jffs2_check_nand_cleanmarker(c, jeb); 4581da177e4SLinus Torvalds D2(printk(KERN_NOTICE "jffs_check_nand_cleanmarker returned %d\n",ret)); 459a7a6ace1SArtem Bityutskiy 4601da177e4SLinus Torvalds /* Even if it's not found, we still scan to see 4611da177e4SLinus Torvalds if the block is empty. We use this information 4621da177e4SLinus Torvalds to decide whether to erase it or not. */ 4631da177e4SLinus Torvalds switch (ret) { 4641da177e4SLinus Torvalds case 0: cleanmarkerfound = 1; break; 4651da177e4SLinus Torvalds case 1: break; 4661da177e4SLinus Torvalds default: return ret; 4671da177e4SLinus Torvalds } 4681da177e4SLinus Torvalds } 4691da177e4SLinus Torvalds #endif 470e631ddbaSFerenc Havasi 471e631ddbaSFerenc Havasi if (jffs2_sum_active()) { 4729641b784SDavid Woodhouse struct jffs2_sum_marker *sm; 4739641b784SDavid Woodhouse void *sumptr = NULL; 4749641b784SDavid Woodhouse uint32_t sumlen; 475e631ddbaSFerenc Havasi 4769641b784SDavid Woodhouse if (!buf_size) { 4779641b784SDavid Woodhouse /* XIP case. Just look, point at the summary if it's there */ 47813ba42dfSDavid Woodhouse sm = (void *)buf + c->sector_size - sizeof(*sm); 479e631ddbaSFerenc Havasi if (je32_to_cpu(sm->magic) == JFFS2_SUM_MAGIC) { 4809641b784SDavid Woodhouse sumptr = buf + je32_to_cpu(sm->offset); 4819641b784SDavid Woodhouse sumlen = c->sector_size - je32_to_cpu(sm->offset); 4829641b784SDavid Woodhouse } 4839641b784SDavid Woodhouse } else { 4849641b784SDavid Woodhouse /* If NAND flash, read a whole page of it. Else just the end */ 4859641b784SDavid Woodhouse if (c->wbuf_pagesize) 4869641b784SDavid Woodhouse buf_len = c->wbuf_pagesize; 4879641b784SDavid Woodhouse else 4889641b784SDavid Woodhouse buf_len = sizeof(*sm); 4899641b784SDavid Woodhouse 4909641b784SDavid Woodhouse /* Read as much as we want into the _end_ of the preallocated buffer */ 4919641b784SDavid Woodhouse err = jffs2_fill_scan_buf(c, buf + buf_size - buf_len, 4929641b784SDavid Woodhouse jeb->offset + c->sector_size - buf_len, 4939641b784SDavid Woodhouse buf_len); 4949641b784SDavid Woodhouse if (err) 4959641b784SDavid Woodhouse return err; 4969641b784SDavid Woodhouse 4979641b784SDavid Woodhouse sm = (void *)buf + buf_size - sizeof(*sm); 4989641b784SDavid Woodhouse if (je32_to_cpu(sm->magic) == JFFS2_SUM_MAGIC) { 4999641b784SDavid Woodhouse sumlen = c->sector_size - je32_to_cpu(sm->offset); 5009641b784SDavid Woodhouse sumptr = buf + buf_size - sumlen; 5019641b784SDavid Woodhouse 5029641b784SDavid Woodhouse /* Now, make sure the summary itself is available */ 5039641b784SDavid Woodhouse if (sumlen > buf_size) { 5049641b784SDavid Woodhouse /* Need to kmalloc for this. */ 5059641b784SDavid Woodhouse sumptr = kmalloc(sumlen, GFP_KERNEL); 5069641b784SDavid Woodhouse if (!sumptr) 5079641b784SDavid Woodhouse return -ENOMEM; 5089641b784SDavid Woodhouse memcpy(sumptr + sumlen - buf_len, buf + buf_size - buf_len, buf_len); 5099641b784SDavid Woodhouse } 5109641b784SDavid Woodhouse if (buf_len < sumlen) { 5119641b784SDavid Woodhouse /* Need to read more so that the entire summary node is present */ 5129641b784SDavid Woodhouse err = jffs2_fill_scan_buf(c, sumptr, 5139641b784SDavid Woodhouse jeb->offset + c->sector_size - sumlen, 5149641b784SDavid Woodhouse sumlen - buf_len); 5159641b784SDavid Woodhouse if (err) 516e631ddbaSFerenc Havasi return err; 517e631ddbaSFerenc Havasi } 518e631ddbaSFerenc Havasi } 519e631ddbaSFerenc Havasi 5209641b784SDavid Woodhouse } 5219641b784SDavid Woodhouse 5229641b784SDavid Woodhouse if (sumptr) { 5239641b784SDavid Woodhouse err = jffs2_sum_scan_sumnode(c, jeb, sumptr, sumlen, &pseudo_random); 5243560160aSDavid Woodhouse 5259641b784SDavid Woodhouse if (buf_size && sumlen > buf_size) 5269641b784SDavid Woodhouse kfree(sumptr); 5273560160aSDavid Woodhouse /* If it returns with a real error, bail. 5283560160aSDavid Woodhouse If it returns positive, that's a block classification 5293560160aSDavid Woodhouse (i.e. BLK_STATE_xxx) so return that too. 5303560160aSDavid Woodhouse If it returns zero, fall through to full scan. */ 5313560160aSDavid Woodhouse if (err) 5323560160aSDavid Woodhouse return err; 5339641b784SDavid Woodhouse } 534e631ddbaSFerenc Havasi } 535e631ddbaSFerenc Havasi 5361da177e4SLinus Torvalds buf_ofs = jeb->offset; 5371da177e4SLinus Torvalds 5381da177e4SLinus Torvalds if (!buf_size) { 5399641b784SDavid Woodhouse /* This is the XIP case -- we're reading _directly_ from the flash chip */ 5401da177e4SLinus Torvalds buf_len = c->sector_size; 5411da177e4SLinus Torvalds } else { 5423be36675SAndrew Victor buf_len = EMPTY_SCAN_SIZE(c->sector_size); 5431da177e4SLinus Torvalds err = jffs2_fill_scan_buf(c, buf, buf_ofs, buf_len); 5441da177e4SLinus Torvalds if (err) 5451da177e4SLinus Torvalds return err; 5461da177e4SLinus Torvalds } 5471da177e4SLinus Torvalds 5481da177e4SLinus Torvalds /* We temporarily use 'ofs' as a pointer into the buffer/jeb */ 5491da177e4SLinus Torvalds ofs = 0; 5501da177e4SLinus Torvalds 5511da177e4SLinus Torvalds /* Scan only 4KiB of 0xFF before declaring it's empty */ 5523be36675SAndrew Victor while(ofs < EMPTY_SCAN_SIZE(c->sector_size) && *(uint32_t *)(&buf[ofs]) == 0xFFFFFFFF) 5531da177e4SLinus Torvalds ofs += 4; 5541da177e4SLinus Torvalds 5553be36675SAndrew Victor if (ofs == EMPTY_SCAN_SIZE(c->sector_size)) { 5562f82ce1eSAndrew Victor #ifdef CONFIG_JFFS2_FS_WRITEBUFFER 5571da177e4SLinus Torvalds if (jffs2_cleanmarker_oob(c)) { 5581da177e4SLinus Torvalds /* scan oob, take care of cleanmarker */ 5591da177e4SLinus Torvalds int ret = jffs2_check_oob_empty(c, jeb, cleanmarkerfound); 5601da177e4SLinus Torvalds D2(printk(KERN_NOTICE "jffs2_check_oob_empty returned %d\n",ret)); 5611da177e4SLinus Torvalds switch (ret) { 5621da177e4SLinus Torvalds case 0: return cleanmarkerfound ? BLK_STATE_CLEANMARKER : BLK_STATE_ALLFF; 5631da177e4SLinus Torvalds case 1: return BLK_STATE_ALLDIRTY; 5641da177e4SLinus Torvalds default: return ret; 5651da177e4SLinus Torvalds } 5661da177e4SLinus Torvalds } 5671da177e4SLinus Torvalds #endif 5681da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Block at 0x%08x is empty (erased)\n", jeb->offset)); 5698f15fd55SAndrew Victor if (c->cleanmarker_size == 0) 5708f15fd55SAndrew Victor return BLK_STATE_CLEANMARKER; /* don't bother with re-erase */ 5718f15fd55SAndrew Victor else 5721da177e4SLinus Torvalds return BLK_STATE_ALLFF; /* OK to erase if all blocks are like this */ 5731da177e4SLinus Torvalds } 5741da177e4SLinus Torvalds if (ofs) { 5751da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Free space at %08x ends at %08x\n", jeb->offset, 5761da177e4SLinus Torvalds jeb->offset + ofs)); 577a6a8bef7SDavid Woodhouse if ((err = jffs2_prealloc_raw_node_refs(c, jeb, 1))) 578a6a8bef7SDavid Woodhouse return err; 57968270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, ofs))) 58068270995SDavid Woodhouse return err; 5811da177e4SLinus Torvalds } 5821da177e4SLinus Torvalds 5831da177e4SLinus Torvalds /* Now ofs is a complete physical flash offset as it always was... */ 5841da177e4SLinus Torvalds ofs += jeb->offset; 5851da177e4SLinus Torvalds 5861da177e4SLinus Torvalds noise = 10; 5871da177e4SLinus Torvalds 588733802d9SArtem B. Bityutskiy dbg_summary("no summary found in jeb 0x%08x. Apply original scan.\n",jeb->offset); 589e631ddbaSFerenc Havasi 5901da177e4SLinus Torvalds scan_more: 5911da177e4SLinus Torvalds while(ofs < jeb->offset + c->sector_size) { 5921da177e4SLinus Torvalds 593e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_paranoia_check_nolock(c, jeb); 5941da177e4SLinus Torvalds 5952f785402SDavid Woodhouse /* Make sure there are node refs available for use */ 596046b8b98SDavid Woodhouse err = jffs2_prealloc_raw_node_refs(c, jeb, 2); 5972f785402SDavid Woodhouse if (err) 5982f785402SDavid Woodhouse return err; 5992f785402SDavid Woodhouse 6001da177e4SLinus Torvalds cond_resched(); 6011da177e4SLinus Torvalds 6021da177e4SLinus Torvalds if (ofs & 3) { 6031da177e4SLinus Torvalds printk(KERN_WARNING "Eep. ofs 0x%08x not word-aligned!\n", ofs); 6041da177e4SLinus Torvalds ofs = PAD(ofs); 6051da177e4SLinus Torvalds continue; 6061da177e4SLinus Torvalds } 6071da177e4SLinus Torvalds if (ofs == prevofs) { 6081da177e4SLinus Torvalds printk(KERN_WARNING "ofs 0x%08x has already been seen. Skipping\n", ofs); 60968270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, 4))) 61068270995SDavid Woodhouse return err; 6111da177e4SLinus Torvalds ofs += 4; 6121da177e4SLinus Torvalds continue; 6131da177e4SLinus Torvalds } 6141da177e4SLinus Torvalds prevofs = ofs; 6151da177e4SLinus Torvalds 6161da177e4SLinus Torvalds if (jeb->offset + c->sector_size < ofs + sizeof(*node)) { 6171da177e4SLinus 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), 6181da177e4SLinus Torvalds jeb->offset, c->sector_size, ofs, sizeof(*node))); 61968270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, (jeb->offset + c->sector_size)-ofs))) 62068270995SDavid Woodhouse return err; 6211da177e4SLinus Torvalds break; 6221da177e4SLinus Torvalds } 6231da177e4SLinus Torvalds 6241da177e4SLinus Torvalds if (buf_ofs + buf_len < ofs + sizeof(*node)) { 6251da177e4SLinus Torvalds buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); 6261da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Fewer than %zd bytes (node header) left to end of buf. Reading 0x%x at 0x%08x\n", 6271da177e4SLinus Torvalds sizeof(struct jffs2_unknown_node), buf_len, ofs)); 6281da177e4SLinus Torvalds err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); 6291da177e4SLinus Torvalds if (err) 6301da177e4SLinus Torvalds return err; 6311da177e4SLinus Torvalds buf_ofs = ofs; 6321da177e4SLinus Torvalds } 6331da177e4SLinus Torvalds 6341da177e4SLinus Torvalds node = (struct jffs2_unknown_node *)&buf[ofs-buf_ofs]; 6351da177e4SLinus Torvalds 6361da177e4SLinus Torvalds if (*(uint32_t *)(&buf[ofs-buf_ofs]) == 0xffffffff) { 6371da177e4SLinus Torvalds uint32_t inbuf_ofs; 638c2aecda7SJoakim Tjernlund uint32_t empty_start, scan_end; 6391da177e4SLinus Torvalds 6401da177e4SLinus Torvalds empty_start = ofs; 6411da177e4SLinus Torvalds ofs += 4; 642c2aecda7SJoakim Tjernlund scan_end = min_t(uint32_t, EMPTY_SCAN_SIZE(c->sector_size)/8, buf_len); 6431da177e4SLinus Torvalds 6441da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Found empty flash at 0x%08x\n", ofs)); 6451da177e4SLinus Torvalds more_empty: 6461da177e4SLinus Torvalds inbuf_ofs = ofs - buf_ofs; 647c2aecda7SJoakim Tjernlund while (inbuf_ofs < scan_end) { 648c2aecda7SJoakim Tjernlund if (unlikely(*(uint32_t *)(&buf[inbuf_ofs]) != 0xffffffff)) { 6491da177e4SLinus Torvalds printk(KERN_WARNING "Empty flash at 0x%08x ends at 0x%08x\n", 6501da177e4SLinus Torvalds empty_start, ofs); 65168270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, ofs-empty_start))) 65268270995SDavid Woodhouse return err; 6531da177e4SLinus Torvalds goto scan_more; 6541da177e4SLinus Torvalds } 6551da177e4SLinus Torvalds 6561da177e4SLinus Torvalds inbuf_ofs+=4; 6571da177e4SLinus Torvalds ofs += 4; 6581da177e4SLinus Torvalds } 6591da177e4SLinus Torvalds /* Ran off end. */ 6601da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Empty flash to end of buffer at 0x%08x\n", ofs)); 6611da177e4SLinus Torvalds 6621da177e4SLinus Torvalds /* If we're only checking the beginning of a block with a cleanmarker, 6631da177e4SLinus Torvalds bail now */ 6641da177e4SLinus Torvalds if (buf_ofs == jeb->offset && jeb->used_size == PAD(c->cleanmarker_size) && 66599988f7bSDavid Woodhouse c->cleanmarker_size && !jeb->dirty_size && !ref_next(jeb->first_node)) { 6663be36675SAndrew Victor D1(printk(KERN_DEBUG "%d bytes at start of block seems clean... assuming all clean\n", EMPTY_SCAN_SIZE(c->sector_size))); 6671da177e4SLinus Torvalds return BLK_STATE_CLEANMARKER; 6681da177e4SLinus Torvalds } 669c2aecda7SJoakim Tjernlund if (!buf_size && (scan_end != buf_len)) {/* XIP/point case */ 670c2aecda7SJoakim Tjernlund scan_end = buf_len; 671c2aecda7SJoakim Tjernlund goto more_empty; 672c2aecda7SJoakim Tjernlund } 6731da177e4SLinus Torvalds 6741da177e4SLinus Torvalds /* See how much more there is to read in this eraseblock... */ 6751da177e4SLinus Torvalds buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); 6761da177e4SLinus Torvalds if (!buf_len) { 6771da177e4SLinus Torvalds /* No more to read. Break out of main loop without marking 6781da177e4SLinus Torvalds this range of empty space as dirty (because it's not) */ 6791da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Empty flash at %08x runs to end of block. Treating as free_space\n", 6801da177e4SLinus Torvalds empty_start)); 6811da177e4SLinus Torvalds break; 6821da177e4SLinus Torvalds } 683c2aecda7SJoakim Tjernlund /* point never reaches here */ 684c2aecda7SJoakim Tjernlund scan_end = buf_len; 6851da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Reading another 0x%x at 0x%08x\n", buf_len, ofs)); 6861da177e4SLinus Torvalds err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); 6871da177e4SLinus Torvalds if (err) 6881da177e4SLinus Torvalds return err; 6891da177e4SLinus Torvalds buf_ofs = ofs; 6901da177e4SLinus Torvalds goto more_empty; 6911da177e4SLinus Torvalds } 6921da177e4SLinus Torvalds 6931da177e4SLinus Torvalds if (ofs == jeb->offset && je16_to_cpu(node->magic) == KSAMTIB_CIGAM_2SFFJ) { 6941da177e4SLinus Torvalds printk(KERN_WARNING "Magic bitmask is backwards at offset 0x%08x. Wrong endian filesystem?\n", ofs); 69568270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, 4))) 69668270995SDavid Woodhouse return err; 6971da177e4SLinus Torvalds ofs += 4; 6981da177e4SLinus Torvalds continue; 6991da177e4SLinus Torvalds } 7001da177e4SLinus Torvalds if (je16_to_cpu(node->magic) == JFFS2_DIRTY_BITMASK) { 7011da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Dirty bitmask at 0x%08x\n", ofs)); 70268270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, 4))) 70368270995SDavid Woodhouse return err; 7041da177e4SLinus Torvalds ofs += 4; 7051da177e4SLinus Torvalds continue; 7061da177e4SLinus Torvalds } 7071da177e4SLinus Torvalds if (je16_to_cpu(node->magic) == JFFS2_OLD_MAGIC_BITMASK) { 7081da177e4SLinus Torvalds printk(KERN_WARNING "Old JFFS2 bitmask found at 0x%08x\n", ofs); 7091da177e4SLinus Torvalds printk(KERN_WARNING "You cannot use older JFFS2 filesystems with newer kernels\n"); 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 if (je16_to_cpu(node->magic) != JFFS2_MAGIC_BITMASK) { 7161da177e4SLinus Torvalds /* OK. We're out of possibilities. Whinge and move on */ 7171da177e4SLinus Torvalds noisy_printk(&noise, "jffs2_scan_eraseblock(): Magic bitmask 0x%04x not found at 0x%08x: 0x%04x instead\n", 7181da177e4SLinus Torvalds JFFS2_MAGIC_BITMASK, ofs, 7191da177e4SLinus Torvalds je16_to_cpu(node->magic)); 72068270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, 4))) 72168270995SDavid Woodhouse return err; 7221da177e4SLinus Torvalds ofs += 4; 7231da177e4SLinus Torvalds continue; 7241da177e4SLinus Torvalds } 7251da177e4SLinus Torvalds /* We seem to have a node of sorts. Check the CRC */ 7261da177e4SLinus Torvalds crcnode.magic = node->magic; 7271da177e4SLinus Torvalds crcnode.nodetype = cpu_to_je16( je16_to_cpu(node->nodetype) | JFFS2_NODE_ACCURATE); 7281da177e4SLinus Torvalds crcnode.totlen = node->totlen; 7291da177e4SLinus Torvalds hdr_crc = crc32(0, &crcnode, sizeof(crcnode)-4); 7301da177e4SLinus Torvalds 7311da177e4SLinus Torvalds if (hdr_crc != je32_to_cpu(node->hdr_crc)) { 7321da177e4SLinus 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", 7331da177e4SLinus Torvalds ofs, je16_to_cpu(node->magic), 7341da177e4SLinus Torvalds je16_to_cpu(node->nodetype), 7351da177e4SLinus Torvalds je32_to_cpu(node->totlen), 7361da177e4SLinus Torvalds je32_to_cpu(node->hdr_crc), 7371da177e4SLinus Torvalds hdr_crc); 73868270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, 4))) 73968270995SDavid Woodhouse return err; 7401da177e4SLinus Torvalds ofs += 4; 7411da177e4SLinus Torvalds continue; 7421da177e4SLinus Torvalds } 7431da177e4SLinus Torvalds 7440dec4c8bSJoakim Tjernlund if (ofs + je32_to_cpu(node->totlen) > jeb->offset + c->sector_size) { 7451da177e4SLinus Torvalds /* Eep. Node goes over the end of the erase block. */ 7461da177e4SLinus Torvalds printk(KERN_WARNING "Node at 0x%08x with length 0x%08x would run over the end of the erase block\n", 7471da177e4SLinus Torvalds ofs, je32_to_cpu(node->totlen)); 7481da177e4SLinus Torvalds printk(KERN_WARNING "Perhaps the file system was created with the wrong erase size?\n"); 74968270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, 4))) 75068270995SDavid Woodhouse return err; 7511da177e4SLinus Torvalds ofs += 4; 7521da177e4SLinus Torvalds continue; 7531da177e4SLinus Torvalds } 7541da177e4SLinus Torvalds 7551da177e4SLinus Torvalds if (!(je16_to_cpu(node->nodetype) & JFFS2_NODE_ACCURATE)) { 7561da177e4SLinus Torvalds /* Wheee. This is an obsoleted node */ 7571da177e4SLinus Torvalds D2(printk(KERN_DEBUG "Node at 0x%08x is obsolete. Skipping\n", ofs)); 75868270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(node->totlen))))) 75968270995SDavid Woodhouse return err; 7601da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 7611da177e4SLinus Torvalds continue; 7621da177e4SLinus Torvalds } 7631da177e4SLinus Torvalds 7641da177e4SLinus Torvalds switch(je16_to_cpu(node->nodetype)) { 7651da177e4SLinus Torvalds case JFFS2_NODETYPE_INODE: 7661da177e4SLinus Torvalds if (buf_ofs + buf_len < ofs + sizeof(struct jffs2_raw_inode)) { 7671da177e4SLinus Torvalds buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); 7681da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Fewer than %zd bytes (inode node) left to end of buf. Reading 0x%x at 0x%08x\n", 7691da177e4SLinus Torvalds sizeof(struct jffs2_raw_inode), buf_len, ofs)); 7701da177e4SLinus Torvalds err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); 7711da177e4SLinus Torvalds if (err) 7721da177e4SLinus Torvalds return err; 7731da177e4SLinus Torvalds buf_ofs = ofs; 7741da177e4SLinus Torvalds node = (void *)buf; 7751da177e4SLinus Torvalds } 776e631ddbaSFerenc Havasi err = jffs2_scan_inode_node(c, jeb, (void *)node, ofs, s); 7771da177e4SLinus Torvalds if (err) return err; 7781da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 7791da177e4SLinus Torvalds break; 7801da177e4SLinus Torvalds 7811da177e4SLinus Torvalds case JFFS2_NODETYPE_DIRENT: 7821da177e4SLinus Torvalds if (buf_ofs + buf_len < ofs + je32_to_cpu(node->totlen)) { 7831da177e4SLinus Torvalds buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); 7841da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Fewer than %d bytes (dirent node) left to end of buf. Reading 0x%x at 0x%08x\n", 7851da177e4SLinus Torvalds je32_to_cpu(node->totlen), buf_len, ofs)); 7861da177e4SLinus Torvalds err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); 7871da177e4SLinus Torvalds if (err) 7881da177e4SLinus Torvalds return err; 7891da177e4SLinus Torvalds buf_ofs = ofs; 7901da177e4SLinus Torvalds node = (void *)buf; 7911da177e4SLinus Torvalds } 792e631ddbaSFerenc Havasi err = jffs2_scan_dirent_node(c, jeb, (void *)node, ofs, s); 7931da177e4SLinus Torvalds if (err) return err; 7941da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 7951da177e4SLinus Torvalds break; 7961da177e4SLinus Torvalds 797aa98d7cfSKaiGai Kohei #ifdef CONFIG_JFFS2_FS_XATTR 798aa98d7cfSKaiGai Kohei case JFFS2_NODETYPE_XATTR: 799aa98d7cfSKaiGai Kohei if (buf_ofs + buf_len < ofs + je32_to_cpu(node->totlen)) { 800aa98d7cfSKaiGai Kohei buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); 801aa98d7cfSKaiGai Kohei D1(printk(KERN_DEBUG "Fewer than %d bytes (xattr node)" 802aa98d7cfSKaiGai Kohei " left to end of buf. Reading 0x%x at 0x%08x\n", 803aa98d7cfSKaiGai Kohei je32_to_cpu(node->totlen), buf_len, ofs)); 804aa98d7cfSKaiGai Kohei err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); 805aa98d7cfSKaiGai Kohei if (err) 806aa98d7cfSKaiGai Kohei return err; 807aa98d7cfSKaiGai Kohei buf_ofs = ofs; 808aa98d7cfSKaiGai Kohei node = (void *)buf; 809aa98d7cfSKaiGai Kohei } 810aa98d7cfSKaiGai Kohei err = jffs2_scan_xattr_node(c, jeb, (void *)node, ofs, s); 811aa98d7cfSKaiGai Kohei if (err) 812aa98d7cfSKaiGai Kohei return err; 813aa98d7cfSKaiGai Kohei ofs += PAD(je32_to_cpu(node->totlen)); 814aa98d7cfSKaiGai Kohei break; 815aa98d7cfSKaiGai Kohei case JFFS2_NODETYPE_XREF: 816aa98d7cfSKaiGai Kohei if (buf_ofs + buf_len < ofs + je32_to_cpu(node->totlen)) { 817aa98d7cfSKaiGai Kohei buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); 818aa98d7cfSKaiGai Kohei D1(printk(KERN_DEBUG "Fewer than %d bytes (xref node)" 819aa98d7cfSKaiGai Kohei " left to end of buf. Reading 0x%x at 0x%08x\n", 820aa98d7cfSKaiGai Kohei je32_to_cpu(node->totlen), buf_len, ofs)); 821aa98d7cfSKaiGai Kohei err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); 822aa98d7cfSKaiGai Kohei if (err) 823aa98d7cfSKaiGai Kohei return err; 824aa98d7cfSKaiGai Kohei buf_ofs = ofs; 825aa98d7cfSKaiGai Kohei node = (void *)buf; 826aa98d7cfSKaiGai Kohei } 827aa98d7cfSKaiGai Kohei err = jffs2_scan_xref_node(c, jeb, (void *)node, ofs, s); 828aa98d7cfSKaiGai Kohei if (err) 829aa98d7cfSKaiGai Kohei return err; 830aa98d7cfSKaiGai Kohei ofs += PAD(je32_to_cpu(node->totlen)); 831aa98d7cfSKaiGai Kohei break; 832aa98d7cfSKaiGai Kohei #endif /* CONFIG_JFFS2_FS_XATTR */ 833aa98d7cfSKaiGai Kohei 8341da177e4SLinus Torvalds case JFFS2_NODETYPE_CLEANMARKER: 8351da177e4SLinus Torvalds D1(printk(KERN_DEBUG "CLEANMARKER node found at 0x%08x\n", ofs)); 8361da177e4SLinus Torvalds if (je32_to_cpu(node->totlen) != c->cleanmarker_size) { 8371da177e4SLinus Torvalds printk(KERN_NOTICE "CLEANMARKER node found at 0x%08x has totlen 0x%x != normal 0x%x\n", 8381da177e4SLinus Torvalds ofs, je32_to_cpu(node->totlen), c->cleanmarker_size); 83968270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, PAD(sizeof(struct jffs2_unknown_node))))) 84068270995SDavid Woodhouse return err; 8411da177e4SLinus Torvalds ofs += PAD(sizeof(struct jffs2_unknown_node)); 8421da177e4SLinus Torvalds } else if (jeb->first_node) { 8431da177e4SLinus Torvalds printk(KERN_NOTICE "CLEANMARKER node found at 0x%08x, not first node in block (0x%08x)\n", ofs, jeb->offset); 84468270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, PAD(sizeof(struct jffs2_unknown_node))))) 84568270995SDavid Woodhouse return err; 8461da177e4SLinus Torvalds ofs += PAD(sizeof(struct jffs2_unknown_node)); 8471da177e4SLinus Torvalds } else { 8482f785402SDavid Woodhouse jffs2_link_node_ref(c, jeb, ofs | REF_NORMAL, c->cleanmarker_size, NULL); 849f1f9671bSDavid Woodhouse 8501da177e4SLinus Torvalds ofs += PAD(c->cleanmarker_size); 8511da177e4SLinus Torvalds } 8521da177e4SLinus Torvalds break; 8531da177e4SLinus Torvalds 8541da177e4SLinus Torvalds case JFFS2_NODETYPE_PADDING: 855e631ddbaSFerenc Havasi if (jffs2_sum_active()) 856e631ddbaSFerenc Havasi jffs2_sum_add_padding_mem(s, je32_to_cpu(node->totlen)); 85768270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(node->totlen))))) 85868270995SDavid Woodhouse return err; 8591da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 8601da177e4SLinus Torvalds break; 8611da177e4SLinus Torvalds 8621da177e4SLinus Torvalds default: 8631da177e4SLinus Torvalds switch (je16_to_cpu(node->nodetype) & JFFS2_COMPAT_MASK) { 8641da177e4SLinus Torvalds case JFFS2_FEATURE_ROCOMPAT: 8651da177e4SLinus Torvalds printk(KERN_NOTICE "Read-only compatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs); 8661da177e4SLinus Torvalds c->flags |= JFFS2_SB_FLAG_RO; 8671da177e4SLinus Torvalds if (!(jffs2_is_readonly(c))) 8681da177e4SLinus Torvalds return -EROFS; 86968270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(node->totlen))))) 87068270995SDavid Woodhouse return err; 8711da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 8721da177e4SLinus Torvalds break; 8731da177e4SLinus Torvalds 8741da177e4SLinus Torvalds case JFFS2_FEATURE_INCOMPAT: 8751da177e4SLinus Torvalds printk(KERN_NOTICE "Incompatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs); 8761da177e4SLinus Torvalds return -EINVAL; 8771da177e4SLinus Torvalds 8781da177e4SLinus Torvalds case JFFS2_FEATURE_RWCOMPAT_DELETE: 8791da177e4SLinus Torvalds D1(printk(KERN_NOTICE "Unknown but compatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs)); 88068270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(node->totlen))))) 88168270995SDavid Woodhouse return err; 8821da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 8831da177e4SLinus Torvalds break; 8841da177e4SLinus Torvalds 8856171586aSDavid Woodhouse case JFFS2_FEATURE_RWCOMPAT_COPY: { 8861da177e4SLinus Torvalds D1(printk(KERN_NOTICE "Unknown but compatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs)); 8876171586aSDavid Woodhouse 8882f785402SDavid Woodhouse jffs2_link_node_ref(c, jeb, ofs | REF_PRISTINE, PAD(je32_to_cpu(node->totlen)), NULL); 8896171586aSDavid Woodhouse 8906171586aSDavid Woodhouse /* We can't summarise nodes we don't grok */ 8916171586aSDavid Woodhouse jffs2_sum_disable_collecting(s); 8921da177e4SLinus Torvalds ofs += PAD(je32_to_cpu(node->totlen)); 8931da177e4SLinus Torvalds break; 8941da177e4SLinus Torvalds } 8951da177e4SLinus Torvalds } 8961da177e4SLinus Torvalds } 8976171586aSDavid Woodhouse } 8981da177e4SLinus Torvalds 899e631ddbaSFerenc Havasi if (jffs2_sum_active()) { 900e631ddbaSFerenc Havasi if (PAD(s->sum_size + JFFS2_SUMMARY_FRAME_SIZE) > jeb->free_size) { 901733802d9SArtem B. Bityutskiy dbg_summary("There is not enough space for " 902e631ddbaSFerenc Havasi "summary information, disabling for this jeb!\n"); 903e631ddbaSFerenc Havasi jffs2_sum_disable_collecting(s); 904e631ddbaSFerenc Havasi } 905e631ddbaSFerenc Havasi } 9061da177e4SLinus Torvalds 9078b9e9fe8SDavid 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", 9088b9e9fe8SDavid Woodhouse jeb->offset,jeb->free_size, jeb->dirty_size, jeb->unchecked_size, jeb->used_size, jeb->wasted_size)); 9091da177e4SLinus Torvalds 9101da177e4SLinus Torvalds /* mark_node_obsolete can add to wasted !! */ 9111da177e4SLinus Torvalds if (jeb->wasted_size) { 9121da177e4SLinus Torvalds jeb->dirty_size += jeb->wasted_size; 9131da177e4SLinus Torvalds c->dirty_size += jeb->wasted_size; 9141da177e4SLinus Torvalds c->wasted_size -= jeb->wasted_size; 9151da177e4SLinus Torvalds jeb->wasted_size = 0; 9161da177e4SLinus Torvalds } 9171da177e4SLinus Torvalds 918e631ddbaSFerenc Havasi return jffs2_scan_classify_jeb(c, jeb); 9191da177e4SLinus Torvalds } 9201da177e4SLinus Torvalds 921e631ddbaSFerenc Havasi struct jffs2_inode_cache *jffs2_scan_make_ino_cache(struct jffs2_sb_info *c, uint32_t ino) 9221da177e4SLinus Torvalds { 9231da177e4SLinus Torvalds struct jffs2_inode_cache *ic; 9241da177e4SLinus Torvalds 9251da177e4SLinus Torvalds ic = jffs2_get_ino_cache(c, ino); 9261da177e4SLinus Torvalds if (ic) 9271da177e4SLinus Torvalds return ic; 9281da177e4SLinus Torvalds 9291da177e4SLinus Torvalds if (ino > c->highest_ino) 9301da177e4SLinus Torvalds c->highest_ino = ino; 9311da177e4SLinus Torvalds 9321da177e4SLinus Torvalds ic = jffs2_alloc_inode_cache(); 9331da177e4SLinus Torvalds if (!ic) { 9341da177e4SLinus Torvalds printk(KERN_NOTICE "jffs2_scan_make_inode_cache(): allocation of inode cache failed\n"); 9351da177e4SLinus Torvalds return NULL; 9361da177e4SLinus Torvalds } 9371da177e4SLinus Torvalds memset(ic, 0, sizeof(*ic)); 9381da177e4SLinus Torvalds 9391da177e4SLinus Torvalds ic->ino = ino; 9401da177e4SLinus Torvalds ic->nodes = (void *)ic; 9411da177e4SLinus Torvalds jffs2_add_ino_cache(c, ic); 9421da177e4SLinus Torvalds if (ino == 1) 94327c72b04SDavid Woodhouse ic->pino_nlink = 1; 9441da177e4SLinus Torvalds return ic; 9451da177e4SLinus Torvalds } 9461da177e4SLinus Torvalds 9471da177e4SLinus Torvalds static int jffs2_scan_inode_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 948e631ddbaSFerenc Havasi struct jffs2_raw_inode *ri, uint32_t ofs, struct jffs2_summary *s) 9491da177e4SLinus Torvalds { 9501da177e4SLinus Torvalds struct jffs2_inode_cache *ic; 95153043002SThomas Gleixner uint32_t crc, ino = je32_to_cpu(ri->ino); 9521da177e4SLinus Torvalds 9531da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_scan_inode_node(): Node at 0x%08x\n", ofs)); 9541da177e4SLinus Torvalds 9551da177e4SLinus Torvalds /* We do very little here now. Just check the ino# to which we should attribute 9561da177e4SLinus Torvalds this node; we can do all the CRC checking etc. later. There's a tradeoff here -- 9571da177e4SLinus Torvalds we used to scan the flash once only, reading everything we want from it into 9581da177e4SLinus Torvalds memory, then building all our in-core data structures and freeing the extra 9591da177e4SLinus Torvalds information. Now we allow the first part of the mount to complete a lot quicker, 9601da177e4SLinus Torvalds but we have to go _back_ to the flash in order to finish the CRC checking, etc. 9611da177e4SLinus Torvalds Which means that the _full_ amount of time to get to proper write mode with GC 9621da177e4SLinus Torvalds operational may actually be _longer_ than before. Sucks to be me. */ 9631da177e4SLinus Torvalds 96453043002SThomas Gleixner /* Check the node CRC in any case. */ 96553043002SThomas Gleixner crc = crc32(0, ri, sizeof(*ri)-8); 96653043002SThomas Gleixner if (crc != je32_to_cpu(ri->node_crc)) { 96753043002SThomas Gleixner printk(KERN_NOTICE "jffs2_scan_inode_node(): CRC failed on " 96853043002SThomas Gleixner "node at 0x%08x: Read 0x%08x, calculated 0x%08x\n", 96953043002SThomas Gleixner ofs, je32_to_cpu(ri->node_crc), crc); 97053043002SThomas Gleixner /* 97153043002SThomas Gleixner * We believe totlen because the CRC on the node 97253043002SThomas Gleixner * _header_ was OK, just the node itself failed. 97353043002SThomas Gleixner */ 97453043002SThomas Gleixner return jffs2_scan_dirty_space(c, jeb, 97553043002SThomas Gleixner PAD(je32_to_cpu(ri->totlen))); 97653043002SThomas Gleixner } 97753043002SThomas Gleixner 9781da177e4SLinus Torvalds ic = jffs2_get_ino_cache(c, ino); 9791da177e4SLinus Torvalds if (!ic) { 9801da177e4SLinus Torvalds ic = jffs2_scan_make_ino_cache(c, ino); 9812f785402SDavid Woodhouse if (!ic) 9821da177e4SLinus Torvalds return -ENOMEM; 9831da177e4SLinus Torvalds } 9841da177e4SLinus Torvalds 9851da177e4SLinus Torvalds /* Wheee. It worked */ 9862f785402SDavid Woodhouse jffs2_link_node_ref(c, jeb, ofs | REF_UNCHECKED, PAD(je32_to_cpu(ri->totlen)), ic); 9871da177e4SLinus Torvalds 9881da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Node is ino #%u, version %d. Range 0x%x-0x%x\n", 9891da177e4SLinus Torvalds je32_to_cpu(ri->ino), je32_to_cpu(ri->version), 9901da177e4SLinus Torvalds je32_to_cpu(ri->offset), 9911da177e4SLinus Torvalds je32_to_cpu(ri->offset)+je32_to_cpu(ri->dsize))); 9921da177e4SLinus Torvalds 9931da177e4SLinus Torvalds pseudo_random += je32_to_cpu(ri->version); 9941da177e4SLinus Torvalds 995e631ddbaSFerenc Havasi if (jffs2_sum_active()) { 996e631ddbaSFerenc Havasi jffs2_sum_add_inode_mem(s, ri, ofs - jeb->offset); 997e631ddbaSFerenc Havasi } 998e631ddbaSFerenc Havasi 9991da177e4SLinus Torvalds return 0; 10001da177e4SLinus Torvalds } 10011da177e4SLinus Torvalds 10021da177e4SLinus Torvalds static int jffs2_scan_dirent_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 1003e631ddbaSFerenc Havasi struct jffs2_raw_dirent *rd, uint32_t ofs, struct jffs2_summary *s) 10041da177e4SLinus Torvalds { 10051da177e4SLinus Torvalds struct jffs2_full_dirent *fd; 10061da177e4SLinus Torvalds struct jffs2_inode_cache *ic; 1007b534e70cSDavid Woodhouse uint32_t checkedlen; 10081da177e4SLinus Torvalds uint32_t crc; 100968270995SDavid Woodhouse int err; 10101da177e4SLinus Torvalds 10111da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_scan_dirent_node(): Node at 0x%08x\n", ofs)); 10121da177e4SLinus Torvalds 10131da177e4SLinus Torvalds /* We don't get here unless the node is still valid, so we don't have to 10141da177e4SLinus Torvalds mask in the ACCURATE bit any more. */ 10151da177e4SLinus Torvalds crc = crc32(0, rd, sizeof(*rd)-8); 10161da177e4SLinus Torvalds 10171da177e4SLinus Torvalds if (crc != je32_to_cpu(rd->node_crc)) { 10181da177e4SLinus Torvalds printk(KERN_NOTICE "jffs2_scan_dirent_node(): Node CRC failed on node at 0x%08x: Read 0x%08x, calculated 0x%08x\n", 10191da177e4SLinus Torvalds ofs, je32_to_cpu(rd->node_crc), crc); 10201da177e4SLinus Torvalds /* We believe totlen because the CRC on the node _header_ was OK, just the node itself failed. */ 102168270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(rd->totlen))))) 102268270995SDavid Woodhouse return err; 10231da177e4SLinus Torvalds return 0; 10241da177e4SLinus Torvalds } 10251da177e4SLinus Torvalds 10261da177e4SLinus Torvalds pseudo_random += je32_to_cpu(rd->version); 10271da177e4SLinus Torvalds 1028b534e70cSDavid Woodhouse /* Should never happen. Did. (OLPC trac #4184)*/ 1029b534e70cSDavid Woodhouse checkedlen = strnlen(rd->name, rd->nsize); 1030b534e70cSDavid Woodhouse if (checkedlen < rd->nsize) { 1031b534e70cSDavid Woodhouse printk(KERN_ERR "Dirent at %08x has zeroes in name. Truncating to %d chars\n", 1032b534e70cSDavid Woodhouse ofs, checkedlen); 1033b534e70cSDavid Woodhouse } 1034b534e70cSDavid Woodhouse fd = jffs2_alloc_full_dirent(checkedlen+1); 10351da177e4SLinus Torvalds if (!fd) { 10361da177e4SLinus Torvalds return -ENOMEM; 10371da177e4SLinus Torvalds } 1038b534e70cSDavid Woodhouse memcpy(&fd->name, rd->name, checkedlen); 1039b534e70cSDavid Woodhouse fd->name[checkedlen] = 0; 10401da177e4SLinus Torvalds 10411da177e4SLinus Torvalds crc = crc32(0, fd->name, rd->nsize); 10421da177e4SLinus Torvalds if (crc != je32_to_cpu(rd->name_crc)) { 10431da177e4SLinus Torvalds printk(KERN_NOTICE "jffs2_scan_dirent_node(): Name CRC failed on node at 0x%08x: Read 0x%08x, calculated 0x%08x\n", 10441da177e4SLinus Torvalds ofs, je32_to_cpu(rd->name_crc), crc); 10451da177e4SLinus Torvalds D1(printk(KERN_NOTICE "Name for which CRC failed is (now) '%s', ino #%d\n", fd->name, je32_to_cpu(rd->ino))); 10461da177e4SLinus Torvalds jffs2_free_full_dirent(fd); 10471da177e4SLinus Torvalds /* FIXME: Why do we believe totlen? */ 10481da177e4SLinus Torvalds /* We believe totlen because the CRC on the node _header_ was OK, just the name failed. */ 104968270995SDavid Woodhouse if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(rd->totlen))))) 105068270995SDavid Woodhouse return err; 10511da177e4SLinus Torvalds return 0; 10521da177e4SLinus Torvalds } 10531da177e4SLinus Torvalds ic = jffs2_scan_make_ino_cache(c, je32_to_cpu(rd->pino)); 10541da177e4SLinus Torvalds if (!ic) { 10551da177e4SLinus Torvalds jffs2_free_full_dirent(fd); 10561da177e4SLinus Torvalds return -ENOMEM; 10571da177e4SLinus Torvalds } 10581da177e4SLinus Torvalds 105943dfa07fSDavid Woodhouse fd->raw = jffs2_link_node_ref(c, jeb, ofs | dirent_node_state(rd), 106043dfa07fSDavid Woodhouse PAD(je32_to_cpu(rd->totlen)), ic); 10611da177e4SLinus Torvalds 10621da177e4SLinus Torvalds fd->next = NULL; 10631da177e4SLinus Torvalds fd->version = je32_to_cpu(rd->version); 10641da177e4SLinus Torvalds fd->ino = je32_to_cpu(rd->ino); 1065b534e70cSDavid Woodhouse fd->nhash = full_name_hash(fd->name, checkedlen); 10661da177e4SLinus Torvalds fd->type = rd->type; 10671da177e4SLinus Torvalds jffs2_add_fd_to_list(c, fd, &ic->scan_dents); 10681da177e4SLinus Torvalds 1069e631ddbaSFerenc Havasi if (jffs2_sum_active()) { 1070e631ddbaSFerenc Havasi jffs2_sum_add_dirent_mem(s, rd, ofs - jeb->offset); 1071e631ddbaSFerenc Havasi } 1072e631ddbaSFerenc Havasi 10731da177e4SLinus Torvalds return 0; 10741da177e4SLinus Torvalds } 10751da177e4SLinus Torvalds 10761da177e4SLinus Torvalds static int count_list(struct list_head *l) 10771da177e4SLinus Torvalds { 10781da177e4SLinus Torvalds uint32_t count = 0; 10791da177e4SLinus Torvalds struct list_head *tmp; 10801da177e4SLinus Torvalds 10811da177e4SLinus Torvalds list_for_each(tmp, l) { 10821da177e4SLinus Torvalds count++; 10831da177e4SLinus Torvalds } 10841da177e4SLinus Torvalds return count; 10851da177e4SLinus Torvalds } 10861da177e4SLinus Torvalds 10871da177e4SLinus Torvalds /* Note: This breaks if list_empty(head). I don't care. You 10881da177e4SLinus Torvalds might, if you copy this code and use it elsewhere :) */ 10891da177e4SLinus Torvalds static void rotate_list(struct list_head *head, uint32_t count) 10901da177e4SLinus Torvalds { 10911da177e4SLinus Torvalds struct list_head *n = head->next; 10921da177e4SLinus Torvalds 10931da177e4SLinus Torvalds list_del(head); 10941da177e4SLinus Torvalds while(count--) { 10951da177e4SLinus Torvalds n = n->next; 10961da177e4SLinus Torvalds } 10971da177e4SLinus Torvalds list_add(head, n); 10981da177e4SLinus Torvalds } 10991da177e4SLinus Torvalds 11001da177e4SLinus Torvalds void jffs2_rotate_lists(struct jffs2_sb_info *c) 11011da177e4SLinus Torvalds { 11021da177e4SLinus Torvalds uint32_t x; 11031da177e4SLinus Torvalds uint32_t rotateby; 11041da177e4SLinus Torvalds 11051da177e4SLinus Torvalds x = count_list(&c->clean_list); 11061da177e4SLinus Torvalds if (x) { 11071da177e4SLinus Torvalds rotateby = pseudo_random % x; 11081da177e4SLinus Torvalds rotate_list((&c->clean_list), rotateby); 11091da177e4SLinus Torvalds } 11101da177e4SLinus Torvalds 11111da177e4SLinus Torvalds x = count_list(&c->very_dirty_list); 11121da177e4SLinus Torvalds if (x) { 11131da177e4SLinus Torvalds rotateby = pseudo_random % x; 11141da177e4SLinus Torvalds rotate_list((&c->very_dirty_list), rotateby); 11151da177e4SLinus Torvalds } 11161da177e4SLinus Torvalds 11171da177e4SLinus Torvalds x = count_list(&c->dirty_list); 11181da177e4SLinus Torvalds if (x) { 11191da177e4SLinus Torvalds rotateby = pseudo_random % x; 11201da177e4SLinus Torvalds rotate_list((&c->dirty_list), rotateby); 11211da177e4SLinus Torvalds } 11221da177e4SLinus Torvalds 11231da177e4SLinus Torvalds x = count_list(&c->erasable_list); 11241da177e4SLinus Torvalds if (x) { 11251da177e4SLinus Torvalds rotateby = pseudo_random % x; 11261da177e4SLinus Torvalds rotate_list((&c->erasable_list), rotateby); 11271da177e4SLinus Torvalds } 11281da177e4SLinus Torvalds 11291da177e4SLinus Torvalds if (c->nr_erasing_blocks) { 11301da177e4SLinus Torvalds rotateby = pseudo_random % c->nr_erasing_blocks; 11311da177e4SLinus Torvalds rotate_list((&c->erase_pending_list), rotateby); 11321da177e4SLinus Torvalds } 11331da177e4SLinus Torvalds 11341da177e4SLinus Torvalds if (c->nr_free_blocks) { 11351da177e4SLinus Torvalds rotateby = pseudo_random % c->nr_free_blocks; 11361da177e4SLinus Torvalds rotate_list((&c->free_list), rotateby); 11371da177e4SLinus Torvalds } 11381da177e4SLinus Torvalds } 1139