2 * Copyright (c) 2010 Isilon Systems, Inc.
3 * Copyright (c) 2010 iX Systems, Inc.
4 * Copyright (c) 2010 Panasas, Inc.
5 * Copyright (c) 2013, 2014 Mellanox Technologies, Ltd.
6 * Copyright (c) 2014-2019 François Tigeot <ftigeot@wolfpond.org>
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice unmodified, this list of conditions, and the following
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
19 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
20 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
22 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
23 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
24 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
28 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 #ifndef _LINUX_WORKQUEUE_H_
31 #define _LINUX_WORKQUEUE_H_
33 #include <linux/timer.h>
34 #include <linux/bitops.h>
35 #include <linux/lockdep.h>
36 #include <linux/atomic.h>
37 #include <linux/cpumask.h>
39 #include <sys/taskqueue.h>
41 struct workqueue_struct {
42 struct taskqueue *taskqueue;
46 struct task work_task;
47 struct taskqueue *taskqueue;
48 void (*func)(struct work_struct *);
52 struct work_struct work;
56 static inline struct delayed_work *
57 to_delayed_work(struct work_struct *work)
60 return container_of(work, struct delayed_work, work);
65 _work_fn(void *context, int pending)
67 struct work_struct *work;
73 #define INIT_WORK(work, _func) \
75 (work)->func = (_func); \
76 (work)->taskqueue = NULL; \
77 TASK_INIT(&(work)->work_task, 0, _work_fn, (work)); \
80 #define INIT_WORK_ONSTACK(work, _func) INIT_WORK(work, _func)
82 #define INIT_DELAYED_WORK(_work, _func) \
84 INIT_WORK(&(_work)->work, _func); \
85 callout_init_mp(&(_work)->timer); \
88 #define INIT_DEFERRABLE_WORK INIT_DELAYED_WORK
90 #define schedule_work(work) \
92 (work)->taskqueue = taskqueue_thread[mycpuid]; \
93 taskqueue_enqueue(taskqueue_thread[mycpuid], &(work)->work_task); \
96 #define flush_scheduled_work() flush_taskqueue(taskqueue_thread[mycpuid])
98 static inline int queue_work(struct workqueue_struct *q, struct work_struct *work)
100 (work)->taskqueue = (q)->taskqueue;
101 /* Return opposite val to align with Linux logic */
102 return !taskqueue_enqueue((q)->taskqueue, &(work)->work_task);
106 _delayed_work_fn(void *arg)
108 struct delayed_work *work;
111 taskqueue_enqueue(work->work.taskqueue, &work->work.work_task);
115 queue_delayed_work(struct workqueue_struct *wq, struct delayed_work *work,
120 pending = work->work.work_task.ta_pending;
121 work->work.taskqueue = wq->taskqueue;
123 callout_reset(&work->timer, delay, _delayed_work_fn, work);
125 _delayed_work_fn((void *)work);
131 static inline bool schedule_delayed_work(struct delayed_work *dwork,
134 struct workqueue_struct wq;
135 wq.taskqueue = taskqueue_thread[mycpuid];
136 return queue_delayed_work(&wq, dwork, delay);
139 struct workqueue_struct * _create_workqueue_common(char *name, int cpus);
141 #define create_singlethread_workqueue(name) \
142 _create_workqueue_common(name, 1)
144 #define create_workqueue(name) \
145 _create_workqueue_common(name, MAXCPU)
147 #define alloc_ordered_workqueue(name, flags) \
148 _create_workqueue_common(name, 1)
150 #define alloc_workqueue(name, flags, max_active) \
151 _create_workqueue_common(name, max_active)
153 void destroy_workqueue(struct workqueue_struct *wq);
155 #define flush_workqueue(wq) flush_taskqueue((wq)->taskqueue)
158 _flush_fn(void *context, int pending)
163 flush_taskqueue(struct taskqueue *tq)
165 struct task flushtask;
168 TASK_INIT(&flushtask, 0, _flush_fn, NULL);
169 taskqueue_enqueue(tq, &flushtask);
170 taskqueue_drain(tq, &flushtask);
175 cancel_work_sync(struct work_struct *work)
177 if (work->taskqueue &&
178 taskqueue_cancel(work->taskqueue, &work->work_task, NULL))
179 taskqueue_drain(work->taskqueue, &work->work_task);
184 * This may leave work running on another CPU as it does on Linux.
187 cancel_delayed_work(struct delayed_work *work)
190 callout_stop(&work->timer);
191 if (work->work.taskqueue)
192 return (taskqueue_cancel(work->work.taskqueue,
193 &work->work.work_task, NULL) == 0);
198 cancel_delayed_work_sync(struct delayed_work *work)
200 callout_cancel(&work->timer);
201 if (work->work.taskqueue &&
202 taskqueue_cancel(work->work.taskqueue, &work->work.work_task, NULL))
203 taskqueue_drain(work->work.taskqueue, &work->work.work_task);
208 mod_delayed_work(struct workqueue_struct *wq, struct delayed_work *dwork,
211 cancel_delayed_work(dwork);
212 queue_delayed_work(wq, dwork, delay);
217 flush_work(struct work_struct *work)
219 if (work->taskqueue != NULL)
220 taskqueue_drain(work->taskqueue, &work->work_task);
225 destroy_work_on_stack(struct work_struct *work)
229 /* System-wide workqueues */
230 extern struct workqueue_struct *system_wq;
231 extern struct workqueue_struct *system_long_wq;
232 extern struct workqueue_struct *system_power_efficient_wq;
233 extern struct workqueue_struct *system_unbound_wq;
235 static inline unsigned int
236 work_busy(struct work_struct *work)
238 /* Just pretend nothing is busy, this function is unreliable anyway */
242 #endif /* _LINUX_WORKQUEUE_H_ */