Index: sys/vm/vm_radix.c
===================================================================
--- sys/vm/vm_radix.c	(revision 227767)
+++ sys/vm/vm_radix.c	(working copy)
@@ -269,6 +269,8 @@
 
 	CTR3(KTR_VM,
 	    "insert: tree %p, index %p, val %p", rtree, (void *)index, val);
+	printf("insert: tree %p, index %p, val %p\n", rtree, (void *)index,
+	    val);
 	if (index == -1)
 		panic("vm_radix_insert: -1 is not a valid index.\n");
 	level = vm_radix_height(rtree, &root);
@@ -279,6 +281,8 @@
 	while (level == 0 || index > VM_RADIX_MAX(level)) {
 		CTR3(KTR_VM, "insert: expanding %jd > %jd height %d",
 		    index, VM_RADIX_MAX(level), level);
+		printf("insert: expanding %jd > %jd height %d\n", index,
+		    VM_RADIX_MAX(level), level);
 		level++;
 		KASSERT(level <= VM_RADIX_LIMIT,
 		    ("vm_radix_insert: Tree %p height %d too tall",
@@ -292,6 +296,8 @@
 				CTR4(KTR_VM,
 "insert: tree %p, root %p, index: %d, level: %d failed to allocate a new node",
 				    rtree, root, index, level);
+				printf("insert: tree %p, root %p, index: %jd, level: %d failed to allocate a new node\n",
+				    rtree, root, index, level);
 				return (ENOMEM);
 			}
 			/*
@@ -320,6 +326,10 @@
 "insert: tree %p, index %jd, level %d, slot %d, child %p failed to populate",
 		    		    rtree, index, level, slot,
 				    rnode->rn_child[slot]);
+				printf("insert: tree %p, index %jd, level %d, slot %d, rnode %p, child %p failed to populate\n",
+		    		    rtree, index, level, slot, rnode,
+				    (rnode != NULL) ? rnode->rn_child[slot] :
+				    NULL);
 		    		return (ENOMEM);
 			}
 			rnode->rn_count++;
@@ -327,12 +337,18 @@
 		CTR5(KTR_VM,
 		    "insert: tree %p, index %p, level %d, slot %d, child %p",
 		    rtree, (void *)index, level, slot, rnode->rn_child[slot]);
+		printf("insert: tree %p, index %p, level %d, slot %d, rnode %p, child %p\n",
+		    rtree, (void *)index, level, slot, rnode, (rnode != NULL) ?
+		    rnode->rn_child[slot] : NULL);
 		rnode = rnode->rn_child[slot];
 	}
 
 	slot = vm_radix_slot(index, 0);
 	CTR5(KTR_VM, "insert: tree %p, index %p, level %d, slot %d, child %p",
 	    rtree, (void *)index, level, slot, rnode->rn_child[slot]);
+	printf("insert: tree %p, index %p, level %d, slot %d, rnode %p, child %p\n",
+	    rtree, (void *)index, level, slot, rnode, (rnode != NULL) ?
+	    rnode->rn_child[slot] : NULL);
 	KASSERT(rnode->rn_child[slot] == NULL,
 	    ("vm_radix_insert: Duplicate value %p at index: %lu\n", 
 	    rnode->rn_child[slot], (u_long)index));
@@ -644,6 +660,9 @@
 		CTR5(KTR_VM,
 		    "remove: tree %p, index %p, level %d, slot %d, child %p",
 		    rtree, (void *)index, level, slot, rnode->rn_child[slot]);
+		printf("remove: tree %p, index %p, level %d, slot %d, rnode: %p, child %p\n",
+		    rtree, (void *)index, level, slot, rnode,
+		    (rnode != NULL) ? rnode->rn_child[slot] : NULL);
 		level--;
 	}
 	KASSERT(rnode != NULL,