Index: kernel/generic/src/adt/btree.c
===================================================================
--- kernel/generic/src/adt/btree.c	(revision b76a22177c4c3a1dbff86603b43c86fa730488e2)
+++ kernel/generic/src/adt/btree.c	(revision c859753998fa1c181ddd7bcbfdeaa866bb940c41)
@@ -125,5 +125,5 @@
 	if (!lnode) {
 		if (btree_search(t, key, &lnode)) {
-			panic("B-tree %p already contains key %d\n", t, key);
+			panic("B-tree %p already contains key %" PRIu64 "\n", t, key);
 		}
 	}
@@ -225,5 +225,5 @@
 	if (!lnode) {
 		if (!btree_search(t, key, &lnode)) {
-			panic("B-tree %p does not contain key %d\n", t, key);
+			panic("B-tree %p does not contain key %" PRIu64 "\n", t, key);
 		}
 	}
@@ -525,5 +525,5 @@
 		}
 	}
-	panic("node %p does not contain key %d\n", node, key);
+	panic("node %p does not contain key %" PRIu64 "\n", node, key);
 }
 
@@ -552,5 +552,5 @@
 		}
 	}
-	panic("node %p does not contain key %d\n", node, key);
+	panic("node %p does not contain key %" PRIu64 "\n", node, key);
 }
 
@@ -971,5 +971,5 @@
 		printf("(");
 		for (i = 0; i < node->keys; i++) {
-			printf("%llu%s", node->key[i], i < node->keys - 1 ? "," : "");
+			printf("%" PRIu64 "%s", node->key[i], i < node->keys - 1 ? "," : "");
 			if (node->depth && node->subtree[i]) {
 				list_append(&node->subtree[i]->bfs_link, &head);
@@ -993,5 +993,5 @@
 		printf("(");
 		for (i = 0; i < node->keys; i++)
-			printf("%llu%s", node->key[i], i < node->keys - 1 ? "," : "");
+			printf("%" PRIu64 "%s", node->key[i], i < node->keys - 1 ? "," : "");
 		printf(")");
 	}