2 * kernel/workqueue.c - generic async execution with shared worker pool
4 * Copyright (C) 2002 Ingo Molnar
6 * Derived from the taskqueue/keventd code by:
7 * David Woodhouse <dwmw2@infradead.org>
9 * Kai Petzke <wpp@marie.physik.tu-berlin.de>
10 * Theodore Ts'o <tytso@mit.edu>
12 * Made to use alloc_percpu by Christoph Lameter.
14 * Copyright (C) 2010 SUSE Linux Products GmbH
15 * Copyright (C) 2010 Tejun Heo <tj@kernel.org>
17 * This is the generic async execution mechanism. Work items as are
18 * executed in process context. The worker pool is shared and
19 * automatically managed. There is one worker pool for each CPU and
20 * one extra for works which are better served by workers which are
21 * not bound to any specific CPU.
23 * Please read Documentation/workqueue.txt for details.
26 #include <linux/export.h>
27 #include <linux/kernel.h>
28 #include <linux/sched.h>
29 #include <linux/init.h>
30 #include <linux/signal.h>
31 #include <linux/completion.h>
32 #include <linux/workqueue.h>
33 #include <linux/slab.h>
34 #include <linux/cpu.h>
35 #include <linux/notifier.h>
36 #include <linux/kthread.h>
37 #include <linux/hardirq.h>
38 #include <linux/mempolicy.h>
39 #include <linux/freezer.h>
40 #include <linux/kallsyms.h>
41 #include <linux/debug_locks.h>
42 #include <linux/lockdep.h>
43 #include <linux/idr.h>
45 #include "workqueue_sched.h"
51 * A bound gcwq is either associated or disassociated with its CPU.
52 * While associated (!DISASSOCIATED), all workers are bound to the
53 * CPU and none has %WORKER_UNBOUND set and concurrency management
56 * While DISASSOCIATED, the cpu may be offline and all workers have
57 * %WORKER_UNBOUND set and concurrency management disabled, and may
58 * be executing on any CPU. The gcwq behaves as an unbound one.
60 * Note that DISASSOCIATED can be flipped only while holding
61 * managership of all pools on the gcwq to avoid changing binding
62 * state while create_worker() is in progress.
64 GCWQ_DISASSOCIATED = 1 << 0, /* cpu can't serve workers */
65 GCWQ_FREEZING = 1 << 1, /* freeze in progress */
68 POOL_MANAGE_WORKERS = 1 << 0, /* need to manage workers */
71 WORKER_STARTED = 1 << 0, /* started */
72 WORKER_DIE = 1 << 1, /* die die die */
73 WORKER_IDLE = 1 << 2, /* is idle */
74 WORKER_PREP = 1 << 3, /* preparing to run works */
75 WORKER_REBIND = 1 << 5, /* mom is home, come back */
76 WORKER_CPU_INTENSIVE = 1 << 6, /* cpu intensive */
77 WORKER_UNBOUND = 1 << 7, /* worker is unbound */
79 WORKER_NOT_RUNNING = WORKER_PREP | WORKER_REBIND | WORKER_UNBOUND |
82 NR_WORKER_POOLS = 2, /* # worker pools per gcwq */
84 BUSY_WORKER_HASH_ORDER = 6, /* 64 pointers */
85 BUSY_WORKER_HASH_SIZE = 1 << BUSY_WORKER_HASH_ORDER,
86 BUSY_WORKER_HASH_MASK = BUSY_WORKER_HASH_SIZE - 1,
88 MAX_IDLE_WORKERS_RATIO = 4, /* 1/4 of busy can be idle */
89 IDLE_WORKER_TIMEOUT = 300 * HZ, /* keep idle ones for 5 mins */
91 MAYDAY_INITIAL_TIMEOUT = HZ / 100 >= 2 ? HZ / 100 : 2,
92 /* call for help after 10ms
94 MAYDAY_INTERVAL = HZ / 10, /* and then every 100ms */
95 CREATE_COOLDOWN = HZ, /* time to breath after fail */
98 * Rescue workers are used only on emergencies and shared by
101 RESCUER_NICE_LEVEL = -20,
102 HIGHPRI_NICE_LEVEL = -20,
106 * Structure fields follow one of the following exclusion rules.
108 * I: Modifiable by initialization/destruction paths and read-only for
111 * P: Preemption protected. Disabling preemption is enough and should
112 * only be modified and accessed from the local cpu.
114 * L: gcwq->lock protected. Access with gcwq->lock held.
116 * X: During normal operation, modification requires gcwq->lock and
117 * should be done only from local cpu. Either disabling preemption
118 * on local cpu or grabbing gcwq->lock is enough for read access.
119 * If GCWQ_DISASSOCIATED is set, it's identical to L.
121 * F: wq->flush_mutex protected.
123 * W: workqueue_lock protected.
131 * The poor guys doing the actual heavy lifting. All on-duty workers
132 * are either serving the manager role, on idle list or on busy hash.
135 /* on idle list while idle, on busy hash table while busy */
137 struct list_head entry; /* L: while idle */
138 struct hlist_node hentry; /* L: while busy */
141 struct work_struct *current_work; /* L: work being processed */
142 struct cpu_workqueue_struct *current_cwq; /* L: current_work's cwq */
143 struct list_head scheduled; /* L: scheduled works */
144 struct task_struct *task; /* I: worker task */
145 struct worker_pool *pool; /* I: the associated pool */
146 /* 64 bytes boundary on 64bit, 32 on 32bit */
147 unsigned long last_active; /* L: last active timestamp */
148 unsigned int flags; /* X: flags */
149 int id; /* I: worker id */
151 /* for rebinding worker to CPU */
152 struct idle_rebind *idle_rebind; /* L: for idle worker */
153 struct work_struct rebind_work; /* L: for busy worker */
157 struct global_cwq *gcwq; /* I: the owning gcwq */
158 unsigned int flags; /* X: flags */
160 struct list_head worklist; /* L: list of pending works */
161 int nr_workers; /* L: total number of workers */
162 int nr_idle; /* L: currently idle ones */
164 struct list_head idle_list; /* X: list of idle workers */
165 struct timer_list idle_timer; /* L: worker idle timeout */
166 struct timer_list mayday_timer; /* L: SOS timer for workers */
168 struct mutex manager_mutex; /* mutex manager should hold */
169 struct ida worker_ida; /* L: for worker IDs */
173 * Global per-cpu workqueue. There's one and only one for each cpu
174 * and all works are queued and processed here regardless of their
178 spinlock_t lock; /* the gcwq lock */
179 unsigned int cpu; /* I: the associated cpu */
180 unsigned int flags; /* L: GCWQ_* flags */
182 /* workers are chained either in busy_hash or pool idle_list */
183 struct hlist_head busy_hash[BUSY_WORKER_HASH_SIZE];
184 /* L: hash of busy workers */
186 struct worker_pool pools[2]; /* normal and highpri pools */
188 wait_queue_head_t rebind_hold; /* rebind hold wait */
189 } ____cacheline_aligned_in_smp;
192 * The per-CPU workqueue. The lower WORK_STRUCT_FLAG_BITS of
193 * work_struct->data are used for flags and thus cwqs need to be
194 * aligned at two's power of the number of flag bits.
196 struct cpu_workqueue_struct {
197 struct worker_pool *pool; /* I: the associated pool */
198 struct workqueue_struct *wq; /* I: the owning workqueue */
199 int work_color; /* L: current color */
200 int flush_color; /* L: flushing color */
201 int nr_in_flight[WORK_NR_COLORS];
202 /* L: nr of in_flight works */
203 int nr_active; /* L: nr of active works */
204 int max_active; /* L: max active works */
205 struct list_head delayed_works; /* L: delayed works */
209 * Structure used to wait for workqueue flush.
212 struct list_head list; /* F: list of flushers */
213 int flush_color; /* F: flush color waiting for */
214 struct completion done; /* flush completion */
218 * All cpumasks are assumed to be always set on UP and thus can't be
219 * used to determine whether there's something to be done.
222 typedef cpumask_var_t mayday_mask_t;
223 #define mayday_test_and_set_cpu(cpu, mask) \
224 cpumask_test_and_set_cpu((cpu), (mask))
225 #define mayday_clear_cpu(cpu, mask) cpumask_clear_cpu((cpu), (mask))
226 #define for_each_mayday_cpu(cpu, mask) for_each_cpu((cpu), (mask))
227 #define alloc_mayday_mask(maskp, gfp) zalloc_cpumask_var((maskp), (gfp))
228 #define free_mayday_mask(mask) free_cpumask_var((mask))
230 typedef unsigned long mayday_mask_t;
231 #define mayday_test_and_set_cpu(cpu, mask) test_and_set_bit(0, &(mask))
232 #define mayday_clear_cpu(cpu, mask) clear_bit(0, &(mask))
233 #define for_each_mayday_cpu(cpu, mask) if ((cpu) = 0, (mask))
234 #define alloc_mayday_mask(maskp, gfp) true
235 #define free_mayday_mask(mask) do { } while (0)
239 * The externally visible workqueue abstraction is an array of
240 * per-CPU workqueues:
242 struct workqueue_struct {
243 unsigned int flags; /* W: WQ_* flags */
245 struct cpu_workqueue_struct __percpu *pcpu;
246 struct cpu_workqueue_struct *single;
248 } cpu_wq; /* I: cwq's */
249 struct list_head list; /* W: list of all workqueues */
251 struct mutex flush_mutex; /* protects wq flushing */
252 int work_color; /* F: current work color */
253 int flush_color; /* F: current flush color */
254 atomic_t nr_cwqs_to_flush; /* flush in progress */
255 struct wq_flusher *first_flusher; /* F: first flusher */
256 struct list_head flusher_queue; /* F: flush waiters */
257 struct list_head flusher_overflow; /* F: flush overflow list */
259 mayday_mask_t mayday_mask; /* cpus requesting rescue */
260 struct worker *rescuer; /* I: rescue worker */
262 int nr_drainers; /* W: drain in progress */
263 int saved_max_active; /* W: saved cwq max_active */
264 #ifdef CONFIG_LOCKDEP
265 struct lockdep_map lockdep_map;
267 char name[]; /* I: workqueue name */
270 struct workqueue_struct *system_wq __read_mostly;
271 struct workqueue_struct *system_long_wq __read_mostly;
272 struct workqueue_struct *system_nrt_wq __read_mostly;
273 struct workqueue_struct *system_unbound_wq __read_mostly;
274 struct workqueue_struct *system_freezable_wq __read_mostly;
275 struct workqueue_struct *system_nrt_freezable_wq __read_mostly;
276 EXPORT_SYMBOL_GPL(system_wq);
277 EXPORT_SYMBOL_GPL(system_long_wq);
278 EXPORT_SYMBOL_GPL(system_nrt_wq);
279 EXPORT_SYMBOL_GPL(system_unbound_wq);
280 EXPORT_SYMBOL_GPL(system_freezable_wq);
281 EXPORT_SYMBOL_GPL(system_nrt_freezable_wq);
283 #define CREATE_TRACE_POINTS
284 #include <trace/events/workqueue.h>
286 #define for_each_worker_pool(pool, gcwq) \
287 for ((pool) = &(gcwq)->pools[0]; \
288 (pool) < &(gcwq)->pools[NR_WORKER_POOLS]; (pool)++)
290 #define for_each_busy_worker(worker, i, pos, gcwq) \
291 for (i = 0; i < BUSY_WORKER_HASH_SIZE; i++) \
292 hlist_for_each_entry(worker, pos, &gcwq->busy_hash[i], hentry)
294 static inline int __next_gcwq_cpu(int cpu, const struct cpumask *mask,
297 if (cpu < nr_cpu_ids) {
299 cpu = cpumask_next(cpu, mask);
300 if (cpu < nr_cpu_ids)
304 return WORK_CPU_UNBOUND;
306 return WORK_CPU_NONE;
309 static inline int __next_wq_cpu(int cpu, const struct cpumask *mask,
310 struct workqueue_struct *wq)
312 return __next_gcwq_cpu(cpu, mask, !(wq->flags & WQ_UNBOUND) ? 1 : 2);
318 * An extra gcwq is defined for an invalid cpu number
319 * (WORK_CPU_UNBOUND) to host workqueues which are not bound to any
320 * specific CPU. The following iterators are similar to
321 * for_each_*_cpu() iterators but also considers the unbound gcwq.
323 * for_each_gcwq_cpu() : possible CPUs + WORK_CPU_UNBOUND
324 * for_each_online_gcwq_cpu() : online CPUs + WORK_CPU_UNBOUND
325 * for_each_cwq_cpu() : possible CPUs for bound workqueues,
326 * WORK_CPU_UNBOUND for unbound workqueues
328 #define for_each_gcwq_cpu(cpu) \
329 for ((cpu) = __next_gcwq_cpu(-1, cpu_possible_mask, 3); \
330 (cpu) < WORK_CPU_NONE; \
331 (cpu) = __next_gcwq_cpu((cpu), cpu_possible_mask, 3))
333 #define for_each_online_gcwq_cpu(cpu) \
334 for ((cpu) = __next_gcwq_cpu(-1, cpu_online_mask, 3); \
335 (cpu) < WORK_CPU_NONE; \
336 (cpu) = __next_gcwq_cpu((cpu), cpu_online_mask, 3))
338 #define for_each_cwq_cpu(cpu, wq) \
339 for ((cpu) = __next_wq_cpu(-1, cpu_possible_mask, (wq)); \
340 (cpu) < WORK_CPU_NONE; \
341 (cpu) = __next_wq_cpu((cpu), cpu_possible_mask, (wq)))
343 #ifdef CONFIG_DEBUG_OBJECTS_WORK
345 static struct debug_obj_descr work_debug_descr;
347 static void *work_debug_hint(void *addr)
349 return ((struct work_struct *) addr)->func;
353 * fixup_init is called when:
354 * - an active object is initialized
356 static int work_fixup_init(void *addr, enum debug_obj_state state)
358 struct work_struct *work = addr;
361 case ODEBUG_STATE_ACTIVE:
362 cancel_work_sync(work);
363 debug_object_init(work, &work_debug_descr);
371 * fixup_activate is called when:
372 * - an active object is activated
373 * - an unknown object is activated (might be a statically initialized object)
375 static int work_fixup_activate(void *addr, enum debug_obj_state state)
377 struct work_struct *work = addr;
381 case ODEBUG_STATE_NOTAVAILABLE:
383 * This is not really a fixup. The work struct was
384 * statically initialized. We just make sure that it
385 * is tracked in the object tracker.
387 if (test_bit(WORK_STRUCT_STATIC_BIT, work_data_bits(work))) {
388 debug_object_init(work, &work_debug_descr);
389 debug_object_activate(work, &work_debug_descr);
395 case ODEBUG_STATE_ACTIVE:
404 * fixup_free is called when:
405 * - an active object is freed
407 static int work_fixup_free(void *addr, enum debug_obj_state state)
409 struct work_struct *work = addr;
412 case ODEBUG_STATE_ACTIVE:
413 cancel_work_sync(work);
414 debug_object_free(work, &work_debug_descr);
421 static struct debug_obj_descr work_debug_descr = {
422 .name = "work_struct",
423 .debug_hint = work_debug_hint,
424 .fixup_init = work_fixup_init,
425 .fixup_activate = work_fixup_activate,
426 .fixup_free = work_fixup_free,
429 static inline void debug_work_activate(struct work_struct *work)
431 debug_object_activate(work, &work_debug_descr);
434 static inline void debug_work_deactivate(struct work_struct *work)
436 debug_object_deactivate(work, &work_debug_descr);
439 void __init_work(struct work_struct *work, int onstack)
442 debug_object_init_on_stack(work, &work_debug_descr);
444 debug_object_init(work, &work_debug_descr);
446 EXPORT_SYMBOL_GPL(__init_work);
448 void destroy_work_on_stack(struct work_struct *work)
450 debug_object_free(work, &work_debug_descr);
452 EXPORT_SYMBOL_GPL(destroy_work_on_stack);
455 static inline void debug_work_activate(struct work_struct *work) { }
456 static inline void debug_work_deactivate(struct work_struct *work) { }
459 /* Serializes the accesses to the list of workqueues. */
460 static DEFINE_SPINLOCK(workqueue_lock);
461 static LIST_HEAD(workqueues);
462 static bool workqueue_freezing; /* W: have wqs started freezing? */
465 * The almighty global cpu workqueues. nr_running is the only field
466 * which is expected to be used frequently by other cpus via
467 * try_to_wake_up(). Put it in a separate cacheline.
469 static DEFINE_PER_CPU(struct global_cwq, global_cwq);
470 static DEFINE_PER_CPU_SHARED_ALIGNED(atomic_t, pool_nr_running[NR_WORKER_POOLS]);
473 * Global cpu workqueue and nr_running counter for unbound gcwq. The
474 * gcwq is always online, has GCWQ_DISASSOCIATED set, and all its
475 * workers have WORKER_UNBOUND set.
477 static struct global_cwq unbound_global_cwq;
478 static atomic_t unbound_pool_nr_running[NR_WORKER_POOLS] = {
479 [0 ... NR_WORKER_POOLS - 1] = ATOMIC_INIT(0), /* always 0 */
482 static int worker_thread(void *__worker);
484 static int worker_pool_pri(struct worker_pool *pool)
486 return pool - pool->gcwq->pools;
489 static struct global_cwq *get_gcwq(unsigned int cpu)
491 if (cpu != WORK_CPU_UNBOUND)
492 return &per_cpu(global_cwq, cpu);
494 return &unbound_global_cwq;
497 static atomic_t *get_pool_nr_running(struct worker_pool *pool)
499 int cpu = pool->gcwq->cpu;
500 int idx = worker_pool_pri(pool);
502 if (cpu != WORK_CPU_UNBOUND)
503 return &per_cpu(pool_nr_running, cpu)[idx];
505 return &unbound_pool_nr_running[idx];
508 static struct cpu_workqueue_struct *get_cwq(unsigned int cpu,
509 struct workqueue_struct *wq)
511 if (!(wq->flags & WQ_UNBOUND)) {
512 if (likely(cpu < nr_cpu_ids))
513 return per_cpu_ptr(wq->cpu_wq.pcpu, cpu);
514 } else if (likely(cpu == WORK_CPU_UNBOUND))
515 return wq->cpu_wq.single;
519 static unsigned int work_color_to_flags(int color)
521 return color << WORK_STRUCT_COLOR_SHIFT;
524 static int get_work_color(struct work_struct *work)
526 return (*work_data_bits(work) >> WORK_STRUCT_COLOR_SHIFT) &
527 ((1 << WORK_STRUCT_COLOR_BITS) - 1);
530 static int work_next_color(int color)
532 return (color + 1) % WORK_NR_COLORS;
536 * A work's data points to the cwq with WORK_STRUCT_CWQ set while the
537 * work is on queue. Once execution starts, WORK_STRUCT_CWQ is
538 * cleared and the work data contains the cpu number it was last on.
540 * set_work_cwq(), set_work_cpu_and_clear_pending() and clear_work_data()
541 * can be used to set the cwq, cpu or clear work->data. These functions
542 * should only be called while the work is owned - ie. while the PENDING
545 * get_work_[g]cwq() can be used to obtain the gcwq or cwq
546 * corresponding to a work. gcwq is available once the work has been
547 * queued anywhere after initialization. cwq is available only from
548 * queueing until execution starts.
550 static inline void set_work_data(struct work_struct *work, unsigned long data,
553 BUG_ON(!work_pending(work));
554 atomic_long_set(&work->data, data | flags | work_static(work));
557 static void set_work_cwq(struct work_struct *work,
558 struct cpu_workqueue_struct *cwq,
559 unsigned long extra_flags)
561 set_work_data(work, (unsigned long)cwq,
562 WORK_STRUCT_PENDING | WORK_STRUCT_CWQ | extra_flags);
565 static void set_work_cpu_and_clear_pending(struct work_struct *work,
568 set_work_data(work, cpu << WORK_STRUCT_FLAG_BITS, 0);
571 static void clear_work_data(struct work_struct *work)
573 set_work_data(work, WORK_STRUCT_NO_CPU, 0);
576 static struct cpu_workqueue_struct *get_work_cwq(struct work_struct *work)
578 unsigned long data = atomic_long_read(&work->data);
580 if (data & WORK_STRUCT_CWQ)
581 return (void *)(data & WORK_STRUCT_WQ_DATA_MASK);
586 static struct global_cwq *get_work_gcwq(struct work_struct *work)
588 unsigned long data = atomic_long_read(&work->data);
591 if (data & WORK_STRUCT_CWQ)
592 return ((struct cpu_workqueue_struct *)
593 (data & WORK_STRUCT_WQ_DATA_MASK))->pool->gcwq;
595 cpu = data >> WORK_STRUCT_FLAG_BITS;
596 if (cpu == WORK_CPU_NONE)
599 BUG_ON(cpu >= nr_cpu_ids && cpu != WORK_CPU_UNBOUND);
600 return get_gcwq(cpu);
604 * Policy functions. These define the policies on how the global worker
605 * pools are managed. Unless noted otherwise, these functions assume that
606 * they're being called with gcwq->lock held.
609 static bool __need_more_worker(struct worker_pool *pool)
611 return !atomic_read(get_pool_nr_running(pool));
615 * Need to wake up a worker? Called from anything but currently
618 * Note that, because unbound workers never contribute to nr_running, this
619 * function will always return %true for unbound gcwq as long as the
620 * worklist isn't empty.
622 static bool need_more_worker(struct worker_pool *pool)
624 return !list_empty(&pool->worklist) && __need_more_worker(pool);
627 /* Can I start working? Called from busy but !running workers. */
628 static bool may_start_working(struct worker_pool *pool)
630 return pool->nr_idle;
633 /* Do I need to keep working? Called from currently running workers. */
634 static bool keep_working(struct worker_pool *pool)
636 atomic_t *nr_running = get_pool_nr_running(pool);
638 return !list_empty(&pool->worklist) && atomic_read(nr_running) <= 1;
641 /* Do we need a new worker? Called from manager. */
642 static bool need_to_create_worker(struct worker_pool *pool)
644 return need_more_worker(pool) && !may_start_working(pool);
647 /* Do I need to be the manager? */
648 static bool need_to_manage_workers(struct worker_pool *pool)
650 return need_to_create_worker(pool) ||
651 (pool->flags & POOL_MANAGE_WORKERS);
654 /* Do we have too many workers and should some go away? */
655 static bool too_many_workers(struct worker_pool *pool)
657 bool managing = mutex_is_locked(&pool->manager_mutex);
658 int nr_idle = pool->nr_idle + managing; /* manager is considered idle */
659 int nr_busy = pool->nr_workers - nr_idle;
661 return nr_idle > 2 && (nr_idle - 2) * MAX_IDLE_WORKERS_RATIO >= nr_busy;
668 /* Return the first worker. Safe with preemption disabled */
669 static struct worker *first_worker(struct worker_pool *pool)
671 if (unlikely(list_empty(&pool->idle_list)))
674 return list_first_entry(&pool->idle_list, struct worker, entry);
678 * wake_up_worker - wake up an idle worker
679 * @pool: worker pool to wake worker from
681 * Wake up the first idle worker of @pool.
684 * spin_lock_irq(gcwq->lock).
686 static void wake_up_worker(struct worker_pool *pool)
688 struct worker *worker = first_worker(pool);
691 wake_up_process(worker->task);
695 * wq_worker_waking_up - a worker is waking up
696 * @task: task waking up
697 * @cpu: CPU @task is waking up to
699 * This function is called during try_to_wake_up() when a worker is
703 * spin_lock_irq(rq->lock)
705 void wq_worker_waking_up(struct task_struct *task, unsigned int cpu)
707 struct worker *worker = kthread_data(task);
709 if (!(worker->flags & WORKER_NOT_RUNNING))
710 atomic_inc(get_pool_nr_running(worker->pool));
714 * wq_worker_sleeping - a worker is going to sleep
715 * @task: task going to sleep
716 * @cpu: CPU in question, must be the current CPU number
718 * This function is called during schedule() when a busy worker is
719 * going to sleep. Worker on the same cpu can be woken up by
720 * returning pointer to its task.
723 * spin_lock_irq(rq->lock)
726 * Worker task on @cpu to wake up, %NULL if none.
728 struct task_struct *wq_worker_sleeping(struct task_struct *task,
731 struct worker *worker = kthread_data(task), *to_wakeup = NULL;
732 struct worker_pool *pool = worker->pool;
733 atomic_t *nr_running = get_pool_nr_running(pool);
735 if (worker->flags & WORKER_NOT_RUNNING)
738 /* this can only happen on the local cpu */
739 BUG_ON(cpu != raw_smp_processor_id());
742 * The counterpart of the following dec_and_test, implied mb,
743 * worklist not empty test sequence is in insert_work().
744 * Please read comment there.
746 * NOT_RUNNING is clear. This means that we're bound to and
747 * running on the local cpu w/ rq lock held and preemption
748 * disabled, which in turn means that none else could be
749 * manipulating idle_list, so dereferencing idle_list without gcwq
752 if (atomic_dec_and_test(nr_running) && !list_empty(&pool->worklist))
753 to_wakeup = first_worker(pool);
754 return to_wakeup ? to_wakeup->task : NULL;
758 * worker_set_flags - set worker flags and adjust nr_running accordingly
760 * @flags: flags to set
761 * @wakeup: wakeup an idle worker if necessary
763 * Set @flags in @worker->flags and adjust nr_running accordingly. If
764 * nr_running becomes zero and @wakeup is %true, an idle worker is
768 * spin_lock_irq(gcwq->lock)
770 static inline void worker_set_flags(struct worker *worker, unsigned int flags,
773 struct worker_pool *pool = worker->pool;
775 WARN_ON_ONCE(worker->task != current);
778 * If transitioning into NOT_RUNNING, adjust nr_running and
779 * wake up an idle worker as necessary if requested by
782 if ((flags & WORKER_NOT_RUNNING) &&
783 !(worker->flags & WORKER_NOT_RUNNING)) {
784 atomic_t *nr_running = get_pool_nr_running(pool);
787 if (atomic_dec_and_test(nr_running) &&
788 !list_empty(&pool->worklist))
789 wake_up_worker(pool);
791 atomic_dec(nr_running);
794 worker->flags |= flags;
798 * worker_clr_flags - clear worker flags and adjust nr_running accordingly
800 * @flags: flags to clear
802 * Clear @flags in @worker->flags and adjust nr_running accordingly.
805 * spin_lock_irq(gcwq->lock)
807 static inline void worker_clr_flags(struct worker *worker, unsigned int flags)
809 struct worker_pool *pool = worker->pool;
810 unsigned int oflags = worker->flags;
812 WARN_ON_ONCE(worker->task != current);
814 worker->flags &= ~flags;
817 * If transitioning out of NOT_RUNNING, increment nr_running. Note
818 * that the nested NOT_RUNNING is not a noop. NOT_RUNNING is mask
819 * of multiple flags, not a single flag.
821 if ((flags & WORKER_NOT_RUNNING) && (oflags & WORKER_NOT_RUNNING))
822 if (!(worker->flags & WORKER_NOT_RUNNING))
823 atomic_inc(get_pool_nr_running(pool));
827 * busy_worker_head - return the busy hash head for a work
828 * @gcwq: gcwq of interest
829 * @work: work to be hashed
831 * Return hash head of @gcwq for @work.
834 * spin_lock_irq(gcwq->lock).
837 * Pointer to the hash head.
839 static struct hlist_head *busy_worker_head(struct global_cwq *gcwq,
840 struct work_struct *work)
842 const int base_shift = ilog2(sizeof(struct work_struct));
843 unsigned long v = (unsigned long)work;
845 /* simple shift and fold hash, do we need something better? */
847 v += v >> BUSY_WORKER_HASH_ORDER;
848 v &= BUSY_WORKER_HASH_MASK;
850 return &gcwq->busy_hash[v];
854 * __find_worker_executing_work - find worker which is executing a work
855 * @gcwq: gcwq of interest
856 * @bwh: hash head as returned by busy_worker_head()
857 * @work: work to find worker for
859 * Find a worker which is executing @work on @gcwq. @bwh should be
860 * the hash head obtained by calling busy_worker_head() with the same
864 * spin_lock_irq(gcwq->lock).
867 * Pointer to worker which is executing @work if found, NULL
870 static struct worker *__find_worker_executing_work(struct global_cwq *gcwq,
871 struct hlist_head *bwh,
872 struct work_struct *work)
874 struct worker *worker;
875 struct hlist_node *tmp;
877 hlist_for_each_entry(worker, tmp, bwh, hentry)
878 if (worker->current_work == work)
884 * find_worker_executing_work - find worker which is executing a work
885 * @gcwq: gcwq of interest
886 * @work: work to find worker for
888 * Find a worker which is executing @work on @gcwq. This function is
889 * identical to __find_worker_executing_work() except that this
890 * function calculates @bwh itself.
893 * spin_lock_irq(gcwq->lock).
896 * Pointer to worker which is executing @work if found, NULL
899 static struct worker *find_worker_executing_work(struct global_cwq *gcwq,
900 struct work_struct *work)
902 return __find_worker_executing_work(gcwq, busy_worker_head(gcwq, work),
907 * insert_work - insert a work into gcwq
908 * @cwq: cwq @work belongs to
909 * @work: work to insert
910 * @head: insertion point
911 * @extra_flags: extra WORK_STRUCT_* flags to set
913 * Insert @work which belongs to @cwq into @gcwq after @head.
914 * @extra_flags is or'd to work_struct flags.
917 * spin_lock_irq(gcwq->lock).
919 static void insert_work(struct cpu_workqueue_struct *cwq,
920 struct work_struct *work, struct list_head *head,
921 unsigned int extra_flags)
923 struct worker_pool *pool = cwq->pool;
925 /* we own @work, set data and link */
926 set_work_cwq(work, cwq, extra_flags);
929 * Ensure that we get the right work->data if we see the
930 * result of list_add() below, see try_to_grab_pending().
934 list_add_tail(&work->entry, head);
937 * Ensure either worker_sched_deactivated() sees the above
938 * list_add_tail() or we see zero nr_running to avoid workers
939 * lying around lazily while there are works to be processed.
943 if (__need_more_worker(pool))
944 wake_up_worker(pool);
948 * Test whether @work is being queued from another work executing on the
949 * same workqueue. This is rather expensive and should only be used from
952 static bool is_chained_work(struct workqueue_struct *wq)
957 for_each_gcwq_cpu(cpu) {
958 struct global_cwq *gcwq = get_gcwq(cpu);
959 struct worker *worker;
960 struct hlist_node *pos;
963 spin_lock_irqsave(&gcwq->lock, flags);
964 for_each_busy_worker(worker, i, pos, gcwq) {
965 if (worker->task != current)
967 spin_unlock_irqrestore(&gcwq->lock, flags);
969 * I'm @worker, no locking necessary. See if @work
970 * is headed to the same workqueue.
972 return worker->current_cwq->wq == wq;
974 spin_unlock_irqrestore(&gcwq->lock, flags);
979 static void __queue_work(unsigned int cpu, struct workqueue_struct *wq,
980 struct work_struct *work)
982 struct global_cwq *gcwq;
983 struct cpu_workqueue_struct *cwq;
984 struct list_head *worklist;
985 unsigned int work_flags;
988 * While a work item is PENDING && off queue, a task trying to
989 * steal the PENDING will busy-loop waiting for it to either get
990 * queued or lose PENDING. Grabbing PENDING and queueing should
991 * happen with IRQ disabled.
993 WARN_ON_ONCE(!irqs_disabled());
995 debug_work_activate(work);
997 /* if dying, only works from the same workqueue are allowed */
998 if (unlikely(wq->flags & WQ_DRAINING) &&
999 WARN_ON_ONCE(!is_chained_work(wq)))
1002 /* determine gcwq to use */
1003 if (!(wq->flags & WQ_UNBOUND)) {
1004 struct global_cwq *last_gcwq;
1006 if (unlikely(cpu == WORK_CPU_UNBOUND))
1007 cpu = raw_smp_processor_id();
1010 * It's multi cpu. If @wq is non-reentrant and @work
1011 * was previously on a different cpu, it might still
1012 * be running there, in which case the work needs to
1013 * be queued on that cpu to guarantee non-reentrance.
1015 gcwq = get_gcwq(cpu);
1016 if (wq->flags & WQ_NON_REENTRANT &&
1017 (last_gcwq = get_work_gcwq(work)) && last_gcwq != gcwq) {
1018 struct worker *worker;
1020 spin_lock(&last_gcwq->lock);
1022 worker = find_worker_executing_work(last_gcwq, work);
1024 if (worker && worker->current_cwq->wq == wq)
1027 /* meh... not running there, queue here */
1028 spin_unlock(&last_gcwq->lock);
1029 spin_lock(&gcwq->lock);
1032 spin_lock(&gcwq->lock);
1035 gcwq = get_gcwq(WORK_CPU_UNBOUND);
1036 spin_lock(&gcwq->lock);
1039 /* gcwq determined, get cwq and queue */
1040 cwq = get_cwq(gcwq->cpu, wq);
1041 trace_workqueue_queue_work(cpu, cwq, work);
1043 if (WARN_ON(!list_empty(&work->entry))) {
1044 spin_unlock(&gcwq->lock);
1048 cwq->nr_in_flight[cwq->work_color]++;
1049 work_flags = work_color_to_flags(cwq->work_color);
1051 if (likely(cwq->nr_active < cwq->max_active)) {
1052 trace_workqueue_activate_work(work);
1054 worklist = &cwq->pool->worklist;
1056 work_flags |= WORK_STRUCT_DELAYED;
1057 worklist = &cwq->delayed_works;
1060 insert_work(cwq, work, worklist, work_flags);
1062 spin_unlock(&gcwq->lock);
1066 * queue_work_on - queue work on specific cpu
1067 * @cpu: CPU number to execute work on
1068 * @wq: workqueue to use
1069 * @work: work to queue
1071 * Returns %false if @work was already on a queue, %true otherwise.
1073 * We queue the work to a specific CPU, the caller must ensure it
1076 bool queue_work_on(int cpu, struct workqueue_struct *wq,
1077 struct work_struct *work)
1080 unsigned long flags;
1082 local_irq_save(flags);
1084 if (!test_and_set_bit(WORK_STRUCT_PENDING_BIT, work_data_bits(work))) {
1085 __queue_work(cpu, wq, work);
1089 local_irq_restore(flags);
1092 EXPORT_SYMBOL_GPL(queue_work_on);
1095 * queue_work - queue work on a workqueue
1096 * @wq: workqueue to use
1097 * @work: work to queue
1099 * Returns %false if @work was already on a queue, %true otherwise.
1101 * We queue the work to the CPU on which it was submitted, but if the CPU dies
1102 * it can be processed by another CPU.
1104 bool queue_work(struct workqueue_struct *wq, struct work_struct *work)
1108 ret = queue_work_on(get_cpu(), wq, work);
1113 EXPORT_SYMBOL_GPL(queue_work);
1115 static void delayed_work_timer_fn(unsigned long __data)
1117 struct delayed_work *dwork = (struct delayed_work *)__data;
1118 struct cpu_workqueue_struct *cwq = get_work_cwq(&dwork->work);
1120 local_irq_disable();
1121 __queue_work(smp_processor_id(), cwq->wq, &dwork->work);
1126 * queue_delayed_work_on - queue work on specific CPU after delay
1127 * @cpu: CPU number to execute work on
1128 * @wq: workqueue to use
1129 * @dwork: work to queue
1130 * @delay: number of jiffies to wait before queueing
1132 * Returns %false if @work was already on a queue, %true otherwise.
1134 bool queue_delayed_work_on(int cpu, struct workqueue_struct *wq,
1135 struct delayed_work *dwork, unsigned long delay)
1137 struct timer_list *timer = &dwork->timer;
1138 struct work_struct *work = &dwork->work;
1140 unsigned long flags;
1142 /* read the comment in __queue_work() */
1143 local_irq_save(flags);
1145 if (!test_and_set_bit(WORK_STRUCT_PENDING_BIT, work_data_bits(work))) {
1148 BUG_ON(timer_pending(timer));
1149 BUG_ON(!list_empty(&work->entry));
1151 timer_stats_timer_set_start_info(&dwork->timer);
1154 * This stores cwq for the moment, for the timer_fn.
1155 * Note that the work's gcwq is preserved to allow
1156 * reentrance detection for delayed works.
1158 if (!(wq->flags & WQ_UNBOUND)) {
1159 struct global_cwq *gcwq = get_work_gcwq(work);
1161 if (gcwq && gcwq->cpu != WORK_CPU_UNBOUND)
1164 lcpu = raw_smp_processor_id();
1166 lcpu = WORK_CPU_UNBOUND;
1168 set_work_cwq(work, get_cwq(lcpu, wq), 0);
1170 timer->expires = jiffies + delay;
1171 timer->data = (unsigned long)dwork;
1172 timer->function = delayed_work_timer_fn;
1174 if (unlikely(cpu >= 0))
1175 add_timer_on(timer, cpu);
1181 local_irq_restore(flags);
1184 EXPORT_SYMBOL_GPL(queue_delayed_work_on);
1187 * queue_delayed_work - queue work on a workqueue after delay
1188 * @wq: workqueue to use
1189 * @dwork: delayable work to queue
1190 * @delay: number of jiffies to wait before queueing
1192 * Returns %false if @work was already on a queue, %true otherwise.
1194 bool queue_delayed_work(struct workqueue_struct *wq,
1195 struct delayed_work *dwork, unsigned long delay)
1198 return queue_work(wq, &dwork->work);
1200 return queue_delayed_work_on(-1, wq, dwork, delay);
1202 EXPORT_SYMBOL_GPL(queue_delayed_work);
1205 * worker_enter_idle - enter idle state
1206 * @worker: worker which is entering idle state
1208 * @worker is entering idle state. Update stats and idle timer if
1212 * spin_lock_irq(gcwq->lock).
1214 static void worker_enter_idle(struct worker *worker)
1216 struct worker_pool *pool = worker->pool;
1217 struct global_cwq *gcwq = pool->gcwq;
1219 BUG_ON(worker->flags & WORKER_IDLE);
1220 BUG_ON(!list_empty(&worker->entry) &&
1221 (worker->hentry.next || worker->hentry.pprev));
1223 /* can't use worker_set_flags(), also called from start_worker() */
1224 worker->flags |= WORKER_IDLE;
1226 worker->last_active = jiffies;
1228 /* idle_list is LIFO */
1229 list_add(&worker->entry, &pool->idle_list);
1231 if (too_many_workers(pool) && !timer_pending(&pool->idle_timer))
1232 mod_timer(&pool->idle_timer, jiffies + IDLE_WORKER_TIMEOUT);
1235 * Sanity check nr_running. Because gcwq_unbind_fn() releases
1236 * gcwq->lock between setting %WORKER_UNBOUND and zapping
1237 * nr_running, the warning may trigger spuriously. Check iff
1238 * unbind is not in progress.
1240 WARN_ON_ONCE(!(gcwq->flags & GCWQ_DISASSOCIATED) &&
1241 pool->nr_workers == pool->nr_idle &&
1242 atomic_read(get_pool_nr_running(pool)));
1246 * worker_leave_idle - leave idle state
1247 * @worker: worker which is leaving idle state
1249 * @worker is leaving idle state. Update stats.
1252 * spin_lock_irq(gcwq->lock).
1254 static void worker_leave_idle(struct worker *worker)
1256 struct worker_pool *pool = worker->pool;
1258 BUG_ON(!(worker->flags & WORKER_IDLE));
1259 worker_clr_flags(worker, WORKER_IDLE);
1261 list_del_init(&worker->entry);
1265 * worker_maybe_bind_and_lock - bind worker to its cpu if possible and lock gcwq
1268 * Works which are scheduled while the cpu is online must at least be
1269 * scheduled to a worker which is bound to the cpu so that if they are
1270 * flushed from cpu callbacks while cpu is going down, they are
1271 * guaranteed to execute on the cpu.
1273 * This function is to be used by rogue workers and rescuers to bind
1274 * themselves to the target cpu and may race with cpu going down or
1275 * coming online. kthread_bind() can't be used because it may put the
1276 * worker to already dead cpu and set_cpus_allowed_ptr() can't be used
1277 * verbatim as it's best effort and blocking and gcwq may be
1278 * [dis]associated in the meantime.
1280 * This function tries set_cpus_allowed() and locks gcwq and verifies the
1281 * binding against %GCWQ_DISASSOCIATED which is set during
1282 * %CPU_DOWN_PREPARE and cleared during %CPU_ONLINE, so if the worker
1283 * enters idle state or fetches works without dropping lock, it can
1284 * guarantee the scheduling requirement described in the first paragraph.
1287 * Might sleep. Called without any lock but returns with gcwq->lock
1291 * %true if the associated gcwq is online (@worker is successfully
1292 * bound), %false if offline.
1294 static bool worker_maybe_bind_and_lock(struct worker *worker)
1295 __acquires(&gcwq->lock)
1297 struct global_cwq *gcwq = worker->pool->gcwq;
1298 struct task_struct *task = worker->task;
1302 * The following call may fail, succeed or succeed
1303 * without actually migrating the task to the cpu if
1304 * it races with cpu hotunplug operation. Verify
1305 * against GCWQ_DISASSOCIATED.
1307 if (!(gcwq->flags & GCWQ_DISASSOCIATED))
1308 set_cpus_allowed_ptr(task, get_cpu_mask(gcwq->cpu));
1310 spin_lock_irq(&gcwq->lock);
1311 if (gcwq->flags & GCWQ_DISASSOCIATED)
1313 if (task_cpu(task) == gcwq->cpu &&
1314 cpumask_equal(¤t->cpus_allowed,
1315 get_cpu_mask(gcwq->cpu)))
1317 spin_unlock_irq(&gcwq->lock);
1320 * We've raced with CPU hot[un]plug. Give it a breather
1321 * and retry migration. cond_resched() is required here;
1322 * otherwise, we might deadlock against cpu_stop trying to
1323 * bring down the CPU on non-preemptive kernel.
1330 struct idle_rebind {
1331 int cnt; /* # workers to be rebound */
1332 struct completion done; /* all workers rebound */
1336 * Rebind an idle @worker to its CPU. During CPU onlining, this has to
1337 * happen synchronously for idle workers. worker_thread() will test
1338 * %WORKER_REBIND before leaving idle and call this function.
1340 static void idle_worker_rebind(struct worker *worker)
1342 struct global_cwq *gcwq = worker->pool->gcwq;
1344 /* CPU must be online at this point */
1345 WARN_ON(!worker_maybe_bind_and_lock(worker));
1346 if (!--worker->idle_rebind->cnt)
1347 complete(&worker->idle_rebind->done);
1348 spin_unlock_irq(&worker->pool->gcwq->lock);
1350 /* we did our part, wait for rebind_workers() to finish up */
1351 wait_event(gcwq->rebind_hold, !(worker->flags & WORKER_REBIND));
1355 * Function for @worker->rebind.work used to rebind unbound busy workers to
1356 * the associated cpu which is coming back online. This is scheduled by
1357 * cpu up but can race with other cpu hotplug operations and may be
1358 * executed twice without intervening cpu down.
1360 static void busy_worker_rebind_fn(struct work_struct *work)
1362 struct worker *worker = container_of(work, struct worker, rebind_work);
1363 struct global_cwq *gcwq = worker->pool->gcwq;
1365 if (worker_maybe_bind_and_lock(worker))
1366 worker_clr_flags(worker, WORKER_REBIND);
1368 spin_unlock_irq(&gcwq->lock);
1372 * rebind_workers - rebind all workers of a gcwq to the associated CPU
1373 * @gcwq: gcwq of interest
1375 * @gcwq->cpu is coming online. Rebind all workers to the CPU. Rebinding
1376 * is different for idle and busy ones.
1378 * The idle ones should be rebound synchronously and idle rebinding should
1379 * be complete before any worker starts executing work items with
1380 * concurrency management enabled; otherwise, scheduler may oops trying to
1381 * wake up non-local idle worker from wq_worker_sleeping().
1383 * This is achieved by repeatedly requesting rebinding until all idle
1384 * workers are known to have been rebound under @gcwq->lock and holding all
1385 * idle workers from becoming busy until idle rebinding is complete.
1387 * Once idle workers are rebound, busy workers can be rebound as they
1388 * finish executing their current work items. Queueing the rebind work at
1389 * the head of their scheduled lists is enough. Note that nr_running will
1390 * be properbly bumped as busy workers rebind.
1392 * On return, all workers are guaranteed to either be bound or have rebind
1393 * work item scheduled.
1395 static void rebind_workers(struct global_cwq *gcwq)
1396 __releases(&gcwq->lock) __acquires(&gcwq->lock)
1398 struct idle_rebind idle_rebind;
1399 struct worker_pool *pool;
1400 struct worker *worker;
1401 struct hlist_node *pos;
1404 lockdep_assert_held(&gcwq->lock);
1406 for_each_worker_pool(pool, gcwq)
1407 lockdep_assert_held(&pool->manager_mutex);
1410 * Rebind idle workers. Interlocked both ways. We wait for
1411 * workers to rebind via @idle_rebind.done. Workers will wait for
1412 * us to finish up by watching %WORKER_REBIND.
1414 init_completion(&idle_rebind.done);
1416 idle_rebind.cnt = 1;
1417 INIT_COMPLETION(idle_rebind.done);
1419 /* set REBIND and kick idle ones, we'll wait for these later */
1420 for_each_worker_pool(pool, gcwq) {
1421 list_for_each_entry(worker, &pool->idle_list, entry) {
1422 if (worker->flags & WORKER_REBIND)
1425 /* morph UNBOUND to REBIND */
1426 worker->flags &= ~WORKER_UNBOUND;
1427 worker->flags |= WORKER_REBIND;
1430 worker->idle_rebind = &idle_rebind;
1432 /* worker_thread() will call idle_worker_rebind() */
1433 wake_up_process(worker->task);
1437 if (--idle_rebind.cnt) {
1438 spin_unlock_irq(&gcwq->lock);
1439 wait_for_completion(&idle_rebind.done);
1440 spin_lock_irq(&gcwq->lock);
1441 /* busy ones might have become idle while waiting, retry */
1446 * All idle workers are rebound and waiting for %WORKER_REBIND to
1447 * be cleared inside idle_worker_rebind(). Clear and release.
1448 * Clearing %WORKER_REBIND from this foreign context is safe
1449 * because these workers are still guaranteed to be idle.
1451 for_each_worker_pool(pool, gcwq)
1452 list_for_each_entry(worker, &pool->idle_list, entry)
1453 worker->flags &= ~WORKER_REBIND;
1455 wake_up_all(&gcwq->rebind_hold);
1457 /* rebind busy workers */
1458 for_each_busy_worker(worker, i, pos, gcwq) {
1459 struct work_struct *rebind_work = &worker->rebind_work;
1461 /* morph UNBOUND to REBIND */
1462 worker->flags &= ~WORKER_UNBOUND;
1463 worker->flags |= WORKER_REBIND;
1465 if (test_and_set_bit(WORK_STRUCT_PENDING_BIT,
1466 work_data_bits(rebind_work)))
1469 /* wq doesn't matter, use the default one */
1470 debug_work_activate(rebind_work);
1471 insert_work(get_cwq(gcwq->cpu, system_wq), rebind_work,
1472 worker->scheduled.next,
1473 work_color_to_flags(WORK_NO_COLOR));
1477 static struct worker *alloc_worker(void)
1479 struct worker *worker;
1481 worker = kzalloc(sizeof(*worker), GFP_KERNEL);
1483 INIT_LIST_HEAD(&worker->entry);
1484 INIT_LIST_HEAD(&worker->scheduled);
1485 INIT_WORK(&worker->rebind_work, busy_worker_rebind_fn);
1486 /* on creation a worker is in !idle && prep state */
1487 worker->flags = WORKER_PREP;
1493 * create_worker - create a new workqueue worker
1494 * @pool: pool the new worker will belong to
1496 * Create a new worker which is bound to @pool. The returned worker
1497 * can be started by calling start_worker() or destroyed using
1501 * Might sleep. Does GFP_KERNEL allocations.
1504 * Pointer to the newly created worker.
1506 static struct worker *create_worker(struct worker_pool *pool)
1508 struct global_cwq *gcwq = pool->gcwq;
1509 const char *pri = worker_pool_pri(pool) ? "H" : "";
1510 struct worker *worker = NULL;
1513 spin_lock_irq(&gcwq->lock);
1514 while (ida_get_new(&pool->worker_ida, &id)) {
1515 spin_unlock_irq(&gcwq->lock);
1516 if (!ida_pre_get(&pool->worker_ida, GFP_KERNEL))
1518 spin_lock_irq(&gcwq->lock);
1520 spin_unlock_irq(&gcwq->lock);
1522 worker = alloc_worker();
1526 worker->pool = pool;
1529 if (gcwq->cpu != WORK_CPU_UNBOUND)
1530 worker->task = kthread_create_on_node(worker_thread,
1531 worker, cpu_to_node(gcwq->cpu),
1532 "kworker/%u:%d%s", gcwq->cpu, id, pri);
1534 worker->task = kthread_create(worker_thread, worker,
1535 "kworker/u:%d%s", id, pri);
1536 if (IS_ERR(worker->task))
1539 if (worker_pool_pri(pool))
1540 set_user_nice(worker->task, HIGHPRI_NICE_LEVEL);
1543 * Determine CPU binding of the new worker depending on
1544 * %GCWQ_DISASSOCIATED. The caller is responsible for ensuring the
1545 * flag remains stable across this function. See the comments
1546 * above the flag definition for details.
1548 * As an unbound worker may later become a regular one if CPU comes
1549 * online, make sure every worker has %PF_THREAD_BOUND set.
1551 if (!(gcwq->flags & GCWQ_DISASSOCIATED)) {
1552 kthread_bind(worker->task, gcwq->cpu);
1554 worker->task->flags |= PF_THREAD_BOUND;
1555 worker->flags |= WORKER_UNBOUND;
1561 spin_lock_irq(&gcwq->lock);
1562 ida_remove(&pool->worker_ida, id);
1563 spin_unlock_irq(&gcwq->lock);
1570 * start_worker - start a newly created worker
1571 * @worker: worker to start
1573 * Make the gcwq aware of @worker and start it.
1576 * spin_lock_irq(gcwq->lock).
1578 static void start_worker(struct worker *worker)
1580 worker->flags |= WORKER_STARTED;
1581 worker->pool->nr_workers++;
1582 worker_enter_idle(worker);
1583 wake_up_process(worker->task);
1587 * destroy_worker - destroy a workqueue worker
1588 * @worker: worker to be destroyed
1590 * Destroy @worker and adjust @gcwq stats accordingly.
1593 * spin_lock_irq(gcwq->lock) which is released and regrabbed.
1595 static void destroy_worker(struct worker *worker)
1597 struct worker_pool *pool = worker->pool;
1598 struct global_cwq *gcwq = pool->gcwq;
1599 int id = worker->id;
1601 /* sanity check frenzy */
1602 BUG_ON(worker->current_work);
1603 BUG_ON(!list_empty(&worker->scheduled));
1605 if (worker->flags & WORKER_STARTED)
1607 if (worker->flags & WORKER_IDLE)
1610 list_del_init(&worker->entry);
1611 worker->flags |= WORKER_DIE;
1613 spin_unlock_irq(&gcwq->lock);
1615 kthread_stop(worker->task);
1618 spin_lock_irq(&gcwq->lock);
1619 ida_remove(&pool->worker_ida, id);
1622 static void idle_worker_timeout(unsigned long __pool)
1624 struct worker_pool *pool = (void *)__pool;
1625 struct global_cwq *gcwq = pool->gcwq;
1627 spin_lock_irq(&gcwq->lock);
1629 if (too_many_workers(pool)) {
1630 struct worker *worker;
1631 unsigned long expires;
1633 /* idle_list is kept in LIFO order, check the last one */
1634 worker = list_entry(pool->idle_list.prev, struct worker, entry);
1635 expires = worker->last_active + IDLE_WORKER_TIMEOUT;
1637 if (time_before(jiffies, expires))
1638 mod_timer(&pool->idle_timer, expires);
1640 /* it's been idle for too long, wake up manager */
1641 pool->flags |= POOL_MANAGE_WORKERS;
1642 wake_up_worker(pool);
1646 spin_unlock_irq(&gcwq->lock);
1649 static bool send_mayday(struct work_struct *work)
1651 struct cpu_workqueue_struct *cwq = get_work_cwq(work);
1652 struct workqueue_struct *wq = cwq->wq;
1655 if (!(wq->flags & WQ_RESCUER))
1658 /* mayday mayday mayday */
1659 cpu = cwq->pool->gcwq->cpu;
1660 /* WORK_CPU_UNBOUND can't be set in cpumask, use cpu 0 instead */
1661 if (cpu == WORK_CPU_UNBOUND)
1663 if (!mayday_test_and_set_cpu(cpu, wq->mayday_mask))
1664 wake_up_process(wq->rescuer->task);
1668 static void gcwq_mayday_timeout(unsigned long __pool)
1670 struct worker_pool *pool = (void *)__pool;
1671 struct global_cwq *gcwq = pool->gcwq;
1672 struct work_struct *work;
1674 spin_lock_irq(&gcwq->lock);
1676 if (need_to_create_worker(pool)) {
1678 * We've been trying to create a new worker but
1679 * haven't been successful. We might be hitting an
1680 * allocation deadlock. Send distress signals to
1683 list_for_each_entry(work, &pool->worklist, entry)
1687 spin_unlock_irq(&gcwq->lock);
1689 mod_timer(&pool->mayday_timer, jiffies + MAYDAY_INTERVAL);
1693 * maybe_create_worker - create a new worker if necessary
1694 * @pool: pool to create a new worker for
1696 * Create a new worker for @pool if necessary. @pool is guaranteed to
1697 * have at least one idle worker on return from this function. If
1698 * creating a new worker takes longer than MAYDAY_INTERVAL, mayday is
1699 * sent to all rescuers with works scheduled on @pool to resolve
1700 * possible allocation deadlock.
1702 * On return, need_to_create_worker() is guaranteed to be false and
1703 * may_start_working() true.
1706 * spin_lock_irq(gcwq->lock) which may be released and regrabbed
1707 * multiple times. Does GFP_KERNEL allocations. Called only from
1711 * false if no action was taken and gcwq->lock stayed locked, true
1714 static bool maybe_create_worker(struct worker_pool *pool)
1715 __releases(&gcwq->lock)
1716 __acquires(&gcwq->lock)
1718 struct global_cwq *gcwq = pool->gcwq;
1720 if (!need_to_create_worker(pool))
1723 spin_unlock_irq(&gcwq->lock);
1725 /* if we don't make progress in MAYDAY_INITIAL_TIMEOUT, call for help */
1726 mod_timer(&pool->mayday_timer, jiffies + MAYDAY_INITIAL_TIMEOUT);
1729 struct worker *worker;
1731 worker = create_worker(pool);
1733 del_timer_sync(&pool->mayday_timer);
1734 spin_lock_irq(&gcwq->lock);
1735 start_worker(worker);
1736 BUG_ON(need_to_create_worker(pool));
1740 if (!need_to_create_worker(pool))
1743 __set_current_state(TASK_INTERRUPTIBLE);
1744 schedule_timeout(CREATE_COOLDOWN);
1746 if (!need_to_create_worker(pool))
1750 del_timer_sync(&pool->mayday_timer);
1751 spin_lock_irq(&gcwq->lock);
1752 if (need_to_create_worker(pool))
1758 * maybe_destroy_worker - destroy workers which have been idle for a while
1759 * @pool: pool to destroy workers for
1761 * Destroy @pool workers which have been idle for longer than
1762 * IDLE_WORKER_TIMEOUT.
1765 * spin_lock_irq(gcwq->lock) which may be released and regrabbed
1766 * multiple times. Called only from manager.
1769 * false if no action was taken and gcwq->lock stayed locked, true
1772 static bool maybe_destroy_workers(struct worker_pool *pool)
1776 while (too_many_workers(pool)) {
1777 struct worker *worker;
1778 unsigned long expires;
1780 worker = list_entry(pool->idle_list.prev, struct worker, entry);
1781 expires = worker->last_active + IDLE_WORKER_TIMEOUT;
1783 if (time_before(jiffies, expires)) {
1784 mod_timer(&pool->idle_timer, expires);
1788 destroy_worker(worker);
1796 * manage_workers - manage worker pool
1799 * Assume the manager role and manage gcwq worker pool @worker belongs
1800 * to. At any given time, there can be only zero or one manager per
1801 * gcwq. The exclusion is handled automatically by this function.
1803 * The caller can safely start processing works on false return. On
1804 * true return, it's guaranteed that need_to_create_worker() is false
1805 * and may_start_working() is true.
1808 * spin_lock_irq(gcwq->lock) which may be released and regrabbed
1809 * multiple times. Does GFP_KERNEL allocations.
1812 * false if no action was taken and gcwq->lock stayed locked, true if
1813 * some action was taken.
1815 static bool manage_workers(struct worker *worker)
1817 struct worker_pool *pool = worker->pool;
1820 if (!mutex_trylock(&pool->manager_mutex))
1823 pool->flags &= ~POOL_MANAGE_WORKERS;
1826 * Destroy and then create so that may_start_working() is true
1829 ret |= maybe_destroy_workers(pool);
1830 ret |= maybe_create_worker(pool);
1832 mutex_unlock(&pool->manager_mutex);
1837 * move_linked_works - move linked works to a list
1838 * @work: start of series of works to be scheduled
1839 * @head: target list to append @work to
1840 * @nextp: out paramter for nested worklist walking
1842 * Schedule linked works starting from @work to @head. Work series to
1843 * be scheduled starts at @work and includes any consecutive work with
1844 * WORK_STRUCT_LINKED set in its predecessor.
1846 * If @nextp is not NULL, it's updated to point to the next work of
1847 * the last scheduled work. This allows move_linked_works() to be
1848 * nested inside outer list_for_each_entry_safe().
1851 * spin_lock_irq(gcwq->lock).
1853 static void move_linked_works(struct work_struct *work, struct list_head *head,
1854 struct work_struct **nextp)
1856 struct work_struct *n;
1859 * Linked worklist will always end before the end of the list,
1860 * use NULL for list head.
1862 list_for_each_entry_safe_from(work, n, NULL, entry) {
1863 list_move_tail(&work->entry, head);
1864 if (!(*work_data_bits(work) & WORK_STRUCT_LINKED))
1869 * If we're already inside safe list traversal and have moved
1870 * multiple works to the scheduled queue, the next position
1871 * needs to be updated.
1877 static void cwq_activate_first_delayed(struct cpu_workqueue_struct *cwq)
1879 struct work_struct *work = list_first_entry(&cwq->delayed_works,
1880 struct work_struct, entry);
1882 trace_workqueue_activate_work(work);
1883 move_linked_works(work, &cwq->pool->worklist, NULL);
1884 __clear_bit(WORK_STRUCT_DELAYED_BIT, work_data_bits(work));
1889 * cwq_dec_nr_in_flight - decrement cwq's nr_in_flight
1890 * @cwq: cwq of interest
1891 * @color: color of work which left the queue
1892 * @delayed: for a delayed work
1894 * A work either has completed or is removed from pending queue,
1895 * decrement nr_in_flight of its cwq and handle workqueue flushing.
1898 * spin_lock_irq(gcwq->lock).
1900 static void cwq_dec_nr_in_flight(struct cpu_workqueue_struct *cwq, int color,
1903 /* ignore uncolored works */
1904 if (color == WORK_NO_COLOR)
1907 cwq->nr_in_flight[color]--;
1911 if (!list_empty(&cwq->delayed_works)) {
1912 /* one down, submit a delayed one */
1913 if (cwq->nr_active < cwq->max_active)
1914 cwq_activate_first_delayed(cwq);
1918 /* is flush in progress and are we at the flushing tip? */
1919 if (likely(cwq->flush_color != color))
1922 /* are there still in-flight works? */
1923 if (cwq->nr_in_flight[color])
1926 /* this cwq is done, clear flush_color */
1927 cwq->flush_color = -1;
1930 * If this was the last cwq, wake up the first flusher. It
1931 * will handle the rest.
1933 if (atomic_dec_and_test(&cwq->wq->nr_cwqs_to_flush))
1934 complete(&cwq->wq->first_flusher->done);
1938 * process_one_work - process single work
1940 * @work: work to process
1942 * Process @work. This function contains all the logics necessary to
1943 * process a single work including synchronization against and
1944 * interaction with other workers on the same cpu, queueing and
1945 * flushing. As long as context requirement is met, any worker can
1946 * call this function to process a work.
1949 * spin_lock_irq(gcwq->lock) which is released and regrabbed.
1951 static void process_one_work(struct worker *worker, struct work_struct *work)
1952 __releases(&gcwq->lock)
1953 __acquires(&gcwq->lock)
1955 struct cpu_workqueue_struct *cwq = get_work_cwq(work);
1956 struct worker_pool *pool = worker->pool;
1957 struct global_cwq *gcwq = pool->gcwq;
1958 struct hlist_head *bwh = busy_worker_head(gcwq, work);
1959 bool cpu_intensive = cwq->wq->flags & WQ_CPU_INTENSIVE;
1960 work_func_t f = work->func;
1962 struct worker *collision;
1963 #ifdef CONFIG_LOCKDEP
1965 * It is permissible to free the struct work_struct from
1966 * inside the function that is called from it, this we need to
1967 * take into account for lockdep too. To avoid bogus "held
1968 * lock freed" warnings as well as problems when looking into
1969 * work->lockdep_map, make a copy and use that here.
1971 struct lockdep_map lockdep_map;
1973 lockdep_copy_map(&lockdep_map, &work->lockdep_map);
1976 * Ensure we're on the correct CPU. DISASSOCIATED test is
1977 * necessary to avoid spurious warnings from rescuers servicing the
1978 * unbound or a disassociated gcwq.
1980 WARN_ON_ONCE(!(worker->flags & (WORKER_UNBOUND | WORKER_REBIND)) &&
1981 !(gcwq->flags & GCWQ_DISASSOCIATED) &&
1982 raw_smp_processor_id() != gcwq->cpu);
1985 * A single work shouldn't be executed concurrently by
1986 * multiple workers on a single cpu. Check whether anyone is
1987 * already processing the work. If so, defer the work to the
1988 * currently executing one.
1990 collision = __find_worker_executing_work(gcwq, bwh, work);
1991 if (unlikely(collision)) {
1992 move_linked_works(work, &collision->scheduled, NULL);
1996 /* claim and dequeue */
1997 debug_work_deactivate(work);
1998 hlist_add_head(&worker->hentry, bwh);
1999 worker->current_work = work;
2000 worker->current_cwq = cwq;
2001 work_color = get_work_color(work);
2003 list_del_init(&work->entry);
2006 * CPU intensive works don't participate in concurrency
2007 * management. They're the scheduler's responsibility.
2009 if (unlikely(cpu_intensive))
2010 worker_set_flags(worker, WORKER_CPU_INTENSIVE, true);
2013 * Unbound gcwq isn't concurrency managed and work items should be
2014 * executed ASAP. Wake up another worker if necessary.
2016 if ((worker->flags & WORKER_UNBOUND) && need_more_worker(pool))
2017 wake_up_worker(pool);
2020 * Record the last CPU and clear PENDING. The following wmb is
2021 * paired with the implied mb in test_and_set_bit(PENDING) and
2022 * ensures all updates to @work made here are visible to and
2023 * precede any updates by the next PENDING owner. Also, clear
2024 * PENDING inside @gcwq->lock so that PENDING and queued state
2025 * changes happen together while IRQ is disabled.
2028 set_work_cpu_and_clear_pending(work, gcwq->cpu);
2030 spin_unlock_irq(&gcwq->lock);
2032 lock_map_acquire_read(&cwq->wq->lockdep_map);
2033 lock_map_acquire(&lockdep_map);
2034 trace_workqueue_execute_start(work);
2037 * While we must be careful to not use "work" after this, the trace
2038 * point will only record its address.
2040 trace_workqueue_execute_end(work);
2041 lock_map_release(&lockdep_map);
2042 lock_map_release(&cwq->wq->lockdep_map);
2044 if (unlikely(in_atomic() || lockdep_depth(current) > 0)) {
2045 printk(KERN_ERR "BUG: workqueue leaked lock or atomic: "
2047 current->comm, preempt_count(), task_pid_nr(current));
2048 printk(KERN_ERR " last function: ");
2049 print_symbol("%s\n", (unsigned long)f);
2050 debug_show_held_locks(current);
2054 spin_lock_irq(&gcwq->lock);
2056 /* clear cpu intensive status */
2057 if (unlikely(cpu_intensive))
2058 worker_clr_flags(worker, WORKER_CPU_INTENSIVE);
2060 /* we're done with it, release */
2061 hlist_del_init(&worker->hentry);
2062 worker->current_work = NULL;
2063 worker->current_cwq = NULL;
2064 cwq_dec_nr_in_flight(cwq, work_color, false);
2068 * process_scheduled_works - process scheduled works
2071 * Process all scheduled works. Please note that the scheduled list
2072 * may change while processing a work, so this function repeatedly
2073 * fetches a work from the top and executes it.
2076 * spin_lock_irq(gcwq->lock) which may be released and regrabbed
2079 static void process_scheduled_works(struct worker *worker)
2081 while (!list_empty(&worker->scheduled)) {
2082 struct work_struct *work = list_first_entry(&worker->scheduled,
2083 struct work_struct, entry);
2084 process_one_work(worker, work);
2089 * worker_thread - the worker thread function
2092 * The gcwq worker thread function. There's a single dynamic pool of
2093 * these per each cpu. These workers process all works regardless of
2094 * their specific target workqueue. The only exception is works which
2095 * belong to workqueues with a rescuer which will be explained in
2098 static int worker_thread(void *__worker)
2100 struct worker *worker = __worker;
2101 struct worker_pool *pool = worker->pool;
2102 struct global_cwq *gcwq = pool->gcwq;
2104 /* tell the scheduler that this is a workqueue worker */
2105 worker->task->flags |= PF_WQ_WORKER;
2107 spin_lock_irq(&gcwq->lock);
2110 * DIE can be set only while idle and REBIND set while busy has
2111 * @worker->rebind_work scheduled. Checking here is enough.
2113 if (unlikely(worker->flags & (WORKER_REBIND | WORKER_DIE))) {
2114 spin_unlock_irq(&gcwq->lock);
2116 if (worker->flags & WORKER_DIE) {
2117 worker->task->flags &= ~PF_WQ_WORKER;
2121 idle_worker_rebind(worker);
2125 worker_leave_idle(worker);
2127 /* no more worker necessary? */
2128 if (!need_more_worker(pool))
2131 /* do we need to manage? */
2132 if (unlikely(!may_start_working(pool)) && manage_workers(worker))
2136 * ->scheduled list can only be filled while a worker is
2137 * preparing to process a work or actually processing it.
2138 * Make sure nobody diddled with it while I was sleeping.
2140 BUG_ON(!list_empty(&worker->scheduled));
2143 * When control reaches this point, we're guaranteed to have
2144 * at least one idle worker or that someone else has already
2145 * assumed the manager role.
2147 worker_clr_flags(worker, WORKER_PREP);
2150 struct work_struct *work =
2151 list_first_entry(&pool->worklist,
2152 struct work_struct, entry);
2154 if (likely(!(*work_data_bits(work) & WORK_STRUCT_LINKED))) {
2155 /* optimization path, not strictly necessary */
2156 process_one_work(worker, work);
2157 if (unlikely(!list_empty(&worker->scheduled)))
2158 process_scheduled_works(worker);
2160 move_linked_works(work, &worker->scheduled, NULL);
2161 process_scheduled_works(worker);
2163 } while (keep_working(pool));
2165 worker_set_flags(worker, WORKER_PREP, false);
2167 if (unlikely(need_to_manage_workers(pool)) && manage_workers(worker))
2171 * gcwq->lock is held and there's no work to process and no
2172 * need to manage, sleep. Workers are woken up only while
2173 * holding gcwq->lock or from local cpu, so setting the
2174 * current state before releasing gcwq->lock is enough to
2175 * prevent losing any event.
2177 worker_enter_idle(worker);
2178 __set_current_state(TASK_INTERRUPTIBLE);
2179 spin_unlock_irq(&gcwq->lock);
2185 * rescuer_thread - the rescuer thread function
2186 * @__wq: the associated workqueue
2188 * Workqueue rescuer thread function. There's one rescuer for each
2189 * workqueue which has WQ_RESCUER set.
2191 * Regular work processing on a gcwq may block trying to create a new
2192 * worker which uses GFP_KERNEL allocation which has slight chance of
2193 * developing into deadlock if some works currently on the same queue
2194 * need to be processed to satisfy the GFP_KERNEL allocation. This is
2195 * the problem rescuer solves.
2197 * When such condition is possible, the gcwq summons rescuers of all
2198 * workqueues which have works queued on the gcwq and let them process
2199 * those works so that forward progress can be guaranteed.
2201 * This should happen rarely.
2203 static int rescuer_thread(void *__wq)
2205 struct workqueue_struct *wq = __wq;
2206 struct worker *rescuer = wq->rescuer;
2207 struct list_head *scheduled = &rescuer->scheduled;
2208 bool is_unbound = wq->flags & WQ_UNBOUND;
2211 set_user_nice(current, RESCUER_NICE_LEVEL);
2213 set_current_state(TASK_INTERRUPTIBLE);
2215 if (kthread_should_stop())
2219 * See whether any cpu is asking for help. Unbounded
2220 * workqueues use cpu 0 in mayday_mask for CPU_UNBOUND.
2222 for_each_mayday_cpu(cpu, wq->mayday_mask) {
2223 unsigned int tcpu = is_unbound ? WORK_CPU_UNBOUND : cpu;
2224 struct cpu_workqueue_struct *cwq = get_cwq(tcpu, wq);
2225 struct worker_pool *pool = cwq->pool;
2226 struct global_cwq *gcwq = pool->gcwq;
2227 struct work_struct *work, *n;
2229 __set_current_state(TASK_RUNNING);
2230 mayday_clear_cpu(cpu, wq->mayday_mask);
2232 /* migrate to the target cpu if possible */
2233 rescuer->pool = pool;
2234 worker_maybe_bind_and_lock(rescuer);
2237 * Slurp in all works issued via this workqueue and
2240 BUG_ON(!list_empty(&rescuer->scheduled));
2241 list_for_each_entry_safe(work, n, &pool->worklist, entry)
2242 if (get_work_cwq(work) == cwq)
2243 move_linked_works(work, scheduled, &n);
2245 process_scheduled_works(rescuer);
2248 * Leave this gcwq. If keep_working() is %true, notify a
2249 * regular worker; otherwise, we end up with 0 concurrency
2250 * and stalling the execution.
2252 if (keep_working(pool))
2253 wake_up_worker(pool);
2255 spin_unlock_irq(&gcwq->lock);
2263 struct work_struct work;
2264 struct completion done;
2267 static void wq_barrier_func(struct work_struct *work)
2269 struct wq_barrier *barr = container_of(work, struct wq_barrier, work);
2270 complete(&barr->done);
2274 * insert_wq_barrier - insert a barrier work
2275 * @cwq: cwq to insert barrier into
2276 * @barr: wq_barrier to insert
2277 * @target: target work to attach @barr to
2278 * @worker: worker currently executing @target, NULL if @target is not executing
2280 * @barr is linked to @target such that @barr is completed only after
2281 * @target finishes execution. Please note that the ordering
2282 * guarantee is observed only with respect to @target and on the local
2285 * Currently, a queued barrier can't be canceled. This is because
2286 * try_to_grab_pending() can't determine whether the work to be
2287 * grabbed is at the head of the queue and thus can't clear LINKED
2288 * flag of the previous work while there must be a valid next work
2289 * after a work with LINKED flag set.
2291 * Note that when @worker is non-NULL, @target may be modified
2292 * underneath us, so we can't reliably determine cwq from @target.
2295 * spin_lock_irq(gcwq->lock).
2297 static void insert_wq_barrier(struct cpu_workqueue_struct *cwq,
2298 struct wq_barrier *barr,
2299 struct work_struct *target, struct worker *worker)
2301 struct list_head *head;
2302 unsigned int linked = 0;
2305 * debugobject calls are safe here even with gcwq->lock locked
2306 * as we know for sure that this will not trigger any of the
2307 * checks and call back into the fixup functions where we
2310 INIT_WORK_ONSTACK(&barr->work, wq_barrier_func);
2311 __set_bit(WORK_STRUCT_PENDING_BIT, work_data_bits(&barr->work));
2312 init_completion(&barr->done);
2315 * If @target is currently being executed, schedule the
2316 * barrier to the worker; otherwise, put it after @target.
2319 head = worker->scheduled.next;
2321 unsigned long *bits = work_data_bits(target);
2323 head = target->entry.next;
2324 /* there can already be other linked works, inherit and set */
2325 linked = *bits & WORK_STRUCT_LINKED;
2326 __set_bit(WORK_STRUCT_LINKED_BIT, bits);
2329 debug_work_activate(&barr->work);
2330 insert_work(cwq, &barr->work, head,
2331 work_color_to_flags(WORK_NO_COLOR) | linked);
2335 * flush_workqueue_prep_cwqs - prepare cwqs for workqueue flushing
2336 * @wq: workqueue being flushed
2337 * @flush_color: new flush color, < 0 for no-op
2338 * @work_color: new work color, < 0 for no-op
2340 * Prepare cwqs for workqueue flushing.
2342 * If @flush_color is non-negative, flush_color on all cwqs should be
2343 * -1. If no cwq has in-flight commands at the specified color, all
2344 * cwq->flush_color's stay at -1 and %false is returned. If any cwq
2345 * has in flight commands, its cwq->flush_color is set to
2346 * @flush_color, @wq->nr_cwqs_to_flush is updated accordingly, cwq
2347 * wakeup logic is armed and %true is returned.
2349 * The caller should have initialized @wq->first_flusher prior to
2350 * calling this function with non-negative @flush_color. If
2351 * @flush_color is negative, no flush color update is done and %false
2354 * If @work_color is non-negative, all cwqs should have the same
2355 * work_color which is previous to @work_color and all will be
2356 * advanced to @work_color.
2359 * mutex_lock(wq->flush_mutex).
2362 * %true if @flush_color >= 0 and there's something to flush. %false
2365 static bool flush_workqueue_prep_cwqs(struct workqueue_struct *wq,
2366 int flush_color, int work_color)
2371 if (flush_color >= 0) {
2372 BUG_ON(atomic_read(&wq->nr_cwqs_to_flush));
2373 atomic_set(&wq->nr_cwqs_to_flush, 1);
2376 for_each_cwq_cpu(cpu, wq) {
2377 struct cpu_workqueue_struct *cwq = get_cwq(cpu, wq);
2378 struct global_cwq *gcwq = cwq->pool->gcwq;
2380 spin_lock_irq(&gcwq->lock);
2382 if (flush_color >= 0) {
2383 BUG_ON(cwq->flush_color != -1);
2385 if (cwq->nr_in_flight[flush_color]) {
2386 cwq->flush_color = flush_color;
2387 atomic_inc(&wq->nr_cwqs_to_flush);
2392 if (work_color >= 0) {
2393 BUG_ON(work_color != work_next_color(cwq->work_color));
2394 cwq->work_color = work_color;
2397 spin_unlock_irq(&gcwq->lock);
2400 if (flush_color >= 0 && atomic_dec_and_test(&wq->nr_cwqs_to_flush))
2401 complete(&wq->first_flusher->done);
2407 * flush_workqueue - ensure that any scheduled work has run to completion.
2408 * @wq: workqueue to flush
2410 * Forces execution of the workqueue and blocks until its completion.
2411 * This is typically used in driver shutdown handlers.
2413 * We sleep until all works which were queued on entry have been handled,
2414 * but we are not livelocked by new incoming ones.
2416 void flush_workqueue(struct workqueue_struct *wq)
2418 struct wq_flusher this_flusher = {
2419 .list = LIST_HEAD_INIT(this_flusher.list),
2421 .done = COMPLETION_INITIALIZER_ONSTACK(this_flusher.done),
2425 lock_map_acquire(&wq->lockdep_map);
2426 lock_map_release(&wq->lockdep_map);
2428 mutex_lock(&wq->flush_mutex);
2431 * Start-to-wait phase
2433 next_color = work_next_color(wq->work_color);
2435 if (next_color != wq->flush_color) {
2437 * Color space is not full. The current work_color
2438 * becomes our flush_color and work_color is advanced
2441 BUG_ON(!list_empty(&wq->flusher_overflow));
2442 this_flusher.flush_color = wq->work_color;
2443 wq->work_color = next_color;
2445 if (!wq->first_flusher) {
2446 /* no flush in progress, become the first flusher */
2447 BUG_ON(wq->flush_color != this_flusher.flush_color);
2449 wq->first_flusher = &this_flusher;
2451 if (!flush_workqueue_prep_cwqs(wq, wq->flush_color,
2453 /* nothing to flush, done */
2454 wq->flush_color = next_color;
2455 wq->first_flusher = NULL;
2460 BUG_ON(wq->flush_color == this_flusher.flush_color);
2461 list_add_tail(&this_flusher.list, &wq->flusher_queue);
2462 flush_workqueue_prep_cwqs(wq, -1, wq->work_color);
2466 * Oops, color space is full, wait on overflow queue.
2467 * The next flush completion will assign us
2468 * flush_color and transfer to flusher_queue.
2470 list_add_tail(&this_flusher.list, &wq->flusher_overflow);
2473 mutex_unlock(&wq->flush_mutex);
2475 wait_for_completion(&this_flusher.done);
2478 * Wake-up-and-cascade phase
2480 * First flushers are responsible for cascading flushes and
2481 * handling overflow. Non-first flushers can simply return.
2483 if (wq->first_flusher != &this_flusher)
2486 mutex_lock(&wq->flush_mutex);
2488 /* we might have raced, check again with mutex held */
2489 if (wq->first_flusher != &this_flusher)
2492 wq->first_flusher = NULL;
2494 BUG_ON(!list_empty(&this_flusher.list));
2495 BUG_ON(wq->flush_color != this_flusher.flush_color);
2498 struct wq_flusher *next, *tmp;
2500 /* complete all the flushers sharing the current flush color */
2501 list_for_each_entry_safe(next, tmp, &wq->flusher_queue, list) {
2502 if (next->flush_color != wq->flush_color)
2504 list_del_init(&next->list);
2505 complete(&next->done);
2508 BUG_ON(!list_empty(&wq->flusher_overflow) &&
2509 wq->flush_color != work_next_color(wq->work_color));
2511 /* this flush_color is finished, advance by one */
2512 wq->flush_color = work_next_color(wq->flush_color);
2514 /* one color has been freed, handle overflow queue */
2515 if (!list_empty(&wq->flusher_overflow)) {
2517 * Assign the same color to all overflowed
2518 * flushers, advance work_color and append to
2519 * flusher_queue. This is the start-to-wait
2520 * phase for these overflowed flushers.
2522 list_for_each_entry(tmp, &wq->flusher_overflow, list)
2523 tmp->flush_color = wq->work_color;
2525 wq->work_color = work_next_color(wq->work_color);
2527 list_splice_tail_init(&wq->flusher_overflow,
2528 &wq->flusher_queue);
2529 flush_workqueue_prep_cwqs(wq, -1, wq->work_color);
2532 if (list_empty(&wq->flusher_queue)) {
2533 BUG_ON(wq->flush_color != wq->work_color);
2538 * Need to flush more colors. Make the next flusher
2539 * the new first flusher and arm cwqs.
2541 BUG_ON(wq->flush_color == wq->work_color);
2542 BUG_ON(wq->flush_color != next->flush_color);
2544 list_del_init(&next->list);
2545 wq->first_flusher = next;
2547 if (flush_workqueue_prep_cwqs(wq, wq->flush_color, -1))
2551 * Meh... this color is already done, clear first
2552 * flusher and repeat cascading.
2554 wq->first_flusher = NULL;
2558 mutex_unlock(&wq->flush_mutex);
2560 EXPORT_SYMBOL_GPL(flush_workqueue);
2563 * drain_workqueue - drain a workqueue
2564 * @wq: workqueue to drain
2566 * Wait until the workqueue becomes empty. While draining is in progress,
2567 * only chain queueing is allowed. IOW, only currently pending or running
2568 * work items on @wq can queue further work items on it. @wq is flushed
2569 * repeatedly until it becomes empty. The number of flushing is detemined
2570 * by the depth of chaining and should be relatively short. Whine if it
2573 void drain_workqueue(struct workqueue_struct *wq)
2575 unsigned int flush_cnt = 0;
2579 * __queue_work() needs to test whether there are drainers, is much
2580 * hotter than drain_workqueue() and already looks at @wq->flags.
2581 * Use WQ_DRAINING so that queue doesn't have to check nr_drainers.
2583 spin_lock(&workqueue_lock);
2584 if (!wq->nr_drainers++)
2585 wq->flags |= WQ_DRAINING;
2586 spin_unlock(&workqueue_lock);
2588 flush_workqueue(wq);
2590 for_each_cwq_cpu(cpu, wq) {
2591 struct cpu_workqueue_struct *cwq = get_cwq(cpu, wq);
2594 spin_lock_irq(&cwq->pool->gcwq->lock);
2595 drained = !cwq->nr_active && list_empty(&cwq->delayed_works);
2596 spin_unlock_irq(&cwq->pool->gcwq->lock);
2601 if (++flush_cnt == 10 ||
2602 (flush_cnt % 100 == 0 && flush_cnt <= 1000))
2603 pr_warning("workqueue %s: flush on destruction isn't complete after %u tries\n",
2604 wq->name, flush_cnt);
2608 spin_lock(&workqueue_lock);
2609 if (!--wq->nr_drainers)
2610 wq->flags &= ~WQ_DRAINING;
2611 spin_unlock(&workqueue_lock);
2613 EXPORT_SYMBOL_GPL(drain_workqueue);
2615 static bool start_flush_work(struct work_struct *work, struct wq_barrier *barr,
2616 bool wait_executing)
2618 struct worker *worker = NULL;
2619 struct global_cwq *gcwq;
2620 struct cpu_workqueue_struct *cwq;
2623 gcwq = get_work_gcwq(work);
2627 spin_lock_irq(&gcwq->lock);
2628 if (!list_empty(&work->entry)) {
2630 * See the comment near try_to_grab_pending()->smp_rmb().
2631 * If it was re-queued to a different gcwq under us, we
2632 * are not going to wait.
2635 cwq = get_work_cwq(work);
2636 if (unlikely(!cwq || gcwq != cwq->pool->gcwq))
2638 } else if (wait_executing) {
2639 worker = find_worker_executing_work(gcwq, work);
2642 cwq = worker->current_cwq;
2646 insert_wq_barrier(cwq, barr, work, worker);
2647 spin_unlock_irq(&gcwq->lock);
2650 * If @max_active is 1 or rescuer is in use, flushing another work
2651 * item on the same workqueue may lead to deadlock. Make sure the
2652 * flusher is not running on the same workqueue by verifying write
2655 if (cwq->wq->saved_max_active == 1 || cwq->wq->flags & WQ_RESCUER)
2656 lock_map_acquire(&cwq->wq->lockdep_map);
2658 lock_map_acquire_read(&cwq->wq->lockdep_map);
2659 lock_map_release(&cwq->wq->lockdep_map);
2663 spin_unlock_irq(&gcwq->lock);
2668 * flush_work - wait for a work to finish executing the last queueing instance
2669 * @work: the work to flush
2671 * Wait until @work has finished execution. This function considers
2672 * only the last queueing instance of @work. If @work has been
2673 * enqueued across different CPUs on a non-reentrant workqueue or on
2674 * multiple workqueues, @work might still be executing on return on
2675 * some of the CPUs from earlier queueing.
2677 * If @work was queued only on a non-reentrant, ordered or unbound
2678 * workqueue, @work is guaranteed to be idle on return if it hasn't
2679 * been requeued since flush started.
2682 * %true if flush_work() waited for the work to finish execution,
2683 * %false if it was already idle.
2685 bool flush_work(struct work_struct *work)
2687 struct wq_barrier barr;
2689 lock_map_acquire(&work->lockdep_map);
2690 lock_map_release(&work->lockdep_map);
2692 if (start_flush_work(work, &barr, true)) {
2693 wait_for_completion(&barr.done);
2694 destroy_work_on_stack(&barr.work);
2699 EXPORT_SYMBOL_GPL(flush_work);
2701 static bool wait_on_cpu_work(struct global_cwq *gcwq, struct work_struct *work)
2703 struct wq_barrier barr;
2704 struct worker *worker;
2706 spin_lock_irq(&gcwq->lock);
2708 worker = find_worker_executing_work(gcwq, work);
2709 if (unlikely(worker))
2710 insert_wq_barrier(worker->current_cwq, &barr, work, worker);
2712 spin_unlock_irq(&gcwq->lock);
2714 if (unlikely(worker)) {
2715 wait_for_completion(&barr.done);
2716 destroy_work_on_stack(&barr.work);
2722 static bool wait_on_work(struct work_struct *work)
2729 lock_map_acquire(&work->lockdep_map);
2730 lock_map_release(&work->lockdep_map);
2732 for_each_gcwq_cpu(cpu)
2733 ret |= wait_on_cpu_work(get_gcwq(cpu), work);
2738 * flush_work_sync - wait until a work has finished execution
2739 * @work: the work to flush
2741 * Wait until @work has finished execution. On return, it's
2742 * guaranteed that all queueing instances of @work which happened
2743 * before this function is called are finished. In other words, if
2744 * @work hasn't been requeued since this function was called, @work is
2745 * guaranteed to be idle on return.
2748 * %true if flush_work_sync() waited for the work to finish execution,
2749 * %false if it was already idle.
2751 bool flush_work_sync(struct work_struct *work)
2753 struct wq_barrier barr;
2754 bool pending, waited;
2756 /* we'll wait for executions separately, queue barr only if pending */
2757 pending = start_flush_work(work, &barr, false);
2759 /* wait for executions to finish */
2760 waited = wait_on_work(work);
2762 /* wait for the pending one */
2764 wait_for_completion(&barr.done);
2765 destroy_work_on_stack(&barr.work);
2768 return pending || waited;
2770 EXPORT_SYMBOL_GPL(flush_work_sync);
2773 * Upon a successful return (>= 0), the caller "owns" WORK_STRUCT_PENDING bit,
2774 * so this work can't be re-armed in any way.
2776 static int try_to_grab_pending(struct work_struct *work)
2778 struct global_cwq *gcwq;
2781 if (!test_and_set_bit(WORK_STRUCT_PENDING_BIT, work_data_bits(work)))
2785 * The queueing is in progress, or it is already queued. Try to
2786 * steal it from ->worklist without clearing WORK_STRUCT_PENDING.
2788 gcwq = get_work_gcwq(work);
2792 spin_lock_irq(&gcwq->lock);
2793 if (!list_empty(&work->entry)) {
2795 * This work is queued, but perhaps we locked the wrong gcwq.
2796 * In that case we must see the new value after rmb(), see
2797 * insert_work()->wmb().
2800 if (gcwq == get_work_gcwq(work)) {
2801 debug_work_deactivate(work);
2802 list_del_init(&work->entry);
2803 cwq_dec_nr_in_flight(get_work_cwq(work),
2804 get_work_color(work),
2805 *work_data_bits(work) & WORK_STRUCT_DELAYED);
2809 spin_unlock_irq(&gcwq->lock);
2814 static bool __cancel_work_timer(struct work_struct *work,
2815 struct timer_list* timer)
2820 ret = (timer && likely(del_timer(timer)));
2822 ret = try_to_grab_pending(work);
2824 } while (unlikely(ret < 0));
2826 clear_work_data(work);
2831 * cancel_work_sync - cancel a work and wait for it to finish
2832 * @work: the work to cancel
2834 * Cancel @work and wait for its execution to finish. This function
2835 * can be used even if the work re-queues itself or migrates to
2836 * another workqueue. On return from this function, @work is
2837 * guaranteed to be not pending or executing on any CPU.
2839 * cancel_work_sync(&delayed_work->work) must not be used for
2840 * delayed_work's. Use cancel_delayed_work_sync() instead.
2842 * The caller must ensure that the workqueue on which @work was last
2843 * queued can't be destroyed before this function returns.
2846 * %true if @work was pending, %false otherwise.
2848 bool cancel_work_sync(struct work_struct *work)
2850 return __cancel_work_timer(work, NULL);
2852 EXPORT_SYMBOL_GPL(cancel_work_sync);
2855 * flush_delayed_work - wait for a dwork to finish executing the last queueing
2856 * @dwork: the delayed work to flush
2858 * Delayed timer is cancelled and the pending work is queued for
2859 * immediate execution. Like flush_work(), this function only
2860 * considers the last queueing instance of @dwork.
2863 * %true if flush_work() waited for the work to finish execution,
2864 * %false if it was already idle.
2866 bool flush_delayed_work(struct delayed_work *dwork)
2868 local_irq_disable();
2869 if (del_timer_sync(&dwork->timer))
2870 __queue_work(raw_smp_processor_id(),
2871 get_work_cwq(&dwork->work)->wq, &dwork->work);
2873 return flush_work(&dwork->work);
2875 EXPORT_SYMBOL(flush_delayed_work);
2878 * flush_delayed_work_sync - wait for a dwork to finish
2879 * @dwork: the delayed work to flush
2881 * Delayed timer is cancelled and the pending work is queued for
2882 * execution immediately. Other than timer handling, its behavior
2883 * is identical to flush_work_sync().
2886 * %true if flush_work_sync() waited for the work to finish execution,
2887 * %false if it was already idle.
2889 bool flush_delayed_work_sync(struct delayed_work *dwork)
2891 local_irq_disable();
2892 if (del_timer_sync(&dwork->timer))
2893 __queue_work(raw_smp_processor_id(),
2894 get_work_cwq(&dwork->work)->wq, &dwork->work);
2896 return flush_work_sync(&dwork->work);
2898 EXPORT_SYMBOL(flush_delayed_work_sync);
2901 * cancel_delayed_work_sync - cancel a delayed work and wait for it to finish
2902 * @dwork: the delayed work cancel
2904 * This is cancel_work_sync() for delayed works.
2907 * %true if @dwork was pending, %false otherwise.
2909 bool cancel_delayed_work_sync(struct delayed_work *dwork)
2911 return __cancel_work_timer(&dwork->work, &dwork->timer);
2913 EXPORT_SYMBOL(cancel_delayed_work_sync);
2916 * schedule_work_on - put work task on a specific cpu
2917 * @cpu: cpu to put the work task on
2918 * @work: job to be done
2920 * This puts a job on a specific cpu
2922 bool schedule_work_on(int cpu, struct work_struct *work)
2924 return queue_work_on(cpu, system_wq, work);
2926 EXPORT_SYMBOL(schedule_work_on);
2929 * schedule_work - put work task in global workqueue
2930 * @work: job to be done
2932 * Returns %false if @work was already on the kernel-global workqueue and
2935 * This puts a job in the kernel-global workqueue if it was not already
2936 * queued and leaves it in the same position on the kernel-global
2937 * workqueue otherwise.
2939 bool schedule_work(struct work_struct *work)
2941 return queue_work(system_wq, work);
2943 EXPORT_SYMBOL(schedule_work);
2946 * schedule_delayed_work_on - queue work in global workqueue on CPU after delay
2948 * @dwork: job to be done
2949 * @delay: number of jiffies to wait
2951 * After waiting for a given time this puts a job in the kernel-global
2952 * workqueue on the specified CPU.
2954 bool schedule_delayed_work_on(int cpu, struct delayed_work *dwork,
2955 unsigned long delay)
2957 return queue_delayed_work_on(cpu, system_wq, dwork, delay);
2959 EXPORT_SYMBOL(schedule_delayed_work_on);
2962 * schedule_delayed_work - put work task in global workqueue after delay
2963 * @dwork: job to be done
2964 * @delay: number of jiffies to wait or 0 for immediate execution
2966 * After waiting for a given time this puts a job in the kernel-global
2969 bool schedule_delayed_work(struct delayed_work *dwork, unsigned long delay)
2971 return queue_delayed_work(system_wq, dwork, delay);
2973 EXPORT_SYMBOL(schedule_delayed_work);
2976 * schedule_on_each_cpu - execute a function synchronously on each online CPU
2977 * @func: the function to call
2979 * schedule_on_each_cpu() executes @func on each online CPU using the
2980 * system workqueue and blocks until all CPUs have completed.
2981 * schedule_on_each_cpu() is very slow.
2984 * 0 on success, -errno on failure.
2986 int schedule_on_each_cpu(work_func_t func)
2989 struct work_struct __percpu *works;
2991 works = alloc_percpu(struct work_struct);
2997 for_each_online_cpu(cpu) {
2998 struct work_struct *work = per_cpu_ptr(works, cpu);
3000 INIT_WORK(work, func);
3001 schedule_work_on(cpu, work);
3004 for_each_online_cpu(cpu)
3005 flush_work(per_cpu_ptr(works, cpu));
3013 * flush_scheduled_work - ensure that any scheduled work has run to completion.
3015 * Forces execution of the kernel-global workqueue and blocks until its
3018 * Think twice before calling this function! It's very easy to get into
3019 * trouble if you don't take great care. Either of the following situations
3020 * will lead to deadlock:
3022 * One of the work items currently on the workqueue needs to acquire
3023 * a lock held by your code or its caller.
3025 * Your code is running in the context of a work routine.
3027 * They will be detected by lockdep when they occur, but the first might not
3028 * occur very often. It depends on what work items are on the workqueue and
3029 * what locks they need, which you have no control over.
3031 * In most situations flushing the entire workqueue is overkill; you merely
3032 * need to know that a particular work item isn't queued and isn't running.
3033 * In such cases you should use cancel_delayed_work_sync() or
3034 * cancel_work_sync() instead.
3036 void flush_scheduled_work(void)
3038 flush_workqueue(system_wq);
3040 EXPORT_SYMBOL(flush_scheduled_work);
3043 * execute_in_process_context - reliably execute the routine with user context
3044 * @fn: the function to execute
3045 * @ew: guaranteed storage for the execute work structure (must
3046 * be available when the work executes)
3048 * Executes the function immediately if process context is available,
3049 * otherwise schedules the function for delayed execution.
3051 * Returns: 0 - function was executed
3052 * 1 - function was scheduled for execution
3054 int execute_in_process_context(work_func_t fn, struct execute_work *ew)
3056 if (!in_interrupt()) {
3061 INIT_WORK(&ew->work, fn);
3062 schedule_work(&ew->work);
3066 EXPORT_SYMBOL_GPL(execute_in_process_context);
3068 int keventd_up(void)
3070 return system_wq != NULL;
3073 static int alloc_cwqs(struct workqueue_struct *wq)
3076 * cwqs are forced aligned according to WORK_STRUCT_FLAG_BITS.
3077 * Make sure that the alignment isn't lower than that of
3078 * unsigned long long.
3080 const size_t size = sizeof(struct cpu_workqueue_struct);
3081 const size_t align = max_t(size_t, 1 << WORK_STRUCT_FLAG_BITS,
3082 __alignof__(unsigned long long));
3084 if (!(wq->flags & WQ_UNBOUND))
3085 wq->cpu_wq.pcpu = __alloc_percpu(size, align);
3090 * Allocate enough room to align cwq and put an extra
3091 * pointer at the end pointing back to the originally
3092 * allocated pointer which will be used for free.
3094 ptr = kzalloc(size + align + sizeof(void *), GFP_KERNEL);
3096 wq->cpu_wq.single = PTR_ALIGN(ptr, align);
3097 *(void **)(wq->cpu_wq.single + 1) = ptr;
3101 /* just in case, make sure it's actually aligned */
3102 BUG_ON(!IS_ALIGNED(wq->cpu_wq.v, align));
3103 return wq->cpu_wq.v ? 0 : -ENOMEM;
3106 static void free_cwqs(struct workqueue_struct *wq)
3108 if (!(wq->flags & WQ_UNBOUND))
3109 free_percpu(wq->cpu_wq.pcpu);
3110 else if (wq->cpu_wq.single) {
3111 /* the pointer to free is stored right after the cwq */
3112 kfree(*(void **)(wq->cpu_wq.single + 1));
3116 static int wq_clamp_max_active(int max_active, unsigned int flags,
3119 int lim = flags & WQ_UNBOUND ? WQ_UNBOUND_MAX_ACTIVE : WQ_MAX_ACTIVE;
3121 if (max_active < 1 || max_active > lim)
3122 printk(KERN_WARNING "workqueue: max_active %d requested for %s "
3123 "is out of range, clamping between %d and %d\n",
3124 max_active, name, 1, lim);
3126 return clamp_val(max_active, 1, lim);
3129 struct workqueue_struct *__alloc_workqueue_key(const char *fmt,
3132 struct lock_class_key *key,
3133 const char *lock_name, ...)
3135 va_list args, args1;
3136 struct workqueue_struct *wq;
3140 /* determine namelen, allocate wq and format name */
3141 va_start(args, lock_name);
3142 va_copy(args1, args);
3143 namelen = vsnprintf(NULL, 0, fmt, args) + 1;
3145 wq = kzalloc(sizeof(*wq) + namelen, GFP_KERNEL);
3149 vsnprintf(wq->name, namelen, fmt, args1);
3154 * Workqueues which may be used during memory reclaim should
3155 * have a rescuer to guarantee forward progress.
3157 if (flags & WQ_MEM_RECLAIM)
3158 flags |= WQ_RESCUER;
3160 max_active = max_active ?: WQ_DFL_ACTIVE;
3161 max_active = wq_clamp_max_active(max_active, flags, wq->name);
3165 wq->saved_max_active = max_active;
3166 mutex_init(&wq->flush_mutex);
3167 atomic_set(&wq->nr_cwqs_to_flush, 0);
3168 INIT_LIST_HEAD(&wq->flusher_queue);
3169 INIT_LIST_HEAD(&wq->flusher_overflow);
3171 lockdep_init_map(&wq->lockdep_map, lock_name, key, 0);
3172 INIT_LIST_HEAD(&wq->list);
3174 if (alloc_cwqs(wq) < 0)
3177 for_each_cwq_cpu(cpu, wq) {
3178 struct cpu_workqueue_struct *cwq = get_cwq(cpu, wq);
3179 struct global_cwq *gcwq = get_gcwq(cpu);
3180 int pool_idx = (bool)(flags & WQ_HIGHPRI);
3182 BUG_ON((unsigned long)cwq & WORK_STRUCT_FLAG_MASK);
3183 cwq->pool = &gcwq->pools[pool_idx];
3185 cwq->flush_color = -1;
3186 cwq->max_active = max_active;
3187 INIT_LIST_HEAD(&cwq->delayed_works);
3190 if (flags & WQ_RESCUER) {
3191 struct worker *rescuer;
3193 if (!alloc_mayday_mask(&wq->mayday_mask, GFP_KERNEL))
3196 wq->rescuer = rescuer = alloc_worker();
3200 rescuer->task = kthread_create(rescuer_thread, wq, "%s",
3202 if (IS_ERR(rescuer->task))
3205 rescuer->task->flags |= PF_THREAD_BOUND;
3206 wake_up_process(rescuer->task);
3210 * workqueue_lock protects global freeze state and workqueues
3211 * list. Grab it, set max_active accordingly and add the new
3212 * workqueue to workqueues list.
3214 spin_lock(&workqueue_lock);
3216 if (workqueue_freezing && wq->flags & WQ_FREEZABLE)
3217 for_each_cwq_cpu(cpu, wq)
3218 get_cwq(cpu, wq)->max_active = 0;
3220 list_add(&wq->list, &workqueues);
3222 spin_unlock(&workqueue_lock);
3228 free_mayday_mask(wq->mayday_mask);
3234 EXPORT_SYMBOL_GPL(__alloc_workqueue_key);
3237 * destroy_workqueue - safely terminate a workqueue
3238 * @wq: target workqueue
3240 * Safely destroy a workqueue. All work currently pending will be done first.
3242 void destroy_workqueue(struct workqueue_struct *wq)
3246 /* drain it before proceeding with destruction */
3247 drain_workqueue(wq);
3250 * wq list is used to freeze wq, remove from list after
3251 * flushing is complete in case freeze races us.
3253 spin_lock(&workqueue_lock);
3254 list_del(&wq->list);
3255 spin_unlock(&workqueue_lock);
3258 for_each_cwq_cpu(cpu, wq) {
3259 struct cpu_workqueue_struct *cwq = get_cwq(cpu, wq);
3262 for (i = 0; i < WORK_NR_COLORS; i++)
3263 BUG_ON(cwq->nr_in_flight[i]);
3264 BUG_ON(cwq->nr_active);
3265 BUG_ON(!list_empty(&cwq->delayed_works));
3268 if (wq->flags & WQ_RESCUER) {
3269 kthread_stop(wq->rescuer->task);
3270 free_mayday_mask(wq->mayday_mask);
3277 EXPORT_SYMBOL_GPL(destroy_workqueue);
3280 * workqueue_set_max_active - adjust max_active of a workqueue
3281 * @wq: target workqueue
3282 * @max_active: new max_active value.
3284 * Set max_active of @wq to @max_active.
3287 * Don't call from IRQ context.
3289 void workqueue_set_max_active(struct workqueue_struct *wq, int max_active)
3293 max_active = wq_clamp_max_active(max_active, wq->flags, wq->name);
3295 spin_lock(&workqueue_lock);
3297 wq->saved_max_active = max_active;
3299 for_each_cwq_cpu(cpu, wq) {
3300 struct global_cwq *gcwq = get_gcwq(cpu);
3302 spin_lock_irq(&gcwq->lock);
3304 if (!(wq->flags & WQ_FREEZABLE) ||
3305 !(gcwq->flags & GCWQ_FREEZING))
3306 get_cwq(gcwq->cpu, wq)->max_active = max_active;
3308 spin_unlock_irq(&gcwq->lock);
3311 spin_unlock(&workqueue_lock);
3313 EXPORT_SYMBOL_GPL(workqueue_set_max_active);
3316 * workqueue_congested - test whether a workqueue is congested
3317 * @cpu: CPU in question
3318 * @wq: target workqueue
3320 * Test whether @wq's cpu workqueue for @cpu is congested. There is
3321 * no synchronization around this function and the test result is
3322 * unreliable and only useful as advisory hints or for debugging.
3325 * %true if congested, %false otherwise.
3327 bool workqueue_congested(unsigned int cpu, struct workqueue_struct *wq)
3329 struct cpu_workqueue_struct *cwq = get_cwq(cpu, wq);
3331 return !list_empty(&cwq->delayed_works);
3333 EXPORT_SYMBOL_GPL(workqueue_congested);
3336 * work_cpu - return the last known associated cpu for @work
3337 * @work: the work of interest
3340 * CPU number if @work was ever queued. WORK_CPU_NONE otherwise.
3342 unsigned int work_cpu(struct work_struct *work)
3344 struct global_cwq *gcwq = get_work_gcwq(work);
3346 return gcwq ? gcwq->cpu : WORK_CPU_NONE;
3348 EXPORT_SYMBOL_GPL(work_cpu);
3351 * work_busy - test whether a work is currently pending or running
3352 * @work: the work to be tested
3354 * Test whether @work is currently pending or running. There is no
3355 * synchronization around this function and the test result is
3356 * unreliable and only useful as advisory hints or for debugging.
3357 * Especially for reentrant wqs, the pending state might hide the
3361 * OR'd bitmask of WORK_BUSY_* bits.
3363 unsigned int work_busy(struct work_struct *work)
3365 struct global_cwq *gcwq = get_work_gcwq(work);
3366 unsigned long flags;
3367 unsigned int ret = 0;
3372 spin_lock_irqsave(&gcwq->lock, flags);
3374 if (work_pending(work))
3375 ret |= WORK_BUSY_PENDING;
3376 if (find_worker_executing_work(gcwq, work))
3377 ret |= WORK_BUSY_RUNNING;
3379 spin_unlock_irqrestore(&gcwq->lock, flags);
3383 EXPORT_SYMBOL_GPL(work_busy);
3388 * There are two challenges in supporting CPU hotplug. Firstly, there
3389 * are a lot of assumptions on strong associations among work, cwq and
3390 * gcwq which make migrating pending and scheduled works very
3391 * difficult to implement without impacting hot paths. Secondly,
3392 * gcwqs serve mix of short, long and very long running works making
3393 * blocked draining impractical.
3395 * This is solved by allowing a gcwq to be disassociated from the CPU
3396 * running as an unbound one and allowing it to be reattached later if the
3397 * cpu comes back online.
3400 /* claim manager positions of all pools */
3401 static void gcwq_claim_management_and_lock(struct global_cwq *gcwq)
3403 struct worker_pool *pool;
3405 for_each_worker_pool(pool, gcwq)
3406 mutex_lock_nested(&pool->manager_mutex, pool - gcwq->pools);
3407 spin_lock_irq(&gcwq->lock);
3410 /* release manager positions */
3411 static void gcwq_release_management_and_unlock(struct global_cwq *gcwq)
3413 struct worker_pool *pool;
3415 spin_unlock_irq(&gcwq->lock);
3416 for_each_worker_pool(pool, gcwq)
3417 mutex_unlock(&pool->manager_mutex);
3420 static void gcwq_unbind_fn(struct work_struct *work)
3422 struct global_cwq *gcwq = get_gcwq(smp_processor_id());
3423 struct worker_pool *pool;
3424 struct worker *worker;
3425 struct hlist_node *pos;
3428 BUG_ON(gcwq->cpu != smp_processor_id());
3430 gcwq_claim_management_and_lock(gcwq);
3433 * We've claimed all manager positions. Make all workers unbound
3434 * and set DISASSOCIATED. Before this, all workers except for the
3435 * ones which are still executing works from before the last CPU
3436 * down must be on the cpu. After this, they may become diasporas.
3438 for_each_worker_pool(pool, gcwq)
3439 list_for_each_entry(worker, &pool->idle_list, entry)
3440 worker->flags |= WORKER_UNBOUND;
3442 for_each_busy_worker(worker, i, pos, gcwq)
3443 worker->flags |= WORKER_UNBOUND;
3445 gcwq->flags |= GCWQ_DISASSOCIATED;
3447 gcwq_release_management_and_unlock(gcwq);
3450 * Call schedule() so that we cross rq->lock and thus can guarantee
3451 * sched callbacks see the %WORKER_UNBOUND flag. This is necessary
3452 * as scheduler callbacks may be invoked from other cpus.
3457 * Sched callbacks are disabled now. Zap nr_running. After this,
3458 * nr_running stays zero and need_more_worker() and keep_working()
3459 * are always true as long as the worklist is not empty. @gcwq now
3460 * behaves as unbound (in terms of concurrency management) gcwq
3461 * which is served by workers tied to the CPU.
3463 * On return from this function, the current worker would trigger
3464 * unbound chain execution of pending work items if other workers
3467 for_each_worker_pool(pool, gcwq)
3468 atomic_set(get_pool_nr_running(pool), 0);
3472 * Workqueues should be brought up before normal priority CPU notifiers.
3473 * This will be registered high priority CPU notifier.
3475 static int __devinit workqueue_cpu_up_callback(struct notifier_block *nfb,
3476 unsigned long action,
3479 unsigned int cpu = (unsigned long)hcpu;
3480 struct global_cwq *gcwq = get_gcwq(cpu);
3481 struct worker_pool *pool;
3483 switch (action & ~CPU_TASKS_FROZEN) {
3484 case CPU_UP_PREPARE:
3485 for_each_worker_pool(pool, gcwq) {
3486 struct worker *worker;
3488 if (pool->nr_workers)
3491 worker = create_worker(pool);
3495 spin_lock_irq(&gcwq->lock);
3496 start_worker(worker);
3497 spin_unlock_irq(&gcwq->lock);
3501 case CPU_DOWN_FAILED:
3503 gcwq_claim_management_and_lock(gcwq);
3504 gcwq->flags &= ~GCWQ_DISASSOCIATED;
3505 rebind_workers(gcwq);
3506 gcwq_release_management_and_unlock(gcwq);
3513 * Workqueues should be brought down after normal priority CPU notifiers.
3514 * This will be registered as low priority CPU notifier.
3516 static int __devinit workqueue_cpu_down_callback(struct notifier_block *nfb,
3517 unsigned long action,
3520 unsigned int cpu = (unsigned long)hcpu;
3521 struct work_struct unbind_work;
3523 switch (action & ~CPU_TASKS_FROZEN) {
3524 case CPU_DOWN_PREPARE:
3525 /* unbinding should happen on the local CPU */
3526 INIT_WORK_ONSTACK(&unbind_work, gcwq_unbind_fn);
3527 schedule_work_on(cpu, &unbind_work);
3528 flush_work(&unbind_work);
3536 struct work_for_cpu {
3537 struct completion completion;
3543 static int do_work_for_cpu(void *_wfc)
3545 struct work_for_cpu *wfc = _wfc;
3546 wfc->ret = wfc->fn(wfc->arg);
3547 complete(&wfc->completion);
3552 * work_on_cpu - run a function in user context on a particular cpu
3553 * @cpu: the cpu to run on
3554 * @fn: the function to run
3555 * @arg: the function arg
3557 * This will return the value @fn returns.
3558 * It is up to the caller to ensure that the cpu doesn't go offline.
3559 * The caller must not hold any locks which would prevent @fn from completing.
3561 long work_on_cpu(unsigned int cpu, long (*fn)(void *), void *arg)
3563 struct task_struct *sub_thread;
3564 struct work_for_cpu wfc = {
3565 .completion = COMPLETION_INITIALIZER_ONSTACK(wfc.completion),
3570 sub_thread = kthread_create(do_work_for_cpu, &wfc, "work_for_cpu");
3571 if (IS_ERR(sub_thread))
3572 return PTR_ERR(sub_thread);
3573 kthread_bind(sub_thread, cpu);
3574 wake_up_process(sub_thread);
3575 wait_for_completion(&wfc.completion);
3578 EXPORT_SYMBOL_GPL(work_on_cpu);
3579 #endif /* CONFIG_SMP */
3581 #ifdef CONFIG_FREEZER
3584 * freeze_workqueues_begin - begin freezing workqueues
3586 * Start freezing workqueues. After this function returns, all freezable
3587 * workqueues will queue new works to their frozen_works list instead of
3591 * Grabs and releases workqueue_lock and gcwq->lock's.
3593 void freeze_workqueues_begin(void)
3597 spin_lock(&workqueue_lock);
3599 BUG_ON(workqueue_freezing);
3600 workqueue_freezing = true;
3602 for_each_gcwq_cpu(cpu) {
3603 struct global_cwq *gcwq = get_gcwq(cpu);
3604 struct workqueue_struct *wq;
3606 spin_lock_irq(&gcwq->lock);
3608 BUG_ON(gcwq->flags & GCWQ_FREEZING);
3609 gcwq->flags |= GCWQ_FREEZING;
3611 list_for_each_entry(wq, &workqueues, list) {
3612 struct cpu_workqueue_struct *cwq = get_cwq(cpu, wq);
3614 if (cwq && wq->flags & WQ_FREEZABLE)
3615 cwq->max_active = 0;
3618 spin_unlock_irq(&gcwq->lock);
3621 spin_unlock(&workqueue_lock);
3625 * freeze_workqueues_busy - are freezable workqueues still busy?
3627 * Check whether freezing is complete. This function must be called
3628 * between freeze_workqueues_begin() and thaw_workqueues().
3631 * Grabs and releases workqueue_lock.
3634 * %true if some freezable workqueues are still busy. %false if freezing
3637 bool freeze_workqueues_busy(void)
3642 spin_lock(&workqueue_lock);
3644 BUG_ON(!workqueue_freezing);
3646 for_each_gcwq_cpu(cpu) {
3647 struct workqueue_struct *wq;
3649 * nr_active is monotonically decreasing. It's safe
3650 * to peek without lock.
3652 list_for_each_entry(wq, &workqueues, list) {
3653 struct cpu_workqueue_struct *cwq = get_cwq(cpu, wq);
3655 if (!cwq || !(wq->flags & WQ_FREEZABLE))
3658 BUG_ON(cwq->nr_active < 0);
3659 if (cwq->nr_active) {
3666 spin_unlock(&workqueue_lock);
3671 * thaw_workqueues - thaw workqueues
3673 * Thaw workqueues. Normal queueing is restored and all collected
3674 * frozen works are transferred to their respective gcwq worklists.
3677 * Grabs and releases workqueue_lock and gcwq->lock's.
3679 void thaw_workqueues(void)
3683 spin_lock(&workqueue_lock);
3685 if (!workqueue_freezing)
3688 for_each_gcwq_cpu(cpu) {
3689 struct global_cwq *gcwq = get_gcwq(cpu);
3690 struct worker_pool *pool;
3691 struct workqueue_struct *wq;
3693 spin_lock_irq(&gcwq->lock);
3695 BUG_ON(!(gcwq->flags & GCWQ_FREEZING));
3696 gcwq->flags &= ~GCWQ_FREEZING;
3698 list_for_each_entry(wq, &workqueues, list) {
3699 struct cpu_workqueue_struct *cwq = get_cwq(cpu, wq);
3701 if (!cwq || !(wq->flags & WQ_FREEZABLE))
3704 /* restore max_active and repopulate worklist */
3705 cwq->max_active = wq->saved_max_active;
3707 while (!list_empty(&cwq->delayed_works) &&
3708 cwq->nr_active < cwq->max_active)
3709 cwq_activate_first_delayed(cwq);
3712 for_each_worker_pool(pool, gcwq)
3713 wake_up_worker(pool);
3715 spin_unlock_irq(&gcwq->lock);
3718 workqueue_freezing = false;
3720 spin_unlock(&workqueue_lock);
3722 #endif /* CONFIG_FREEZER */
3724 static int __init init_workqueues(void)
3729 cpu_notifier(workqueue_cpu_up_callback, CPU_PRI_WORKQUEUE_UP);
3730 cpu_notifier(workqueue_cpu_down_callback, CPU_PRI_WORKQUEUE_DOWN);
3732 /* initialize gcwqs */
3733 for_each_gcwq_cpu(cpu) {
3734 struct global_cwq *gcwq = get_gcwq(cpu);
3735 struct worker_pool *pool;
3737 spin_lock_init(&gcwq->lock);
3739 gcwq->flags |= GCWQ_DISASSOCIATED;
3741 for (i = 0; i < BUSY_WORKER_HASH_SIZE; i++)
3742 INIT_HLIST_HEAD(&gcwq->busy_hash[i]);
3744 for_each_worker_pool(pool, gcwq) {
3746 INIT_LIST_HEAD(&pool->worklist);
3747 INIT_LIST_HEAD(&pool->idle_list);
3749 init_timer_deferrable(&pool->idle_timer);
3750 pool->idle_timer.function = idle_worker_timeout;
3751 pool->idle_timer.data = (unsigned long)pool;
3753 setup_timer(&pool->mayday_timer, gcwq_mayday_timeout,
3754 (unsigned long)pool);
3756 mutex_init(&pool->manager_mutex);
3757 ida_init(&pool->worker_ida);
3760 init_waitqueue_head(&gcwq->rebind_hold);
3763 /* create the initial worker */
3764 for_each_online_gcwq_cpu(cpu) {
3765 struct global_cwq *gcwq = get_gcwq(cpu);
3766 struct worker_pool *pool;
3768 if (cpu != WORK_CPU_UNBOUND)
3769 gcwq->flags &= ~GCWQ_DISASSOCIATED;
3771 for_each_worker_pool(pool, gcwq) {
3772 struct worker *worker;
3774 worker = create_worker(pool);
3776 spin_lock_irq(&gcwq->lock);
3777 start_worker(worker);
3778 spin_unlock_irq(&gcwq->lock);
3782 system_wq = alloc_workqueue("events", 0, 0);
3783 system_long_wq = alloc_workqueue("events_long", 0, 0);
3784 system_nrt_wq = alloc_workqueue("events_nrt", WQ_NON_REENTRANT, 0);
3785 system_unbound_wq = alloc_workqueue("events_unbound", WQ_UNBOUND,
3786 WQ_UNBOUND_MAX_ACTIVE);
3787 system_freezable_wq = alloc_workqueue("events_freezable",
3789 system_nrt_freezable_wq = alloc_workqueue("events_nrt_freezable",
3790 WQ_NON_REENTRANT | WQ_FREEZABLE, 0);
3791 BUG_ON(!system_wq || !system_long_wq || !system_nrt_wq ||
3792 !system_unbound_wq || !system_freezable_wq ||
3793 !system_nrt_freezable_wq);
3796 early_initcall(init_workqueues);