Avoid using the rbtree if we don't have to
[fio.git] / log.c
CommitLineData
3c39a379
JA
1#include <stdio.h>
2#include <stdlib.h>
3#include "list.h"
4#include "fio.h"
5
6void write_iolog_put(struct thread_data *td, struct io_u *io_u)
7{
a4f4fdd7 8 fprintf(td->iolog_f, "%u,%llu,%lu\n", io_u->ddir, io_u->offset, io_u->buflen);
3c39a379
JA
9}
10
11int read_iolog_get(struct thread_data *td, struct io_u *io_u)
12{
13 struct io_piece *ipo;
14
15 if (!list_empty(&td->io_log_list)) {
16 ipo = list_entry(td->io_log_list.next, struct io_piece, list);
17 list_del(&ipo->list);
18 io_u->offset = ipo->offset;
19 io_u->buflen = ipo->len;
20 io_u->ddir = ipo->ddir;
53cdc686 21 io_u->file = ipo->file;
3c39a379
JA
22 free(ipo);
23 return 0;
24 }
25
26 return 1;
27}
28
29void prune_io_piece_log(struct thread_data *td)
30{
31 struct io_piece *ipo;
4b87898e 32 struct rb_node *n;
3c39a379 33
4b87898e
JA
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);
3c39a379
JA
37 free(ipo);
38 }
39}
40
41/*
34403fb1 42 * log a successful write, so we can unwind the log for verify
3c39a379
JA
43 */
44void log_io_piece(struct thread_data *td, struct io_u *io_u)
45{
8de8f047 46 struct rb_node **p, *parent;
4b87898e 47 struct io_piece *ipo, *__ipo;
3c39a379 48
4b87898e 49 ipo = malloc(sizeof(struct io_piece));
53cdc686 50 ipo->file = io_u->file;
3c39a379
JA
51 ipo->offset = io_u->offset;
52 ipo->len = io_u->buflen;
53
8de8f047
JA
54 /*
55 * We don't need to sort the entries, if:
56 *
57 * Sequential writes, or
58 * Random writes that lay out the file as it goes along
59 *
60 * For both these cases, just reading back data in the order we
61 * wrote it out is the fastest.
62 */
63 if (!td_random(td) || !td->o.overwrite) {
64 INIT_LIST_HEAD(&ipo->list);
65 list_add_tail(&ipo->list, &td->io_hist_list);
66 return;
67 }
68
69 RB_CLEAR_NODE(&ipo->rb_node);
70 p = &td->io_hist_tree.rb_node;
71 parent = NULL;
72
3c39a379 73 /*
4b87898e 74 * Sort the entry into the verification list
3c39a379 75 */
4b87898e
JA
76 while (*p) {
77 parent = *p;
78
79 __ipo = rb_entry(parent, struct io_piece, rb_node);
bb5d7d0b 80 if (ipo->offset <= __ipo->offset)
4b87898e 81 p = &(*p)->rb_left;
4b87898e 82 else
bb5d7d0b 83 p = &(*p)->rb_right;
3c39a379
JA
84 }
85
4b87898e
JA
86 rb_link_node(&ipo->rb_node, parent, p);
87 rb_insert_color(&ipo->rb_node, &td->io_hist_tree);
3c39a379
JA
88}
89
90void write_iolog_close(struct thread_data *td)
91{
92 fflush(td->iolog_f);
93 fclose(td->iolog_f);
94 free(td->iolog_buf);
95}
96
fb71fbd7
JA
97/*
98 * Open a stored log and read in the entries.
99 */
100static int init_iolog_read(struct thread_data *td)
3c39a379
JA
101{
102 unsigned long long offset;
103 unsigned int bytes;
104 char *str, *p;
105 FILE *f;
fb71fbd7 106 int rw, reads, writes;
3c39a379 107
2dc1bbeb 108 f = fopen(td->o.read_iolog_file, "r");
3c39a379 109 if (!f) {
fb71fbd7 110 perror("fopen read iolog");
3c39a379
JA
111 return 1;
112 }
113
3c39a379
JA
114 /*
115 * Read in the read iolog and store it, reuse the infrastructure
116 * for doing verifications.
117 */
118 str = malloc(4096);
fb71fbd7 119 reads = writes = 0;
3c39a379
JA
120 while ((p = fgets(str, 4096, f)) != NULL) {
121 struct io_piece *ipo;
122
123 if (sscanf(p, "%d,%llu,%u", &rw, &offset, &bytes) != 3) {
3b70d7e5 124 log_err("bad iolog: %s\n", p);
3c39a379
JA
125 continue;
126 }
127 if (rw == DDIR_READ)
128 reads++;
129 else if (rw == DDIR_WRITE)
130 writes++;
c38e9468 131 else if (rw != DDIR_SYNC) {
3b70d7e5 132 log_err("bad ddir: %d\n", rw);
3c39a379
JA
133 continue;
134 }
135
136 ipo = malloc(sizeof(*ipo));
137 INIT_LIST_HEAD(&ipo->list);
138 ipo->offset = offset;
139 ipo->len = bytes;
1e97cce9 140 ipo->ddir = (enum fio_ddir) rw;
2dc1bbeb
JA
141 if (bytes > td->o.max_bs[rw])
142 td->o.max_bs[rw] = bytes;
3c39a379 143 list_add_tail(&ipo->list, &td->io_log_list);
3c39a379
JA
144 }
145
146 free(str);
147 fclose(f);
148
fb71fbd7 149 if (!reads && !writes)
3c39a379 150 return 1;
fb71fbd7 151 else if (reads && !writes)
2dc1bbeb 152 td->o.td_ddir = TD_DDIR_READ;
3c39a379 153 else if (!reads && writes)
2dc1bbeb 154 td->o.td_ddir = TD_DDIR_READ;
3c39a379 155 else
2dc1bbeb 156 td->o.td_ddir = TD_DDIR_RW;
3c39a379
JA
157
158 return 0;
159}
8914a9d8 160
fb71fbd7
JA
161/*
162 * Setup a log for storing io patterns.
163 */
164static int init_iolog_write(struct thread_data *td)
165{
076efc7c 166 FILE *f;
fb71fbd7 167
2dc1bbeb 168 f = fopen(td->o.write_iolog_file, "w+");
fb71fbd7
JA
169 if (!f) {
170 perror("fopen write iolog");
171 return 1;
172 }
173
174 /*
175 * That's it for writing, setup a log buffer and we're done.
176 */
177 td->iolog_f = f;
178 td->iolog_buf = malloc(8192);
179 setvbuf(f, td->iolog_buf, _IOFBF, 8192);
180 return 0;
181}
182
183int init_iolog(struct thread_data *td)
184{
b4a6a59a
JA
185 int ret = 0;
186
ba0fbe10 187 if (td->io_ops->flags & FIO_DISKLESSIO)
f48b467c
JA
188 return 0;
189
2dc1bbeb 190 if (td->o.read_iolog_file)
b4a6a59a 191 ret = init_iolog_read(td);
2dc1bbeb 192 else if (td->o.write_iolog_file)
b4a6a59a 193 ret = init_iolog_write(td);
fb71fbd7 194
1e97cce9 195 return ret;
fb71fbd7
JA
196}
197
8914a9d8
JA
198void setup_log(struct io_log **log)
199{
200 struct io_log *l = malloc(sizeof(*l));
201
202 l->nr_samples = 0;
203 l->max_samples = 1024;
204 l->log = malloc(l->max_samples * sizeof(struct io_sample));
205 *log = l;
206}
207
bb3884d8 208void __finish_log(struct io_log *log, const char *name)
8914a9d8 209{
8914a9d8 210 unsigned int i;
bb3884d8 211 FILE *f;
8914a9d8 212
bb3884d8 213 f = fopen(name, "w");
8914a9d8
JA
214 if (!f) {
215 perror("fopen log");
216 return;
217 }
218
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);
221
222 fclose(f);
223 free(log->log);
224 free(log);
225}
bb3884d8
JA
226
227void finish_log(struct thread_data *td, struct io_log *log, const char *name)
228{
229 char file_name[256];
230
231 snprintf(file_name, 200, "client%d_%s.log", td->thread_number, name);
232 __finish_log(log, file_name);
233}