2 * Code related to writing an iolog of what a thread is doing, and to
3 * later read that back and replay
23 static int iolog_flush(struct io_log *log);
25 static const char iolog_ver2[] = "fio version 2 iolog";
27 void queue_io_piece(struct thread_data *td, struct io_piece *ipo)
29 flist_add_tail(&ipo->list, &td->io_log_list);
30 td->total_io_size += ipo->len;
33 void log_io_u(const struct thread_data *td, const struct io_u *io_u)
35 if (!td->o.write_iolog_file)
38 fprintf(td->iolog_f, "%s %s %llu %lu\n", io_u->file->file_name,
39 io_ddir_name(io_u->ddir),
40 io_u->offset, io_u->buflen);
43 void log_file(struct thread_data *td, struct fio_file *f,
44 enum file_log_act what)
46 const char *act[] = { "add", "open", "close" };
50 if (!td->o.write_iolog_file)
55 * this happens on the pre-open/close done before the job starts
60 fprintf(td->iolog_f, "%s %s\n", f->file_name, act[what]);
63 static void iolog_delay(struct thread_data *td, unsigned long delay)
65 uint64_t usec = utime_since_now(&td->last_issue);
69 if (delay < td->time_offset) {
74 delay -= td->time_offset;
80 fio_gettime(&tv, NULL);
81 while (delay && !td->terminate) {
83 if (this_delay > 500000)
86 usec_sleep(td, this_delay);
90 usec = utime_since_now(&tv);
92 td->time_offset = usec - delay;
97 static int ipo_special(struct thread_data *td, struct io_piece *ipo)
105 if (ipo->ddir != DDIR_INVAL)
108 f = td->files[ipo->fileno];
110 switch (ipo->file_action) {
111 case FIO_LOG_OPEN_FILE:
112 ret = td_io_open_file(td, f);
115 td_verror(td, ret, "iolog open file");
117 case FIO_LOG_CLOSE_FILE:
118 td_io_close_file(td, f);
120 case FIO_LOG_UNLINK_FILE:
121 td_io_unlink_file(td, f);
124 log_err("fio: bad file action %d\n", ipo->file_action);
131 int read_iolog_get(struct thread_data *td, struct io_u *io_u)
133 struct io_piece *ipo;
134 unsigned long elapsed;
136 while (!flist_empty(&td->io_log_list)) {
139 ipo = flist_first_entry(&td->io_log_list, struct io_piece, list);
140 flist_del(&ipo->list);
141 remove_trim_entry(td, ipo);
143 ret = ipo_special(td, ipo);
147 } else if (ret > 0) {
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);
161 iolog_delay(td, ipo->delay);
163 elapsed = mtime_since_genesis();
164 if (ipo->delay > elapsed)
165 usec_sleep(td, (ipo->delay - elapsed) * 1000);
170 if (io_u->ddir != DDIR_WAIT)
178 void prune_io_piece_log(struct thread_data *td)
180 struct io_piece *ipo;
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);
191 while (!flist_empty(&td->io_hist_list)) {
192 ipo = flist_first_entry(&td->io_hist_list, struct io_piece, list);
193 flist_del(&ipo->list);
194 remove_trim_entry(td, ipo);
201 * log a successful write, so we can unwind the log for verify
203 void log_io_piece(struct thread_data *td, struct io_u *io_u)
205 struct rb_node **p, *parent;
206 struct io_piece *ipo, *__ipo;
208 ipo = malloc(sizeof(struct io_piece));
210 ipo->file = io_u->file;
211 ipo->offset = io_u->offset;
212 ipo->len = io_u->buflen;
213 ipo->numberio = io_u->numberio;
214 ipo->flags = IP_F_IN_FLIGHT;
218 if (io_u_should_trim(td, io_u)) {
219 flist_add_tail(&ipo->trim_list, &td->trim_list);
224 * We don't need to sort the entries, if:
226 * Sequential writes, or
227 * Random writes that lay out the file as it goes along
229 * For both these cases, just reading back data in the order we
230 * wrote it out is the fastest.
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
237 if (((!td->o.verifysort) || !td_random(td) || !td->o.overwrite) &&
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;
246 RB_CLEAR_NODE(&ipo->rb_node);
249 * Sort the entry into the verification list
252 p = &td->io_hist_tree.rb_node;
258 __ipo = rb_entry(parent, struct io_piece, rb_node);
259 if (ipo->file < __ipo->file)
261 else if (ipo->file > __ipo->file)
263 else if (ipo->offset < __ipo->offset) {
265 overlap = ipo->offset + ipo->len > __ipo->offset;
267 else if (ipo->offset > __ipo->offset) {
269 overlap = __ipo->offset + __ipo->len > ipo->offset;
275 dprint(FD_IO, "iolog: overlap %llu/%lu, %llu/%lu",
276 __ipo->offset, __ipo->len,
277 ipo->offset, ipo->len);
279 rb_erase(parent, &td->io_hist_tree);
280 remove_trim_entry(td, __ipo);
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;
292 void unlog_io_piece(struct thread_data *td, struct io_u *io_u)
294 struct io_piece *ipo = io_u->ipo;
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);
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);
321 void trim_io_piece(struct thread_data *td, const struct io_u *io_u)
323 struct io_piece *ipo = io_u->ipo;
328 ipo->len = io_u->xfer_buflen - io_u->resid;
331 void write_iolog_close(struct thread_data *td)
337 td->iolog_buf = NULL;
341 * Read version 2 iolog data. It is enhanced to include per-file logging,
344 static int read_iolog2(struct thread_data *td, FILE *f)
346 unsigned long long offset;
348 int reads, writes, waits, fileno = 0, file_action = 0; /* stupid gcc */
353 free_release_files(td);
356 * Read in the read iolog and store it, reuse the infrastructure
357 * for doing verifications.
360 fname = malloc(256+16);
361 act = malloc(256+16);
363 reads = writes = waits = 0;
364 while ((p = fgets(str, 4096, f)) != NULL) {
365 struct io_piece *ipo;
368 r = sscanf(p, "%256s %256s %llu %u", fname, act, &offset,
374 if (!strcmp(act, "wait"))
376 else if (!strcmp(act, "read"))
378 else if (!strcmp(act, "write"))
380 else if (!strcmp(act, "sync"))
382 else if (!strcmp(act, "datasync"))
384 else if (!strcmp(act, "trim"))
387 log_err("fio: bad iolog file action: %s\n",
391 fileno = get_fileno(td, fname);
394 if (!strcmp(act, "add")) {
395 fileno = add_file(td, fname, 0, 1);
396 file_action = FIO_LOG_ADD_FILE;
398 } else if (!strcmp(act, "open")) {
399 fileno = get_fileno(td, fname);
400 file_action = FIO_LOG_OPEN_FILE;
401 } else if (!strcmp(act, "close")) {
402 fileno = get_fileno(td, fname);
403 file_action = FIO_LOG_CLOSE_FILE;
405 log_err("fio: bad iolog file action: %s\n",
410 log_err("bad iolog2: %s", p);
416 else if (rw == DDIR_WRITE) {
418 * Don't add a write for ro mode
423 } else if (rw == DDIR_WAIT) {
425 } else if (rw == DDIR_INVAL) {
426 } else if (!ddir_sync(rw)) {
427 log_err("bad ddir: %d\n", rw);
434 ipo = malloc(sizeof(*ipo));
437 if (rw == DDIR_WAIT) {
440 ipo->offset = offset;
442 if (rw != DDIR_INVAL && bytes > td->o.max_bs[rw])
443 td->o.max_bs[rw] = bytes;
444 ipo->fileno = fileno;
445 ipo->file_action = file_action;
449 queue_io_piece(td, ipo);
456 if (writes && read_only) {
457 log_err("fio: <%s> skips replay of %d writes due to"
458 " read-only\n", td->o.name, writes);
462 if (!reads && !writes && !waits)
464 else if (reads && !writes)
465 td->o.td_ddir = TD_DDIR_READ;
466 else if (!reads && writes)
467 td->o.td_ddir = TD_DDIR_WRITE;
469 td->o.td_ddir = TD_DDIR_RW;
475 * open iolog, check version, and call appropriate parser
477 static int init_iolog_read(struct thread_data *td)
479 char buffer[256], *p;
483 f = fopen(td->o.read_iolog_file, "r");
485 perror("fopen read iolog");
489 p = fgets(buffer, sizeof(buffer), f);
491 td_verror(td, errno, "iolog read");
492 log_err("fio: unable to read iolog\n");
498 * version 2 of the iolog stores a specific string as the
499 * first line, check for that
501 if (!strncmp(iolog_ver2, buffer, strlen(iolog_ver2)))
502 ret = read_iolog2(td, f);
504 log_err("fio: iolog version 1 is no longer supported\n");
513 * Set up a log for storing io patterns.
515 static int init_iolog_write(struct thread_data *td)
521 f = fopen(td->o.write_iolog_file, "a");
523 perror("fopen write iolog");
528 * That's it for writing, setup a log buffer and we're done.
531 td->iolog_buf = malloc(8192);
532 setvbuf(f, td->iolog_buf, _IOFBF, 8192);
535 * write our version line
537 if (fprintf(f, "%s\n", iolog_ver2) < 0) {
538 perror("iolog init\n");
543 * add all known files
545 for_each_file(td, ff, i)
546 log_file(td, ff, FIO_LOG_ADD_FILE);
551 int init_iolog(struct thread_data *td)
555 if (td->o.read_iolog_file) {
559 * Check if it's a blktrace file and load that if possible.
560 * Otherwise assume it's a normal log file and load that.
562 if (is_blktrace(td->o.read_iolog_file, &need_swap))
563 ret = load_blktrace(td, td->o.read_iolog_file, need_swap);
565 ret = init_iolog_read(td);
566 } else if (td->o.write_iolog_file)
567 ret = init_iolog_write(td);
570 td_verror(td, EINVAL, "failed initializing iolog");
575 void setup_log(struct io_log **log, struct log_params *p,
576 const char *filename)
579 pthread_mutexattr_t mattr;
581 l = scalloc(1, sizeof(*l));
582 INIT_FLIST_HEAD(&l->io_logs);
583 l->log_type = p->log_type;
584 l->log_offset = p->log_offset;
585 l->log_gz = p->log_gz;
586 l->log_gz_store = p->log_gz_store;
587 l->avg_msec = p->avg_msec;
588 l->filename = strdup(filename);
591 if (l->td && l->td->o.io_submit_mode != IO_MODE_OFFLOAD) {
594 p = calloc(1, sizeof(*l->pending));
595 p->max_samples = DEF_LOG_ENTRIES;
596 p->log = calloc(p->max_samples, log_entry_sz(l));
601 l->log_ddir_mask = LOG_OFFSET_SAMPLE_BIT;
603 INIT_FLIST_HEAD(&l->chunk_list);
605 if (l->log_gz && !p->td)
607 else if (l->log_gz || l->log_gz_store) {
608 pthread_mutexattr_init(&mattr);
609 #ifdef FIO_HAVE_PSHARED_MUTEX
610 pthread_mutexattr_setpshared(&mattr, PTHREAD_PROCESS_SHARED);
612 pthread_mutex_init(&l->chunk_lock, &mattr);
613 p->td->flags |= TD_F_COMPRESS_LOG;
619 #ifdef CONFIG_SETVBUF
620 static void *set_file_buffer(FILE *f)
622 size_t size = 1048576;
626 setvbuf(f, buf, _IOFBF, size);
630 static void clear_file_buffer(void *buf)
635 static void *set_file_buffer(FILE *f)
640 static void clear_file_buffer(void *buf)
645 void free_log(struct io_log *log)
647 while (!flist_empty(&log->io_logs)) {
648 struct io_logs *cur_log;
650 cur_log = flist_first_entry(&log->io_logs, struct io_logs, list);
651 flist_del_init(&cur_log->list);
656 free(log->pending->log);
666 void flush_samples(FILE *f, void *samples, uint64_t sample_size)
670 uint64_t i, nr_samples;
675 s = __get_sample(samples, 0, 0);
676 log_offset = (s->__ddir & LOG_OFFSET_SAMPLE_BIT) != 0;
678 nr_samples = sample_size / __log_entry_sz(log_offset);
680 for (i = 0; i < nr_samples; i++) {
681 s = __get_sample(samples, log_offset, i);
684 fprintf(f, "%lu, %lu, %u, %u\n",
685 (unsigned long) s->time,
686 (unsigned long) s->val,
687 io_sample_ddir(s), s->bs);
689 struct io_sample_offset *so = (void *) s;
691 fprintf(f, "%lu, %lu, %u, %u, %llu\n",
692 (unsigned long) s->time,
693 (unsigned long) s->val,
694 io_sample_ddir(s), s->bs,
695 (unsigned long long) so->offset);
702 struct iolog_flush_data {
703 struct workqueue_work work;
710 #define GZ_CHUNK 131072
712 static struct iolog_compress *get_new_chunk(unsigned int seq)
714 struct iolog_compress *c;
716 c = malloc(sizeof(*c));
717 INIT_FLIST_HEAD(&c->list);
718 c->buf = malloc(GZ_CHUNK);
724 static void free_chunk(struct iolog_compress *ic)
730 static int z_stream_init(z_stream *stream, int gz_hdr)
734 memset(stream, 0, sizeof(*stream));
735 stream->zalloc = Z_NULL;
736 stream->zfree = Z_NULL;
737 stream->opaque = Z_NULL;
738 stream->next_in = Z_NULL;
741 * zlib magic - add 32 for auto-detection of gz header or not,
742 * if we decide to store files in a gzip friendly format.
747 if (inflateInit2(stream, wbits) != Z_OK)
753 struct inflate_chunk_iter {
762 static void finish_chunk(z_stream *stream, FILE *f,
763 struct inflate_chunk_iter *iter)
767 ret = inflateEnd(stream);
769 log_err("fio: failed to end log inflation seq %d (%d)\n",
772 flush_samples(f, iter->buf, iter->buf_used);
775 iter->buf_size = iter->buf_used = 0;
779 * Iterative chunk inflation. Handles cases where we cross into a new
780 * sequence, doing flush finish of previous chunk if needed.
782 static size_t inflate_chunk(struct iolog_compress *ic, int gz_hdr, FILE *f,
783 z_stream *stream, struct inflate_chunk_iter *iter)
787 dprint(FD_COMPRESS, "inflate chunk size=%lu, seq=%u\n",
788 (unsigned long) ic->len, ic->seq);
790 if (ic->seq != iter->seq) {
792 finish_chunk(stream, f, iter);
794 z_stream_init(stream, gz_hdr);
798 stream->avail_in = ic->len;
799 stream->next_in = ic->buf;
801 if (!iter->buf_size) {
802 iter->buf_size = iter->chunk_sz;
803 iter->buf = malloc(iter->buf_size);
806 while (stream->avail_in) {
807 size_t this_out = iter->buf_size - iter->buf_used;
810 stream->avail_out = this_out;
811 stream->next_out = iter->buf + iter->buf_used;
813 err = inflate(stream, Z_NO_FLUSH);
815 log_err("fio: failed inflating log: %d\n", err);
820 iter->buf_used += this_out - stream->avail_out;
822 if (!stream->avail_out) {
823 iter->buf_size += iter->chunk_sz;
824 iter->buf = realloc(iter->buf, iter->buf_size);
828 if (err == Z_STREAM_END)
832 ret = (void *) stream->next_in - ic->buf;
834 dprint(FD_COMPRESS, "inflated to size=%lu\n", (unsigned long) iter->buf_size);
840 * Inflate stored compressed chunks, or write them directly to the log
841 * file if so instructed.
843 static int inflate_gz_chunks(struct io_log *log, FILE *f)
845 struct inflate_chunk_iter iter = { .chunk_sz = log->log_gz, };
848 while (!flist_empty(&log->chunk_list)) {
849 struct iolog_compress *ic;
851 ic = flist_first_entry(&log->chunk_list, struct iolog_compress, list);
852 flist_del(&ic->list);
854 if (log->log_gz_store) {
857 dprint(FD_COMPRESS, "log write chunk size=%lu, "
858 "seq=%u\n", (unsigned long) ic->len, ic->seq);
860 ret = fwrite(ic->buf, ic->len, 1, f);
861 if (ret != 1 || ferror(f)) {
863 log_err("fio: error writing compressed log\n");
866 inflate_chunk(ic, log->log_gz_store, f, &stream, &iter);
872 finish_chunk(&stream, f, &iter);
880 * Open compressed log file and decompress the stored chunks and
881 * write them to stdout. The chunks are stored sequentially in the
882 * file, so we iterate over them and do them one-by-one.
884 int iolog_file_inflate(const char *file)
886 struct inflate_chunk_iter iter = { .chunk_sz = 64 * 1024 * 1024, };
887 struct iolog_compress ic;
895 f = fopen(file, "r");
901 if (stat(file, &sb) < 0) {
907 ic.buf = buf = malloc(sb.st_size);
911 ret = fread(ic.buf, ic.len, 1, f);
917 } else if (ret != 1) {
918 log_err("fio: short read on reading log\n");
927 * Each chunk will return Z_STREAM_END. We don't know how many
928 * chunks are in the file, so we just keep looping and incrementing
929 * the sequence number until we have consumed the whole compressed
936 iret = inflate_chunk(&ic, 1, stdout, &stream, &iter);
949 finish_chunk(&stream, stdout, &iter);
959 static int inflate_gz_chunks(struct io_log *log, FILE *f)
964 int iolog_file_inflate(const char *file)
966 log_err("fio: log inflation not possible without zlib\n");
972 void flush_log(struct io_log *log, int do_append)
978 f = fopen(log->filename, "w");
980 f = fopen(log->filename, "a");
986 buf = set_file_buffer(f);
988 inflate_gz_chunks(log, f);
990 while (!flist_empty(&log->io_logs)) {
991 struct io_logs *cur_log;
993 cur_log = flist_first_entry(&log->io_logs, struct io_logs, list);
994 flist_del_init(&cur_log->list);
995 flush_samples(f, cur_log->log, cur_log->nr_samples * log_entry_sz(log));
999 clear_file_buffer(buf);
1002 static int finish_log(struct thread_data *td, struct io_log *log, int trylock)
1004 if (td->flags & TD_F_COMPRESS_LOG)
1008 if (fio_trylock_file(log->filename))
1011 fio_lock_file(log->filename);
1013 if (td->client_type == FIO_CLIENT_TYPE_GUI || is_backend)
1014 fio_send_iolog(td, log, log->filename);
1016 flush_log(log, !td->o.per_job_logs);
1018 fio_unlock_file(log->filename);
1023 size_t log_chunk_sizes(struct io_log *log)
1025 struct flist_head *entry;
1028 if (flist_empty(&log->chunk_list))
1032 pthread_mutex_lock(&log->chunk_lock);
1033 flist_for_each(entry, &log->chunk_list) {
1034 struct iolog_compress *c;
1036 c = flist_entry(entry, struct iolog_compress, list);
1039 pthread_mutex_unlock(&log->chunk_lock);
1045 static int gz_work(struct iolog_flush_data *data)
1047 struct iolog_compress *c = NULL;
1048 struct flist_head list;
1054 INIT_FLIST_HEAD(&list);
1056 memset(&stream, 0, sizeof(stream));
1057 stream.zalloc = Z_NULL;
1058 stream.zfree = Z_NULL;
1059 stream.opaque = Z_NULL;
1061 ret = deflateInit(&stream, Z_DEFAULT_COMPRESSION);
1063 log_err("fio: failed to init gz stream\n");
1067 seq = ++data->log->chunk_seq;
1069 stream.next_in = (void *) data->samples;
1070 stream.avail_in = data->nr_samples * log_entry_sz(data->log);
1072 dprint(FD_COMPRESS, "deflate input size=%lu, seq=%u, log=%s\n",
1073 (unsigned long) stream.avail_in, seq,
1074 data->log->filename);
1077 dprint(FD_COMPRESS, "seq=%d, chunk=%lu\n", seq, c->len);
1078 c = get_new_chunk(seq);
1079 stream.avail_out = GZ_CHUNK;
1080 stream.next_out = c->buf;
1081 ret = deflate(&stream, Z_NO_FLUSH);
1083 log_err("fio: deflate log (%d)\n", ret);
1088 c->len = GZ_CHUNK - stream.avail_out;
1089 flist_add_tail(&c->list, &list);
1091 } while (stream.avail_in);
1093 stream.next_out = c->buf + c->len;
1094 stream.avail_out = GZ_CHUNK - c->len;
1096 ret = deflate(&stream, Z_FINISH);
1099 * Z_BUF_ERROR is special, it just means we need more
1100 * output space. We'll handle that below. Treat any other
1103 if (ret != Z_BUF_ERROR) {
1104 log_err("fio: deflate log (%d)\n", ret);
1105 flist_del(&c->list);
1112 c->len = GZ_CHUNK - stream.avail_out;
1114 dprint(FD_COMPRESS, "seq=%d, chunk=%lu\n", seq, c->len);
1116 if (ret != Z_STREAM_END) {
1118 c = get_new_chunk(seq);
1119 stream.avail_out = GZ_CHUNK;
1120 stream.next_out = c->buf;
1121 ret = deflate(&stream, Z_FINISH);
1122 c->len = GZ_CHUNK - stream.avail_out;
1124 flist_add_tail(&c->list, &list);
1125 dprint(FD_COMPRESS, "seq=%d, chunk=%lu\n", seq, c->len);
1126 } while (ret != Z_STREAM_END);
1129 dprint(FD_COMPRESS, "deflated to size=%lu\n", (unsigned long) total);
1131 ret = deflateEnd(&stream);
1133 log_err("fio: deflateEnd %d\n", ret);
1135 free(data->samples);
1137 if (!flist_empty(&list)) {
1138 pthread_mutex_lock(&data->log->chunk_lock);
1139 flist_splice_tail(&list, &data->log->chunk_list);
1140 pthread_mutex_unlock(&data->log->chunk_lock);
1149 while (!flist_empty(&list)) {
1150 c = flist_first_entry(list.next, struct iolog_compress, list);
1151 flist_del(&c->list);
1159 * Invoked from our compress helper thread, when logging would have exceeded
1160 * the specified memory limitation. Compresses the previously stored
1163 static int gz_work_async(struct submit_worker *sw, struct workqueue_work *work)
1165 return gz_work(container_of(work, struct iolog_flush_data, work));
1168 static int gz_init_worker(struct submit_worker *sw)
1170 struct thread_data *td = sw->wq->td;
1172 if (!fio_option_is_set(&td->o, log_gz_cpumask))
1175 if (fio_setaffinity(gettid(), td->o.log_gz_cpumask) == -1) {
1176 log_err("gz: failed to set CPU affinity\n");
1183 static struct workqueue_ops log_compress_wq_ops = {
1184 .fn = gz_work_async,
1185 .init_worker_fn = gz_init_worker,
1189 int iolog_compress_init(struct thread_data *td, struct sk_out *sk_out)
1191 if (!(td->flags & TD_F_COMPRESS_LOG))
1194 workqueue_init(td, &td->log_compress_wq, &log_compress_wq_ops, 1, sk_out);
1198 void iolog_compress_exit(struct thread_data *td)
1200 if (!(td->flags & TD_F_COMPRESS_LOG))
1203 workqueue_exit(&td->log_compress_wq);
1207 * Queue work item to compress the existing log entries. We reset the
1208 * current log to a small size, and reference the existing log in the
1209 * data that we queue for compression. Once compression has been done,
1210 * this old log is freed. If called with finish == true, will not return
1211 * until the log compression has completed, and will flush all previous
1214 static int iolog_flush(struct io_log *log)
1216 struct iolog_flush_data *data;
1218 data = malloc(sizeof(*data));
1225 while (!flist_empty(&log->io_logs)) {
1226 struct io_logs *cur_log;
1228 cur_log = flist_first_entry(&log->io_logs, struct io_logs, list);
1229 flist_del_init(&cur_log->list);
1231 data->samples = cur_log->log;
1232 data->nr_samples = cur_log->nr_samples;
1234 cur_log->nr_samples = 0;
1235 cur_log->max_samples = 0;
1236 cur_log->log = NULL;
1245 int iolog_cur_flush(struct io_log *log, struct io_logs *cur_log)
1247 struct iolog_flush_data *data;
1249 data = malloc(sizeof(*data));
1255 data->samples = cur_log->log;
1256 data->nr_samples = cur_log->nr_samples;
1259 cur_log->nr_samples = cur_log->max_samples = 0;
1260 cur_log->log = NULL;
1262 workqueue_enqueue(&log->td->log_compress_wq, &data->work);
1267 static int iolog_flush(struct io_log *log)
1272 int iolog_cur_flush(struct io_log *log, struct io_logs *cur_log)
1277 int iolog_compress_init(struct thread_data *td, struct sk_out *sk_out)
1282 void iolog_compress_exit(struct thread_data *td)
1288 struct io_logs *iolog_cur_log(struct io_log *log)
1290 if (flist_empty(&log->io_logs))
1293 return flist_last_entry(&log->io_logs, struct io_logs, list);
1296 uint64_t iolog_nr_samples(struct io_log *iolog)
1298 struct flist_head *entry;
1301 flist_for_each(entry, &iolog->io_logs) {
1302 struct io_logs *cur_log;
1304 cur_log = flist_entry(entry, struct io_logs, list);
1305 ret += cur_log->nr_samples;
1311 static int __write_log(struct thread_data *td, struct io_log *log, int try)
1314 return finish_log(td, log, try);
1319 static int write_iops_log(struct thread_data *td, int try, bool unit_log)
1323 if (per_unit_log(td->iops_log) != unit_log)
1326 ret = __write_log(td, td->iops_log, try);
1328 td->iops_log = NULL;
1333 static int write_slat_log(struct thread_data *td, int try, bool unit_log)
1340 ret = __write_log(td, td->slat_log, try);
1342 td->slat_log = NULL;
1347 static int write_clat_log(struct thread_data *td, int try, bool unit_log)
1354 ret = __write_log(td, td->clat_log, try);
1356 td->clat_log = NULL;
1361 static int write_lat_log(struct thread_data *td, int try, bool unit_log)
1368 ret = __write_log(td, td->lat_log, try);
1375 static int write_bandw_log(struct thread_data *td, int try, bool unit_log)
1379 if (per_unit_log(td->bw_log) != unit_log)
1382 ret = __write_log(td, td->bw_log, try);
1401 int (*fn)(struct thread_data *, int, bool);
1404 static struct log_type log_types[] = {
1406 .mask = BW_LOG_MASK,
1407 .fn = write_bandw_log,
1410 .mask = LAT_LOG_MASK,
1411 .fn = write_lat_log,
1414 .mask = SLAT_LOG_MASK,
1415 .fn = write_slat_log,
1418 .mask = CLAT_LOG_MASK,
1419 .fn = write_clat_log,
1422 .mask = IOPS_LOG_MASK,
1423 .fn = write_iops_log,
1427 void td_writeout_logs(struct thread_data *td, bool unit_logs)
1429 unsigned int log_mask = 0;
1430 unsigned int log_left = ALL_LOG_NR;
1433 old_state = td_bump_runstate(td, TD_FINISHING);
1435 finalize_logs(td, unit_logs);
1438 int prev_log_left = log_left;
1440 for (i = 0; i < ALL_LOG_NR && log_left; i++) {
1441 struct log_type *lt = &log_types[i];
1444 if (!(log_mask & lt->mask)) {
1445 ret = lt->fn(td, log_left != 1, unit_logs);
1448 log_mask |= lt->mask;
1453 if (prev_log_left == log_left)
1457 td_restore_runstate(td, old_state);
1460 void fio_writeout_logs(bool unit_logs)
1462 struct thread_data *td;
1466 td_writeout_logs(td, unit_logs);