Commit | Line | Data |
---|---|---|
ac9b9101 JA |
1 | /* |
2 | * Code related to writing an iolog of what a thread is doing, and to | |
3 | * later read that back and replay | |
4 | */ | |
5 | #include <stdio.h> | |
6 | #include <stdlib.h> | |
7 | #include <libgen.h> | |
8 | #include <assert.h> | |
b26317c9 JA |
9 | #include <sys/types.h> |
10 | #include <sys/stat.h> | |
11 | #include <unistd.h> | |
aee2ab67 JA |
12 | #ifdef CONFIG_ZLIB |
13 | #include <zlib.h> | |
14 | #endif | |
15 | ||
ac9b9101 JA |
16 | #include "flist.h" |
17 | #include "fio.h" | |
18 | #include "verify.h" | |
19 | #include "trim.h" | |
243bfe19 | 20 | #include "filelock.h" |
a47591e4 | 21 | #include "smalloc.h" |
ac9b9101 | 22 | |
7e419452 JA |
23 | static int iolog_flush(struct io_log *log); |
24 | ||
ac9b9101 JA |
25 | static const char iolog_ver2[] = "fio version 2 iolog"; |
26 | ||
27 | void queue_io_piece(struct thread_data *td, struct io_piece *ipo) | |
28 | { | |
29 | flist_add_tail(&ipo->list, &td->io_log_list); | |
30 | td->total_io_size += ipo->len; | |
31 | } | |
32 | ||
1f440ece | 33 | void log_io_u(const struct thread_data *td, const struct io_u *io_u) |
ac9b9101 | 34 | { |
ac9b9101 JA |
35 | if (!td->o.write_iolog_file) |
36 | return; | |
37 | ||
38 | fprintf(td->iolog_f, "%s %s %llu %lu\n", io_u->file->file_name, | |
173375c2 JA |
39 | io_ddir_name(io_u->ddir), |
40 | io_u->offset, io_u->buflen); | |
ac9b9101 JA |
41 | } |
42 | ||
43 | void log_file(struct thread_data *td, struct fio_file *f, | |
44 | enum file_log_act what) | |
45 | { | |
46 | const char *act[] = { "add", "open", "close" }; | |
47 | ||
48 | assert(what < 3); | |
49 | ||
50 | if (!td->o.write_iolog_file) | |
51 | return; | |
52 | ||
53 | ||
54 | /* | |
55 | * this happens on the pre-open/close done before the job starts | |
56 | */ | |
57 | if (!td->iolog_f) | |
58 | return; | |
59 | ||
60 | fprintf(td->iolog_f, "%s %s\n", f->file_name, act[what]); | |
61 | } | |
62 | ||
63 | static void iolog_delay(struct thread_data *td, unsigned long delay) | |
64 | { | |
df8fb609 JA |
65 | uint64_t usec = utime_since_now(&td->last_issue); |
66 | uint64_t this_delay; | |
67 | struct timeval tv; | |
ac9b9101 | 68 | |
df8fb609 JA |
69 | if (delay < td->time_offset) { |
70 | td->time_offset = 0; | |
71 | return; | |
72 | } | |
73 | ||
74 | delay -= td->time_offset; | |
ac9b9101 JA |
75 | if (delay < usec) |
76 | return; | |
77 | ||
78 | delay -= usec; | |
79 | ||
df8fb609 | 80 | fio_gettime(&tv, NULL); |
30b18672 JA |
81 | while (delay && !td->terminate) { |
82 | this_delay = delay; | |
83 | if (this_delay > 500000) | |
84 | this_delay = 500000; | |
85 | ||
86 | usec_sleep(td, this_delay); | |
87 | delay -= this_delay; | |
88 | } | |
df8fb609 JA |
89 | |
90 | usec = utime_since_now(&tv); | |
91 | if (usec > delay) | |
92 | td->time_offset = usec - delay; | |
93 | else | |
94 | td->time_offset = 0; | |
ac9b9101 JA |
95 | } |
96 | ||
97 | static int ipo_special(struct thread_data *td, struct io_piece *ipo) | |
98 | { | |
99 | struct fio_file *f; | |
100 | int ret; | |
101 | ||
102 | /* | |
103 | * Not a special ipo | |
104 | */ | |
105 | if (ipo->ddir != DDIR_INVAL) | |
106 | return 0; | |
107 | ||
108 | f = td->files[ipo->fileno]; | |
109 | ||
110 | switch (ipo->file_action) { | |
111 | case FIO_LOG_OPEN_FILE: | |
112 | ret = td_io_open_file(td, f); | |
113 | if (!ret) | |
114 | break; | |
115 | td_verror(td, ret, "iolog open file"); | |
116 | return -1; | |
117 | case FIO_LOG_CLOSE_FILE: | |
118 | td_io_close_file(td, f); | |
119 | break; | |
120 | case FIO_LOG_UNLINK_FILE: | |
38ef9c90 | 121 | td_io_unlink_file(td, f); |
ac9b9101 JA |
122 | break; |
123 | default: | |
124 | log_err("fio: bad file action %d\n", ipo->file_action); | |
125 | break; | |
126 | } | |
127 | ||
128 | return 1; | |
129 | } | |
130 | ||
131 | int read_iolog_get(struct thread_data *td, struct io_u *io_u) | |
132 | { | |
133 | struct io_piece *ipo; | |
134 | unsigned long elapsed; | |
3c3ed070 | 135 | |
ac9b9101 JA |
136 | while (!flist_empty(&td->io_log_list)) { |
137 | int ret; | |
138 | ||
9342d5f8 | 139 | ipo = flist_first_entry(&td->io_log_list, struct io_piece, list); |
ac9b9101 JA |
140 | flist_del(&ipo->list); |
141 | remove_trim_entry(td, ipo); | |
142 | ||
143 | ret = ipo_special(td, ipo); | |
144 | if (ret < 0) { | |
145 | free(ipo); | |
146 | break; | |
147 | } else if (ret > 0) { | |
148 | free(ipo); | |
149 | continue; | |
150 | } | |
151 | ||
152 | io_u->ddir = ipo->ddir; | |
153 | if (ipo->ddir != DDIR_WAIT) { | |
154 | io_u->offset = ipo->offset; | |
155 | io_u->buflen = ipo->len; | |
156 | io_u->file = td->files[ipo->fileno]; | |
157 | get_file(io_u->file); | |
158 | dprint(FD_IO, "iolog: get %llu/%lu/%s\n", io_u->offset, | |
159 | io_u->buflen, io_u->file->file_name); | |
160 | if (ipo->delay) | |
161 | iolog_delay(td, ipo->delay); | |
162 | } else { | |
163 | elapsed = mtime_since_genesis(); | |
164 | if (ipo->delay > elapsed) | |
165 | usec_sleep(td, (ipo->delay - elapsed) * 1000); | |
ac9b9101 JA |
166 | } |
167 | ||
168 | free(ipo); | |
3c3ed070 | 169 | |
ac9b9101 JA |
170 | if (io_u->ddir != DDIR_WAIT) |
171 | return 0; | |
172 | } | |
173 | ||
174 | td->done = 1; | |
175 | return 1; | |
176 | } | |
177 | ||
178 | void prune_io_piece_log(struct thread_data *td) | |
179 | { | |
180 | struct io_piece *ipo; | |
181 | struct rb_node *n; | |
182 | ||
183 | while ((n = rb_first(&td->io_hist_tree)) != NULL) { | |
184 | ipo = rb_entry(n, struct io_piece, rb_node); | |
185 | rb_erase(n, &td->io_hist_tree); | |
186 | remove_trim_entry(td, ipo); | |
187 | td->io_hist_len--; | |
188 | free(ipo); | |
189 | } | |
190 | ||
191 | while (!flist_empty(&td->io_hist_list)) { | |
4e1020f8 | 192 | ipo = flist_first_entry(&td->io_hist_list, struct io_piece, list); |
ac9b9101 JA |
193 | flist_del(&ipo->list); |
194 | remove_trim_entry(td, ipo); | |
195 | td->io_hist_len--; | |
196 | free(ipo); | |
197 | } | |
198 | } | |
199 | ||
200 | /* | |
201 | * log a successful write, so we can unwind the log for verify | |
202 | */ | |
203 | void log_io_piece(struct thread_data *td, struct io_u *io_u) | |
204 | { | |
205 | struct rb_node **p, *parent; | |
206 | struct io_piece *ipo, *__ipo; | |
207 | ||
208 | ipo = malloc(sizeof(struct io_piece)); | |
209 | init_ipo(ipo); | |
210 | ipo->file = io_u->file; | |
211 | ipo->offset = io_u->offset; | |
212 | ipo->len = io_u->buflen; | |
da0a7bd2 | 213 | ipo->numberio = io_u->numberio; |
f9401285 JA |
214 | ipo->flags = IP_F_IN_FLIGHT; |
215 | ||
216 | io_u->ipo = ipo; | |
ac9b9101 JA |
217 | |
218 | if (io_u_should_trim(td, io_u)) { | |
219 | flist_add_tail(&ipo->trim_list, &td->trim_list); | |
220 | td->trim_entries++; | |
221 | } | |
222 | ||
223 | /* | |
224 | * We don't need to sort the entries, if: | |
225 | * | |
226 | * Sequential writes, or | |
227 | * Random writes that lay out the file as it goes along | |
228 | * | |
229 | * For both these cases, just reading back data in the order we | |
230 | * wrote it out is the fastest. | |
231 | * | |
232 | * One exception is if we don't have a random map AND we are doing | |
233 | * verifies, in that case we need to check for duplicate blocks and | |
234 | * drop the old one, which we rely on the rb insert/lookup for | |
235 | * handling. | |
236 | */ | |
c4b6117b | 237 | if (((!td->o.verifysort) || !td_random(td) || !td->o.overwrite) && |
ac9b9101 JA |
238 | (file_randommap(td, ipo->file) || td->o.verify == VERIFY_NONE)) { |
239 | INIT_FLIST_HEAD(&ipo->list); | |
240 | flist_add_tail(&ipo->list, &td->io_hist_list); | |
241 | ipo->flags |= IP_F_ONLIST; | |
242 | td->io_hist_len++; | |
243 | return; | |
244 | } | |
245 | ||
246 | RB_CLEAR_NODE(&ipo->rb_node); | |
247 | ||
248 | /* | |
249 | * Sort the entry into the verification list | |
250 | */ | |
251 | restart: | |
252 | p = &td->io_hist_tree.rb_node; | |
253 | parent = NULL; | |
254 | while (*p) { | |
3b1ff869 | 255 | int overlap = 0; |
ac9b9101 JA |
256 | parent = *p; |
257 | ||
258 | __ipo = rb_entry(parent, struct io_piece, rb_node); | |
259 | if (ipo->file < __ipo->file) | |
260 | p = &(*p)->rb_left; | |
261 | else if (ipo->file > __ipo->file) | |
262 | p = &(*p)->rb_right; | |
3b1ff869 | 263 | else if (ipo->offset < __ipo->offset) { |
ac9b9101 | 264 | p = &(*p)->rb_left; |
3b1ff869 JE |
265 | overlap = ipo->offset + ipo->len > __ipo->offset; |
266 | } | |
267 | else if (ipo->offset > __ipo->offset) { | |
ac9b9101 | 268 | p = &(*p)->rb_right; |
3b1ff869 JE |
269 | overlap = __ipo->offset + __ipo->len > ipo->offset; |
270 | } | |
271 | else | |
272 | overlap = 1; | |
273 | ||
274 | if (overlap) { | |
885ac623 JA |
275 | dprint(FD_IO, "iolog: overlap %llu/%lu, %llu/%lu", |
276 | __ipo->offset, __ipo->len, | |
277 | ipo->offset, ipo->len); | |
ac9b9101 JA |
278 | td->io_hist_len--; |
279 | rb_erase(parent, &td->io_hist_tree); | |
280 | remove_trim_entry(td, __ipo); | |
281 | free(__ipo); | |
282 | goto restart; | |
283 | } | |
284 | } | |
285 | ||
286 | rb_link_node(&ipo->rb_node, parent, p); | |
287 | rb_insert_color(&ipo->rb_node, &td->io_hist_tree); | |
288 | ipo->flags |= IP_F_ONRB; | |
289 | td->io_hist_len++; | |
290 | } | |
291 | ||
890b6656 JA |
292 | void unlog_io_piece(struct thread_data *td, struct io_u *io_u) |
293 | { | |
294 | struct io_piece *ipo = io_u->ipo; | |
295 | ||
66347cfa DE |
296 | if (td->ts.nr_block_infos) { |
297 | uint32_t *info = io_u_block_info(td, io_u); | |
298 | if (BLOCK_INFO_STATE(*info) < BLOCK_STATE_TRIM_FAILURE) { | |
299 | if (io_u->ddir == DDIR_TRIM) | |
300 | *info = BLOCK_INFO_SET_STATE(*info, | |
301 | BLOCK_STATE_TRIM_FAILURE); | |
302 | else if (io_u->ddir == DDIR_WRITE) | |
303 | *info = BLOCK_INFO_SET_STATE(*info, | |
304 | BLOCK_STATE_WRITE_FAILURE); | |
305 | } | |
306 | } | |
307 | ||
890b6656 JA |
308 | if (!ipo) |
309 | return; | |
310 | ||
311 | if (ipo->flags & IP_F_ONRB) | |
312 | rb_erase(&ipo->rb_node, &td->io_hist_tree); | |
313 | else if (ipo->flags & IP_F_ONLIST) | |
314 | flist_del(&ipo->list); | |
315 | ||
316 | free(ipo); | |
317 | io_u->ipo = NULL; | |
318 | td->io_hist_len--; | |
319 | } | |
320 | ||
1f440ece | 321 | void trim_io_piece(struct thread_data *td, const struct io_u *io_u) |
890b6656 JA |
322 | { |
323 | struct io_piece *ipo = io_u->ipo; | |
324 | ||
325 | if (!ipo) | |
326 | return; | |
327 | ||
328 | ipo->len = io_u->xfer_buflen - io_u->resid; | |
329 | } | |
330 | ||
ac9b9101 JA |
331 | void write_iolog_close(struct thread_data *td) |
332 | { | |
333 | fflush(td->iolog_f); | |
334 | fclose(td->iolog_f); | |
335 | free(td->iolog_buf); | |
336 | td->iolog_f = NULL; | |
337 | td->iolog_buf = NULL; | |
338 | } | |
339 | ||
340 | /* | |
341 | * Read version 2 iolog data. It is enhanced to include per-file logging, | |
342 | * syncs, etc. | |
343 | */ | |
344 | static int read_iolog2(struct thread_data *td, FILE *f) | |
345 | { | |
346 | unsigned long long offset; | |
347 | unsigned int bytes; | |
348 | int reads, writes, waits, fileno = 0, file_action = 0; /* stupid gcc */ | |
dac34079 | 349 | char *rfname, *fname, *act; |
ac9b9101 JA |
350 | char *str, *p; |
351 | enum fio_ddir rw; | |
352 | ||
353 | free_release_files(td); | |
354 | ||
355 | /* | |
356 | * Read in the read iolog and store it, reuse the infrastructure | |
357 | * for doing verifications. | |
358 | */ | |
359 | str = malloc(4096); | |
dac34079 | 360 | rfname = fname = malloc(256+16); |
ac9b9101 JA |
361 | act = malloc(256+16); |
362 | ||
363 | reads = writes = waits = 0; | |
364 | while ((p = fgets(str, 4096, f)) != NULL) { | |
365 | struct io_piece *ipo; | |
366 | int r; | |
367 | ||
dac34079 | 368 | r = sscanf(p, "%256s %256s %llu %u", rfname, act, &offset, |
ac9b9101 | 369 | &bytes); |
dac34079 JA |
370 | |
371 | if (td->o.replay_redirect) | |
372 | fname = td->o.replay_redirect; | |
373 | ||
ac9b9101 JA |
374 | if (r == 4) { |
375 | /* | |
376 | * Check action first | |
377 | */ | |
378 | if (!strcmp(act, "wait")) | |
379 | rw = DDIR_WAIT; | |
380 | else if (!strcmp(act, "read")) | |
381 | rw = DDIR_READ; | |
382 | else if (!strcmp(act, "write")) | |
383 | rw = DDIR_WRITE; | |
384 | else if (!strcmp(act, "sync")) | |
385 | rw = DDIR_SYNC; | |
386 | else if (!strcmp(act, "datasync")) | |
387 | rw = DDIR_DATASYNC; | |
388 | else if (!strcmp(act, "trim")) | |
389 | rw = DDIR_TRIM; | |
390 | else { | |
391 | log_err("fio: bad iolog file action: %s\n", | |
392 | act); | |
393 | continue; | |
394 | } | |
033ace1e | 395 | fileno = get_fileno(td, fname); |
ac9b9101 JA |
396 | } else if (r == 2) { |
397 | rw = DDIR_INVAL; | |
398 | if (!strcmp(act, "add")) { | |
5903e7b7 | 399 | fileno = add_file(td, fname, 0, 1); |
ac9b9101 JA |
400 | file_action = FIO_LOG_ADD_FILE; |
401 | continue; | |
402 | } else if (!strcmp(act, "open")) { | |
403 | fileno = get_fileno(td, fname); | |
404 | file_action = FIO_LOG_OPEN_FILE; | |
405 | } else if (!strcmp(act, "close")) { | |
406 | fileno = get_fileno(td, fname); | |
407 | file_action = FIO_LOG_CLOSE_FILE; | |
408 | } else { | |
409 | log_err("fio: bad iolog file action: %s\n", | |
410 | act); | |
411 | continue; | |
412 | } | |
413 | } else { | |
414 | log_err("bad iolog2: %s", p); | |
415 | continue; | |
416 | } | |
417 | ||
418 | if (rw == DDIR_READ) | |
419 | reads++; | |
420 | else if (rw == DDIR_WRITE) { | |
421 | /* | |
422 | * Don't add a write for ro mode | |
423 | */ | |
424 | if (read_only) | |
425 | continue; | |
426 | writes++; | |
427 | } else if (rw == DDIR_WAIT) { | |
74dff443 JA |
428 | if (td->o.no_stall) |
429 | continue; | |
ac9b9101 JA |
430 | waits++; |
431 | } else if (rw == DDIR_INVAL) { | |
432 | } else if (!ddir_sync(rw)) { | |
433 | log_err("bad ddir: %d\n", rw); | |
434 | continue; | |
435 | } | |
436 | ||
437 | /* | |
438 | * Make note of file | |
439 | */ | |
440 | ipo = malloc(sizeof(*ipo)); | |
441 | init_ipo(ipo); | |
442 | ipo->ddir = rw; | |
443 | if (rw == DDIR_WAIT) { | |
444 | ipo->delay = offset; | |
445 | } else { | |
446 | ipo->offset = offset; | |
447 | ipo->len = bytes; | |
42793d94 | 448 | if (rw != DDIR_INVAL && bytes > td->o.max_bs[rw]) |
ac9b9101 JA |
449 | td->o.max_bs[rw] = bytes; |
450 | ipo->fileno = fileno; | |
451 | ipo->file_action = file_action; | |
70afff59 | 452 | td->o.size += bytes; |
ac9b9101 | 453 | } |
3c3ed070 | 454 | |
ac9b9101 JA |
455 | queue_io_piece(td, ipo); |
456 | } | |
457 | ||
458 | free(str); | |
459 | free(act); | |
dac34079 | 460 | free(rfname); |
ac9b9101 JA |
461 | |
462 | if (writes && read_only) { | |
463 | log_err("fio: <%s> skips replay of %d writes due to" | |
464 | " read-only\n", td->o.name, writes); | |
465 | writes = 0; | |
466 | } | |
467 | ||
468 | if (!reads && !writes && !waits) | |
469 | return 1; | |
470 | else if (reads && !writes) | |
471 | td->o.td_ddir = TD_DDIR_READ; | |
472 | else if (!reads && writes) | |
473 | td->o.td_ddir = TD_DDIR_WRITE; | |
474 | else | |
475 | td->o.td_ddir = TD_DDIR_RW; | |
476 | ||
477 | return 0; | |
478 | } | |
479 | ||
480 | /* | |
481 | * open iolog, check version, and call appropriate parser | |
482 | */ | |
483 | static int init_iolog_read(struct thread_data *td) | |
484 | { | |
485 | char buffer[256], *p; | |
486 | FILE *f; | |
487 | int ret; | |
488 | ||
489 | f = fopen(td->o.read_iolog_file, "r"); | |
490 | if (!f) { | |
491 | perror("fopen read iolog"); | |
492 | return 1; | |
493 | } | |
494 | ||
495 | p = fgets(buffer, sizeof(buffer), f); | |
496 | if (!p) { | |
497 | td_verror(td, errno, "iolog read"); | |
498 | log_err("fio: unable to read iolog\n"); | |
499 | fclose(f); | |
500 | return 1; | |
501 | } | |
502 | ||
503 | /* | |
504 | * version 2 of the iolog stores a specific string as the | |
505 | * first line, check for that | |
506 | */ | |
507 | if (!strncmp(iolog_ver2, buffer, strlen(iolog_ver2))) | |
508 | ret = read_iolog2(td, f); | |
509 | else { | |
510 | log_err("fio: iolog version 1 is no longer supported\n"); | |
511 | ret = 1; | |
512 | } | |
513 | ||
514 | fclose(f); | |
515 | return ret; | |
516 | } | |
517 | ||
518 | /* | |
519 | * Set up a log for storing io patterns. | |
520 | */ | |
521 | static int init_iolog_write(struct thread_data *td) | |
522 | { | |
523 | struct fio_file *ff; | |
524 | FILE *f; | |
525 | unsigned int i; | |
526 | ||
527 | f = fopen(td->o.write_iolog_file, "a"); | |
528 | if (!f) { | |
529 | perror("fopen write iolog"); | |
530 | return 1; | |
531 | } | |
532 | ||
533 | /* | |
534 | * That's it for writing, setup a log buffer and we're done. | |
535 | */ | |
536 | td->iolog_f = f; | |
537 | td->iolog_buf = malloc(8192); | |
538 | setvbuf(f, td->iolog_buf, _IOFBF, 8192); | |
539 | ||
540 | /* | |
541 | * write our version line | |
542 | */ | |
543 | if (fprintf(f, "%s\n", iolog_ver2) < 0) { | |
544 | perror("iolog init\n"); | |
545 | return 1; | |
546 | } | |
547 | ||
548 | /* | |
549 | * add all known files | |
550 | */ | |
551 | for_each_file(td, ff, i) | |
552 | log_file(td, ff, FIO_LOG_ADD_FILE); | |
553 | ||
554 | return 0; | |
555 | } | |
556 | ||
557 | int init_iolog(struct thread_data *td) | |
558 | { | |
559 | int ret = 0; | |
560 | ||
561 | if (td->o.read_iolog_file) { | |
d95b34a6 JA |
562 | int need_swap; |
563 | ||
ac9b9101 JA |
564 | /* |
565 | * Check if it's a blktrace file and load that if possible. | |
566 | * Otherwise assume it's a normal log file and load that. | |
567 | */ | |
d95b34a6 JA |
568 | if (is_blktrace(td->o.read_iolog_file, &need_swap)) |
569 | ret = load_blktrace(td, td->o.read_iolog_file, need_swap); | |
ac9b9101 JA |
570 | else |
571 | ret = init_iolog_read(td); | |
572 | } else if (td->o.write_iolog_file) | |
573 | ret = init_iolog_write(td); | |
574 | ||
f01b34ae JA |
575 | if (ret) |
576 | td_verror(td, EINVAL, "failed initializing iolog"); | |
577 | ||
ac9b9101 JA |
578 | return ret; |
579 | } | |
580 | ||
aee2ab67 JA |
581 | void setup_log(struct io_log **log, struct log_params *p, |
582 | const char *filename) | |
ac9b9101 | 583 | { |
e75cc8f3 | 584 | struct io_log *l; |
65a4d15c KC |
585 | int i; |
586 | struct io_u_plat_entry *entry; | |
587 | struct flist_head *list; | |
ac9b9101 | 588 | |
7e419452 JA |
589 | l = scalloc(1, sizeof(*l)); |
590 | INIT_FLIST_HEAD(&l->io_logs); | |
aee2ab67 JA |
591 | l->log_type = p->log_type; |
592 | l->log_offset = p->log_offset; | |
593 | l->log_gz = p->log_gz; | |
b26317c9 | 594 | l->log_gz_store = p->log_gz_store; |
aee2ab67 | 595 | l->avg_msec = p->avg_msec; |
1e613c9c KC |
596 | l->hist_msec = p->hist_msec; |
597 | l->hist_coarseness = p->hist_coarseness; | |
cb7e0ace | 598 | l->filename = strdup(filename); |
aee2ab67 JA |
599 | l->td = p->td; |
600 | ||
65a4d15c KC |
601 | /* Initialize histogram lists for each r/w direction, |
602 | * with initial io_u_plat of all zeros: | |
603 | */ | |
604 | for (i = 0; i < DDIR_RWDIR_CNT; i++) { | |
d730bc58 | 605 | list = &l->hist_window[i].list; |
65a4d15c KC |
606 | INIT_FLIST_HEAD(list); |
607 | entry = calloc(1, sizeof(struct io_u_plat_entry)); | |
608 | flist_add(&entry->list, list); | |
609 | } | |
610 | ||
1fed2080 JA |
611 | if (l->td && l->td->o.io_submit_mode != IO_MODE_OFFLOAD) { |
612 | struct io_logs *p; | |
613 | ||
614 | p = calloc(1, sizeof(*l->pending)); | |
a9afa45a | 615 | p->max_samples = DEF_LOG_ENTRIES; |
1fed2080 JA |
616 | p->log = calloc(p->max_samples, log_entry_sz(l)); |
617 | l->pending = p; | |
618 | } | |
619 | ||
b26317c9 | 620 | if (l->log_offset) |
49e98daa | 621 | l->log_ddir_mask = LOG_OFFSET_SAMPLE_BIT; |
b26317c9 | 622 | |
aee2ab67 JA |
623 | INIT_FLIST_HEAD(&l->chunk_list); |
624 | ||
625 | if (l->log_gz && !p->td) | |
626 | l->log_gz = 0; | |
19417eda | 627 | else if (l->log_gz || l->log_gz_store) { |
34febb23 | 628 | mutex_init_pshared(&l->chunk_lock); |
aee2ab67 JA |
629 | p->td->flags |= TD_F_COMPRESS_LOG; |
630 | } | |
631 | ||
ac9b9101 JA |
632 | *log = l; |
633 | } | |
634 | ||
2e802282 JA |
635 | #ifdef CONFIG_SETVBUF |
636 | static void *set_file_buffer(FILE *f) | |
637 | { | |
638 | size_t size = 1048576; | |
639 | void *buf; | |
640 | ||
641 | buf = malloc(size); | |
642 | setvbuf(f, buf, _IOFBF, size); | |
643 | return buf; | |
644 | } | |
645 | ||
646 | static void clear_file_buffer(void *buf) | |
647 | { | |
648 | free(buf); | |
649 | } | |
650 | #else | |
651 | static void *set_file_buffer(FILE *f) | |
652 | { | |
653 | return NULL; | |
654 | } | |
655 | ||
656 | static void clear_file_buffer(void *buf) | |
657 | { | |
658 | } | |
659 | #endif | |
660 | ||
518dac09 | 661 | void free_log(struct io_log *log) |
cb7e0ace | 662 | { |
7e419452 JA |
663 | while (!flist_empty(&log->io_logs)) { |
664 | struct io_logs *cur_log; | |
665 | ||
666 | cur_log = flist_first_entry(&log->io_logs, struct io_logs, list); | |
667 | flist_del_init(&cur_log->list); | |
668 | free(cur_log->log); | |
2b7625e2 | 669 | sfree(cur_log); |
7e419452 JA |
670 | } |
671 | ||
1fed2080 JA |
672 | if (log->pending) { |
673 | free(log->pending->log); | |
674 | free(log->pending); | |
675 | log->pending = NULL; | |
676 | } | |
677 | ||
678 | free(log->pending); | |
cb7e0ace | 679 | free(log->filename); |
a47591e4 | 680 | sfree(log); |
cb7e0ace JA |
681 | } |
682 | ||
868f6f03 | 683 | inline unsigned long hist_sum(int j, int stride, unsigned int *io_u_plat, |
65a4d15c | 684 | unsigned int *io_u_plat_last) |
548df930 | 685 | { |
f2c972cc JA |
686 | unsigned long sum; |
687 | int k; | |
548df930 | 688 | |
868f6f03 KC |
689 | if (io_u_plat_last) { |
690 | for (k = sum = 0; k < stride; k++) | |
691 | sum += io_u_plat[j + k] - io_u_plat_last[j + k]; | |
692 | } else { | |
693 | for (k = sum = 0; k < stride; k++) | |
694 | sum += io_u_plat[j + k]; | |
695 | } | |
548df930 | 696 | |
1e613c9c KC |
697 | return sum; |
698 | } | |
699 | ||
a89ba4b1 JA |
700 | static void flush_hist_samples(FILE *f, int hist_coarseness, void *samples, |
701 | uint64_t sample_size) | |
1e613c9c KC |
702 | { |
703 | struct io_sample *s; | |
704 | int log_offset; | |
705 | uint64_t i, j, nr_samples; | |
65a4d15c | 706 | struct io_u_plat_entry *entry, *entry_before; |
1e613c9c | 707 | unsigned int *io_u_plat; |
65a4d15c | 708 | unsigned int *io_u_plat_before; |
1e613c9c KC |
709 | |
710 | int stride = 1 << hist_coarseness; | |
711 | ||
712 | if (!sample_size) | |
713 | return; | |
714 | ||
715 | s = __get_sample(samples, 0, 0); | |
716 | log_offset = (s->__ddir & LOG_OFFSET_SAMPLE_BIT) != 0; | |
717 | ||
718 | nr_samples = sample_size / __log_entry_sz(log_offset); | |
719 | ||
720 | for (i = 0; i < nr_samples; i++) { | |
721 | s = __get_sample(samples, log_offset, i); | |
d730bc58 | 722 | |
66da8a60 | 723 | entry = (struct io_u_plat_entry *) (uintptr_t) s->val; |
65a4d15c | 724 | io_u_plat = entry->io_u_plat; |
d730bc58 | 725 | |
65a4d15c KC |
726 | entry_before = flist_first_entry(&entry->list, struct io_u_plat_entry, list); |
727 | io_u_plat_before = entry_before->io_u_plat; | |
d730bc58 JA |
728 | |
729 | fprintf(f, "%lu, %u, %u, ", (unsigned long) s->time, | |
730 | io_sample_ddir(s), s->bs); | |
1e613c9c | 731 | for (j = 0; j < FIO_IO_U_PLAT_NR - stride; j += stride) { |
d730bc58 JA |
732 | fprintf(f, "%lu, ", hist_sum(j, stride, io_u_plat, |
733 | io_u_plat_before)); | |
1e613c9c | 734 | } |
d730bc58 | 735 | fprintf(f, "%lu\n", (unsigned long) |
65a4d15c | 736 | hist_sum(FIO_IO_U_PLAT_NR - stride, stride, io_u_plat, |
d730bc58 JA |
737 | io_u_plat_before)); |
738 | ||
65a4d15c KC |
739 | flist_del(&entry_before->list); |
740 | free(entry_before); | |
1e613c9c KC |
741 | } |
742 | } | |
743 | ||
bead01d7 | 744 | void flush_samples(FILE *f, void *samples, uint64_t sample_size) |
ac9b9101 | 745 | { |
b26317c9 JA |
746 | struct io_sample *s; |
747 | int log_offset; | |
748 | uint64_t i, nr_samples; | |
749 | ||
750 | if (!sample_size) | |
751 | return; | |
752 | ||
753 | s = __get_sample(samples, 0, 0); | |
49e98daa | 754 | log_offset = (s->__ddir & LOG_OFFSET_SAMPLE_BIT) != 0; |
b26317c9 JA |
755 | |
756 | nr_samples = sample_size / __log_entry_sz(log_offset); | |
ac9b9101 | 757 | |
aee2ab67 | 758 | for (i = 0; i < nr_samples; i++) { |
b26317c9 | 759 | s = __get_sample(samples, log_offset, i); |
ac9b9101 | 760 | |
aee2ab67 | 761 | if (!log_offset) { |
ae588852 JA |
762 | fprintf(f, "%lu, %lu, %u, %u\n", |
763 | (unsigned long) s->time, | |
764 | (unsigned long) s->val, | |
b26317c9 | 765 | io_sample_ddir(s), s->bs); |
ae588852 JA |
766 | } else { |
767 | struct io_sample_offset *so = (void *) s; | |
768 | ||
769 | fprintf(f, "%lu, %lu, %u, %u, %llu\n", | |
770 | (unsigned long) s->time, | |
771 | (unsigned long) s->val, | |
b26317c9 | 772 | io_sample_ddir(s), s->bs, |
ae588852 JA |
773 | (unsigned long long) so->offset); |
774 | } | |
ac9b9101 | 775 | } |
aee2ab67 JA |
776 | } |
777 | ||
778 | #ifdef CONFIG_ZLIB | |
97eabb2a JA |
779 | |
780 | struct iolog_flush_data { | |
155f2f02 | 781 | struct workqueue_work work; |
97eabb2a JA |
782 | struct io_log *log; |
783 | void *samples; | |
7e419452 JA |
784 | uint32_t nr_samples; |
785 | bool free; | |
97eabb2a JA |
786 | }; |
787 | ||
97eabb2a JA |
788 | #define GZ_CHUNK 131072 |
789 | ||
790 | static struct iolog_compress *get_new_chunk(unsigned int seq) | |
791 | { | |
792 | struct iolog_compress *c; | |
793 | ||
794 | c = malloc(sizeof(*c)); | |
795 | INIT_FLIST_HEAD(&c->list); | |
796 | c->buf = malloc(GZ_CHUNK); | |
797 | c->len = 0; | |
798 | c->seq = seq; | |
97eabb2a JA |
799 | return c; |
800 | } | |
801 | ||
802 | static void free_chunk(struct iolog_compress *ic) | |
803 | { | |
c07826cd JA |
804 | free(ic->buf); |
805 | free(ic); | |
97eabb2a JA |
806 | } |
807 | ||
b26317c9 | 808 | static int z_stream_init(z_stream *stream, int gz_hdr) |
aee2ab67 | 809 | { |
b26317c9 JA |
810 | int wbits = 15; |
811 | ||
acb2a69b | 812 | memset(stream, 0, sizeof(*stream)); |
aee2ab67 JA |
813 | stream->zalloc = Z_NULL; |
814 | stream->zfree = Z_NULL; | |
815 | stream->opaque = Z_NULL; | |
816 | stream->next_in = Z_NULL; | |
817 | ||
1a8e7458 JA |
818 | /* |
819 | * zlib magic - add 32 for auto-detection of gz header or not, | |
820 | * if we decide to store files in a gzip friendly format. | |
821 | */ | |
b26317c9 JA |
822 | if (gz_hdr) |
823 | wbits += 32; | |
824 | ||
825 | if (inflateInit2(stream, wbits) != Z_OK) | |
aee2ab67 JA |
826 | return 1; |
827 | ||
828 | return 0; | |
829 | } | |
830 | ||
1a8e7458 | 831 | struct inflate_chunk_iter { |
aee2ab67 | 832 | unsigned int seq; |
dad95da1 | 833 | int err; |
aee2ab67 JA |
834 | void *buf; |
835 | size_t buf_size; | |
836 | size_t buf_used; | |
837 | size_t chunk_sz; | |
838 | }; | |
839 | ||
b26317c9 | 840 | static void finish_chunk(z_stream *stream, FILE *f, |
1a8e7458 | 841 | struct inflate_chunk_iter *iter) |
aee2ab67 | 842 | { |
aee2ab67 JA |
843 | int ret; |
844 | ||
845 | ret = inflateEnd(stream); | |
846 | if (ret != Z_OK) | |
50f940f1 JA |
847 | log_err("fio: failed to end log inflation seq %d (%d)\n", |
848 | iter->seq, ret); | |
aee2ab67 | 849 | |
b26317c9 | 850 | flush_samples(f, iter->buf, iter->buf_used); |
aee2ab67 JA |
851 | free(iter->buf); |
852 | iter->buf = NULL; | |
853 | iter->buf_size = iter->buf_used = 0; | |
854 | } | |
855 | ||
1a8e7458 JA |
856 | /* |
857 | * Iterative chunk inflation. Handles cases where we cross into a new | |
858 | * sequence, doing flush finish of previous chunk if needed. | |
859 | */ | |
860 | static size_t inflate_chunk(struct iolog_compress *ic, int gz_hdr, FILE *f, | |
861 | z_stream *stream, struct inflate_chunk_iter *iter) | |
aee2ab67 | 862 | { |
0c56718d JA |
863 | size_t ret; |
864 | ||
0f989d2e | 865 | dprint(FD_COMPRESS, "inflate chunk size=%lu, seq=%u\n", |
0c56718d JA |
866 | (unsigned long) ic->len, ic->seq); |
867 | ||
aee2ab67 JA |
868 | if (ic->seq != iter->seq) { |
869 | if (iter->seq) | |
b26317c9 | 870 | finish_chunk(stream, f, iter); |
aee2ab67 | 871 | |
b26317c9 | 872 | z_stream_init(stream, gz_hdr); |
aee2ab67 JA |
873 | iter->seq = ic->seq; |
874 | } | |
875 | ||
876 | stream->avail_in = ic->len; | |
877 | stream->next_in = ic->buf; | |
878 | ||
879 | if (!iter->buf_size) { | |
880 | iter->buf_size = iter->chunk_sz; | |
881 | iter->buf = malloc(iter->buf_size); | |
882 | } | |
883 | ||
884 | while (stream->avail_in) { | |
b26317c9 | 885 | size_t this_out = iter->buf_size - iter->buf_used; |
aee2ab67 JA |
886 | int err; |
887 | ||
b26317c9 | 888 | stream->avail_out = this_out; |
aee2ab67 JA |
889 | stream->next_out = iter->buf + iter->buf_used; |
890 | ||
891 | err = inflate(stream, Z_NO_FLUSH); | |
892 | if (err < 0) { | |
893 | log_err("fio: failed inflating log: %d\n", err); | |
dad95da1 | 894 | iter->err = err; |
aee2ab67 JA |
895 | break; |
896 | } | |
897 | ||
b26317c9 JA |
898 | iter->buf_used += this_out - stream->avail_out; |
899 | ||
900 | if (!stream->avail_out) { | |
901 | iter->buf_size += iter->chunk_sz; | |
902 | iter->buf = realloc(iter->buf, iter->buf_size); | |
903 | continue; | |
904 | } | |
905 | ||
906 | if (err == Z_STREAM_END) | |
907 | break; | |
aee2ab67 JA |
908 | } |
909 | ||
0c56718d JA |
910 | ret = (void *) stream->next_in - ic->buf; |
911 | ||
d0d0cf0a | 912 | dprint(FD_COMPRESS, "inflated to size=%lu\n", (unsigned long) iter->buf_size); |
0c56718d JA |
913 | |
914 | return ret; | |
aee2ab67 JA |
915 | } |
916 | ||
1a8e7458 JA |
917 | /* |
918 | * Inflate stored compressed chunks, or write them directly to the log | |
919 | * file if so instructed. | |
920 | */ | |
dad95da1 | 921 | static int inflate_gz_chunks(struct io_log *log, FILE *f) |
aee2ab67 | 922 | { |
1a8e7458 | 923 | struct inflate_chunk_iter iter = { .chunk_sz = log->log_gz, }; |
aee2ab67 JA |
924 | z_stream stream; |
925 | ||
926 | while (!flist_empty(&log->chunk_list)) { | |
927 | struct iolog_compress *ic; | |
928 | ||
9342d5f8 | 929 | ic = flist_first_entry(&log->chunk_list, struct iolog_compress, list); |
aee2ab67 | 930 | flist_del(&ic->list); |
b26317c9 | 931 | |
1a8e7458 JA |
932 | if (log->log_gz_store) { |
933 | size_t ret; | |
934 | ||
0c56718d JA |
935 | dprint(FD_COMPRESS, "log write chunk size=%lu, " |
936 | "seq=%u\n", (unsigned long) ic->len, ic->seq); | |
937 | ||
1a8e7458 | 938 | ret = fwrite(ic->buf, ic->len, 1, f); |
dad95da1 JA |
939 | if (ret != 1 || ferror(f)) { |
940 | iter.err = errno; | |
1a8e7458 | 941 | log_err("fio: error writing compressed log\n"); |
dad95da1 | 942 | } |
1a8e7458 JA |
943 | } else |
944 | inflate_chunk(ic, log->log_gz_store, f, &stream, &iter); | |
c07826cd JA |
945 | |
946 | free_chunk(ic); | |
aee2ab67 JA |
947 | } |
948 | ||
949 | if (iter.seq) { | |
b26317c9 | 950 | finish_chunk(&stream, f, &iter); |
aee2ab67 JA |
951 | free(iter.buf); |
952 | } | |
dad95da1 JA |
953 | |
954 | return iter.err; | |
aee2ab67 JA |
955 | } |
956 | ||
1a8e7458 JA |
957 | /* |
958 | * Open compressed log file and decompress the stored chunks and | |
959 | * write them to stdout. The chunks are stored sequentially in the | |
960 | * file, so we iterate over them and do them one-by-one. | |
961 | */ | |
b26317c9 JA |
962 | int iolog_file_inflate(const char *file) |
963 | { | |
1a8e7458 | 964 | struct inflate_chunk_iter iter = { .chunk_sz = 64 * 1024 * 1024, }; |
b26317c9 JA |
965 | struct iolog_compress ic; |
966 | z_stream stream; | |
967 | struct stat sb; | |
fd771971 | 968 | ssize_t ret; |
f302710c JA |
969 | size_t total; |
970 | void *buf; | |
b26317c9 JA |
971 | FILE *f; |
972 | ||
b26317c9 JA |
973 | f = fopen(file, "r"); |
974 | if (!f) { | |
975 | perror("fopen"); | |
976 | return 1; | |
977 | } | |
978 | ||
fd771971 JA |
979 | if (stat(file, &sb) < 0) { |
980 | fclose(f); | |
981 | perror("stat"); | |
982 | return 1; | |
983 | } | |
984 | ||
f302710c | 985 | ic.buf = buf = malloc(sb.st_size); |
b26317c9 | 986 | ic.len = sb.st_size; |
b26317c9 JA |
987 | ic.seq = 1; |
988 | ||
989 | ret = fread(ic.buf, ic.len, 1, f); | |
990 | if (ret < 0) { | |
991 | perror("fread"); | |
992 | fclose(f); | |
bb1116fe | 993 | free(buf); |
b26317c9 JA |
994 | return 1; |
995 | } else if (ret != 1) { | |
996 | log_err("fio: short read on reading log\n"); | |
997 | fclose(f); | |
bb1116fe | 998 | free(buf); |
b26317c9 JA |
999 | return 1; |
1000 | } | |
1001 | ||
1002 | fclose(f); | |
1003 | ||
1a8e7458 JA |
1004 | /* |
1005 | * Each chunk will return Z_STREAM_END. We don't know how many | |
1006 | * chunks are in the file, so we just keep looping and incrementing | |
1007 | * the sequence number until we have consumed the whole compressed | |
1008 | * file. | |
1009 | */ | |
f302710c JA |
1010 | total = ic.len; |
1011 | do { | |
8a1db9a1 | 1012 | size_t iret; |
f302710c | 1013 | |
8a1db9a1 JA |
1014 | iret = inflate_chunk(&ic, 1, stdout, &stream, &iter); |
1015 | total -= iret; | |
f302710c JA |
1016 | if (!total) |
1017 | break; | |
dad95da1 JA |
1018 | if (iter.err) |
1019 | break; | |
f302710c JA |
1020 | |
1021 | ic.seq++; | |
8a1db9a1 JA |
1022 | ic.len -= iret; |
1023 | ic.buf += iret; | |
f302710c | 1024 | } while (1); |
b26317c9 JA |
1025 | |
1026 | if (iter.seq) { | |
1027 | finish_chunk(&stream, stdout, &iter); | |
1028 | free(iter.buf); | |
1029 | } | |
1030 | ||
f302710c | 1031 | free(buf); |
dad95da1 | 1032 | return iter.err; |
b26317c9 JA |
1033 | } |
1034 | ||
aee2ab67 JA |
1035 | #else |
1036 | ||
dad95da1 | 1037 | static int inflate_gz_chunks(struct io_log *log, FILE *f) |
aee2ab67 | 1038 | { |
b7364e21 | 1039 | return 0; |
aee2ab67 JA |
1040 | } |
1041 | ||
a68c66b2 JA |
1042 | int iolog_file_inflate(const char *file) |
1043 | { | |
1044 | log_err("fio: log inflation not possible without zlib\n"); | |
1045 | return 1; | |
1046 | } | |
1047 | ||
aee2ab67 JA |
1048 | #endif |
1049 | ||
60a25727 | 1050 | void flush_log(struct io_log *log, bool do_append) |
aee2ab67 JA |
1051 | { |
1052 | void *buf; | |
1053 | FILE *f; | |
1054 | ||
3a5db920 JA |
1055 | if (!do_append) |
1056 | f = fopen(log->filename, "w"); | |
1057 | else | |
1058 | f = fopen(log->filename, "a"); | |
aee2ab67 JA |
1059 | if (!f) { |
1060 | perror("fopen log"); | |
1061 | return; | |
1062 | } | |
1063 | ||
1064 | buf = set_file_buffer(f); | |
1065 | ||
1a8e7458 | 1066 | inflate_gz_chunks(log, f); |
aee2ab67 | 1067 | |
7e419452 JA |
1068 | while (!flist_empty(&log->io_logs)) { |
1069 | struct io_logs *cur_log; | |
1070 | ||
1071 | cur_log = flist_first_entry(&log->io_logs, struct io_logs, list); | |
1072 | flist_del_init(&cur_log->list); | |
1e613c9c | 1073 | |
a9179eeb | 1074 | if (log->td && log == log->td->clat_hist_log) |
1e613c9c | 1075 | flush_hist_samples(f, log->hist_coarseness, cur_log->log, |
868f6f03 | 1076 | log_sample_sz(log, cur_log)); |
1e613c9c | 1077 | else |
868f6f03 | 1078 | flush_samples(f, cur_log->log, log_sample_sz(log, cur_log)); |
1e613c9c | 1079 | |
90d2d53f | 1080 | sfree(cur_log); |
7e419452 | 1081 | } |
ac9b9101 JA |
1082 | |
1083 | fclose(f); | |
2e802282 | 1084 | clear_file_buffer(buf); |
ac9b9101 JA |
1085 | } |
1086 | ||
cb7e0ace | 1087 | static int finish_log(struct thread_data *td, struct io_log *log, int trylock) |
ac9b9101 | 1088 | { |
155f2f02 | 1089 | if (td->flags & TD_F_COMPRESS_LOG) |
7e419452 | 1090 | iolog_flush(log); |
aee2ab67 | 1091 | |
243bfe19 | 1092 | if (trylock) { |
cb7e0ace | 1093 | if (fio_trylock_file(log->filename)) |
243bfe19 JA |
1094 | return 1; |
1095 | } else | |
cb7e0ace | 1096 | fio_lock_file(log->filename); |
243bfe19 | 1097 | |
0cba0f91 | 1098 | if (td->client_type == FIO_CLIENT_TYPE_GUI || is_backend) |
cb7e0ace | 1099 | fio_send_iolog(td, log, log->filename); |
aee2ab67 | 1100 | else |
3a5db920 | 1101 | flush_log(log, !td->o.per_job_logs); |
243bfe19 | 1102 | |
cb7e0ace | 1103 | fio_unlock_file(log->filename); |
518dac09 | 1104 | free_log(log); |
243bfe19 | 1105 | return 0; |
ac9b9101 JA |
1106 | } |
1107 | ||
0cba0f91 JA |
1108 | size_t log_chunk_sizes(struct io_log *log) |
1109 | { | |
1110 | struct flist_head *entry; | |
1111 | size_t ret; | |
1112 | ||
1113 | if (flist_empty(&log->chunk_list)) | |
1114 | return 0; | |
1115 | ||
1116 | ret = 0; | |
1117 | pthread_mutex_lock(&log->chunk_lock); | |
1118 | flist_for_each(entry, &log->chunk_list) { | |
1119 | struct iolog_compress *c; | |
1120 | ||
1121 | c = flist_entry(entry, struct iolog_compress, list); | |
1122 | ret += c->len; | |
1123 | } | |
1124 | pthread_mutex_unlock(&log->chunk_lock); | |
1125 | return ret; | |
1126 | } | |
1127 | ||
aee2ab67 JA |
1128 | #ifdef CONFIG_ZLIB |
1129 | ||
78e93aa6 | 1130 | static int gz_work(struct iolog_flush_data *data) |
c143980a | 1131 | { |
040238ec | 1132 | struct iolog_compress *c = NULL; |
aee2ab67 JA |
1133 | struct flist_head list; |
1134 | unsigned int seq; | |
1135 | z_stream stream; | |
1136 | size_t total = 0; | |
d73ac887 | 1137 | int ret; |
aee2ab67 JA |
1138 | |
1139 | INIT_FLIST_HEAD(&list); | |
1140 | ||
7e419452 | 1141 | memset(&stream, 0, sizeof(stream)); |
aee2ab67 JA |
1142 | stream.zalloc = Z_NULL; |
1143 | stream.zfree = Z_NULL; | |
1144 | stream.opaque = Z_NULL; | |
1145 | ||
b26317c9 | 1146 | ret = deflateInit(&stream, Z_DEFAULT_COMPRESSION); |
b26317c9 | 1147 | if (ret != Z_OK) { |
aee2ab67 | 1148 | log_err("fio: failed to init gz stream\n"); |
152ea035 | 1149 | goto err; |
aee2ab67 JA |
1150 | } |
1151 | ||
1152 | seq = ++data->log->chunk_seq; | |
b26317c9 | 1153 | |
aee2ab67 JA |
1154 | stream.next_in = (void *) data->samples; |
1155 | stream.avail_in = data->nr_samples * log_entry_sz(data->log); | |
1156 | ||
d0d0cf0a JA |
1157 | dprint(FD_COMPRESS, "deflate input size=%lu, seq=%u, log=%s\n", |
1158 | (unsigned long) stream.avail_in, seq, | |
1159 | data->log->filename); | |
aee2ab67 | 1160 | do { |
040238ec | 1161 | if (c) |
0caccfa7 JA |
1162 | dprint(FD_COMPRESS, "seq=%d, chunk=%lu\n", seq, |
1163 | (unsigned long) c->len); | |
aee2ab67 JA |
1164 | c = get_new_chunk(seq); |
1165 | stream.avail_out = GZ_CHUNK; | |
1166 | stream.next_out = c->buf; | |
1167 | ret = deflate(&stream, Z_NO_FLUSH); | |
1168 | if (ret < 0) { | |
1169 | log_err("fio: deflate log (%d)\n", ret); | |
dad95da1 JA |
1170 | free_chunk(c); |
1171 | goto err; | |
aee2ab67 JA |
1172 | } |
1173 | ||
1174 | c->len = GZ_CHUNK - stream.avail_out; | |
1175 | flist_add_tail(&c->list, &list); | |
1176 | total += c->len; | |
1177 | } while (stream.avail_in); | |
1178 | ||
1179 | stream.next_out = c->buf + c->len; | |
1180 | stream.avail_out = GZ_CHUNK - c->len; | |
1181 | ||
1182 | ret = deflate(&stream, Z_FINISH); | |
6fa3ad51 JA |
1183 | if (ret < 0) { |
1184 | /* | |
1185 | * Z_BUF_ERROR is special, it just means we need more | |
1186 | * output space. We'll handle that below. Treat any other | |
1187 | * error as fatal. | |
1188 | */ | |
1189 | if (ret != Z_BUF_ERROR) { | |
1190 | log_err("fio: deflate log (%d)\n", ret); | |
1191 | flist_del(&c->list); | |
1192 | free_chunk(c); | |
1193 | goto err; | |
1194 | } | |
1195 | } | |
1196 | ||
1197 | total -= c->len; | |
1198 | c->len = GZ_CHUNK - stream.avail_out; | |
1199 | total += c->len; | |
0caccfa7 | 1200 | dprint(FD_COMPRESS, "seq=%d, chunk=%lu\n", seq, (unsigned long) c->len); |
040238ec | 1201 | |
6fa3ad51 | 1202 | if (ret != Z_STREAM_END) { |
aee2ab67 JA |
1203 | do { |
1204 | c = get_new_chunk(seq); | |
1205 | stream.avail_out = GZ_CHUNK; | |
1206 | stream.next_out = c->buf; | |
1207 | ret = deflate(&stream, Z_FINISH); | |
1208 | c->len = GZ_CHUNK - stream.avail_out; | |
0c56718d | 1209 | total += c->len; |
aee2ab67 | 1210 | flist_add_tail(&c->list, &list); |
0caccfa7 JA |
1211 | dprint(FD_COMPRESS, "seq=%d, chunk=%lu\n", seq, |
1212 | (unsigned long) c->len); | |
aee2ab67 JA |
1213 | } while (ret != Z_STREAM_END); |
1214 | } | |
1215 | ||
0c56718d JA |
1216 | dprint(FD_COMPRESS, "deflated to size=%lu\n", (unsigned long) total); |
1217 | ||
aee2ab67 JA |
1218 | ret = deflateEnd(&stream); |
1219 | if (ret != Z_OK) | |
1220 | log_err("fio: deflateEnd %d\n", ret); | |
1221 | ||
1222 | free(data->samples); | |
1223 | ||
1224 | if (!flist_empty(&list)) { | |
1225 | pthread_mutex_lock(&data->log->chunk_lock); | |
1226 | flist_splice_tail(&list, &data->log->chunk_list); | |
1227 | pthread_mutex_unlock(&data->log->chunk_lock); | |
1228 | } | |
1229 | ||
dad95da1 JA |
1230 | ret = 0; |
1231 | done: | |
7e419452 JA |
1232 | if (data->free) |
1233 | free(data); | |
dad95da1 JA |
1234 | return ret; |
1235 | err: | |
1236 | while (!flist_empty(&list)) { | |
1237 | c = flist_first_entry(list.next, struct iolog_compress, list); | |
1238 | flist_del(&c->list); | |
1239 | free_chunk(c); | |
1240 | } | |
1241 | ret = 1; | |
1242 | goto done; | |
aee2ab67 JA |
1243 | } |
1244 | ||
78e93aa6 JA |
1245 | /* |
1246 | * Invoked from our compress helper thread, when logging would have exceeded | |
1247 | * the specified memory limitation. Compresses the previously stored | |
1248 | * entries. | |
1249 | */ | |
1250 | static int gz_work_async(struct submit_worker *sw, struct workqueue_work *work) | |
1251 | { | |
1252 | return gz_work(container_of(work, struct iolog_flush_data, work)); | |
1253 | } | |
1254 | ||
c08f9fe2 JA |
1255 | static int gz_init_worker(struct submit_worker *sw) |
1256 | { | |
1257 | struct thread_data *td = sw->wq->td; | |
1258 | ||
1259 | if (!fio_option_is_set(&td->o, log_gz_cpumask)) | |
1260 | return 0; | |
1261 | ||
1262 | if (fio_setaffinity(gettid(), td->o.log_gz_cpumask) == -1) { | |
1263 | log_err("gz: failed to set CPU affinity\n"); | |
1264 | return 1; | |
1265 | } | |
1266 | ||
1267 | return 0; | |
1268 | } | |
1269 | ||
155f2f02 | 1270 | static struct workqueue_ops log_compress_wq_ops = { |
78e93aa6 | 1271 | .fn = gz_work_async, |
c08f9fe2 | 1272 | .init_worker_fn = gz_init_worker, |
24660963 | 1273 | .nice = 1, |
155f2f02 JA |
1274 | }; |
1275 | ||
24660963 | 1276 | int iolog_compress_init(struct thread_data *td, struct sk_out *sk_out) |
155f2f02 JA |
1277 | { |
1278 | if (!(td->flags & TD_F_COMPRESS_LOG)) | |
1279 | return 0; | |
1280 | ||
24660963 | 1281 | workqueue_init(td, &td->log_compress_wq, &log_compress_wq_ops, 1, sk_out); |
155f2f02 JA |
1282 | return 0; |
1283 | } | |
1284 | ||
1285 | void iolog_compress_exit(struct thread_data *td) | |
1286 | { | |
1287 | if (!(td->flags & TD_F_COMPRESS_LOG)) | |
1288 | return; | |
1289 | ||
1290 | workqueue_exit(&td->log_compress_wq); | |
1291 | } | |
1292 | ||
1a8e7458 | 1293 | /* |
949ae6dc JA |
1294 | * Queue work item to compress the existing log entries. We reset the |
1295 | * current log to a small size, and reference the existing log in the | |
1296 | * data that we queue for compression. Once compression has been done, | |
7e419452 JA |
1297 | * this old log is freed. If called with finish == true, will not return |
1298 | * until the log compression has completed, and will flush all previous | |
1299 | * logs too | |
1a8e7458 | 1300 | */ |
7e419452 | 1301 | static int iolog_flush(struct io_log *log) |
aee2ab67 | 1302 | { |
aee2ab67 | 1303 | struct iolog_flush_data *data; |
aee2ab67 JA |
1304 | |
1305 | data = malloc(sizeof(*data)); | |
1306 | if (!data) | |
1307 | return 1; | |
1308 | ||
1309 | data->log = log; | |
7e419452 | 1310 | data->free = false; |
aee2ab67 | 1311 | |
7e419452 JA |
1312 | while (!flist_empty(&log->io_logs)) { |
1313 | struct io_logs *cur_log; | |
949ae6dc | 1314 | |
7e419452 JA |
1315 | cur_log = flist_first_entry(&log->io_logs, struct io_logs, list); |
1316 | flist_del_init(&cur_log->list); | |
1317 | ||
1318 | data->samples = cur_log->log; | |
1319 | data->nr_samples = cur_log->nr_samples; | |
1320 | ||
2b7625e2 | 1321 | sfree(cur_log); |
aee2ab67 | 1322 | |
78e93aa6 | 1323 | gz_work(data); |
7e419452 | 1324 | } |
aee2ab67 | 1325 | |
7e419452 | 1326 | free(data); |
aee2ab67 JA |
1327 | return 0; |
1328 | } | |
1329 | ||
7e419452 JA |
1330 | int iolog_cur_flush(struct io_log *log, struct io_logs *cur_log) |
1331 | { | |
1332 | struct iolog_flush_data *data; | |
1333 | ||
7e419452 JA |
1334 | data = malloc(sizeof(*data)); |
1335 | if (!data) | |
1336 | return 1; | |
1337 | ||
1338 | data->log = log; | |
1339 | ||
1340 | data->samples = cur_log->log; | |
1341 | data->nr_samples = cur_log->nr_samples; | |
1342 | data->free = true; | |
1343 | ||
1344 | cur_log->nr_samples = cur_log->max_samples = 0; | |
1345 | cur_log->log = NULL; | |
1346 | ||
1347 | workqueue_enqueue(&log->td->log_compress_wq, &data->work); | |
1348 | return 0; | |
1349 | } | |
aee2ab67 JA |
1350 | #else |
1351 | ||
7e419452 JA |
1352 | static int iolog_flush(struct io_log *log) |
1353 | { | |
1354 | return 1; | |
1355 | } | |
1356 | ||
1357 | int iolog_cur_flush(struct io_log *log, struct io_logs *cur_log) | |
aee2ab67 JA |
1358 | { |
1359 | return 1; | |
1360 | } | |
1361 | ||
24660963 | 1362 | int iolog_compress_init(struct thread_data *td, struct sk_out *sk_out) |
52618a2a JA |
1363 | { |
1364 | return 0; | |
1365 | } | |
1366 | ||
1367 | void iolog_compress_exit(struct thread_data *td) | |
1368 | { | |
1369 | } | |
1370 | ||
aee2ab67 JA |
1371 | #endif |
1372 | ||
7e419452 JA |
1373 | struct io_logs *iolog_cur_log(struct io_log *log) |
1374 | { | |
1375 | if (flist_empty(&log->io_logs)) | |
1376 | return NULL; | |
1377 | ||
1378 | return flist_last_entry(&log->io_logs, struct io_logs, list); | |
1379 | } | |
1380 | ||
1381 | uint64_t iolog_nr_samples(struct io_log *iolog) | |
1382 | { | |
1383 | struct flist_head *entry; | |
1384 | uint64_t ret = 0; | |
1385 | ||
1386 | flist_for_each(entry, &iolog->io_logs) { | |
1387 | struct io_logs *cur_log; | |
1388 | ||
1389 | cur_log = flist_entry(entry, struct io_logs, list); | |
1390 | ret += cur_log->nr_samples; | |
1391 | } | |
1392 | ||
1393 | return ret; | |
1394 | } | |
1395 | ||
1c725e70 | 1396 | static int __write_log(struct thread_data *td, struct io_log *log, int try) |
905e3d4f | 1397 | { |
1c725e70 JA |
1398 | if (log) |
1399 | return finish_log(td, log, try); | |
905e3d4f | 1400 | |
1c725e70 JA |
1401 | return 0; |
1402 | } | |
905e3d4f | 1403 | |
a47591e4 | 1404 | static int write_iops_log(struct thread_data *td, int try, bool unit_log) |
1c725e70 | 1405 | { |
a47591e4 JA |
1406 | int ret; |
1407 | ||
1408 | if (per_unit_log(td->iops_log) != unit_log) | |
1409 | return 0; | |
1410 | ||
1411 | ret = __write_log(td, td->iops_log, try); | |
1412 | if (!ret) | |
1413 | td->iops_log = NULL; | |
1414 | ||
1415 | return ret; | |
905e3d4f JA |
1416 | } |
1417 | ||
a47591e4 | 1418 | static int write_slat_log(struct thread_data *td, int try, bool unit_log) |
905e3d4f | 1419 | { |
a47591e4 JA |
1420 | int ret; |
1421 | ||
1422 | if (!unit_log) | |
1423 | return 0; | |
1424 | ||
1425 | ret = __write_log(td, td->slat_log, try); | |
1426 | if (!ret) | |
1427 | td->slat_log = NULL; | |
1428 | ||
1429 | return ret; | |
905e3d4f JA |
1430 | } |
1431 | ||
a47591e4 | 1432 | static int write_clat_log(struct thread_data *td, int try, bool unit_log) |
905e3d4f | 1433 | { |
a47591e4 JA |
1434 | int ret; |
1435 | ||
1436 | if (!unit_log) | |
1437 | return 0; | |
1438 | ||
1439 | ret = __write_log(td, td->clat_log, try); | |
1440 | if (!ret) | |
1441 | td->clat_log = NULL; | |
1442 | ||
1443 | return ret; | |
905e3d4f JA |
1444 | } |
1445 | ||
1e613c9c KC |
1446 | static int write_clat_hist_log(struct thread_data *td, int try, bool unit_log) |
1447 | { | |
1448 | int ret; | |
1449 | ||
1450 | if (!unit_log) | |
1451 | return 0; | |
1452 | ||
1453 | ret = __write_log(td, td->clat_hist_log, try); | |
1454 | if (!ret) | |
1455 | td->clat_hist_log = NULL; | |
1456 | ||
1457 | return ret; | |
1458 | } | |
1459 | ||
a47591e4 | 1460 | static int write_lat_log(struct thread_data *td, int try, bool unit_log) |
905e3d4f | 1461 | { |
a47591e4 JA |
1462 | int ret; |
1463 | ||
1464 | if (!unit_log) | |
1465 | return 0; | |
1466 | ||
1467 | ret = __write_log(td, td->lat_log, try); | |
1468 | if (!ret) | |
1469 | td->lat_log = NULL; | |
1470 | ||
1471 | return ret; | |
905e3d4f JA |
1472 | } |
1473 | ||
a47591e4 | 1474 | static int write_bandw_log(struct thread_data *td, int try, bool unit_log) |
905e3d4f | 1475 | { |
a47591e4 JA |
1476 | int ret; |
1477 | ||
1478 | if (per_unit_log(td->bw_log) != unit_log) | |
1479 | return 0; | |
1480 | ||
1481 | ret = __write_log(td, td->bw_log, try); | |
1482 | if (!ret) | |
1483 | td->bw_log = NULL; | |
1484 | ||
1485 | return ret; | |
905e3d4f JA |
1486 | } |
1487 | ||
1488 | enum { | |
1489 | BW_LOG_MASK = 1, | |
1490 | LAT_LOG_MASK = 2, | |
1491 | SLAT_LOG_MASK = 4, | |
1492 | CLAT_LOG_MASK = 8, | |
1493 | IOPS_LOG_MASK = 16, | |
1e613c9c | 1494 | CLAT_HIST_LOG_MASK = 32, |
905e3d4f | 1495 | |
1e613c9c | 1496 | ALL_LOG_NR = 6, |
905e3d4f JA |
1497 | }; |
1498 | ||
1499 | struct log_type { | |
1500 | unsigned int mask; | |
a47591e4 | 1501 | int (*fn)(struct thread_data *, int, bool); |
905e3d4f JA |
1502 | }; |
1503 | ||
1504 | static struct log_type log_types[] = { | |
1505 | { | |
1506 | .mask = BW_LOG_MASK, | |
1507 | .fn = write_bandw_log, | |
1508 | }, | |
1509 | { | |
1510 | .mask = LAT_LOG_MASK, | |
1511 | .fn = write_lat_log, | |
1512 | }, | |
1513 | { | |
1514 | .mask = SLAT_LOG_MASK, | |
1515 | .fn = write_slat_log, | |
1516 | }, | |
1517 | { | |
1518 | .mask = CLAT_LOG_MASK, | |
1519 | .fn = write_clat_log, | |
1520 | }, | |
1521 | { | |
1522 | .mask = IOPS_LOG_MASK, | |
1523 | .fn = write_iops_log, | |
1524 | }, | |
1e613c9c KC |
1525 | { |
1526 | .mask = CLAT_HIST_LOG_MASK, | |
1527 | .fn = write_clat_hist_log, | |
1528 | } | |
905e3d4f JA |
1529 | }; |
1530 | ||
a47591e4 | 1531 | void td_writeout_logs(struct thread_data *td, bool unit_logs) |
905e3d4f | 1532 | { |
ea5409f9 | 1533 | unsigned int log_mask = 0; |
905e3d4f JA |
1534 | unsigned int log_left = ALL_LOG_NR; |
1535 | int old_state, i; | |
1536 | ||
1537 | old_state = td_bump_runstate(td, TD_FINISHING); | |
1538 | ||
a47591e4 | 1539 | finalize_logs(td, unit_logs); |
905e3d4f JA |
1540 | |
1541 | while (log_left) { | |
1542 | int prev_log_left = log_left; | |
1543 | ||
1544 | for (i = 0; i < ALL_LOG_NR && log_left; i++) { | |
1545 | struct log_type *lt = &log_types[i]; | |
1546 | int ret; | |
1547 | ||
ea5409f9 | 1548 | if (!(log_mask & lt->mask)) { |
a47591e4 | 1549 | ret = lt->fn(td, log_left != 1, unit_logs); |
905e3d4f JA |
1550 | if (!ret) { |
1551 | log_left--; | |
ea5409f9 | 1552 | log_mask |= lt->mask; |
905e3d4f JA |
1553 | } |
1554 | } | |
1555 | } | |
1556 | ||
1557 | if (prev_log_left == log_left) | |
1558 | usleep(5000); | |
1559 | } | |
1560 | ||
1561 | td_restore_runstate(td, old_state); | |
1562 | } | |
a47591e4 JA |
1563 | |
1564 | void fio_writeout_logs(bool unit_logs) | |
1565 | { | |
1566 | struct thread_data *td; | |
1567 | int i; | |
1568 | ||
1569 | for_each_td(td, i) | |
1570 | td_writeout_logs(td, unit_logs); | |
1571 | } |