DeltaBaseCache getDeltaBaseCache() { if (baseCache == null) baseCache = new DeltaBaseCache(this); return baseCache; }
void put(DfsStreamKey key, long offset, int objectType, byte[] data) { if (data.length > maxByteCount) return; // Too large to cache. curByteCount += data.length; releaseMemory(); int tableIdx = hash(offset); Entry e = new Entry(key, offset, objectType, data); e.tableNext = table[tableIdx]; table[tableIdx] = e; lruPushHead(e); }
private void moveToHead(Entry e) { if (e != lruHead) { lruRemove(e); lruPushHead(e); } }
private void releaseMemory() { while (curByteCount > maxByteCount && lruTail != null) { Entry e = lruTail; curByteCount -= e.data.length; lruRemove(e); removeFromTable(e); } }
Entry get(DfsStreamKey key, long position) { Entry e = table[hash(position)]; for (; e != null; e = e.tableNext) { if (e.offset == position && key.equals(e.pack)) { moveToHead(e); return e; } } return null; }
break SEARCH; DeltaBaseCache.Entry e = ctx.getDeltaBaseCache().get(key, base); if (e != null) { type = e.type; break SEARCH; DeltaBaseCache.Entry e = ctx.getDeltaBaseCache().get(key, base); if (e != null) { type = e.type; cached = false; else if (delta.next == null) ctx.getDeltaBaseCache().put(key, delta.basePos, type, data);
private void removeFromTable(Entry e) { int tableIdx = hash(e.offset); Entry p = table[tableIdx]; if (p == e) { table[tableIdx] = e.tableNext; return; } for (; p != null; p = p.tableNext) { if (p.tableNext == e) { p.tableNext = e.tableNext; return; } } throw new IllegalStateException(String.format( "entry for %s:%d not in table", //$NON-NLS-1$ e.pack, Long.valueOf(e.offset))); }
private void releaseMemory() { while (curByteCount > maxByteCount && lruTail != null) { Entry e = lruTail; curByteCount -= e.data.length; lruRemove(e); removeFromTable(e); } }
Entry get(DfsPackKey key, long position) { Entry e = table[hash(position)]; for (; e != null; e = e.tableNext) { if (e.offset == position && key.equals(e.pack)) { moveToHead(e); return e; } } return null; }
break SEARCH; DeltaBaseCache.Entry e = ctx.getDeltaBaseCache().get(key, base); if (e != null) { type = e.type; break SEARCH; DeltaBaseCache.Entry e = ctx.getDeltaBaseCache().get(key, base); if (e != null) { type = e.type; cached = false; else if (delta.next == null) ctx.getDeltaBaseCache().put(key, delta.basePos, type, data);
private void removeFromTable(Entry e) { int tableIdx = hash(e.offset); Entry p = table[tableIdx]; if (p == e) { table[tableIdx] = e.tableNext; return; } for (; p != null; p = p.tableNext) { if (p.tableNext == e) { p.tableNext = e.tableNext; return; } } throw new IllegalStateException(String.format( "entry for %s:%d not in table", //$NON-NLS-1$ e.pack, Long.valueOf(e.offset))); }
void put(DfsPackKey key, long offset, int objectType, byte[] data) { if (data.length > maxByteCount) return; // Too large to cache. curByteCount += data.length; releaseMemory(); int tableIdx = hash(offset); Entry e = new Entry(key, offset, objectType, data); e.tableNext = table[tableIdx]; table[tableIdx] = e; lruPushHead(e); }
private void moveToHead(Entry e) { if (e != lruHead) { lruRemove(e); lruPushHead(e); } }
private void releaseMemory() { while (curByteCount > maxByteCount && lruTail != null) { Entry e = lruTail; curByteCount -= e.data.length; lruRemove(e); removeFromTable(e); } }
Entry get(DfsStreamKey key, long position) { Entry e = table[hash(position)]; for (; e != null; e = e.tableNext) { if (e.offset == position && key.equals(e.pack)) { moveToHead(e); return e; } } return null; }
break SEARCH; DeltaBaseCache.Entry e = ctx.getDeltaBaseCache().get(key, base); if (e != null) { type = e.type; break SEARCH; DeltaBaseCache.Entry e = ctx.getDeltaBaseCache().get(key, base); if (e != null) { type = e.type; cached = false; else if (delta.next == null) ctx.getDeltaBaseCache().put(key, delta.basePos, type, data);
DeltaBaseCache getDeltaBaseCache() { if (baseCache == null) baseCache = new DeltaBaseCache(this); return baseCache; }
private void removeFromTable(Entry e) { int tableIdx = hash(e.offset); Entry p = table[tableIdx]; if (p == e) { table[tableIdx] = e.tableNext; return; } for (; p != null; p = p.tableNext) { if (p.tableNext == e) { p.tableNext = e.tableNext; return; } } throw new IllegalStateException(String.format( "entry for %s:%d not in table", //$NON-NLS-1$ e.pack, Long.valueOf(e.offset))); }
void put(DfsStreamKey key, long offset, int objectType, byte[] data) { if (data.length > maxByteCount) return; // Too large to cache. curByteCount += data.length; releaseMemory(); int tableIdx = hash(offset); Entry e = new Entry(key, offset, objectType, data); e.tableNext = table[tableIdx]; table[tableIdx] = e; lruPushHead(e); }
private void moveToHead(Entry e) { if (e != lruHead) { lruRemove(e); lruPushHead(e); } }