1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
|
/* $OpenBSD: kern_workq.c,v 1.10 2009/06/24 14:56:41 jsg Exp $ */
/*
* Copyright (c) 2007 David Gwynne <dlg@openbsd.org>
* Copyright (c) 2007 Ted Unangst <tedu@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/param.h>
#include <sys/systm.h>
#include <sys/malloc.h>
#include <sys/pool.h>
#include <sys/queue.h>
#include <sys/mutex.h>
#include <sys/kthread.h>
#include <sys/workq.h>
struct workq_task {
int wqt_flags;
workq_fn wqt_func;
void *wqt_arg1;
void *wqt_arg2;
SIMPLEQ_ENTRY(workq_task) wqt_entry;
};
struct workq {
int wq_flags;
#define WQ_F_RUNNING (1<<0)
int wq_running;
int wq_max;
const char *wq_name;
struct mutex wq_mtx;
SIMPLEQ_HEAD(, workq_task) wq_tasklist;
};
struct pool workq_task_pool;
struct workq workq_syswq = {
WQ_F_RUNNING,
0,
1,
"syswq"
};
void workq_init(void); /* called in init_main.c */
void workq_init_syswq(void *);
void workq_create_thread(void *);
struct workq_task * workq_next_task(struct workq *);
void workq_thread(void *);
void
workq_init(void)
{
pool_init(&workq_task_pool, sizeof(struct workq_task), 0, 0,
0, "wqtasks", NULL);
pool_setipl(&workq_task_pool, IPL_HIGH);
mtx_init(&workq_syswq.wq_mtx, IPL_HIGH);
SIMPLEQ_INIT(&workq_syswq.wq_tasklist);
kthread_create_deferred(workq_init_syswq, NULL);
}
void
workq_init_syswq(void *arg)
{
mtx_enter(&workq_syswq.wq_mtx);
if (kthread_create(workq_thread, &workq_syswq, NULL, "%s",
workq_syswq.wq_name) != 0)
panic("unable to create system work queue thread");
workq_syswq.wq_running++;
mtx_leave(&workq_syswq.wq_mtx);
}
struct workq *
workq_create(const char *name, int maxqs, int ipl)
{
struct workq *wq;
wq = malloc(sizeof(*wq), M_DEVBUF, M_NOWAIT);
if (wq == NULL)
return (NULL);
wq->wq_flags = WQ_F_RUNNING;
wq->wq_running = 0;
wq->wq_max = maxqs;
wq->wq_name = name;
mtx_init(&wq->wq_mtx, ipl);
SIMPLEQ_INIT(&wq->wq_tasklist);
/* try to create a thread to guarantee that tasks will be serviced */
kthread_create_deferred(workq_create_thread, wq);
return (wq);
}
void
workq_destroy(struct workq *wq)
{
mtx_enter(&wq->wq_mtx);
wq->wq_flags &= ~WQ_F_RUNNING;
while (wq->wq_running != 0) {
wakeup(wq);
msleep(&wq->wq_running, &wq->wq_mtx, PWAIT, "wqdestroy", 0);
}
mtx_leave(&wq->wq_mtx);
free(wq, M_DEVBUF);
}
int
workq_add_task(struct workq *wq, int flags, workq_fn func, void *a1, void *a2)
{
struct workq_task *wqt;
if (wq == NULL)
wq = &workq_syswq;
wqt = pool_get(&workq_task_pool, (flags & WQ_WAITOK) ?
PR_WAITOK : PR_NOWAIT);
if (!wqt)
return (ENOMEM);
wqt->wqt_flags = flags;
wqt->wqt_func = func;
wqt->wqt_arg1 = a1;
wqt->wqt_arg2 = a2;
mtx_enter(&wq->wq_mtx);
SIMPLEQ_INSERT_TAIL(&wq->wq_tasklist, wqt, wqt_entry);
mtx_leave(&wq->wq_mtx);
wakeup_one(wq);
return (0);
}
void
workq_create_thread(void *arg)
{
struct workq *wq = arg;
int i;
int rv;
mtx_enter(&wq->wq_mtx);
for (i = wq->wq_running; i < wq->wq_max; i++) {
rv = kthread_create(workq_thread, wq, NULL, "%s", wq->wq_name);
if (rv != 0) {
printf("unable to create thread for \"%s\" workq\n",
wq->wq_name);
break;
}
wq->wq_running++;
}
mtx_leave(&wq->wq_mtx);
}
struct workq_task *
workq_next_task(struct workq *wq)
{
struct workq_task *wqt;
mtx_enter(&wq->wq_mtx);
for (;;) {
wqt = SIMPLEQ_FIRST(&wq->wq_tasklist);
if (wqt != NULL) {
SIMPLEQ_REMOVE_HEAD(&wq->wq_tasklist, wqt_entry);
break;
} else if (wq->wq_flags & WQ_F_RUNNING)
msleep(wq, &wq->wq_mtx, PWAIT, "bored", 0);
else {
if (--wq->wq_running == 0)
wakeup_one(&wq->wq_running);
break;
}
}
mtx_leave(&wq->wq_mtx);
return (wqt);
}
void
workq_thread(void *arg)
{
struct workq *wq = arg;
struct workq_task *wqt;
while ((wqt = workq_next_task(wq)) != NULL) {
wqt->wqt_func(wqt->wqt_arg1, wqt->wqt_arg2);
pool_put(&workq_task_pool, wqt);
}
kthread_exit(0);
}
|
