396 		/* determine the number of blocks to be freed from  in dbFree()
491 		/* determine the bit number and word within the dmap of  in dbUpdatePMap()
492 		 * the starting block.  also determine how many blocks  in dbUpdatePMap()
508 			/* determine the bit number within the word and  in dbUpdatePMap()
531 				 * their bits updated.  determine how  in dbUpdatePMap()
632 	/* determine the average number of free blocks within the ags. */  in dbNextAG()
997 	/* determine the block number of the block following  in dbExtend()
1092 	/* determine the bit number and word within the dmap of the  in dbAllocNext()
1115 	 * the actual bits to determine if they are free.  a single pass  in dbAllocNext()
1118 	 * tree will be examined to determine if the blocks are free. a  in dbAllocNext()
1124 		/* determine the bit number within the word and  in dbAllocNext()
1142 			 * within the block range.  determine how many  in dbAllocNext()
1148 			/* now examine the appropriate leaves to determine  in dbAllocNext()
1157 				/* determine the l2 number of bits provided  in dbAllocNext()
1163 				/* determine how many words were handled.  in dbAllocNext()
1220 	/* determine the word within the dmap that holds the hint  in dbAllocNear()
1221 	 * (i.e. blkno).  also, determine the last word in the dmap  in dbAllocNear()
1235 		/* determine the block number within the file system  in dbAllocNear()
1333 	/* determine the starting block number of the allocation  in dbAllocAG()
1387 	 * determine how many allocation groups are represented in a dmap  in dbAllocAG()
1389 	 * fully describes an allocation group. next, determine the starting  in dbAllocAG()
1427 		/* determine the block number within the file system  in dbAllocAG()
1853 		/* determine how many blocks to allocate from this dmap.  in dbAllocCtl()
1966 	/* determine the block number within the file system corresponding  in dbAllocDmapLev()
2141 	/* determine the bit number and word within the dmap of the  in dbAllocBits()
2164 		/* determine the bit number within the word and  in dbAllocBits()
2190 			 * within the block range.  determine how many  in dbAllocBits()
2197 			/* determine how many bits.  in dbAllocBits()
2211 				/* determine what the leaf value should be  in dbAllocBits()
2285 	/* determine the bit number and word within the dmap of the  in dbFreeBits()
2313 		/* determine the bit number within the word and  in dbFreeBits()
2339 			 * within the block range.  determine how many  in dbFreeBits()
2345 			/* determine how many bits.  in dbFreeBits()
2353 				/* determine what the leaf value should be  in dbFreeBits()
2485 	/* determine the leaf number corresponding to the block and  in dbAdjCtl()
2698 	 * determine maximum possible l2 size for the specified leaf.  in dbBackSplit()
2704 	/* determine the number of leaves covered by this size.  this  in dbBackSplit()
2722 			/* determine the buddy.  in dbBackSplit()
2886 		/* determine the maximum of the 4 leaves.  in dbAdjTree()
3021  * FUNCTION:	determine the largest binary buddy string of free
3046 	/* not all free or half free. determine the free buddy  in dbMaxBud()
3058  * FUNCTION:	determine the number of trailing zeros within a 32-bit
3083  * FUNCTION:	determine the number of leading zeros within a 32-bit
3130 			/* determine the l2 value.  in blkstol2()
3198 		/* determine the number of blocks to be allocated from  in dbAllocBottomUp()
3233 	/* determine the bit number and word within the dmap of the  in dbAllocDmapBU()
3256 		/* determine the bit number within the word and  in dbAllocDmapBU()
3274 			 * within the block range.  determine how many  in dbAllocDmapBU()
3281 			/* determine how many bits */  in dbAllocDmapBU()
3634 	/* determine how many blocks are in the inactive allocation  in dbFinalizeBmap()
3643 	/* determine how many free blocks are in the active  in dbFinalizeBmap()
3860 	/* Determine the maximum free string possible for the leaves */  in dbInitTree()
3954  * FUNCTION:	Determine log2(allocation group size) from aggregate size