39  *	write inode lock of the bmap inode. requests starting at the top
40  *	take this lock in write mode while request starting at the bottom
337  *	blkno	- starting block number to be freed.
429  *	blkno	- starting block number of the range.
488 		 * the starting block.  also determine how many blocks  in dbUpdatePMap()
706  *	results	- on successful return, set to the starting block number
764 	 * will start looking for free space starting at this point.  in dbAlloc()
908  *	blkno	    -  starting block of the current allocation.
912  *	results	-      on successful return, set to the starting block number
962  *	blkno	    -  starting block of the current allocation.
1061  *	blkno	-  starting block number of the range.
1089 	 * starting block.  in dbAllocNext()
1100 	/* check if the starting leaf indicates that anything  in dbAllocNext()
1181  *		starting with the dmap leaf that covers the hint, we'll
1192  *	results	-  on successful return, set to the starting block number
1237 		 * starting bit number within the dmap word of the required  in dbAllocNear()
1301  *	results	-  on successful return, set to the starting block number
1329 	/* determine the starting block number of the allocation  in dbAllocAG()
1385 	 * fully describes an allocation group. next, determine the starting  in dbAllocAG()
1401 	 * subtrees for sufficient free space, starting with the leftmost  in dbAllocAG()
1455 			 * the starting block number of the dmap that  in dbAllocAG()
1497  *		searching down the dmap control pages, starting with the
1506  *	results	-  on successful return, set to the starting block number
1521 	/* starting with the top level dmap control page, search  in dbAllocAny()
1523 	 * if free space is found, dbFindCtl() returns the starting  in dbAllocAny()
1656  * FUNCTION:	starting at a specified dmap control page level and block
1662  *		returns the starting block number within a dmap page that
1668  *	level	-  starting dmap control page level.
1670  *	*blkno	-  on entry, starting block number for conducting the search.
1689 	/* starting at the specified dmap control page level and block  in dbFindCtl()
1690 	 * number, search down the dmap control levels for the starting  in dbFindCtl()
1758  *		blocks starting within a specific dmap.
1763  *		routines are the starting block numbers within dmaps, with
1765  *		space or starting a contiguous free space of desired size
1787  *	blkno	 -  starting block number of the dmap to start the allocation
1789  *	results	-  on successful return, set to the starting block number
1878 	/* set the results (starting block number) and return.  in dbAllocCtl()
1944  *	results	-  on successful return, set to the starting block number
1980 	/* if not all bits of the dmap word are free, get the starting  in dbAllocDmapLev()
2013  *	blkno	-  starting block number of the block to be allocated.
2068  *	blkno	-  starting block number of the block to be freed.
2132  *	blkno	-  starting block number of the bits to be allocated.
2151 	 * starting block.  in dbAllocBits()
2279  *	blkno	-  starting block number of the bits to be freed.
2295 	 * starting block.  in dbFreeBits()
2439  *		starting block number of the block range whose allocation
2618  *	splitsz	- the size the binary buddy system starting at the leaf
2637 		 * size.  pick up the starting split size (current size  in dbSplit()
2962 	 * starting at the next level for the leftmost leaf that  in dbFindLeaf()
2967 		/* search the four nodes at this level, starting from  in dbFindLeaf()
3011  *	starting bit number of free bits.
3184  *	blkno	-  starting block number to be freed.
3260 	 * starting block.  in dbAllocDmapBU()
3734 	/* starting block number within the dmap */  in dbInitDmap()
3827  *	blkno	- starting block number for this dmap
3892 	 * Try to combine buddies starting with a buddy size of 1  in dbInitTree()
3923 	 * Starting at the leaf node level, the four nodes described by  in dbInitTree()