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