Lines Matching refs:new
24 void jffs2_add_fd_to_list(struct jffs2_sb_info *c, struct jffs2_full_dirent *new, struct jffs2_full_dirent **list)
28 dbg_dentlist("add dirent \"%s\", ino #%u\n", new->name, new->ino);
30 while ((*prev) && (*prev)->nhash <= new->nhash) {
31 if ((*prev)->nhash == new->nhash && !strcmp((*prev)->name, new->name)) {
33 if (new->version < (*prev)->version) {
34 dbg_dentlist("Eep! Marking new dirent node obsolete, old is \"%s\", ino #%u\n",
36 jffs2_mark_node_obsolete(c, new->raw);
37 jffs2_free_full_dirent(new);
41 new->next = (*prev)->next;
47 *prev = new;
53 new->next = *prev;
54 *prev = new;
145 * Allocate and initializes a new fragment.
164 * Called when there is no overlapping fragment exist. Inserts a hole before the new
165 * fragment and inserts the new fragment to the fragtree.
172 /* put a hole in before the new fragment */
185 dbg_fragtree2("add hole frag %#04x-%#04x on the right of the new frag.\n",
200 So that's where we want to put new fragment */
201 dbg_fragtree2("add the new node at the right\n");
204 dbg_fragtree2("insert the new node at the root of the tree\n");
234 /* Check if 'this' node was on the same page as the new node.
235 If so, both 'this' and the new node get marked REF_NORMAL so
261 /* Mark the new node and the partially covered node REF_NORMAL -- let
268 /* The new node splits 'this' frag into two */
340 the new frag */
358 * Given an inode, probably with existing tree of fragments, add the new node
434 void jffs2_add_ino_cache (struct jffs2_sb_info *c, struct jffs2_inode_cache *new)
439 if (!new->ino)
440 new->ino = ++c->highest_ino;
442 dbg_inocache("add %p (ino #%u)\n", new, new->ino);
444 prev = &c->inocache_list[new->ino % INOCACHE_HASHSIZE];
446 while ((*prev) && (*prev)->ino < new->ino) {
449 new->next = *prev;
450 *prev = new;
640 JFFS2_ERROR("Adding new ref %p at (0x%08x-0x%08x) not immediately after previous (0x%08x-0x%08x)\n",