388 		/* determine the number of blocks to be freed from  in dbFree()
483 		/* determine the bit number and word within the dmap of  in dbUpdatePMap()
484 		 * the starting block.  also determine how many blocks  in dbUpdatePMap()
500 			/* determine the bit number within the word and  in dbUpdatePMap()
523 				 * their bits updated.  determine how  in dbUpdatePMap()
624 	/* determine the average number of free blocks within the ags. */  in dbNextAG()
989 	/* determine the block number of the block following  in dbExtend()
1084 	/* determine the bit number and word within the dmap of the  in dbAllocNext()
1107 	 * the actual bits to determine if they are free.  a single pass  in dbAllocNext()
1110 	 * tree will be examined to determine if the blocks are free. a  in dbAllocNext()
1116 		/* determine the bit number within the word and  in dbAllocNext()
1134 			 * within the block range.  determine how many  in dbAllocNext()
1140 			/* now examine the appropriate leaves to determine  in dbAllocNext()
1149 				/* determine the l2 number of bits provided  in dbAllocNext()
1155 				/* determine how many words were handled.  in dbAllocNext()
1212 	/* determine the word within the dmap that holds the hint  in dbAllocNear()
1213 	 * (i.e. blkno).  also, determine the last word in the dmap  in dbAllocNear()
1227 		/* determine the block number within the file system  in dbAllocNear()
1325 	/* determine the starting block number of the allocation  in dbAllocAG()
1379 	 * determine how many allocation groups are represented in a dmap  in dbAllocAG()
1381 	 * fully describes an allocation group. next, determine the starting  in dbAllocAG()
1419 		/* determine the block number within the file system  in dbAllocAG()
1850 		/* determine how many blocks to allocate from this dmap.  in dbAllocCtl()
1963 	/* determine the block number within the file system corresponding  in dbAllocDmapLev()
2138 	/* determine the bit number and word within the dmap of the  in dbAllocBits()
2161 		/* determine the bit number within the word and  in dbAllocBits()
2187 			 * within the block range.  determine how many  in dbAllocBits()
2194 			/* determine how many bits.  in dbAllocBits()
2208 				/* determine what the leaf value should be  in dbAllocBits()
2282 	/* determine the bit number and word within the dmap of the  in dbFreeBits()
2310 		/* determine the bit number within the word and  in dbFreeBits()
2336 			 * within the block range.  determine how many  in dbFreeBits()
2342 			/* determine how many bits.  in dbFreeBits()
2350 				/* determine what the leaf value should be  in dbFreeBits()
2482 	/* determine the leaf number corresponding to the block and  in dbAdjCtl()
2695 	 * determine maximum possible l2 size for the specified leaf.  in dbBackSplit()
2701 	/* determine the number of leaves covered by this size.  this  in dbBackSplit()
2719 			/* determine the buddy.  in dbBackSplit()
2891 		/* determine the maximum of the 4 leaves.  in dbAdjTree()
3035  * FUNCTION:	determine the largest binary buddy string of free
3060 	/* not all free or half free. determine the free buddy  in dbMaxBud()
3072  * FUNCTION:	determine the number of trailing zeros within a 32-bit
3097  * FUNCTION:	determine the number of leading zeros within a 32-bit
3144 			/* determine the l2 value.  in blkstol2()
3212 		/* determine the number of blocks to be allocated from  in dbAllocBottomUp()
3247 	/* determine the bit number and word within the dmap of the  in dbAllocDmapBU()
3270 		/* determine the bit number within the word and  in dbAllocDmapBU()
3288 			 * within the block range.  determine how many  in dbAllocDmapBU()
3295 			/* determine how many bits */  in dbAllocDmapBU()
3648 	/* determine how many blocks are in the inactive allocation  in dbFinalizeBmap()
3657 	/* determine how many free blocks are in the active  in dbFinalizeBmap()
3874 	/* Determine the maximum free string possible for the leaves */  in dbInitTree()
3968  * FUNCTION:	Determine log2(allocation group size) from aggregate size