Home
last modified time | relevance | path

Searched refs:v_link (Results 1 – 6 of 6) sorted by relevance

/freebsd-14.2/usr.bin/mail/
H A Dcmd3.c369 for (vp = variables[h]; vp != NULL; vp = vp->v_link) in set()
373 for (vp = variables[h]; vp != NULL; vp = vp->v_link) in set()
426 variables[h] = variables[h]->v_link; in unset()
432 for (vp = variables[h]; vp->v_link != vp2; vp = vp->v_link) in unset()
434 vp->v_link = vp2->v_link; in unset()
H A Dvars.c62 vp->v_link = variables[h]; in assign()
127 for (vp = variables[hash(name)]; vp != NULL; vp = vp->v_link) in lookup()
H A Ddef.h202 struct var *v_link; /* Forward link to next variable */ member
/freebsd-14.2/sys/kern/
H A Dkern_lockf.c2039 TAILQ_INSERT_HEAD(path, x, v_link); in graph_reaches()
2046 TAILQ_INSERT_HEAD(path, x, v_link); in graph_reaches()
2086 TAILQ_FOREACH(v, set, v_link) { in graph_print_vertices()
2089 if (TAILQ_NEXT(v, v_link)) in graph_print_vertices()
2120 TAILQ_INSERT_TAIL(delta, y, v_link); in graph_delta_forward()
2135 v = TAILQ_NEXT(v, v_link); in graph_delta_forward()
2161 TAILQ_INSERT_TAIL(delta, x, v_link); in graph_delta_backward()
2186 TAILQ_FOREACH(v, set, v_link) { in graph_add_indices()
2207 TAILQ_FOREACH(v, set, v_link) { in graph_assign_indices()
2211 TAILQ_REMOVE(set, vlowest, v_link); in graph_assign_indices()
[all …]
/freebsd-14.2/contrib/tcsh/
H A Dsh.set.c726 while ((c = p->v_link[f]) != 0) { in setq()
739 p->v_link[f] = c = xmalloc(sizeof(struct varent)); in setq()
884 if ((pp->v_link[f] = c) != 0) in unsetv1()
1034 pp->v_link[ff] = rleft(p); in balance()
1039 pp->v_link[ff] = rleft(p); in balance()
1045 pp->v_link[ff] = rleft(p); in balance()
1071 pp->v_link[ff] = rright(p); in balance()
1076 pp->v_link[ff] = rright(p); in balance()
1082 pp->v_link[ff] = rright(p); in balance()
H A Dsh.h1015 struct varent *v_link[3]; /* The links, see below */ member
1019 #define v_left v_link[0]
1020 #define v_right v_link[1]
1021 #define v_parent v_link[2]