log: remember to free output buffer when done

[fio.git] / lib / prio_tree.c

diff --git a/lib/prio_tree.c b/lib/prio_tree.c
index b0e935cdace5f051af293dd2ea9a2aef8997794e..d8e1b89a94038c2df63e2a0f7435f8184ecd2ba0 100644 (file)
--- 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
@@ -49,7 +53,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;