99 addino(ino_t inum, struct entry *np)  in addino()  argument
106 	np->e_ino = inum;  in addino()
107 	np->e_next = *epp;  in addino()
108 	*epp = np;  in addino()
110 		for (np = np->e_next; np != NULL; np = np->e_next)  in addino()
111 			if (np->e_ino == inum)  in addino()
112 				badentry(np, "duplicate inum");  in addino()
145 	char *np, *cp;  in lookupname()  local
150 		for (np = buf; *cp != '/' && *cp != '\0' &&  in lookupname()
151 				np < &buf[sizeof(buf)]; )  in lookupname()
152 			*np++ = *cp++;  in lookupname()
153 		if (np == &buf[sizeof(buf)])  in lookupname()
155 		*np = '\0';  in lookupname()
222 	struct entry *np, *ep;  in addentry()  local
225 		np = freelist;  in addentry()
226 		freelist = np->e_next;  in addentry()
227 		memset(np, 0, (long)sizeof(struct entry));  in addentry()
229 		np = (struct entry *)calloc(1, sizeof(struct entry));  in addentry()
230 		if (np == NULL)  in addentry()
233 	np->e_type = type & ~LINK;  in addentry()
238 		np->e_name = savename(name);  in addentry()
239 		np->e_namlen = strlen(name);  in addentry()
240 		np->e_parent = np;  in addentry()
241 		addino(ROOTINO, np);  in addentry()
242 		return (np);  in addentry()
244 	np->e_name = savename(strrchr(name, '/') + 1);  in addentry()
245 	np->e_namlen = strlen(np->e_name);  in addentry()
246 	np->e_parent = ep;  in addentry()
247 	np->e_sibling = ep->e_entries;  in addentry()
248 	ep->e_entries = np;  in addentry()
253 		np->e_ino = inum;  in addentry()
254 		np->e_links = ep->e_links;  in addentry()
255 		ep->e_links = np;  in addentry()
259 		addino(inum, np);  in addentry()
261 	return (np);  in addentry()
270 	struct entry *np;  in freeentry()  local
282 		np = lookupino(ep->e_ino);  in freeentry()
283 		if (np == NULL)  in freeentry()
285 		if (np == ep) {  in freeentry()
291 			for (; np != NULL; np = np->e_links) {  in freeentry()
292 				if (np->e_links == ep) {  in freeentry()
293 					np->e_links = ep->e_links;  in freeentry()
297 			if (np == NULL)  in freeentry()
313 	struct entry *np;  in moveentry()  local
316 	np = lookupparent(newname);  in moveentry()
317 	if (np == NULL)  in moveentry()
319 	if (np != ep->e_parent) {  in moveentry()
321 		ep->e_parent = np;  in moveentry()
322 		ep->e_sibling = np->e_entries;  in moveentry()
323 		np->e_entries = ep;  in moveentry()
341 	struct entry *np;  in removeentry()  local
343 	np = ep->e_parent;  in removeentry()
344 	if (np->e_entries == ep) {  in removeentry()
345 		np->e_entries = ep->e_sibling;  in removeentry()
347 		for (np = np->e_entries; np != NULL; np = np->e_sibling) {  in removeentry()
348 			if (np->e_sibling == ep) {  in removeentry()
349 				np->e_sibling = ep->e_sibling;  in removeentry()
353 		if (np == NULL)  in removeentry()
386 	struct strhdr *np;  in savename()  local
393 	np = strtblhdr[len / STRTBLINCR].next;  in savename()
394 	if (np != NULL) {  in savename()
395 		strtblhdr[len / STRTBLINCR].next = np->next;  in savename()
396 		cp = (char *)np;  in savename()
413 	struct strhdr *tp, *np;  in freename()  local
416 	np = (struct strhdr *)name;  in freename()
417 	np->next = tp->next;  in freename()
418 	tp->next = np;  in freename()