50  *	write inode lock of the bmap inode. requests starting at the top
51  *	take this lock in write mode while request starting at the bottom
325  *	blkno	- starting block number to be freed.
409  *	blkno	- starting block number of the range.
469 		 * the starting block.  also determine how many blocks  in dbUpdatePMap()
687  *	results	- on successful return, set to the starting block number
745 	 * will start looking for free space starting at this point.  in dbAlloc()
957  *	blkno	    -  starting block of the current allocation.
961  *	results	-      on successful return, set to the starting block number
1011  *	blkno	    -  starting block of the current allocation.
1112  *	blkno	-  starting block number of the range.
1141 	 * starting block.  in dbAllocNext()
1152 	/* check if the starting leaf indicates that anything  in dbAllocNext()
1233  *		starting with the dmap leaf that covers the hint, we'll
1244  *	results	-  on successful return, set to the starting block number
1290 		 * starting bit number within the dmap word of the required  in dbAllocNear()
1354  *	results	-  on successful return, set to the starting block number
1383 	/* determine the starting block number of the allocation  in dbAllocAG()
1440 	 * fully describes an allocation group. next, determine the starting  in dbAllocAG()
1450 	 * subtrees for sufficient free space, starting with the leftmost  in dbAllocAG()
1504 			 * the starting block number of the dmap that  in dbAllocAG()
1547  *		searching down the dmap control pages, starting with the
1556  *	results	-  on successful return, set to the starting block number
1571 	/* starting with the top level dmap control page, search  in dbAllocAny()
1573 	 * if free space is found, dbFindCtl() returns the starting  in dbAllocAny()
1595  * FUNCTION:	starting at a specified dmap control page level and block
1601  *		returns the starting block number within a dmap page that
1607  *	level	-  starting dmap control page level.
1609  *	*blkno	-  on entry, starting block number for conducting the search.
1628 	/* starting at the specified dmap control page level and block  in dbFindCtl()
1629 	 * number, search down the dmap control levels for the starting  in dbFindCtl()
1697  *		blocks starting within a specific dmap.
1702  *		routines are the starting block numbers within dmaps, with
1704  *		space or starting a contiguous free space of desired size
1726  *	blkno	 -  starting block number of the dmap to start the allocation
1728  *	results	-  on successful return, set to the starting block number
1812 	/* set the results (starting block number) and return.  in dbAllocCtl()
1879  *	results	-  on successful return, set to the starting block number
1912 	/* if not all bits of the dmap word are free, get the starting  in dbAllocDmapLev()
1945  *	blkno	-  starting block number of the block to be allocated.
2000  *	blkno	-  starting block number of the block to be freed.
2064  *	blkno	-  starting block number of the bits to be allocated.
2083 	 * starting block.  in dbAllocBits()
2211  *	blkno	-  starting block number of the bits to be freed.
2227 	 * starting block.  in dbFreeBits()
2371  *		starting block number of the block range whose allocation
2548  *	splitsz	- the size the binary buddy system starting at the leaf
2567 		 * size.  pick up the starting split size (current size  in dbSplit()
2879 	 * starting at the next level for the leftmost leaf that  in dbFindLeaf()
2884 		/* search the four nodes at this level, starting from  in dbFindLeaf()
2924  *	starting bit number of free bits.
3097  *	blkno	-  starting block number to be freed.
3173 	 * starting block.  in dbAllocDmapBU()
3648 	/* starting block number within the dmap */  in dbInitDmap()
3741  *	blkno	- starting block number for this dmap
3806 	 * Try to combine buddies starting with a buddy size of 1  in dbInitTree()
3837 	 * Starting at the leaf node level, the four nodes described by  in dbInitTree()