X-Git-Url: https://git.kernel.dk/?a=blobdiff_plain;f=log.c;h=5014b484e252c6d7f1055f3a7cad462db735c9c4;hb=890abcad90e450484f89733d1bc1ad8a30016311;hp=01e4ad0b37c8fd5e954106bb86079856345ce579;hpb=c12f6dabdb82e63e1020f1e61c366ca552cc9ac8;p=fio.git diff --git a/log.c b/log.c index 01e4ad0b..5014b484 100644 --- a/log.c +++ b/log.c @@ -8,6 +8,7 @@ #include #include "flist.h" #include "fio.h" +#include "verify.h" static const char iolog_ver2[] = "fio version 2 iolog"; @@ -183,28 +184,40 @@ void log_io_piece(struct thread_data *td, struct io_u *io_u) * * For both these cases, just reading back data in the order we * wrote it out is the fastest. + * + * One exception is if we don't have a random map AND we are doing + * verifies, in that case we need to check for duplicate blocks and + * drop the old one, which we rely on the rb insert/lookup for + * handling. */ - if (!td_random(td) || !td->o.overwrite) { + if ((!td_random(td) || !td->o.overwrite) && + (file_randommap(td, ipo->file) || td->o.verify == VERIFY_NONE)) { INIT_FLIST_HEAD(&ipo->list); flist_add_tail(&ipo->list, &td->io_hist_list); return; } RB_CLEAR_NODE(&ipo->rb_node); - p = &td->io_hist_tree.rb_node; - parent = NULL; /* * Sort the entry into the verification list */ +restart: + p = &td->io_hist_tree.rb_node; + parent = NULL; while (*p) { parent = *p; __ipo = rb_entry(parent, struct io_piece, rb_node); - if (ipo->offset <= __ipo->offset) + if (ipo->offset < __ipo->offset) p = &(*p)->rb_left; - else + else if (ipo->offset > __ipo->offset) p = &(*p)->rb_right; + else { + assert(ipo->len == __ipo->len); + rb_erase(parent, &td->io_hist_tree); + goto restart; + } } rb_link_node(&ipo->rb_node, parent, p); @@ -422,9 +435,6 @@ int init_iolog(struct thread_data *td) { int ret = 0; - if (td->io_ops->flags & FIO_DISKLESSIO) - return 0; - if (td->o.read_iolog_file) { /* * Check if it's a blktrace file and load that if possible. @@ -462,8 +472,10 @@ void __finish_log(struct io_log *log, const char *name) } for (i = 0; i < log->nr_samples; i++) { - fprintf(f, "%lu, %lu, %u\n", log->log[i].time, log->log[i].val, - log->log[i].ddir); + fprintf(f, "%lu, %lu, %u, %u\n", log->log[i].time, + log->log[i].val, + log->log[i].ddir, + log->log[i].bs); } fclose(f);