407 		/* determine the number of blocks to be freed from  in dbFree()
502 		/* determine the bit number and word within the dmap of  in dbUpdatePMap()
503 		 * the starting block.  also determine how many blocks  in dbUpdatePMap()
519 			/* determine the bit number within the word and  in dbUpdatePMap()
542 				 * their bits updated.  determine how  in dbUpdatePMap()
643 	/* determine the average number of free blocks within the ags. */  in dbNextAG()
1008 	/* determine the block number of the block following  in dbExtend()
1103 	/* determine the bit number and word within the dmap of the  in dbAllocNext()
1126 	 * the actual bits to determine if they are free.  a single pass  in dbAllocNext()
1129 	 * tree will be examined to determine if the blocks are free. a  in dbAllocNext()
1135 		/* determine the bit number within the word and  in dbAllocNext()
1153 			 * within the block range.  determine how many  in dbAllocNext()
1159 			/* now examine the appropriate leaves to determine  in dbAllocNext()
1168 				/* determine the l2 number of bits provided  in dbAllocNext()
1174 				/* determine how many words were handled.  in dbAllocNext()
1231 	/* determine the word within the dmap that holds the hint  in dbAllocNear()
1232 	 * (i.e. blkno).  also, determine the last word in the dmap  in dbAllocNear()
1246 		/* determine the block number within the file system  in dbAllocNear()
1344 	/* determine the starting block number of the allocation  in dbAllocAG()
1398 	 * determine how many allocation groups are represented in a dmap  in dbAllocAG()
1400 	 * fully describes an allocation group. next, determine the starting  in dbAllocAG()
1438 		/* determine the block number within the file system  in dbAllocAG()
1869 		/* determine how many blocks to allocate from this dmap.  in dbAllocCtl()
1982 	/* determine the block number within the file system corresponding  in dbAllocDmapLev()
2157 	/* determine the bit number and word within the dmap of the  in dbAllocBits()
2180 		/* determine the bit number within the word and  in dbAllocBits()
2206 			 * within the block range.  determine how many  in dbAllocBits()
2213 			/* determine how many bits.  in dbAllocBits()
2227 				/* determine what the leaf value should be  in dbAllocBits()
2301 	/* determine the bit number and word within the dmap of the  in dbFreeBits()
2329 		/* determine the bit number within the word and  in dbFreeBits()
2355 			 * within the block range.  determine how many  in dbFreeBits()
2361 			/* determine how many bits.  in dbFreeBits()
2369 				/* determine what the leaf value should be  in dbFreeBits()
2501 	/* determine the leaf number corresponding to the block and  in dbAdjCtl()
2714 	 * determine maximum possible l2 size for the specified leaf.  in dbBackSplit()
2720 	/* determine the number of leaves covered by this size.  this  in dbBackSplit()
2738 			/* determine the buddy.  in dbBackSplit()
2910 		/* determine the maximum of the 4 leaves.  in dbAdjTree()
3054  * FUNCTION:	determine the largest binary buddy string of free
3079 	/* not all free or half free. determine the free buddy  in dbMaxBud()
3091  * FUNCTION:	determine the number of trailing zeros within a 32-bit
3116  * FUNCTION:	determine the number of leading zeros within a 32-bit
3163 			/* determine the l2 value.  in blkstol2()
3231 		/* determine the number of blocks to be allocated from  in dbAllocBottomUp()
3266 	/* determine the bit number and word within the dmap of the  in dbAllocDmapBU()
3289 		/* determine the bit number within the word and  in dbAllocDmapBU()
3307 			 * within the block range.  determine how many  in dbAllocDmapBU()
3314 			/* determine how many bits */  in dbAllocDmapBU()
3667 	/* determine how many blocks are in the inactive allocation  in dbFinalizeBmap()
3676 	/* determine how many free blocks are in the active  in dbFinalizeBmap()
3893 	/* Determine the maximum free string possible for the leaves */  in dbInitTree()
3987  * FUNCTION:	Determine log2(allocation group size) from aggregate size