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