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; 498088699fSJohn Baldwin 50bf73d4d2SMatthew D Fleming struct taskqueue_busy { 51bf73d4d2SMatthew D Fleming struct task *tb_running; 52bf73d4d2SMatthew D Fleming TAILQ_ENTRY(taskqueue_busy) tb_link; 53bf73d4d2SMatthew D Fleming }; 54bf73d4d2SMatthew D Fleming 55ca2e0534SDoug Rabson struct taskqueue { 56ca2e0534SDoug Rabson STAILQ_HEAD(, task) tq_queue; 57ca2e0534SDoug Rabson taskqueue_enqueue_fn tq_enqueue; 58ca2e0534SDoug Rabson void *tq_context; 59bf73d4d2SMatthew D Fleming TAILQ_HEAD(, taskqueue_busy) tq_active; 601de1c550SJohn Baldwin struct mtx tq_mutex; 61175611b6SSam Leffler struct thread **tq_threads; 62175611b6SSam Leffler int tq_tcount; 63694382c8SKip Macy int tq_spin; 640f92108dSScott Long int tq_flags; 65b2ad91f2SKonstantin Belousov int tq_callouts; 66ca2e0534SDoug Rabson }; 67ca2e0534SDoug Rabson 680f92108dSScott Long #define TQ_FLAGS_ACTIVE (1 << 0) 69478cfc73SScott Long #define TQ_FLAGS_BLOCKED (1 << 1) 70478cfc73SScott Long #define TQ_FLAGS_PENDING (1 << 2) 710f92108dSScott Long 72b2ad91f2SKonstantin Belousov #define DT_CALLOUT_ARMED (1 << 0) 73b2ad91f2SKonstantin Belousov 74b79b28b6SJuli Mallett #define TQ_LOCK(tq) \ 75b79b28b6SJuli Mallett do { \ 76b79b28b6SJuli Mallett if ((tq)->tq_spin) \ 77b79b28b6SJuli Mallett mtx_lock_spin(&(tq)->tq_mutex); \ 78b79b28b6SJuli Mallett else \ 79b79b28b6SJuli Mallett mtx_lock(&(tq)->tq_mutex); \ 80b79b28b6SJuli Mallett } while (0) 819df1a6ddSScott Long 82b79b28b6SJuli Mallett #define TQ_UNLOCK(tq) \ 83b79b28b6SJuli Mallett do { \ 84b79b28b6SJuli Mallett if ((tq)->tq_spin) \ 85b79b28b6SJuli Mallett mtx_unlock_spin(&(tq)->tq_mutex); \ 86b79b28b6SJuli Mallett else \ 87b79b28b6SJuli Mallett mtx_unlock(&(tq)->tq_mutex); \ 88b79b28b6SJuli Mallett } while (0) 899df1a6ddSScott Long 90b2ad91f2SKonstantin Belousov void 91b2ad91f2SKonstantin Belousov _timeout_task_init(struct taskqueue *queue, struct timeout_task *timeout_task, 92b2ad91f2SKonstantin Belousov int priority, task_fn_t func, void *context) 93b2ad91f2SKonstantin Belousov { 94b2ad91f2SKonstantin Belousov 95b2ad91f2SKonstantin Belousov TASK_INIT(&timeout_task->t, priority, func, context); 96b2ad91f2SKonstantin Belousov callout_init_mtx(&timeout_task->c, &queue->tq_mutex, 0); 97b2ad91f2SKonstantin Belousov timeout_task->q = queue; 98b2ad91f2SKonstantin Belousov timeout_task->f = 0; 99b2ad91f2SKonstantin Belousov } 100b2ad91f2SKonstantin Belousov 1019df1a6ddSScott Long static __inline int 1029df1a6ddSScott Long TQ_SLEEP(struct taskqueue *tq, void *p, struct mtx *m, int pri, const char *wm, 1039df1a6ddSScott Long int t) 1049df1a6ddSScott Long { 105694382c8SKip Macy if (tq->tq_spin) 1069df1a6ddSScott Long return (msleep_spin(p, m, wm, t)); 1079df1a6ddSScott Long return (msleep(p, m, pri, wm, t)); 1089df1a6ddSScott Long } 1099df1a6ddSScott Long 1109df1a6ddSScott Long static struct taskqueue * 111706b0d31SAndriy Gapon _taskqueue_create(const char *name __unused, int mflags, 11252bc746aSSam Leffler taskqueue_enqueue_fn enqueue, void *context, 1139df1a6ddSScott Long int mtxflags, const char *mtxname) 114ca2e0534SDoug Rabson { 115ca2e0534SDoug Rabson struct taskqueue *queue; 116ca2e0534SDoug Rabson 1171de1c550SJohn Baldwin queue = malloc(sizeof(struct taskqueue), M_TASKQUEUE, mflags | M_ZERO); 118ca2e0534SDoug Rabson if (!queue) 119d710cae7SWarner Losh return NULL; 120694382c8SKip Macy 121ca2e0534SDoug Rabson STAILQ_INIT(&queue->tq_queue); 122bf73d4d2SMatthew D Fleming TAILQ_INIT(&queue->tq_active); 123ca2e0534SDoug Rabson queue->tq_enqueue = enqueue; 124ca2e0534SDoug Rabson queue->tq_context = context; 125694382c8SKip Macy queue->tq_spin = (mtxflags & MTX_SPIN) != 0; 126694382c8SKip Macy queue->tq_flags |= TQ_FLAGS_ACTIVE; 1279df1a6ddSScott Long mtx_init(&queue->tq_mutex, mtxname, NULL, mtxflags); 128ca2e0534SDoug Rabson 129ca2e0534SDoug Rabson return queue; 130ca2e0534SDoug Rabson } 131ca2e0534SDoug Rabson 1329df1a6ddSScott Long struct taskqueue * 1339df1a6ddSScott Long taskqueue_create(const char *name, int mflags, 1340f92108dSScott Long taskqueue_enqueue_fn enqueue, void *context) 1359df1a6ddSScott Long { 1360f92108dSScott Long return _taskqueue_create(name, mflags, enqueue, context, 1379df1a6ddSScott Long MTX_DEF, "taskqueue"); 1389df1a6ddSScott Long } 1399df1a6ddSScott Long 14052bc746aSSam Leffler /* 14152bc746aSSam Leffler * Signal a taskqueue thread to terminate. 14252bc746aSSam Leffler */ 14352bc746aSSam Leffler static void 144175611b6SSam Leffler taskqueue_terminate(struct thread **pp, struct taskqueue *tq) 14552bc746aSSam Leffler { 14652bc746aSSam Leffler 147b2ad91f2SKonstantin Belousov while (tq->tq_tcount > 0 || tq->tq_callouts > 0) { 1480f92108dSScott Long wakeup(tq); 1490f92108dSScott Long TQ_SLEEP(tq, pp, &tq->tq_mutex, PWAIT, "taskqueue_destroy", 0); 15052bc746aSSam Leffler } 15152bc746aSSam Leffler } 15252bc746aSSam Leffler 153ca2e0534SDoug Rabson void 154ca2e0534SDoug Rabson taskqueue_free(struct taskqueue *queue) 155ca2e0534SDoug Rabson { 1561de1c550SJohn Baldwin 1579df1a6ddSScott Long TQ_LOCK(queue); 1580f92108dSScott Long queue->tq_flags &= ~TQ_FLAGS_ACTIVE; 159175611b6SSam Leffler taskqueue_terminate(queue->tq_threads, queue); 160bf73d4d2SMatthew D Fleming KASSERT(TAILQ_EMPTY(&queue->tq_active), ("Tasks still running?")); 161b2ad91f2SKonstantin Belousov KASSERT(queue->tq_callouts == 0, ("Armed timeout tasks")); 1621de1c550SJohn Baldwin mtx_destroy(&queue->tq_mutex); 163175611b6SSam Leffler free(queue->tq_threads, M_TASKQUEUE); 164ca2e0534SDoug Rabson free(queue, M_TASKQUEUE); 165ca2e0534SDoug Rabson } 166ca2e0534SDoug Rabson 167b2ad91f2SKonstantin Belousov static int 168b2ad91f2SKonstantin Belousov taskqueue_enqueue_locked(struct taskqueue *queue, struct task *task) 169ca2e0534SDoug Rabson { 170ca2e0534SDoug Rabson struct task *ins; 171ca2e0534SDoug Rabson struct task *prev; 172ca2e0534SDoug Rabson 173ca2e0534SDoug Rabson /* 174ca2e0534SDoug Rabson * Count multiple enqueues. 175ca2e0534SDoug Rabson */ 176694382c8SKip Macy if (task->ta_pending) { 177d2849f27SAdrian Chadd if (task->ta_pending < USHRT_MAX) 178ca2e0534SDoug Rabson task->ta_pending++; 179b2ad91f2SKonstantin Belousov return (0); 180ca2e0534SDoug Rabson } 181ca2e0534SDoug Rabson 182ca2e0534SDoug Rabson /* 183ca2e0534SDoug Rabson * Optimise the case when all tasks have the same priority. 184ca2e0534SDoug Rabson */ 18551b86781SJeffrey Hsu prev = STAILQ_LAST(&queue->tq_queue, task, ta_link); 186ca2e0534SDoug Rabson if (!prev || prev->ta_priority >= task->ta_priority) { 187ca2e0534SDoug Rabson STAILQ_INSERT_TAIL(&queue->tq_queue, task, ta_link); 188ca2e0534SDoug Rabson } else { 189d710cae7SWarner Losh prev = NULL; 190ca2e0534SDoug Rabson for (ins = STAILQ_FIRST(&queue->tq_queue); ins; 191ca2e0534SDoug Rabson prev = ins, ins = STAILQ_NEXT(ins, ta_link)) 192ca2e0534SDoug Rabson if (ins->ta_priority < task->ta_priority) 193ca2e0534SDoug Rabson break; 194ca2e0534SDoug Rabson 195ca2e0534SDoug Rabson if (prev) 196ca2e0534SDoug Rabson STAILQ_INSERT_AFTER(&queue->tq_queue, prev, task, ta_link); 197ca2e0534SDoug Rabson else 198ca2e0534SDoug Rabson STAILQ_INSERT_HEAD(&queue->tq_queue, task, ta_link); 199ca2e0534SDoug Rabson } 200ca2e0534SDoug Rabson 201ca2e0534SDoug Rabson task->ta_pending = 1; 202694382c8SKip Macy if ((queue->tq_flags & TQ_FLAGS_BLOCKED) == 0) 203ca2e0534SDoug Rabson queue->tq_enqueue(queue->tq_context); 204694382c8SKip Macy else 205478cfc73SScott Long queue->tq_flags |= TQ_FLAGS_PENDING; 206282873e2SJohn Baldwin 207b2ad91f2SKonstantin Belousov return (0); 208b2ad91f2SKonstantin Belousov } 209b2ad91f2SKonstantin Belousov int 210b2ad91f2SKonstantin Belousov taskqueue_enqueue(struct taskqueue *queue, struct task *task) 211b2ad91f2SKonstantin Belousov { 212b2ad91f2SKonstantin Belousov int res; 213b2ad91f2SKonstantin Belousov 214b2ad91f2SKonstantin Belousov TQ_LOCK(queue); 215b2ad91f2SKonstantin Belousov res = taskqueue_enqueue_locked(queue, task); 2169df1a6ddSScott Long TQ_UNLOCK(queue); 217282873e2SJohn Baldwin 218b2ad91f2SKonstantin Belousov return (res); 219b2ad91f2SKonstantin Belousov } 220b2ad91f2SKonstantin Belousov 221b2ad91f2SKonstantin Belousov static void 222b2ad91f2SKonstantin Belousov taskqueue_timeout_func(void *arg) 223b2ad91f2SKonstantin Belousov { 224b2ad91f2SKonstantin Belousov struct taskqueue *queue; 225b2ad91f2SKonstantin Belousov struct timeout_task *timeout_task; 226b2ad91f2SKonstantin Belousov 227b2ad91f2SKonstantin Belousov timeout_task = arg; 228b2ad91f2SKonstantin Belousov queue = timeout_task->q; 229b2ad91f2SKonstantin Belousov KASSERT((timeout_task->f & DT_CALLOUT_ARMED) != 0, ("Stray timeout")); 230b2ad91f2SKonstantin Belousov timeout_task->f &= ~DT_CALLOUT_ARMED; 231b2ad91f2SKonstantin Belousov queue->tq_callouts--; 232b2ad91f2SKonstantin Belousov taskqueue_enqueue_locked(timeout_task->q, &timeout_task->t); 233b2ad91f2SKonstantin Belousov } 234b2ad91f2SKonstantin Belousov 235b2ad91f2SKonstantin Belousov int 236b2ad91f2SKonstantin Belousov taskqueue_enqueue_timeout(struct taskqueue *queue, 237b2ad91f2SKonstantin Belousov struct timeout_task *timeout_task, int ticks) 238b2ad91f2SKonstantin Belousov { 239b2ad91f2SKonstantin Belousov int res; 240b2ad91f2SKonstantin Belousov 241b2ad91f2SKonstantin Belousov TQ_LOCK(queue); 242b2ad91f2SKonstantin Belousov KASSERT(timeout_task->q == NULL || timeout_task->q == queue, 243b2ad91f2SKonstantin Belousov ("Migrated queue")); 244b2ad91f2SKonstantin Belousov KASSERT(!queue->tq_spin, ("Timeout for spin-queue")); 245b2ad91f2SKonstantin Belousov timeout_task->q = queue; 246b2ad91f2SKonstantin Belousov res = timeout_task->t.ta_pending; 247b2ad91f2SKonstantin Belousov if (ticks == 0) { 248b2ad91f2SKonstantin Belousov taskqueue_enqueue_locked(queue, &timeout_task->t); 249b2ad91f2SKonstantin Belousov } else { 250b2ad91f2SKonstantin Belousov if ((timeout_task->f & DT_CALLOUT_ARMED) != 0) { 251b2ad91f2SKonstantin Belousov res++; 252b2ad91f2SKonstantin Belousov } else { 253b2ad91f2SKonstantin Belousov queue->tq_callouts++; 254b2ad91f2SKonstantin Belousov timeout_task->f |= DT_CALLOUT_ARMED; 255b2ad91f2SKonstantin Belousov } 256b2ad91f2SKonstantin Belousov callout_reset(&timeout_task->c, ticks, taskqueue_timeout_func, 257b2ad91f2SKonstantin Belousov timeout_task); 258b2ad91f2SKonstantin Belousov } 259b2ad91f2SKonstantin Belousov TQ_UNLOCK(queue); 260b2ad91f2SKonstantin Belousov return (res); 261ca2e0534SDoug Rabson } 262ca2e0534SDoug Rabson 263ca2e0534SDoug Rabson void 264478cfc73SScott Long taskqueue_block(struct taskqueue *queue) 265478cfc73SScott Long { 266478cfc73SScott Long 267478cfc73SScott Long TQ_LOCK(queue); 268478cfc73SScott Long queue->tq_flags |= TQ_FLAGS_BLOCKED; 269478cfc73SScott Long TQ_UNLOCK(queue); 270478cfc73SScott Long } 271478cfc73SScott Long 272478cfc73SScott Long void 273478cfc73SScott Long taskqueue_unblock(struct taskqueue *queue) 274478cfc73SScott Long { 275478cfc73SScott Long 276478cfc73SScott Long TQ_LOCK(queue); 277478cfc73SScott Long queue->tq_flags &= ~TQ_FLAGS_BLOCKED; 278478cfc73SScott Long if (queue->tq_flags & TQ_FLAGS_PENDING) { 279478cfc73SScott Long queue->tq_flags &= ~TQ_FLAGS_PENDING; 280478cfc73SScott Long queue->tq_enqueue(queue->tq_context); 281478cfc73SScott Long } 282478cfc73SScott Long TQ_UNLOCK(queue); 283478cfc73SScott Long } 284478cfc73SScott Long 285bf73d4d2SMatthew D Fleming static void 286bf73d4d2SMatthew D Fleming taskqueue_run_locked(struct taskqueue *queue) 287ca2e0534SDoug Rabson { 288bf73d4d2SMatthew D Fleming struct taskqueue_busy tb; 289033459c8SMatthew D Fleming struct task *task; 290242ed5d9SMatthew D Fleming int pending; 291ca2e0534SDoug Rabson 292242ed5d9SMatthew D Fleming mtx_assert(&queue->tq_mutex, MA_OWNED); 293bf73d4d2SMatthew D Fleming tb.tb_running = NULL; 294bf73d4d2SMatthew D Fleming TAILQ_INSERT_TAIL(&queue->tq_active, &tb, tb_link); 295bf73d4d2SMatthew D Fleming 296ca2e0534SDoug Rabson while (STAILQ_FIRST(&queue->tq_queue)) { 297ca2e0534SDoug Rabson /* 298ca2e0534SDoug Rabson * Carefully remove the first task from the queue and 299ca2e0534SDoug Rabson * zero its pending count. 300ca2e0534SDoug Rabson */ 301ca2e0534SDoug Rabson task = STAILQ_FIRST(&queue->tq_queue); 302ca2e0534SDoug Rabson STAILQ_REMOVE_HEAD(&queue->tq_queue, ta_link); 303ca2e0534SDoug Rabson pending = task->ta_pending; 304ca2e0534SDoug Rabson task->ta_pending = 0; 305bf73d4d2SMatthew D Fleming tb.tb_running = task; 3069df1a6ddSScott Long TQ_UNLOCK(queue); 307ca2e0534SDoug Rabson 308282873e2SJohn Baldwin task->ta_func(task->ta_context, pending); 309ca2e0534SDoug Rabson 3109df1a6ddSScott Long TQ_LOCK(queue); 311bf73d4d2SMatthew D Fleming tb.tb_running = NULL; 31214889b42SWarner Losh wakeup(task); 313ca2e0534SDoug Rabson } 314bf73d4d2SMatthew D Fleming TAILQ_REMOVE(&queue->tq_active, &tb, tb_link); 315bf73d4d2SMatthew D Fleming } 316bf73d4d2SMatthew D Fleming 317bf73d4d2SMatthew D Fleming void 318bf73d4d2SMatthew D Fleming taskqueue_run(struct taskqueue *queue) 319bf73d4d2SMatthew D Fleming { 320bf73d4d2SMatthew D Fleming 321bf73d4d2SMatthew D Fleming TQ_LOCK(queue); 322bf73d4d2SMatthew D Fleming taskqueue_run_locked(queue); 323bf73d4d2SMatthew D Fleming TQ_UNLOCK(queue); 324bf73d4d2SMatthew D Fleming } 325bf73d4d2SMatthew D Fleming 326bf73d4d2SMatthew D Fleming static int 327bf73d4d2SMatthew D Fleming task_is_running(struct taskqueue *queue, struct task *task) 328bf73d4d2SMatthew D Fleming { 329bf73d4d2SMatthew D Fleming struct taskqueue_busy *tb; 330bf73d4d2SMatthew D Fleming 331bf73d4d2SMatthew D Fleming mtx_assert(&queue->tq_mutex, MA_OWNED); 332bf73d4d2SMatthew D Fleming TAILQ_FOREACH(tb, &queue->tq_active, tb_link) { 333bf73d4d2SMatthew D Fleming if (tb->tb_running == task) 334bf73d4d2SMatthew D Fleming return (1); 335bf73d4d2SMatthew D Fleming } 336bf73d4d2SMatthew D Fleming return (0); 337ca2e0534SDoug Rabson } 338ca2e0534SDoug Rabson 339b2ad91f2SKonstantin Belousov static int 340b2ad91f2SKonstantin Belousov taskqueue_cancel_locked(struct taskqueue *queue, struct task *task, 341b2ad91f2SKonstantin Belousov u_int *pendp) 342b2ad91f2SKonstantin Belousov { 343b2ad91f2SKonstantin Belousov 344b2ad91f2SKonstantin Belousov if (task->ta_pending > 0) 345b2ad91f2SKonstantin Belousov STAILQ_REMOVE(&queue->tq_queue, task, task, ta_link); 346b2ad91f2SKonstantin Belousov if (pendp != NULL) 347b2ad91f2SKonstantin Belousov *pendp = task->ta_pending; 348b2ad91f2SKonstantin Belousov task->ta_pending = 0; 349b2ad91f2SKonstantin Belousov return (task_is_running(queue, task) ? EBUSY : 0); 350b2ad91f2SKonstantin Belousov } 351b2ad91f2SKonstantin Belousov 352f46276a9SMatthew D Fleming int 353f46276a9SMatthew D Fleming taskqueue_cancel(struct taskqueue *queue, struct task *task, u_int *pendp) 354f46276a9SMatthew D Fleming { 355f46276a9SMatthew D Fleming u_int pending; 356f46276a9SMatthew D Fleming int error; 357f46276a9SMatthew D Fleming 358f46276a9SMatthew D Fleming TQ_LOCK(queue); 359b2ad91f2SKonstantin Belousov pending = task->ta_pending; 360b2ad91f2SKonstantin Belousov error = taskqueue_cancel_locked(queue, task, pendp); 361b2ad91f2SKonstantin Belousov TQ_UNLOCK(queue); 362b2ad91f2SKonstantin Belousov 363b2ad91f2SKonstantin Belousov return (error); 364b2ad91f2SKonstantin Belousov } 365b2ad91f2SKonstantin Belousov 366b2ad91f2SKonstantin Belousov int 367b2ad91f2SKonstantin Belousov taskqueue_cancel_timeout(struct taskqueue *queue, 368b2ad91f2SKonstantin Belousov struct timeout_task *timeout_task, u_int *pendp) 369b2ad91f2SKonstantin Belousov { 370b2ad91f2SKonstantin Belousov u_int pending, pending1; 371b2ad91f2SKonstantin Belousov int error; 372b2ad91f2SKonstantin Belousov 373b2ad91f2SKonstantin Belousov TQ_LOCK(queue); 374b2ad91f2SKonstantin Belousov pending = !!callout_stop(&timeout_task->c); 375b2ad91f2SKonstantin Belousov error = taskqueue_cancel_locked(queue, &timeout_task->t, &pending1); 376b2ad91f2SKonstantin Belousov if ((timeout_task->f & DT_CALLOUT_ARMED) != 0) { 377b2ad91f2SKonstantin Belousov timeout_task->f &= ~DT_CALLOUT_ARMED; 378b2ad91f2SKonstantin Belousov queue->tq_callouts--; 379b2ad91f2SKonstantin Belousov } 380f46276a9SMatthew D Fleming TQ_UNLOCK(queue); 381f46276a9SMatthew D Fleming 382f46276a9SMatthew D Fleming if (pendp != NULL) 383b2ad91f2SKonstantin Belousov *pendp = pending + pending1; 384f46276a9SMatthew D Fleming return (error); 385f46276a9SMatthew D Fleming } 386f46276a9SMatthew D Fleming 38714889b42SWarner Losh void 38814889b42SWarner Losh taskqueue_drain(struct taskqueue *queue, struct task *task) 38914889b42SWarner Losh { 3903d336cd0SPawel Jakub Dawidek 3913d336cd0SPawel Jakub Dawidek if (!queue->tq_spin) 3929df1a6ddSScott Long WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, NULL, __func__); 39352bc746aSSam Leffler 3943d336cd0SPawel Jakub Dawidek TQ_LOCK(queue); 395bf73d4d2SMatthew D Fleming while (task->ta_pending != 0 || task_is_running(queue, task)) 3963d336cd0SPawel Jakub Dawidek TQ_SLEEP(queue, task, &queue->tq_mutex, PWAIT, "-", 0); 3973d336cd0SPawel Jakub Dawidek TQ_UNLOCK(queue); 3989df1a6ddSScott Long } 39914889b42SWarner Losh 400b2ad91f2SKonstantin Belousov void 401b2ad91f2SKonstantin Belousov taskqueue_drain_timeout(struct taskqueue *queue, 402b2ad91f2SKonstantin Belousov struct timeout_task *timeout_task) 403b2ad91f2SKonstantin Belousov { 404b2ad91f2SKonstantin Belousov 405b2ad91f2SKonstantin Belousov callout_drain(&timeout_task->c); 406b2ad91f2SKonstantin Belousov taskqueue_drain(queue, &timeout_task->t); 407b2ad91f2SKonstantin Belousov } 408b2ad91f2SKonstantin Belousov 409ca2e0534SDoug Rabson static void 410ca2e0534SDoug Rabson taskqueue_swi_enqueue(void *context) 411ca2e0534SDoug Rabson { 412c86b6ff5SJohn Baldwin swi_sched(taskqueue_ih, 0); 413ca2e0534SDoug Rabson } 414ca2e0534SDoug Rabson 415ca2e0534SDoug Rabson static void 4168088699fSJohn Baldwin taskqueue_swi_run(void *dummy) 417ca2e0534SDoug Rabson { 418bf73d4d2SMatthew D Fleming taskqueue_run(taskqueue_swi); 419ca2e0534SDoug Rabson } 420ca2e0534SDoug Rabson 4217874f606SScott Long static void 4227874f606SScott Long taskqueue_swi_giant_enqueue(void *context) 4237874f606SScott Long { 4247874f606SScott Long swi_sched(taskqueue_giant_ih, 0); 4257874f606SScott Long } 4267874f606SScott Long 4277874f606SScott Long static void 4287874f606SScott Long taskqueue_swi_giant_run(void *dummy) 4297874f606SScott Long { 430bf73d4d2SMatthew D Fleming taskqueue_run(taskqueue_swi_giant); 4317874f606SScott Long } 4327874f606SScott Long 4330f92108dSScott Long int 4340f92108dSScott Long taskqueue_start_threads(struct taskqueue **tqp, int count, int pri, 4350f92108dSScott Long const char *name, ...) 4360f92108dSScott Long { 4370f92108dSScott Long va_list ap; 43875b773aeSSam Leffler struct thread *td; 439175611b6SSam Leffler struct taskqueue *tq; 44000537061SSam Leffler int i, error; 4415ca4819dSJohn Baldwin char ktname[MAXCOMLEN + 1]; 4420f92108dSScott Long 4430f92108dSScott Long if (count <= 0) 4440f92108dSScott Long return (EINVAL); 445175611b6SSam Leffler 4460f92108dSScott Long tq = *tqp; 4470f92108dSScott Long 4480f92108dSScott Long va_start(ap, name); 4495ca4819dSJohn Baldwin vsnprintf(ktname, sizeof(ktname), name, ap); 4500f92108dSScott Long va_end(ap); 4510f92108dSScott Long 452175611b6SSam Leffler tq->tq_threads = malloc(sizeof(struct thread *) * count, M_TASKQUEUE, 45300537061SSam Leffler M_NOWAIT | M_ZERO); 454175611b6SSam Leffler if (tq->tq_threads == NULL) { 45500537061SSam Leffler printf("%s: no memory for %s threads\n", __func__, ktname); 45600537061SSam Leffler return (ENOMEM); 45700537061SSam Leffler } 45800537061SSam Leffler 4590f92108dSScott Long for (i = 0; i < count; i++) { 4600f92108dSScott Long if (count == 1) 461175611b6SSam Leffler error = kthread_add(taskqueue_thread_loop, tqp, NULL, 4621bdfff22SAndriy Gapon &tq->tq_threads[i], RFSTOPPED, 0, "%s", ktname); 4630f92108dSScott Long else 464175611b6SSam Leffler error = kthread_add(taskqueue_thread_loop, tqp, NULL, 465175611b6SSam Leffler &tq->tq_threads[i], RFSTOPPED, 0, 466175611b6SSam Leffler "%s_%d", ktname, i); 46775b773aeSSam Leffler if (error) { 46800537061SSam Leffler /* should be ok to continue, taskqueue_free will dtrt */ 469175611b6SSam Leffler printf("%s: kthread_add(%s): error %d", __func__, 470175611b6SSam Leffler ktname, error); 471175611b6SSam Leffler tq->tq_threads[i] = NULL; /* paranoid */ 47275b773aeSSam Leffler } else 473175611b6SSam Leffler tq->tq_tcount++; 47400537061SSam Leffler } 47575b773aeSSam Leffler for (i = 0; i < count; i++) { 476175611b6SSam Leffler if (tq->tq_threads[i] == NULL) 47775b773aeSSam Leffler continue; 478175611b6SSam Leffler td = tq->tq_threads[i]; 479982d11f8SJeff Roberson thread_lock(td); 48075b773aeSSam Leffler sched_prio(td, pri); 481f0393f06SJeff Roberson sched_add(td, SRQ_BORING); 482982d11f8SJeff Roberson thread_unlock(td); 4830f92108dSScott Long } 4840f92108dSScott Long 4850f92108dSScott Long return (0); 4860f92108dSScott Long } 4870f92108dSScott Long 488227559d1SJohn-Mark Gurney void 489227559d1SJohn-Mark Gurney taskqueue_thread_loop(void *arg) 490cb32189eSKenneth D. Merry { 491227559d1SJohn-Mark Gurney struct taskqueue **tqp, *tq; 492bd83e879SJohn Baldwin 493227559d1SJohn-Mark Gurney tqp = arg; 494227559d1SJohn-Mark Gurney tq = *tqp; 4959df1a6ddSScott Long TQ_LOCK(tq); 49624ef0701SAndrew Thompson while ((tq->tq_flags & TQ_FLAGS_ACTIVE) != 0) { 497bf73d4d2SMatthew D Fleming taskqueue_run_locked(tq); 4986a3b2893SPawel Jakub Dawidek /* 4996a3b2893SPawel Jakub Dawidek * Because taskqueue_run() can drop tq_mutex, we need to 5006a3b2893SPawel Jakub Dawidek * check if the TQ_FLAGS_ACTIVE flag wasn't removed in the 5016a3b2893SPawel Jakub Dawidek * meantime, which means we missed a wakeup. 5026a3b2893SPawel Jakub Dawidek */ 5036a3b2893SPawel Jakub Dawidek if ((tq->tq_flags & TQ_FLAGS_ACTIVE) == 0) 5046a3b2893SPawel Jakub Dawidek break; 5050f180a7cSJohn Baldwin TQ_SLEEP(tq, tq, &tq->tq_mutex, 0, "-", 0); 506a1797ef6SAndrew Thompson } 507bf73d4d2SMatthew D Fleming taskqueue_run_locked(tq); 50852bc746aSSam Leffler 50952bc746aSSam Leffler /* rendezvous with thread that asked us to terminate */ 510175611b6SSam Leffler tq->tq_tcount--; 511175611b6SSam Leffler wakeup_one(tq->tq_threads); 5129df1a6ddSScott Long TQ_UNLOCK(tq); 51303c7442dSJohn Baldwin kthread_exit(); 514cb32189eSKenneth D. Merry } 515cb32189eSKenneth D. Merry 516227559d1SJohn-Mark Gurney void 517cb32189eSKenneth D. Merry taskqueue_thread_enqueue(void *context) 518cb32189eSKenneth D. Merry { 519227559d1SJohn-Mark Gurney struct taskqueue **tqp, *tq; 520bd83e879SJohn Baldwin 521227559d1SJohn-Mark Gurney tqp = context; 522227559d1SJohn-Mark Gurney tq = *tqp; 523227559d1SJohn-Mark Gurney 524227559d1SJohn-Mark Gurney mtx_assert(&tq->tq_mutex, MA_OWNED); 52552bc746aSSam Leffler wakeup_one(tq); 526cb32189eSKenneth D. Merry } 527cb32189eSKenneth D. Merry 528d710cae7SWarner Losh TASKQUEUE_DEFINE(swi, taskqueue_swi_enqueue, NULL, 5297874f606SScott Long swi_add(NULL, "task queue", taskqueue_swi_run, NULL, SWI_TQ, 5307874f606SScott Long INTR_MPSAFE, &taskqueue_ih)); 5317874f606SScott Long 532d710cae7SWarner Losh TASKQUEUE_DEFINE(swi_giant, taskqueue_swi_giant_enqueue, NULL, 5336caf758eSJohn Baldwin swi_add(NULL, "Giant taskq", taskqueue_swi_giant_run, 5347874f606SScott Long NULL, SWI_TQ_GIANT, 0, &taskqueue_giant_ih)); 535cb32189eSKenneth D. Merry 536227559d1SJohn-Mark Gurney TASKQUEUE_DEFINE_THREAD(thread); 537f82c9e70SSam Leffler 5389df1a6ddSScott Long struct taskqueue * 5399df1a6ddSScott Long taskqueue_create_fast(const char *name, int mflags, 5400f92108dSScott Long taskqueue_enqueue_fn enqueue, void *context) 5419df1a6ddSScott Long { 5420f92108dSScott Long return _taskqueue_create(name, mflags, enqueue, context, 5439df1a6ddSScott Long MTX_SPIN, "fast_taskqueue"); 5449df1a6ddSScott Long } 5459df1a6ddSScott Long 5469df1a6ddSScott Long /* NB: for backwards compatibility */ 547f82c9e70SSam Leffler int 548f82c9e70SSam Leffler taskqueue_enqueue_fast(struct taskqueue *queue, struct task *task) 549f82c9e70SSam Leffler { 5509df1a6ddSScott Long return taskqueue_enqueue(queue, task); 551f82c9e70SSam Leffler } 552f82c9e70SSam Leffler 553f82c9e70SSam Leffler static void *taskqueue_fast_ih; 554f82c9e70SSam Leffler 555f82c9e70SSam Leffler static void 5569df1a6ddSScott Long taskqueue_fast_enqueue(void *context) 557f82c9e70SSam Leffler { 558f82c9e70SSam Leffler swi_sched(taskqueue_fast_ih, 0); 559f82c9e70SSam Leffler } 560f82c9e70SSam Leffler 561f82c9e70SSam Leffler static void 562f82c9e70SSam Leffler taskqueue_fast_run(void *dummy) 563f82c9e70SSam Leffler { 564bf73d4d2SMatthew D Fleming taskqueue_run(taskqueue_fast); 565f82c9e70SSam Leffler } 566f82c9e70SSam Leffler 567d710cae7SWarner Losh TASKQUEUE_FAST_DEFINE(fast, taskqueue_fast_enqueue, NULL, 5689df1a6ddSScott Long swi_add(NULL, "Fast task queue", taskqueue_fast_run, NULL, 5699df1a6ddSScott Long SWI_TQ_FAST, INTR_MPSAFE, &taskqueue_fast_ih)); 570159ef108SPawel Jakub Dawidek 571159ef108SPawel Jakub Dawidek int 572159ef108SPawel Jakub Dawidek taskqueue_member(struct taskqueue *queue, struct thread *td) 573159ef108SPawel Jakub Dawidek { 574159ef108SPawel Jakub Dawidek int i, j, ret = 0; 575159ef108SPawel Jakub Dawidek 576159ef108SPawel Jakub Dawidek TQ_LOCK(queue); 577159ef108SPawel Jakub Dawidek for (i = 0, j = 0; ; i++) { 578159ef108SPawel Jakub Dawidek if (queue->tq_threads[i] == NULL) 579159ef108SPawel Jakub Dawidek continue; 580159ef108SPawel Jakub Dawidek if (queue->tq_threads[i] == td) { 581159ef108SPawel Jakub Dawidek ret = 1; 582159ef108SPawel Jakub Dawidek break; 583159ef108SPawel Jakub Dawidek } 584159ef108SPawel Jakub Dawidek if (++j >= queue->tq_tcount) 585159ef108SPawel Jakub Dawidek break; 586159ef108SPawel Jakub Dawidek } 587159ef108SPawel Jakub Dawidek TQ_UNLOCK(queue); 588159ef108SPawel Jakub Dawidek return (ret); 589159ef108SPawel Jakub Dawidek } 590