1 files changed, 10 insertions, 10 deletions

diff --git a/src/tbf.c b/src/tbf.c
index a1b6f9f..1695960 100644
--- a/src/tbf.c
+++ b/src/tbf.c
@@ -497,6 +497,7 @@ key_to_str(uint8_t key[], char *buf)
         *buf = 0;
 }
 
+#if 0
 static void
 node_to_keystr(struct node *node, char *buf)
 {
@@ -505,6 +506,7 @@ node_to_keystr(struct node *node, char *buf)
         else
                 *buf = 0;
 }
+#endif
 
 static void
 node_dump_ord(struct node *node, FILE *fp)
@@ -559,7 +561,6 @@ static void
 tree_dump_unlocked(struct tree *tree, char const *file)
 {
         struct node *node;
-        char keybuf[3][2*SHA256_LEN+1];
         FILE *fp;
         int err = 0;
         struct dump_header header;
@@ -656,7 +657,6 @@ tree_load_nodes(struct tree *tree, struct dump_header *hdr,
                 struct node **nodes, FILE *fp)
 {
         size_t i;
-        uint32_t root_idx;
         uint32_t ord[2];
         size_t incomplete = 0;
         
@@ -763,7 +763,7 @@ tree_load_nodes(struct tree *tree, struct dump_header *hdr,
         }
         
         if (incomplete) {
-                syslog(LOG_DAEMON|LOG_ERR, "tbf.%s: %lu incomplete nodes left",
+                syslog(LOG_DAEMON|LOG_ERR, "tbf.%s: %zu incomplete nodes left",
                        __FUNCTION__, incomplete);
                 return 1;
         }
@@ -775,7 +775,7 @@ struct tree *
 tree_load(char const *filename)
 {
         FILE *fp;
-        struct tree *tree;
+        struct tree *tree = NULL;
         int rc;
         struct dump_header header;
         
@@ -1019,12 +1019,12 @@ log_node(struct node *node, void *data)
         char kbuf[2*SHA256_LEN+1];
         key_to_str(node->key, kbuf);
 #ifdef DEBUG
-        syslog(tc->prio, "%d: %p(%p,%p): %lu %s: %s", tc->num, node,
+        syslog(tc->prio, "%d: %p(%p,%p): %zu %s: %s", tc->num, node,
                node->child[CHILD_LEFT], node->child[CHILD_RIGHT], node->ord,
                kbuf,
                node->keystr);
 #else
-        syslog(tc->prio, "%d: %p(%p,%p): %lu %s", tc->num, node,
+        syslog(tc->prio, "%d: %p(%p,%p): %zu %s", tc->num, node,
                node->child[CHILD_LEFT], node->child[CHILD_RIGHT], node->ord,
                kbuf);
 #endif
@@ -1051,9 +1051,9 @@ vmod_log_stats(VRT_CTX, VCL_INT prio)
         struct tree *tree = tbf_get_tree();
         tree_compute_stats(tree, &st);
         tbf_release_tree(&tree);
-        syslog(prio, "Number of nodes: %lu", st.num_nodes);
-        syslog(prio, "Number of leaves: %lu", st.num_leaves);
-        syslog(prio, "Shortest path: %lu", st.shortest_path);
-        syslog(prio, "Longest path: %lu", st.longest_path);     
+        syslog(prio, "Number of nodes: %zu", st.num_nodes);
+        syslog(prio, "Number of leaves: %zu", st.num_leaves);
+        syslog(prio, "Shortest path: %zu", st.shortest_path);
+        syslog(prio, "Longest path: %zu", st.longest_path);     
         syslog(prio, "Avg path: %f", st.avg_path);
 }