+ /*
+ * 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.
+ */
+ if (!td_random(td) || !td->o.overwrite) {
+ INIT_LIST_HEAD(&ipo->list);
+ list_add_tail(&ipo->list, &td->io_hist_list);
+ return;
+ }
+
+ RB_CLEAR_NODE(&ipo->rb_node);
+ p = &td->io_hist_tree.rb_node;
+ parent = NULL;
+