fs/jffs2/nodelist.c

108

dbg_fragtree2("marking old node @0x%08x (0x%04x-0x%04x) obsolete\n",

fs/jffs2/nodelist.c

113

dbg_fragtree2("marking old node @0x%08x (0x%04x-0x%04x) REF_NORMAL. frags is %d\n",

fs/jffs2/nodelist.c

127

dbg_fragtree2("insert frag (0x%04x-0x%04x)\n", newfrag->ofs, newfrag->ofs + newfrag->size);

fs/jffs2/nodelist.c

187

dbg_fragtree2("add hole frag %#04x-%#04x on the right of the new frag.\n",

fs/jffs2/nodelist.c

191

dbg_fragtree2("Add hole frag %#04x-%#04x to the root of the tree.\n",

fs/jffs2/nodelist.c

203

dbg_fragtree2("add the new node at the right\n");

fs/jffs2/nodelist.c

206

dbg_fragtree2("insert the new node at the root of the tree\n");

fs/jffs2/nodelist.c

224

dbg_fragtree2("lookup gave frag 0x%04x-0x%04x; phys 0x%08x (*%p)\n",

fs/jffs2/nodelist.c

228

dbg_fragtree2("lookup gave no frag\n");

fs/jffs2/nodelist.c

250

dbg_fragtree2("dealing with frag %u-%u, phys %#08x(%d).\n",

fs/jffs2/nodelist.c

254

dbg_fragtree2("dealing with hole frag %u-%u.\n",

fs/jffs2/nodelist.c

274

dbg_fragtree2("split old frag 0x%04x-0x%04x, phys 0x%08x\n",

fs/jffs2/nodelist.c

277

dbg_fragtree2("split old hole frag 0x%04x-0x%04x\n",

fs/jffs2/nodelist.c

314

dbg_fragtree2("inserting newfrag (*%p),%d-%d in before 'this' (*%p),%d-%d\n",

fs/jffs2/nodelist.c

320

dbg_fragtree2("obsoleting node frag %p (%x-%x)\n", this, this->ofs, this->ofs+this->size);

fs/jffs2/nodelist.c

336

dbg_fragtree2("obsoleting node frag %p (%x-%x) and removing from tree\n",

fs/jffs2/nodelist.c

532

dbg_fragtree2("root %p, offset %d\n", fragtree, offset);

fs/jffs2/nodelist.c

555

dbg_fragtree2("no match. Returning frag %#04x-%#04x, closest previous\n",

fs/jffs2/nodelist.c

558

dbg_fragtree2("returning NULL, empty fragtree\n");

fs/jffs2/nodelist.c

94

dbg_fragtree2("marking the last fragment 0x%08x-0x%08x REF_PRISTINE.\n",