791 		 * AG with sufficient free space.  in dbAlloc()
1261  *		check the next four contiguous leaves for sufficient free
1262  *		space.  if sufficient free space is found, we'll allocate
1302 	/* examine the leaves for sufficient free space.  in dbAllocNear()
1305 		/* does the leaf describe sufficient free space ?  in dbAllocNear()
1355  *		sufficient free space.  if sufficient free space is found,
1361  *		sufficient free space and we allocate at this dmap.
1461 	 * the allocation group, looking for sufficient free space.  to begin,  in dbAllocAG()
1474 	 * subtrees for sufficient free space, starting with the leftmost  in dbAllocAG()
1478 		/* is there sufficient free space ?  in dbAllocAG()
1483 		/* sufficient free space found in a subtree. now search down  in dbAllocAG()
1569  *		dbAllocAny() attempts to find the sufficient free space by
1595 	 * down the dmap control levels for sufficient free space.  in dbAllocAny()
1732  *		if sufficient contiguous free blocks are found, this routine
1735  *		is sufficient in size.
1763 	 * sufficient free blocks.  in dbFindCtl()
1784 		 * sufficient free space.  if sufficient free space is found,  in dbFindCtl()
2031 	/* search the tree within the dmap page for sufficient  in dbAllocDmapLev()
2032 	 * free space.  if sufficient free space is found, dbFindLeaf()  in dbAllocDmapLev()
2986  * FUNCTION:	search a dmtree_t for sufficient free blocks, returning
2988  *		sufficient free blocks are found.
2991  *		proceeds down the tree to the leftmost leaf with sufficient
2998  *		  describing at least l2nb free blocks if sufficient
3014 	 * sufficient free space.  in dbFindLeaf()
3019 	/* sufficient free space available. now search down the tree  in dbFindLeaf()
3021 	 * describes sufficient free space.  in dbFindLeaf()
3029 			/* sufficient free space found.  move to the next  in dbFindLeaf()
3044 	/* set the return to the leftmost leaf describing sufficient  in dbFindLeaf()