Index: sys/vm/vm_radix.h
===================================================================
--- sys/vm/vm_radix.h
+++ sys/vm/vm_radix.h
@@ -39,7 +39,6 @@
 
 int		vm_radix_insert(struct vm_radix *rtree, vm_page_t page);
 void		vm_radix_wait(void);
-boolean_t	vm_radix_is_singleton(struct vm_radix *rtree);
 vm_page_t	vm_radix_lookup(struct vm_radix *rtree, vm_pindex_t index);
 vm_page_t	vm_radix_lookup_ge(struct vm_radix *rtree, vm_pindex_t index);
 vm_page_t	vm_radix_lookup_le(struct vm_radix *rtree, vm_pindex_t index);
@@ -56,7 +55,7 @@
 	rtree->rt_root = 0;
 }
 
-static __inline boolean_t
+static __inline bool
 vm_radix_is_empty(struct vm_radix *rtree)
 {
 
Index: sys/vm/vm_radix.c
===================================================================
--- sys/vm/vm_radix.c
+++ sys/vm/vm_radix.c
@@ -254,7 +254,7 @@
 /*
  * Returns TRUE if the specified radix node is a leaf and FALSE otherwise.
  */
-static __inline boolean_t
+static __inline bool
 vm_radix_isleaf(struct vm_radix_node *rnode)
 {
 
@@ -308,7 +308,7 @@
  * Returns TRUE if it can be determined that key does not belong to the
  * specified rnode.  Otherwise, returns FALSE.
  */
-static __inline boolean_t
+static __inline bool
 vm_radix_keybarr(struct vm_radix_node *rnode, vm_pindex_t idx)
 {
 
@@ -316,7 +316,7 @@
 		idx = vm_radix_trimkey(idx, rnode->rn_clev + 1);
 		return (idx != rnode->rn_owner);
 	}
-	return (FALSE);
+	return (false);
 }
 
 /*
@@ -457,21 +457,6 @@
 	return (0);
 }
 
-/*
- * Returns TRUE if the specified radix tree contains a single leaf and FALSE
- * otherwise.
- */
-boolean_t
-vm_radix_is_singleton(struct vm_radix *rtree)
-{
-	struct vm_radix_node *rnode;
-
-	rnode = vm_radix_root_load(rtree, LOCKED);
-	if (rnode == NULL)
-		return (FALSE);
-	return (vm_radix_isleaf(rnode));
-}
-
 /*
  * Returns the value stored at the index.  If the index is not present,
  * NULL is returned.