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;
23 * work around, this needs a format change to work for > 1 file
26 io_u->file = &td->files[0];
34 void prune_io_piece_log(struct thread_data *td)
39 while ((n = rb_first(&td->io_hist_tree)) != NULL) {
40 ipo = rb_entry(n, struct io_piece, rb_node);
41 rb_erase(n, &td->io_hist_tree);
47 * log a successful write, so we can unwind the log for verify
49 void log_io_piece(struct thread_data *td, struct io_u *io_u)
51 struct rb_node **p, *parent;
52 struct io_piece *ipo, *__ipo;
54 ipo = malloc(sizeof(struct io_piece));
55 ipo->file = io_u->file;
56 ipo->offset = io_u->offset;
57 ipo->len = io_u->buflen;
60 * We don't need to sort the entries, if:
62 * Sequential writes, or
63 * Random writes that lay out the file as it goes along
65 * For both these cases, just reading back data in the order we
66 * wrote it out is the fastest.
68 if (!td_random(td) || !td->o.overwrite ||
69 (io_u->file->flags & FIO_FILE_NOSORT)) {
70 INIT_LIST_HEAD(&ipo->list);
71 list_add_tail(&ipo->list, &td->io_hist_list);
75 RB_CLEAR_NODE(&ipo->rb_node);
76 p = &td->io_hist_tree.rb_node;
80 * Sort the entry into the verification list
85 __ipo = rb_entry(parent, struct io_piece, rb_node);
86 if (ipo->offset <= __ipo->offset)
92 rb_link_node(&ipo->rb_node, parent, p);
93 rb_insert_color(&ipo->rb_node, &td->io_hist_tree);
96 void write_iolog_close(struct thread_data *td)
104 * Open a stored log and read in the entries.
106 static int init_iolog_read(struct thread_data *td)
108 unsigned long long offset;
112 int rw, reads, writes;
114 f = fopen(td->o.read_iolog_file, "r");
116 perror("fopen read iolog");
121 * Read in the read iolog and store it, reuse the infrastructure
122 * for doing verifications.
126 while ((p = fgets(str, 4096, f)) != NULL) {
127 struct io_piece *ipo;
129 if (sscanf(p, "%d,%llu,%u", &rw, &offset, &bytes) != 3) {
130 log_err("bad iolog: %s\n", p);
135 else if (rw == DDIR_WRITE)
137 else if (rw != DDIR_SYNC) {
138 log_err("bad ddir: %d\n", rw);
142 ipo = malloc(sizeof(*ipo));
143 INIT_LIST_HEAD(&ipo->list);
144 ipo->offset = offset;
146 ipo->ddir = (enum fio_ddir) rw;
147 if (bytes > td->o.max_bs[rw])
148 td->o.max_bs[rw] = bytes;
149 list_add_tail(&ipo->list, &td->io_log_list);
155 if (!reads && !writes)
157 else if (reads && !writes)
158 td->o.td_ddir = TD_DDIR_READ;
159 else if (!reads && writes)
160 td->o.td_ddir = TD_DDIR_READ;
162 td->o.td_ddir = TD_DDIR_RW;
168 * Setup a log for storing io patterns.
170 static int init_iolog_write(struct thread_data *td)
174 f = fopen(td->o.write_iolog_file, "w+");
176 perror("fopen write iolog");
181 * That's it for writing, setup a log buffer and we're done.
184 td->iolog_buf = malloc(8192);
185 setvbuf(f, td->iolog_buf, _IOFBF, 8192);
189 int init_iolog(struct thread_data *td)
193 if (td->io_ops->flags & FIO_DISKLESSIO)
196 if (td->o.read_iolog_file)
197 ret = init_iolog_read(td);
198 else if (td->o.write_iolog_file)
199 ret = init_iolog_write(td);
204 void setup_log(struct io_log **log)
206 struct io_log *l = malloc(sizeof(*l));
209 l->max_samples = 1024;
210 l->log = malloc(l->max_samples * sizeof(struct io_sample));
214 void __finish_log(struct io_log *log, const char *name)
219 f = fopen(name, "w");
225 for (i = 0; i < log->nr_samples; i++)
226 fprintf(f, "%lu, %lu, %u\n", log->log[i].time, log->log[i].val, log->log[i].ddir);
233 void finish_log(struct thread_data *td, struct io_log *log, const char *name)
237 snprintf(file_name, 200, "client%d_%s.log", td->thread_number, name);
238 __finish_log(log, file_name);