761 		 * AG with sufficient free space.  in dbAlloc()
1231  *		check the next four contiguous leaves for sufficient free
1232  *		space.  if sufficient free space is found, we'll allocate
1272 	/* examine the leaves for sufficient free space.  in dbAllocNear()
1275 		/* does the leaf describe sufficient free space ?  in dbAllocNear()
1325  *		sufficient free space.  if sufficient free space is found,
1331  *		sufficient free space and we allocate at this dmap.
1431 	 * the allocation group, looking for sufficient free space.  to begin,  in dbAllocAG()
1444 	 * subtrees for sufficient free space, starting with the leftmost  in dbAllocAG()
1448 		/* is there sufficient free space ?  in dbAllocAG()
1453 		/* sufficient free space found in a subtree. now search down  in dbAllocAG()
1539  *		dbAllocAny() attempts to find the sufficient free space by
1565 	 * down the dmap control levels for sufficient free space.  in dbAllocAny()
1702  *		if sufficient contiguous free blocks are found, this routine
1705  *		is sufficient in size.
1733 	 * sufficient free blocks.  in dbFindCtl()
1754 		 * sufficient free space.  if sufficient free space is found,  in dbFindCtl()
2001 	/* search the tree within the dmap page for sufficient  in dbAllocDmapLev()
2002 	 * free space.  if sufficient free space is found, dbFindLeaf()  in dbAllocDmapLev()
2948  * FUNCTION:	search a dmtree_t for sufficient free blocks, returning
2950  *		sufficient free blocks are found.
2953  *		proceeds down the tree to the leftmost leaf with sufficient
2960  *		  describing at least l2nb free blocks if sufficient
2972 	 * sufficient free space.  in dbFindLeaf()
2977 	/* sufficient free space available. now search down the tree  in dbFindLeaf()
2979 	 * describes sufficient free space.  in dbFindLeaf()
2987 			/* sufficient free space found.  move to the next  in dbFindLeaf()
3000 	/* set the return to the leftmost leaf describing sufficient  in dbFindLeaf()