2 * Code related to writing an iolog of what a thread is doing, and to
3 * later read that back and replay
13 static const char iolog_ver2[] = "fio version 2 iolog";
15 void queue_io_piece(struct thread_data *td, struct io_piece *ipo)
17 flist_add_tail(&ipo->list, &td->io_log_list);
18 td->total_io_size += ipo->len;
21 void log_io_u(struct thread_data *td, struct io_u *io_u)
23 const char *act[] = { "read", "write", "sync", "datasync" };
25 assert(io_u->ddir < 3);
27 if (!td->o.write_iolog_file)
30 fprintf(td->iolog_f, "%s %s %llu %lu\n", io_u->file->file_name,
31 act[io_u->ddir], io_u->offset,
35 void log_file(struct thread_data *td, struct fio_file *f,
36 enum file_log_act what)
38 const char *act[] = { "add", "open", "close" };
42 if (!td->o.write_iolog_file)
47 * this happens on the pre-open/close done before the job starts
52 fprintf(td->iolog_f, "%s %s\n", f->file_name, act[what]);
55 static void iolog_delay(struct thread_data *td, unsigned long delay)
57 unsigned long usec = utime_since_now(&td->last_issue);
65 * less than 100 usec delay, just regard it as noise
70 usec_sleep(td, delay);
73 static int ipo_special(struct thread_data *td, struct io_piece *ipo)
81 if (ipo->ddir != DDIR_INVAL)
84 f = td->files[ipo->fileno];
86 switch (ipo->file_action) {
87 case FIO_LOG_OPEN_FILE:
88 ret = td_io_open_file(td, f);
93 td_verror(td, ret, "iolog open file");
95 case FIO_LOG_CLOSE_FILE:
96 td_io_close_file(td, f);
98 case FIO_LOG_UNLINK_FILE:
102 log_err("fio: bad file action %d\n", ipo->file_action);
109 int read_iolog_get(struct thread_data *td, struct io_u *io_u)
111 struct io_piece *ipo;
113 while (!flist_empty(&td->io_log_list)) {
116 ipo = flist_entry(td->io_log_list.next, struct io_piece, list);
117 flist_del(&ipo->list);
119 ret = ipo_special(td, ipo);
123 } else if (ret > 0) {
128 io_u->offset = ipo->offset;
129 io_u->buflen = ipo->len;
130 io_u->ddir = ipo->ddir;
131 io_u->file = td->files[ipo->fileno];
132 get_file(io_u->file);
134 dprint(FD_IO, "iolog: get %llu/%lu/%s\n", io_u->offset,
135 io_u->buflen, io_u->file->file_name);
138 iolog_delay(td, ipo->delay);
148 void prune_io_piece_log(struct thread_data *td)
150 struct io_piece *ipo;
153 while ((n = rb_first(&td->io_hist_tree)) != NULL) {
154 ipo = rb_entry(n, struct io_piece, rb_node);
155 rb_erase(n, &td->io_hist_tree);
159 while (!flist_empty(&td->io_hist_list)) {
160 ipo = flist_entry(td->io_hist_list.next, struct io_piece, list);
161 flist_del(&ipo->list);
167 * log a successful write, so we can unwind the log for verify
169 void log_io_piece(struct thread_data *td, struct io_u *io_u)
171 struct rb_node **p, *parent;
172 struct io_piece *ipo, *__ipo;
174 ipo = malloc(sizeof(struct io_piece));
175 ipo->file = io_u->file;
176 ipo->offset = io_u->offset;
177 ipo->len = io_u->buflen;
180 * We don't need to sort the entries, if:
182 * Sequential writes, or
183 * Random writes that lay out the file as it goes along
185 * For both these cases, just reading back data in the order we
186 * wrote it out is the fastest.
188 * One exception is if we don't have a random map AND we are doing
189 * verifies, in that case we need to check for duplicate blocks and
190 * drop the old one, which we rely on the rb insert/lookup for
193 if ((!td_random(td) || !td->o.overwrite) &&
194 (file_randommap(td, ipo->file) || td->o.verify == VERIFY_NONE)) {
195 INIT_FLIST_HEAD(&ipo->list);
196 flist_add_tail(&ipo->list, &td->io_hist_list);
200 RB_CLEAR_NODE(&ipo->rb_node);
203 * Sort the entry into the verification list
206 p = &td->io_hist_tree.rb_node;
211 __ipo = rb_entry(parent, struct io_piece, rb_node);
212 if (ipo->offset < __ipo->offset)
214 else if (ipo->offset > __ipo->offset)
217 assert(ipo->len == __ipo->len);
218 rb_erase(parent, &td->io_hist_tree);
223 rb_link_node(&ipo->rb_node, parent, p);
224 rb_insert_color(&ipo->rb_node, &td->io_hist_tree);
227 void write_iolog_close(struct thread_data *td)
233 td->iolog_buf = NULL;
237 * Read version 2 iolog data. It is enhanced to include per-file logging,
240 static int read_iolog2(struct thread_data *td, FILE *f)
242 unsigned long long offset;
244 int reads, writes, fileno = 0, file_action = 0; /* stupid gcc */
249 free_release_files(td);
252 * Read in the read iolog and store it, reuse the infrastructure
253 * for doing verifications.
256 fname = malloc(256+16);
257 act = malloc(256+16);
260 while ((p = fgets(str, 4096, f)) != NULL) {
261 struct io_piece *ipo;
264 r = sscanf(p, "%256s %256s %llu %u", fname, act, &offset,
270 if (!strcmp(act, "read"))
272 else if (!strcmp(act, "write"))
274 else if (!strcmp(act, "sync"))
276 else if (!strcmp(act, "datasync"))
279 log_err("fio: bad iolog file action: %s\n",
285 if (!strcmp(act, "add")) {
287 fileno = add_file(td, fname);
288 file_action = FIO_LOG_ADD_FILE;
290 } else if (!strcmp(act, "open")) {
291 fileno = get_fileno(td, fname);
292 file_action = FIO_LOG_OPEN_FILE;
293 } else if (!strcmp(act, "close")) {
294 fileno = get_fileno(td, fname);
295 file_action = FIO_LOG_CLOSE_FILE;
297 log_err("fio: bad iolog file action: %s\n",
302 log_err("bad iolog2: %s", p);
308 else if (rw == DDIR_WRITE) {
310 * Don't add a write for ro mode
315 } else if (!ddir_sync(rw)) {
316 log_err("bad ddir: %d\n", rw);
323 ipo = malloc(sizeof(*ipo));
324 memset(ipo, 0, sizeof(*ipo));
325 INIT_FLIST_HEAD(&ipo->list);
326 ipo->offset = offset;
329 if (bytes > td->o.max_bs[rw])
330 td->o.max_bs[rw] = bytes;
331 if (rw == DDIR_INVAL) {
332 ipo->fileno = fileno;
333 ipo->file_action = file_action;
335 queue_io_piece(td, ipo);
342 if (writes && read_only) {
343 log_err("fio: <%s> skips replay of %d writes due to"
344 " read-only\n", td->o.name, writes);
348 if (!reads && !writes)
350 else if (reads && !writes)
351 td->o.td_ddir = TD_DDIR_READ;
352 else if (!reads && writes)
353 td->o.td_ddir = TD_DDIR_WRITE;
355 td->o.td_ddir = TD_DDIR_RW;
361 * open iolog, check version, and call appropriate parser
363 static int init_iolog_read(struct thread_data *td)
365 char buffer[256], *p;
369 f = fopen(td->o.read_iolog_file, "r");
371 perror("fopen read iolog");
375 p = fgets(buffer, sizeof(buffer), f);
377 td_verror(td, errno, "iolog read");
378 log_err("fio: unable to read iolog\n");
383 * version 2 of the iolog stores a specific string as the
384 * first line, check for that
386 if (!strncmp(iolog_ver2, buffer, strlen(iolog_ver2)))
387 ret = read_iolog2(td, f);
389 log_err("fio: iolog version 1 is no longer supported\n");
398 * Setup a log for storing io patterns.
400 static int init_iolog_write(struct thread_data *td)
406 f = fopen(td->o.write_iolog_file, "a");
408 perror("fopen write iolog");
413 * That's it for writing, setup a log buffer and we're done.
416 td->iolog_buf = malloc(8192);
417 setvbuf(f, td->iolog_buf, _IOFBF, 8192);
420 * write our version line
422 if (fprintf(f, "%s\n", iolog_ver2) < 0) {
423 perror("iolog init\n");
428 * add all known files
430 for_each_file(td, ff, i)
431 log_file(td, ff, FIO_LOG_ADD_FILE);
436 int init_iolog(struct thread_data *td)
440 if (td->o.read_iolog_file) {
442 * Check if it's a blktrace file and load that if possible.
443 * Otherwise assume it's a normal log file and load that.
445 if (is_blktrace(td->o.read_iolog_file))
446 ret = load_blktrace(td, td->o.read_iolog_file);
448 ret = init_iolog_read(td);
449 } else if (td->o.write_iolog_file)
450 ret = init_iolog_write(td);
455 void setup_log(struct io_log **log)
457 struct io_log *l = malloc(sizeof(*l));
460 l->max_samples = 1024;
461 l->log = malloc(l->max_samples * sizeof(struct io_sample));
465 void __finish_log(struct io_log *log, const char *name)
470 f = fopen(name, "a");
476 for (i = 0; i < log->nr_samples; i++) {
477 fprintf(f, "%lu, %lu, %u, %u\n", log->log[i].time,
488 void finish_log_named(struct thread_data *td, struct io_log *log,
489 const char *prefix, const char *postfix)
491 char file_name[256], *p;
493 snprintf(file_name, 200, "%s_%s.log", prefix, postfix);
494 p = basename(file_name);
495 __finish_log(log, p);
498 void finish_log(struct thread_data *td, struct io_log *log, const char *name)
500 finish_log_named(td, log, td->o.name, name);