iolog: remove random layout verification optimisation

[fio.git] / iolog.c

diff --git a/iolog.c b/iolog.c
index 18ae4369dcad96190bac5e3974366f6be41d413d..b041eff43784e3963a074295fa22b2bb5b4e0734 100644 (file)
--- a/iolog.c
+++ b/iolog.c
@@ -227,20 +227,16 @@ void log_io_piece(struct thread_data *td, struct io_u *io_u)
        }
 
        /*
-        * We don't need to sort the entries, if:
-        *
-        *      Sequential writes, or
-        *      Random writes that lay out the file as it goes along
-        *
-        * For both these cases, just reading back data in the order we
-        * wrote it out is the fastest.
+        * We don't need to sort the entries if we only performed sequential
+        * writes. In this case, just reading back data in the order we wrote
+        * it out is the faster but still safe.
         *
         * 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->o.verifysort) || !td_random(td) || !td->o.overwrite) &&
+       if (((!td->o.verifysort) || !td_random(td)) &&
              (file_randommap(td, ipo->file) || td->o.verify == VERIFY_NONE)) {
                INIT_FLIST_HEAD(&ipo->list);
                flist_add_tail(&ipo->list, &td->io_hist_list);