X-Git-Url: https://git.kernel.dk/?a=blobdiff_plain;f=lib%2Fprio_tree.c;h=d8e1b89a94038c2df63e2a0f7435f8184ecd2ba0;hb=6463db6c1d3a2a961008e87a86d464b596886f1a;hp=e18ae324bac4200ee85b5ddda738f6fca006938a;hpb=c0c4b1d42e39c2ea4cb2d58e5a17aec4b00263d9;p=fio.git

diff --git a/lib/prio_tree.c b/lib/prio_tree.c
index e18ae324..d8e1b89a 100644
--- a/lib/prio_tree.c
+++ b/lib/prio_tree.c
@@ -11,11 +11,15 @@
  * 02Feb2004	Initial version
  */
 
+#include <assert.h>
 #include <stdlib.h>
 #include <limits.h>
-#include "../fio.h"
+
+#include "../compiler/compiler.h"
 #include "prio_tree.h"
 
+#define ARRAY_SIZE(x)    (sizeof((x)) / (sizeof((x)[0])))
+
 /*
  * A clever mix of heap and radix trees forms a radix priority search tree (PST)
  * which is useful for storing intervals, e.g, we can consider a vma as a closed