Commit | Line | Data |
---|---|---|
9e066e23 CM |
1 | /* |
2 | * Copyright (C) 2012 Fusion-io | |
3 | * | |
4 | * This program is free software; you can redistribute it and/or | |
5 | * modify it under the terms of the GNU General Public | |
6 | * License v2 as published by the Free Software Foundation. | |
7 | * | |
8 | * This program is distributed in the hope that it will be useful, | |
9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
11 | * GNU General Public License for more details. | |
12 | * | |
13 | * You should have received a copy of the GNU General Public License | |
14 | * along with this program; if not, write to the Free Software | |
660b0411 | 15 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
9e066e23 CM |
16 | * |
17 | * Parts of this file were imported from Jens Axboe's blktrace sources (also GPL) | |
18 | */ | |
19 | #include <sys/types.h> | |
20 | #include <sys/stat.h> | |
21 | #include <fcntl.h> | |
22 | #include <unistd.h> | |
23 | #include <stdlib.h> | |
24 | #include <stdio.h> | |
25 | #include <math.h> | |
26 | #include <inttypes.h> | |
27 | #include <string.h> | |
28 | #include <asm/types.h> | |
29 | #include <errno.h> | |
30 | #include <sys/mman.h> | |
31 | #include <time.h> | |
32 | #include <math.h> | |
2203e914 | 33 | #include <dirent.h> |
9e066e23 CM |
34 | |
35 | #include "plot.h" | |
36 | #include "blkparse.h" | |
37 | #include "list.h" | |
38 | #include "tracers.h" | |
39 | ||
40 | #define IO_HASH_TABLE_BITS 11 | |
41 | #define IO_HASH_TABLE_SIZE (1 << IO_HASH_TABLE_BITS) | |
42 | static struct list_head io_hash_table[IO_HASH_TABLE_SIZE]; | |
43 | static u64 ios_in_flight = 0; | |
44 | ||
0a43b43f JK |
45 | #define PROCESS_HASH_TABLE_BITS 7 |
46 | #define PROCESS_HASH_TABLE_SIZE (1 << PROCESS_HASH_TABLE_BITS) | |
47 | static struct list_head process_hash_table[PROCESS_HASH_TABLE_SIZE]; | |
48 | ||
f2e40ddd | 49 | extern int plot_io_action; |
0a43b43f | 50 | extern int io_per_process; |
9e066e23 CM |
51 | |
52 | /* | |
53 | * Trace categories | |
54 | */ | |
55 | enum { | |
56 | BLK_TC_READ = 1 << 0, /* reads */ | |
57 | BLK_TC_WRITE = 1 << 1, /* writes */ | |
58 | BLK_TC_FLUSH = 1 << 2, /* flush */ | |
59 | BLK_TC_SYNC = 1 << 3, /* sync */ | |
60 | BLK_TC_QUEUE = 1 << 4, /* queueing/merging */ | |
61 | BLK_TC_REQUEUE = 1 << 5, /* requeueing */ | |
62 | BLK_TC_ISSUE = 1 << 6, /* issue */ | |
63 | BLK_TC_COMPLETE = 1 << 7, /* completions */ | |
64 | BLK_TC_FS = 1 << 8, /* fs requests */ | |
65 | BLK_TC_PC = 1 << 9, /* pc requests */ | |
66 | BLK_TC_NOTIFY = 1 << 10, /* special message */ | |
67 | BLK_TC_AHEAD = 1 << 11, /* readahead */ | |
68 | BLK_TC_META = 1 << 12, /* metadata */ | |
69 | BLK_TC_DISCARD = 1 << 13, /* discard requests */ | |
70 | BLK_TC_DRV_DATA = 1 << 14, /* binary driver data */ | |
71 | BLK_TC_FUA = 1 << 15, /* fua requests */ | |
72 | ||
73 | BLK_TC_END = 1 << 15, /* we've run out of bits! */ | |
74 | }; | |
75 | ||
76 | #define BLK_TC_SHIFT (16) | |
77 | #define BLK_TC_ACT(act) ((act) << BLK_TC_SHIFT) | |
78 | #define BLK_DATADIR(a) (((a) >> BLK_TC_SHIFT) & (BLK_TC_READ | BLK_TC_WRITE)) | |
79 | ||
80 | /* | |
81 | * Basic trace actions | |
82 | */ | |
83 | enum { | |
84 | __BLK_TA_QUEUE = 1, /* queued */ | |
85 | __BLK_TA_BACKMERGE, /* back merged to existing rq */ | |
86 | __BLK_TA_FRONTMERGE, /* front merge to existing rq */ | |
87 | __BLK_TA_GETRQ, /* allocated new request */ | |
88 | __BLK_TA_SLEEPRQ, /* sleeping on rq allocation */ | |
89 | __BLK_TA_REQUEUE, /* request requeued */ | |
90 | __BLK_TA_ISSUE, /* sent to driver */ | |
91 | __BLK_TA_COMPLETE, /* completed by driver */ | |
92 | __BLK_TA_PLUG, /* queue was plugged */ | |
93 | __BLK_TA_UNPLUG_IO, /* queue was unplugged by io */ | |
94 | __BLK_TA_UNPLUG_TIMER, /* queue was unplugged by timer */ | |
95 | __BLK_TA_INSERT, /* insert request */ | |
96 | __BLK_TA_SPLIT, /* bio was split */ | |
97 | __BLK_TA_BOUNCE, /* bio was bounced */ | |
98 | __BLK_TA_REMAP, /* bio was remapped */ | |
99 | __BLK_TA_ABORT, /* request aborted */ | |
100 | __BLK_TA_DRV_DATA, /* binary driver data */ | |
101 | }; | |
102 | ||
1582ecc9 JK |
103 | #define BLK_TA_MASK ((1 << BLK_TC_SHIFT) - 1) |
104 | ||
9e066e23 CM |
105 | /* |
106 | * Notify events. | |
107 | */ | |
108 | enum blktrace_notify { | |
109 | __BLK_TN_PROCESS = 0, /* establish pid/name mapping */ | |
110 | __BLK_TN_TIMESTAMP, /* include system clock */ | |
111 | __BLK_TN_MESSAGE, /* Character string message */ | |
112 | }; | |
113 | ||
114 | /* | |
115 | * Trace actions in full. Additionally, read or write is masked | |
116 | */ | |
117 | #define BLK_TA_QUEUE (__BLK_TA_QUEUE | BLK_TC_ACT(BLK_TC_QUEUE)) | |
118 | #define BLK_TA_BACKMERGE (__BLK_TA_BACKMERGE | BLK_TC_ACT(BLK_TC_QUEUE)) | |
119 | #define BLK_TA_FRONTMERGE (__BLK_TA_FRONTMERGE | BLK_TC_ACT(BLK_TC_QUEUE)) | |
120 | #define BLK_TA_GETRQ (__BLK_TA_GETRQ | BLK_TC_ACT(BLK_TC_QUEUE)) | |
121 | #define BLK_TA_SLEEPRQ (__BLK_TA_SLEEPRQ | BLK_TC_ACT(BLK_TC_QUEUE)) | |
122 | #define BLK_TA_REQUEUE (__BLK_TA_REQUEUE | BLK_TC_ACT(BLK_TC_REQUEUE)) | |
123 | #define BLK_TA_ISSUE (__BLK_TA_ISSUE | BLK_TC_ACT(BLK_TC_ISSUE)) | |
124 | #define BLK_TA_COMPLETE (__BLK_TA_COMPLETE| BLK_TC_ACT(BLK_TC_COMPLETE)) | |
125 | #define BLK_TA_PLUG (__BLK_TA_PLUG | BLK_TC_ACT(BLK_TC_QUEUE)) | |
126 | #define BLK_TA_UNPLUG_IO (__BLK_TA_UNPLUG_IO | BLK_TC_ACT(BLK_TC_QUEUE)) | |
127 | #define BLK_TA_UNPLUG_TIMER (__BLK_TA_UNPLUG_TIMER | BLK_TC_ACT(BLK_TC_QUEUE)) | |
128 | #define BLK_TA_INSERT (__BLK_TA_INSERT | BLK_TC_ACT(BLK_TC_QUEUE)) | |
129 | #define BLK_TA_SPLIT (__BLK_TA_SPLIT) | |
130 | #define BLK_TA_BOUNCE (__BLK_TA_BOUNCE) | |
131 | #define BLK_TA_REMAP (__BLK_TA_REMAP | BLK_TC_ACT(BLK_TC_QUEUE)) | |
132 | #define BLK_TA_ABORT (__BLK_TA_ABORT | BLK_TC_ACT(BLK_TC_QUEUE)) | |
133 | #define BLK_TA_DRV_DATA (__BLK_TA_DRV_DATA | BLK_TC_ACT(BLK_TC_DRV_DATA)) | |
134 | ||
135 | #define BLK_TN_PROCESS (__BLK_TN_PROCESS | BLK_TC_ACT(BLK_TC_NOTIFY)) | |
136 | #define BLK_TN_TIMESTAMP (__BLK_TN_TIMESTAMP | BLK_TC_ACT(BLK_TC_NOTIFY)) | |
137 | #define BLK_TN_MESSAGE (__BLK_TN_MESSAGE | BLK_TC_ACT(BLK_TC_NOTIFY)) | |
138 | ||
139 | #define BLK_IO_TRACE_MAGIC 0x65617400 | |
140 | #define BLK_IO_TRACE_VERSION 0x07 | |
141 | /* | |
142 | * The trace itself | |
143 | */ | |
144 | struct blk_io_trace { | |
145 | __u32 magic; /* MAGIC << 8 | version */ | |
146 | __u32 sequence; /* event number */ | |
147 | __u64 time; /* in nanoseconds */ | |
148 | __u64 sector; /* disk offset */ | |
149 | __u32 bytes; /* transfer length */ | |
150 | __u32 action; /* what happened */ | |
151 | __u32 pid; /* who did it */ | |
152 | __u32 device; /* device identifier (dev_t) */ | |
153 | __u32 cpu; /* on what cpu did it happen */ | |
154 | __u16 error; /* completion error */ | |
155 | __u16 pdu_len; /* length of data after this trace */ | |
156 | }; | |
157 | ||
158 | struct pending_io { | |
159 | /* sector offset of this IO */ | |
160 | u64 sector; | |
161 | ||
2203e914 CM |
162 | /* dev_t for this IO */ |
163 | u32 device; | |
164 | ||
9e066e23 CM |
165 | /* time this IO was dispatched */ |
166 | u64 dispatch_time; | |
167 | /* time this IO was finished */ | |
168 | u64 completion_time; | |
169 | struct list_head hash_list; | |
0a43b43f JK |
170 | /* process which queued this IO */ |
171 | u32 pid; | |
172 | }; | |
173 | ||
174 | struct pid_map { | |
175 | struct list_head hash_list; | |
176 | u32 pid; | |
177 | int index; | |
178 | char name[0]; | |
9e066e23 CM |
179 | }; |
180 | ||
6a079b02 JK |
181 | u64 get_record_time(struct trace *trace) |
182 | { | |
183 | return trace->io->time; | |
184 | } | |
185 | ||
9e066e23 CM |
186 | void init_io_hash_table(void) |
187 | { | |
188 | int i; | |
189 | struct list_head *head; | |
190 | ||
191 | for (i = 0; i < IO_HASH_TABLE_SIZE; i++) { | |
192 | head = io_hash_table + i; | |
193 | INIT_LIST_HEAD(head); | |
194 | } | |
195 | } | |
196 | ||
197 | /* taken from the kernel hash.h */ | |
198 | static inline u64 hash_sector(u64 val) | |
199 | { | |
200 | u64 hash = val; | |
201 | ||
202 | /* Sigh, gcc can't optimise this alone like it does for 32 bits. */ | |
203 | u64 n = hash; | |
204 | n <<= 18; | |
205 | hash -= n; | |
206 | n <<= 33; | |
207 | hash -= n; | |
208 | n <<= 3; | |
209 | hash += n; | |
210 | n <<= 3; | |
211 | hash -= n; | |
212 | n <<= 4; | |
213 | hash += n; | |
214 | n <<= 2; | |
215 | hash += n; | |
216 | ||
217 | /* High bits are more random, so use them. */ | |
218 | return hash >> (64 - IO_HASH_TABLE_BITS); | |
219 | } | |
220 | ||
0a43b43f | 221 | static int io_hash_table_insert(struct pending_io *ins_pio) |
9e066e23 CM |
222 | { |
223 | u64 sector = ins_pio->sector; | |
2203e914 | 224 | u32 dev = ins_pio->device; |
9e066e23 CM |
225 | int slot = hash_sector(sector); |
226 | struct list_head *head; | |
227 | struct pending_io *pio; | |
228 | ||
229 | head = io_hash_table + slot; | |
230 | list_for_each_entry(pio, head, hash_list) { | |
2203e914 | 231 | if (pio->sector == sector && pio->device == dev) |
9e066e23 CM |
232 | return -EEXIST; |
233 | } | |
234 | list_add_tail(&ins_pio->hash_list, head); | |
235 | return 0; | |
236 | } | |
237 | ||
2203e914 | 238 | static struct pending_io *io_hash_table_search(u64 sector, u32 dev) |
9e066e23 CM |
239 | { |
240 | int slot = hash_sector(sector); | |
241 | struct list_head *head; | |
242 | struct pending_io *pio; | |
243 | ||
244 | head = io_hash_table + slot; | |
245 | list_for_each_entry(pio, head, hash_list) { | |
2203e914 | 246 | if (pio->sector == sector && pio->device == dev) |
9e066e23 CM |
247 | return pio; |
248 | } | |
249 | return NULL; | |
250 | } | |
251 | ||
79d61530 | 252 | static struct pending_io *hash_queued_io(struct blk_io_trace *io) |
9e066e23 CM |
253 | { |
254 | struct pending_io *pio; | |
255 | int ret; | |
256 | ||
257 | pio = calloc(1, sizeof(*pio)); | |
258 | pio->sector = io->sector; | |
2203e914 | 259 | pio->device = io->device; |
0a43b43f | 260 | pio->pid = io->pid; |
9e066e23 | 261 | |
0a43b43f JK |
262 | ret = io_hash_table_insert(pio); |
263 | if (ret < 0) { | |
264 | /* crud, the IO is there already */ | |
9e066e23 | 265 | free(pio); |
79d61530 | 266 | return NULL; |
9e066e23 | 267 | } |
79d61530 | 268 | return pio; |
0a43b43f JK |
269 | } |
270 | ||
854a1f24 | 271 | static struct pending_io *hash_dispatched_io(struct blk_io_trace *io) |
0a43b43f JK |
272 | { |
273 | struct pending_io *pio; | |
274 | ||
2203e914 | 275 | pio = io_hash_table_search(io->sector, io->device); |
79d61530 JK |
276 | if (!pio) { |
277 | pio = hash_queued_io(io); | |
278 | if (!pio) | |
279 | return NULL; | |
280 | } | |
0a43b43f | 281 | pio->dispatch_time = io->time; |
854a1f24 | 282 | return pio; |
9e066e23 CM |
283 | } |
284 | ||
285 | static struct pending_io *hash_completed_io(struct blk_io_trace *io) | |
286 | { | |
287 | struct pending_io *pio; | |
288 | ||
2203e914 | 289 | pio = io_hash_table_search(io->sector, io->device); |
9e066e23 CM |
290 | |
291 | if (!pio) | |
292 | return NULL; | |
293 | return pio; | |
294 | } | |
295 | ||
0a43b43f JK |
296 | void init_process_hash_table(void) |
297 | { | |
298 | int i; | |
299 | struct list_head *head; | |
300 | ||
301 | for (i = 0; i < PROCESS_HASH_TABLE_SIZE; i++) { | |
302 | head = process_hash_table + i; | |
303 | INIT_LIST_HEAD(head); | |
304 | } | |
305 | } | |
306 | ||
307 | static u32 hash_pid(u32 pid) | |
308 | { | |
309 | u32 hash = pid; | |
310 | ||
311 | hash ^= pid >> 3; | |
312 | hash ^= pid >> 3; | |
313 | hash ^= pid >> 4; | |
314 | hash ^= pid >> 6; | |
315 | return (hash & (PROCESS_HASH_TABLE_SIZE - 1)); | |
316 | } | |
317 | ||
318 | static struct pid_map *process_hash_search(u32 pid) | |
319 | { | |
320 | int slot = hash_pid(pid); | |
321 | struct list_head *head; | |
322 | struct pid_map *pm; | |
323 | ||
324 | head = process_hash_table + slot; | |
325 | list_for_each_entry(pm, head, hash_list) { | |
326 | if (pm->pid == pid) | |
327 | return pm; | |
328 | } | |
329 | return NULL; | |
330 | } | |
331 | ||
332 | static struct pid_map *process_hash_insert(u32 pid, char *name) | |
333 | { | |
334 | int slot = hash_pid(pid); | |
335 | struct pid_map *pm; | |
336 | int old_index = 0; | |
337 | char buf[16]; | |
338 | ||
339 | pm = process_hash_search(pid); | |
340 | if (pm) { | |
341 | /* Entry exists and name shouldn't be changed? */ | |
342 | if (!name || !strcmp(name, pm->name)) | |
343 | return pm; | |
344 | list_del(&pm->hash_list); | |
345 | old_index = pm->index; | |
346 | free(pm); | |
347 | } | |
348 | if (!name) { | |
349 | sprintf(buf, "[%u]", pid); | |
350 | name = buf; | |
351 | } | |
352 | pm = malloc(sizeof(struct pid_map) + strlen(name) + 1); | |
353 | pm->pid = pid; | |
354 | pm->index = old_index; | |
355 | strcpy(pm->name, name); | |
356 | list_add_tail(&pm->hash_list, process_hash_table + slot); | |
357 | ||
358 | return pm; | |
359 | } | |
360 | ||
9e066e23 CM |
361 | static void handle_notify(struct trace *trace) |
362 | { | |
363 | struct blk_io_trace *io = trace->io; | |
364 | void *payload = (char *)io + sizeof(*io); | |
365 | u32 two32[2]; | |
366 | ||
0a43b43f JK |
367 | if (io->action == BLK_TN_PROCESS) { |
368 | if (io_per_process) | |
369 | process_hash_insert(io->pid, payload); | |
370 | return; | |
371 | } | |
9e066e23 CM |
372 | |
373 | if (io->action != BLK_TN_TIMESTAMP) | |
374 | return; | |
375 | ||
376 | if (io->pdu_len != sizeof(two32)) | |
377 | return; | |
378 | ||
379 | memcpy(two32, payload, sizeof(two32)); | |
380 | trace->start_timestamp = io->time; | |
381 | trace->abs_start_time.tv_sec = two32[0]; | |
382 | trace->abs_start_time.tv_nsec = two32[1]; | |
383 | if (trace->abs_start_time.tv_nsec < 0) { | |
384 | trace->abs_start_time.tv_sec--; | |
385 | trace->abs_start_time.tv_nsec += 1000000000; | |
386 | } | |
387 | } | |
388 | ||
389 | int next_record(struct trace *trace) | |
390 | { | |
391 | int skip = trace->io->pdu_len; | |
392 | u64 offset; | |
393 | ||
394 | trace->cur += sizeof(*trace->io) + skip; | |
395 | offset = trace->cur - trace->start; | |
396 | if (offset >= trace->len) | |
397 | return 1; | |
398 | ||
399 | trace->io = (struct blk_io_trace *)trace->cur; | |
400 | return 0; | |
401 | } | |
402 | ||
403 | void first_record(struct trace *trace) | |
404 | { | |
405 | trace->cur = trace->start; | |
406 | trace->io = (struct blk_io_trace *)trace->cur; | |
407 | } | |
408 | ||
bfb0e441 CM |
409 | int is_io_event(struct blk_io_trace *test) |
410 | { | |
411 | char *message; | |
412 | if (!(test->action & BLK_TC_ACT(BLK_TC_NOTIFY))) | |
413 | return 1; | |
414 | if (test->action == BLK_TN_MESSAGE) { | |
415 | int len = test->pdu_len; | |
416 | if (len < 3) | |
417 | return 0; | |
418 | message = (char *)(test + 1); | |
419 | if (strncmp(message, "fio ", 4) == 0) { | |
420 | return 1; | |
421 | } | |
422 | } | |
423 | return 0; | |
424 | } | |
425 | ||
9e066e23 CM |
426 | u64 find_last_time(struct trace *trace) |
427 | { | |
428 | char *p = trace->start + trace->len; | |
429 | struct blk_io_trace *test; | |
430 | int search_len = 0; | |
431 | u64 found = 0; | |
432 | ||
433 | if (trace->len < sizeof(*trace->io)) | |
434 | return 0; | |
435 | p -= sizeof(*trace->io); | |
436 | while (p >= trace->start) { | |
437 | test = (struct blk_io_trace *)p; | |
bfb0e441 | 438 | if (CHECK_MAGIC(test) && is_io_event(test)) { |
9e066e23 CM |
439 | u64 offset = p - trace->start; |
440 | if (offset + sizeof(*test) + test->pdu_len == trace->len) { | |
441 | return test->time; | |
442 | } | |
443 | } | |
444 | p--; | |
445 | search_len++; | |
446 | if (search_len > 8192) { | |
447 | break; | |
448 | } | |
449 | } | |
450 | ||
451 | /* searching backwards didn't work out, we'll have to scan the file */ | |
452 | first_record(trace); | |
453 | while (1) { | |
bfb0e441 | 454 | if (is_io_event(trace->io)) |
9e066e23 CM |
455 | found = trace->io->time; |
456 | if (next_record(trace)) | |
457 | break; | |
458 | } | |
459 | first_record(trace); | |
460 | return found; | |
461 | } | |
462 | ||
bfb0e441 CM |
463 | int parse_fio_bank_message(struct trace *trace, u64 *bank_ret, u64 *offset_ret, |
464 | u64 *num_banks_ret) | |
465 | { | |
466 | char *s; | |
467 | char *next; | |
468 | char *message; | |
469 | struct blk_io_trace *test = trace->io; | |
470 | int len = test->pdu_len; | |
471 | u64 bank; | |
472 | u64 offset; | |
473 | u64 num_banks; | |
474 | ||
475 | if (!(test->action & BLK_TC_ACT(BLK_TC_NOTIFY))) | |
476 | return -1; | |
477 | if (test->action != BLK_TN_MESSAGE) | |
478 | return -1; | |
479 | ||
480 | /* the message is fio rw bank offset num_banks */ | |
481 | if (len < 3) | |
482 | return -1; | |
483 | message = (char *)(test + 1); | |
484 | if (strncmp(message, "fio r ", 6) != 0) | |
485 | return -1; | |
486 | ||
487 | message = strndup(message, len); | |
488 | s = strchr(message, ' '); | |
489 | if (!s) | |
490 | goto out; | |
491 | s++; | |
492 | s = strchr(s, ' '); | |
493 | if (!s) | |
494 | goto out; | |
495 | ||
496 | bank = strtoll(s, &next, 10); | |
497 | if (s == next) | |
498 | goto out; | |
499 | s = next; | |
500 | ||
501 | offset = strtoll(s, &next, 10); | |
502 | if (s == next) | |
503 | goto out; | |
504 | s = next; | |
505 | ||
506 | num_banks = strtoll(s, &next, 10); | |
507 | if (s == next) | |
508 | goto out; | |
509 | ||
510 | *bank_ret = bank; | |
511 | *offset_ret = offset; | |
512 | *num_banks_ret = num_banks; | |
513 | ||
514 | return 0; | |
515 | out: | |
516 | free(message); | |
517 | return -1; | |
518 | } | |
519 | ||
2203e914 CM |
520 | static struct dev_info *lookup_dev(struct trace *trace, struct blk_io_trace *io) |
521 | { | |
522 | u32 dev = io->device; | |
523 | int i; | |
524 | struct dev_info *di = NULL; | |
525 | ||
526 | for (i = 0; i < trace->num_devices; i++) { | |
527 | if (trace->devices[i].device == dev) { | |
528 | di = trace->devices + i; | |
529 | goto found; | |
530 | } | |
531 | } | |
532 | i = trace->num_devices++; | |
533 | if (i >= MAX_DEVICES_PER_TRACE) { | |
534 | fprintf(stderr, "Trace contains too many devices (%d)\n", i); | |
535 | exit(1); | |
536 | } | |
537 | di = trace->devices + i; | |
538 | di->device = dev; | |
539 | found: | |
540 | return di; | |
541 | } | |
542 | ||
543 | static void map_devices(struct trace *trace) | |
544 | { | |
545 | struct dev_info *di; | |
546 | u64 found; | |
547 | u64 map_start = 0; | |
548 | int i; | |
549 | ||
550 | first_record(trace); | |
551 | while (1) { | |
552 | if (!(trace->io->action & BLK_TC_ACT(BLK_TC_NOTIFY))) { | |
553 | di = lookup_dev(trace, trace->io); | |
554 | found = trace->io->sector << 9; | |
555 | if (found < di->min) | |
556 | di->min = found; | |
557 | ||
558 | found += trace->io->bytes; | |
559 | if (di->max < found) | |
560 | di->max = found; | |
561 | } | |
562 | if (next_record(trace)) | |
563 | break; | |
564 | } | |
565 | first_record(trace); | |
566 | for (i = 0; i < trace->num_devices; i++) { | |
567 | di = trace->devices + i; | |
568 | di->map = map_start; | |
569 | map_start += di->max - di->min; | |
570 | } | |
571 | } | |
572 | ||
573 | u64 map_io(struct trace *trace, struct blk_io_trace *io) | |
574 | { | |
575 | struct dev_info *di = lookup_dev(trace, io); | |
576 | u64 val = trace->io->sector << 9; | |
577 | return di->map + val - di->min; | |
578 | } | |
579 | ||
9b9fa04b JK |
580 | void find_extreme_offsets(struct trace *trace, u64 *min_ret, u64 *max_ret, u64 *max_bank_ret, |
581 | u64 *max_offset_ret) | |
9e066e23 CM |
582 | { |
583 | u64 found = 0; | |
9b9fa04b | 584 | u64 max = 0, min = ~(u64)0; |
bfb0e441 CM |
585 | u64 max_bank = 0; |
586 | u64 max_bank_offset = 0; | |
587 | u64 num_banks = 0; | |
2203e914 CM |
588 | |
589 | map_devices(trace); | |
590 | ||
9e066e23 CM |
591 | first_record(trace); |
592 | while (1) { | |
593 | if (!(trace->io->action & BLK_TC_ACT(BLK_TC_NOTIFY))) { | |
2203e914 | 594 | found = map_io(trace, trace->io); |
9b9fa04b JK |
595 | if (found < min) |
596 | min = found; | |
9e066e23 | 597 | |
9b9fa04b JK |
598 | found += trace->io->bytes; |
599 | if (max < found) | |
9e066e23 | 600 | max = found; |
bfb0e441 CM |
601 | } else { |
602 | u64 bank; | |
603 | u64 offset; | |
604 | if (!parse_fio_bank_message(trace, &bank, | |
605 | &offset, &num_banks)) { | |
606 | if (bank > max_bank) | |
607 | max_bank = bank; | |
608 | if (offset > max_bank_offset) | |
609 | max_bank_offset = offset; | |
610 | } | |
9e066e23 CM |
611 | } |
612 | if (next_record(trace)) | |
613 | break; | |
614 | } | |
615 | first_record(trace); | |
9b9fa04b | 616 | *min_ret = min; |
bfb0e441 CM |
617 | *max_ret = max; |
618 | *max_bank_ret = max_bank; | |
619 | *max_offset_ret = max_bank_offset; | |
9e066e23 CM |
620 | } |
621 | ||
854a1f24 CM |
622 | static void check_io_types(struct trace *trace) |
623 | { | |
624 | struct blk_io_trace *io = trace->io; | |
625 | int action = io->action & BLK_TA_MASK; | |
626 | ||
627 | if (!(io->action & BLK_TC_ACT(BLK_TC_NOTIFY))) { | |
628 | switch (action) { | |
629 | case __BLK_TA_COMPLETE: | |
630 | trace->found_completion = 1; | |
631 | break; | |
632 | case __BLK_TA_ISSUE: | |
633 | trace->found_issue = 1; | |
634 | break; | |
635 | case __BLK_TA_QUEUE: | |
636 | trace->found_queue = 1; | |
637 | break; | |
638 | }; | |
639 | } | |
640 | } | |
641 | ||
642 | ||
9b9fa04b | 643 | int filter_outliers(struct trace *trace, u64 min_offset, u64 max_offset, |
9e066e23 CM |
644 | u64 *yzoom_min, u64 *yzoom_max) |
645 | { | |
646 | int hits[11]; | |
647 | u64 max_per_bucket[11]; | |
9b9fa04b JK |
648 | u64 min_per_bucket[11]; |
649 | u64 bytes_per_bucket = (max_offset - min_offset + 1) / 10; | |
9e066e23 CM |
650 | int slot; |
651 | int fat_count = 0; | |
652 | ||
653 | memset(hits, 0, sizeof(int) * 11); | |
654 | memset(max_per_bucket, 0, sizeof(u64) * 11); | |
9b9fa04b | 655 | memset(min_per_bucket, 0xff, sizeof(u64) * 11); |
9e066e23 CM |
656 | first_record(trace); |
657 | while (1) { | |
854a1f24 | 658 | check_io_types(trace); |
41fdf407 JK |
659 | if (!(trace->io->action & BLK_TC_ACT(BLK_TC_NOTIFY)) && |
660 | (trace->io->action & BLK_TA_MASK) == __BLK_TA_QUEUE) { | |
2203e914 | 661 | u64 off = map_io(trace, trace->io) - min_offset; |
9b9fa04b JK |
662 | |
663 | slot = (int)(off / bytes_per_bucket); | |
664 | hits[slot]++; | |
665 | if (off < min_per_bucket[slot]) | |
666 | min_per_bucket[slot] = off; | |
667 | ||
854a1f24 | 668 | off += trace->io->bytes; |
9b9fa04b | 669 | slot = (int)(off / bytes_per_bucket); |
9e066e23 | 670 | hits[slot]++; |
9b9fa04b JK |
671 | if (off > max_per_bucket[slot]) |
672 | max_per_bucket[slot] = off; | |
9e066e23 CM |
673 | } |
674 | if (next_record(trace)) | |
675 | break; | |
676 | } | |
677 | first_record(trace); | |
678 | for (slot = 0; slot < 11; slot++) { | |
679 | if (hits[slot] > fat_count) { | |
680 | fat_count = hits[slot]; | |
681 | } | |
682 | } | |
683 | ||
684 | *yzoom_max = max_offset; | |
685 | for (slot = 10; slot >= 0; slot--) { | |
686 | double d = hits[slot]; | |
687 | ||
688 | if (d >= (double)fat_count * .05) { | |
9b9fa04b | 689 | *yzoom_max = max_per_bucket[slot] + min_offset; |
9e066e23 CM |
690 | break; |
691 | } | |
692 | } | |
693 | ||
9b9fa04b | 694 | *yzoom_min = min_offset; |
9e066e23 CM |
695 | for (slot = 0; slot < 10; slot++) { |
696 | double d = hits[slot]; | |
697 | ||
698 | if (d >= (double)fat_count * .05) { | |
9b9fa04b | 699 | *yzoom_min = min_per_bucket[slot] + min_offset; |
9e066e23 CM |
700 | break; |
701 | } | |
702 | } | |
703 | return 0; | |
704 | } | |
705 | ||
2203e914 | 706 | static char footer[] = ".blktrace.0"; |
c1ab63ed | 707 | static int footer_len = sizeof(footer) - 1; |
2203e914 | 708 | |
c1ab63ed | 709 | static int match_trace(char *name, int *len) |
2203e914 CM |
710 | { |
711 | int match_len; | |
2203e914 CM |
712 | int footer_start; |
713 | ||
714 | match_len = strlen(name); | |
715 | if (match_len <= footer_len) | |
c1ab63ed | 716 | return 0; |
2203e914 CM |
717 | |
718 | footer_start = match_len - footer_len; | |
c1ab63ed AP |
719 | if (strcmp(name + footer_start, footer) != 0) |
720 | return 0; | |
2203e914 | 721 | |
c1ab63ed AP |
722 | if (len) |
723 | *len = match_len; | |
724 | return 1; | |
2203e914 CM |
725 | } |
726 | ||
c1ab63ed AP |
727 | struct tracelist { |
728 | struct tracelist *next; | |
729 | char *name; | |
730 | }; | |
2203e914 | 731 | |
c1ab63ed AP |
732 | static struct tracelist *traces_list(char *dir_name, int *len) |
733 | { | |
734 | int count = 0; | |
735 | struct tracelist *traces = NULL; | |
d6b58e52 | 736 | int dlen = strlen(dir_name); |
c1ab63ed | 737 | DIR *dir = opendir(dir_name); |
2203e914 CM |
738 | if (!dir) |
739 | return NULL; | |
740 | ||
741 | while (1) { | |
d6b58e52 | 742 | int n = 0; |
c1ab63ed AP |
743 | struct tracelist *tl; |
744 | struct dirent *d = readdir(dir); | |
2203e914 CM |
745 | if (!d) |
746 | break; | |
747 | ||
d6b58e52 | 748 | if (!match_trace(d->d_name, &n)) |
c1ab63ed AP |
749 | continue; |
750 | ||
d6b58e52 | 751 | n += dlen + 1; /* dir + '/' + file */ |
c1ab63ed | 752 | /* Allocate space for tracelist + filename */ |
d6b58e52 | 753 | tl = calloc(1, sizeof(struct tracelist) + (sizeof(char) * (n + 1))); |
c1ab63ed AP |
754 | if (!tl) |
755 | return NULL; | |
756 | tl->next = traces; | |
757 | tl->name = (char *)(tl + 1); | |
d6b58e52 | 758 | snprintf(tl->name, n, "%s/%s", dir_name, d->d_name); |
c1ab63ed AP |
759 | traces = tl; |
760 | count++; | |
2203e914 CM |
761 | } |
762 | ||
763 | closedir(dir); | |
764 | ||
c1ab63ed AP |
765 | if (len) |
766 | *len = count; | |
767 | ||
768 | return traces; | |
769 | } | |
770 | ||
771 | static void traces_free(struct tracelist *traces) | |
772 | { | |
773 | while (traces) { | |
774 | struct tracelist *tl = traces; | |
775 | traces = traces->next; | |
776 | free(tl); | |
777 | } | |
778 | } | |
779 | ||
d6b58e52 | 780 | static int dump_traces(struct tracelist *traces, int count, char *dumpfile) |
c1ab63ed | 781 | { |
c1ab63ed | 782 | struct tracelist *tl; |
c1ab63ed | 783 | char **argv = NULL; |
c1ab63ed AP |
784 | int argc = 0; |
785 | int i; | |
d6b58e52 | 786 | int err = 0; |
c1ab63ed | 787 | |
d6b58e52 AP |
788 | argc = count * 2; /* {"-i", trace } */ |
789 | argc += 4; /* See below */ | |
c1ab63ed AP |
790 | argv = calloc(argc + 1, sizeof(char *)); |
791 | if (!argv) | |
d6b58e52 | 792 | return -errno; |
c1ab63ed AP |
793 | |
794 | i = 0; | |
795 | argv[i++] = "blkparse"; | |
796 | argv[i++] = "-O"; | |
c1ab63ed AP |
797 | argv[i++] = "-d"; |
798 | argv[i++] = dumpfile; | |
799 | for (tl = traces; tl != NULL; tl = tl->next) { | |
800 | argv[i++] = "-i"; | |
801 | argv[i++] = tl->name; | |
802 | } | |
2203e914 | 803 | |
ce225d50 AP |
804 | err = run_program(argc, argv, 1, NULL); |
805 | if (err) | |
806 | fprintf(stderr, "%s exited with %d, expected 0\n", argv[0], err); | |
c1ab63ed | 807 | free(argv); |
d6b58e52 | 808 | return err; |
2203e914 CM |
809 | } |
810 | ||
9e066e23 CM |
811 | static char *find_trace_file(char *filename) |
812 | { | |
813 | int ret; | |
814 | struct stat st; | |
9e066e23 | 815 | char *dot; |
2203e914 | 816 | int found_dir = 0; |
d6b58e52 AP |
817 | char *dumpfile; |
818 | int len = strlen(filename); | |
9e066e23 | 819 | |
2203e914 CM |
820 | /* look for an exact match of whatever they pass in. |
821 | * If it is a file, assume it is the dump file. | |
822 | * If a directory, remember that it existed so we | |
823 | * can combine traces in that directory later | |
824 | */ | |
9e066e23 | 825 | ret = stat(filename, &st); |
2203e914 CM |
826 | if (ret == 0) { |
827 | if (S_ISREG(st.st_mode)) | |
828 | return strdup(filename); | |
829 | ||
830 | if (S_ISDIR(st.st_mode)) | |
831 | found_dir = 1; | |
832 | } | |
9e066e23 | 833 | |
c1ab63ed AP |
834 | if (found_dir) { |
835 | int i; | |
836 | /* Eat up trailing '/'s */ | |
d6b58e52 | 837 | for (i = len - 1; filename[i] == '/'; i--) |
c1ab63ed AP |
838 | filename[i] = '\0'; |
839 | } | |
840 | ||
2203e914 CM |
841 | /* |
842 | * try tacking .dump onto the end and see if that already | |
843 | * has been generated | |
844 | */ | |
d6b58e52 AP |
845 | ret = asprintf(&dumpfile, "%s.dump", filename); |
846 | if (ret == -1) { | |
847 | perror("Error building dump file name"); | |
848 | return NULL; | |
849 | } | |
850 | ret = stat(dumpfile, &st); | |
9e066e23 | 851 | if (ret == 0) |
d6b58e52 | 852 | return dumpfile; |
9e066e23 | 853 | |
2203e914 CM |
854 | /* |
855 | * try to generate the .dump from all the traces in | |
856 | * a single dir. | |
857 | */ | |
858 | if (found_dir) { | |
d6b58e52 AP |
859 | int count; |
860 | struct tracelist *traces = traces_list(filename, &count); | |
861 | if (traces) { | |
862 | ret = dump_traces(traces, count, dumpfile); | |
863 | traces_free(traces); | |
864 | if (ret == 0) | |
865 | return dumpfile; | |
866 | } | |
2203e914 | 867 | } |
d6b58e52 | 868 | free(dumpfile); |
2203e914 CM |
869 | |
870 | /* | |
871 | * try to generate the .dump from all the blktrace | |
872 | * files for a named trace | |
873 | */ | |
d6b58e52 | 874 | dot = strrchr(filename, '.'); |
9e066e23 | 875 | if (!dot || strcmp(".dump", dot) != 0) { |
d6b58e52 AP |
876 | struct tracelist trace = {0}; |
877 | if (dot && dot != filename) | |
878 | len = dot - filename; | |
879 | ||
880 | ret = asprintf(&trace.name, "%*s.blktrace.0", len, filename); | |
881 | if (ret == -1) | |
882 | return NULL; | |
883 | ret = asprintf(&dumpfile, "%*s.dump", len, filename); | |
884 | if (ret == -1) { | |
885 | free(trace.name); | |
886 | return NULL; | |
887 | } | |
888 | ||
889 | ret = dump_traces(&trace, 1, dumpfile); | |
9e066e23 | 890 | if (ret == 0) { |
d6b58e52 AP |
891 | free(trace.name); |
892 | return dumpfile; | |
9e066e23 | 893 | } |
d6b58e52 AP |
894 | free(trace.name); |
895 | free(dumpfile); | |
9e066e23 | 896 | } |
9e066e23 CM |
897 | return NULL; |
898 | } | |
899 | struct trace *open_trace(char *filename) | |
900 | { | |
901 | int fd; | |
902 | char *p; | |
903 | struct stat st; | |
904 | int ret; | |
905 | struct trace *trace; | |
906 | char *found_filename; | |
907 | ||
908 | trace = calloc(1, sizeof(*trace)); | |
909 | if (!trace) { | |
910 | fprintf(stderr, "unable to allocate memory for trace\n"); | |
911 | return NULL; | |
912 | } | |
913 | ||
914 | found_filename = find_trace_file(filename); | |
915 | if (!found_filename) { | |
916 | fprintf(stderr, "Unable to find trace file %s\n", filename); | |
917 | goto fail; | |
918 | } | |
9e066e23 CM |
919 | filename = found_filename; |
920 | ||
921 | fd = open(filename, O_RDONLY); | |
922 | if (fd < 0) { | |
923 | fprintf(stderr, "Unable to open trace file %s err %s\n", filename, strerror(errno)); | |
924 | goto fail; | |
925 | } | |
926 | ret = fstat(fd, &st); | |
927 | if (ret < 0) { | |
928 | fprintf(stderr, "stat failed on %s err %s\n", filename, strerror(errno)); | |
929 | goto fail_fd; | |
930 | } | |
931 | p = mmap(NULL, st.st_size, PROT_READ, MAP_PRIVATE, fd, 0); | |
932 | if (p == MAP_FAILED) { | |
933 | fprintf(stderr, "Unable to mmap trace file %s, err %s\n", filename, strerror(errno)); | |
934 | goto fail_fd; | |
935 | } | |
936 | trace->fd = fd; | |
937 | trace->len = st.st_size; | |
938 | trace->start = p; | |
939 | trace->cur = p; | |
940 | trace->io = (struct blk_io_trace *)p; | |
941 | return trace; | |
942 | ||
943 | fail_fd: | |
944 | close(fd); | |
945 | fail: | |
946 | free(trace); | |
947 | return NULL; | |
948 | } | |
949 | static inline int tput_event(struct trace *trace) | |
950 | { | |
951 | if (trace->found_completion) | |
952 | return __BLK_TA_COMPLETE; | |
953 | if (trace->found_issue) | |
954 | return __BLK_TA_ISSUE; | |
955 | if (trace->found_queue) | |
956 | return __BLK_TA_QUEUE; | |
957 | ||
958 | return __BLK_TA_COMPLETE; | |
959 | } | |
960 | ||
f2e40ddd JK |
961 | int action_char_to_num(char action) |
962 | { | |
963 | switch (action) { | |
964 | case 'Q': | |
965 | return __BLK_TA_QUEUE; | |
966 | case 'D': | |
967 | return __BLK_TA_ISSUE; | |
968 | case 'C': | |
969 | return __BLK_TA_COMPLETE; | |
970 | } | |
971 | return -1; | |
972 | } | |
973 | ||
9e066e23 CM |
974 | static inline int io_event(struct trace *trace) |
975 | { | |
f2e40ddd JK |
976 | if (plot_io_action) |
977 | return plot_io_action; | |
9e066e23 CM |
978 | if (trace->found_queue) |
979 | return __BLK_TA_QUEUE; | |
980 | if (trace->found_issue) | |
981 | return __BLK_TA_ISSUE; | |
982 | if (trace->found_completion) | |
983 | return __BLK_TA_COMPLETE; | |
984 | ||
985 | return __BLK_TA_COMPLETE; | |
986 | } | |
987 | ||
2203e914 CM |
988 | void add_tput(struct trace *trace, struct graph_line_data *writes_gld, |
989 | struct graph_line_data *reads_gld) | |
9e066e23 CM |
990 | { |
991 | struct blk_io_trace *io = trace->io; | |
2203e914 | 992 | struct graph_line_data *gld; |
1582ecc9 | 993 | int action = io->action & BLK_TA_MASK; |
9e066e23 CM |
994 | int seconds; |
995 | ||
996 | if (io->action & BLK_TC_ACT(BLK_TC_NOTIFY)) | |
997 | return; | |
998 | ||
999 | if (action != tput_event(trace)) | |
1000 | return; | |
1001 | ||
2203e914 CM |
1002 | if (BLK_DATADIR(io->action) & BLK_TC_READ) |
1003 | gld = reads_gld; | |
1004 | else | |
1005 | gld = writes_gld; | |
1006 | ||
9e066e23 | 1007 | seconds = SECONDS(io->time); |
9e066e23 | 1008 | gld->data[seconds].sum += io->bytes; |
2203e914 | 1009 | |
9e066e23 CM |
1010 | gld->data[seconds].count = 1; |
1011 | if (gld->data[seconds].sum > gld->max) | |
1012 | gld->max = gld->data[seconds].sum; | |
1013 | } | |
1014 | ||
0a43b43f JK |
1015 | #define GDD_PTR_ALLOC_STEP 16 |
1016 | ||
1017 | static struct pid_map *get_pid_map(struct trace_file *tf, u32 pid) | |
1018 | { | |
1019 | struct pid_map *pm; | |
1020 | ||
1021 | if (!io_per_process) { | |
1022 | if (!tf->io_plots) | |
1023 | tf->io_plots = 1; | |
1024 | return NULL; | |
1025 | } | |
1026 | ||
1027 | pm = process_hash_insert(pid, NULL); | |
1028 | /* New entry? */ | |
1029 | if (!pm->index) { | |
1030 | if (tf->io_plots == tf->io_plots_allocated) { | |
1031 | tf->io_plots_allocated += GDD_PTR_ALLOC_STEP; | |
1032 | tf->gdd_reads = realloc(tf->gdd_reads, tf->io_plots_allocated * sizeof(struct graph_dot_data *)); | |
1033 | if (!tf->gdd_reads) | |
1034 | abort(); | |
1035 | tf->gdd_writes = realloc(tf->gdd_writes, tf->io_plots_allocated * sizeof(struct graph_dot_data *)); | |
1036 | if (!tf->gdd_writes) | |
1037 | abort(); | |
1038 | memset(tf->gdd_reads + tf->io_plots_allocated - GDD_PTR_ALLOC_STEP, | |
1039 | 0, GDD_PTR_ALLOC_STEP * sizeof(struct graph_dot_data *)); | |
1040 | memset(tf->gdd_writes + tf->io_plots_allocated - GDD_PTR_ALLOC_STEP, | |
1041 | 0, GDD_PTR_ALLOC_STEP * sizeof(struct graph_dot_data *)); | |
1042 | } | |
1043 | pm->index = tf->io_plots++; | |
1044 | ||
1045 | return pm; | |
1046 | } | |
1047 | return pm; | |
1048 | } | |
1049 | ||
1050 | void add_io(struct trace *trace, struct trace_file *tf) | |
9e066e23 CM |
1051 | { |
1052 | struct blk_io_trace *io = trace->io; | |
1582ecc9 | 1053 | int action = io->action & BLK_TA_MASK; |
9e066e23 | 1054 | u64 offset; |
0a43b43f JK |
1055 | int index; |
1056 | char *label; | |
1057 | struct pid_map *pm; | |
9e066e23 CM |
1058 | |
1059 | if (io->action & BLK_TC_ACT(BLK_TC_NOTIFY)) | |
1060 | return; | |
1061 | ||
1062 | if (action != io_event(trace)) | |
1063 | return; | |
1064 | ||
2203e914 | 1065 | offset = map_io(trace, io); |
9e066e23 | 1066 | |
0a43b43f JK |
1067 | pm = get_pid_map(tf, io->pid); |
1068 | if (!pm) { | |
1069 | index = 0; | |
1070 | label = ""; | |
1071 | } else { | |
1072 | index = pm->index; | |
1073 | label = pm->name; | |
1074 | } | |
1075 | if (BLK_DATADIR(io->action) & BLK_TC_READ) { | |
1076 | if (!tf->gdd_reads[index]) | |
1077 | tf->gdd_reads[index] = alloc_dot_data(tf->min_seconds, tf->max_seconds, tf->min_offset, tf->max_offset, tf->stop_seconds, pick_color(), strdup(label)); | |
1078 | set_gdd_bit(tf->gdd_reads[index], offset, io->bytes, io->time); | |
1079 | } else if (BLK_DATADIR(io->action) & BLK_TC_WRITE) { | |
1080 | if (!tf->gdd_writes[index]) | |
1081 | tf->gdd_writes[index] = alloc_dot_data(tf->min_seconds, tf->max_seconds, tf->min_offset, tf->max_offset, tf->stop_seconds, pick_color(), strdup(label)); | |
1082 | set_gdd_bit(tf->gdd_writes[index], offset, io->bytes, io->time); | |
1083 | } | |
9e066e23 CM |
1084 | } |
1085 | ||
1086 | void add_pending_io(struct trace *trace, struct graph_line_data *gld) | |
1087 | { | |
22dd439a | 1088 | unsigned int seconds; |
9e066e23 | 1089 | struct blk_io_trace *io = trace->io; |
1582ecc9 | 1090 | int action = io->action & BLK_TA_MASK; |
9e066e23 | 1091 | double avg; |
854a1f24 | 1092 | struct pending_io *pio; |
9e066e23 CM |
1093 | |
1094 | if (io->action & BLK_TC_ACT(BLK_TC_NOTIFY)) | |
1095 | return; | |
1096 | ||
0a43b43f | 1097 | if (action == __BLK_TA_QUEUE) { |
854a1f24 CM |
1098 | if (trace->found_issue || trace->found_completion) |
1099 | hash_queued_io(trace->io); | |
0a43b43f JK |
1100 | return; |
1101 | } | |
ff045fe7 JK |
1102 | if (action == __BLK_TA_REQUEUE) { |
1103 | if (ios_in_flight > 0) | |
1104 | ios_in_flight--; | |
1105 | return; | |
1106 | } | |
9e066e23 CM |
1107 | if (action != __BLK_TA_ISSUE) |
1108 | return; | |
1109 | ||
854a1f24 CM |
1110 | pio = hash_dispatched_io(trace->io); |
1111 | if (!pio) | |
9e066e23 CM |
1112 | return; |
1113 | ||
854a1f24 CM |
1114 | if (!trace->found_completion) { |
1115 | list_del(&pio->hash_list); | |
1116 | free(pio); | |
1117 | } | |
1118 | ||
9e066e23 CM |
1119 | ios_in_flight++; |
1120 | ||
6a079b02 | 1121 | seconds = SECONDS(io->time); |
9e066e23 CM |
1122 | gld->data[seconds].sum += ios_in_flight; |
1123 | gld->data[seconds].count++; | |
1124 | ||
1125 | avg = (double)gld->data[seconds].sum / gld->data[seconds].count; | |
1126 | if (gld->max < (u64)avg) { | |
1127 | gld->max = avg; | |
1128 | } | |
1129 | } | |
1130 | ||
1131 | void add_completed_io(struct trace *trace, | |
1132 | struct graph_line_data *latency_gld) | |
1133 | { | |
1134 | struct blk_io_trace *io = trace->io; | |
1135 | int seconds; | |
1582ecc9 | 1136 | int action = io->action & BLK_TA_MASK; |
9e066e23 CM |
1137 | struct pending_io *pio; |
1138 | double avg; | |
1139 | u64 latency; | |
1140 | ||
1141 | if (io->action & BLK_TC_ACT(BLK_TC_NOTIFY)) | |
1142 | return; | |
1143 | ||
1144 | if (action != __BLK_TA_COMPLETE) | |
1145 | return; | |
1146 | ||
1147 | seconds = SECONDS(io->time); | |
1148 | ||
1149 | pio = hash_completed_io(trace->io); | |
1150 | if (!pio) | |
1151 | return; | |
1152 | ||
1153 | if (ios_in_flight > 0) | |
1154 | ios_in_flight--; | |
1155 | if (io->time >= pio->dispatch_time) { | |
1156 | latency = io->time - pio->dispatch_time; | |
1157 | latency_gld->data[seconds].sum += latency; | |
1158 | latency_gld->data[seconds].count++; | |
1159 | } | |
1160 | ||
1161 | list_del(&pio->hash_list); | |
1162 | free(pio); | |
1163 | ||
1164 | avg = (double)latency_gld->data[seconds].sum / | |
1165 | latency_gld->data[seconds].count; | |
1166 | if (latency_gld->max < (u64)avg) { | |
1167 | latency_gld->max = avg; | |
1168 | } | |
1169 | } | |
1170 | ||
1171 | void add_iop(struct trace *trace, struct graph_line_data *gld) | |
1172 | { | |
1173 | struct blk_io_trace *io = trace->io; | |
1582ecc9 | 1174 | int action = io->action & BLK_TA_MASK; |
9e066e23 CM |
1175 | int seconds; |
1176 | ||
1177 | if (io->action & BLK_TC_ACT(BLK_TC_NOTIFY)) | |
1178 | return; | |
1179 | ||
1180 | /* iops and tput use the same events */ | |
1181 | if (action != tput_event(trace)) | |
1182 | return; | |
1183 | ||
1184 | seconds = SECONDS(io->time); | |
9e066e23 CM |
1185 | gld->data[seconds].sum += 1; |
1186 | gld->data[seconds].count = 1; | |
1187 | if (gld->data[seconds].sum > gld->max) | |
1188 | gld->max = gld->data[seconds].sum; | |
1189 | } | |
1190 | ||
1191 | void check_record(struct trace *trace) | |
1192 | { | |
9e066e23 CM |
1193 | handle_notify(trace); |
1194 | } |