Lines Matching refs:np

74 addino(ino_t inum, struct entry *np)  in addino()  argument
87 np->e_ino = inum; in addino()
88 np->e_next = *epp; in addino()
89 *epp = np; in addino()
91 for (np = np->e_next; np != NIL; np = np->e_next) in addino()
92 if (np->e_ino == inum) in addino()
93 badentry(np, gettext("duplicate inum")); in addino()
137 char *np, *cp; in lookupname() local
148 np = buf; in lookupname()
150 *np++ = *cp++; in lookupname()
151 *np = '\0'; in lookupname()
260 struct entry *np, *ep; in addentry() local
264 np = freelist; in addentry()
265 freelist = np->e_next; in addentry()
266 (void) bzero((char *)np, (size_t)sizeof (*np)); in addentry()
268 np = (struct entry *)calloc(1, sizeof (*np)); in addentry()
269 if (np == NIL) { in addentry()
275 np->e_type = type & ~(LINK|ROOT); in addentry()
277 np->e_flags |= XATTR; in addentry()
286 np->e_name = savename(name); in addentry()
288 np->e_namlen = strlen(name); in addentry()
289 np->e_parent = np; in addentry()
290 addino(ROOTINO, np); in addentry()
291 return (np); in addentry()
294 if (np->e_flags & XATTR) { in addentry()
307 np->e_name = savename(cp); in addentry()
309 np->e_namlen = strlen(np->e_name); in addentry()
310 np->e_parent = ep; in addentry()
316 if ((type & ROOT) && (np->e_flags & XATTR)) { in addentry()
318 ep->e_xattrs = np; in addentry()
321 np->e_sibling = ep->e_entries; in addentry()
322 ep->e_entries = np; in addentry()
332 np->e_ino = inum; in addentry()
333 np->e_links = ep->e_links; in addentry()
334 ep->e_links = np; in addentry()
340 addino(inum, np); in addentry()
342 return (np); in addentry()
351 struct entry *np; in freeentry() local
363 np = lookupino(ep->e_ino); in freeentry()
364 if (np == NIL) in freeentry()
366 if (np == ep) { in freeentry()
372 for (; np != NIL; np = np->e_links) { in freeentry()
373 if (np->e_links == ep) { in freeentry()
374 np->e_links = ep->e_links; in freeentry()
378 if (np == NIL) in freeentry()
394 struct entry *np; in moveentry() local
397 np = lookupparent(newname); in moveentry()
398 if (np == NIL) in moveentry()
400 if (np != ep->e_parent) { in moveentry()
402 ep->e_parent = np; in moveentry()
403 ep->e_sibling = np->e_entries; in moveentry()
404 np->e_entries = ep; in moveentry()
430 struct entry *np; in removeentry() local
432 np = ep->e_parent; in removeentry()
434 if (np->e_xattrs == ep) in removeentry()
435 np->e_xattrs = NIL; in removeentry()
439 } else if (np->e_entries == ep) { in removeentry()
440 np->e_entries = ep->e_sibling; in removeentry()
442 for (np = np->e_entries; np != NIL; np = np->e_sibling) { in removeentry()
443 if (np->e_sibling == ep) { in removeentry()
444 np->e_sibling = ep->e_sibling; in removeentry()
448 if (np == NIL) in removeentry()
484 struct strhdr *np; in savename() local
498 np = strtblhdr[as / STRTBLINCR].next; in savename()
499 if (np != NULL) { in savename()
500 strtblhdr[as / STRTBLINCR].next = np->next; in savename()
501 cp = (char *)np; in savename()
524 struct strhdr *tp, *np; in freename() local
530 np = (struct strhdr *)name; in freename()
531 np->next = tp->next; in freename()
532 tp->next = np; in freename()