X-Git-Url: https://git.kernel.dk/?a=blobdiff_plain;f=lib%2Fprio_tree.c;h=de3fe1c025276bea0f34a5ee10ce8896ec662507;hb=29eb371b1d2b436e252c6e3e20981d88f7b1cd3f;hp=b0e935cdace5f051af293dd2ea9a2aef8997794e;hpb=95820b6e6c92025df8d89c0bf39b174e53137c41;p=fio.git

diff --git a/lib/prio_tree.c b/lib/prio_tree.c
index b0e935cd..de3fe1c0 100644
--- a/lib/prio_tree.c
+++ b/lib/prio_tree.c
@@ -13,9 +13,12 @@
 
 #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
@@ -49,7 +52,7 @@ static void get_index(const struct prio_tree_node *node,
 
 static unsigned long index_bits_to_maxindex[BITS_PER_LONG];
 
-void fio_init prio_tree_init(void)
+static void fio_init prio_tree_init(void)
 {
 	unsigned int i;