workqueue.h 13.0 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6 7 8 9 10
/*
 * 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>
11
#include <linux/lockdep.h>
12
#include <linux/threads.h>
13
#include <asm/atomic.h>
L
Linus Torvalds 已提交
14 15 16

struct workqueue_struct;

17 18
struct work_struct;
typedef void (*work_func_t)(struct work_struct *work);
19

20 21 22 23 24 25
/*
 * The first word is the work queue pointer and the flags rolled into
 * one
 */
#define work_data_bits(work) ((unsigned long *)(&(work)->data))

26 27
enum {
	WORK_STRUCT_PENDING_BIT	= 0,	/* work item is pending execution */
28 29 30
	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 */
31
#ifdef CONFIG_DEBUG_OBJECTS_WORK
32 33
	WORK_STRUCT_STATIC_BIT	= 4,	/* static initializer (debugobjects) */
	WORK_STRUCT_COLOR_SHIFT	= 5,	/* color for workqueue flushing */
T
Tejun Heo 已提交
34
#else
35
	WORK_STRUCT_COLOR_SHIFT	= 4,	/* color for workqueue flushing */
36 37
#endif

38 39
	WORK_STRUCT_COLOR_BITS	= 4,

40
	WORK_STRUCT_PENDING	= 1 << WORK_STRUCT_PENDING_BIT,
41
	WORK_STRUCT_DELAYED	= 1 << WORK_STRUCT_DELAYED_BIT,
42
	WORK_STRUCT_CWQ		= 1 << WORK_STRUCT_CWQ_BIT,
43
	WORK_STRUCT_LINKED	= 1 << WORK_STRUCT_LINKED_BIT,
44 45 46 47 48 49
#ifdef CONFIG_DEBUG_OBJECTS_WORK
	WORK_STRUCT_STATIC	= 1 << WORK_STRUCT_STATIC_BIT,
#else
	WORK_STRUCT_STATIC	= 0,
#endif

50 51 52 53 54 55 56
	/*
	 * 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,

57
	/* special cpu IDs */
58 59
	WORK_CPU_UNBOUND	= NR_CPUS,
	WORK_CPU_NONE		= NR_CPUS + 1,
60 61
	WORK_CPU_LAST		= WORK_CPU_NONE,

62
	/*
63
	 * Reserve 7 bits off of cwq pointer w/ debugobjects turned
64 65
	 * off.  This makes cwqs aligned to 256 bytes and allows 15
	 * workqueue flush colors.
66 67 68 69
	 */
	WORK_STRUCT_FLAG_BITS	= WORK_STRUCT_COLOR_SHIFT +
				  WORK_STRUCT_COLOR_BITS,

T
Tejun Heo 已提交
70
	WORK_STRUCT_FLAG_MASK	= (1UL << WORK_STRUCT_FLAG_BITS) - 1,
71
	WORK_STRUCT_WQ_DATA_MASK = ~WORK_STRUCT_FLAG_MASK,
72
	WORK_STRUCT_NO_CPU	= WORK_CPU_NONE << WORK_STRUCT_FLAG_BITS,
73 74 75 76

	/* bit mask for work_busy() return values */
	WORK_BUSY_PENDING	= 1 << 0,
	WORK_BUSY_RUNNING	= 1 << 1,
77 78
};

L
Linus Torvalds 已提交
79
struct work_struct {
80
	atomic_long_t data;
L
Linus Torvalds 已提交
81
	struct list_head entry;
82
	work_func_t func;
83 84 85
#ifdef CONFIG_LOCKDEP
	struct lockdep_map lockdep_map;
#endif
86 87
};

88 89 90
#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)
91

92 93
struct delayed_work {
	struct work_struct work;
L
Linus Torvalds 已提交
94 95 96
	struct timer_list timer;
};

97 98 99 100 101
static inline struct delayed_work *to_delayed_work(struct work_struct *work)
{
	return container_of(work, struct delayed_work, work);
}

102 103 104 105
struct execute_work {
	struct work_struct work;
};

