Avoid using the rbtree if we don't have to
Basically reinstate the old logic of not sorting when it's
not a win for reading the data back.
Signed-off-by: Jens Axboe <jens.axboe@oracle.com>
diff --git a/fio.h b/fio.h
index 4d7e6ea..ec08e42 100644
--- a/fio.h
+++ b/fio.h
@@ -515,9 +515,15 @@
unsigned int ddir_nr;
/*
- * IO historic logs
+ * IO history logs for verification. We use a tree for sorting,
+ * if we are overwriting. Otherwise just use a fifo.
*/
struct rb_root io_hist_tree;
+ struct list_head io_hist_list;
+
+ /*
+ * For IO replaying
+ */
struct list_head io_log_list;
/*