1 /*- 2 * Copyright (c) 2009 Pawel Jakub Dawidek <pjd@FreeBSD.org> 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 14 * THIS SOFTWARE IS PROVIDED BY THE AUTHORS AND CONTRIBUTORS ``AS IS'' AND 15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE 18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24 * SUCH DAMAGE. 25 */ 26 27 #include <sys/cdefs.h> 28 __FBSDID("$FreeBSD$"); 29 30 #include <sys/param.h> 31 #include <sys/kernel.h> 32 #include <sys/kmem.h> 33 #include <sys/lock.h> 34 #include <sys/mutex.h> 35 #include <sys/queue.h> 36 #include <sys/taskqueue.h> 37 #include <sys/taskq.h> 38 39 #include <vm/uma.h> 40 41 static uma_zone_t taskq_zone; 42 43 taskq_t *system_taskq = NULL; 44 45 static void 46 system_taskq_init(void *arg) 47 { 48 49 taskq_zone = uma_zcreate("taskq_zone", sizeof(taskq_ent_t), 50 NULL, NULL, NULL, NULL, 0, 0); 51 system_taskq = taskq_create("system_taskq", mp_ncpus, minclsyspri, 52 0, 0, 0); 53 } 54 SYSINIT(system_taskq_init, SI_SUB_CONFIGURE, SI_ORDER_ANY, system_taskq_init, NULL); 55 56 static void 57 system_taskq_fini(void *arg) 58 { 59 60 taskq_destroy(system_taskq); 61 uma_zdestroy(taskq_zone); 62 } 63 SYSUNINIT(system_taskq_fini, SI_SUB_CONFIGURE, SI_ORDER_ANY, system_taskq_fini, NULL); 64 65 taskq_t * 66 taskq_create(const char *name, int nthreads, pri_t pri, int minalloc __unused, 67 int maxalloc __unused, uint_t flags) 68 { 69 taskq_t *tq; 70 71 if ((flags & TASKQ_THREADS_CPU_PCT) != 0) 72 nthreads = MAX((mp_ncpus * nthreads) / 100, 1); 73 74 tq = kmem_alloc(sizeof(*tq), KM_SLEEP); 75 tq->tq_queue = taskqueue_create(name, M_WAITOK, taskqueue_thread_enqueue, 76 &tq->tq_queue); 77 (void) taskqueue_start_threads(&tq->tq_queue, nthreads, pri, "%s", name); 78 79 return ((taskq_t *)tq); 80 } 81 82 taskq_t * 83 taskq_create_proc(const char *name, int nthreads, pri_t pri, int minalloc, 84 int maxalloc, proc_t *proc __unused, uint_t flags) 85 { 86 87 return (taskq_create(name, nthreads, pri, minalloc, maxalloc, flags)); 88 } 89 90 void 91 taskq_destroy(taskq_t *tq) 92 { 93 94 taskqueue_free(tq->tq_queue); 95 kmem_free(tq, sizeof(*tq)); 96 } 97 98 int 99 taskq_member(taskq_t *tq, kthread_t *thread) 100 { 101 102 return (taskqueue_member(tq->tq_queue, thread)); 103 } 104 105 static void 106 taskq_run(void *arg, int pending __unused) 107 { 108 taskq_ent_t *task = arg; 109 110 task->tqent_func(task->tqent_arg); 111 112 uma_zfree(taskq_zone, task); 113 } 114 115 taskqid_t 116 taskq_dispatch(taskq_t *tq, task_func_t func, void *arg, uint_t flags) 117 { 118 taskq_ent_t *task; 119 int mflag, prio; 120 121 if ((flags & (TQ_SLEEP | TQ_NOQUEUE)) == TQ_SLEEP) 122 mflag = M_WAITOK; 123 else 124 mflag = M_NOWAIT; 125 /* 126 * If TQ_FRONT is given, we want higher priority for this task, so it 127 * can go at the front of the queue. 128 */ 129 prio = !!(flags & TQ_FRONT); 130 131 task = uma_zalloc(taskq_zone, mflag); 132 if (task == NULL) 133 return (0); 134 135 task->tqent_func = func; 136 task->tqent_arg = arg; 137 138 TASK_INIT(&task->tqent_task, prio, taskq_run, task); 139 taskqueue_enqueue(tq->tq_queue, &task->tqent_task); 140 141 return ((taskqid_t)(void *)task); 142 } 143 144 static void 145 taskq_run_ent(void *arg, int pending __unused) 146 { 147 taskq_ent_t *task = arg; 148 149 task->tqent_func(task->tqent_arg); 150 } 151 152 void 153 taskq_dispatch_ent(taskq_t *tq, task_func_t func, void *arg, u_int flags, 154 taskq_ent_t *task) 155 { 156 int prio; 157 158 /* 159 * If TQ_FRONT is given, we want higher priority for this task, so it 160 * can go at the front of the queue. 161 */ 162 prio = !!(flags & TQ_FRONT); 163 164 task->tqent_func = func; 165 task->tqent_arg = arg; 166 167 TASK_INIT(&task->tqent_task, prio, taskq_run_ent, task); 168 taskqueue_enqueue(tq->tq_queue, &task->tqent_task); 169 } 170 171 void 172 taskq_wait(taskq_t *tq) 173 { 174 taskqueue_drain_all(tq->tq_queue); 175 } 176 177 void 178 taskq_wait_id(taskq_t *tq, taskqid_t id) 179 { 180 taskq_wait(tq); 181 } 182