workqueue.h 6.5 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 <asm/atomic.h>
L
Linus Torvalds 已提交
12 13 14

struct workqueue_struct;

15 16
struct work_struct;
typedef void (*work_func_t)(struct work_struct *work);
17

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

L
Linus Torvalds 已提交
24
struct work_struct {
25
	atomic_long_t data;
26
#define WORK_STRUCT_PENDING 0		/* T if work item pending execution */
27
#define WORK_STRUCT_NOAUTOREL 1		/* F if work item automatically released on exec */
28 29
#define WORK_STRUCT_FLAG_MASK (3UL)
#define WORK_STRUCT_WQ_DATA_MASK (~WORK_STRUCT_FLAG_MASK)
L
Linus Torvalds 已提交
30
	struct list_head entry;
31
	work_func_t func;
32 33
};

34 35 36
#define WORK_DATA_INIT(autorelease) \
	ATOMIC_LONG_INIT((autorelease) << WORK_STRUCT_NOAUTOREL)

37 38
struct delayed_work {
	struct work_struct work;
L
Linus Torvalds 已提交
39 40 41
	struct timer_list timer;
};

42 43 44 45
struct execute_work {
	struct work_struct work;
};

46
#define __WORK_INITIALIZER(n, f) {				\
47
	.data = WORK_DATA_INIT(0),				\
L
Linus Torvalds 已提交
48 49
        .entry	= { &(n).entry, &(n).entry },			\
	.func = (f),						\
50 51
	}

52
#define __WORK_INITIALIZER_NAR(n, f) {				\
53
	.data = WORK_DATA_INIT(1),				\
54 55 56 57 58 59 60 61 62 63 64
        .entry	= { &(n).entry, &(n).entry },			\
	.func = (f),						\
	}

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

#define __DELAYED_WORK_INITIALIZER_NAR(n, f) {			\
	.work = __WORK_INITIALIZER_NAR((n).work, (f)),		\
L
Linus Torvalds 已提交
65 66 67
	.timer = TIMER_INITIALIZER(NULL, 0, 0),			\
	}

68 69 70 71 72
#define DECLARE_WORK(n, f)					\
	struct work_struct n = __WORK_INITIALIZER(n, f)

#define DECLARE_WORK_NAR(n, f)					\
	struct work_struct n = __WORK_INITIALIZER_NAR(n, f)
L
Linus Torvalds 已提交
73

74 75 76 77 78
#define DECLARE_DELAYED_WORK(n, f)				\
	struct delayed_work n = __DELAYED_WORK_INITIALIZER(n, f)

#define DECLARE_DELAYED_WORK_NAR(n, f)			\
	struct dwork_struct n = __DELAYED_WORK_INITIALIZER_NAR(n, f)
79

L
Linus Torvalds 已提交
80
/*
81
 * initialize a work item's function pointer
L
Linus Torvalds 已提交
82
 */
83
#define PREPARE_WORK(_work, _func)				\
L
Linus Torvalds 已提交
84
	do {							\
85
		(_work)->func = (_func);			\
L
Linus Torvalds 已提交
86 87
	} while (0)

88 89
#define PREPARE_DELAYED_WORK(_work, _func)			\
	PREPARE_WORK(&(_work)->work, (_func))
90

L
Linus Torvalds 已提交
91
/*
92
 * initialize all of a work item in one go
93 94 95 96
 *
 * NOTE! No point in using "atomic_long_set()": useing a direct
 * assignment of the work data initializer allows the compiler
 * to generate better code.
L
Linus Torvalds 已提交
97
 */
98
#define INIT_WORK(_work, _func)					\
L
Linus Torvalds 已提交
99
	do {							\
100
		(_work)->data = (atomic_long_t) WORK_DATA_INIT(0);	\
101 102 103 104 105 106
		INIT_LIST_HEAD(&(_work)->entry);		\
		PREPARE_WORK((_work), (_func));			\
	} while (0)

#define INIT_WORK_NAR(_work, _func)					\
	do {								\
107
		(_work)->data = (atomic_long_t) WORK_DATA_INIT(1);	\
108 109 110 111 112 113 114 115
		INIT_LIST_HEAD(&(_work)->entry);			\
		PREPARE_WORK((_work), (_func));				\
	} while (0)

