Alawn/Chronicle-Map
1
0
Fork 0
mirror of https://github.com/OpenHFT/Chronicle-Map.git synced 2021-09-13 01:26:12 +00:00
Code Releases Activity

Prevent arithmetic operations from overflowing, Fix #244

Browse Source
This commit is contained in:
Per Minborg
2020-12-10 17:38:14 +01:00
parent 18142e10cc
commit 49b58862b9
5 changed files with 32 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/main/java/net/openhft/chronicle/hash/impl/VanillaChronicleHash.java
+1 -1
View File
@@ -449,7 +449,7 @@ public abstract class VanillaChronicleHash<K,
private void initOffsetsAndBulks() {
segmentHeadersOffset = segmentHeadersOffset();
long segmentHeadersSize = actualSegments * segmentHeaderSize;
final long segmentHeadersSize = (long) actualSegments * (long) segmentHeaderSize;
segmentsOffset = segmentHeadersOffset + segmentHeadersSize;
if (createdOrInMemory) {
src/main/java/net/openhft/chronicle/hash/impl/stage/entry/SegmentStages.java
+1 -1
View File
@@ -570,7 +570,7 @@ public abstract class SegmentStages implements SegmentLock, LocksInterface {
public abstract boolean segmentTierInit();
public void initSegmentTier() {
tierIndex = segmentIndex + 1; // tiers are 1-counted
tierIndex = segmentIndex + 1L; // tiers are 1-counted
tierBaseAddr = hh.h().segmentBaseAddr(segmentIndex);
// assign the field of stage on which init() checks last, because flushed in segmentIndex()
// initialization
src/main/java/net/openhft/chronicle/hash/impl/util/math/PoissonDistribution.java
+2 -2
View File
@@ -66,12 +66,12 @@ public class PoissonDistribution {
double k = Math.sqrt((1.0 - p) / p);
double tmp = mu - k * sigma;
if (tmp > lower) {
lower = ((int) Math.ceil(tmp)) - 1;
lower = ((int) Math.ceil(tmp)) - 1L;
}
k = 1.0 / k;
tmp = mu + k * sigma;
if (tmp < upper) {
upper = ((int) Math.ceil(tmp)) - 1;
upper = ((int) Math.ceil(tmp)) - 1L;
}
}
src/main/java/net/openhft/chronicle/map/ReplicatedChronicleMap.java
+1 -1
View File
@@ -910,7 +910,7 @@ public class ReplicatedChronicleMap<K, V, R> extends VanillaChronicleMap<K, V, R
TierCountersArea.segmentIndex(tierCountersAreaAddr));
final int tier = TierCountersArea.tier(tierCountersAreaAddr);
final long tierIndex = actualSegments +
(bulkIndex << log2TiersInBulk) + tierIndexOffsetWithinBulk + 1;
((long) bulkIndex << log2TiersInBulk) + tierIndexOffsetWithinBulk + 1;
context.initSegmentTier(tier, tierIndex, tierBaseAddr);
}