blob: 5fb60ea7eee2b2c28e067d11b54c2fad7127c7d8 [file] [log] [blame]
Chris Mason8b712842008-06-11 16:50:36 -04001/*
2 * Copyright (C) 2007 Oracle. All rights reserved.
Qu Wenruo08a9ff32014-02-28 10:46:03 +08003 * Copyright (C) 2014 Fujitsu. All rights reserved.
Chris Mason8b712842008-06-11 16:50:36 -04004 *
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>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090021#include <linux/slab.h>
Chris Mason8b712842008-06-11 16:50:36 -040022#include <linux/list.h>
23#include <linux/spinlock.h>
Chris Masonb51912c2009-02-04 09:23:24 -050024#include <linux/freezer.h>
Chris Mason8b712842008-06-11 16:50:36 -040025#include "async-thread.h"
Qu Wenruo52483bc2014-03-06 04:19:50 +000026#include "ctree.h"
Chris Mason8b712842008-06-11 16:50:36 -040027
Qu Wenruoa046e9c2014-02-28 10:46:18 +080028#define WORK_DONE_BIT 0
29#define WORK_ORDER_DONE_BIT 1
30#define WORK_HIGH_PRIO_BIT 2
Chris Mason4a69a412008-11-06 22:03:00 -050031
Qu Wenruo0bd92892014-02-28 10:46:05 +080032#define NO_THRESHOLD (-1)
33#define DFT_THRESHOLD (32)
34
Qu Wenruod458b052014-02-28 10:46:19 +080035struct __btrfs_workqueue {
Qu Wenruo08a9ff32014-02-28 10:46:03 +080036 struct workqueue_struct *normal_wq;
37 /* List head pointing to ordered work list */
38 struct list_head ordered_list;
39
40 /* Spinlock for ordered_list */
41 spinlock_t list_lock;
Qu Wenruo0bd92892014-02-28 10:46:05 +080042
43 /* Thresholding related variants */
44 atomic_t pending;
Qu Wenruoc6dd6ea2015-08-20 09:30:39 +080045
46 /* Up limit of concurrency workers */
47 int limit_active;
48
49 /* Current number of concurrency workers */
50 int current_active;
51
52 /* Threshold to change current_active */
Qu Wenruo0bd92892014-02-28 10:46:05 +080053 int thresh;
54 unsigned int count;
55 spinlock_t thres_lock;
Qu Wenruo08a9ff32014-02-28 10:46:03 +080056};
57
Qu Wenruod458b052014-02-28 10:46:19 +080058struct btrfs_workqueue {
59 struct __btrfs_workqueue *normal;
60 struct __btrfs_workqueue *high;
Qu Wenruo1ca08972014-02-28 10:46:04 +080061};
62
Liu Bo9e0af232014-08-15 23:36:53 +080063static void normal_work_helper(struct btrfs_work *work);
64
65#define BTRFS_WORK_HELPER(name) \
66void btrfs_##name(struct work_struct *arg) \
67{ \
68 struct btrfs_work *work = container_of(arg, struct btrfs_work, \
69 normal_work); \
70 normal_work_helper(work); \
71}
72
73BTRFS_WORK_HELPER(worker_helper);
74BTRFS_WORK_HELPER(delalloc_helper);
75BTRFS_WORK_HELPER(flush_delalloc_helper);
76BTRFS_WORK_HELPER(cache_helper);
77BTRFS_WORK_HELPER(submit_helper);
78BTRFS_WORK_HELPER(fixup_helper);
79BTRFS_WORK_HELPER(endio_helper);
80BTRFS_WORK_HELPER(endio_meta_helper);
81BTRFS_WORK_HELPER(endio_meta_write_helper);
82BTRFS_WORK_HELPER(endio_raid56_helper);
Miao Xie8b110e32014-09-12 18:44:03 +080083BTRFS_WORK_HELPER(endio_repair_helper);
Liu Bo9e0af232014-08-15 23:36:53 +080084BTRFS_WORK_HELPER(rmw_helper);
85BTRFS_WORK_HELPER(endio_write_helper);
86BTRFS_WORK_HELPER(freespace_write_helper);
87BTRFS_WORK_HELPER(delayed_meta_helper);
88BTRFS_WORK_HELPER(readahead_helper);
89BTRFS_WORK_HELPER(qgroup_rescan_helper);
90BTRFS_WORK_HELPER(extent_refs_helper);
91BTRFS_WORK_HELPER(scrub_helper);
92BTRFS_WORK_HELPER(scrubwrc_helper);
93BTRFS_WORK_HELPER(scrubnc_helper);
Zhao Lei20b2e302015-06-04 20:09:15 +080094BTRFS_WORK_HELPER(scrubparity_helper);
Liu Bo9e0af232014-08-15 23:36:53 +080095
96static struct __btrfs_workqueue *
Qu Wenruoc6dd6ea2015-08-20 09:30:39 +080097__btrfs_alloc_workqueue(const char *name, unsigned int flags, int limit_active,
Qu Wenruoc3a46892014-03-12 08:05:33 +000098 int thresh)
Qu Wenruo08a9ff32014-02-28 10:46:03 +080099{
David Sterba61dd5ae2015-12-01 18:04:30 +0100100 struct __btrfs_workqueue *ret = kzalloc(sizeof(*ret), GFP_KERNEL);
Qu Wenruo08a9ff32014-02-28 10:46:03 +0800101
David Sterba5d99a9982014-09-29 19:20:37 +0200102 if (!ret)
Qu Wenruo08a9ff32014-02-28 10:46:03 +0800103 return NULL;
104
Qu Wenruoc6dd6ea2015-08-20 09:30:39 +0800105 ret->limit_active = limit_active;
Qu Wenruo0bd92892014-02-28 10:46:05 +0800106 atomic_set(&ret->pending, 0);
107 if (thresh == 0)
108 thresh = DFT_THRESHOLD;
109 /* For low threshold, disabling threshold is a better choice */
110 if (thresh < DFT_THRESHOLD) {
Qu Wenruoc6dd6ea2015-08-20 09:30:39 +0800111 ret->current_active = limit_active;
Qu Wenruo0bd92892014-02-28 10:46:05 +0800112 ret->thresh = NO_THRESHOLD;
113 } else {
Qu Wenruoc6dd6ea2015-08-20 09:30:39 +0800114 /*
115 * For threshold-able wq, let its concurrency grow on demand.
116 * Use minimal max_active at alloc time to reduce resource
117 * usage.
118 */
119 ret->current_active = 1;
Qu Wenruo0bd92892014-02-28 10:46:05 +0800120 ret->thresh = thresh;
121 }
122
Qu Wenruo1ca08972014-02-28 10:46:04 +0800123 if (flags & WQ_HIGHPRI)
124 ret->normal_wq = alloc_workqueue("%s-%s-high", flags,
Qu Wenruoc6dd6ea2015-08-20 09:30:39 +0800125 ret->current_active, "btrfs",
126 name);
Qu Wenruo1ca08972014-02-28 10:46:04 +0800127 else
128 ret->normal_wq = alloc_workqueue("%s-%s", flags,
Qu Wenruoc6dd6ea2015-08-20 09:30:39 +0800129 ret->current_active, "btrfs",
Qu Wenruo0bd92892014-02-28 10:46:05 +0800130 name);
David Sterba5d99a9982014-09-29 19:20:37 +0200131 if (!ret->normal_wq) {
Qu Wenruo08a9ff32014-02-28 10:46:03 +0800132 kfree(ret);
133 return NULL;
134 }
135
136 INIT_LIST_HEAD(&ret->ordered_list);
137 spin_lock_init(&ret->list_lock);
Qu Wenruo0bd92892014-02-28 10:46:05 +0800138 spin_lock_init(&ret->thres_lock);
Qu Wenruoc3a46892014-03-12 08:05:33 +0000139 trace_btrfs_workqueue_alloc(ret, name, flags & WQ_HIGHPRI);
Qu Wenruo08a9ff32014-02-28 10:46:03 +0800140 return ret;
141}
142
Qu Wenruo1ca08972014-02-28 10:46:04 +0800143static inline void
Qu Wenruod458b052014-02-28 10:46:19 +0800144__btrfs_destroy_workqueue(struct __btrfs_workqueue *wq);
Qu Wenruo1ca08972014-02-28 10:46:04 +0800145
Qu Wenruoc3a46892014-03-12 08:05:33 +0000146struct btrfs_workqueue *btrfs_alloc_workqueue(const char *name,
David Sterba6f011052015-02-16 18:34:01 +0100147 unsigned int flags,
Qu Wenruoc6dd6ea2015-08-20 09:30:39 +0800148 int limit_active,
Qu Wenruod458b052014-02-28 10:46:19 +0800149 int thresh)
Qu Wenruo1ca08972014-02-28 10:46:04 +0800150{
David Sterba61dd5ae2015-12-01 18:04:30 +0100151 struct btrfs_workqueue *ret = kzalloc(sizeof(*ret), GFP_KERNEL);
Qu Wenruo1ca08972014-02-28 10:46:04 +0800152
David Sterba5d99a9982014-09-29 19:20:37 +0200153 if (!ret)
Qu Wenruo1ca08972014-02-28 10:46:04 +0800154 return NULL;
155
156 ret->normal = __btrfs_alloc_workqueue(name, flags & ~WQ_HIGHPRI,
Qu Wenruoc6dd6ea2015-08-20 09:30:39 +0800157 limit_active, thresh);
David Sterba5d99a9982014-09-29 19:20:37 +0200158 if (!ret->normal) {
Qu Wenruo1ca08972014-02-28 10:46:04 +0800159 kfree(ret);
160 return NULL;
161 }
162
163 if (flags & WQ_HIGHPRI) {
Qu Wenruoc6dd6ea2015-08-20 09:30:39 +0800164 ret->high = __btrfs_alloc_workqueue(name, flags, limit_active,
Qu Wenruo0bd92892014-02-28 10:46:05 +0800165 thresh);
David Sterba5d99a9982014-09-29 19:20:37 +0200166 if (!ret->high) {
Qu Wenruo1ca08972014-02-28 10:46:04 +0800167 __btrfs_destroy_workqueue(ret->normal);
168 kfree(ret);
169 return NULL;
170 }
171 }
172 return ret;
173}
174
Qu Wenruo0bd92892014-02-28 10:46:05 +0800175/*
176 * Hook for threshold which will be called in btrfs_queue_work.
177 * This hook WILL be called in IRQ handler context,
178 * so workqueue_set_max_active MUST NOT be called in this hook
179 */
Qu Wenruod458b052014-02-28 10:46:19 +0800180static inline void thresh_queue_hook(struct __btrfs_workqueue *wq)
Qu Wenruo0bd92892014-02-28 10:46:05 +0800181{
182 if (wq->thresh == NO_THRESHOLD)
183 return;
184 atomic_inc(&wq->pending);
185}
186
187/*
188 * Hook for threshold which will be called before executing the work,
189 * This hook is called in kthread content.
190 * So workqueue_set_max_active is called here.
191 */
Qu Wenruod458b052014-02-28 10:46:19 +0800192static inline void thresh_exec_hook(struct __btrfs_workqueue *wq)
Qu Wenruo0bd92892014-02-28 10:46:05 +0800193{
Qu Wenruoc6dd6ea2015-08-20 09:30:39 +0800194 int new_current_active;
Qu Wenruo0bd92892014-02-28 10:46:05 +0800195 long pending;
196 int need_change = 0;
197
198 if (wq->thresh == NO_THRESHOLD)
199 return;
200
201 atomic_dec(&wq->pending);
202 spin_lock(&wq->thres_lock);
203 /*
204 * Use wq->count to limit the calling frequency of
205 * workqueue_set_max_active.
206 */
207 wq->count++;
208 wq->count %= (wq->thresh / 4);
209 if (!wq->count)
210 goto out;
Qu Wenruoc6dd6ea2015-08-20 09:30:39 +0800211 new_current_active = wq->current_active;
Qu Wenruo0bd92892014-02-28 10:46:05 +0800212
213 /*
214 * pending may be changed later, but it's OK since we really
215 * don't need it so accurate to calculate new_max_active.
216 */
217 pending = atomic_read(&wq->pending);
218 if (pending > wq->thresh)
Qu Wenruoc6dd6ea2015-08-20 09:30:39 +0800219 new_current_active++;
Qu Wenruo0bd92892014-02-28 10:46:05 +0800220 if (pending < wq->thresh / 2)
Qu Wenruoc6dd6ea2015-08-20 09:30:39 +0800221 new_current_active--;
222 new_current_active = clamp_val(new_current_active, 1, wq->limit_active);
223 if (new_current_active != wq->current_active) {
Qu Wenruo0bd92892014-02-28 10:46:05 +0800224 need_change = 1;
Qu Wenruoc6dd6ea2015-08-20 09:30:39 +0800225 wq->current_active = new_current_active;
Qu Wenruo0bd92892014-02-28 10:46:05 +0800226 }
227out:
228 spin_unlock(&wq->thres_lock);
229
230 if (need_change) {
Qu Wenruoc6dd6ea2015-08-20 09:30:39 +0800231 workqueue_set_max_active(wq->normal_wq, wq->current_active);
Qu Wenruo0bd92892014-02-28 10:46:05 +0800232 }
233}
234
Qu Wenruod458b052014-02-28 10:46:19 +0800235static void run_ordered_work(struct __btrfs_workqueue *wq)
Qu Wenruo08a9ff32014-02-28 10:46:03 +0800236{
237 struct list_head *list = &wq->ordered_list;
Qu Wenruod458b052014-02-28 10:46:19 +0800238 struct btrfs_work *work;
Qu Wenruo08a9ff32014-02-28 10:46:03 +0800239 spinlock_t *lock = &wq->list_lock;
240 unsigned long flags;
241
242 while (1) {
243 spin_lock_irqsave(lock, flags);
244 if (list_empty(list))
245 break;
Qu Wenruod458b052014-02-28 10:46:19 +0800246 work = list_entry(list->next, struct btrfs_work,
Qu Wenruo08a9ff32014-02-28 10:46:03 +0800247 ordered_list);
248 if (!test_bit(WORK_DONE_BIT, &work->flags))
249 break;
250
251 /*
252 * we are going to call the ordered done function, but
253 * we leave the work item on the list as a barrier so
254 * that later work items that are done don't have their
255 * functions called before this one returns
256 */
257 if (test_and_set_bit(WORK_ORDER_DONE_BIT, &work->flags))
258 break;
Qu Wenruo52483bc2014-03-06 04:19:50 +0000259 trace_btrfs_ordered_sched(work);
Qu Wenruo08a9ff32014-02-28 10:46:03 +0800260 spin_unlock_irqrestore(lock, flags);
261 work->ordered_func(work);
262
263 /* now take the lock again and drop our item from the list */
264 spin_lock_irqsave(lock, flags);
265 list_del(&work->ordered_list);
266 spin_unlock_irqrestore(lock, flags);
267
268 /*
269 * we don't want to call the ordered free functions
270 * with the lock held though
271 */
272 work->ordered_free(work);
Qu Wenruo52483bc2014-03-06 04:19:50 +0000273 trace_btrfs_all_work_done(work);
Qu Wenruo08a9ff32014-02-28 10:46:03 +0800274 }
275 spin_unlock_irqrestore(lock, flags);
276}
277
Liu Bo9e0af232014-08-15 23:36:53 +0800278static void normal_work_helper(struct btrfs_work *work)
Qu Wenruo08a9ff32014-02-28 10:46:03 +0800279{
Qu Wenruod458b052014-02-28 10:46:19 +0800280 struct __btrfs_workqueue *wq;
Qu Wenruo08a9ff32014-02-28 10:46:03 +0800281 int need_order = 0;
282
Qu Wenruo08a9ff32014-02-28 10:46:03 +0800283 /*
284 * We should not touch things inside work in the following cases:
285 * 1) after work->func() if it has no ordered_free
286 * Since the struct is freed in work->func().
287 * 2) after setting WORK_DONE_BIT
288 * The work may be freed in other threads almost instantly.
289 * So we save the needed things here.
290 */
291 if (work->ordered_func)
292 need_order = 1;
293 wq = work->wq;
294
Qu Wenruo52483bc2014-03-06 04:19:50 +0000295 trace_btrfs_work_sched(work);
Qu Wenruo0bd92892014-02-28 10:46:05 +0800296 thresh_exec_hook(wq);
Qu Wenruo08a9ff32014-02-28 10:46:03 +0800297 work->func(work);
298 if (need_order) {
299 set_bit(WORK_DONE_BIT, &work->flags);
300 run_ordered_work(wq);
301 }
Qu Wenruo52483bc2014-03-06 04:19:50 +0000302 if (!need_order)
303 trace_btrfs_all_work_done(work);
Qu Wenruo08a9ff32014-02-28 10:46:03 +0800304}
305
Liu Bo9e0af232014-08-15 23:36:53 +0800306void btrfs_init_work(struct btrfs_work *work, btrfs_work_func_t uniq_func,
Qu Wenruo6db89142014-03-06 04:19:50 +0000307 btrfs_func_t func,
308 btrfs_func_t ordered_func,
309 btrfs_func_t ordered_free)
Qu Wenruo08a9ff32014-02-28 10:46:03 +0800310{
311 work->func = func;
312 work->ordered_func = ordered_func;
313 work->ordered_free = ordered_free;
Liu Bo9e0af232014-08-15 23:36:53 +0800314 INIT_WORK(&work->normal_work, uniq_func);
Qu Wenruo08a9ff32014-02-28 10:46:03 +0800315 INIT_LIST_HEAD(&work->ordered_list);
316 work->flags = 0;
317}
318
Qu Wenruod458b052014-02-28 10:46:19 +0800319static inline void __btrfs_queue_work(struct __btrfs_workqueue *wq,
320 struct btrfs_work *work)
Qu Wenruo08a9ff32014-02-28 10:46:03 +0800321{
322 unsigned long flags;
323
324 work->wq = wq;
Qu Wenruo0bd92892014-02-28 10:46:05 +0800325 thresh_queue_hook(wq);
Qu Wenruo08a9ff32014-02-28 10:46:03 +0800326 if (work->ordered_func) {
327 spin_lock_irqsave(&wq->list_lock, flags);
328 list_add_tail(&work->ordered_list, &wq->ordered_list);
329 spin_unlock_irqrestore(&wq->list_lock, flags);
330 }
Qu Wenruo52483bc2014-03-06 04:19:50 +0000331 trace_btrfs_work_queued(work);
Qu Wenruo0a95b852016-01-22 09:28:38 +0800332 queue_work(wq->normal_wq, &work->normal_work);
Qu Wenruo08a9ff32014-02-28 10:46:03 +0800333}
334
Qu Wenruod458b052014-02-28 10:46:19 +0800335void btrfs_queue_work(struct btrfs_workqueue *wq,
336 struct btrfs_work *work)
Qu Wenruo1ca08972014-02-28 10:46:04 +0800337{
Qu Wenruod458b052014-02-28 10:46:19 +0800338 struct __btrfs_workqueue *dest_wq;
Qu Wenruo1ca08972014-02-28 10:46:04 +0800339
340 if (test_bit(WORK_HIGH_PRIO_BIT, &work->flags) && wq->high)
341 dest_wq = wq->high;
342 else
343 dest_wq = wq->normal;
344 __btrfs_queue_work(dest_wq, work);
345}
346
347static inline void
Qu Wenruod458b052014-02-28 10:46:19 +0800348__btrfs_destroy_workqueue(struct __btrfs_workqueue *wq)
Qu Wenruo08a9ff32014-02-28 10:46:03 +0800349{
350 destroy_workqueue(wq->normal_wq);
Qu Wenruoc3a46892014-03-12 08:05:33 +0000351 trace_btrfs_workqueue_destroy(wq);
Qu Wenruo08a9ff32014-02-28 10:46:03 +0800352 kfree(wq);
353}
354
Qu Wenruod458b052014-02-28 10:46:19 +0800355void btrfs_destroy_workqueue(struct btrfs_workqueue *wq)
Qu Wenruo1ca08972014-02-28 10:46:04 +0800356{
357 if (!wq)
358 return;
359 if (wq->high)
360 __btrfs_destroy_workqueue(wq->high);
361 __btrfs_destroy_workqueue(wq->normal);
Filipe Mananaef66af12014-03-11 14:31:44 +0000362 kfree(wq);
Qu Wenruo1ca08972014-02-28 10:46:04 +0800363}
364
Qu Wenruoc6dd6ea2015-08-20 09:30:39 +0800365void btrfs_workqueue_set_max(struct btrfs_workqueue *wq, int limit_active)
Qu Wenruo08a9ff32014-02-28 10:46:03 +0800366{
Sergei Trofimovich800ee222014-04-07 10:55:46 +0300367 if (!wq)
368 return;
Qu Wenruoc6dd6ea2015-08-20 09:30:39 +0800369 wq->normal->limit_active = limit_active;
Qu Wenruo1ca08972014-02-28 10:46:04 +0800370 if (wq->high)
Qu Wenruoc6dd6ea2015-08-20 09:30:39 +0800371 wq->high->limit_active = limit_active;
Qu Wenruo1ca08972014-02-28 10:46:04 +0800372}
373
Qu Wenruod458b052014-02-28 10:46:19 +0800374void btrfs_set_work_high_priority(struct btrfs_work *work)
Qu Wenruo1ca08972014-02-28 10:46:04 +0800375{
376 set_bit(WORK_HIGH_PRIO_BIT, &work->flags);
Qu Wenruo08a9ff32014-02-28 10:46:03 +0800377}