#define INIT_DELAYED_WORK(_work, _func)				\
	do {							\
		INIT_WORK(&(_work)->work, (_func));		\
		init_timer(&(_work)->timer);			\
116 117
	} while (0)

118
#define INIT_DELAYED_WORK_NAR(_work, _func)			\
119
	do {							\
120
		INIT_WORK_NAR(&(_work)->work, (_func));		\
L
Linus Torvalds 已提交
121 122 123
		init_timer(&(_work)->timer);			\
	} while (0)

124 125 126 127 128 129
#define INIT_DELAYED_WORK_DEFERRABLE(_work, _func)			\
	do {							\
		INIT_WORK(&(_work)->work, (_func));		\
		init_timer_deferrable(&(_work)->timer);		\
	} while (0)

130 131 132 133 134
/**
 * work_pending - Find out whether a work item is currently pending
 * @work: The work item in question
 */
#define work_pending(work) \
135
	test_bit(WORK_STRUCT_PENDING, work_data_bits(work))
136 137 138 139 140 141

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

145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163
/**
 * work_release - Release a work item under execution
 * @work: The work item to release
 *
 * This is used to release a work item that has been initialised with automatic
 * release mode disabled (WORK_STRUCT_NOAUTOREL is set).  This gives the work
 * function the opportunity to grab auxiliary data from the container of the
 * work_struct before clearing the pending bit as the work_struct may be
 * subject to deallocation the moment the pending bit is cleared.
 *
 * In such a case, this should be called in the work function after it has
 * fetched any data it may require from the containter of the work_struct.
 * After this function has been called, the work_struct may be scheduled for
 * further execution or it may be deallocated unless other precautions are
 * taken.
 *
 * This should also be used to release a delayed work item.
 */
#define work_release(work) \
164
	clear_bit(WORK_STRUCT_PENDING, work_data_bits(work))
165

166

L
Linus Torvalds 已提交
167
extern struct workqueue_struct *__create_workqueue(const char *name,
168 169 170 171 172
						    int singlethread,
						    int freezeable);
#define create_workqueue(name) __create_workqueue((name), 0, 0)
#define create_freezeable_workqueue(name) __create_workqueue((name), 0, 1)
#define create_singlethread_workqueue(name) __create_workqueue((name), 1, 0)
L
Linus Torvalds 已提交
173 174 175 176

extern void destroy_workqueue(struct workqueue_struct *wq);

extern int FASTCALL(queue_work(struct workqueue_struct *wq, struct work_struct *work));
177
extern int FASTCALL(queue_delayed_work(struct workqueue_struct *wq, struct delayed_work *work, unsigned long delay));
178
extern int queue_delayed_work_on(int cpu, struct workqueue_struct *wq,
179
	struct delayed_work *work, unsigned long delay);
L
Linus Torvalds 已提交
180 181 182
extern void FASTCALL(flush_workqueue(struct workqueue_struct *wq));

extern int FASTCALL(schedule_work(struct work_struct *work));
183
extern int FASTCALL(run_scheduled_work(struct work_struct *work));
184
extern int FASTCALL(schedule_delayed_work(struct delayed_work *work, unsigned long delay));
L
Linus Torvalds 已提交
185

186
extern int schedule_delayed_work_on(int cpu, struct delayed_work *work, unsigned long delay);
187
extern int schedule_on_each_cpu(work_func_t func);
L
Linus Torvalds 已提交
188 189 190 191 192
extern void flush_scheduled_work(void);
extern int current_is_keventd(void);
extern int keventd_up(void);

extern void init_workqueues(void);
193
void cancel_rearming_delayed_work(struct delayed_work *work);
194
void cancel_rearming_delayed_workqueue(struct workqueue_struct *,
195
				       struct delayed_work *);
196
int execute_in_process_context(work_func_t fn, struct execute_work *);
L
Linus Torvalds 已提交
197 198 199

/*
 * Kill off a pending schedule_delayed_work().  Note that the work callback
200 201 202
 * 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
 * cancel_work_sync() to wait on it.
L
Linus Torvalds 已提交
203
 */
204
static inline int cancel_delayed_work(struct delayed_work *work)
L
Linus Torvalds 已提交
205 206 207
{
	int ret;

208
	ret = del_timer(&work->timer);
L
Linus Torvalds 已提交
209
	if (ret)
210
		work_release(&work->work);
L
Linus Torvalds 已提交
211 212 213 214
	return ret;
}

#endif