#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
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;