2 * JFFS2 -- Journalling Flash File System, Version 2.
4 * Copyright © 2001-2007 Red Hat, Inc.
6 * Created by David Woodhouse <dwmw2@infradead.org>
8 * For licensing information, see the file 'LICENCE' in this directory.
12 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
14 #include <linux/kernel.h>
15 #include <linux/mtd/mtd.h>
16 #include <linux/compiler.h>
17 #include <linux/sched.h> /* For cond_resched() */
22 * jffs2_reserve_space - request physical space to write nodes to flash
24 * @minsize: Minimum acceptable size of allocation
25 * @len: Returned value of allocation length
26 * @prio: Allocation type - ALLOC_{NORMAL,DELETION}
28 * Requests a block of physical space on the flash. Returns zero for success
29 * and puts 'len' into the appropriate place, or returns -ENOSPC or other
30 * error if appropriate. Doesn't return len since that's
32 * If it returns zero, jffs2_reserve_space() also downs the per-filesystem
33 * allocation semaphore, to prevent more than one allocation from being
34 * active at any time. The semaphore is later released by jffs2_commit_allocation()
36 * jffs2_reserve_space() may trigger garbage collection in order to make room
37 * for the requested allocation.
40 static int jffs2_do_reserve_space(struct jffs2_sb_info *c, uint32_t minsize,
41 uint32_t *len, uint32_t sumsize);
43 int jffs2_reserve_space(struct jffs2_sb_info *c, uint32_t minsize,
44 uint32_t *len, int prio, uint32_t sumsize)
47 int blocksneeded = c->resv_blocks_write;
49 minsize = PAD(minsize);
51 jffs2_dbg(1, "%s(): Requested 0x%x bytes\n", __func__, minsize);
52 mutex_lock(&c->alloc_sem);
54 jffs2_dbg(1, "%s(): alloc sem got\n", __func__);
56 spin_lock(&c->erase_completion_lock);
58 /* this needs a little more thought (true <tglx> :)) */
59 while(ret == -EAGAIN) {
60 while(c->nr_free_blocks + c->nr_erasing_blocks < blocksneeded) {
61 uint32_t dirty, avail;
63 /* calculate real dirty size
64 * dirty_size contains blocks on erase_pending_list
65 * those blocks are counted in c->nr_erasing_blocks.
66 * If one block is actually erased, it is not longer counted as dirty_space
67 * but it is counted in c->nr_erasing_blocks, so we add it and subtract it
68 * with c->nr_erasing_blocks * c->sector_size again.
69 * Blocks on erasable_list are counted as dirty_size, but not in c->nr_erasing_blocks
70 * This helps us to force gc and pick eventually a clean block to spread the load.
71 * We add unchecked_size here, as we hopefully will find some space to use.
72 * This will affect the sum only once, as gc first finishes checking
75 dirty = c->dirty_size + c->erasing_size - c->nr_erasing_blocks * c->sector_size + c->unchecked_size;
76 if (dirty < c->nospc_dirty_size) {
77 if (prio == ALLOC_DELETION && c->nr_free_blocks + c->nr_erasing_blocks >= c->resv_blocks_deletion) {
78 jffs2_dbg(1, "%s(): Low on dirty space to GC, but it's a deletion. Allowing...\n",
82 jffs2_dbg(1, "dirty size 0x%08x + unchecked_size 0x%08x < nospc_dirty_size 0x%08x, returning -ENOSPC\n",
83 dirty, c->unchecked_size,
86 spin_unlock(&c->erase_completion_lock);
87 mutex_unlock(&c->alloc_sem);
91 /* Calc possibly available space. Possibly available means that we
92 * don't know, if unchecked size contains obsoleted nodes, which could give us some
93 * more usable space. This will affect the sum only once, as gc first finishes checking
95 + Return -ENOSPC, if the maximum possibly available space is less or equal than
96 * blocksneeded * sector_size.
97 * This blocks endless gc looping on a filesystem, which is nearly full, even if
98 * the check above passes.
100 avail = c->free_size + c->dirty_size + c->erasing_size + c->unchecked_size;
101 if ( (avail / c->sector_size) <= blocksneeded) {
102 if (prio == ALLOC_DELETION && c->nr_free_blocks + c->nr_erasing_blocks >= c->resv_blocks_deletion) {
103 jffs2_dbg(1, "%s(): Low on possibly available space, but it's a deletion. Allowing...\n",
108 jffs2_dbg(1, "max. available size 0x%08x < blocksneeded * sector_size 0x%08x, returning -ENOSPC\n",
109 avail, blocksneeded * c->sector_size);
110 spin_unlock(&c->erase_completion_lock);
111 mutex_unlock(&c->alloc_sem);
115 mutex_unlock(&c->alloc_sem);
117 jffs2_dbg(1, "Triggering GC pass. nr_free_blocks %d, nr_erasing_blocks %d, free_size 0x%08x, dirty_size 0x%08x, wasted_size 0x%08x, used_size 0x%08x, erasing_size 0x%08x, bad_size 0x%08x (total 0x%08x of 0x%08x)\n",
118 c->nr_free_blocks, c->nr_erasing_blocks,
119 c->free_size, c->dirty_size, c->wasted_size,
120 c->used_size, c->erasing_size, c->bad_size,
121 c->free_size + c->dirty_size +
122 c->wasted_size + c->used_size +
123 c->erasing_size + c->bad_size,
125 spin_unlock(&c->erase_completion_lock);
127 ret = jffs2_garbage_collect_pass(c);
129 if (ret == -EAGAIN) {
130 spin_lock(&c->erase_completion_lock);
131 if (c->nr_erasing_blocks &&
132 list_empty(&c->erase_pending_list) &&
133 list_empty(&c->erase_complete_list)) {
134 DECLARE_WAITQUEUE(wait, current);
135 set_current_state(TASK_UNINTERRUPTIBLE);
136 add_wait_queue(&c->erase_wait, &wait);
137 jffs2_dbg(1, "%s waiting for erase to complete\n",
139 spin_unlock(&c->erase_completion_lock);
143 spin_unlock(&c->erase_completion_lock);
149 if (signal_pending(current))
152 mutex_lock(&c->alloc_sem);
153 spin_lock(&c->erase_completion_lock);
156 ret = jffs2_do_reserve_space(c, minsize, len, sumsize);
158 jffs2_dbg(1, "%s(): ret is %d\n", __func__, ret);
161 spin_unlock(&c->erase_completion_lock);
163 ret = jffs2_prealloc_raw_node_refs(c, c->nextblock, 1);
165 mutex_unlock(&c->alloc_sem);
169 int jffs2_reserve_space_gc(struct jffs2_sb_info *c, uint32_t minsize,
170 uint32_t *len, uint32_t sumsize)
173 minsize = PAD(minsize);
175 jffs2_dbg(1, "%s(): Requested 0x%x bytes\n", __func__, minsize);
177 spin_lock(&c->erase_completion_lock);
178 while(ret == -EAGAIN) {
179 ret = jffs2_do_reserve_space(c, minsize, len, sumsize);
181 jffs2_dbg(1, "%s(): looping, ret is %d\n",
185 spin_unlock(&c->erase_completion_lock);
187 ret = jffs2_prealloc_raw_node_refs(c, c->nextblock, 1);
193 /* Classify nextblock (clean, dirty of verydirty) and force to select an other one */
195 static void jffs2_close_nextblock(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb)
198 if (c->nextblock == NULL) {
199 jffs2_dbg(1, "%s(): Erase block at 0x%08x has already been placed in a list\n",
200 __func__, jeb->offset);
203 /* Check, if we have a dirty block now, or if it was dirty already */
204 if (ISDIRTY (jeb->wasted_size + jeb->dirty_size)) {
205 c->dirty_size += jeb->wasted_size;
206 c->wasted_size -= jeb->wasted_size;
207 jeb->dirty_size += jeb->wasted_size;
208 jeb->wasted_size = 0;
209 if (VERYDIRTY(c, jeb->dirty_size)) {
210 jffs2_dbg(1, "Adding full erase block at 0x%08x to very_dirty_list (free 0x%08x, dirty 0x%08x, used 0x%08x\n",
211 jeb->offset, jeb->free_size, jeb->dirty_size,
213 list_add_tail(&jeb->list, &c->very_dirty_list);
215 jffs2_dbg(1, "Adding full erase block at 0x%08x to dirty_list (free 0x%08x, dirty 0x%08x, used 0x%08x\n",
216 jeb->offset, jeb->free_size, jeb->dirty_size,
218 list_add_tail(&jeb->list, &c->dirty_list);
221 jffs2_dbg(1, "Adding full erase block at 0x%08x to clean_list (free 0x%08x, dirty 0x%08x, used 0x%08x\n",
222 jeb->offset, jeb->free_size, jeb->dirty_size,
224 list_add_tail(&jeb->list, &c->clean_list);
230 /* Select a new jeb for nextblock */
232 static int jffs2_find_nextblock(struct jffs2_sb_info *c)
234 struct list_head *next;
236 /* Take the next block off the 'free' list */
238 if (list_empty(&c->free_list)) {
240 if (!c->nr_erasing_blocks &&
241 !list_empty(&c->erasable_list)) {
242 struct jffs2_eraseblock *ejeb;
244 ejeb = list_entry(c->erasable_list.next, struct jffs2_eraseblock, list);
245 list_move_tail(&ejeb->list, &c->erase_pending_list);
246 c->nr_erasing_blocks++;
247 jffs2_garbage_collect_trigger(c);
248 jffs2_dbg(1, "%s(): Triggering erase of erasable block at 0x%08x\n",
249 __func__, ejeb->offset);
252 if (!c->nr_erasing_blocks &&
253 !list_empty(&c->erasable_pending_wbuf_list)) {
254 jffs2_dbg(1, "%s(): Flushing write buffer\n",
256 /* c->nextblock is NULL, no update to c->nextblock allowed */
257 spin_unlock(&c->erase_completion_lock);
258 jffs2_flush_wbuf_pad(c);
259 spin_lock(&c->erase_completion_lock);
260 /* Have another go. It'll be on the erasable_list now */
264 if (!c->nr_erasing_blocks) {
265 /* Ouch. We're in GC, or we wouldn't have got here.
266 And there's no space left. At all. */
267 pr_crit("Argh. No free space left for GC. nr_erasing_blocks is %d. nr_free_blocks is %d. (erasableempty: %s, erasingempty: %s, erasependingempty: %s)\n",
268 c->nr_erasing_blocks, c->nr_free_blocks,
269 list_empty(&c->erasable_list) ? "yes" : "no",
270 list_empty(&c->erasing_list) ? "yes" : "no",
271 list_empty(&c->erase_pending_list) ? "yes" : "no");
275 spin_unlock(&c->erase_completion_lock);
276 /* Don't wait for it; just erase one right now */
277 jffs2_erase_pending_blocks(c, 1);
278 spin_lock(&c->erase_completion_lock);
280 /* An erase may have failed, decreasing the
281 amount of free space available. So we must
282 restart from the beginning */
286 next = c->free_list.next;
288 c->nextblock = list_entry(next, struct jffs2_eraseblock, list);
291 jffs2_sum_reset_collected(c->summary); /* reset collected summary */
293 #ifdef CONFIG_JFFS2_FS_WRITEBUFFER
294 /* adjust write buffer offset, else we get a non contiguous write bug */
295 if (!(c->wbuf_ofs % c->sector_size) && !c->wbuf_len)
296 c->wbuf_ofs = 0xffffffff;
299 jffs2_dbg(1, "%s(): new nextblock = 0x%08x\n",
300 __func__, c->nextblock->offset);
305 /* Called with alloc sem _and_ erase_completion_lock */
306 static int jffs2_do_reserve_space(struct jffs2_sb_info *c, uint32_t minsize,
307 uint32_t *len, uint32_t sumsize)
309 struct jffs2_eraseblock *jeb = c->nextblock;
310 uint32_t reserved_size; /* for summary information at the end of the jeb */
316 if (jffs2_sum_active() && (sumsize != JFFS2_SUMMARY_NOSUM_SIZE)) {
317 /* NOSUM_SIZE means not to generate summary */
320 reserved_size = PAD(sumsize + c->summary->sum_size + JFFS2_SUMMARY_FRAME_SIZE);
321 dbg_summary("minsize=%d , jeb->free=%d ,"
322 "summary->size=%d , sumsize=%d\n",
323 minsize, jeb->free_size,
324 c->summary->sum_size, sumsize);
327 /* Is there enough space for writing out the current node, or we have to
328 write out summary information now, close this jeb and select new nextblock? */
329 if (jeb && (PAD(minsize) + PAD(c->summary->sum_size + sumsize +
330 JFFS2_SUMMARY_FRAME_SIZE) > jeb->free_size)) {
332 /* Has summary been disabled for this jeb? */
333 if (jffs2_sum_is_disabled(c->summary)) {
334 sumsize = JFFS2_SUMMARY_NOSUM_SIZE;
338 /* Writing out the collected summary information */
339 dbg_summary("generating summary for 0x%08x.\n", jeb->offset);
340 ret = jffs2_sum_write_sumnode(c);
345 if (jffs2_sum_is_disabled(c->summary)) {
346 /* jffs2_write_sumnode() couldn't write out the summary information
347 diabling summary for this jeb and free the collected information
349 sumsize = JFFS2_SUMMARY_NOSUM_SIZE;
353 jffs2_close_nextblock(c, jeb);
355 /* keep always valid value in reserved_size */
356 reserved_size = PAD(sumsize + c->summary->sum_size + JFFS2_SUMMARY_FRAME_SIZE);
359 if (jeb && minsize > jeb->free_size) {
362 /* Skip the end of this block and file it as having some dirty space */
363 /* If there's a pending write to it, flush now */
365 if (jffs2_wbuf_dirty(c)) {
366 spin_unlock(&c->erase_completion_lock);
367 jffs2_dbg(1, "%s(): Flushing write buffer\n",
369 jffs2_flush_wbuf_pad(c);
370 spin_lock(&c->erase_completion_lock);
375 spin_unlock(&c->erase_completion_lock);
377 ret = jffs2_prealloc_raw_node_refs(c, jeb, 1);
380 /* Just lock it again and continue. Nothing much can change because
381 we hold c->alloc_sem anyway. In fact, it's not entirely clear why
382 we hold c->erase_completion_lock in the majority of this function...
383 but that's a question for another (more caffeine-rich) day. */
384 spin_lock(&c->erase_completion_lock);
386 waste = jeb->free_size;
387 jffs2_link_node_ref(c, jeb,
388 (jeb->offset + c->sector_size - waste) | REF_OBSOLETE,
390 /* FIXME: that made it count as dirty. Convert to wasted */
391 jeb->dirty_size -= waste;
392 c->dirty_size -= waste;
393 jeb->wasted_size += waste;
394 c->wasted_size += waste;
396 jffs2_close_nextblock(c, jeb);
403 ret = jffs2_find_nextblock(c);
409 if (jeb->free_size != c->sector_size - c->cleanmarker_size) {
410 pr_warn("Eep. Block 0x%08x taken from free_list had free_size of 0x%08x!!\n",
411 jeb->offset, jeb->free_size);
415 /* OK, jeb (==c->nextblock) is now pointing at a block which definitely has
417 *len = jeb->free_size - reserved_size;
419 if (c->cleanmarker_size && jeb->used_size == c->cleanmarker_size &&
420 !jeb->first_node->next_in_ino) {
421 /* Only node in it beforehand was a CLEANMARKER node (we think).
422 So mark it obsolete now that there's going to be another node
423 in the block. This will reduce used_size to zero but We've
424 already set c->nextblock so that jffs2_mark_node_obsolete()
425 won't try to refile it to the dirty_list.
427 spin_unlock(&c->erase_completion_lock);
428 jffs2_mark_node_obsolete(c, jeb->first_node);
429 spin_lock(&c->erase_completion_lock);
432 jffs2_dbg(1, "%s(): Giving 0x%x bytes at 0x%x\n",
434 *len, jeb->offset + (c->sector_size - jeb->free_size));
439 * jffs2_add_physical_node_ref - add a physical node reference to the list
440 * @c: superblock info
441 * @new: new node reference to add
442 * @len: length of this physical node
444 * Should only be used to report nodes for which space has been allocated
445 * by jffs2_reserve_space.
447 * Must be called with the alloc_sem held.
450 struct jffs2_raw_node_ref *jffs2_add_physical_node_ref(struct jffs2_sb_info *c,
451 uint32_t ofs, uint32_t len,
452 struct jffs2_inode_cache *ic)
454 struct jffs2_eraseblock *jeb;
455 struct jffs2_raw_node_ref *new;
457 jeb = &c->blocks[ofs / c->sector_size];
459 jffs2_dbg(1, "%s(): Node at 0x%x(%d), size 0x%x\n",
460 __func__, ofs & ~3, ofs & 3, len);
462 /* Allow non-obsolete nodes only to be added at the end of c->nextblock,
463 if c->nextblock is set. Note that wbuf.c will file obsolete nodes
464 even after refiling c->nextblock */
465 if ((c->nextblock || ((ofs & 3) != REF_OBSOLETE))
466 && (jeb != c->nextblock || (ofs & ~3) != jeb->offset + (c->sector_size - jeb->free_size))) {
467 pr_warn("argh. node added in wrong place at 0x%08x(%d)\n",
470 pr_warn("nextblock 0x%08x", c->nextblock->offset);
472 pr_warn("No nextblock");
473 pr_cont(", expected at %08x\n",
474 jeb->offset + (c->sector_size - jeb->free_size));
475 return ERR_PTR(-EINVAL);
478 spin_lock(&c->erase_completion_lock);
480 new = jffs2_link_node_ref(c, jeb, ofs, len, ic);
482 if (!jeb->free_size && !jeb->dirty_size && !ISDIRTY(jeb->wasted_size)) {
483 /* If it lives on the dirty_list, jffs2_reserve_space will put it there */
484 jffs2_dbg(1, "Adding full erase block at 0x%08x to clean_list (free 0x%08x, dirty 0x%08x, used 0x%08x\n",
485 jeb->offset, jeb->free_size, jeb->dirty_size,
487 if (jffs2_wbuf_dirty(c)) {
488 /* Flush the last write in the block if it's outstanding */
489 spin_unlock(&c->erase_completion_lock);
490 jffs2_flush_wbuf_pad(c);
491 spin_lock(&c->erase_completion_lock);
494 list_add_tail(&jeb->list, &c->clean_list);
497 jffs2_dbg_acct_sanity_check_nolock(c,jeb);
498 jffs2_dbg_acct_paranoia_check_nolock(c, jeb);
500 spin_unlock(&c->erase_completion_lock);
506 void jffs2_complete_reservation(struct jffs2_sb_info *c)
508 jffs2_dbg(1, "jffs2_complete_reservation()\n");
509 spin_lock(&c->erase_completion_lock);
510 jffs2_garbage_collect_trigger(c);
511 spin_unlock(&c->erase_completion_lock);
512 mutex_unlock(&c->alloc_sem);
515 static inline int on_list(struct list_head *obj, struct list_head *head)
517 struct list_head *this;
519 list_for_each(this, head) {
521 jffs2_dbg(1, "%p is on list at %p\n", obj, head);
529 void jffs2_mark_node_obsolete(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *ref)
531 struct jffs2_eraseblock *jeb;
533 struct jffs2_unknown_node n;
539 pr_notice("EEEEEK. jffs2_mark_node_obsolete called with NULL node\n");
542 if (ref_obsolete(ref)) {
543 jffs2_dbg(1, "%s(): called with already obsolete node at 0x%08x\n",
544 __func__, ref_offset(ref));
547 blocknr = ref->flash_offset / c->sector_size;
548 if (blocknr >= c->nr_blocks) {
549 pr_notice("raw node at 0x%08x is off the end of device!\n",
553 jeb = &c->blocks[blocknr];
555 if (jffs2_can_mark_obsolete(c) && !jffs2_is_readonly(c) &&
556 !(c->flags & (JFFS2_SB_FLAG_SCANNING | JFFS2_SB_FLAG_BUILDING))) {
557 /* Hm. This may confuse static lock analysis. If any of the above
558 three conditions is false, we're going to return from this
559 function without actually obliterating any nodes or freeing
560 any jffs2_raw_node_refs. So we don't need to stop erases from
561 happening, or protect against people holding an obsolete
562 jffs2_raw_node_ref without the erase_completion_lock. */
563 mutex_lock(&c->erase_free_sem);
566 spin_lock(&c->erase_completion_lock);
568 freed_len = ref_totlen(c, jeb, ref);
570 if (ref_flags(ref) == REF_UNCHECKED) {
571 D1(if (unlikely(jeb->unchecked_size < freed_len)) {
572 pr_notice("raw unchecked node of size 0x%08x freed from erase block %d at 0x%08x, but unchecked_size was already 0x%08x\n",
574 ref->flash_offset, jeb->used_size);
577 jffs2_dbg(1, "Obsoleting previously unchecked node at 0x%08x of len %x\n",
578 ref_offset(ref), freed_len);
579 jeb->unchecked_size -= freed_len;
580 c->unchecked_size -= freed_len;
582 D1(if (unlikely(jeb->used_size < freed_len)) {
583 pr_notice("raw node of size 0x%08x freed from erase block %d at 0x%08x, but used_size was already 0x%08x\n",
585 ref->flash_offset, jeb->used_size);
588 jffs2_dbg(1, "Obsoleting node at 0x%08x of len %#x: ",
589 ref_offset(ref), freed_len);
590 jeb->used_size -= freed_len;
591 c->used_size -= freed_len;
594 // Take care, that wasted size is taken into concern
595 if ((jeb->dirty_size || ISDIRTY(jeb->wasted_size + freed_len)) && jeb != c->nextblock) {
596 jffs2_dbg(1, "Dirtying\n");
597 addedsize = freed_len;
598 jeb->dirty_size += freed_len;
599 c->dirty_size += freed_len;
601 /* Convert wasted space to dirty, if not a bad block */
602 if (jeb->wasted_size) {
603 if (on_list(&jeb->list, &c->bad_used_list)) {
604 jffs2_dbg(1, "Leaving block at %08x on the bad_used_list\n",
606 addedsize = 0; /* To fool the refiling code later */
608 jffs2_dbg(1, "Converting %d bytes of wasted space to dirty in block at %08x\n",
609 jeb->wasted_size, jeb->offset);
610 addedsize += jeb->wasted_size;
611 jeb->dirty_size += jeb->wasted_size;
612 c->dirty_size += jeb->wasted_size;
613 c->wasted_size -= jeb->wasted_size;
614 jeb->wasted_size = 0;
618 jffs2_dbg(1, "Wasting\n");
620 jeb->wasted_size += freed_len;
621 c->wasted_size += freed_len;
623 ref->flash_offset = ref_offset(ref) | REF_OBSOLETE;
625 jffs2_dbg_acct_sanity_check_nolock(c, jeb);
626 jffs2_dbg_acct_paranoia_check_nolock(c, jeb);
628 if (c->flags & JFFS2_SB_FLAG_SCANNING) {
629 /* Flash scanning is in progress. Don't muck about with the block
630 lists because they're not ready yet, and don't actually
631 obliterate nodes that look obsolete. If they weren't
632 marked obsolete on the flash at the time they _became_
633 obsolete, there was probably a reason for that. */
634 spin_unlock(&c->erase_completion_lock);
635 /* We didn't lock the erase_free_sem */
639 if (jeb == c->nextblock) {
640 jffs2_dbg(2, "Not moving nextblock 0x%08x to dirty/erase_pending list\n",
642 } else if (!jeb->used_size && !jeb->unchecked_size) {
643 if (jeb == c->gcblock) {
644 jffs2_dbg(1, "gcblock at 0x%08x completely dirtied. Clearing gcblock...\n",
648 jffs2_dbg(1, "Eraseblock at 0x%08x completely dirtied. Removing from (dirty?) list...\n",
650 list_del(&jeb->list);
652 if (jffs2_wbuf_dirty(c)) {
653 jffs2_dbg(1, "...and adding to erasable_pending_wbuf_list\n");
654 list_add_tail(&jeb->list, &c->erasable_pending_wbuf_list);
657 /* Most of the time, we just erase it immediately. Otherwise we
658 spend ages scanning it on mount, etc. */
659 jffs2_dbg(1, "...and adding to erase_pending_list\n");
660 list_add_tail(&jeb->list, &c->erase_pending_list);
661 c->nr_erasing_blocks++;
662 jffs2_garbage_collect_trigger(c);
664 /* Sometimes, however, we leave it elsewhere so it doesn't get
665 immediately reused, and we spread the load a bit. */
666 jffs2_dbg(1, "...and adding to erasable_list\n");
667 list_add_tail(&jeb->list, &c->erasable_list);
670 jffs2_dbg(1, "Done OK\n");
671 } else if (jeb == c->gcblock) {
672 jffs2_dbg(2, "Not moving gcblock 0x%08x to dirty_list\n",
674 } else if (ISDIRTY(jeb->dirty_size) && !ISDIRTY(jeb->dirty_size - addedsize)) {
675 jffs2_dbg(1, "Eraseblock at 0x%08x is freshly dirtied. Removing from clean list...\n",
677 list_del(&jeb->list);
678 jffs2_dbg(1, "...and adding to dirty_list\n");
679 list_add_tail(&jeb->list, &c->dirty_list);
680 } else if (VERYDIRTY(c, jeb->dirty_size) &&
681 !VERYDIRTY(c, jeb->dirty_size - addedsize)) {
682 jffs2_dbg(1, "Eraseblock at 0x%08x is now very dirty. Removing from dirty list...\n",
684 list_del(&jeb->list);
685 jffs2_dbg(1, "...and adding to very_dirty_list\n");
686 list_add_tail(&jeb->list, &c->very_dirty_list);
688 jffs2_dbg(1, "Eraseblock at 0x%08x not moved anywhere. (free 0x%08x, dirty 0x%08x, used 0x%08x)\n",
689 jeb->offset, jeb->free_size, jeb->dirty_size,
693 spin_unlock(&c->erase_completion_lock);
695 if (!jffs2_can_mark_obsolete(c) || jffs2_is_readonly(c) ||
696 (c->flags & JFFS2_SB_FLAG_BUILDING)) {
697 /* We didn't lock the erase_free_sem */
701 /* The erase_free_sem is locked, and has been since before we marked the node obsolete
702 and potentially put its eraseblock onto the erase_pending_list. Thus, we know that
703 the block hasn't _already_ been erased, and that 'ref' itself hasn't been freed yet
704 by jffs2_free_jeb_node_refs() in erase.c. Which is nice. */
706 jffs2_dbg(1, "obliterating obsoleted node at 0x%08x\n",
708 ret = jffs2_flash_read(c, ref_offset(ref), sizeof(n), &retlen, (char *)&n);
710 pr_warn("Read error reading from obsoleted node at 0x%08x: %d\n",
711 ref_offset(ref), ret);
714 if (retlen != sizeof(n)) {
715 pr_warn("Short read from obsoleted node at 0x%08x: %zd\n",
716 ref_offset(ref), retlen);
719 if (PAD(je32_to_cpu(n.totlen)) != PAD(freed_len)) {
720 pr_warn("Node totlen on flash (0x%08x) != totlen from node ref (0x%08x)\n",
721 je32_to_cpu(n.totlen), freed_len);
724 if (!(je16_to_cpu(n.nodetype) & JFFS2_NODE_ACCURATE)) {
725 jffs2_dbg(1, "Node at 0x%08x was already marked obsolete (nodetype 0x%04x)\n",
726 ref_offset(ref), je16_to_cpu(n.nodetype));
729 /* XXX FIXME: This is ugly now */
730 n.nodetype = cpu_to_je16(je16_to_cpu(n.nodetype) & ~JFFS2_NODE_ACCURATE);
731 ret = jffs2_flash_write(c, ref_offset(ref), sizeof(n), &retlen, (char *)&n);
733 pr_warn("Write error in obliterating obsoleted node at 0x%08x: %d\n",
734 ref_offset(ref), ret);
737 if (retlen != sizeof(n)) {
738 pr_warn("Short write in obliterating obsoleted node at 0x%08x: %zd\n",
739 ref_offset(ref), retlen);
743 /* Nodes which have been marked obsolete no longer need to be
744 associated with any inode. Remove them from the per-inode list.
746 Note we can't do this for NAND at the moment because we need
747 obsolete dirent nodes to stay on the lists, because of the
748 horridness in jffs2_garbage_collect_deletion_dirent(). Also
749 because we delete the inocache, and on NAND we need that to
750 stay around until all the nodes are actually erased, in order
751 to stop us from giving the same inode number to another newly
753 if (ref->next_in_ino) {
754 struct jffs2_inode_cache *ic;
755 struct jffs2_raw_node_ref **p;
757 spin_lock(&c->erase_completion_lock);
759 ic = jffs2_raw_ref_to_ic(ref);
760 for (p = &ic->nodes; (*p) != ref; p = &((*p)->next_in_ino))
763 *p = ref->next_in_ino;
764 ref->next_in_ino = NULL;
767 #ifdef CONFIG_JFFS2_FS_XATTR
768 case RAWNODE_CLASS_XATTR_DATUM:
769 jffs2_release_xattr_datum(c, (struct jffs2_xattr_datum *)ic);
771 case RAWNODE_CLASS_XATTR_REF:
772 jffs2_release_xattr_ref(c, (struct jffs2_xattr_ref *)ic);
776 if (ic->nodes == (void *)ic && ic->pino_nlink == 0)
777 jffs2_del_ino_cache(c, ic);
780 spin_unlock(&c->erase_completion_lock);
784 mutex_unlock(&c->erase_free_sem);
787 int jffs2_thread_should_wake(struct jffs2_sb_info *c)
791 int nr_very_dirty = 0;
792 struct jffs2_eraseblock *jeb;
794 if (!list_empty(&c->erase_complete_list) ||
795 !list_empty(&c->erase_pending_list))
798 if (c->unchecked_size) {
799 jffs2_dbg(1, "jffs2_thread_should_wake(): unchecked_size %d, checked_ino #%d\n",
800 c->unchecked_size, c->checked_ino);
804 /* dirty_size contains blocks on erase_pending_list
805 * those blocks are counted in c->nr_erasing_blocks.
806 * If one block is actually erased, it is not longer counted as dirty_space
807 * but it is counted in c->nr_erasing_blocks, so we add it and subtract it
808 * with c->nr_erasing_blocks * c->sector_size again.
809 * Blocks on erasable_list are counted as dirty_size, but not in c->nr_erasing_blocks
810 * This helps us to force gc and pick eventually a clean block to spread the load.
812 dirty = c->dirty_size + c->erasing_size - c->nr_erasing_blocks * c->sector_size;
814 if (c->nr_free_blocks + c->nr_erasing_blocks < c->resv_blocks_gctrigger &&
815 (dirty > c->nospc_dirty_size))
818 list_for_each_entry(jeb, &c->very_dirty_list, list) {
820 if (nr_very_dirty == c->vdirty_blocks_gctrigger) {
822 /* In debug mode, actually go through and count them all */
828 jffs2_dbg(1, "%s(): nr_free_blocks %d, nr_erasing_blocks %d, dirty_size 0x%x, vdirty_blocks %d: %s\n",
829 __func__, c->nr_free_blocks, c->nr_erasing_blocks,
830 c->dirty_size, nr_very_dirty, ret ? "yes" : "no");