1ca2e0534SDoug Rabson /*- 2ca2e0534SDoug Rabson * Copyright (c) 2000 Doug Rabson 3ca2e0534SDoug Rabson * All rights reserved. 4ca2e0534SDoug Rabson * 5ca2e0534SDoug Rabson * Redistribution and use in source and binary forms, with or without 6ca2e0534SDoug Rabson * modification, are permitted provided that the following conditions 7ca2e0534SDoug Rabson * are met: 8ca2e0534SDoug Rabson * 1. Redistributions of source code must retain the above copyright 9ca2e0534SDoug Rabson * notice, this list of conditions and the following disclaimer. 10ca2e0534SDoug Rabson * 2. Redistributions in binary form must reproduce the above copyright 11ca2e0534SDoug Rabson * notice, this list of conditions and the following disclaimer in the 12ca2e0534SDoug Rabson * documentation and/or other materials provided with the distribution. 13ca2e0534SDoug Rabson * 14ca2e0534SDoug Rabson * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 15ca2e0534SDoug Rabson * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 16ca2e0534SDoug Rabson * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 17ca2e0534SDoug Rabson * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 18ca2e0534SDoug Rabson * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19ca2e0534SDoug Rabson * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 20ca2e0534SDoug Rabson * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21ca2e0534SDoug Rabson * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22ca2e0534SDoug Rabson * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23ca2e0534SDoug Rabson * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24ca2e0534SDoug Rabson * SUCH DAMAGE. 25ca2e0534SDoug Rabson */ 26ca2e0534SDoug Rabson 27677b542eSDavid E. O'Brien #include <sys/cdefs.h> 28677b542eSDavid E. O'Brien __FBSDID("$FreeBSD$"); 29677b542eSDavid E. O'Brien 30ca2e0534SDoug Rabson #include <sys/param.h> 31ca2e0534SDoug Rabson #include <sys/systm.h> 321de1c550SJohn Baldwin #include <sys/bus.h> 33282873e2SJohn Baldwin #include <sys/interrupt.h> 34ca2e0534SDoug Rabson #include <sys/kernel.h> 35eb5b0e05SJohn Baldwin #include <sys/kthread.h> 36d2849f27SAdrian Chadd #include <sys/limits.h> 371de1c550SJohn Baldwin #include <sys/lock.h> 38ca2e0534SDoug Rabson #include <sys/malloc.h> 391de1c550SJohn Baldwin #include <sys/mutex.h> 4052bc746aSSam Leffler #include <sys/proc.h> 410f92108dSScott Long #include <sys/sched.h> 421de1c550SJohn Baldwin #include <sys/taskqueue.h> 43cb32189eSKenneth D. Merry #include <sys/unistd.h> 440f92108dSScott Long #include <machine/stdarg.h> 45ca2e0534SDoug Rabson 46959b7375SPoul-Henning Kamp static MALLOC_DEFINE(M_TASKQUEUE, "taskqueue", "Task Queues"); 477874f606SScott Long static void *taskqueue_giant_ih; 48eb5b0e05SJohn Baldwin static void *taskqueue_ih; 496d545f4cSAlexander Motin static void taskqueue_fast_enqueue(void *); 506d545f4cSAlexander Motin static void taskqueue_swi_enqueue(void *); 516d545f4cSAlexander Motin static void taskqueue_swi_giant_enqueue(void *); 528088699fSJohn Baldwin 53bf73d4d2SMatthew D Fleming struct taskqueue_busy { 54bf73d4d2SMatthew D Fleming struct task *tb_running; 55bf73d4d2SMatthew D Fleming TAILQ_ENTRY(taskqueue_busy) tb_link; 56bf73d4d2SMatthew D Fleming }; 57bf73d4d2SMatthew D Fleming 58ca2e0534SDoug Rabson struct taskqueue { 59ca2e0534SDoug Rabson STAILQ_HEAD(, task) tq_queue; 60ca2e0534SDoug Rabson taskqueue_enqueue_fn tq_enqueue; 61ca2e0534SDoug Rabson void *tq_context; 62bf73d4d2SMatthew D Fleming TAILQ_HEAD(, taskqueue_busy) tq_active; 631de1c550SJohn Baldwin struct mtx tq_mutex; 64175611b6SSam Leffler struct thread **tq_threads; 65175611b6SSam Leffler int tq_tcount; 66694382c8SKip Macy int tq_spin; 670f92108dSScott Long int tq_flags; 68b2ad91f2SKonstantin Belousov int tq_callouts; 69fdbc7174SWill Andrews taskqueue_callback_fn tq_callbacks[TASKQUEUE_NUM_CALLBACKS]; 70fdbc7174SWill Andrews void *tq_cb_contexts[TASKQUEUE_NUM_CALLBACKS]; 71ca2e0534SDoug Rabson }; 72ca2e0534SDoug Rabson 730f92108dSScott Long #define TQ_FLAGS_ACTIVE (1 << 0) 74478cfc73SScott Long #define TQ_FLAGS_BLOCKED (1 << 1) 756d545f4cSAlexander Motin #define TQ_FLAGS_UNLOCKED_ENQUEUE (1 << 2) 760f92108dSScott Long 77b2ad91f2SKonstantin Belousov #define DT_CALLOUT_ARMED (1 << 0) 78b2ad91f2SKonstantin Belousov 79b79b28b6SJuli Mallett #define TQ_LOCK(tq) \ 80b79b28b6SJuli Mallett do { \ 81b79b28b6SJuli Mallett if ((tq)->tq_spin) \ 82b79b28b6SJuli Mallett mtx_lock_spin(&(tq)->tq_mutex); \ 83b79b28b6SJuli Mallett else \ 84b79b28b6SJuli Mallett mtx_lock(&(tq)->tq_mutex); \ 85b79b28b6SJuli Mallett } while (0) 86fdbc7174SWill Andrews #define TQ_ASSERT_LOCKED(tq) mtx_assert(&(tq)->tq_mutex, MA_OWNED) 879df1a6ddSScott Long 88b79b28b6SJuli Mallett #define TQ_UNLOCK(tq) \ 89b79b28b6SJuli Mallett do { \ 90b79b28b6SJuli Mallett if ((tq)->tq_spin) \ 91b79b28b6SJuli Mallett mtx_unlock_spin(&(tq)->tq_mutex); \ 92b79b28b6SJuli Mallett else \ 93b79b28b6SJuli Mallett mtx_unlock(&(tq)->tq_mutex); \ 94b79b28b6SJuli Mallett } while (0) 95fdbc7174SWill Andrews #define TQ_ASSERT_UNLOCKED(tq) mtx_assert(&(tq)->tq_mutex, MA_NOTOWNED) 969df1a6ddSScott Long 97b2ad91f2SKonstantin Belousov void 98b2ad91f2SKonstantin Belousov _timeout_task_init(struct taskqueue *queue, struct timeout_task *timeout_task, 99b2ad91f2SKonstantin Belousov int priority, task_fn_t func, void *context) 100b2ad91f2SKonstantin Belousov { 101b2ad91f2SKonstantin Belousov 102b2ad91f2SKonstantin Belousov TASK_INIT(&timeout_task->t, priority, func, context); 1036d545f4cSAlexander Motin callout_init_mtx(&timeout_task->c, &queue->tq_mutex, 1046d545f4cSAlexander Motin CALLOUT_RETURNUNLOCKED); 105b2ad91f2SKonstantin Belousov timeout_task->q = queue; 106b2ad91f2SKonstantin Belousov timeout_task->f = 0; 107b2ad91f2SKonstantin Belousov } 108b2ad91f2SKonstantin Belousov 1099df1a6ddSScott Long static __inline int 1109df1a6ddSScott Long TQ_SLEEP(struct taskqueue *tq, void *p, struct mtx *m, int pri, const char *wm, 1119df1a6ddSScott Long int t) 1129df1a6ddSScott Long { 113694382c8SKip Macy if (tq->tq_spin) 1149df1a6ddSScott Long return (msleep_spin(p, m, wm, t)); 1159df1a6ddSScott Long return (msleep(p, m, pri, wm, t)); 1169df1a6ddSScott Long } 1179df1a6ddSScott Long 1189df1a6ddSScott Long static struct taskqueue * 119706b0d31SAndriy Gapon _taskqueue_create(const char *name __unused, int mflags, 12052bc746aSSam Leffler taskqueue_enqueue_fn enqueue, void *context, 1219df1a6ddSScott Long int mtxflags, const char *mtxname) 122ca2e0534SDoug Rabson { 123ca2e0534SDoug Rabson struct taskqueue *queue; 124ca2e0534SDoug Rabson 1251de1c550SJohn Baldwin queue = malloc(sizeof(struct taskqueue), M_TASKQUEUE, mflags | M_ZERO); 126ca2e0534SDoug Rabson if (!queue) 127d710cae7SWarner Losh return NULL; 128694382c8SKip Macy 129ca2e0534SDoug Rabson STAILQ_INIT(&queue->tq_queue); 130bf73d4d2SMatthew D Fleming TAILQ_INIT(&queue->tq_active); 131ca2e0534SDoug Rabson queue->tq_enqueue = enqueue; 132ca2e0534SDoug Rabson queue->tq_context = context; 133694382c8SKip Macy queue->tq_spin = (mtxflags & MTX_SPIN) != 0; 134694382c8SKip Macy queue->tq_flags |= TQ_FLAGS_ACTIVE; 1356d545f4cSAlexander Motin if (enqueue == taskqueue_fast_enqueue || 1366d545f4cSAlexander Motin enqueue == taskqueue_swi_enqueue || 1376d545f4cSAlexander Motin enqueue == taskqueue_swi_giant_enqueue || 1386d545f4cSAlexander Motin enqueue == taskqueue_thread_enqueue) 1396d545f4cSAlexander Motin queue->tq_flags |= TQ_FLAGS_UNLOCKED_ENQUEUE; 1409df1a6ddSScott Long mtx_init(&queue->tq_mutex, mtxname, NULL, mtxflags); 141ca2e0534SDoug Rabson 142ca2e0534SDoug Rabson return queue; 143ca2e0534SDoug Rabson } 144ca2e0534SDoug Rabson 1459df1a6ddSScott Long struct taskqueue * 1469df1a6ddSScott Long taskqueue_create(const char *name, int mflags, 1470f92108dSScott Long taskqueue_enqueue_fn enqueue, void *context) 1489df1a6ddSScott Long { 1490f92108dSScott Long return _taskqueue_create(name, mflags, enqueue, context, 1509df1a6ddSScott Long MTX_DEF, "taskqueue"); 1519df1a6ddSScott Long } 1529df1a6ddSScott Long 153fdbc7174SWill Andrews void 154fdbc7174SWill Andrews taskqueue_set_callback(struct taskqueue *queue, 155fdbc7174SWill Andrews enum taskqueue_callback_type cb_type, taskqueue_callback_fn callback, 156fdbc7174SWill Andrews void *context) 157fdbc7174SWill Andrews { 158fdbc7174SWill Andrews 159fdbc7174SWill Andrews KASSERT(((cb_type >= TASKQUEUE_CALLBACK_TYPE_MIN) && 160fdbc7174SWill Andrews (cb_type <= TASKQUEUE_CALLBACK_TYPE_MAX)), 161fdbc7174SWill Andrews ("Callback type %d not valid, must be %d-%d", cb_type, 162fdbc7174SWill Andrews TASKQUEUE_CALLBACK_TYPE_MIN, TASKQUEUE_CALLBACK_TYPE_MAX)); 163fdbc7174SWill Andrews KASSERT((queue->tq_callbacks[cb_type] == NULL), 164fdbc7174SWill Andrews ("Re-initialization of taskqueue callback?")); 165fdbc7174SWill Andrews 166fdbc7174SWill Andrews queue->tq_callbacks[cb_type] = callback; 167fdbc7174SWill Andrews queue->tq_cb_contexts[cb_type] = context; 168fdbc7174SWill Andrews } 169fdbc7174SWill Andrews 17052bc746aSSam Leffler /* 17152bc746aSSam Leffler * Signal a taskqueue thread to terminate. 17252bc746aSSam Leffler */ 17352bc746aSSam Leffler static void 174175611b6SSam Leffler taskqueue_terminate(struct thread **pp, struct taskqueue *tq) 17552bc746aSSam Leffler { 17652bc746aSSam Leffler 177b2ad91f2SKonstantin Belousov while (tq->tq_tcount > 0 || tq->tq_callouts > 0) { 1780f92108dSScott Long wakeup(tq); 1790f92108dSScott Long TQ_SLEEP(tq, pp, &tq->tq_mutex, PWAIT, "taskqueue_destroy", 0); 18052bc746aSSam Leffler } 18152bc746aSSam Leffler } 18252bc746aSSam Leffler 183ca2e0534SDoug Rabson void 184ca2e0534SDoug Rabson taskqueue_free(struct taskqueue *queue) 185ca2e0534SDoug Rabson { 1861de1c550SJohn Baldwin 1879df1a6ddSScott Long TQ_LOCK(queue); 1880f92108dSScott Long queue->tq_flags &= ~TQ_FLAGS_ACTIVE; 189175611b6SSam Leffler taskqueue_terminate(queue->tq_threads, queue); 190bf73d4d2SMatthew D Fleming KASSERT(TAILQ_EMPTY(&queue->tq_active), ("Tasks still running?")); 191b2ad91f2SKonstantin Belousov KASSERT(queue->tq_callouts == 0, ("Armed timeout tasks")); 1921de1c550SJohn Baldwin mtx_destroy(&queue->tq_mutex); 193175611b6SSam Leffler free(queue->tq_threads, M_TASKQUEUE); 194ca2e0534SDoug Rabson free(queue, M_TASKQUEUE); 195ca2e0534SDoug Rabson } 196ca2e0534SDoug Rabson 197b2ad91f2SKonstantin Belousov static int 198b2ad91f2SKonstantin Belousov taskqueue_enqueue_locked(struct taskqueue *queue, struct task *task) 199ca2e0534SDoug Rabson { 200ca2e0534SDoug Rabson struct task *ins; 201ca2e0534SDoug Rabson struct task *prev; 202ca2e0534SDoug Rabson 203ca2e0534SDoug Rabson /* 204ca2e0534SDoug Rabson * Count multiple enqueues. 205ca2e0534SDoug Rabson */ 206694382c8SKip Macy if (task->ta_pending) { 207d2849f27SAdrian Chadd if (task->ta_pending < USHRT_MAX) 208ca2e0534SDoug Rabson task->ta_pending++; 2096d545f4cSAlexander Motin TQ_UNLOCK(queue); 210b2ad91f2SKonstantin Belousov return (0); 211ca2e0534SDoug Rabson } 212ca2e0534SDoug Rabson 213ca2e0534SDoug Rabson /* 214ca2e0534SDoug Rabson * Optimise the case when all tasks have the same priority. 215ca2e0534SDoug Rabson */ 21651b86781SJeffrey Hsu prev = STAILQ_LAST(&queue->tq_queue, task, ta_link); 217ca2e0534SDoug Rabson if (!prev || prev->ta_priority >= task->ta_priority) { 218ca2e0534SDoug Rabson STAILQ_INSERT_TAIL(&queue->tq_queue, task, ta_link); 219ca2e0534SDoug Rabson } else { 220d710cae7SWarner Losh prev = NULL; 221ca2e0534SDoug Rabson for (ins = STAILQ_FIRST(&queue->tq_queue); ins; 222ca2e0534SDoug Rabson prev = ins, ins = STAILQ_NEXT(ins, ta_link)) 223ca2e0534SDoug Rabson if (ins->ta_priority < task->ta_priority) 224ca2e0534SDoug Rabson break; 225ca2e0534SDoug Rabson 226ca2e0534SDoug Rabson if (prev) 227ca2e0534SDoug Rabson STAILQ_INSERT_AFTER(&queue->tq_queue, prev, task, ta_link); 228ca2e0534SDoug Rabson else 229ca2e0534SDoug Rabson STAILQ_INSERT_HEAD(&queue->tq_queue, task, ta_link); 230ca2e0534SDoug Rabson } 231ca2e0534SDoug Rabson 232ca2e0534SDoug Rabson task->ta_pending = 1; 2336d545f4cSAlexander Motin if ((queue->tq_flags & TQ_FLAGS_UNLOCKED_ENQUEUE) != 0) 2346d545f4cSAlexander Motin TQ_UNLOCK(queue); 235694382c8SKip Macy if ((queue->tq_flags & TQ_FLAGS_BLOCKED) == 0) 236ca2e0534SDoug Rabson queue->tq_enqueue(queue->tq_context); 2376d545f4cSAlexander Motin if ((queue->tq_flags & TQ_FLAGS_UNLOCKED_ENQUEUE) == 0) 2386d545f4cSAlexander Motin TQ_UNLOCK(queue); 239282873e2SJohn Baldwin 24018093155SAlexander Motin /* Return with lock released. */ 241b2ad91f2SKonstantin Belousov return (0); 242b2ad91f2SKonstantin Belousov } 243b2ad91f2SKonstantin Belousov int 244b2ad91f2SKonstantin Belousov taskqueue_enqueue(struct taskqueue *queue, struct task *task) 245b2ad91f2SKonstantin Belousov { 246b2ad91f2SKonstantin Belousov int res; 247b2ad91f2SKonstantin Belousov 248b2ad91f2SKonstantin Belousov TQ_LOCK(queue); 249b2ad91f2SKonstantin Belousov res = taskqueue_enqueue_locked(queue, task); 25018093155SAlexander Motin /* The lock is released inside. */ 251282873e2SJohn Baldwin 252b2ad91f2SKonstantin Belousov return (res); 253b2ad91f2SKonstantin Belousov } 254b2ad91f2SKonstantin Belousov 255b2ad91f2SKonstantin Belousov static void 256b2ad91f2SKonstantin Belousov taskqueue_timeout_func(void *arg) 257b2ad91f2SKonstantin Belousov { 258b2ad91f2SKonstantin Belousov struct taskqueue *queue; 259b2ad91f2SKonstantin Belousov struct timeout_task *timeout_task; 260b2ad91f2SKonstantin Belousov 261b2ad91f2SKonstantin Belousov timeout_task = arg; 262b2ad91f2SKonstantin Belousov queue = timeout_task->q; 263b2ad91f2SKonstantin Belousov KASSERT((timeout_task->f & DT_CALLOUT_ARMED) != 0, ("Stray timeout")); 264b2ad91f2SKonstantin Belousov timeout_task->f &= ~DT_CALLOUT_ARMED; 265b2ad91f2SKonstantin Belousov queue->tq_callouts--; 266b2ad91f2SKonstantin Belousov taskqueue_enqueue_locked(timeout_task->q, &timeout_task->t); 26718093155SAlexander Motin /* The lock is released inside. */ 268b2ad91f2SKonstantin Belousov } 269b2ad91f2SKonstantin Belousov 270b2ad91f2SKonstantin Belousov int 271b2ad91f2SKonstantin Belousov taskqueue_enqueue_timeout(struct taskqueue *queue, 272b2ad91f2SKonstantin Belousov struct timeout_task *timeout_task, int ticks) 273b2ad91f2SKonstantin Belousov { 274b2ad91f2SKonstantin Belousov int res; 275b2ad91f2SKonstantin Belousov 276b2ad91f2SKonstantin Belousov TQ_LOCK(queue); 277b2ad91f2SKonstantin Belousov KASSERT(timeout_task->q == NULL || timeout_task->q == queue, 278b2ad91f2SKonstantin Belousov ("Migrated queue")); 279b2ad91f2SKonstantin Belousov KASSERT(!queue->tq_spin, ("Timeout for spin-queue")); 280b2ad91f2SKonstantin Belousov timeout_task->q = queue; 281b2ad91f2SKonstantin Belousov res = timeout_task->t.ta_pending; 282b2ad91f2SKonstantin Belousov if (ticks == 0) { 283b2ad91f2SKonstantin Belousov taskqueue_enqueue_locked(queue, &timeout_task->t); 28418093155SAlexander Motin /* The lock is released inside. */ 285b2ad91f2SKonstantin Belousov } else { 286b2ad91f2SKonstantin Belousov if ((timeout_task->f & DT_CALLOUT_ARMED) != 0) { 287b2ad91f2SKonstantin Belousov res++; 288b2ad91f2SKonstantin Belousov } else { 289b2ad91f2SKonstantin Belousov queue->tq_callouts++; 290b2ad91f2SKonstantin Belousov timeout_task->f |= DT_CALLOUT_ARMED; 291b7c8d2f2SKonstantin Belousov if (ticks < 0) 292b7c8d2f2SKonstantin Belousov ticks = -ticks; /* Ignore overflow. */ 293b2ad91f2SKonstantin Belousov } 294b7c8d2f2SKonstantin Belousov if (ticks > 0) { 295b7c8d2f2SKonstantin Belousov callout_reset(&timeout_task->c, ticks, 296b7c8d2f2SKonstantin Belousov taskqueue_timeout_func, timeout_task); 297b7c8d2f2SKonstantin Belousov } 298b2ad91f2SKonstantin Belousov TQ_UNLOCK(queue); 2996d545f4cSAlexander Motin } 300b2ad91f2SKonstantin Belousov return (res); 301ca2e0534SDoug Rabson } 302ca2e0534SDoug Rabson 303ca2e0534SDoug Rabson void 304478cfc73SScott Long taskqueue_block(struct taskqueue *queue) 305478cfc73SScott Long { 306478cfc73SScott Long 307478cfc73SScott Long TQ_LOCK(queue); 308478cfc73SScott Long queue->tq_flags |= TQ_FLAGS_BLOCKED; 309478cfc73SScott Long TQ_UNLOCK(queue); 310478cfc73SScott Long } 311478cfc73SScott Long 312478cfc73SScott Long void 313478cfc73SScott Long taskqueue_unblock(struct taskqueue *queue) 314478cfc73SScott Long { 315478cfc73SScott Long 316478cfc73SScott Long TQ_LOCK(queue); 317478cfc73SScott Long queue->tq_flags &= ~TQ_FLAGS_BLOCKED; 3181d1e92f1SAlexander Motin if (!STAILQ_EMPTY(&queue->tq_queue)) 319478cfc73SScott Long queue->tq_enqueue(queue->tq_context); 320478cfc73SScott Long TQ_UNLOCK(queue); 321478cfc73SScott Long } 322478cfc73SScott Long 323bf73d4d2SMatthew D Fleming static void 324bf73d4d2SMatthew D Fleming taskqueue_run_locked(struct taskqueue *queue) 325ca2e0534SDoug Rabson { 326bf73d4d2SMatthew D Fleming struct taskqueue_busy tb; 327033459c8SMatthew D Fleming struct task *task; 328242ed5d9SMatthew D Fleming int pending; 329ca2e0534SDoug Rabson 330fdbc7174SWill Andrews TQ_ASSERT_LOCKED(queue); 331bf73d4d2SMatthew D Fleming tb.tb_running = NULL; 332bf73d4d2SMatthew D Fleming TAILQ_INSERT_TAIL(&queue->tq_active, &tb, tb_link); 333bf73d4d2SMatthew D Fleming 334ca2e0534SDoug Rabson while (STAILQ_FIRST(&queue->tq_queue)) { 335ca2e0534SDoug Rabson /* 336ca2e0534SDoug Rabson * Carefully remove the first task from the queue and 337ca2e0534SDoug Rabson * zero its pending count. 338ca2e0534SDoug Rabson */ 339ca2e0534SDoug Rabson task = STAILQ_FIRST(&queue->tq_queue); 340ca2e0534SDoug Rabson STAILQ_REMOVE_HEAD(&queue->tq_queue, ta_link); 341ca2e0534SDoug Rabson pending = task->ta_pending; 342ca2e0534SDoug Rabson task->ta_pending = 0; 343bf73d4d2SMatthew D Fleming tb.tb_running = task; 3449df1a6ddSScott Long TQ_UNLOCK(queue); 345ca2e0534SDoug Rabson 346282873e2SJohn Baldwin task->ta_func(task->ta_context, pending); 347ca2e0534SDoug Rabson 3489df1a6ddSScott Long TQ_LOCK(queue); 349bf73d4d2SMatthew D Fleming tb.tb_running = NULL; 35014889b42SWarner Losh wakeup(task); 351ca2e0534SDoug Rabson } 352bf73d4d2SMatthew D Fleming TAILQ_REMOVE(&queue->tq_active, &tb, tb_link); 353bf73d4d2SMatthew D Fleming } 354bf73d4d2SMatthew D Fleming 355bf73d4d2SMatthew D Fleming void 356bf73d4d2SMatthew D Fleming taskqueue_run(struct taskqueue *queue) 357bf73d4d2SMatthew D Fleming { 358bf73d4d2SMatthew D Fleming 359bf73d4d2SMatthew D Fleming TQ_LOCK(queue); 360bf73d4d2SMatthew D Fleming taskqueue_run_locked(queue); 361bf73d4d2SMatthew D Fleming TQ_UNLOCK(queue); 362bf73d4d2SMatthew D Fleming } 363bf73d4d2SMatthew D Fleming 364bf73d4d2SMatthew D Fleming static int 365bf73d4d2SMatthew D Fleming task_is_running(struct taskqueue *queue, struct task *task) 366bf73d4d2SMatthew D Fleming { 367bf73d4d2SMatthew D Fleming struct taskqueue_busy *tb; 368bf73d4d2SMatthew D Fleming 369fdbc7174SWill Andrews TQ_ASSERT_LOCKED(queue); 370bf73d4d2SMatthew D Fleming TAILQ_FOREACH(tb, &queue->tq_active, tb_link) { 371bf73d4d2SMatthew D Fleming if (tb->tb_running == task) 372bf73d4d2SMatthew D Fleming return (1); 373bf73d4d2SMatthew D Fleming } 374bf73d4d2SMatthew D Fleming return (0); 375ca2e0534SDoug Rabson } 376ca2e0534SDoug Rabson 377b2ad91f2SKonstantin Belousov static int 378b2ad91f2SKonstantin Belousov taskqueue_cancel_locked(struct taskqueue *queue, struct task *task, 379b2ad91f2SKonstantin Belousov u_int *pendp) 380b2ad91f2SKonstantin Belousov { 381b2ad91f2SKonstantin Belousov 382b2ad91f2SKonstantin Belousov if (task->ta_pending > 0) 383b2ad91f2SKonstantin Belousov STAILQ_REMOVE(&queue->tq_queue, task, task, ta_link); 384b2ad91f2SKonstantin Belousov if (pendp != NULL) 385b2ad91f2SKonstantin Belousov *pendp = task->ta_pending; 386b2ad91f2SKonstantin Belousov task->ta_pending = 0; 387b2ad91f2SKonstantin Belousov return (task_is_running(queue, task) ? EBUSY : 0); 388b2ad91f2SKonstantin Belousov } 389b2ad91f2SKonstantin Belousov 390f46276a9SMatthew D Fleming int 391f46276a9SMatthew D Fleming taskqueue_cancel(struct taskqueue *queue, struct task *task, u_int *pendp) 392f46276a9SMatthew D Fleming { 393f46276a9SMatthew D Fleming u_int pending; 394f46276a9SMatthew D Fleming int error; 395f46276a9SMatthew D Fleming 396f46276a9SMatthew D Fleming TQ_LOCK(queue); 397b2ad91f2SKonstantin Belousov pending = task->ta_pending; 398b2ad91f2SKonstantin Belousov error = taskqueue_cancel_locked(queue, task, pendp); 399b2ad91f2SKonstantin Belousov TQ_UNLOCK(queue); 400b2ad91f2SKonstantin Belousov 401b2ad91f2SKonstantin Belousov return (error); 402b2ad91f2SKonstantin Belousov } 403b2ad91f2SKonstantin Belousov 404b2ad91f2SKonstantin Belousov int 405b2ad91f2SKonstantin Belousov taskqueue_cancel_timeout(struct taskqueue *queue, 406b2ad91f2SKonstantin Belousov struct timeout_task *timeout_task, u_int *pendp) 407b2ad91f2SKonstantin Belousov { 408b2ad91f2SKonstantin Belousov u_int pending, pending1; 409b2ad91f2SKonstantin Belousov int error; 410b2ad91f2SKonstantin Belousov 411b2ad91f2SKonstantin Belousov TQ_LOCK(queue); 412b2ad91f2SKonstantin Belousov pending = !!callout_stop(&timeout_task->c); 413b2ad91f2SKonstantin Belousov error = taskqueue_cancel_locked(queue, &timeout_task->t, &pending1); 414b2ad91f2SKonstantin Belousov if ((timeout_task->f & DT_CALLOUT_ARMED) != 0) { 415b2ad91f2SKonstantin Belousov timeout_task->f &= ~DT_CALLOUT_ARMED; 416b2ad91f2SKonstantin Belousov queue->tq_callouts--; 417b2ad91f2SKonstantin Belousov } 418f46276a9SMatthew D Fleming TQ_UNLOCK(queue); 419f46276a9SMatthew D Fleming 420f46276a9SMatthew D Fleming if (pendp != NULL) 421b2ad91f2SKonstantin Belousov *pendp = pending + pending1; 422f46276a9SMatthew D Fleming return (error); 423f46276a9SMatthew D Fleming } 424f46276a9SMatthew D Fleming 42514889b42SWarner Losh void 42614889b42SWarner Losh taskqueue_drain(struct taskqueue *queue, struct task *task) 42714889b42SWarner Losh { 4283d336cd0SPawel Jakub Dawidek 4293d336cd0SPawel Jakub Dawidek if (!queue->tq_spin) 4309df1a6ddSScott Long WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, NULL, __func__); 43152bc746aSSam Leffler 4323d336cd0SPawel Jakub Dawidek TQ_LOCK(queue); 433bf73d4d2SMatthew D Fleming while (task->ta_pending != 0 || task_is_running(queue, task)) 4343d336cd0SPawel Jakub Dawidek TQ_SLEEP(queue, task, &queue->tq_mutex, PWAIT, "-", 0); 4353d336cd0SPawel Jakub Dawidek TQ_UNLOCK(queue); 4369df1a6ddSScott Long } 43714889b42SWarner Losh 438b2ad91f2SKonstantin Belousov void 439b2ad91f2SKonstantin Belousov taskqueue_drain_timeout(struct taskqueue *queue, 440b2ad91f2SKonstantin Belousov struct timeout_task *timeout_task) 441b2ad91f2SKonstantin Belousov { 442b2ad91f2SKonstantin Belousov 443b2ad91f2SKonstantin Belousov callout_drain(&timeout_task->c); 444b2ad91f2SKonstantin Belousov taskqueue_drain(queue, &timeout_task->t); 445b2ad91f2SKonstantin Belousov } 446b2ad91f2SKonstantin Belousov 447ca2e0534SDoug Rabson static void 448ca2e0534SDoug Rabson taskqueue_swi_enqueue(void *context) 449ca2e0534SDoug Rabson { 450c86b6ff5SJohn Baldwin swi_sched(taskqueue_ih, 0); 451ca2e0534SDoug Rabson } 452ca2e0534SDoug Rabson 453ca2e0534SDoug Rabson static void 4548088699fSJohn Baldwin taskqueue_swi_run(void *dummy) 455ca2e0534SDoug Rabson { 456bf73d4d2SMatthew D Fleming taskqueue_run(taskqueue_swi); 457ca2e0534SDoug Rabson } 458ca2e0534SDoug Rabson 4597874f606SScott Long static void 4607874f606SScott Long taskqueue_swi_giant_enqueue(void *context) 4617874f606SScott Long { 4627874f606SScott Long swi_sched(taskqueue_giant_ih, 0); 4637874f606SScott Long } 4647874f606SScott Long 4657874f606SScott Long static void 4667874f606SScott Long taskqueue_swi_giant_run(void *dummy) 4677874f606SScott Long { 468bf73d4d2SMatthew D Fleming taskqueue_run(taskqueue_swi_giant); 4697874f606SScott Long } 4707874f606SScott Long 4710f92108dSScott Long int 4720f92108dSScott Long taskqueue_start_threads(struct taskqueue **tqp, int count, int pri, 4730f92108dSScott Long const char *name, ...) 4740f92108dSScott Long { 4750f92108dSScott Long va_list ap; 47675b773aeSSam Leffler struct thread *td; 477175611b6SSam Leffler struct taskqueue *tq; 47800537061SSam Leffler int i, error; 4795ca4819dSJohn Baldwin char ktname[MAXCOMLEN + 1]; 4800f92108dSScott Long 4810f92108dSScott Long if (count <= 0) 4820f92108dSScott Long return (EINVAL); 483175611b6SSam Leffler 4840f92108dSScott Long tq = *tqp; 4850f92108dSScott Long 4860f92108dSScott Long va_start(ap, name); 4875ca4819dSJohn Baldwin vsnprintf(ktname, sizeof(ktname), name, ap); 4880f92108dSScott Long va_end(ap); 4890f92108dSScott Long 490175611b6SSam Leffler tq->tq_threads = malloc(sizeof(struct thread *) * count, M_TASKQUEUE, 49100537061SSam Leffler M_NOWAIT | M_ZERO); 492175611b6SSam Leffler if (tq->tq_threads == NULL) { 49300537061SSam Leffler printf("%s: no memory for %s threads\n", __func__, ktname); 49400537061SSam Leffler return (ENOMEM); 49500537061SSam Leffler } 49600537061SSam Leffler 4970f92108dSScott Long for (i = 0; i < count; i++) { 4980f92108dSScott Long if (count == 1) 499175611b6SSam Leffler error = kthread_add(taskqueue_thread_loop, tqp, NULL, 5001bdfff22SAndriy Gapon &tq->tq_threads[i], RFSTOPPED, 0, "%s", ktname); 5010f92108dSScott Long else 502175611b6SSam Leffler error = kthread_add(taskqueue_thread_loop, tqp, NULL, 503175611b6SSam Leffler &tq->tq_threads[i], RFSTOPPED, 0, 504175611b6SSam Leffler "%s_%d", ktname, i); 50575b773aeSSam Leffler if (error) { 50600537061SSam Leffler /* should be ok to continue, taskqueue_free will dtrt */ 507175611b6SSam Leffler printf("%s: kthread_add(%s): error %d", __func__, 508175611b6SSam Leffler ktname, error); 509175611b6SSam Leffler tq->tq_threads[i] = NULL; /* paranoid */ 51075b773aeSSam Leffler } else 511175611b6SSam Leffler tq->tq_tcount++; 51200537061SSam Leffler } 51375b773aeSSam Leffler for (i = 0; i < count; i++) { 514175611b6SSam Leffler if (tq->tq_threads[i] == NULL) 51575b773aeSSam Leffler continue; 516175611b6SSam Leffler td = tq->tq_threads[i]; 517982d11f8SJeff Roberson thread_lock(td); 51875b773aeSSam Leffler sched_prio(td, pri); 519f0393f06SJeff Roberson sched_add(td, SRQ_BORING); 520982d11f8SJeff Roberson thread_unlock(td); 5210f92108dSScott Long } 5220f92108dSScott Long 5230f92108dSScott Long return (0); 5240f92108dSScott Long } 5250f92108dSScott Long 526fdbc7174SWill Andrews static inline void 527fdbc7174SWill Andrews taskqueue_run_callback(struct taskqueue *tq, 528fdbc7174SWill Andrews enum taskqueue_callback_type cb_type) 529fdbc7174SWill Andrews { 530fdbc7174SWill Andrews taskqueue_callback_fn tq_callback; 531fdbc7174SWill Andrews 532fdbc7174SWill Andrews TQ_ASSERT_UNLOCKED(tq); 533fdbc7174SWill Andrews tq_callback = tq->tq_callbacks[cb_type]; 534fdbc7174SWill Andrews if (tq_callback != NULL) 535fdbc7174SWill Andrews tq_callback(tq->tq_cb_contexts[cb_type]); 536fdbc7174SWill Andrews } 537fdbc7174SWill Andrews 538227559d1SJohn-Mark Gurney void 539227559d1SJohn-Mark Gurney taskqueue_thread_loop(void *arg) 540cb32189eSKenneth D. Merry { 541227559d1SJohn-Mark Gurney struct taskqueue **tqp, *tq; 542bd83e879SJohn Baldwin 543227559d1SJohn-Mark Gurney tqp = arg; 544227559d1SJohn-Mark Gurney tq = *tqp; 545fdbc7174SWill Andrews taskqueue_run_callback(tq, TASKQUEUE_CALLBACK_TYPE_INIT); 5469df1a6ddSScott Long TQ_LOCK(tq); 54724ef0701SAndrew Thompson while ((tq->tq_flags & TQ_FLAGS_ACTIVE) != 0) { 548bf73d4d2SMatthew D Fleming taskqueue_run_locked(tq); 5496a3b2893SPawel Jakub Dawidek /* 5506a3b2893SPawel Jakub Dawidek * Because taskqueue_run() can drop tq_mutex, we need to 5516a3b2893SPawel Jakub Dawidek * check if the TQ_FLAGS_ACTIVE flag wasn't removed in the 5526a3b2893SPawel Jakub Dawidek * meantime, which means we missed a wakeup. 5536a3b2893SPawel Jakub Dawidek */ 5546a3b2893SPawel Jakub Dawidek if ((tq->tq_flags & TQ_FLAGS_ACTIVE) == 0) 5556a3b2893SPawel Jakub Dawidek break; 5560f180a7cSJohn Baldwin TQ_SLEEP(tq, tq, &tq->tq_mutex, 0, "-", 0); 557a1797ef6SAndrew Thompson } 558bf73d4d2SMatthew D Fleming taskqueue_run_locked(tq); 55952bc746aSSam Leffler 560fdbc7174SWill Andrews /* 561fdbc7174SWill Andrews * This thread is on its way out, so just drop the lock temporarily 562fdbc7174SWill Andrews * in order to call the shutdown callback. This allows the callback 563fdbc7174SWill Andrews * to look at the taskqueue, even just before it dies. 564fdbc7174SWill Andrews */ 565fdbc7174SWill Andrews TQ_UNLOCK(tq); 566fdbc7174SWill Andrews taskqueue_run_callback(tq, TASKQUEUE_CALLBACK_TYPE_SHUTDOWN); 567fdbc7174SWill Andrews TQ_LOCK(tq); 568fdbc7174SWill Andrews 56952bc746aSSam Leffler /* rendezvous with thread that asked us to terminate */ 570175611b6SSam Leffler tq->tq_tcount--; 571175611b6SSam Leffler wakeup_one(tq->tq_threads); 5729df1a6ddSScott Long TQ_UNLOCK(tq); 57303c7442dSJohn Baldwin kthread_exit(); 574cb32189eSKenneth D. Merry } 575cb32189eSKenneth D. Merry 576227559d1SJohn-Mark Gurney void 577cb32189eSKenneth D. Merry taskqueue_thread_enqueue(void *context) 578cb32189eSKenneth D. Merry { 579227559d1SJohn-Mark Gurney struct taskqueue **tqp, *tq; 580bd83e879SJohn Baldwin 581227559d1SJohn-Mark Gurney tqp = context; 582227559d1SJohn-Mark Gurney tq = *tqp; 583227559d1SJohn-Mark Gurney 58452bc746aSSam Leffler wakeup_one(tq); 585cb32189eSKenneth D. Merry } 586cb32189eSKenneth D. Merry 587d710cae7SWarner Losh TASKQUEUE_DEFINE(swi, taskqueue_swi_enqueue, NULL, 5887874f606SScott Long swi_add(NULL, "task queue", taskqueue_swi_run, NULL, SWI_TQ, 5897874f606SScott Long INTR_MPSAFE, &taskqueue_ih)); 5907874f606SScott Long 591d710cae7SWarner Losh TASKQUEUE_DEFINE(swi_giant, taskqueue_swi_giant_enqueue, NULL, 5926caf758eSJohn Baldwin swi_add(NULL, "Giant taskq", taskqueue_swi_giant_run, 5937874f606SScott Long NULL, SWI_TQ_GIANT, 0, &taskqueue_giant_ih)); 594cb32189eSKenneth D. Merry 595227559d1SJohn-Mark Gurney TASKQUEUE_DEFINE_THREAD(thread); 596f82c9e70SSam Leffler 5979df1a6ddSScott Long struct taskqueue * 5989df1a6ddSScott Long taskqueue_create_fast(const char *name, int mflags, 5990f92108dSScott Long taskqueue_enqueue_fn enqueue, void *context) 6009df1a6ddSScott Long { 6010f92108dSScott Long return _taskqueue_create(name, mflags, enqueue, context, 6029df1a6ddSScott Long MTX_SPIN, "fast_taskqueue"); 6039df1a6ddSScott Long } 6049df1a6ddSScott Long 6059df1a6ddSScott Long /* NB: for backwards compatibility */ 606f82c9e70SSam Leffler int 607f82c9e70SSam Leffler taskqueue_enqueue_fast(struct taskqueue *queue, struct task *task) 608f82c9e70SSam Leffler { 6099df1a6ddSScott Long return taskqueue_enqueue(queue, task); 610f82c9e70SSam Leffler } 611f82c9e70SSam Leffler 612f82c9e70SSam Leffler static void *taskqueue_fast_ih; 613f82c9e70SSam Leffler 614f82c9e70SSam Leffler static void 6159df1a6ddSScott Long taskqueue_fast_enqueue(void *context) 616f82c9e70SSam Leffler { 617f82c9e70SSam Leffler swi_sched(taskqueue_fast_ih, 0); 618f82c9e70SSam Leffler } 619f82c9e70SSam Leffler 620f82c9e70SSam Leffler static void 621f82c9e70SSam Leffler taskqueue_fast_run(void *dummy) 622f82c9e70SSam Leffler { 623bf73d4d2SMatthew D Fleming taskqueue_run(taskqueue_fast); 624f82c9e70SSam Leffler } 625f82c9e70SSam Leffler 626d710cae7SWarner Losh TASKQUEUE_FAST_DEFINE(fast, taskqueue_fast_enqueue, NULL, 62710f0ab39SJohn Baldwin swi_add(NULL, "fast taskq", taskqueue_fast_run, NULL, 6289df1a6ddSScott Long SWI_TQ_FAST, INTR_MPSAFE, &taskqueue_fast_ih)); 629159ef108SPawel Jakub Dawidek 630159ef108SPawel Jakub Dawidek int 631159ef108SPawel Jakub Dawidek taskqueue_member(struct taskqueue *queue, struct thread *td) 632159ef108SPawel Jakub Dawidek { 633159ef108SPawel Jakub Dawidek int i, j, ret = 0; 634159ef108SPawel Jakub Dawidek 635159ef108SPawel Jakub Dawidek for (i = 0, j = 0; ; i++) { 636159ef108SPawel Jakub Dawidek if (queue->tq_threads[i] == NULL) 637159ef108SPawel Jakub Dawidek continue; 638159ef108SPawel Jakub Dawidek if (queue->tq_threads[i] == td) { 639159ef108SPawel Jakub Dawidek ret = 1; 640159ef108SPawel Jakub Dawidek break; 641159ef108SPawel Jakub Dawidek } 642159ef108SPawel Jakub Dawidek if (++j >= queue->tq_tcount) 643159ef108SPawel Jakub Dawidek break; 644159ef108SPawel Jakub Dawidek } 645159ef108SPawel Jakub Dawidek return (ret); 646159ef108SPawel Jakub Dawidek } 647