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>
44 #include <linux/jhash.h>
45 #include <linux/hashtable.h>
46 #include <linux/rculist.h>
47 #include <linux/nodemask.h>
48 #include <linux/moduleparam.h>
49 #include <linux/uaccess.h>
51 #include "workqueue_internal.h"
57 * A bound pool is either associated or disassociated with its CPU.
58 * While associated (!DISASSOCIATED), all workers are bound to the
59 * CPU and none has %WORKER_UNBOUND set and concurrency management
62 * While DISASSOCIATED, the cpu may be offline and all workers have
63 * %WORKER_UNBOUND set and concurrency management disabled, and may
64 * be executing on any CPU. The pool behaves as an unbound one.
66 * Note that DISASSOCIATED should be flipped only while holding
67 * manager_mutex to avoid changing binding state while
68 * create_worker() is in progress.
70 POOL_MANAGE_WORKERS = 1 << 0, /* need to manage workers */
71 POOL_DISASSOCIATED = 1 << 2, /* cpu can't serve workers */
72 POOL_FREEZING = 1 << 3, /* freeze in progress */
75 WORKER_STARTED = 1 << 0, /* started */
76 WORKER_DIE = 1 << 1, /* die die die */
77 WORKER_IDLE = 1 << 2, /* is idle */
78 WORKER_PREP = 1 << 3, /* preparing to run works */
79 WORKER_CPU_INTENSIVE = 1 << 6, /* cpu intensive */
80 WORKER_UNBOUND = 1 << 7, /* worker is unbound */
81 WORKER_REBOUND = 1 << 8, /* worker was rebound */
83 WORKER_NOT_RUNNING = WORKER_PREP | WORKER_CPU_INTENSIVE |
84 WORKER_UNBOUND | WORKER_REBOUND,
86 NR_STD_WORKER_POOLS = 2, /* # standard pools per cpu */
88 UNBOUND_POOL_HASH_ORDER = 6, /* hashed by pool->attrs */
89 BUSY_WORKER_HASH_ORDER = 6, /* 64 pointers */
91 MAX_IDLE_WORKERS_RATIO = 4, /* 1/4 of busy can be idle */
92 IDLE_WORKER_TIMEOUT = 300 * HZ, /* keep idle ones for 5 mins */
94 MAYDAY_INITIAL_TIMEOUT = HZ / 100 >= 2 ? HZ / 100 : 2,
95 /* call for help after 10ms
97 MAYDAY_INTERVAL = HZ / 10, /* and then every 100ms */
98 CREATE_COOLDOWN = HZ, /* time to breath after fail */
101 * Rescue workers are used only on emergencies and shared by
102 * all cpus. Give -20.
104 RESCUER_NICE_LEVEL = -20,
105 HIGHPRI_NICE_LEVEL = -20,
111 * Structure fields follow one of the following exclusion rules.
113 * I: Modifiable by initialization/destruction paths and read-only for
116 * P: Preemption protected. Disabling preemption is enough and should
117 * only be modified and accessed from the local cpu.
119 * L: pool->lock protected. Access with pool->lock held.
121 * X: During normal operation, modification requires pool->lock and should
122 * be done only from local cpu. Either disabling preemption on local
123 * cpu or grabbing pool->lock is enough for read access. If
124 * POOL_DISASSOCIATED is set, it's identical to L.
126 * MG: pool->manager_mutex and pool->lock protected. Writes require both
127 * locks. Reads can happen under either lock.
129 * PL: wq_pool_mutex protected.
131 * PR: wq_pool_mutex protected for writes. Sched-RCU protected for reads.
133 * WQ: wq->mutex protected.
135 * WR: wq->mutex protected for writes. Sched-RCU protected for reads.
137 * MD: wq_mayday_lock protected.
140 /* struct worker is defined in workqueue_internal.h */
143 spinlock_t lock; /* the pool lock */
144 int cpu; /* I: the associated cpu */
145 int node; /* I: the associated node ID */
146 int id; /* I: pool ID */
147 unsigned int flags; /* X: flags */
149 struct list_head worklist; /* L: list of pending works */
150 int nr_workers; /* L: total number of workers */
152 /* nr_idle includes the ones off idle_list for rebinding */
153 int nr_idle; /* L: currently idle ones */
155 struct list_head idle_list; /* X: list of idle workers */
156 struct timer_list idle_timer; /* L: worker idle timeout */
157 struct timer_list mayday_timer; /* L: SOS timer for workers */
159 /* a workers is either on busy_hash or idle_list, or the manager */
160 DECLARE_HASHTABLE(busy_hash, BUSY_WORKER_HASH_ORDER);
161 /* L: hash of busy workers */
163 /* see manage_workers() for details on the two manager mutexes */
164 struct mutex manager_arb; /* manager arbitration */
165 struct mutex manager_mutex; /* manager exclusion */
166 struct idr worker_idr; /* MG: worker IDs and iteration */
168 struct workqueue_attrs *attrs; /* I: worker attributes */
169 struct hlist_node hash_node; /* PL: unbound_pool_hash node */
170 int refcnt; /* PL: refcnt for unbound pools */
173 * The current concurrency level. As it's likely to be accessed
174 * from other CPUs during try_to_wake_up(), put it in a separate
177 atomic_t nr_running ____cacheline_aligned_in_smp;
180 * Destruction of pool is sched-RCU protected to allow dereferences
181 * from get_work_pool().
184 } ____cacheline_aligned_in_smp;
187 * The per-pool workqueue. While queued, the lower WORK_STRUCT_FLAG_BITS
188 * of work_struct->data are used for flags and the remaining high bits
189 * point to the pwq; thus, pwqs need to be aligned at two's power of the
190 * number of flag bits.
192 struct pool_workqueue {
193 struct worker_pool *pool; /* I: the associated pool */
194 struct workqueue_struct *wq; /* I: the owning workqueue */
195 int work_color; /* L: current color */
196 int flush_color; /* L: flushing color */
197 int refcnt; /* L: reference count */
198 int nr_in_flight[WORK_NR_COLORS];
199 /* L: nr of in_flight works */
200 int nr_active; /* L: nr of active works */
201 int max_active; /* L: max active works */
202 struct list_head delayed_works; /* L: delayed works */
203 struct list_head pwqs_node; /* WR: node on wq->pwqs */
204 struct list_head mayday_node; /* MD: node on wq->maydays */
207 * Release of unbound pwq is punted to system_wq. See put_pwq()
208 * and pwq_unbound_release_workfn() for details. pool_workqueue
209 * itself is also sched-RCU protected so that the first pwq can be
210 * determined without grabbing wq->mutex.
212 struct work_struct unbound_release_work;
214 } __aligned(1 << WORK_STRUCT_FLAG_BITS);
217 * Structure used to wait for workqueue flush.
220 struct list_head list; /* WQ: list of flushers */
221 int flush_color; /* WQ: flush color waiting for */
222 struct completion done; /* flush completion */
228 * The externally visible workqueue. It relays the issued work items to
229 * the appropriate worker_pool through its pool_workqueues.
231 struct workqueue_struct {
232 struct list_head pwqs; /* WR: all pwqs of this wq */
233 struct list_head list; /* PL: list of all workqueues */
235 struct mutex mutex; /* protects this wq */
236 int work_color; /* WQ: current work color */
237 int flush_color; /* WQ: current flush color */
238 atomic_t nr_pwqs_to_flush; /* flush in progress */
239 struct wq_flusher *first_flusher; /* WQ: first flusher */
240 struct list_head flusher_queue; /* WQ: flush waiters */
241 struct list_head flusher_overflow; /* WQ: flush overflow list */
243 struct list_head maydays; /* MD: pwqs requesting rescue */
244 struct worker *rescuer; /* I: rescue worker */
246 int nr_drainers; /* WQ: drain in progress */
247 int saved_max_active; /* WQ: saved pwq max_active */
249 struct workqueue_attrs *unbound_attrs; /* WQ: only for unbound wqs */
250 struct pool_workqueue *dfl_pwq; /* WQ: only for unbound wqs */
253 struct wq_device *wq_dev; /* I: for sysfs interface */
255 #ifdef CONFIG_LOCKDEP
256 struct lockdep_map lockdep_map;
258 char name[WQ_NAME_LEN]; /* I: workqueue name */
260 /* hot fields used during command issue, aligned to cacheline */
261 unsigned int flags ____cacheline_aligned; /* WQ: WQ_* flags */
262 struct pool_workqueue __percpu *cpu_pwqs; /* I: per-cpu pwqs */
263 struct pool_workqueue __rcu *numa_pwq_tbl[]; /* FR: unbound pwqs indexed by node */
266 static struct kmem_cache *pwq_cache;
268 static int wq_numa_tbl_len; /* highest possible NUMA node id + 1 */
269 static cpumask_var_t *wq_numa_possible_cpumask;
270 /* possible CPUs of each node */
272 static bool wq_disable_numa;
273 module_param_named(disable_numa, wq_disable_numa, bool, 0444);
275 /* see the comment above the definition of WQ_POWER_EFFICIENT */
276 #ifdef CONFIG_WQ_POWER_EFFICIENT_DEFAULT
277 static bool wq_power_efficient = true;
279 static bool wq_power_efficient;
282 module_param_named(power_efficient, wq_power_efficient, bool, 0444);
284 static bool wq_numa_enabled; /* unbound NUMA affinity enabled */
286 /* buf for wq_update_unbound_numa_attrs(), protected by CPU hotplug exclusion */
287 static struct workqueue_attrs *wq_update_unbound_numa_attrs_buf;
289 static DEFINE_MUTEX(wq_pool_mutex); /* protects pools and workqueues list */
290 static DEFINE_SPINLOCK(wq_mayday_lock); /* protects wq->maydays list */
292 static LIST_HEAD(workqueues); /* PL: list of all workqueues */
293 static bool workqueue_freezing; /* PL: have wqs started freezing? */
295 /* the per-cpu worker pools */
296 static DEFINE_PER_CPU_SHARED_ALIGNED(struct worker_pool [NR_STD_WORKER_POOLS],
299 static DEFINE_IDR(worker_pool_idr); /* PR: idr of all pools */
301 /* PL: hash of all unbound pools keyed by pool->attrs */
302 static DEFINE_HASHTABLE(unbound_pool_hash, UNBOUND_POOL_HASH_ORDER);
304 /* I: attributes used when instantiating standard unbound pools on demand */
305 static struct workqueue_attrs *unbound_std_wq_attrs[NR_STD_WORKER_POOLS];
307 /* I: attributes used when instantiating ordered pools on demand */
308 static struct workqueue_attrs *ordered_wq_attrs[NR_STD_WORKER_POOLS];
310 struct workqueue_struct *system_wq __read_mostly;
311 EXPORT_SYMBOL(system_wq);
312 struct workqueue_struct *system_highpri_wq __read_mostly;
313 EXPORT_SYMBOL_GPL(system_highpri_wq);
314 struct workqueue_struct *system_long_wq __read_mostly;
315 EXPORT_SYMBOL_GPL(system_long_wq);
316 struct workqueue_struct *system_unbound_wq __read_mostly;
317 EXPORT_SYMBOL_GPL(system_unbound_wq);
318 struct workqueue_struct *system_freezable_wq __read_mostly;
319 EXPORT_SYMBOL_GPL(system_freezable_wq);
320 struct workqueue_struct *system_power_efficient_wq __read_mostly;
321 EXPORT_SYMBOL_GPL(system_power_efficient_wq);
322 struct workqueue_struct *system_freezable_power_efficient_wq __read_mostly;
323 EXPORT_SYMBOL_GPL(system_freezable_power_efficient_wq);
325 static int worker_thread(void *__worker);
326 static void copy_workqueue_attrs(struct workqueue_attrs *to,
327 const struct workqueue_attrs *from);
329 #define CREATE_TRACE_POINTS
330 #include <trace/events/workqueue.h>
332 #define assert_rcu_or_pool_mutex() \
333 rcu_lockdep_assert(rcu_read_lock_sched_held() || \
334 lockdep_is_held(&wq_pool_mutex), \
335 "sched RCU or wq_pool_mutex should be held")
337 #define assert_rcu_or_wq_mutex(wq) \
338 rcu_lockdep_assert(rcu_read_lock_sched_held() || \
339 lockdep_is_held(&wq->mutex), \
340 "sched RCU or wq->mutex should be held")
342 #ifdef CONFIG_LOCKDEP
343 #define assert_manager_or_pool_lock(pool) \
344 WARN_ONCE(debug_locks && \
345 !lockdep_is_held(&(pool)->manager_mutex) && \
346 !lockdep_is_held(&(pool)->lock), \
347 "pool->manager_mutex or ->lock should be held")
349 #define assert_manager_or_pool_lock(pool) do { } while (0)
352 #define for_each_cpu_worker_pool(pool, cpu) \
353 for ((pool) = &per_cpu(cpu_worker_pools, cpu)[0]; \
354 (pool) < &per_cpu(cpu_worker_pools, cpu)[NR_STD_WORKER_POOLS]; \
358 * for_each_pool - iterate through all worker_pools in the system
359 * @pool: iteration cursor
360 * @pi: integer used for iteration
362 * This must be called either with wq_pool_mutex held or sched RCU read
363 * locked. If the pool needs to be used beyond the locking in effect, the
364 * caller is responsible for guaranteeing that the pool stays online.
366 * The if/else clause exists only for the lockdep assertion and can be
369 #define for_each_pool(pool, pi) \
370 idr_for_each_entry(&worker_pool_idr, pool, pi) \
371 if (({ assert_rcu_or_pool_mutex(); false; })) { } \
375 * for_each_pool_worker - iterate through all workers of a worker_pool
376 * @worker: iteration cursor
377 * @wi: integer used for iteration
378 * @pool: worker_pool to iterate workers of
380 * This must be called with either @pool->manager_mutex or ->lock held.
382 * The if/else clause exists only for the lockdep assertion and can be
385 #define for_each_pool_worker(worker, wi, pool) \
386 idr_for_each_entry(&(pool)->worker_idr, (worker), (wi)) \
387 if (({ assert_manager_or_pool_lock((pool)); false; })) { } \
391 * for_each_pwq - iterate through all pool_workqueues of the specified workqueue
392 * @pwq: iteration cursor
393 * @wq: the target workqueue
395 * This must be called either with wq->mutex held or sched RCU read locked.
396 * If the pwq needs to be used beyond the locking in effect, the caller is
397 * responsible for guaranteeing that the pwq stays online.
399 * The if/else clause exists only for the lockdep assertion and can be
402 #define for_each_pwq(pwq, wq) \
403 list_for_each_entry_rcu((pwq), &(wq)->pwqs, pwqs_node) \
404 if (({ assert_rcu_or_wq_mutex(wq); false; })) { } \
407 #ifdef CONFIG_DEBUG_OBJECTS_WORK
409 static struct debug_obj_descr work_debug_descr;
411 static void *work_debug_hint(void *addr)
413 return ((struct work_struct *) addr)->func;
417 * fixup_init is called when:
418 * - an active object is initialized
420 static int work_fixup_init(void *addr, enum debug_obj_state state)
422 struct work_struct *work = addr;
425 case ODEBUG_STATE_ACTIVE:
426 cancel_work_sync(work);
427 debug_object_init(work, &work_debug_descr);
435 * fixup_activate is called when:
436 * - an active object is activated
437 * - an unknown object is activated (might be a statically initialized object)
439 static int work_fixup_activate(void *addr, enum debug_obj_state state)
441 struct work_struct *work = addr;
445 case ODEBUG_STATE_NOTAVAILABLE:
447 * This is not really a fixup. The work struct was
448 * statically initialized. We just make sure that it
449 * is tracked in the object tracker.
451 if (test_bit(WORK_STRUCT_STATIC_BIT, work_data_bits(work))) {
452 debug_object_init(work, &work_debug_descr);
453 debug_object_activate(work, &work_debug_descr);
459 case ODEBUG_STATE_ACTIVE:
468 * fixup_free is called when:
469 * - an active object is freed
471 static int work_fixup_free(void *addr, enum debug_obj_state state)
473 struct work_struct *work = addr;
476 case ODEBUG_STATE_ACTIVE:
477 cancel_work_sync(work);
478 debug_object_free(work, &work_debug_descr);
485 static struct debug_obj_descr work_debug_descr = {
486 .name = "work_struct",
487 .debug_hint = work_debug_hint,
488 .fixup_init = work_fixup_init,
489 .fixup_activate = work_fixup_activate,
490 .fixup_free = work_fixup_free,
493 static inline void debug_work_activate(struct work_struct *work)
495 debug_object_activate(work, &work_debug_descr);
498 static inline void debug_work_deactivate(struct work_struct *work)
500 debug_object_deactivate(work, &work_debug_descr);
503 void __init_work(struct work_struct *work, int onstack)
506 debug_object_init_on_stack(work, &work_debug_descr);
508 debug_object_init(work, &work_debug_descr);
510 EXPORT_SYMBOL_GPL(__init_work);
512 void destroy_work_on_stack(struct work_struct *work)
514 debug_object_free(work, &work_debug_descr);
516 EXPORT_SYMBOL_GPL(destroy_work_on_stack);
519 static inline void debug_work_activate(struct work_struct *work) { }
520 static inline void debug_work_deactivate(struct work_struct *work) { }
523 /* allocate ID and assign it to @pool */
524 static int worker_pool_assign_id(struct worker_pool *pool)
528 lockdep_assert_held(&wq_pool_mutex);
530 ret = idr_alloc(&worker_pool_idr, pool, 0, 0, GFP_KERNEL);
539 * unbound_pwq_by_node - return the unbound pool_workqueue for the given node
540 * @wq: the target workqueue
543 * This must be called either with pwq_lock held or sched RCU read locked.
544 * If the pwq needs to be used beyond the locking in effect, the caller is
545 * responsible for guaranteeing that the pwq stays online.
547 static struct pool_workqueue *unbound_pwq_by_node(struct workqueue_struct *wq,
550 assert_rcu_or_wq_mutex(wq);
551 return rcu_dereference_raw(wq->numa_pwq_tbl[node]);
554 static unsigned int work_color_to_flags(int color)
556 return color << WORK_STRUCT_COLOR_SHIFT;
559 static int get_work_color(struct work_struct *work)
561 return (*work_data_bits(work) >> WORK_STRUCT_COLOR_SHIFT) &
562 ((1 << WORK_STRUCT_COLOR_BITS) - 1);
565 static int work_next_color(int color)
567 return (color + 1) % WORK_NR_COLORS;
571 * While queued, %WORK_STRUCT_PWQ is set and non flag bits of a work's data
572 * contain the pointer to the queued pwq. Once execution starts, the flag
573 * is cleared and the high bits contain OFFQ flags and pool ID.
575 * set_work_pwq(), set_work_pool_and_clear_pending(), mark_work_canceling()
576 * and clear_work_data() can be used to set the pwq, pool or clear
577 * work->data. These functions should only be called while the work is
578 * owned - ie. while the PENDING bit is set.
580 * get_work_pool() and get_work_pwq() can be used to obtain the pool or pwq
581 * corresponding to a work. Pool is available once the work has been
582 * queued anywhere after initialization until it is sync canceled. pwq is
583 * available only while the work item is queued.
585 * %WORK_OFFQ_CANCELING is used to mark a work item which is being
586 * canceled. While being canceled, a work item may have its PENDING set
587 * but stay off timer and worklist for arbitrarily long and nobody should
588 * try to steal the PENDING bit.
590 static inline void set_work_data(struct work_struct *work, unsigned long data,
593 WARN_ON_ONCE(!work_pending(work));
594 atomic_long_set(&work->data, data | flags | work_static(work));
597 static void set_work_pwq(struct work_struct *work, struct pool_workqueue *pwq,
598 unsigned long extra_flags)
600 set_work_data(work, (unsigned long)pwq,
601 WORK_STRUCT_PENDING | WORK_STRUCT_PWQ | extra_flags);
604 static void set_work_pool_and_keep_pending(struct work_struct *work,
607 set_work_data(work, (unsigned long)pool_id << WORK_OFFQ_POOL_SHIFT,
608 WORK_STRUCT_PENDING);
611 static void set_work_pool_and_clear_pending(struct work_struct *work,
615 * The following wmb is paired with the implied mb in
616 * test_and_set_bit(PENDING) and ensures all updates to @work made
617 * here are visible to and precede any updates by the next PENDING
621 set_work_data(work, (unsigned long)pool_id << WORK_OFFQ_POOL_SHIFT, 0);
624 static void clear_work_data(struct work_struct *work)
626 smp_wmb(); /* see set_work_pool_and_clear_pending() */
627 set_work_data(work, WORK_STRUCT_NO_POOL, 0);
630 static struct pool_workqueue *get_work_pwq(struct work_struct *work)
632 unsigned long data = atomic_long_read(&work->data);
634 if (data & WORK_STRUCT_PWQ)
635 return (void *)(data & WORK_STRUCT_WQ_DATA_MASK);
641 * get_work_pool - return the worker_pool a given work was associated with
642 * @work: the work item of interest
644 * Return the worker_pool @work was last associated with. %NULL if none.
646 * Pools are created and destroyed under wq_pool_mutex, and allows read
647 * access under sched-RCU read lock. As such, this function should be
648 * called under wq_pool_mutex or with preemption disabled.
650 * All fields of the returned pool are accessible as long as the above
651 * mentioned locking is in effect. If the returned pool needs to be used
652 * beyond the critical section, the caller is responsible for ensuring the
653 * returned pool is and stays online.
655 static struct worker_pool *get_work_pool(struct work_struct *work)
657 unsigned long data = atomic_long_read(&work->data);
660 assert_rcu_or_pool_mutex();
662 if (data & WORK_STRUCT_PWQ)
663 return ((struct pool_workqueue *)
664 (data & WORK_STRUCT_WQ_DATA_MASK))->pool;
666 pool_id = data >> WORK_OFFQ_POOL_SHIFT;
667 if (pool_id == WORK_OFFQ_POOL_NONE)
670 return idr_find(&worker_pool_idr, pool_id);
674 * get_work_pool_id - return the worker pool ID a given work is associated with
675 * @work: the work item of interest
677 * Return the worker_pool ID @work was last associated with.
678 * %WORK_OFFQ_POOL_NONE if none.
680 static int get_work_pool_id(struct work_struct *work)
682 unsigned long data = atomic_long_read(&work->data);
684 if (data & WORK_STRUCT_PWQ)
685 return ((struct pool_workqueue *)
686 (data & WORK_STRUCT_WQ_DATA_MASK))->pool->id;
688 return data >> WORK_OFFQ_POOL_SHIFT;
691 static void mark_work_canceling(struct work_struct *work)
693 unsigned long pool_id = get_work_pool_id(work);
695 pool_id <<= WORK_OFFQ_POOL_SHIFT;
696 set_work_data(work, pool_id | WORK_OFFQ_CANCELING, WORK_STRUCT_PENDING);
699 static bool work_is_canceling(struct work_struct *work)
701 unsigned long data = atomic_long_read(&work->data);
703 return !(data & WORK_STRUCT_PWQ) && (data & WORK_OFFQ_CANCELING);
707 * Policy functions. These define the policies on how the global worker
708 * pools are managed. Unless noted otherwise, these functions assume that
709 * they're being called with pool->lock held.
712 static bool __need_more_worker(struct worker_pool *pool)
714 return !atomic_read(&pool->nr_running);
718 * Need to wake up a worker? Called from anything but currently
721 * Note that, because unbound workers never contribute to nr_running, this
722 * function will always return %true for unbound pools as long as the
723 * worklist isn't empty.
725 static bool need_more_worker(struct worker_pool *pool)
727 return !list_empty(&pool->worklist) && __need_more_worker(pool);
730 /* Can I start working? Called from busy but !running workers. */
731 static bool may_start_working(struct worker_pool *pool)
733 return pool->nr_idle;
736 /* Do I need to keep working? Called from currently running workers. */
737 static bool keep_working(struct worker_pool *pool)
739 return !list_empty(&pool->worklist) &&
740 atomic_read(&pool->nr_running) <= 1;
743 /* Do we need a new worker? Called from manager. */
744 static bool need_to_create_worker(struct worker_pool *pool)
746 return need_more_worker(pool) && !may_start_working(pool);
749 /* Do I need to be the manager? */
750 static bool need_to_manage_workers(struct worker_pool *pool)
752 return need_to_create_worker(pool) ||
753 (pool->flags & POOL_MANAGE_WORKERS);
756 /* Do we have too many workers and should some go away? */
757 static bool too_many_workers(struct worker_pool *pool)
759 bool managing = mutex_is_locked(&pool->manager_arb);
760 int nr_idle = pool->nr_idle + managing; /* manager is considered idle */
761 int nr_busy = pool->nr_workers - nr_idle;
764 * nr_idle and idle_list may disagree if idle rebinding is in
765 * progress. Never return %true if idle_list is empty.
767 if (list_empty(&pool->idle_list))
770 return nr_idle > 2 && (nr_idle - 2) * MAX_IDLE_WORKERS_RATIO >= nr_busy;
777 /* Return the first worker. Safe with preemption disabled */
778 static struct worker *first_worker(struct worker_pool *pool)
780 if (unlikely(list_empty(&pool->idle_list)))
783 return list_first_entry(&pool->idle_list, struct worker, entry);
787 * wake_up_worker - wake up an idle worker
788 * @pool: worker pool to wake worker from
790 * Wake up the first idle worker of @pool.
793 * spin_lock_irq(pool->lock).
795 static void wake_up_worker(struct worker_pool *pool)
797 struct worker *worker = first_worker(pool);
800 wake_up_process(worker->task);
804 * wq_worker_waking_up - a worker is waking up
805 * @task: task waking up
806 * @cpu: CPU @task is waking up to
808 * This function is called during try_to_wake_up() when a worker is
812 * spin_lock_irq(rq->lock)
814 void wq_worker_waking_up(struct task_struct *task, int cpu)
816 struct worker *worker = kthread_data(task);
818 if (!(worker->flags & WORKER_NOT_RUNNING)) {
819 WARN_ON_ONCE(worker->pool->cpu != cpu);
820 atomic_inc(&worker->pool->nr_running);
825 * wq_worker_sleeping - a worker is going to sleep
826 * @task: task going to sleep
827 * @cpu: CPU in question, must be the current CPU number
829 * This function is called during schedule() when a busy worker is
830 * going to sleep. Worker on the same cpu can be woken up by
831 * returning pointer to its task.
834 * spin_lock_irq(rq->lock)
837 * Worker task on @cpu to wake up, %NULL if none.
839 struct task_struct *wq_worker_sleeping(struct task_struct *task, int cpu)
841 struct worker *worker = kthread_data(task), *to_wakeup = NULL;
842 struct worker_pool *pool;
845 * Rescuers, which may not have all the fields set up like normal
846 * workers, also reach here, let's not access anything before
847 * checking NOT_RUNNING.
849 if (worker->flags & WORKER_NOT_RUNNING)
854 /* this can only happen on the local cpu */
855 if (WARN_ON_ONCE(cpu != raw_smp_processor_id()))
859 * The counterpart of the following dec_and_test, implied mb,
860 * worklist not empty test sequence is in insert_work().
861 * Please read comment there.
863 * NOT_RUNNING is clear. This means that we're bound to and
864 * running on the local cpu w/ rq lock held and preemption
865 * disabled, which in turn means that none else could be
866 * manipulating idle_list, so dereferencing idle_list without pool
869 if (atomic_dec_and_test(&pool->nr_running) &&
870 !list_empty(&pool->worklist))
871 to_wakeup = first_worker(pool);
872 return to_wakeup ? to_wakeup->task : NULL;
876 * worker_set_flags - set worker flags and adjust nr_running accordingly
878 * @flags: flags to set
879 * @wakeup: wakeup an idle worker if necessary
881 * Set @flags in @worker->flags and adjust nr_running accordingly. If
882 * nr_running becomes zero and @wakeup is %true, an idle worker is
886 * spin_lock_irq(pool->lock)
888 static inline void worker_set_flags(struct worker *worker, unsigned int flags,
891 struct worker_pool *pool = worker->pool;
893 WARN_ON_ONCE(worker->task != current);
896 * If transitioning into NOT_RUNNING, adjust nr_running and
897 * wake up an idle worker as necessary if requested by
900 if ((flags & WORKER_NOT_RUNNING) &&
901 !(worker->flags & WORKER_NOT_RUNNING)) {
903 if (atomic_dec_and_test(&pool->nr_running) &&
904 !list_empty(&pool->worklist))
905 wake_up_worker(pool);
907 atomic_dec(&pool->nr_running);
910 worker->flags |= flags;
914 * worker_clr_flags - clear worker flags and adjust nr_running accordingly
916 * @flags: flags to clear
918 * Clear @flags in @worker->flags and adjust nr_running accordingly.
921 * spin_lock_irq(pool->lock)
923 static inline void worker_clr_flags(struct worker *worker, unsigned int flags)
925 struct worker_pool *pool = worker->pool;
926 unsigned int oflags = worker->flags;
928 WARN_ON_ONCE(worker->task != current);
930 worker->flags &= ~flags;
933 * If transitioning out of NOT_RUNNING, increment nr_running. Note
934 * that the nested NOT_RUNNING is not a noop. NOT_RUNNING is mask
935 * of multiple flags, not a single flag.
937 if ((flags & WORKER_NOT_RUNNING) && (oflags & WORKER_NOT_RUNNING))
938 if (!(worker->flags & WORKER_NOT_RUNNING))
939 atomic_inc(&pool->nr_running);
943 * find_worker_executing_work - find worker which is executing a work
944 * @pool: pool of interest
945 * @work: work to find worker for
947 * Find a worker which is executing @work on @pool by searching
948 * @pool->busy_hash which is keyed by the address of @work. For a worker
949 * to match, its current execution should match the address of @work and
950 * its work function. This is to avoid unwanted dependency between
951 * unrelated work executions through a work item being recycled while still
954 * This is a bit tricky. A work item may be freed once its execution
955 * starts and nothing prevents the freed area from being recycled for
956 * another work item. If the same work item address ends up being reused
957 * before the original execution finishes, workqueue will identify the
958 * recycled work item as currently executing and make it wait until the
959 * current execution finishes, introducing an unwanted dependency.
961 * This function checks the work item address and work function to avoid
962 * false positives. Note that this isn't complete as one may construct a
963 * work function which can introduce dependency onto itself through a
964 * recycled work item. Well, if somebody wants to shoot oneself in the
965 * foot that badly, there's only so much we can do, and if such deadlock
966 * actually occurs, it should be easy to locate the culprit work function.
969 * spin_lock_irq(pool->lock).
972 * Pointer to worker which is executing @work if found, NULL
975 static struct worker *find_worker_executing_work(struct worker_pool *pool,
976 struct work_struct *work)
978 struct worker *worker;
980 hash_for_each_possible(pool->busy_hash, worker, hentry,
982 if (worker->current_work == work &&
983 worker->current_func == work->func)
990 * move_linked_works - move linked works to a list
991 * @work: start of series of works to be scheduled
992 * @head: target list to append @work to
993 * @nextp: out paramter for nested worklist walking
995 * Schedule linked works starting from @work to @head. Work series to
996 * be scheduled starts at @work and includes any consecutive work with
997 * WORK_STRUCT_LINKED set in its predecessor.
999 * If @nextp is not NULL, it's updated to point to the next work of
1000 * the last scheduled work. This allows move_linked_works() to be
1001 * nested inside outer list_for_each_entry_safe().
1004 * spin_lock_irq(pool->lock).
1006 static void move_linked_works(struct work_struct *work, struct list_head *head,
1007 struct work_struct **nextp)
1009 struct work_struct *n;
1012 * Linked worklist will always end before the end of the list,
1013 * use NULL for list head.
1015 list_for_each_entry_safe_from(work, n, NULL, entry) {
1016 list_move_tail(&work->entry, head);
1017 if (!(*work_data_bits(work) & WORK_STRUCT_LINKED))
1022 * If we're already inside safe list traversal and have moved
1023 * multiple works to the scheduled queue, the next position
1024 * needs to be updated.
1031 * get_pwq - get an extra reference on the specified pool_workqueue
1032 * @pwq: pool_workqueue to get
1034 * Obtain an extra reference on @pwq. The caller should guarantee that
1035 * @pwq has positive refcnt and be holding the matching pool->lock.
1037 static void get_pwq(struct pool_workqueue *pwq)
1039 lockdep_assert_held(&pwq->pool->lock);
1040 WARN_ON_ONCE(pwq->refcnt <= 0);
1045 * put_pwq - put a pool_workqueue reference
1046 * @pwq: pool_workqueue to put
1048 * Drop a reference of @pwq. If its refcnt reaches zero, schedule its
1049 * destruction. The caller should be holding the matching pool->lock.
1051 static void put_pwq(struct pool_workqueue *pwq)
1053 lockdep_assert_held(&pwq->pool->lock);
1054 if (likely(--pwq->refcnt))
1056 if (WARN_ON_ONCE(!(pwq->wq->flags & WQ_UNBOUND)))
1059 * @pwq can't be released under pool->lock, bounce to
1060 * pwq_unbound_release_workfn(). This never recurses on the same
1061 * pool->lock as this path is taken only for unbound workqueues and
1062 * the release work item is scheduled on a per-cpu workqueue. To
1063 * avoid lockdep warning, unbound pool->locks are given lockdep
1064 * subclass of 1 in get_unbound_pool().
1066 schedule_work(&pwq->unbound_release_work);
1070 * put_pwq_unlocked - put_pwq() with surrounding pool lock/unlock
1071 * @pwq: pool_workqueue to put (can be %NULL)
1073 * put_pwq() with locking. This function also allows %NULL @pwq.
1075 static void put_pwq_unlocked(struct pool_workqueue *pwq)
1079 * As both pwqs and pools are sched-RCU protected, the
1080 * following lock operations are safe.
1082 spin_lock_irq(&pwq->pool->lock);
1084 spin_unlock_irq(&pwq->pool->lock);
1088 static void pwq_activate_delayed_work(struct work_struct *work)
1090 struct pool_workqueue *pwq = get_work_pwq(work);
1092 trace_workqueue_activate_work(work);
1093 move_linked_works(work, &pwq->pool->worklist, NULL);
1094 __clear_bit(WORK_STRUCT_DELAYED_BIT, work_data_bits(work));
1098 static void pwq_activate_first_delayed(struct pool_workqueue *pwq)
1100 struct work_struct *work = list_first_entry(&pwq->delayed_works,
1101 struct work_struct, entry);
1103 pwq_activate_delayed_work(work);
1107 * pwq_dec_nr_in_flight - decrement pwq's nr_in_flight
1108 * @pwq: pwq of interest
1109 * @color: color of work which left the queue
1111 * A work either has completed or is removed from pending queue,
1112 * decrement nr_in_flight of its pwq and handle workqueue flushing.
1115 * spin_lock_irq(pool->lock).
1117 static void pwq_dec_nr_in_flight(struct pool_workqueue *pwq, int color)
1119 /* uncolored work items don't participate in flushing or nr_active */
1120 if (color == WORK_NO_COLOR)
1123 pwq->nr_in_flight[color]--;
1126 if (!list_empty(&pwq->delayed_works)) {
1127 /* one down, submit a delayed one */
1128 if (pwq->nr_active < pwq->max_active)
1129 pwq_activate_first_delayed(pwq);
1132 /* is flush in progress and are we at the flushing tip? */
1133 if (likely(pwq->flush_color != color))
1136 /* are there still in-flight works? */
1137 if (pwq->nr_in_flight[color])
1140 /* this pwq is done, clear flush_color */
1141 pwq->flush_color = -1;
1144 * If this was the last pwq, wake up the first flusher. It
1145 * will handle the rest.
1147 if (atomic_dec_and_test(&pwq->wq->nr_pwqs_to_flush))
1148 complete(&pwq->wq->first_flusher->done);
1154 * try_to_grab_pending - steal work item from worklist and disable irq
1155 * @work: work item to steal
1156 * @is_dwork: @work is a delayed_work
1157 * @flags: place to store irq state
1159 * Try to grab PENDING bit of @work. This function can handle @work in any
1160 * stable state - idle, on timer or on worklist. Return values are
1162 * 1 if @work was pending and we successfully stole PENDING
1163 * 0 if @work was idle and we claimed PENDING
1164 * -EAGAIN if PENDING couldn't be grabbed at the moment, safe to busy-retry
1165 * -ENOENT if someone else is canceling @work, this state may persist
1166 * for arbitrarily long
1168 * On >= 0 return, the caller owns @work's PENDING bit. To avoid getting
1169 * interrupted while holding PENDING and @work off queue, irq must be
1170 * disabled on entry. This, combined with delayed_work->timer being
1171 * irqsafe, ensures that we return -EAGAIN for finite short period of time.
1173 * On successful return, >= 0, irq is disabled and the caller is
1174 * responsible for releasing it using local_irq_restore(*@flags).
1176 * This function is safe to call from any context including IRQ handler.
1178 static int try_to_grab_pending(struct work_struct *work, bool is_dwork,
1179 unsigned long *flags)
1181 struct worker_pool *pool;
1182 struct pool_workqueue *pwq;
1184 local_irq_save(*flags);
1186 /* try to steal the timer if it exists */
1188 struct delayed_work *dwork = to_delayed_work(work);
1191 * dwork->timer is irqsafe. If del_timer() fails, it's
1192 * guaranteed that the timer is not queued anywhere and not
1193 * running on the local CPU.
1195 if (likely(del_timer(&dwork->timer)))
1199 /* try to claim PENDING the normal way */
1200 if (!test_and_set_bit(WORK_STRUCT_PENDING_BIT, work_data_bits(work)))
1204 * The queueing is in progress, or it is already queued. Try to
1205 * steal it from ->worklist without clearing WORK_STRUCT_PENDING.
1207 pool = get_work_pool(work);
1211 spin_lock(&pool->lock);
1213 * work->data is guaranteed to point to pwq only while the work
1214 * item is queued on pwq->wq, and both updating work->data to point
1215 * to pwq on queueing and to pool on dequeueing are done under
1216 * pwq->pool->lock. This in turn guarantees that, if work->data
1217 * points to pwq which is associated with a locked pool, the work
1218 * item is currently queued on that pool.
1220 pwq = get_work_pwq(work);
1221 if (pwq && pwq->pool == pool) {
1222 debug_work_deactivate(work);
1225 * A delayed work item cannot be grabbed directly because
1226 * it might have linked NO_COLOR work items which, if left
1227 * on the delayed_list, will confuse pwq->nr_active
1228 * management later on and cause stall. Make sure the work
1229 * item is activated before grabbing.
1231 if (*work_data_bits(work) & WORK_STRUCT_DELAYED)
1232 pwq_activate_delayed_work(work);
1234 list_del_init(&work->entry);
1235 pwq_dec_nr_in_flight(get_work_pwq(work), get_work_color(work));
1237 /* work->data points to pwq iff queued, point to pool */
1238 set_work_pool_and_keep_pending(work, pool->id);
1240 spin_unlock(&pool->lock);
1243 spin_unlock(&pool->lock);
1245 local_irq_restore(*flags);
1246 if (work_is_canceling(work))
1253 * insert_work - insert a work into a pool
1254 * @pwq: pwq @work belongs to
1255 * @work: work to insert
1256 * @head: insertion point
1257 * @extra_flags: extra WORK_STRUCT_* flags to set
1259 * Insert @work which belongs to @pwq after @head. @extra_flags is or'd to
1260 * work_struct flags.
1263 * spin_lock_irq(pool->lock).
1265 static void insert_work(struct pool_workqueue *pwq, struct work_struct *work,
1266 struct list_head *head, unsigned int extra_flags)
1268 struct worker_pool *pool = pwq->pool;
1270 /* we own @work, set data and link */
1271 set_work_pwq(work, pwq, extra_flags);
1272 list_add_tail(&work->entry, head);
1276 * Ensure either wq_worker_sleeping() sees the above
1277 * list_add_tail() or we see zero nr_running to avoid workers lying
1278 * around lazily while there are works to be processed.
1282 if (__need_more_worker(pool))
1283 wake_up_worker(pool);
1287 * Test whether @work is being queued from another work executing on the
1290 static bool is_chained_work(struct workqueue_struct *wq)
1292 struct worker *worker;
1294 worker = current_wq_worker();
1296 * Return %true iff I'm a worker execuing a work item on @wq. If
1297 * I'm @worker, it's safe to dereference it without locking.
1299 return worker && worker->current_pwq->wq == wq;
1302 static void __queue_work(int cpu, struct workqueue_struct *wq,
1303 struct work_struct *work)
1305 struct pool_workqueue *pwq;
1306 struct worker_pool *last_pool;
1307 struct list_head *worklist;
1308 unsigned int work_flags;
1309 unsigned int req_cpu = cpu;
1312 * While a work item is PENDING && off queue, a task trying to
1313 * steal the PENDING will busy-loop waiting for it to either get
1314 * queued or lose PENDING. Grabbing PENDING and queueing should
1315 * happen with IRQ disabled.
1317 WARN_ON_ONCE(!irqs_disabled());
1319 debug_work_activate(work);
1321 /* if dying, only works from the same workqueue are allowed */
1322 if (unlikely(wq->flags & __WQ_DRAINING) &&
1323 WARN_ON_ONCE(!is_chained_work(wq)))
1326 if (req_cpu == WORK_CPU_UNBOUND)
1327 cpu = raw_smp_processor_id();
1329 /* pwq which will be used unless @work is executing elsewhere */
1330 if (!(wq->flags & WQ_UNBOUND))
1331 pwq = per_cpu_ptr(wq->cpu_pwqs, cpu);
1333 pwq = unbound_pwq_by_node(wq, cpu_to_node(cpu));
1336 * If @work was previously on a different pool, it might still be
1337 * running there, in which case the work needs to be queued on that
1338 * pool to guarantee non-reentrancy.
1340 last_pool = get_work_pool(work);
1341 if (last_pool && last_pool != pwq->pool) {
1342 struct worker *worker;
1344 spin_lock(&last_pool->lock);
1346 worker = find_worker_executing_work(last_pool, work);
1348 if (worker && worker->current_pwq->wq == wq) {
1349 pwq = worker->current_pwq;
1351 /* meh... not running there, queue here */
1352 spin_unlock(&last_pool->lock);
1353 spin_lock(&pwq->pool->lock);
1356 spin_lock(&pwq->pool->lock);
1360 * pwq is determined and locked. For unbound pools, we could have
1361 * raced with pwq release and it could already be dead. If its
1362 * refcnt is zero, repeat pwq selection. Note that pwqs never die
1363 * without another pwq replacing it in the numa_pwq_tbl or while
1364 * work items are executing on it, so the retrying is guaranteed to
1365 * make forward-progress.
1367 if (unlikely(!pwq->refcnt)) {
1368 if (wq->flags & WQ_UNBOUND) {
1369 spin_unlock(&pwq->pool->lock);
1374 WARN_ONCE(true, "workqueue: per-cpu pwq for %s on cpu%d has 0 refcnt",
1378 /* pwq determined, queue */
1379 trace_workqueue_queue_work(req_cpu, pwq, work);
1381 if (WARN_ON(!list_empty(&work->entry))) {
1382 spin_unlock(&pwq->pool->lock);
1386 pwq->nr_in_flight[pwq->work_color]++;
1387 work_flags = work_color_to_flags(pwq->work_color);
1389 if (likely(pwq->nr_active < pwq->max_active)) {
1390 trace_workqueue_activate_work(work);
1392 worklist = &pwq->pool->worklist;
1394 work_flags |= WORK_STRUCT_DELAYED;
1395 worklist = &pwq->delayed_works;
1398 insert_work(pwq, work, worklist, work_flags);
1400 spin_unlock(&pwq->pool->lock);
1404 * queue_work_on - queue work on specific cpu
1405 * @cpu: CPU number to execute work on
1406 * @wq: workqueue to use
1407 * @work: work to queue
1409 * Returns %false if @work was already on a queue, %true otherwise.
1411 * We queue the work to a specific CPU, the caller must ensure it
1414 bool queue_work_on(int cpu, struct workqueue_struct *wq,
1415 struct work_struct *work)
1418 unsigned long flags;
1420 local_irq_save(flags);
1422 if (!test_and_set_bit(WORK_STRUCT_PENDING_BIT, work_data_bits(work))) {
1423 __queue_work(cpu, wq, work);
1427 local_irq_restore(flags);
1430 EXPORT_SYMBOL(queue_work_on);
1432 void delayed_work_timer_fn(unsigned long __data)
1434 struct delayed_work *dwork = (struct delayed_work *)__data;
1436 /* should have been called from irqsafe timer with irq already off */
1437 __queue_work(dwork->cpu, dwork->wq, &dwork->work);
1439 EXPORT_SYMBOL(delayed_work_timer_fn);
1441 static void __queue_delayed_work(int cpu, struct workqueue_struct *wq,
1442 struct delayed_work *dwork, unsigned long delay)
1444 struct timer_list *timer = &dwork->timer;
1445 struct work_struct *work = &dwork->work;
1447 WARN_ON_ONCE(timer->function != delayed_work_timer_fn ||
1448 timer->data != (unsigned long)dwork);
1449 WARN_ON_ONCE(timer_pending(timer));
1450 WARN_ON_ONCE(!list_empty(&work->entry));
1453 * If @delay is 0, queue @dwork->work immediately. This is for
1454 * both optimization and correctness. The earliest @timer can
1455 * expire is on the closest next tick and delayed_work users depend
1456 * on that there's no such delay when @delay is 0.
1459 __queue_work(cpu, wq, &dwork->work);
1463 timer_stats_timer_set_start_info(&dwork->timer);
1467 timer->expires = jiffies + delay;
1469 if (unlikely(cpu != WORK_CPU_UNBOUND))
1470 add_timer_on(timer, cpu);
1476 * queue_delayed_work_on - queue work on specific CPU after delay
1477 * @cpu: CPU number to execute work on
1478 * @wq: workqueue to use
1479 * @dwork: work to queue
1480 * @delay: number of jiffies to wait before queueing
1482 * Returns %false if @work was already on a queue, %true otherwise. If
1483 * @delay is zero and @dwork is idle, it will be scheduled for immediate
1486 bool queue_delayed_work_on(int cpu, struct workqueue_struct *wq,
1487 struct delayed_work *dwork, unsigned long delay)
1489 struct work_struct *work = &dwork->work;
1491 unsigned long flags;
1493 /* read the comment in __queue_work() */
1494 local_irq_save(flags);
1496 if (!test_and_set_bit(WORK_STRUCT_PENDING_BIT, work_data_bits(work))) {
1497 __queue_delayed_work(cpu, wq, dwork, delay);
1501 local_irq_restore(flags);
1504 EXPORT_SYMBOL(queue_delayed_work_on);
1507 * mod_delayed_work_on - modify delay of or queue a delayed work on specific CPU
1508 * @cpu: CPU number to execute work on
1509 * @wq: workqueue to use
1510 * @dwork: work to queue
1511 * @delay: number of jiffies to wait before queueing
1513 * If @dwork is idle, equivalent to queue_delayed_work_on(); otherwise,
1514 * modify @dwork's timer so that it expires after @delay. If @delay is
1515 * zero, @work is guaranteed to be scheduled immediately regardless of its
1518 * Returns %false if @dwork was idle and queued, %true if @dwork was
1519 * pending and its timer was modified.
1521 * This function is safe to call from any context including IRQ handler.
1522 * See try_to_grab_pending() for details.
1524 bool mod_delayed_work_on(int cpu, struct workqueue_struct *wq,
1525 struct delayed_work *dwork, unsigned long delay)
1527 unsigned long flags;
1531 ret = try_to_grab_pending(&dwork->work, true, &flags);
1532 } while (unlikely(ret == -EAGAIN));
1534 if (likely(ret >= 0)) {
1535 __queue_delayed_work(cpu, wq, dwork, delay);
1536 local_irq_restore(flags);
1539 /* -ENOENT from try_to_grab_pending() becomes %true */
1542 EXPORT_SYMBOL_GPL(mod_delayed_work_on);
1545 * worker_enter_idle - enter idle state
1546 * @worker: worker which is entering idle state
1548 * @worker is entering idle state. Update stats and idle timer if
1552 * spin_lock_irq(pool->lock).
1554 static void worker_enter_idle(struct worker *worker)
1556 struct worker_pool *pool = worker->pool;
1558 if (WARN_ON_ONCE(worker->flags & WORKER_IDLE) ||
1559 WARN_ON_ONCE(!list_empty(&worker->entry) &&
1560 (worker->hentry.next || worker->hentry.pprev)))
1563 /* can't use worker_set_flags(), also called from start_worker() */
1564 worker->flags |= WORKER_IDLE;
1566 worker->last_active = jiffies;
1568 /* idle_list is LIFO */
1569 list_add(&worker->entry, &pool->idle_list);
1571 if (too_many_workers(pool) && !timer_pending(&pool->idle_timer))
1572 mod_timer(&pool->idle_timer, jiffies + IDLE_WORKER_TIMEOUT);
1575 * Sanity check nr_running. Because wq_unbind_fn() releases
1576 * pool->lock between setting %WORKER_UNBOUND and zapping
1577 * nr_running, the warning may trigger spuriously. Check iff
1578 * unbind is not in progress.
1580 WARN_ON_ONCE(!(pool->flags & POOL_DISASSOCIATED) &&
1581 pool->nr_workers == pool->nr_idle &&
1582 atomic_read(&pool->nr_running));
1586 * worker_leave_idle - leave idle state
1587 * @worker: worker which is leaving idle state
1589 * @worker is leaving idle state. Update stats.
1592 * spin_lock_irq(pool->lock).
1594 static void worker_leave_idle(struct worker *worker)
1596 struct worker_pool *pool = worker->pool;
1598 if (WARN_ON_ONCE(!(worker->flags & WORKER_IDLE)))
1600 worker_clr_flags(worker, WORKER_IDLE);
1602 list_del_init(&worker->entry);
1606 * worker_maybe_bind_and_lock - try to bind %current to worker_pool and lock it
1607 * @pool: target worker_pool
1609 * Bind %current to the cpu of @pool if it is associated and lock @pool.
1611 * Works which are scheduled while the cpu is online must at least be
1612 * scheduled to a worker which is bound to the cpu so that if they are
1613 * flushed from cpu callbacks while cpu is going down, they are
1614 * guaranteed to execute on the cpu.
1616 * This function is to be used by unbound workers and rescuers to bind
1617 * themselves to the target cpu and may race with cpu going down or
1618 * coming online. kthread_bind() can't be used because it may put the
1619 * worker to already dead cpu and set_cpus_allowed_ptr() can't be used
1620 * verbatim as it's best effort and blocking and pool may be
1621 * [dis]associated in the meantime.
1623 * This function tries set_cpus_allowed() and locks pool and verifies the
1624 * binding against %POOL_DISASSOCIATED which is set during
1625 * %CPU_DOWN_PREPARE and cleared during %CPU_ONLINE, so if the worker
1626 * enters idle state or fetches works without dropping lock, it can
1627 * guarantee the scheduling requirement described in the first paragraph.
1630 * Might sleep. Called without any lock but returns with pool->lock
1634 * %true if the associated pool is online (@worker is successfully
1635 * bound), %false if offline.
1637 static bool worker_maybe_bind_and_lock(struct worker_pool *pool)
1638 __acquires(&pool->lock)
1642 * The following call may fail, succeed or succeed
1643 * without actually migrating the task to the cpu if
1644 * it races with cpu hotunplug operation. Verify
1645 * against POOL_DISASSOCIATED.
1647 if (!(pool->flags & POOL_DISASSOCIATED))
1648 set_cpus_allowed_ptr(current, pool->attrs->cpumask);
1650 spin_lock_irq(&pool->lock);
1651 if (pool->flags & POOL_DISASSOCIATED)
1653 if (task_cpu(current) == pool->cpu &&
1654 cpumask_equal(¤t->cpus_allowed, pool->attrs->cpumask))
1656 spin_unlock_irq(&pool->lock);
1659 * We've raced with CPU hot[un]plug. Give it a breather
1660 * and retry migration. cond_resched() is required here;
1661 * otherwise, we might deadlock against cpu_stop trying to
1662 * bring down the CPU on non-preemptive kernel.
1669 static struct worker *alloc_worker(void)
1671 struct worker *worker;
1673 worker = kzalloc(sizeof(*worker), GFP_KERNEL);
1675 INIT_LIST_HEAD(&worker->entry);
1676 INIT_LIST_HEAD(&worker->scheduled);
1677 /* on creation a worker is in !idle && prep state */
1678 worker->flags = WORKER_PREP;
1684 * create_worker - create a new workqueue worker
1685 * @pool: pool the new worker will belong to
1687 * Create a new worker which is bound to @pool. The returned worker
1688 * can be started by calling start_worker() or destroyed using
1692 * Might sleep. Does GFP_KERNEL allocations.
1695 * Pointer to the newly created worker.
1697 static struct worker *create_worker(struct worker_pool *pool)
1699 struct worker *worker = NULL;
1703 lockdep_assert_held(&pool->manager_mutex);
1706 * ID is needed to determine kthread name. Allocate ID first
1707 * without installing the pointer.
1709 idr_preload(GFP_KERNEL);
1710 spin_lock_irq(&pool->lock);
1712 id = idr_alloc(&pool->worker_idr, NULL, 0, 0, GFP_NOWAIT);
1714 spin_unlock_irq(&pool->lock);
1719 worker = alloc_worker();
1723 worker->pool = pool;
1727 snprintf(id_buf, sizeof(id_buf), "%d:%d%s", pool->cpu, id,
1728 pool->attrs->nice < 0 ? "H" : "");
1730 snprintf(id_buf, sizeof(id_buf), "u%d:%d", pool->id, id);
1732 worker->task = kthread_create_on_node(worker_thread, worker, pool->node,
1733 "kworker/%s", id_buf);
1734 if (IS_ERR(worker->task))
1738 * set_cpus_allowed_ptr() will fail if the cpumask doesn't have any
1739 * online CPUs. It'll be re-applied when any of the CPUs come up.
1741 set_user_nice(worker->task, pool->attrs->nice);
1742 set_cpus_allowed_ptr(worker->task, pool->attrs->cpumask);
1744 /* prevent userland from meddling with cpumask of workqueue workers */
1745 worker->task->flags |= PF_NO_SETAFFINITY;
1748 * The caller is responsible for ensuring %POOL_DISASSOCIATED
1749 * remains stable across this function. See the comments above the
1750 * flag definition for details.
1752 if (pool->flags & POOL_DISASSOCIATED)
1753 worker->flags |= WORKER_UNBOUND;
1755 /* successful, commit the pointer to idr */
1756 spin_lock_irq(&pool->lock);
1757 idr_replace(&pool->worker_idr, worker, worker->id);
1758 spin_unlock_irq(&pool->lock);
1764 spin_lock_irq(&pool->lock);
1765 idr_remove(&pool->worker_idr, id);
1766 spin_unlock_irq(&pool->lock);
1773 * start_worker - start a newly created worker
1774 * @worker: worker to start
1776 * Make the pool aware of @worker and start it.
1779 * spin_lock_irq(pool->lock).
1781 static void start_worker(struct worker *worker)
1783 worker->flags |= WORKER_STARTED;
1784 worker->pool->nr_workers++;
1785 worker_enter_idle(worker);
1786 wake_up_process(worker->task);
1790 * create_and_start_worker - create and start a worker for a pool
1791 * @pool: the target pool
1793 * Grab the managership of @pool and create and start a new worker for it.
1795 static int create_and_start_worker(struct worker_pool *pool)
1797 struct worker *worker;
1799 mutex_lock(&pool->manager_mutex);
1801 worker = create_worker(pool);
1803 spin_lock_irq(&pool->lock);
1804 start_worker(worker);
1805 spin_unlock_irq(&pool->lock);
1808 mutex_unlock(&pool->manager_mutex);
1810 return worker ? 0 : -ENOMEM;
1814 * destroy_worker - destroy a workqueue worker
1815 * @worker: worker to be destroyed
1817 * Destroy @worker and adjust @pool stats accordingly.
1820 * spin_lock_irq(pool->lock) which is released and regrabbed.
1822 static void destroy_worker(struct worker *worker)
1824 struct worker_pool *pool = worker->pool;
1826 lockdep_assert_held(&pool->manager_mutex);
1827 lockdep_assert_held(&pool->lock);
1829 /* sanity check frenzy */
1830 if (WARN_ON(worker->current_work) ||
1831 WARN_ON(!list_empty(&worker->scheduled)))
1834 if (worker->flags & WORKER_STARTED)
1836 if (worker->flags & WORKER_IDLE)
1840 * Once WORKER_DIE is set, the kworker may destroy itself at any
1841 * point. Pin to ensure the task stays until we're done with it.
1843 get_task_struct(worker->task);
1845 list_del_init(&worker->entry);
1846 worker->flags |= WORKER_DIE;
1848 idr_remove(&pool->worker_idr, worker->id);
1850 spin_unlock_irq(&pool->lock);
1852 kthread_stop(worker->task);
1853 put_task_struct(worker->task);
1856 spin_lock_irq(&pool->lock);
1859 static void idle_worker_timeout(unsigned long __pool)
1861 struct worker_pool *pool = (void *)__pool;
1863 spin_lock_irq(&pool->lock);
1865 if (too_many_workers(pool)) {
1866 struct worker *worker;
1867 unsigned long expires;
1869 /* idle_list is kept in LIFO order, check the last one */
1870 worker = list_entry(pool->idle_list.prev, struct worker, entry);
1871 expires = worker->last_active + IDLE_WORKER_TIMEOUT;
1873 if (time_before(jiffies, expires))
1874 mod_timer(&pool->idle_timer, expires);
1876 /* it's been idle for too long, wake up manager */
1877 pool->flags |= POOL_MANAGE_WORKERS;
1878 wake_up_worker(pool);
1882 spin_unlock_irq(&pool->lock);
1885 static void send_mayday(struct work_struct *work)
1887 struct pool_workqueue *pwq = get_work_pwq(work);
1888 struct workqueue_struct *wq = pwq->wq;
1890 lockdep_assert_held(&wq_mayday_lock);
1895 /* mayday mayday mayday */
1896 if (list_empty(&pwq->mayday_node)) {
1897 list_add_tail(&pwq->mayday_node, &wq->maydays);
1898 wake_up_process(wq->rescuer->task);
1902 static void pool_mayday_timeout(unsigned long __pool)
1904 struct worker_pool *pool = (void *)__pool;
1905 struct work_struct *work;
1907 spin_lock_irq(&wq_mayday_lock); /* for wq->maydays */
1908 spin_lock(&pool->lock);
1910 if (need_to_create_worker(pool)) {
1912 * We've been trying to create a new worker but
1913 * haven't been successful. We might be hitting an
1914 * allocation deadlock. Send distress signals to
1917 list_for_each_entry(work, &pool->worklist, entry)
1921 spin_unlock(&pool->lock);
1922 spin_unlock_irq(&wq_mayday_lock);
1924 mod_timer(&pool->mayday_timer, jiffies + MAYDAY_INTERVAL);
1928 * maybe_create_worker - create a new worker if necessary
1929 * @pool: pool to create a new worker for
1931 * Create a new worker for @pool if necessary. @pool is guaranteed to
1932 * have at least one idle worker on return from this function. If
1933 * creating a new worker takes longer than MAYDAY_INTERVAL, mayday is
1934 * sent to all rescuers with works scheduled on @pool to resolve
1935 * possible allocation deadlock.
1937 * On return, need_to_create_worker() is guaranteed to be %false and
1938 * may_start_working() %true.
1941 * spin_lock_irq(pool->lock) which may be released and regrabbed
1942 * multiple times. Does GFP_KERNEL allocations. Called only from
1946 * %false if no action was taken and pool->lock stayed locked, %true
1949 static bool maybe_create_worker(struct worker_pool *pool)
1950 __releases(&pool->lock)
1951 __acquires(&pool->lock)
1953 if (!need_to_create_worker(pool))
1956 spin_unlock_irq(&pool->lock);
1958 /* if we don't make progress in MAYDAY_INITIAL_TIMEOUT, call for help */
1959 mod_timer(&pool->mayday_timer, jiffies + MAYDAY_INITIAL_TIMEOUT);
1962 struct worker *worker;
1964 worker = create_worker(pool);
1966 del_timer_sync(&pool->mayday_timer);
1967 spin_lock_irq(&pool->lock);
1968 start_worker(worker);
1969 if (WARN_ON_ONCE(need_to_create_worker(pool)))
1974 if (!need_to_create_worker(pool))
1977 __set_current_state(TASK_INTERRUPTIBLE);
1978 schedule_timeout(CREATE_COOLDOWN);
1980 if (!need_to_create_worker(pool))
1984 del_timer_sync(&pool->mayday_timer);
1985 spin_lock_irq(&pool->lock);
1986 if (need_to_create_worker(pool))
1992 * maybe_destroy_worker - destroy workers which have been idle for a while
1993 * @pool: pool to destroy workers for
1995 * Destroy @pool workers which have been idle for longer than
1996 * IDLE_WORKER_TIMEOUT.
1999 * spin_lock_irq(pool->lock) which may be released and regrabbed
2000 * multiple times. Called only from manager.
2003 * %false if no action was taken and pool->lock stayed locked, %true
2006 static bool maybe_destroy_workers(struct worker_pool *pool)
2010 while (too_many_workers(pool)) {
2011 struct worker *worker;
2012 unsigned long expires;
2014 worker = list_entry(pool->idle_list.prev, struct worker, entry);
2015 expires = worker->last_active + IDLE_WORKER_TIMEOUT;
2017 if (time_before(jiffies, expires)) {
2018 mod_timer(&pool->idle_timer, expires);
2022 destroy_worker(worker);
2030 * manage_workers - manage worker pool
2033 * Assume the manager role and manage the worker pool @worker belongs
2034 * to. At any given time, there can be only zero or one manager per
2035 * pool. The exclusion is handled automatically by this function.
2037 * The caller can safely start processing works on false return. On
2038 * true return, it's guaranteed that need_to_create_worker() is false
2039 * and may_start_working() is true.
2042 * spin_lock_irq(pool->lock) which may be released and regrabbed
2043 * multiple times. Does GFP_KERNEL allocations.
2046 * spin_lock_irq(pool->lock) which may be released and regrabbed
2047 * multiple times. Does GFP_KERNEL allocations.
2049 static bool manage_workers(struct worker *worker)
2051 struct worker_pool *pool = worker->pool;
2055 * Managership is governed by two mutexes - manager_arb and
2056 * manager_mutex. manager_arb handles arbitration of manager role.
2057 * Anyone who successfully grabs manager_arb wins the arbitration
2058 * and becomes the manager. mutex_trylock() on pool->manager_arb
2059 * failure while holding pool->lock reliably indicates that someone
2060 * else is managing the pool and the worker which failed trylock
2061 * can proceed to executing work items. This means that anyone
2062 * grabbing manager_arb is responsible for actually performing
2063 * manager duties. If manager_arb is grabbed and released without
2064 * actual management, the pool may stall indefinitely.
2066 * manager_mutex is used for exclusion of actual management
2067 * operations. The holder of manager_mutex can be sure that none
2068 * of management operations, including creation and destruction of
2069 * workers, won't take place until the mutex is released. Because
2070 * manager_mutex doesn't interfere with manager role arbitration,
2071 * it is guaranteed that the pool's management, while may be
2072 * delayed, won't be disturbed by someone else grabbing
2075 if (!mutex_trylock(&pool->manager_arb))
2079 * With manager arbitration won, manager_mutex would be free in
2080 * most cases. trylock first without dropping @pool->lock.
2082 if (unlikely(!mutex_trylock(&pool->manager_mutex))) {
2083 spin_unlock_irq(&pool->lock);
2084 mutex_lock(&pool->manager_mutex);
2085 spin_lock_irq(&pool->lock);
2089 pool->flags &= ~POOL_MANAGE_WORKERS;
2092 * Destroy and then create so that may_start_working() is true
2095 ret |= maybe_destroy_workers(pool);
2096 ret |= maybe_create_worker(pool);
2098 mutex_unlock(&pool->manager_mutex);
2099 mutex_unlock(&pool->manager_arb);
2104 * process_one_work - process single work
2106 * @work: work to process
2108 * Process @work. This function contains all the logics necessary to
2109 * process a single work including synchronization against and
2110 * interaction with other workers on the same cpu, queueing and
2111 * flushing. As long as context requirement is met, any worker can
2112 * call this function to process a work.
2115 * spin_lock_irq(pool->lock) which is released and regrabbed.
2117 static void process_one_work(struct worker *worker, struct work_struct *work)
2118 __releases(&pool->lock)
2119 __acquires(&pool->lock)
2121 struct pool_workqueue *pwq = get_work_pwq(work);
2122 struct worker_pool *pool = worker->pool;
2123 bool cpu_intensive = pwq->wq->flags & WQ_CPU_INTENSIVE;
2125 struct worker *collision;
2126 #ifdef CONFIG_LOCKDEP
2128 * It is permissible to free the struct work_struct from
2129 * inside the function that is called from it, this we need to
2130 * take into account for lockdep too. To avoid bogus "held
2131 * lock freed" warnings as well as problems when looking into
2132 * work->lockdep_map, make a copy and use that here.
2134 struct lockdep_map lockdep_map;
2136 lockdep_copy_map(&lockdep_map, &work->lockdep_map);
2139 * Ensure we're on the correct CPU. DISASSOCIATED test is
2140 * necessary to avoid spurious warnings from rescuers servicing the
2141 * unbound or a disassociated pool.
2143 WARN_ON_ONCE(!(worker->flags & WORKER_UNBOUND) &&
2144 !(pool->flags & POOL_DISASSOCIATED) &&
2145 raw_smp_processor_id() != pool->cpu);
2148 * A single work shouldn't be executed concurrently by
2149 * multiple workers on a single cpu. Check whether anyone is
2150 * already processing the work. If so, defer the work to the
2151 * currently executing one.
2153 collision = find_worker_executing_work(pool, work);
2154 if (unlikely(collision)) {
2155 move_linked_works(work, &collision->scheduled, NULL);
2159 /* claim and dequeue */
2160 debug_work_deactivate(work);
2161 hash_add(pool->busy_hash, &worker->hentry, (unsigned long)work);
2162 worker->current_work = work;
2163 worker->current_func = work->func;
2164 worker->current_pwq = pwq;
2165 work_color = get_work_color(work);
2167 list_del_init(&work->entry);
2170 * CPU intensive works don't participate in concurrency
2171 * management. They're the scheduler's responsibility.
2173 if (unlikely(cpu_intensive))
2174 worker_set_flags(worker, WORKER_CPU_INTENSIVE, true);
2177 * Unbound pool isn't concurrency managed and work items should be
2178 * executed ASAP. Wake up another worker if necessary.
2180 if ((worker->flags & WORKER_UNBOUND) && need_more_worker(pool))
2181 wake_up_worker(pool);
2184 * Record the last pool and clear PENDING which should be the last
2185 * update to @work. Also, do this inside @pool->lock so that
2186 * PENDING and queued state changes happen together while IRQ is
2189 set_work_pool_and_clear_pending(work, pool->id);
2191 spin_unlock_irq(&pool->lock);
2193 lock_map_acquire_read(&pwq->wq->lockdep_map);
2194 lock_map_acquire(&lockdep_map);
2195 trace_workqueue_execute_start(work);
2196 worker->current_func(work);
2198 * While we must be careful to not use "work" after this, the trace
2199 * point will only record its address.
2201 trace_workqueue_execute_end(work);
2202 lock_map_release(&lockdep_map);
2203 lock_map_release(&pwq->wq->lockdep_map);
2205 if (unlikely(in_atomic() || lockdep_depth(current) > 0)) {
2206 pr_err("BUG: workqueue leaked lock or atomic: %s/0x%08x/%d\n"
2207 " last function: %pf\n",
2208 current->comm, preempt_count(), task_pid_nr(current),
2209 worker->current_func);
2210 debug_show_held_locks(current);
2215 * The following prevents a kworker from hogging CPU on !PREEMPT
2216 * kernels, where a requeueing work item waiting for something to
2217 * happen could deadlock with stop_machine as such work item could
2218 * indefinitely requeue itself while all other CPUs are trapped in
2223 spin_lock_irq(&pool->lock);
2225 /* clear cpu intensive status */
2226 if (unlikely(cpu_intensive))
2227 worker_clr_flags(worker, WORKER_CPU_INTENSIVE);
2229 /* we're done with it, release */
2230 hash_del(&worker->hentry);
2231 worker->current_work = NULL;
2232 worker->current_func = NULL;
2233 worker->current_pwq = NULL;
2234 worker->desc_valid = false;
2235 pwq_dec_nr_in_flight(pwq, work_color);
2239 * process_scheduled_works - process scheduled works
2242 * Process all scheduled works. Please note that the scheduled list
2243 * may change while processing a work, so this function repeatedly
2244 * fetches a work from the top and executes it.
2247 * spin_lock_irq(pool->lock) which may be released and regrabbed
2250 static void process_scheduled_works(struct worker *worker)
2252 while (!list_empty(&worker->scheduled)) {
2253 struct work_struct *work = list_first_entry(&worker->scheduled,
2254 struct work_struct, entry);
2255 process_one_work(worker, work);
2260 * worker_thread - the worker thread function
2263 * The worker thread function. All workers belong to a worker_pool -
2264 * either a per-cpu one or dynamic unbound one. These workers process all
2265 * work items regardless of their specific target workqueue. The only
2266 * exception is work items which belong to workqueues with a rescuer which
2267 * will be explained in rescuer_thread().
2269 static int worker_thread(void *__worker)
2271 struct worker *worker = __worker;
2272 struct worker_pool *pool = worker->pool;
2274 /* tell the scheduler that this is a workqueue worker */
2275 worker->task->flags |= PF_WQ_WORKER;
2277 spin_lock_irq(&pool->lock);
2279 /* am I supposed to die? */
2280 if (unlikely(worker->flags & WORKER_DIE)) {
2281 spin_unlock_irq(&pool->lock);
2282 WARN_ON_ONCE(!list_empty(&worker->entry));
2283 worker->task->flags &= ~PF_WQ_WORKER;
2287 worker_leave_idle(worker);
2289 /* no more worker necessary? */
2290 if (!need_more_worker(pool))
2293 /* do we need to manage? */
2294 if (unlikely(!may_start_working(pool)) && manage_workers(worker))
2298 * ->scheduled list can only be filled while a worker is
2299 * preparing to process a work or actually processing it.
2300 * Make sure nobody diddled with it while I was sleeping.
2302 WARN_ON_ONCE(!list_empty(&worker->scheduled));
2305 * Finish PREP stage. We're guaranteed to have at least one idle
2306 * worker or that someone else has already assumed the manager
2307 * role. This is where @worker starts participating in concurrency
2308 * management if applicable and concurrency management is restored
2309 * after being rebound. See rebind_workers() for details.
2311 worker_clr_flags(worker, WORKER_PREP | WORKER_REBOUND);
2314 struct work_struct *work =
2315 list_first_entry(&pool->worklist,
2316 struct work_struct, entry);
2318 if (likely(!(*work_data_bits(work) & WORK_STRUCT_LINKED))) {
2319 /* optimization path, not strictly necessary */
2320 process_one_work(worker, work);
2321 if (unlikely(!list_empty(&worker->scheduled)))
2322 process_scheduled_works(worker);
2324 move_linked_works(work, &worker->scheduled, NULL);
2325 process_scheduled_works(worker);
2327 } while (keep_working(pool));
2329 worker_set_flags(worker, WORKER_PREP, false);
2331 if (unlikely(need_to_manage_workers(pool)) && manage_workers(worker))
2335 * pool->lock is held and there's no work to process and no need to
2336 * manage, sleep. Workers are woken up only while holding
2337 * pool->lock or from local cpu, so setting the current state
2338 * before releasing pool->lock is enough to prevent losing any
2341 worker_enter_idle(worker);
2342 __set_current_state(TASK_INTERRUPTIBLE);
2343 spin_unlock_irq(&pool->lock);
2349 * rescuer_thread - the rescuer thread function
2352 * Workqueue rescuer thread function. There's one rescuer for each
2353 * workqueue which has WQ_MEM_RECLAIM set.
2355 * Regular work processing on a pool may block trying to create a new
2356 * worker which uses GFP_KERNEL allocation which has slight chance of
2357 * developing into deadlock if some works currently on the same queue
2358 * need to be processed to satisfy the GFP_KERNEL allocation. This is
2359 * the problem rescuer solves.
2361 * When such condition is possible, the pool summons rescuers of all
2362 * workqueues which have works queued on the pool and let them process
2363 * those works so that forward progress can be guaranteed.
2365 * This should happen rarely.
2367 static int rescuer_thread(void *__rescuer)
2369 struct worker *rescuer = __rescuer;
2370 struct workqueue_struct *wq = rescuer->rescue_wq;
2371 struct list_head *scheduled = &rescuer->scheduled;
2373 set_user_nice(current, RESCUER_NICE_LEVEL);
2376 * Mark rescuer as worker too. As WORKER_PREP is never cleared, it
2377 * doesn't participate in concurrency management.
2379 rescuer->task->flags |= PF_WQ_WORKER;
2381 set_current_state(TASK_INTERRUPTIBLE);
2383 if (kthread_should_stop()) {
2384 __set_current_state(TASK_RUNNING);
2385 rescuer->task->flags &= ~PF_WQ_WORKER;
2389 /* see whether any pwq is asking for help */
2390 spin_lock_irq(&wq_mayday_lock);
2392 while (!list_empty(&wq->maydays)) {
2393 struct pool_workqueue *pwq = list_first_entry(&wq->maydays,
2394 struct pool_workqueue, mayday_node);
2395 struct worker_pool *pool = pwq->pool;
2396 struct work_struct *work, *n;
2398 __set_current_state(TASK_RUNNING);
2399 list_del_init(&pwq->mayday_node);
2401 spin_unlock_irq(&wq_mayday_lock);
2403 /* migrate to the target cpu if possible */
2404 worker_maybe_bind_and_lock(pool);
2405 rescuer->pool = pool;
2408 * Slurp in all works issued via this workqueue and
2411 WARN_ON_ONCE(!list_empty(&rescuer->scheduled));
2412 list_for_each_entry_safe(work, n, &pool->worklist, entry)
2413 if (get_work_pwq(work) == pwq)
2414 move_linked_works(work, scheduled, &n);
2416 process_scheduled_works(rescuer);
2419 * Leave this pool. If keep_working() is %true, notify a
2420 * regular worker; otherwise, we end up with 0 concurrency
2421 * and stalling the execution.
2423 if (keep_working(pool))
2424 wake_up_worker(pool);
2426 rescuer->pool = NULL;
2427 spin_unlock(&pool->lock);
2428 spin_lock(&wq_mayday_lock);
2431 spin_unlock_irq(&wq_mayday_lock);
2433 /* rescuers should never participate in concurrency management */
2434 WARN_ON_ONCE(!(rescuer->flags & WORKER_NOT_RUNNING));
2440 struct work_struct work;
2441 struct completion done;
2444 static void wq_barrier_func(struct work_struct *work)
2446 struct wq_barrier *barr = container_of(work, struct wq_barrier, work);
2447 complete(&barr->done);
2451 * insert_wq_barrier - insert a barrier work
2452 * @pwq: pwq to insert barrier into
2453 * @barr: wq_barrier to insert
2454 * @target: target work to attach @barr to
2455 * @worker: worker currently executing @target, NULL if @target is not executing
2457 * @barr is linked to @target such that @barr is completed only after
2458 * @target finishes execution. Please note that the ordering
2459 * guarantee is observed only with respect to @target and on the local
2462 * Currently, a queued barrier can't be canceled. This is because
2463 * try_to_grab_pending() can't determine whether the work to be
2464 * grabbed is at the head of the queue and thus can't clear LINKED
2465 * flag of the previous work while there must be a valid next work
2466 * after a work with LINKED flag set.
2468 * Note that when @worker is non-NULL, @target may be modified
2469 * underneath us, so we can't reliably determine pwq from @target.
2472 * spin_lock_irq(pool->lock).
2474 static void insert_wq_barrier(struct pool_workqueue *pwq,
2475 struct wq_barrier *barr,
2476 struct work_struct *target, struct worker *worker)
2478 struct list_head *head;
2479 unsigned int linked = 0;
2482 * debugobject calls are safe here even with pool->lock locked
2483 * as we know for sure that this will not trigger any of the
2484 * checks and call back into the fixup functions where we
2487 INIT_WORK_ONSTACK(&barr->work, wq_barrier_func);
2488 __set_bit(WORK_STRUCT_PENDING_BIT, work_data_bits(&barr->work));
2489 init_completion(&barr->done);
2492 * If @target is currently being executed, schedule the
2493 * barrier to the worker; otherwise, put it after @target.
2496 head = worker->scheduled.next;
2498 unsigned long *bits = work_data_bits(target);
2500 head = target->entry.next;
2501 /* there can already be other linked works, inherit and set */
2502 linked = *bits & WORK_STRUCT_LINKED;
2503 __set_bit(WORK_STRUCT_LINKED_BIT, bits);
2506 debug_work_activate(&barr->work);
2507 insert_work(pwq, &barr->work, head,
2508 work_color_to_flags(WORK_NO_COLOR) | linked);
2512 * flush_workqueue_prep_pwqs - prepare pwqs for workqueue flushing
2513 * @wq: workqueue being flushed
2514 * @flush_color: new flush color, < 0 for no-op
2515 * @work_color: new work color, < 0 for no-op
2517 * Prepare pwqs for workqueue flushing.
2519 * If @flush_color is non-negative, flush_color on all pwqs should be
2520 * -1. If no pwq has in-flight commands at the specified color, all
2521 * pwq->flush_color's stay at -1 and %false is returned. If any pwq
2522 * has in flight commands, its pwq->flush_color is set to
2523 * @flush_color, @wq->nr_pwqs_to_flush is updated accordingly, pwq
2524 * wakeup logic is armed and %true is returned.
2526 * The caller should have initialized @wq->first_flusher prior to
2527 * calling this function with non-negative @flush_color. If
2528 * @flush_color is negative, no flush color update is done and %false
2531 * If @work_color is non-negative, all pwqs should have the same
2532 * work_color which is previous to @work_color and all will be
2533 * advanced to @work_color.
2536 * mutex_lock(wq->mutex).
2539 * %true if @flush_color >= 0 and there's something to flush. %false
2542 static bool flush_workqueue_prep_pwqs(struct workqueue_struct *wq,
2543 int flush_color, int work_color)
2546 struct pool_workqueue *pwq;
2548 if (flush_color >= 0) {
2549 WARN_ON_ONCE(atomic_read(&wq->nr_pwqs_to_flush));
2550 atomic_set(&wq->nr_pwqs_to_flush, 1);
2553 for_each_pwq(pwq, wq) {
2554 struct worker_pool *pool = pwq->pool;
2556 spin_lock_irq(&pool->lock);
2558 if (flush_color >= 0) {
2559 WARN_ON_ONCE(pwq->flush_color != -1);
2561 if (pwq->nr_in_flight[flush_color]) {
2562 pwq->flush_color = flush_color;
2563 atomic_inc(&wq->nr_pwqs_to_flush);
2568 if (work_color >= 0) {
2569 WARN_ON_ONCE(work_color != work_next_color(pwq->work_color));
2570 pwq->work_color = work_color;
2573 spin_unlock_irq(&pool->lock);
2576 if (flush_color >= 0 && atomic_dec_and_test(&wq->nr_pwqs_to_flush))
2577 complete(&wq->first_flusher->done);
2583 * flush_workqueue - ensure that any scheduled work has run to completion.
2584 * @wq: workqueue to flush
2586 * This function sleeps until all work items which were queued on entry
2587 * have finished execution, but it is not livelocked by new incoming ones.
2589 void flush_workqueue(struct workqueue_struct *wq)
2591 struct wq_flusher this_flusher = {
2592 .list = LIST_HEAD_INIT(this_flusher.list),
2594 .done = COMPLETION_INITIALIZER_ONSTACK(this_flusher.done),
2598 lock_map_acquire(&wq->lockdep_map);
2599 lock_map_release(&wq->lockdep_map);
2601 mutex_lock(&wq->mutex);
2604 * Start-to-wait phase
2606 next_color = work_next_color(wq->work_color);
2608 if (next_color != wq->flush_color) {
2610 * Color space is not full. The current work_color
2611 * becomes our flush_color and work_color is advanced
2614 WARN_ON_ONCE(!list_empty(&wq->flusher_overflow));
2615 this_flusher.flush_color = wq->work_color;
2616 wq->work_color = next_color;
2618 if (!wq->first_flusher) {
2619 /* no flush in progress, become the first flusher */
2620 WARN_ON_ONCE(wq->flush_color != this_flusher.flush_color);
2622 wq->first_flusher = &this_flusher;
2624 if (!flush_workqueue_prep_pwqs(wq, wq->flush_color,
2626 /* nothing to flush, done */
2627 wq->flush_color = next_color;
2628 wq->first_flusher = NULL;
2633 WARN_ON_ONCE(wq->flush_color == this_flusher.flush_color);
2634 list_add_tail(&this_flusher.list, &wq->flusher_queue);
2635 flush_workqueue_prep_pwqs(wq, -1, wq->work_color);
2639 * Oops, color space is full, wait on overflow queue.
2640 * The next flush completion will assign us
2641 * flush_color and transfer to flusher_queue.
2643 list_add_tail(&this_flusher.list, &wq->flusher_overflow);
2646 mutex_unlock(&wq->mutex);
2648 wait_for_completion(&this_flusher.done);
2651 * Wake-up-and-cascade phase
2653 * First flushers are responsible for cascading flushes and
2654 * handling overflow. Non-first flushers can simply return.
2656 if (wq->first_flusher != &this_flusher)
2659 mutex_lock(&wq->mutex);
2661 /* we might have raced, check again with mutex held */
2662 if (wq->first_flusher != &this_flusher)
2665 wq->first_flusher = NULL;
2667 WARN_ON_ONCE(!list_empty(&this_flusher.list));
2668 WARN_ON_ONCE(wq->flush_color != this_flusher.flush_color);
2671 struct wq_flusher *next, *tmp;
2673 /* complete all the flushers sharing the current flush color */
2674 list_for_each_entry_safe(next, tmp, &wq->flusher_queue, list) {
2675 if (next->flush_color != wq->flush_color)
2677 list_del_init(&next->list);
2678 complete(&next->done);
2681 WARN_ON_ONCE(!list_empty(&wq->flusher_overflow) &&
2682 wq->flush_color != work_next_color(wq->work_color));
2684 /* this flush_color is finished, advance by one */
2685 wq->flush_color = work_next_color(wq->flush_color);
2687 /* one color has been freed, handle overflow queue */
2688 if (!list_empty(&wq->flusher_overflow)) {
2690 * Assign the same color to all overflowed
2691 * flushers, advance work_color and append to
2692 * flusher_queue. This is the start-to-wait
2693 * phase for these overflowed flushers.
2695 list_for_each_entry(tmp, &wq->flusher_overflow, list)
2696 tmp->flush_color = wq->work_color;
2698 wq->work_color = work_next_color(wq->work_color);
2700 list_splice_tail_init(&wq->flusher_overflow,
2701 &wq->flusher_queue);
2702 flush_workqueue_prep_pwqs(wq, -1, wq->work_color);
2705 if (list_empty(&wq->flusher_queue)) {
2706 WARN_ON_ONCE(wq->flush_color != wq->work_color);
2711 * Need to flush more colors. Make the next flusher
2712 * the new first flusher and arm pwqs.
2714 WARN_ON_ONCE(wq->flush_color == wq->work_color);
2715 WARN_ON_ONCE(wq->flush_color != next->flush_color);
2717 list_del_init(&next->list);
2718 wq->first_flusher = next;
2720 if (flush_workqueue_prep_pwqs(wq, wq->flush_color, -1))
2724 * Meh... this color is already done, clear first
2725 * flusher and repeat cascading.
2727 wq->first_flusher = NULL;
2731 mutex_unlock(&wq->mutex);
2733 EXPORT_SYMBOL_GPL(flush_workqueue);
2736 * drain_workqueue - drain a workqueue
2737 * @wq: workqueue to drain
2739 * Wait until the workqueue becomes empty. While draining is in progress,
2740 * only chain queueing is allowed. IOW, only currently pending or running
2741 * work items on @wq can queue further work items on it. @wq is flushed
2742 * repeatedly until it becomes empty. The number of flushing is detemined
2743 * by the depth of chaining and should be relatively short. Whine if it
2746 void drain_workqueue(struct workqueue_struct *wq)
2748 unsigned int flush_cnt = 0;
2749 struct pool_workqueue *pwq;
2752 * __queue_work() needs to test whether there are drainers, is much
2753 * hotter than drain_workqueue() and already looks at @wq->flags.
2754 * Use __WQ_DRAINING so that queue doesn't have to check nr_drainers.
2756 mutex_lock(&wq->mutex);
2757 if (!wq->nr_drainers++)
2758 wq->flags |= __WQ_DRAINING;
2759 mutex_unlock(&wq->mutex);
2761 flush_workqueue(wq);
2763 mutex_lock(&wq->mutex);
2765 for_each_pwq(pwq, wq) {
2768 spin_lock_irq(&pwq->pool->lock);
2769 drained = !pwq->nr_active && list_empty(&pwq->delayed_works);
2770 spin_unlock_irq(&pwq->pool->lock);
2775 if (++flush_cnt == 10 ||
2776 (flush_cnt % 100 == 0 && flush_cnt <= 1000))
2777 pr_warn("workqueue %s: drain_workqueue() isn't complete after %u tries\n",
2778 wq->name, flush_cnt);
2780 mutex_unlock(&wq->mutex);
2784 if (!--wq->nr_drainers)
2785 wq->flags &= ~__WQ_DRAINING;
2786 mutex_unlock(&wq->mutex);
2788 EXPORT_SYMBOL_GPL(drain_workqueue);
2790 static bool start_flush_work(struct work_struct *work, struct wq_barrier *barr)
2792 struct worker *worker = NULL;
2793 struct worker_pool *pool;
2794 struct pool_workqueue *pwq;
2798 local_irq_disable();
2799 pool = get_work_pool(work);
2805 spin_lock(&pool->lock);
2806 /* see the comment in try_to_grab_pending() with the same code */
2807 pwq = get_work_pwq(work);
2809 if (unlikely(pwq->pool != pool))
2812 worker = find_worker_executing_work(pool, work);
2815 pwq = worker->current_pwq;
2818 insert_wq_barrier(pwq, barr, work, worker);
2819 spin_unlock_irq(&pool->lock);
2822 * If @max_active is 1 or rescuer is in use, flushing another work
2823 * item on the same workqueue may lead to deadlock. Make sure the
2824 * flusher is not running on the same workqueue by verifying write
2827 if (pwq->wq->saved_max_active == 1 || pwq->wq->rescuer)
2828 lock_map_acquire(&pwq->wq->lockdep_map);
2830 lock_map_acquire_read(&pwq->wq->lockdep_map);
2831 lock_map_release(&pwq->wq->lockdep_map);
2835 spin_unlock_irq(&pool->lock);
2840 * flush_work - wait for a work to finish executing the last queueing instance
2841 * @work: the work to flush
2843 * Wait until @work has finished execution. @work is guaranteed to be idle
2844 * on return if it hasn't been requeued since flush started.
2847 * %true if flush_work() waited for the work to finish execution,
2848 * %false if it was already idle.
2850 bool flush_work(struct work_struct *work)
2852 struct wq_barrier barr;
2854 lock_map_acquire(&work->lockdep_map);
2855 lock_map_release(&work->lockdep_map);
2857 if (start_flush_work(work, &barr)) {
2858 wait_for_completion(&barr.done);
2859 destroy_work_on_stack(&barr.work);
2865 EXPORT_SYMBOL_GPL(flush_work);
2867 static bool __cancel_work_timer(struct work_struct *work, bool is_dwork)
2869 unsigned long flags;
2873 ret = try_to_grab_pending(work, is_dwork, &flags);
2875 * If someone else is canceling, wait for the same event it
2876 * would be waiting for before retrying.
2878 if (unlikely(ret == -ENOENT))
2880 } while (unlikely(ret < 0));
2882 /* tell other tasks trying to grab @work to back off */
2883 mark_work_canceling(work);
2884 local_irq_restore(flags);
2887 clear_work_data(work);
2892 * cancel_work_sync - cancel a work and wait for it to finish
2893 * @work: the work to cancel
2895 * Cancel @work and wait for its execution to finish. This function
2896 * can be used even if the work re-queues itself or migrates to
2897 * another workqueue. On return from this function, @work is
2898 * guaranteed to be not pending or executing on any CPU.
2900 * cancel_work_sync(&delayed_work->work) must not be used for
2901 * delayed_work's. Use cancel_delayed_work_sync() instead.
2903 * The caller must ensure that the workqueue on which @work was last
2904 * queued can't be destroyed before this function returns.
2907 * %true if @work was pending, %false otherwise.
2909 bool cancel_work_sync(struct work_struct *work)
2911 return __cancel_work_timer(work, false);
2913 EXPORT_SYMBOL_GPL(cancel_work_sync);
2916 * flush_delayed_work - wait for a dwork to finish executing the last queueing
2917 * @dwork: the delayed work to flush
2919 * Delayed timer is cancelled and the pending work is queued for
2920 * immediate execution. Like flush_work(), this function only
2921 * considers the last queueing instance of @dwork.
2924 * %true if flush_work() waited for the work to finish execution,
2925 * %false if it was already idle.
2927 bool flush_delayed_work(struct delayed_work *dwork)
2929 local_irq_disable();
2930 if (del_timer_sync(&dwork->timer))
2931 __queue_work(dwork->cpu, dwork->wq, &dwork->work);
2933 return flush_work(&dwork->work);
2935 EXPORT_SYMBOL(flush_delayed_work);
2938 * cancel_delayed_work - cancel a delayed work
2939 * @dwork: delayed_work to cancel
2941 * Kill off a pending delayed_work. Returns %true if @dwork was pending
2942 * and canceled; %false if wasn't pending. Note that the work callback
2943 * function may still be running on return, unless it returns %true and the
2944 * work doesn't re-arm itself. Explicitly flush or use
2945 * cancel_delayed_work_sync() to wait on it.
2947 * This function is safe to call from any context including IRQ handler.
2949 bool cancel_delayed_work(struct delayed_work *dwork)
2951 unsigned long flags;
2955 ret = try_to_grab_pending(&dwork->work, true, &flags);
2956 } while (unlikely(ret == -EAGAIN));
2958 if (unlikely(ret < 0))
2961 set_work_pool_and_clear_pending(&dwork->work,
2962 get_work_pool_id(&dwork->work));
2963 local_irq_restore(flags);
2966 EXPORT_SYMBOL(cancel_delayed_work);
2969 * cancel_delayed_work_sync - cancel a delayed work and wait for it to finish
2970 * @dwork: the delayed work cancel
2972 * This is cancel_work_sync() for delayed works.
2975 * %true if @dwork was pending, %false otherwise.
2977 bool cancel_delayed_work_sync(struct delayed_work *dwork)
2979 return __cancel_work_timer(&dwork->work, true);
2981 EXPORT_SYMBOL(cancel_delayed_work_sync);
2984 * schedule_on_each_cpu - execute a function synchronously on each online CPU
2985 * @func: the function to call
2987 * schedule_on_each_cpu() executes @func on each online CPU using the
2988 * system workqueue and blocks until all CPUs have completed.
2989 * schedule_on_each_cpu() is very slow.
2992 * 0 on success, -errno on failure.
2994 int schedule_on_each_cpu(work_func_t func)
2997 struct work_struct __percpu *works;
2999 works = alloc_percpu(struct work_struct);
3005 for_each_online_cpu(cpu) {
3006 struct work_struct *work = per_cpu_ptr(works, cpu);
3008 INIT_WORK(work, func);
3009 schedule_work_on(cpu, work);
3012 for_each_online_cpu(cpu)
3013 flush_work(per_cpu_ptr(works, cpu));
3021 * flush_scheduled_work - ensure that any scheduled work has run to completion.
3023 * Forces execution of the kernel-global workqueue and blocks until its
3026 * Think twice before calling this function! It's very easy to get into
3027 * trouble if you don't take great care. Either of the following situations
3028 * will lead to deadlock:
3030 * One of the work items currently on the workqueue needs to acquire
3031 * a lock held by your code or its caller.
3033 * Your code is running in the context of a work routine.
3035 * They will be detected by lockdep when they occur, but the first might not
3036 * occur very often. It depends on what work items are on the workqueue and
3037 * what locks they need, which you have no control over.
3039 * In most situations flushing the entire workqueue is overkill; you merely
3040 * need to know that a particular work item isn't queued and isn't running.
3041 * In such cases you should use cancel_delayed_work_sync() or
3042 * cancel_work_sync() instead.
3044 void flush_scheduled_work(void)
3046 flush_workqueue(system_wq);
3048 EXPORT_SYMBOL(flush_scheduled_work);
3051 * execute_in_process_context - reliably execute the routine with user context
3052 * @fn: the function to execute
3053 * @ew: guaranteed storage for the execute work structure (must
3054 * be available when the work executes)
3056 * Executes the function immediately if process context is available,
3057 * otherwise schedules the function for delayed execution.
3059 * Returns: 0 - function was executed
3060 * 1 - function was scheduled for execution
3062 int execute_in_process_context(work_func_t fn, struct execute_work *ew)
3064 if (!in_interrupt()) {
3069 INIT_WORK(&ew->work, fn);
3070 schedule_work(&ew->work);
3074 EXPORT_SYMBOL_GPL(execute_in_process_context);
3078 * Workqueues with WQ_SYSFS flag set is visible to userland via
3079 * /sys/bus/workqueue/devices/WQ_NAME. All visible workqueues have the
3080 * following attributes.
3082 * per_cpu RO bool : whether the workqueue is per-cpu or unbound
3083 * max_active RW int : maximum number of in-flight work items
3085 * Unbound workqueues have the following extra attributes.
3087 * id RO int : the associated pool ID
3088 * nice RW int : nice value of the workers
3089 * cpumask RW mask : bitmask of allowed CPUs for the workers
3092 struct workqueue_struct *wq;
3096 static struct workqueue_struct *dev_to_wq(struct device *dev)
3098 struct wq_device *wq_dev = container_of(dev, struct wq_device, dev);
3103 static ssize_t wq_per_cpu_show(struct device *dev,
3104 struct device_attribute *attr, char *buf)
3106 struct workqueue_struct *wq = dev_to_wq(dev);
3108 return scnprintf(buf, PAGE_SIZE, "%d\n", (bool)!(wq->flags & WQ_UNBOUND));
3111 static ssize_t wq_max_active_show(struct device *dev,
3112 struct device_attribute *attr, char *buf)
3114 struct workqueue_struct *wq = dev_to_wq(dev);
3116 return scnprintf(buf, PAGE_SIZE, "%d\n", wq->saved_max_active);
3119 static ssize_t wq_max_active_store(struct device *dev,
3120 struct device_attribute *attr,
3121 const char *buf, size_t count)
3123 struct workqueue_struct *wq = dev_to_wq(dev);
3126 if (sscanf(buf, "%d", &val) != 1 || val <= 0)
3129 workqueue_set_max_active(wq, val);
3133 static struct device_attribute wq_sysfs_attrs[] = {
3134 __ATTR(per_cpu, 0444, wq_per_cpu_show, NULL),
3135 __ATTR(max_active, 0644, wq_max_active_show, wq_max_active_store),
3139 static ssize_t wq_pool_ids_show(struct device *dev,
3140 struct device_attribute *attr, char *buf)
3142 struct workqueue_struct *wq = dev_to_wq(dev);
3143 const char *delim = "";
3144 int node, written = 0;
3146 rcu_read_lock_sched();
3147 for_each_node(node) {
3148 written += scnprintf(buf + written, PAGE_SIZE - written,
3149 "%s%d:%d", delim, node,
3150 unbound_pwq_by_node(wq, node)->pool->id);
3153 written += scnprintf(buf + written, PAGE_SIZE - written, "\n");
3154 rcu_read_unlock_sched();
3159 static ssize_t wq_nice_show(struct device *dev, struct device_attribute *attr,
3162 struct workqueue_struct *wq = dev_to_wq(dev);
3165 mutex_lock(&wq->mutex);
3166 written = scnprintf(buf, PAGE_SIZE, "%d\n", wq->unbound_attrs->nice);
3167 mutex_unlock(&wq->mutex);
3172 /* prepare workqueue_attrs for sysfs store operations */
3173 static struct workqueue_attrs *wq_sysfs_prep_attrs(struct workqueue_struct *wq)
3175 struct workqueue_attrs *attrs;
3177 attrs = alloc_workqueue_attrs(GFP_KERNEL);
3181 mutex_lock(&wq->mutex);
3182 copy_workqueue_attrs(attrs, wq->unbound_attrs);
3183 mutex_unlock(&wq->mutex);
3187 static ssize_t wq_nice_store(struct device *dev, struct device_attribute *attr,
3188 const char *buf, size_t count)
3190 struct workqueue_struct *wq = dev_to_wq(dev);
3191 struct workqueue_attrs *attrs;
3194 attrs = wq_sysfs_prep_attrs(wq);
3198 if (sscanf(buf, "%d", &attrs->nice) == 1 &&
3199 attrs->nice >= -20 && attrs->nice <= 19)
3200 ret = apply_workqueue_attrs(wq, attrs);
3204 free_workqueue_attrs(attrs);
3205 return ret ?: count;
3208 static ssize_t wq_cpumask_show(struct device *dev,
3209 struct device_attribute *attr, char *buf)
3211 struct workqueue_struct *wq = dev_to_wq(dev);
3214 mutex_lock(&wq->mutex);
3215 written = cpumask_scnprintf(buf, PAGE_SIZE, wq->unbound_attrs->cpumask);
3216 mutex_unlock(&wq->mutex);
3218 written += scnprintf(buf + written, PAGE_SIZE - written, "\n");
3222 static ssize_t wq_cpumask_store(struct device *dev,
3223 struct device_attribute *attr,
3224 const char *buf, size_t count)
3226 struct workqueue_struct *wq = dev_to_wq(dev);
3227 struct workqueue_attrs *attrs;
3230 attrs = wq_sysfs_prep_attrs(wq);
3234 ret = cpumask_parse(buf, attrs->cpumask);
3236 ret = apply_workqueue_attrs(wq, attrs);
3238 free_workqueue_attrs(attrs);
3239 return ret ?: count;
3242 static ssize_t wq_numa_show(struct device *dev, struct device_attribute *attr,
3245 struct workqueue_struct *wq = dev_to_wq(dev);
3248 mutex_lock(&wq->mutex);
3249 written = scnprintf(buf, PAGE_SIZE, "%d\n",
3250 !wq->unbound_attrs->no_numa);
3251 mutex_unlock(&wq->mutex);
3256 static ssize_t wq_numa_store(struct device *dev, struct device_attribute *attr,
3257 const char *buf, size_t count)
3259 struct workqueue_struct *wq = dev_to_wq(dev);
3260 struct workqueue_attrs *attrs;
3263 attrs = wq_sysfs_prep_attrs(wq);
3268 if (sscanf(buf, "%d", &v) == 1) {
3269 attrs->no_numa = !v;
3270 ret = apply_workqueue_attrs(wq, attrs);
3273 free_workqueue_attrs(attrs);
3274 return ret ?: count;
3277 static struct device_attribute wq_sysfs_unbound_attrs[] = {
3278 __ATTR(pool_ids, 0444, wq_pool_ids_show, NULL),
3279 __ATTR(nice, 0644, wq_nice_show, wq_nice_store),
3280 __ATTR(cpumask, 0644, wq_cpumask_show, wq_cpumask_store),
3281 __ATTR(numa, 0644, wq_numa_show, wq_numa_store),
3285 static struct bus_type wq_subsys = {
3286 .name = "workqueue",
3287 .dev_attrs = wq_sysfs_attrs,
3290 static int __init wq_sysfs_init(void)
3292 return subsys_virtual_register(&wq_subsys, NULL);
3294 core_initcall(wq_sysfs_init);
3296 static void wq_device_release(struct device *dev)
3298 struct wq_device *wq_dev = container_of(dev, struct wq_device, dev);
3304 * workqueue_sysfs_register - make a workqueue visible in sysfs
3305 * @wq: the workqueue to register
3307 * Expose @wq in sysfs under /sys/bus/workqueue/devices.
3308 * alloc_workqueue*() automatically calls this function if WQ_SYSFS is set
3309 * which is the preferred method.
3311 * Workqueue user should use this function directly iff it wants to apply
3312 * workqueue_attrs before making the workqueue visible in sysfs; otherwise,
3313 * apply_workqueue_attrs() may race against userland updating the
3316 * Returns 0 on success, -errno on failure.
3318 int workqueue_sysfs_register(struct workqueue_struct *wq)
3320 struct wq_device *wq_dev;
3324 * Adjusting max_active or creating new pwqs by applyting
3325 * attributes breaks ordering guarantee. Disallow exposing ordered
3328 if (WARN_ON(wq->flags & __WQ_ORDERED))
3331 wq->wq_dev = wq_dev = kzalloc(sizeof(*wq_dev), GFP_KERNEL);
3336 wq_dev->dev.bus = &wq_subsys;
3337 wq_dev->dev.init_name = wq->name;
3338 wq_dev->dev.release = wq_device_release;
3341 * unbound_attrs are created separately. Suppress uevent until
3342 * everything is ready.
3344 dev_set_uevent_suppress(&wq_dev->dev, true);
3346 ret = device_register(&wq_dev->dev);
3353 if (wq->flags & WQ_UNBOUND) {
3354 struct device_attribute *attr;
3356 for (attr = wq_sysfs_unbound_attrs; attr->attr.name; attr++) {
3357 ret = device_create_file(&wq_dev->dev, attr);
3359 device_unregister(&wq_dev->dev);
3366 kobject_uevent(&wq_dev->dev.kobj, KOBJ_ADD);
3371 * workqueue_sysfs_unregister - undo workqueue_sysfs_register()
3372 * @wq: the workqueue to unregister
3374 * If @wq is registered to sysfs by workqueue_sysfs_register(), unregister.
3376 static void workqueue_sysfs_unregister(struct workqueue_struct *wq)
3378 struct wq_device *wq_dev = wq->wq_dev;
3384 device_unregister(&wq_dev->dev);
3386 #else /* CONFIG_SYSFS */
3387 static void workqueue_sysfs_unregister(struct workqueue_struct *wq) { }
3388 #endif /* CONFIG_SYSFS */
3391 * free_workqueue_attrs - free a workqueue_attrs
3392 * @attrs: workqueue_attrs to free
3394 * Undo alloc_workqueue_attrs().
3396 void free_workqueue_attrs(struct workqueue_attrs *attrs)
3399 free_cpumask_var(attrs->cpumask);
3405 * alloc_workqueue_attrs - allocate a workqueue_attrs
3406 * @gfp_mask: allocation mask to use
3408 * Allocate a new workqueue_attrs, initialize with default settings and
3409 * return it. Returns NULL on failure.
3411 struct workqueue_attrs *alloc_workqueue_attrs(gfp_t gfp_mask)
3413 struct workqueue_attrs *attrs;
3415 attrs = kzalloc(sizeof(*attrs), gfp_mask);
3418 if (!alloc_cpumask_var(&attrs->cpumask, gfp_mask))
3421 cpumask_copy(attrs->cpumask, cpu_possible_mask);
3424 free_workqueue_attrs(attrs);
3428 static void copy_workqueue_attrs(struct workqueue_attrs *to,
3429 const struct workqueue_attrs *from)
3431 to->nice = from->nice;
3432 cpumask_copy(to->cpumask, from->cpumask);
3434 * Unlike hash and equality test, this function doesn't ignore
3435 * ->no_numa as it is used for both pool and wq attrs. Instead,
3436 * get_unbound_pool() explicitly clears ->no_numa after copying.
3438 to->no_numa = from->no_numa;
3441 /* hash value of the content of @attr */
3442 static u32 wqattrs_hash(const struct workqueue_attrs *attrs)
3446 hash = jhash_1word(attrs->nice, hash);
3447 hash = jhash(cpumask_bits(attrs->cpumask),
3448 BITS_TO_LONGS(nr_cpumask_bits) * sizeof(long), hash);
3452 /* content equality test */
3453 static bool wqattrs_equal(const struct workqueue_attrs *a,
3454 const struct workqueue_attrs *b)
3456 if (a->nice != b->nice)
3458 if (!cpumask_equal(a->cpumask, b->cpumask))
3464 * init_worker_pool - initialize a newly zalloc'd worker_pool
3465 * @pool: worker_pool to initialize
3467 * Initiailize a newly zalloc'd @pool. It also allocates @pool->attrs.
3468 * Returns 0 on success, -errno on failure. Even on failure, all fields
3469 * inside @pool proper are initialized and put_unbound_pool() can be called
3470 * on @pool safely to release it.
3472 static int init_worker_pool(struct worker_pool *pool)
3474 spin_lock_init(&pool->lock);
3477 pool->node = NUMA_NO_NODE;
3478 pool->flags |= POOL_DISASSOCIATED;
3479 INIT_LIST_HEAD(&pool->worklist);
3480 INIT_LIST_HEAD(&pool->idle_list);
3481 hash_init(pool->busy_hash);
3483 init_timer_deferrable(&pool->idle_timer);
3484 pool->idle_timer.function = idle_worker_timeout;
3485 pool->idle_timer.data = (unsigned long)pool;
3487 setup_timer(&pool->mayday_timer, pool_mayday_timeout,
3488 (unsigned long)pool);
3490 mutex_init(&pool->manager_arb);
3491 mutex_init(&pool->manager_mutex);
3492 idr_init(&pool->worker_idr);
3494 INIT_HLIST_NODE(&pool->hash_node);
3497 /* shouldn't fail above this point */
3498 pool->attrs = alloc_workqueue_attrs(GFP_KERNEL);
3504 static void rcu_free_pool(struct rcu_head *rcu)
3506 struct worker_pool *pool = container_of(rcu, struct worker_pool, rcu);
3508 idr_destroy(&pool->worker_idr);
3509 free_workqueue_attrs(pool->attrs);
3514 * put_unbound_pool - put a worker_pool
3515 * @pool: worker_pool to put
3517 * Put @pool. If its refcnt reaches zero, it gets destroyed in sched-RCU
3518 * safe manner. get_unbound_pool() calls this function on its failure path
3519 * and this function should be able to release pools which went through,
3520 * successfully or not, init_worker_pool().
3522 * Should be called with wq_pool_mutex held.
3524 static void put_unbound_pool(struct worker_pool *pool)
3526 struct worker *worker;
3528 lockdep_assert_held(&wq_pool_mutex);
3534 if (WARN_ON(!(pool->flags & POOL_DISASSOCIATED)) ||
3535 WARN_ON(!list_empty(&pool->worklist)))
3538 /* release id and unhash */
3540 idr_remove(&worker_pool_idr, pool->id);
3541 hash_del(&pool->hash_node);
3544 * Become the manager and destroy all workers. Grabbing
3545 * manager_arb prevents @pool's workers from blocking on
3548 mutex_lock(&pool->manager_arb);
3549 mutex_lock(&pool->manager_mutex);
3550 spin_lock_irq(&pool->lock);
3552 while ((worker = first_worker(pool)))
3553 destroy_worker(worker);
3554 WARN_ON(pool->nr_workers || pool->nr_idle);
3556 spin_unlock_irq(&pool->lock);
3557 mutex_unlock(&pool->manager_mutex);
3558 mutex_unlock(&pool->manager_arb);
3560 /* shut down the timers */
3561 del_timer_sync(&pool->idle_timer);
3562 del_timer_sync(&pool->mayday_timer);
3564 /* sched-RCU protected to allow dereferences from get_work_pool() */
3565 call_rcu_sched(&pool->rcu, rcu_free_pool);
3569 * get_unbound_pool - get a worker_pool with the specified attributes
3570 * @attrs: the attributes of the worker_pool to get
3572 * Obtain a worker_pool which has the same attributes as @attrs, bump the
3573 * reference count and return it. If there already is a matching
3574 * worker_pool, it will be used; otherwise, this function attempts to
3575 * create a new one. On failure, returns NULL.
3577 * Should be called with wq_pool_mutex held.
3579 static struct worker_pool *get_unbound_pool(const struct workqueue_attrs *attrs)
3581 u32 hash = wqattrs_hash(attrs);
3582 struct worker_pool *pool;
3585 lockdep_assert_held(&wq_pool_mutex);
3587 /* do we already have a matching pool? */
3588 hash_for_each_possible(unbound_pool_hash, pool, hash_node, hash) {
3589 if (wqattrs_equal(pool->attrs, attrs)) {
3595 /* nope, create a new one */
3596 pool = kzalloc(sizeof(*pool), GFP_KERNEL);
3597 if (!pool || init_worker_pool(pool) < 0)
3600 if (workqueue_freezing)
3601 pool->flags |= POOL_FREEZING;
3603 lockdep_set_subclass(&pool->lock, 1); /* see put_pwq() */
3604 copy_workqueue_attrs(pool->attrs, attrs);
3607 * no_numa isn't a worker_pool attribute, always clear it. See
3608 * 'struct workqueue_attrs' comments for detail.
3610 pool->attrs->no_numa = false;
3612 /* if cpumask is contained inside a NUMA node, we belong to that node */
3613 if (wq_numa_enabled) {
3614 for_each_node(node) {
3615 if (cpumask_subset(pool->attrs->cpumask,
3616 wq_numa_possible_cpumask[node])) {
3623 if (worker_pool_assign_id(pool) < 0)
3626 /* create and start the initial worker */
3627 if (create_and_start_worker(pool) < 0)
3631 hash_add(unbound_pool_hash, &pool->hash_node, hash);
3636 put_unbound_pool(pool);
3640 static void rcu_free_pwq(struct rcu_head *rcu)
3642 kmem_cache_free(pwq_cache,
3643 container_of(rcu, struct pool_workqueue, rcu));
3647 * Scheduled on system_wq by put_pwq() when an unbound pwq hits zero refcnt
3648 * and needs to be destroyed.
3650 static void pwq_unbound_release_workfn(struct work_struct *work)
3652 struct pool_workqueue *pwq = container_of(work, struct pool_workqueue,
3653 unbound_release_work);
3654 struct workqueue_struct *wq = pwq->wq;
3655 struct worker_pool *pool = pwq->pool;
3658 if (WARN_ON_ONCE(!(wq->flags & WQ_UNBOUND)))
3662 * Unlink @pwq. Synchronization against wq->mutex isn't strictly
3663 * necessary on release but do it anyway. It's easier to verify
3664 * and consistent with the linking path.
3666 mutex_lock(&wq->mutex);
3667 list_del_rcu(&pwq->pwqs_node);
3668 is_last = list_empty(&wq->pwqs);
3669 mutex_unlock(&wq->mutex);
3671 mutex_lock(&wq_pool_mutex);
3672 put_unbound_pool(pool);
3673 mutex_unlock(&wq_pool_mutex);
3675 call_rcu_sched(&pwq->rcu, rcu_free_pwq);
3678 * If we're the last pwq going away, @wq is already dead and no one
3679 * is gonna access it anymore. Free it.
3682 free_workqueue_attrs(wq->unbound_attrs);
3688 * pwq_adjust_max_active - update a pwq's max_active to the current setting
3689 * @pwq: target pool_workqueue
3691 * If @pwq isn't freezing, set @pwq->max_active to the associated
3692 * workqueue's saved_max_active and activate delayed work items
3693 * accordingly. If @pwq is freezing, clear @pwq->max_active to zero.
3695 static void pwq_adjust_max_active(struct pool_workqueue *pwq)
3697 struct workqueue_struct *wq = pwq->wq;
3698 bool freezable = wq->flags & WQ_FREEZABLE;
3700 /* for @wq->saved_max_active */
3701 lockdep_assert_held(&wq->mutex);
3703 /* fast exit for non-freezable wqs */
3704 if (!freezable && pwq->max_active == wq->saved_max_active)
3707 spin_lock_irq(&pwq->pool->lock);
3709 if (!freezable || !(pwq->pool->flags & POOL_FREEZING)) {
3710 pwq->max_active = wq->saved_max_active;
3712 while (!list_empty(&pwq->delayed_works) &&
3713 pwq->nr_active < pwq->max_active)
3714 pwq_activate_first_delayed(pwq);
3717 * Need to kick a worker after thawed or an unbound wq's
3718 * max_active is bumped. It's a slow path. Do it always.
3720 wake_up_worker(pwq->pool);
3722 pwq->max_active = 0;
3725 spin_unlock_irq(&pwq->pool->lock);
3728 /* initialize newly alloced @pwq which is associated with @wq and @pool */
3729 static void init_pwq(struct pool_workqueue *pwq, struct workqueue_struct *wq,
3730 struct worker_pool *pool)
3732 BUG_ON((unsigned long)pwq & WORK_STRUCT_FLAG_MASK);
3734 memset(pwq, 0, sizeof(*pwq));
3738 pwq->flush_color = -1;
3740 INIT_LIST_HEAD(&pwq->delayed_works);
3741 INIT_LIST_HEAD(&pwq->pwqs_node);
3742 INIT_LIST_HEAD(&pwq->mayday_node);
3743 INIT_WORK(&pwq->unbound_release_work, pwq_unbound_release_workfn);
3746 /* sync @pwq with the current state of its associated wq and link it */
3747 static void link_pwq(struct pool_workqueue *pwq)
3749 struct workqueue_struct *wq = pwq->wq;
3751 lockdep_assert_held(&wq->mutex);
3753 /* may be called multiple times, ignore if already linked */
3754 if (!list_empty(&pwq->pwqs_node))
3758 * Set the matching work_color. This is synchronized with
3759 * wq->mutex to avoid confusing flush_workqueue().
3761 pwq->work_color = wq->work_color;
3763 /* sync max_active to the current setting */
3764 pwq_adjust_max_active(pwq);
3767 list_add_rcu(&pwq->pwqs_node, &wq->pwqs);
3770 /* obtain a pool matching @attr and create a pwq associating the pool and @wq */
3771 static struct pool_workqueue *alloc_unbound_pwq(struct workqueue_struct *wq,
3772 const struct workqueue_attrs *attrs)
3774 struct worker_pool *pool;
3775 struct pool_workqueue *pwq;
3777 lockdep_assert_held(&wq_pool_mutex);
3779 pool = get_unbound_pool(attrs);
3783 pwq = kmem_cache_alloc_node(pwq_cache, GFP_KERNEL, pool->node);
3785 put_unbound_pool(pool);
3789 init_pwq(pwq, wq, pool);
3793 /* undo alloc_unbound_pwq(), used only in the error path */
3794 static void free_unbound_pwq(struct pool_workqueue *pwq)
3796 lockdep_assert_held(&wq_pool_mutex);
3799 put_unbound_pool(pwq->pool);
3800 kmem_cache_free(pwq_cache, pwq);
3805 * wq_calc_node_mask - calculate a wq_attrs' cpumask for the specified node
3806 * @attrs: the wq_attrs of interest
3807 * @node: the target NUMA node
3808 * @cpu_going_down: if >= 0, the CPU to consider as offline
3809 * @cpumask: outarg, the resulting cpumask
3811 * Calculate the cpumask a workqueue with @attrs should use on @node. If
3812 * @cpu_going_down is >= 0, that cpu is considered offline during
3813 * calculation. The result is stored in @cpumask. This function returns
3814 * %true if the resulting @cpumask is different from @attrs->cpumask,
3817 * If NUMA affinity is not enabled, @attrs->cpumask is always used. If
3818 * enabled and @node has online CPUs requested by @attrs, the returned
3819 * cpumask is the intersection of the possible CPUs of @node and
3822 * The caller is responsible for ensuring that the cpumask of @node stays
3825 static bool wq_calc_node_cpumask(const struct workqueue_attrs *attrs, int node,
3826 int cpu_going_down, cpumask_t *cpumask)
3828 if (!wq_numa_enabled || attrs->no_numa)
3831 /* does @node have any online CPUs @attrs wants? */
3832 cpumask_and(cpumask, cpumask_of_node(node), attrs->cpumask);
3833 if (cpu_going_down >= 0)
3834 cpumask_clear_cpu(cpu_going_down, cpumask);
3836 if (cpumask_empty(cpumask))
3839 /* yeap, return possible CPUs in @node that @attrs wants */
3840 cpumask_and(cpumask, attrs->cpumask, wq_numa_possible_cpumask[node]);
3841 return !cpumask_equal(cpumask, attrs->cpumask);
3844 cpumask_copy(cpumask, attrs->cpumask);
3848 /* install @pwq into @wq's numa_pwq_tbl[] for @node and return the old pwq */
3849 static struct pool_workqueue *numa_pwq_tbl_install(struct workqueue_struct *wq,
3851 struct pool_workqueue *pwq)
3853 struct pool_workqueue *old_pwq;
3855 lockdep_assert_held(&wq->mutex);
3857 /* link_pwq() can handle duplicate calls */
3860 old_pwq = rcu_access_pointer(wq->numa_pwq_tbl[node]);
3861 rcu_assign_pointer(wq->numa_pwq_tbl[node], pwq);
3866 * apply_workqueue_attrs - apply new workqueue_attrs to an unbound workqueue
3867 * @wq: the target workqueue
3868 * @attrs: the workqueue_attrs to apply, allocated with alloc_workqueue_attrs()
3870 * Apply @attrs to an unbound workqueue @wq. Unless disabled, on NUMA
3871 * machines, this function maps a separate pwq to each NUMA node with
3872 * possibles CPUs in @attrs->cpumask so that work items are affine to the
3873 * NUMA node it was issued on. Older pwqs are released as in-flight work
3874 * items finish. Note that a work item which repeatedly requeues itself
3875 * back-to-back will stay on its current pwq.
3877 * Performs GFP_KERNEL allocations. Returns 0 on success and -errno on
3880 int apply_workqueue_attrs(struct workqueue_struct *wq,
3881 const struct workqueue_attrs *attrs)
3883 struct workqueue_attrs *new_attrs, *tmp_attrs;
3884 struct pool_workqueue **pwq_tbl, *dfl_pwq;
3887 /* only unbound workqueues can change attributes */
3888 if (WARN_ON(!(wq->flags & WQ_UNBOUND)))
3891 /* creating multiple pwqs breaks ordering guarantee */
3892 if (WARN_ON((wq->flags & __WQ_ORDERED) && !list_empty(&wq->pwqs)))
3895 pwq_tbl = kzalloc(wq_numa_tbl_len * sizeof(pwq_tbl[0]), GFP_KERNEL);
3896 new_attrs = alloc_workqueue_attrs(GFP_KERNEL);
3897 tmp_attrs = alloc_workqueue_attrs(GFP_KERNEL);
3898 if (!pwq_tbl || !new_attrs || !tmp_attrs)
3901 /* make a copy of @attrs and sanitize it */
3902 copy_workqueue_attrs(new_attrs, attrs);
3903 cpumask_and(new_attrs->cpumask, new_attrs->cpumask, cpu_possible_mask);
3906 * We may create multiple pwqs with differing cpumasks. Make a
3907 * copy of @new_attrs which will be modified and used to obtain
3910 copy_workqueue_attrs(tmp_attrs, new_attrs);
3913 * CPUs should stay stable across pwq creations and installations.
3914 * Pin CPUs, determine the target cpumask for each node and create
3919 mutex_lock(&wq_pool_mutex);
3922 * If something goes wrong during CPU up/down, we'll fall back to
3923 * the default pwq covering whole @attrs->cpumask. Always create
3924 * it even if we don't use it immediately.
3926 dfl_pwq = alloc_unbound_pwq(wq, new_attrs);
3930 for_each_node(node) {
3931 if (wq_calc_node_cpumask(attrs, node, -1, tmp_attrs->cpumask)) {
3932 pwq_tbl[node] = alloc_unbound_pwq(wq, tmp_attrs);
3937 pwq_tbl[node] = dfl_pwq;
3941 mutex_unlock(&wq_pool_mutex);
3943 /* all pwqs have been created successfully, let's install'em */
3944 mutex_lock(&wq->mutex);
3946 copy_workqueue_attrs(wq->unbound_attrs, new_attrs);
3948 /* save the previous pwq and install the new one */
3950 pwq_tbl[node] = numa_pwq_tbl_install(wq, node, pwq_tbl[node]);
3952 /* @dfl_pwq might not have been used, ensure it's linked */
3954 swap(wq->dfl_pwq, dfl_pwq);
3956 mutex_unlock(&wq->mutex);
3958 /* put the old pwqs */
3960 put_pwq_unlocked(pwq_tbl[node]);
3961 put_pwq_unlocked(dfl_pwq);
3967 free_workqueue_attrs(tmp_attrs);
3968 free_workqueue_attrs(new_attrs);
3973 free_unbound_pwq(dfl_pwq);
3975 if (pwq_tbl && pwq_tbl[node] != dfl_pwq)
3976 free_unbound_pwq(pwq_tbl[node]);
3977 mutex_unlock(&wq_pool_mutex);
3985 * wq_update_unbound_numa - update NUMA affinity of a wq for CPU hot[un]plug
3986 * @wq: the target workqueue
3987 * @cpu: the CPU coming up or going down
3988 * @online: whether @cpu is coming up or going down
3990 * This function is to be called from %CPU_DOWN_PREPARE, %CPU_ONLINE and
3991 * %CPU_DOWN_FAILED. @cpu is being hot[un]plugged, update NUMA affinity of
3994 * If NUMA affinity can't be adjusted due to memory allocation failure, it
3995 * falls back to @wq->dfl_pwq which may not be optimal but is always
3998 * Note that when the last allowed CPU of a NUMA node goes offline for a
3999 * workqueue with a cpumask spanning multiple nodes, the workers which were
4000 * already executing the work items for the workqueue will lose their CPU
4001 * affinity and may execute on any CPU. This is similar to how per-cpu
4002 * workqueues behave on CPU_DOWN. If a workqueue user wants strict
4003 * affinity, it's the user's responsibility to flush the work item from
4006 static void wq_update_unbound_numa(struct workqueue_struct *wq, int cpu,
4009 int node = cpu_to_node(cpu);
4010 int cpu_off = online ? -1 : cpu;
4011 struct pool_workqueue *old_pwq = NULL, *pwq;
4012 struct workqueue_attrs *target_attrs;
4015 lockdep_assert_held(&wq_pool_mutex);
4017 if (!wq_numa_enabled || !(wq->flags & WQ_UNBOUND))
4021 * We don't wanna alloc/free wq_attrs for each wq for each CPU.
4022 * Let's use a preallocated one. The following buf is protected by
4023 * CPU hotplug exclusion.
4025 target_attrs = wq_update_unbound_numa_attrs_buf;
4026 cpumask = target_attrs->cpumask;
4028 mutex_lock(&wq->mutex);
4029 if (wq->unbound_attrs->no_numa)
4032 copy_workqueue_attrs(target_attrs, wq->unbound_attrs);
4033 pwq = unbound_pwq_by_node(wq, node);
4036 * Let's determine what needs to be done. If the target cpumask is
4037 * different from wq's, we need to compare it to @pwq's and create
4038 * a new one if they don't match. If the target cpumask equals
4039 * wq's, the default pwq should be used. If @pwq is already the
4040 * default one, nothing to do; otherwise, install the default one.
4042 if (wq_calc_node_cpumask(wq->unbound_attrs, node, cpu_off, cpumask)) {
4043 if (cpumask_equal(cpumask, pwq->pool->attrs->cpumask))
4046 if (pwq == wq->dfl_pwq)
4052 mutex_unlock(&wq->mutex);
4054 /* create a new pwq */
4055 pwq = alloc_unbound_pwq(wq, target_attrs);
4057 pr_warning("workqueue: allocation failed while updating NUMA affinity of \"%s\"\n",
4063 * Install the new pwq. As this function is called only from CPU
4064 * hotplug callbacks and applying a new attrs is wrapped with
4065 * get/put_online_cpus(), @wq->unbound_attrs couldn't have changed
4068 mutex_lock(&wq->mutex);
4069 old_pwq = numa_pwq_tbl_install(wq, node, pwq);
4073 spin_lock_irq(&wq->dfl_pwq->pool->lock);
4074 get_pwq(wq->dfl_pwq);
4075 spin_unlock_irq(&wq->dfl_pwq->pool->lock);
4076 old_pwq = numa_pwq_tbl_install(wq, node, wq->dfl_pwq);
4078 mutex_unlock(&wq->mutex);
4079 put_pwq_unlocked(old_pwq);
4082 static int alloc_and_link_pwqs(struct workqueue_struct *wq)
4084 bool highpri = wq->flags & WQ_HIGHPRI;
4087 if (!(wq->flags & WQ_UNBOUND)) {
4088 wq->cpu_pwqs = alloc_percpu(struct pool_workqueue);
4092 for_each_possible_cpu(cpu) {
4093 struct pool_workqueue *pwq =
4094 per_cpu_ptr(wq->cpu_pwqs, cpu);
4095 struct worker_pool *cpu_pools =
4096 per_cpu(cpu_worker_pools, cpu);
4098 init_pwq(pwq, wq, &cpu_pools[highpri]);
4100 mutex_lock(&wq->mutex);
4102 mutex_unlock(&wq->mutex);
4105 } else if (wq->flags & __WQ_ORDERED) {
4106 ret = apply_workqueue_attrs(wq, ordered_wq_attrs[highpri]);
4107 /* there should only be single pwq for ordering guarantee */
4108 WARN(!ret && (wq->pwqs.next != &wq->dfl_pwq->pwqs_node ||
4109 wq->pwqs.prev != &wq->dfl_pwq->pwqs_node),
4110 "ordering guarantee broken for workqueue %s\n", wq->name);
4113 return apply_workqueue_attrs(wq, unbound_std_wq_attrs[highpri]);
4117 static int wq_clamp_max_active(int max_active, unsigned int flags,
4120 int lim = flags & WQ_UNBOUND ? WQ_UNBOUND_MAX_ACTIVE : WQ_MAX_ACTIVE;
4122 if (max_active < 1 || max_active > lim)
4123 pr_warn("workqueue: max_active %d requested for %s is out of range, clamping between %d and %d\n",
4124 max_active, name, 1, lim);
4126 return clamp_val(max_active, 1, lim);
4129 struct workqueue_struct *__alloc_workqueue_key(const char *fmt,
4132 struct lock_class_key *key,
4133 const char *lock_name, ...)
4135 size_t tbl_size = 0;
4137 struct workqueue_struct *wq;
4138 struct pool_workqueue *pwq;
4140 /* see the comment above the definition of WQ_POWER_EFFICIENT */
4141 if ((flags & WQ_POWER_EFFICIENT) && wq_power_efficient)
4142 flags |= WQ_UNBOUND;
4144 /* allocate wq and format name */
4145 if (flags & WQ_UNBOUND)
4146 tbl_size = wq_numa_tbl_len * sizeof(wq->numa_pwq_tbl[0]);
4148 wq = kzalloc(sizeof(*wq) + tbl_size, GFP_KERNEL);
4152 if (flags & WQ_UNBOUND) {
4153 wq->unbound_attrs = alloc_workqueue_attrs(GFP_KERNEL);
4154 if (!wq->unbound_attrs)
4158 va_start(args, lock_name);
4159 vsnprintf(wq->name, sizeof(wq->name), fmt, args);
4162 max_active = max_active ?: WQ_DFL_ACTIVE;
4163 max_active = wq_clamp_max_active(max_active, flags, wq->name);
4167 wq->saved_max_active = max_active;
4168 mutex_init(&wq->mutex);
4169 atomic_set(&wq->nr_pwqs_to_flush, 0);
4170 INIT_LIST_HEAD(&wq->pwqs);
4171 INIT_LIST_HEAD(&wq->flusher_queue);
4172 INIT_LIST_HEAD(&wq->flusher_overflow);
4173 INIT_LIST_HEAD(&wq->maydays);
4175 lockdep_init_map(&wq->lockdep_map, lock_name, key, 0);
4176 INIT_LIST_HEAD(&wq->list);
4178 if (alloc_and_link_pwqs(wq) < 0)
4182 * Workqueues which may be used during memory reclaim should
4183 * have a rescuer to guarantee forward progress.
4185 if (flags & WQ_MEM_RECLAIM) {
4186 struct worker *rescuer;
4188 rescuer = alloc_worker();
4192 rescuer->rescue_wq = wq;
4193 rescuer->task = kthread_create(rescuer_thread, rescuer, "%s",
4195 if (IS_ERR(rescuer->task)) {
4200 wq->rescuer = rescuer;
4201 rescuer->task->flags |= PF_NO_SETAFFINITY;
4202 wake_up_process(rescuer->task);
4205 if ((wq->flags & WQ_SYSFS) && workqueue_sysfs_register(wq))
4209 * wq_pool_mutex protects global freeze state and workqueues list.
4210 * Grab it, adjust max_active and add the new @wq to workqueues
4213 mutex_lock(&wq_pool_mutex);
4215 mutex_lock(&wq->mutex);
4216 for_each_pwq(pwq, wq)
4217 pwq_adjust_max_active(pwq);
4218 mutex_unlock(&wq->mutex);
4220 list_add(&wq->list, &workqueues);
4222 mutex_unlock(&wq_pool_mutex);
4227 free_workqueue_attrs(wq->unbound_attrs);
4231 destroy_workqueue(wq);
4234 EXPORT_SYMBOL_GPL(__alloc_workqueue_key);
4237 * destroy_workqueue - safely terminate a workqueue
4238 * @wq: target workqueue
4240 * Safely destroy a workqueue. All work currently pending will be done first.
4242 void destroy_workqueue(struct workqueue_struct *wq)
4244 struct pool_workqueue *pwq;
4247 /* drain it before proceeding with destruction */
4248 drain_workqueue(wq);
4251 mutex_lock(&wq->mutex);
4252 for_each_pwq(pwq, wq) {
4255 for (i = 0; i < WORK_NR_COLORS; i++) {
4256 if (WARN_ON(pwq->nr_in_flight[i])) {
4257 mutex_unlock(&wq->mutex);
4262 if (WARN_ON((pwq != wq->dfl_pwq) && (pwq->refcnt > 1)) ||
4263 WARN_ON(pwq->nr_active) ||
4264 WARN_ON(!list_empty(&pwq->delayed_works))) {
4265 mutex_unlock(&wq->mutex);
4269 mutex_unlock(&wq->mutex);
4272 * wq list is used to freeze wq, remove from list after
4273 * flushing is complete in case freeze races us.
4275 mutex_lock(&wq_pool_mutex);
4276 list_del_init(&wq->list);
4277 mutex_unlock(&wq_pool_mutex);
4279 workqueue_sysfs_unregister(wq);
4282 kthread_stop(wq->rescuer->task);
4287 if (!(wq->flags & WQ_UNBOUND)) {
4289 * The base ref is never dropped on per-cpu pwqs. Directly
4290 * free the pwqs and wq.
4292 free_percpu(wq->cpu_pwqs);
4296 * We're the sole accessor of @wq at this point. Directly
4297 * access numa_pwq_tbl[] and dfl_pwq to put the base refs.
4298 * @wq will be freed when the last pwq is released.
4300 for_each_node(node) {
4301 pwq = rcu_access_pointer(wq->numa_pwq_tbl[node]);
4302 RCU_INIT_POINTER(wq->numa_pwq_tbl[node], NULL);
4303 put_pwq_unlocked(pwq);
4307 * Put dfl_pwq. @wq may be freed any time after dfl_pwq is
4308 * put. Don't access it afterwards.
4312 put_pwq_unlocked(pwq);
4315 EXPORT_SYMBOL_GPL(destroy_workqueue);
4318 * workqueue_set_max_active - adjust max_active of a workqueue
4319 * @wq: target workqueue
4320 * @max_active: new max_active value.
4322 * Set max_active of @wq to @max_active.
4325 * Don't call from IRQ context.
4327 void workqueue_set_max_active(struct workqueue_struct *wq, int max_active)
4329 struct pool_workqueue *pwq;
4331 /* disallow meddling with max_active for ordered workqueues */
4332 if (WARN_ON(wq->flags & __WQ_ORDERED))
4335 max_active = wq_clamp_max_active(max_active, wq->flags, wq->name);
4337 mutex_lock(&wq->mutex);
4339 wq->saved_max_active = max_active;
4341 for_each_pwq(pwq, wq)
4342 pwq_adjust_max_active(pwq);
4344 mutex_unlock(&wq->mutex);
4346 EXPORT_SYMBOL_GPL(workqueue_set_max_active);
4349 * current_is_workqueue_rescuer - is %current workqueue rescuer?
4351 * Determine whether %current is a workqueue rescuer. Can be used from
4352 * work functions to determine whether it's being run off the rescuer task.
4354 bool current_is_workqueue_rescuer(void)
4356 struct worker *worker = current_wq_worker();
4358 return worker && worker->rescue_wq;
4362 * workqueue_congested - test whether a workqueue is congested
4363 * @cpu: CPU in question
4364 * @wq: target workqueue
4366 * Test whether @wq's cpu workqueue for @cpu is congested. There is
4367 * no synchronization around this function and the test result is
4368 * unreliable and only useful as advisory hints or for debugging.
4370 * If @cpu is WORK_CPU_UNBOUND, the test is performed on the local CPU.
4371 * Note that both per-cpu and unbound workqueues may be associated with
4372 * multiple pool_workqueues which have separate congested states. A
4373 * workqueue being congested on one CPU doesn't mean the workqueue is also
4374 * contested on other CPUs / NUMA nodes.
4377 * %true if congested, %false otherwise.
4379 bool workqueue_congested(int cpu, struct workqueue_struct *wq)
4381 struct pool_workqueue *pwq;
4384 rcu_read_lock_sched();
4386 if (cpu == WORK_CPU_UNBOUND)
4387 cpu = smp_processor_id();
4389 if (!(wq->flags & WQ_UNBOUND))
4390 pwq = per_cpu_ptr(wq->cpu_pwqs, cpu);
4392 pwq = unbound_pwq_by_node(wq, cpu_to_node(cpu));
4394 ret = !list_empty(&pwq->delayed_works);
4395 rcu_read_unlock_sched();
4399 EXPORT_SYMBOL_GPL(workqueue_congested);
4402 * work_busy - test whether a work is currently pending or running
4403 * @work: the work to be tested
4405 * Test whether @work is currently pending or running. There is no
4406 * synchronization around this function and the test result is
4407 * unreliable and only useful as advisory hints or for debugging.
4410 * OR'd bitmask of WORK_BUSY_* bits.
4412 unsigned int work_busy(struct work_struct *work)
4414 struct worker_pool *pool;
4415 unsigned long flags;
4416 unsigned int ret = 0;
4418 if (work_pending(work))
4419 ret |= WORK_BUSY_PENDING;
4421 local_irq_save(flags);
4422 pool = get_work_pool(work);
4424 spin_lock(&pool->lock);
4425 if (find_worker_executing_work(pool, work))
4426 ret |= WORK_BUSY_RUNNING;
4427 spin_unlock(&pool->lock);
4429 local_irq_restore(flags);
4433 EXPORT_SYMBOL_GPL(work_busy);
4436 * set_worker_desc - set description for the current work item
4437 * @fmt: printf-style format string
4438 * @...: arguments for the format string
4440 * This function can be called by a running work function to describe what
4441 * the work item is about. If the worker task gets dumped, this
4442 * information will be printed out together to help debugging. The
4443 * description can be at most WORKER_DESC_LEN including the trailing '\0'.
4445 void set_worker_desc(const char *fmt, ...)
4447 struct worker *worker = current_wq_worker();
4451 va_start(args, fmt);
4452 vsnprintf(worker->desc, sizeof(worker->desc), fmt, args);
4454 worker->desc_valid = true;
4459 * print_worker_info - print out worker information and description
4460 * @log_lvl: the log level to use when printing
4461 * @task: target task
4463 * If @task is a worker and currently executing a work item, print out the
4464 * name of the workqueue being serviced and worker description set with
4465 * set_worker_desc() by the currently executing work item.
4467 * This function can be safely called on any task as long as the
4468 * task_struct itself is accessible. While safe, this function isn't
4469 * synchronized and may print out mixups or garbages of limited length.
4471 void print_worker_info(const char *log_lvl, struct task_struct *task)
4473 work_func_t *fn = NULL;
4474 char name[WQ_NAME_LEN] = { };
4475 char desc[WORKER_DESC_LEN] = { };
4476 struct pool_workqueue *pwq = NULL;
4477 struct workqueue_struct *wq = NULL;
4478 bool desc_valid = false;
4479 struct worker *worker;
4481 if (!(task->flags & PF_WQ_WORKER))
4485 * This function is called without any synchronization and @task
4486 * could be in any state. Be careful with dereferences.
4488 worker = probe_kthread_data(task);
4491 * Carefully copy the associated workqueue's workfn and name. Keep
4492 * the original last '\0' in case the original contains garbage.
4494 probe_kernel_read(&fn, &worker->current_func, sizeof(fn));
4495 probe_kernel_read(&pwq, &worker->current_pwq, sizeof(pwq));
4496 probe_kernel_read(&wq, &pwq->wq, sizeof(wq));
4497 probe_kernel_read(name, wq->name, sizeof(name) - 1);
4499 /* copy worker description */
4500 probe_kernel_read(&desc_valid, &worker->desc_valid, sizeof(desc_valid));
4502 probe_kernel_read(desc, worker->desc, sizeof(desc) - 1);
4504 if (fn || name[0] || desc[0]) {
4505 printk("%sWorkqueue: %s %pf", log_lvl, name, fn);
4507 pr_cont(" (%s)", desc);
4515 * There are two challenges in supporting CPU hotplug. Firstly, there
4516 * are a lot of assumptions on strong associations among work, pwq and
4517 * pool which make migrating pending and scheduled works very
4518 * difficult to implement without impacting hot paths. Secondly,
4519 * worker pools serve mix of short, long and very long running works making
4520 * blocked draining impractical.
4522 * This is solved by allowing the pools to be disassociated from the CPU
4523 * running as an unbound one and allowing it to be reattached later if the
4524 * cpu comes back online.
4527 static void wq_unbind_fn(struct work_struct *work)
4529 int cpu = smp_processor_id();
4530 struct worker_pool *pool;
4531 struct worker *worker;
4534 for_each_cpu_worker_pool(pool, cpu) {
4535 WARN_ON_ONCE(cpu != smp_processor_id());
4537 mutex_lock(&pool->manager_mutex);
4538 spin_lock_irq(&pool->lock);
4541 * We've blocked all manager operations. Make all workers
4542 * unbound and set DISASSOCIATED. Before this, all workers
4543 * except for the ones which are still executing works from
4544 * before the last CPU down must be on the cpu. After
4545 * this, they may become diasporas.
4547 for_each_pool_worker(worker, wi, pool)
4548 worker->flags |= WORKER_UNBOUND;
4550 pool->flags |= POOL_DISASSOCIATED;
4552 spin_unlock_irq(&pool->lock);
4553 mutex_unlock(&pool->manager_mutex);
4556 * Call schedule() so that we cross rq->lock and thus can
4557 * guarantee sched callbacks see the %WORKER_UNBOUND flag.
4558 * This is necessary as scheduler callbacks may be invoked
4564 * Sched callbacks are disabled now. Zap nr_running.
4565 * After this, nr_running stays zero and need_more_worker()
4566 * and keep_working() are always true as long as the
4567 * worklist is not empty. This pool now behaves as an
4568 * unbound (in terms of concurrency management) pool which
4569 * are served by workers tied to the pool.
4571 atomic_set(&pool->nr_running, 0);
4574 * With concurrency management just turned off, a busy
4575 * worker blocking could lead to lengthy stalls. Kick off
4576 * unbound chain execution of currently pending work items.
4578 spin_lock_irq(&pool->lock);
4579 wake_up_worker(pool);
4580 spin_unlock_irq(&pool->lock);
4585 * rebind_workers - rebind all workers of a pool to the associated CPU
4586 * @pool: pool of interest
4588 * @pool->cpu is coming online. Rebind all workers to the CPU.
4590 static void rebind_workers(struct worker_pool *pool)
4592 struct worker *worker;
4595 lockdep_assert_held(&pool->manager_mutex);
4598 * Restore CPU affinity of all workers. As all idle workers should
4599 * be on the run-queue of the associated CPU before any local
4600 * wake-ups for concurrency management happen, restore CPU affinty
4601 * of all workers first and then clear UNBOUND. As we're called
4602 * from CPU_ONLINE, the following shouldn't fail.
4604 for_each_pool_worker(worker, wi, pool)
4605 WARN_ON_ONCE(set_cpus_allowed_ptr(worker->task,
4606 pool->attrs->cpumask) < 0);
4608 spin_lock_irq(&pool->lock);
4610 for_each_pool_worker(worker, wi, pool) {
4611 unsigned int worker_flags = worker->flags;
4614 * A bound idle worker should actually be on the runqueue
4615 * of the associated CPU for local wake-ups targeting it to
4616 * work. Kick all idle workers so that they migrate to the
4617 * associated CPU. Doing this in the same loop as
4618 * replacing UNBOUND with REBOUND is safe as no worker will
4619 * be bound before @pool->lock is released.
4621 if (worker_flags & WORKER_IDLE)
4622 wake_up_process(worker->task);
4625 * We want to clear UNBOUND but can't directly call
4626 * worker_clr_flags() or adjust nr_running. Atomically
4627 * replace UNBOUND with another NOT_RUNNING flag REBOUND.
4628 * @worker will clear REBOUND using worker_clr_flags() when
4629 * it initiates the next execution cycle thus restoring
4630 * concurrency management. Note that when or whether
4631 * @worker clears REBOUND doesn't affect correctness.
4633 * ACCESS_ONCE() is necessary because @worker->flags may be
4634 * tested without holding any lock in
4635 * wq_worker_waking_up(). Without it, NOT_RUNNING test may
4636 * fail incorrectly leading to premature concurrency
4637 * management operations.
4639 WARN_ON_ONCE(!(worker_flags & WORKER_UNBOUND));
4640 worker_flags |= WORKER_REBOUND;
4641 worker_flags &= ~WORKER_UNBOUND;
4642 ACCESS_ONCE(worker->flags) = worker_flags;
4645 spin_unlock_irq(&pool->lock);
4649 * restore_unbound_workers_cpumask - restore cpumask of unbound workers
4650 * @pool: unbound pool of interest
4651 * @cpu: the CPU which is coming up
4653 * An unbound pool may end up with a cpumask which doesn't have any online
4654 * CPUs. When a worker of such pool get scheduled, the scheduler resets
4655 * its cpus_allowed. If @cpu is in @pool's cpumask which didn't have any
4656 * online CPU before, cpus_allowed of all its workers should be restored.
4658 static void restore_unbound_workers_cpumask(struct worker_pool *pool, int cpu)
4660 static cpumask_t cpumask;
4661 struct worker *worker;
4664 lockdep_assert_held(&pool->manager_mutex);
4666 /* is @cpu allowed for @pool? */
4667 if (!cpumask_test_cpu(cpu, pool->attrs->cpumask))
4670 /* is @cpu the only online CPU? */
4671 cpumask_and(&cpumask, pool->attrs->cpumask, cpu_online_mask);
4672 if (cpumask_weight(&cpumask) != 1)
4675 /* as we're called from CPU_ONLINE, the following shouldn't fail */
4676 for_each_pool_worker(worker, wi, pool)
4677 WARN_ON_ONCE(set_cpus_allowed_ptr(worker->task,
4678 pool->attrs->cpumask) < 0);
4682 * Workqueues should be brought up before normal priority CPU notifiers.
4683 * This will be registered high priority CPU notifier.
4685 static int __cpuinit workqueue_cpu_up_callback(struct notifier_block *nfb,
4686 unsigned long action,
4689 int cpu = (unsigned long)hcpu;
4690 struct worker_pool *pool;
4691 struct workqueue_struct *wq;
4694 switch (action & ~CPU_TASKS_FROZEN) {
4695 case CPU_UP_PREPARE:
4696 for_each_cpu_worker_pool(pool, cpu) {
4697 if (pool->nr_workers)
4699 if (create_and_start_worker(pool) < 0)
4704 case CPU_DOWN_FAILED:
4706 mutex_lock(&wq_pool_mutex);
4708 for_each_pool(pool, pi) {
4709 mutex_lock(&pool->manager_mutex);
4711 if (pool->cpu == cpu) {
4712 spin_lock_irq(&pool->lock);
4713 pool->flags &= ~POOL_DISASSOCIATED;
4714 spin_unlock_irq(&pool->lock);
4716 rebind_workers(pool);
4717 } else if (pool->cpu < 0) {
4718 restore_unbound_workers_cpumask(pool, cpu);
4721 mutex_unlock(&pool->manager_mutex);
4724 /* update NUMA affinity of unbound workqueues */
4725 list_for_each_entry(wq, &workqueues, list)
4726 wq_update_unbound_numa(wq, cpu, true);
4728 mutex_unlock(&wq_pool_mutex);
4735 * Workqueues should be brought down after normal priority CPU notifiers.
4736 * This will be registered as low priority CPU notifier.
4738 static int __cpuinit workqueue_cpu_down_callback(struct notifier_block *nfb,
4739 unsigned long action,
4742 int cpu = (unsigned long)hcpu;
4743 struct work_struct unbind_work;
4744 struct workqueue_struct *wq;
4746 switch (action & ~CPU_TASKS_FROZEN) {
4747 case CPU_DOWN_PREPARE:
4748 /* unbinding per-cpu workers should happen on the local CPU */
4749 INIT_WORK_ONSTACK(&unbind_work, wq_unbind_fn);
4750 queue_work_on(cpu, system_highpri_wq, &unbind_work);
4752 /* update NUMA affinity of unbound workqueues */
4753 mutex_lock(&wq_pool_mutex);
4754 list_for_each_entry(wq, &workqueues, list)
4755 wq_update_unbound_numa(wq, cpu, false);
4756 mutex_unlock(&wq_pool_mutex);
4758 /* wait for per-cpu unbinding to finish */
4759 flush_work(&unbind_work);
4767 struct work_for_cpu {
4768 struct work_struct work;
4774 static void work_for_cpu_fn(struct work_struct *work)
4776 struct work_for_cpu *wfc = container_of(work, struct work_for_cpu, work);
4778 wfc->ret = wfc->fn(wfc->arg);
4782 * work_on_cpu - run a function in user context on a particular cpu
4783 * @cpu: the cpu to run on
4784 * @fn: the function to run
4785 * @arg: the function arg
4787 * This will return the value @fn returns.
4788 * It is up to the caller to ensure that the cpu doesn't go offline.
4789 * The caller must not hold any locks which would prevent @fn from completing.
4791 long work_on_cpu(int cpu, long (*fn)(void *), void *arg)
4793 struct work_for_cpu wfc = { .fn = fn, .arg = arg };
4795 INIT_WORK_ONSTACK(&wfc.work, work_for_cpu_fn);
4796 schedule_work_on(cpu, &wfc.work);
4797 flush_work(&wfc.work);
4800 EXPORT_SYMBOL_GPL(work_on_cpu);
4801 #endif /* CONFIG_SMP */
4803 #ifdef CONFIG_FREEZER
4806 * freeze_workqueues_begin - begin freezing workqueues
4808 * Start freezing workqueues. After this function returns, all freezable
4809 * workqueues will queue new works to their delayed_works list instead of
4813 * Grabs and releases wq_pool_mutex, wq->mutex and pool->lock's.
4815 void freeze_workqueues_begin(void)
4817 struct worker_pool *pool;
4818 struct workqueue_struct *wq;
4819 struct pool_workqueue *pwq;
4822 mutex_lock(&wq_pool_mutex);
4824 WARN_ON_ONCE(workqueue_freezing);
4825 workqueue_freezing = true;
4828 for_each_pool(pool, pi) {
4829 spin_lock_irq(&pool->lock);
4830 WARN_ON_ONCE(pool->flags & POOL_FREEZING);
4831 pool->flags |= POOL_FREEZING;
4832 spin_unlock_irq(&pool->lock);
4835 list_for_each_entry(wq, &workqueues, list) {
4836 mutex_lock(&wq->mutex);
4837 for_each_pwq(pwq, wq)
4838 pwq_adjust_max_active(pwq);
4839 mutex_unlock(&wq->mutex);
4842 mutex_unlock(&wq_pool_mutex);
4846 * freeze_workqueues_busy - are freezable workqueues still busy?
4848 * Check whether freezing is complete. This function must be called
4849 * between freeze_workqueues_begin() and thaw_workqueues().
4852 * Grabs and releases wq_pool_mutex.
4855 * %true if some freezable workqueues are still busy. %false if freezing
4858 bool freeze_workqueues_busy(void)
4861 struct workqueue_struct *wq;
4862 struct pool_workqueue *pwq;
4864 mutex_lock(&wq_pool_mutex);
4866 WARN_ON_ONCE(!workqueue_freezing);
4868 list_for_each_entry(wq, &workqueues, list) {
4869 if (!(wq->flags & WQ_FREEZABLE))
4872 * nr_active is monotonically decreasing. It's safe
4873 * to peek without lock.
4875 rcu_read_lock_sched();
4876 for_each_pwq(pwq, wq) {
4877 WARN_ON_ONCE(pwq->nr_active < 0);
4878 if (pwq->nr_active) {
4880 rcu_read_unlock_sched();
4884 rcu_read_unlock_sched();
4887 mutex_unlock(&wq_pool_mutex);
4892 * thaw_workqueues - thaw workqueues
4894 * Thaw workqueues. Normal queueing is restored and all collected
4895 * frozen works are transferred to their respective pool worklists.
4898 * Grabs and releases wq_pool_mutex, wq->mutex and pool->lock's.
4900 void thaw_workqueues(void)
4902 struct workqueue_struct *wq;
4903 struct pool_workqueue *pwq;
4904 struct worker_pool *pool;
4907 mutex_lock(&wq_pool_mutex);
4909 if (!workqueue_freezing)
4912 /* clear FREEZING */
4913 for_each_pool(pool, pi) {
4914 spin_lock_irq(&pool->lock);
4915 WARN_ON_ONCE(!(pool->flags & POOL_FREEZING));
4916 pool->flags &= ~POOL_FREEZING;
4917 spin_unlock_irq(&pool->lock);
4920 /* restore max_active and repopulate worklist */
4921 list_for_each_entry(wq, &workqueues, list) {
4922 mutex_lock(&wq->mutex);
4923 for_each_pwq(pwq, wq)
4924 pwq_adjust_max_active(pwq);
4925 mutex_unlock(&wq->mutex);
4928 workqueue_freezing = false;
4930 mutex_unlock(&wq_pool_mutex);
4932 #endif /* CONFIG_FREEZER */
4934 static void __init wq_numa_init(void)
4939 /* determine NUMA pwq table len - highest node id + 1 */
4941 wq_numa_tbl_len = max(wq_numa_tbl_len, node + 1);
4943 if (num_possible_nodes() <= 1)
4946 if (wq_disable_numa) {
4947 pr_info("workqueue: NUMA affinity support disabled\n");
4951 wq_update_unbound_numa_attrs_buf = alloc_workqueue_attrs(GFP_KERNEL);
4952 BUG_ON(!wq_update_unbound_numa_attrs_buf);
4955 * We want masks of possible CPUs of each node which isn't readily
4956 * available. Build one from cpu_to_node() which should have been
4957 * fully initialized by now.
4959 tbl = kzalloc(wq_numa_tbl_len * sizeof(tbl[0]), GFP_KERNEL);
4963 BUG_ON(!alloc_cpumask_var_node(&tbl[node], GFP_KERNEL,
4964 node_online(node) ? node : NUMA_NO_NODE));
4966 for_each_possible_cpu(cpu) {
4967 node = cpu_to_node(cpu);
4968 if (WARN_ON(node == NUMA_NO_NODE)) {
4969 pr_warn("workqueue: NUMA node mapping not available for cpu%d, disabling NUMA support\n", cpu);
4970 /* happens iff arch is bonkers, let's just proceed */
4973 cpumask_set_cpu(cpu, tbl[node]);
4976 wq_numa_possible_cpumask = tbl;
4977 wq_numa_enabled = true;
4980 static int __init init_workqueues(void)
4982 int std_nice[NR_STD_WORKER_POOLS] = { 0, HIGHPRI_NICE_LEVEL };
4985 /* make sure we have enough bits for OFFQ pool ID */
4986 BUILD_BUG_ON((1LU << (BITS_PER_LONG - WORK_OFFQ_POOL_SHIFT)) <
4987 WORK_CPU_END * NR_STD_WORKER_POOLS);
4989 WARN_ON(__alignof__(struct pool_workqueue) < __alignof__(long long));
4991 pwq_cache = KMEM_CACHE(pool_workqueue, SLAB_PANIC);
4993 cpu_notifier(workqueue_cpu_up_callback, CPU_PRI_WORKQUEUE_UP);
4994 hotcpu_notifier(workqueue_cpu_down_callback, CPU_PRI_WORKQUEUE_DOWN);
4998 /* initialize CPU pools */
4999 for_each_possible_cpu(cpu) {
5000 struct worker_pool *pool;
5003 for_each_cpu_worker_pool(pool, cpu) {
5004 BUG_ON(init_worker_pool(pool));
5006 cpumask_copy(pool->attrs->cpumask, cpumask_of(cpu));
5007 pool->attrs->nice = std_nice[i++];
5008 pool->node = cpu_to_node(cpu);
5011 mutex_lock(&wq_pool_mutex);
5012 BUG_ON(worker_pool_assign_id(pool));
5013 mutex_unlock(&wq_pool_mutex);
5017 /* create the initial worker */
5018 for_each_online_cpu(cpu) {
5019 struct worker_pool *pool;
5021 for_each_cpu_worker_pool(pool, cpu) {
5022 pool->flags &= ~POOL_DISASSOCIATED;
5023 BUG_ON(create_and_start_worker(pool) < 0);
5027 /* create default unbound and ordered wq attrs */
5028 for (i = 0; i < NR_STD_WORKER_POOLS; i++) {
5029 struct workqueue_attrs *attrs;
5031 BUG_ON(!(attrs = alloc_workqueue_attrs(GFP_KERNEL)));
5032 attrs->nice = std_nice[i];
5033 unbound_std_wq_attrs[i] = attrs;
5036 * An ordered wq should have only one pwq as ordering is
5037 * guaranteed by max_active which is enforced by pwqs.
5038 * Turn off NUMA so that dfl_pwq is used for all nodes.
5040 BUG_ON(!(attrs = alloc_workqueue_attrs(GFP_KERNEL)));
5041 attrs->nice = std_nice[i];
5042 attrs->no_numa = true;
5043 ordered_wq_attrs[i] = attrs;
5046 system_wq = alloc_workqueue("events", 0, 0);
5047 system_highpri_wq = alloc_workqueue("events_highpri", WQ_HIGHPRI, 0);
5048 system_long_wq = alloc_workqueue("events_long", 0, 0);
5049 system_unbound_wq = alloc_workqueue("events_unbound", WQ_UNBOUND,
5050 WQ_UNBOUND_MAX_ACTIVE);
5051 system_freezable_wq = alloc_workqueue("events_freezable",
5053 system_power_efficient_wq = alloc_workqueue("events_power_efficient",
5054 WQ_POWER_EFFICIENT, 0);
5055 system_freezable_power_efficient_wq = alloc_workqueue("events_freezable_power_efficient",
5056 WQ_FREEZABLE | WQ_POWER_EFFICIENT,
5058 BUG_ON(!system_wq || !system_highpri_wq || !system_long_wq ||
5059 !system_unbound_wq || !system_freezable_wq ||
5060 !system_power_efficient_wq ||
5061 !system_freezable_power_efficient_wq);
5064 early_initcall(init_workqueues);