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

  /src/games/quiz/
quiz.h 49 struct qentry *q_next; /* next one */ member in struct:qentry
quiz.c 142 if ((qp->q_next = malloc(sizeof(QE))) == NULL)
144 qp = qp->q_next;
150 qp->q_next = NULL;
174 for (qp = qlist.q_next; qp; qp = qp->q_next) {
199 for (qp = qlist.q_next; qp; qp = qp->q_next) {
239 qp = qlist.q_next;
241 qp = qp->q_next;
243 qp = qp->q_next;
    [all...]
  /src/sys/sys/
gcq.h 42 struct gcq *q_next; member in struct:gcq
56 q->q_next = q->q_prev = q;
90 return (q->q_next != q);
104 return (prev->q_next == next && next->q_prev == prev);
111 GCQ_ASSERT(off->q_next == off && off->q_prev == off);
112 on_next = on->q_next;
115 off->q_next = on_next;
117 on->q_next = off;
124 GCQ_ASSERT(off->q_next == off && off->q_prev == off);
127 off->q_next = on
    [all...]
  /src/sys/altq/
altq_fifoq.h 35 struct fifoq_state *q_next; /* next fifoq_state in the list */ member in struct:fifoq_state
altq_fifoq.c 193 q->q_next = fifoq_list;
357 fifoq_list = q->q_next;
359 for (tmp = fifoq_list; tmp != NULL; tmp = tmp->q_next)
360 if (tmp->q_next == q) {
361 tmp->q_next = q->q_next;
  /src/sys/dev/pci/
ubsecvar.h 74 SIMPLEQ_ENTRY(ubsec_q2) q_next; member in struct:ubsec_q2
149 SIMPLEQ_ENTRY(ubsec_q) q_next; member in struct:ubsec_q
ubsec.c 432 SIMPLEQ_INSERT_TAIL(&sc->sc_freequeue, q, q_next);
552 SIMPLEQ_FOREACH_SAFE(q, &sc->sc_freequeue, q_next, qtmp) {
667 SIMPLEQ_REMOVE_HEAD(&sc->sc_qchip, /*q,*/ q_next);
723 SIMPLEQ_REMOVE_HEAD(&sc->sc_qchip2, /*q2,*/ q_next);
756 SIMPLEQ_REMOVE_HEAD(&sc->sc_qchip4, q_next);
866 SIMPLEQ_REMOVE_HEAD(&sc->sc_queue, /*q,*/ q_next);
885 SIMPLEQ_REMOVE_HEAD(&sc->sc_queue, /*q2,*/ q_next);
896 SIMPLEQ_INSERT_TAIL(&sc->sc_qchip, q, q_next);
940 SIMPLEQ_REMOVE_HEAD(&sc->sc_queue, /*q,*/ q_next);
942 SIMPLEQ_INSERT_TAIL(&sc->sc_qchip, q, q_next);
    [all...]

Completed in 18 milliseconds