389 		/* determine the number of blocks to be freed from  in dbFree()
484 		/* determine the bit number and word within the dmap of  in dbUpdatePMap()
485 		 * the starting block.  also determine how many blocks  in dbUpdatePMap()
501 			/* determine the bit number within the word and  in dbUpdatePMap()
524 				 * their bits updated.  determine how  in dbUpdatePMap()
625 	/* determine the average number of free blocks within the ags. */  in dbNextAG()
1058 	/* determine the block number of the block following  in dbExtend()
1153 	/* determine the bit number and word within the dmap of the  in dbAllocNext()
1176 	 * the actual bits to determine if they are free.  a single pass  in dbAllocNext()
1179 	 * tree will be examined to determine if the blocks are free. a  in dbAllocNext()
1185 		/* determine the bit number within the word and  in dbAllocNext()
1203 			 * within the block range.  determine how many  in dbAllocNext()
1209 			/* now examine the appropriate leaves to determine  in dbAllocNext()
1218 				/* determine the l2 number of bits provided  in dbAllocNext()
1224 				/* determine how many words were handled.  in dbAllocNext()
1281 	/* determine the word within the dmap that holds the hint  in dbAllocNear()
1282 	 * (i.e. blkno).  also, determine the last word in the dmap  in dbAllocNear()
1296 		/* determine the block number within the file system  in dbAllocNear()
1394 	/* determine the starting block number of the allocation  in dbAllocAG()
1448 	 * determine how many allocation groups are represented in a dmap  in dbAllocAG()
1450 	 * fully describes an allocation group. next, determine the starting  in dbAllocAG()
1488 		/* determine the block number within the file system  in dbAllocAG()
1914 		/* determine how many blocks to allocate from this dmap.  in dbAllocCtl()
2024 	/* determine the block number within the file system corresponding  in dbAllocDmapLev()
2199 	/* determine the bit number and word within the dmap of the  in dbAllocBits()
2222 		/* determine the bit number within the word and  in dbAllocBits()
2248 			 * within the block range.  determine how many  in dbAllocBits()
2255 			/* determine how many bits.  in dbAllocBits()
2269 				/* determine what the leaf value should be  in dbAllocBits()
2343 	/* determine the bit number and word within the dmap of the  in dbFreeBits()
2371 		/* determine the bit number within the word and  in dbFreeBits()
2397 			 * within the block range.  determine how many  in dbFreeBits()
2403 			/* determine how many bits.  in dbFreeBits()
2411 				/* determine what the leaf value should be  in dbFreeBits()
2543 	/* determine the leaf number corresponding to the block and  in dbAdjCtl()
2752 	 * determine maximum possible l2 size for the specified leaf.  in dbBackSplit()
2758 	/* determine the number of leaves covered by this size.  this  in dbBackSplit()
2776 			/* determine the buddy.  in dbBackSplit()
2940 		/* determine the maximum of the 4 leaves.  in dbAdjTree()
3075  * FUNCTION:	determine the largest binary buddy string of free
3100 	/* not all free or half free. determine the free buddy  in dbMaxBud()
3112  * FUNCTION:	determine the number of trailing zeros within a 32-bit
3137  * FUNCTION:	determine the number of leading zeros within a 32-bit
3184 			/* determine the l2 value.  in blkstol2()
3252 		/* determine the number of blocks to be allocated from  in dbAllocBottomUp()
3287 	/* determine the bit number and word within the dmap of the  in dbAllocDmapBU()
3310 		/* determine the bit number within the word and  in dbAllocDmapBU()
3328 			 * within the block range.  determine how many  in dbAllocDmapBU()
3335 			/* determine how many bits */  in dbAllocDmapBU()
3688 	/* determine how many blocks are in the inactive allocation  in dbFinalizeBmap()
3697 	/* determine how many free blocks are in the active  in dbFinalizeBmap()
3914 	/* Determine the maximum free string possible for the leaves */  in dbInitTree()
4008  * FUNCTION:	Determine log2(allocation group size) from aggregate size