Searched refs:n_next (Results 1 – 16 of 16) sorted by relevance
246 right = right->n_next; in assign()262 left = left->n_next; in assign()381 np->n_next = freelist; in emptynode()455 np = np->n_next; in vlookup()481 np->n_next = *spp; in addsymtab()506 for (rnp = symtab[h]; rnp != NNULL; rnp = rnp->n_next) { in delsymtab()517 *sptr = rnp->n_next; in delsymtab()523 symtab[h] = rnp->n_next; else in delsymtab()524 prevp->n_next = rnp->n_next; in delsymtab()638 nnp = np->n_next; in freetemps()[all …]
403 sep = sep->n_next; in f_split()428 otnp = otnp->n_next; in f_split()593 array = array->n_next; in f_asort()
572 np = np->n_next; in f_getline()703 fnp = fnp->n_next; in xprintf()885 return (np->n_next); in nextarg()
103 struct NODE *n_next; /* Symbol table/PARM link */ member
100 last_n->n_next = makenl($2);101 last_n = last_n->n_next;127 if (nl && nl->n_next != NULL)155 nl = nl->n_next)376 for (h = hosts; h != NULL; oldh = h, h = h->n_next, free(oldh)) {486 nl->n_next = NULL;502 for (n = old; n; n = n->n_next) {514 prev->n_next = new;518 prev->n_next = (struct namelist *) NULL;
146 for (f = c->c_files; f != NULL; f = f->n_next)192 ddir = files->n_next != NULL; /* destination is a directory */207 for (f = files; f != NULL; f = f->n_next) {555 for (f = files; f != NULL; f = f->n_next) {725 to = to->n_next;731 to = to->n_next;757 for (nl = list; nl != NULL; nl = nl->n_next)779 for (nl = sc->sc_args; nl != NULL; nl = nl->n_next) {
83 nl->n_next = makenl(cp);84 nl = nl->n_next;
84 for (nl = list; nl != NULL; nl = nl->n_next)102 for (nl = list; nl != NULL; nl = nl->n_next)114 prev->n_next = nl;165 for (; tp != NULL; tp = tp->n_next) {
100 struct namelist *n_next; member
440 prev->n_next = nl;481 nl = nl->n_next;
283 for (; np; np = np->n_next) { in print_advice_list()285 if (np->n_next) in print_advice_list()294 for (; np; np = np->n_next) { in print_node_list()
524 while (np1->n_next) in n_splice()525 np1 = np1->n_next; in n_splice()527 np1->n_next = np2; in n_splice()
404 for (; mem_np; i++, mem_np = mem_np->n_next) { in analyze_typeinfo_struct()458 for (; mem_np; i++, mem_np = mem_np->n_next) { in analyze_typeinfo_union()798 for (; construct; construct = construct->n_next) { in seed_construct_types()812 for (; np; np = np->n_next) in seed_construct_types()1013 for (np = advice_list; np; np = np->n_next) in find_advice()
43 struct node *n_next; /* handy for lists */ member
126 struct neighbor *n_next; member452 } else for (np = neighbors; np != NULL; np = np->n_next) { in onalrm()558 for (np = neighbors; np != NULL; np = np->n_next) { in configure()612 for (np2 = neighbors; np2 != NULL; np2 = np2->n_next) { in configure()642 np->n_next = neighbors; in configure()685 for (np2 = neighbors; np2 != NULL; np2 = np2->n_next) { in configure()699 np->n_next = neighbors; in configure()
3367 NODELIST *n_next = NULL; in emlxs_tx_move() local3493 n_next = in emlxs_tx_move()3495 if (n_next == nlp) { in emlxs_tx_move()3498 n_prev = n_next; in emlxs_tx_move()3503 if (n_next == in emlxs_tx_move()3521 n_next-> nlp_next in emlxs_tx_move()