]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * linux/kernel/workqueue.c | |
3 | * | |
4 | * Generic mechanism for defining kernel helper threads for running | |
5 | * arbitrary tasks in process context. | |
6 | * | |
7 | * Started by Ingo Molnar, Copyright (C) 2002 | |
8 | * | |
9 | * Derived from the taskqueue/keventd code by: | |
10 | * | |
11 | * David Woodhouse <dwmw2@infradead.org> | |
12 | * Andrew Morton <andrewm@uow.edu.au> | |
13 | * Kai Petzke <wpp@marie.physik.tu-berlin.de> | |
14 | * Theodore Ts'o <tytso@mit.edu> | |
89ada679 CL |
15 | * |
16 | * Made to use alloc_percpu by Christoph Lameter <clameter@sgi.com>. | |
1da177e4 LT |
17 | */ |
18 | ||
19 | #include <linux/module.h> | |
20 | #include <linux/kernel.h> | |
21 | #include <linux/sched.h> | |
22 | #include <linux/init.h> | |
23 | #include <linux/signal.h> | |
24 | #include <linux/completion.h> | |
25 | #include <linux/workqueue.h> | |
26 | #include <linux/slab.h> | |
27 | #include <linux/cpu.h> | |
28 | #include <linux/notifier.h> | |
29 | #include <linux/kthread.h> | |
1fa44eca | 30 | #include <linux/hardirq.h> |
46934023 | 31 | #include <linux/mempolicy.h> |
341a5958 | 32 | #include <linux/freezer.h> |
d5abe669 PZ |
33 | #include <linux/kallsyms.h> |
34 | #include <linux/debug_locks.h> | |
1da177e4 LT |
35 | |
36 | /* | |
f756d5e2 NL |
37 | * The per-CPU workqueue (if single thread, we always use the first |
38 | * possible cpu). | |
1da177e4 LT |
39 | */ |
40 | struct cpu_workqueue_struct { | |
41 | ||
42 | spinlock_t lock; | |
43 | ||
1da177e4 LT |
44 | struct list_head worklist; |
45 | wait_queue_head_t more_work; | |
3af24433 | 46 | struct work_struct *current_work; |
1da177e4 LT |
47 | |
48 | struct workqueue_struct *wq; | |
36c8b586 | 49 | struct task_struct *thread; |
3af24433 | 50 | int should_stop; |
1da177e4 LT |
51 | |
52 | int run_depth; /* Detect run_workqueue() recursion depth */ | |
53 | } ____cacheline_aligned; | |
54 | ||
55 | /* | |
56 | * The externally visible workqueue abstraction is an array of | |
57 | * per-CPU workqueues: | |
58 | */ | |
59 | struct workqueue_struct { | |
89ada679 | 60 | struct cpu_workqueue_struct *cpu_wq; |
cce1a165 | 61 | struct list_head list; |
1da177e4 | 62 | const char *name; |
cce1a165 | 63 | int singlethread; |
319c2a98 | 64 | int freezeable; /* Freeze threads during suspend */ |
1da177e4 LT |
65 | }; |
66 | ||
67 | /* All the per-cpu workqueues on the system, for hotplug cpu to add/remove | |
68 | threads to each one as cpus come/go. */ | |
9b41ea72 | 69 | static DEFINE_MUTEX(workqueue_mutex); |
1da177e4 LT |
70 | static LIST_HEAD(workqueues); |
71 | ||
3af24433 | 72 | static int singlethread_cpu __read_mostly; |
b1f4ec17 | 73 | static cpumask_t cpu_singlethread_map __read_mostly; |
3af24433 ON |
74 | /* optimization, we could use cpu_possible_map */ |
75 | static cpumask_t cpu_populated_map __read_mostly; | |
f756d5e2 | 76 | |
1da177e4 LT |
77 | /* If it's single threaded, it isn't in the list of workqueues. */ |
78 | static inline int is_single_threaded(struct workqueue_struct *wq) | |
79 | { | |
cce1a165 | 80 | return wq->singlethread; |
1da177e4 LT |
81 | } |
82 | ||
b1f4ec17 ON |
83 | static const cpumask_t *wq_cpu_map(struct workqueue_struct *wq) |
84 | { | |
85 | return is_single_threaded(wq) | |
86 | ? &cpu_singlethread_map : &cpu_populated_map; | |
87 | } | |
88 | ||
4594bf15 DH |
89 | /* |
90 | * Set the workqueue on which a work item is to be run | |
91 | * - Must *only* be called if the pending flag is set | |
92 | */ | |
365970a1 DH |
93 | static inline void set_wq_data(struct work_struct *work, void *wq) |
94 | { | |
4594bf15 DH |
95 | unsigned long new; |
96 | ||
97 | BUG_ON(!work_pending(work)); | |
365970a1 | 98 | |
365970a1 | 99 | new = (unsigned long) wq | (1UL << WORK_STRUCT_PENDING); |
a08727ba LT |
100 | new |= WORK_STRUCT_FLAG_MASK & *work_data_bits(work); |
101 | atomic_long_set(&work->data, new); | |
365970a1 DH |
102 | } |
103 | ||
104 | static inline void *get_wq_data(struct work_struct *work) | |
105 | { | |
a08727ba | 106 | return (void *) (atomic_long_read(&work->data) & WORK_STRUCT_WQ_DATA_MASK); |
365970a1 DH |
107 | } |
108 | ||
b89deed3 ON |
109 | static void insert_work(struct cpu_workqueue_struct *cwq, |
110 | struct work_struct *work, int tail) | |
111 | { | |
112 | set_wq_data(work, cwq); | |
113 | if (tail) | |
114 | list_add_tail(&work->entry, &cwq->worklist); | |
115 | else | |
116 | list_add(&work->entry, &cwq->worklist); | |
117 | wake_up(&cwq->more_work); | |
118 | } | |
119 | ||
1da177e4 LT |
120 | /* Preempt must be disabled. */ |
121 | static void __queue_work(struct cpu_workqueue_struct *cwq, | |
122 | struct work_struct *work) | |
123 | { | |
124 | unsigned long flags; | |
125 | ||
126 | spin_lock_irqsave(&cwq->lock, flags); | |
b89deed3 | 127 | insert_work(cwq, work, 1); |
1da177e4 LT |
128 | spin_unlock_irqrestore(&cwq->lock, flags); |
129 | } | |
130 | ||
0fcb78c2 REB |
131 | /** |
132 | * queue_work - queue work on a workqueue | |
133 | * @wq: workqueue to use | |
134 | * @work: work to queue | |
135 | * | |
057647fc | 136 | * Returns 0 if @work was already on a queue, non-zero otherwise. |
1da177e4 LT |
137 | * |
138 | * We queue the work to the CPU it was submitted, but there is no | |
139 | * guarantee that it will be processed by that CPU. | |
140 | */ | |
141 | int fastcall queue_work(struct workqueue_struct *wq, struct work_struct *work) | |
142 | { | |
143 | int ret = 0, cpu = get_cpu(); | |
144 | ||
a08727ba | 145 | if (!test_and_set_bit(WORK_STRUCT_PENDING, work_data_bits(work))) { |
1da177e4 | 146 | if (unlikely(is_single_threaded(wq))) |
f756d5e2 | 147 | cpu = singlethread_cpu; |
1da177e4 | 148 | BUG_ON(!list_empty(&work->entry)); |
89ada679 | 149 | __queue_work(per_cpu_ptr(wq->cpu_wq, cpu), work); |
1da177e4 LT |
150 | ret = 1; |
151 | } | |
152 | put_cpu(); | |
153 | return ret; | |
154 | } | |
ae90dd5d | 155 | EXPORT_SYMBOL_GPL(queue_work); |
1da177e4 | 156 | |
82f67cd9 | 157 | void delayed_work_timer_fn(unsigned long __data) |
1da177e4 | 158 | { |
52bad64d | 159 | struct delayed_work *dwork = (struct delayed_work *)__data; |
365970a1 | 160 | struct workqueue_struct *wq = get_wq_data(&dwork->work); |
1da177e4 LT |
161 | int cpu = smp_processor_id(); |
162 | ||
163 | if (unlikely(is_single_threaded(wq))) | |
f756d5e2 | 164 | cpu = singlethread_cpu; |
1da177e4 | 165 | |
52bad64d | 166 | __queue_work(per_cpu_ptr(wq->cpu_wq, cpu), &dwork->work); |
1da177e4 LT |
167 | } |
168 | ||
0fcb78c2 REB |
169 | /** |
170 | * queue_delayed_work - queue work on a workqueue after delay | |
171 | * @wq: workqueue to use | |
af9997e4 | 172 | * @dwork: delayable work to queue |
0fcb78c2 REB |
173 | * @delay: number of jiffies to wait before queueing |
174 | * | |
057647fc | 175 | * Returns 0 if @work was already on a queue, non-zero otherwise. |
0fcb78c2 | 176 | */ |
1da177e4 | 177 | int fastcall queue_delayed_work(struct workqueue_struct *wq, |
52bad64d | 178 | struct delayed_work *dwork, unsigned long delay) |
1da177e4 LT |
179 | { |
180 | int ret = 0; | |
52bad64d DH |
181 | struct timer_list *timer = &dwork->timer; |
182 | struct work_struct *work = &dwork->work; | |
183 | ||
82f67cd9 | 184 | timer_stats_timer_set_start_info(timer); |
52bad64d DH |
185 | if (delay == 0) |
186 | return queue_work(wq, work); | |
1da177e4 | 187 | |
a08727ba | 188 | if (!test_and_set_bit(WORK_STRUCT_PENDING, work_data_bits(work))) { |
1da177e4 LT |
189 | BUG_ON(timer_pending(timer)); |
190 | BUG_ON(!list_empty(&work->entry)); | |
191 | ||
192 | /* This stores wq for the moment, for the timer_fn */ | |
365970a1 | 193 | set_wq_data(work, wq); |
1da177e4 | 194 | timer->expires = jiffies + delay; |
52bad64d | 195 | timer->data = (unsigned long)dwork; |
1da177e4 LT |
196 | timer->function = delayed_work_timer_fn; |
197 | add_timer(timer); | |
198 | ret = 1; | |
199 | } | |
200 | return ret; | |
201 | } | |
ae90dd5d | 202 | EXPORT_SYMBOL_GPL(queue_delayed_work); |
1da177e4 | 203 | |
0fcb78c2 REB |
204 | /** |
205 | * queue_delayed_work_on - queue work on specific CPU after delay | |
206 | * @cpu: CPU number to execute work on | |
207 | * @wq: workqueue to use | |
af9997e4 | 208 | * @dwork: work to queue |
0fcb78c2 REB |
209 | * @delay: number of jiffies to wait before queueing |
210 | * | |
057647fc | 211 | * Returns 0 if @work was already on a queue, non-zero otherwise. |
0fcb78c2 | 212 | */ |
7a6bc1cd | 213 | int queue_delayed_work_on(int cpu, struct workqueue_struct *wq, |
52bad64d | 214 | struct delayed_work *dwork, unsigned long delay) |
7a6bc1cd VP |
215 | { |
216 | int ret = 0; | |
52bad64d DH |
217 | struct timer_list *timer = &dwork->timer; |
218 | struct work_struct *work = &dwork->work; | |
7a6bc1cd | 219 | |
a08727ba | 220 | if (!test_and_set_bit(WORK_STRUCT_PENDING, work_data_bits(work))) { |
7a6bc1cd VP |
221 | BUG_ON(timer_pending(timer)); |
222 | BUG_ON(!list_empty(&work->entry)); | |
223 | ||
224 | /* This stores wq for the moment, for the timer_fn */ | |
365970a1 | 225 | set_wq_data(work, wq); |
7a6bc1cd | 226 | timer->expires = jiffies + delay; |
52bad64d | 227 | timer->data = (unsigned long)dwork; |
7a6bc1cd VP |
228 | timer->function = delayed_work_timer_fn; |
229 | add_timer_on(timer, cpu); | |
230 | ret = 1; | |
231 | } | |
232 | return ret; | |
233 | } | |
ae90dd5d | 234 | EXPORT_SYMBOL_GPL(queue_delayed_work_on); |
1da177e4 | 235 | |
858119e1 | 236 | static void run_workqueue(struct cpu_workqueue_struct *cwq) |
1da177e4 | 237 | { |
f293ea92 | 238 | spin_lock_irq(&cwq->lock); |
1da177e4 LT |
239 | cwq->run_depth++; |
240 | if (cwq->run_depth > 3) { | |
241 | /* morton gets to eat his hat */ | |
242 | printk("%s: recursion depth exceeded: %d\n", | |
243 | __FUNCTION__, cwq->run_depth); | |
244 | dump_stack(); | |
245 | } | |
246 | while (!list_empty(&cwq->worklist)) { | |
247 | struct work_struct *work = list_entry(cwq->worklist.next, | |
248 | struct work_struct, entry); | |
6bb49e59 | 249 | work_func_t f = work->func; |
1da177e4 | 250 | |
b89deed3 | 251 | cwq->current_work = work; |
1da177e4 | 252 | list_del_init(cwq->worklist.next); |
f293ea92 | 253 | spin_unlock_irq(&cwq->lock); |
1da177e4 | 254 | |
365970a1 | 255 | BUG_ON(get_wq_data(work) != cwq); |
a08727ba | 256 | if (!test_bit(WORK_STRUCT_NOAUTOREL, work_data_bits(work))) |
65f27f38 DH |
257 | work_release(work); |
258 | f(work); | |
1da177e4 | 259 | |
d5abe669 PZ |
260 | if (unlikely(in_atomic() || lockdep_depth(current) > 0)) { |
261 | printk(KERN_ERR "BUG: workqueue leaked lock or atomic: " | |
262 | "%s/0x%08x/%d\n", | |
263 | current->comm, preempt_count(), | |
264 | current->pid); | |
265 | printk(KERN_ERR " last function: "); | |
266 | print_symbol("%s\n", (unsigned long)f); | |
267 | debug_show_held_locks(current); | |
268 | dump_stack(); | |
269 | } | |
270 | ||
f293ea92 | 271 | spin_lock_irq(&cwq->lock); |
b89deed3 | 272 | cwq->current_work = NULL; |
1da177e4 LT |
273 | } |
274 | cwq->run_depth--; | |
f293ea92 | 275 | spin_unlock_irq(&cwq->lock); |
1da177e4 LT |
276 | } |
277 | ||
3af24433 ON |
278 | /* |
279 | * NOTE: the caller must not touch *cwq if this func returns true | |
280 | */ | |
281 | static int cwq_should_stop(struct cpu_workqueue_struct *cwq) | |
282 | { | |
283 | int should_stop = cwq->should_stop; | |
284 | ||
285 | if (unlikely(should_stop)) { | |
286 | spin_lock_irq(&cwq->lock); | |
287 | should_stop = cwq->should_stop && list_empty(&cwq->worklist); | |
288 | if (should_stop) | |
289 | cwq->thread = NULL; | |
290 | spin_unlock_irq(&cwq->lock); | |
291 | } | |
292 | ||
293 | return should_stop; | |
294 | } | |
295 | ||
1da177e4 LT |
296 | static int worker_thread(void *__cwq) |
297 | { | |
298 | struct cpu_workqueue_struct *cwq = __cwq; | |
3af24433 | 299 | DEFINE_WAIT(wait); |
1da177e4 LT |
300 | struct k_sigaction sa; |
301 | sigset_t blocked; | |
302 | ||
319c2a98 | 303 | if (!cwq->wq->freezeable) |
341a5958 | 304 | current->flags |= PF_NOFREEZE; |
1da177e4 LT |
305 | |
306 | set_user_nice(current, -5); | |
307 | ||
308 | /* Block and flush all signals */ | |
309 | sigfillset(&blocked); | |
310 | sigprocmask(SIG_BLOCK, &blocked, NULL); | |
311 | flush_signals(current); | |
312 | ||
46934023 CL |
313 | /* |
314 | * We inherited MPOL_INTERLEAVE from the booting kernel. | |
315 | * Set MPOL_DEFAULT to insure node local allocations. | |
316 | */ | |
317 | numa_default_policy(); | |
318 | ||
1da177e4 LT |
319 | /* SIG_IGN makes children autoreap: see do_notify_parent(). */ |
320 | sa.sa.sa_handler = SIG_IGN; | |
321 | sa.sa.sa_flags = 0; | |
322 | siginitset(&sa.sa.sa_mask, sigmask(SIGCHLD)); | |
323 | do_sigaction(SIGCHLD, &sa, (struct k_sigaction *)0); | |
324 | ||
3af24433 | 325 | for (;;) { |
319c2a98 | 326 | if (cwq->wq->freezeable) |
341a5958 RW |
327 | try_to_freeze(); |
328 | ||
3af24433 ON |
329 | prepare_to_wait(&cwq->more_work, &wait, TASK_INTERRUPTIBLE); |
330 | if (!cwq->should_stop && list_empty(&cwq->worklist)) | |
1da177e4 | 331 | schedule(); |
3af24433 ON |
332 | finish_wait(&cwq->more_work, &wait); |
333 | ||
334 | if (cwq_should_stop(cwq)) | |
335 | break; | |
1da177e4 | 336 | |
3af24433 | 337 | run_workqueue(cwq); |
1da177e4 | 338 | } |
3af24433 | 339 | |
1da177e4 LT |
340 | return 0; |
341 | } | |
342 | ||
fc2e4d70 ON |
343 | struct wq_barrier { |
344 | struct work_struct work; | |
345 | struct completion done; | |
346 | }; | |
347 | ||
348 | static void wq_barrier_func(struct work_struct *work) | |
349 | { | |
350 | struct wq_barrier *barr = container_of(work, struct wq_barrier, work); | |
351 | complete(&barr->done); | |
352 | } | |
353 | ||
83c22520 ON |
354 | static void insert_wq_barrier(struct cpu_workqueue_struct *cwq, |
355 | struct wq_barrier *barr, int tail) | |
fc2e4d70 ON |
356 | { |
357 | INIT_WORK(&barr->work, wq_barrier_func); | |
358 | __set_bit(WORK_STRUCT_PENDING, work_data_bits(&barr->work)); | |
359 | ||
360 | init_completion(&barr->done); | |
83c22520 ON |
361 | |
362 | insert_work(cwq, &barr->work, tail); | |
fc2e4d70 ON |
363 | } |
364 | ||
1da177e4 LT |
365 | static void flush_cpu_workqueue(struct cpu_workqueue_struct *cwq) |
366 | { | |
367 | if (cwq->thread == current) { | |
368 | /* | |
369 | * Probably keventd trying to flush its own queue. So simply run | |
370 | * it by hand rather than deadlocking. | |
371 | */ | |
372 | run_workqueue(cwq); | |
373 | } else { | |
fc2e4d70 | 374 | struct wq_barrier barr; |
83c22520 | 375 | int active = 0; |
1da177e4 | 376 | |
83c22520 ON |
377 | spin_lock_irq(&cwq->lock); |
378 | if (!list_empty(&cwq->worklist) || cwq->current_work != NULL) { | |
379 | insert_wq_barrier(cwq, &barr, 1); | |
380 | active = 1; | |
381 | } | |
382 | spin_unlock_irq(&cwq->lock); | |
1da177e4 | 383 | |
d721304d | 384 | if (active) |
83c22520 | 385 | wait_for_completion(&barr.done); |
1da177e4 LT |
386 | } |
387 | } | |
388 | ||
0fcb78c2 | 389 | /** |
1da177e4 | 390 | * flush_workqueue - ensure that any scheduled work has run to completion. |
0fcb78c2 | 391 | * @wq: workqueue to flush |
1da177e4 LT |
392 | * |
393 | * Forces execution of the workqueue and blocks until its completion. | |
394 | * This is typically used in driver shutdown handlers. | |
395 | * | |
fc2e4d70 ON |
396 | * We sleep until all works which were queued on entry have been handled, |
397 | * but we are not livelocked by new incoming ones. | |
1da177e4 LT |
398 | * |
399 | * This function used to run the workqueues itself. Now we just wait for the | |
400 | * helper threads to do it. | |
401 | */ | |
402 | void fastcall flush_workqueue(struct workqueue_struct *wq) | |
403 | { | |
b1f4ec17 | 404 | const cpumask_t *cpu_map = wq_cpu_map(wq); |
cce1a165 | 405 | int cpu; |
1da177e4 | 406 | |
b1f4ec17 ON |
407 | might_sleep(); |
408 | for_each_cpu_mask(cpu, *cpu_map) | |
409 | flush_cpu_workqueue(per_cpu_ptr(wq->cpu_wq, cpu)); | |
1da177e4 | 410 | } |
ae90dd5d | 411 | EXPORT_SYMBOL_GPL(flush_workqueue); |
1da177e4 | 412 | |
b89deed3 ON |
413 | static void wait_on_work(struct cpu_workqueue_struct *cwq, |
414 | struct work_struct *work) | |
415 | { | |
416 | struct wq_barrier barr; | |
417 | int running = 0; | |
418 | ||
419 | spin_lock_irq(&cwq->lock); | |
420 | if (unlikely(cwq->current_work == work)) { | |
83c22520 | 421 | insert_wq_barrier(cwq, &barr, 0); |
b89deed3 ON |
422 | running = 1; |
423 | } | |
424 | spin_unlock_irq(&cwq->lock); | |
425 | ||
3af24433 | 426 | if (unlikely(running)) |
b89deed3 | 427 | wait_for_completion(&barr.done); |
b89deed3 ON |
428 | } |
429 | ||
430 | /** | |
431 | * flush_work - block until a work_struct's callback has terminated | |
432 | * @wq: the workqueue on which the work is queued | |
433 | * @work: the work which is to be flushed | |
434 | * | |
435 | * flush_work() will attempt to cancel the work if it is queued. If the work's | |
436 | * callback appears to be running, flush_work() will block until it has | |
437 | * completed. | |
438 | * | |
439 | * flush_work() is designed to be used when the caller is tearing down data | |
440 | * structures which the callback function operates upon. It is expected that, | |
441 | * prior to calling flush_work(), the caller has arranged for the work to not | |
442 | * be requeued. | |
443 | */ | |
444 | void flush_work(struct workqueue_struct *wq, struct work_struct *work) | |
445 | { | |
b1f4ec17 | 446 | const cpumask_t *cpu_map = wq_cpu_map(wq); |
b89deed3 | 447 | struct cpu_workqueue_struct *cwq; |
b1f4ec17 | 448 | int cpu; |
b89deed3 | 449 | |
f293ea92 ON |
450 | might_sleep(); |
451 | ||
b89deed3 ON |
452 | cwq = get_wq_data(work); |
453 | /* Was it ever queued ? */ | |
454 | if (!cwq) | |
3af24433 | 455 | return; |
b89deed3 ON |
456 | |
457 | /* | |
3af24433 ON |
458 | * This work can't be re-queued, no need to re-check that |
459 | * get_wq_data() is still the same when we take cwq->lock. | |
b89deed3 ON |
460 | */ |
461 | spin_lock_irq(&cwq->lock); | |
462 | list_del_init(&work->entry); | |
463 | work_release(work); | |
464 | spin_unlock_irq(&cwq->lock); | |
465 | ||
b1f4ec17 ON |
466 | for_each_cpu_mask(cpu, *cpu_map) |
467 | wait_on_work(per_cpu_ptr(wq->cpu_wq, cpu), work); | |
b89deed3 ON |
468 | } |
469 | EXPORT_SYMBOL_GPL(flush_work); | |
470 | ||
1da177e4 LT |
471 | |
472 | static struct workqueue_struct *keventd_wq; | |
473 | ||
0fcb78c2 REB |
474 | /** |
475 | * schedule_work - put work task in global workqueue | |
476 | * @work: job to be done | |
477 | * | |
478 | * This puts a job in the kernel-global workqueue. | |
479 | */ | |
1da177e4 LT |
480 | int fastcall schedule_work(struct work_struct *work) |
481 | { | |
482 | return queue_work(keventd_wq, work); | |
483 | } | |
ae90dd5d | 484 | EXPORT_SYMBOL(schedule_work); |
1da177e4 | 485 | |
0fcb78c2 REB |
486 | /** |
487 | * schedule_delayed_work - put work task in global workqueue after delay | |
52bad64d DH |
488 | * @dwork: job to be done |
489 | * @delay: number of jiffies to wait or 0 for immediate execution | |
0fcb78c2 REB |
490 | * |
491 | * After waiting for a given time this puts a job in the kernel-global | |
492 | * workqueue. | |
493 | */ | |
82f67cd9 IM |
494 | int fastcall schedule_delayed_work(struct delayed_work *dwork, |
495 | unsigned long delay) | |
1da177e4 | 496 | { |
82f67cd9 | 497 | timer_stats_timer_set_start_info(&dwork->timer); |
52bad64d | 498 | return queue_delayed_work(keventd_wq, dwork, delay); |
1da177e4 | 499 | } |
ae90dd5d | 500 | EXPORT_SYMBOL(schedule_delayed_work); |
1da177e4 | 501 | |
0fcb78c2 REB |
502 | /** |
503 | * schedule_delayed_work_on - queue work in global workqueue on CPU after delay | |
504 | * @cpu: cpu to use | |
52bad64d | 505 | * @dwork: job to be done |
0fcb78c2 REB |
506 | * @delay: number of jiffies to wait |
507 | * | |
508 | * After waiting for a given time this puts a job in the kernel-global | |
509 | * workqueue on the specified CPU. | |
510 | */ | |
1da177e4 | 511 | int schedule_delayed_work_on(int cpu, |
52bad64d | 512 | struct delayed_work *dwork, unsigned long delay) |
1da177e4 | 513 | { |
52bad64d | 514 | return queue_delayed_work_on(cpu, keventd_wq, dwork, delay); |
1da177e4 | 515 | } |
ae90dd5d | 516 | EXPORT_SYMBOL(schedule_delayed_work_on); |
1da177e4 | 517 | |
b6136773 AM |
518 | /** |
519 | * schedule_on_each_cpu - call a function on each online CPU from keventd | |
520 | * @func: the function to call | |
b6136773 AM |
521 | * |
522 | * Returns zero on success. | |
523 | * Returns -ve errno on failure. | |
524 | * | |
525 | * Appears to be racy against CPU hotplug. | |
526 | * | |
527 | * schedule_on_each_cpu() is very slow. | |
528 | */ | |
65f27f38 | 529 | int schedule_on_each_cpu(work_func_t func) |
15316ba8 CL |
530 | { |
531 | int cpu; | |
b6136773 | 532 | struct work_struct *works; |
15316ba8 | 533 | |
b6136773 AM |
534 | works = alloc_percpu(struct work_struct); |
535 | if (!works) | |
15316ba8 | 536 | return -ENOMEM; |
b6136773 | 537 | |
e18f3ffb | 538 | preempt_disable(); /* CPU hotplug */ |
15316ba8 | 539 | for_each_online_cpu(cpu) { |
9bfb1839 IM |
540 | struct work_struct *work = per_cpu_ptr(works, cpu); |
541 | ||
542 | INIT_WORK(work, func); | |
543 | set_bit(WORK_STRUCT_PENDING, work_data_bits(work)); | |
544 | __queue_work(per_cpu_ptr(keventd_wq->cpu_wq, cpu), work); | |
15316ba8 | 545 | } |
e18f3ffb | 546 | preempt_enable(); |
15316ba8 | 547 | flush_workqueue(keventd_wq); |
b6136773 | 548 | free_percpu(works); |
15316ba8 CL |
549 | return 0; |
550 | } | |
551 | ||
1da177e4 LT |
552 | void flush_scheduled_work(void) |
553 | { | |
554 | flush_workqueue(keventd_wq); | |
555 | } | |
ae90dd5d | 556 | EXPORT_SYMBOL(flush_scheduled_work); |
1da177e4 | 557 | |
b89deed3 ON |
558 | void flush_work_keventd(struct work_struct *work) |
559 | { | |
560 | flush_work(keventd_wq, work); | |
561 | } | |
562 | EXPORT_SYMBOL(flush_work_keventd); | |
563 | ||
1da177e4 | 564 | /** |
72fd4a35 | 565 | * cancel_rearming_delayed_workqueue - reliably kill off a delayed work whose handler rearms the delayed work. |
1da177e4 | 566 | * @wq: the controlling workqueue structure |
52bad64d | 567 | * @dwork: the delayed work struct |
1da177e4 | 568 | */ |
81ddef77 | 569 | void cancel_rearming_delayed_workqueue(struct workqueue_struct *wq, |
52bad64d | 570 | struct delayed_work *dwork) |
1da177e4 | 571 | { |
dfb4b82e ON |
572 | /* Was it ever queued ? */ |
573 | if (!get_wq_data(&dwork->work)) | |
574 | return; | |
575 | ||
52bad64d | 576 | while (!cancel_delayed_work(dwork)) |
1da177e4 LT |
577 | flush_workqueue(wq); |
578 | } | |
81ddef77 | 579 | EXPORT_SYMBOL(cancel_rearming_delayed_workqueue); |
1da177e4 LT |
580 | |
581 | /** | |
72fd4a35 | 582 | * cancel_rearming_delayed_work - reliably kill off a delayed keventd work whose handler rearms the delayed work. |
52bad64d | 583 | * @dwork: the delayed work struct |
1da177e4 | 584 | */ |
52bad64d | 585 | void cancel_rearming_delayed_work(struct delayed_work *dwork) |
1da177e4 | 586 | { |
52bad64d | 587 | cancel_rearming_delayed_workqueue(keventd_wq, dwork); |
1da177e4 LT |
588 | } |
589 | EXPORT_SYMBOL(cancel_rearming_delayed_work); | |
590 | ||
1fa44eca JB |
591 | /** |
592 | * execute_in_process_context - reliably execute the routine with user context | |
593 | * @fn: the function to execute | |
1fa44eca JB |
594 | * @ew: guaranteed storage for the execute work structure (must |
595 | * be available when the work executes) | |
596 | * | |
597 | * Executes the function immediately if process context is available, | |
598 | * otherwise schedules the function for delayed execution. | |
599 | * | |
600 | * Returns: 0 - function was executed | |
601 | * 1 - function was scheduled for execution | |
602 | */ | |
65f27f38 | 603 | int execute_in_process_context(work_func_t fn, struct execute_work *ew) |
1fa44eca JB |
604 | { |
605 | if (!in_interrupt()) { | |
65f27f38 | 606 | fn(&ew->work); |
1fa44eca JB |
607 | return 0; |
608 | } | |
609 | ||
65f27f38 | 610 | INIT_WORK(&ew->work, fn); |
1fa44eca JB |
611 | schedule_work(&ew->work); |
612 | ||
613 | return 1; | |
614 | } | |
615 | EXPORT_SYMBOL_GPL(execute_in_process_context); | |
616 | ||
1da177e4 LT |
617 | int keventd_up(void) |
618 | { | |
619 | return keventd_wq != NULL; | |
620 | } | |
621 | ||
622 | int current_is_keventd(void) | |
623 | { | |
624 | struct cpu_workqueue_struct *cwq; | |
625 | int cpu = smp_processor_id(); /* preempt-safe: keventd is per-cpu */ | |
626 | int ret = 0; | |
627 | ||
628 | BUG_ON(!keventd_wq); | |
629 | ||
89ada679 | 630 | cwq = per_cpu_ptr(keventd_wq->cpu_wq, cpu); |
1da177e4 LT |
631 | if (current == cwq->thread) |
632 | ret = 1; | |
633 | ||
634 | return ret; | |
635 | ||
636 | } | |
637 | ||
3af24433 ON |
638 | static struct cpu_workqueue_struct * |
639 | init_cpu_workqueue(struct workqueue_struct *wq, int cpu) | |
1da177e4 | 640 | { |
89ada679 | 641 | struct cpu_workqueue_struct *cwq = per_cpu_ptr(wq->cpu_wq, cpu); |
1da177e4 | 642 | |
3af24433 ON |
643 | cwq->wq = wq; |
644 | spin_lock_init(&cwq->lock); | |
645 | INIT_LIST_HEAD(&cwq->worklist); | |
646 | init_waitqueue_head(&cwq->more_work); | |
647 | ||
648 | return cwq; | |
1da177e4 LT |
649 | } |
650 | ||
3af24433 ON |
651 | static int create_workqueue_thread(struct cpu_workqueue_struct *cwq, int cpu) |
652 | { | |
653 | struct workqueue_struct *wq = cwq->wq; | |
654 | const char *fmt = is_single_threaded(wq) ? "%s" : "%s/%d"; | |
655 | struct task_struct *p; | |
656 | ||
657 | p = kthread_create(worker_thread, cwq, fmt, wq->name, cpu); | |
658 | /* | |
659 | * Nobody can add the work_struct to this cwq, | |
660 | * if (caller is __create_workqueue) | |
661 | * nobody should see this wq | |
662 | * else // caller is CPU_UP_PREPARE | |
663 | * cpu is not on cpu_online_map | |
664 | * so we can abort safely. | |
665 | */ | |
666 | if (IS_ERR(p)) | |
667 | return PTR_ERR(p); | |
668 | ||
669 | cwq->thread = p; | |
670 | cwq->should_stop = 0; | |
671 | if (!is_single_threaded(wq)) | |
672 | kthread_bind(p, cpu); | |
673 | ||
674 | if (is_single_threaded(wq) || cpu_online(cpu)) | |
675 | wake_up_process(p); | |
676 | ||
677 | return 0; | |
678 | } | |
679 | ||
680 | struct workqueue_struct *__create_workqueue(const char *name, | |
681 | int singlethread, int freezeable) | |
1da177e4 | 682 | { |
1da177e4 | 683 | struct workqueue_struct *wq; |
3af24433 ON |
684 | struct cpu_workqueue_struct *cwq; |
685 | int err = 0, cpu; | |
1da177e4 | 686 | |
3af24433 ON |
687 | wq = kzalloc(sizeof(*wq), GFP_KERNEL); |
688 | if (!wq) | |
689 | return NULL; | |
690 | ||
691 | wq->cpu_wq = alloc_percpu(struct cpu_workqueue_struct); | |
692 | if (!wq->cpu_wq) { | |
693 | kfree(wq); | |
694 | return NULL; | |
695 | } | |
696 | ||
697 | wq->name = name; | |
cce1a165 | 698 | wq->singlethread = singlethread; |
3af24433 | 699 | wq->freezeable = freezeable; |
cce1a165 | 700 | INIT_LIST_HEAD(&wq->list); |
3af24433 ON |
701 | |
702 | if (singlethread) { | |
3af24433 ON |
703 | cwq = init_cpu_workqueue(wq, singlethread_cpu); |
704 | err = create_workqueue_thread(cwq, singlethread_cpu); | |
705 | } else { | |
9b41ea72 | 706 | mutex_lock(&workqueue_mutex); |
3af24433 ON |
707 | list_add(&wq->list, &workqueues); |
708 | ||
709 | for_each_possible_cpu(cpu) { | |
710 | cwq = init_cpu_workqueue(wq, cpu); | |
711 | if (err || !cpu_online(cpu)) | |
712 | continue; | |
713 | err = create_workqueue_thread(cwq, cpu); | |
1da177e4 | 714 | } |
3af24433 ON |
715 | mutex_unlock(&workqueue_mutex); |
716 | } | |
717 | ||
718 | if (err) { | |
719 | destroy_workqueue(wq); | |
720 | wq = NULL; | |
721 | } | |
722 | return wq; | |
723 | } | |
724 | EXPORT_SYMBOL_GPL(__create_workqueue); | |
1da177e4 | 725 | |
3af24433 ON |
726 | static void cleanup_workqueue_thread(struct cpu_workqueue_struct *cwq, int cpu) |
727 | { | |
728 | struct wq_barrier barr; | |
729 | int alive = 0; | |
89ada679 | 730 | |
3af24433 ON |
731 | spin_lock_irq(&cwq->lock); |
732 | if (cwq->thread != NULL) { | |
733 | insert_wq_barrier(cwq, &barr, 1); | |
734 | cwq->should_stop = 1; | |
735 | alive = 1; | |
736 | } | |
737 | spin_unlock_irq(&cwq->lock); | |
738 | ||
739 | if (alive) { | |
740 | wait_for_completion(&barr.done); | |
741 | ||
742 | while (unlikely(cwq->thread != NULL)) | |
743 | cpu_relax(); | |
744 | /* | |
745 | * Wait until cwq->thread unlocks cwq->lock, | |
746 | * it won't touch *cwq after that. | |
747 | */ | |
748 | smp_rmb(); | |
749 | spin_unlock_wait(&cwq->lock); | |
750 | } | |
751 | } | |
752 | ||
753 | /** | |
754 | * destroy_workqueue - safely terminate a workqueue | |
755 | * @wq: target workqueue | |
756 | * | |
757 | * Safely destroy a workqueue. All work currently pending will be done first. | |
758 | */ | |
759 | void destroy_workqueue(struct workqueue_struct *wq) | |
760 | { | |
b1f4ec17 | 761 | const cpumask_t *cpu_map = wq_cpu_map(wq); |
3af24433 | 762 | struct cpu_workqueue_struct *cwq; |
b1f4ec17 | 763 | int cpu; |
3af24433 | 764 | |
b1f4ec17 ON |
765 | mutex_lock(&workqueue_mutex); |
766 | list_del(&wq->list); | |
767 | mutex_unlock(&workqueue_mutex); | |
3af24433 | 768 | |
b1f4ec17 ON |
769 | for_each_cpu_mask(cpu, *cpu_map) { |
770 | cwq = per_cpu_ptr(wq->cpu_wq, cpu); | |
771 | cleanup_workqueue_thread(cwq, cpu); | |
3af24433 | 772 | } |
9b41ea72 | 773 | |
3af24433 ON |
774 | free_percpu(wq->cpu_wq); |
775 | kfree(wq); | |
776 | } | |
777 | EXPORT_SYMBOL_GPL(destroy_workqueue); | |
778 | ||
779 | static int __devinit workqueue_cpu_callback(struct notifier_block *nfb, | |
780 | unsigned long action, | |
781 | void *hcpu) | |
782 | { | |
783 | unsigned int cpu = (unsigned long)hcpu; | |
784 | struct cpu_workqueue_struct *cwq; | |
785 | struct workqueue_struct *wq; | |
786 | ||
787 | switch (action) { | |
788 | case CPU_LOCK_ACQUIRE: | |
9b41ea72 | 789 | mutex_lock(&workqueue_mutex); |
3af24433 | 790 | return NOTIFY_OK; |
9b41ea72 | 791 | |
3af24433 | 792 | case CPU_LOCK_RELEASE: |
9b41ea72 | 793 | mutex_unlock(&workqueue_mutex); |
3af24433 | 794 | return NOTIFY_OK; |
1da177e4 | 795 | |
3af24433 ON |
796 | case CPU_UP_PREPARE: |
797 | cpu_set(cpu, cpu_populated_map); | |
798 | } | |
799 | ||
800 | list_for_each_entry(wq, &workqueues, list) { | |
801 | cwq = per_cpu_ptr(wq->cpu_wq, cpu); | |
802 | ||
803 | switch (action) { | |
804 | case CPU_UP_PREPARE: | |
805 | if (!create_workqueue_thread(cwq, cpu)) | |
806 | break; | |
807 | printk(KERN_ERR "workqueue for %i failed\n", cpu); | |
808 | return NOTIFY_BAD; | |
809 | ||
810 | case CPU_ONLINE: | |
811 | wake_up_process(cwq->thread); | |
812 | break; | |
813 | ||
814 | case CPU_UP_CANCELED: | |
815 | if (cwq->thread) | |
816 | wake_up_process(cwq->thread); | |
817 | case CPU_DEAD: | |
818 | cleanup_workqueue_thread(cwq, cpu); | |
819 | break; | |
820 | } | |
1da177e4 LT |
821 | } |
822 | ||
823 | return NOTIFY_OK; | |
824 | } | |
1da177e4 | 825 | |
c12920d1 | 826 | void __init init_workqueues(void) |
1da177e4 | 827 | { |
3af24433 | 828 | cpu_populated_map = cpu_online_map; |
f756d5e2 | 829 | singlethread_cpu = first_cpu(cpu_possible_map); |
b1f4ec17 | 830 | cpu_singlethread_map = cpumask_of_cpu(singlethread_cpu); |
1da177e4 LT |
831 | hotcpu_notifier(workqueue_cpu_callback, 0); |
832 | keventd_wq = create_workqueue("events"); | |
833 | BUG_ON(!keventd_wq); | |
834 | } |