HomeSort by: relevance | last modified time | path
    Searched defs:dispatcher (Results 1 - 3 of 3) sorted by relevancy

  /src/sys/arch/playstation2/ee/
intc.c 87 struct _ipl_dispatcher *dispatcher; local in function:intc_intr
106 SLIST_FOREACH(dispatcher, &__intc_dispatcher_head, link) {
107 if (dispatcher->bit & dispatch) {
108 KDASSERT(dispatcher->func);
109 (*dispatcher->func)(dispatcher->arg);
110 dispatch &= ~dispatcher->bit;
162 struct _ipl_dispatcher *dispatcher = &__intc_dispatcher[ch]; local in function:intc_intr_establish
167 KDASSERT(dispatcher->func == NULL);
170 dispatcher->func = func
209 struct _ipl_dispatcher *dispatcher = &__intc_dispatcher[ch]; local in function:intc_intr_disestablish
    [all...]
dmac.c 116 struct _ipl_dispatcher *dispatcher; local in function:dmac_intr
135 SLIST_FOREACH(dispatcher, &__dmac_dispatcher_head, link) {
136 if (dispatcher->bit & dispatch) {
137 KDASSERT(dispatcher->func);
138 (*dispatcher->func)(dispatcher->arg);
139 dispatch &= ~dispatcher->bit;
194 struct _ipl_dispatcher *dispatcher = &__dmac_dispatcher[ch]; local in function:dmac_intr_establish
198 KDASSERT(dispatcher->func == NULL);
201 dispatcher->func = func
241 struct _ipl_dispatcher *dispatcher = &__dmac_dispatcher[ch]; local in function:dmac_intr_disestablish
    [all...]
  /src/sys/kern/
kern_threadpool.c 36 * jobs, together with a dispatcher thread that does not run jobs but
61 * | | <dispatcher 0> | | <dispatcher 1> | ... | <dispatcher n> | |
69 * | | <dispatcher n+1> | |
75 * XXX Why one dispatcher per CPU? I did that originally to avoid
78 * with a single dispatcher thread, at the expense of another pointer
80 * order for the dispatcher to schedule it correctly.
393 /* XXX dispatcher */
396 pool->tp_refcnt = 1; /* dispatcher's reference *
966 struct threadpool_thread *const dispatcher = arg; local in function:threadpool_dispatcher_thread
    [all...]

Completed in 30 milliseconds