Lines Matching refs:np
100 addino(ino_t inum, struct entry *np)
107 np->e_ino = inum;
108 np->e_next = *epp;
109 *epp = np;
111 for (np = np->e_next; np != NULL; np = np->e_next)
112 if (np->e_ino == inum)
113 badentry(np, "duplicate inum");
147 char *np;
153 for (np = buf; *cp != '/' && *cp != '\0'; )
154 *np++ = *cp++;
155 *np = '\0';
222 struct entry *np, *ep;
225 np = malloc(pagesize);
226 if (np == NULL)
228 for (ep = (struct entry *)((char *)np + pagesize) - 1;
229 np <= ep; np++) {
230 np->e_next = freelist;
231 freelist = np;
234 np = freelist;
235 freelist = np->e_next;
236 memset(np, 0, sizeof(struct entry));
238 np->e_type = type & ~LINK;
243 np->e_name = savename(name);
244 np->e_namlen = strlen(name);
245 np->e_parent = np;
246 addino(UFS_ROOTINO, np);
247 return (np);
249 np->e_name = savename(strrchr(name, '/') + 1);
250 np->e_namlen = strlen(np->e_name);
251 np->e_parent = ep;
252 np->e_sibling = ep->e_entries;
253 ep->e_entries = np;
258 np->e_ino = inum;
259 np->e_links = ep->e_links;
260 ep->e_links = np;
264 addino(inum, np);
266 return (np);
275 struct entry *np;
287 np = lookupino(ep->e_ino);
288 if (np == NULL)
290 if (np == ep) {
296 for (; np != NULL; np = np->e_links) {
297 if (np->e_links == ep) {
298 np->e_links = ep->e_links;
302 if (np == NULL)
318 struct entry *np;
321 np = lookupparent(newname);
322 if (np == NULL)
324 if (np != ep->e_parent) {
326 ep->e_parent = np;
327 ep->e_sibling = np->e_entries;
328 np->e_entries = ep;
346 struct entry *np;
348 np = ep->e_parent;
349 if (np->e_entries == ep) {
350 np->e_entries = ep->e_sibling;
352 for (np = np->e_entries; np != NULL; np = np->e_sibling) {
353 if (np->e_sibling == ep) {
354 np->e_sibling = ep->e_sibling;
358 if (np == NULL)
391 struct strhdr *np, *tp;
405 np = (struct strhdr *)cp;
406 np->next = tp->next;
407 tp->next = np;
410 np = tp->next;
411 tp->next = np->next;
412 cp = (char *)np;
424 struct strhdr *tp, *np;
427 np = (struct strhdr *)name;
428 np->next = tp->next;
429 tp->next = np;