Lines Matching refs:newfrag
118 static void jffs2_fragtree_insert(struct jffs2_node_frag *newfrag, struct jffs2_node_frag *base)
123 dbg_fragtree2("insert frag (0x%04x-0x%04x)\n", newfrag->ofs, newfrag->ofs + newfrag->size);
129 if (newfrag->ofs > base->ofs)
131 else if (newfrag->ofs < base->ofs)
134 JFFS2_ERROR("duplicate frag at %08x (%p,%p)\n", newfrag->ofs, newfrag, base);
139 rb_link_node(&newfrag->rb, &base->rb, link);
147 struct jffs2_node_frag *newfrag;
149 newfrag = jffs2_alloc_node_frag();
150 if (likely(newfrag)) {
151 newfrag->ofs = ofs;
152 newfrag->size = size;
153 newfrag->node = fn;
158 return newfrag;
166 struct jffs2_node_frag *newfrag,
169 if (lastend < newfrag->node->ofs) {
173 holefrag= new_fragment(NULL, lastend, newfrag->node->ofs - lastend);
175 jffs2_free_node_frag(newfrag);
200 rb_link_node(&newfrag->rb, &this->rb, &this->rb.rb_right);
203 rb_link_node(&newfrag->rb, NULL, &root->rb_node);
205 rb_insert_color(&newfrag->rb, root);
211 static int jffs2_add_frag_to_fragtree(struct jffs2_sb_info *c, struct rb_root *root, struct jffs2_node_frag *newfrag)
217 this = jffs2_lookup_node_frag(root, newfrag->node->ofs);
229 if (lastend <= newfrag->ofs) {
236 if (lastend && (lastend-1) >> PAGE_CACHE_SHIFT == newfrag->ofs >> PAGE_CACHE_SHIFT) {
239 mark_ref_normal(newfrag->node->raw);
242 return no_overlapping_node(c, root, newfrag, this, lastend);
253 /* OK. 'this' is pointing at the first frag that newfrag->ofs at least partially obsoletes,
254 * - i.e. newfrag->ofs < this->ofs+this->size && newfrag->ofs >= this->ofs
256 if (newfrag->ofs > this->ofs) {
261 mark_ref_normal(newfrag->node->raw);
265 if (this->ofs + this->size > newfrag->ofs + newfrag->size) {
277 newfrag2 = new_fragment(this->node, newfrag->ofs + newfrag->size,
278 this->ofs + this->size - newfrag->ofs - newfrag->size);
285 this->size = newfrag->ofs - this->ofs;
289 newfrag2->ofs or newfrag->ofs, for obvious
291 'this' to insert newfrag, and a tree insert
292 from newfrag to insert newfrag2. */
293 jffs2_fragtree_insert(newfrag, this);
294 rb_insert_color(&newfrag->rb, root);
296 jffs2_fragtree_insert(newfrag2, newfrag);
302 this->size = newfrag->ofs - this->ofs;
305 jffs2_fragtree_insert(newfrag, this);
306 rb_insert_color(&newfrag->rb, root);
310 dbg_fragtree2("inserting newfrag (*%p),%d-%d in before 'this' (*%p),%d-%d\n",
311 newfrag, newfrag->ofs, newfrag->ofs+newfrag->size, this, this->ofs, this->ofs+this->size);
313 rb_replace_node(&this->rb, &newfrag->rb, root);
315 if (newfrag->ofs + newfrag->size >= this->ofs+this->size) {
319 this->ofs += newfrag->size;
320 this->size -= newfrag->size;
322 jffs2_fragtree_insert(this, newfrag);
327 /* OK, now we have newfrag added in the correct place in the tree, but
328 frag_next(newfrag) may be a fragment which is overlapped by it
330 while ((this = frag_next(newfrag)) && newfrag->ofs + newfrag->size >= this->ofs + this->size) {
340 if (!this || newfrag->ofs + newfrag->size == this->ofs)
344 this->size = (this->ofs + this->size) - (newfrag->ofs + newfrag->size);
345 this->ofs = newfrag->ofs + newfrag->size;
350 mark_ref_normal(newfrag->node->raw);
362 struct jffs2_node_frag *newfrag;
367 newfrag = new_fragment(fn, fn->ofs, fn->size);
368 if (unlikely(!newfrag))
370 newfrag->node->frags = 1;
372 dbg_fragtree("adding node %#04x-%#04x @0x%08x on flash, newfrag *%p\n",
373 fn->ofs, fn->ofs+fn->size, ref_offset(fn->raw), newfrag);
375 ret = jffs2_add_frag_to_fragtree(c, &f->fragtree, newfrag);
381 if (newfrag->ofs & (PAGE_CACHE_SIZE-1)) {
382 struct jffs2_node_frag *prev = frag_prev(newfrag);
390 if ((newfrag->ofs+newfrag->size) & (PAGE_CACHE_SIZE-1)) {
391 struct jffs2_node_frag *next = frag_next(newfrag);