2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
* workqueue.h --- work queue handling for Linux.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _LINUX_WORKQUEUE_H
|
|
|
|
#define _LINUX_WORKQUEUE_H
|
|
|
|
|
|
|
|
#include <linux/timer.h>
|
|
|
|
#include <linux/linkage.h>
|
|
|
|
#include <linux/bitops.h>
|
2007-10-19 14:39:55 +08:00
|
|
|
#include <linux/lockdep.h>
|
2010-06-29 16:07:13 +08:00
|
|
|
#include <linux/threads.h>
|
2006-12-17 01:53:50 +08:00
|
|
|
#include <asm/atomic.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
struct workqueue_struct;
|
|
|
|
|
2006-11-22 22:55:48 +08:00
|
|
|
struct work_struct;
|
|
|
|
typedef void (*work_func_t)(struct work_struct *work);
|
2006-11-22 22:54:45 +08:00
|
|
|
|
2006-12-17 01:53:50 +08:00
|
|
|
/*
|
|
|
|
* The first word is the work queue pointer and the flags rolled into
|
|
|
|
* one
|
|
|
|
*/
|
|
|
|
#define work_data_bits(work) ((unsigned long *)(&(work)->data))
|
|
|
|
|
2010-06-29 16:07:10 +08:00
|
|
|
enum {
|
|
|
|
WORK_STRUCT_PENDING_BIT = 0, /* work item is pending execution */
|
2010-08-25 16:33:56 +08:00
|
|
|
WORK_STRUCT_DELAYED_BIT = 1, /* work item is delayed */
|
|
|
|
WORK_STRUCT_CWQ_BIT = 2, /* data points to cwq */
|
|
|
|
WORK_STRUCT_LINKED_BIT = 3, /* next work is linked to this one */
|
2010-06-29 16:07:10 +08:00
|
|
|
#ifdef CONFIG_DEBUG_OBJECTS_WORK
|
2010-08-25 16:33:56 +08:00
|
|
|
WORK_STRUCT_STATIC_BIT = 4, /* static initializer (debugobjects) */
|
|
|
|
WORK_STRUCT_COLOR_SHIFT = 5, /* color for workqueue flushing */
|
2010-06-29 16:07:11 +08:00
|
|
|
#else
|
2010-08-25 16:33:56 +08:00
|
|
|
WORK_STRUCT_COLOR_SHIFT = 4, /* color for workqueue flushing */
|
2010-06-29 16:07:10 +08:00
|
|
|
#endif
|
|
|
|
|
2010-06-29 16:07:11 +08:00
|
|
|
WORK_STRUCT_COLOR_BITS = 4,
|
|
|
|
|
2010-06-29 16:07:10 +08:00
|
|
|
WORK_STRUCT_PENDING = 1 << WORK_STRUCT_PENDING_BIT,
|
2010-08-25 16:33:56 +08:00
|
|
|
WORK_STRUCT_DELAYED = 1 << WORK_STRUCT_DELAYED_BIT,
|
2010-07-22 20:14:25 +08:00
|
|
|
WORK_STRUCT_CWQ = 1 << WORK_STRUCT_CWQ_BIT,
|
2010-06-29 16:07:12 +08:00
|
|
|
WORK_STRUCT_LINKED = 1 << WORK_STRUCT_LINKED_BIT,
|
2010-06-29 16:07:10 +08:00
|
|
|
#ifdef CONFIG_DEBUG_OBJECTS_WORK
|
|
|
|
WORK_STRUCT_STATIC = 1 << WORK_STRUCT_STATIC_BIT,
|
|
|
|
#else
|
|
|
|
WORK_STRUCT_STATIC = 0,
|
|
|
|
#endif
|
|
|
|
|
2010-06-29 16:07:11 +08:00
|
|
|
/*
|
|
|
|
* The last color is no color used for works which don't
|
|
|
|
* participate in workqueue flushing.
|
|
|
|
*/
|
|
|
|
WORK_NR_COLORS = (1 << WORK_STRUCT_COLOR_BITS) - 1,
|
|
|
|
WORK_NO_COLOR = WORK_NR_COLORS,
|
|
|
|
|
2010-07-02 16:03:51 +08:00
|
|
|
/* special cpu IDs */
|
2010-07-02 16:03:51 +08:00
|
|
|
WORK_CPU_UNBOUND = NR_CPUS,
|
|
|
|
WORK_CPU_NONE = NR_CPUS + 1,
|
2010-07-02 16:03:51 +08:00
|
|
|
WORK_CPU_LAST = WORK_CPU_NONE,
|
|
|
|
|
2010-06-29 16:07:11 +08:00
|
|
|
/*
|
2010-07-22 20:14:25 +08:00
|
|
|
* Reserve 7 bits off of cwq pointer w/ debugobjects turned
|
2010-08-25 16:33:56 +08:00
|
|
|
* off. This makes cwqs aligned to 256 bytes and allows 15
|
|
|
|
* workqueue flush colors.
|
2010-06-29 16:07:11 +08:00
|
|
|
*/
|
|
|
|
WORK_STRUCT_FLAG_BITS = WORK_STRUCT_COLOR_SHIFT +
|
|
|
|
WORK_STRUCT_COLOR_BITS,
|
|
|
|
|
2010-06-29 16:07:11 +08:00
|
|
|
WORK_STRUCT_FLAG_MASK = (1UL << WORK_STRUCT_FLAG_BITS) - 1,
|
2010-06-29 16:07:10 +08:00
|
|
|
WORK_STRUCT_WQ_DATA_MASK = ~WORK_STRUCT_FLAG_MASK,
|
2010-07-02 16:03:51 +08:00
|
|
|
WORK_STRUCT_NO_CPU = WORK_CPU_NONE << WORK_STRUCT_FLAG_BITS,
|
2010-06-29 16:07:14 +08:00
|
|
|
|
|
|
|
/* bit mask for work_busy() return values */
|
|
|
|
WORK_BUSY_PENDING = 1 << 0,
|
|
|
|
WORK_BUSY_RUNNING = 1 << 1,
|
2010-06-29 16:07:10 +08:00
|
|
|
};
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
struct work_struct {
|
2006-12-17 01:53:50 +08:00
|
|
|
atomic_long_t data;
|
2005-04-17 06:20:36 +08:00
|
|
|
struct list_head entry;
|
2006-11-22 22:54:45 +08:00
|
|
|
work_func_t func;
|
2007-10-19 14:39:55 +08:00
|
|
|
#ifdef CONFIG_LOCKDEP
|
|
|
|
struct lockdep_map lockdep_map;
|
|
|
|
#endif
|
2006-11-22 22:54:01 +08:00
|
|
|
};
|
|
|
|
|
2010-06-29 16:07:13 +08:00
|
|
|
#define WORK_DATA_INIT() ATOMIC_LONG_INIT(WORK_STRUCT_NO_CPU)
|
|
|
|
#define WORK_DATA_STATIC_INIT() \
|
|
|
|
ATOMIC_LONG_INIT(WORK_STRUCT_NO_CPU | WORK_STRUCT_STATIC)
|
2006-12-17 01:53:50 +08:00
|
|
|
|
2006-11-22 22:54:01 +08:00
|
|
|
struct delayed_work {
|
|
|
|
struct work_struct work;
|
2005-04-17 06:20:36 +08:00
|
|
|
struct timer_list timer;
|
|
|
|
};
|
|
|
|
|
2009-04-03 07:56:54 +08:00
|
|
|
static inline struct delayed_work *to_delayed_work(struct work_struct *work)
|
|
|
|
{
|
|
|
|
return container_of(work, struct delayed_work, work);
|
|
|
|
}
|
|
|
|
|
2006-02-24 02:43:43 +08:00
|
|
|
struct execute_work {
|
|
|
|
struct work_struct work;
|
|
|
|
};
|
|
|
|
|
2007-10-19 14:39:55 +08:00
|
|
|
#ifdef CONFIG_LOCKDEP
|
|
|
|
/*
|
|
|
|
* NB: because we have to copy the lockdep_map, setting _key
|
|
|
|
* here is required, otherwise it could get initialised to the
|
|
|
|
* copy of the lockdep_map!
|
|
|
|
*/
|
|
|
|
#define __WORK_INIT_LOCKDEP_MAP(n, k) \
|
|
|
|
.lockdep_map = STATIC_LOCKDEP_MAP_INIT(n, k),
|
|
|
|
#else
|
|
|
|
#define __WORK_INIT_LOCKDEP_MAP(n, k)
|
|
|
|
#endif
|
|
|
|
|
2006-11-22 22:55:48 +08:00
|
|
|
#define __WORK_INITIALIZER(n, f) { \
|
2009-11-16 00:09:48 +08:00
|
|
|
.data = WORK_DATA_STATIC_INIT(), \
|
2007-05-09 17:34:19 +08:00
|
|
|
.entry = { &(n).entry, &(n).entry }, \
|
2006-11-22 22:55:48 +08:00
|
|
|
.func = (f), \
|
2007-10-19 14:39:55 +08:00
|
|
|
__WORK_INIT_LOCKDEP_MAP(#n, &(n)) \
|
2006-11-22 22:55:48 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
#define __DELAYED_WORK_INITIALIZER(n, f) { \
|
|
|
|
.work = __WORK_INITIALIZER((n).work, (f)), \
|
|
|
|
.timer = TIMER_INITIALIZER(NULL, 0, 0), \
|
|
|
|
}
|
|
|
|
|
2010-10-21 06:57:33 +08:00
|
|
|
#define __DEFERRED_WORK_INITIALIZER(n, f) { \
|
|
|
|
.work = __WORK_INITIALIZER((n).work, (f)), \
|
|
|
|
.timer = TIMER_DEFERRED_INITIALIZER(NULL, 0, 0), \
|
|
|
|
}
|
|
|
|
|
2006-11-22 22:55:48 +08:00
|
|
|
#define DECLARE_WORK(n, f) \
|
|
|
|
struct work_struct n = __WORK_INITIALIZER(n, f)
|
|
|
|
|
|
|
|
#define DECLARE_DELAYED_WORK(n, f) \
|
|
|
|
struct delayed_work n = __DELAYED_WORK_INITIALIZER(n, f)
|
|
|
|
|
2010-10-21 06:57:33 +08:00
|
|
|
#define DECLARE_DEFERRED_WORK(n, f) \
|
|
|
|
struct delayed_work n = __DEFERRED_WORK_INITIALIZER(n, f)
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
2006-11-22 22:55:48 +08:00
|
|
|
* initialize a work item's function pointer
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
2006-11-22 22:55:48 +08:00
|
|
|
#define PREPARE_WORK(_work, _func) \
|
2005-04-17 06:20:36 +08:00
|
|
|
do { \
|
2006-11-22 22:54:01 +08:00
|
|
|
(_work)->func = (_func); \
|
2005-04-17 06:20:36 +08:00
|
|
|
} while (0)
|
|
|
|
|
2006-11-22 22:55:48 +08:00
|
|
|
#define PREPARE_DELAYED_WORK(_work, _func) \
|
|
|
|
PREPARE_WORK(&(_work)->work, (_func))
|
2006-11-22 22:54:01 +08:00
|
|
|
|
2009-11-16 00:09:48 +08:00
|
|
|
#ifdef CONFIG_DEBUG_OBJECTS_WORK
|
|
|
|
extern void __init_work(struct work_struct *work, int onstack);
|
|
|
|
extern void destroy_work_on_stack(struct work_struct *work);
|
2010-06-29 16:07:10 +08:00
|
|
|
static inline unsigned int work_static(struct work_struct *work)
|
|
|
|
{
|
2010-06-29 16:07:10 +08:00
|
|
|
return *work_data_bits(work) & WORK_STRUCT_STATIC;
|
2010-06-29 16:07:10 +08:00
|
|
|
}
|
2009-11-16 00:09:48 +08:00
|
|
|
#else
|
|
|
|
static inline void __init_work(struct work_struct *work, int onstack) { }
|
|
|
|
static inline void destroy_work_on_stack(struct work_struct *work) { }
|
2010-06-29 16:07:10 +08:00
|
|
|
static inline unsigned int work_static(struct work_struct *work) { return 0; }
|
2009-11-16 00:09:48 +08:00
|
|
|
#endif
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
2006-11-22 22:54:01 +08:00
|
|
|
* initialize all of a work item in one go
|
2006-12-17 01:53:50 +08:00
|
|
|
*
|
2009-06-23 18:09:29 +08:00
|
|
|
* NOTE! No point in using "atomic_long_set()": using a direct
|
2006-12-17 01:53:50 +08:00
|
|
|
* assignment of the work data initializer allows the compiler
|
|
|
|
* to generate better code.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
2007-10-19 14:39:55 +08:00
|
|
|
#ifdef CONFIG_LOCKDEP
|
2009-11-16 00:09:48 +08:00
|
|
|
#define __INIT_WORK(_work, _func, _onstack) \
|
2006-11-22 22:55:48 +08:00
|
|
|
do { \
|
2007-10-19 14:39:55 +08:00
|
|
|
static struct lock_class_key __key; \
|
|
|
|
\
|
2009-11-16 00:09:48 +08:00
|
|
|
__init_work((_work), _onstack); \
|
2007-05-09 17:34:19 +08:00
|
|
|
(_work)->data = (atomic_long_t) WORK_DATA_INIT(); \
|
2007-10-19 14:39:55 +08:00
|
|
|
lockdep_init_map(&(_work)->lockdep_map, #_work, &__key, 0);\
|
2006-11-22 22:55:48 +08:00
|
|
|
INIT_LIST_HEAD(&(_work)->entry); \
|
|
|
|
PREPARE_WORK((_work), (_func)); \
|
|
|
|
} while (0)
|
2007-10-19 14:39:55 +08:00
|
|
|
#else
|
2009-11-16 00:09:48 +08:00
|
|
|
#define __INIT_WORK(_work, _func, _onstack) \
|
2007-10-19 14:39:55 +08:00
|
|
|
do { \
|
2009-11-16 00:09:48 +08:00
|
|
|
__init_work((_work), _onstack); \
|
2007-10-19 14:39:55 +08:00
|
|
|
(_work)->data = (atomic_long_t) WORK_DATA_INIT(); \
|
|
|
|
INIT_LIST_HEAD(&(_work)->entry); \
|
|
|
|
PREPARE_WORK((_work), (_func)); \
|
|
|
|
} while (0)
|
|
|
|
#endif
|
2006-11-22 22:55:48 +08:00
|
|
|
|
2009-11-16 00:09:48 +08:00
|
|
|
#define INIT_WORK(_work, _func) \
|
|
|
|
do { \
|
|
|
|
__INIT_WORK((_work), (_func), 0); \
|
|
|
|
} while (0)
|
|
|
|
|
2010-10-27 05:22:34 +08:00
|
|
|
#define INIT_WORK_ONSTACK(_work, _func) \
|
2009-11-16 00:09:48 +08:00
|
|
|
do { \
|
|
|
|
__INIT_WORK((_work), (_func), 1); \
|
|
|
|
} while (0)
|
|
|
|
|
2006-11-22 22:55:48 +08:00
|
|
|
#define INIT_DELAYED_WORK(_work, _func) \
|
|
|
|
do { \
|
|
|
|
INIT_WORK(&(_work)->work, (_func)); \
|
|
|
|
init_timer(&(_work)->timer); \
|
2006-11-22 22:54:01 +08:00
|
|
|
} while (0)
|
|
|
|
|
2010-10-27 05:22:34 +08:00
|
|
|
#define INIT_DELAYED_WORK_ONSTACK(_work, _func) \
|
2009-01-12 19:52:23 +08:00
|
|
|
do { \
|
2010-10-27 05:22:34 +08:00
|
|
|
INIT_WORK_ONSTACK(&(_work)->work, (_func)); \
|
2009-01-12 19:52:23 +08:00
|
|
|
init_timer_on_stack(&(_work)->timer); \
|
|
|
|
} while (0)
|
|
|
|
|
2009-11-16 00:09:48 +08:00
|
|
|
#define INIT_DELAYED_WORK_DEFERRABLE(_work, _func) \
|
2007-05-08 15:27:47 +08:00
|
|
|
do { \
|
|
|
|
INIT_WORK(&(_work)->work, (_func)); \
|
|
|
|
init_timer_deferrable(&(_work)->timer); \
|
|
|
|
} while (0)
|
|
|
|
|
2006-11-22 22:54:49 +08:00
|
|
|
/**
|
|
|
|
* work_pending - Find out whether a work item is currently pending
|
|
|
|
* @work: The work item in question
|
|
|
|
*/
|
|
|
|
#define work_pending(work) \
|
2010-06-29 16:07:10 +08:00
|
|
|
test_bit(WORK_STRUCT_PENDING_BIT, work_data_bits(work))
|
2006-11-22 22:54:49 +08:00
|
|
|
|
|
|
|
/**
|
|
|
|
* delayed_work_pending - Find out whether a delayable work item is currently
|
|
|
|
* pending
|
|
|
|
* @work: The work item in question
|
|
|
|
*/
|
2006-12-16 06:13:51 +08:00
|
|
|
#define delayed_work_pending(w) \
|
|
|
|
work_pending(&(w)->work)
|
2006-11-22 22:54:49 +08:00
|
|
|
|
2006-11-22 22:55:48 +08:00
|
|
|
/**
|
2007-05-09 17:34:19 +08:00
|
|
|
* work_clear_pending - for internal use only, mark a work item as not pending
|
|
|
|
* @work: The work item in question
|
2006-11-22 22:55:48 +08:00
|
|
|
*/
|
2007-05-09 17:34:19 +08:00
|
|
|
#define work_clear_pending(work) \
|
2010-06-29 16:07:10 +08:00
|
|
|
clear_bit(WORK_STRUCT_PENDING_BIT, work_data_bits(work))
|
2006-11-22 22:55:48 +08:00
|
|
|
|
2010-09-10 22:51:36 +08:00
|
|
|
/*
|
|
|
|
* Workqueue flags and constants. For details, please refer to
|
|
|
|
* Documentation/workqueue.txt.
|
|
|
|
*/
|
2010-06-29 16:07:10 +08:00
|
|
|
enum {
|
2010-07-02 16:03:51 +08:00
|
|
|
WQ_NON_REENTRANT = 1 << 0, /* guarantee non-reentrance */
|
2010-07-02 16:03:51 +08:00
|
|
|
WQ_UNBOUND = 1 << 1, /* not bound to any cpu */
|
2011-02-16 16:25:31 +08:00
|
|
|
WQ_FREEZABLE = 1 << 2, /* freeze during suspend */
|
2010-10-11 21:12:27 +08:00
|
|
|
WQ_MEM_RECLAIM = 1 << 3, /* may be used for memory reclaim */
|
2010-06-29 16:07:14 +08:00
|
|
|
WQ_HIGHPRI = 1 << 4, /* high priority */
|
2010-06-29 16:07:15 +08:00
|
|
|
WQ_CPU_INTENSIVE = 1 << 5, /* cpu instensive workqueue */
|
2010-06-29 16:07:14 +08:00
|
|
|
|
2010-08-24 20:22:47 +08:00
|
|
|
WQ_DYING = 1 << 6, /* internal: workqueue is dying */
|
2010-10-11 21:12:27 +08:00
|
|
|
WQ_RESCUER = 1 << 7, /* internal: workqueue has rescuer */
|
2010-08-24 20:22:47 +08:00
|
|
|
|
2010-06-29 16:07:14 +08:00
|
|
|
WQ_MAX_ACTIVE = 512, /* I like 512, better ideas? */
|
2010-07-02 16:03:51 +08:00
|
|
|
WQ_MAX_UNBOUND_PER_CPU = 4, /* 4 * #cpus for unbound wq */
|
2010-06-29 16:07:14 +08:00
|
|
|
WQ_DFL_ACTIVE = WQ_MAX_ACTIVE / 2,
|
2010-06-29 16:07:10 +08:00
|
|
|
};
|
2006-11-22 22:54:01 +08:00
|
|
|
|
2010-07-02 16:03:51 +08:00
|
|
|
/* unbound wq's aren't per-cpu, scale max_active according to #cpus */
|
|
|
|
#define WQ_UNBOUND_MAX_ACTIVE \
|
|
|
|
max_t(int, WQ_MAX_ACTIVE, num_possible_cpus() * WQ_MAX_UNBOUND_PER_CPU)
|
2006-11-22 22:55:48 +08:00
|
|
|
|
2010-06-29 16:07:14 +08:00
|
|
|
/*
|
|
|
|
* System-wide workqueues which are always present.
|
|
|
|
*
|
|
|
|
* system_wq is the one used by schedule[_delayed]_work[_on]().
|
|
|
|
* Multi-CPU multi-threaded. There are users which expect relatively
|
|
|
|
* short queue flush time. Don't queue works which can run for too
|
|
|
|
* long.
|
|
|
|
*
|
|
|
|
* system_long_wq is similar to system_wq but may host long running
|
|
|
|
* works. Queue flushing might take relatively long.
|
|
|
|
*
|
|
|
|
* system_nrt_wq is non-reentrant and guarantees that any given work
|
|
|
|
* item is never executed in parallel by multiple CPUs. Queue
|
|
|
|
* flushing might take relatively long.
|
2010-07-02 16:03:51 +08:00
|
|
|
*
|
|
|
|
* system_unbound_wq is unbound workqueue. Workers are not bound to
|
|
|
|
* any specific CPU, not concurrency managed, and all queued works are
|
|
|
|
* executed immediately as long as max_active limit is not reached and
|
|
|
|
* resources are available.
|
2011-02-08 17:39:03 +08:00
|
|
|
*
|
2011-02-21 16:52:50 +08:00
|
|
|
* system_freezable_wq is equivalent to system_wq except that it's
|
|
|
|
* freezable.
|
2010-06-29 16:07:14 +08:00
|
|
|
*/
|
|
|
|
extern struct workqueue_struct *system_wq;
|
|
|
|
extern struct workqueue_struct *system_long_wq;
|
|
|
|
extern struct workqueue_struct *system_nrt_wq;
|
2010-07-02 16:03:51 +08:00
|
|
|
extern struct workqueue_struct *system_unbound_wq;
|
2011-02-21 16:52:50 +08:00
|
|
|
extern struct workqueue_struct *system_freezable_wq;
|
2006-11-22 22:54:01 +08:00
|
|
|
|
2007-10-19 14:39:55 +08:00
|
|
|
extern struct workqueue_struct *
|
2010-06-29 16:07:14 +08:00
|
|
|
__alloc_workqueue_key(const char *name, unsigned int flags, int max_active,
|
|
|
|
struct lock_class_key *key, const char *lock_name);
|
2007-10-19 14:39:55 +08:00
|
|
|
|
|
|
|
#ifdef CONFIG_LOCKDEP
|
2010-06-29 16:07:14 +08:00
|
|
|
#define alloc_workqueue(name, flags, max_active) \
|
2007-10-19 14:39:55 +08:00
|
|
|
({ \
|
|
|
|
static struct lock_class_key __key; \
|
2008-01-16 16:51:58 +08:00
|
|
|
const char *__lock_name; \
|
|
|
|
\
|
|
|
|
if (__builtin_constant_p(name)) \
|
|
|
|
__lock_name = (name); \
|
|
|
|
else \
|
|
|
|
__lock_name = #name; \
|
2007-10-19 14:39:55 +08:00
|
|
|
\
|
2010-06-29 16:07:14 +08:00
|
|
|
__alloc_workqueue_key((name), (flags), (max_active), \
|
|
|
|
&__key, __lock_name); \
|
2007-10-19 14:39:55 +08:00
|
|
|
})
|
|
|
|
#else
|
2010-06-29 16:07:14 +08:00
|
|
|
#define alloc_workqueue(name, flags, max_active) \
|
|
|
|
__alloc_workqueue_key((name), (flags), (max_active), NULL, NULL)
|
2007-10-19 14:39:55 +08:00
|
|
|
#endif
|
|
|
|
|
2010-09-16 16:17:35 +08:00
|
|
|
/**
|
|
|
|
* alloc_ordered_workqueue - allocate an ordered workqueue
|
|
|
|
* @name: name of the workqueue
|
2011-02-16 16:25:31 +08:00
|
|
|
* @flags: WQ_* flags (only WQ_FREEZABLE and WQ_MEM_RECLAIM are meaningful)
|
2010-09-16 16:17:35 +08:00
|
|
|
*
|
|
|
|
* Allocate an ordered workqueue. An ordered workqueue executes at
|
|
|
|
* most one work item at any given time in the queued order. They are
|
|
|
|
* implemented as unbound workqueues with @max_active of one.
|
|
|
|
*
|
|
|
|
* RETURNS:
|
|
|
|
* Pointer to the allocated workqueue on success, %NULL on failure.
|
|
|
|
*/
|
|
|
|
static inline struct workqueue_struct *
|
|
|
|
alloc_ordered_workqueue(const char *name, unsigned int flags)
|
|
|
|
{
|
|
|
|
return alloc_workqueue(name, WQ_UNBOUND | flags, 1);
|
|
|
|
}
|
|
|
|
|
2010-06-29 16:07:10 +08:00
|
|
|
#define create_workqueue(name) \
|
2010-10-11 21:12:27 +08:00
|
|
|
alloc_workqueue((name), WQ_MEM_RECLAIM, 1)
|
2011-02-16 16:25:31 +08:00
|
|
|
#define create_freezable_workqueue(name) \
|
|
|
|
alloc_workqueue((name), WQ_FREEZABLE | WQ_UNBOUND | WQ_MEM_RECLAIM, 1)
|
2010-06-29 16:07:10 +08:00
|
|
|
#define create_singlethread_workqueue(name) \
|
2010-10-11 21:12:27 +08:00
|
|
|
alloc_workqueue((name), WQ_UNBOUND | WQ_MEM_RECLAIM, 1)
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
extern void destroy_workqueue(struct workqueue_struct *wq);
|
|
|
|
|
2008-02-14 07:03:15 +08:00
|
|
|
extern int queue_work(struct workqueue_struct *wq, struct work_struct *work);
|
2008-07-24 12:28:39 +08:00
|
|
|
extern int queue_work_on(int cpu, struct workqueue_struct *wq,
|
|
|
|
struct work_struct *work);
|
2008-02-14 07:03:15 +08:00
|
|
|
extern int queue_delayed_work(struct workqueue_struct *wq,
|
|
|
|
struct delayed_work *work, unsigned long delay);
|
2006-06-29 04:50:33 +08:00
|
|
|
extern int queue_delayed_work_on(int cpu, struct workqueue_struct *wq,
|
2007-05-09 17:34:22 +08:00
|
|
|
struct delayed_work *work, unsigned long delay);
|
|
|
|
|
2008-02-14 07:03:15 +08:00
|
|
|
extern void flush_workqueue(struct workqueue_struct *wq);
|
2007-05-09 17:34:22 +08:00
|
|
|
extern void flush_scheduled_work(void);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2008-02-14 07:03:15 +08:00
|
|
|
extern int schedule_work(struct work_struct *work);
|
2008-07-24 12:28:39 +08:00
|
|
|
extern int schedule_work_on(int cpu, struct work_struct *work);
|
2008-02-14 07:03:15 +08:00
|
|
|
extern int schedule_delayed_work(struct delayed_work *work, unsigned long delay);
|
2007-05-09 17:34:22 +08:00
|
|
|
extern int schedule_delayed_work_on(int cpu, struct delayed_work *work,
|
|
|
|
unsigned long delay);
|
2006-11-22 22:55:48 +08:00
|
|
|
extern int schedule_on_each_cpu(work_func_t func);
|
2005-04-17 06:20:36 +08:00
|
|
|
extern int keventd_up(void);
|
|
|
|
|
2006-11-22 22:55:48 +08:00
|
|
|
int execute_in_process_context(work_func_t fn, struct execute_work *);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2010-09-16 16:36:00 +08:00
|
|
|
extern bool flush_work(struct work_struct *work);
|
2010-09-16 16:48:29 +08:00
|
|
|
extern bool flush_work_sync(struct work_struct *work);
|
2010-09-16 16:36:00 +08:00
|
|
|
extern bool cancel_work_sync(struct work_struct *work);
|
|
|
|
|
|
|
|
extern bool flush_delayed_work(struct delayed_work *dwork);
|
2010-09-16 16:48:29 +08:00
|
|
|
extern bool flush_delayed_work_sync(struct delayed_work *work);
|
2010-09-16 16:36:00 +08:00
|
|
|
extern bool cancel_delayed_work_sync(struct delayed_work *dwork);
|
2007-05-09 17:34:22 +08:00
|
|
|
|
2010-06-29 16:07:14 +08:00
|
|
|
extern void workqueue_set_max_active(struct workqueue_struct *wq,
|
|
|
|
int max_active);
|
|
|
|
extern bool workqueue_congested(unsigned int cpu, struct workqueue_struct *wq);
|
|
|
|
extern unsigned int work_cpu(struct work_struct *work);
|
|
|
|
extern unsigned int work_busy(struct work_struct *work);
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
* Kill off a pending schedule_delayed_work(). Note that the work callback
|
2007-04-27 06:45:32 +08:00
|
|
|
* function may still be running on return from cancel_delayed_work(), unless
|
|
|
|
* it returns 1 and the work doesn't re-arm itself. Run flush_workqueue() or
|
2007-05-09 17:34:22 +08:00
|
|
|
* cancel_work_sync() to wait on it.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
2010-09-16 16:36:00 +08:00
|
|
|
static inline bool cancel_delayed_work(struct delayed_work *work)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2010-09-16 16:36:00 +08:00
|
|
|
bool ret;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2007-05-18 15:36:42 +08:00
|
|
|
ret = del_timer_sync(&work->timer);
|
2005-04-17 06:20:36 +08:00
|
|
|
if (ret)
|
2007-05-09 17:34:19 +08:00
|
|
|
work_clear_pending(&work->work);
|
2005-04-17 06:20:36 +08:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2009-09-06 02:17:06 +08:00
|
|
|
/*
|
|
|
|
* Like above, but uses del_timer() instead of del_timer_sync(). This means,
|
|
|
|
* if it returns 0 the timer function may be running and the queueing is in
|
|
|
|
* progress.
|
|
|
|
*/
|
2010-09-16 16:36:00 +08:00
|
|
|
static inline bool __cancel_delayed_work(struct delayed_work *work)
|
2009-09-06 02:17:06 +08:00
|
|
|
{
|
2010-09-16 16:36:00 +08:00
|
|
|
bool ret;
|
2009-09-06 02:17:06 +08:00
|
|
|
|
|
|
|
ret = del_timer(&work->timer);
|
|
|
|
if (ret)
|
|
|
|
work_clear_pending(&work->work);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2007-07-16 14:41:44 +08:00
|
|
|
/* Obsolete. use cancel_delayed_work_sync() */
|
2010-12-14 23:23:10 +08:00
|
|
|
static inline __deprecated
|
2007-05-09 17:34:18 +08:00
|
|
|
void cancel_rearming_delayed_workqueue(struct workqueue_struct *wq,
|
|
|
|
struct delayed_work *work)
|
|
|
|
{
|
2007-07-16 14:41:44 +08:00
|
|
|
cancel_delayed_work_sync(work);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Obsolete. use cancel_delayed_work_sync() */
|
2010-12-14 23:23:10 +08:00
|
|
|
static inline __deprecated
|
2007-07-16 14:41:44 +08:00
|
|
|
void cancel_rearming_delayed_work(struct delayed_work *work)
|
|
|
|
{
|
|
|
|
cancel_delayed_work_sync(work);
|
2007-05-09 17:34:18 +08:00
|
|
|
}
|
|
|
|
|
2008-11-05 10:39:10 +08:00
|
|
|
#ifndef CONFIG_SMP
|
|
|
|
static inline long work_on_cpu(unsigned int cpu, long (*fn)(void *), void *arg)
|
|
|
|
{
|
|
|
|
return fn(arg);
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
long work_on_cpu(unsigned int cpu, long (*fn)(void *), void *arg);
|
|
|
|
#endif /* CONFIG_SMP */
|
2010-05-14 03:32:28 +08:00
|
|
|
|
2010-06-29 16:07:12 +08:00
|
|
|
#ifdef CONFIG_FREEZER
|
|
|
|
extern void freeze_workqueues_begin(void);
|
|
|
|
extern bool freeze_workqueues_busy(void);
|
|
|
|
extern void thaw_workqueues(void);
|
|
|
|
#endif /* CONFIG_FREEZER */
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
#endif
|