2 * Copyright (c) 2017 Hans Petter Selasky
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice unmodified, this list of conditions, and the following
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
16 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
17 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
18 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
19 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
20 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
24 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 #include <sys/cdefs.h>
28 __FBSDID("$FreeBSD$");
30 #include <linux/workqueue.h>
31 #include <linux/wait.h>
32 #include <linux/compat.h>
33 #include <linux/spinlock.h>
35 #include <sys/kernel.h>
38 * Define all work struct states
41 WORK_ST_IDLE, /* idle - not started */
42 WORK_ST_TIMER, /* timer is being started */
43 WORK_ST_TASK, /* taskqueue is being queued */
44 WORK_ST_EXEC, /* callback is being called */
45 WORK_ST_CANCEL, /* cancel is being requested */
50 * Define global workqueues
52 static struct workqueue_struct *linux_system_short_wq;
53 static struct workqueue_struct *linux_system_long_wq;
55 struct workqueue_struct *system_wq;
56 struct workqueue_struct *system_long_wq;
57 struct workqueue_struct *system_unbound_wq;
58 struct workqueue_struct *system_highpri_wq;
59 struct workqueue_struct *system_power_efficient_wq;
61 static int linux_default_wq_cpus = 4;
63 static void linux_delayed_work_timer_fn(void *);
66 * This function atomically updates the work state and returns the
67 * previous state at the time of update.
70 linux_update_state(atomic_t *v, const uint8_t *pstate)
76 while ((old = atomic_cmpxchg(v, c, pstate[c])) != c)
83 * A LinuxKPI task is allowed to free itself inside the callback function
84 * and cannot safely be referred after the callback function has
85 * completed. This function gives the linux_work_fn() function a hint,
86 * that the task is not going away and can have its state checked
87 * again. Without this extra hint LinuxKPI tasks cannot be serialized
88 * accross multiple worker threads.
91 linux_work_exec_unblock(struct work_struct *work)
93 struct workqueue_struct *wq;
94 struct work_exec *exec;
97 wq = work->work_queue;
98 if (unlikely(wq == NULL))
102 TAILQ_FOREACH(exec, &wq->exec_head, entry) {
103 if (exec->target == work) {
115 linux_delayed_work_enqueue(struct delayed_work *dwork)
117 struct taskqueue *tq;
119 tq = dwork->work.work_queue->taskqueue;
120 taskqueue_enqueue(tq, &dwork->work.work_task);
124 * This function queues the given work structure on the given
125 * workqueue. It returns non-zero if the work was successfully
126 * [re-]queued. Else the work is already pending for completion.
129 linux_queue_work_on(int cpu __unused, struct workqueue_struct *wq,
130 struct work_struct *work)
132 static const uint8_t states[WORK_ST_MAX] __aligned(8) = {
133 [WORK_ST_IDLE] = WORK_ST_TASK, /* start queuing task */
134 [WORK_ST_TIMER] = WORK_ST_TIMER, /* NOP */
135 [WORK_ST_TASK] = WORK_ST_TASK, /* NOP */
136 [WORK_ST_EXEC] = WORK_ST_TASK, /* queue task another time */
137 [WORK_ST_CANCEL] = WORK_ST_TASK, /* start queuing task again */
140 if (atomic_read(&wq->draining) != 0)
141 return (!work_pending(work));
143 switch (linux_update_state(&work->state, states)) {
146 if (linux_work_exec_unblock(work) != 0)
150 work->work_queue = wq;
151 taskqueue_enqueue(wq->taskqueue, &work->work_task);
154 return (0); /* already on a queue */
159 * This function queues the given work structure on the given
160 * workqueue after a given delay in ticks. It returns non-zero if the
161 * work was successfully [re-]queued. Else the work is already pending
165 linux_queue_delayed_work_on(int cpu, struct workqueue_struct *wq,
166 struct delayed_work *dwork, unsigned delay)
168 static const uint8_t states[WORK_ST_MAX] __aligned(8) = {
169 [WORK_ST_IDLE] = WORK_ST_TIMER, /* start timeout */
170 [WORK_ST_TIMER] = WORK_ST_TIMER, /* NOP */
171 [WORK_ST_TASK] = WORK_ST_TASK, /* NOP */
172 [WORK_ST_EXEC] = WORK_ST_TIMER, /* start timeout */
173 [WORK_ST_CANCEL] = WORK_ST_TIMER, /* start timeout */
176 if (atomic_read(&wq->draining) != 0)
177 return (!work_pending(&dwork->work));
179 switch (linux_update_state(&dwork->work.state, states)) {
182 if (delay == 0 && linux_work_exec_unblock(&dwork->work) != 0) {
183 dwork->timer.expires = jiffies;
188 dwork->work.work_queue = wq;
189 dwork->timer.expires = jiffies + delay;
192 linux_delayed_work_enqueue(dwork);
193 } else if (unlikely(cpu != WORK_CPU_UNBOUND)) {
194 mtx_lock(&dwork->timer.mtx);
195 callout_reset_on(&dwork->timer.callout, delay,
196 &linux_delayed_work_timer_fn, dwork, cpu);
197 mtx_unlock(&dwork->timer.mtx);
199 mtx_lock(&dwork->timer.mtx);
200 callout_reset(&dwork->timer.callout, delay,
201 &linux_delayed_work_timer_fn, dwork);
202 mtx_unlock(&dwork->timer.mtx);
206 return (0); /* already on a queue */
211 linux_work_fn(void *context, int pending)
213 static const uint8_t states[WORK_ST_MAX] __aligned(8) = {
214 [WORK_ST_IDLE] = WORK_ST_IDLE, /* NOP */
215 [WORK_ST_TIMER] = WORK_ST_EXEC, /* delayed work w/o timeout */
216 [WORK_ST_TASK] = WORK_ST_EXEC, /* call callback */
217 [WORK_ST_EXEC] = WORK_ST_IDLE, /* complete callback */
218 [WORK_ST_CANCEL] = WORK_ST_EXEC, /* failed to cancel */
220 struct work_struct *work;
221 struct workqueue_struct *wq;
222 struct work_exec exec;
224 linux_set_current(curthread);
226 /* setup local variables */
228 wq = work->work_queue;
230 /* store target pointer */
233 /* insert executor into list */
235 TAILQ_INSERT_TAIL(&wq->exec_head, &exec, entry);
237 switch (linux_update_state(&work->state, states)) {
243 /* call work function */
247 /* check if unblocked */
248 if (exec.target != work) {
259 /* remove executor from list */
260 TAILQ_REMOVE(&wq->exec_head, &exec, entry);
265 linux_delayed_work_fn(void *context, int pending)
267 struct delayed_work *dwork = context;
270 * Make sure the timer belonging to the delayed work gets
271 * drained before invoking the work function. Else the timer
272 * mutex may still be in use which can lead to use-after-free
273 * situations, because the work function might free the work
274 * structure before returning.
276 callout_drain(&dwork->timer.callout);
278 linux_work_fn(&dwork->work, pending);
282 linux_delayed_work_timer_fn(void *arg)
284 static const uint8_t states[WORK_ST_MAX] __aligned(8) = {
285 [WORK_ST_IDLE] = WORK_ST_IDLE, /* NOP */
286 [WORK_ST_TIMER] = WORK_ST_TASK, /* start queueing task */
287 [WORK_ST_TASK] = WORK_ST_TASK, /* NOP */
288 [WORK_ST_EXEC] = WORK_ST_EXEC, /* NOP */
289 [WORK_ST_CANCEL] = WORK_ST_TASK, /* failed to cancel */
291 struct delayed_work *dwork = arg;
293 switch (linux_update_state(&dwork->work.state, states)) {
296 linux_delayed_work_enqueue(dwork);
304 * This function cancels the given work structure in a synchronous
305 * fashion. It returns non-zero if the work was successfully
306 * cancelled. Else the work was already cancelled.
309 linux_cancel_work_sync(struct work_struct *work)
311 static const uint8_t states[WORK_ST_MAX] __aligned(8) = {
312 [WORK_ST_IDLE] = WORK_ST_IDLE, /* NOP */
313 [WORK_ST_TIMER] = WORK_ST_TIMER, /* can't happen */
314 [WORK_ST_TASK] = WORK_ST_IDLE, /* cancel and drain */
315 [WORK_ST_EXEC] = WORK_ST_IDLE, /* too late, drain */
316 [WORK_ST_CANCEL] = WORK_ST_IDLE, /* cancel and drain */
318 struct taskqueue *tq;
320 WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, NULL,
321 "linux_cancel_work_sync() might sleep");
323 switch (linux_update_state(&work->state, states)) {
328 tq = work->work_queue->taskqueue;
329 if (taskqueue_cancel(tq, &work->work_task, NULL) != 0)
330 taskqueue_drain(tq, &work->work_task);
333 tq = work->work_queue->taskqueue;
334 if (taskqueue_cancel(tq, &work->work_task, NULL) != 0)
335 taskqueue_drain(tq, &work->work_task);
341 * This function atomically stops the timer and callback. The timer
342 * callback will not be called after this function returns. This
343 * functions returns true when the timeout was cancelled. Else the
344 * timeout was not started or has already been called.
347 linux_cancel_timer(struct delayed_work *dwork, bool drain)
351 mtx_lock(&dwork->timer.mtx);
352 cancelled = (callout_stop(&dwork->timer.callout) == 1);
353 mtx_unlock(&dwork->timer.mtx);
355 /* check if we should drain */
357 callout_drain(&dwork->timer.callout);
362 * This function cancels the given delayed work structure in a
363 * non-blocking fashion. It returns non-zero if the work was
364 * successfully cancelled. Else the work may still be busy or already
368 linux_cancel_delayed_work(struct delayed_work *dwork)
370 static const uint8_t states[WORK_ST_MAX] __aligned(8) = {
371 [WORK_ST_IDLE] = WORK_ST_IDLE, /* NOP */
372 [WORK_ST_TIMER] = WORK_ST_CANCEL, /* try to cancel */
373 [WORK_ST_TASK] = WORK_ST_CANCEL, /* try to cancel */
374 [WORK_ST_EXEC] = WORK_ST_EXEC, /* NOP */
375 [WORK_ST_CANCEL] = WORK_ST_CANCEL, /* NOP */
377 struct taskqueue *tq;
379 switch (linux_update_state(&dwork->work.state, states)) {
382 if (linux_cancel_timer(dwork, 0)) {
383 atomic_cmpxchg(&dwork->work.state,
384 WORK_ST_CANCEL, WORK_ST_IDLE);
389 tq = dwork->work.work_queue->taskqueue;
390 if (taskqueue_cancel(tq, &dwork->work.work_task, NULL) == 0) {
391 atomic_cmpxchg(&dwork->work.state,
392 WORK_ST_CANCEL, WORK_ST_IDLE);
402 * This function cancels the given work structure in a synchronous
403 * fashion. It returns non-zero if the work was successfully
404 * cancelled. Else the work was already cancelled.
407 linux_cancel_delayed_work_sync(struct delayed_work *dwork)
409 static const uint8_t states[WORK_ST_MAX] __aligned(8) = {
410 [WORK_ST_IDLE] = WORK_ST_IDLE, /* NOP */
411 [WORK_ST_TIMER] = WORK_ST_IDLE, /* cancel and drain */
412 [WORK_ST_TASK] = WORK_ST_IDLE, /* cancel and drain */
413 [WORK_ST_EXEC] = WORK_ST_IDLE, /* too late, drain */
414 [WORK_ST_CANCEL] = WORK_ST_IDLE, /* cancel and drain */
416 struct taskqueue *tq;
418 WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, NULL,
419 "linux_cancel_delayed_work_sync() might sleep");
421 switch (linux_update_state(&dwork->work.state, states)) {
425 tq = dwork->work.work_queue->taskqueue;
426 if (taskqueue_cancel(tq, &dwork->work.work_task, NULL) != 0)
427 taskqueue_drain(tq, &dwork->work.work_task);
431 if (linux_cancel_timer(dwork, 1)) {
433 * Make sure taskqueue is also drained before
436 tq = dwork->work.work_queue->taskqueue;
437 taskqueue_drain(tq, &dwork->work.work_task);
442 tq = dwork->work.work_queue->taskqueue;
443 if (taskqueue_cancel(tq, &dwork->work.work_task, NULL) != 0)
444 taskqueue_drain(tq, &dwork->work.work_task);
450 * This function waits until the given work structure is completed.
451 * It returns non-zero if the work was successfully
452 * waited for. Else the work was not waited for.
455 linux_flush_work(struct work_struct *work)
457 struct taskqueue *tq;
460 WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, NULL,
461 "linux_flush_work() might sleep");
463 switch (atomic_read(&work->state)) {
467 tq = work->work_queue->taskqueue;
468 retval = taskqueue_poll_is_busy(tq, &work->work_task);
469 taskqueue_drain(tq, &work->work_task);
475 * This function waits until the given delayed work structure is
476 * completed. It returns non-zero if the work was successfully waited
477 * for. Else the work was not waited for.
480 linux_flush_delayed_work(struct delayed_work *dwork)
482 struct taskqueue *tq;
485 WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, NULL,
486 "linux_flush_delayed_work() might sleep");
488 switch (atomic_read(&dwork->work.state)) {
492 if (linux_cancel_timer(dwork, 1))
493 linux_delayed_work_enqueue(dwork);
496 tq = dwork->work.work_queue->taskqueue;
497 retval = taskqueue_poll_is_busy(tq, &dwork->work.work_task);
498 taskqueue_drain(tq, &dwork->work.work_task);
504 * This function returns true if the given work is pending, and not
508 linux_work_pending(struct work_struct *work)
510 switch (atomic_read(&work->state)) {
521 * This function returns true if the given work is busy.
524 linux_work_busy(struct work_struct *work)
526 struct taskqueue *tq;
528 switch (atomic_read(&work->state)) {
532 tq = work->work_queue->taskqueue;
533 return (taskqueue_poll_is_busy(tq, &work->work_task));
539 struct workqueue_struct *
540 linux_create_workqueue_common(const char *name, int cpus)
542 struct workqueue_struct *wq;
545 * If zero CPUs are specified use the default number of CPUs:
548 cpus = linux_default_wq_cpus;
550 wq = kmalloc(sizeof(*wq), M_WAITOK | M_ZERO);
551 wq->taskqueue = taskqueue_create(name, M_WAITOK,
552 taskqueue_thread_enqueue, &wq->taskqueue);
553 atomic_set(&wq->draining, 0);
554 taskqueue_start_threads(&wq->taskqueue, cpus, PWAIT, "%s", name);
555 TAILQ_INIT(&wq->exec_head);
556 mtx_init(&wq->exec_mtx, "linux_wq_exec", NULL, MTX_DEF);
562 linux_destroy_workqueue(struct workqueue_struct *wq)
564 atomic_inc(&wq->draining);
566 taskqueue_free(wq->taskqueue);
567 mtx_destroy(&wq->exec_mtx);
572 linux_init_delayed_work(struct delayed_work *dwork, work_func_t func)
574 memset(dwork, 0, sizeof(*dwork));
575 dwork->work.func = func;
576 TASK_INIT(&dwork->work.work_task, 0, linux_delayed_work_fn, dwork);
577 mtx_init(&dwork->timer.mtx, spin_lock_name("lkpi-dwork"), NULL,
578 MTX_DEF | MTX_NOWITNESS);
579 callout_init_mtx(&dwork->timer.callout, &dwork->timer.mtx, 0);
583 linux_work_init(void *arg)
585 int max_wq_cpus = mp_ncpus + 1;
587 /* avoid deadlock when there are too few threads */
591 /* set default number of CPUs */
592 linux_default_wq_cpus = max_wq_cpus;
594 linux_system_short_wq = alloc_workqueue("linuxkpi_short_wq", 0, max_wq_cpus);
595 linux_system_long_wq = alloc_workqueue("linuxkpi_long_wq", 0, max_wq_cpus);
597 /* populate the workqueue pointers */
598 system_long_wq = linux_system_long_wq;
599 system_wq = linux_system_short_wq;
600 system_power_efficient_wq = linux_system_short_wq;
601 system_unbound_wq = linux_system_short_wq;
602 system_highpri_wq = linux_system_short_wq;
604 SYSINIT(linux_work_init, SI_SUB_TASKQ, SI_ORDER_THIRD, linux_work_init, NULL);
607 linux_work_uninit(void *arg)
609 destroy_workqueue(linux_system_short_wq);
610 destroy_workqueue(linux_system_long_wq);
612 /* clear workqueue pointers */
613 system_long_wq = NULL;
615 system_power_efficient_wq = NULL;
616 system_unbound_wq = NULL;
617 system_highpri_wq = NULL;
619 SYSUNINIT(linux_work_uninit, SI_SUB_TASKQ, SI_ORDER_THIRD, linux_work_uninit, NULL);