Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1 | /* |
| 2 | * JFFS2 -- Journalling Flash File System, Version 2. |
| 3 | * |
| 4 | * Copyright (C) 2001-2003 Red Hat, Inc. |
| 5 | * |
| 6 | * Created by David Woodhouse <dwmw2@infradead.org> |
| 7 | * |
| 8 | * For licensing information, see the file 'LICENCE' in this directory. |
| 9 | * |
Artem B. Bityutskiy | daba5cc | 2005-09-30 14:59:17 +0100 | [diff] [blame] | 10 | * $Id: scan.c,v 1.125 2005/09/30 13:59:13 dedekind Exp $ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 11 | * |
| 12 | */ |
| 13 | #include <linux/kernel.h> |
| 14 | #include <linux/sched.h> |
| 15 | #include <linux/slab.h> |
| 16 | #include <linux/mtd/mtd.h> |
| 17 | #include <linux/pagemap.h> |
| 18 | #include <linux/crc32.h> |
| 19 | #include <linux/compiler.h> |
| 20 | #include "nodelist.h" |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 21 | #include "summary.h" |
| 22 | #include "debug.h" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 23 | |
Andrew Victor | 3be3667 | 2005-02-09 09:09:05 +0000 | [diff] [blame] | 24 | #define DEFAULT_EMPTY_SCAN_SIZE 1024 |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 25 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 26 | #define noisy_printk(noise, args...) do { \ |
| 27 | if (*(noise)) { \ |
| 28 | printk(KERN_NOTICE args); \ |
| 29 | (*(noise))--; \ |
| 30 | if (!(*(noise))) { \ |
| 31 | printk(KERN_NOTICE "Further such events for this erase block will not be printed\n"); \ |
| 32 | } \ |
| 33 | } \ |
| 34 | } while(0) |
| 35 | |
| 36 | static uint32_t pseudo_random; |
| 37 | |
| 38 | static int jffs2_scan_eraseblock (struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 39 | unsigned char *buf, uint32_t buf_size, struct jffs2_summary *s); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 40 | |
Thomas Gleixner | 182ec4e | 2005-11-07 11:16:07 +0000 | [diff] [blame] | 41 | /* These helper functions _must_ increase ofs and also do the dirty/used space accounting. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 42 | * Returning an error will abort the mount - bad checksums etc. should just mark the space |
| 43 | * as dirty. |
| 44 | */ |
Thomas Gleixner | 182ec4e | 2005-11-07 11:16:07 +0000 | [diff] [blame] | 45 | static int jffs2_scan_inode_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 46 | struct jffs2_raw_inode *ri, uint32_t ofs, struct jffs2_summary *s); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 47 | static int jffs2_scan_dirent_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 48 | struct jffs2_raw_dirent *rd, uint32_t ofs, struct jffs2_summary *s); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 49 | |
| 50 | static inline int min_free(struct jffs2_sb_info *c) |
| 51 | { |
| 52 | uint32_t min = 2 * sizeof(struct jffs2_raw_inode); |
Andrew Victor | 2f82ce1 | 2005-02-09 09:24:26 +0000 | [diff] [blame] | 53 | #ifdef CONFIG_JFFS2_FS_WRITEBUFFER |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 54 | if (!jffs2_can_mark_obsolete(c) && min < c->wbuf_pagesize) |
| 55 | return c->wbuf_pagesize; |
| 56 | #endif |
| 57 | return min; |
| 58 | |
| 59 | } |
Andrew Victor | 3be3667 | 2005-02-09 09:09:05 +0000 | [diff] [blame] | 60 | |
| 61 | static inline uint32_t EMPTY_SCAN_SIZE(uint32_t sector_size) { |
| 62 | if (sector_size < DEFAULT_EMPTY_SCAN_SIZE) |
| 63 | return sector_size; |
| 64 | else |
| 65 | return DEFAULT_EMPTY_SCAN_SIZE; |
| 66 | } |
| 67 | |
David Woodhouse | 25090a6 | 2006-05-21 03:57:56 +0100 | [diff] [blame] | 68 | static int file_dirty(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb) |
| 69 | { |
David Woodhouse | a6a8bef | 2006-05-29 00:41:11 +0100 | [diff] [blame] | 70 | int ret; |
| 71 | |
| 72 | if ((ret = jffs2_prealloc_raw_node_refs(c, jeb, 1))) |
| 73 | return ret; |
| 74 | if ((ret = jffs2_scan_dirty_space(c, jeb, jeb->free_size))) |
David Woodhouse | 25090a6 | 2006-05-21 03:57:56 +0100 | [diff] [blame] | 75 | return ret; |
| 76 | /* Turned wasted size into dirty, since we apparently |
| 77 | think it's recoverable now. */ |
| 78 | jeb->dirty_size += jeb->wasted_size; |
| 79 | c->dirty_size += jeb->wasted_size; |
| 80 | c->wasted_size -= jeb->wasted_size; |
| 81 | jeb->wasted_size = 0; |
| 82 | if (VERYDIRTY(c, jeb->dirty_size)) { |
| 83 | list_add(&jeb->list, &c->very_dirty_list); |
| 84 | } else { |
| 85 | list_add(&jeb->list, &c->dirty_list); |
| 86 | } |
| 87 | return 0; |
| 88 | } |
| 89 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 90 | int jffs2_scan_medium(struct jffs2_sb_info *c) |
| 91 | { |
| 92 | int i, ret; |
| 93 | uint32_t empty_blocks = 0, bad_blocks = 0; |
| 94 | unsigned char *flashbuf = NULL; |
| 95 | uint32_t buf_size = 0; |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 96 | struct jffs2_summary *s = NULL; /* summary info collected by the scan process */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 97 | #ifndef __ECOS |
| 98 | size_t pointlen; |
| 99 | |
| 100 | if (c->mtd->point) { |
| 101 | ret = c->mtd->point (c->mtd, 0, c->mtd->size, &pointlen, &flashbuf); |
| 102 | if (!ret && pointlen < c->mtd->size) { |
| 103 | /* Don't muck about if it won't let us point to the whole flash */ |
| 104 | D1(printk(KERN_DEBUG "MTD point returned len too short: 0x%zx\n", pointlen)); |
| 105 | c->mtd->unpoint(c->mtd, flashbuf, 0, c->mtd->size); |
| 106 | flashbuf = NULL; |
| 107 | } |
| 108 | if (ret) |
| 109 | D1(printk(KERN_DEBUG "MTD point failed %d\n", ret)); |
| 110 | } |
| 111 | #endif |
| 112 | if (!flashbuf) { |
| 113 | /* For NAND it's quicker to read a whole eraseblock at a time, |
| 114 | apparently */ |
| 115 | if (jffs2_cleanmarker_oob(c)) |
| 116 | buf_size = c->sector_size; |
| 117 | else |
| 118 | buf_size = PAGE_SIZE; |
| 119 | |
| 120 | /* Respect kmalloc limitations */ |
| 121 | if (buf_size > 128*1024) |
| 122 | buf_size = 128*1024; |
| 123 | |
| 124 | D1(printk(KERN_DEBUG "Allocating readbuf of %d bytes\n", buf_size)); |
| 125 | flashbuf = kmalloc(buf_size, GFP_KERNEL); |
| 126 | if (!flashbuf) |
| 127 | return -ENOMEM; |
| 128 | } |
| 129 | |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 130 | if (jffs2_sum_active()) { |
Yan Burman | 3d375d9 | 2006-12-04 15:03:01 -0800 | [diff] [blame] | 131 | s = kzalloc(sizeof(struct jffs2_summary), GFP_KERNEL); |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 132 | if (!s) { |
| 133 | JFFS2_WARNING("Can't allocate memory for summary\n"); |
| 134 | return -ENOMEM; |
| 135 | } |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 136 | } |
| 137 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 138 | for (i=0; i<c->nr_blocks; i++) { |
| 139 | struct jffs2_eraseblock *jeb = &c->blocks[i]; |
| 140 | |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 141 | /* reset summary info for next eraseblock scan */ |
| 142 | jffs2_sum_reset_collected(s); |
| 143 | |
| 144 | ret = jffs2_scan_eraseblock(c, jeb, buf_size?flashbuf:(flashbuf+jeb->offset), |
| 145 | buf_size, s); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 146 | |
| 147 | if (ret < 0) |
| 148 | goto out; |
| 149 | |
Artem B. Bityutskiy | e0c8e42 | 2005-07-24 16:14:17 +0100 | [diff] [blame] | 150 | jffs2_dbg_acct_paranoia_check_nolock(c, jeb); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 151 | |
| 152 | /* Now decide which list to put it on */ |
| 153 | switch(ret) { |
| 154 | case BLK_STATE_ALLFF: |
Thomas Gleixner | 182ec4e | 2005-11-07 11:16:07 +0000 | [diff] [blame] | 155 | /* |
| 156 | * Empty block. Since we can't be sure it |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 157 | * was entirely erased, we just queue it for erase |
| 158 | * again. It will be marked as such when the erase |
| 159 | * is complete. Meanwhile we still count it as empty |
| 160 | * for later checks. |
| 161 | */ |
| 162 | empty_blocks++; |
| 163 | list_add(&jeb->list, &c->erase_pending_list); |
| 164 | c->nr_erasing_blocks++; |
| 165 | break; |
| 166 | |
| 167 | case BLK_STATE_CLEANMARKER: |
| 168 | /* Only a CLEANMARKER node is valid */ |
| 169 | if (!jeb->dirty_size) { |
| 170 | /* It's actually free */ |
| 171 | list_add(&jeb->list, &c->free_list); |
| 172 | c->nr_free_blocks++; |
| 173 | } else { |
| 174 | /* Dirt */ |
| 175 | D1(printk(KERN_DEBUG "Adding all-dirty block at 0x%08x to erase_pending_list\n", jeb->offset)); |
| 176 | list_add(&jeb->list, &c->erase_pending_list); |
| 177 | c->nr_erasing_blocks++; |
| 178 | } |
| 179 | break; |
| 180 | |
| 181 | case BLK_STATE_CLEAN: |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 182 | /* Full (or almost full) of clean data. Clean list */ |
| 183 | list_add(&jeb->list, &c->clean_list); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 184 | break; |
| 185 | |
| 186 | case BLK_STATE_PARTDIRTY: |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 187 | /* Some data, but not full. Dirty list. */ |
| 188 | /* We want to remember the block with most free space |
| 189 | and stick it in the 'nextblock' position to start writing to it. */ |
| 190 | if (jeb->free_size > min_free(c) && |
| 191 | (!c->nextblock || c->nextblock->free_size < jeb->free_size)) { |
| 192 | /* Better candidate for the next writes to go to */ |
| 193 | if (c->nextblock) { |
David Woodhouse | 25090a6 | 2006-05-21 03:57:56 +0100 | [diff] [blame] | 194 | ret = file_dirty(c, c->nextblock); |
| 195 | if (ret) |
| 196 | return ret; |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 197 | /* deleting summary information of the old nextblock */ |
| 198 | jffs2_sum_reset_collected(c->summary); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 199 | } |
David Woodhouse | 25090a6 | 2006-05-21 03:57:56 +0100 | [diff] [blame] | 200 | /* update collected summary information for the current nextblock */ |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 201 | jffs2_sum_move_collected(c, s); |
| 202 | D1(printk(KERN_DEBUG "jffs2_scan_medium(): new nextblock = 0x%08x\n", jeb->offset)); |
| 203 | c->nextblock = jeb; |
| 204 | } else { |
David Woodhouse | 25090a6 | 2006-05-21 03:57:56 +0100 | [diff] [blame] | 205 | ret = file_dirty(c, jeb); |
| 206 | if (ret) |
| 207 | return ret; |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 208 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 209 | break; |
| 210 | |
| 211 | case BLK_STATE_ALLDIRTY: |
| 212 | /* Nothing valid - not even a clean marker. Needs erasing. */ |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 213 | /* For now we just put it on the erasing list. We'll start the erases later */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 214 | D1(printk(KERN_NOTICE "JFFS2: Erase block at 0x%08x is not formatted. It will be erased\n", jeb->offset)); |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 215 | list_add(&jeb->list, &c->erase_pending_list); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 216 | c->nr_erasing_blocks++; |
| 217 | break; |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 218 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 219 | case BLK_STATE_BADBLOCK: |
| 220 | D1(printk(KERN_NOTICE "JFFS2: Block at 0x%08x is bad\n", jeb->offset)); |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 221 | list_add(&jeb->list, &c->bad_list); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 222 | c->bad_size += c->sector_size; |
| 223 | c->free_size -= c->sector_size; |
| 224 | bad_blocks++; |
| 225 | break; |
| 226 | default: |
| 227 | printk(KERN_WARNING "jffs2_scan_medium(): unknown block state\n"); |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 228 | BUG(); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 229 | } |
| 230 | } |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 231 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 232 | /* Nextblock dirty is always seen as wasted, because we cannot recycle it now */ |
| 233 | if (c->nextblock && (c->nextblock->dirty_size)) { |
| 234 | c->nextblock->wasted_size += c->nextblock->dirty_size; |
| 235 | c->wasted_size += c->nextblock->dirty_size; |
| 236 | c->dirty_size -= c->nextblock->dirty_size; |
| 237 | c->nextblock->dirty_size = 0; |
| 238 | } |
Andrew Victor | 2f82ce1 | 2005-02-09 09:24:26 +0000 | [diff] [blame] | 239 | #ifdef CONFIG_JFFS2_FS_WRITEBUFFER |
David Woodhouse | e96fb23 | 2006-03-07 21:55:36 -0800 | [diff] [blame] | 240 | if (!jffs2_can_mark_obsolete(c) && c->wbuf_pagesize && c->nextblock && (c->nextblock->free_size % c->wbuf_pagesize)) { |
Thomas Gleixner | 182ec4e | 2005-11-07 11:16:07 +0000 | [diff] [blame] | 241 | /* If we're going to start writing into a block which already |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 242 | contains data, and the end of the data isn't page-aligned, |
| 243 | skip a little and align it. */ |
| 244 | |
Artem B. Bityutskiy | daba5cc | 2005-09-30 14:59:17 +0100 | [diff] [blame] | 245 | uint32_t skip = c->nextblock->free_size % c->wbuf_pagesize; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 246 | |
| 247 | D1(printk(KERN_DEBUG "jffs2_scan_medium(): Skipping %d bytes in nextblock to ensure page alignment\n", |
| 248 | skip)); |
David Woodhouse | 046b8b9 | 2006-05-25 01:50:35 +0100 | [diff] [blame] | 249 | jffs2_prealloc_raw_node_refs(c, c->nextblock, 1); |
David Woodhouse | f560928 | 2006-05-25 01:37:28 +0100 | [diff] [blame] | 250 | jffs2_scan_dirty_space(c, c->nextblock, skip); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 251 | } |
| 252 | #endif |
| 253 | if (c->nr_erasing_blocks) { |
Thomas Gleixner | 182ec4e | 2005-11-07 11:16:07 +0000 | [diff] [blame] | 254 | if ( !c->used_size && ((c->nr_free_blocks+empty_blocks+bad_blocks)!= c->nr_blocks || bad_blocks == c->nr_blocks) ) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 255 | printk(KERN_NOTICE "Cowardly refusing to erase blocks on filesystem with no valid JFFS2 nodes\n"); |
| 256 | printk(KERN_NOTICE "empty_blocks %d, bad_blocks %d, c->nr_blocks %d\n",empty_blocks,bad_blocks,c->nr_blocks); |
| 257 | ret = -EIO; |
| 258 | goto out; |
| 259 | } |
| 260 | jffs2_erase_pending_trigger(c); |
| 261 | } |
| 262 | ret = 0; |
| 263 | out: |
| 264 | if (buf_size) |
| 265 | kfree(flashbuf); |
| 266 | #ifndef __ECOS |
Thomas Gleixner | 182ec4e | 2005-11-07 11:16:07 +0000 | [diff] [blame] | 267 | else |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 268 | c->mtd->unpoint(c->mtd, flashbuf, 0, c->mtd->size); |
| 269 | #endif |
Florin Malita | 5b5ffbc | 2006-05-15 23:42:31 +0100 | [diff] [blame] | 270 | if (s) |
| 271 | kfree(s); |
| 272 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 273 | return ret; |
| 274 | } |
| 275 | |
Adrian Bunk | c05d52c | 2006-06-22 12:03:35 +0200 | [diff] [blame] | 276 | static int jffs2_fill_scan_buf(struct jffs2_sb_info *c, void *buf, |
| 277 | uint32_t ofs, uint32_t len) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 278 | { |
| 279 | int ret; |
| 280 | size_t retlen; |
| 281 | |
| 282 | ret = jffs2_flash_read(c, ofs, len, &retlen, buf); |
| 283 | if (ret) { |
| 284 | D1(printk(KERN_WARNING "mtd->read(0x%x bytes from 0x%x) returned %d\n", len, ofs, ret)); |
| 285 | return ret; |
| 286 | } |
| 287 | if (retlen < len) { |
| 288 | D1(printk(KERN_WARNING "Read at 0x%x gave only 0x%zx bytes\n", ofs, retlen)); |
| 289 | return -EIO; |
| 290 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 291 | return 0; |
| 292 | } |
| 293 | |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 294 | int jffs2_scan_classify_jeb(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb) |
| 295 | { |
| 296 | if ((jeb->used_size + jeb->unchecked_size) == PAD(c->cleanmarker_size) && !jeb->dirty_size |
David Woodhouse | 99988f7 | 2006-05-24 09:04:17 +0100 | [diff] [blame] | 297 | && (!jeb->first_node || !ref_next(jeb->first_node)) ) |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 298 | return BLK_STATE_CLEANMARKER; |
| 299 | |
| 300 | /* move blocks with max 4 byte dirty space to cleanlist */ |
| 301 | else if (!ISDIRTY(c->sector_size - (jeb->used_size + jeb->unchecked_size))) { |
| 302 | c->dirty_size -= jeb->dirty_size; |
| 303 | c->wasted_size += jeb->dirty_size; |
| 304 | jeb->wasted_size += jeb->dirty_size; |
| 305 | jeb->dirty_size = 0; |
| 306 | return BLK_STATE_CLEAN; |
| 307 | } else if (jeb->used_size || jeb->unchecked_size) |
| 308 | return BLK_STATE_PARTDIRTY; |
| 309 | else |
| 310 | return BLK_STATE_ALLDIRTY; |
| 311 | } |
| 312 | |
KaiGai Kohei | aa98d7c | 2006-05-13 15:09:47 +0900 | [diff] [blame] | 313 | #ifdef CONFIG_JFFS2_FS_XATTR |
| 314 | static int jffs2_scan_xattr_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, |
| 315 | struct jffs2_raw_xattr *rx, uint32_t ofs, |
| 316 | struct jffs2_summary *s) |
| 317 | { |
| 318 | struct jffs2_xattr_datum *xd; |
KaiGai Kohei | c9f700f | 2006-06-11 10:35:15 +0900 | [diff] [blame] | 319 | uint32_t xid, version, totlen, crc; |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 320 | int err; |
KaiGai Kohei | aa98d7c | 2006-05-13 15:09:47 +0900 | [diff] [blame] | 321 | |
| 322 | crc = crc32(0, rx, sizeof(struct jffs2_raw_xattr) - 4); |
| 323 | if (crc != je32_to_cpu(rx->node_crc)) { |
KaiGai Kohei | c9f700f | 2006-06-11 10:35:15 +0900 | [diff] [blame] | 324 | JFFS2_WARNING("node CRC failed at %#08x, read=%#08x, calc=%#08x\n", |
| 325 | ofs, je32_to_cpu(rx->node_crc), crc); |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 326 | if ((err = jffs2_scan_dirty_space(c, jeb, je32_to_cpu(rx->totlen)))) |
| 327 | return err; |
KaiGai Kohei | aa98d7c | 2006-05-13 15:09:47 +0900 | [diff] [blame] | 328 | return 0; |
| 329 | } |
| 330 | |
KaiGai Kohei | c9f700f | 2006-06-11 10:35:15 +0900 | [diff] [blame] | 331 | xid = je32_to_cpu(rx->xid); |
| 332 | version = je32_to_cpu(rx->version); |
| 333 | |
KaiGai Kohei | 8a13695 | 2006-06-24 09:14:13 +0900 | [diff] [blame] | 334 | totlen = PAD(sizeof(struct jffs2_raw_xattr) |
| 335 | + rx->name_len + 1 + je16_to_cpu(rx->value_len)); |
KaiGai Kohei | aa98d7c | 2006-05-13 15:09:47 +0900 | [diff] [blame] | 336 | if (totlen != je32_to_cpu(rx->totlen)) { |
| 337 | JFFS2_WARNING("node length mismatch at %#08x, read=%u, calc=%u\n", |
| 338 | ofs, je32_to_cpu(rx->totlen), totlen); |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 339 | if ((err = jffs2_scan_dirty_space(c, jeb, je32_to_cpu(rx->totlen)))) |
| 340 | return err; |
KaiGai Kohei | aa98d7c | 2006-05-13 15:09:47 +0900 | [diff] [blame] | 341 | return 0; |
| 342 | } |
| 343 | |
KaiGai Kohei | c9f700f | 2006-06-11 10:35:15 +0900 | [diff] [blame] | 344 | xd = jffs2_setup_xattr_datum(c, xid, version); |
| 345 | if (IS_ERR(xd)) |
KaiGai Kohei | aa98d7c | 2006-05-13 15:09:47 +0900 | [diff] [blame] | 346 | return PTR_ERR(xd); |
KaiGai Kohei | aa98d7c | 2006-05-13 15:09:47 +0900 | [diff] [blame] | 347 | |
KaiGai Kohei | c9f700f | 2006-06-11 10:35:15 +0900 | [diff] [blame] | 348 | if (xd->version > version) { |
| 349 | struct jffs2_raw_node_ref *raw |
| 350 | = jffs2_link_node_ref(c, jeb, ofs | REF_PRISTINE, totlen, NULL); |
| 351 | raw->next_in_ino = xd->node->next_in_ino; |
| 352 | xd->node->next_in_ino = raw; |
| 353 | } else { |
| 354 | xd->version = version; |
| 355 | xd->xprefix = rx->xprefix; |
| 356 | xd->name_len = rx->name_len; |
| 357 | xd->value_len = je16_to_cpu(rx->value_len); |
| 358 | xd->data_crc = je32_to_cpu(rx->data_crc); |
| 359 | |
| 360 | jffs2_link_node_ref(c, jeb, ofs | REF_PRISTINE, totlen, (void *)xd); |
| 361 | } |
David Woodhouse | f1f9671 | 2006-05-20 19:45:26 +0100 | [diff] [blame] | 362 | |
KaiGai Kohei | aa98d7c | 2006-05-13 15:09:47 +0900 | [diff] [blame] | 363 | if (jffs2_sum_active()) |
| 364 | jffs2_sum_add_xattr_mem(s, rx, ofs - jeb->offset); |
| 365 | dbg_xattr("scaning xdatum at %#08x (xid=%u, version=%u)\n", |
| 366 | ofs, xd->xid, xd->version); |
| 367 | return 0; |
| 368 | } |
| 369 | |
| 370 | static int jffs2_scan_xref_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, |
| 371 | struct jffs2_raw_xref *rr, uint32_t ofs, |
| 372 | struct jffs2_summary *s) |
| 373 | { |
| 374 | struct jffs2_xattr_ref *ref; |
KaiGai Kohei | aa98d7c | 2006-05-13 15:09:47 +0900 | [diff] [blame] | 375 | uint32_t crc; |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 376 | int err; |
KaiGai Kohei | aa98d7c | 2006-05-13 15:09:47 +0900 | [diff] [blame] | 377 | |
| 378 | crc = crc32(0, rr, sizeof(*rr) - 4); |
| 379 | if (crc != je32_to_cpu(rr->node_crc)) { |
KaiGai Kohei | c9f700f | 2006-06-11 10:35:15 +0900 | [diff] [blame] | 380 | JFFS2_WARNING("node CRC failed at %#08x, read=%#08x, calc=%#08x\n", |
| 381 | ofs, je32_to_cpu(rr->node_crc), crc); |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 382 | if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(rr->totlen))))) |
| 383 | return err; |
KaiGai Kohei | aa98d7c | 2006-05-13 15:09:47 +0900 | [diff] [blame] | 384 | return 0; |
| 385 | } |
| 386 | |
| 387 | if (PAD(sizeof(struct jffs2_raw_xref)) != je32_to_cpu(rr->totlen)) { |
David Woodhouse | 89291a9 | 2006-05-25 13:30:24 +0100 | [diff] [blame] | 388 | JFFS2_WARNING("node length mismatch at %#08x, read=%u, calc=%zd\n", |
KaiGai Kohei | aa98d7c | 2006-05-13 15:09:47 +0900 | [diff] [blame] | 389 | ofs, je32_to_cpu(rr->totlen), |
| 390 | PAD(sizeof(struct jffs2_raw_xref))); |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 391 | if ((err = jffs2_scan_dirty_space(c, jeb, je32_to_cpu(rr->totlen)))) |
| 392 | return err; |
KaiGai Kohei | aa98d7c | 2006-05-13 15:09:47 +0900 | [diff] [blame] | 393 | return 0; |
| 394 | } |
| 395 | |
| 396 | ref = jffs2_alloc_xattr_ref(); |
| 397 | if (!ref) |
| 398 | return -ENOMEM; |
| 399 | |
KaiGai Kohei | aa98d7c | 2006-05-13 15:09:47 +0900 | [diff] [blame] | 400 | /* BEFORE jffs2_build_xattr_subsystem() called, |
KaiGai Kohei | c9f700f | 2006-06-11 10:35:15 +0900 | [diff] [blame] | 401 | * and AFTER xattr_ref is marked as a dead xref, |
KaiGai Kohei | aa98d7c | 2006-05-13 15:09:47 +0900 | [diff] [blame] | 402 | * ref->xid is used to store 32bit xid, xd is not used |
| 403 | * ref->ino is used to store 32bit inode-number, ic is not used |
| 404 | * Thoes variables are declared as union, thus using those |
KaiGai Kohei | 8f2b6f4 | 2006-05-13 15:15:07 +0900 | [diff] [blame] | 405 | * are exclusive. In a similar way, ref->next is temporarily |
KaiGai Kohei | aa98d7c | 2006-05-13 15:09:47 +0900 | [diff] [blame] | 406 | * used to chain all xattr_ref object. It's re-chained to |
| 407 | * jffs2_inode_cache in jffs2_build_xattr_subsystem() correctly. |
| 408 | */ |
KaiGai Kohei | aa98d7c | 2006-05-13 15:09:47 +0900 | [diff] [blame] | 409 | ref->ino = je32_to_cpu(rr->ino); |
| 410 | ref->xid = je32_to_cpu(rr->xid); |
KaiGai Kohei | c9f700f | 2006-06-11 10:35:15 +0900 | [diff] [blame] | 411 | ref->xseqno = je32_to_cpu(rr->xseqno); |
| 412 | if (ref->xseqno > c->highest_xseqno) |
| 413 | c->highest_xseqno = (ref->xseqno & ~XREF_DELETE_MARKER); |
KaiGai Kohei | 8f2b6f4 | 2006-05-13 15:15:07 +0900 | [diff] [blame] | 414 | ref->next = c->xref_temp; |
| 415 | c->xref_temp = ref; |
KaiGai Kohei | aa98d7c | 2006-05-13 15:09:47 +0900 | [diff] [blame] | 416 | |
KaiGai Kohei | c9f700f | 2006-06-11 10:35:15 +0900 | [diff] [blame] | 417 | jffs2_link_node_ref(c, jeb, ofs | REF_PRISTINE, PAD(je32_to_cpu(rr->totlen)), (void *)ref); |
David Woodhouse | f1f9671 | 2006-05-20 19:45:26 +0100 | [diff] [blame] | 418 | |
KaiGai Kohei | aa98d7c | 2006-05-13 15:09:47 +0900 | [diff] [blame] | 419 | if (jffs2_sum_active()) |
| 420 | jffs2_sum_add_xref_mem(s, rr, ofs - jeb->offset); |
| 421 | dbg_xattr("scan xref at %#08x (xid=%u, ino=%u)\n", |
| 422 | ofs, ref->xid, ref->ino); |
| 423 | return 0; |
| 424 | } |
| 425 | #endif |
| 426 | |
David Woodhouse | 9641b78 | 2006-05-20 16:13:34 +0100 | [diff] [blame] | 427 | /* Called with 'buf_size == 0' if buf is in fact a pointer _directly_ into |
| 428 | the flash, XIP-style */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 429 | static int jffs2_scan_eraseblock (struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, |
David Woodhouse | 9641b78 | 2006-05-20 16:13:34 +0100 | [diff] [blame] | 430 | unsigned char *buf, uint32_t buf_size, struct jffs2_summary *s) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 431 | struct jffs2_unknown_node *node; |
| 432 | struct jffs2_unknown_node crcnode; |
| 433 | uint32_t ofs, prevofs; |
| 434 | uint32_t hdr_crc, buf_ofs, buf_len; |
| 435 | int err; |
| 436 | int noise = 0; |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 437 | |
| 438 | |
Andrew Victor | 2f82ce1 | 2005-02-09 09:24:26 +0000 | [diff] [blame] | 439 | #ifdef CONFIG_JFFS2_FS_WRITEBUFFER |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 440 | int cleanmarkerfound = 0; |
| 441 | #endif |
| 442 | |
| 443 | ofs = jeb->offset; |
| 444 | prevofs = jeb->offset - 1; |
| 445 | |
| 446 | D1(printk(KERN_DEBUG "jffs2_scan_eraseblock(): Scanning block at 0x%x\n", ofs)); |
| 447 | |
Andrew Victor | 2f82ce1 | 2005-02-09 09:24:26 +0000 | [diff] [blame] | 448 | #ifdef CONFIG_JFFS2_FS_WRITEBUFFER |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 449 | if (jffs2_cleanmarker_oob(c)) { |
| 450 | int ret = jffs2_check_nand_cleanmarker(c, jeb); |
| 451 | D2(printk(KERN_NOTICE "jffs_check_nand_cleanmarker returned %d\n",ret)); |
| 452 | /* Even if it's not found, we still scan to see |
| 453 | if the block is empty. We use this information |
| 454 | to decide whether to erase it or not. */ |
| 455 | switch (ret) { |
| 456 | case 0: cleanmarkerfound = 1; break; |
| 457 | case 1: break; |
| 458 | case 2: return BLK_STATE_BADBLOCK; |
| 459 | case 3: return BLK_STATE_ALLDIRTY; /* Block has failed to erase min. once */ |
| 460 | default: return ret; |
| 461 | } |
| 462 | } |
| 463 | #endif |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 464 | |
| 465 | if (jffs2_sum_active()) { |
David Woodhouse | 9641b78 | 2006-05-20 16:13:34 +0100 | [diff] [blame] | 466 | struct jffs2_sum_marker *sm; |
| 467 | void *sumptr = NULL; |
| 468 | uint32_t sumlen; |
| 469 | |
| 470 | if (!buf_size) { |
| 471 | /* XIP case. Just look, point at the summary if it's there */ |
David Woodhouse | 13ba42d | 2006-05-30 08:59:34 +0100 | [diff] [blame] | 472 | sm = (void *)buf + c->sector_size - sizeof(*sm); |
David Woodhouse | 9641b78 | 2006-05-20 16:13:34 +0100 | [diff] [blame] | 473 | if (je32_to_cpu(sm->magic) == JFFS2_SUM_MAGIC) { |
| 474 | sumptr = buf + je32_to_cpu(sm->offset); |
| 475 | sumlen = c->sector_size - je32_to_cpu(sm->offset); |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 476 | } |
David Woodhouse | 9641b78 | 2006-05-20 16:13:34 +0100 | [diff] [blame] | 477 | } else { |
| 478 | /* If NAND flash, read a whole page of it. Else just the end */ |
| 479 | if (c->wbuf_pagesize) |
| 480 | buf_len = c->wbuf_pagesize; |
| 481 | else |
| 482 | buf_len = sizeof(*sm); |
| 483 | |
| 484 | /* Read as much as we want into the _end_ of the preallocated buffer */ |
| 485 | err = jffs2_fill_scan_buf(c, buf + buf_size - buf_len, |
| 486 | jeb->offset + c->sector_size - buf_len, |
| 487 | buf_len); |
| 488 | if (err) |
| 489 | return err; |
| 490 | |
| 491 | sm = (void *)buf + buf_size - sizeof(*sm); |
| 492 | if (je32_to_cpu(sm->magic) == JFFS2_SUM_MAGIC) { |
| 493 | sumlen = c->sector_size - je32_to_cpu(sm->offset); |
| 494 | sumptr = buf + buf_size - sumlen; |
| 495 | |
| 496 | /* Now, make sure the summary itself is available */ |
| 497 | if (sumlen > buf_size) { |
| 498 | /* Need to kmalloc for this. */ |
| 499 | sumptr = kmalloc(sumlen, GFP_KERNEL); |
| 500 | if (!sumptr) |
| 501 | return -ENOMEM; |
| 502 | memcpy(sumptr + sumlen - buf_len, buf + buf_size - buf_len, buf_len); |
| 503 | } |
| 504 | if (buf_len < sumlen) { |
| 505 | /* Need to read more so that the entire summary node is present */ |
| 506 | err = jffs2_fill_scan_buf(c, sumptr, |
| 507 | jeb->offset + c->sector_size - sumlen, |
| 508 | sumlen - buf_len); |
| 509 | if (err) |
| 510 | return err; |
| 511 | } |
| 512 | } |
| 513 | |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 514 | } |
| 515 | |
David Woodhouse | 9641b78 | 2006-05-20 16:13:34 +0100 | [diff] [blame] | 516 | if (sumptr) { |
| 517 | err = jffs2_sum_scan_sumnode(c, jeb, sumptr, sumlen, &pseudo_random); |
David Woodhouse | 3560160 | 2006-05-21 01:28:05 +0100 | [diff] [blame] | 518 | |
David Woodhouse | 9641b78 | 2006-05-20 16:13:34 +0100 | [diff] [blame] | 519 | if (buf_size && sumlen > buf_size) |
| 520 | kfree(sumptr); |
David Woodhouse | 3560160 | 2006-05-21 01:28:05 +0100 | [diff] [blame] | 521 | /* If it returns with a real error, bail. |
| 522 | If it returns positive, that's a block classification |
| 523 | (i.e. BLK_STATE_xxx) so return that too. |
| 524 | If it returns zero, fall through to full scan. */ |
| 525 | if (err) |
| 526 | return err; |
David Woodhouse | 9641b78 | 2006-05-20 16:13:34 +0100 | [diff] [blame] | 527 | } |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 528 | } |
| 529 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 530 | buf_ofs = jeb->offset; |
| 531 | |
| 532 | if (!buf_size) { |
David Woodhouse | 9641b78 | 2006-05-20 16:13:34 +0100 | [diff] [blame] | 533 | /* This is the XIP case -- we're reading _directly_ from the flash chip */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 534 | buf_len = c->sector_size; |
| 535 | } else { |
Andrew Victor | 3be3667 | 2005-02-09 09:09:05 +0000 | [diff] [blame] | 536 | buf_len = EMPTY_SCAN_SIZE(c->sector_size); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 537 | err = jffs2_fill_scan_buf(c, buf, buf_ofs, buf_len); |
| 538 | if (err) |
| 539 | return err; |
| 540 | } |
Thomas Gleixner | 182ec4e | 2005-11-07 11:16:07 +0000 | [diff] [blame] | 541 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 542 | /* We temporarily use 'ofs' as a pointer into the buffer/jeb */ |
| 543 | ofs = 0; |
| 544 | |
| 545 | /* Scan only 4KiB of 0xFF before declaring it's empty */ |
Andrew Victor | 3be3667 | 2005-02-09 09:09:05 +0000 | [diff] [blame] | 546 | while(ofs < EMPTY_SCAN_SIZE(c->sector_size) && *(uint32_t *)(&buf[ofs]) == 0xFFFFFFFF) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 547 | ofs += 4; |
| 548 | |
Andrew Victor | 3be3667 | 2005-02-09 09:09:05 +0000 | [diff] [blame] | 549 | if (ofs == EMPTY_SCAN_SIZE(c->sector_size)) { |
Andrew Victor | 2f82ce1 | 2005-02-09 09:24:26 +0000 | [diff] [blame] | 550 | #ifdef CONFIG_JFFS2_FS_WRITEBUFFER |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 551 | if (jffs2_cleanmarker_oob(c)) { |
| 552 | /* scan oob, take care of cleanmarker */ |
| 553 | int ret = jffs2_check_oob_empty(c, jeb, cleanmarkerfound); |
| 554 | D2(printk(KERN_NOTICE "jffs2_check_oob_empty returned %d\n",ret)); |
| 555 | switch (ret) { |
| 556 | case 0: return cleanmarkerfound ? BLK_STATE_CLEANMARKER : BLK_STATE_ALLFF; |
| 557 | case 1: return BLK_STATE_ALLDIRTY; |
| 558 | default: return ret; |
| 559 | } |
| 560 | } |
| 561 | #endif |
| 562 | D1(printk(KERN_DEBUG "Block at 0x%08x is empty (erased)\n", jeb->offset)); |
Andrew Victor | 8f15fd5 | 2005-02-09 09:17:45 +0000 | [diff] [blame] | 563 | if (c->cleanmarker_size == 0) |
| 564 | return BLK_STATE_CLEANMARKER; /* don't bother with re-erase */ |
| 565 | else |
| 566 | return BLK_STATE_ALLFF; /* OK to erase if all blocks are like this */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 567 | } |
| 568 | if (ofs) { |
| 569 | D1(printk(KERN_DEBUG "Free space at %08x ends at %08x\n", jeb->offset, |
| 570 | jeb->offset + ofs)); |
David Woodhouse | a6a8bef | 2006-05-29 00:41:11 +0100 | [diff] [blame] | 571 | if ((err = jffs2_prealloc_raw_node_refs(c, jeb, 1))) |
| 572 | return err; |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 573 | if ((err = jffs2_scan_dirty_space(c, jeb, ofs))) |
| 574 | return err; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 575 | } |
| 576 | |
| 577 | /* Now ofs is a complete physical flash offset as it always was... */ |
| 578 | ofs += jeb->offset; |
| 579 | |
| 580 | noise = 10; |
| 581 | |
Artem B. Bityutskiy | 733802d | 2005-09-22 12:25:00 +0100 | [diff] [blame] | 582 | dbg_summary("no summary found in jeb 0x%08x. Apply original scan.\n",jeb->offset); |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 583 | |
Thomas Gleixner | 182ec4e | 2005-11-07 11:16:07 +0000 | [diff] [blame] | 584 | scan_more: |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 585 | while(ofs < jeb->offset + c->sector_size) { |
| 586 | |
Artem B. Bityutskiy | e0c8e42 | 2005-07-24 16:14:17 +0100 | [diff] [blame] | 587 | jffs2_dbg_acct_paranoia_check_nolock(c, jeb); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 588 | |
David Woodhouse | 2f78540 | 2006-05-24 02:04:45 +0100 | [diff] [blame] | 589 | /* Make sure there are node refs available for use */ |
David Woodhouse | 046b8b9 | 2006-05-25 01:50:35 +0100 | [diff] [blame] | 590 | err = jffs2_prealloc_raw_node_refs(c, jeb, 2); |
David Woodhouse | 2f78540 | 2006-05-24 02:04:45 +0100 | [diff] [blame] | 591 | if (err) |
| 592 | return err; |
| 593 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 594 | cond_resched(); |
| 595 | |
| 596 | if (ofs & 3) { |
| 597 | printk(KERN_WARNING "Eep. ofs 0x%08x not word-aligned!\n", ofs); |
| 598 | ofs = PAD(ofs); |
| 599 | continue; |
| 600 | } |
| 601 | if (ofs == prevofs) { |
| 602 | printk(KERN_WARNING "ofs 0x%08x has already been seen. Skipping\n", ofs); |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 603 | if ((err = jffs2_scan_dirty_space(c, jeb, 4))) |
| 604 | return err; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 605 | ofs += 4; |
| 606 | continue; |
| 607 | } |
| 608 | prevofs = ofs; |
| 609 | |
| 610 | if (jeb->offset + c->sector_size < ofs + sizeof(*node)) { |
| 611 | 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), |
| 612 | jeb->offset, c->sector_size, ofs, sizeof(*node))); |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 613 | if ((err = jffs2_scan_dirty_space(c, jeb, (jeb->offset + c->sector_size)-ofs))) |
| 614 | return err; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 615 | break; |
| 616 | } |
| 617 | |
| 618 | if (buf_ofs + buf_len < ofs + sizeof(*node)) { |
| 619 | buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); |
| 620 | D1(printk(KERN_DEBUG "Fewer than %zd bytes (node header) left to end of buf. Reading 0x%x at 0x%08x\n", |
| 621 | sizeof(struct jffs2_unknown_node), buf_len, ofs)); |
| 622 | err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); |
| 623 | if (err) |
| 624 | return err; |
| 625 | buf_ofs = ofs; |
| 626 | } |
| 627 | |
| 628 | node = (struct jffs2_unknown_node *)&buf[ofs-buf_ofs]; |
| 629 | |
| 630 | if (*(uint32_t *)(&buf[ofs-buf_ofs]) == 0xffffffff) { |
| 631 | uint32_t inbuf_ofs; |
| 632 | uint32_t empty_start; |
| 633 | |
| 634 | empty_start = ofs; |
| 635 | ofs += 4; |
| 636 | |
| 637 | D1(printk(KERN_DEBUG "Found empty flash at 0x%08x\n", ofs)); |
| 638 | more_empty: |
| 639 | inbuf_ofs = ofs - buf_ofs; |
| 640 | while (inbuf_ofs < buf_len) { |
| 641 | if (*(uint32_t *)(&buf[inbuf_ofs]) != 0xffffffff) { |
| 642 | printk(KERN_WARNING "Empty flash at 0x%08x ends at 0x%08x\n", |
| 643 | empty_start, ofs); |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 644 | if ((err = jffs2_scan_dirty_space(c, jeb, ofs-empty_start))) |
| 645 | return err; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 646 | goto scan_more; |
| 647 | } |
| 648 | |
| 649 | inbuf_ofs+=4; |
| 650 | ofs += 4; |
| 651 | } |
| 652 | /* Ran off end. */ |
| 653 | D1(printk(KERN_DEBUG "Empty flash to end of buffer at 0x%08x\n", ofs)); |
| 654 | |
| 655 | /* If we're only checking the beginning of a block with a cleanmarker, |
| 656 | bail now */ |
Thomas Gleixner | 182ec4e | 2005-11-07 11:16:07 +0000 | [diff] [blame] | 657 | if (buf_ofs == jeb->offset && jeb->used_size == PAD(c->cleanmarker_size) && |
David Woodhouse | 99988f7 | 2006-05-24 09:04:17 +0100 | [diff] [blame] | 658 | c->cleanmarker_size && !jeb->dirty_size && !ref_next(jeb->first_node)) { |
Andrew Victor | 3be3667 | 2005-02-09 09:09:05 +0000 | [diff] [blame] | 659 | D1(printk(KERN_DEBUG "%d bytes at start of block seems clean... assuming all clean\n", EMPTY_SCAN_SIZE(c->sector_size))); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 660 | return BLK_STATE_CLEANMARKER; |
| 661 | } |
| 662 | |
| 663 | /* See how much more there is to read in this eraseblock... */ |
| 664 | buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); |
| 665 | if (!buf_len) { |
Thomas Gleixner | 182ec4e | 2005-11-07 11:16:07 +0000 | [diff] [blame] | 666 | /* No more to read. Break out of main loop without marking |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 667 | this range of empty space as dirty (because it's not) */ |
| 668 | D1(printk(KERN_DEBUG "Empty flash at %08x runs to end of block. Treating as free_space\n", |
| 669 | empty_start)); |
| 670 | break; |
| 671 | } |
| 672 | D1(printk(KERN_DEBUG "Reading another 0x%x at 0x%08x\n", buf_len, ofs)); |
| 673 | err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); |
| 674 | if (err) |
| 675 | return err; |
| 676 | buf_ofs = ofs; |
| 677 | goto more_empty; |
| 678 | } |
| 679 | |
| 680 | if (ofs == jeb->offset && je16_to_cpu(node->magic) == KSAMTIB_CIGAM_2SFFJ) { |
| 681 | printk(KERN_WARNING "Magic bitmask is backwards at offset 0x%08x. Wrong endian filesystem?\n", ofs); |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 682 | if ((err = jffs2_scan_dirty_space(c, jeb, 4))) |
| 683 | return err; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 684 | ofs += 4; |
| 685 | continue; |
| 686 | } |
| 687 | if (je16_to_cpu(node->magic) == JFFS2_DIRTY_BITMASK) { |
| 688 | D1(printk(KERN_DEBUG "Dirty bitmask at 0x%08x\n", ofs)); |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 689 | if ((err = jffs2_scan_dirty_space(c, jeb, 4))) |
| 690 | return err; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 691 | ofs += 4; |
| 692 | continue; |
| 693 | } |
| 694 | if (je16_to_cpu(node->magic) == JFFS2_OLD_MAGIC_BITMASK) { |
| 695 | printk(KERN_WARNING "Old JFFS2 bitmask found at 0x%08x\n", ofs); |
| 696 | printk(KERN_WARNING "You cannot use older JFFS2 filesystems with newer kernels\n"); |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 697 | if ((err = jffs2_scan_dirty_space(c, jeb, 4))) |
| 698 | return err; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 699 | ofs += 4; |
| 700 | continue; |
| 701 | } |
| 702 | if (je16_to_cpu(node->magic) != JFFS2_MAGIC_BITMASK) { |
| 703 | /* OK. We're out of possibilities. Whinge and move on */ |
Thomas Gleixner | 182ec4e | 2005-11-07 11:16:07 +0000 | [diff] [blame] | 704 | noisy_printk(&noise, "jffs2_scan_eraseblock(): Magic bitmask 0x%04x not found at 0x%08x: 0x%04x instead\n", |
| 705 | JFFS2_MAGIC_BITMASK, ofs, |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 706 | je16_to_cpu(node->magic)); |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 707 | if ((err = jffs2_scan_dirty_space(c, jeb, 4))) |
| 708 | return err; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 709 | ofs += 4; |
| 710 | continue; |
| 711 | } |
| 712 | /* We seem to have a node of sorts. Check the CRC */ |
| 713 | crcnode.magic = node->magic; |
| 714 | crcnode.nodetype = cpu_to_je16( je16_to_cpu(node->nodetype) | JFFS2_NODE_ACCURATE); |
| 715 | crcnode.totlen = node->totlen; |
| 716 | hdr_crc = crc32(0, &crcnode, sizeof(crcnode)-4); |
| 717 | |
| 718 | if (hdr_crc != je32_to_cpu(node->hdr_crc)) { |
| 719 | 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", |
| 720 | ofs, je16_to_cpu(node->magic), |
Thomas Gleixner | 182ec4e | 2005-11-07 11:16:07 +0000 | [diff] [blame] | 721 | je16_to_cpu(node->nodetype), |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 722 | je32_to_cpu(node->totlen), |
| 723 | je32_to_cpu(node->hdr_crc), |
| 724 | hdr_crc); |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 725 | if ((err = jffs2_scan_dirty_space(c, jeb, 4))) |
| 726 | return err; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 727 | ofs += 4; |
| 728 | continue; |
| 729 | } |
| 730 | |
Thomas Gleixner | 182ec4e | 2005-11-07 11:16:07 +0000 | [diff] [blame] | 731 | if (ofs + je32_to_cpu(node->totlen) > |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 732 | jeb->offset + c->sector_size) { |
| 733 | /* Eep. Node goes over the end of the erase block. */ |
| 734 | printk(KERN_WARNING "Node at 0x%08x with length 0x%08x would run over the end of the erase block\n", |
| 735 | ofs, je32_to_cpu(node->totlen)); |
| 736 | printk(KERN_WARNING "Perhaps the file system was created with the wrong erase size?\n"); |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 737 | if ((err = jffs2_scan_dirty_space(c, jeb, 4))) |
| 738 | return err; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 739 | ofs += 4; |
| 740 | continue; |
| 741 | } |
| 742 | |
| 743 | if (!(je16_to_cpu(node->nodetype) & JFFS2_NODE_ACCURATE)) { |
| 744 | /* Wheee. This is an obsoleted node */ |
| 745 | D2(printk(KERN_DEBUG "Node at 0x%08x is obsolete. Skipping\n", ofs)); |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 746 | if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(node->totlen))))) |
| 747 | return err; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 748 | ofs += PAD(je32_to_cpu(node->totlen)); |
| 749 | continue; |
| 750 | } |
| 751 | |
| 752 | switch(je16_to_cpu(node->nodetype)) { |
| 753 | case JFFS2_NODETYPE_INODE: |
| 754 | if (buf_ofs + buf_len < ofs + sizeof(struct jffs2_raw_inode)) { |
| 755 | buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); |
| 756 | D1(printk(KERN_DEBUG "Fewer than %zd bytes (inode node) left to end of buf. Reading 0x%x at 0x%08x\n", |
| 757 | sizeof(struct jffs2_raw_inode), buf_len, ofs)); |
| 758 | err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); |
| 759 | if (err) |
| 760 | return err; |
| 761 | buf_ofs = ofs; |
| 762 | node = (void *)buf; |
| 763 | } |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 764 | err = jffs2_scan_inode_node(c, jeb, (void *)node, ofs, s); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 765 | if (err) return err; |
| 766 | ofs += PAD(je32_to_cpu(node->totlen)); |
| 767 | break; |
Thomas Gleixner | 182ec4e | 2005-11-07 11:16:07 +0000 | [diff] [blame] | 768 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 769 | case JFFS2_NODETYPE_DIRENT: |
| 770 | if (buf_ofs + buf_len < ofs + je32_to_cpu(node->totlen)) { |
| 771 | buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); |
| 772 | D1(printk(KERN_DEBUG "Fewer than %d bytes (dirent node) left to end of buf. Reading 0x%x at 0x%08x\n", |
| 773 | je32_to_cpu(node->totlen), buf_len, ofs)); |
| 774 | err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); |
| 775 | if (err) |
| 776 | return err; |
| 777 | buf_ofs = ofs; |
| 778 | node = (void *)buf; |
| 779 | } |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 780 | err = jffs2_scan_dirent_node(c, jeb, (void *)node, ofs, s); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 781 | if (err) return err; |
| 782 | ofs += PAD(je32_to_cpu(node->totlen)); |
| 783 | break; |
| 784 | |
KaiGai Kohei | aa98d7c | 2006-05-13 15:09:47 +0900 | [diff] [blame] | 785 | #ifdef CONFIG_JFFS2_FS_XATTR |
| 786 | case JFFS2_NODETYPE_XATTR: |
| 787 | if (buf_ofs + buf_len < ofs + je32_to_cpu(node->totlen)) { |
| 788 | buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); |
| 789 | D1(printk(KERN_DEBUG "Fewer than %d bytes (xattr node)" |
| 790 | " left to end of buf. Reading 0x%x at 0x%08x\n", |
| 791 | je32_to_cpu(node->totlen), buf_len, ofs)); |
| 792 | err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); |
| 793 | if (err) |
| 794 | return err; |
| 795 | buf_ofs = ofs; |
| 796 | node = (void *)buf; |
| 797 | } |
| 798 | err = jffs2_scan_xattr_node(c, jeb, (void *)node, ofs, s); |
| 799 | if (err) |
| 800 | return err; |
| 801 | ofs += PAD(je32_to_cpu(node->totlen)); |
| 802 | break; |
| 803 | case JFFS2_NODETYPE_XREF: |
| 804 | if (buf_ofs + buf_len < ofs + je32_to_cpu(node->totlen)) { |
| 805 | buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs); |
| 806 | D1(printk(KERN_DEBUG "Fewer than %d bytes (xref node)" |
| 807 | " left to end of buf. Reading 0x%x at 0x%08x\n", |
| 808 | je32_to_cpu(node->totlen), buf_len, ofs)); |
| 809 | err = jffs2_fill_scan_buf(c, buf, ofs, buf_len); |
| 810 | if (err) |
| 811 | return err; |
| 812 | buf_ofs = ofs; |
| 813 | node = (void *)buf; |
| 814 | } |
| 815 | err = jffs2_scan_xref_node(c, jeb, (void *)node, ofs, s); |
| 816 | if (err) |
| 817 | return err; |
| 818 | ofs += PAD(je32_to_cpu(node->totlen)); |
| 819 | break; |
| 820 | #endif /* CONFIG_JFFS2_FS_XATTR */ |
| 821 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 822 | case JFFS2_NODETYPE_CLEANMARKER: |
| 823 | D1(printk(KERN_DEBUG "CLEANMARKER node found at 0x%08x\n", ofs)); |
| 824 | if (je32_to_cpu(node->totlen) != c->cleanmarker_size) { |
Thomas Gleixner | 182ec4e | 2005-11-07 11:16:07 +0000 | [diff] [blame] | 825 | printk(KERN_NOTICE "CLEANMARKER node found at 0x%08x has totlen 0x%x != normal 0x%x\n", |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 826 | ofs, je32_to_cpu(node->totlen), c->cleanmarker_size); |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 827 | if ((err = jffs2_scan_dirty_space(c, jeb, PAD(sizeof(struct jffs2_unknown_node))))) |
| 828 | return err; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 829 | ofs += PAD(sizeof(struct jffs2_unknown_node)); |
| 830 | } else if (jeb->first_node) { |
| 831 | printk(KERN_NOTICE "CLEANMARKER node found at 0x%08x, not first node in block (0x%08x)\n", ofs, jeb->offset); |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 832 | if ((err = jffs2_scan_dirty_space(c, jeb, PAD(sizeof(struct jffs2_unknown_node))))) |
| 833 | return err; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 834 | ofs += PAD(sizeof(struct jffs2_unknown_node)); |
| 835 | } else { |
David Woodhouse | 2f78540 | 2006-05-24 02:04:45 +0100 | [diff] [blame] | 836 | jffs2_link_node_ref(c, jeb, ofs | REF_NORMAL, c->cleanmarker_size, NULL); |
David Woodhouse | f1f9671 | 2006-05-20 19:45:26 +0100 | [diff] [blame] | 837 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 838 | ofs += PAD(c->cleanmarker_size); |
| 839 | } |
| 840 | break; |
| 841 | |
| 842 | case JFFS2_NODETYPE_PADDING: |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 843 | if (jffs2_sum_active()) |
| 844 | jffs2_sum_add_padding_mem(s, je32_to_cpu(node->totlen)); |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 845 | if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(node->totlen))))) |
| 846 | return err; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 847 | ofs += PAD(je32_to_cpu(node->totlen)); |
| 848 | break; |
| 849 | |
| 850 | default: |
| 851 | switch (je16_to_cpu(node->nodetype) & JFFS2_COMPAT_MASK) { |
| 852 | case JFFS2_FEATURE_ROCOMPAT: |
| 853 | printk(KERN_NOTICE "Read-only compatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs); |
| 854 | c->flags |= JFFS2_SB_FLAG_RO; |
| 855 | if (!(jffs2_is_readonly(c))) |
| 856 | return -EROFS; |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 857 | if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(node->totlen))))) |
| 858 | return err; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 859 | ofs += PAD(je32_to_cpu(node->totlen)); |
| 860 | break; |
| 861 | |
| 862 | case JFFS2_FEATURE_INCOMPAT: |
| 863 | printk(KERN_NOTICE "Incompatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs); |
| 864 | return -EINVAL; |
| 865 | |
| 866 | case JFFS2_FEATURE_RWCOMPAT_DELETE: |
| 867 | D1(printk(KERN_NOTICE "Unknown but compatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs)); |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 868 | if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(node->totlen))))) |
| 869 | return err; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 870 | ofs += PAD(je32_to_cpu(node->totlen)); |
| 871 | break; |
| 872 | |
David Woodhouse | 6171586 | 2006-05-21 00:02:06 +0100 | [diff] [blame] | 873 | case JFFS2_FEATURE_RWCOMPAT_COPY: { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 874 | D1(printk(KERN_NOTICE "Unknown but compatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs)); |
David Woodhouse | 6171586 | 2006-05-21 00:02:06 +0100 | [diff] [blame] | 875 | |
David Woodhouse | 2f78540 | 2006-05-24 02:04:45 +0100 | [diff] [blame] | 876 | jffs2_link_node_ref(c, jeb, ofs | REF_PRISTINE, PAD(je32_to_cpu(node->totlen)), NULL); |
David Woodhouse | 6171586 | 2006-05-21 00:02:06 +0100 | [diff] [blame] | 877 | |
| 878 | /* We can't summarise nodes we don't grok */ |
| 879 | jffs2_sum_disable_collecting(s); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 880 | ofs += PAD(je32_to_cpu(node->totlen)); |
| 881 | break; |
David Woodhouse | 6171586 | 2006-05-21 00:02:06 +0100 | [diff] [blame] | 882 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 883 | } |
| 884 | } |
| 885 | } |
| 886 | |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 887 | if (jffs2_sum_active()) { |
| 888 | if (PAD(s->sum_size + JFFS2_SUMMARY_FRAME_SIZE) > jeb->free_size) { |
Artem B. Bityutskiy | 733802d | 2005-09-22 12:25:00 +0100 | [diff] [blame] | 889 | dbg_summary("There is not enough space for " |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 890 | "summary information, disabling for this jeb!\n"); |
| 891 | jffs2_sum_disable_collecting(s); |
| 892 | } |
| 893 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 894 | |
David Woodhouse | 8b9e9fe | 2006-05-25 01:53:09 +0100 | [diff] [blame] | 895 | D1(printk(KERN_DEBUG "Block at 0x%08x: free 0x%08x, dirty 0x%08x, unchecked 0x%08x, used 0x%08x, wasted 0x%08x\n", |
| 896 | jeb->offset,jeb->free_size, jeb->dirty_size, jeb->unchecked_size, jeb->used_size, jeb->wasted_size)); |
| 897 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 898 | /* mark_node_obsolete can add to wasted !! */ |
| 899 | if (jeb->wasted_size) { |
| 900 | jeb->dirty_size += jeb->wasted_size; |
| 901 | c->dirty_size += jeb->wasted_size; |
| 902 | c->wasted_size -= jeb->wasted_size; |
| 903 | jeb->wasted_size = 0; |
| 904 | } |
| 905 | |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 906 | return jffs2_scan_classify_jeb(c, jeb); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 907 | } |
| 908 | |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 909 | struct jffs2_inode_cache *jffs2_scan_make_ino_cache(struct jffs2_sb_info *c, uint32_t ino) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 910 | { |
| 911 | struct jffs2_inode_cache *ic; |
| 912 | |
| 913 | ic = jffs2_get_ino_cache(c, ino); |
| 914 | if (ic) |
| 915 | return ic; |
| 916 | |
| 917 | if (ino > c->highest_ino) |
| 918 | c->highest_ino = ino; |
| 919 | |
| 920 | ic = jffs2_alloc_inode_cache(); |
| 921 | if (!ic) { |
| 922 | printk(KERN_NOTICE "jffs2_scan_make_inode_cache(): allocation of inode cache failed\n"); |
| 923 | return NULL; |
| 924 | } |
| 925 | memset(ic, 0, sizeof(*ic)); |
| 926 | |
| 927 | ic->ino = ino; |
| 928 | ic->nodes = (void *)ic; |
| 929 | jffs2_add_ino_cache(c, ic); |
| 930 | if (ino == 1) |
| 931 | ic->nlink = 1; |
| 932 | return ic; |
| 933 | } |
| 934 | |
Thomas Gleixner | 182ec4e | 2005-11-07 11:16:07 +0000 | [diff] [blame] | 935 | static int jffs2_scan_inode_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 936 | struct jffs2_raw_inode *ri, uint32_t ofs, struct jffs2_summary *s) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 937 | { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 938 | struct jffs2_inode_cache *ic; |
| 939 | uint32_t ino = je32_to_cpu(ri->ino); |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 940 | int err; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 941 | |
| 942 | D1(printk(KERN_DEBUG "jffs2_scan_inode_node(): Node at 0x%08x\n", ofs)); |
| 943 | |
| 944 | /* We do very little here now. Just check the ino# to which we should attribute |
Thomas Gleixner | 182ec4e | 2005-11-07 11:16:07 +0000 | [diff] [blame] | 945 | this node; we can do all the CRC checking etc. later. There's a tradeoff here -- |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 946 | we used to scan the flash once only, reading everything we want from it into |
| 947 | memory, then building all our in-core data structures and freeing the extra |
| 948 | information. Now we allow the first part of the mount to complete a lot quicker, |
Thomas Gleixner | 182ec4e | 2005-11-07 11:16:07 +0000 | [diff] [blame] | 949 | but we have to go _back_ to the flash in order to finish the CRC checking, etc. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 950 | Which means that the _full_ amount of time to get to proper write mode with GC |
| 951 | operational may actually be _longer_ than before. Sucks to be me. */ |
| 952 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 953 | ic = jffs2_get_ino_cache(c, ino); |
| 954 | if (!ic) { |
| 955 | /* Inocache get failed. Either we read a bogus ino# or it's just genuinely the |
| 956 | first node we found for this inode. Do a CRC check to protect against the former |
| 957 | case */ |
| 958 | uint32_t crc = crc32(0, ri, sizeof(*ri)-8); |
| 959 | |
| 960 | if (crc != je32_to_cpu(ri->node_crc)) { |
| 961 | printk(KERN_NOTICE "jffs2_scan_inode_node(): CRC failed on node at 0x%08x: Read 0x%08x, calculated 0x%08x\n", |
| 962 | ofs, je32_to_cpu(ri->node_crc), crc); |
| 963 | /* We believe totlen because the CRC on the node _header_ was OK, just the node itself failed. */ |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 964 | if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(ri->totlen))))) |
| 965 | return err; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 966 | return 0; |
| 967 | } |
| 968 | ic = jffs2_scan_make_ino_cache(c, ino); |
David Woodhouse | 2f78540 | 2006-05-24 02:04:45 +0100 | [diff] [blame] | 969 | if (!ic) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 970 | return -ENOMEM; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 971 | } |
| 972 | |
| 973 | /* Wheee. It worked */ |
David Woodhouse | 2f78540 | 2006-05-24 02:04:45 +0100 | [diff] [blame] | 974 | jffs2_link_node_ref(c, jeb, ofs | REF_UNCHECKED, PAD(je32_to_cpu(ri->totlen)), ic); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 975 | |
Thomas Gleixner | 182ec4e | 2005-11-07 11:16:07 +0000 | [diff] [blame] | 976 | D1(printk(KERN_DEBUG "Node is ino #%u, version %d. Range 0x%x-0x%x\n", |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 977 | je32_to_cpu(ri->ino), je32_to_cpu(ri->version), |
| 978 | je32_to_cpu(ri->offset), |
| 979 | je32_to_cpu(ri->offset)+je32_to_cpu(ri->dsize))); |
| 980 | |
| 981 | pseudo_random += je32_to_cpu(ri->version); |
| 982 | |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 983 | if (jffs2_sum_active()) { |
| 984 | jffs2_sum_add_inode_mem(s, ri, ofs - jeb->offset); |
| 985 | } |
| 986 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 987 | return 0; |
| 988 | } |
| 989 | |
Thomas Gleixner | 182ec4e | 2005-11-07 11:16:07 +0000 | [diff] [blame] | 990 | static int jffs2_scan_dirent_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 991 | struct jffs2_raw_dirent *rd, uint32_t ofs, struct jffs2_summary *s) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 992 | { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 993 | struct jffs2_full_dirent *fd; |
| 994 | struct jffs2_inode_cache *ic; |
| 995 | uint32_t crc; |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 996 | int err; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 997 | |
| 998 | D1(printk(KERN_DEBUG "jffs2_scan_dirent_node(): Node at 0x%08x\n", ofs)); |
| 999 | |
| 1000 | /* We don't get here unless the node is still valid, so we don't have to |
| 1001 | mask in the ACCURATE bit any more. */ |
| 1002 | crc = crc32(0, rd, sizeof(*rd)-8); |
| 1003 | |
| 1004 | if (crc != je32_to_cpu(rd->node_crc)) { |
| 1005 | printk(KERN_NOTICE "jffs2_scan_dirent_node(): Node CRC failed on node at 0x%08x: Read 0x%08x, calculated 0x%08x\n", |
| 1006 | ofs, je32_to_cpu(rd->node_crc), crc); |
| 1007 | /* We believe totlen because the CRC on the node _header_ was OK, just the node itself failed. */ |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 1008 | if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(rd->totlen))))) |
| 1009 | return err; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1010 | return 0; |
| 1011 | } |
| 1012 | |
| 1013 | pseudo_random += je32_to_cpu(rd->version); |
| 1014 | |
| 1015 | fd = jffs2_alloc_full_dirent(rd->nsize+1); |
| 1016 | if (!fd) { |
| 1017 | return -ENOMEM; |
| 1018 | } |
| 1019 | memcpy(&fd->name, rd->name, rd->nsize); |
| 1020 | fd->name[rd->nsize] = 0; |
| 1021 | |
| 1022 | crc = crc32(0, fd->name, rd->nsize); |
| 1023 | if (crc != je32_to_cpu(rd->name_crc)) { |
| 1024 | printk(KERN_NOTICE "jffs2_scan_dirent_node(): Name CRC failed on node at 0x%08x: Read 0x%08x, calculated 0x%08x\n", |
Thomas Gleixner | 182ec4e | 2005-11-07 11:16:07 +0000 | [diff] [blame] | 1025 | ofs, je32_to_cpu(rd->name_crc), crc); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1026 | D1(printk(KERN_NOTICE "Name for which CRC failed is (now) '%s', ino #%d\n", fd->name, je32_to_cpu(rd->ino))); |
| 1027 | jffs2_free_full_dirent(fd); |
| 1028 | /* FIXME: Why do we believe totlen? */ |
| 1029 | /* We believe totlen because the CRC on the node _header_ was OK, just the name failed. */ |
David Woodhouse | 6827099 | 2006-05-21 03:46:05 +0100 | [diff] [blame] | 1030 | if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(rd->totlen))))) |
| 1031 | return err; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1032 | return 0; |
| 1033 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1034 | ic = jffs2_scan_make_ino_cache(c, je32_to_cpu(rd->pino)); |
| 1035 | if (!ic) { |
| 1036 | jffs2_free_full_dirent(fd); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1037 | return -ENOMEM; |
| 1038 | } |
Thomas Gleixner | 182ec4e | 2005-11-07 11:16:07 +0000 | [diff] [blame] | 1039 | |
David Woodhouse | 2f78540 | 2006-05-24 02:04:45 +0100 | [diff] [blame] | 1040 | fd->raw = jffs2_link_node_ref(c, jeb, ofs | REF_PRISTINE, PAD(je32_to_cpu(rd->totlen)), ic); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1041 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1042 | fd->next = NULL; |
| 1043 | fd->version = je32_to_cpu(rd->version); |
| 1044 | fd->ino = je32_to_cpu(rd->ino); |
| 1045 | fd->nhash = full_name_hash(fd->name, rd->nsize); |
| 1046 | fd->type = rd->type; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1047 | jffs2_add_fd_to_list(c, fd, &ic->scan_dents); |
| 1048 | |
Ferenc Havasi | e631ddb | 2005-09-07 09:35:26 +0100 | [diff] [blame] | 1049 | if (jffs2_sum_active()) { |
| 1050 | jffs2_sum_add_dirent_mem(s, rd, ofs - jeb->offset); |
| 1051 | } |
| 1052 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1053 | return 0; |
| 1054 | } |
| 1055 | |
| 1056 | static int count_list(struct list_head *l) |
| 1057 | { |
| 1058 | uint32_t count = 0; |
| 1059 | struct list_head *tmp; |
| 1060 | |
| 1061 | list_for_each(tmp, l) { |
| 1062 | count++; |
| 1063 | } |
| 1064 | return count; |
| 1065 | } |
| 1066 | |
| 1067 | /* Note: This breaks if list_empty(head). I don't care. You |
| 1068 | might, if you copy this code and use it elsewhere :) */ |
| 1069 | static void rotate_list(struct list_head *head, uint32_t count) |
| 1070 | { |
| 1071 | struct list_head *n = head->next; |
| 1072 | |
| 1073 | list_del(head); |
| 1074 | while(count--) { |
| 1075 | n = n->next; |
| 1076 | } |
| 1077 | list_add(head, n); |
| 1078 | } |
| 1079 | |
| 1080 | void jffs2_rotate_lists(struct jffs2_sb_info *c) |
| 1081 | { |
| 1082 | uint32_t x; |
| 1083 | uint32_t rotateby; |
| 1084 | |
| 1085 | x = count_list(&c->clean_list); |
| 1086 | if (x) { |
| 1087 | rotateby = pseudo_random % x; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1088 | rotate_list((&c->clean_list), rotateby); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1089 | } |
| 1090 | |
| 1091 | x = count_list(&c->very_dirty_list); |
| 1092 | if (x) { |
| 1093 | rotateby = pseudo_random % x; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1094 | rotate_list((&c->very_dirty_list), rotateby); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1095 | } |
| 1096 | |
| 1097 | x = count_list(&c->dirty_list); |
| 1098 | if (x) { |
| 1099 | rotateby = pseudo_random % x; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1100 | rotate_list((&c->dirty_list), rotateby); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1101 | } |
| 1102 | |
| 1103 | x = count_list(&c->erasable_list); |
| 1104 | if (x) { |
| 1105 | rotateby = pseudo_random % x; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1106 | rotate_list((&c->erasable_list), rotateby); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1107 | } |
| 1108 | |
| 1109 | if (c->nr_erasing_blocks) { |
| 1110 | rotateby = pseudo_random % c->nr_erasing_blocks; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1111 | rotate_list((&c->erase_pending_list), rotateby); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1112 | } |
| 1113 | |
| 1114 | if (c->nr_free_blocks) { |
| 1115 | rotateby = pseudo_random % c->nr_free_blocks; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1116 | rotate_list((&c->free_list), rotateby); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1117 | } |
| 1118 | } |