Commit | Line | Data |
---|---|---|
f29b25a3 JA |
1 | /* |
2 | * Code related to writing an iolog of what a thread is doing, and to | |
3 | * later read that back and replay | |
4 | */ | |
3c39a379 JA |
5 | #include <stdio.h> |
6 | #include <stdlib.h> | |
5921e80c | 7 | #include <libgen.h> |
f29b25a3 | 8 | #include <assert.h> |
01743ee1 | 9 | #include "flist.h" |
3c39a379 | 10 | #include "fio.h" |
4f5af7b2 | 11 | #include "verify.h" |
3c39a379 | 12 | |
f29b25a3 JA |
13 | static const char iolog_ver2[] = "fio version 2 iolog"; |
14 | ||
691c8fb0 JA |
15 | void queue_io_piece(struct thread_data *td, struct io_piece *ipo) |
16 | { | |
01743ee1 | 17 | flist_add_tail(&ipo->list, &td->io_log_list); |
691c8fb0 JA |
18 | td->total_io_size += ipo->len; |
19 | } | |
20 | ||
f29b25a3 | 21 | void log_io_u(struct thread_data *td, struct io_u *io_u) |
3c39a379 | 22 | { |
44f29692 JA |
23 | const char *act[] = { "read", "write", "sync", "datasync", |
24 | "sync_file_range" }; | |
f29b25a3 | 25 | |
44f29692 | 26 | assert(io_u->ddir <= 4); |
f29b25a3 JA |
27 | |
28 | if (!td->o.write_iolog_file) | |
29 | return; | |
30 | ||
5ec10eaa JA |
31 | fprintf(td->iolog_f, "%s %s %llu %lu\n", io_u->file->file_name, |
32 | act[io_u->ddir], io_u->offset, | |
33 | io_u->buflen); | |
f29b25a3 JA |
34 | } |
35 | ||
36 | void log_file(struct thread_data *td, struct fio_file *f, | |
37 | enum file_log_act what) | |
38 | { | |
39 | const char *act[] = { "add", "open", "close" }; | |
40 | ||
41 | assert(what < 3); | |
42 | ||
43 | if (!td->o.write_iolog_file) | |
44 | return; | |
45 | ||
393ca7e9 JA |
46 | |
47 | /* | |
48 | * this happens on the pre-open/close done before the job starts | |
49 | */ | |
50 | if (!td->iolog_f) | |
51 | return; | |
52 | ||
f29b25a3 | 53 | fprintf(td->iolog_f, "%s %s\n", f->file_name, act[what]); |
3c39a379 JA |
54 | } |
55 | ||
a61eddec JA |
56 | static void iolog_delay(struct thread_data *td, unsigned long delay) |
57 | { | |
58 | unsigned long usec = utime_since_now(&td->last_issue); | |
59 | ||
60 | if (delay < usec) | |
61 | return; | |
62 | ||
63 | delay -= usec; | |
64 | ||
65 | /* | |
66 | * less than 100 usec delay, just regard it as noise | |
67 | */ | |
68 | if (delay < 100) | |
69 | return; | |
70 | ||
71 | usec_sleep(td, delay); | |
72 | } | |
73 | ||
f718273e JA |
74 | static int ipo_special(struct thread_data *td, struct io_piece *ipo) |
75 | { | |
76 | struct fio_file *f; | |
77 | int ret; | |
78 | ||
79 | /* | |
80 | * Not a special ipo | |
81 | */ | |
82 | if (ipo->ddir != DDIR_INVAL) | |
83 | return 0; | |
84 | ||
85 | f = td->files[ipo->fileno]; | |
86 | ||
87 | switch (ipo->file_action) { | |
88 | case FIO_LOG_OPEN_FILE: | |
89 | ret = td_io_open_file(td, f); | |
457bf399 | 90 | if (!ret) |
f718273e | 91 | break; |
f718273e JA |
92 | td_verror(td, ret, "iolog open file"); |
93 | return -1; | |
94 | case FIO_LOG_CLOSE_FILE: | |
95 | td_io_close_file(td, f); | |
96 | break; | |
97 | case FIO_LOG_UNLINK_FILE: | |
98 | unlink(f->file_name); | |
99 | break; | |
100 | default: | |
101 | log_err("fio: bad file action %d\n", ipo->file_action); | |
102 | break; | |
103 | } | |
104 | ||
105 | return 1; | |
106 | } | |
107 | ||
3c39a379 JA |
108 | int read_iolog_get(struct thread_data *td, struct io_u *io_u) |
109 | { | |
110 | struct io_piece *ipo; | |
457bf399 GO |
111 | unsigned long elapsed; |
112 | ||
01743ee1 | 113 | while (!flist_empty(&td->io_log_list)) { |
f718273e JA |
114 | int ret; |
115 | ||
01743ee1 JA |
116 | ipo = flist_entry(td->io_log_list.next, struct io_piece, list); |
117 | flist_del(&ipo->list); | |
a61eddec | 118 | |
f718273e JA |
119 | ret = ipo_special(td, ipo); |
120 | if (ret < 0) { | |
121 | free(ipo); | |
122 | break; | |
123 | } else if (ret > 0) { | |
124 | free(ipo); | |
125 | continue; | |
f29b25a3 JA |
126 | } |
127 | ||
429f6675 | 128 | io_u->ddir = ipo->ddir; |
457bf399 GO |
129 | if (ipo->ddir != DDIR_WAIT) { |
130 | io_u->offset = ipo->offset; | |
131 | io_u->buflen = ipo->len; | |
132 | io_u->file = td->files[ipo->fileno]; | |
133 | get_file(io_u->file); | |
134 | ||
135 | dprint(FD_IO, "iolog: get %llu/%lu/%s\n", io_u->offset, | |
136 | io_u->buflen, io_u->file->file_name); | |
137 | if (ipo->delay) iolog_delay(td, ipo->delay); | |
138 | } else { | |
139 | elapsed = mtime_since_genesis(); | |
140 | if (ipo->delay > elapsed) | |
141 | usec_sleep(td, (ipo->delay - elapsed) * 1000); | |
142 | ||
143 | } | |
a61eddec | 144 | |
3c39a379 | 145 | free(ipo); |
457bf399 GO |
146 | |
147 | if (ipo->ddir != DDIR_WAIT) | |
148 | return 0; | |
3c39a379 JA |
149 | } |
150 | ||
20e354ef | 151 | td->done = 1; |
3c39a379 JA |
152 | return 1; |
153 | } | |
154 | ||
155 | void prune_io_piece_log(struct thread_data *td) | |
156 | { | |
157 | struct io_piece *ipo; | |
4b87898e | 158 | struct rb_node *n; |
3c39a379 | 159 | |
4b87898e JA |
160 | while ((n = rb_first(&td->io_hist_tree)) != NULL) { |
161 | ipo = rb_entry(n, struct io_piece, rb_node); | |
162 | rb_erase(n, &td->io_hist_tree); | |
3c39a379 JA |
163 | free(ipo); |
164 | } | |
8ce9cd3d | 165 | |
01743ee1 JA |
166 | while (!flist_empty(&td->io_hist_list)) { |
167 | ipo = flist_entry(td->io_hist_list.next, struct io_piece, list); | |
168 | flist_del(&ipo->list); | |
8ce9cd3d JA |
169 | free(ipo); |
170 | } | |
3c39a379 JA |
171 | } |
172 | ||
173 | /* | |
34403fb1 | 174 | * log a successful write, so we can unwind the log for verify |
3c39a379 JA |
175 | */ |
176 | void log_io_piece(struct thread_data *td, struct io_u *io_u) | |
177 | { | |
8de8f047 | 178 | struct rb_node **p, *parent; |
4b87898e | 179 | struct io_piece *ipo, *__ipo; |
3c39a379 | 180 | |
4b87898e | 181 | ipo = malloc(sizeof(struct io_piece)); |
53cdc686 | 182 | ipo->file = io_u->file; |
3c39a379 JA |
183 | ipo->offset = io_u->offset; |
184 | ipo->len = io_u->buflen; | |
185 | ||
8de8f047 JA |
186 | /* |
187 | * We don't need to sort the entries, if: | |
188 | * | |
189 | * Sequential writes, or | |
190 | * Random writes that lay out the file as it goes along | |
191 | * | |
192 | * For both these cases, just reading back data in the order we | |
193 | * wrote it out is the fastest. | |
8347239a JA |
194 | * |
195 | * One exception is if we don't have a random map AND we are doing | |
196 | * verifies, in that case we need to check for duplicate blocks and | |
197 | * drop the old one, which we rely on the rb insert/lookup for | |
198 | * handling. | |
8de8f047 | 199 | */ |
8347239a JA |
200 | if ((!td_random(td) || !td->o.overwrite) && |
201 | (file_randommap(td, ipo->file) || td->o.verify == VERIFY_NONE)) { | |
01743ee1 JA |
202 | INIT_FLIST_HEAD(&ipo->list); |
203 | flist_add_tail(&ipo->list, &td->io_hist_list); | |
8de8f047 JA |
204 | return; |
205 | } | |
206 | ||
207 | RB_CLEAR_NODE(&ipo->rb_node); | |
8de8f047 | 208 | |
3c39a379 | 209 | /* |
4b87898e | 210 | * Sort the entry into the verification list |
3c39a379 | 211 | */ |
8347239a JA |
212 | restart: |
213 | p = &td->io_hist_tree.rb_node; | |
214 | parent = NULL; | |
4b87898e JA |
215 | while (*p) { |
216 | parent = *p; | |
217 | ||
218 | __ipo = rb_entry(parent, struct io_piece, rb_node); | |
8347239a | 219 | if (ipo->offset < __ipo->offset) |
4b87898e | 220 | p = &(*p)->rb_left; |
8347239a | 221 | else if (ipo->offset > __ipo->offset) |
bb5d7d0b | 222 | p = &(*p)->rb_right; |
8347239a JA |
223 | else { |
224 | assert(ipo->len == __ipo->len); | |
225 | rb_erase(parent, &td->io_hist_tree); | |
226 | goto restart; | |
227 | } | |
3c39a379 JA |
228 | } |
229 | ||
4b87898e JA |
230 | rb_link_node(&ipo->rb_node, parent, p); |
231 | rb_insert_color(&ipo->rb_node, &td->io_hist_tree); | |
3c39a379 JA |
232 | } |
233 | ||
234 | void write_iolog_close(struct thread_data *td) | |
235 | { | |
236 | fflush(td->iolog_f); | |
237 | fclose(td->iolog_f); | |
238 | free(td->iolog_buf); | |
f29b25a3 JA |
239 | td->iolog_f = NULL; |
240 | td->iolog_buf = NULL; | |
3c39a379 JA |
241 | } |
242 | ||
fb71fbd7 | 243 | /* |
f29b25a3 JA |
244 | * Read version 2 iolog data. It is enhanced to include per-file logging, |
245 | * syncs, etc. | |
fb71fbd7 | 246 | */ |
f29b25a3 | 247 | static int read_iolog2(struct thread_data *td, FILE *f) |
3c39a379 JA |
248 | { |
249 | unsigned long long offset; | |
250 | unsigned int bytes; | |
457bf399 | 251 | int reads, writes, waits, fileno = 0, file_action = 0; /* stupid gcc */ |
f29b25a3 | 252 | char *fname, *act; |
3c39a379 | 253 | char *str, *p; |
53fa9b69 | 254 | enum fio_ddir rw; |
3c39a379 | 255 | |
f29b25a3 JA |
256 | free_release_files(td); |
257 | ||
258 | /* | |
259 | * Read in the read iolog and store it, reuse the infrastructure | |
260 | * for doing verifications. | |
261 | */ | |
262 | str = malloc(4096); | |
263 | fname = malloc(256+16); | |
264 | act = malloc(256+16); | |
265 | ||
457bf399 | 266 | reads = writes = waits = 0; |
f29b25a3 JA |
267 | while ((p = fgets(str, 4096, f)) != NULL) { |
268 | struct io_piece *ipo; | |
269 | int r; | |
270 | ||
5ec10eaa JA |
271 | r = sscanf(p, "%256s %256s %llu %u", fname, act, &offset, |
272 | &bytes); | |
f29b25a3 JA |
273 | if (r == 4) { |
274 | /* | |
275 | * Check action first | |
276 | */ | |
457bf399 GO |
277 | if (!strcmp(act, "wait")) |
278 | rw = DDIR_WAIT; | |
279 | else if (!strcmp(act, "read")) | |
f29b25a3 JA |
280 | rw = DDIR_READ; |
281 | else if (!strcmp(act, "write")) | |
282 | rw = DDIR_WRITE; | |
283 | else if (!strcmp(act, "sync")) | |
284 | rw = DDIR_SYNC; | |
5f9099ea JA |
285 | else if (!strcmp(act, "datasync")) |
286 | rw = DDIR_DATASYNC; | |
f29b25a3 | 287 | else { |
5ec10eaa JA |
288 | log_err("fio: bad iolog file action: %s\n", |
289 | act); | |
f29b25a3 JA |
290 | continue; |
291 | } | |
292 | } else if (r == 2) { | |
293 | rw = DDIR_INVAL; | |
294 | if (!strcmp(act, "add")) { | |
295 | td->o.nr_files++; | |
296 | fileno = add_file(td, fname); | |
297 | file_action = FIO_LOG_ADD_FILE; | |
298 | continue; | |
299 | } else if (!strcmp(act, "open")) { | |
300 | fileno = get_fileno(td, fname); | |
301 | file_action = FIO_LOG_OPEN_FILE; | |
302 | } else if (!strcmp(act, "close")) { | |
303 | fileno = get_fileno(td, fname); | |
304 | file_action = FIO_LOG_CLOSE_FILE; | |
305 | } else { | |
5ec10eaa JA |
306 | log_err("fio: bad iolog file action: %s\n", |
307 | act); | |
f29b25a3 JA |
308 | continue; |
309 | } | |
310 | } else { | |
311 | log_err("bad iolog2: %s", p); | |
312 | continue; | |
313 | } | |
5ec10eaa | 314 | |
f29b25a3 JA |
315 | if (rw == DDIR_READ) |
316 | reads++; | |
4241ea8f | 317 | else if (rw == DDIR_WRITE) { |
4241ea8f JA |
318 | /* |
319 | * Don't add a write for ro mode | |
320 | */ | |
321 | if (read_only) | |
322 | continue; | |
ed4aa707 | 323 | writes++; |
457bf399 GO |
324 | } else if (rw == DDIR_WAIT) { |
325 | waits++; | |
326 | } else if (rw == DDIR_INVAL) { | |
5f9099ea | 327 | } else if (!ddir_sync(rw)) { |
f29b25a3 JA |
328 | log_err("bad ddir: %d\n", rw); |
329 | continue; | |
330 | } | |
331 | ||
332 | /* | |
333 | * Make note of file | |
334 | */ | |
335 | ipo = malloc(sizeof(*ipo)); | |
336 | memset(ipo, 0, sizeof(*ipo)); | |
01743ee1 | 337 | INIT_FLIST_HEAD(&ipo->list); |
53fa9b69 | 338 | ipo->ddir = rw; |
457bf399 GO |
339 | if (rw == DDIR_WAIT) { |
340 | ipo->delay = offset; | |
341 | } else { | |
342 | ipo->offset = offset; | |
343 | ipo->len = bytes; | |
344 | if (bytes > td->o.max_bs[rw]) | |
345 | td->o.max_bs[rw] = bytes; | |
f29b25a3 JA |
346 | ipo->fileno = fileno; |
347 | ipo->file_action = file_action; | |
348 | } | |
457bf399 | 349 | |
691c8fb0 | 350 | queue_io_piece(td, ipo); |
3c39a379 JA |
351 | } |
352 | ||
f29b25a3 JA |
353 | free(str); |
354 | free(act); | |
355 | free(fname); | |
356 | ||
4241ea8f | 357 | if (writes && read_only) { |
5ec10eaa JA |
358 | log_err("fio: <%s> skips replay of %d writes due to" |
359 | " read-only\n", td->o.name, writes); | |
4241ea8f JA |
360 | writes = 0; |
361 | } | |
362 | ||
457bf399 | 363 | if (!reads && !writes && !waits) |
f29b25a3 JA |
364 | return 1; |
365 | else if (reads && !writes) | |
366 | td->o.td_ddir = TD_DDIR_READ; | |
367 | else if (!reads && writes) | |
368 | td->o.td_ddir = TD_DDIR_WRITE; | |
369 | else | |
370 | td->o.td_ddir = TD_DDIR_RW; | |
371 | ||
372 | return 0; | |
373 | } | |
374 | ||
fb71fbd7 | 375 | /* |
f29b25a3 | 376 | * open iolog, check version, and call appropriate parser |
fb71fbd7 | 377 | */ |
f29b25a3 | 378 | static int init_iolog_read(struct thread_data *td) |
fb71fbd7 | 379 | { |
f29b25a3 | 380 | char buffer[256], *p; |
076efc7c | 381 | FILE *f; |
f29b25a3 JA |
382 | int ret; |
383 | ||
384 | f = fopen(td->o.read_iolog_file, "r"); | |
385 | if (!f) { | |
386 | perror("fopen read iolog"); | |
387 | return 1; | |
388 | } | |
fb71fbd7 | 389 | |
f29b25a3 JA |
390 | p = fgets(buffer, sizeof(buffer), f); |
391 | if (!p) { | |
392 | td_verror(td, errno, "iolog read"); | |
393 | log_err("fio: unable to read iolog\n"); | |
733ed597 JA |
394 | return 1; |
395 | } | |
396 | ||
f29b25a3 JA |
397 | /* |
398 | * version 2 of the iolog stores a specific string as the | |
399 | * first line, check for that | |
400 | */ | |
401 | if (!strncmp(iolog_ver2, buffer, strlen(iolog_ver2))) | |
402 | ret = read_iolog2(td, f); | |
403 | else { | |
aec2de20 JA |
404 | log_err("fio: iolog version 1 is no longer supported\n"); |
405 | ret = 1; | |
f29b25a3 JA |
406 | } |
407 | ||
408 | fclose(f); | |
409 | return ret; | |
410 | } | |
411 | ||
412 | /* | |
413 | * Setup a log for storing io patterns. | |
414 | */ | |
415 | static int init_iolog_write(struct thread_data *td) | |
416 | { | |
417 | struct fio_file *ff; | |
418 | FILE *f; | |
419 | unsigned int i; | |
420 | ||
c12f6dab | 421 | f = fopen(td->o.write_iolog_file, "a"); |
fb71fbd7 JA |
422 | if (!f) { |
423 | perror("fopen write iolog"); | |
424 | return 1; | |
425 | } | |
426 | ||
427 | /* | |
428 | * That's it for writing, setup a log buffer and we're done. | |
429 | */ | |
430 | td->iolog_f = f; | |
431 | td->iolog_buf = malloc(8192); | |
432 | setvbuf(f, td->iolog_buf, _IOFBF, 8192); | |
f29b25a3 JA |
433 | |
434 | /* | |
435 | * write our version line | |
436 | */ | |
437 | if (fprintf(f, "%s\n", iolog_ver2) < 0) { | |
438 | perror("iolog init\n"); | |
439 | return 1; | |
440 | } | |
441 | ||
442 | /* | |
443 | * add all known files | |
444 | */ | |
445 | for_each_file(td, ff, i) | |
446 | log_file(td, ff, FIO_LOG_ADD_FILE); | |
447 | ||
fb71fbd7 JA |
448 | return 0; |
449 | } | |
450 | ||
451 | int init_iolog(struct thread_data *td) | |
452 | { | |
b4a6a59a JA |
453 | int ret = 0; |
454 | ||
fb7b71a3 JA |
455 | if (td->o.read_iolog_file) { |
456 | /* | |
457 | * Check if it's a blktrace file and load that if possible. | |
458 | * Otherwise assume it's a normal log file and load that. | |
459 | */ | |
460 | if (is_blktrace(td->o.read_iolog_file)) | |
461 | ret = load_blktrace(td, td->o.read_iolog_file); | |
462 | else | |
463 | ret = init_iolog_read(td); | |
464 | } else if (td->o.write_iolog_file) | |
b4a6a59a | 465 | ret = init_iolog_write(td); |
fb71fbd7 | 466 | |
1e97cce9 | 467 | return ret; |
fb71fbd7 JA |
468 | } |
469 | ||
8914a9d8 JA |
470 | void setup_log(struct io_log **log) |
471 | { | |
472 | struct io_log *l = malloc(sizeof(*l)); | |
473 | ||
474 | l->nr_samples = 0; | |
475 | l->max_samples = 1024; | |
476 | l->log = malloc(l->max_samples * sizeof(struct io_sample)); | |
477 | *log = l; | |
478 | } | |
479 | ||
bb3884d8 | 480 | void __finish_log(struct io_log *log, const char *name) |
8914a9d8 | 481 | { |
8914a9d8 | 482 | unsigned int i; |
bb3884d8 | 483 | FILE *f; |
8914a9d8 | 484 | |
c12f6dab | 485 | f = fopen(name, "a"); |
8914a9d8 JA |
486 | if (!f) { |
487 | perror("fopen log"); | |
488 | return; | |
489 | } | |
490 | ||
5ec10eaa | 491 | for (i = 0; i < log->nr_samples; i++) { |
306ddc97 JA |
492 | fprintf(f, "%lu, %lu, %u, %u\n", log->log[i].time, |
493 | log->log[i].val, | |
494 | log->log[i].ddir, | |
495 | log->log[i].bs); | |
5ec10eaa | 496 | } |
8914a9d8 JA |
497 | |
498 | fclose(f); | |
499 | free(log->log); | |
500 | free(log); | |
501 | } | |
bb3884d8 | 502 | |
e3cedca7 JA |
503 | void finish_log_named(struct thread_data *td, struct io_log *log, |
504 | const char *prefix, const char *postfix) | |
bb3884d8 | 505 | { |
748b23a3 | 506 | char file_name[256], *p; |
bb3884d8 | 507 | |
e3cedca7 | 508 | snprintf(file_name, 200, "%s_%s.log", prefix, postfix); |
748b23a3 JA |
509 | p = basename(file_name); |
510 | __finish_log(log, p); | |
bb3884d8 | 511 | } |
e3cedca7 JA |
512 | |
513 | void finish_log(struct thread_data *td, struct io_log *log, const char *name) | |
514 | { | |
515 | finish_log_named(td, log, td->o.name, name); | |
516 | } |