/freebsd-9.3-release/contrib/binutils/libiberty/ |
H A D | insque.c | 18 struct qelem *q_forw; 30 struct qelem *q_forw; member in struct:qelem 38 elem -> q_forw = pred -> q_forw; 39 pred -> q_forw -> q_back = elem; 41 pred -> q_forw = elem; 48 elem -> q_forw -> q_back = elem -> q_back; 49 elem -> q_back -> q_forw = elem -> q_forw;
|
/freebsd-9.3-release/contrib/gcclibs/libiberty/ |
H A D | insque.c | 18 struct qelem *q_forw; 30 struct qelem *q_forw; member in struct:qelem 38 elem -> q_forw = pred -> q_forw; 39 pred -> q_forw -> q_back = elem; 41 pred -> q_forw = elem; 48 elem -> q_forw -> q_back = elem -> q_back; 49 elem -> q_back -> q_forw = elem -> q_forw;
|
/freebsd-9.3-release/usr.sbin/sade/ |
H A D | list.h | 34 struct _qelement *q_forw; member in struct:_qelement 39 (Xhead).q_forw = &(Xhead); \ 44 ((Xhead).q_forw == &(Xhead)) 49 Xp->q_forw = (Xe->q_forw = (Xe->q_back = Xp)->q_forw)->q_back = Xe; \ 54 (Xe->q_back->q_forw = Xe->q_forw)->q_back = Xe->q_back; \
|
/freebsd-9.3-release/usr.sbin/sysinstall/ |
H A D | list.h | 39 struct _qelement *q_forw; member in struct:_qelement 44 (Xhead).q_forw = &(Xhead); \ 49 ((Xhead).q_forw == &(Xhead)) 54 Xp->q_forw = (Xe->q_forw = (Xe->q_back = Xp)->q_forw)->q_back = Xe; \ 59 (Xe->q_back->q_forw = Xe->q_forw)->q_back = Xe->q_back; \
|
H A D | dispatch.c | 155 item = (command_buffer *) head->q_forw; 351 item = (command_buffer *) head->q_forw;
|
/freebsd-9.3-release/usr.sbin/mount_portalfs/ |
H A D | conf.c | 75 qelem *p = pred->q_forw; 77 elem->q_forw = p; 78 pred->q_forw = elem; 87 qelem *p = elem->q_forw; 89 p2->q_forw = p; 119 for (q = q0->q_forw; q != q0; q = q->q_forw) { 236 while (q0->q_forw != q0) { 237 qelem *q = q0->q_forw; 241 while (xq->q_forw ! [all...] |
H A D | portald.h | 52 qelem *q_forw; member in struct:qelem
|
H A D | mount_portalfs.c | 190 q.q_forw = q.q_back = &q;
|
/freebsd-9.3-release/bin/ed/ |
H A D | undo.c | 101 REQUE(ustack[n].h->q_back, ustack[n].t->q_forw); 105 REQUE(ustack[n].t, ustack[n].t->q_forw); 109 REQUE(ustack[n - 1].h, ustack[n].h->q_forw); 140 ep = ustack[u_p].t->q_forw; 143 tl = lp->q_forw;
|
H A D | buf.c | 148 while (cp != lp && (cp = cp->q_forw) != &buffer_head) 169 lp = lp->q_forw; 182 lp = lp->q_forw;
|
H A D | ed.h | 64 struct line *q_forw; member in struct:line 160 #define REQUE(pred, succ) (pred)->q_forw = (succ), (succ)->q_back = (pred) 165 REQUE((elem), (pred)->q_forw); \ 170 #define REMQUE(elem) REQUE((elem)->q_back, (elem)->q_forw);
|
H A D | glbl.c | 58 for (n = first_addr; n <= second_addr; n++, lp = lp->q_forw) { 189 for (lp = np; lp != mp; lp = lp->q_forw)
|
H A D | io.c | 89 lp = lp->q_forw; 182 for (; n && n <= m; n++, lp = lp->q_forw) {
|
/freebsd-9.3-release/contrib/amd/amd/ |
H A D | sched.c | 75 qelem *p = pred->q_forw; 78 elem->q_forw = p; 79 pred->q_forw = elem; 87 qelem *p = elem->q_forw; 90 p2->q_forw = p;
|
/freebsd-9.3-release/contrib/amd/fsinfo/ |
H A D | fsinfo.h | 131 #define AM_FIRST(ty, q) ((ty *) ((q)->q_forw)) 136 #define NEXT(ty, q) ((ty *) (((qelem *) q)->q_forw))
|
H A D | fsi_util.c | 644 q->q_forw = q->q_back = q; 663 p = pred->q_forw; 665 elem->q_forw = p; 666 pred->q_forw = elem; 676 p = elem->q_forw; 679 p2->q_forw = p;
|
/freebsd-9.3-release/contrib/amd/include/ |
H A D | am_utils.h | 122 #define AM_FIRST(ty, q) ((ty *) ((q)->q_forw)) 124 #define NEXT(ty, q) ((ty *) (((qelem *) q)->q_forw)) 189 qelem *q_forw; member in struct:_qelem
|