Searched refs:tq_task (Results 1 - 5 of 5) sorted by relevance

/opensolaris-onvv-gate/usr/src/lib/libzpool/common/
H A Dtaskq.c55 task_t tq_task; member in struct:taskq
133 t->task_next = tq->tq_task.task_next;
134 t->task_prev = &tq->tq_task;
136 t->task_next = &tq->tq_task;
137 t->task_prev = tq->tq_task.task_prev;
152 while (tq->tq_task.task_next != &tq->tq_task || tq->tq_active != 0)
165 if ((t = tq->tq_task.task_next) == &tq->tq_task) {
220 tq->tq_task
[all...]
/opensolaris-onvv-gate/usr/src/uts/common/sys/
H A Dtaskq_impl.h117 taskq_ent_t tq_task; member in struct:taskq
/opensolaris-onvv-gate/usr/src/uts/common/os/
H A Dtaskq.c235 * | tq_task | |
244 * +-| tq_task.tqent_prev | +--| tqent_prev | | +--| tqent_prev | ^
276 * Task queues use tq_task field to link new entry in the queue. The queue is a
354 * in structure to the tq_task list above, but entries are taken from it in LIFO
726 TQ_PREPEND(tq->tq_task, tqe); \
728 TQ_APPEND(tq->tq_task, tqe); \
769 tq->tq_task.tqent_next = &tq->tq_task;
770 tq->tq_task.tqent_prev = &tq->tq_task;
[all...]
/opensolaris-onvv-gate/usr/src/cmd/mdb/common/modules/genunix/
H A Dtaskq.c333 ((size_t)wsp->walk_addr + OFFSETOF(taskq_t, tq_task));
344 wsp->walk_addr = (uintptr_t)tq_head.tq_task.tqent_next;
/opensolaris-onvv-gate/usr/src/uts/common/crypto/core/
H A Dkcf_sched.c600 #define EMPTY_TASKQ(tq) ((tq)->tq_task.tqent_next == &(tq)->tq_task)

Completed in 145 milliseconds