366 		/* determine the number of blocks to be freed from  in dbFree()
460 		/* determine the bit number and word within the dmap of  in dbUpdatePMap()
461 		 * the starting block.  also determine how many blocks  in dbUpdatePMap()
477 			/* determine the bit number within the word and  in dbUpdatePMap()
500 				 * their bits updated.  determine how  in dbUpdatePMap()
601 	/* determine the average number of free blocks within the ags. */  in dbNextAG()
1034 	/* determine the block number of the block following  in dbExtend()
1129 	/* determine the bit number and word within the dmap of the  in dbAllocNext()
1152 	 * the actual bits to determine if they are free.  a single pass  in dbAllocNext()
1155 	 * tree will be examined to determine if the blocks are free. a  in dbAllocNext()
1161 		/* determine the bit number within the word and  in dbAllocNext()
1179 			 * within the block range.  determine how many  in dbAllocNext()
1185 			/* now examine the appropriate leaves to determine  in dbAllocNext()
1194 				/* determine the l2 number of bits provided  in dbAllocNext()
1200 				/* determine how many words were handled.  in dbAllocNext()
1257 	/* determine the word within the dmap that holds the hint  in dbAllocNear()
1258 	 * (i.e. blkno).  also, determine the last word in the dmap  in dbAllocNear()
1272 		/* determine the block number within the file system  in dbAllocNear()
1370 	/* determine the starting block number of the allocation  in dbAllocAG()
1424 	 * determine how many allocation groups are represented in a dmap  in dbAllocAG()
1426 	 * fully describes an allocation group. next, determine the starting  in dbAllocAG()
1464 		/* determine the block number within the file system  in dbAllocAG()
1890 		/* determine how many blocks to allocate from this dmap.  in dbAllocCtl()
2000 	/* determine the block number within the file system corresponding  in dbAllocDmapLev()
2175 	/* determine the bit number and word within the dmap of the  in dbAllocBits()
2198 		/* determine the bit number within the word and  in dbAllocBits()
2224 			 * within the block range.  determine how many  in dbAllocBits()
2231 			/* determine how many bits.  in dbAllocBits()
2245 				/* determine what the leaf value should be  in dbAllocBits()
2319 	/* determine the bit number and word within the dmap of the  in dbFreeBits()
2347 		/* determine the bit number within the word and  in dbFreeBits()
2373 			 * within the block range.  determine how many  in dbFreeBits()
2379 			/* determine how many bits.  in dbFreeBits()
2387 				/* determine what the leaf value should be  in dbFreeBits()
2519 	/* determine the leaf number corresponding to the block and  in dbAdjCtl()
2728 	 * determine maximum possible l2 size for the specified leaf.  in dbBackSplit()
2734 	/* determine the number of leaves covered by this size.  this  in dbBackSplit()
2752 			/* determine the buddy.  in dbBackSplit()
2916 		/* determine the maximum of the 4 leaves.  in dbAdjTree()
3051  * FUNCTION:	determine the largest binary buddy string of free
3076 	/* not all free or half free. determine the free buddy  in dbMaxBud()
3088  * FUNCTION:	determine the number of trailing zeros within a 32-bit
3113  * FUNCTION:	determine the number of leading zeros within a 32-bit
3160 			/* determine the l2 value.  in blkstol2()
3228 		/* determine the number of blocks to be allocated from  in dbAllocBottomUp()
3263 	/* determine the bit number and word within the dmap of the  in dbAllocDmapBU()
3286 		/* determine the bit number within the word and  in dbAllocDmapBU()
3304 			 * within the block range.  determine how many  in dbAllocDmapBU()
3311 			/* determine how many bits */  in dbAllocDmapBU()
3664 	/* determine how many blocks are in the inactive allocation  in dbFinalizeBmap()
3673 	/* determine how many free blocks are in the active  in dbFinalizeBmap()
3890 	/* Determine the maximum free string possible for the leaves */  in dbInitTree()
3984  * FUNCTION:	Determine log2(allocation group size) from aggregate size