blob: b6bd4affd9adb102d7d169aadc42e34da27e53ea [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * JFFS2 -- Journalling Flash File System, Version 2.
3 *
David Woodhousec00c3102007-04-25 14:16:47 +01004 * Copyright © 2001-2007 Red Hat, Inc.
Linus Torvalds1da177e2005-04-16 15:20:36 -07005 *
6 * Created by David Woodhouse <dwmw2@infradead.org>
7 *
8 * For licensing information, see the file 'LICENCE' in this directory.
9 *
Linus Torvalds1da177e2005-04-16 15:20:36 -070010 */
11
Joe Perches5a528952012-02-15 15:56:45 -080012#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
13
Linus Torvalds1da177e2005-04-16 15:20:36 -070014#include <linux/kernel.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070015#include <linux/mtd/mtd.h>
16#include <linux/compiler.h>
17#include <linux/sched.h> /* For cond_resched() */
18#include "nodelist.h"
Ferenc Havasie631ddb2005-09-07 09:35:26 +010019#include "debug.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070020
Daniel Drake8da8ba22012-04-10 22:22:35 +010021/*
22 * Check whether the user is allowed to write.
23 */
24static int jffs2_rp_can_write(struct jffs2_sb_info *c)
25{
26 uint32_t avail;
27 struct jffs2_mount_opts *opts = &c->mount_opts;
28
29 avail = c->dirty_size + c->free_size + c->unchecked_size +
30 c->erasing_size - c->resv_blocks_write * c->sector_size
31 - c->nospc_dirty_size;
32
33 if (avail < 2 * opts->rp_size)
34 jffs2_dbg(1, "rpsize %u, dirty_size %u, free_size %u, "
35 "erasing_size %u, unchecked_size %u, "
36 "nr_erasing_blocks %u, avail %u, resrv %u\n",
37 opts->rp_size, c->dirty_size, c->free_size,
38 c->erasing_size, c->unchecked_size,
39 c->nr_erasing_blocks, avail, c->nospc_dirty_size);
40
41 if (avail > opts->rp_size)
42 return 1;
43
44 /* Always allow root */
45 if (capable(CAP_SYS_RESOURCE))
46 return 1;
47
48 jffs2_dbg(1, "forbid writing\n");
49 return 0;
50}
51
Linus Torvalds1da177e2005-04-16 15:20:36 -070052/**
53 * jffs2_reserve_space - request physical space to write nodes to flash
54 * @c: superblock info
55 * @minsize: Minimum acceptable size of allocation
Linus Torvalds1da177e2005-04-16 15:20:36 -070056 * @len: Returned value of allocation length
57 * @prio: Allocation type - ALLOC_{NORMAL,DELETION}
58 *
59 * Requests a block of physical space on the flash. Returns zero for success
David Woodhouse9fe48542006-05-23 00:38:06 +010060 * and puts 'len' into the appropriate place, or returns -ENOSPC or other
61 * error if appropriate. Doesn't return len since that's
Linus Torvalds1da177e2005-04-16 15:20:36 -070062 *
63 * If it returns zero, jffs2_reserve_space() also downs the per-filesystem
64 * allocation semaphore, to prevent more than one allocation from being
65 * active at any time. The semaphore is later released by jffs2_commit_allocation()
66 *
67 * jffs2_reserve_space() may trigger garbage collection in order to make room
68 * for the requested allocation.
69 */
70
Ferenc Havasie631ddb2005-09-07 09:35:26 +010071static int jffs2_do_reserve_space(struct jffs2_sb_info *c, uint32_t minsize,
David Woodhouse9fe48542006-05-23 00:38:06 +010072 uint32_t *len, uint32_t sumsize);
Linus Torvalds1da177e2005-04-16 15:20:36 -070073
David Woodhouse9fe48542006-05-23 00:38:06 +010074int jffs2_reserve_space(struct jffs2_sb_info *c, uint32_t minsize,
Ferenc Havasie631ddb2005-09-07 09:35:26 +010075 uint32_t *len, int prio, uint32_t sumsize)
Linus Torvalds1da177e2005-04-16 15:20:36 -070076{
77 int ret = -EAGAIN;
78 int blocksneeded = c->resv_blocks_write;
79 /* align it */
80 minsize = PAD(minsize);
81
Joe Perches9c261b32012-02-15 15:56:43 -080082 jffs2_dbg(1, "%s(): Requested 0x%x bytes\n", __func__, minsize);
David Woodhouseced22072008-04-22 15:13:40 +010083 mutex_lock(&c->alloc_sem);
Linus Torvalds1da177e2005-04-16 15:20:36 -070084
Joe Perches9c261b32012-02-15 15:56:43 -080085 jffs2_dbg(1, "%s(): alloc sem got\n", __func__);
Linus Torvalds1da177e2005-04-16 15:20:36 -070086
87 spin_lock(&c->erase_completion_lock);
88
Daniel Drake8da8ba22012-04-10 22:22:35 +010089 /*
90 * Check if the free space is greater then size of the reserved pool.
91 * If not, only allow root to proceed with writing.
92 */
93 if (prio != ALLOC_DELETION && !jffs2_rp_can_write(c)) {
94 ret = -ENOSPC;
95 goto out;
96 }
97
Linus Torvalds1da177e2005-04-16 15:20:36 -070098 /* this needs a little more thought (true <tglx> :)) */
99 while(ret == -EAGAIN) {
100 while(c->nr_free_blocks + c->nr_erasing_blocks < blocksneeded) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700101 uint32_t dirty, avail;
102
103 /* calculate real dirty size
104 * dirty_size contains blocks on erase_pending_list
105 * those blocks are counted in c->nr_erasing_blocks.
106 * If one block is actually erased, it is not longer counted as dirty_space
107 * but it is counted in c->nr_erasing_blocks, so we add it and subtract it
108 * with c->nr_erasing_blocks * c->sector_size again.
109 * Blocks on erasable_list are counted as dirty_size, but not in c->nr_erasing_blocks
110 * This helps us to force gc and pick eventually a clean block to spread the load.
111 * We add unchecked_size here, as we hopefully will find some space to use.
112 * This will affect the sum only once, as gc first finishes checking
113 * of nodes.
114 */
115 dirty = c->dirty_size + c->erasing_size - c->nr_erasing_blocks * c->sector_size + c->unchecked_size;
116 if (dirty < c->nospc_dirty_size) {
117 if (prio == ALLOC_DELETION && c->nr_free_blocks + c->nr_erasing_blocks >= c->resv_blocks_deletion) {
Joe Perches9c261b32012-02-15 15:56:43 -0800118 jffs2_dbg(1, "%s(): Low on dirty space to GC, but it's a deletion. Allowing...\n",
119 __func__);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700120 break;
121 }
Joe Perches9c261b32012-02-15 15:56:43 -0800122 jffs2_dbg(1, "dirty size 0x%08x + unchecked_size 0x%08x < nospc_dirty_size 0x%08x, returning -ENOSPC\n",
123 dirty, c->unchecked_size,
124 c->sector_size);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700125
126 spin_unlock(&c->erase_completion_lock);
David Woodhouseced22072008-04-22 15:13:40 +0100127 mutex_unlock(&c->alloc_sem);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700128 return -ENOSPC;
129 }
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000130
Linus Torvalds1da177e2005-04-16 15:20:36 -0700131 /* Calc possibly available space. Possibly available means that we
132 * don't know, if unchecked size contains obsoleted nodes, which could give us some
133 * more usable space. This will affect the sum only once, as gc first finishes checking
134 * of nodes.
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000135 + Return -ENOSPC, if the maximum possibly available space is less or equal than
Linus Torvalds1da177e2005-04-16 15:20:36 -0700136 * blocksneeded * sector_size.
137 * This blocks endless gc looping on a filesystem, which is nearly full, even if
138 * the check above passes.
139 */
140 avail = c->free_size + c->dirty_size + c->erasing_size + c->unchecked_size;
141 if ( (avail / c->sector_size) <= blocksneeded) {
142 if (prio == ALLOC_DELETION && c->nr_free_blocks + c->nr_erasing_blocks >= c->resv_blocks_deletion) {
Joe Perches9c261b32012-02-15 15:56:43 -0800143 jffs2_dbg(1, "%s(): Low on possibly available space, but it's a deletion. Allowing...\n",
144 __func__);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700145 break;
146 }
147
Joe Perches9c261b32012-02-15 15:56:43 -0800148 jffs2_dbg(1, "max. available size 0x%08x < blocksneeded * sector_size 0x%08x, returning -ENOSPC\n",
149 avail, blocksneeded * c->sector_size);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700150 spin_unlock(&c->erase_completion_lock);
David Woodhouseced22072008-04-22 15:13:40 +0100151 mutex_unlock(&c->alloc_sem);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700152 return -ENOSPC;
153 }
154
David Woodhouseced22072008-04-22 15:13:40 +0100155 mutex_unlock(&c->alloc_sem);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700156
Joe Perches9c261b32012-02-15 15:56:43 -0800157 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",
158 c->nr_free_blocks, c->nr_erasing_blocks,
159 c->free_size, c->dirty_size, c->wasted_size,
160 c->used_size, c->erasing_size, c->bad_size,
161 c->free_size + c->dirty_size +
162 c->wasted_size + c->used_size +
163 c->erasing_size + c->bad_size,
164 c->flash_size);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700165 spin_unlock(&c->erase_completion_lock);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000166
Linus Torvalds1da177e2005-04-16 15:20:36 -0700167 ret = jffs2_garbage_collect_pass(c);
David Woodhouse422b1202008-04-23 15:40:52 +0100168
David Woodhouse0717bf82010-05-19 16:37:13 +0100169 if (ret == -EAGAIN) {
170 spin_lock(&c->erase_completion_lock);
171 if (c->nr_erasing_blocks &&
172 list_empty(&c->erase_pending_list) &&
173 list_empty(&c->erase_complete_list)) {
174 DECLARE_WAITQUEUE(wait, current);
175 set_current_state(TASK_UNINTERRUPTIBLE);
176 add_wait_queue(&c->erase_wait, &wait);
Joe Perches9c261b32012-02-15 15:56:43 -0800177 jffs2_dbg(1, "%s waiting for erase to complete\n",
178 __func__);
David Woodhouse0717bf82010-05-19 16:37:13 +0100179 spin_unlock(&c->erase_completion_lock);
180
181 schedule();
Li Zefan3ead9572014-02-12 12:44:57 -0800182 remove_wait_queue(&c->erase_wait, &wait);
David Woodhouse0717bf82010-05-19 16:37:13 +0100183 } else
184 spin_unlock(&c->erase_completion_lock);
185 } else if (ret)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700186 return ret;
187
188 cond_resched();
189
190 if (signal_pending(current))
191 return -EINTR;
192
David Woodhouseced22072008-04-22 15:13:40 +0100193 mutex_lock(&c->alloc_sem);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700194 spin_lock(&c->erase_completion_lock);
195 }
196
David Woodhouse9fe48542006-05-23 00:38:06 +0100197 ret = jffs2_do_reserve_space(c, minsize, len, sumsize);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700198 if (ret) {
Joe Perches9c261b32012-02-15 15:56:43 -0800199 jffs2_dbg(1, "%s(): ret is %d\n", __func__, ret);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700200 }
201 }
Daniel Drake8da8ba22012-04-10 22:22:35 +0100202
203out:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700204 spin_unlock(&c->erase_completion_lock);
David Woodhouse2f785402006-05-24 02:04:45 +0100205 if (!ret)
David Woodhouse046b8b92006-05-25 01:50:35 +0100206 ret = jffs2_prealloc_raw_node_refs(c, c->nextblock, 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700207 if (ret)
David Woodhouseced22072008-04-22 15:13:40 +0100208 mutex_unlock(&c->alloc_sem);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700209 return ret;
210}
211
David Woodhouse9fe48542006-05-23 00:38:06 +0100212int jffs2_reserve_space_gc(struct jffs2_sb_info *c, uint32_t minsize,
213 uint32_t *len, uint32_t sumsize)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700214{
Li Zefan13b546d2014-02-12 12:44:56 -0800215 int ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700216 minsize = PAD(minsize);
217
Joe Perches9c261b32012-02-15 15:56:43 -0800218 jffs2_dbg(1, "%s(): Requested 0x%x bytes\n", __func__, minsize);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700219
Li Zefan13b546d2014-02-12 12:44:56 -0800220 while (true) {
221 spin_lock(&c->erase_completion_lock);
David Woodhouse9fe48542006-05-23 00:38:06 +0100222 ret = jffs2_do_reserve_space(c, minsize, len, sumsize);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700223 if (ret) {
Joe Perches9c261b32012-02-15 15:56:43 -0800224 jffs2_dbg(1, "%s(): looping, ret is %d\n",
225 __func__, ret);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700226 }
Li Zefan13b546d2014-02-12 12:44:56 -0800227 spin_unlock(&c->erase_completion_lock);
228
229 if (ret == -EAGAIN)
230 cond_resched();
231 else
232 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700233 }
David Woodhouse2f785402006-05-24 02:04:45 +0100234 if (!ret)
David Woodhouse046b8b92006-05-25 01:50:35 +0100235 ret = jffs2_prealloc_raw_node_refs(c, c->nextblock, 1);
David Woodhouse2f785402006-05-24 02:04:45 +0100236
Linus Torvalds1da177e2005-04-16 15:20:36 -0700237 return ret;
238}
239
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100240
241/* Classify nextblock (clean, dirty of verydirty) and force to select an other one */
242
243static void jffs2_close_nextblock(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700244{
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100245
Adrian Hunter99c25942007-03-29 11:00:47 +0300246 if (c->nextblock == NULL) {
Joe Perches9c261b32012-02-15 15:56:43 -0800247 jffs2_dbg(1, "%s(): Erase block at 0x%08x has already been placed in a list\n",
248 __func__, jeb->offset);
Adrian Hunter99c25942007-03-29 11:00:47 +0300249 return;
250 }
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100251 /* Check, if we have a dirty block now, or if it was dirty already */
252 if (ISDIRTY (jeb->wasted_size + jeb->dirty_size)) {
253 c->dirty_size += jeb->wasted_size;
254 c->wasted_size -= jeb->wasted_size;
255 jeb->dirty_size += jeb->wasted_size;
256 jeb->wasted_size = 0;
257 if (VERYDIRTY(c, jeb->dirty_size)) {
Joe Perches9c261b32012-02-15 15:56:43 -0800258 jffs2_dbg(1, "Adding full erase block at 0x%08x to very_dirty_list (free 0x%08x, dirty 0x%08x, used 0x%08x\n",
259 jeb->offset, jeb->free_size, jeb->dirty_size,
260 jeb->used_size);
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100261 list_add_tail(&jeb->list, &c->very_dirty_list);
262 } else {
Joe Perches9c261b32012-02-15 15:56:43 -0800263 jffs2_dbg(1, "Adding full erase block at 0x%08x to dirty_list (free 0x%08x, dirty 0x%08x, used 0x%08x\n",
264 jeb->offset, jeb->free_size, jeb->dirty_size,
265 jeb->used_size);
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100266 list_add_tail(&jeb->list, &c->dirty_list);
267 }
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000268 } else {
Joe Perches9c261b32012-02-15 15:56:43 -0800269 jffs2_dbg(1, "Adding full erase block at 0x%08x to clean_list (free 0x%08x, dirty 0x%08x, used 0x%08x\n",
270 jeb->offset, jeb->free_size, jeb->dirty_size,
271 jeb->used_size);
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100272 list_add_tail(&jeb->list, &c->clean_list);
273 }
274 c->nextblock = NULL;
275
276}
277
278/* Select a new jeb for nextblock */
279
280static int jffs2_find_nextblock(struct jffs2_sb_info *c)
281{
282 struct list_head *next;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000283
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100284 /* Take the next block off the 'free' list */
285
286 if (list_empty(&c->free_list)) {
287
288 if (!c->nr_erasing_blocks &&
289 !list_empty(&c->erasable_list)) {
290 struct jffs2_eraseblock *ejeb;
291
292 ejeb = list_entry(c->erasable_list.next, struct jffs2_eraseblock, list);
Akinobu Mitaf1166292006-06-26 00:24:46 -0700293 list_move_tail(&ejeb->list, &c->erase_pending_list);
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100294 c->nr_erasing_blocks++;
David Woodhouseae3b6ba2010-05-19 17:05:14 +0100295 jffs2_garbage_collect_trigger(c);
Joe Perches9c261b32012-02-15 15:56:43 -0800296 jffs2_dbg(1, "%s(): Triggering erase of erasable block at 0x%08x\n",
297 __func__, ejeb->offset);
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100298 }
299
300 if (!c->nr_erasing_blocks &&
301 !list_empty(&c->erasable_pending_wbuf_list)) {
Joe Perches9c261b32012-02-15 15:56:43 -0800302 jffs2_dbg(1, "%s(): Flushing write buffer\n",
303 __func__);
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100304 /* c->nextblock is NULL, no update to c->nextblock allowed */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700305 spin_unlock(&c->erase_completion_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700306 jffs2_flush_wbuf_pad(c);
307 spin_lock(&c->erase_completion_lock);
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100308 /* Have another go. It'll be on the erasable_list now */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700309 return -EAGAIN;
310 }
311
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100312 if (!c->nr_erasing_blocks) {
313 /* Ouch. We're in GC, or we wouldn't have got here.
314 And there's no space left. At all. */
Joe Perchesda320f02012-02-15 15:56:44 -0800315 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",
316 c->nr_erasing_blocks, c->nr_free_blocks,
317 list_empty(&c->erasable_list) ? "yes" : "no",
318 list_empty(&c->erasing_list) ? "yes" : "no",
319 list_empty(&c->erase_pending_list) ? "yes" : "no");
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100320 return -ENOSPC;
321 }
322
323 spin_unlock(&c->erase_completion_lock);
324 /* Don't wait for it; just erase one right now */
325 jffs2_erase_pending_blocks(c, 1);
326 spin_lock(&c->erase_completion_lock);
327
328 /* An erase may have failed, decreasing the
329 amount of free space available. So we must
330 restart from the beginning */
331 return -EAGAIN;
332 }
333
334 next = c->free_list.next;
335 list_del(next);
336 c->nextblock = list_entry(next, struct jffs2_eraseblock, list);
337 c->nr_free_blocks--;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000338
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100339 jffs2_sum_reset_collected(c->summary); /* reset collected summary */
340
Steve Glendinningf04de502008-10-21 13:25:51 +0100341#ifdef CONFIG_JFFS2_FS_WRITEBUFFER
Alexander Belyakov5bf17232008-10-17 19:19:13 +0400342 /* adjust write buffer offset, else we get a non contiguous write bug */
343 if (!(c->wbuf_ofs % c->sector_size) && !c->wbuf_len)
344 c->wbuf_ofs = 0xffffffff;
Steve Glendinningf04de502008-10-21 13:25:51 +0100345#endif
Alexander Belyakov5bf17232008-10-17 19:19:13 +0400346
Joe Perches9c261b32012-02-15 15:56:43 -0800347 jffs2_dbg(1, "%s(): new nextblock = 0x%08x\n",
348 __func__, c->nextblock->offset);
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100349
350 return 0;
351}
352
353/* Called with alloc sem _and_ erase_completion_lock */
David Woodhouse9fe48542006-05-23 00:38:06 +0100354static int jffs2_do_reserve_space(struct jffs2_sb_info *c, uint32_t minsize,
355 uint32_t *len, uint32_t sumsize)
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100356{
357 struct jffs2_eraseblock *jeb = c->nextblock;
David Woodhouse9fe48542006-05-23 00:38:06 +0100358 uint32_t reserved_size; /* for summary information at the end of the jeb */
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100359 int ret;
360
361 restart:
362 reserved_size = 0;
363
364 if (jffs2_sum_active() && (sumsize != JFFS2_SUMMARY_NOSUM_SIZE)) {
365 /* NOSUM_SIZE means not to generate summary */
366
367 if (jeb) {
368 reserved_size = PAD(sumsize + c->summary->sum_size + JFFS2_SUMMARY_FRAME_SIZE);
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100369 dbg_summary("minsize=%d , jeb->free=%d ,"
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100370 "summary->size=%d , sumsize=%d\n",
371 minsize, jeb->free_size,
372 c->summary->sum_size, sumsize);
373 }
374
375 /* Is there enough space for writing out the current node, or we have to
376 write out summary information now, close this jeb and select new nextblock? */
377 if (jeb && (PAD(minsize) + PAD(c->summary->sum_size + sumsize +
378 JFFS2_SUMMARY_FRAME_SIZE) > jeb->free_size)) {
379
380 /* Has summary been disabled for this jeb? */
381 if (jffs2_sum_is_disabled(c->summary)) {
382 sumsize = JFFS2_SUMMARY_NOSUM_SIZE;
383 goto restart;
384 }
385
386 /* Writing out the collected summary information */
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100387 dbg_summary("generating summary for 0x%08x.\n", jeb->offset);
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100388 ret = jffs2_sum_write_sumnode(c);
389
390 if (ret)
391 return ret;
392
393 if (jffs2_sum_is_disabled(c->summary)) {
394 /* jffs2_write_sumnode() couldn't write out the summary information
395 diabling summary for this jeb and free the collected information
396 */
397 sumsize = JFFS2_SUMMARY_NOSUM_SIZE;
398 goto restart;
399 }
400
401 jffs2_close_nextblock(c, jeb);
402 jeb = NULL;
Ferenc Havasi34c0e902005-09-16 13:58:20 +0100403 /* keep always valid value in reserved_size */
404 reserved_size = PAD(sumsize + c->summary->sum_size + JFFS2_SUMMARY_FRAME_SIZE);
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100405 }
406 } else {
407 if (jeb && minsize > jeb->free_size) {
David Woodhousefc6612f2006-06-18 18:35:10 +0100408 uint32_t waste;
409
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100410 /* Skip the end of this block and file it as having some dirty space */
411 /* If there's a pending write to it, flush now */
412
413 if (jffs2_wbuf_dirty(c)) {
414 spin_unlock(&c->erase_completion_lock);
Joe Perches9c261b32012-02-15 15:56:43 -0800415 jffs2_dbg(1, "%s(): Flushing write buffer\n",
416 __func__);
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100417 jffs2_flush_wbuf_pad(c);
418 spin_lock(&c->erase_completion_lock);
419 jeb = c->nextblock;
420 goto restart;
421 }
422
David Woodhousefc6612f2006-06-18 18:35:10 +0100423 spin_unlock(&c->erase_completion_lock);
424
425 ret = jffs2_prealloc_raw_node_refs(c, jeb, 1);
Alexey Khoroshilov2cbba752012-11-05 22:40:14 +0400426
David Woodhousefc6612f2006-06-18 18:35:10 +0100427 /* Just lock it again and continue. Nothing much can change because
428 we hold c->alloc_sem anyway. In fact, it's not entirely clear why
429 we hold c->erase_completion_lock in the majority of this function...
430 but that's a question for another (more caffeine-rich) day. */
431 spin_lock(&c->erase_completion_lock);
432
Alexey Khoroshilov2cbba752012-11-05 22:40:14 +0400433 if (ret)
434 return ret;
435
David Woodhousefc6612f2006-06-18 18:35:10 +0100436 waste = jeb->free_size;
437 jffs2_link_node_ref(c, jeb,
438 (jeb->offset + c->sector_size - waste) | REF_OBSOLETE,
439 waste, NULL);
440 /* FIXME: that made it count as dirty. Convert to wasted */
441 jeb->dirty_size -= waste;
442 c->dirty_size -= waste;
443 jeb->wasted_size += waste;
444 c->wasted_size += waste;
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100445
446 jffs2_close_nextblock(c, jeb);
447 jeb = NULL;
448 }
449 }
450
451 if (!jeb) {
452
453 ret = jffs2_find_nextblock(c);
454 if (ret)
455 return ret;
456
457 jeb = c->nextblock;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700458
459 if (jeb->free_size != c->sector_size - c->cleanmarker_size) {
Joe Perchesda320f02012-02-15 15:56:44 -0800460 pr_warn("Eep. Block 0x%08x taken from free_list had free_size of 0x%08x!!\n",
461 jeb->offset, jeb->free_size);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700462 goto restart;
463 }
464 }
465 /* OK, jeb (==c->nextblock) is now pointing at a block which definitely has
466 enough space */
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100467 *len = jeb->free_size - reserved_size;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700468
469 if (c->cleanmarker_size && jeb->used_size == c->cleanmarker_size &&
470 !jeb->first_node->next_in_ino) {
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000471 /* Only node in it beforehand was a CLEANMARKER node (we think).
Linus Torvalds1da177e2005-04-16 15:20:36 -0700472 So mark it obsolete now that there's going to be another node
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000473 in the block. This will reduce used_size to zero but We've
Linus Torvalds1da177e2005-04-16 15:20:36 -0700474 already set c->nextblock so that jffs2_mark_node_obsolete()
475 won't try to refile it to the dirty_list.
476 */
477 spin_unlock(&c->erase_completion_lock);
478 jffs2_mark_node_obsolete(c, jeb->first_node);
479 spin_lock(&c->erase_completion_lock);
480 }
481
Joe Perches9c261b32012-02-15 15:56:43 -0800482 jffs2_dbg(1, "%s(): Giving 0x%x bytes at 0x%x\n",
483 __func__,
484 *len, jeb->offset + (c->sector_size - jeb->free_size));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700485 return 0;
486}
487
488/**
489 * jffs2_add_physical_node_ref - add a physical node reference to the list
490 * @c: superblock info
491 * @new: new node reference to add
492 * @len: length of this physical node
Linus Torvalds1da177e2005-04-16 15:20:36 -0700493 *
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000494 * Should only be used to report nodes for which space has been allocated
Linus Torvalds1da177e2005-04-16 15:20:36 -0700495 * by jffs2_reserve_space.
496 *
497 * Must be called with the alloc_sem held.
498 */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000499
David Woodhouse2f785402006-05-24 02:04:45 +0100500struct jffs2_raw_node_ref *jffs2_add_physical_node_ref(struct jffs2_sb_info *c,
501 uint32_t ofs, uint32_t len,
502 struct jffs2_inode_cache *ic)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700503{
504 struct jffs2_eraseblock *jeb;
David Woodhouse2f785402006-05-24 02:04:45 +0100505 struct jffs2_raw_node_ref *new;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700506
David Woodhouse2f785402006-05-24 02:04:45 +0100507 jeb = &c->blocks[ofs / c->sector_size];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700508
Joe Perches9c261b32012-02-15 15:56:43 -0800509 jffs2_dbg(1, "%s(): Node at 0x%x(%d), size 0x%x\n",
510 __func__, ofs & ~3, ofs & 3, len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700511#if 1
David Woodhouse2f785402006-05-24 02:04:45 +0100512 /* Allow non-obsolete nodes only to be added at the end of c->nextblock,
513 if c->nextblock is set. Note that wbuf.c will file obsolete nodes
514 even after refiling c->nextblock */
515 if ((c->nextblock || ((ofs & 3) != REF_OBSOLETE))
516 && (jeb != c->nextblock || (ofs & ~3) != jeb->offset + (c->sector_size - jeb->free_size))) {
Joe Perchesda320f02012-02-15 15:56:44 -0800517 pr_warn("argh. node added in wrong place at 0x%08x(%d)\n",
518 ofs & ~3, ofs & 3);
David Woodhouse66bfaea2007-06-28 19:03:11 +0100519 if (c->nextblock)
Joe Perchesda320f02012-02-15 15:56:44 -0800520 pr_warn("nextblock 0x%08x", c->nextblock->offset);
David Woodhouse66bfaea2007-06-28 19:03:11 +0100521 else
Joe Perchesda320f02012-02-15 15:56:44 -0800522 pr_warn("No nextblock");
523 pr_cont(", expected at %08x\n",
524 jeb->offset + (c->sector_size - jeb->free_size));
David Woodhouse2f785402006-05-24 02:04:45 +0100525 return ERR_PTR(-EINVAL);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700526 }
527#endif
528 spin_lock(&c->erase_completion_lock);
529
David Woodhouse2f785402006-05-24 02:04:45 +0100530 new = jffs2_link_node_ref(c, jeb, ofs, len, ic);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700531
Estelle Hammache9b88f472005-01-28 18:53:05 +0000532 if (!jeb->free_size && !jeb->dirty_size && !ISDIRTY(jeb->wasted_size)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700533 /* If it lives on the dirty_list, jffs2_reserve_space will put it there */
Joe Perches9c261b32012-02-15 15:56:43 -0800534 jffs2_dbg(1, "Adding full erase block at 0x%08x to clean_list (free 0x%08x, dirty 0x%08x, used 0x%08x\n",
535 jeb->offset, jeb->free_size, jeb->dirty_size,
536 jeb->used_size);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700537 if (jffs2_wbuf_dirty(c)) {
538 /* Flush the last write in the block if it's outstanding */
539 spin_unlock(&c->erase_completion_lock);
540 jffs2_flush_wbuf_pad(c);
541 spin_lock(&c->erase_completion_lock);
542 }
543
544 list_add_tail(&jeb->list, &c->clean_list);
545 c->nextblock = NULL;
546 }
Artem B. Bityutskiye0c8e422005-07-24 16:14:17 +0100547 jffs2_dbg_acct_sanity_check_nolock(c,jeb);
548 jffs2_dbg_acct_paranoia_check_nolock(c, jeb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700549
550 spin_unlock(&c->erase_completion_lock);
551
David Woodhouse2f785402006-05-24 02:04:45 +0100552 return new;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700553}
554
555
556void jffs2_complete_reservation(struct jffs2_sb_info *c)
557{
Joe Perches9c261b32012-02-15 15:56:43 -0800558 jffs2_dbg(1, "jffs2_complete_reservation()\n");
David Woodhouseacb64a42010-05-19 17:00:10 +0100559 spin_lock(&c->erase_completion_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700560 jffs2_garbage_collect_trigger(c);
David Woodhouseacb64a42010-05-19 17:00:10 +0100561 spin_unlock(&c->erase_completion_lock);
David Woodhouseced22072008-04-22 15:13:40 +0100562 mutex_unlock(&c->alloc_sem);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700563}
564
565static inline int on_list(struct list_head *obj, struct list_head *head)
566{
567 struct list_head *this;
568
569 list_for_each(this, head) {
570 if (this == obj) {
Joe Perches9c261b32012-02-15 15:56:43 -0800571 jffs2_dbg(1, "%p is on list at %p\n", obj, head);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700572 return 1;
573
574 }
575 }
576 return 0;
577}
578
579void jffs2_mark_node_obsolete(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *ref)
580{
581 struct jffs2_eraseblock *jeb;
582 int blocknr;
583 struct jffs2_unknown_node n;
584 int ret, addedsize;
585 size_t retlen;
David Woodhouse1417fc42006-05-20 16:20:19 +0100586 uint32_t freed_len;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700587
David Woodhouse9bfeb692006-05-26 21:19:05 +0100588 if(unlikely(!ref)) {
Joe Perchesda320f02012-02-15 15:56:44 -0800589 pr_notice("EEEEEK. jffs2_mark_node_obsolete called with NULL node\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700590 return;
591 }
592 if (ref_obsolete(ref)) {
Joe Perches9c261b32012-02-15 15:56:43 -0800593 jffs2_dbg(1, "%s(): called with already obsolete node at 0x%08x\n",
594 __func__, ref_offset(ref));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700595 return;
596 }
597 blocknr = ref->flash_offset / c->sector_size;
598 if (blocknr >= c->nr_blocks) {
Joe Perchesda320f02012-02-15 15:56:44 -0800599 pr_notice("raw node at 0x%08x is off the end of device!\n",
600 ref->flash_offset);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700601 BUG();
602 }
603 jeb = &c->blocks[blocknr];
604
605 if (jffs2_can_mark_obsolete(c) && !jffs2_is_readonly(c) &&
Artem B. Bityuckiy31fbdf72005-02-28 08:21:09 +0000606 !(c->flags & (JFFS2_SB_FLAG_SCANNING | JFFS2_SB_FLAG_BUILDING))) {
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000607 /* Hm. This may confuse static lock analysis. If any of the above
608 three conditions is false, we're going to return from this
Linus Torvalds1da177e2005-04-16 15:20:36 -0700609 function without actually obliterating any nodes or freeing
610 any jffs2_raw_node_refs. So we don't need to stop erases from
611 happening, or protect against people holding an obsolete
612 jffs2_raw_node_ref without the erase_completion_lock. */
David Woodhouseced22072008-04-22 15:13:40 +0100613 mutex_lock(&c->erase_free_sem);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700614 }
615
616 spin_lock(&c->erase_completion_lock);
617
David Woodhouse1417fc42006-05-20 16:20:19 +0100618 freed_len = ref_totlen(c, jeb, ref);
619
Linus Torvalds1da177e2005-04-16 15:20:36 -0700620 if (ref_flags(ref) == REF_UNCHECKED) {
David Woodhouse1417fc42006-05-20 16:20:19 +0100621 D1(if (unlikely(jeb->unchecked_size < freed_len)) {
Joe Perchesda320f02012-02-15 15:56:44 -0800622 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",
623 freed_len, blocknr,
624 ref->flash_offset, jeb->used_size);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700625 BUG();
626 })
Joe Perches9c261b32012-02-15 15:56:43 -0800627 jffs2_dbg(1, "Obsoleting previously unchecked node at 0x%08x of len %x\n",
628 ref_offset(ref), freed_len);
David Woodhouse1417fc42006-05-20 16:20:19 +0100629 jeb->unchecked_size -= freed_len;
630 c->unchecked_size -= freed_len;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700631 } else {
David Woodhouse1417fc42006-05-20 16:20:19 +0100632 D1(if (unlikely(jeb->used_size < freed_len)) {
Joe Perchesda320f02012-02-15 15:56:44 -0800633 pr_notice("raw node of size 0x%08x freed from erase block %d at 0x%08x, but used_size was already 0x%08x\n",
634 freed_len, blocknr,
635 ref->flash_offset, jeb->used_size);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700636 BUG();
637 })
Joe Perches9c261b32012-02-15 15:56:43 -0800638 jffs2_dbg(1, "Obsoleting node at 0x%08x of len %#x: ",
639 ref_offset(ref), freed_len);
David Woodhouse1417fc42006-05-20 16:20:19 +0100640 jeb->used_size -= freed_len;
641 c->used_size -= freed_len;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700642 }
643
644 // Take care, that wasted size is taken into concern
David Woodhouse1417fc42006-05-20 16:20:19 +0100645 if ((jeb->dirty_size || ISDIRTY(jeb->wasted_size + freed_len)) && jeb != c->nextblock) {
Joe Perches9c261b32012-02-15 15:56:43 -0800646 jffs2_dbg(1, "Dirtying\n");
David Woodhouse1417fc42006-05-20 16:20:19 +0100647 addedsize = freed_len;
648 jeb->dirty_size += freed_len;
649 c->dirty_size += freed_len;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700650
651 /* Convert wasted space to dirty, if not a bad block */
652 if (jeb->wasted_size) {
653 if (on_list(&jeb->list, &c->bad_used_list)) {
Joe Perches9c261b32012-02-15 15:56:43 -0800654 jffs2_dbg(1, "Leaving block at %08x on the bad_used_list\n",
655 jeb->offset);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700656 addedsize = 0; /* To fool the refiling code later */
657 } else {
Joe Perches9c261b32012-02-15 15:56:43 -0800658 jffs2_dbg(1, "Converting %d bytes of wasted space to dirty in block at %08x\n",
659 jeb->wasted_size, jeb->offset);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700660 addedsize += jeb->wasted_size;
661 jeb->dirty_size += jeb->wasted_size;
662 c->dirty_size += jeb->wasted_size;
663 c->wasted_size -= jeb->wasted_size;
664 jeb->wasted_size = 0;
665 }
666 }
667 } else {
Joe Perches9c261b32012-02-15 15:56:43 -0800668 jffs2_dbg(1, "Wasting\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700669 addedsize = 0;
David Woodhouse1417fc42006-05-20 16:20:19 +0100670 jeb->wasted_size += freed_len;
671 c->wasted_size += freed_len;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700672 }
673 ref->flash_offset = ref_offset(ref) | REF_OBSOLETE;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000674
Artem B. Bityutskiye0c8e422005-07-24 16:14:17 +0100675 jffs2_dbg_acct_sanity_check_nolock(c, jeb);
676 jffs2_dbg_acct_paranoia_check_nolock(c, jeb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700677
Artem B. Bityuckiy31fbdf72005-02-28 08:21:09 +0000678 if (c->flags & JFFS2_SB_FLAG_SCANNING) {
679 /* Flash scanning is in progress. Don't muck about with the block
Linus Torvalds1da177e2005-04-16 15:20:36 -0700680 lists because they're not ready yet, and don't actually
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000681 obliterate nodes that look obsolete. If they weren't
Linus Torvalds1da177e2005-04-16 15:20:36 -0700682 marked obsolete on the flash at the time they _became_
683 obsolete, there was probably a reason for that. */
684 spin_unlock(&c->erase_completion_lock);
685 /* We didn't lock the erase_free_sem */
686 return;
687 }
688
689 if (jeb == c->nextblock) {
Joe Perches9c261b32012-02-15 15:56:43 -0800690 jffs2_dbg(2, "Not moving nextblock 0x%08x to dirty/erase_pending list\n",
691 jeb->offset);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700692 } else if (!jeb->used_size && !jeb->unchecked_size) {
693 if (jeb == c->gcblock) {
Joe Perches9c261b32012-02-15 15:56:43 -0800694 jffs2_dbg(1, "gcblock at 0x%08x completely dirtied. Clearing gcblock...\n",
695 jeb->offset);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700696 c->gcblock = NULL;
697 } else {
Joe Perches9c261b32012-02-15 15:56:43 -0800698 jffs2_dbg(1, "Eraseblock at 0x%08x completely dirtied. Removing from (dirty?) list...\n",
699 jeb->offset);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700700 list_del(&jeb->list);
701 }
702 if (jffs2_wbuf_dirty(c)) {
Joe Perches9c261b32012-02-15 15:56:43 -0800703 jffs2_dbg(1, "...and adding to erasable_pending_wbuf_list\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700704 list_add_tail(&jeb->list, &c->erasable_pending_wbuf_list);
705 } else {
706 if (jiffies & 127) {
707 /* Most of the time, we just erase it immediately. Otherwise we
708 spend ages scanning it on mount, etc. */
Joe Perches9c261b32012-02-15 15:56:43 -0800709 jffs2_dbg(1, "...and adding to erase_pending_list\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700710 list_add_tail(&jeb->list, &c->erase_pending_list);
711 c->nr_erasing_blocks++;
David Woodhouseae3b6ba2010-05-19 17:05:14 +0100712 jffs2_garbage_collect_trigger(c);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700713 } else {
714 /* Sometimes, however, we leave it elsewhere so it doesn't get
715 immediately reused, and we spread the load a bit. */
Joe Perches9c261b32012-02-15 15:56:43 -0800716 jffs2_dbg(1, "...and adding to erasable_list\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700717 list_add_tail(&jeb->list, &c->erasable_list);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000718 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700719 }
Joe Perches9c261b32012-02-15 15:56:43 -0800720 jffs2_dbg(1, "Done OK\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700721 } else if (jeb == c->gcblock) {
Joe Perches9c261b32012-02-15 15:56:43 -0800722 jffs2_dbg(2, "Not moving gcblock 0x%08x to dirty_list\n",
723 jeb->offset);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700724 } else if (ISDIRTY(jeb->dirty_size) && !ISDIRTY(jeb->dirty_size - addedsize)) {
Joe Perches9c261b32012-02-15 15:56:43 -0800725 jffs2_dbg(1, "Eraseblock at 0x%08x is freshly dirtied. Removing from clean list...\n",
726 jeb->offset);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700727 list_del(&jeb->list);
Joe Perches9c261b32012-02-15 15:56:43 -0800728 jffs2_dbg(1, "...and adding to dirty_list\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700729 list_add_tail(&jeb->list, &c->dirty_list);
730 } else if (VERYDIRTY(c, jeb->dirty_size) &&
731 !VERYDIRTY(c, jeb->dirty_size - addedsize)) {
Joe Perches9c261b32012-02-15 15:56:43 -0800732 jffs2_dbg(1, "Eraseblock at 0x%08x is now very dirty. Removing from dirty list...\n",
733 jeb->offset);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700734 list_del(&jeb->list);
Joe Perches9c261b32012-02-15 15:56:43 -0800735 jffs2_dbg(1, "...and adding to very_dirty_list\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700736 list_add_tail(&jeb->list, &c->very_dirty_list);
737 } else {
Joe Perches9c261b32012-02-15 15:56:43 -0800738 jffs2_dbg(1, "Eraseblock at 0x%08x not moved anywhere. (free 0x%08x, dirty 0x%08x, used 0x%08x)\n",
739 jeb->offset, jeb->free_size, jeb->dirty_size,
740 jeb->used_size);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000741 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700742
743 spin_unlock(&c->erase_completion_lock);
744
Artem B. Bityuckiy31fbdf72005-02-28 08:21:09 +0000745 if (!jffs2_can_mark_obsolete(c) || jffs2_is_readonly(c) ||
746 (c->flags & JFFS2_SB_FLAG_BUILDING)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700747 /* We didn't lock the erase_free_sem */
748 return;
749 }
750
751 /* The erase_free_sem is locked, and has been since before we marked the node obsolete
752 and potentially put its eraseblock onto the erase_pending_list. Thus, we know that
753 the block hasn't _already_ been erased, and that 'ref' itself hasn't been freed yet
David Woodhousec38c1b62006-05-25 01:38:27 +0100754 by jffs2_free_jeb_node_refs() in erase.c. Which is nice. */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700755
Joe Perches9c261b32012-02-15 15:56:43 -0800756 jffs2_dbg(1, "obliterating obsoleted node at 0x%08x\n",
757 ref_offset(ref));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700758 ret = jffs2_flash_read(c, ref_offset(ref), sizeof(n), &retlen, (char *)&n);
759 if (ret) {
Joe Perchesda320f02012-02-15 15:56:44 -0800760 pr_warn("Read error reading from obsoleted node at 0x%08x: %d\n",
761 ref_offset(ref), ret);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700762 goto out_erase_sem;
763 }
764 if (retlen != sizeof(n)) {
Joe Perchesda320f02012-02-15 15:56:44 -0800765 pr_warn("Short read from obsoleted node at 0x%08x: %zd\n",
766 ref_offset(ref), retlen);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700767 goto out_erase_sem;
768 }
David Woodhouse1417fc42006-05-20 16:20:19 +0100769 if (PAD(je32_to_cpu(n.totlen)) != PAD(freed_len)) {
Joe Perchesda320f02012-02-15 15:56:44 -0800770 pr_warn("Node totlen on flash (0x%08x) != totlen from node ref (0x%08x)\n",
771 je32_to_cpu(n.totlen), freed_len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700772 goto out_erase_sem;
773 }
774 if (!(je16_to_cpu(n.nodetype) & JFFS2_NODE_ACCURATE)) {
Joe Perches9c261b32012-02-15 15:56:43 -0800775 jffs2_dbg(1, "Node at 0x%08x was already marked obsolete (nodetype 0x%04x)\n",
776 ref_offset(ref), je16_to_cpu(n.nodetype));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700777 goto out_erase_sem;
778 }
779 /* XXX FIXME: This is ugly now */
780 n.nodetype = cpu_to_je16(je16_to_cpu(n.nodetype) & ~JFFS2_NODE_ACCURATE);
781 ret = jffs2_flash_write(c, ref_offset(ref), sizeof(n), &retlen, (char *)&n);
782 if (ret) {
Joe Perchesda320f02012-02-15 15:56:44 -0800783 pr_warn("Write error in obliterating obsoleted node at 0x%08x: %d\n",
784 ref_offset(ref), ret);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700785 goto out_erase_sem;
786 }
787 if (retlen != sizeof(n)) {
Joe Perchesda320f02012-02-15 15:56:44 -0800788 pr_warn("Short write in obliterating obsoleted node at 0x%08x: %zd\n",
789 ref_offset(ref), retlen);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700790 goto out_erase_sem;
791 }
792
793 /* Nodes which have been marked obsolete no longer need to be
794 associated with any inode. Remove them from the per-inode list.
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000795
796 Note we can't do this for NAND at the moment because we need
Linus Torvalds1da177e2005-04-16 15:20:36 -0700797 obsolete dirent nodes to stay on the lists, because of the
798 horridness in jffs2_garbage_collect_deletion_dirent(). Also
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000799 because we delete the inocache, and on NAND we need that to
Linus Torvalds1da177e2005-04-16 15:20:36 -0700800 stay around until all the nodes are actually erased, in order
801 to stop us from giving the same inode number to another newly
802 created inode. */
803 if (ref->next_in_ino) {
804 struct jffs2_inode_cache *ic;
805 struct jffs2_raw_node_ref **p;
806
807 spin_lock(&c->erase_completion_lock);
808
809 ic = jffs2_raw_ref_to_ic(ref);
810 for (p = &ic->nodes; (*p) != ref; p = &((*p)->next_in_ino))
811 ;
812
813 *p = ref->next_in_ino;
814 ref->next_in_ino = NULL;
815
KaiGai Koheic9f700f2006-06-11 10:35:15 +0900816 switch (ic->class) {
817#ifdef CONFIG_JFFS2_FS_XATTR
818 case RAWNODE_CLASS_XATTR_DATUM:
819 jffs2_release_xattr_datum(c, (struct jffs2_xattr_datum *)ic);
820 break;
821 case RAWNODE_CLASS_XATTR_REF:
822 jffs2_release_xattr_ref(c, (struct jffs2_xattr_ref *)ic);
823 break;
824#endif
825 default:
David Woodhouse27c72b02008-05-01 18:47:17 +0100826 if (ic->nodes == (void *)ic && ic->pino_nlink == 0)
KaiGai Koheic9f700f2006-06-11 10:35:15 +0900827 jffs2_del_ino_cache(c, ic);
828 break;
829 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700830 spin_unlock(&c->erase_completion_lock);
831 }
832
Linus Torvalds1da177e2005-04-16 15:20:36 -0700833 out_erase_sem:
David Woodhouseced22072008-04-22 15:13:40 +0100834 mutex_unlock(&c->erase_free_sem);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700835}
836
Linus Torvalds1da177e2005-04-16 15:20:36 -0700837int jffs2_thread_should_wake(struct jffs2_sb_info *c)
838{
839 int ret = 0;
840 uint32_t dirty;
David Woodhouse8fb870df2007-10-06 15:12:58 -0400841 int nr_very_dirty = 0;
842 struct jffs2_eraseblock *jeb;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700843
Joakim Tjernlundd6ce1712010-05-19 16:55:40 +0100844 if (!list_empty(&c->erase_complete_list) ||
845 !list_empty(&c->erase_pending_list))
846 return 1;
847
Linus Torvalds1da177e2005-04-16 15:20:36 -0700848 if (c->unchecked_size) {
Joe Perches9c261b32012-02-15 15:56:43 -0800849 jffs2_dbg(1, "jffs2_thread_should_wake(): unchecked_size %d, checked_ino #%d\n",
850 c->unchecked_size, c->checked_ino);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700851 return 1;
852 }
853
854 /* dirty_size contains blocks on erase_pending_list
855 * those blocks are counted in c->nr_erasing_blocks.
856 * If one block is actually erased, it is not longer counted as dirty_space
857 * but it is counted in c->nr_erasing_blocks, so we add it and subtract it
858 * with c->nr_erasing_blocks * c->sector_size again.
859 * Blocks on erasable_list are counted as dirty_size, but not in c->nr_erasing_blocks
860 * This helps us to force gc and pick eventually a clean block to spread the load.
861 */
862 dirty = c->dirty_size + c->erasing_size - c->nr_erasing_blocks * c->sector_size;
863
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000864 if (c->nr_free_blocks + c->nr_erasing_blocks < c->resv_blocks_gctrigger &&
865 (dirty > c->nospc_dirty_size))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700866 ret = 1;
867
David Woodhouse8fb870df2007-10-06 15:12:58 -0400868 list_for_each_entry(jeb, &c->very_dirty_list, list) {
869 nr_very_dirty++;
870 if (nr_very_dirty == c->vdirty_blocks_gctrigger) {
871 ret = 1;
David Woodhousea8c68f32007-10-13 11:32:16 +0100872 /* In debug mode, actually go through and count them all */
873 D1(continue);
874 break;
David Woodhouse8fb870df2007-10-06 15:12:58 -0400875 }
876 }
877
Joe Perches9c261b32012-02-15 15:56:43 -0800878 jffs2_dbg(1, "%s(): nr_free_blocks %d, nr_erasing_blocks %d, dirty_size 0x%x, vdirty_blocks %d: %s\n",
879 __func__, c->nr_free_blocks, c->nr_erasing_blocks,
880 c->dirty_size, nr_very_dirty, ret ? "yes" : "no");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700881
882 return ret;
883}