Fix calculation of hash slots on 32bit env (#3460)

src/common/utils.cpp

@@ -72,6 +72,10 @@ uint64_t nextPowerOfTwo(uint64_t v) {
     return v;
 }
 
+uint64_t prevPowerOfTwo(uint64_t v) {
+    return nextPowerOfTwo((v / 2) + 1);
+}
+
 bool isLittleEndian() {
     // Little endian arch stores the least significant value in the lower bytes.
     int testNumber = 1;

src/include/common/utils.h

@@ -35,6 +35,7 @@ class BitmaskUtils {
 };
 
 uint64_t nextPowerOfTwo(uint64_t v);
+uint64_t prevPowerOfTwo(uint64_t v);
 
 bool isLittleEndian();
 

src/processor/operator/aggregate/aggregate_hash_table.cpp

@@ -147,7 +147,7 @@ void AggregateHashTable::initializeFT(
 }
 
 void AggregateHashTable::initializeHashTable(uint64_t numEntriesToAllocate) {
-    auto numHashSlotsPerBlock = HASH_BLOCK_SIZE / sizeof(HashSlot);
+    auto numHashSlotsPerBlock = prevPowerOfTwo(HASH_BLOCK_SIZE / sizeof(HashSlot));
     setMaxNumHashSlots(nextPowerOfTwo(std::max(numHashSlotsPerBlock, numEntriesToAllocate)));
     initSlotConstant(numHashSlotsPerBlock);
     auto numDataBlocks =