fs/jffs2/nodelist.c

122 static void jffs2_fragtree_insert(struct jffs2_node_frag *newfrag, struct jffs2_node_frag *base)
127 	dbg_fragtree2("insert frag (0x%04x-0x%04x)\n", newfrag->ofs, newfrag->ofs + newfrag->size);
133 		if (newfrag->ofs > base->ofs)
135 		else if (newfrag->ofs < base->ofs)
138 			JFFS2_ERROR("duplicate frag at %08x (%p,%p)\n", newfrag->ofs, newfrag, base);
143 	rb_link_node(&newfrag->rb, &base->rb, link);
151 	struct jffs2_node_frag *newfrag;
153 	newfrag = jffs2_alloc_node_frag();
154 	if (likely(newfrag)) {
155 		newfrag->ofs = ofs;
156 		newfrag->size = size;
157 		newfrag->node = fn;
162 	return newfrag;
170 		 	       struct jffs2_node_frag *newfrag,
173 	if (lastend < newfrag->node->ofs) {
177 		holefrag= new_fragment(NULL, lastend, newfrag->node->ofs - lastend);
179 			jffs2_free_node_frag(newfrag);
204 		rb_link_node(&newfrag->rb, &this->rb, &this->rb.rb_right);
207 		rb_link_node(&newfrag->rb, NULL, &root->rb_node);
209 	rb_insert_color(&newfrag->rb, root);
215 static int jffs2_add_frag_to_fragtree(struct jffs2_sb_info *c, struct rb_root *root, struct jffs2_node_frag *newfrag)
221 	this = jffs2_lookup_node_frag(root, newfrag->node->ofs);
233 	if (lastend <= newfrag->ofs) {
240 		if (lastend && (lastend-1) >> PAGE_SHIFT == newfrag->ofs >> PAGE_SHIFT) {
243 			mark_ref_normal(newfrag->node->raw);
246 		return no_overlapping_node(c, root, newfrag, this, lastend);
257 	/* OK. 'this' is pointing at the first frag that newfrag->ofs at least partially obsoletes,
258 	 * - i.e. newfrag->ofs < this->ofs+this->size && newfrag->ofs >= this->ofs
260 	if (newfrag->ofs > this->ofs) {
265 		mark_ref_normal(newfrag->node->raw);
269 		if (this->ofs + this->size > newfrag->ofs + newfrag->size) {
281 			newfrag2 = new_fragment(this->node, newfrag->ofs + newfrag->size,
282 						this->ofs + this->size - newfrag->ofs - newfrag->size);
289 			this->size = newfrag->ofs - this->ofs;
293 			   newfrag2->ofs or newfrag->ofs, for obvious
295 			   'this' to insert newfrag, and a tree insert
296 			   from newfrag to insert newfrag2. */
297 			jffs2_fragtree_insert(newfrag, this);
298 			rb_insert_color(&newfrag->rb, root);
300 			jffs2_fragtree_insert(newfrag2, newfrag);
306 		this->size = newfrag->ofs - this->ofs;
309 		jffs2_fragtree_insert(newfrag, this);
310 		rb_insert_color(&newfrag->rb, root);
314 		dbg_fragtree2("inserting newfrag (*%p),%d-%d in before 'this' (*%p),%d-%d\n",
315 			  newfrag, newfrag->ofs, newfrag->ofs+newfrag->size, this, this->ofs, this->ofs+this->size);
317 		rb_replace_node(&this->rb, &newfrag->rb, root);
319 		if (newfrag->ofs + newfrag->size >= this->ofs+this->size) {
323 			this->ofs += newfrag->size;
324 			this->size -= newfrag->size;
326 			jffs2_fragtree_insert(this, newfrag);
331 	/* OK, now we have newfrag added in the correct place in the tree, but
332 	   frag_next(newfrag) may be a fragment which is overlapped by it
334 	while ((this = frag_next(newfrag)) && newfrag->ofs + newfrag->size >= this->ofs + this->size) {
344 	if (!this || newfrag->ofs + newfrag->size == this->ofs)
348 	this->size = (this->ofs + this->size) - (newfrag->ofs + newfrag->size);
349 	this->ofs = newfrag->ofs + newfrag->size;
354 	mark_ref_normal(newfrag->node->raw);
366 	struct jffs2_node_frag *newfrag;
371 	newfrag = new_fragment(fn, fn->ofs, fn->size);
372 	if (unlikely(!newfrag))
374 	newfrag->node->frags = 1;
376 	dbg_fragtree("adding node %#04x-%#04x @0x%08x on flash, newfrag *%p\n",
377 		  fn->ofs, fn->ofs+fn->size, ref_offset(fn->raw), newfrag);
379 	ret = jffs2_add_frag_to_fragtree(c, &f->fragtree, newfrag);
385 	if (newfrag->ofs & (PAGE_SIZE-1)) {
386 		struct jffs2_node_frag *prev = frag_prev(newfrag);
394 	if ((newfrag->ofs+newfrag->size) & (PAGE_SIZE-1)) {
395 		struct jffs2_node_frag *next = frag_next(newfrag);