Index: sys/vm/vm_radix.c
===================================================================
--- sys/vm/vm_radix.c	(revision 228248)
+++ sys/vm/vm_radix.c	(working copy)
@@ -268,7 +268,7 @@ vm_radix_insert(struct vm_radix *rtree, vm_pindex_
 	int slot;
 
 	CTR3(KTR_VM,
-	    "insert: tree %p, index %p, val %p", rtree, (void *)index, val);
+	    "insert: tree %p, index %ju, val %p", rtree, (uintmax_t)index, val);
 	if (index == -1)
 		panic("vm_radix_insert: -1 is not a valid index.\n");
 	level = vm_radix_height(rtree, &root);
@@ -290,8 +290,8 @@ vm_radix_insert(struct vm_radix *rtree, vm_pindex_
 			rnode = vm_radix_node_get();
 			if (rnode == NULL) {
 				CTR4(KTR_VM,
-			"insert: tree %p, root %p, index: %d, level: %d ENOMEM",
-				    rtree, root, index, level);
+		"insert: tree %p, root %p, index: %ju, level: %d ENOMEM",
+				    rtree, root, (uintmax_t)index, level);
 				return (ENOMEM);
 			}
 			/*
@@ -317,8 +317,9 @@ vm_radix_insert(struct vm_radix *rtree, vm_pindex_
 			rnode->rn_child[slot] = vm_radix_node_get();
     			if (rnode->rn_child[slot] == NULL) {
 				CTR5(KTR_VM,
-	"insert: tree %p, index %jd, level %d, slot %d, rnode %p ENOMEM",
-		    		    rtree, index, level, slot, rnode);
+	"insert: tree %p, index %ju, level %d, slot %d, rnode %p ENOMEM",
+		    		    rtree, index, (uintmax_t)level, slot,
+				    rnode);
 				CTR4(KTR_VM,
 			"insert: tree %p, rnode %p, child %p, count %u ENOMEM",
 		    		    rtree, rnode, rnode->rn_child[slot],
@@ -328,8 +329,8 @@ vm_radix_insert(struct vm_radix *rtree, vm_pindex_
 			rnode->rn_count++;
 	    	}
 		CTR5(KTR_VM,
-		    "insert: tree %p, index %p, level %d, slot %d, rnode %p",
-		    rtree, (void *)index, level, slot, rnode);
+		    "insert: tree %p, index %ju, level %d, slot %d, rnode %p",
+		    rtree, (uintmax_t)index, level, slot, rnode);
 		CTR4(KTR_VM,
 		    "insert: tree %p, rnode %p, child %p, count %u",
 		    rtree, rnode, rnode->rn_child[slot], rnode->rn_count);
@@ -345,8 +346,8 @@ vm_radix_insert(struct vm_radix *rtree, vm_pindex_
 	rnode->rn_child[slot] = val;
 	atomic_add_int((volatile int *)&rnode->rn_count, 1);
 	CTR6(KTR_VM,
-	    "insert: tree %p, index %p, level %d, slot %d, rnode %p, count %u",
-	    rtree, (void *)index, level, slot, rnode, rnode->rn_count);
+	    "insert: tree %p, index %ju, level %d, slot %d, rnode %p, count %u",
+	    rtree, (uintmax_t)index, level, slot, rnode, rnode->rn_count);
 
 	return 0;
 }
@@ -369,15 +370,16 @@ vm_radix_lookup(struct vm_radix *rtree, vm_pindex_
 	while (rnode) {
 		slot = vm_radix_slot(index, level);
 		CTR6(KTR_VM,
-	"lookup: tree %p, index %p, level %d, slot %d, rnode %p, child %p",
-		    rtree, (void *)index, level, slot, rnode,
+	"lookup: tree %p, index %ju, level %d, slot %d, rnode %p, child %p",
+		    rtree, (uintmax_t)index, level, slot, rnode,
 		    rnode->rn_child[slot]);
 		if (level == 0)
 			return vm_radix_match(rnode->rn_child[slot], color);
 		rnode = rnode->rn_child[slot];
 		level--;
 	}
-	CTR2(KTR_VM, "lookup: tree %p, index %p failed", rtree, (void *)index);
+	CTR2(KTR_VM, "lookup: tree %p, index %ju failed", rtree,
+	    (uintmax_t)index);
 
 	return NULL;
 }
@@ -397,8 +399,8 @@ vm_radix_color(struct vm_radix *rtree, vm_pindex_t
 	while (rnode) {
 		slot = vm_radix_slot(index, level);
 		CTR6(KTR_VM,
-	"color: tree %p, index %p, level %d, slot %d, rnode %p, child %p",
-		    rtree, (void *)index, level, slot, rnode,
+	"color: tree %p, index %ju, level %d, slot %d, rnode %p, child %p",
+		    rtree, (uintmax_t)index, level, slot, rnode,
 		    rnode->rn_child[slot]);
 		if (level == 0)
 			break;
@@ -441,8 +443,8 @@ restart:
 	for (level--; level; level--) {
 		slot = vm_radix_slot(start, level);
 		CTR6(KTR_VM,
-	"leaf: tree %p, index %p, level %d, slot %d, rnode %p, child %p",
-		    rtree, (void *)start, level, slot, rnode,
+	"leaf: tree %p, index %ju, level %d, slot %d, rnode %p, child %p",
+		    rtree, (uintmax_t)start, level, slot, rnode,
 		    (rnode != NULL) ? rnode->rn_child[slot] : NULL);
 		if (rnode->rn_child[slot] != NULL) {
 			rnode = rnode->rn_child[slot];
@@ -511,8 +513,8 @@ vm_radix_lookupn(struct vm_radix *rtree, vm_pindex
 			if (val == NULL)
 				continue;
 			CTR4(KTR_VM,
-			    "lookupn: tree %p index %p slot %d found child %p",
-			    rtree, (void *)start, slot, val);
+			    "lookupn: tree %p index %ju slot %d found child %p",
+			    rtree, (uintmax_t)start, slot, val);
 			out[outidx] = val;
 			if (++outidx == cnt)
 				goto out;
@@ -565,7 +567,7 @@ vm_radix_lookup_le(struct vm_radix *rtree, vm_pind
 	int level;
 
 	CTR2(KTR_VM,
-	    "lookup_le: tree %p, index %p", rtree, (void *)index);
+	    "lookup_le: tree %p, index %ju", rtree, (uintmax_t)index);
 restart:
 	level = vm_radix_height(rtree, &rnode);
 	if (rnode == NULL)
@@ -581,8 +583,8 @@ restart:
 	while (rnode) {
 		slot = vm_radix_slot(index, level);
 		CTR6(KTR_VM,
-	"lookup_le: tree %p, index %p, level %d, slot %d, rnode %p, child %p",
-		    rtree, (void *)index, level, slot, rnode,
+	"lookup_le: tree %p, index %ju, level %d, slot %d, rnode %p, child %p",
+		    rtree, (uintmax_t)index, level, slot, rnode,
 		    rnode->rn_child[slot]);
 		if (level == 0)
 			break;
@@ -653,8 +655,8 @@ vm_radix_remove(struct vm_radix *rtree, vm_pindex_
 		stack[level] = rnode;
 		slot = vm_radix_slot(index, level);
 		CTR5(KTR_VM,
-		    "remove: tree %p, index %p, level %d, slot %d, rnode %p",
-		    rtree, (void *)index, level, slot, rnode);
+		    "remove: tree %p, index %ju, level %d, slot %d, rnode %p",
+		    rtree, (uintmax_t)index, level, slot, rnode);
 		CTR4(KTR_VM, "remove: tree %p, rnode %p, child %p, count %u",
 		    rtree, rnode, rnode->rn_child[slot], rnode->rn_count);
 		rnode = rnode->rn_child[slot];
@@ -669,8 +671,8 @@ vm_radix_remove(struct vm_radix *rtree, vm_pindex_
 
 	for (;;) {
 		CTR5(KTR_VM,
-	"remove: resetting tree %p, index %p, level %d, slot %d, rnode %p",
-		    rtree, (void *)index, level, slot, rnode);
+	"remove: resetting tree %p, index %ju, level %d, slot %d, rnode %p",
+		    rtree, (uintmax_t)index, level, slot, rnode);
 		CTR4(KTR_VM,
 		    "remove: resetting tree %p, rnode %p, child %p, count %u",
 		    rtree, rnode,