blob: 9a6ced05f894331202b897489565eeb53ab0bf65 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * JFFS2 -- Journalling Flash File System, Version 2.
3 *
4 * Copyright (C) 2001-2003 Red Hat, Inc.
5 *
6 * Created by David Woodhouse <dwmw2@infradead.org>
7 *
8 * For licensing information, see the file 'LICENCE' in this directory.
9 *
Thomas Gleixner182ec4e2005-11-07 11:16:07 +000010 * $Id: nodelist.c,v 1.115 2005/11/07 11:14:40 gleixner Exp $
Linus Torvalds1da177e2005-04-16 15:20:36 -070011 *
12 */
13
14#include <linux/kernel.h>
15#include <linux/sched.h>
16#include <linux/fs.h>
17#include <linux/mtd/mtd.h>
18#include <linux/rbtree.h>
19#include <linux/crc32.h>
20#include <linux/slab.h>
21#include <linux/pagemap.h>
22#include "nodelist.h"
23
24void jffs2_add_fd_to_list(struct jffs2_sb_info *c, struct jffs2_full_dirent *new, struct jffs2_full_dirent **list)
25{
26 struct jffs2_full_dirent **prev = list;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +000027
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +010028 dbg_dentlist("add dirent \"%s\", ino #%u\n", new->name, new->ino);
Linus Torvalds1da177e2005-04-16 15:20:36 -070029
30 while ((*prev) && (*prev)->nhash <= new->nhash) {
31 if ((*prev)->nhash == new->nhash && !strcmp((*prev)->name, new->name)) {
32 /* Duplicate. Free one */
33 if (new->version < (*prev)->version) {
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +010034 dbg_dentlist("Eep! Marking new dirent node is obsolete, old is \"%s\", ino #%u\n",
Artem B. Bityutskiye0d60132005-07-28 15:46:43 +010035 (*prev)->name, (*prev)->ino);
Linus Torvalds1da177e2005-04-16 15:20:36 -070036 jffs2_mark_node_obsolete(c, new->raw);
37 jffs2_free_full_dirent(new);
38 } else {
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +010039 dbg_dentlist("marking old dirent \"%s\", ino #%u bsolete\n",
Artem B. Bityutskiye0d60132005-07-28 15:46:43 +010040 (*prev)->name, (*prev)->ino);
Linus Torvalds1da177e2005-04-16 15:20:36 -070041 new->next = (*prev)->next;
42 jffs2_mark_node_obsolete(c, ((*prev)->raw));
43 jffs2_free_full_dirent(*prev);
44 *prev = new;
45 }
Artem B. Bityutskiye0d60132005-07-28 15:46:43 +010046 return;
Linus Torvalds1da177e2005-04-16 15:20:36 -070047 }
48 prev = &((*prev)->next);
49 }
50 new->next = *prev;
51 *prev = new;
Linus Torvalds1da177e2005-04-16 15:20:36 -070052}
53
Artem B. Bityutskiy1e900972005-07-31 09:20:48 +010054void jffs2_truncate_fragtree(struct jffs2_sb_info *c, struct rb_root *list, uint32_t size)
55{
56 struct jffs2_node_frag *frag = jffs2_lookup_node_frag(list, size);
57
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +010058 dbg_fragtree("truncating fragtree to 0x%08x bytes\n", size);
Artem B. Bityutskiy1e900972005-07-31 09:20:48 +010059
60 /* We know frag->ofs <= size. That's what lookup does for us */
61 if (frag && frag->ofs != size) {
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +010062 if (frag->ofs+frag->size > size) {
Artem B. Bityutskiy1e900972005-07-31 09:20:48 +010063 frag->size = size - frag->ofs;
64 }
65 frag = frag_next(frag);
66 }
67 while (frag && frag->ofs >= size) {
68 struct jffs2_node_frag *next = frag_next(frag);
69
Artem B. Bityutskiy1e900972005-07-31 09:20:48 +010070 frag_erase(frag, list);
71 jffs2_obsolete_node_frag(c, frag);
72 frag = next;
73 }
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +010074
75 if (size == 0)
76 return;
77
Thomas Gleixner182ec4e2005-11-07 11:16:07 +000078 /*
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +010079 * If the last fragment starts at the RAM page boundary, it is
80 * REF_PRISTINE irrespective of its size.
81 */
82 frag = frag_last(list);
Artem B. Bityutskiyf0507532005-08-22 10:07:12 +010083 if (frag->node && (frag->ofs & (PAGE_CACHE_SIZE - 1)) == 0) {
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +010084 dbg_fragtree2("marking the last fragment 0x%08x-0x%08x REF_PRISTINE.\n",
Thomas Gleixner182ec4e2005-11-07 11:16:07 +000085 frag->ofs, frag->ofs + frag->size);
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +010086 frag->node->raw->flash_offset = ref_offset(frag->node->raw) | REF_PRISTINE;
87 }
Artem B. Bityutskiy1e900972005-07-31 09:20:48 +010088}
89
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +010090void jffs2_obsolete_node_frag(struct jffs2_sb_info *c, struct jffs2_node_frag *this)
Linus Torvalds1da177e2005-04-16 15:20:36 -070091{
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +010092 if (this->node) {
93 this->node->frags--;
94 if (!this->node->frags) {
95 /* The node has no valid frags left. It's totally obsoleted */
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +010096 dbg_fragtree2("marking old node @0x%08x (0x%04x-0x%04x) obsolete\n",
Artem B. Bityutskiye0d60132005-07-28 15:46:43 +010097 ref_offset(this->node->raw), this->node->ofs, this->node->ofs+this->node->size);
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +010098 jffs2_mark_node_obsolete(c, this->node->raw);
99 jffs2_free_full_dnode(this->node);
Artem B. Bityutskiydae62272005-07-15 11:13:57 +0100100 } else {
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100101 dbg_fragtree2("marking old node @0x%08x (0x%04x-0x%04x) REF_NORMAL. frags is %d\n",
Artem B. Bityutskiye0d60132005-07-28 15:46:43 +0100102 ref_offset(this->node->raw), this->node->ofs, this->node->ofs+this->node->size, this->node->frags);
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100103 mark_ref_normal(this->node->raw);
Artem B. Bityutskiydae62272005-07-15 11:13:57 +0100104 }
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000105
Artem B. Bityutskiydae62272005-07-15 11:13:57 +0100106 }
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100107 jffs2_free_node_frag(this);
Artem B. Bityutskiydae62272005-07-15 11:13:57 +0100108}
109
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100110static void jffs2_fragtree_insert(struct jffs2_node_frag *newfrag, struct jffs2_node_frag *base)
Artem B. Bityutskiydae62272005-07-15 11:13:57 +0100111{
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100112 struct rb_node *parent = &base->rb;
113 struct rb_node **link = &parent;
114
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100115 dbg_fragtree2("insert frag (0x%04x-0x%04x)\n", newfrag->ofs, newfrag->ofs + newfrag->size);
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100116
117 while (*link) {
118 parent = *link;
119 base = rb_entry(parent, struct jffs2_node_frag, rb);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000120
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100121 if (newfrag->ofs > base->ofs)
122 link = &base->rb.rb_right;
123 else if (newfrag->ofs < base->ofs)
124 link = &base->rb.rb_left;
125 else {
Artem B. Bityutskiye0d60132005-07-28 15:46:43 +0100126 JFFS2_ERROR("duplicate frag at %08x (%p,%p)\n", newfrag->ofs, newfrag, base);
Artem B. Bityutskiydae62272005-07-15 11:13:57 +0100127 BUG();
Artem B. Bityutskiydae62272005-07-15 11:13:57 +0100128 }
129 }
130
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100131 rb_link_node(&newfrag->rb, &base->rb, link);
Artem B. Bityutskiydae62272005-07-15 11:13:57 +0100132}
133
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100134/*
135 * Allocate and initializes a new fragment.
136 */
Arjan van de Ven858119e2006-01-14 13:20:43 -0800137static struct jffs2_node_frag * new_fragment(struct jffs2_full_dnode *fn, uint32_t ofs, uint32_t size)
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100138{
139 struct jffs2_node_frag *newfrag;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000140
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100141 newfrag = jffs2_alloc_node_frag();
142 if (likely(newfrag)) {
143 newfrag->ofs = ofs;
144 newfrag->size = size;
145 newfrag->node = fn;
146 } else {
147 JFFS2_ERROR("cannot allocate a jffs2_node_frag object\n");
148 }
149
150 return newfrag;
151}
152
153/*
154 * Called when there is no overlapping fragment exist. Inserts a hole before the new
155 * fragment and inserts the new fragment to the fragtree.
156 */
157static int no_overlapping_node(struct jffs2_sb_info *c, struct rb_root *root,
158 struct jffs2_node_frag *newfrag,
159 struct jffs2_node_frag *this, uint32_t lastend)
160{
161 if (lastend < newfrag->node->ofs) {
162 /* put a hole in before the new fragment */
163 struct jffs2_node_frag *holefrag;
164
165 holefrag= new_fragment(NULL, lastend, newfrag->node->ofs - lastend);
166 if (unlikely(!holefrag)) {
167 jffs2_free_node_frag(newfrag);
168 return -ENOMEM;
169 }
170
171 if (this) {
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000172 /* By definition, the 'this' node has no right-hand child,
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100173 because there are no frags with offset greater than it.
174 So that's where we want to put the hole */
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100175 dbg_fragtree2("add hole frag %#04x-%#04x on the right of the new frag.\n",
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100176 holefrag->ofs, holefrag->ofs + holefrag->size);
177 rb_link_node(&holefrag->rb, &this->rb, &this->rb.rb_right);
178 } else {
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100179 dbg_fragtree2("Add hole frag %#04x-%#04x to the root of the tree.\n",
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100180 holefrag->ofs, holefrag->ofs + holefrag->size);
181 rb_link_node(&holefrag->rb, NULL, &root->rb_node);
182 }
183 rb_insert_color(&holefrag->rb, root);
184 this = holefrag;
185 }
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000186
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100187 if (this) {
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000188 /* By definition, the 'this' node has no right-hand child,
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100189 because there are no frags with offset greater than it.
190 So that's where we want to put new fragment */
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100191 dbg_fragtree2("add the new node at the right\n");
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000192 rb_link_node(&newfrag->rb, &this->rb, &this->rb.rb_right);
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100193 } else {
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100194 dbg_fragtree2("insert the new node at the root of the tree\n");
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100195 rb_link_node(&newfrag->rb, NULL, &root->rb_node);
196 }
197 rb_insert_color(&newfrag->rb, root);
198
199 return 0;
200}
201
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100202/* Doesn't set inode->i_size */
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100203static int jffs2_add_frag_to_fragtree(struct jffs2_sb_info *c, struct rb_root *root, struct jffs2_node_frag *newfrag)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700204{
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100205 struct jffs2_node_frag *this;
206 uint32_t lastend;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700207
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100208 /* Skip all the nodes which are completed before this one starts */
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100209 this = jffs2_lookup_node_frag(root, newfrag->node->ofs);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700210
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100211 if (this) {
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100212 dbg_fragtree2("lookup gave frag 0x%04x-0x%04x; phys 0x%08x (*%p)\n",
Artem B. Bityutskiye0d60132005-07-28 15:46:43 +0100213 this->ofs, this->ofs+this->size, this->node?(ref_offset(this->node->raw)):0xffffffff, this);
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100214 lastend = this->ofs + this->size;
215 } else {
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100216 dbg_fragtree2("lookup gave no frag\n");
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100217 lastend = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700218 }
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000219
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100220 /* See if we ran off the end of the fragtree */
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100221 if (lastend <= newfrag->ofs) {
222 /* We did */
223
224 /* Check if 'this' node was on the same page as the new node.
225 If so, both 'this' and the new node get marked REF_NORMAL so
226 the GC can take a look.
227 */
228 if (lastend && (lastend-1) >> PAGE_CACHE_SHIFT == newfrag->ofs >> PAGE_CACHE_SHIFT) {
229 if (this->node)
230 mark_ref_normal(this->node->raw);
231 mark_ref_normal(newfrag->node->raw);
232 }
233
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100234 return no_overlapping_node(c, root, newfrag, this, lastend);
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100235 }
236
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100237 if (this->node)
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100238 dbg_fragtree2("dealing with frag %u-%u, phys %#08x(%d).\n",
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100239 this->ofs, this->ofs + this->size,
240 ref_offset(this->node->raw), ref_flags(this->node->raw));
241 else
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100242 dbg_fragtree2("dealing with hole frag %u-%u.\n",
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100243 this->ofs, this->ofs + this->size);
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100244
245 /* OK. 'this' is pointing at the first frag that newfrag->ofs at least partially obsoletes,
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000246 * - i.e. newfrag->ofs < this->ofs+this->size && newfrag->ofs >= this->ofs
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100247 */
248 if (newfrag->ofs > this->ofs) {
249 /* This node isn't completely obsoleted. The start of it remains valid */
250
251 /* Mark the new node and the partially covered node REF_NORMAL -- let
252 the GC take a look at them */
253 mark_ref_normal(newfrag->node->raw);
254 if (this->node)
255 mark_ref_normal(this->node->raw);
256
257 if (this->ofs + this->size > newfrag->ofs + newfrag->size) {
258 /* The new node splits 'this' frag into two */
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100259 struct jffs2_node_frag *newfrag2;
260
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100261 if (this->node)
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100262 dbg_fragtree2("split old frag 0x%04x-0x%04x, phys 0x%08x\n",
Artem B. Bityutskiye0d60132005-07-28 15:46:43 +0100263 this->ofs, this->ofs+this->size, ref_offset(this->node->raw));
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000264 else
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100265 dbg_fragtree2("split old hole frag 0x%04x-0x%04x\n",
Artem B. Bityutskiy8d5df402005-08-17 15:13:48 +0100266 this->ofs, this->ofs+this->size);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000267
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100268 /* New second frag pointing to this's node */
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100269 newfrag2 = new_fragment(this->node, newfrag->ofs + newfrag->size,
270 this->ofs + this->size - newfrag->ofs - newfrag->size);
271 if (unlikely(!newfrag2))
272 return -ENOMEM;
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100273 if (this->node)
274 this->node->frags++;
275
276 /* Adjust size of original 'this' */
277 this->size = newfrag->ofs - this->ofs;
278
279 /* Now, we know there's no node with offset
280 greater than this->ofs but smaller than
281 newfrag2->ofs or newfrag->ofs, for obvious
282 reasons. So we can do a tree insert from
283 'this' to insert newfrag, and a tree insert
284 from newfrag to insert newfrag2. */
285 jffs2_fragtree_insert(newfrag, this);
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100286 rb_insert_color(&newfrag->rb, root);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000287
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100288 jffs2_fragtree_insert(newfrag2, newfrag);
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100289 rb_insert_color(&newfrag2->rb, root);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000290
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100291 return 0;
292 }
293 /* New node just reduces 'this' frag in size, doesn't split it */
294 this->size = newfrag->ofs - this->ofs;
295
296 /* Again, we know it lives down here in the tree */
297 jffs2_fragtree_insert(newfrag, this);
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100298 rb_insert_color(&newfrag->rb, root);
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100299 } else {
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000300 /* New frag starts at the same point as 'this' used to. Replace
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100301 it in the tree without doing a delete and insertion */
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100302 dbg_fragtree2("inserting newfrag (*%p),%d-%d in before 'this' (*%p),%d-%d\n",
Artem B. Bityutskiye0d60132005-07-28 15:46:43 +0100303 newfrag, newfrag->ofs, newfrag->ofs+newfrag->size, this, this->ofs, this->ofs+this->size);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000304
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100305 rb_replace_node(&this->rb, &newfrag->rb, root);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000306
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100307 if (newfrag->ofs + newfrag->size >= this->ofs+this->size) {
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100308 dbg_fragtree2("obsoleting node frag %p (%x-%x)\n", this, this->ofs, this->ofs+this->size);
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100309 jffs2_obsolete_node_frag(c, this);
310 } else {
311 this->ofs += newfrag->size;
312 this->size -= newfrag->size;
313
314 jffs2_fragtree_insert(this, newfrag);
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100315 rb_insert_color(&this->rb, root);
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100316 return 0;
317 }
318 }
319 /* OK, now we have newfrag added in the correct place in the tree, but
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000320 frag_next(newfrag) may be a fragment which is overlapped by it
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100321 */
322 while ((this = frag_next(newfrag)) && newfrag->ofs + newfrag->size >= this->ofs + this->size) {
323 /* 'this' frag is obsoleted completely. */
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100324 dbg_fragtree2("obsoleting node frag %p (%x-%x) and removing from tree\n",
Artem B. Bityutskiye0d60132005-07-28 15:46:43 +0100325 this, this->ofs, this->ofs+this->size);
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100326 rb_erase(&this->rb, root);
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100327 jffs2_obsolete_node_frag(c, this);
328 }
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000329 /* Now we're pointing at the first frag which isn't totally obsoleted by
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100330 the new frag */
331
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100332 if (!this || newfrag->ofs + newfrag->size == this->ofs)
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100333 return 0;
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100334
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100335 /* Still some overlap but we don't need to move it in the tree */
336 this->size = (this->ofs + this->size) - (newfrag->ofs + newfrag->size);
337 this->ofs = newfrag->ofs + newfrag->size;
338
339 /* And mark them REF_NORMAL so the GC takes a look at them */
340 if (this->node)
341 mark_ref_normal(this->node->raw);
342 mark_ref_normal(newfrag->node->raw);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700343
344 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700345}
346
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000347/*
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100348 * Given an inode, probably with existing tree of fragments, add the new node
349 * to the fragment tree.
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100350 */
351int jffs2_add_full_dnode_to_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, struct jffs2_full_dnode *fn)
352{
353 int ret;
354 struct jffs2_node_frag *newfrag;
355
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100356 if (unlikely(!fn->size))
357 return 0;
358
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100359 newfrag = new_fragment(fn, fn->ofs, fn->size);
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100360 if (unlikely(!newfrag))
361 return -ENOMEM;
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100362 newfrag->node->frags = 1;
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100363
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100364 dbg_fragtree("adding node %#04x-%#04x @0x%08x on flash, newfrag *%p\n",
Artem B. Bityutskiye0d60132005-07-28 15:46:43 +0100365 fn->ofs, fn->ofs+fn->size, ref_offset(fn->raw), newfrag);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000366
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100367 ret = jffs2_add_frag_to_fragtree(c, &f->fragtree, newfrag);
368 if (unlikely(ret))
369 return ret;
370
371 /* If we now share a page with other nodes, mark either previous
372 or next node REF_NORMAL, as appropriate. */
373 if (newfrag->ofs & (PAGE_CACHE_SIZE-1)) {
374 struct jffs2_node_frag *prev = frag_prev(newfrag);
375
376 mark_ref_normal(fn->raw);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000377 /* If we don't start at zero there's _always_ a previous */
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100378 if (prev->node)
379 mark_ref_normal(prev->node->raw);
380 }
381
382 if ((newfrag->ofs+newfrag->size) & (PAGE_CACHE_SIZE-1)) {
383 struct jffs2_node_frag *next = frag_next(newfrag);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000384
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100385 if (next) {
386 mark_ref_normal(fn->raw);
387 if (next->node)
388 mark_ref_normal(next->node->raw);
389 }
390 }
391 jffs2_dbg_fragtree_paranoia_check_nolock(f);
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100392
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100393 return 0;
394}
395
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100396/*
397 * Check the data CRC of the node.
398 *
399 * Returns: 0 if the data CRC is correct;
400 * 1 - if incorrect;
401 * error code if an error occured.
402 */
403static int check_node_data(struct jffs2_sb_info *c, struct jffs2_tmp_dnode_info *tn)
404{
405 struct jffs2_raw_node_ref *ref = tn->fn->raw;
406 int err = 0, pointed = 0;
407 struct jffs2_eraseblock *jeb;
408 unsigned char *buffer;
Atsushi Nemoto0ef675d2006-03-09 17:33:38 -0800409 uint32_t crc, ofs, len;
410 size_t retlen;
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100411
412 BUG_ON(tn->csize == 0);
413
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100414 if (!jffs2_is_writebuffered(c))
415 goto adj_acc;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000416
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100417 /* Calculate how many bytes were already checked */
418 ofs = ref_offset(ref) + sizeof(struct jffs2_raw_inode);
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100419 len = ofs % c->wbuf_pagesize;
Artem B. Bityutskiy280562b2005-08-17 15:57:43 +0100420 if (likely(len))
421 len = c->wbuf_pagesize - len;
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100422
423 if (len >= tn->csize) {
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100424 dbg_readinode("no need to check node at %#08x, data length %u, data starts at %#08x - it has already been checked.\n",
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100425 ref_offset(ref), tn->csize, ofs);
426 goto adj_acc;
427 }
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000428
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100429 ofs += len;
430 len = tn->csize - len;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000431
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100432 dbg_readinode("check node at %#08x, data length %u, partial CRC %#08x, correct CRC %#08x, data starts at %#08x, start checking from %#08x - %u bytes.\n",
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100433 ref_offset(ref), tn->csize, tn->partial_crc, tn->data_crc, ofs - len, ofs, len);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000434
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100435#ifndef __ECOS
436 /* TODO: instead, incapsulate point() stuff to jffs2_flash_read(),
437 * adding and jffs2_flash_read_end() interface. */
438 if (c->mtd->point) {
439 err = c->mtd->point(c->mtd, ofs, len, &retlen, &buffer);
440 if (!err && retlen < tn->csize) {
Andrew Morton184f5652006-05-15 13:45:58 +0100441 JFFS2_WARNING("MTD point returned len too short: %zu instead of %u.\n", retlen, tn->csize);
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100442 c->mtd->unpoint(c->mtd, buffer, ofs, len);
443 } else if (err)
444 JFFS2_WARNING("MTD point failed: error code %d.\n", err);
445 else
446 pointed = 1; /* succefully pointed to device */
447 }
448#endif
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000449
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100450 if (!pointed) {
451 buffer = kmalloc(len, GFP_KERNEL);
452 if (unlikely(!buffer))
453 return -ENOMEM;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000454
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100455 /* TODO: this is very frequent pattern, make it a separate
456 * routine */
457 err = jffs2_flash_read(c, ofs, len, &retlen, buffer);
458 if (err) {
459 JFFS2_ERROR("can not read %d bytes from 0x%08x, error code: %d.\n", len, ofs, err);
460 goto free_out;
461 }
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000462
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100463 if (retlen != len) {
Andrew Morton184f5652006-05-15 13:45:58 +0100464 JFFS2_ERROR("short read at %#08x: %zd instead of %d.\n", ofs, retlen, len);
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100465 err = -EIO;
466 goto free_out;
467 }
468 }
469
470 /* Continue calculating CRC */
471 crc = crc32(tn->partial_crc, buffer, len);
472 if(!pointed)
473 kfree(buffer);
474#ifndef __ECOS
475 else
476 c->mtd->unpoint(c->mtd, buffer, ofs, len);
477#endif
478
479 if (crc != tn->data_crc) {
Artem B. Bityutskiy39243502005-08-03 10:26:50 +0100480 JFFS2_NOTICE("wrong data CRC in data node at 0x%08x: read %#08x, calculated %#08x.\n",
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100481 ofs, tn->data_crc, crc);
482 return 1;
483 }
484
485adj_acc:
486 jeb = &c->blocks[ref->flash_offset / c->sector_size];
487 len = ref_totlen(c, jeb, ref);
488
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000489 /*
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100490 * Mark the node as having been checked and fix the
491 * accounting accordingly.
492 */
493 spin_lock(&c->erase_completion_lock);
494 jeb->used_size += len;
495 jeb->unchecked_size -= len;
496 c->used_size += len;
497 c->unchecked_size -= len;
498 spin_unlock(&c->erase_completion_lock);
499
500 return 0;
501
502free_out:
503 if(!pointed)
504 kfree(buffer);
505#ifndef __ECOS
506 else
507 c->mtd->unpoint(c->mtd, buffer, ofs, len);
508#endif
509 return err;
510}
511
512/*
513 * Helper function for jffs2_add_older_frag_to_fragtree().
514 *
515 * Checks the node if we are in the checking stage.
516 */
Arjan van de Ven858119e2006-01-14 13:20:43 -0800517static int check_node(struct jffs2_sb_info *c, struct jffs2_inode_info *f, struct jffs2_tmp_dnode_info *tn)
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100518{
519 int ret;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000520
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100521 BUG_ON(ref_obsolete(tn->fn->raw));
522
523 /* We only check the data CRC of unchecked nodes */
524 if (ref_flags(tn->fn->raw) != REF_UNCHECKED)
525 return 0;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000526
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100527 dbg_fragtree2("check node %#04x-%#04x, phys offs %#08x.\n",
Artem B. Bityutskiy39243502005-08-03 10:26:50 +0100528 tn->fn->ofs, tn->fn->ofs + tn->fn->size, ref_offset(tn->fn->raw));
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100529
530 ret = check_node_data(c, tn);
531 if (unlikely(ret < 0)) {
532 JFFS2_ERROR("check_node_data() returned error: %d.\n",
533 ret);
534 } else if (unlikely(ret > 0)) {
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100535 dbg_fragtree2("CRC error, mark it obsolete.\n");
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100536 jffs2_mark_node_obsolete(c, tn->fn->raw);
537 }
538
539 return ret;
540}
541
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000542/*
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100543 * Helper function for jffs2_add_older_frag_to_fragtree().
544 *
545 * Called when the new fragment that is being inserted
546 * splits a hole fragment.
547 */
548static int split_hole(struct jffs2_sb_info *c, struct rb_root *root,
549 struct jffs2_node_frag *newfrag, struct jffs2_node_frag *hole)
550{
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100551 dbg_fragtree2("fragment %#04x-%#04x splits the hole %#04x-%#04x\n",
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100552 newfrag->ofs, newfrag->ofs + newfrag->size, hole->ofs, hole->ofs + hole->size);
553
554 if (hole->ofs == newfrag->ofs) {
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000555 /*
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100556 * Well, the new fragment actually starts at the same offset as
557 * the hole.
558 */
559 if (hole->ofs + hole->size > newfrag->ofs + newfrag->size) {
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000560 /*
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100561 * We replace the overlapped left part of the hole by
562 * the new node.
563 */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000564
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100565 dbg_fragtree2("insert fragment %#04x-%#04x and cut the left part of the hole\n",
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100566 newfrag->ofs, newfrag->ofs + newfrag->size);
567 rb_replace_node(&hole->rb, &newfrag->rb, root);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000568
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100569 hole->ofs += newfrag->size;
570 hole->size -= newfrag->size;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000571
572 /*
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100573 * We know that 'hole' should be the right hand
574 * fragment.
575 */
576 jffs2_fragtree_insert(hole, newfrag);
577 rb_insert_color(&hole->rb, root);
578 } else {
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000579 /*
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100580 * Ah, the new fragment is of the same size as the hole.
581 * Relace the hole by it.
582 */
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100583 dbg_fragtree2("insert fragment %#04x-%#04x and overwrite hole\n",
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100584 newfrag->ofs, newfrag->ofs + newfrag->size);
585 rb_replace_node(&hole->rb, &newfrag->rb, root);
586 jffs2_free_node_frag(hole);
587 }
588 } else {
589 /* The new fragment lefts some hole space at the left */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000590
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100591 struct jffs2_node_frag * newfrag2 = NULL;
592
593 if (hole->ofs + hole->size > newfrag->ofs + newfrag->size) {
594 /* The new frag also lefts some space at the right */
595 newfrag2 = new_fragment(NULL, newfrag->ofs +
596 newfrag->size, hole->ofs + hole->size
597 - newfrag->ofs - newfrag->size);
598 if (unlikely(!newfrag2)) {
599 jffs2_free_node_frag(newfrag);
600 return -ENOMEM;
601 }
602 }
603
604 hole->size = newfrag->ofs - hole->ofs;
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100605 dbg_fragtree2("left the hole %#04x-%#04x at the left and inserd fragment %#04x-%#04x\n",
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100606 hole->ofs, hole->ofs + hole->size, newfrag->ofs, newfrag->ofs + newfrag->size);
607
608 jffs2_fragtree_insert(newfrag, hole);
609 rb_insert_color(&newfrag->rb, root);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000610
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100611 if (newfrag2) {
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100612 dbg_fragtree2("left the hole %#04x-%#04x at the right\n",
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100613 newfrag2->ofs, newfrag2->ofs + newfrag2->size);
614 jffs2_fragtree_insert(newfrag2, newfrag);
615 rb_insert_color(&newfrag2->rb, root);
616 }
617 }
618
619 return 0;
620}
621
622/*
623 * This function is used when we build inode. It expects the nodes are passed
624 * in the decreasing version order. The whole point of this is to improve the
625 * inodes checking on NAND: we check the nodes' data CRC only when they are not
626 * obsoleted. Previously, add_frag_to_fragtree() function was used and
627 * nodes were passed to it in the increasing version ordes and CRCs of all
628 * nodes were checked.
629 *
630 * Note: tn->fn->size shouldn't be zero.
631 *
632 * Returns 0 if the node was inserted
633 * 1 if it wasn't inserted (since it is obsolete)
634 * < 0 an if error occured
635 */
636int jffs2_add_older_frag_to_fragtree(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
637 struct jffs2_tmp_dnode_info *tn)
638{
639 struct jffs2_node_frag *this, *newfrag;
640 uint32_t lastend;
641 struct jffs2_full_dnode *fn = tn->fn;
642 struct rb_root *root = &f->fragtree;
643 uint32_t fn_size = fn->size, fn_ofs = fn->ofs;
644 int err, checked = 0;
645 int ref_flag;
646
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100647 dbg_fragtree("insert fragment %#04x-%#04x, ver %u\n", fn_ofs, fn_ofs + fn_size, tn->version);
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100648
649 /* Skip all the nodes which are completed before this one starts */
650 this = jffs2_lookup_node_frag(root, fn_ofs);
651 if (this)
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100652 dbg_fragtree2("'this' found %#04x-%#04x (%s)\n", this->ofs, this->ofs + this->size, this->node ? "data" : "hole");
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100653
654 if (this)
655 lastend = this->ofs + this->size;
656 else
657 lastend = 0;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000658
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100659 /* Detect the preliminary type of node */
660 if (fn->size >= PAGE_CACHE_SIZE)
661 ref_flag = REF_PRISTINE;
662 else
663 ref_flag = REF_NORMAL;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000664
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100665 /* See if we ran off the end of the root */
666 if (lastend <= fn_ofs) {
667 /* We did */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000668
669 /*
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100670 * We are going to insert the new node into the
671 * fragment tree, so check it.
672 */
673 err = check_node(c, f, tn);
674 if (err != 0)
675 return err;
676
677 fn->frags = 1;
678
679 newfrag = new_fragment(fn, fn_ofs, fn_size);
680 if (unlikely(!newfrag))
681 return -ENOMEM;
682
683 err = no_overlapping_node(c, root, newfrag, this, lastend);
684 if (unlikely(err != 0)) {
685 jffs2_free_node_frag(newfrag);
686 return err;
687 }
688
689 goto out_ok;
690 }
691
692 fn->frags = 0;
693
694 while (1) {
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000695 /*
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100696 * Here we have:
697 * fn_ofs < this->ofs + this->size && fn_ofs >= this->ofs.
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000698 *
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100699 * Remember, 'this' has higher version, any non-hole node
700 * which is already in the fragtree is newer then the newly
701 * inserted.
702 */
703 if (!this->node) {
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000704 /*
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100705 * 'this' is the hole fragment, so at least the
706 * beginning of the new fragment is valid.
707 */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000708
709 /*
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100710 * We are going to insert the new node into the
711 * fragment tree, so check it.
712 */
713 if (!checked) {
714 err = check_node(c, f, tn);
715 if (unlikely(err != 0))
716 return err;
717 checked = 1;
718 }
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000719
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100720 if (this->ofs + this->size >= fn_ofs + fn_size) {
721 /* We split the hole on two parts */
722
723 fn->frags += 1;
724 newfrag = new_fragment(fn, fn_ofs, fn_size);
725 if (unlikely(!newfrag))
726 return -ENOMEM;
727
728 err = split_hole(c, root, newfrag, this);
729 if (unlikely(err))
730 return err;
731 goto out_ok;
732 }
733
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000734 /*
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100735 * The beginning of the new fragment is valid since it
736 * overlaps the hole node.
737 */
738
739 ref_flag = REF_NORMAL;
740
741 fn->frags += 1;
742 newfrag = new_fragment(fn, fn_ofs,
743 this->ofs + this->size - fn_ofs);
744 if (unlikely(!newfrag))
745 return -ENOMEM;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000746
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100747 if (fn_ofs == this->ofs) {
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000748 /*
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100749 * The new node starts at the same offset as
750 * the hole and supersieds the hole.
751 */
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100752 dbg_fragtree2("add the new fragment instead of hole %#04x-%#04x, refcnt %d\n",
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100753 fn_ofs, fn_ofs + this->ofs + this->size - fn_ofs, fn->frags);
754
755 rb_replace_node(&this->rb, &newfrag->rb, root);
756 jffs2_free_node_frag(this);
757 } else {
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000758 /*
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100759 * The hole becomes shorter as its right part
760 * is supersieded by the new fragment.
761 */
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100762 dbg_fragtree2("reduce size of hole %#04x-%#04x to %#04x-%#04x\n",
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100763 this->ofs, this->ofs + this->size, this->ofs, this->ofs + this->size - newfrag->size);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000764
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100765 dbg_fragtree2("add new fragment %#04x-%#04x, refcnt %d\n", fn_ofs,
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100766 fn_ofs + this->ofs + this->size - fn_ofs, fn->frags);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000767
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100768 this->size -= newfrag->size;
769 jffs2_fragtree_insert(newfrag, this);
770 rb_insert_color(&newfrag->rb, root);
771 }
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000772
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100773 fn_ofs += newfrag->size;
774 fn_size -= newfrag->size;
775 this = rb_entry(rb_next(&newfrag->rb),
776 struct jffs2_node_frag, rb);
777
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100778 dbg_fragtree2("switch to the next 'this' fragment: %#04x-%#04x %s\n",
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100779 this->ofs, this->ofs + this->size, this->node ? "(data)" : "(hole)");
780 }
781
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000782 /*
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100783 * 'This' node is not the hole so it obsoletes the new fragment
784 * either fully or partially.
785 */
786 if (this->ofs + this->size >= fn_ofs + fn_size) {
787 /* The new node is obsolete, drop it */
788 if (fn->frags == 0) {
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100789 dbg_fragtree2("%#04x-%#04x is obsolete, mark it obsolete\n", fn_ofs, fn_ofs + fn_size);
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100790 ref_flag = REF_OBSOLETE;
791 }
792 goto out_ok;
793 } else {
794 struct jffs2_node_frag *new_this;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000795
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100796 /* 'This' node obsoletes the beginning of the new node */
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100797 dbg_fragtree2("the beginning %#04x-%#04x is obsolete\n", fn_ofs, this->ofs + this->size);
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100798
799 ref_flag = REF_NORMAL;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000800
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100801 fn_size -= this->ofs + this->size - fn_ofs;
802 fn_ofs = this->ofs + this->size;
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100803 dbg_fragtree2("now considering %#04x-%#04x\n", fn_ofs, fn_ofs + fn_size);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000804
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100805 new_this = rb_entry(rb_next(&this->rb), struct jffs2_node_frag, rb);
806 if (!new_this) {
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000807 /*
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100808 * There is no next fragment. Add the rest of
809 * the new node as the right-hand child.
810 */
811 if (!checked) {
812 err = check_node(c, f, tn);
813 if (unlikely(err != 0))
814 return err;
815 checked = 1;
816 }
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000817
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100818 fn->frags += 1;
819 newfrag = new_fragment(fn, fn_ofs, fn_size);
820 if (unlikely(!newfrag))
821 return -ENOMEM;
822
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100823 dbg_fragtree2("there are no more fragments, insert %#04x-%#04x\n",
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100824 newfrag->ofs, newfrag->ofs + newfrag->size);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000825 rb_link_node(&newfrag->rb, &this->rb, &this->rb.rb_right);
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100826 rb_insert_color(&newfrag->rb, root);
827 goto out_ok;
828 } else {
829 this = new_this;
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100830 dbg_fragtree2("switch to the next 'this' fragment: %#04x-%#04x %s\n",
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100831 this->ofs, this->ofs + this->size, this->node ? "(data)" : "(hole)");
832 }
833 }
834 }
835
836out_ok:
837 BUG_ON(fn->size < PAGE_CACHE_SIZE && ref_flag == REF_PRISTINE);
838
839 if (ref_flag == REF_OBSOLETE) {
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100840 dbg_fragtree2("the node is obsolete now\n");
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100841 /* jffs2_mark_node_obsolete() will adjust space accounting */
842 jffs2_mark_node_obsolete(c, fn->raw);
843 return 1;
844 }
845
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100846 dbg_fragtree2("the node is \"%s\" now\n", ref_flag == REF_NORMAL ? "REF_NORMAL" : "REF_PRISTINE");
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100847
848 /* Space accounting was adjusted at check_node_data() */
849 spin_lock(&c->erase_completion_lock);
850 fn->raw->flash_offset = ref_offset(fn->raw) | ref_flag;
851 spin_unlock(&c->erase_completion_lock);
852
853 return 0;
854}
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100855
Linus Torvalds1da177e2005-04-16 15:20:36 -0700856void jffs2_set_inocache_state(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic, int state)
857{
858 spin_lock(&c->inocache_lock);
859 ic->state = state;
860 wake_up(&c->inocache_wq);
861 spin_unlock(&c->inocache_lock);
862}
863
864/* During mount, this needs no locking. During normal operation, its
865 callers want to do other stuff while still holding the inocache_lock.
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000866 Rather than introducing special case get_ino_cache functions or
Linus Torvalds1da177e2005-04-16 15:20:36 -0700867 callbacks, we just let the caller do the locking itself. */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000868
Linus Torvalds1da177e2005-04-16 15:20:36 -0700869struct jffs2_inode_cache *jffs2_get_ino_cache(struct jffs2_sb_info *c, uint32_t ino)
870{
871 struct jffs2_inode_cache *ret;
872
Linus Torvalds1da177e2005-04-16 15:20:36 -0700873 ret = c->inocache_list[ino % INOCACHE_HASHSIZE];
874 while (ret && ret->ino < ino) {
875 ret = ret->next;
876 }
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000877
Linus Torvalds1da177e2005-04-16 15:20:36 -0700878 if (ret && ret->ino != ino)
879 ret = NULL;
880
Linus Torvalds1da177e2005-04-16 15:20:36 -0700881 return ret;
882}
883
884void jffs2_add_ino_cache (struct jffs2_sb_info *c, struct jffs2_inode_cache *new)
885{
886 struct jffs2_inode_cache **prev;
Thomas Gleixner7d27c812005-05-22 21:47:19 +0200887
Linus Torvalds1da177e2005-04-16 15:20:36 -0700888 spin_lock(&c->inocache_lock);
Thomas Gleixner7d27c812005-05-22 21:47:19 +0200889 if (!new->ino)
890 new->ino = ++c->highest_ino;
891
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100892 dbg_inocache("add %p (ino #%u)\n", new, new->ino);
Thomas Gleixner7d27c812005-05-22 21:47:19 +0200893
Linus Torvalds1da177e2005-04-16 15:20:36 -0700894 prev = &c->inocache_list[new->ino % INOCACHE_HASHSIZE];
895
896 while ((*prev) && (*prev)->ino < new->ino) {
897 prev = &(*prev)->next;
898 }
899 new->next = *prev;
900 *prev = new;
901
902 spin_unlock(&c->inocache_lock);
903}
904
905void jffs2_del_ino_cache(struct jffs2_sb_info *c, struct jffs2_inode_cache *old)
906{
907 struct jffs2_inode_cache **prev;
Artem B. Bityutskiye0d60132005-07-28 15:46:43 +0100908
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100909 dbg_inocache("del %p (ino #%u)\n", old, old->ino);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700910 spin_lock(&c->inocache_lock);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000911
Linus Torvalds1da177e2005-04-16 15:20:36 -0700912 prev = &c->inocache_list[old->ino % INOCACHE_HASHSIZE];
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000913
Linus Torvalds1da177e2005-04-16 15:20:36 -0700914 while ((*prev) && (*prev)->ino < old->ino) {
915 prev = &(*prev)->next;
916 }
917 if ((*prev) == old) {
918 *prev = old->next;
919 }
920
David Woodhouse67e345d2005-02-27 23:01:36 +0000921 /* Free it now unless it's in READING or CLEARING state, which
922 are the transitions upon read_inode() and clear_inode(). The
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000923 rest of the time we know nobody else is looking at it, and
David Woodhouse67e345d2005-02-27 23:01:36 +0000924 if it's held by read_inode() or clear_inode() they'll free it
925 for themselves. */
926 if (old->state != INO_STATE_READING && old->state != INO_STATE_CLEARING)
927 jffs2_free_inode_cache(old);
928
Linus Torvalds1da177e2005-04-16 15:20:36 -0700929 spin_unlock(&c->inocache_lock);
930}
931
932void jffs2_free_ino_caches(struct jffs2_sb_info *c)
933{
934 int i;
935 struct jffs2_inode_cache *this, *next;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000936
Linus Torvalds1da177e2005-04-16 15:20:36 -0700937 for (i=0; i<INOCACHE_HASHSIZE; i++) {
938 this = c->inocache_list[i];
939 while (this) {
940 next = this->next;
KaiGai Koheiaa98d7c2006-05-13 15:09:47 +0900941 jffs2_xattr_free_inode(c, this);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700942 jffs2_free_inode_cache(this);
943 this = next;
944 }
945 c->inocache_list[i] = NULL;
946 }
947}
948
949void jffs2_free_raw_node_refs(struct jffs2_sb_info *c)
950{
951 int i;
952 struct jffs2_raw_node_ref *this, *next;
953
954 for (i=0; i<c->nr_blocks; i++) {
955 this = c->blocks[i].first_node;
956 while(this) {
957 next = this->next_phys;
958 jffs2_free_raw_node_ref(this);
959 this = next;
960 }
961 c->blocks[i].first_node = c->blocks[i].last_node = NULL;
962 }
963}
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000964
Linus Torvalds1da177e2005-04-16 15:20:36 -0700965struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset)
966{
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000967 /* The common case in lookup is that there will be a node
Linus Torvalds1da177e2005-04-16 15:20:36 -0700968 which precisely matches. So we go looking for that first */
969 struct rb_node *next;
970 struct jffs2_node_frag *prev = NULL;
971 struct jffs2_node_frag *frag = NULL;
972
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100973 dbg_fragtree2("root %p, offset %d\n", fragtree, offset);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700974
975 next = fragtree->rb_node;
976
977 while(next) {
978 frag = rb_entry(next, struct jffs2_node_frag, rb);
979
Linus Torvalds1da177e2005-04-16 15:20:36 -0700980 if (frag->ofs + frag->size <= offset) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700981 /* Remember the closest smaller match on the way down */
982 if (!prev || frag->ofs > prev->ofs)
983 prev = frag;
984 next = frag->rb.rb_right;
985 } else if (frag->ofs > offset) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700986 next = frag->rb.rb_left;
987 } else {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700988 return frag;
989 }
990 }
991
992 /* Exact match not found. Go back up looking at each parent,
993 and return the closest smaller one */
994
995 if (prev)
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100996 dbg_fragtree2("no match. Returning frag %#04x-%#04x, closest previous\n",
Artem B. Bityutskiye0d60132005-07-28 15:46:43 +0100997 prev->ofs, prev->ofs+prev->size);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000998 else
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +0100999 dbg_fragtree2("returning NULL, empty fragtree\n");
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001000
Linus Torvalds1da177e2005-04-16 15:20:36 -07001001 return prev;
1002}
1003
1004/* Pass 'c' argument to indicate that nodes should be marked obsolete as
1005 they're killed. */
1006void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c)
1007{
1008 struct jffs2_node_frag *frag;
1009 struct jffs2_node_frag *parent;
1010
1011 if (!root->rb_node)
1012 return;
1013
Artem B. Bityutskiy733802d2005-09-22 12:25:00 +01001014 dbg_fragtree("killing\n");
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001015
Linus Torvalds1da177e2005-04-16 15:20:36 -07001016 frag = (rb_entry(root->rb_node, struct jffs2_node_frag, rb));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001017 while(frag) {
1018 if (frag->rb.rb_left) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001019 frag = frag_left(frag);
1020 continue;
1021 }
1022 if (frag->rb.rb_right) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001023 frag = frag_right(frag);
1024 continue;
1025 }
1026
Linus Torvalds1da177e2005-04-16 15:20:36 -07001027 if (frag->node && !(--frag->node->frags)) {
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001028 /* Not a hole, and it's the final remaining frag
Linus Torvalds1da177e2005-04-16 15:20:36 -07001029 of this node. Free the node */
1030 if (c)
1031 jffs2_mark_node_obsolete(c, frag->node->raw);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001032
Linus Torvalds1da177e2005-04-16 15:20:36 -07001033 jffs2_free_full_dnode(frag->node);
1034 }
1035 parent = frag_parent(frag);
1036 if (parent) {
1037 if (frag_left(parent) == frag)
1038 parent->rb.rb_left = NULL;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001039 else
Linus Torvalds1da177e2005-04-16 15:20:36 -07001040 parent->rb.rb_right = NULL;
1041 }
1042
1043 jffs2_free_node_frag(frag);
1044 frag = parent;
1045
1046 cond_resched();
1047 }
1048}
David Woodhousef1f96712006-05-20 19:45:26 +01001049
1050void jffs2_link_node_ref(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
1051 struct jffs2_raw_node_ref *ref, uint32_t len)
1052{
1053 if (!jeb->first_node)
1054 jeb->first_node = ref;
David Woodhouseca89a512006-05-21 13:29:11 +01001055 if (jeb->last_node) {
David Woodhousef1f96712006-05-20 19:45:26 +01001056 jeb->last_node->next_phys = ref;
David Woodhouseca89a512006-05-21 13:29:11 +01001057#ifdef TEST_TOTLEN
1058 if (ref_offset(jeb->last_node) + jeb->last_node->__totlen != ref_offset(ref)) {
1059 printk(KERN_CRIT "Adding new ref %p at (0x%08x-0x%08x) not immediately after previous (0x%08x-0x%08x)\n",
1060 ref, ref_offset(ref), ref_offset(ref)+ref->__totlen,
1061 ref_offset(jeb->last_node), ref_offset(jeb->last_node)+jeb->last_node->__totlen);
1062 WARN_ON(1);
1063 }
1064#endif
1065 }
David Woodhousef1f96712006-05-20 19:45:26 +01001066 jeb->last_node = ref;
1067
1068 switch(ref_flags(ref)) {
1069 case REF_UNCHECKED:
1070 c->unchecked_size += len;
1071 jeb->unchecked_size += len;
1072 break;
1073
1074 case REF_NORMAL:
1075 case REF_PRISTINE:
1076 c->used_size += len;
1077 jeb->used_size += len;
1078 break;
1079
1080 case REF_OBSOLETE:
1081 c->dirty_size += len;
1082 jeb->used_size += len;
1083 break;
1084 }
1085 c->free_size -= len;
1086 jeb->free_size -= len;
1087
David Woodhousef1f96712006-05-20 19:45:26 +01001088 ref->next_phys = NULL;
David Woodhouseca89a512006-05-21 13:29:11 +01001089#ifdef TEST_TOTLEN
1090 /* Set (and test) __totlen field... for now */
1091 ref->__totlen = len;
1092 ref_totlen(c, jeb, ref);
1093#endif
David Woodhousef1f96712006-05-20 19:45:26 +01001094}
David Woodhouse68270992006-05-21 03:46:05 +01001095
David Woodhouseca89a512006-05-21 13:29:11 +01001096/* No locking. Do not use on a live file system */
David Woodhouse68270992006-05-21 03:46:05 +01001097int jffs2_scan_dirty_space(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
1098 uint32_t size)
1099{
David Woodhouseca89a512006-05-21 13:29:11 +01001100 if (!size)
1101 return 0;
1102 if (size > c->sector_size - jeb->used_size) {
1103 printk(KERN_CRIT "Dirty space 0x%x larger then used_size 0x%x (wasted 0x%x)\n",
1104 size, jeb->used_size, jeb->wasted_size);
1105 BUG();
1106 }
1107 if (jeb->last_node && ref_obsolete(jeb->last_node)) {
1108#ifdef TEST_TOTLEN
1109 jeb->last_node->__totlen += size;
1110#endif
1111 c->dirty_size += size;
1112 c->free_size -= size;
1113 jeb->dirty_size += size;
1114 jeb->free_size -= size;
1115 } else {
1116 struct jffs2_raw_node_ref *ref;
1117 ref = jffs2_alloc_raw_node_ref();
1118 if (!ref)
1119 return -ENOMEM;
1120
1121 ref->flash_offset = jeb->offset + c->sector_size - jeb->free_size;
1122 ref->flash_offset |= REF_OBSOLETE;
1123 ref->next_in_ino = 0;
1124#ifdef TEST_TOTLEN
1125 ref->__totlen = size;
1126#endif
1127
1128 jffs2_link_node_ref(c, jeb, ref, size);
1129 }
David Woodhouse68270992006-05-21 03:46:05 +01001130
1131 return 0;
1132}
David Woodhouseca89a512006-05-21 13:29:11 +01001133
1134/* Calculate totlen from surrounding nodes or eraseblock */
1135static inline uint32_t __ref_totlen(struct jffs2_sb_info *c,
1136 struct jffs2_eraseblock *jeb,
1137 struct jffs2_raw_node_ref *ref)
1138{
1139 uint32_t ref_end;
1140
1141 if (ref->next_phys)
1142 ref_end = ref_offset(ref->next_phys);
1143 else {
1144 if (!jeb)
1145 jeb = &c->blocks[ref->flash_offset / c->sector_size];
1146
1147 /* Last node in block. Use free_space */
1148 if (ref != jeb->last_node) {
1149 printk(KERN_CRIT "ref %p @0x%08x is not jeb->last_node (%p @0x%08x)\n",
1150 ref, ref_offset(ref), jeb->last_node, jeb->last_node?ref_offset(jeb->last_node):0);
1151 BUG();
1152 }
1153 ref_end = jeb->offset + c->sector_size - jeb->free_size;
1154 }
1155 return ref_end - ref_offset(ref);
1156}
1157
1158uint32_t __jffs2_ref_totlen(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
1159 struct jffs2_raw_node_ref *ref)
1160{
1161 uint32_t ret;
1162
1163#if CONFIG_JFFS2_FS_DEBUG > 0
1164 if (jeb && jeb != &c->blocks[ref->flash_offset / c->sector_size]) {
1165 printk(KERN_CRIT "ref_totlen called with wrong block -- at 0x%08x instead of 0x%08x; ref 0x%08x\n",
1166 jeb->offset, c->blocks[ref->flash_offset / c->sector_size].offset, ref_offset(ref));
1167 BUG();
1168 }
1169#endif
1170
1171 ret = __ref_totlen(c, jeb, ref);
1172#ifdef TEST_TOTLEN
1173 if (ret != ref->__totlen) {
1174 printk(KERN_CRIT "Totlen for ref at %p (0x%08x-0x%08x) miscalculated as 0x%x instead of %x\n",
1175 ref, ref_offset(ref), ref_offset(ref)+ref->__totlen,
1176 ret, ref->__totlen);
1177 if (ref->next_phys) {
1178 printk(KERN_CRIT "next_phys %p (0x%08x-0x%08x)\n", ref->next_phys, ref_offset(ref->next_phys),
1179 ref_offset(ref->next_phys)+ref->__totlen);
1180 } else
1181 printk(KERN_CRIT "No next_phys. jeb->last_node is %p\n", jeb->last_node);
1182
1183 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);
1184 ret = ref->__totlen;
1185 if (!jeb)
1186 jeb = &c->blocks[ref->flash_offset / c->sector_size];
1187#if defined(JFFS2_DBG_DUMPS) || defined(JFFS2_DBG_PARANOIA_CHECKS)
1188 __jffs2_dbg_dump_node_refs_nolock(c, jeb);
1189#endif
1190 WARN_ON(1);
1191 }
1192#endif /* TEST_TOTLEN */
1193 return ret;
1194}