]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * JFFS2 -- Journalling Flash File System, Version 2. | |
3 | * | |
c00c310e | 4 | * Copyright © 2001-2007 Red Hat, Inc. |
1da177e4 LT |
5 | * |
6 | * Created by David Woodhouse <dwmw2@infradead.org> | |
7 | * | |
8 | * For licensing information, see the file 'LICENCE' in this directory. | |
9 | * | |
1da177e4 LT |
10 | */ |
11 | ||
12 | #include <linux/kernel.h> | |
13 | #include <linux/sched.h> | |
14 | #include <linux/fs.h> | |
15 | #include <linux/mtd/mtd.h> | |
16 | #include <linux/rbtree.h> | |
17 | #include <linux/crc32.h> | |
18 | #include <linux/slab.h> | |
19 | #include <linux/pagemap.h> | |
20 | #include "nodelist.h" | |
21 | ||
90a18fab AB |
22 | static void jffs2_obsolete_node_frag(struct jffs2_sb_info *c, |
23 | struct jffs2_node_frag *this); | |
24 | ||
1da177e4 LT |
25 | void jffs2_add_fd_to_list(struct jffs2_sb_info *c, struct jffs2_full_dirent *new, struct jffs2_full_dirent **list) |
26 | { | |
27 | struct jffs2_full_dirent **prev = list; | |
182ec4ee | 28 | |
733802d9 | 29 | dbg_dentlist("add dirent \"%s\", ino #%u\n", new->name, new->ino); |
1da177e4 LT |
30 | |
31 | while ((*prev) && (*prev)->nhash <= new->nhash) { | |
32 | if ((*prev)->nhash == new->nhash && !strcmp((*prev)->name, new->name)) { | |
33 | /* Duplicate. Free one */ | |
34 | if (new->version < (*prev)->version) { | |
733802d9 | 35 | dbg_dentlist("Eep! Marking new dirent node is obsolete, old is \"%s\", ino #%u\n", |
e0d60137 | 36 | (*prev)->name, (*prev)->ino); |
1da177e4 LT |
37 | jffs2_mark_node_obsolete(c, new->raw); |
38 | jffs2_free_full_dirent(new); | |
39 | } else { | |
733802d9 | 40 | dbg_dentlist("marking old dirent \"%s\", ino #%u bsolete\n", |
e0d60137 | 41 | (*prev)->name, (*prev)->ino); |
1da177e4 LT |
42 | new->next = (*prev)->next; |
43 | jffs2_mark_node_obsolete(c, ((*prev)->raw)); | |
44 | jffs2_free_full_dirent(*prev); | |
45 | *prev = new; | |
46 | } | |
e0d60137 | 47 | return; |
1da177e4 LT |
48 | } |
49 | prev = &((*prev)->next); | |
50 | } | |
51 | new->next = *prev; | |
52 | *prev = new; | |
1da177e4 LT |
53 | } |
54 | ||
1e900979 AB |
55 | void jffs2_truncate_fragtree(struct jffs2_sb_info *c, struct rb_root *list, uint32_t size) |
56 | { | |
57 | struct jffs2_node_frag *frag = jffs2_lookup_node_frag(list, size); | |
58 | ||
733802d9 | 59 | dbg_fragtree("truncating fragtree to 0x%08x bytes\n", size); |
1e900979 AB |
60 | |
61 | /* We know frag->ofs <= size. That's what lookup does for us */ | |
62 | if (frag && frag->ofs != size) { | |
1e0da3cb | 63 | if (frag->ofs+frag->size > size) { |
1e900979 AB |
64 | frag->size = size - frag->ofs; |
65 | } | |
66 | frag = frag_next(frag); | |
67 | } | |
68 | while (frag && frag->ofs >= size) { | |
69 | struct jffs2_node_frag *next = frag_next(frag); | |
70 | ||
1e900979 AB |
71 | frag_erase(frag, list); |
72 | jffs2_obsolete_node_frag(c, frag); | |
73 | frag = next; | |
74 | } | |
1e0da3cb AB |
75 | |
76 | if (size == 0) | |
77 | return; | |
78 | ||
182ec4ee | 79 | /* |
1e0da3cb AB |
80 | * If the last fragment starts at the RAM page boundary, it is |
81 | * REF_PRISTINE irrespective of its size. | |
82 | */ | |
83 | frag = frag_last(list); | |
f0507530 | 84 | if (frag->node && (frag->ofs & (PAGE_CACHE_SIZE - 1)) == 0) { |
733802d9 | 85 | dbg_fragtree2("marking the last fragment 0x%08x-0x%08x REF_PRISTINE.\n", |
182ec4ee | 86 | frag->ofs, frag->ofs + frag->size); |
1e0da3cb AB |
87 | frag->node->raw->flash_offset = ref_offset(frag->node->raw) | REF_PRISTINE; |
88 | } | |
1e900979 AB |
89 | } |
90 | ||
90a18fab AB |
91 | static void jffs2_obsolete_node_frag(struct jffs2_sb_info *c, |
92 | struct jffs2_node_frag *this) | |
1da177e4 | 93 | { |
f97117d1 AB |
94 | if (this->node) { |
95 | this->node->frags--; | |
96 | if (!this->node->frags) { | |
97 | /* The node has no valid frags left. It's totally obsoleted */ | |
733802d9 | 98 | dbg_fragtree2("marking old node @0x%08x (0x%04x-0x%04x) obsolete\n", |
e0d60137 | 99 | ref_offset(this->node->raw), this->node->ofs, this->node->ofs+this->node->size); |
f97117d1 AB |
100 | jffs2_mark_node_obsolete(c, this->node->raw); |
101 | jffs2_free_full_dnode(this->node); | |
102 | } else { | |
733802d9 | 103 | dbg_fragtree2("marking old node @0x%08x (0x%04x-0x%04x) REF_NORMAL. frags is %d\n", |
e0d60137 | 104 | ref_offset(this->node->raw), this->node->ofs, this->node->ofs+this->node->size, this->node->frags); |
f97117d1 AB |
105 | mark_ref_normal(this->node->raw); |
106 | } | |
182ec4ee | 107 | |
f97117d1 AB |
108 | } |
109 | jffs2_free_node_frag(this); | |
1da177e4 LT |
110 | } |
111 | ||
f97117d1 | 112 | static void jffs2_fragtree_insert(struct jffs2_node_frag *newfrag, struct jffs2_node_frag *base) |
1da177e4 | 113 | { |
f97117d1 AB |
114 | struct rb_node *parent = &base->rb; |
115 | struct rb_node **link = &parent; | |
9dee7503 | 116 | |
733802d9 | 117 | dbg_fragtree2("insert frag (0x%04x-0x%04x)\n", newfrag->ofs, newfrag->ofs + newfrag->size); |
9dee7503 | 118 | |
f97117d1 AB |
119 | while (*link) { |
120 | parent = *link; | |
121 | base = rb_entry(parent, struct jffs2_node_frag, rb); | |
182ec4ee | 122 | |
f97117d1 AB |
123 | if (newfrag->ofs > base->ofs) |
124 | link = &base->rb.rb_right; | |
125 | else if (newfrag->ofs < base->ofs) | |
126 | link = &base->rb.rb_left; | |
9dee7503 | 127 | else { |
e0d60137 | 128 | JFFS2_ERROR("duplicate frag at %08x (%p,%p)\n", newfrag->ofs, newfrag, base); |
f97117d1 | 129 | BUG(); |
9dee7503 | 130 | } |
1da177e4 | 131 | } |
f97117d1 AB |
132 | |
133 | rb_link_node(&newfrag->rb, &base->rb, link); | |
1da177e4 LT |
134 | } |
135 | ||
1e0da3cb AB |
136 | /* |
137 | * Allocate and initializes a new fragment. | |
138 | */ | |
858119e1 | 139 | static struct jffs2_node_frag * new_fragment(struct jffs2_full_dnode *fn, uint32_t ofs, uint32_t size) |
1e0da3cb AB |
140 | { |
141 | struct jffs2_node_frag *newfrag; | |
182ec4ee | 142 | |
1e0da3cb AB |
143 | newfrag = jffs2_alloc_node_frag(); |
144 | if (likely(newfrag)) { | |
145 | newfrag->ofs = ofs; | |
146 | newfrag->size = size; | |
147 | newfrag->node = fn; | |
148 | } else { | |
149 | JFFS2_ERROR("cannot allocate a jffs2_node_frag object\n"); | |
150 | } | |
151 | ||
152 | return newfrag; | |
153 | } | |
154 | ||
155 | /* | |
156 | * Called when there is no overlapping fragment exist. Inserts a hole before the new | |
157 | * fragment and inserts the new fragment to the fragtree. | |
158 | */ | |
159 | static int no_overlapping_node(struct jffs2_sb_info *c, struct rb_root *root, | |
160 | struct jffs2_node_frag *newfrag, | |
161 | struct jffs2_node_frag *this, uint32_t lastend) | |
162 | { | |
163 | if (lastend < newfrag->node->ofs) { | |
164 | /* put a hole in before the new fragment */ | |
165 | struct jffs2_node_frag *holefrag; | |
166 | ||
167 | holefrag= new_fragment(NULL, lastend, newfrag->node->ofs - lastend); | |
168 | if (unlikely(!holefrag)) { | |
169 | jffs2_free_node_frag(newfrag); | |
170 | return -ENOMEM; | |
171 | } | |
172 | ||
173 | if (this) { | |
182ec4ee | 174 | /* By definition, the 'this' node has no right-hand child, |
1e0da3cb AB |
175 | because there are no frags with offset greater than it. |
176 | So that's where we want to put the hole */ | |
733802d9 | 177 | dbg_fragtree2("add hole frag %#04x-%#04x on the right of the new frag.\n", |
1e0da3cb AB |
178 | holefrag->ofs, holefrag->ofs + holefrag->size); |
179 | rb_link_node(&holefrag->rb, &this->rb, &this->rb.rb_right); | |
180 | } else { | |
733802d9 | 181 | dbg_fragtree2("Add hole frag %#04x-%#04x to the root of the tree.\n", |
1e0da3cb AB |
182 | holefrag->ofs, holefrag->ofs + holefrag->size); |
183 | rb_link_node(&holefrag->rb, NULL, &root->rb_node); | |
184 | } | |
185 | rb_insert_color(&holefrag->rb, root); | |
186 | this = holefrag; | |
187 | } | |
182ec4ee | 188 | |
1e0da3cb | 189 | if (this) { |
182ec4ee | 190 | /* By definition, the 'this' node has no right-hand child, |
1e0da3cb AB |
191 | because there are no frags with offset greater than it. |
192 | So that's where we want to put new fragment */ | |
733802d9 | 193 | dbg_fragtree2("add the new node at the right\n"); |
182ec4ee | 194 | rb_link_node(&newfrag->rb, &this->rb, &this->rb.rb_right); |
1e0da3cb | 195 | } else { |
733802d9 | 196 | dbg_fragtree2("insert the new node at the root of the tree\n"); |
1e0da3cb AB |
197 | rb_link_node(&newfrag->rb, NULL, &root->rb_node); |
198 | } | |
199 | rb_insert_color(&newfrag->rb, root); | |
200 | ||
201 | return 0; | |
202 | } | |
203 | ||
f97117d1 | 204 | /* Doesn't set inode->i_size */ |
1e0da3cb | 205 | static int jffs2_add_frag_to_fragtree(struct jffs2_sb_info *c, struct rb_root *root, struct jffs2_node_frag *newfrag) |
1da177e4 | 206 | { |
f97117d1 AB |
207 | struct jffs2_node_frag *this; |
208 | uint32_t lastend; | |
1da177e4 | 209 | |
f97117d1 | 210 | /* Skip all the nodes which are completed before this one starts */ |
1e0da3cb | 211 | this = jffs2_lookup_node_frag(root, newfrag->node->ofs); |
1da177e4 | 212 | |
f97117d1 | 213 | if (this) { |
733802d9 | 214 | dbg_fragtree2("lookup gave frag 0x%04x-0x%04x; phys 0x%08x (*%p)\n", |
e0d60137 | 215 | this->ofs, this->ofs+this->size, this->node?(ref_offset(this->node->raw)):0xffffffff, this); |
f97117d1 AB |
216 | lastend = this->ofs + this->size; |
217 | } else { | |
733802d9 | 218 | dbg_fragtree2("lookup gave no frag\n"); |
f97117d1 | 219 | lastend = 0; |
1da177e4 | 220 | } |
182ec4ee | 221 | |
1e0da3cb | 222 | /* See if we ran off the end of the fragtree */ |
f97117d1 AB |
223 | if (lastend <= newfrag->ofs) { |
224 | /* We did */ | |
225 | ||
226 | /* Check if 'this' node was on the same page as the new node. | |
227 | If so, both 'this' and the new node get marked REF_NORMAL so | |
228 | the GC can take a look. | |
229 | */ | |
230 | if (lastend && (lastend-1) >> PAGE_CACHE_SHIFT == newfrag->ofs >> PAGE_CACHE_SHIFT) { | |
231 | if (this->node) | |
232 | mark_ref_normal(this->node->raw); | |
233 | mark_ref_normal(newfrag->node->raw); | |
234 | } | |
1da177e4 | 235 | |
1e0da3cb | 236 | return no_overlapping_node(c, root, newfrag, this, lastend); |
dae6227f | 237 | } |
dae6227f | 238 | |
1e0da3cb | 239 | if (this->node) |
733802d9 | 240 | dbg_fragtree2("dealing with frag %u-%u, phys %#08x(%d).\n", |
1e0da3cb AB |
241 | this->ofs, this->ofs + this->size, |
242 | ref_offset(this->node->raw), ref_flags(this->node->raw)); | |
243 | else | |
733802d9 | 244 | dbg_fragtree2("dealing with hole frag %u-%u.\n", |
1e0da3cb | 245 | this->ofs, this->ofs + this->size); |
dae6227f | 246 | |
f97117d1 | 247 | /* OK. 'this' is pointing at the first frag that newfrag->ofs at least partially obsoletes, |
182ec4ee | 248 | * - i.e. newfrag->ofs < this->ofs+this->size && newfrag->ofs >= this->ofs |
dae6227f | 249 | */ |
f97117d1 AB |
250 | if (newfrag->ofs > this->ofs) { |
251 | /* This node isn't completely obsoleted. The start of it remains valid */ | |
252 | ||
253 | /* Mark the new node and the partially covered node REF_NORMAL -- let | |
254 | the GC take a look at them */ | |
255 | mark_ref_normal(newfrag->node->raw); | |
256 | if (this->node) | |
257 | mark_ref_normal(this->node->raw); | |
258 | ||
259 | if (this->ofs + this->size > newfrag->ofs + newfrag->size) { | |
260 | /* The new node splits 'this' frag into two */ | |
1e0da3cb AB |
261 | struct jffs2_node_frag *newfrag2; |
262 | ||
f97117d1 | 263 | if (this->node) |
733802d9 | 264 | dbg_fragtree2("split old frag 0x%04x-0x%04x, phys 0x%08x\n", |
e0d60137 | 265 | this->ofs, this->ofs+this->size, ref_offset(this->node->raw)); |
182ec4ee | 266 | else |
733802d9 | 267 | dbg_fragtree2("split old hole frag 0x%04x-0x%04x\n", |
8d5df409 | 268 | this->ofs, this->ofs+this->size); |
182ec4ee | 269 | |
f97117d1 | 270 | /* New second frag pointing to this's node */ |
1e0da3cb AB |
271 | newfrag2 = new_fragment(this->node, newfrag->ofs + newfrag->size, |
272 | this->ofs + this->size - newfrag->ofs - newfrag->size); | |
273 | if (unlikely(!newfrag2)) | |
274 | return -ENOMEM; | |
f97117d1 AB |
275 | if (this->node) |
276 | this->node->frags++; | |
277 | ||
278 | /* Adjust size of original 'this' */ | |
279 | this->size = newfrag->ofs - this->ofs; | |
280 | ||
281 | /* Now, we know there's no node with offset | |
282 | greater than this->ofs but smaller than | |
283 | newfrag2->ofs or newfrag->ofs, for obvious | |
284 | reasons. So we can do a tree insert from | |
285 | 'this' to insert newfrag, and a tree insert | |
286 | from newfrag to insert newfrag2. */ | |
287 | jffs2_fragtree_insert(newfrag, this); | |
1e0da3cb | 288 | rb_insert_color(&newfrag->rb, root); |
182ec4ee | 289 | |
f97117d1 | 290 | jffs2_fragtree_insert(newfrag2, newfrag); |
1e0da3cb | 291 | rb_insert_color(&newfrag2->rb, root); |
182ec4ee | 292 | |
f97117d1 | 293 | return 0; |
dae6227f | 294 | } |
f97117d1 AB |
295 | /* New node just reduces 'this' frag in size, doesn't split it */ |
296 | this->size = newfrag->ofs - this->ofs; | |
dae6227f | 297 | |
f97117d1 AB |
298 | /* Again, we know it lives down here in the tree */ |
299 | jffs2_fragtree_insert(newfrag, this); | |
1e0da3cb | 300 | rb_insert_color(&newfrag->rb, root); |
f97117d1 | 301 | } else { |
182ec4ee | 302 | /* New frag starts at the same point as 'this' used to. Replace |
f97117d1 | 303 | it in the tree without doing a delete and insertion */ |
733802d9 | 304 | dbg_fragtree2("inserting newfrag (*%p),%d-%d in before 'this' (*%p),%d-%d\n", |
e0d60137 | 305 | newfrag, newfrag->ofs, newfrag->ofs+newfrag->size, this, this->ofs, this->ofs+this->size); |
182ec4ee | 306 | |
1e0da3cb | 307 | rb_replace_node(&this->rb, &newfrag->rb, root); |
182ec4ee | 308 | |
f97117d1 | 309 | if (newfrag->ofs + newfrag->size >= this->ofs+this->size) { |
733802d9 | 310 | dbg_fragtree2("obsoleting node frag %p (%x-%x)\n", this, this->ofs, this->ofs+this->size); |
f97117d1 | 311 | jffs2_obsolete_node_frag(c, this); |
dae6227f | 312 | } else { |
f97117d1 AB |
313 | this->ofs += newfrag->size; |
314 | this->size -= newfrag->size; | |
315 | ||
316 | jffs2_fragtree_insert(this, newfrag); | |
1e0da3cb | 317 | rb_insert_color(&this->rb, root); |
f97117d1 | 318 | return 0; |
dae6227f | 319 | } |
dae6227f | 320 | } |
f97117d1 | 321 | /* OK, now we have newfrag added in the correct place in the tree, but |
182ec4ee | 322 | frag_next(newfrag) may be a fragment which is overlapped by it |
f97117d1 AB |
323 | */ |
324 | while ((this = frag_next(newfrag)) && newfrag->ofs + newfrag->size >= this->ofs + this->size) { | |
325 | /* 'this' frag is obsoleted completely. */ | |
733802d9 | 326 | dbg_fragtree2("obsoleting node frag %p (%x-%x) and removing from tree\n", |
e0d60137 | 327 | this, this->ofs, this->ofs+this->size); |
1e0da3cb | 328 | rb_erase(&this->rb, root); |
f97117d1 | 329 | jffs2_obsolete_node_frag(c, this); |
dae6227f | 330 | } |
182ec4ee | 331 | /* Now we're pointing at the first frag which isn't totally obsoleted by |
f97117d1 | 332 | the new frag */ |
dae6227f | 333 | |
1e0da3cb | 334 | if (!this || newfrag->ofs + newfrag->size == this->ofs) |
f97117d1 | 335 | return 0; |
1e0da3cb | 336 | |
f97117d1 AB |
337 | /* Still some overlap but we don't need to move it in the tree */ |
338 | this->size = (this->ofs + this->size) - (newfrag->ofs + newfrag->size); | |
339 | this->ofs = newfrag->ofs + newfrag->size; | |
340 | ||
341 | /* And mark them REF_NORMAL so the GC takes a look at them */ | |
342 | if (this->node) | |
343 | mark_ref_normal(this->node->raw); | |
344 | mark_ref_normal(newfrag->node->raw); | |
dae6227f AB |
345 | |
346 | return 0; | |
347 | } | |
348 | ||
182ec4ee | 349 | /* |
1e0da3cb AB |
350 | * Given an inode, probably with existing tree of fragments, add the new node |
351 | * to the fragment tree. | |
dae6227f | 352 | */ |
f97117d1 | 353 | int jffs2_add_full_dnode_to_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, struct jffs2_full_dnode *fn) |
dae6227f | 354 | { |
f97117d1 AB |
355 | int ret; |
356 | struct jffs2_node_frag *newfrag; | |
dae6227f | 357 | |
f97117d1 AB |
358 | if (unlikely(!fn->size)) |
359 | return 0; | |
dae6227f | 360 | |
1e0da3cb | 361 | newfrag = new_fragment(fn, fn->ofs, fn->size); |
f97117d1 AB |
362 | if (unlikely(!newfrag)) |
363 | return -ENOMEM; | |
1e0da3cb | 364 | newfrag->node->frags = 1; |
1da177e4 | 365 | |
733802d9 | 366 | dbg_fragtree("adding node %#04x-%#04x @0x%08x on flash, newfrag *%p\n", |
e0d60137 | 367 | fn->ofs, fn->ofs+fn->size, ref_offset(fn->raw), newfrag); |
182ec4ee | 368 | |
f97117d1 AB |
369 | ret = jffs2_add_frag_to_fragtree(c, &f->fragtree, newfrag); |
370 | if (unlikely(ret)) | |
371 | return ret; | |
372 | ||
373 | /* If we now share a page with other nodes, mark either previous | |
374 | or next node REF_NORMAL, as appropriate. */ | |
375 | if (newfrag->ofs & (PAGE_CACHE_SIZE-1)) { | |
376 | struct jffs2_node_frag *prev = frag_prev(newfrag); | |
377 | ||
378 | mark_ref_normal(fn->raw); | |
182ec4ee | 379 | /* If we don't start at zero there's _always_ a previous */ |
f97117d1 AB |
380 | if (prev->node) |
381 | mark_ref_normal(prev->node->raw); | |
382 | } | |
1da177e4 | 383 | |
f97117d1 AB |
384 | if ((newfrag->ofs+newfrag->size) & (PAGE_CACHE_SIZE-1)) { |
385 | struct jffs2_node_frag *next = frag_next(newfrag); | |
182ec4ee | 386 | |
f97117d1 AB |
387 | if (next) { |
388 | mark_ref_normal(fn->raw); | |
389 | if (next->node) | |
390 | mark_ref_normal(next->node->raw); | |
1da177e4 | 391 | } |
1da177e4 | 392 | } |
f97117d1 | 393 | jffs2_dbg_fragtree_paranoia_check_nolock(f); |
1e0da3cb AB |
394 | |
395 | return 0; | |
396 | } | |
397 | ||
1da177e4 LT |
398 | void jffs2_set_inocache_state(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic, int state) |
399 | { | |
400 | spin_lock(&c->inocache_lock); | |
401 | ic->state = state; | |
402 | wake_up(&c->inocache_wq); | |
403 | spin_unlock(&c->inocache_lock); | |
404 | } | |
405 | ||
406 | /* During mount, this needs no locking. During normal operation, its | |
407 | callers want to do other stuff while still holding the inocache_lock. | |
182ec4ee | 408 | Rather than introducing special case get_ino_cache functions or |
1da177e4 | 409 | callbacks, we just let the caller do the locking itself. */ |
182ec4ee | 410 | |
1da177e4 LT |
411 | struct jffs2_inode_cache *jffs2_get_ino_cache(struct jffs2_sb_info *c, uint32_t ino) |
412 | { | |
413 | struct jffs2_inode_cache *ret; | |
414 | ||
1da177e4 LT |
415 | ret = c->inocache_list[ino % INOCACHE_HASHSIZE]; |
416 | while (ret && ret->ino < ino) { | |
417 | ret = ret->next; | |
418 | } | |
182ec4ee | 419 | |
1da177e4 LT |
420 | if (ret && ret->ino != ino) |
421 | ret = NULL; | |
422 | ||
1da177e4 LT |
423 | return ret; |
424 | } | |
425 | ||
426 | void jffs2_add_ino_cache (struct jffs2_sb_info *c, struct jffs2_inode_cache *new) | |
427 | { | |
428 | struct jffs2_inode_cache **prev; | |
7d27c814 | 429 | |
1da177e4 | 430 | spin_lock(&c->inocache_lock); |
7d27c814 TG |
431 | if (!new->ino) |
432 | new->ino = ++c->highest_ino; | |
433 | ||
733802d9 | 434 | dbg_inocache("add %p (ino #%u)\n", new, new->ino); |
7d27c814 | 435 | |
1da177e4 LT |
436 | prev = &c->inocache_list[new->ino % INOCACHE_HASHSIZE]; |
437 | ||
438 | while ((*prev) && (*prev)->ino < new->ino) { | |
439 | prev = &(*prev)->next; | |
440 | } | |
441 | new->next = *prev; | |
442 | *prev = new; | |
443 | ||
444 | spin_unlock(&c->inocache_lock); | |
445 | } | |
446 | ||
447 | void jffs2_del_ino_cache(struct jffs2_sb_info *c, struct jffs2_inode_cache *old) | |
448 | { | |
449 | struct jffs2_inode_cache **prev; | |
e0d60137 | 450 | |
355ed4e1 KK |
451 | #ifdef CONFIG_JFFS2_FS_XATTR |
452 | BUG_ON(old->xref); | |
453 | #endif | |
733802d9 | 454 | dbg_inocache("del %p (ino #%u)\n", old, old->ino); |
1da177e4 | 455 | spin_lock(&c->inocache_lock); |
182ec4ee | 456 | |
1da177e4 | 457 | prev = &c->inocache_list[old->ino % INOCACHE_HASHSIZE]; |
182ec4ee | 458 | |
1da177e4 LT |
459 | while ((*prev) && (*prev)->ino < old->ino) { |
460 | prev = &(*prev)->next; | |
461 | } | |
462 | if ((*prev) == old) { | |
463 | *prev = old->next; | |
464 | } | |
465 | ||
67e345d1 DW |
466 | /* Free it now unless it's in READING or CLEARING state, which |
467 | are the transitions upon read_inode() and clear_inode(). The | |
182ec4ee | 468 | rest of the time we know nobody else is looking at it, and |
67e345d1 DW |
469 | if it's held by read_inode() or clear_inode() they'll free it |
470 | for themselves. */ | |
471 | if (old->state != INO_STATE_READING && old->state != INO_STATE_CLEARING) | |
472 | jffs2_free_inode_cache(old); | |
473 | ||
1da177e4 LT |
474 | spin_unlock(&c->inocache_lock); |
475 | } | |
476 | ||
477 | void jffs2_free_ino_caches(struct jffs2_sb_info *c) | |
478 | { | |
479 | int i; | |
480 | struct jffs2_inode_cache *this, *next; | |
182ec4ee | 481 | |
1da177e4 LT |
482 | for (i=0; i<INOCACHE_HASHSIZE; i++) { |
483 | this = c->inocache_list[i]; | |
484 | while (this) { | |
485 | next = this->next; | |
aa98d7cf | 486 | jffs2_xattr_free_inode(c, this); |
1da177e4 LT |
487 | jffs2_free_inode_cache(this); |
488 | this = next; | |
489 | } | |
490 | c->inocache_list[i] = NULL; | |
491 | } | |
492 | } | |
493 | ||
494 | void jffs2_free_raw_node_refs(struct jffs2_sb_info *c) | |
495 | { | |
496 | int i; | |
497 | struct jffs2_raw_node_ref *this, *next; | |
498 | ||
499 | for (i=0; i<c->nr_blocks; i++) { | |
500 | this = c->blocks[i].first_node; | |
2f785402 | 501 | while (this) { |
9bfeb691 DW |
502 | if (this[REFS_PER_BLOCK].flash_offset == REF_LINK_NODE) |
503 | next = this[REFS_PER_BLOCK].next_in_ino; | |
504 | else | |
505 | next = NULL; | |
506 | ||
507 | jffs2_free_refblock(this); | |
1da177e4 LT |
508 | this = next; |
509 | } | |
510 | c->blocks[i].first_node = c->blocks[i].last_node = NULL; | |
511 | } | |
512 | } | |
182ec4ee | 513 | |
1da177e4 LT |
514 | struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset) |
515 | { | |
182ec4ee | 516 | /* The common case in lookup is that there will be a node |
1da177e4 LT |
517 | which precisely matches. So we go looking for that first */ |
518 | struct rb_node *next; | |
519 | struct jffs2_node_frag *prev = NULL; | |
520 | struct jffs2_node_frag *frag = NULL; | |
521 | ||
733802d9 | 522 | dbg_fragtree2("root %p, offset %d\n", fragtree, offset); |
1da177e4 LT |
523 | |
524 | next = fragtree->rb_node; | |
525 | ||
526 | while(next) { | |
527 | frag = rb_entry(next, struct jffs2_node_frag, rb); | |
528 | ||
1da177e4 | 529 | if (frag->ofs + frag->size <= offset) { |
1da177e4 LT |
530 | /* Remember the closest smaller match on the way down */ |
531 | if (!prev || frag->ofs > prev->ofs) | |
532 | prev = frag; | |
533 | next = frag->rb.rb_right; | |
534 | } else if (frag->ofs > offset) { | |
1da177e4 LT |
535 | next = frag->rb.rb_left; |
536 | } else { | |
1da177e4 LT |
537 | return frag; |
538 | } | |
539 | } | |
540 | ||
541 | /* Exact match not found. Go back up looking at each parent, | |
542 | and return the closest smaller one */ | |
543 | ||
544 | if (prev) | |
733802d9 | 545 | dbg_fragtree2("no match. Returning frag %#04x-%#04x, closest previous\n", |
e0d60137 | 546 | prev->ofs, prev->ofs+prev->size); |
182ec4ee | 547 | else |
733802d9 | 548 | dbg_fragtree2("returning NULL, empty fragtree\n"); |
182ec4ee | 549 | |
1da177e4 LT |
550 | return prev; |
551 | } | |
552 | ||
553 | /* Pass 'c' argument to indicate that nodes should be marked obsolete as | |
554 | they're killed. */ | |
555 | void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c) | |
556 | { | |
557 | struct jffs2_node_frag *frag; | |
558 | struct jffs2_node_frag *parent; | |
559 | ||
560 | if (!root->rb_node) | |
561 | return; | |
562 | ||
733802d9 | 563 | dbg_fragtree("killing\n"); |
182ec4ee | 564 | |
1da177e4 | 565 | frag = (rb_entry(root->rb_node, struct jffs2_node_frag, rb)); |
1da177e4 LT |
566 | while(frag) { |
567 | if (frag->rb.rb_left) { | |
1da177e4 LT |
568 | frag = frag_left(frag); |
569 | continue; | |
570 | } | |
571 | if (frag->rb.rb_right) { | |
1da177e4 LT |
572 | frag = frag_right(frag); |
573 | continue; | |
574 | } | |
575 | ||
1da177e4 | 576 | if (frag->node && !(--frag->node->frags)) { |
182ec4ee | 577 | /* Not a hole, and it's the final remaining frag |
1da177e4 LT |
578 | of this node. Free the node */ |
579 | if (c) | |
580 | jffs2_mark_node_obsolete(c, frag->node->raw); | |
182ec4ee | 581 | |
1da177e4 LT |
582 | jffs2_free_full_dnode(frag->node); |
583 | } | |
584 | parent = frag_parent(frag); | |
585 | if (parent) { | |
586 | if (frag_left(parent) == frag) | |
587 | parent->rb.rb_left = NULL; | |
182ec4ee | 588 | else |
1da177e4 LT |
589 | parent->rb.rb_right = NULL; |
590 | } | |
591 | ||
592 | jffs2_free_node_frag(frag); | |
593 | frag = parent; | |
594 | ||
595 | cond_resched(); | |
596 | } | |
597 | } | |
f1f9671b | 598 | |
2f785402 DW |
599 | struct jffs2_raw_node_ref *jffs2_link_node_ref(struct jffs2_sb_info *c, |
600 | struct jffs2_eraseblock *jeb, | |
601 | uint32_t ofs, uint32_t len, | |
602 | struct jffs2_inode_cache *ic) | |
f1f9671b | 603 | { |
2f785402 DW |
604 | struct jffs2_raw_node_ref *ref; |
605 | ||
9bfeb691 DW |
606 | BUG_ON(!jeb->allocated_refs); |
607 | jeb->allocated_refs--; | |
608 | ||
609 | ref = jeb->last_node; | |
610 | ||
611 | dbg_noderef("Last node at %p is (%08x,%p)\n", ref, ref->flash_offset, | |
612 | ref->next_in_ino); | |
613 | ||
614 | while (ref->flash_offset != REF_EMPTY_NODE) { | |
615 | if (ref->flash_offset == REF_LINK_NODE) | |
616 | ref = ref->next_in_ino; | |
617 | else | |
618 | ref++; | |
2f785402 DW |
619 | } |
620 | ||
9bfeb691 DW |
621 | dbg_noderef("New ref is %p (%08x becomes %08x,%p) len 0x%x\n", ref, |
622 | ref->flash_offset, ofs, ref->next_in_ino, len); | |
623 | ||
2f785402 DW |
624 | ref->flash_offset = ofs; |
625 | ||
9bfeb691 | 626 | if (!jeb->first_node) { |
f1f9671b | 627 | jeb->first_node = ref; |
9bfeb691 DW |
628 | BUG_ON(ref_offset(ref) != jeb->offset); |
629 | } else if (unlikely(ref_offset(ref) != jeb->offset + c->sector_size - jeb->free_size)) { | |
630 | uint32_t last_len = ref_totlen(c, jeb, jeb->last_node); | |
631 | ||
632 | JFFS2_ERROR("Adding new ref %p at (0x%08x-0x%08x) not immediately after previous (0x%08x-0x%08x)\n", | |
633 | ref, ref_offset(ref), ref_offset(ref)+len, | |
634 | ref_offset(jeb->last_node), | |
635 | ref_offset(jeb->last_node)+last_len); | |
636 | BUG(); | |
ca89a517 | 637 | } |
f1f9671b DW |
638 | jeb->last_node = ref; |
639 | ||
fcb75787 DW |
640 | if (ic) { |
641 | ref->next_in_ino = ic->nodes; | |
642 | ic->nodes = ref; | |
643 | } else { | |
644 | ref->next_in_ino = NULL; | |
645 | } | |
646 | ||
f1f9671b DW |
647 | switch(ref_flags(ref)) { |
648 | case REF_UNCHECKED: | |
649 | c->unchecked_size += len; | |
650 | jeb->unchecked_size += len; | |
651 | break; | |
652 | ||
653 | case REF_NORMAL: | |
654 | case REF_PRISTINE: | |
655 | c->used_size += len; | |
656 | jeb->used_size += len; | |
657 | break; | |
658 | ||
659 | case REF_OBSOLETE: | |
660 | c->dirty_size += len; | |
3b79673c | 661 | jeb->dirty_size += len; |
f1f9671b DW |
662 | break; |
663 | } | |
664 | c->free_size -= len; | |
665 | jeb->free_size -= len; | |
666 | ||
ca89a517 DW |
667 | #ifdef TEST_TOTLEN |
668 | /* Set (and test) __totlen field... for now */ | |
669 | ref->__totlen = len; | |
670 | ref_totlen(c, jeb, ref); | |
671 | #endif | |
2f785402 | 672 | return ref; |
f1f9671b | 673 | } |
68270995 | 674 | |
2f785402 | 675 | /* No locking, no reservation of 'ref'. Do not use on a live file system */ |
68270995 DW |
676 | int jffs2_scan_dirty_space(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, |
677 | uint32_t size) | |
678 | { | |
ca89a517 DW |
679 | if (!size) |
680 | return 0; | |
9bfeb691 DW |
681 | if (unlikely(size > jeb->free_size)) { |
682 | printk(KERN_CRIT "Dirty space 0x%x larger then free_size 0x%x (wasted 0x%x)\n", | |
683 | size, jeb->free_size, jeb->wasted_size); | |
ca89a517 DW |
684 | BUG(); |
685 | } | |
9bfeb691 | 686 | /* REF_EMPTY_NODE is !obsolete, so that works OK */ |
2ebf09c2 | 687 | if (jeb->last_node && ref_obsolete(jeb->last_node)) { |
ca89a517 DW |
688 | #ifdef TEST_TOTLEN |
689 | jeb->last_node->__totlen += size; | |
690 | #endif | |
691 | c->dirty_size += size; | |
692 | c->free_size -= size; | |
693 | jeb->dirty_size += size; | |
694 | jeb->free_size -= size; | |
695 | } else { | |
2f785402 DW |
696 | uint32_t ofs = jeb->offset + c->sector_size - jeb->free_size; |
697 | ofs |= REF_OBSOLETE; | |
ca89a517 | 698 | |
2f785402 | 699 | jffs2_link_node_ref(c, jeb, ofs, size, NULL); |
ca89a517 | 700 | } |
68270995 DW |
701 | |
702 | return 0; | |
703 | } | |
ca89a517 DW |
704 | |
705 | /* Calculate totlen from surrounding nodes or eraseblock */ | |
706 | static inline uint32_t __ref_totlen(struct jffs2_sb_info *c, | |
707 | struct jffs2_eraseblock *jeb, | |
708 | struct jffs2_raw_node_ref *ref) | |
709 | { | |
710 | uint32_t ref_end; | |
99988f7b | 711 | struct jffs2_raw_node_ref *next_ref = ref_next(ref); |
ca89a517 | 712 | |
99988f7b DW |
713 | if (next_ref) |
714 | ref_end = ref_offset(next_ref); | |
ca89a517 DW |
715 | else { |
716 | if (!jeb) | |
717 | jeb = &c->blocks[ref->flash_offset / c->sector_size]; | |
718 | ||
719 | /* Last node in block. Use free_space */ | |
9bfeb691 | 720 | if (unlikely(ref != jeb->last_node)) { |
ca89a517 DW |
721 | printk(KERN_CRIT "ref %p @0x%08x is not jeb->last_node (%p @0x%08x)\n", |
722 | ref, ref_offset(ref), jeb->last_node, jeb->last_node?ref_offset(jeb->last_node):0); | |
723 | BUG(); | |
724 | } | |
725 | ref_end = jeb->offset + c->sector_size - jeb->free_size; | |
726 | } | |
727 | return ref_end - ref_offset(ref); | |
728 | } | |
729 | ||
730 | uint32_t __jffs2_ref_totlen(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, | |
731 | struct jffs2_raw_node_ref *ref) | |
732 | { | |
733 | uint32_t ret; | |
734 | ||
ca89a517 | 735 | ret = __ref_totlen(c, jeb, ref); |
9bfeb691 | 736 | |
ca89a517 | 737 | #ifdef TEST_TOTLEN |
9bfeb691 DW |
738 | if (unlikely(ret != ref->__totlen)) { |
739 | if (!jeb) | |
740 | jeb = &c->blocks[ref->flash_offset / c->sector_size]; | |
741 | ||
ca89a517 DW |
742 | printk(KERN_CRIT "Totlen for ref at %p (0x%08x-0x%08x) miscalculated as 0x%x instead of %x\n", |
743 | ref, ref_offset(ref), ref_offset(ref)+ref->__totlen, | |
744 | ret, ref->__totlen); | |
99988f7b DW |
745 | if (ref_next(ref)) { |
746 | printk(KERN_CRIT "next %p (0x%08x-0x%08x)\n", ref_next(ref), ref_offset(ref_next(ref)), | |
747 | ref_offset(ref_next(ref))+ref->__totlen); | |
ca89a517 | 748 | } else |
99988f7b | 749 | printk(KERN_CRIT "No next ref. jeb->last_node is %p\n", jeb->last_node); |
ca89a517 DW |
750 | |
751 | printk(KERN_CRIT "jeb->wasted_size %x, dirty_size %x, used_size %x, free_size %x\n", jeb->wasted_size, jeb->dirty_size, jeb->used_size, jeb->free_size); | |
9bfeb691 | 752 | |
ca89a517 DW |
753 | #if defined(JFFS2_DBG_DUMPS) || defined(JFFS2_DBG_PARANOIA_CHECKS) |
754 | __jffs2_dbg_dump_node_refs_nolock(c, jeb); | |
755 | #endif | |
9bfeb691 | 756 | |
ca89a517 | 757 | WARN_ON(1); |
9bfeb691 DW |
758 | |
759 | ret = ref->__totlen; | |
ca89a517 DW |
760 | } |
761 | #endif /* TEST_TOTLEN */ | |
762 | return ret; | |
763 | } |