Commit | Line | Data |
---|---|---|
63eba147 JA |
1 | /* |
2 | * blktrace output analysis: generate a timeline & gather statistics | |
3 | * | |
4 | * Copyright (C) 2006 Alan D. Brunelle <Alan.Brunelle@hp.com> | |
5 | * | |
6 | * This program is free software; you can redistribute it and/or modify | |
7 | * it under the terms of the GNU General Public License as published by | |
8 | * the Free Software Foundation; either version 2 of the License, or | |
9 | * (at your option) any later version. | |
10 | * | |
11 | * This program is distributed in the hope that it will be useful, | |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | * GNU General Public License for more details. | |
15 | * | |
16 | * You should have received a copy of the GNU General Public License | |
17 | * along with this program; if not, write to the Free Software | |
18 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA | |
19 | * | |
20 | */ | |
63eba147 | 21 | |
ae6d30f4 AB |
22 | static inline int remapper_dev(__u32 dev) |
23 | { | |
24 | int mjr = MAJOR(dev); | |
25 | return mjr == 9 || mjr == 253 || mjr == 254; | |
26 | } | |
27 | ||
69040794 | 28 | static inline void region_init(struct region_info *reg) |
63eba147 | 29 | { |
69040794 AB |
30 | INIT_LIST_HEAD(®->qranges); |
31 | INIT_LIST_HEAD(®->cranges); | |
63eba147 JA |
32 | } |
33 | ||
69040794 | 34 | static inline void __region_exit(struct list_head *range_head) |
63eba147 | 35 | { |
69040794 AB |
36 | struct list_head *p, *q; |
37 | struct range_info *rip; | |
38 | ||
39 | list_for_each_safe(p, q, range_head) { | |
40 | rip = list_entry(p, struct range_info, head); | |
41 | free(rip); | |
63eba147 | 42 | } |
69040794 | 43 | } |
63eba147 | 44 | |
69040794 AB |
45 | static inline void region_exit(struct region_info *reg) |
46 | { | |
47 | __region_exit(®->qranges); | |
48 | __region_exit(®->cranges); | |
63eba147 JA |
49 | } |
50 | ||
69040794 | 51 | static inline void update_range(struct list_head *head_p, __u64 time) |
63eba147 | 52 | { |
69040794 AB |
53 | struct range_info *rip; |
54 | ||
55 | if (!list_empty(head_p)) { | |
56 | rip = list_entry(head_p->prev, struct range_info, head); | |
57 | ||
58 | if (time < rip->end) | |
59 | return; | |
60 | ||
61 | if (BIT_TIME(time - rip->end) < range_delta) { | |
62 | rip->end = time; | |
63 | return; | |
64 | } | |
65 | } | |
66 | ||
67 | rip = malloc(sizeof(*rip)); | |
68 | rip->start = rip->end = time; | |
69 | list_add_tail(&rip->head, head_p); | |
63eba147 JA |
70 | } |
71 | ||
e71e4b78 | 72 | static inline void update_qregion(struct region_info *reg, __u64 time) |
63eba147 | 73 | { |
69040794 | 74 | update_range(®->qranges, time); |
63eba147 JA |
75 | } |
76 | ||
e71e4b78 | 77 | static inline void update_cregion(struct region_info *reg, __u64 time) |
63eba147 | 78 | { |
69040794 | 79 | update_range(®->cranges, time); |
63eba147 JA |
80 | } |
81 | ||
e71e4b78 | 82 | static inline void avg_update(struct avg_info *ap, __u64 t) |
63eba147 JA |
83 | { |
84 | if (ap->n++ == 0) | |
85 | ap->min = ap->total = ap->max = t; | |
86 | else { | |
87 | if (t < ap->min) | |
88 | ap->min = t; | |
89 | else if (t > ap->max) | |
90 | ap->max = t; | |
91 | ap->total += t; | |
92 | } | |
93 | } | |
94 | ||
d76c5b81 AB |
95 | static inline void avg_update_n(struct avg_info *ap, __u64 t, int n) |
96 | { | |
97 | if (ap->n == 0) { | |
98 | ap->min = ap->max = t; | |
99 | ap->total = (n * t); | |
100 | } | |
101 | else { | |
102 | if (t < ap->min) | |
103 | ap->min = t; | |
104 | else if (t > ap->max) | |
105 | ap->max = t; | |
106 | ap->total += (n * t); | |
107 | } | |
108 | ||
109 | ap->n += n; | |
110 | } | |
111 | ||
6eb42155 ADB |
112 | static inline void avg_unupdate(struct avg_info *ap, __u64 t) |
113 | { | |
114 | ap->n--; | |
115 | ap->total -= t; | |
116 | } | |
117 | ||
e71e4b78 | 118 | static inline void update_lq(__u64 *last_q, struct avg_info *avg, __u64 time) |
63eba147 JA |
119 | { |
120 | if (*last_q != ((__u64)-1)) | |
095181f2 | 121 | avg_update(avg, (time > *last_q) ? time - *last_q : 1); |
63eba147 JA |
122 | *last_q = time; |
123 | } | |
124 | ||
e71e4b78 | 125 | static inline void dip_update_q(struct d_info *dip, struct io *iop) |
63eba147 | 126 | { |
ae6d30f4 AB |
127 | if (remapper_dev(dip->device)) |
128 | update_lq(&dip->last_q, &dip->avgs.q2q_dm, iop->t.time); | |
129 | else | |
130 | update_lq(&dip->last_q, &dip->avgs.q2q, iop->t.time); | |
63eba147 JA |
131 | update_qregion(&dip->regions, iop->t.time); |
132 | } | |
133 | ||
6eb42155 | 134 | static inline struct io *io_alloc(void) |
63eba147 | 135 | { |
8b10aae0 | 136 | struct io *iop = malloc(sizeof(*iop)); |
c8b0b334 | 137 | |
095181f2 | 138 | memset(iop, 0, sizeof(struct io)); |
8b10aae0 | 139 | list_add_tail(&iop->a_head, &all_ios); |
095181f2 JA |
140 | |
141 | return iop; | |
63eba147 JA |
142 | } |
143 | ||
6eb42155 | 144 | static inline void io_free(struct io *iop) |
63eba147 | 145 | { |
8b10aae0 AB |
146 | list_del(&iop->a_head); |
147 | free(iop); | |
63eba147 JA |
148 | } |
149 | ||
69040794 AB |
150 | static inline void io_free_all(void) |
151 | { | |
152 | struct io *iop; | |
153 | struct list_head *p, *q; | |
154 | ||
8b10aae0 AB |
155 | list_for_each_safe(p, q, &all_ios) { |
156 | iop = list_entry(p, struct io, a_head); | |
69040794 AB |
157 | free(iop); |
158 | } | |
159 | } | |
160 | ||
095181f2 | 161 | static inline int io_setup(struct io *iop, enum iop_type type) |
63eba147 JA |
162 | { |
163 | iop->type = type; | |
095181f2 JA |
164 | iop->dip = dip_add(iop->t.device, iop); |
165 | if (iop->linked) { | |
166 | iop->pip = find_process(iop->t.pid, NULL); | |
095181f2 JA |
167 | iop->bytes_left = iop->t.bytes; |
168 | } | |
169 | ||
170 | return iop->linked; | |
63eba147 JA |
171 | } |
172 | ||
6eb42155 | 173 | static inline void io_release(struct io *iop) |
63eba147 | 174 | { |
095181f2 | 175 | if (iop->linked) |
6eb42155 | 176 | dip_rem(iop); |
8b10aae0 | 177 | if (iop->pdu) |
6eb42155 | 178 | free(iop->pdu); |
d76c5b81 | 179 | |
6eb42155 | 180 | io_free(iop); |
63eba147 JA |
181 | } |
182 | ||
183 | #define UPDATE_AVGS(_avg, _iop, _pip, _time) do { \ | |
184 | avg_update(&all_avgs. _avg , _time); \ | |
185 | avg_update(&_iop->dip->avgs. _avg , _time); \ | |
186 | if (_pip) avg_update(&_pip->avgs. _avg , _time); \ | |
187 | } while (0) | |
188 | ||
d76c5b81 AB |
189 | #define UPDATE_AVGS_N(_avg, _iop, _pip, _time, _n) do { \ |
190 | avg_update_n(&all_avgs. _avg , _time, _n); \ | |
191 | avg_update_n(&_iop->dip->avgs. _avg , _time, _n); \ | |
192 | if (_pip) avg_update_n(&_pip->avgs. _avg , _time,_n); \ | |
193 | } while (0) | |
194 | ||
6eb42155 ADB |
195 | #define UNUPDATE_AVGS(_avg, _iop, _pip, _time) do { \ |
196 | avg_unupdate(&all_avgs. _avg , _time); \ | |
197 | avg_unupdate(&_iop->dip->avgs. _avg , _time); \ | |
198 | if (_pip) avg_unupdate(&_pip->avgs. _avg , _time); \ | |
199 | } while (0) | |
200 | ||
e71e4b78 | 201 | static inline void update_q2c(struct io *iop, __u64 c_time) |
63eba147 | 202 | { |
ae6d30f4 AB |
203 | if (remapper_dev(iop->dip->device)) |
204 | UPDATE_AVGS(q2c_dm, iop, iop->pip, c_time); | |
205 | else | |
206 | UPDATE_AVGS(q2c, iop, iop->pip, c_time); | |
63eba147 JA |
207 | } |
208 | ||
e71e4b78 | 209 | static inline void update_q2a(struct io *iop, __u64 a_time) |
63eba147 | 210 | { |
ae6d30f4 AB |
211 | if (remapper_dev(iop->dip->device)) |
212 | UPDATE_AVGS(q2a_dm, iop, iop->pip, a_time); | |
213 | else | |
214 | UPDATE_AVGS(q2a, iop, iop->pip, a_time); | |
215 | } | |
216 | ||
217 | static inline void update_q2g(struct io *iop, __u64 g_time) | |
218 | { | |
ae6d30f4 AB |
219 | UPDATE_AVGS(q2g, iop, iop->pip, g_time); |
220 | } | |
221 | ||
222 | static inline void unupdate_q2g(struct io *iop, __u64 g_time) | |
223 | { | |
224 | UNUPDATE_AVGS(q2g, iop, iop->pip, g_time); | |
225 | } | |
226 | ||
227 | static inline void update_g2i(struct io *iop, __u64 i_time) | |
228 | { | |
ae6d30f4 AB |
229 | UPDATE_AVGS(g2i, iop, iop->pip, i_time); |
230 | } | |
231 | ||
232 | static inline void unupdate_g2i(struct io *iop, __u64 i_time) | |
233 | { | |
234 | UNUPDATE_AVGS(g2i, iop, iop->pip, i_time); | |
63eba147 JA |
235 | } |
236 | ||
ae6d30f4 | 237 | static inline void update_q2m(struct io *iop, __u64 m_time) |
63eba147 | 238 | { |
ae6d30f4 | 239 | UPDATE_AVGS(q2m, iop, iop->pip, m_time); |
63eba147 JA |
240 | } |
241 | ||
ae6d30f4 | 242 | static inline void unupdate_q2m(struct io *iop, __u64 m_time) |
d76c5b81 | 243 | { |
ae6d30f4 | 244 | UNUPDATE_AVGS(q2m, iop, iop->pip, m_time); |
d76c5b81 AB |
245 | } |
246 | ||
e71e4b78 | 247 | static inline void update_i2d(struct io *iop, __u64 d_time) |
63eba147 JA |
248 | { |
249 | UPDATE_AVGS(i2d, iop, iop->pip, d_time); | |
250 | } | |
251 | ||
6eb42155 ADB |
252 | static inline void unupdate_i2d(struct io *iop, __u64 d_time) |
253 | { | |
254 | UNUPDATE_AVGS(i2d, iop, iop->pip, d_time); | |
255 | } | |
256 | ||
ae6d30f4 AB |
257 | static inline void update_m2d(struct io *iop, __u64 d_time) |
258 | { | |
ae6d30f4 AB |
259 | UPDATE_AVGS(m2d, iop, iop->pip, d_time); |
260 | } | |
261 | ||
262 | static inline void unupdate_m2d(struct io *iop, __u64 d_time) | |
263 | { | |
264 | UNUPDATE_AVGS(m2d, iop, iop->pip, d_time); | |
265 | } | |
266 | ||
4c48f14e | 267 | static inline void update_d2c(struct io *iop, __u64 c_time) |
63eba147 | 268 | { |
4c48f14e | 269 | UPDATE_AVGS(d2c, iop, iop->pip, c_time); |
63eba147 JA |
270 | } |
271 | ||
e71e4b78 | 272 | static inline void update_blks(struct io *iop) |
63eba147 JA |
273 | { |
274 | __u64 nblks = iop->t.bytes >> 9; | |
275 | avg_update(&all_avgs.blks, nblks); | |
276 | avg_update(&iop->dip->avgs.blks, nblks); | |
277 | if (iop->pip) | |
278 | avg_update(&iop->pip->avgs.blks, nblks); | |
279 | } | |
6eb42155 ADB |
280 | |
281 | static inline struct rb_root *__get_root(struct d_info *dip, enum iop_type type) | |
282 | { | |
283 | struct rb_root *roots = dip->heads; | |
284 | return &roots[type]; | |
285 | } | |
286 | ||
095181f2 | 287 | static inline int dip_rb_ins(struct d_info *dip, struct io *iop) |
6eb42155 | 288 | { |
095181f2 | 289 | return rb_insert(__get_root(dip, iop->type), iop); |
6eb42155 ADB |
290 | } |
291 | ||
292 | static inline void dip_rb_rem(struct io *iop) | |
293 | { | |
294 | rb_erase(&iop->rb_node, __get_root(iop->dip, iop->type)); | |
295 | } | |
296 | ||
8b10aae0 AB |
297 | static inline void dip_rb_fe(struct d_info *dip, enum iop_type type, |
298 | struct io *iop, | |
299 | void (*fnc)(struct io *iop, struct io *this), | |
6eb42155 ADB |
300 | struct list_head *head) |
301 | { | |
302 | rb_foreach(__get_root(dip, type)->rb_node, iop, fnc, head); | |
303 | } | |
304 | ||
8b10aae0 | 305 | static inline struct io *dip_rb_find_sec(struct d_info *dip, |
6eb42155 ADB |
306 | enum iop_type type, __u64 sec) |
307 | { | |
308 | return rb_find_sec(__get_root(dip, type), sec); | |
309 | } | |
095181f2 | 310 | |
4c48f14e | 311 | static inline __u64 tdelta(__u64 from, __u64 to) |
095181f2 | 312 | { |
4c48f14e | 313 | return (from < to) ? (to - from) : 1; |
095181f2 | 314 | } |
d76c5b81 | 315 | |
d76c5b81 AB |
316 | static inline int type2c(enum iop_type type) |
317 | { | |
318 | int c; | |
319 | ||
320 | switch (type) { | |
321 | case IOP_Q: c = 'Q'; break; | |
322 | case IOP_X: c = 'X'; break; | |
323 | case IOP_A: c = 'A'; break; | |
324 | case IOP_I: c = 'I'; break; | |
325 | case IOP_M: c = 'M'; break; | |
326 | case IOP_D: c = 'D'; break; | |
327 | case IOP_C: c = 'C'; break; | |
328 | case IOP_R: c = 'R'; break; | |
4c48f14e | 329 | case IOP_G: c = 'G'; break; |
d76c5b81 AB |
330 | default : c = '?'; break; |
331 | } | |
332 | ||
333 | return c; | |
334 | } | |
335 | ||
4c48f14e | 336 | static inline int histo_idx(__u64 nbytes) |
d76c5b81 | 337 | { |
4c48f14e AB |
338 | int idx = (nbytes >> 9) - 1; |
339 | return min(idx, N_HIST_BKTS-1); | |
d76c5b81 AB |
340 | } |
341 | ||
4c48f14e | 342 | static inline void update_q_histo(__u64 nbytes) |
d76c5b81 | 343 | { |
4c48f14e | 344 | q_histo[histo_idx(nbytes)]++; |
d76c5b81 AB |
345 | } |
346 | ||
4c48f14e | 347 | static inline void update_d_histo(__u64 nbytes) |
d76c5b81 | 348 | { |
4c48f14e | 349 | d_histo[histo_idx(nbytes)]++; |
d76c5b81 AB |
350 | } |
351 | ||
4c48f14e | 352 | static inline struct io *io_first_list(struct list_head *head) |
d76c5b81 | 353 | { |
4c48f14e | 354 | if (list_empty(head)) |
d76c5b81 | 355 | return NULL; |
d76c5b81 | 356 | |
4c48f14e | 357 | return list_entry(head->next, struct io, f_head); |
d76c5b81 AB |
358 | } |
359 | ||
4c48f14e | 360 | static inline void __dump_iop(FILE *ofp, struct io *iop, int extra_nl) |
d76c5b81 | 361 | { |
4c48f14e AB |
362 | fprintf(ofp, "%5d.%09lu %3d,%-3d %c %10llu+%-4u\n", |
363 | (int)SECONDS(iop->t.time), | |
364 | (unsigned long)NANO_SECONDS(iop->t.time), | |
365 | MAJOR(iop->t.device), MINOR(iop->t.device), type2c(iop->type), | |
366 | (unsigned long long)iop->t.sector, t_sec(&iop->t)); | |
367 | if (extra_nl) fprintf(ofp, "\n"); | |
d76c5b81 | 368 | } |
fa0ab85d | 369 | |
4c48f14e | 370 | static inline void __dump_iop2(FILE *ofp, struct io *a_iop, struct io *l_iop) |
fa0ab85d | 371 | { |
4c48f14e AB |
372 | fprintf(ofp, "%5d.%09lu %3d,%-3d %c %10llu+%-4u <- (%3d,%-3d) %10llu\n", |
373 | (int)SECONDS(a_iop->t.time), | |
374 | (unsigned long)NANO_SECONDS(a_iop->t.time), | |
8b10aae0 AB |
375 | MAJOR(a_iop->t.device), MINOR(a_iop->t.device), |
376 | type2c(a_iop->type), (unsigned long long)a_iop->t.sector, | |
377 | t_sec(&a_iop->t), MAJOR(l_iop->t.device), | |
4c48f14e | 378 | MINOR(l_iop->t.device), (unsigned long long)l_iop->t.sector); |
c8b0b334 | 379 | } |