53 free_nodes(struct b_list *list)  in free_nodes()  argument
55 	while (list->listMemBase != NULL) {  in free_nodes()
56 		struct mem_block *next = list->listMemBase->next;  in free_nodes()
57 		free(list->listMemBase);  in free_nodes()
58 		list->listMemBase = next;  in free_nodes()
63 add_node(struct b_list *list, int size)  in add_node()  argument
69 	memBase = list->listMemBase;  in add_node()
80 		memBase->next = list->listMemBase;  in add_node()
88 	list->listMemBase = memBase;  in add_node()
89 	list->listCount++;  in add_node()
94 insert_node(struct b_list *list, struct b_node *new)  in insert_node()  argument
99 	if (list->listTail != NULL && list->listCompare(new, list->listTail))  in insert_node()
100 		prev = list->listTail;  in insert_node()
101 	else if (list->listLast != NULL && list->listCompare(new, list->listLast))  in insert_node()
102 		prev = list->listLast;  in insert_node()
106 	for (b = (prev ? prev->next : list->listHead);  in insert_node()
107 	     b != NULL && list->listCompare(new, b);  in insert_node()
109 		list->listLoops++;  in insert_node()
112 		list->listLast = prev;  in insert_node()
119 			list->listHead = new;  in insert_node()
124 		if (list->listTail != NULL) {  in insert_node()
125 			list->listTail->next = new;  in insert_node()
126 			list->listTail = new;  in insert_node()
128 			list->listTail = list->listHead = new;  in insert_node()
136 insert_inode(struct b_list *list, struct jffs2_raw_inode *node, u32 offset)  in insert_inode()  argument
140 	if (!(new = (struct b_inode *)add_node(list, sizeof(struct b_inode)))) {  in insert_inode()
150 	return insert_node(list, (struct b_node *)new);  in insert_inode()
154 insert_dirent(struct b_list *list, struct jffs2_raw_dirent *node, u32 offset)  in insert_dirent()  argument
158 	if (!(new = (struct b_dirent *)add_node(list, sizeof(struct b_dirent)))) {  in insert_dirent()
170 	return insert_node(list, (struct b_node *)new);  in insert_dirent()