Home
last modified time | relevance | path

Searched refs:q_back (Results 1 – 25 of 28) sorted by relevance

12

/netbsd/src/external/gpl3/gcc/dist/libiberty/
Dinsque.c32 struct qelem *q_back; member
40 pred -> q_forw -> q_back = elem; in insque()
41 elem -> q_back = pred; in insque()
49 elem -> q_forw -> q_back = elem -> q_back; in remque()
50 elem -> q_back -> q_forw = elem -> q_forw; in remque()
/netbsd/src/external/gpl3/gdb/dist/libiberty/
Dinsque.c32 struct qelem *q_back; member
40 pred -> q_forw -> q_back = elem; in insque()
41 elem -> q_back = pred; in insque()
49 elem -> q_forw -> q_back = elem -> q_back; in remque()
50 elem -> q_back -> q_forw = elem -> q_forw; in remque()
/netbsd/src/external/gpl3/binutils/dist/libiberty/
Dinsque.c32 struct qelem *q_back; member
40 pred -> q_forw -> q_back = elem; in insque()
41 elem -> q_back = pred; in insque()
49 elem -> q_forw -> q_back = elem -> q_back; in remque()
50 elem -> q_back -> q_forw = elem -> q_forw; in remque()
/netbsd/src/external/bsd/pcc/dist/pcc/mip/
Dmanifest.h189 #define DLIST_INIT(h,f) { (h)->f.q_forw = (h); (h)->f.q_back = (h); }
190 #define DLIST_ENTRY(t) struct { struct t *q_forw, *q_back; }
192 #define DLIST_PREV(h,f) (h)->f.q_back
198 for ((v) = (h)->f.q_back; (v) != (h); (v) = (v)->f.q_back)
201 (e)->f.q_back = (h)->f.q_back; \
202 (e)->f.q_back->f.q_forw = (e); \
203 (h)->f.q_back = (e); \
207 (e)->f.q_back = (h); \
208 (e)->f.q_forw->f.q_back = (e); \
212 (e)->f.q_forw->f.q_back = (e)->f.q_back; \
[all …]
Doptim2.c501 p1->dlip->qelem.q_back->qelem.q_forw = p2->dlip; in codemove()
504 p1->dlip->qelem.q_forw->qelem.q_back = p3->dlip; in codemove()
508 p2->dlip->qelem.q_back->qelem.q_forw = p3->forw->dlip; in codemove()
511 p3->dlip->qelem.q_forw->qelem.q_back = p2->back->dlip; in codemove()
514 p2->dlip->qelem.q_back = p1->dlip->qelem.q_back; in codemove()
Dregs.c3109 DLIST_INSERT_BEFORE(ipole->qelem.q_back, ip, qelem); in ngenregs()
/netbsd/src/lib/libc/stdlib/
Dremque.c39 struct qelem *q_back; member
50 e->q_forw->q_back = e->q_back; in remque()
51 if (e->q_back) in remque()
52 e->q_back->q_forw = e->q_forw; in remque()
Dinsque.c39 struct qelem *q_back; member
50 e->q_back = p; in insque()
54 p->q_forw->q_back = e; in insque()
/netbsd/src/external/bsd/am-utils/dist/fsinfo/
Dfsi_gram.y112 { if ($2) ins_que((qelem *) $2, list_of_hosts->q_back);
116 { if ($2) ins_que((qelem *) $2, list_of_automounts->q_back);
217 ins_que(&$2->d_q, $$->q_back);
298 ins_que(&a->a_q, $$->q_back);
308 ins_que(&a->a_q, $$->q_back);
318 ins_que(&a->a_q, $$->q_back);
329 ins_que(&a->a_q, $$->q_back);
346 ins_que(&$4->m_q, $$->q_back);
382 ins_que(&$4->f_q, $$->q_back);
Dfsi_util.c389 ins_que(vq, q->q_back); in set_host()
402 ins_que(vq, q->q_back); in set_host()
642 q->q_forw = q->q_back = q; in init_que()
662 elem->q_back = pred; in ins_que()
665 p->q_back = elem; in ins_que()
675 p2 = elem->q_back; in rem_que()
678 p->q_back = p2; in rem_que()
Dfsi_dict.c79 ins_que(&dd->dd_q, de->de_q.q_back); in dict_add_data()
Dfsinfo.h133 #define AM_LAST(ty, q) ((ty *) ((q)->q_back))
Dfsi_analyze.c365 ins_que(&m->m_q, q->q_back); in fixup_required_disk_info()
/netbsd/src/sbin/mount_portal/
Dconf.c87 elem->q_back = pred; in ins_que()
90 p->q_back = elem; in ins_que()
100 qelem *p2 = elem->q_back; in rem_que()
102 p->q_back = p2; in rem_que()
141 ins_que(&p0->p_q, q0->q_back); in pinsert()
275 q.q_forw = q.q_back = &q; in readfp()
Dportald.h51 qelem *q_back; member
Dpuffs_portal.c467 q.q_forw = q.q_back = &q; in main()
/netbsd/src/external/bsd/am-utils/dist/amd/
Dsched.c75 elem->q_back = pred; in ins_que()
78 p->q_back = elem; in ins_que()
86 qelem *p2 = elem->q_back; in rem_que()
89 p->q_back = p2; in rem_que()
Dsun_map.c61 item->q_back = NULL; in sun_list_add()
65 item->q_back = list->last; in sun_list_add()
/netbsd/src/bin/ed/
Dundo.c99 REQUE(ustack[n].h->q_back, ustack[n].t->q_forw); in pop_undo_stack()
102 REQUE(ustack[n].h->q_back, ustack[n].h); in pop_undo_stack()
108 REQUE(ustack[n].t->q_back, ustack[n - 1].t); in pop_undo_stack()
Ded.h74 struct line *q_back; member
142 #define REQUE(pred, succ) (pred)->q_forw = (succ), (succ)->q_back = (pred)
152 #define REMQUE(elem) REQUE((elem)->q_back, (elem)->q_forw);
Dbuf.c183 lp = buffer_head.q_back; in get_addressed_line_node()
185 lp = lp->q_back; in get_addressed_line_node()
190 lp = lp->q_back; in get_addressed_line_node()
Dmain.c1166 REQUE(a1->q_back, a2); in move_lines()
/netbsd/src/external/bsd/am-utils/dist/include/
Dam_utils.h131 #define AM_LAST(ty, q) ((ty *) ((q)->q_back))
133 #define PREV(ty, q) ((ty *) (((qelem *) q)->q_back))
198 qelem *q_back; member
/netbsd/src/external/bsd/pcc/dist/pcc/arch/powerpc/
Dmacdefs.h376 struct { struct stub *q_forw, *q_back; } link; member
/netbsd/src/external/bsd/pcc/dist/pcc/arch/i386/
Dmacdefs.h355 struct { struct stub *q_forw, *q_back; } link; member

12