2 * JFFS2 -- Journalling Flash File System, Version 2.
4 * Copyright (C) 2001-2003 Red Hat, Inc.
6 * Created by David Woodhouse <dwmw2@infradead.org>
8 * For licensing information, see the file 'LICENCE' in this directory.
10 * $Id: scan.c,v 1.125 2005/09/30 13:59:13 dedekind Exp $
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>
24 #define DEFAULT_EMPTY_SCAN_SIZE 1024
26 #define noisy_printk(noise, args...) do { \
28 printk(KERN_NOTICE args); \
31 printk(KERN_NOTICE "Further such events for this erase block will not be printed\n"); \
36 static uint32_t pseudo_random
;
38 static int jffs2_scan_eraseblock (struct jffs2_sb_info
*c
, struct jffs2_eraseblock
*jeb
,
39 unsigned char *buf
, uint32_t buf_size
, struct jffs2_summary
*s
);
41 /* These helper functions _must_ increase ofs and also do the dirty/used space accounting.
42 * Returning an error will abort the mount - bad checksums etc. should just mark the space
45 static int jffs2_scan_inode_node(struct jffs2_sb_info
*c
, struct jffs2_eraseblock
*jeb
,
46 struct jffs2_raw_inode
*ri
, uint32_t ofs
, struct jffs2_summary
*s
);
47 static int jffs2_scan_dirent_node(struct jffs2_sb_info
*c
, struct jffs2_eraseblock
*jeb
,
48 struct jffs2_raw_dirent
*rd
, uint32_t ofs
, struct jffs2_summary
*s
);
50 static inline int min_free(struct jffs2_sb_info
*c
)
52 uint32_t min
= 2 * sizeof(struct jffs2_raw_inode
);
53 #ifdef CONFIG_JFFS2_FS_WRITEBUFFER
54 if (!jffs2_can_mark_obsolete(c
) && min
< c
->wbuf_pagesize
)
55 return c
->wbuf_pagesize
;
61 static inline uint32_t EMPTY_SCAN_SIZE(uint32_t sector_size
) {
62 if (sector_size
< DEFAULT_EMPTY_SCAN_SIZE
)
65 return DEFAULT_EMPTY_SCAN_SIZE
;
68 static int file_dirty(struct jffs2_sb_info
*c
, struct jffs2_eraseblock
*jeb
)
70 int ret
= jffs2_scan_dirty_space(c
, jeb
, jeb
->free_size
);
73 /* Turned wasted size into dirty, since we apparently
74 think it's recoverable now. */
75 jeb
->dirty_size
+= jeb
->wasted_size
;
76 c
->dirty_size
+= jeb
->wasted_size
;
77 c
->wasted_size
-= jeb
->wasted_size
;
79 if (VERYDIRTY(c
, jeb
->dirty_size
)) {
80 list_add(&jeb
->list
, &c
->very_dirty_list
);
82 list_add(&jeb
->list
, &c
->dirty_list
);
87 int jffs2_scan_medium(struct jffs2_sb_info
*c
)
90 uint32_t empty_blocks
= 0, bad_blocks
= 0;
91 unsigned char *flashbuf
= NULL
;
92 uint32_t buf_size
= 0;
93 struct jffs2_summary
*s
= NULL
; /* summary info collected by the scan process */
98 ret
= c
->mtd
->point (c
->mtd
, 0, c
->mtd
->size
, &pointlen
, &flashbuf
);
99 if (!ret
&& pointlen
< c
->mtd
->size
) {
100 /* Don't muck about if it won't let us point to the whole flash */
101 D1(printk(KERN_DEBUG
"MTD point returned len too short: 0x%zx\n", pointlen
));
102 c
->mtd
->unpoint(c
->mtd
, flashbuf
, 0, c
->mtd
->size
);
106 D1(printk(KERN_DEBUG
"MTD point failed %d\n", ret
));
110 /* For NAND it's quicker to read a whole eraseblock at a time,
112 if (jffs2_cleanmarker_oob(c
))
113 buf_size
= c
->sector_size
;
115 buf_size
= PAGE_SIZE
;
117 /* Respect kmalloc limitations */
118 if (buf_size
> 128*1024)
121 D1(printk(KERN_DEBUG
"Allocating readbuf of %d bytes\n", buf_size
));
122 flashbuf
= kmalloc(buf_size
, GFP_KERNEL
);
127 if (jffs2_sum_active()) {
128 s
= kmalloc(sizeof(struct jffs2_summary
), GFP_KERNEL
);
130 JFFS2_WARNING("Can't allocate memory for summary\n");
133 memset(s
, 0, sizeof(struct jffs2_summary
));
136 for (i
=0; i
<c
->nr_blocks
; i
++) {
137 struct jffs2_eraseblock
*jeb
= &c
->blocks
[i
];
139 /* reset summary info for next eraseblock scan */
140 jffs2_sum_reset_collected(s
);
142 ret
= jffs2_scan_eraseblock(c
, jeb
, buf_size
?flashbuf
:(flashbuf
+jeb
->offset
),
148 jffs2_dbg_acct_paranoia_check_nolock(c
, jeb
);
150 /* Now decide which list to put it on */
152 case BLK_STATE_ALLFF
:
154 * Empty block. Since we can't be sure it
155 * was entirely erased, we just queue it for erase
156 * again. It will be marked as such when the erase
157 * is complete. Meanwhile we still count it as empty
161 list_add(&jeb
->list
, &c
->erase_pending_list
);
162 c
->nr_erasing_blocks
++;
165 case BLK_STATE_CLEANMARKER
:
166 /* Only a CLEANMARKER node is valid */
167 if (!jeb
->dirty_size
) {
168 /* It's actually free */
169 list_add(&jeb
->list
, &c
->free_list
);
173 D1(printk(KERN_DEBUG
"Adding all-dirty block at 0x%08x to erase_pending_list\n", jeb
->offset
));
174 list_add(&jeb
->list
, &c
->erase_pending_list
);
175 c
->nr_erasing_blocks
++;
179 case BLK_STATE_CLEAN
:
180 /* Full (or almost full) of clean data. Clean list */
181 list_add(&jeb
->list
, &c
->clean_list
);
184 case BLK_STATE_PARTDIRTY
:
185 /* Some data, but not full. Dirty list. */
186 /* We want to remember the block with most free space
187 and stick it in the 'nextblock' position to start writing to it. */
188 if (jeb
->free_size
> min_free(c
) &&
189 (!c
->nextblock
|| c
->nextblock
->free_size
< jeb
->free_size
)) {
190 /* Better candidate for the next writes to go to */
192 ret
= file_dirty(c
, c
->nextblock
);
195 /* deleting summary information of the old nextblock */
196 jffs2_sum_reset_collected(c
->summary
);
198 /* update collected summary information for the current nextblock */
199 jffs2_sum_move_collected(c
, s
);
200 D1(printk(KERN_DEBUG
"jffs2_scan_medium(): new nextblock = 0x%08x\n", jeb
->offset
));
203 ret
= file_dirty(c
, jeb
);
209 case BLK_STATE_ALLDIRTY
:
210 /* Nothing valid - not even a clean marker. Needs erasing. */
211 /* For now we just put it on the erasing list. We'll start the erases later */
212 D1(printk(KERN_NOTICE
"JFFS2: Erase block at 0x%08x is not formatted. It will be erased\n", jeb
->offset
));
213 list_add(&jeb
->list
, &c
->erase_pending_list
);
214 c
->nr_erasing_blocks
++;
217 case BLK_STATE_BADBLOCK
:
218 D1(printk(KERN_NOTICE
"JFFS2: Block at 0x%08x is bad\n", jeb
->offset
));
219 list_add(&jeb
->list
, &c
->bad_list
);
220 c
->bad_size
+= c
->sector_size
;
221 c
->free_size
-= c
->sector_size
;
225 printk(KERN_WARNING
"jffs2_scan_medium(): unknown block state\n");
230 /* Nextblock dirty is always seen as wasted, because we cannot recycle it now */
231 if (c
->nextblock
&& (c
->nextblock
->dirty_size
)) {
232 c
->nextblock
->wasted_size
+= c
->nextblock
->dirty_size
;
233 c
->wasted_size
+= c
->nextblock
->dirty_size
;
234 c
->dirty_size
-= c
->nextblock
->dirty_size
;
235 c
->nextblock
->dirty_size
= 0;
237 #ifdef CONFIG_JFFS2_FS_WRITEBUFFER
238 if (!jffs2_can_mark_obsolete(c
) && c
->wbuf_pagesize
&& c
->nextblock
&& (c
->nextblock
->free_size
% c
->wbuf_pagesize
)) {
239 /* If we're going to start writing into a block which already
240 contains data, and the end of the data isn't page-aligned,
241 skip a little and align it. */
243 uint32_t skip
= c
->nextblock
->free_size
% c
->wbuf_pagesize
;
245 D1(printk(KERN_DEBUG
"jffs2_scan_medium(): Skipping %d bytes in nextblock to ensure page alignment\n",
247 c
->nextblock
->wasted_size
+= skip
;
248 c
->wasted_size
+= skip
;
250 c
->nextblock
->free_size
-= skip
;
251 c
->free_size
-= skip
;
254 if (c
->nr_erasing_blocks
) {
255 if ( !c
->used_size
&& ((c
->nr_free_blocks
+empty_blocks
+bad_blocks
)!= c
->nr_blocks
|| bad_blocks
== c
->nr_blocks
) ) {
256 printk(KERN_NOTICE
"Cowardly refusing to erase blocks on filesystem with no valid JFFS2 nodes\n");
257 printk(KERN_NOTICE
"empty_blocks %d, bad_blocks %d, c->nr_blocks %d\n",empty_blocks
,bad_blocks
,c
->nr_blocks
);
261 jffs2_erase_pending_trigger(c
);
269 c
->mtd
->unpoint(c
->mtd
, flashbuf
, 0, c
->mtd
->size
);
277 int jffs2_fill_scan_buf (struct jffs2_sb_info
*c
, void *buf
,
278 uint32_t ofs
, uint32_t len
)
283 ret
= jffs2_flash_read(c
, ofs
, len
, &retlen
, buf
);
285 D1(printk(KERN_WARNING
"mtd->read(0x%x bytes from 0x%x) returned %d\n", len
, ofs
, ret
));
289 D1(printk(KERN_WARNING
"Read at 0x%x gave only 0x%zx bytes\n", ofs
, retlen
));
295 int jffs2_scan_classify_jeb(struct jffs2_sb_info
*c
, struct jffs2_eraseblock
*jeb
)
297 if ((jeb
->used_size
+ jeb
->unchecked_size
) == PAD(c
->cleanmarker_size
) && !jeb
->dirty_size
298 && (!jeb
->first_node
|| !jeb
->first_node
->next_phys
) )
299 return BLK_STATE_CLEANMARKER
;
301 /* move blocks with max 4 byte dirty space to cleanlist */
302 else if (!ISDIRTY(c
->sector_size
- (jeb
->used_size
+ jeb
->unchecked_size
))) {
303 c
->dirty_size
-= jeb
->dirty_size
;
304 c
->wasted_size
+= jeb
->dirty_size
;
305 jeb
->wasted_size
+= jeb
->dirty_size
;
307 return BLK_STATE_CLEAN
;
308 } else if (jeb
->used_size
|| jeb
->unchecked_size
)
309 return BLK_STATE_PARTDIRTY
;
311 return BLK_STATE_ALLDIRTY
;
314 #ifdef CONFIG_JFFS2_FS_XATTR
315 static int jffs2_scan_xattr_node(struct jffs2_sb_info
*c
, struct jffs2_eraseblock
*jeb
,
316 struct jffs2_raw_xattr
*rx
, uint32_t ofs
,
317 struct jffs2_summary
*s
)
319 struct jffs2_xattr_datum
*xd
;
320 uint32_t totlen
, crc
;
323 crc
= crc32(0, rx
, sizeof(struct jffs2_raw_xattr
) - 4);
324 if (crc
!= je32_to_cpu(rx
->node_crc
)) {
325 if (je32_to_cpu(rx
->node_crc
) != 0xffffffff)
326 JFFS2_WARNING("node CRC failed at %#08x, read=%#08x, calc=%#08x\n",
327 ofs
, je32_to_cpu(rx
->node_crc
), crc
);
328 if ((err
= jffs2_scan_dirty_space(c
, jeb
, je32_to_cpu(rx
->totlen
))))
333 totlen
= PAD(sizeof(*rx
) + rx
->name_len
+ 1 + je16_to_cpu(rx
->value_len
));
334 if (totlen
!= je32_to_cpu(rx
->totlen
)) {
335 JFFS2_WARNING("node length mismatch at %#08x, read=%u, calc=%u\n",
336 ofs
, je32_to_cpu(rx
->totlen
), totlen
);
337 if ((err
= jffs2_scan_dirty_space(c
, jeb
, je32_to_cpu(rx
->totlen
))))
342 xd
= jffs2_setup_xattr_datum(c
, je32_to_cpu(rx
->xid
), je32_to_cpu(rx
->version
));
344 if (PTR_ERR(xd
) == -EEXIST
) {
345 if ((err
= jffs2_scan_dirty_space(c
, jeb
, PAD(je32_to_cpu(rx
->totlen
)))))
351 xd
->xprefix
= rx
->xprefix
;
352 xd
->name_len
= rx
->name_len
;
353 xd
->value_len
= je16_to_cpu(rx
->value_len
);
354 xd
->data_crc
= je32_to_cpu(rx
->data_crc
);
356 xd
->node
= jffs2_link_node_ref(c
, jeb
, ofs
| REF_PRISTINE
, totlen
, NULL
);
357 /* FIXME */ xd
->node
->next_in_ino
= (void *)xd
;
359 if (jffs2_sum_active())
360 jffs2_sum_add_xattr_mem(s
, rx
, ofs
- jeb
->offset
);
361 dbg_xattr("scaning xdatum at %#08x (xid=%u, version=%u)\n",
362 ofs
, xd
->xid
, xd
->version
);
366 static int jffs2_scan_xref_node(struct jffs2_sb_info
*c
, struct jffs2_eraseblock
*jeb
,
367 struct jffs2_raw_xref
*rr
, uint32_t ofs
,
368 struct jffs2_summary
*s
)
370 struct jffs2_xattr_ref
*ref
;
374 crc
= crc32(0, rr
, sizeof(*rr
) - 4);
375 if (crc
!= je32_to_cpu(rr
->node_crc
)) {
376 if (je32_to_cpu(rr
->node_crc
) != 0xffffffff)
377 JFFS2_WARNING("node CRC failed at %#08x, read=%#08x, calc=%#08x\n",
378 ofs
, je32_to_cpu(rr
->node_crc
), crc
);
379 if ((err
= jffs2_scan_dirty_space(c
, jeb
, PAD(je32_to_cpu(rr
->totlen
)))))
384 if (PAD(sizeof(struct jffs2_raw_xref
)) != je32_to_cpu(rr
->totlen
)) {
385 JFFS2_WARNING("node length mismatch at %#08x, read=%u, calc=%u\n",
386 ofs
, je32_to_cpu(rr
->totlen
),
387 PAD(sizeof(struct jffs2_raw_xref
)));
388 if ((err
= jffs2_scan_dirty_space(c
, jeb
, je32_to_cpu(rr
->totlen
))))
393 ref
= jffs2_alloc_xattr_ref();
397 /* BEFORE jffs2_build_xattr_subsystem() called,
398 * ref->xid is used to store 32bit xid, xd is not used
399 * ref->ino is used to store 32bit inode-number, ic is not used
400 * Thoes variables are declared as union, thus using those
401 * are exclusive. In a similar way, ref->next is temporarily
402 * used to chain all xattr_ref object. It's re-chained to
403 * jffs2_inode_cache in jffs2_build_xattr_subsystem() correctly.
405 ref
->ino
= je32_to_cpu(rr
->ino
);
406 ref
->xid
= je32_to_cpu(rr
->xid
);
407 ref
->next
= c
->xref_temp
;
410 ref
->node
= jffs2_link_node_ref(c
, jeb
, ofs
| REF_PRISTINE
, PAD(je32_to_cpu(rr
->totlen
)), NULL
);
411 /* FIXME */ ref
->node
->next_in_ino
= (void *)ref
;
413 if (jffs2_sum_active())
414 jffs2_sum_add_xref_mem(s
, rr
, ofs
- jeb
->offset
);
415 dbg_xattr("scan xref at %#08x (xid=%u, ino=%u)\n",
416 ofs
, ref
->xid
, ref
->ino
);
421 /* Called with 'buf_size == 0' if buf is in fact a pointer _directly_ into
422 the flash, XIP-style */
423 static int jffs2_scan_eraseblock (struct jffs2_sb_info
*c
, struct jffs2_eraseblock
*jeb
,
424 unsigned char *buf
, uint32_t buf_size
, struct jffs2_summary
*s
) {
425 struct jffs2_unknown_node
*node
;
426 struct jffs2_unknown_node crcnode
;
427 uint32_t ofs
, prevofs
;
428 uint32_t hdr_crc
, buf_ofs
, buf_len
;
433 #ifdef CONFIG_JFFS2_FS_WRITEBUFFER
434 int cleanmarkerfound
= 0;
438 prevofs
= jeb
->offset
- 1;
440 D1(printk(KERN_DEBUG
"jffs2_scan_eraseblock(): Scanning block at 0x%x\n", ofs
));
442 #ifdef CONFIG_JFFS2_FS_WRITEBUFFER
443 if (jffs2_cleanmarker_oob(c
)) {
444 int ret
= jffs2_check_nand_cleanmarker(c
, jeb
);
445 D2(printk(KERN_NOTICE
"jffs_check_nand_cleanmarker returned %d\n",ret
));
446 /* Even if it's not found, we still scan to see
447 if the block is empty. We use this information
448 to decide whether to erase it or not. */
450 case 0: cleanmarkerfound
= 1; break;
452 case 2: return BLK_STATE_BADBLOCK
;
453 case 3: return BLK_STATE_ALLDIRTY
; /* Block has failed to erase min. once */
459 if (jffs2_sum_active()) {
460 struct jffs2_sum_marker
*sm
;
465 /* XIP case. Just look, point at the summary if it's there */
466 sm
= (void *)buf
+ jeb
->offset
- sizeof(*sm
);
467 if (je32_to_cpu(sm
->magic
) == JFFS2_SUM_MAGIC
) {
468 sumptr
= buf
+ je32_to_cpu(sm
->offset
);
469 sumlen
= c
->sector_size
- je32_to_cpu(sm
->offset
);
472 /* If NAND flash, read a whole page of it. Else just the end */
473 if (c
->wbuf_pagesize
)
474 buf_len
= c
->wbuf_pagesize
;
476 buf_len
= sizeof(*sm
);
478 /* Read as much as we want into the _end_ of the preallocated buffer */
479 err
= jffs2_fill_scan_buf(c
, buf
+ buf_size
- buf_len
,
480 jeb
->offset
+ c
->sector_size
- buf_len
,
485 sm
= (void *)buf
+ buf_size
- sizeof(*sm
);
486 if (je32_to_cpu(sm
->magic
) == JFFS2_SUM_MAGIC
) {
487 sumlen
= c
->sector_size
- je32_to_cpu(sm
->offset
);
488 sumptr
= buf
+ buf_size
- sumlen
;
490 /* Now, make sure the summary itself is available */
491 if (sumlen
> buf_size
) {
492 /* Need to kmalloc for this. */
493 sumptr
= kmalloc(sumlen
, GFP_KERNEL
);
496 memcpy(sumptr
+ sumlen
- buf_len
, buf
+ buf_size
- buf_len
, buf_len
);
498 if (buf_len
< sumlen
) {
499 /* Need to read more so that the entire summary node is present */
500 err
= jffs2_fill_scan_buf(c
, sumptr
,
501 jeb
->offset
+ c
->sector_size
- sumlen
,
511 err
= jffs2_sum_scan_sumnode(c
, jeb
, sumptr
, sumlen
, &pseudo_random
);
513 if (buf_size
&& sumlen
> buf_size
)
515 /* If it returns with a real error, bail.
516 If it returns positive, that's a block classification
517 (i.e. BLK_STATE_xxx) so return that too.
518 If it returns zero, fall through to full scan. */
524 buf_ofs
= jeb
->offset
;
527 /* This is the XIP case -- we're reading _directly_ from the flash chip */
528 buf_len
= c
->sector_size
;
530 buf_len
= EMPTY_SCAN_SIZE(c
->sector_size
);
531 err
= jffs2_fill_scan_buf(c
, buf
, buf_ofs
, buf_len
);
536 /* We temporarily use 'ofs' as a pointer into the buffer/jeb */
539 /* Scan only 4KiB of 0xFF before declaring it's empty */
540 while(ofs
< EMPTY_SCAN_SIZE(c
->sector_size
) && *(uint32_t *)(&buf
[ofs
]) == 0xFFFFFFFF)
543 if (ofs
== EMPTY_SCAN_SIZE(c
->sector_size
)) {
544 #ifdef CONFIG_JFFS2_FS_WRITEBUFFER
545 if (jffs2_cleanmarker_oob(c
)) {
546 /* scan oob, take care of cleanmarker */
547 int ret
= jffs2_check_oob_empty(c
, jeb
, cleanmarkerfound
);
548 D2(printk(KERN_NOTICE
"jffs2_check_oob_empty returned %d\n",ret
));
550 case 0: return cleanmarkerfound
? BLK_STATE_CLEANMARKER
: BLK_STATE_ALLFF
;
551 case 1: return BLK_STATE_ALLDIRTY
;
556 D1(printk(KERN_DEBUG
"Block at 0x%08x is empty (erased)\n", jeb
->offset
));
557 if (c
->cleanmarker_size
== 0)
558 return BLK_STATE_CLEANMARKER
; /* don't bother with re-erase */
560 return BLK_STATE_ALLFF
; /* OK to erase if all blocks are like this */
563 D1(printk(KERN_DEBUG
"Free space at %08x ends at %08x\n", jeb
->offset
,
565 if ((err
= jffs2_scan_dirty_space(c
, jeb
, ofs
)))
569 /* Now ofs is a complete physical flash offset as it always was... */
574 dbg_summary("no summary found in jeb 0x%08x. Apply original scan.\n",jeb
->offset
);
577 while(ofs
< jeb
->offset
+ c
->sector_size
) {
579 jffs2_dbg_acct_paranoia_check_nolock(c
, jeb
);
581 /* Make sure there are node refs available for use */
582 err
= jffs2_prealloc_raw_node_refs(c
, 2);
589 printk(KERN_WARNING
"Eep. ofs 0x%08x not word-aligned!\n", ofs
);
593 if (ofs
== prevofs
) {
594 printk(KERN_WARNING
"ofs 0x%08x has already been seen. Skipping\n", ofs
);
595 if ((err
= jffs2_scan_dirty_space(c
, jeb
, 4)))
602 if (jeb
->offset
+ c
->sector_size
< ofs
+ sizeof(*node
)) {
603 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
),
604 jeb
->offset
, c
->sector_size
, ofs
, sizeof(*node
)));
605 if ((err
= jffs2_scan_dirty_space(c
, jeb
, (jeb
->offset
+ c
->sector_size
)-ofs
)))
610 if (buf_ofs
+ buf_len
< ofs
+ sizeof(*node
)) {
611 buf_len
= min_t(uint32_t, buf_size
, jeb
->offset
+ c
->sector_size
- ofs
);
612 D1(printk(KERN_DEBUG
"Fewer than %zd bytes (node header) left to end of buf. Reading 0x%x at 0x%08x\n",
613 sizeof(struct jffs2_unknown_node
), buf_len
, ofs
));
614 err
= jffs2_fill_scan_buf(c
, buf
, ofs
, buf_len
);
620 node
= (struct jffs2_unknown_node
*)&buf
[ofs
-buf_ofs
];
622 if (*(uint32_t *)(&buf
[ofs
-buf_ofs
]) == 0xffffffff) {
624 uint32_t empty_start
;
629 D1(printk(KERN_DEBUG
"Found empty flash at 0x%08x\n", ofs
));
631 inbuf_ofs
= ofs
- buf_ofs
;
632 while (inbuf_ofs
< buf_len
) {
633 if (*(uint32_t *)(&buf
[inbuf_ofs
]) != 0xffffffff) {
634 printk(KERN_WARNING
"Empty flash at 0x%08x ends at 0x%08x\n",
636 if ((err
= jffs2_scan_dirty_space(c
, jeb
, ofs
-empty_start
)))
645 D1(printk(KERN_DEBUG
"Empty flash to end of buffer at 0x%08x\n", ofs
));
647 /* If we're only checking the beginning of a block with a cleanmarker,
649 if (buf_ofs
== jeb
->offset
&& jeb
->used_size
== PAD(c
->cleanmarker_size
) &&
650 c
->cleanmarker_size
&& !jeb
->dirty_size
&& !jeb
->first_node
->next_phys
) {
651 D1(printk(KERN_DEBUG
"%d bytes at start of block seems clean... assuming all clean\n", EMPTY_SCAN_SIZE(c
->sector_size
)));
652 return BLK_STATE_CLEANMARKER
;
655 /* See how much more there is to read in this eraseblock... */
656 buf_len
= min_t(uint32_t, buf_size
, jeb
->offset
+ c
->sector_size
- ofs
);
658 /* No more to read. Break out of main loop without marking
659 this range of empty space as dirty (because it's not) */
660 D1(printk(KERN_DEBUG
"Empty flash at %08x runs to end of block. Treating as free_space\n",
664 D1(printk(KERN_DEBUG
"Reading another 0x%x at 0x%08x\n", buf_len
, ofs
));
665 err
= jffs2_fill_scan_buf(c
, buf
, ofs
, buf_len
);
672 if (ofs
== jeb
->offset
&& je16_to_cpu(node
->magic
) == KSAMTIB_CIGAM_2SFFJ
) {
673 printk(KERN_WARNING
"Magic bitmask is backwards at offset 0x%08x. Wrong endian filesystem?\n", ofs
);
674 if ((err
= jffs2_scan_dirty_space(c
, jeb
, 4)))
679 if (je16_to_cpu(node
->magic
) == JFFS2_DIRTY_BITMASK
) {
680 D1(printk(KERN_DEBUG
"Dirty bitmask at 0x%08x\n", ofs
));
681 if ((err
= jffs2_scan_dirty_space(c
, jeb
, 4)))
686 if (je16_to_cpu(node
->magic
) == JFFS2_OLD_MAGIC_BITMASK
) {
687 printk(KERN_WARNING
"Old JFFS2 bitmask found at 0x%08x\n", ofs
);
688 printk(KERN_WARNING
"You cannot use older JFFS2 filesystems with newer kernels\n");
689 if ((err
= jffs2_scan_dirty_space(c
, jeb
, 4)))
694 if (je16_to_cpu(node
->magic
) != JFFS2_MAGIC_BITMASK
) {
695 /* OK. We're out of possibilities. Whinge and move on */
696 noisy_printk(&noise
, "jffs2_scan_eraseblock(): Magic bitmask 0x%04x not found at 0x%08x: 0x%04x instead\n",
697 JFFS2_MAGIC_BITMASK
, ofs
,
698 je16_to_cpu(node
->magic
));
699 if ((err
= jffs2_scan_dirty_space(c
, jeb
, 4)))
704 /* We seem to have a node of sorts. Check the CRC */
705 crcnode
.magic
= node
->magic
;
706 crcnode
.nodetype
= cpu_to_je16( je16_to_cpu(node
->nodetype
) | JFFS2_NODE_ACCURATE
);
707 crcnode
.totlen
= node
->totlen
;
708 hdr_crc
= crc32(0, &crcnode
, sizeof(crcnode
)-4);
710 if (hdr_crc
!= je32_to_cpu(node
->hdr_crc
)) {
711 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",
712 ofs
, je16_to_cpu(node
->magic
),
713 je16_to_cpu(node
->nodetype
),
714 je32_to_cpu(node
->totlen
),
715 je32_to_cpu(node
->hdr_crc
),
717 if ((err
= jffs2_scan_dirty_space(c
, jeb
, 4)))
723 if (ofs
+ je32_to_cpu(node
->totlen
) >
724 jeb
->offset
+ c
->sector_size
) {
725 /* Eep. Node goes over the end of the erase block. */
726 printk(KERN_WARNING
"Node at 0x%08x with length 0x%08x would run over the end of the erase block\n",
727 ofs
, je32_to_cpu(node
->totlen
));
728 printk(KERN_WARNING
"Perhaps the file system was created with the wrong erase size?\n");
729 if ((err
= jffs2_scan_dirty_space(c
, jeb
, 4)))
735 if (!(je16_to_cpu(node
->nodetype
) & JFFS2_NODE_ACCURATE
)) {
736 /* Wheee. This is an obsoleted node */
737 D2(printk(KERN_DEBUG
"Node at 0x%08x is obsolete. Skipping\n", ofs
));
738 if ((err
= jffs2_scan_dirty_space(c
, jeb
, PAD(je32_to_cpu(node
->totlen
)))))
740 ofs
+= PAD(je32_to_cpu(node
->totlen
));
744 switch(je16_to_cpu(node
->nodetype
)) {
745 case JFFS2_NODETYPE_INODE
:
746 if (buf_ofs
+ buf_len
< ofs
+ sizeof(struct jffs2_raw_inode
)) {
747 buf_len
= min_t(uint32_t, buf_size
, jeb
->offset
+ c
->sector_size
- ofs
);
748 D1(printk(KERN_DEBUG
"Fewer than %zd bytes (inode node) left to end of buf. Reading 0x%x at 0x%08x\n",
749 sizeof(struct jffs2_raw_inode
), buf_len
, ofs
));
750 err
= jffs2_fill_scan_buf(c
, buf
, ofs
, buf_len
);
756 err
= jffs2_scan_inode_node(c
, jeb
, (void *)node
, ofs
, s
);
758 ofs
+= PAD(je32_to_cpu(node
->totlen
));
761 case JFFS2_NODETYPE_DIRENT
:
762 if (buf_ofs
+ buf_len
< ofs
+ je32_to_cpu(node
->totlen
)) {
763 buf_len
= min_t(uint32_t, buf_size
, jeb
->offset
+ c
->sector_size
- ofs
);
764 D1(printk(KERN_DEBUG
"Fewer than %d bytes (dirent node) left to end of buf. Reading 0x%x at 0x%08x\n",
765 je32_to_cpu(node
->totlen
), buf_len
, ofs
));
766 err
= jffs2_fill_scan_buf(c
, buf
, ofs
, buf_len
);
772 err
= jffs2_scan_dirent_node(c
, jeb
, (void *)node
, ofs
, s
);
774 ofs
+= PAD(je32_to_cpu(node
->totlen
));
777 #ifdef CONFIG_JFFS2_FS_XATTR
778 case JFFS2_NODETYPE_XATTR
:
779 if (buf_ofs
+ buf_len
< ofs
+ je32_to_cpu(node
->totlen
)) {
780 buf_len
= min_t(uint32_t, buf_size
, jeb
->offset
+ c
->sector_size
- ofs
);
781 D1(printk(KERN_DEBUG
"Fewer than %d bytes (xattr node)"
782 " left to end of buf. Reading 0x%x at 0x%08x\n",
783 je32_to_cpu(node
->totlen
), buf_len
, ofs
));
784 err
= jffs2_fill_scan_buf(c
, buf
, ofs
, buf_len
);
790 err
= jffs2_scan_xattr_node(c
, jeb
, (void *)node
, ofs
, s
);
793 ofs
+= PAD(je32_to_cpu(node
->totlen
));
795 case JFFS2_NODETYPE_XREF
:
796 if (buf_ofs
+ buf_len
< ofs
+ je32_to_cpu(node
->totlen
)) {
797 buf_len
= min_t(uint32_t, buf_size
, jeb
->offset
+ c
->sector_size
- ofs
);
798 D1(printk(KERN_DEBUG
"Fewer than %d bytes (xref node)"
799 " left to end of buf. Reading 0x%x at 0x%08x\n",
800 je32_to_cpu(node
->totlen
), buf_len
, ofs
));
801 err
= jffs2_fill_scan_buf(c
, buf
, ofs
, buf_len
);
807 err
= jffs2_scan_xref_node(c
, jeb
, (void *)node
, ofs
, s
);
810 ofs
+= PAD(je32_to_cpu(node
->totlen
));
812 #endif /* CONFIG_JFFS2_FS_XATTR */
814 case JFFS2_NODETYPE_CLEANMARKER
:
815 D1(printk(KERN_DEBUG
"CLEANMARKER node found at 0x%08x\n", ofs
));
816 if (je32_to_cpu(node
->totlen
) != c
->cleanmarker_size
) {
817 printk(KERN_NOTICE
"CLEANMARKER node found at 0x%08x has totlen 0x%x != normal 0x%x\n",
818 ofs
, je32_to_cpu(node
->totlen
), c
->cleanmarker_size
);
819 if ((err
= jffs2_scan_dirty_space(c
, jeb
, PAD(sizeof(struct jffs2_unknown_node
)))))
821 ofs
+= PAD(sizeof(struct jffs2_unknown_node
));
822 } else if (jeb
->first_node
) {
823 printk(KERN_NOTICE
"CLEANMARKER node found at 0x%08x, not first node in block (0x%08x)\n", ofs
, jeb
->offset
);
824 if ((err
= jffs2_scan_dirty_space(c
, jeb
, PAD(sizeof(struct jffs2_unknown_node
)))))
826 ofs
+= PAD(sizeof(struct jffs2_unknown_node
));
828 jffs2_link_node_ref(c
, jeb
, ofs
| REF_NORMAL
, c
->cleanmarker_size
, NULL
);
830 ofs
+= PAD(c
->cleanmarker_size
);
834 case JFFS2_NODETYPE_PADDING
:
835 if (jffs2_sum_active())
836 jffs2_sum_add_padding_mem(s
, je32_to_cpu(node
->totlen
));
837 if ((err
= jffs2_scan_dirty_space(c
, jeb
, PAD(je32_to_cpu(node
->totlen
)))))
839 ofs
+= PAD(je32_to_cpu(node
->totlen
));
843 switch (je16_to_cpu(node
->nodetype
) & JFFS2_COMPAT_MASK
) {
844 case JFFS2_FEATURE_ROCOMPAT
:
845 printk(KERN_NOTICE
"Read-only compatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node
->nodetype
), ofs
);
846 c
->flags
|= JFFS2_SB_FLAG_RO
;
847 if (!(jffs2_is_readonly(c
)))
849 if ((err
= jffs2_scan_dirty_space(c
, jeb
, PAD(je32_to_cpu(node
->totlen
)))))
851 ofs
+= PAD(je32_to_cpu(node
->totlen
));
854 case JFFS2_FEATURE_INCOMPAT
:
855 printk(KERN_NOTICE
"Incompatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node
->nodetype
), ofs
);
858 case JFFS2_FEATURE_RWCOMPAT_DELETE
:
859 D1(printk(KERN_NOTICE
"Unknown but compatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node
->nodetype
), ofs
));
860 if ((err
= jffs2_scan_dirty_space(c
, jeb
, PAD(je32_to_cpu(node
->totlen
)))))
862 ofs
+= PAD(je32_to_cpu(node
->totlen
));
865 case JFFS2_FEATURE_RWCOMPAT_COPY
: {
866 D1(printk(KERN_NOTICE
"Unknown but compatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node
->nodetype
), ofs
));
868 jffs2_link_node_ref(c
, jeb
, ofs
| REF_PRISTINE
, PAD(je32_to_cpu(node
->totlen
)), NULL
);
870 /* We can't summarise nodes we don't grok */
871 jffs2_sum_disable_collecting(s
);
872 ofs
+= PAD(je32_to_cpu(node
->totlen
));
879 if (jffs2_sum_active()) {
880 if (PAD(s
->sum_size
+ JFFS2_SUMMARY_FRAME_SIZE
) > jeb
->free_size
) {
881 dbg_summary("There is not enough space for "
882 "summary information, disabling for this jeb!\n");
883 jffs2_sum_disable_collecting(s
);
887 D1(printk(KERN_DEBUG
"Block at 0x%08x: free 0x%08x, dirty 0x%08x, unchecked 0x%08x, used 0x%08x\n", jeb
->offset
,
888 jeb
->free_size
, jeb
->dirty_size
, jeb
->unchecked_size
, jeb
->used_size
));
890 /* mark_node_obsolete can add to wasted !! */
891 if (jeb
->wasted_size
) {
892 jeb
->dirty_size
+= jeb
->wasted_size
;
893 c
->dirty_size
+= jeb
->wasted_size
;
894 c
->wasted_size
-= jeb
->wasted_size
;
895 jeb
->wasted_size
= 0;
898 return jffs2_scan_classify_jeb(c
, jeb
);
901 struct jffs2_inode_cache
*jffs2_scan_make_ino_cache(struct jffs2_sb_info
*c
, uint32_t ino
)
903 struct jffs2_inode_cache
*ic
;
905 ic
= jffs2_get_ino_cache(c
, ino
);
909 if (ino
> c
->highest_ino
)
910 c
->highest_ino
= ino
;
912 ic
= jffs2_alloc_inode_cache();
914 printk(KERN_NOTICE
"jffs2_scan_make_inode_cache(): allocation of inode cache failed\n");
917 memset(ic
, 0, sizeof(*ic
));
920 ic
->nodes
= (void *)ic
;
921 jffs2_add_ino_cache(c
, ic
);
927 static int jffs2_scan_inode_node(struct jffs2_sb_info
*c
, struct jffs2_eraseblock
*jeb
,
928 struct jffs2_raw_inode
*ri
, uint32_t ofs
, struct jffs2_summary
*s
)
930 struct jffs2_inode_cache
*ic
;
931 uint32_t ino
= je32_to_cpu(ri
->ino
);
934 D1(printk(KERN_DEBUG
"jffs2_scan_inode_node(): Node at 0x%08x\n", ofs
));
936 /* We do very little here now. Just check the ino# to which we should attribute
937 this node; we can do all the CRC checking etc. later. There's a tradeoff here --
938 we used to scan the flash once only, reading everything we want from it into
939 memory, then building all our in-core data structures and freeing the extra
940 information. Now we allow the first part of the mount to complete a lot quicker,
941 but we have to go _back_ to the flash in order to finish the CRC checking, etc.
942 Which means that the _full_ amount of time to get to proper write mode with GC
943 operational may actually be _longer_ than before. Sucks to be me. */
945 ic
= jffs2_get_ino_cache(c
, ino
);
947 /* Inocache get failed. Either we read a bogus ino# or it's just genuinely the
948 first node we found for this inode. Do a CRC check to protect against the former
950 uint32_t crc
= crc32(0, ri
, sizeof(*ri
)-8);
952 if (crc
!= je32_to_cpu(ri
->node_crc
)) {
953 printk(KERN_NOTICE
"jffs2_scan_inode_node(): CRC failed on node at 0x%08x: Read 0x%08x, calculated 0x%08x\n",
954 ofs
, je32_to_cpu(ri
->node_crc
), crc
);
955 /* We believe totlen because the CRC on the node _header_ was OK, just the node itself failed. */
956 if ((err
= jffs2_scan_dirty_space(c
, jeb
, PAD(je32_to_cpu(ri
->totlen
)))))
960 ic
= jffs2_scan_make_ino_cache(c
, ino
);
965 /* Wheee. It worked */
966 jffs2_link_node_ref(c
, jeb
, ofs
| REF_UNCHECKED
, PAD(je32_to_cpu(ri
->totlen
)), ic
);
968 D1(printk(KERN_DEBUG
"Node is ino #%u, version %d. Range 0x%x-0x%x\n",
969 je32_to_cpu(ri
->ino
), je32_to_cpu(ri
->version
),
970 je32_to_cpu(ri
->offset
),
971 je32_to_cpu(ri
->offset
)+je32_to_cpu(ri
->dsize
)));
973 pseudo_random
+= je32_to_cpu(ri
->version
);
975 if (jffs2_sum_active()) {
976 jffs2_sum_add_inode_mem(s
, ri
, ofs
- jeb
->offset
);
982 static int jffs2_scan_dirent_node(struct jffs2_sb_info
*c
, struct jffs2_eraseblock
*jeb
,
983 struct jffs2_raw_dirent
*rd
, uint32_t ofs
, struct jffs2_summary
*s
)
985 struct jffs2_full_dirent
*fd
;
986 struct jffs2_inode_cache
*ic
;
990 D1(printk(KERN_DEBUG
"jffs2_scan_dirent_node(): Node at 0x%08x\n", ofs
));
992 /* We don't get here unless the node is still valid, so we don't have to
993 mask in the ACCURATE bit any more. */
994 crc
= crc32(0, rd
, sizeof(*rd
)-8);
996 if (crc
!= je32_to_cpu(rd
->node_crc
)) {
997 printk(KERN_NOTICE
"jffs2_scan_dirent_node(): Node CRC failed on node at 0x%08x: Read 0x%08x, calculated 0x%08x\n",
998 ofs
, je32_to_cpu(rd
->node_crc
), crc
);
999 /* We believe totlen because the CRC on the node _header_ was OK, just the node itself failed. */
1000 if ((err
= jffs2_scan_dirty_space(c
, jeb
, PAD(je32_to_cpu(rd
->totlen
)))))
1005 pseudo_random
+= je32_to_cpu(rd
->version
);
1007 fd
= jffs2_alloc_full_dirent(rd
->nsize
+1);
1011 memcpy(&fd
->name
, rd
->name
, rd
->nsize
);
1012 fd
->name
[rd
->nsize
] = 0;
1014 crc
= crc32(0, fd
->name
, rd
->nsize
);
1015 if (crc
!= je32_to_cpu(rd
->name_crc
)) {
1016 printk(KERN_NOTICE
"jffs2_scan_dirent_node(): Name CRC failed on node at 0x%08x: Read 0x%08x, calculated 0x%08x\n",
1017 ofs
, je32_to_cpu(rd
->name_crc
), crc
);
1018 D1(printk(KERN_NOTICE
"Name for which CRC failed is (now) '%s', ino #%d\n", fd
->name
, je32_to_cpu(rd
->ino
)));
1019 jffs2_free_full_dirent(fd
);
1020 /* FIXME: Why do we believe totlen? */
1021 /* We believe totlen because the CRC on the node _header_ was OK, just the name failed. */
1022 if ((err
= jffs2_scan_dirty_space(c
, jeb
, PAD(je32_to_cpu(rd
->totlen
)))))
1026 ic
= jffs2_scan_make_ino_cache(c
, je32_to_cpu(rd
->pino
));
1028 jffs2_free_full_dirent(fd
);
1032 fd
->raw
= jffs2_link_node_ref(c
, jeb
, ofs
| REF_PRISTINE
, PAD(je32_to_cpu(rd
->totlen
)), ic
);
1035 fd
->version
= je32_to_cpu(rd
->version
);
1036 fd
->ino
= je32_to_cpu(rd
->ino
);
1037 fd
->nhash
= full_name_hash(fd
->name
, rd
->nsize
);
1038 fd
->type
= rd
->type
;
1039 jffs2_add_fd_to_list(c
, fd
, &ic
->scan_dents
);
1041 if (jffs2_sum_active()) {
1042 jffs2_sum_add_dirent_mem(s
, rd
, ofs
- jeb
->offset
);
1048 static int count_list(struct list_head
*l
)
1051 struct list_head
*tmp
;
1053 list_for_each(tmp
, l
) {
1059 /* Note: This breaks if list_empty(head). I don't care. You
1060 might, if you copy this code and use it elsewhere :) */
1061 static void rotate_list(struct list_head
*head
, uint32_t count
)
1063 struct list_head
*n
= head
->next
;
1072 void jffs2_rotate_lists(struct jffs2_sb_info
*c
)
1077 x
= count_list(&c
->clean_list
);
1079 rotateby
= pseudo_random
% x
;
1080 rotate_list((&c
->clean_list
), rotateby
);
1083 x
= count_list(&c
->very_dirty_list
);
1085 rotateby
= pseudo_random
% x
;
1086 rotate_list((&c
->very_dirty_list
), rotateby
);
1089 x
= count_list(&c
->dirty_list
);
1091 rotateby
= pseudo_random
% x
;
1092 rotate_list((&c
->dirty_list
), rotateby
);
1095 x
= count_list(&c
->erasable_list
);
1097 rotateby
= pseudo_random
% x
;
1098 rotate_list((&c
->erasable_list
), rotateby
);
1101 if (c
->nr_erasing_blocks
) {
1102 rotateby
= pseudo_random
% c
->nr_erasing_blocks
;
1103 rotate_list((&c
->erase_pending_list
), rotateby
);
1106 if (c
->nr_free_blocks
) {
1107 rotateby
= pseudo_random
% c
->nr_free_blocks
;
1108 rotate_list((&c
->free_list
), rotateby
);