/*
* Copyright 2010 Benjamin Manes
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.googlecode.concurrentlinkedhashmap;
import com.googlecode.concurrentlinkedhashmap.ConcurrentLinkedHashMap.Builder;
import java.io.InvalidObjectException;
import java.io.ObjectInputStream;
import java.io.Serializable;
import java.lang.ref.WeakReference;
import java.util.AbstractCollection;
import java.util.AbstractMap;
import java.util.AbstractQueue;
import java.util.AbstractSet;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.HashMap;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Queue;
import java.util.Set;
import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.ConcurrentLinkedQueue;
import java.util.concurrent.ConcurrentMap;
import java.util.concurrent.atomic.AtomicIntegerArray;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;
/**
* A hash table supporting full concurrency of retrievals, adjustable expected
* concurrency for updates, and a maximum capacity to bound the map by. This
* implementation differs from {@link ConcurrentHashMap} in that it maintains a
* page replacement algorithm that is used to evict an entry when the map has
* exceeded its capacity. Unlike the Java Collections Framework , this
* map does not have a publicly visible constructor and instances are created
* through a {@link Builder}.
*
* An entry is evicted from the map when the weighted capacity exceeds
* a threshold determined by a {@link CapacityLimiter}. The default limiter
* bounds the map by its maximum weighted capacity . A {@link Weigher}
* instance determines how many units of capacity that a value consumes. The
* default weigher assigns each value a weight of 1 to bound the map by
* the total number of key-value pairs. A map that holds collections may choose
* to weigh values by the number of elements in the collection and bound the map
* by the total number of elements that it contains. A change to a value that
* modifies its weight requires that an update operation is performed on the
* map.
*
* An {@link EvictionListener} may be supplied for notification when an entry
* is evicted from the map. This listener is invoked on a caller's thread and
* will not block other threads from operating on the map. An implementation
* should be aware that the caller's thread will not expect long execution
* times or failures as a side effect of the listener being notified. Execution
* safety and a fast turn around time can be achieved by performing the
* operation asynchronously, such as by submitting a task to an
* {@link java.util.concurrent.ExecutorService}.
*
* The concurrency level determines the number of threads that can
* concurrently modify the table. Using a significantly higher or lower value
* than needed can waste space or lead to thread contention, but an estimate
* within an order of magnitude of the ideal value does not usually have a
* noticeable impact. Because placement in hash tables is essentially random,
* the actual concurrency will vary.
*
* This class and its views and iterators implement all of the
* optional methods of the {@link Map} and {@link Iterator}
* interfaces.
*
* Like {@link java.util.Hashtable} but unlike {@link HashMap}, this class
* does not allow null to be used as a key or value. Unlike
* {@link java.util.LinkedHashMap}, this class does not provide
* predictable iteration order.
*
* @author [email protected] (Ben Manes)
* @param the type of keys maintained by this map
* @param the type of mapped values
* @see http://code.google.com/p/concurrentlinkedhashmap/
*/
@ThreadSafe
public final class ConcurrentLinkedHashMap extends AbstractMap
implements ConcurrentMap, Serializable {
// This class performs a best-effort bounding of a ConcurrentHashMap using a
// page-replacement algorithm to determine which entries to evict when the
// capacity is exceeded. The map supports non-blocking reads and concurrent
// writes across different segments.
//
// The page replacement algorithm's data structures are kept casually
// consistent with the map. The ordering of writes to a segment is
// sequentially consistent, but the ordering of writes between different
// segments is not. An update to the map and recording of reads may not be
// immediately reflected on the algorithm's data structures. These structures
// are guarded by a lock and operations are applied in batches to avoid lock
// contention. The penalty of applying the batches is spread across threads
// so that the amortized cost is slightly higher than performing just the
// ConcurrentHashMap operation.
//
// This implementation uses a global write queue and multiple read queues to
// record a memento of the the additions, removals, and accesses that were
// performed on the map. The write queue is drained at the first opportunity
// and the read queues are drained after a write or when a queue exceeds its
// capacity threshold.
//
// The Least Recently Used page replacement algorithm was chosen due to its
// simplicity, high hit rate, and ability to be implemented with O(1) time
// complexity. A strict recency ordering is achieved by observing that each
// read queue is in sorted order and can be merged in O(n lg k) time so that
// the recency operations can be applied in the expected order.
/**
* Number of cache access operations that can be buffered per recency queue
* before the cache's recency ordering information is updated. This is used
* to avoid lock contention by recording a memento of reads and delaying a
* lock acquisition until the threshold is crossed or a mutation occurs.
*/
static final int RECENCY_THRESHOLD = 16;
/** The maximum number of segments to allow. */
static final int MAXIMUM_SEGMENTS = 1 << 16; // slightly conservative
/** The maximum weighted capacity of the map. */
static final int MAXIMUM_CAPACITY = 1 << 30;
/** The maximum weight of a value. */
static final int MAXIMUM_WEIGHT = 1 << 29;
/** A queue that discards all entries. */
static final Queue discardingQueue = new DiscardingQueue();
/** The backing data store holding the key-value associations. */
final ConcurrentMap data;
final int concurrencyLevel;
// These fields mirror the lock striping on ConcurrentHashMap to order
// the write operations. This allows the write queue to be consistent.
final int segmentMask;
final int segmentShift;
final Lock[] segmentLock;
// These fields provide support to bound the map by a maximum capacity.
@GuardedBy("evictionLock")
final Node sentinel;
@GuardedBy("evictionLock") // must write under lock
volatile int weightedSize;
@GuardedBy("evictionLock") // must write under lock
volatile int maximumWeightedSize;
final Lock evictionLock;
volatile int globalRecencyOrder;
final Weigher weigher;
final Queue writeQueue;
final CapacityLimiter capacityLimiter;
final AtomicIntegerArray recencyQueueLength;
final Queue[] recencyQueue;
// These fields provide support for notifying a listener.
final Queue listenerQueue;
final EvictionListener listener;
transient Set keySet;
transient Collection values;
transient Set> entrySet;
/**
* Creates an instance based on the builder's configuration.
*/
@SuppressWarnings({"unchecked", "cast"})
private ConcurrentLinkedHashMap(Builder builder) {
// The shift and mask used by ConcurrentHashMap to select the segment that
// a key is associated with. This avoids lock contention by ensuring that
// the lock selected by this decorator parallels the one used by the data
// store so that concurrent writes for different segments do not contend.
concurrencyLevel = Math.min(builder.concurrencyLevel, MAXIMUM_SEGMENTS);
int sshift = 0;
int segments = 1;
while (segments < concurrencyLevel) {
++sshift;
segments <<= 1;
}
segmentShift = 32 - sshift;
segmentMask = segments - 1;
segmentLock = new Lock[segments];
for (int i = 0; i < segments; i++) {
segmentLock[i] = new ReentrantLock();
}
// The data store and its maximum capacity
data = new ConcurrentHashMap(builder.initialCapacity, 0.75f, concurrencyLevel);
maximumWeightedSize = Math.min(builder.maximumWeightedCapacity, MAXIMUM_CAPACITY);
// The eviction support
sentinel = new Node();
weigher = builder.weigher;
evictionLock = new ReentrantLock();
globalRecencyOrder = Integer.MIN_VALUE;
capacityLimiter = builder.capacityLimiter;
writeQueue = new ConcurrentLinkedQueue();
// An even number of recency queues is chosen to simplify merging
int numberOfQueues = (segments % 2 == 0) ? segments : segments + 1;
recencyQueue = (Queue[]) new Queue[numberOfQueues];
recencyQueueLength = new AtomicIntegerArray(numberOfQueues);
for (int i = 0; i < numberOfQueues; i++) {
recencyQueue[i] = new ConcurrentLinkedQueue();
}
// The notification listener and event queue
listener = builder.listener;
listenerQueue = (listener == DiscardingListener.INSTANCE)
? (Queue) discardingQueue
: new ConcurrentLinkedQueue();
}
/**
* Asserts that the object is not null.
*/
static void checkNotNull(Object o, String message) {
if (o == null) {
throw new NullPointerException(message);
}
}
/* ---------------- Eviction Support -------------- */
/**
* Retrieves the maximum weighted capacity of the map.
*
* @return the maximum weighted capacity
*/
public int capacity() {
return maximumWeightedSize;
}
/**
* Sets the maximum weighted capacity of the map and eagerly evicts entries
* until it shrinks to the appropriate size.
*
* @param capacity the maximum weighted capacity of the map
* @throws IllegalArgumentException if the capacity is negative
*/
public void setCapacity(int capacity) {
if (capacity < 0) {
throw new IllegalArgumentException();
}
this.maximumWeightedSize = Math.min(capacity, MAXIMUM_CAPACITY);
evictWith(capacityLimiter);
}
/**
* Evicts entries from the map while it exceeds the capacity limiter's
* constraint or until the map is empty.
*
* @param capacityLimiter the algorithm to determine whether to evict an entry
* @throws NullPointerException if the capacity limiter is null
*/
public void evictWith(CapacityLimiter capacityLimiter) {
checkNotNull(capacityLimiter, "null capacity limiter");
evictionLock.lock();
try {
drainRecencyQueues();
drainWriteQueue();
evict(capacityLimiter);
} finally {
evictionLock.unlock();
}
notifyListener();
}
/**
* Determines whether the map has exceeded its capacity.
*
* @param capacityLimiter the algorithm to determine whether to evict an entry
* @return if the map has overflowed and an entry should be evicted
*/
boolean hasOverflowed(CapacityLimiter capacityLimiter) {
return capacityLimiter.hasExceededCapacity(this);
}
/**
* Evicts entries from the map while it exceeds the capacity and appends
* evicted entries to the listener queue for processing.
*
* @param capacityLimiter the algorithm to determine whether to evict an entry
*/
@GuardedBy("evictionLock")
void evict(CapacityLimiter capacityLimiter) {
// Attempts to evict entries from the map if it exceeds the maximum
// capacity. If the eviction fails due to a concurrent removal of the
// victim, that removal may cancel out the addition that triggered this
// eviction. The victim is eagerly unlinked before the removal task so
// that if an eviction is still required then a new victim will be chosen
// for removal.
while (hasOverflowed(capacityLimiter)) {
Node node = sentinel.next;
if (node == sentinel) {
// The map has evicted all of its entries and can offer no further aid
// in fulfilling the limiter's constraint. Note that for the weighted
// capacity limiter, pending operations will adjust the size to reflect
// the correct weight.
return;
}
// Notify the listener if the entry was evicted
if (data.remove(node.key, node)) {
listenerQueue.add(node);
}
decrementWeightFor(node);
node.remove();
}
}
/**
* Decrements the weighted size by the node's weight. This method should be
* called after the node has been removed from the data map, but it may be
* still referenced by concurrent operations.
*
* @param node the entry that was removed
*/
@GuardedBy("evictionLock")
void decrementWeightFor(Node node) {
if (weigher == Weighers.singleton()) {
weightedSize--;
} else {
// Decrements under the segment lock to ensure that a concurrent update
// to the node's weight has completed.
Lock lock = segmentLock[node.segment];
lock.lock();
try {
weightedSize -= node.weightedValue.weight;
} finally {
lock.unlock();
}
}
}
/**
* Determines the segment that the key is associated with. To avoid lock
* contention this should always parallel the segment selected by
* {@link ConcurrentHashMap} so that concurrent writes for different
* segments do not contend.
*
* @param key the entry's key
* @return the segment index
*/
int segmentFor(Object key) {
int hash = spread(key.hashCode());
return (hash >>> segmentShift) & segmentMask;
}
/**
* Applies a supplemental hash function to a given hashCode, which
* defends against poor quality hash functions. This is critical
* because ConcurrentHashMap uses power-of-two length hash tables,
* that otherwise encounter collisions for hashCodes that do not
* differ in lower or upper bits.
*
* @param hashCode the key's hashCode
* @return an improved hashCode
*/
static int spread(int hashCode) {
// Spread bits to regularize both segment and index locations,
// using variant of single-word Wang/Jenkins hash.
hashCode += (hashCode << 15) ^ 0xffffcd7d;
hashCode ^= (hashCode >>> 10);
hashCode += (hashCode << 3);
hashCode ^= (hashCode >>> 6);
hashCode += (hashCode << 2) + (hashCode << 14);
return hashCode ^ (hashCode >>> 16);
}
/**
* Adds the entry to the recency queue for a future update to the page
* replacement algorithm. An entry should be added to the queue when it is
* accessed on either a read or update operation. This aids the page
* replacement algorithm in choosing the best victim when an eviction is
* required.
*
* @param node the entry that was accessed
* @return true if the size exceeds its threshold and should be drained
*/
boolean addToRecencyQueue(Node node) {
// A recency queue is chosen by the thread's id so that recencies are evenly
// distributed between queues. This ensures that hot entries do not cause
// contention due to the threads trying to append to the same queue.
int index = (int) Thread.currentThread().getId() % recencyQueue.length;
// The recency's global order is acquired in a racy fashion as the increment
// is not atomic with the insertion. This means that concurrent reads can
// have the same ordering and the queues may be in a weakly sorted order.
int recencyOrder = globalRecencyOrder++;
recencyQueue[index].add(new RecencyReference(node, recencyOrder));
int buffered = recencyQueueLength.incrementAndGet(index);
return (buffered <= RECENCY_THRESHOLD);
}
/**
* Attempts to acquire the eviction lock and apply pending updates to the
* eviction algorithm.
*
* @param onlyIfWrites attempts to drain the eviction queues only if there
* are pending writes
*/
void tryToDrainEvictionQueues(boolean onlyIfWrites) {
if (onlyIfWrites && writeQueue.isEmpty()) {
return;
}
if (evictionLock.tryLock()) {
try {
drainRecencyQueues();
drainWriteQueue();
} finally {
evictionLock.unlock();
}
}
}
/**
* Applies the pending updates to the list.
*/
@GuardedBy("evictionLock")
void drainWriteQueue() {
Runnable task;
while ((task = writeQueue.poll()) != null) {
task.run();
}
}
/**
* Drains the recency queues and applies the pending reorderings.
*/
@GuardedBy("evictionLock")
void drainRecencyQueues() {
// A strict recency ordering is achieved by observing that each queue
// contains the recencies in weakly sorted order. The queues can be merged
// into a single weakly sorted list in O(n lg k) time, where n is the number
// of recency elements and k is the number of recency queues.
Queue> lists = new LinkedList>();
for (int i = 0; i < recencyQueue.length; i = i + 2) {
lists.add(moveRecenciesIntoMergedList(i, i + 1));
}
while (lists.size() > 1) {
lists.add(mergeRecencyLists(lists.poll(), lists.poll()));
}
applyRecencyReorderings(lists.peek());
}
/**
* Merges two recency queues into a sorted list.
*
* @param index1 an index of a recency queue to drain
* @param index2 an index of a recency queue to drain
* @return a sorted list of the merged recency queues
*/
@GuardedBy("evictionLock")
List moveRecenciesIntoMergedList(int index1, int index2) {
// While a queue is being drained it may be concurrently appended to. The
// number of elements removed are tracked so that the length can be
// decremented by the delta rather than set to zero.
int removedFromQueue1 = 0;
int removedFromQueue2 = 0;
// To avoid a growth penalty, the initial capacity of the merged list is
// the expected size of the two queues plus additional slack due to the
// possibility of concurrent additions to the queues.
int initialCapacity = 3 * RECENCY_THRESHOLD;
List result = new ArrayList(initialCapacity);
// The queues are drained and merged in recency order. As each queue is
// itself weakly ordered by recency, this is performed in O(n) time. To
// avoid unnecessary CAS operations, care is taken so that only a single
// queue operation is required per recency while draining.
Queue queue1 = recencyQueue[index1];
Queue queue2 = recencyQueue[index2];
RecencyReference recency1 = queue1.poll();
RecencyReference recency2 = queue2.poll();
for (;;) {
if (recency1 == null) {
if (recency2 == null) {
break;
}
result.add(recency2);
removedFromQueue2 += 1 + moveRecenciesToList(queue2, result);
break;
} else if (recency2 == null) {
result.add(recency1);
removedFromQueue1 += 1 + moveRecenciesToList(queue1, result);
break;
}
if (recency1.recencyOrder < recency2.recencyOrder) {
removedFromQueue1++;
result.add(recency1);
recency1 = queue1.poll();
} else {
removedFromQueue2++;
result.add(recency2);
recency2 = queue2.poll();
}
}
recencyQueueLength.addAndGet(index1, -removedFromQueue1);
recencyQueueLength.addAndGet(index2, -removedFromQueue2);
return result;
}
/**
* Moves the recencies in the queue to the the output list.
*
* @param queue the recency queue to remove from
* @param output the list to append the recencies to
* @return the number of recencies removed from the queue
*/
@GuardedBy("evictionLock")
int moveRecenciesToList(Queue queue, List output) {
int removed = 0;
RecencyReference recency;
while ((recency = queue.poll()) != null) {
output.add(recency);
removed++;
}
return removed;
}
/**
* Merges the intermediate recency lists into a sorted list.
*
* @param list1 an intermediate sorted list of recencies
* @param list2 an intermediate sorted list of recencies
* @return a sorted list of the merged recency lists
*/
@GuardedBy("evictionLock")
List mergeRecencyLists(
List list1, List list2) {
if (list1.isEmpty()) {
return list2;
} else if (list2.isEmpty()) {
return list1;
}
// The lists are merged by walking the arrays and maintaining the current
// index. This avoids a resize penalty if instead the first element was
// removed and maintains good cache locality of an array vs a linked list
// implementation. As each list is itself weakly ordered by recency, this
// is performed in O(n) time.
List result = new ArrayList(list1.size() + list2.size());
int index1 = 0;
int index2 = 0;
for (;;) {
if (index1 == list1.size()) {
while (index2 != list2.size()) {
result.add(list2.get(index2));
index2++;
}
return result;
} else if (index2 == list2.size()) {
while (index1 != list1.size()) {
result.add(list1.get(index1));
index1++;
}
return result;
}
RecencyReference recency1 = list1.get(index1);
RecencyReference recency2 = list2.get(index2);
if (recency1.recencyOrder < recency2.recencyOrder) {
result.add(recency1);
index1++;
} else {
result.add(recency2);
index2++;
}
}
}
/**
* Applies the pending recency reorderings to the page replacement policy.
*
* @param recencies the ordered list of the pending recency operations
*/
@GuardedBy("evictionLock")
void applyRecencyReorderings(List recencies) {
for (int i = 0; i < recencies.size(); i++) {
RecencyReference recency = recencies.get(i);
// An entry may be in the recency queue despite it having been previously
// removed. This can occur when the entry was concurrently read while a
// writer is removing it from the segment. If the entry was garbage
// collected or no longer linked then it does not need to be processed.
Node node = recency.get();
if ((node != null) && node.isLinked()) {
node.moveToTail();
}
}
}
/**
* Performs the post-processing of eviction events.
*
* @param onlyIfWrites attempts the drain the eviction queues only if there
* are pending writes
*/
void processEvents(boolean onlyIfWrites) {
tryToDrainEvictionQueues(onlyIfWrites);
notifyListener();
}
/**
* Notifies the listener of entries that were evicted.
*/
void notifyListener() {
Node node;
while ((node = listenerQueue.poll()) != null) {
listener.onEviction(node.key, node.weightedValue.value);
}
}
/**
* A reference to a list node with its recency order.
*/
final class RecencyReference extends WeakReference {
final int recencyOrder;
public RecencyReference(Node node, int recencyOrder) {
super(node);
this.recencyOrder = recencyOrder;
}
}
/**
* Adds a node to the list and evicts an entry on overflow.
*/
final class AddTask implements Runnable {
final Node node;
final int weight;
AddTask(Node node, int weight) {
this.weight = weight;
this.node = node;
}
@GuardedBy("evictionLock")
public void run() {
weightedSize += weight;
node.appendToTail();
evict(capacityLimiter);
}
}
/**
* Removes a node from the list.
*/
final class RemovalTask implements Runnable {
final Node node;
RemovalTask(Node node) {
this.node = node;
}
@GuardedBy("evictionLock")
public void run() {
if (node.isLinked()) {
weightedSize -= node.weightedValue.weight;
node.remove();
}
}
}
/**
* Updates the weighted size and evicts an entry on overflow.
*/
final class UpdateTask implements Runnable {
final int weightDifference;
public UpdateTask(int weightDifference) {
this.weightDifference = weightDifference;
}
@GuardedBy("evictionLock")
public void run() {
weightedSize += weightDifference;
evict(capacityLimiter);
}
}
/* ---------------- Concurrent Map Support -------------- */
@Override
public boolean isEmpty() {
return data.isEmpty();
}
@Override
public int size() {
return data.size();
}
/**
* Returns the weighted size of this map.
*
* @return the combined weight of the values in this map
*/
public int weightedSize() {
return weightedSize;
}
@Override
public void clear() {
// The alternative is to iterate through the keys and call #remove(), which
// adds unnecessary contention on the eviction lock and the write queue.
// Instead the table is walked to conditionally remove the nodes and the
// linkage fields are null'ed out to reduce GC pressure.
evictionLock.lock();
try {
drainWriteQueue();
Node current = sentinel.next;
while (current != sentinel) {
data.remove(current.key, current);
decrementWeightFor(current);
current = current.next;
current.prev.prev = null;
current.prev.next = null;
}
sentinel.next = sentinel;
sentinel.prev = sentinel;
// Eagerly discards all of the stale recency reorderings
for (int i = 0; i < recencyQueue.length; i++) {
Queue queue = recencyQueue[i];
int removed = 0;
while (queue.poll() != null) {
removed++;
}
recencyQueueLength.addAndGet(i, -removed);
}
} finally {
evictionLock.unlock();
}
}
@Override
public boolean containsKey(Object key) {
checkNotNull(key, "null key");
processEvents(true);
return data.containsKey(key);
}
@Override
public boolean containsValue(Object value) {
checkNotNull(value, "null value");
processEvents(true);
for (Node node : data.values()) {
if (node.weightedValue.value.equals(value)) {
return true;
}
}
return false;
}
@Override
public V get(Object key) {
checkNotNull(key, "null key");
// As reads are the common case they should be performed lock-free to avoid
// blocking other readers. If the entry was found then a recency reorder
// operation is scheduled on the queue to be applied sometime in the
// future. The draining of the queues should be delayed until either the
// recency threshold has been exceeded or if there is a pending write.
V value = null;
boolean delayReorder = true;
Node node = data.get(key);
if (node != null) {
delayReorder = addToRecencyQueue(node);
value = node.weightedValue.value;
}
processEvents(delayReorder);
return value;
}
@Override
public V put(K key, V value) {
return put(key, value, false);
}
public V putIfAbsent(K key, V value) {
return put(key, value, true);
}
/**
* Adds a node to the list and the data store. If an existing node is found,
* then its value is updated if allowed.
*
* @param key key with which the specified value is to be associated
* @param value value to be associated with the specified key
* @param onlyIfAbsent a write is performed only if the key is not already
* associated with a value
* @return the prior value in the data store or null if no mapping was found
*/
V put(K key, V value, boolean onlyIfAbsent) {
checkNotNull(key, "null key");
checkNotNull(value, "null value");
// Per-segment write ordering is required to ensure that the map and write
// queue are consistently ordered. This is required because if a removal
// occurs immediately after the put, the concurrent insertion into the queue
// might allow the removal to be processed first which would corrupt the
// capacity constraint. The locking is kept slim and if the insertion fails
// then the operation is treated as a read so that a recency reordering
// operation is scheduled.
Node prior;
V oldValue = null;
int weightedDifference = 0;
boolean delayReorder = true;
int segment = segmentFor(key);
Lock lock = segmentLock[segment];
int weight = weigher.weightOf(value);
WeightedValue weightedValue = new WeightedValue(value, weight);
Node node = new Node(key, weightedValue, segment);
// maintain per-segment write ordering
lock.lock();
try {
prior = data.putIfAbsent(node.key, node);
if (prior == null) {
writeQueue.add(new AddTask(node, weight));
} else if (onlyIfAbsent) {
oldValue = prior.weightedValue.value;
} else {
WeightedValue oldWeightedValue = prior.weightedValue;
weightedDifference = weight - oldWeightedValue.weight;
prior.weightedValue = weightedValue;
oldValue = oldWeightedValue.value;
}
} finally {
lock.unlock();
}
// perform outside of lock
if (prior != null) {
if (weightedDifference != 0) {
writeQueue.add(new UpdateTask(weightedDifference));
}
delayReorder = addToRecencyQueue(prior);
}
processEvents(delayReorder);
return oldValue;
}
@Override
public V remove(Object key) {
checkNotNull(key, "null key");
// Per-segment write ordering is required to ensure that the map and write
// queue are consistently ordered. The ordering of the ConcurrentHashMap's
// insertion and removal for an entry is handled by its segment lock. The
// insertion into the write queue after #putIfAbsent()'s is ensured through
// this lock. This behavior allows shrinking the lock's critical section.
Node node;
V value = null;
int segment = segmentFor(key);
Lock lock = segmentLock[segment];
node = data.remove(key);
if (node != null) {
value = node.weightedValue.value;
Runnable task = new RemovalTask(node);
// maintain per-segment write ordering
lock.lock();
try {
writeQueue.add(task);
} finally {
lock.unlock();
}
}
// perform outside of lock
processEvents(true);
return value;
}
public boolean remove(Object key, Object value) {
checkNotNull(key, "null key");
checkNotNull(value, "null value");
// Per-segment write ordering is required to ensure that the map and write
// queue are consistently ordered. The lock enforces that other mutations
// completed, the read value isn't stale, and that the removal is ordered.
Node node;
boolean removed = false;
int segment = segmentFor(key);
Lock lock = segmentLock[segment];
// maintain per-segment write ordering
lock.lock();
try {
node = data.get(key);
if ((node != null) && node.weightedValue.value.equals(value)) {
writeQueue.add(new RemovalTask(node));
data.remove(key);
removed = true;
}
} finally {
lock.unlock();
}
// perform outside of lock
processEvents(true);
return removed;
}
public V replace(K key, V value) {
checkNotNull(key, "null key");
checkNotNull(value, "null value");
// Per-segment write ordering is required to ensure that the map and write
// queue are consistently ordered. The lock enforces that other mutations
// completed, the read value isn't stale, and that the replacement is
// ordered.
Node node;
V prior = null;
int weightedDifference = 0;
boolean delayReorder = false;
int segment = segmentFor(key);
Lock lock = segmentLock[segment];
int weight = weigher.weightOf(value);
WeightedValue weightedValue = new WeightedValue(value, weight);
// maintain per-segment write ordering
lock.lock();
try {
node = data.get(key);
if (node != null) {
WeightedValue oldWeightedValue = node.weightedValue;
weightedDifference = weight - oldWeightedValue.weight;
node.weightedValue = weightedValue;
prior = oldWeightedValue.value;
}
} finally {
lock.unlock();
}
// perform outside of lock
if (node != null) {
if (weightedDifference != 0) {
writeQueue.add(new UpdateTask(weightedDifference));
}
delayReorder = addToRecencyQueue(node);
}
processEvents(delayReorder);
return prior;
}
public boolean replace(K key, V oldValue, V newValue) {
checkNotNull(key, "null key");
checkNotNull(oldValue, "null oldValue");
checkNotNull(newValue, "null newValue");
// Per-segment write ordering is required to ensure that the map and write
// queue are consistently ordered. The lock enforces that other mutations
// completed, the read value isn't stale, and that the replacement is
// ordered.
Node node;
boolean delayReorder = false;
int segment = segmentFor(key);
Lock lock = segmentLock[segment];
int weight = weigher.weightOf(newValue);
WeightedValue oldWeightedValue = null;
WeightedValue newWeightedValue = new WeightedValue(newValue, weight);
// maintain per-segment write ordering
lock.lock();
try {
node = data.get(key);
if (node != null) {
WeightedValue weightedValue = node.weightedValue;
if (oldValue.equals(weightedValue.value)) {
node.weightedValue = newWeightedValue;
oldWeightedValue = weightedValue;
}
}
} finally {
lock.unlock();
}
// perform outside of lock
if (node != null) {
if (oldWeightedValue != null) {
int weightedDifference = weight - oldWeightedValue.weight;
writeQueue.add(new UpdateTask(weightedDifference));
}
delayReorder = addToRecencyQueue(node);
}
processEvents(delayReorder);
return (oldWeightedValue != null);
}
@Override
public Set keySet() {
Set ks = keySet;
return (ks != null) ? ks : (keySet = new KeySet());
}
@Override
public Collection values() {
Collection vs = values;
return (vs != null) ? vs : (values = new Values());
}
@Override
public Set> entrySet() {
Set> es = entrySet;
return (es != null) ? es : (entrySet = new EntrySet());
}
/**
* A value and its weight.
*/
static final class WeightedValue {
final int weight;
final V value;
public WeightedValue(V value, int weight) {
if ((weight < 1) || (weight > MAXIMUM_WEIGHT)) {
throw new IllegalArgumentException("invalid weight");
}
this.weight = weight;
this.value = value;
}
}
/**
* An entry that contains the key, the weighted value, the segment index, and
* linkage pointers on the page-replacement algorithm's data structures.
*/
final class Node {
final K key;
@GuardedBy("segmentLock") // must write under lock
volatile WeightedValue weightedValue;
/** The segment that the node is associated with. */
final int segment;
/**
* A link to the entry that was less recently used or the sentinel if this
* entry is the least recent.
*/
@GuardedBy("evictionLock")
Node prev;
/**
* A link to the entry that was more recently used or the sentinel if this
* entry is the most recent.
*/
@GuardedBy("evictionLock")
Node next;
/** Creates a new sentinel node. */
Node() {
this.segment = -1;
this.key = null;
this.prev = this;
this.next = this;
}
/** Creates a new, unlinked node. */
Node(K key, WeightedValue weightedValue, int segment) {
this.weightedValue = weightedValue;
this.segment = segment;
this.key = key;
this.prev = null;
this.next = null;
}
/** Removes the node from the list. */
@GuardedBy("evictionLock")
void remove() {
prev.next = next;
next.prev = prev;
// null to reduce GC pressure
prev = next = null;
}
/** Appends the node to the tail of the list. */
@GuardedBy("evictionLock")
void appendToTail() {
prev = sentinel.prev;
next = sentinel;
sentinel.prev.next = this;
sentinel.prev = this;
}
/** Moves the node to the tail of the list. */
@GuardedBy("evictionLock")
void moveToTail() {
if (next != sentinel) {
prev.next = next;
next.prev = prev;
appendToTail();
}
}
/** Whether the node is linked on the list. */
@GuardedBy("evictionLock")
boolean isLinked() {
return (next != null);
}
}
/**
* An adapter to safely externalize the keys.
*/
final class KeySet extends AbstractSet {
final ConcurrentLinkedHashMap map = ConcurrentLinkedHashMap.this;
@Override
public int size() {
return map.size();
}
@Override
public void clear() {
map.clear();
}
@Override
public Iterator iterator() {
return new KeyIterator();
}
@Override
public boolean contains(Object obj) {
return containsKey(obj);
}
@Override
public boolean remove(Object obj) {
return (map.remove(obj) != null);
}
@Override
public Object[] toArray() {
return map.data.keySet().toArray();
}
@Override
public T[] toArray(T[] array) {
return map.data.keySet().toArray(array);
}
}
/**
* An adapter to safely externalize the key iterator.
*/
final class KeyIterator implements Iterator {
final EntryIterator iterator = new EntryIterator(data.values().iterator());
public boolean hasNext() {
return iterator.hasNext();
}
public K next() {
return iterator.next().getKey();
}
public void remove() {
iterator.remove();
}
}
/**
* An adapter to safely externalize the values.
*/
final class Values extends AbstractCollection {
@Override
public int size() {
return ConcurrentLinkedHashMap.this.size();
}
@Override
public void clear() {
ConcurrentLinkedHashMap.this.clear();
}
@Override
public Iterator iterator() {
return new ValueIterator();
}
@Override
public boolean contains(Object o) {
return containsValue(o);
}
@Override
public Object[] toArray() {
Collection values = new ArrayList(size());
for (V value : this) {
values.add(value);
}
return values.toArray();
}
@Override
public T[] toArray(T[] array) {
Collection values = new ArrayList(size());
for (V value : this) {
values.add(value);
}
return values.toArray(array);
}
}
/**
* An adapter to safely externalize the value iterator.
*/
final class ValueIterator implements Iterator {
final EntryIterator iterator = new EntryIterator(data.values().iterator());
public boolean hasNext() {
return iterator.hasNext();
}
public V next() {
return iterator.next().getValue();
}
public void remove() {
iterator.remove();
}
}
/**
* An adapter to safely externalize the entries.
*/
final class EntrySet extends AbstractSet> {
final ConcurrentLinkedHashMap map = ConcurrentLinkedHashMap.this;
@Override
public int size() {
return map.size();
}
@Override
public void clear() {
map.clear();
}
@Override
public Iterator> iterator() {
return new EntryIterator(map.data.values().iterator());
}
@Override
public boolean contains(Object obj) {
if (!(obj instanceof Entry)) {
return false;
}
Entry entry = (Entry) obj;
Node node = map.data.get(entry.getKey());
return (node != null) && (node.weightedValue.value.equals(entry.getValue()));
}
@Override
public boolean add(Entry entry) {
return (map.putIfAbsent(entry.getKey(), entry.getValue()) == null);
}
@Override
public boolean remove(Object obj) {
if (!(obj instanceof Entry)) {
return false;
}
Entry entry = (Entry) obj;
return map.remove(entry.getKey(), entry.getValue());
}
@Override
public Object[] toArray() {
Collection> entries = new ArrayList>(size());
for (Entry entry : this) {
entries.add(new SimpleEntry(entry));
}
return entries.toArray();
}
@Override
public T[] toArray(T[] array) {
Collection> entries = new ArrayList>(size());
for (Entry entry : this) {
entries.add(new SimpleEntry(entry));
}
return entries.toArray(array);
}
}
/**
* An adapter to safely externalize the entry iterator.
*/
final class EntryIterator implements Iterator> {
final Iterator iterator;
Node current;
public EntryIterator(Iterator iterator) {
this.iterator = iterator;
}
public boolean hasNext() {
return iterator.hasNext();
}
public Entry next() {
current = iterator.next();
return new WriteThroughEntry(current);
}
public void remove() {
if (current == null) {
throw new IllegalStateException();
}
ConcurrentLinkedHashMap.this.remove(current.key, current.weightedValue.value);
current = null;
}
}
/**
* An entry that allows updates to write through to the map.
*/
final class WriteThroughEntry extends SimpleEntry {
static final long serialVersionUID = 1;
public WriteThroughEntry(Node node) {
super(node.key, node.weightedValue.value);
}
@Override
public V setValue(V value) {
put(getKey(), value);
return super.setValue(value);
}
Object writeReplace() {
return new SimpleEntry(this);
}
}
/**
* This duplicates {@link java.util.AbstractMap.SimpleEntry} (public in JDK-6).
*/
static class SimpleEntry implements Entry, Serializable {
private static final long serialVersionUID = -8499721149061103585L;
private final K key;
private V value;
public SimpleEntry(K key, V value) {
this.key = key;
this.value = value;
}
public SimpleEntry(Entry e) {
this.key = e.getKey();
this.value = e.getValue();
}
public K getKey() {
return key;
}
public V getValue() {
return value;
}
public V setValue(V value) {
V oldValue = this.value;
this.value = value;
return oldValue;
}
@Override
public boolean equals(Object o) {
if (!(o instanceof Map.Entry)) {
return false;
}
Entry e = (Map.Entry) o;
return eq(key, e.getKey()) && eq(value, e.getValue());
}
@Override
public int hashCode() {
return ((key == null) ? 0 : key.hashCode()) ^
((value == null) ? 0 : value.hashCode());
}
@Override
public String toString() {
return key + "=" + value;
}
private static boolean eq(Object o1, Object o2) {
return (o1 == null) ? (o2 == null) : o1.equals(o2);
}
}
/**
* A queue that discards all additions and is always empty.
*/
static final class DiscardingQueue extends AbstractQueue {
@Override public boolean add(E e) { return true; }
public boolean offer(E e) { return true; }
public E poll() { return null; }
public E peek() { return null; }
@Override public int size() { return 0; }
@Override public Iterator iterator() { return Collections.emptyList().iterator(); }
}
/**
* A listener that ignores all notifications.
*/
enum DiscardingListener implements EvictionListener {
INSTANCE;
public void onEviction(Object key, Object value) {}
}
/**
* A capacity limiter that bounds the map by its maximum weighted size.
*/
enum WeightedCapacityLimiter implements CapacityLimiter {
INSTANCE;
@GuardedBy("evictionLock")
public boolean hasExceededCapacity(ConcurrentLinkedHashMap map) {
return map.weightedSize() > map.capacity();
}
}
/* ---------------- Serialization Support -------------- */
static final long serialVersionUID = 1;
Object writeReplace() {
return new SerializationProxy(this);
}
void readObject(ObjectInputStream stream) throws InvalidObjectException {
throw new InvalidObjectException("Proxy required");
}
/**
* A proxy that is serialized instead of the map. The page-replacement
* algorithm's data structures are not serialized so the deserialized
* instance contains only the entries. This is acceptable as caches hold
* transient data that is recomputable and serialization would tend to be
* used as a fast warm-up process.
*/
static final class SerializationProxy implements Serializable {
final EvictionListener listener;
final CapacityLimiter capacityLimiter;
final Weigher weigher;
final int concurrencyLevel;
final Map data;
final int capacity;
SerializationProxy(ConcurrentLinkedHashMap map) {
concurrencyLevel = map.concurrencyLevel;
capacityLimiter = map.capacityLimiter;
capacity = map.maximumWeightedSize;
data = new HashMap(map);
listener = map.listener;
weigher = map.weigher;
}
Object readResolve() {
ConcurrentLinkedHashMap map = new Builder()
.concurrencyLevel(concurrencyLevel)
.maximumWeightedCapacity(capacity)
.capacityLimiter(capacityLimiter)
.listener(listener)
.weigher(weigher)
.build();
map.putAll(data);
return map;
}
static final long serialVersionUID = 1;
}
/* ---------------- Builder -------------- */
/**
* A builder that creates {@link ConcurrentLinkedHashMap} instances. It
* provides a flexible approach for constructing customized instances with
* a named parameter syntax. It can be used in the following manner:
*
*
* {@code
* // a cache of the groups that a user belongs to
* ConcurrentMap> groups = new Builder>()
* .weigher(Weighers.set())
* .maximumWeightedCapacity(5000)
* .build();
* }
*
*/
public static final class Builder {
static final int DEFAULT_INITIAL_CAPACITY = 16;
static final int DEFAULT_CONCURRENCY_LEVEL = 16;
CapacityLimiter capacityLimiter;
EvictionListener listener;
Weigher weigher;
int maximumWeightedCapacity;
int concurrencyLevel;
int initialCapacity;
@SuppressWarnings("unchecked")
public Builder() {
maximumWeightedCapacity = -1;
weigher = Weighers.singleton();
initialCapacity = DEFAULT_INITIAL_CAPACITY;
concurrencyLevel = DEFAULT_CONCURRENCY_LEVEL;
capacityLimiter = WeightedCapacityLimiter.INSTANCE;
listener = (EvictionListener) DiscardingListener.INSTANCE;
}
/**
* Specifies the initial capacity of the hash table (default 16 ).
* This is the number of key-value pairs that the hash table can hold
* before a resize operation is required.
*
* @param initialCapacity the initial capacity used to size the hash table
* to accommodate this many entries.
* @throws IllegalArgumentException if the initialCapacity is negative
*/
public Builder initialCapacity(int initialCapacity) {
if (initialCapacity < 0) {
throw new IllegalArgumentException();
}
this.initialCapacity = initialCapacity;
return this;
}
/**
* Specifies the maximum weighted capacity to coerces the map to and may
* exceed it temporarily.
*
* @param maximumWeightedCapacity the weighted threshold to bound the map
* by
* @throws IllegalArgumentException if the maximumWeightedCapacity is
* negative
*/
public Builder maximumWeightedCapacity(int maximumWeightedCapacity) {
if (maximumWeightedCapacity < 0) {
throw new IllegalArgumentException();
}
this.maximumWeightedCapacity = maximumWeightedCapacity;
return this;
}
/**
* Specifies the estimated number of concurrently updating threads. The
* implementation performs internal sizing to try to accommodate this many
* threads (default 16 ).
*
* @param concurrencyLevel the estimated number of concurrently updating
* threads
* @throws IllegalArgumentException if the concurrencyLevel is less than or
* equal to zero
*/
public Builder concurrencyLevel(int concurrencyLevel) {
if (concurrencyLevel <= 0) {
throw new IllegalArgumentException();
}
this.concurrencyLevel = concurrencyLevel;
return this;
}
/**
* Specifies an optional listener that is registered for notification when
* an entry is evicted.
*
* @param listener the object to forward evicted entries to
* @throws NullPointerException if the listener is null
*/
public Builder listener(EvictionListener listener) {
checkNotNull(listener, null);
this.listener = listener;
return this;
}
/**
* Specifies an algorithm to determine how many the units of capacity a
* value consumes. The default algorithm bounds the map by the number of
* key-value pairs by giving each entry a weight of 1 .
*
* @param weigher the algorithm to determine a value's weight
* @throws NullPointerException if the weigher is null
*/
public Builder weigher(Weigher weigher) {
checkNotNull(weigher, null);
this.weigher = weigher;
return this;
}
/**
* Specifies an algorithm to determine if the maximum capacity has been
* exceeded and that an entry should be evicted from the map. The default
* algorithm bounds the map by the maximum weighted capacity. The evaluation
* of whether the map has exceeded its capacity is performed after an
* insertion or update operation.
*
* @param capacityLimiter the algorithm to determine whether to evict an
* entry
* @throws NullPointerException if the capacity limiter is null
*/
public Builder capacityLimiter(CapacityLimiter capacityLimiter) {
checkNotNull(capacityLimiter, null);
this.capacityLimiter = capacityLimiter;
return this;
}
/**
* Creates a new {@link ConcurrentLinkedHashMap} instance.
*
* @throws IllegalStateException if the maximum weighted capacity was
* not set
*/
public ConcurrentLinkedHashMap build() {
if (maximumWeightedCapacity < 0) {
throw new IllegalStateException();
}
return new ConcurrentLinkedHashMap(this);
}
}
}