106 107 108 109 110 111 112 113 114 115 116 117
#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

118
#define __WORK_INITIALIZER(n, f) {				\
119
	.data = WORK_DATA_STATIC_INIT(),			\
O
Oleg Nesterov 已提交
120
	.entry	= { &(n).entry, &(n).entry },			\
121
	.func = (f),						\
122
	__WORK_INIT_LOCKDEP_MAP(#n, &(n))			\
123 124 125 126 127 128 129 130 131 132 133 134 135
	}

#define __DELAYED_WORK_INITIALIZER(n, f) {			\
	.work = __WORK_INITIALIZER((n).work, (f)),		\
	.timer = TIMER_INITIALIZER(NULL, 0, 0),			\
	}

#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)

L
Linus Torvalds 已提交
136
/*
137
 * initialize a work item's function pointer
L
Linus Torvalds 已提交
138
 */
139
#define PREPARE_WORK(_work, _func)				\
L
Linus Torvalds 已提交
140
	do {							\
141
		(_work)->func = (_func);			\
L
Linus Torvalds 已提交
142 143
	} while (0)

144 145
#define PREPARE_DELAYED_WORK(_work, _func)			\
	PREPARE_WORK(&(_work)->work, (_func))
146

147 148 149
#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);
T
Tejun Heo 已提交
150 151
static inline unsigned int work_static(struct work_struct *work)
{
152
	return *work_data_bits(work) & WORK_STRUCT_STATIC;
T
Tejun Heo 已提交
153
}
154 155 156
#else
static inline void __init_work(struct work_struct *work, int onstack) { }
static inline void destroy_work_on_stack(struct work_struct *work) { }
T
Tejun Heo 已提交
157
static inline unsigned int work_static(struct work_struct *work) { return 0; }
158 159
#endif

L
Linus Torvalds 已提交
160
/*
161
 * initialize all of a work item in one go
162
 *
D
Dmitri Vorobiev 已提交
163
 * NOTE! No point in using "atomic_long_set()": using a direct
164 165
 * assignment of the work data initializer allows the compiler
 * to generate better code.
L
Linus Torvalds 已提交
166
 */
