Searched refs:n_next (Results 1 – 16 of 16) sorted by relevance
244 right = right->n_next; in assign()260 left = left->n_next; in assign()379 np->n_next = freelist; in emptynode()453 np = np->n_next; in vlookup()479 np->n_next = *spp; in addsymtab()504 for (rnp = symtab[h]; rnp != NNULL; rnp = rnp->n_next) { in delsymtab()515 *sptr = rnp->n_next; in delsymtab()521 symtab[h] = rnp->n_next; else in delsymtab()522 prevp->n_next = rnp->n_next; in delsymtab()636 nnp = np->n_next; in freetemps()[all …]
402 sep = sep->n_next; in f_split()427 otnp = otnp->n_next; in f_split()592 array = array->n_next; in f_asort()
570 np = np->n_next; in f_getline()701 fnp = fnp->n_next; in xprintf()883 return (np->n_next); in nextarg()
104 struct NODE *n_next; /* Symbol table/PARM link */ member
99 last_n->n_next = makenl($2);100 last_n = last_n->n_next;126 if (nl && nl->n_next != NULL)155 nl = nl->n_next)377 for (h = hosts; h != NULL; oldh = h, h = h->n_next, free(oldh)) {487 nl->n_next = NULL;503 for (n = old; n; n = n->n_next) {515 prev->n_next = new;519 prev->n_next = (struct namelist *) NULL;
141 for (f = c->c_files; f != NULL; f = f->n_next) in docmds()183 ddir = files->n_next != NULL; /* destination is a directory */ in doarrow()198 for (f = files; f != NULL; f = f->n_next) { in doarrow()536 for (f = files; f != NULL; f = f->n_next) { in dodcolon()701 to = to->n_next; in notify()707 to = to->n_next; in notify()731 for (nl = list; nl != NULL; nl = nl->n_next) in inlist()752 for (nl = sc->sc_args; nl != NULL; nl = nl->n_next) { in except()
82 nl->n_next = makenl(cp);83 nl = nl->n_next;
80 for (nl = list; nl != NULL; nl = nl->n_next) in expand()98 for (nl = list; nl != NULL; nl = nl->n_next) in expand()110 prev->n_next = nl; in expand()160 for (; tp != NULL; tp = tp->n_next) { in expstr()
98 struct namelist *n_next; member
440 prev->n_next = nl;481 nl = nl->n_next;
124 struct neighbor *n_next; member450 } else for (np = neighbors; np != NULL; np = np->n_next) { in onalrm()556 for (np = neighbors; np != NULL; np = np->n_next) { in configure()610 for (np2 = neighbors; np2 != NULL; np2 = np2->n_next) { in configure()640 np->n_next = neighbors; in configure()683 for (np2 = neighbors; np2 != NULL; np2 = np2->n_next) { in configure()697 np->n_next = neighbors; in configure()
289 for (; np; np = np->n_next) { in print_advice_list()291 if (np->n_next) in print_advice_list()300 for (; np; np = np->n_next) { in print_node_list()
529 while (np1->n_next) in n_splice()530 np1 = np1->n_next; in n_splice()532 np1->n_next = np2; in n_splice()
406 for (; mem_np; i++, mem_np = mem_np->n_next) { in analyze_typeinfo_struct()460 for (; mem_np; i++, mem_np = mem_np->n_next) { in analyze_typeinfo_union()800 for (; construct; construct = construct->n_next) { in seed_construct_types()814 for (; np; np = np->n_next) in seed_construct_types()1016 for (np = advice_list; np; np = np->n_next) in find_advice()
47 struct node *n_next; /* handy for lists */ member
3376 NODELIST *n_next = NULL; in emlxs_tx_move() local3502 n_next = in emlxs_tx_move()3504 if (n_next == nlp) { in emlxs_tx_move()3507 n_prev = n_next; in emlxs_tx_move()3512 if (n_next == in emlxs_tx_move()3530 n_next-> nlp_next in emlxs_tx_move()