fs/jffs2/nodelist.c

26 void jffs2_add_fd_to_list(struct jffs2_sb_info *c, struct jffs2_full_dirent *new, struct jffs2_full_dirent **list)
30 	dbg_dentlist("add dirent \"%s\", ino #%u\n", new->name, new->ino);
32 	while ((*prev) && (*prev)->nhash <= new->nhash) {
33 		if ((*prev)->nhash == new->nhash && !strcmp((*prev)->name, new->name)) {
35 			if (new->version < (*prev)->version) {
36 				dbg_dentlist("Eep! Marking new dirent node obsolete, old is \"%s\", ino #%u\n",
38 				jffs2_mark_node_obsolete(c, new->raw);
39 				jffs2_free_full_dirent(new);
43 				new->next = (*prev)->next;
49 				*prev = new;
55 	new->next = *prev;
56 	*prev = new;
147  * Allocate and initializes a new fragment.
166  * Called when there is no overlapping fragment exist. Inserts a hole before the new
167  * fragment and inserts the new fragment to the fragtree.
174 		/* put a hole in before the new fragment */
187 			dbg_fragtree2("add hole frag %#04x-%#04x on the right of the new frag.\n",
202 		   So that's where we want to put new fragment */
203 		dbg_fragtree2("add the new node at the right\n");
206 		dbg_fragtree2("insert the new node at the root of the tree\n");
236 		/* Check if 'this' node was on the same page as the new node.
237 		   If so, both 'this' and the new node get marked REF_NORMAL so
263 		/* Mark the new node and the partially covered node REF_NORMAL -- let
270 			/* The new node splits 'this' frag into two */
342 	   the new frag */
360  * Given an inode, probably with existing tree of fragments, add the new node
436 void jffs2_add_ino_cache (struct jffs2_sb_info *c, struct jffs2_inode_cache *new)
441 	if (!new->ino)
442 		new->ino = ++c->highest_ino;
444 	dbg_inocache("add %p (ino #%u)\n", new, new->ino);
446 	prev = &c->inocache_list[new->ino % c->inocache_hashsize];
448 	while ((*prev) && (*prev)->ino < new->ino) {
451 	new->next = *prev;
452 	*prev = new;
618 		JFFS2_ERROR("Adding new ref %p at (0x%08x-0x%08x) not immediately after previous (0x%08x-0x%08x)\n",