167
#ifdef CONFIG_LOCKDEP
168
#define __INIT_WORK(_work, _func, _onstack)				\
169
	do {								\
170 171
		static struct lock_class_key __key;			\
									\
172
		__init_work((_work), _onstack);				\
O
Oleg Nesterov 已提交
173
		(_work)->data = (atomic_long_t) WORK_DATA_INIT();	\
174
		lockdep_init_map(&(_work)->lockdep_map, #_work, &__key, 0);\
175 176 177
		INIT_LIST_HEAD(&(_work)->entry);			\
		PREPARE_WORK((_work), (_func));				\
	} while (0)
178
#else
179
#define __INIT_WORK(_work, _func, _onstack)				\
180
	do {								\
181
		__init_work((_work), _onstack);				\
182 183 184 185 186
		(_work)->data = (atomic_long_t) WORK_DATA_INIT();	\
		INIT_LIST_HEAD(&(_work)->entry);			\
		PREPARE_WORK((_work), (_func));				\
	} while (0)
#endif
187

188 189 190 191 192 193 194 195 196 197
#define INIT_WORK(_work, _func)					\
	do {							\
		__INIT_WORK((_work), (_func), 0);		\
	} while (0)

#define INIT_WORK_ON_STACK(_work, _func)			\
	do {							\
		__INIT_WORK((_work), (_func), 1);		\
	} while (0)

198 199 200 201
#define INIT_DELAYED_WORK(_work, _func)				\
	do {							\
		INIT_WORK(&(_work)->work, (_func));		\
		init_timer(&(_work)->timer);			\
202 203
	} while (0)

204 205
#define INIT_DELAYED_WORK_ON_STACK(_work, _func)		\
	do {							\
206
		INIT_WORK_ON_STACK(&(_work)->work, (_func));	\
207 208 209
		init_timer_on_stack(&(_work)->timer);		\
	} while (0)

210
#define INIT_DELAYED_WORK_DEFERRABLE(_work, _func)		\
211 212 213 214 215
	do {							\
		INIT_WORK(&(_work)->work, (_func));		\
		init_timer_deferrable(&(_work)->timer);		\
	} while (0)

216 217 218 219 220
/**
 * work_pending - Find out whether a work item is currently pending
 * @work: The work item in question
 */
#define work_pending(work) \
221
	test_bit(WORK_STRUCT_PENDING_BIT, work_data_bits(work))
222 223 224 225 226 227

/**
 * delayed_work_pending - Find out whether a delayable work item is currently
 * pending
 * @work: The work item in question
 */
228 229
#define delayed_work_pending(w) \
	work_pending(&(w)->work)
230

231
/**
O
Oleg Nesterov 已提交
232 233
 * work_clear_pending - for internal use only, mark a work item as not pending
 * @work: The work item in question
234
 */
O
Oleg Nesterov 已提交
235
#define work_clear_pending(work) \
236
	clear_bit(WORK_STRUCT_PENDING_BIT, work_data_bits(work))
237

T
Tejun Heo 已提交
238 239 240 241
/*
 * Workqueue flags and constants.  For details, please refer to
 * Documentation/workqueue.txt.
 */
242
enum {
243
	WQ_NON_REENTRANT	= 1 << 0, /* guarantee non-reentrance */
244
	WQ_UNBOUND		= 1 << 1, /* not bound to any cpu */
245
	WQ_FREEZEABLE		= 1 << 2, /* freeze during suspend */
246
	WQ_MEM_RECLAIM		= 1 << 3, /* may be used for memory reclaim */
247
	WQ_HIGHPRI		= 1 << 4, /* high priority */
248
	WQ_CPU_INTENSIVE	= 1 << 5, /* cpu instensive workqueue */
249

250
	WQ_DYING		= 1 << 6, /* internal: workqueue is dying */
251
	WQ_RESCUER		= 1 << 7, /* internal: workqueue has rescuer */
252

253
	WQ_MAX_ACTIVE		= 512,	  /* I like 512, better ideas? */
254
	WQ_MAX_UNBOUND_PER_CPU	= 4,	  /* 4 * #cpus for unbound wq */
255
	WQ_DFL_ACTIVE		= WQ_MAX_ACTIVE / 2,
256
};
257

258 259 260
/* 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)
261

262 263 264 265 266 267 268 269 270 271 272 273 274 275
/*
 * 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.
276 277 278 279 280
 *
 * 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.
281 282 283 284
 */
extern struct workqueue_struct *system_wq;
extern struct workqueue_struct *system_long_wq;
extern struct workqueue_struct *system_nrt_wq;
285
extern struct workqueue_struct *system_unbound_wq;
286

287
extern struct workqueue_struct *
288 289
__alloc_workqueue_key(const char *name, unsigned int flags, int max_active,
		      struct lock_class_key *key, const char *lock_name);
290 291

#ifdef CONFIG_LOCKDEP
292
#define alloc_workqueue(name, flags, max_active)		\
293 294
({								\
	static struct lock_class_key __key;			\
295 296 297 298 299 300
	const char *__lock_name;				\
								\
	if (__builtin_constant_p(name))				\
		__lock_name = (name);				\
	else							\
		__lock_name = #name;				\
301
								\
302 303
	__alloc_workqueue_key((name), (flags), (max_active),	\
			      &__key, __lock_name);		\
304 305
})
#else
306 307
#define alloc_workqueue(name, flags, max_active)		\
	__alloc_workqueue_key((name), (flags), (max_active), NULL, NULL)
308 309
#endif

310 311 312
/**
 * alloc_ordered_workqueue - allocate an ordered workqueue
 * @name: name of the workqueue
313
 * @flags: WQ_* flags (only WQ_FREEZEABLE and WQ_MEM_RECLAIM are meaningful)
314 315 316 317 318 319 320 321 322 323 324 325 326 327
 *
 * 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);
}

328
#define create_workqueue(name)					\
329
	alloc_workqueue((name), WQ_MEM_RECLAIM, 1)
330
#define create_freezeable_workqueue(name)			\
331
	alloc_workqueue((name), WQ_FREEZEABLE | WQ_UNBOUND | WQ_MEM_RECLAIM, 1)
332
#define create_singlethread_workqueue(name)			\
333
	alloc_workqueue((name), WQ_UNBOUND | WQ_MEM_RECLAIM, 1)
L
Linus Torvalds 已提交
334 335 336

extern void destroy_workqueue(struct workqueue_struct *wq);

337
extern int queue_work(struct workqueue_struct *wq, struct work_struct *work);
338 339
extern int queue_work_on(int cpu, struct workqueue_struct *wq,
			struct work_struct *work);
340 341
extern int queue_delayed_work(struct workqueue_struct *wq,
			struct delayed_work *work, unsigned long delay);
342
extern int queue_delayed_work_on(int cpu, struct workqueue_struct *wq,
343 344
			struct delayed_work *work, unsigned long delay);

345
extern void flush_workqueue(struct workqueue_struct *wq);
346
extern void flush_scheduled_work(void);
L
Linus Torvalds 已提交
347

348
extern int schedule_work(struct work_struct *work);
349
extern int schedule_work_on(int cpu, struct work_struct *work);
350
extern int schedule_delayed_work(struct delayed_work *work, unsigned long delay);
351 352
extern int schedule_delayed_work_on(int cpu, struct delayed_work *work,
					unsigned long delay);
353
extern int schedule_on_each_cpu(work_func_t func);
L
Linus Torvalds 已提交
354 355
extern int keventd_up(void);

356
int execute_in_process_context(work_func_t fn, struct execute_work *);
L
Linus Torvalds 已提交
357

358
extern bool flush_work(struct work_struct *work);
359
extern bool flush_work_sync(struct work_struct *work);
360 361 362
extern bool cancel_work_sync(struct work_struct *work);

extern bool flush_delayed_work(struct delayed_work *dwork);
363
extern bool flush_delayed_work_sync(struct delayed_work *work);
364
extern bool cancel_delayed_work_sync(struct delayed_work *dwork);
365

366 367 368 369 370 371
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);

L
Linus Torvalds 已提交
372 373
/*
 * Kill off a pending schedule_delayed_work().  Note that the work callback
374 375
 * 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
376
 * cancel_work_sync() to wait on it.
L
Linus Torvalds 已提交
377
 */
378
static inline bool cancel_delayed_work(struct delayed_work *work)
L
Linus Torvalds 已提交
379
{
380
	bool ret;
L
Linus Torvalds 已提交
381

382
	ret = del_timer_sync(&work->timer);
L
Linus Torvalds 已提交
383
	if (ret)
O
Oleg Nesterov 已提交
384
		work_clear_pending(&work->work);
L
Linus Torvalds 已提交
385 386 387
	return ret;
}

388 389 390 391 392
/*
 * 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.
 */
393
static inline bool __cancel_delayed_work(struct delayed_work *work)
394
{
395
	bool ret;
396 397 398 399 400 401 402

	ret = del_timer(&work->timer);
	if (ret)
		work_clear_pending(&work->work);
	return ret;
}

403
/* Obsolete. use cancel_delayed_work_sync() */
404 405 406 407
static inline
void cancel_rearming_delayed_workqueue(struct workqueue_struct *wq,
					struct delayed_work *work)
{
408 409 410 411 412 413 414 415
	cancel_delayed_work_sync(work);
}

/* Obsolete. use cancel_delayed_work_sync() */
static inline
void cancel_rearming_delayed_work(struct delayed_work *work)
{
	cancel_delayed_work_sync(work);
416 417
}

418 419 420 421 422 423 424 425
#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 */
426

427 428 429 430 431 432
#ifdef CONFIG_FREEZER
extern void freeze_workqueues_begin(void);
extern bool freeze_workqueues_busy(void);
extern void thaw_workqueues(void);
#endif /* CONFIG_FREEZER */

L
Linus Torvalds 已提交
433
#endif