Loading...
1/*
2 * Copyright (C) 2007 Oracle. All rights reserved.
3 * Copyright (C) 2014 Fujitsu. All rights reserved.
4 *
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public
7 * License v2 as published by the Free Software Foundation.
8 *
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * General Public License for more details.
13 *
14 * You should have received a copy of the GNU General Public
15 * License along with this program; if not, write to the
16 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
17 * Boston, MA 021110-1307, USA.
18 */
19
20#include <linux/kthread.h>
21#include <linux/slab.h>
22#include <linux/list.h>
23#include <linux/spinlock.h>
24#include <linux/freezer.h>
25#include "async-thread.h"
26#include "ctree.h"
27
28#define WORK_DONE_BIT 0
29#define WORK_ORDER_DONE_BIT 1
30#define WORK_HIGH_PRIO_BIT 2
31
32#define NO_THRESHOLD (-1)
33#define DFT_THRESHOLD (32)
34
35struct __btrfs_workqueue {
36 struct workqueue_struct *normal_wq;
37
38 /* File system this workqueue services */
39 struct btrfs_fs_info *fs_info;
40
41 /* List head pointing to ordered work list */
42 struct list_head ordered_list;
43
44 /* Spinlock for ordered_list */
45 spinlock_t list_lock;
46
47 /* Thresholding related variants */
48 atomic_t pending;
49
50 /* Up limit of concurrency workers */
51 int limit_active;
52
53 /* Current number of concurrency workers */
54 int current_active;
55
56 /* Threshold to change current_active */
57 int thresh;
58 unsigned int count;
59 spinlock_t thres_lock;
60};
61
62struct btrfs_workqueue {
63 struct __btrfs_workqueue *normal;
64 struct __btrfs_workqueue *high;
65};
66
67static void normal_work_helper(struct btrfs_work *work);
68
69#define BTRFS_WORK_HELPER(name) \
70void btrfs_##name(struct work_struct *arg) \
71{ \
72 struct btrfs_work *work = container_of(arg, struct btrfs_work, \
73 normal_work); \
74 normal_work_helper(work); \
75}
76
77struct btrfs_fs_info *
78btrfs_workqueue_owner(struct __btrfs_workqueue *wq)
79{
80 return wq->fs_info;
81}
82
83struct btrfs_fs_info *
84btrfs_work_owner(struct btrfs_work *work)
85{
86 return work->wq->fs_info;
87}
88
89bool btrfs_workqueue_normal_congested(struct btrfs_workqueue *wq)
90{
91 /*
92 * We could compare wq->normal->pending with num_online_cpus()
93 * to support "thresh == NO_THRESHOLD" case, but it requires
94 * moving up atomic_inc/dec in thresh_queue/exec_hook. Let's
95 * postpone it until someone needs the support of that case.
96 */
97 if (wq->normal->thresh == NO_THRESHOLD)
98 return false;
99
100 return atomic_read(&wq->normal->pending) > wq->normal->thresh * 2;
101}
102
103BTRFS_WORK_HELPER(worker_helper);
104BTRFS_WORK_HELPER(delalloc_helper);
105BTRFS_WORK_HELPER(flush_delalloc_helper);
106BTRFS_WORK_HELPER(cache_helper);
107BTRFS_WORK_HELPER(submit_helper);
108BTRFS_WORK_HELPER(fixup_helper);
109BTRFS_WORK_HELPER(endio_helper);
110BTRFS_WORK_HELPER(endio_meta_helper);
111BTRFS_WORK_HELPER(endio_meta_write_helper);
112BTRFS_WORK_HELPER(endio_raid56_helper);
113BTRFS_WORK_HELPER(endio_repair_helper);
114BTRFS_WORK_HELPER(rmw_helper);
115BTRFS_WORK_HELPER(endio_write_helper);
116BTRFS_WORK_HELPER(freespace_write_helper);
117BTRFS_WORK_HELPER(delayed_meta_helper);
118BTRFS_WORK_HELPER(readahead_helper);
119BTRFS_WORK_HELPER(qgroup_rescan_helper);
120BTRFS_WORK_HELPER(extent_refs_helper);
121BTRFS_WORK_HELPER(scrub_helper);
122BTRFS_WORK_HELPER(scrubwrc_helper);
123BTRFS_WORK_HELPER(scrubnc_helper);
124BTRFS_WORK_HELPER(scrubparity_helper);
125
126static struct __btrfs_workqueue *
127__btrfs_alloc_workqueue(struct btrfs_fs_info *fs_info, const char *name,
128 unsigned int flags, int limit_active, int thresh)
129{
130 struct __btrfs_workqueue *ret = kzalloc(sizeof(*ret), GFP_KERNEL);
131
132 if (!ret)
133 return NULL;
134
135 ret->fs_info = fs_info;
136 ret->limit_active = limit_active;
137 atomic_set(&ret->pending, 0);
138 if (thresh == 0)
139 thresh = DFT_THRESHOLD;
140 /* For low threshold, disabling threshold is a better choice */
141 if (thresh < DFT_THRESHOLD) {
142 ret->current_active = limit_active;
143 ret->thresh = NO_THRESHOLD;
144 } else {
145 /*
146 * For threshold-able wq, let its concurrency grow on demand.
147 * Use minimal max_active at alloc time to reduce resource
148 * usage.
149 */
150 ret->current_active = 1;
151 ret->thresh = thresh;
152 }
153
154 if (flags & WQ_HIGHPRI)
155 ret->normal_wq = alloc_workqueue("%s-%s-high", flags,
156 ret->current_active, "btrfs",
157 name);
158 else
159 ret->normal_wq = alloc_workqueue("%s-%s", flags,
160 ret->current_active, "btrfs",
161 name);
162 if (!ret->normal_wq) {
163 kfree(ret);
164 return NULL;
165 }
166
167 INIT_LIST_HEAD(&ret->ordered_list);
168 spin_lock_init(&ret->list_lock);
169 spin_lock_init(&ret->thres_lock);
170 trace_btrfs_workqueue_alloc(ret, name, flags & WQ_HIGHPRI);
171 return ret;
172}
173
174static inline void
175__btrfs_destroy_workqueue(struct __btrfs_workqueue *wq);
176
177struct btrfs_workqueue *btrfs_alloc_workqueue(struct btrfs_fs_info *fs_info,
178 const char *name,
179 unsigned int flags,
180 int limit_active,
181 int thresh)
182{
183 struct btrfs_workqueue *ret = kzalloc(sizeof(*ret), GFP_KERNEL);
184
185 if (!ret)
186 return NULL;
187
188 ret->normal = __btrfs_alloc_workqueue(fs_info, name,
189 flags & ~WQ_HIGHPRI,
190 limit_active, thresh);
191 if (!ret->normal) {
192 kfree(ret);
193 return NULL;
194 }
195
196 if (flags & WQ_HIGHPRI) {
197 ret->high = __btrfs_alloc_workqueue(fs_info, name, flags,
198 limit_active, thresh);
199 if (!ret->high) {
200 __btrfs_destroy_workqueue(ret->normal);
201 kfree(ret);
202 return NULL;
203 }
204 }
205 return ret;
206}
207
208/*
209 * Hook for threshold which will be called in btrfs_queue_work.
210 * This hook WILL be called in IRQ handler context,
211 * so workqueue_set_max_active MUST NOT be called in this hook
212 */
213static inline void thresh_queue_hook(struct __btrfs_workqueue *wq)
214{
215 if (wq->thresh == NO_THRESHOLD)
216 return;
217 atomic_inc(&wq->pending);
218}
219
220/*
221 * Hook for threshold which will be called before executing the work,
222 * This hook is called in kthread content.
223 * So workqueue_set_max_active is called here.
224 */
225static inline void thresh_exec_hook(struct __btrfs_workqueue *wq)
226{
227 int new_current_active;
228 long pending;
229 int need_change = 0;
230
231 if (wq->thresh == NO_THRESHOLD)
232 return;
233
234 atomic_dec(&wq->pending);
235 spin_lock(&wq->thres_lock);
236 /*
237 * Use wq->count to limit the calling frequency of
238 * workqueue_set_max_active.
239 */
240 wq->count++;
241 wq->count %= (wq->thresh / 4);
242 if (!wq->count)
243 goto out;
244 new_current_active = wq->current_active;
245
246 /*
247 * pending may be changed later, but it's OK since we really
248 * don't need it so accurate to calculate new_max_active.
249 */
250 pending = atomic_read(&wq->pending);
251 if (pending > wq->thresh)
252 new_current_active++;
253 if (pending < wq->thresh / 2)
254 new_current_active--;
255 new_current_active = clamp_val(new_current_active, 1, wq->limit_active);
256 if (new_current_active != wq->current_active) {
257 need_change = 1;
258 wq->current_active = new_current_active;
259 }
260out:
261 spin_unlock(&wq->thres_lock);
262
263 if (need_change) {
264 workqueue_set_max_active(wq->normal_wq, wq->current_active);
265 }
266}
267
268static void run_ordered_work(struct __btrfs_workqueue *wq)
269{
270 struct list_head *list = &wq->ordered_list;
271 struct btrfs_work *work;
272 spinlock_t *lock = &wq->list_lock;
273 unsigned long flags;
274
275 while (1) {
276 void *wtag;
277
278 spin_lock_irqsave(lock, flags);
279 if (list_empty(list))
280 break;
281 work = list_entry(list->next, struct btrfs_work,
282 ordered_list);
283 if (!test_bit(WORK_DONE_BIT, &work->flags))
284 break;
285
286 /*
287 * we are going to call the ordered done function, but
288 * we leave the work item on the list as a barrier so
289 * that later work items that are done don't have their
290 * functions called before this one returns
291 */
292 if (test_and_set_bit(WORK_ORDER_DONE_BIT, &work->flags))
293 break;
294 trace_btrfs_ordered_sched(work);
295 spin_unlock_irqrestore(lock, flags);
296 work->ordered_func(work);
297
298 /* now take the lock again and drop our item from the list */
299 spin_lock_irqsave(lock, flags);
300 list_del(&work->ordered_list);
301 spin_unlock_irqrestore(lock, flags);
302
303 /*
304 * We don't want to call the ordered free functions with the
305 * lock held though. Save the work as tag for the trace event,
306 * because the callback could free the structure.
307 */
308 wtag = work;
309 work->ordered_free(work);
310 trace_btrfs_all_work_done(wq->fs_info, wtag);
311 }
312 spin_unlock_irqrestore(lock, flags);
313}
314
315static void normal_work_helper(struct btrfs_work *work)
316{
317 struct __btrfs_workqueue *wq;
318 void *wtag;
319 int need_order = 0;
320
321 /*
322 * We should not touch things inside work in the following cases:
323 * 1) after work->func() if it has no ordered_free
324 * Since the struct is freed in work->func().
325 * 2) after setting WORK_DONE_BIT
326 * The work may be freed in other threads almost instantly.
327 * So we save the needed things here.
328 */
329 if (work->ordered_func)
330 need_order = 1;
331 wq = work->wq;
332 /* Safe for tracepoints in case work gets freed by the callback */
333 wtag = work;
334
335 trace_btrfs_work_sched(work);
336 thresh_exec_hook(wq);
337 work->func(work);
338 if (need_order) {
339 set_bit(WORK_DONE_BIT, &work->flags);
340 run_ordered_work(wq);
341 }
342 if (!need_order)
343 trace_btrfs_all_work_done(wq->fs_info, wtag);
344}
345
346void btrfs_init_work(struct btrfs_work *work, btrfs_work_func_t uniq_func,
347 btrfs_func_t func,
348 btrfs_func_t ordered_func,
349 btrfs_func_t ordered_free)
350{
351 work->func = func;
352 work->ordered_func = ordered_func;
353 work->ordered_free = ordered_free;
354 INIT_WORK(&work->normal_work, uniq_func);
355 INIT_LIST_HEAD(&work->ordered_list);
356 work->flags = 0;
357}
358
359static inline void __btrfs_queue_work(struct __btrfs_workqueue *wq,
360 struct btrfs_work *work)
361{
362 unsigned long flags;
363
364 work->wq = wq;
365 thresh_queue_hook(wq);
366 if (work->ordered_func) {
367 spin_lock_irqsave(&wq->list_lock, flags);
368 list_add_tail(&work->ordered_list, &wq->ordered_list);
369 spin_unlock_irqrestore(&wq->list_lock, flags);
370 }
371 trace_btrfs_work_queued(work);
372 queue_work(wq->normal_wq, &work->normal_work);
373}
374
375void btrfs_queue_work(struct btrfs_workqueue *wq,
376 struct btrfs_work *work)
377{
378 struct __btrfs_workqueue *dest_wq;
379
380 if (test_bit(WORK_HIGH_PRIO_BIT, &work->flags) && wq->high)
381 dest_wq = wq->high;
382 else
383 dest_wq = wq->normal;
384 __btrfs_queue_work(dest_wq, work);
385}
386
387static inline void
388__btrfs_destroy_workqueue(struct __btrfs_workqueue *wq)
389{
390 destroy_workqueue(wq->normal_wq);
391 trace_btrfs_workqueue_destroy(wq);
392 kfree(wq);
393}
394
395void btrfs_destroy_workqueue(struct btrfs_workqueue *wq)
396{
397 if (!wq)
398 return;
399 if (wq->high)
400 __btrfs_destroy_workqueue(wq->high);
401 __btrfs_destroy_workqueue(wq->normal);
402 kfree(wq);
403}
404
405void btrfs_workqueue_set_max(struct btrfs_workqueue *wq, int limit_active)
406{
407 if (!wq)
408 return;
409 wq->normal->limit_active = limit_active;
410 if (wq->high)
411 wq->high->limit_active = limit_active;
412}
413
414void btrfs_set_work_high_priority(struct btrfs_work *work)
415{
416 set_bit(WORK_HIGH_PRIO_BIT, &work->flags);
417}
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (C) 2007 Oracle. All rights reserved.
4 * Copyright (C) 2014 Fujitsu. All rights reserved.
5 */
6
7#include <linux/kthread.h>
8#include <linux/slab.h>
9#include <linux/list.h>
10#include <linux/spinlock.h>
11#include <linux/freezer.h>
12#include "async-thread.h"
13#include "ctree.h"
14
15enum {
16 WORK_DONE_BIT,
17 WORK_ORDER_DONE_BIT,
18 WORK_HIGH_PRIO_BIT,
19};
20
21#define NO_THRESHOLD (-1)
22#define DFT_THRESHOLD (32)
23
24struct __btrfs_workqueue {
25 struct workqueue_struct *normal_wq;
26
27 /* File system this workqueue services */
28 struct btrfs_fs_info *fs_info;
29
30 /* List head pointing to ordered work list */
31 struct list_head ordered_list;
32
33 /* Spinlock for ordered_list */
34 spinlock_t list_lock;
35
36 /* Thresholding related variants */
37 atomic_t pending;
38
39 /* Up limit of concurrency workers */
40 int limit_active;
41
42 /* Current number of concurrency workers */
43 int current_active;
44
45 /* Threshold to change current_active */
46 int thresh;
47 unsigned int count;
48 spinlock_t thres_lock;
49};
50
51struct btrfs_workqueue {
52 struct __btrfs_workqueue *normal;
53 struct __btrfs_workqueue *high;
54};
55
56struct btrfs_fs_info * __pure btrfs_workqueue_owner(const struct __btrfs_workqueue *wq)
57{
58 return wq->fs_info;
59}
60
61struct btrfs_fs_info * __pure btrfs_work_owner(const struct btrfs_work *work)
62{
63 return work->wq->fs_info;
64}
65
66bool btrfs_workqueue_normal_congested(const struct btrfs_workqueue *wq)
67{
68 /*
69 * We could compare wq->normal->pending with num_online_cpus()
70 * to support "thresh == NO_THRESHOLD" case, but it requires
71 * moving up atomic_inc/dec in thresh_queue/exec_hook. Let's
72 * postpone it until someone needs the support of that case.
73 */
74 if (wq->normal->thresh == NO_THRESHOLD)
75 return false;
76
77 return atomic_read(&wq->normal->pending) > wq->normal->thresh * 2;
78}
79
80static struct __btrfs_workqueue *
81__btrfs_alloc_workqueue(struct btrfs_fs_info *fs_info, const char *name,
82 unsigned int flags, int limit_active, int thresh)
83{
84 struct __btrfs_workqueue *ret = kzalloc(sizeof(*ret), GFP_KERNEL);
85
86 if (!ret)
87 return NULL;
88
89 ret->fs_info = fs_info;
90 ret->limit_active = limit_active;
91 atomic_set(&ret->pending, 0);
92 if (thresh == 0)
93 thresh = DFT_THRESHOLD;
94 /* For low threshold, disabling threshold is a better choice */
95 if (thresh < DFT_THRESHOLD) {
96 ret->current_active = limit_active;
97 ret->thresh = NO_THRESHOLD;
98 } else {
99 /*
100 * For threshold-able wq, let its concurrency grow on demand.
101 * Use minimal max_active at alloc time to reduce resource
102 * usage.
103 */
104 ret->current_active = 1;
105 ret->thresh = thresh;
106 }
107
108 if (flags & WQ_HIGHPRI)
109 ret->normal_wq = alloc_workqueue("btrfs-%s-high", flags,
110 ret->current_active, name);
111 else
112 ret->normal_wq = alloc_workqueue("btrfs-%s", flags,
113 ret->current_active, name);
114 if (!ret->normal_wq) {
115 kfree(ret);
116 return NULL;
117 }
118
119 INIT_LIST_HEAD(&ret->ordered_list);
120 spin_lock_init(&ret->list_lock);
121 spin_lock_init(&ret->thres_lock);
122 trace_btrfs_workqueue_alloc(ret, name, flags & WQ_HIGHPRI);
123 return ret;
124}
125
126static inline void
127__btrfs_destroy_workqueue(struct __btrfs_workqueue *wq);
128
129struct btrfs_workqueue *btrfs_alloc_workqueue(struct btrfs_fs_info *fs_info,
130 const char *name,
131 unsigned int flags,
132 int limit_active,
133 int thresh)
134{
135 struct btrfs_workqueue *ret = kzalloc(sizeof(*ret), GFP_KERNEL);
136
137 if (!ret)
138 return NULL;
139
140 ret->normal = __btrfs_alloc_workqueue(fs_info, name,
141 flags & ~WQ_HIGHPRI,
142 limit_active, thresh);
143 if (!ret->normal) {
144 kfree(ret);
145 return NULL;
146 }
147
148 if (flags & WQ_HIGHPRI) {
149 ret->high = __btrfs_alloc_workqueue(fs_info, name, flags,
150 limit_active, thresh);
151 if (!ret->high) {
152 __btrfs_destroy_workqueue(ret->normal);
153 kfree(ret);
154 return NULL;
155 }
156 }
157 return ret;
158}
159
160/*
161 * Hook for threshold which will be called in btrfs_queue_work.
162 * This hook WILL be called in IRQ handler context,
163 * so workqueue_set_max_active MUST NOT be called in this hook
164 */
165static inline void thresh_queue_hook(struct __btrfs_workqueue *wq)
166{
167 if (wq->thresh == NO_THRESHOLD)
168 return;
169 atomic_inc(&wq->pending);
170}
171
172/*
173 * Hook for threshold which will be called before executing the work,
174 * This hook is called in kthread content.
175 * So workqueue_set_max_active is called here.
176 */
177static inline void thresh_exec_hook(struct __btrfs_workqueue *wq)
178{
179 int new_current_active;
180 long pending;
181 int need_change = 0;
182
183 if (wq->thresh == NO_THRESHOLD)
184 return;
185
186 atomic_dec(&wq->pending);
187 spin_lock(&wq->thres_lock);
188 /*
189 * Use wq->count to limit the calling frequency of
190 * workqueue_set_max_active.
191 */
192 wq->count++;
193 wq->count %= (wq->thresh / 4);
194 if (!wq->count)
195 goto out;
196 new_current_active = wq->current_active;
197
198 /*
199 * pending may be changed later, but it's OK since we really
200 * don't need it so accurate to calculate new_max_active.
201 */
202 pending = atomic_read(&wq->pending);
203 if (pending > wq->thresh)
204 new_current_active++;
205 if (pending < wq->thresh / 2)
206 new_current_active--;
207 new_current_active = clamp_val(new_current_active, 1, wq->limit_active);
208 if (new_current_active != wq->current_active) {
209 need_change = 1;
210 wq->current_active = new_current_active;
211 }
212out:
213 spin_unlock(&wq->thres_lock);
214
215 if (need_change) {
216 workqueue_set_max_active(wq->normal_wq, wq->current_active);
217 }
218}
219
220static void run_ordered_work(struct __btrfs_workqueue *wq,
221 struct btrfs_work *self)
222{
223 struct list_head *list = &wq->ordered_list;
224 struct btrfs_work *work;
225 spinlock_t *lock = &wq->list_lock;
226 unsigned long flags;
227 bool free_self = false;
228
229 while (1) {
230 spin_lock_irqsave(lock, flags);
231 if (list_empty(list))
232 break;
233 work = list_entry(list->next, struct btrfs_work,
234 ordered_list);
235 if (!test_bit(WORK_DONE_BIT, &work->flags))
236 break;
237
238 /*
239 * we are going to call the ordered done function, but
240 * we leave the work item on the list as a barrier so
241 * that later work items that are done don't have their
242 * functions called before this one returns
243 */
244 if (test_and_set_bit(WORK_ORDER_DONE_BIT, &work->flags))
245 break;
246 trace_btrfs_ordered_sched(work);
247 spin_unlock_irqrestore(lock, flags);
248 work->ordered_func(work);
249
250 /* now take the lock again and drop our item from the list */
251 spin_lock_irqsave(lock, flags);
252 list_del(&work->ordered_list);
253 spin_unlock_irqrestore(lock, flags);
254
255 if (work == self) {
256 /*
257 * This is the work item that the worker is currently
258 * executing.
259 *
260 * The kernel workqueue code guarantees non-reentrancy
261 * of work items. I.e., if a work item with the same
262 * address and work function is queued twice, the second
263 * execution is blocked until the first one finishes. A
264 * work item may be freed and recycled with the same
265 * work function; the workqueue code assumes that the
266 * original work item cannot depend on the recycled work
267 * item in that case (see find_worker_executing_work()).
268 *
269 * Note that different types of Btrfs work can depend on
270 * each other, and one type of work on one Btrfs
271 * filesystem may even depend on the same type of work
272 * on another Btrfs filesystem via, e.g., a loop device.
273 * Therefore, we must not allow the current work item to
274 * be recycled until we are really done, otherwise we
275 * break the above assumption and can deadlock.
276 */
277 free_self = true;
278 } else {
279 /*
280 * We don't want to call the ordered free functions with
281 * the lock held.
282 */
283 work->ordered_free(work);
284 /* NB: work must not be dereferenced past this point. */
285 trace_btrfs_all_work_done(wq->fs_info, work);
286 }
287 }
288 spin_unlock_irqrestore(lock, flags);
289
290 if (free_self) {
291 self->ordered_free(self);
292 /* NB: self must not be dereferenced past this point. */
293 trace_btrfs_all_work_done(wq->fs_info, self);
294 }
295}
296
297static void btrfs_work_helper(struct work_struct *normal_work)
298{
299 struct btrfs_work *work = container_of(normal_work, struct btrfs_work,
300 normal_work);
301 struct __btrfs_workqueue *wq;
302 int need_order = 0;
303
304 /*
305 * We should not touch things inside work in the following cases:
306 * 1) after work->func() if it has no ordered_free
307 * Since the struct is freed in work->func().
308 * 2) after setting WORK_DONE_BIT
309 * The work may be freed in other threads almost instantly.
310 * So we save the needed things here.
311 */
312 if (work->ordered_func)
313 need_order = 1;
314 wq = work->wq;
315
316 trace_btrfs_work_sched(work);
317 thresh_exec_hook(wq);
318 work->func(work);
319 if (need_order) {
320 set_bit(WORK_DONE_BIT, &work->flags);
321 run_ordered_work(wq, work);
322 } else {
323 /* NB: work must not be dereferenced past this point. */
324 trace_btrfs_all_work_done(wq->fs_info, work);
325 }
326}
327
328void btrfs_init_work(struct btrfs_work *work, btrfs_func_t func,
329 btrfs_func_t ordered_func, btrfs_func_t ordered_free)
330{
331 work->func = func;
332 work->ordered_func = ordered_func;
333 work->ordered_free = ordered_free;
334 INIT_WORK(&work->normal_work, btrfs_work_helper);
335 INIT_LIST_HEAD(&work->ordered_list);
336 work->flags = 0;
337}
338
339static inline void __btrfs_queue_work(struct __btrfs_workqueue *wq,
340 struct btrfs_work *work)
341{
342 unsigned long flags;
343
344 work->wq = wq;
345 thresh_queue_hook(wq);
346 if (work->ordered_func) {
347 spin_lock_irqsave(&wq->list_lock, flags);
348 list_add_tail(&work->ordered_list, &wq->ordered_list);
349 spin_unlock_irqrestore(&wq->list_lock, flags);
350 }
351 trace_btrfs_work_queued(work);
352 queue_work(wq->normal_wq, &work->normal_work);
353}
354
355void btrfs_queue_work(struct btrfs_workqueue *wq,
356 struct btrfs_work *work)
357{
358 struct __btrfs_workqueue *dest_wq;
359
360 if (test_bit(WORK_HIGH_PRIO_BIT, &work->flags) && wq->high)
361 dest_wq = wq->high;
362 else
363 dest_wq = wq->normal;
364 __btrfs_queue_work(dest_wq, work);
365}
366
367static inline void
368__btrfs_destroy_workqueue(struct __btrfs_workqueue *wq)
369{
370 destroy_workqueue(wq->normal_wq);
371 trace_btrfs_workqueue_destroy(wq);
372 kfree(wq);
373}
374
375void btrfs_destroy_workqueue(struct btrfs_workqueue *wq)
376{
377 if (!wq)
378 return;
379 if (wq->high)
380 __btrfs_destroy_workqueue(wq->high);
381 __btrfs_destroy_workqueue(wq->normal);
382 kfree(wq);
383}
384
385void btrfs_workqueue_set_max(struct btrfs_workqueue *wq, int limit_active)
386{
387 if (!wq)
388 return;
389 wq->normal->limit_active = limit_active;
390 if (wq->high)
391 wq->high->limit_active = limit_active;
392}
393
394void btrfs_set_work_high_priority(struct btrfs_work *work)
395{
396 set_bit(WORK_HIGH_PRIO_BIT, &work->flags);
397}
398
399void btrfs_flush_workqueue(struct btrfs_workqueue *wq)
400{
401 if (wq->high)
402 flush_workqueue(wq->high->normal_wq);
403
404 flush_workqueue(wq->normal->normal_wq);
405}