1095 	/* pick up a pointer to the leaves of the dmap tree.  in dbAllocNext()
1124 	 * specified range.  within this pass, the leaves of the dmap  in dbAllocNext()
1127 	 * words, so we may visit only a subset of the actual leaves  in dbAllocNext()
1155 			/* now examine the appropriate leaves to determine  in dbAllocNext()
1193  *		check the next four contiguous leaves for sufficient free
1234 	/* examine the leaves for sufficient free space.  in dbAllocNear()
2126  *		leaves to reflect the bits allocated.  it also causes the
2147 	/* pick up a pointer to the leaves of the dmap tree */  in dbAllocBits()
2167 	 * dmap words will be marked as free in a single shot and the leaves  in dbAllocBits()
2170 	 * leaves corresponding to the dmap words of the block range.  in dbAllocBits()
2191 			 * the binary system of the leaves if need be.  in dbAllocBits()
2210 			/* now update the appropriate leaves to reflect  in dbAllocBits()
2231 				 * system of the leaves to reflect the current  in dbAllocBits()
2273  *		leaves to reflect the bits freed.  it also causes the dmap's
2312 	 * be marked as free in a single shot and the leaves will be updated. a  in dbFreeBits()
2314 	 * so we may update only a subset of the actual leaves corresponding  in dbFreeBits()
2318 	 * buddy system of the leaves if the new leaf values indicate this  in dbFreeBits()
2358 			/* now update the appropriate leaves to reflect  in dbFreeBits()
2443  *		causing a binary buddy system within the leaves to be
2511 	 * the leaves, if required, and bubble new values within the  in dbAdjCtl()
2513 	 * the binary buddy system of leaves and bubble new values up  in dbAdjCtl()
2613  *		leaves, as required.
2667  * FUNCTION:	back split the binary buddy system of dmtree leaves
2713 	/* determine the number of leaves covered by this size.  this  in dbBackSplit()
2760  *		the leaf with other leaves of the dmtree into a multi-leaf
2775 	/* can the new leaf value require a join with other leaves ?  in dbJoin()
2778 		/* pickup a pointer to the leaves of the tree.  in dbJoin()
2789 		 * last join) or until all leaves have been joined into a  in dbJoin()
2900 		/* determine the maximum of the 4 leaves.  in dbAdjTree()
3273 	 * dmap words will be marked as free in a single shot and the leaves  in dbAllocDmapBU()
3276 	 * leaves corresponding to the dmap words of the block range.  in dbAllocDmapBU()
3569 			 * build current L0 page from its leaves, and  in dbExtendFS()
3593 		 * build current L1 page from its leaves, and  in dbExtendFS()
3861  *		at entry, the leaves of the tree has been initialized
3883 	/* Determine the maximum free string possible for the leaves */  in dbInitTree()
3890 	 * (i.e. two leaves). At a buddy size of 1 two buddy leaves  in dbInitTree()
3918 	 * bubble summary information of leaves up the tree.  in dbInitTree()
3961 	 * initialize the leaves of current level that were not covered  in dbInitDmapCtl()
3962 	 * by the specified input block range (i.e. the leaves have no  in dbInitDmapCtl()