6 void write_iolog_put(struct thread_data *td, struct io_u *io_u)
8 fprintf(td->iolog_f, "%d,%llu,%u\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)
33 while (!list_empty(&td->io_hist_list)) {
34 ipo = list_entry(td->io_hist_list.next, struct io_piece, list);
42 * log a succesful 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 io_piece *ipo = malloc(sizeof(struct io_piece));
47 struct list_head *entry;
49 INIT_LIST_HEAD(&ipo->list);
50 ipo->file = io_u->file;
51 ipo->offset = io_u->offset;
52 ipo->len = io_u->buflen;
55 * for random io where the writes extend the file, it will typically
56 * be laid out with the block scattered as written. it's faster to
57 * read them in in that order again, so don't sort
59 if (td->sequential || !td->overwrite) {
60 list_add_tail(&ipo->list, &td->io_hist_list);
65 * for random io, sort the list so verify will run faster
67 entry = &td->io_hist_list;
68 while ((entry = entry->prev) != &td->io_hist_list) {
69 struct io_piece *__ipo = list_entry(entry, struct io_piece, list);
71 if (__ipo->offset < ipo->offset)
75 list_add(&ipo->list, entry);
78 void write_iolog_close(struct thread_data *td)
85 int init_iolog(struct thread_data *td)
87 unsigned long long offset;
91 int rw, i, reads, writes;
93 if (!td->read_iolog && !td->write_iolog)
97 f = fopen(td->iolog_file, "r");
99 f = fopen(td->iolog_file, "w");
102 perror("fopen iolog");
103 printf("file %s, %d/%d\n", td->iolog_file, td->read_iolog, td->write_iolog);
108 * That's it for writing, setup a log buffer and we're done.
110 if (td->write_iolog) {
112 td->iolog_buf = malloc(8192);
113 setvbuf(f, td->iolog_buf, _IOFBF, 8192);
118 * Read in the read iolog and store it, reuse the infrastructure
119 * for doing verifications.
122 reads = writes = i = 0;
123 while ((p = fgets(str, 4096, f)) != NULL) {
124 struct io_piece *ipo;
126 if (sscanf(p, "%d,%llu,%u", &rw, &offset, &bytes) != 3) {
127 log_err("bad iolog: %s\n", p);
132 else if (rw == DDIR_WRITE)
135 log_err("bad ddir: %d\n", rw);
139 ipo = malloc(sizeof(*ipo));
140 INIT_LIST_HEAD(&ipo->list);
141 ipo->offset = offset;
143 if (bytes > td->max_bs)
146 list_add_tail(&ipo->list, &td->io_log_list);
156 if (reads && !writes)
157 td->ddir = DDIR_READ;
158 else if (!reads && writes)
159 td->ddir = DDIR_READ;
166 int setup_rate(struct thread_data *td)
168 int nr_reads_per_sec;
173 if (td->rate < td->ratemin) {
174 log_err("min rate larger than nominal rate\n");
178 nr_reads_per_sec = (td->rate * 1024) / td->min_bs;
179 td->rate_usec_cycle = 1000000 / nr_reads_per_sec;
180 td->rate_pending_usleep = 0;
184 void setup_log(struct io_log **log)
186 struct io_log *l = malloc(sizeof(*l));
189 l->max_samples = 1024;
190 l->log = malloc(l->max_samples * sizeof(struct io_sample));
194 void finish_log(struct thread_data *td, struct io_log *log, const char *name)
200 snprintf(file_name, 200, "client%d_%s.log", td->thread_number, name);
201 f = fopen(file_name, "w");
207 for (i = 0; i < log->nr_samples; i++)
208 fprintf(f, "%lu, %lu, %u\n", log->log[i].time, log->log[i].val, log->log[i].ddir);