379 		/* determine the number of blocks to be freed from  in dbFree()
473 		/* determine the bit number and word within the dmap of  in dbUpdatePMap()
474 		 * the starting block.  also determine how many blocks  in dbUpdatePMap()
490 			/* determine the bit number within the word and  in dbUpdatePMap()
513 				 * their bits updated.  determine how  in dbUpdatePMap()
614 	/* determine the average number of free blocks within the ags. */  in dbNextAG()
1047 	/* determine the block number of the block following  in dbExtend()
1142 	/* determine the bit number and word within the dmap of the  in dbAllocNext()
1165 	 * the actual bits to determine if they are free.  a single pass  in dbAllocNext()
1168 	 * tree will be examined to determine if the blocks are free. a  in dbAllocNext()
1174 		/* determine the bit number within the word and  in dbAllocNext()
1192 			 * within the block range.  determine how many  in dbAllocNext()
1198 			/* now examine the appropriate leaves to determine  in dbAllocNext()
1207 				/* determine the l2 number of bits provided  in dbAllocNext()
1213 				/* determine how many words were handled.  in dbAllocNext()
1270 	/* determine the word within the dmap that holds the hint  in dbAllocNear()
1271 	 * (i.e. blkno).  also, determine the last word in the dmap  in dbAllocNear()
1285 		/* determine the block number within the file system  in dbAllocNear()
1383 	/* determine the starting block number of the allocation  in dbAllocAG()
1437 	 * determine how many allocation groups are represented in a dmap  in dbAllocAG()
1439 	 * fully describes an allocation group. next, determine the starting  in dbAllocAG()
1477 		/* determine the block number within the file system  in dbAllocAG()
1903 		/* determine how many blocks to allocate from this dmap.  in dbAllocCtl()
2013 	/* determine the block number within the file system corresponding  in dbAllocDmapLev()
2188 	/* determine the bit number and word within the dmap of the  in dbAllocBits()
2211 		/* determine the bit number within the word and  in dbAllocBits()
2237 			 * within the block range.  determine how many  in dbAllocBits()
2244 			/* determine how many bits.  in dbAllocBits()
2258 				/* determine what the leaf value should be  in dbAllocBits()
2332 	/* determine the bit number and word within the dmap of the  in dbFreeBits()
2360 		/* determine the bit number within the word and  in dbFreeBits()
2386 			 * within the block range.  determine how many  in dbFreeBits()
2392 			/* determine how many bits.  in dbFreeBits()
2400 				/* determine what the leaf value should be  in dbFreeBits()
2532 	/* determine the leaf number corresponding to the block and  in dbAdjCtl()
2741 	 * determine maximum possible l2 size for the specified leaf.  in dbBackSplit()
2747 	/* determine the number of leaves covered by this size.  this  in dbBackSplit()
2765 			/* determine the buddy.  in dbBackSplit()
2929 		/* determine the maximum of the 4 leaves.  in dbAdjTree()
3064  * FUNCTION:	determine the largest binary buddy string of free
3089 	/* not all free or half free. determine the free buddy  in dbMaxBud()
3101  * FUNCTION:	determine the number of trailing zeros within a 32-bit
3126  * FUNCTION:	determine the number of leading zeros within a 32-bit
3173 			/* determine the l2 value.  in blkstol2()
3241 		/* determine the number of blocks to be allocated from  in dbAllocBottomUp()
3276 	/* determine the bit number and word within the dmap of the  in dbAllocDmapBU()
3299 		/* determine the bit number within the word and  in dbAllocDmapBU()
3317 			 * within the block range.  determine how many  in dbAllocDmapBU()
3324 			/* determine how many bits */  in dbAllocDmapBU()
3677 	/* determine how many blocks are in the inactive allocation  in dbFinalizeBmap()
3686 	/* determine how many free blocks are in the active  in dbFinalizeBmap()
3903 	/* Determine the maximum free string possible for the leaves */  in dbInitTree()
3997  * FUNCTION:	Determine log2(allocation group size) from aggregate size