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()
1072 	/* determine the block number of the block following  in dbExtend()
1167 	/* determine the bit number and word within the dmap of the  in dbAllocNext()
1190 	 * the actual bits to determine if they are free.  a single pass  in dbAllocNext()
1193 	 * tree will be examined to determine if the blocks are free. a  in dbAllocNext()
1199 		/* determine the bit number within the word and  in dbAllocNext()
1217 			 * within the block range.  determine how many  in dbAllocNext()
1223 			/* now examine the appropriate leaves to determine  in dbAllocNext()
1232 				/* determine the l2 number of bits provided  in dbAllocNext()
1238 				/* determine how many words were handled.  in dbAllocNext()
1295 	/* determine the word within the dmap that holds the hint  in dbAllocNear()
1296 	 * (i.e. blkno).  also, determine the last word in the dmap  in dbAllocNear()
1310 		/* determine the block number within the file system  in dbAllocNear()
1408 	/* determine the starting block number of the allocation  in dbAllocAG()
1462 	 * determine how many allocation groups are represented in a dmap  in dbAllocAG()
1464 	 * fully describes an allocation group. next, determine the starting  in dbAllocAG()
1502 		/* determine the block number within the file system  in dbAllocAG()
1928 		/* determine how many blocks to allocate from this dmap.  in dbAllocCtl()
2041 	/* determine the block number within the file system corresponding  in dbAllocDmapLev()
2216 	/* determine the bit number and word within the dmap of the  in dbAllocBits()
2239 		/* determine the bit number within the word and  in dbAllocBits()
2265 			 * within the block range.  determine how many  in dbAllocBits()
2272 			/* determine how many bits.  in dbAllocBits()
2286 				/* determine what the leaf value should be  in dbAllocBits()
2360 	/* determine the bit number and word within the dmap of the  in dbFreeBits()
2388 		/* determine the bit number within the word and  in dbFreeBits()
2414 			 * within the block range.  determine how many  in dbFreeBits()
2420 			/* determine how many bits.  in dbFreeBits()
2428 				/* determine what the leaf value should be  in dbFreeBits()
2560 	/* determine the leaf number corresponding to the block and  in dbAdjCtl()
2769 	 * determine maximum possible l2 size for the specified leaf.  in dbBackSplit()
2775 	/* determine the number of leaves covered by this size.  this  in dbBackSplit()
2793 			/* determine the buddy.  in dbBackSplit()
2962 		/* determine the maximum of the 4 leaves.  in dbAdjTree()
3103  * FUNCTION:	determine the largest binary buddy string of free
3128 	/* not all free or half free. determine the free buddy  in dbMaxBud()
3140  * FUNCTION:	determine the number of trailing zeros within a 32-bit
3165  * FUNCTION:	determine the number of leading zeros within a 32-bit
3212 			/* determine the l2 value.  in blkstol2()
3280 		/* determine the number of blocks to be allocated from  in dbAllocBottomUp()
3315 	/* determine the bit number and word within the dmap of the  in dbAllocDmapBU()
3338 		/* determine the bit number within the word and  in dbAllocDmapBU()
3356 			 * within the block range.  determine how many  in dbAllocDmapBU()
3363 			/* determine how many bits */  in dbAllocDmapBU()
3716 	/* determine how many blocks are in the inactive allocation  in dbFinalizeBmap()
3725 	/* determine how many free blocks are in the active  in dbFinalizeBmap()
3942 	/* Determine the maximum free string possible for the leaves */  in dbInitTree()
4036  * FUNCTION:	Determine log2(allocation group size) from aggregate size