make cache pointer arrays large enough to match hash

[org.ibex.util.git] / src / org / ibex / util / Cache.java

diff --git a/src/org/ibex/util/Cache.java b/src/org/ibex/util/Cache.java
index 3662cf3..dc903b8 100644 (file)
--- a/src/org/ibex/util/Cache.java
+++ b/src/org/ibex/util/Cache.java
@@ -23,8 +23,8 @@ public class Cache extends Basket.HashMap {
     public Cache(int maxSize, boolean accessOrder) {
         super(maxSize * 2, 0.75F);
 
-        prev = new int[maxSize];
-        next = new int[maxSize];
+        prev = new int[entries.length];
+        next = new int[entries.length];
         for (int i=0; i < maxSize; i++) { prev[i] = next[i] = -1; }
 
         this.maxSize = maxSize;