base: Fix address range granularity calculation
This patch fixes a bug in the granularity calculation. For example, if the high bit is 6 (counting from 0) and we have one interleaving bit, then the granularity is now 2 ** (6 - 1 + 1) = 64.
This commit is contained in:
parent
f330b3c28d
commit
997a6a4add
1 changed files with 1 additions and 1 deletions
|
@ -142,7 +142,7 @@ class AddrRange
|
|||
*/
|
||||
uint64_t granularity() const
|
||||
{
|
||||
return ULL(1) << (intlvHighBit - intlvBits);
|
||||
return ULL(1) << (intlvHighBit - intlvBits + 1);
|
||||
}
|
||||
|
||||
/**
|
||||
|
|
Loading…
Reference in a new issue