403 		/* determine the number of blocks to be freed from  in dbFree()
498 		/* determine the bit number and word within the dmap of  in dbUpdatePMap()
499 		 * the starting block.  also determine how many blocks  in dbUpdatePMap()
515 			/* determine the bit number within the word and  in dbUpdatePMap()
538 				 * their bits updated.  determine how  in dbUpdatePMap()
639 	/* determine the average number of free blocks within the ags. */  in dbNextAG()
1004 	/* determine the block number of the block following  in dbExtend()
1099 	/* determine the bit number and word within the dmap of the  in dbAllocNext()
1122 	 * the actual bits to determine if they are free.  a single pass  in dbAllocNext()
1125 	 * tree will be examined to determine if the blocks are free. a  in dbAllocNext()
1131 		/* determine the bit number within the word and  in dbAllocNext()
1149 			 * within the block range.  determine how many  in dbAllocNext()
1155 			/* now examine the appropriate leaves to determine  in dbAllocNext()
1164 				/* determine the l2 number of bits provided  in dbAllocNext()
1170 				/* determine how many words were handled.  in dbAllocNext()
1227 	/* determine the word within the dmap that holds the hint  in dbAllocNear()
1228 	 * (i.e. blkno).  also, determine the last word in the dmap  in dbAllocNear()
1242 		/* determine the block number within the file system  in dbAllocNear()
1340 	/* determine the starting block number of the allocation  in dbAllocAG()
1394 	 * determine how many allocation groups are represented in a dmap  in dbAllocAG()
1396 	 * fully describes an allocation group. next, determine the starting  in dbAllocAG()
1434 		/* determine the block number within the file system  in dbAllocAG()
1860 		/* determine how many blocks to allocate from this dmap.  in dbAllocCtl()
1973 	/* determine the block number within the file system corresponding  in dbAllocDmapLev()
2148 	/* determine the bit number and word within the dmap of the  in dbAllocBits()
2171 		/* determine the bit number within the word and  in dbAllocBits()
2197 			 * within the block range.  determine how many  in dbAllocBits()
2204 			/* determine how many bits.  in dbAllocBits()
2218 				/* determine what the leaf value should be  in dbAllocBits()
2292 	/* determine the bit number and word within the dmap of the  in dbFreeBits()
2320 		/* determine the bit number within the word and  in dbFreeBits()
2346 			 * within the block range.  determine how many  in dbFreeBits()
2352 			/* determine how many bits.  in dbFreeBits()
2360 				/* determine what the leaf value should be  in dbFreeBits()
2492 	/* determine the leaf number corresponding to the block and  in dbAdjCtl()
2705 	 * determine maximum possible l2 size for the specified leaf.  in dbBackSplit()
2711 	/* determine the number of leaves covered by this size.  this  in dbBackSplit()
2729 			/* determine the buddy.  in dbBackSplit()
2898 		/* determine the maximum of the 4 leaves.  in dbAdjTree()
3039  * FUNCTION:	determine the largest binary buddy string of free
3064 	/* not all free or half free. determine the free buddy  in dbMaxBud()
3076  * FUNCTION:	determine the number of trailing zeros within a 32-bit
3101  * FUNCTION:	determine the number of leading zeros within a 32-bit
3148 			/* determine the l2 value.  in blkstol2()
3216 		/* determine the number of blocks to be allocated from  in dbAllocBottomUp()
3251 	/* determine the bit number and word within the dmap of the  in dbAllocDmapBU()
3274 		/* determine the bit number within the word and  in dbAllocDmapBU()
3292 			 * within the block range.  determine how many  in dbAllocDmapBU()
3299 			/* determine how many bits */  in dbAllocDmapBU()
3652 	/* determine how many blocks are in the inactive allocation  in dbFinalizeBmap()
3661 	/* determine how many free blocks are in the active  in dbFinalizeBmap()
3878 	/* Determine the maximum free string possible for the leaves */  in dbInitTree()
3972  * FUNCTION:	Determine log2(allocation group size) from aggregate size