6 void write_iolog_put(struct thread_data *td, struct io_u *io_u)
8 fprintf(td->iolog_f, "%u,%llu,%lu\n", io_u->ddir, io_u->offset, io_u->buflen);
11 int read_iolog_get(struct thread_data *td, struct io_u *io_u)
15 if (!list_empty(&td->io_log_list)) {
16 ipo = list_entry(td->io_log_list.next, struct io_piece, list);
18 io_u->offset = ipo->offset;
19 io_u->buflen = ipo->len;
20 io_u->ddir = ipo->ddir;
21 io_u->file = ipo->file;
29 void prune_io_piece_log(struct thread_data *td)
34 while ((n = rb_first(&td->io_hist_tree)) != NULL) {
35 ipo = rb_entry(n, struct io_piece, rb_node);
36 rb_erase(n, &td->io_hist_tree);
42 * log a successful write, so we can unwind the log for verify
44 void log_io_piece(struct thread_data *td, struct io_u *io_u)
46 struct rb_node **p, *parent;
47 struct io_piece *ipo, *__ipo;
49 ipo = malloc(sizeof(struct io_piece));
50 ipo->file = io_u->file;
51 ipo->offset = io_u->offset;
52 ipo->len = io_u->buflen;
55 * We don't need to sort the entries, if:
57 * Sequential writes, or
58 * Random writes that lay out the file as it goes along
60 * For both these cases, just reading back data in the order we
61 * wrote it out is the fastest.
63 if (!td_random(td) || !td->o.overwrite) {
64 INIT_LIST_HEAD(&ipo->list);
65 list_add_tail(&ipo->list, &td->io_hist_list);
69 RB_CLEAR_NODE(&ipo->rb_node);
70 p = &td->io_hist_tree.rb_node;
74 * Sort the entry into the verification list
79 __ipo = rb_entry(parent, struct io_piece, rb_node);
80 if (ipo->offset <= __ipo->offset)
86 rb_link_node(&ipo->rb_node, parent, p);
87 rb_insert_color(&ipo->rb_node, &td->io_hist_tree);
90 void write_iolog_close(struct thread_data *td)
98 * Open a stored log and read in the entries.
100 static int init_iolog_read(struct thread_data *td)
102 unsigned long long offset;
106 int rw, reads, writes;
108 f = fopen(td->o.read_iolog_file, "r");
110 perror("fopen read iolog");
115 * Read in the read iolog and store it, reuse the infrastructure
116 * for doing verifications.
120 while ((p = fgets(str, 4096, f)) != NULL) {
121 struct io_piece *ipo;
123 if (sscanf(p, "%d,%llu,%u", &rw, &offset, &bytes) != 3) {
124 log_err("bad iolog: %s\n", p);
129 else if (rw == DDIR_WRITE)
131 else if (rw != DDIR_SYNC) {
132 log_err("bad ddir: %d\n", rw);
136 ipo = malloc(sizeof(*ipo));
137 INIT_LIST_HEAD(&ipo->list);
138 ipo->offset = offset;
140 ipo->ddir = (enum fio_ddir) rw;
141 if (bytes > td->o.max_bs[rw])
142 td->o.max_bs[rw] = bytes;
143 list_add_tail(&ipo->list, &td->io_log_list);
149 if (!reads && !writes)
151 else if (reads && !writes)
152 td->o.td_ddir = TD_DDIR_READ;
153 else if (!reads && writes)
154 td->o.td_ddir = TD_DDIR_READ;
156 td->o.td_ddir = TD_DDIR_RW;
162 * Setup a log for storing io patterns.
164 static int init_iolog_write(struct thread_data *td)
168 f = fopen(td->o.write_iolog_file, "w+");
170 perror("fopen write iolog");
175 * That's it for writing, setup a log buffer and we're done.
178 td->iolog_buf = malloc(8192);
179 setvbuf(f, td->iolog_buf, _IOFBF, 8192);
183 int init_iolog(struct thread_data *td)
187 if (td->io_ops->flags & FIO_DISKLESSIO)
190 if (td->o.read_iolog_file)
191 ret = init_iolog_read(td);
192 else if (td->o.write_iolog_file)
193 ret = init_iolog_write(td);
198 void setup_log(struct io_log **log)
200 struct io_log *l = malloc(sizeof(*l));
203 l->max_samples = 1024;
204 l->log = malloc(l->max_samples * sizeof(struct io_sample));
208 void __finish_log(struct io_log *log, const char *name)
213 f = fopen(name, "w");
219 for (i = 0; i < log->nr_samples; i++)
220 fprintf(f, "%lu, %lu, %u\n", log->log[i].time, log->log[i].val, log->log[i].ddir);
227 void finish_log(struct thread_data *td, struct io_log *log, const char *name)
231 snprintf(file_name, 200, "client%d_%s.log", td->thread_number, name);
232 __finish_log(log, file_name);