This is an automated email from the ASF dual-hosted git repository.

kurt pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/flink.git


The following commit(s) were added to refs/heads/master by this push:
     new fd8e34c  [FLINK-20855][table-runtime-blink] Fix calculating numBuckets 
overflow (#14566)
fd8e34c is described below

commit fd8e34c03b663aff96a625ed751b66244da8793e
Author: JieFang.He <blackjj...@163.com>
AuthorDate: Sat Apr 17 09:45:20 2021 +0800

    [FLINK-20855][table-runtime-blink] Fix calculating numBuckets overflow 
(#14566)
---
 .../org/apache/flink/table/runtime/hashtable/LongHashPartition.java     | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git 
a/flink-table/flink-table-runtime-blink/src/main/java/org/apache/flink/table/runtime/hashtable/LongHashPartition.java
 
b/flink-table/flink-table-runtime-blink/src/main/java/org/apache/flink/table/runtime/hashtable/LongHashPartition.java
index f022e6f..9515626 100644
--- 
a/flink-table/flink-table-runtime-blink/src/main/java/org/apache/flink/table/runtime/hashtable/LongHashPartition.java
+++ 
b/flink-table/flink-table-runtime-blink/src/main/java/org/apache/flink/table/runtime/hashtable/LongHashPartition.java
@@ -160,7 +160,7 @@ public class LongHashPartition extends 
AbstractPagedInputView implements Seekabl
         this.partitionNum = partitionNum;
         this.recursionLevel = recursionLevel;
 
-        int numBuckets = MathUtils.roundDownToPowerOf2(bucketNumSegs * 
segmentSize / 16);
+        int numBuckets = MathUtils.roundDownToPowerOf2(segmentSize / 16 * 
bucketNumSegs);
         MemorySegment[] buckets = new MemorySegment[bucketNumSegs];
         for (int i = 0; i < bucketNumSegs; i++) {
             buckets[i] = longTable.nextSegment();

Reply via email to