Replace list based free/busy/requeue list with FIFO + ring

[fio.git] / verify.c

diff --git a/verify.c b/verify.c
index fa24702b49dfd3ef2379683022b9b9cd64e332b0..b3cd402de9a861799e57b65d03ed5ff1e333b140 100644 (file)
--- a/verify.c
+++ b/verify.c
@@ -10,7 +10,6 @@
 
 #include "fio.h"
 #include "verify.h"
-#include "smalloc.h"
 #include "trim.h"
 #include "lib/rand.h"
 #include "lib/hweight.h"
@@ -596,8 +595,7 @@ int verify_io_u_async(struct thread_data *td, struct io_u *io_u)
                td->cur_depth--;
                io_u->flags &= ~IO_U_F_IN_CUR_DEPTH;
        }
-       flist_del(&io_u->list);
-       flist_add_tail(&io_u->list, &td->verify_list);
+       flist_add_tail(&io_u->verify_list, &td->verify_list);
        io_u->flags |= IO_U_F_FREE_DEF;
        pthread_mutex_unlock(&td->io_u_lock);
 
@@ -1053,8 +1051,8 @@ static void *verify_async_thread(void *data)
                        continue;
 
                while (!flist_empty(&list)) {
-                       io_u = flist_entry(list.next, struct io_u, list);
-                       flist_del_init(&io_u->list);
+                       io_u = flist_entry(list.next, struct io_u, verify_list);
+                       flist_del(&io_u->verify_list);
 
                        ret = verify_io_u(td, io_u);
                        put_io_u(td, io_u);