HomeSort by: relevance | last modified time | path
    Searched refs:q_forw (Results 1 - 10 of 10) sorted by relevancy

  /src/lib/libc/stdlib/
insque.c 38 struct qelem *q_forw; member in struct:qelem
52 e->q_forw = p->q_forw;
53 if (p->q_forw)
54 p->q_forw->q_back = e;
55 p->q_forw = e;
57 e->q_forw = 0;
remque.c 38 struct qelem *q_forw; member in struct:qelem
49 if (e->q_forw)
50 e->q_forw->q_back = e->q_back;
52 e->q_back->q_forw = e->q_forw;
  /src/sbin/mount_portal/
conf.c 86 qelem *p = pred->q_forw;
88 elem->q_forw = p;
89 pred->q_forw = elem;
99 qelem *p = elem->q_forw;
101 p2->q_forw = p;
135 for (q = q0->q_forw; q != q0; q = q->q_forw) {
249 while (q0->q_forw != q0) {
250 qelem *q = q0->q_forw;
254 while (xq->q_forw != xq)
    [all...]
portald.h 50 qelem *q_forw; member in struct:qelem
puffs_portal.c 467 q.q_forw = q.q_back = &q;
  /src/bin/ed/
undo.c 99 REQUE(ustack[n].h->q_back, ustack[n].t->q_forw);
103 REQUE(ustack[n].t, ustack[n].t->q_forw);
107 REQUE(ustack[n - 1].h, ustack[n].h->q_forw);
138 ep = ustack[u_p].t->q_forw;
141 tl = lp->q_forw;
ed.h 73 struct line *q_forw; member in struct:line
142 #define REQUE(pred, succ) (pred)->q_forw = (succ), (succ)->q_back = (pred)
147 REQUE((elem), (pred)->q_forw); \
152 #define REMQUE(elem) REQUE((elem)->q_back, (elem)->q_forw);
glbl.c 65 for (n = first_addr; n <= second_addr; n++, lp = lp->q_forw) {
184 for (lp = np; lp != mp; lp = lp->q_forw)
buf.c 160 while (cp != lp && (cp = cp->q_forw) != &buffer_head)
181 lp = lp->q_forw;
194 lp = lp->q_forw;
io.c 93 lp = lp->q_forw;
186 for (; n && n <= m; n++, lp = lp->q_forw) {

Completed in 14 milliseconds