blk-stat: convert blk-stat bucket callback to signed
[linux-2.6-block.git] / block / blk-stat.c
CommitLineData
cf43e6be
JA
1/*
2 * Block stat tracking code
3 *
4 * Copyright (C) 2016 Jens Axboe
5 */
6#include <linux/kernel.h>
34dbad5d 7#include <linux/rculist.h>
cf43e6be
JA
8#include <linux/blk-mq.h>
9
10#include "blk-stat.h"
11#include "blk-mq.h"
b9147dd1 12#include "blk.h"
cf43e6be 13
4875253f
OS
14#define BLK_RQ_STAT_BATCH 64
15
34dbad5d
OS
16struct blk_queue_stats {
17 struct list_head callbacks;
18 spinlock_t lock;
b9147dd1 19 bool enable_accounting;
34dbad5d
OS
20};
21
a37244e4 22int blk_stat_rq_ddir(const struct request *rq)
34dbad5d
OS
23{
24 return rq_data_dir(rq);
25}
26EXPORT_SYMBOL_GPL(blk_stat_rq_ddir);
27
28static void blk_stat_init(struct blk_rq_stat *stat)
29{
30 stat->min = -1ULL;
31 stat->max = stat->nr_samples = stat->mean = 0;
32 stat->batch = stat->nr_batch = 0;
33}
34
cf43e6be
JA
35static void blk_stat_flush_batch(struct blk_rq_stat *stat)
36{
37 const s32 nr_batch = READ_ONCE(stat->nr_batch);
209200ef 38 const s32 nr_samples = READ_ONCE(stat->nr_samples);
cf43e6be
JA
39
40 if (!nr_batch)
41 return;
42 if (!nr_samples)
43 stat->mean = div64_s64(stat->batch, nr_batch);
44 else {
45 stat->mean = div64_s64((stat->mean * nr_samples) +
46 stat->batch,
47 nr_batch + nr_samples);
48 }
49
50 stat->nr_samples += nr_batch;
51 stat->nr_batch = stat->batch = 0;
52}
53
54static void blk_stat_sum(struct blk_rq_stat *dst, struct blk_rq_stat *src)
55{
7d8d0014
OS
56 blk_stat_flush_batch(src);
57
cf43e6be
JA
58 if (!src->nr_samples)
59 return;
60
cf43e6be
JA
61 dst->min = min(dst->min, src->min);
62 dst->max = max(dst->max, src->max);
63
64 if (!dst->nr_samples)
65 dst->mean = src->mean;
66 else {
67 dst->mean = div64_s64((src->mean * src->nr_samples) +
68 (dst->mean * dst->nr_samples),
69 dst->nr_samples + src->nr_samples);
70 }
71 dst->nr_samples += src->nr_samples;
72}
73
34dbad5d 74static void __blk_stat_add(struct blk_rq_stat *stat, u64 value)
cf43e6be 75{
34dbad5d
OS
76 stat->min = min(stat->min, value);
77 stat->max = max(stat->max, value);
cf43e6be 78
34dbad5d
OS
79 if (stat->batch + value < stat->batch ||
80 stat->nr_batch + 1 == BLK_RQ_STAT_BATCH)
81 blk_stat_flush_batch(stat);
cf43e6be 82
34dbad5d
OS
83 stat->batch += value;
84 stat->nr_batch++;
cf43e6be
JA
85}
86
34dbad5d 87void blk_stat_add(struct request *rq)
cf43e6be 88{
34dbad5d
OS
89 struct request_queue *q = rq->q;
90 struct blk_stat_callback *cb;
91 struct blk_rq_stat *stat;
92 int bucket;
93 s64 now, value;
94
95 now = __blk_stat_time(ktime_to_ns(ktime_get()));
96 if (now < blk_stat_time(&rq->issue_stat))
97 return;
98
99 value = now - blk_stat_time(&rq->issue_stat);
100
b9147dd1
SL
101 blk_throtl_stat_add(rq, value);
102
34dbad5d
OS
103 rcu_read_lock();
104 list_for_each_entry_rcu(cb, &q->stats->callbacks, list) {
105 if (blk_stat_is_active(cb)) {
106 bucket = cb->bucket_fn(rq);
a37244e4
SB
107 if (bucket < 0)
108 continue;
34dbad5d
OS
109 stat = &this_cpu_ptr(cb->cpu_stat)[bucket];
110 __blk_stat_add(stat, value);
111 }
cf43e6be 112 }
34dbad5d 113 rcu_read_unlock();
cf43e6be
JA
114}
115
34dbad5d 116static void blk_stat_timer_fn(unsigned long data)
cf43e6be 117{
34dbad5d
OS
118 struct blk_stat_callback *cb = (void *)data;
119 unsigned int bucket;
120 int cpu;
cf43e6be 121
34dbad5d
OS
122 for (bucket = 0; bucket < cb->buckets; bucket++)
123 blk_stat_init(&cb->stat[bucket]);
cf43e6be 124
34dbad5d
OS
125 for_each_online_cpu(cpu) {
126 struct blk_rq_stat *cpu_stat;
7cd54aa8 127
34dbad5d
OS
128 cpu_stat = per_cpu_ptr(cb->cpu_stat, cpu);
129 for (bucket = 0; bucket < cb->buckets; bucket++) {
130 blk_stat_sum(&cb->stat[bucket], &cpu_stat[bucket]);
131 blk_stat_init(&cpu_stat[bucket]);
cf43e6be 132 }
34dbad5d 133 }
cf43e6be 134
34dbad5d 135 cb->timer_fn(cb);
cf43e6be
JA
136}
137
34dbad5d
OS
138struct blk_stat_callback *
139blk_stat_alloc_callback(void (*timer_fn)(struct blk_stat_callback *),
a37244e4 140 int (*bucket_fn)(const struct request *),
34dbad5d 141 unsigned int buckets, void *data)
cf43e6be 142{
34dbad5d 143 struct blk_stat_callback *cb;
cf43e6be 144
34dbad5d
OS
145 cb = kmalloc(sizeof(*cb), GFP_KERNEL);
146 if (!cb)
147 return NULL;
cf43e6be 148
34dbad5d
OS
149 cb->stat = kmalloc_array(buckets, sizeof(struct blk_rq_stat),
150 GFP_KERNEL);
151 if (!cb->stat) {
152 kfree(cb);
153 return NULL;
154 }
155 cb->cpu_stat = __alloc_percpu(buckets * sizeof(struct blk_rq_stat),
156 __alignof__(struct blk_rq_stat));
157 if (!cb->cpu_stat) {
158 kfree(cb->stat);
159 kfree(cb);
160 return NULL;
161 }
cf43e6be 162
34dbad5d
OS
163 cb->timer_fn = timer_fn;
164 cb->bucket_fn = bucket_fn;
165 cb->data = data;
166 cb->buckets = buckets;
167 setup_timer(&cb->timer, blk_stat_timer_fn, (unsigned long)cb);
168
169 return cb;
cf43e6be 170}
34dbad5d 171EXPORT_SYMBOL_GPL(blk_stat_alloc_callback);
cf43e6be 172
34dbad5d
OS
173void blk_stat_add_callback(struct request_queue *q,
174 struct blk_stat_callback *cb)
cf43e6be 175{
34dbad5d
OS
176 unsigned int bucket;
177 int cpu;
cf43e6be 178
34dbad5d
OS
179 for_each_possible_cpu(cpu) {
180 struct blk_rq_stat *cpu_stat;
cf43e6be 181
34dbad5d
OS
182 cpu_stat = per_cpu_ptr(cb->cpu_stat, cpu);
183 for (bucket = 0; bucket < cb->buckets; bucket++)
184 blk_stat_init(&cpu_stat[bucket]);
185 }
cf43e6be 186
34dbad5d
OS
187 spin_lock(&q->stats->lock);
188 list_add_tail_rcu(&cb->list, &q->stats->callbacks);
189 set_bit(QUEUE_FLAG_STATS, &q->queue_flags);
190 spin_unlock(&q->stats->lock);
191}
192EXPORT_SYMBOL_GPL(blk_stat_add_callback);
cf43e6be 193
34dbad5d
OS
194void blk_stat_remove_callback(struct request_queue *q,
195 struct blk_stat_callback *cb)
196{
197 spin_lock(&q->stats->lock);
198 list_del_rcu(&cb->list);
b9147dd1 199 if (list_empty(&q->stats->callbacks) && !q->stats->enable_accounting)
34dbad5d
OS
200 clear_bit(QUEUE_FLAG_STATS, &q->queue_flags);
201 spin_unlock(&q->stats->lock);
cf43e6be 202
34dbad5d 203 del_timer_sync(&cb->timer);
cf43e6be 204}
34dbad5d 205EXPORT_SYMBOL_GPL(blk_stat_remove_callback);
cf43e6be 206
34dbad5d 207static void blk_stat_free_callback_rcu(struct rcu_head *head)
cf43e6be 208{
34dbad5d
OS
209 struct blk_stat_callback *cb;
210
211 cb = container_of(head, struct blk_stat_callback, rcu);
212 free_percpu(cb->cpu_stat);
213 kfree(cb->stat);
214 kfree(cb);
cf43e6be
JA
215}
216
34dbad5d 217void blk_stat_free_callback(struct blk_stat_callback *cb)
cf43e6be 218{
a83b576c
JA
219 if (cb)
220 call_rcu(&cb->rcu, blk_stat_free_callback_rcu);
cf43e6be 221}
34dbad5d 222EXPORT_SYMBOL_GPL(blk_stat_free_callback);
cf43e6be 223
b9147dd1
SL
224void blk_stat_enable_accounting(struct request_queue *q)
225{
226 spin_lock(&q->stats->lock);
227 q->stats->enable_accounting = true;
228 set_bit(QUEUE_FLAG_STATS, &q->queue_flags);
229 spin_unlock(&q->stats->lock);
230}
231
34dbad5d 232struct blk_queue_stats *blk_alloc_queue_stats(void)
cf43e6be 233{
34dbad5d
OS
234 struct blk_queue_stats *stats;
235
236 stats = kmalloc(sizeof(*stats), GFP_KERNEL);
237 if (!stats)
238 return NULL;
239
240 INIT_LIST_HEAD(&stats->callbacks);
241 spin_lock_init(&stats->lock);
b9147dd1 242 stats->enable_accounting = false;
34dbad5d
OS
243
244 return stats;
245}
246
247void blk_free_queue_stats(struct blk_queue_stats *stats)
248{
249 if (!stats)
250 return;
251
252 WARN_ON(!list_empty(&stats->callbacks));
cf43e6be 253
34dbad5d 254 kfree(stats);
cf43e6be 255}