Lines Matching refs:ofs
61 /* We know frag->ofs <= size. That's what lookup does for us */
62 if (frag && frag->ofs != size) {
63 if (frag->ofs+frag->size > size) {
64 frag->size = size - frag->ofs;
68 while (frag && frag->ofs >= size) {
84 if (frag->ofs + frag->size < size)
85 return frag->ofs + frag->size;
89 if (frag->node && (frag->ofs & (PAGE_CACHE_SIZE - 1)) == 0) {
91 frag->ofs, frag->ofs + frag->size);
105 ref_offset(this->node->raw), this->node->ofs, this->node->ofs+this->node->size);
110 ref_offset(this->node->raw), this->node->ofs, this->node->ofs+this->node->size, this->node->frags);
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);
145 static struct jffs2_node_frag * new_fragment(struct jffs2_full_dnode *fn, uint32_t ofs, uint32_t size)
151 newfrag->ofs = ofs;
169 if (lastend < newfrag->node->ofs) {
173 holefrag= new_fragment(NULL, lastend, newfrag->node->ofs - lastend);
184 holefrag->ofs, holefrag->ofs + holefrag->size);
188 holefrag->ofs, holefrag->ofs + holefrag->size);
217 this = jffs2_lookup_node_frag(root, newfrag->node->ofs);
221 this->ofs, this->ofs+this->size, this->node?(ref_offset(this->node->raw)):0xffffffff, this);
222 lastend = this->ofs + this->size;
229 if (lastend <= newfrag->ofs) {
236 if (lastend && (lastend-1) >> PAGE_CACHE_SHIFT == newfrag->ofs >> PAGE_CACHE_SHIFT) {
247 this->ofs, this->ofs + this->size,
251 this->ofs, this->ofs + this->size);
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) {
265 if (this->ofs + this->size > newfrag->ofs + newfrag->size) {
271 this->ofs, this->ofs+this->size, ref_offset(this->node->raw));
274 this->ofs, this->ofs+this->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;
288 greater than this->ofs but smaller than
289 newfrag2->ofs or newfrag->ofs, for obvious
302 this->size = newfrag->ofs - this->ofs;
311 newfrag, newfrag->ofs, newfrag->ofs+newfrag->size, this, this->ofs, this->ofs+this->size);
315 if (newfrag->ofs + newfrag->size >= this->ofs+this->size) {
316 dbg_fragtree2("obsoleting node frag %p (%x-%x)\n", this, this->ofs, this->ofs+this->size);
319 this->ofs += newfrag->size;
330 while ((this = frag_next(newfrag)) && newfrag->ofs + newfrag->size >= this->ofs + this->size) {
333 this, this->ofs, 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;
367 newfrag = new_fragment(fn, fn->ofs, fn->size);
373 fn->ofs, fn->ofs+fn->size, ref_offset(fn->raw), newfrag);
381 if (newfrag->ofs & (PAGE_CACHE_SIZE-1)) {
390 if ((newfrag->ofs+newfrag->size) & (PAGE_CACHE_SIZE-1)) {
535 if (frag->ofs + frag->size <= offset) {
537 if (!prev || frag->ofs > prev->ofs)
540 } else if (frag->ofs > offset) {
552 prev->ofs, prev->ofs+prev->size);
607 uint32_t ofs, uint32_t len,
628 ref->flash_offset, ofs, ref->next_in_ino, len);
630 ref->flash_offset = ofs;
702 uint32_t ofs = jeb->offset + c->sector_size - jeb->free_size;
703 ofs |= REF_OBSOLETE;
705 jffs2_link_node_ref(c, jeb, ofs, size, NULL);