766 		 * AG with sufficient free space.  in dbAlloc()
1236  *		check the next four contiguous leaves for sufficient free
1237  *		space.  if sufficient free space is found, we'll allocate
1277 	/* examine the leaves for sufficient free space.  in dbAllocNear()
1280 		/* does the leaf describe sufficient free space ?  in dbAllocNear()
1330  *		sufficient free space.  if sufficient free space is found,
1336  *		sufficient free space and we allocate at this dmap.
1436 	 * the allocation group, looking for sufficient free space.  to begin,  in dbAllocAG()
1449 	 * subtrees for sufficient free space, starting with the leftmost  in dbAllocAG()
1453 		/* is there sufficient free space ?  in dbAllocAG()
1458 		/* sufficient free space found in a subtree. now search down  in dbAllocAG()
1544  *		dbAllocAny() attempts to find the sufficient free space by
1570 	 * down the dmap control levels for sufficient free space.  in dbAllocAny()
1707  *		if sufficient contiguous free blocks are found, this routine
1710  *		is sufficient in size.
1738 	 * sufficient free blocks.  in dbFindCtl()
1759 		 * sufficient free space.  if sufficient free space is found,  in dbFindCtl()
2006 	/* search the tree within the dmap page for sufficient  in dbAllocDmapLev()
2007 	 * free space.  if sufficient free space is found, dbFindLeaf()  in dbAllocDmapLev()
2953  * FUNCTION:	search a dmtree_t for sufficient free blocks, returning
2955  *		sufficient free blocks are found.
2958  *		proceeds down the tree to the leftmost leaf with sufficient
2965  *		  describing at least l2nb free blocks if sufficient
2977 	 * sufficient free space.  in dbFindLeaf()
2982 	/* sufficient free space available. now search down the tree  in dbFindLeaf()
2984 	 * describes sufficient free space.  in dbFindLeaf()
2992 			/* sufficient free space found.  move to the next  in dbFindLeaf()
3005 	/* set the return to the leftmost leaf describing sufficient  in dbFindLeaf()