--- jsr166/src/jsr166e/ConcurrentHashMapV8.java 2012/08/13 18:25:53 1.55 +++ jsr166/src/jsr166e/ConcurrentHashMapV8.java 2013/02/11 20:43:59 1.97 @@ -5,9 +5,6 @@ */ package jsr166e; -import jsr166e.LongAdder; -import jsr166e.ForkJoinPool; -import jsr166e.ForkJoinTask; import java.util.Comparator; import java.util.Arrays; @@ -24,11 +21,9 @@ import java.util.Enumeration; import java.util.ConcurrentModificationException; import java.util.NoSuchElementException; import java.util.concurrent.ConcurrentMap; -import java.util.concurrent.ThreadLocalRandom; -import java.util.concurrent.locks.LockSupport; import java.util.concurrent.locks.AbstractQueuedSynchronizer; +import java.util.concurrent.atomic.AtomicInteger; import java.util.concurrent.atomic.AtomicReference; - import java.io.Serializable; /** @@ -43,25 +38,28 @@ import java.io.Serializable; * interoperable with {@code Hashtable} in programs that rely on its * thread safety but not on its synchronization details. * - *

Retrieval operations (including {@code get}) generally do not + *

Retrieval operations (including {@code get}) generally do not * block, so may overlap with update operations (including {@code put} * and {@code remove}). Retrievals reflect the results of the most * recently completed update operations holding upon their - * onset. For aggregate operations such as {@code putAll} and {@code - * clear}, concurrent retrievals may reflect insertion or removal of - * only some entries. Similarly, Iterators and Enumerations return - * elements reflecting the state of the hash table at some point at or - * since the creation of the iterator/enumeration. They do - * not throw {@link ConcurrentModificationException}. - * However, iterators are designed to be used by only one thread at a - * time. Bear in mind that the results of aggregate status methods - * including {@code size}, {@code isEmpty}, and {@code containsValue} - * are typically useful only when a map is not undergoing concurrent - * updates in other threads. Otherwise the results of these methods - * reflect transient states that may be adequate for monitoring - * or estimation purposes, but not for program control. + * onset. (More formally, an update operation for a given key bears a + * happens-before relation with any (non-null) retrieval for + * that key reporting the updated value.) For aggregate operations + * such as {@code putAll} and {@code clear}, concurrent retrievals may + * reflect insertion or removal of only some entries. Similarly, + * Iterators and Enumerations return elements reflecting the state of + * the hash table at some point at or since the creation of the + * iterator/enumeration. They do not throw {@link + * ConcurrentModificationException}. However, iterators are designed + * to be used by only one thread at a time. Bear in mind that the + * results of aggregate status methods including {@code size}, {@code + * isEmpty}, and {@code containsValue} are typically useful only when + * a map is not undergoing concurrent updates in other threads. + * Otherwise the results of these methods reflect transient states + * that may be adequate for monitoring or estimation purposes, but not + * for program control. * - *

The table is dynamically expanded when there are too many + *

The table is dynamically expanded when there are too many * collisions (i.e., keys that have distinct hash codes but fall into * the same slot modulo the table size), with the expected average * effect of maintaining roughly two bins per mapping (corresponding @@ -82,22 +80,133 @@ import java.io.Serializable; * {@code hashCode()} is a sure way to slow down performance of any * hash table. * + *

A {@link Set} projection of a ConcurrentHashMapV8 may be created + * (using {@link #newKeySet()} or {@link #newKeySet(int)}), or viewed + * (using {@link #keySet(Object)} when only keys are of interest, and the + * mapped values are (perhaps transiently) not used or all take the + * same mapping value. + * + *

A ConcurrentHashMapV8 can be used as scalable frequency map (a + * form of histogram or multiset) by using {@link LongAdder} values + * and initializing via {@link #computeIfAbsent}. For example, to add + * a count to a {@code ConcurrentHashMapV8 freqs}, you + * can use {@code freqs.computeIfAbsent(k -> new + * LongAdder()).increment();} + * *

This class and its views and iterators implement all of the * optional methods of the {@link Map} and {@link Iterator} * interfaces. * - *

Like {@link Hashtable} but unlike {@link HashMap}, this class + *

Like {@link Hashtable} but unlike {@link HashMap}, this class * does not allow {@code null} to be used as a key or value. * + *

ConcurrentHashMapV8s support sequential and parallel operations + * bulk operations. (Parallel forms use the {@link + * ForkJoinPool#commonPool()}). Tasks that may be used in other + * contexts are available in class {@link ForkJoinTasks}. These + * operations are designed to be safely, and often sensibly, applied + * even with maps that are being concurrently updated by other + * threads; for example, when computing a snapshot summary of the + * values in a shared registry. There are three kinds of operation, + * each with four forms, accepting functions with Keys, Values, + * Entries, and (Key, Value) arguments and/or return values. Because + * the elements of a ConcurrentHashMapV8 are not ordered in any + * particular way, and may be processed in different orders in + * different parallel executions, the correctness of supplied + * functions should not depend on any ordering, or on any other + * objects or values that may transiently change while computation is + * in progress; and except for forEach actions, should ideally be + * side-effect-free. + * + *

+ * + *

The concurrency properties of bulk operations follow + * from those of ConcurrentHashMapV8: Any non-null result returned + * from {@code get(key)} and related access methods bears a + * happens-before relation with the associated insertion or + * update. The result of any bulk operation reflects the + * composition of these per-element relations (but is not + * necessarily atomic with respect to the map as a whole unless it + * is somehow known to be quiescent). Conversely, because keys + * and values in the map are never null, null serves as a reliable + * atomic indicator of the current lack of any result. To + * maintain this property, null serves as an implicit basis for + * all non-scalar reduction operations. For the double, long, and + * int versions, the basis should be one that, when combined with + * any other value, returns that other value (more formally, it + * should be the identity element for the reduction). Most common + * reductions have these properties; for example, computing a sum + * with basis 0 or a minimum with basis MAX_VALUE. + * + *

Search and transformation functions provided as arguments + * should similarly return null to indicate the lack of any result + * (in which case it is not used). In the case of mapped + * reductions, this also enables transformations to serve as + * filters, returning null (or, in the case of primitive + * specializations, the identity basis) if the element should not + * be combined. You can create compound transformations and + * filterings by composing them yourself under this "null means + * there is nothing there now" rule before using them in search or + * reduce operations. + * + *

Methods accepting and/or returning Entry arguments maintain + * key-value associations. They may be useful for example when + * finding the key for the greatest value. Note that "plain" Entry + * arguments can be supplied using {@code new + * AbstractMap.SimpleEntry(k,v)}. + * + *

Bulk operations may complete abruptly, throwing an + * exception encountered in the application of a supplied + * function. Bear in mind when handling such exceptions that other + * concurrently executing functions could also have thrown + * exceptions, or would have done so if the first exception had + * not occurred. + * + *

Speedups for parallel compared to sequential forms are common + * but not guaranteed. Parallel operations involving brief functions + * on small maps may execute more slowly than sequential forms if the + * underlying work to parallelize the computation is more expensive + * than the computation itself. Similarly, parallelization may not + * lead to much actual parallelism if all processors are busy + * performing unrelated tasks. + * + *

All arguments to all task methods must be non-null. + * + *

jsr166e note: During transition, this class + * uses nested functional interfaces with different names but the + * same forms as those expected for JDK8. + * *

This class is a member of the * * Java Collections Framework. * - *

jsr166e note: This class is a candidate replacement for - * java.util.concurrent.ConcurrentHashMap. During transition, this - * class declares and uses nested functional interfaces with different - * names but the same forms as those expected for JDK8. - * * @since 1.5 * @author Doug Lea * @param the type of keys maintained by this map @@ -114,7 +223,7 @@ public class ConcurrentHashMapV8 * portion of the elements, and so may be amenable to parallel * execution. * - *

This interface exports a subset of expected JDK8 + *

This interface exports a subset of expected JDK8 * functionality. * *

Sample usage: Here is one (of the several) ways to compute @@ -186,17 +295,15 @@ public class ConcurrentHashMapV8 * the same or better than java.util.HashMap, and to support high * initial insertion rates on an empty table by many threads. * - * Each key-value mapping is held in a Node. Because Node fields - * can contain special values, they are defined using plain Object - * types. Similarly in turn, all internal methods that use them - * work off Object types. And similarly, so do the internal - * methods of auxiliary iterator and view classes. All public - * generic typed methods relay in/out of these internal methods, - * supplying null-checks and casts as needed. This also allows - * many of the public methods to be factored into a smaller number - * of internal methods (although sadly not so for the five - * variants of put-related operations). The validation-based - * approach explained below leads to a lot of code sprawl because + * Each key-value mapping is held in a Node. Because Node key + * fields can contain special values, they are defined using plain + * Object types (not type "K"). This leads to a lot of explicit + * casting (and many explicit warning suppressions to tell + * compilers not to complain about it). It also allows some of the + * public methods to be factored into a smaller number of internal + * methods (although sadly not so for the five variants of + * put-related operations). The validation-based approach + * explained below leads to a lot of code sprawl because * retry-control precludes factoring into smaller methods. * * The table is lazily initialized to a power-of-two size upon the @@ -210,19 +317,12 @@ public class ConcurrentHashMapV8 * as lookups check hash code and non-nullness of value before * checking key equality. * - * We use the top two bits of Node hash fields for control - * purposes -- they are available anyway because of addressing - * constraints. As explained further below, these top bits are - * used as follows: - * 00 - Normal - * 01 - Locked - * 11 - Locked and may have a thread waiting for lock - * 10 - Node is a forwarding node - * - * The lower 30 bits of each Node's hash field contain a - * transformation of the key's hash code, except for forwarding - * nodes, for which the lower bits are zero (and so always have - * hash field == MOVED). + * We use the top (sign) bit of Node hash fields for control + * purposes -- it is available anyway because of addressing + * constraints. Nodes with negative hash fields are forwarding + * nodes to either TreeBins or resized tables. The lower 31 bits + * of each normal Node's hash field contain a transformation of + * the key's hash code. * * Insertion (via put or its variants) of the first node in an * empty bin is performed by just CASing it to the bin. This is @@ -231,12 +331,8 @@ public class ConcurrentHashMapV8 * delete, and replace) require locks. We do not want to waste * the space required to associate a distinct lock object with * each bin, so instead use the first node of a bin list itself as - * a lock. Blocking support for these locks relies on the builtin - * "synchronized" monitors. However, we also need a tryLock - * construction, so we overlay these by using bits of the Node - * hash field for lock control (see above), and so normally use - * builtin monitors only for blocking and signalling using - * wait/notifyAll constructions. See Node.tryAwaitLock. + * a lock. Locking support for these locks relies on builtin + * "synchronized" monitors. * * Using the first node of a list as a lock does not by itself * suffice though: When a node is locked, any update must first @@ -298,43 +394,43 @@ public class ConcurrentHashMapV8 * iterators in the same way. * * The table is resized when occupancy exceeds a percentage - * threshold (nominally, 0.75, but see below). Only a single - * thread performs the resize (using field "sizeCtl", to arrange - * exclusion), but the table otherwise remains usable for reads - * and updates. Resizing proceeds by transferring bins, one by - * one, from the table to the next table. Because we are using - * power-of-two expansion, the elements from each bin must either - * stay at same index, or move with a power of two offset. We - * eliminate unnecessary node creation by catching cases where old - * nodes can be reused because their next fields won't change. On - * average, only about one-sixth of them need cloning when a table - * doubles. The nodes they replace will be garbage collectable as - * soon as they are no longer referenced by any reader thread that - * may be in the midst of concurrently traversing table. Upon - * transfer, the old table bin contains only a special forwarding - * node (with hash field "MOVED") that contains the next table as - * its key. On encountering a forwarding node, access and update - * operations restart, using the new table. - * - * Each bin transfer requires its bin lock. However, unlike other - * cases, a transfer can skip a bin if it fails to acquire its - * lock, and revisit it later (unless it is a TreeBin). Method - * rebuild maintains a buffer of TRANSFER_BUFFER_SIZE bins that - * have been skipped because of failure to acquire a lock, and - * blocks only if none are available (i.e., only very rarely). - * The transfer operation must also ensure that all accessible - * bins in both the old and new table are usable by any traversal. - * When there are no lock acquisition failures, this is arranged - * simply by proceeding from the last bin (table.length - 1) up - * towards the first. Upon seeing a forwarding node, traversals - * (see class Iter) arrange to move to the new table - * without revisiting nodes. However, when any node is skipped - * during a transfer, all earlier table bins may have become - * visible, so are initialized with a reverse-forwarding node back - * to the old table until the new ones are established. (This - * sometimes requires transiently locking a forwarding node, which - * is possible under the above encoding.) These more expensive - * mechanics trigger only when necessary. + * threshold (nominally, 0.75, but see below). Any thread + * noticing an overfull bin may assist in resizing after the + * initiating thread allocates and sets up the replacement + * array. However, rather than stalling, these other threads may + * proceed with insertions etc. The use of TreeBins shields us + * from the worst case effects of overfilling while resizes are in + * progress. Resizing proceeds by transferring bins, one by one, + * from the table to the next table. To enable concurrency, the + * next table must be (incrementally) prefilled with place-holders + * serving as reverse forwarders to the old table. Because we are + * using power-of-two expansion, the elements from each bin must + * either stay at same index, or move with a power of two + * offset. We eliminate unnecessary node creation by catching + * cases where old nodes can be reused because their next fields + * won't change. On average, only about one-sixth of them need + * cloning when a table doubles. The nodes they replace will be + * garbage collectable as soon as they are no longer referenced by + * any reader thread that may be in the midst of concurrently + * traversing table. Upon transfer, the old table bin contains + * only a special forwarding node (with hash field "MOVED") that + * contains the next table as its key. On encountering a + * forwarding node, access and update operations restart, using + * the new table. + * + * Each bin transfer requires its bin lock, which can stall + * waiting for locks while resizing. However, because other + * threads can join in and help resize rather than contend for + * locks, average aggregate waits become shorter as resizing + * progresses. The transfer operation must also ensure that all + * accessible bins in both the old and new table are usable by any + * traversal. This is arranged by proceeding from the last bin + * (table.length - 1) up towards the first. Upon seeing a + * forwarding node, traversals (see class Traverser) arrange to + * move to the new table without revisiting nodes. However, to + * ensure that no intervening nodes are skipped, bin splitting can + * only begin after the associated reverse-forwarders are in + * place. * * The traversal scheme also applies to partial traversals of * ranges of bins (via an alternate Traverser constructor) @@ -349,20 +445,20 @@ public class ConcurrentHashMapV8 * These cases attempt to override the initial capacity settings, * but harmlessly fail to take effect in cases of races. * - * The element count is maintained using a LongAdder, which avoids - * contention on updates but can encounter cache thrashing if read - * too frequently during concurrent access. To avoid reading so - * often, resizing is attempted either when a bin lock is - * contended, or upon adding to a bin already holding two or more - * nodes (checked before adding in the xIfAbsent methods, after - * adding in others). Under uniform hash distributions, the - * probability of this occurring at threshold is around 13%, - * meaning that only about 1 in 8 puts check threshold (and after - * resizing, many fewer do so). But this approximation has high - * variance for small table sizes, so we check on any collision - * for sizes <= 64. The bulk putAll operation further reduces - * contention by only committing count updates upon these size - * checks. + * The element count is maintained using a specialization of + * LongAdder. We need to incorporate a specialization rather than + * just use a LongAdder in order to access implicit + * contention-sensing that leads to creation of multiple + * CounterCells. The counter mechanics avoid contention on + * updates but can encounter cache thrashing if read too + * frequently during concurrent access. To avoid reading so often, + * resizing under contention is attempted only upon adding to a + * bin already holding two or more nodes. Under uniform hash + * distributions, the probability of this occurring at threshold + * is around 13%, meaning that only about 1 in 8 puts check + * threshold (and after resizing, many fewer do so). The bulk + * putAll operation further reduces contention by only committing + * count updates upon these size checks. * * Maintaining API and serialization compatibility with previous * versions of this class introduces several oddities. Mainly: We @@ -413,27 +509,68 @@ public class ConcurrentHashMapV8 private static final float LOAD_FACTOR = 0.75f; /** - * The buffer size for skipped bins during transfers. The - * value is arbitrary but should be large enough to avoid - * most locking stalls during resizes. - */ - private static final int TRANSFER_BUFFER_SIZE = 32; - - /** * The bin count threshold for using a tree rather than list for a * bin. The value reflects the approximate break-even point for * using tree-based operations. */ private static final int TREE_THRESHOLD = 8; + /** + * Minimum number of rebinnings per transfer step. Ranges are + * subdivided to allow multiple resizer threads. This value + * serves as a lower bound to avoid resizers encountering + * excessive memory contention. The value should be at least + * DEFAULT_CAPACITY. + */ + private static final int MIN_TRANSFER_STRIDE = 16; + /* - * Encodings for special uses of Node hash fields. See above for - * explanation. + * Encodings for Node hash fields. See above for explanation. */ static final int MOVED = 0x80000000; // hash field for forwarding nodes - static final int LOCKED = 0x40000000; // set/tested only as a bit - static final int WAITING = 0xc0000000; // both bits set/tested together - static final int HASH_BITS = 0x3fffffff; // usable bits of normal node hash + static final int HASH_BITS = 0x7fffffff; // usable bits of normal node hash + + /** Number of CPUS, to place bounds on some sizings */ + static final int NCPU = Runtime.getRuntime().availableProcessors(); + + /* ---------------- Counters -------------- */ + + // Adapted from LongAdder and Striped64. + // See their internal docs for explanation. + + // A padded cell for distributing counts + static final class CounterCell { + volatile long p0, p1, p2, p3, p4, p5, p6; + volatile long value; + volatile long q0, q1, q2, q3, q4, q5, q6; + CounterCell(long x) { value = x; } + } + + /** + * Holder for the thread-local hash code determining which + * CounterCell to use. The code is initialized via the + * counterHashCodeGenerator, but may be moved upon collisions. + */ + static final class CounterHashCode { + int code; + } + + /** + * Generates initial value for per-thread CounterHashCodes + */ + static final AtomicInteger counterHashCodeGenerator = new AtomicInteger(); + + /** + * Increment for counterHashCodeGenerator. See class ThreadLocal + * for explanation. + */ + static final int SEED_INCREMENT = 0x61c88647; + + /** + * Per-thread counter hash codes. Shared across all instances. + */ + static final ThreadLocal threadCounterHashCode = + new ThreadLocal(); /* ---------------- Fields -------------- */ @@ -441,26 +578,54 @@ public class ConcurrentHashMapV8 * The array of bins. Lazily initialized upon first insertion. * Size is always a power of two. Accessed directly by iterators. */ - transient volatile Node[] table; + transient volatile Node[] table; /** - * The counter maintaining number of elements. + * The next table to use; non-null only while resizing. */ - private transient final LongAdder counter; + private transient volatile Node[] nextTable; + + /** + * Base counter value, used mainly when there is no contention, + * but also as a fallback during table initialization + * races. Updated via CAS. + */ + private transient volatile long baseCount; /** * Table initialization and resizing control. When negative, the - * table is being initialized or resized. Otherwise, when table is - * null, holds the initial table size to use upon creation, or 0 - * for default. After initialization, holds the next element count - * value upon which to resize the table. + * table is being initialized or resized: -1 for initialization, + * else -(1 + the number of active resizing threads). Otherwise, + * when table is null, holds the initial table size to use upon + * creation, or 0 for default. After initialization, holds the + * next element count value upon which to resize the table. */ private transient volatile int sizeCtl; + /** + * The next table index (plus one) to split while resizing. + */ + private transient volatile int transferIndex; + + /** + * The least available table index to split while resizing. + */ + private transient volatile int transferOrigin; + + /** + * Spinlock (locked via CAS) used when resizing and/or creating Cells. + */ + private transient volatile int counterBusy; + + /** + * Table of counter cells. When non-null, size is a power of 2. + */ + private transient volatile CounterCell[] counterCells; + // views - private transient KeySet keySet; - private transient Values values; - private transient EntrySet entrySet; + private transient KeySetView keySet; + private transient ValuesView values; + private transient EntrySetView entrySet; /** For serialization compatibility. Null unless serialized; see below */ private Segment[] segments; @@ -479,16 +644,19 @@ public class ConcurrentHashMapV8 * inline assignments below. */ - static final Node tabAt(Node[] tab, int i) { // used by Iter - return (Node)UNSAFE.getObjectVolatile(tab, ((long)i< Node tabAt + (Node[] tab, int i) { // used by Traverser + return (Node)U.getObjectVolatile(tab, ((long)i << ASHIFT) + ABASE); } - private static final boolean casTabAt(Node[] tab, int i, Node c, Node v) { - return UNSAFE.compareAndSwapObject(tab, ((long)i< boolean casTabAt + (Node[] tab, int i, Node c, Node v) { + return U.compareAndSwapObject(tab, ((long)i << ASHIFT) + ABASE, c, v); } - private static final void setTabAt(Node[] tab, int i, Node v) { - UNSAFE.putObjectVolatile(tab, ((long)i< void setTabAt + (Node[] tab, int i, Node v) { + U.putObjectVolatile(tab, ((long)i << ASHIFT) + ABASE, v); } /* ---------------- Nodes -------------- */ @@ -503,84 +671,18 @@ public class ConcurrentHashMapV8 * before a val, but can only be used after checking val to be * non-null. */ - static class Node { - volatile int hash; + static class Node { + final int hash; final Object key; - volatile Object val; - volatile Node next; + volatile V val; + volatile Node next; - Node(int hash, Object key, Object val, Node next) { + Node(int hash, Object key, V val, Node next) { this.hash = hash; this.key = key; this.val = val; this.next = next; } - - /** CompareAndSet the hash field */ - final boolean casHash(int cmp, int val) { - return UNSAFE.compareAndSwapInt(this, hashOffset, cmp, val); - } - - /** The number of spins before blocking for a lock */ - static final int MAX_SPINS = - Runtime.getRuntime().availableProcessors() > 1 ? 64 : 1; - - /** - * Spins a while if LOCKED bit set and this node is the first - * of its bin, and then sets WAITING bits on hash field and - * blocks (once) if they are still set. It is OK for this - * method to return even if lock is not available upon exit, - * which enables these simple single-wait mechanics. - * - * The corresponding signalling operation is performed within - * callers: Upon detecting that WAITING has been set when - * unlocking lock (via a failed CAS from non-waiting LOCKED - * state), unlockers acquire the sync lock and perform a - * notifyAll. - */ - final void tryAwaitLock(Node[] tab, int i) { - if (tab != null && i >= 0 && i < tab.length) { // bounds check - int r = ThreadLocalRandom.current().nextInt(); // randomize spins - int spins = MAX_SPINS, h; - while (tabAt(tab, i) == this && ((h = hash) & LOCKED) != 0) { - if (spins >= 0) { - r ^= r << 1; r ^= r >>> 3; r ^= r << 10; // xorshift - if (r >= 0 && --spins == 0) - Thread.yield(); // yield before block - } - else if (casHash(h, h | WAITING)) { - synchronized (this) { - if (tabAt(tab, i) == this && - (hash & WAITING) == WAITING) { - try { - wait(); - } catch (InterruptedException ie) { - Thread.currentThread().interrupt(); - } - } - else - notifyAll(); // possibly won race vs signaller - } - break; - } - } - } - } - - // Unsafe mechanics for casHash - private static final sun.misc.Unsafe UNSAFE; - private static final long hashOffset; - - static { - try { - UNSAFE = getUnsafe(); - Class k = Node.class; - hashOffset = UNSAFE.objectFieldOffset - (k.getDeclaredField("hash")); - } catch (Exception e) { - throw new Error(e); - } - } } /* ---------------- TreeBins -------------- */ @@ -588,14 +690,14 @@ public class ConcurrentHashMapV8 /** * Nodes for use in TreeBins */ - static final class TreeNode extends Node { - TreeNode parent; // red-black tree links - TreeNode left; - TreeNode right; - TreeNode prev; // needed to unlink next upon deletion + static final class TreeNode extends Node { + TreeNode parent; // red-black tree links + TreeNode left; + TreeNode right; + TreeNode prev; // needed to unlink next upon deletion boolean red; - TreeNode(int hash, Object key, Object val, Node next, TreeNode parent) { + TreeNode(int hash, Object key, V val, Node next, TreeNode parent) { super(hash, key, val, next); this.parent = parent; } @@ -644,10 +746,10 @@ public class ConcurrentHashMapV8 * and writers. Since we don't need to export full Lock API, we * just override the minimal AQS methods and use them directly. */ - static final class TreeBin extends AbstractQueuedSynchronizer { + static final class TreeBin extends AbstractQueuedSynchronizer { private static final long serialVersionUID = 2249069246763182397L; - transient TreeNode root; // root of tree - transient TreeNode first; // head of next-pointer list + transient TreeNode root; // root of tree + transient TreeNode first; // head of next-pointer list /* AQS overrides */ public final boolean isHeldExclusively() { return getState() > 0; } @@ -678,9 +780,9 @@ public class ConcurrentHashMapV8 } /** From CLR */ - private void rotateLeft(TreeNode p) { + private void rotateLeft(TreeNode p) { if (p != null) { - TreeNode r = p.right, pp, rl; + TreeNode r = p.right, pp, rl; if ((rl = p.right = r.left) != null) rl.parent = p; if ((pp = r.parent = p.parent) == null) @@ -695,9 +797,9 @@ public class ConcurrentHashMapV8 } /** From CLR */ - private void rotateRight(TreeNode p) { + private void rotateRight(TreeNode p) { if (p != null) { - TreeNode l = p.left, pp, lr; + TreeNode l = p.left, pp, lr; if ((lr = p.left = l.right) != null) lr.parent = p; if ((pp = l.parent = p.parent) == null) @@ -712,11 +814,11 @@ public class ConcurrentHashMapV8 } /** - * Return the TreeNode (or null if not found) for the given key + * Returns the TreeNode (or null if not found) for the given key * starting at given root. */ - @SuppressWarnings("unchecked") // suppress Comparable cast warning - final TreeNode getTreeNode(int h, Object k, TreeNode p) { + @SuppressWarnings("unchecked") final TreeNode getTreeNode + (int h, Object k, TreeNode p) { Class c = k.getClass(); while (p != null) { int dir, ph; Object pk; Class pc; @@ -726,16 +828,17 @@ public class ConcurrentHashMapV8 if (c != (pc = pk.getClass()) || !(k instanceof Comparable) || (dir = ((Comparable)k).compareTo((Comparable)pk)) == 0) { - dir = (c == pc) ? 0 : c.getName().compareTo(pc.getName()); - TreeNode r = null, s = null, pl, pr; - if (dir >= 0) { - if ((pl = p.left) != null && h <= pl.hash) - s = pl; + if ((dir = (c == pc) ? 0 : + c.getName().compareTo(pc.getName())) == 0) { + TreeNode r = null, pl, pr; // check both sides + if ((pr = p.right) != null && h >= pr.hash && + (r = getTreeNode(h, k, pr)) != null) + return r; + else if ((pl = p.left) != null && h <= pl.hash) + dir = -1; + else // nothing there + return null; } - else if ((pr = p.right) != null && h >= pr.hash) - s = pr; - if (s != null && (r = getTreeNode(h, k, s)) != null) - return r; } } else @@ -750,10 +853,10 @@ public class ConcurrentHashMapV8 * read-lock to call getTreeNode, but during failure to get * lock, searches along next links. */ - final Object getValue(int h, Object k) { - Node r = null; + final V getValue(int h, Object k) { + Node r = null; int c = getState(); // Must read lock state first - for (Node e = first; e != null; e = e.next) { + for (Node e = first; e != null; e = e.next) { if (c <= 0 && compareAndSetState(c, c - 1)) { try { r = getTreeNode(h, k, root); @@ -762,7 +865,7 @@ public class ConcurrentHashMapV8 } break; } - else if ((e.hash & HASH_BITS) == h && k.equals(e.key)) { + else if (e.hash == h && k.equals(e.key)) { r = e; break; } @@ -776,10 +879,10 @@ public class ConcurrentHashMapV8 * Finds or adds a node. * @return null if added */ - @SuppressWarnings("unchecked") // suppress Comparable cast warning - final TreeNode putTreeNode(int h, Object k, Object v) { + @SuppressWarnings("unchecked") final TreeNode putTreeNode + (int h, Object k, V v) { Class c = k.getClass(); - TreeNode pp = root, p = null; + TreeNode pp = root, p = null; int dir = 0; while (pp != null) { // find existing node or leaf to insert at int ph; Object pk; Class pc; @@ -790,11 +893,14 @@ public class ConcurrentHashMapV8 if (c != (pc = pk.getClass()) || !(k instanceof Comparable) || (dir = ((Comparable)k).compareTo((Comparable)pk)) == 0) { - dir = (c == pc) ? 0 : c.getName().compareTo(pc.getName()); - TreeNode r = null, s = null, pl, pr; - if (dir >= 0) { - if ((pl = p.left) != null && h <= pl.hash) - s = pl; + TreeNode s = null, r = null, pr; + if ((dir = (c == pc) ? 0 : + c.getName().compareTo(pc.getName())) == 0) { + if ((pr = p.right) != null && h >= pr.hash && + (r = getTreeNode(h, k, pr)) != null) + return r; + else // continue left + dir = -1; } else if ((pr = p.right) != null && h >= pr.hash) s = pr; @@ -807,12 +913,12 @@ public class ConcurrentHashMapV8 pp = (dir > 0) ? p.right : p.left; } - TreeNode f = first; - TreeNode x = first = new TreeNode(h, k, v, f, p); + TreeNode f = first; + TreeNode x = first = new TreeNode(h, k, v, f, p); if (p == null) root = x; else { // attach and rebalance; adapted from CLR - TreeNode xp, xpp; + TreeNode xp, xpp; if (f != null) f.prev = x; if (dir <= 0) @@ -822,9 +928,9 @@ public class ConcurrentHashMapV8 x.red = true; while (x != null && (xp = x.parent) != null && xp.red && (xpp = xp.parent) != null) { - TreeNode xppl = xpp.left; + TreeNode xppl = xpp.left; if (xp == xppl) { - TreeNode y = xpp.right; + TreeNode y = xpp.right; if (y != null && y.red) { y.red = false; xp.red = false; @@ -846,7 +952,7 @@ public class ConcurrentHashMapV8 } } else { - TreeNode y = xppl; + TreeNode y = xppl; if (y != null && y.red) { y.red = false; xp.red = false; @@ -868,7 +974,7 @@ public class ConcurrentHashMapV8 } } } - TreeNode r = root; + TreeNode r = root; if (r != null && r.red) r.red = false; } @@ -883,31 +989,31 @@ public class ConcurrentHashMapV8 * that are accessible independently of lock. So instead we * swap the tree linkages. */ - final void deleteTreeNode(TreeNode p) { - TreeNode next = (TreeNode)p.next; // unlink traversal pointers - TreeNode pred = p.prev; + final void deleteTreeNode(TreeNode p) { + TreeNode next = (TreeNode)p.next; // unlink traversal pointers + TreeNode pred = p.prev; if (pred == null) first = next; else pred.next = next; if (next != null) next.prev = pred; - TreeNode replacement; - TreeNode pl = p.left; - TreeNode pr = p.right; + TreeNode replacement; + TreeNode pl = p.left; + TreeNode pr = p.right; if (pl != null && pr != null) { - TreeNode s = pr, sl; + TreeNode s = pr, sl; while ((sl = s.left) != null) // find successor s = sl; boolean c = s.red; s.red = p.red; p.red = c; // swap colors - TreeNode sr = s.right; - TreeNode pp = p.parent; + TreeNode sr = s.right; + TreeNode pp = p.parent; if (s == pr) { // p was s's direct parent p.parent = s; s.right = p; } else { - TreeNode sp = s.parent; + TreeNode sp = s.parent; if ((p.parent = sp) != null) { if (s == sp.left) sp.left = p; @@ -932,7 +1038,7 @@ public class ConcurrentHashMapV8 } else replacement = (pl != null) ? pl : pr; - TreeNode pp = p.parent; + TreeNode pp = p.parent; if (replacement == null) { if (pp == null) { root = null; @@ -951,15 +1057,15 @@ public class ConcurrentHashMapV8 p.left = p.right = p.parent = null; } if (!p.red) { // rebalance, from CLR - TreeNode x = replacement; + TreeNode x = replacement; while (x != null) { - TreeNode xp, xpl; + TreeNode xp, xpl; if (x.red || (xp = x.parent) == null) { x.red = false; break; } if (x == (xpl = xp.left)) { - TreeNode sib = xp.right; + TreeNode sib = xp.right; if (sib != null && sib.red) { sib.red = false; xp.red = true; @@ -969,7 +1075,7 @@ public class ConcurrentHashMapV8 if (sib == null) x = xp; else { - TreeNode sl = sib.left, sr = sib.right; + TreeNode sl = sib.left, sr = sib.right; if ((sr == null || !sr.red) && (sl == null || !sl.red)) { sib.red = true; @@ -981,7 +1087,8 @@ public class ConcurrentHashMapV8 sl.red = false; sib.red = true; rotateRight(sib); - sib = (xp = x.parent) == null ? null : xp.right; + sib = (xp = x.parent) == null ? + null : xp.right; } if (sib != null) { sib.red = (xp == null) ? false : xp.red; @@ -997,7 +1104,7 @@ public class ConcurrentHashMapV8 } } else { // symmetric - TreeNode sib = xpl; + TreeNode sib = xpl; if (sib != null && sib.red) { sib.red = false; xp.red = true; @@ -1007,7 +1114,7 @@ public class ConcurrentHashMapV8 if (sib == null) x = xp; else { - TreeNode sl = sib.left, sr = sib.right; + TreeNode sl = sib.left, sr = sib.right; if ((sl == null || !sl.red) && (sr == null || !sr.red)) { sib.red = true; @@ -1019,7 +1126,8 @@ public class ConcurrentHashMapV8 sr.red = false; sib.red = true; rotateLeft(sib); - sib = (xp = x.parent) == null ? null : xp.left; + sib = (xp = x.parent) == null ? + null : xp.left; } if (sib != null) { sib.red = (xp == null) ? false : xp.red; @@ -1049,7 +1157,7 @@ public class ConcurrentHashMapV8 /* ---------------- Collision reduction methods -------------- */ /** - * Spreads higher bits to lower, and also forces top 2 bits to 0. + * Spreads higher bits to lower, and also forces top bit to 0. * Because the table uses power-of-two masking, sets of hashes * that vary only in bits above the current mask will always * collide. (Among known examples are sets of Float keys holding @@ -1067,37 +1175,35 @@ public class ConcurrentHashMapV8 } /** - * Replaces a list bin with a tree bin. Call only when locked. - * Fails to replace if the given key is non-comparable or table - * is, or needs, resizing. - */ - private final void replaceWithTreeBin(Node[] tab, int index, Object key) { - if ((key instanceof Comparable) && - (tab.length >= MAXIMUM_CAPACITY || counter.sum() < (long)sizeCtl)) { - TreeBin t = new TreeBin(); - for (Node e = tabAt(tab, index); e != null; e = e.next) - t.putTreeNode(e.hash & HASH_BITS, e.key, e.val); - setTabAt(tab, index, new Node(MOVED, t, null, null)); + * Replaces a list bin with a tree bin if key is comparable. Call + * only when locked. + */ + private final void replaceWithTreeBin(Node[] tab, int index, Object key) { + if (key instanceof Comparable) { + TreeBin t = new TreeBin(); + for (Node e = tabAt(tab, index); e != null; e = e.next) + t.putTreeNode(e.hash, e.key, e.val); + setTabAt(tab, index, new Node(MOVED, t, null, null)); } } /* ---------------- Internal access and update methods -------------- */ /** Implementation for get and containsKey */ - private final Object internalGet(Object k) { + @SuppressWarnings("unchecked") private final V internalGet(Object k) { int h = spread(k.hashCode()); - retry: for (Node[] tab = table; tab != null;) { - Node e, p; Object ek, ev; int eh; // locals to read fields once + retry: for (Node[] tab = table; tab != null;) { + Node e; Object ek; V ev; int eh; // locals to read fields once for (e = tabAt(tab, (tab.length - 1) & h); e != null; e = e.next) { - if ((eh = e.hash) == MOVED) { + if ((eh = e.hash) < 0) { if ((ek = e.key) instanceof TreeBin) // search TreeBin - return ((TreeBin)ek).getValue(h, k); - else { // restart with new table - tab = (Node[])ek; + return ((TreeBin)ek).getValue(h, k); + else { // restart with new table + tab = (Node[])ek; continue retry; } } - else if ((eh & HASH_BITS) == h && (ev = e.val) != null && + else if (eh == h && (ev = e.val) != null && ((ek = e.key) == k || k.equals(ek))) return ev; } @@ -1111,26 +1217,27 @@ public class ConcurrentHashMapV8 * Replaces node value with v, conditional upon match of cv if * non-null. If resulting value is null, delete. */ - private final Object internalReplace(Object k, Object v, Object cv) { + @SuppressWarnings("unchecked") private final V internalReplace + (Object k, V v, Object cv) { int h = spread(k.hashCode()); - Object oldVal = null; - for (Node[] tab = table;;) { - Node f; int i, fh; Object fk; + V oldVal = null; + for (Node[] tab = table;;) { + Node f; int i, fh; Object fk; if (tab == null || (f = tabAt(tab, i = (tab.length - 1) & h)) == null) break; - else if ((fh = f.hash) == MOVED) { + else if ((fh = f.hash) < 0) { if ((fk = f.key) instanceof TreeBin) { - TreeBin t = (TreeBin)fk; + TreeBin t = (TreeBin)fk; boolean validated = false; boolean deleted = false; t.acquire(0); try { if (tabAt(tab, i) == f) { validated = true; - TreeNode p = t.getTreeNode(h, k, t.root); + TreeNode p = t.getTreeNode(h, k, t.root); if (p != null) { - Object pv = p.val; + V pv = p.val; if (cv == null || cv == pv || cv.equals(pv)) { oldVal = pv; if ((p.val = v) == null) { @@ -1145,35 +1252,31 @@ public class ConcurrentHashMapV8 } if (validated) { if (deleted) - counter.add(-1L); + addCount(-1L, -1); break; } } else - tab = (Node[])fk; + tab = (Node[])fk; } - else if ((fh & HASH_BITS) != h && f.next == null) // precheck + else if (fh != h && f.next == null) // precheck break; // rules out possible existence - else if ((fh & LOCKED) != 0) { - checkForResize(); // try resizing if can't get lock - f.tryAwaitLock(tab, i); - } - else if (f.casHash(fh, fh | LOCKED)) { + else { boolean validated = false; boolean deleted = false; - try { + synchronized (f) { if (tabAt(tab, i) == f) { validated = true; - for (Node e = f, pred = null;;) { - Object ek, ev; - if ((e.hash & HASH_BITS) == h && + for (Node e = f, pred = null;;) { + Object ek; V ev; + if (e.hash == h && ((ev = e.val) != null) && ((ek = e.key) == k || k.equals(ek))) { if (cv == null || cv == ev || cv.equals(ev)) { oldVal = ev; if ((e.val = v) == null) { deleted = true; - Node en = e.next; + Node en = e.next; if (pred != null) pred.next = en; else @@ -1187,15 +1290,10 @@ public class ConcurrentHashMapV8 break; } } - } finally { - if (!f.casHash(fh | LOCKED, fh)) { - f.hash = fh; - synchronized (f) { f.notifyAll(); }; - } } if (validated) { if (deleted) - counter.add(-1L); + addCount(-1L, -1); break; } } @@ -1204,395 +1302,256 @@ public class ConcurrentHashMapV8 } /* - * Internal versions of the five insertion methods, each a - * little more complicated than the last. All have - * the same basic structure as the first (internalPut): + * Internal versions of insertion methods + * All have the same basic structure as the first (internalPut): * 1. If table uninitialized, create * 2. If bin empty, try to CAS new node * 3. If bin stale, use new table * 4. if bin converted to TreeBin, validate and relay to TreeBin methods * 5. Lock and validate; if valid, scan and add or update * - * The others interweave other checks and/or alternative actions: - * * Plain put checks for and performs resize after insertion. - * * putIfAbsent prescans for mapping without lock (and fails to add - * if present), which also makes pre-emptive resize checks worthwhile. - * * computeIfAbsent extends form used in putIfAbsent with additional - * mechanics to deal with, calls, potential exceptions and null - * returns from function call. - * * compute uses the same function-call mechanics, but without - * the prescans - * * putAll attempts to pre-allocate enough table space - * and more lazily performs count updates and checks. - * - * Someday when details settle down a bit more, it might be worth - * some factoring to reduce sprawl. + * The putAll method differs mainly in attempting to pre-allocate + * enough table space, and also more lazily performs count updates + * and checks. + * + * Most of the function-accepting methods can't be factored nicely + * because they require different functional forms, so instead + * sprawl out similar mechanics. */ - /** Implementation for put */ - private final Object internalPut(Object k, Object v) { + /** Implementation for put and putIfAbsent */ + @SuppressWarnings("unchecked") private final V internalPut + (K k, V v, boolean onlyIfAbsent) { + if (k == null || v == null) throw new NullPointerException(); int h = spread(k.hashCode()); - int count = 0; - for (Node[] tab = table;;) { - int i; Node f; int fh; Object fk; + int len = 0; + for (Node[] tab = table;;) { + int i, fh; Node f; Object fk; V fv; if (tab == null) tab = initTable(); else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) { - if (casTabAt(tab, i, null, new Node(h, k, v, null))) + if (casTabAt(tab, i, null, new Node(h, k, v, null))) break; // no lock when adding to empty bin } - else if ((fh = f.hash) == MOVED) { + else if ((fh = f.hash) < 0) { if ((fk = f.key) instanceof TreeBin) { - TreeBin t = (TreeBin)fk; - Object oldVal = null; + TreeBin t = (TreeBin)fk; + V oldVal = null; t.acquire(0); try { if (tabAt(tab, i) == f) { - count = 2; - TreeNode p = t.putTreeNode(h, k, v); + len = 2; + TreeNode p = t.putTreeNode(h, k, v); if (p != null) { oldVal = p.val; - p.val = v; + if (!onlyIfAbsent) + p.val = v; } } } finally { t.release(0); } - if (count != 0) { + if (len != 0) { if (oldVal != null) return oldVal; break; } } else - tab = (Node[])fk; + tab = (Node[])fk; } - else if ((fh & LOCKED) != 0) { - checkForResize(); - f.tryAwaitLock(tab, i); - } - else if (f.casHash(fh, fh | LOCKED)) { - Object oldVal = null; - try { // needed in case equals() throws + else if (onlyIfAbsent && fh == h && (fv = f.val) != null && + ((fk = f.key) == k || k.equals(fk))) // peek while nearby + return fv; + else { + V oldVal = null; + synchronized (f) { if (tabAt(tab, i) == f) { - count = 1; - for (Node e = f;; ++count) { - Object ek, ev; - if ((e.hash & HASH_BITS) == h && + len = 1; + for (Node e = f;; ++len) { + Object ek; V ev; + if (e.hash == h && (ev = e.val) != null && ((ek = e.key) == k || k.equals(ek))) { oldVal = ev; - e.val = v; + if (!onlyIfAbsent) + e.val = v; break; } - Node last = e; + Node last = e; if ((e = e.next) == null) { - last.next = new Node(h, k, v, null); - if (count >= TREE_THRESHOLD) + last.next = new Node(h, k, v, null); + if (len >= TREE_THRESHOLD) replaceWithTreeBin(tab, i, k); break; } } } - } finally { // unlock and signal if needed - if (!f.casHash(fh | LOCKED, fh)) { - f.hash = fh; - synchronized (f) { f.notifyAll(); }; - } } - if (count != 0) { + if (len != 0) { if (oldVal != null) return oldVal; - if (tab.length <= 64) - count = 2; - break; - } - } - } - counter.add(1L); - if (count > 1) - checkForResize(); - return null; - } - - /** Implementation for putIfAbsent */ - private final Object internalPutIfAbsent(Object k, Object v) { - int h = spread(k.hashCode()); - int count = 0; - for (Node[] tab = table;;) { - int i; Node f; int fh; Object fk, fv; - if (tab == null) - tab = initTable(); - else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) { - if (casTabAt(tab, i, null, new Node(h, k, v, null))) break; - } - else if ((fh = f.hash) == MOVED) { - if ((fk = f.key) instanceof TreeBin) { - TreeBin t = (TreeBin)fk; - Object oldVal = null; - t.acquire(0); - try { - if (tabAt(tab, i) == f) { - count = 2; - TreeNode p = t.putTreeNode(h, k, v); - if (p != null) - oldVal = p.val; - } - } finally { - t.release(0); - } - if (count != 0) { - if (oldVal != null) - return oldVal; - break; - } - } - else - tab = (Node[])fk; - } - else if ((fh & HASH_BITS) == h && (fv = f.val) != null && - ((fk = f.key) == k || k.equals(fk))) - return fv; - else { - Node g = f.next; - if (g != null) { // at least 2 nodes -- search and maybe resize - for (Node e = g;;) { - Object ek, ev; - if ((e.hash & HASH_BITS) == h && (ev = e.val) != null && - ((ek = e.key) == k || k.equals(ek))) - return ev; - if ((e = e.next) == null) { - checkForResize(); - break; - } - } - } - if (((fh = f.hash) & LOCKED) != 0) { - checkForResize(); - f.tryAwaitLock(tab, i); - } - else if (tabAt(tab, i) == f && f.casHash(fh, fh | LOCKED)) { - Object oldVal = null; - try { - if (tabAt(tab, i) == f) { - count = 1; - for (Node e = f;; ++count) { - Object ek, ev; - if ((e.hash & HASH_BITS) == h && - (ev = e.val) != null && - ((ek = e.key) == k || k.equals(ek))) { - oldVal = ev; - break; - } - Node last = e; - if ((e = e.next) == null) { - last.next = new Node(h, k, v, null); - if (count >= TREE_THRESHOLD) - replaceWithTreeBin(tab, i, k); - break; - } - } - } - } finally { - if (!f.casHash(fh | LOCKED, fh)) { - f.hash = fh; - synchronized (f) { f.notifyAll(); }; - } - } - if (count != 0) { - if (oldVal != null) - return oldVal; - if (tab.length <= 64) - count = 2; - break; - } } } } - counter.add(1L); - if (count > 1) - checkForResize(); + addCount(1L, len); return null; } /** Implementation for computeIfAbsent */ - private final Object internalComputeIfAbsent(K k, - Fun mf) { + @SuppressWarnings("unchecked") private final V internalComputeIfAbsent + (K k, Fun mf) { + if (k == null || mf == null) + throw new NullPointerException(); int h = spread(k.hashCode()); - Object val = null; - int count = 0; - for (Node[] tab = table;;) { - Node f; int i, fh; Object fk, fv; + V val = null; + int len = 0; + for (Node[] tab = table;;) { + Node f; int i; Object fk; if (tab == null) tab = initTable(); else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) { - Node node = new Node(fh = h | LOCKED, k, null, null); - if (casTabAt(tab, i, null, node)) { - count = 1; - try { - if ((val = mf.apply(k)) != null) - node.val = val; - } finally { - if (val == null) - setTabAt(tab, i, null); - if (!node.casHash(fh, h)) { - node.hash = h; - synchronized (node) { node.notifyAll(); }; + Node node = new Node(h, k, null, null); + synchronized (node) { + if (casTabAt(tab, i, null, node)) { + len = 1; + try { + if ((val = mf.apply(k)) != null) + node.val = val; + } finally { + if (val == null) + setTabAt(tab, i, null); } } } - if (count != 0) + if (len != 0) break; } - else if ((fh = f.hash) == MOVED) { + else if (f.hash < 0) { if ((fk = f.key) instanceof TreeBin) { - TreeBin t = (TreeBin)fk; + TreeBin t = (TreeBin)fk; boolean added = false; t.acquire(0); try { if (tabAt(tab, i) == f) { - count = 1; - TreeNode p = t.getTreeNode(h, k, t.root); + len = 1; + TreeNode p = t.getTreeNode(h, k, t.root); if (p != null) val = p.val; else if ((val = mf.apply(k)) != null) { added = true; - count = 2; + len = 2; t.putTreeNode(h, k, val); } } } finally { t.release(0); } - if (count != 0) { + if (len != 0) { if (!added) return val; break; } } else - tab = (Node[])fk; + tab = (Node[])fk; } - else if ((fh & HASH_BITS) == h && (fv = f.val) != null && - ((fk = f.key) == k || k.equals(fk))) - return fv; else { - Node g = f.next; - if (g != null) { - for (Node e = g;;) { - Object ek, ev; - if ((e.hash & HASH_BITS) == h && (ev = e.val) != null && - ((ek = e.key) == k || k.equals(ek))) - return ev; - if ((e = e.next) == null) { - checkForResize(); - break; - } - } - } - if (((fh = f.hash) & LOCKED) != 0) { - checkForResize(); - f.tryAwaitLock(tab, i); + for (Node e = f; e != null; e = e.next) { // prescan + Object ek; V ev; + if (e.hash == h && (ev = e.val) != null && + ((ek = e.key) == k || k.equals(ek))) + return ev; } - else if (tabAt(tab, i) == f && f.casHash(fh, fh | LOCKED)) { - boolean added = false; - try { - if (tabAt(tab, i) == f) { - count = 1; - for (Node e = f;; ++count) { - Object ek, ev; - if ((e.hash & HASH_BITS) == h && - (ev = e.val) != null && - ((ek = e.key) == k || k.equals(ek))) { - val = ev; - break; - } - Node last = e; - if ((e = e.next) == null) { - if ((val = mf.apply(k)) != null) { - added = true; - last.next = new Node(h, k, val, null); - if (count >= TREE_THRESHOLD) - replaceWithTreeBin(tab, i, k); - } - break; + boolean added = false; + synchronized (f) { + if (tabAt(tab, i) == f) { + len = 1; + for (Node e = f;; ++len) { + Object ek; V ev; + if (e.hash == h && + (ev = e.val) != null && + ((ek = e.key) == k || k.equals(ek))) { + val = ev; + break; + } + Node last = e; + if ((e = e.next) == null) { + if ((val = mf.apply(k)) != null) { + added = true; + last.next = new Node(h, k, val, null); + if (len >= TREE_THRESHOLD) + replaceWithTreeBin(tab, i, k); } + break; } } - } finally { - if (!f.casHash(fh | LOCKED, fh)) { - f.hash = fh; - synchronized (f) { f.notifyAll(); }; - } - } - if (count != 0) { - if (!added) - return val; - if (tab.length <= 64) - count = 2; - break; } } + if (len != 0) { + if (!added) + return val; + break; + } } } - if (val != null) { - counter.add(1L); - if (count > 1) - checkForResize(); - } + if (val != null) + addCount(1L, len); return val; } /** Implementation for compute */ - @SuppressWarnings("unchecked") - private final Object internalCompute(K k, boolean onlyIfPresent, - BiFun mf) { + @SuppressWarnings("unchecked") private final V internalCompute + (K k, boolean onlyIfPresent, + BiFun mf) { + if (k == null || mf == null) + throw new NullPointerException(); int h = spread(k.hashCode()); - Object val = null; + V val = null; int delta = 0; - int count = 0; - for (Node[] tab = table;;) { - Node f; int i, fh; Object fk; + int len = 0; + for (Node[] tab = table;;) { + Node f; int i, fh; Object fk; if (tab == null) tab = initTable(); else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) { if (onlyIfPresent) break; - Node node = new Node(fh = h | LOCKED, k, null, null); - if (casTabAt(tab, i, null, node)) { - try { - count = 1; - if ((val = mf.apply(k, null)) != null) { - node.val = val; - delta = 1; - } - } finally { - if (delta == 0) - setTabAt(tab, i, null); - if (!node.casHash(fh, h)) { - node.hash = h; - synchronized (node) { node.notifyAll(); }; + Node node = new Node(h, k, null, null); + synchronized (node) { + if (casTabAt(tab, i, null, node)) { + try { + len = 1; + if ((val = mf.apply(k, null)) != null) { + node.val = val; + delta = 1; + } + } finally { + if (delta == 0) + setTabAt(tab, i, null); } } } - if (count != 0) + if (len != 0) break; } - else if ((fh = f.hash) == MOVED) { + else if ((fh = f.hash) < 0) { if ((fk = f.key) instanceof TreeBin) { - TreeBin t = (TreeBin)fk; + TreeBin t = (TreeBin)fk; t.acquire(0); try { if (tabAt(tab, i) == f) { - count = 1; - TreeNode p = t.getTreeNode(h, k, t.root); - Object pv = (p == null) ? null : p.val; - if ((val = mf.apply(k, (V)pv)) != null) { + len = 1; + TreeNode p = t.getTreeNode(h, k, t.root); + if (p == null && onlyIfPresent) + break; + V pv = (p == null) ? null : p.val; + if ((val = mf.apply(k, pv)) != null) { if (p != null) p.val = val; else { - count = 2; + len = 2; delta = 1; t.putTreeNode(h, k, val); } @@ -1605,31 +1564,27 @@ public class ConcurrentHashMapV8 } finally { t.release(0); } - if (count != 0) + if (len != 0) break; } else - tab = (Node[])fk; + tab = (Node[])fk; } - else if ((fh & LOCKED) != 0) { - checkForResize(); - f.tryAwaitLock(tab, i); - } - else if (f.casHash(fh, fh | LOCKED)) { - try { + else { + synchronized (f) { if (tabAt(tab, i) == f) { - count = 1; - for (Node e = f, pred = null;; ++count) { - Object ek, ev; - if ((e.hash & HASH_BITS) == h && + len = 1; + for (Node e = f, pred = null;; ++len) { + Object ek; V ev; + if (e.hash == h && (ev = e.val) != null && ((ek = e.key) == k || k.equals(ek))) { - val = mf.apply(k, (V)ev); + val = mf.apply(k, ev); if (val != null) e.val = val; else { delta = -1; - Node en = e.next; + Node en = e.next; if (pred != null) pred.next = en; else @@ -1639,68 +1594,61 @@ public class ConcurrentHashMapV8 } pred = e; if ((e = e.next) == null) { - if (!onlyIfPresent && (val = mf.apply(k, null)) != null) { - pred.next = new Node(h, k, val, null); + if (!onlyIfPresent && + (val = mf.apply(k, null)) != null) { + pred.next = new Node(h, k, val, null); delta = 1; - if (count >= TREE_THRESHOLD) + if (len >= TREE_THRESHOLD) replaceWithTreeBin(tab, i, k); } break; } } } - } finally { - if (!f.casHash(fh | LOCKED, fh)) { - f.hash = fh; - synchronized (f) { f.notifyAll(); }; - } } - if (count != 0) { - if (tab.length <= 64) - count = 2; + if (len != 0) break; - } } } - if (delta != 0) { - counter.add((long)delta); - if (count > 1) - checkForResize(); - } + if (delta != 0) + addCount((long)delta, len); return val; } - private final Object internalMerge(K k, V v, - BiFun mf) { + /** Implementation for merge */ + @SuppressWarnings("unchecked") private final V internalMerge + (K k, V v, BiFun mf) { + if (k == null || v == null || mf == null) + throw new NullPointerException(); int h = spread(k.hashCode()); - Object val = null; + V val = null; int delta = 0; - int count = 0; - for (Node[] tab = table;;) { - int i; Node f; int fh; Object fk, fv; + int len = 0; + for (Node[] tab = table;;) { + int i; Node f; Object fk; V fv; if (tab == null) tab = initTable(); else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) { - if (casTabAt(tab, i, null, new Node(h, k, v, null))) { + if (casTabAt(tab, i, null, new Node(h, k, v, null))) { delta = 1; val = v; break; } } - else if ((fh = f.hash) == MOVED) { + else if (f.hash < 0) { if ((fk = f.key) instanceof TreeBin) { - TreeBin t = (TreeBin)fk; + TreeBin t = (TreeBin)fk; t.acquire(0); try { if (tabAt(tab, i) == f) { - count = 1; - TreeNode p = t.getTreeNode(h, k, t.root); - val = (p == null) ? v : mf.apply((V)p.val, v); + len = 1; + TreeNode p = t.getTreeNode(h, k, t.root); + val = (p == null) ? v : mf.apply(p.val, v); if (val != null) { if (p != null) p.val = val; else { - count = 2; + len = 2; delta = 1; t.putTreeNode(h, k, val); } @@ -1713,31 +1661,27 @@ public class ConcurrentHashMapV8 } finally { t.release(0); } - if (count != 0) + if (len != 0) break; } else - tab = (Node[])fk; - } - else if ((fh & LOCKED) != 0) { - checkForResize(); - f.tryAwaitLock(tab, i); + tab = (Node[])fk; } - else if (f.casHash(fh, fh | LOCKED)) { - try { + else { + synchronized (f) { if (tabAt(tab, i) == f) { - count = 1; - for (Node e = f, pred = null;; ++count) { - Object ek, ev; - if ((e.hash & HASH_BITS) == h && + len = 1; + for (Node e = f, pred = null;; ++len) { + Object ek; V ev; + if (e.hash == h && (ev = e.val) != null && ((ek = e.key) == k || k.equals(ek))) { - val = mf.apply(v, (V)ev); + val = mf.apply(ev, v); if (val != null) e.val = val; else { delta = -1; - Node en = e.next; + Node en = e.next; if (pred != null) pred.next = en; else @@ -1748,68 +1692,58 @@ public class ConcurrentHashMapV8 pred = e; if ((e = e.next) == null) { val = v; - pred.next = new Node(h, k, val, null); + pred.next = new Node(h, k, val, null); delta = 1; - if (count >= TREE_THRESHOLD) + if (len >= TREE_THRESHOLD) replaceWithTreeBin(tab, i, k); break; } } } - } finally { - if (!f.casHash(fh | LOCKED, fh)) { - f.hash = fh; - synchronized (f) { f.notifyAll(); }; - } } - if (count != 0) { - if (tab.length <= 64) - count = 2; + if (len != 0) break; - } } } - if (delta != 0) { - counter.add((long)delta); - if (count > 1) - checkForResize(); - } + if (delta != 0) + addCount((long)delta, len); return val; } /** Implementation for putAll */ - private final void internalPutAll(Map m) { + @SuppressWarnings("unchecked") private final void internalPutAll + (Map m) { tryPresize(m.size()); long delta = 0L; // number of uncommitted additions boolean npe = false; // to throw exception on exit for nulls try { // to clean up counts on other exceptions - for (Map.Entry entry : m.entrySet()) { - Object k, v; + for (Map.Entry entry : m.entrySet()) { + Object k; V v; if (entry == null || (k = entry.getKey()) == null || (v = entry.getValue()) == null) { npe = true; break; } int h = spread(k.hashCode()); - for (Node[] tab = table;;) { - int i; Node f; int fh; Object fk; + for (Node[] tab = table;;) { + int i; Node f; int fh; Object fk; if (tab == null) tab = initTable(); else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null){ - if (casTabAt(tab, i, null, new Node(h, k, v, null))) { + if (casTabAt(tab, i, null, new Node(h, k, v, null))) { ++delta; break; } } - else if ((fh = f.hash) == MOVED) { + else if ((fh = f.hash) < 0) { if ((fk = f.key) instanceof TreeBin) { - TreeBin t = (TreeBin)fk; + TreeBin t = (TreeBin)fk; boolean validated = false; t.acquire(0); try { if (tabAt(tab, i) == f) { validated = true; - TreeNode p = t.getTreeNode(h, k, t.root); + TreeNode p = t.getTreeNode(h, k, t.root); if (p != null) p.val = v; else { @@ -1824,48 +1758,36 @@ public class ConcurrentHashMapV8 break; } else - tab = (Node[])fk; + tab = (Node[])fk; } - else if ((fh & LOCKED) != 0) { - counter.add(delta); - delta = 0L; - checkForResize(); - f.tryAwaitLock(tab, i); - } - else if (f.casHash(fh, fh | LOCKED)) { - int count = 0; - try { + else { + int len = 0; + synchronized (f) { if (tabAt(tab, i) == f) { - count = 1; - for (Node e = f;; ++count) { - Object ek, ev; - if ((e.hash & HASH_BITS) == h && + len = 1; + for (Node e = f;; ++len) { + Object ek; V ev; + if (e.hash == h && (ev = e.val) != null && ((ek = e.key) == k || k.equals(ek))) { e.val = v; break; } - Node last = e; + Node last = e; if ((e = e.next) == null) { ++delta; - last.next = new Node(h, k, v, null); - if (count >= TREE_THRESHOLD) + last.next = new Node(h, k, v, null); + if (len >= TREE_THRESHOLD) replaceWithTreeBin(tab, i, k); break; } } } - } finally { - if (!f.casHash(fh | LOCKED, fh)) { - f.hash = fh; - synchronized (f) { f.notifyAll(); }; - } } - if (count != 0) { - if (count > 1) { - counter.add(delta); + if (len != 0) { + if (len > 1) { + addCount(delta, len); delta = 0L; - checkForResize(); } break; } @@ -1873,13 +1795,68 @@ public class ConcurrentHashMapV8 } } } finally { - if (delta != 0) - counter.add(delta); + if (delta != 0L) + addCount(delta, 2); } if (npe) throw new NullPointerException(); } + /** + * Implementation for clear. Steps through each bin, removing all + * nodes. + */ + @SuppressWarnings("unchecked") private final void internalClear() { + long delta = 0L; // negative number of deletions + int i = 0; + Node[] tab = table; + while (tab != null && i < tab.length) { + Node f = tabAt(tab, i); + if (f == null) + ++i; + else if (f.hash < 0) { + Object fk; + if ((fk = f.key) instanceof TreeBin) { + TreeBin t = (TreeBin)fk; + t.acquire(0); + try { + if (tabAt(tab, i) == f) { + for (Node p = t.first; p != null; p = p.next) { + if (p.val != null) { // (currently always true) + p.val = null; + --delta; + } + } + t.first = null; + t.root = null; + ++i; + } + } finally { + t.release(0); + } + } + else + tab = (Node[])fk; + } + else { + synchronized (f) { + if (tabAt(tab, i) == f) { + for (Node e = f; e != null; e = e.next) { + if (e.val != null) { // (currently always true) + e.val = null; + --delta; + } + } + setTabAt(tab, i, null); + ++i; + } + } + } + } + if (delta != 0L) + addCount(delta, -1); + } + /* ---------------- Table Initialization and Resizing -------------- */ /** @@ -1899,16 +1876,17 @@ public class ConcurrentHashMapV8 /** * Initializes table, using the size recorded in sizeCtl. */ - private final Node[] initTable() { - Node[] tab; int sc; + @SuppressWarnings("unchecked") private final Node[] initTable() { + Node[] tab; int sc; while ((tab = table) == null) { if ((sc = sizeCtl) < 0) Thread.yield(); // lost initialization race; just spin - else if (UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) { + else if (U.compareAndSwapInt(this, SIZECTL, sc, -1)) { try { if ((tab = table) == null) { int n = (sc > 0) ? sc : DEFAULT_CAPACITY; - tab = table = new Node[n]; + @SuppressWarnings("rawtypes") Node[] tb = new Node[n]; + table = tab = (Node[])tb; sc = n - (n >>> 2); } } finally { @@ -1921,24 +1899,47 @@ public class ConcurrentHashMapV8 } /** - * If table is too small and not already resizing, creates next - * table and transfers bins. Rechecks occupancy after a transfer - * to see if another resize is already needed because resizings - * are lagging additions. - */ - private final void checkForResize() { - Node[] tab; int n, sc; - while ((tab = table) != null && - (n = tab.length) < MAXIMUM_CAPACITY && - (sc = sizeCtl) >= 0 && counter.sum() >= (long)sc && - UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) { - try { - if (tab == table) { - table = rebuild(tab); - sc = (n << 1) - (n >>> 1); + * Adds to count, and if table is too small and not already + * resizing, initiates transfer. If already resizing, helps + * perform transfer if work is available. Rechecks occupancy + * after a transfer to see if another resize is already needed + * because resizings are lagging additions. + * + * @param x the count to add + * @param check if <0, don't check resize, if <= 1 only check if uncontended + */ + private final void addCount(long x, int check) { + CounterCell[] as; long b, s; + if ((as = counterCells) != null || + !U.compareAndSwapLong(this, BASECOUNT, b = baseCount, s = b + x)) { + CounterHashCode hc; CounterCell a; long v; int m; + boolean uncontended = true; + if ((hc = threadCounterHashCode.get()) == null || + as == null || (m = as.length - 1) < 0 || + (a = as[m & hc.code]) == null || + !(uncontended = + U.compareAndSwapLong(a, CELLVALUE, v = a.value, v + x))) { + fullAddCount(x, hc, uncontended); + return; + } + if (check <= 1) + return; + s = sumCount(); + } + if (check >= 0) { + Node[] tab, nt; int sc; + while (s >= (long)(sc = sizeCtl) && (tab = table) != null && + tab.length < MAXIMUM_CAPACITY) { + if (sc < 0) { + if (sc == -1 || transferIndex <= transferOrigin || + (nt = nextTable) == null) + break; + if (U.compareAndSwapInt(this, SIZECTL, sc, sc - 1)) + transfer(tab, nt); } - } finally { - sizeCtl = sc; + else if (U.compareAndSwapInt(this, SIZECTL, sc, -2)) + transfer(tab, null); + s = sumCount(); } } } @@ -1948,18 +1949,19 @@ public class ConcurrentHashMapV8 * * @param size number of elements (doesn't need to be perfectly accurate) */ - private final void tryPresize(int size) { + @SuppressWarnings("unchecked") private final void tryPresize(int size) { int c = (size >= (MAXIMUM_CAPACITY >>> 1)) ? MAXIMUM_CAPACITY : tableSizeFor(size + (size >>> 1) + 1); int sc; while ((sc = sizeCtl) >= 0) { - Node[] tab = table; int n; + Node[] tab = table; int n; if (tab == null || (n = tab.length) == 0) { n = (sc > c) ? sc : c; - if (UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) { + if (U.compareAndSwapInt(this, SIZECTL, sc, -1)) { try { if (table == tab) { - table = new Node[n]; + @SuppressWarnings("rawtypes") Node[] tb = new Node[n]; + table = (Node[])tb; sc = n - (n >>> 2); } } finally { @@ -1969,260 +1971,270 @@ public class ConcurrentHashMapV8 } else if (c <= sc || n >= MAXIMUM_CAPACITY) break; - else if (UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) { - try { - if (table == tab) { - table = rebuild(tab); - sc = (n << 1) - (n >>> 1); - } - } finally { - sizeCtl = sc; - } - } + else if (tab == table && + U.compareAndSwapInt(this, SIZECTL, sc, -2)) + transfer(tab, null); } } - /* + /** * Moves and/or copies the nodes in each bin to new table. See * above for explanation. - * - * @return the new table */ - private static final Node[] rebuild(Node[] tab) { - int n = tab.length; - Node[] nextTab = new Node[n << 1]; - Node fwd = new Node(MOVED, nextTab, null, null); - int[] buffer = null; // holds bins to revisit; null until needed - Node rev = null; // reverse forwarder; null until needed - int nbuffered = 0; // the number of bins in buffer list - int bufferIndex = 0; // buffer index of current buffered bin - int bin = n - 1; // current non-buffered bin or -1 if none - - for (int i = bin;;) { // start upwards sweep - int fh; Node f; - if ((f = tabAt(tab, i)) == null) { - if (bin >= 0) { // no lock needed (or available) - if (!casTabAt(tab, i, f, fwd)) - continue; - } - else { // transiently use a locked forwarding node - Node g = new Node(MOVED|LOCKED, nextTab, null, null); - if (!casTabAt(tab, i, f, g)) - continue; + @SuppressWarnings("unchecked") private final void transfer + (Node[] tab, Node[] nextTab) { + int n = tab.length, stride; + if ((stride = (NCPU > 1) ? (n >>> 3) / NCPU : n) < MIN_TRANSFER_STRIDE) + stride = MIN_TRANSFER_STRIDE; // subdivide range + if (nextTab == null) { // initiating + try { + @SuppressWarnings("rawtypes") Node[] tb = new Node[n << 1]; + nextTab = (Node[])tb; + } catch (Throwable ex) { // try to cope with OOME + sizeCtl = Integer.MAX_VALUE; + return; + } + nextTable = nextTab; + transferOrigin = n; + transferIndex = n; + Node rev = new Node(MOVED, tab, null, null); + for (int k = n; k > 0;) { // progressively reveal ready slots + int nextk = (k > stride) ? k - stride : 0; + for (int m = nextk; m < k; ++m) + nextTab[m] = rev; + for (int m = n + nextk; m < n + k; ++m) + nextTab[m] = rev; + U.putOrderedInt(this, TRANSFERORIGIN, k = nextk); + } + } + int nextn = nextTab.length; + Node fwd = new Node(MOVED, nextTab, null, null); + boolean advance = true; + for (int i = 0, bound = 0;;) { + int nextIndex, nextBound; Node f; Object fk; + while (advance) { + if (--i >= bound) + advance = false; + else if ((nextIndex = transferIndex) <= transferOrigin) { + i = -1; + advance = false; + } + else if (U.compareAndSwapInt + (this, TRANSFERINDEX, nextIndex, + nextBound = (nextIndex > stride ? + nextIndex - stride : 0))) { + bound = nextBound; + i = nextIndex - 1; + advance = false; + } + } + if (i < 0 || i >= n || i + n >= nextn) { + for (int sc;;) { + if (U.compareAndSwapInt(this, SIZECTL, sc = sizeCtl, ++sc)) { + if (sc == -1) { + nextTable = null; + table = nextTab; + sizeCtl = (n << 1) - (n >>> 1); + } + return; + } + } + } + else if ((f = tabAt(tab, i)) == null) { + if (casTabAt(tab, i, null, fwd)) { setTabAt(nextTab, i, null); setTabAt(nextTab, i + n, null); - setTabAt(tab, i, fwd); - if (!g.casHash(MOVED|LOCKED, MOVED)) { - g.hash = MOVED; - synchronized (g) { g.notifyAll(); } - } + advance = true; } } - else if ((fh = f.hash) == MOVED) { - Object fk = f.key; - if (fk instanceof TreeBin) { - TreeBin t = (TreeBin)fk; - boolean validated = false; - t.acquire(0); - try { - if (tabAt(tab, i) == f) { - validated = true; - splitTreeBin(nextTab, i, t); - setTabAt(tab, i, fwd); + else if (f.hash >= 0) { + synchronized (f) { + if (tabAt(tab, i) == f) { + int runBit = f.hash & n; + Node lastRun = f, lo = null, hi = null; + for (Node p = f.next; p != null; p = p.next) { + int b = p.hash & n; + if (b != runBit) { + runBit = b; + lastRun = p; + } } - } finally { - t.release(0); + if (runBit == 0) + lo = lastRun; + else + hi = lastRun; + for (Node p = f; p != lastRun; p = p.next) { + int ph = p.hash; + Object pk = p.key; V pv = p.val; + if ((ph & n) == 0) + lo = new Node(ph, pk, pv, lo); + else + hi = new Node(ph, pk, pv, hi); + } + setTabAt(nextTab, i, lo); + setTabAt(nextTab, i + n, hi); + setTabAt(tab, i, fwd); + advance = true; } - if (!validated) - continue; } } - else if ((fh & LOCKED) == 0 && f.casHash(fh, fh|LOCKED)) { - boolean validated = false; - try { // split to lo and hi lists; copying as needed + else if ((fk = f.key) instanceof TreeBin) { + TreeBin t = (TreeBin)fk; + t.acquire(0); + try { if (tabAt(tab, i) == f) { - validated = true; - splitBin(nextTab, i, f); + TreeBin lt = new TreeBin(); + TreeBin ht = new TreeBin(); + int lc = 0, hc = 0; + for (Node e = t.first; e != null; e = e.next) { + int h = e.hash; + Object k = e.key; V v = e.val; + if ((h & n) == 0) { + ++lc; + lt.putTreeNode(h, k, v); + } + else { + ++hc; + ht.putTreeNode(h, k, v); + } + } + Node ln, hn; // throw away trees if too small + if (lc < TREE_THRESHOLD) { + ln = null; + for (Node p = lt.first; p != null; p = p.next) + ln = new Node(p.hash, p.key, p.val, ln); + } + else + ln = new Node(MOVED, lt, null, null); + setTabAt(nextTab, i, ln); + if (hc < TREE_THRESHOLD) { + hn = null; + for (Node p = ht.first; p != null; p = p.next) + hn = new Node(p.hash, p.key, p.val, hn); + } + else + hn = new Node(MOVED, ht, null, null); + setTabAt(nextTab, i + n, hn); setTabAt(tab, i, fwd); + advance = true; } } finally { - if (!f.casHash(fh | LOCKED, fh)) { - f.hash = fh; - synchronized (f) { f.notifyAll(); }; - } + t.release(0); } - if (!validated) - continue; - } - else { - if (buffer == null) // initialize buffer for revisits - buffer = new int[TRANSFER_BUFFER_SIZE]; - if (bin < 0 && bufferIndex > 0) { - int j = buffer[--bufferIndex]; - buffer[bufferIndex] = i; - i = j; // swap with another bin - continue; - } - if (bin < 0 || nbuffered >= TRANSFER_BUFFER_SIZE) { - f.tryAwaitLock(tab, i); - continue; // no other options -- block - } - if (rev == null) // initialize reverse-forwarder - rev = new Node(MOVED, tab, null, null); - if (tabAt(tab, i) != f || (f.hash & LOCKED) == 0) - continue; // recheck before adding to list - buffer[nbuffered++] = i; - setTabAt(nextTab, i, rev); // install place-holders - setTabAt(nextTab, i + n, rev); - } - - if (bin > 0) - i = --bin; - else if (buffer != null && nbuffered > 0) { - bin = -1; - i = buffer[bufferIndex = --nbuffered]; } else - return nextTab; + advance = true; // already processed } } - /** - * Splits a normal bin with list headed by e into lo and hi parts; - * installs in given table. - */ - private static void splitBin(Node[] nextTab, int i, Node e) { - int bit = nextTab.length >>> 1; // bit to split on - int runBit = e.hash & bit; - Node lastRun = e, lo = null, hi = null; - for (Node p = e.next; p != null; p = p.next) { - int b = p.hash & bit; - if (b != runBit) { - runBit = b; - lastRun = p; + /* ---------------- Counter support -------------- */ + + final long sumCount() { + CounterCell[] as = counterCells; CounterCell a; + long sum = baseCount; + if (as != null) { + for (int i = 0; i < as.length; ++i) { + if ((a = as[i]) != null) + sum += a.value; } } - if (runBit == 0) - lo = lastRun; - else - hi = lastRun; - for (Node p = e; p != lastRun; p = p.next) { - int ph = p.hash & HASH_BITS; - Object pk = p.key, pv = p.val; - if ((ph & bit) == 0) - lo = new Node(ph, pk, pv, lo); - else - hi = new Node(ph, pk, pv, hi); - } - setTabAt(nextTab, i, lo); - setTabAt(nextTab, i + bit, hi); + return sum; } - /** - * Splits a tree bin into lo and hi parts; installs in given table. - */ - private static void splitTreeBin(Node[] nextTab, int i, TreeBin t) { - int bit = nextTab.length >>> 1; - TreeBin lt = new TreeBin(); - TreeBin ht = new TreeBin(); - int lc = 0, hc = 0; - for (Node e = t.first; e != null; e = e.next) { - int h = e.hash & HASH_BITS; - Object k = e.key, v = e.val; - if ((h & bit) == 0) { - ++lc; - lt.putTreeNode(h, k, v); - } - else { - ++hc; - ht.putTreeNode(h, k, v); - } - } - Node ln, hn; // throw away trees if too small - if (lc <= (TREE_THRESHOLD >>> 1)) { - ln = null; - for (Node p = lt.first; p != null; p = p.next) - ln = new Node(p.hash, p.key, p.val, ln); - } - else - ln = new Node(MOVED, lt, null, null); - setTabAt(nextTab, i, ln); - if (hc <= (TREE_THRESHOLD >>> 1)) { - hn = null; - for (Node p = ht.first; p != null; p = p.next) - hn = new Node(p.hash, p.key, p.val, hn); + // See LongAdder version for explanation + private final void fullAddCount(long x, CounterHashCode hc, + boolean wasUncontended) { + int h; + if (hc == null) { + hc = new CounterHashCode(); + int s = counterHashCodeGenerator.addAndGet(SEED_INCREMENT); + h = hc.code = (s == 0) ? 1 : s; // Avoid zero + threadCounterHashCode.set(hc); } else - hn = new Node(MOVED, ht, null, null); - setTabAt(nextTab, i + bit, hn); - } - - /** - * Implementation for clear. Steps through each bin, removing all - * nodes. - */ - private final void internalClear() { - long delta = 0L; // negative number of deletions - int i = 0; - Node[] tab = table; - while (tab != null && i < tab.length) { - int fh; Object fk; - Node f = tabAt(tab, i); - if (f == null) - ++i; - else if ((fh = f.hash) == MOVED) { - if ((fk = f.key) instanceof TreeBin) { - TreeBin t = (TreeBin)fk; - t.acquire(0); - try { - if (tabAt(tab, i) == f) { - for (Node p = t.first; p != null; p = p.next) { - p.val = null; - --delta; + h = hc.code; + boolean collide = false; // True if last slot nonempty + for (;;) { + CounterCell[] as; CounterCell a; int n; long v; + if ((as = counterCells) != null && (n = as.length) > 0) { + if ((a = as[(n - 1) & h]) == null) { + if (counterBusy == 0) { // Try to attach new Cell + CounterCell r = new CounterCell(x); // Optimistic create + if (counterBusy == 0 && + U.compareAndSwapInt(this, COUNTERBUSY, 0, 1)) { + boolean created = false; + try { // Recheck under lock + CounterCell[] rs; int m, j; + if ((rs = counterCells) != null && + (m = rs.length) > 0 && + rs[j = (m - 1) & h] == null) { + rs[j] = r; + created = true; + } + } finally { + counterBusy = 0; } - t.first = null; - t.root = null; - ++i; + if (created) + break; + continue; // Slot is now non-empty } - } finally { - t.release(0); } + collide = false; } - else - tab = (Node[])fk; - } - else if ((fh & LOCKED) != 0) { - counter.add(delta); // opportunistically update count - delta = 0L; - f.tryAwaitLock(tab, i); - } - else if (f.casHash(fh, fh | LOCKED)) { - try { - if (tabAt(tab, i) == f) { - for (Node e = f; e != null; e = e.next) { - e.val = null; - --delta; + else if (!wasUncontended) // CAS already known to fail + wasUncontended = true; // Continue after rehash + else if (U.compareAndSwapLong(a, CELLVALUE, v = a.value, v + x)) + break; + else if (counterCells != as || n >= NCPU) + collide = false; // At max size or stale + else if (!collide) + collide = true; + else if (counterBusy == 0 && + U.compareAndSwapInt(this, COUNTERBUSY, 0, 1)) { + try { + if (counterCells == as) {// Expand table unless stale + CounterCell[] rs = new CounterCell[n << 1]; + for (int i = 0; i < n; ++i) + rs[i] = as[i]; + counterCells = rs; } - setTabAt(tab, i, null); - ++i; + } finally { + counterBusy = 0; } - } finally { - if (!f.casHash(fh | LOCKED, fh)) { - f.hash = fh; - synchronized (f) { f.notifyAll(); }; + collide = false; + continue; // Retry with expanded table + } + h ^= h << 13; // Rehash + h ^= h >>> 17; + h ^= h << 5; + } + else if (counterBusy == 0 && counterCells == as && + U.compareAndSwapInt(this, COUNTERBUSY, 0, 1)) { + boolean init = false; + try { // Initialize table + if (counterCells == as) { + CounterCell[] rs = new CounterCell[2]; + rs[h & 1] = new CounterCell(x); + counterCells = rs; + init = true; } + } finally { + counterBusy = 0; } + if (init) + break; } + else if (U.compareAndSwapLong(this, BASECOUNT, v = baseCount, v + x)) + break; // Fall back on using base } - if (delta != 0) - counter.add(delta); + hc.code = h; // Record index for next time } /* ----------------Table Traversal -------------- */ /** * Encapsulates traversal for methods such as containsValue; also - * serves as a base class for other iterators. + * serves as a base class for other iterators and bulk tasks. * * At each step, the iterator snapshots the key ("nextKey") and * value ("nextVal") of a valid node (i.e., one that, at point of @@ -2230,7 +2242,8 @@ public class ConcurrentHashMapV8 * change (including to null, indicating deletion), field nextVal * might not be accurate at point of use, but still maintains the * weak consistency property of holding a value that was once - * valid. + * valid. To support iterator.remove, the nextKey field is not + * updated (nulled out) when the iterator cannot advance. * * Internal traversals directly access these fields, as in: * {@code while (it.advance() != null) { process(it.nextKey); }} @@ -2257,64 +2270,75 @@ public class ConcurrentHashMapV8 * across threads, iteration terminates if a bounds checks fails * for a table read. * - * This class extends ForkJoinTask to streamline parallel - * iteration in bulk operations (see BulkTask). This adds only an - * int of space overhead, which is close enough to negligible in - * cases where it is not needed to not worry about it. + * This class extends CountedCompleter to streamline parallel + * iteration in bulk operations. This adds only a few fields of + * space overhead, which is small enough in cases where it is not + * needed to not worry about it. Because CountedCompleter is + * Serializable, but iterators need not be, we need to add warning + * suppressions. */ - static class Traverser extends ForkJoinTask { + @SuppressWarnings("serial") static class Traverser + extends CountedCompleter { final ConcurrentHashMapV8 map; - Node next; // the next entry to use - Node last; // the last entry used + Node next; // the next entry to use Object nextKey; // cached key field of next - Object nextVal; // cached val field of next - Node[] tab; // current table; updated if resized + V nextVal; // cached val field of next + Node[] tab; // current table; updated if resized int index; // index of bin to use next int baseIndex; // current index of initial table int baseLimit; // index bound for initial table - final int baseSize; // initial table size + int baseSize; // initial table size + int batch; // split control /** Creates iterator for all entries in the table. */ Traverser(ConcurrentHashMapV8 map) { - this.tab = (this.map = map).table; - baseLimit = baseSize = (tab == null) ? 0 : tab.length; + this.map = map; } - /** Creates iterator for split() methods */ - Traverser(Traverser it, boolean split) { - this.map = it.map; - this.tab = it.tab; - this.baseSize = it.baseSize; - int lo = it.baseIndex; - int hi = this.baseLimit = it.baseLimit; - int i; - if (split) // adjust parent - i = it.baseLimit = (lo + hi + 1) >>> 1; - else // clone parent - i = lo; - this.index = this.baseIndex = i; + /** Creates iterator for split() methods and task constructors */ + Traverser(ConcurrentHashMapV8 map, Traverser it, int batch) { + super(it); + this.batch = batch; + if ((this.map = map) != null && it != null) { // split parent + Node[] t; + if ((t = it.tab) == null && + (t = it.tab = map.table) != null) + it.baseLimit = it.baseSize = t.length; + this.tab = t; + this.baseSize = it.baseSize; + int hi = this.baseLimit = it.baseLimit; + it.baseLimit = this.index = this.baseIndex = + (hi + it.baseIndex + 1) >>> 1; + } } /** * Advances next; returns nextVal or null if terminated. * See above for explanation. */ - final Object advance() { - Node e = last = next; - Object ev = null; + @SuppressWarnings("unchecked") final V advance() { + Node e = next; + V ev = null; outer: do { if (e != null) // advance past used/skipped node e = e.next; while (e == null) { // get to next non-null bin - Node[] t; int b, i, n; Object ek; // checks must use locals - if ((b = baseIndex) >= baseLimit || (i = index) < 0 || - (t = tab) == null || i >= (n = t.length)) + ConcurrentHashMapV8 m; + Node[] t; int b, i, n; Object ek; // must use locals + if ((t = tab) != null) + n = t.length; + else if ((m = map) != null && (t = tab = m.table) != null) + n = baseLimit = baseSize = t.length; + else + break outer; + if ((b = baseIndex) >= baseLimit || + (i = index) < 0 || i >= n) break outer; - else if ((e = tabAt(t, i)) != null && e.hash == MOVED) { + if ((e = tabAt(t, i)) != null && e.hash < 0) { if ((ek = e.key) instanceof TreeBin) - e = ((TreeBin)ek).first; + e = ((TreeBin)ek).first; else { - tab = (Node[])ek; + tab = (Node[])ek; continue; // restarts due to null val } } // visit upper slots if present @@ -2327,13 +2351,10 @@ public class ConcurrentHashMapV8 } public final void remove() { - if (nextVal == null) - advance(); - Node e = last; - if (e == null) + Object k = nextKey; + if (k == null && (advance() == null || (k = nextKey) == null)) throw new IllegalStateException(); - last = null; - map.remove(e.key); + map.internalReplace(k, null, null); } public final boolean hasNext() { @@ -2341,9 +2362,39 @@ public class ConcurrentHashMapV8 } public final boolean hasMoreElements() { return hasNext(); } - public final void setRawResult(Object x) { } - public R getRawResult() { return null; } - public boolean exec() { return true; } + + public void compute() { } // default no-op CountedCompleter body + + /** + * Returns a batch value > 0 if this task should (and must) be + * split, if so, adding to pending count, and in any case + * updating batch value. The initial batch value is approx + * exp2 of the number of times (minus one) to split task by + * two before executing leaf action. This value is faster to + * compute and more convenient to use as a guide to splitting + * than is the depth, since it is used while dividing by two + * anyway. + */ + final int preSplit() { + ConcurrentHashMapV8 m; int b; Node[] t; ForkJoinPool pool; + if ((b = batch) < 0 && (m = map) != null) { // force initialization + if ((t = tab) == null && (t = tab = m.table) != null) + baseLimit = baseSize = t.length; + if (t != null) { + long n = m.sumCount(); + int par = ((pool = getPool()) == null) ? + ForkJoinPool.getCommonPoolParallelism() : + pool.getParallelism(); + int sp = par << 3; // slack of 8 + b = (n <= 0L) ? 0 : (n < (long)sp) ? (int)n : sp; + } + } + b = (b <= 1 || baseIndex == baseLimit) ? 0 : (b >>> 1); + if ((batch = b) > 0) + addToPendingCount(1); + return b; + } + } /* ---------------- Public operations -------------- */ @@ -2352,7 +2403,6 @@ public class ConcurrentHashMapV8 * Creates a new, empty map with the default initial table size (16). */ public ConcurrentHashMapV8() { - this.counter = new LongAdder(); } /** @@ -2371,7 +2421,6 @@ public class ConcurrentHashMapV8 int cap = ((initialCapacity >= (MAXIMUM_CAPACITY >>> 1)) ? MAXIMUM_CAPACITY : tableSizeFor(initialCapacity + (initialCapacity >>> 1) + 1)); - this.counter = new LongAdder(); this.sizeCtl = cap; } @@ -2381,7 +2430,6 @@ public class ConcurrentHashMapV8 * @param m the map */ public ConcurrentHashMapV8(Map m) { - this.counter = new LongAdder(); this.sizeCtl = DEFAULT_CAPACITY; internalPutAll(m); } @@ -2432,22 +2480,47 @@ public class ConcurrentHashMapV8 long size = (long)(1.0 + (long)initialCapacity / loadFactor); int cap = (size >= (long)MAXIMUM_CAPACITY) ? MAXIMUM_CAPACITY : tableSizeFor((int)size); - this.counter = new LongAdder(); this.sizeCtl = cap; } /** + * Creates a new {@link Set} backed by a ConcurrentHashMapV8 + * from the given type to {@code Boolean.TRUE}. + * + * @return the new set + */ + public static KeySetView newKeySet() { + return new KeySetView(new ConcurrentHashMapV8(), + Boolean.TRUE); + } + + /** + * Creates a new {@link Set} backed by a ConcurrentHashMapV8 + * from the given type to {@code Boolean.TRUE}. + * + * @param initialCapacity The implementation performs internal + * sizing to accommodate this many elements. + * @throws IllegalArgumentException if the initial capacity of + * elements is negative + * @return the new set + */ + public static KeySetView newKeySet(int initialCapacity) { + return new KeySetView + (new ConcurrentHashMapV8(initialCapacity), Boolean.TRUE); + } + + /** * {@inheritDoc} */ public boolean isEmpty() { - return counter.sum() <= 0L; // ignore transient negative values + return sumCount() <= 0L; // ignore transient negative values } /** * {@inheritDoc} */ public int size() { - long n = counter.sum(); + long n = sumCount(); return ((n < 0L) ? 0 : (n > (long)Integer.MAX_VALUE) ? Integer.MAX_VALUE : (int)n); @@ -2455,16 +2528,16 @@ public class ConcurrentHashMapV8 /** * Returns the number of mappings. This method should be used - * instead of {@link #size} because a ConcurrentHashMap may + * instead of {@link #size} because a ConcurrentHashMapV8 may * contain more mappings than can be represented as an int. The - * value returned is a snapshot; the actual count may differ if - * there are ongoing concurrent insertions of removals. + * value returned is an estimate; the actual count may differ if + * there are concurrent insertions or removals. * * @return the number of mappings */ public long mappingCount() { - long n = counter.sum(); - return (n < 0L) ? 0L : n; + long n = sumCount(); + return (n < 0L) ? 0L : n; // ignore transient negative values } /** @@ -2478,11 +2551,23 @@ public class ConcurrentHashMapV8 * * @throws NullPointerException if the specified key is null */ - @SuppressWarnings("unchecked") - public V get(Object key) { - if (key == null) - throw new NullPointerException(); - return (V)internalGet(key); + public V get(Object key) { + return internalGet(key); + } + + /** + * Returns the value to which the specified key is mapped, + * or the given defaultValue if this map contains no mapping for the key. + * + * @param key the key + * @param defaultValue the value to return if this map contains + * no mapping for the given key + * @return the mapping for the key, if present; else the defaultValue + * @throws NullPointerException if the specified key is null + */ + public V getValueOrDefault(Object key, V defaultValue) { + V v; + return (v = internalGet(key)) == null ? defaultValue : v; } /** @@ -2495,8 +2580,6 @@ public class ConcurrentHashMapV8 * @throws NullPointerException if the specified key is null */ public boolean containsKey(Object key) { - if (key == null) - throw new NullPointerException(); return internalGet(key) != null; } @@ -2513,7 +2596,7 @@ public class ConcurrentHashMapV8 public boolean containsValue(Object value) { if (value == null) throw new NullPointerException(); - Object v; + V v; Traverser it = new Traverser(this); while ((v = it.advance()) != null) { if (v == value || value.equals(v)) @@ -2537,7 +2620,7 @@ public class ConcurrentHashMapV8 * {@code false} otherwise * @throws NullPointerException if the specified value is null */ - public boolean contains(Object value) { + @Deprecated public boolean contains(Object value) { return containsValue(value); } @@ -2545,7 +2628,7 @@ public class ConcurrentHashMapV8 * Maps the specified key to the specified value in this table. * Neither the key nor the value can be null. * - *

The value can be retrieved by calling the {@code get} method + *

The value can be retrieved by calling the {@code get} method * with a key that is equal to the original key. * * @param key key with which the specified value is to be associated @@ -2554,11 +2637,8 @@ public class ConcurrentHashMapV8 * {@code null} if there was no mapping for {@code key} * @throws NullPointerException if the specified key or value is null */ - @SuppressWarnings("unchecked") - public V put(K key, V value) { - if (key == null || value == null) - throw new NullPointerException(); - return (V)internalPut(key, value); + public V put(K key, V value) { + return internalPut(key, value, false); } /** @@ -2568,11 +2648,8 @@ public class ConcurrentHashMapV8 * or {@code null} if there was no mapping for the key * @throws NullPointerException if the specified key or value is null */ - @SuppressWarnings("unchecked") - public V putIfAbsent(K key, V value) { - if (key == null || value == null) - throw new NullPointerException(); - return (V)internalPutIfAbsent(key, value); + public V putIfAbsent(K key, V value) { + return internalPut(key, value, true); } /** @@ -2616,7 +2693,7 @@ public class ConcurrentHashMapV8 * @param key key with which the specified value is to be associated * @param mappingFunction the function to compute a value * @return the current (existing or computed) value associated with - * the specified key, or null if the computed value is null. + * the specified key, or null if the computed value is null * @throws NullPointerException if the specified key or mappingFunction * is null * @throws IllegalStateException if the computation detectably @@ -2625,11 +2702,9 @@ public class ConcurrentHashMapV8 * @throws RuntimeException or Error if the mappingFunction does so, * in which case the mapping is left unestablished */ - @SuppressWarnings("unchecked") - public V computeIfAbsent(K key, Fun mappingFunction) { - if (key == null || mappingFunction == null) - throw new NullPointerException(); - return (V)internalComputeIfAbsent(key, mappingFunction); + public V computeIfAbsent + (K key, Fun mappingFunction) { + return internalComputeIfAbsent(key, mappingFunction); } /** @@ -2657,8 +2732,7 @@ public class ConcurrentHashMapV8 * * @param key key with which the specified value is to be associated * @param remappingFunction the function to compute a value - * @return the new value associated with - * the specified key, or null if none. + * @return the new value associated with the specified key, or null if none * @throws NullPointerException if the specified key or remappingFunction * is null * @throws IllegalStateException if the computation detectably @@ -2667,10 +2741,9 @@ public class ConcurrentHashMapV8 * @throws RuntimeException or Error if the remappingFunction does so, * in which case the mapping is unchanged */ - public V computeIfPresent(K key, BiFun remappingFunction) { - if (key == null || remappingFunction == null) - throw new NullPointerException(); - return (V)internalCompute(key, true, remappingFunction); + public V computeIfPresent + (K key, BiFun remappingFunction) { + return internalCompute(key, true, remappingFunction); } /** @@ -2704,8 +2777,7 @@ public class ConcurrentHashMapV8 * * @param key key with which the specified value is to be associated * @param remappingFunction the function to compute a value - * @return the new value associated with - * the specified key, or null if none. + * @return the new value associated with the specified key, or null if none * @throws NullPointerException if the specified key or remappingFunction * is null * @throws IllegalStateException if the computation detectably @@ -2714,11 +2786,9 @@ public class ConcurrentHashMapV8 * @throws RuntimeException or Error if the remappingFunction does so, * in which case the mapping is unchanged */ - // @SuppressWarnings("unchecked") - public V compute(K key, BiFun remappingFunction) { - if (key == null || remappingFunction == null) - throw new NullPointerException(); - return (V)internalCompute(key, false, remappingFunction); + public V compute + (K key, BiFun remappingFunction) { + return internalCompute(key, false, remappingFunction); } /** @@ -2746,11 +2816,10 @@ public class ConcurrentHashMapV8 * so the computation should be short and simple, and must not * attempt to update any other mappings of this Map. */ - // @SuppressWarnings("unchecked") - public V merge(K key, V value, BiFun remappingFunction) { - if (key == null || value == null || remappingFunction == null) - throw new NullPointerException(); - return (V)internalMerge(key, value, remappingFunction); + public V merge + (K key, V value, + BiFun remappingFunction) { + return internalMerge(key, value, remappingFunction); } /** @@ -2762,11 +2831,8 @@ public class ConcurrentHashMapV8 * {@code null} if there was no mapping for {@code key} * @throws NullPointerException if the specified key is null */ - @SuppressWarnings("unchecked") - public V remove(Object key) { - if (key == null) - throw new NullPointerException(); - return (V)internalReplace(key, null, null); + public V remove(Object key) { + return internalReplace(key, null, null); } /** @@ -2775,11 +2841,7 @@ public class ConcurrentHashMapV8 * @throws NullPointerException if the specified key is null */ public boolean remove(Object key, Object value) { - if (key == null) - throw new NullPointerException(); - if (value == null) - return false; - return internalReplace(key, null, value) != null; + return value != null && internalReplace(key, null, value) != null; } /** @@ -2800,11 +2862,10 @@ public class ConcurrentHashMapV8 * or {@code null} if there was no mapping for the key * @throws NullPointerException if the specified key or value is null */ - @SuppressWarnings("unchecked") - public V replace(K key, V value) { + public V replace(K key, V value) { if (key == null || value == null) throw new NullPointerException(); - return (V)internalReplace(key, value, null); + return internalReplace(key, value, null); } /** @@ -2817,43 +2878,40 @@ public class ConcurrentHashMapV8 /** * Returns a {@link Set} view of the keys contained in this map. * The set is backed by the map, so changes to the map are - * reflected in the set, and vice-versa. The set supports element - * removal, which removes the corresponding mapping from this map, - * via the {@code Iterator.remove}, {@code Set.remove}, - * {@code removeAll}, {@code retainAll}, and {@code clear} - * operations. It does not support the {@code add} or - * {@code addAll} operations. + * reflected in the set, and vice-versa. * - *

The view's {@code iterator} is a "weakly consistent" iterator - * that will never throw {@link ConcurrentModificationException}, - * and guarantees to traverse elements as they existed upon - * construction of the iterator, and may (but is not guaranteed to) - * reflect any modifications subsequent to construction. + * @return the set view + */ + public KeySetView keySet() { + KeySetView ks = keySet; + return (ks != null) ? ks : (keySet = new KeySetView(this, null)); + } + + /** + * Returns a {@link Set} view of the keys in this map, using the + * given common mapped value for any additions (i.e., {@link + * Collection#add} and {@link Collection#addAll}). This is of + * course only appropriate if it is acceptable to use the same + * value for all additions from this view. + * + * @param mappedValue the mapped value to use for any additions + * @return the set view + * @throws NullPointerException if the mappedValue is null */ - public Set keySet() { - KeySet ks = keySet; - return (ks != null) ? ks : (keySet = new KeySet(this)); + public KeySetView keySet(V mappedValue) { + if (mappedValue == null) + throw new NullPointerException(); + return new KeySetView(this, mappedValue); } /** * Returns a {@link Collection} view of the values contained in this map. * The collection is backed by the map, so changes to the map are - * reflected in the collection, and vice-versa. The collection - * supports element removal, which removes the corresponding - * mapping from this map, via the {@code Iterator.remove}, - * {@code Collection.remove}, {@code removeAll}, - * {@code retainAll}, and {@code clear} operations. It does not - * support the {@code add} or {@code addAll} operations. - * - *

The view's {@code iterator} is a "weakly consistent" iterator - * that will never throw {@link ConcurrentModificationException}, - * and guarantees to traverse elements as they existed upon - * construction of the iterator, and may (but is not guaranteed to) - * reflect any modifications subsequent to construction. + * reflected in the collection, and vice-versa. */ - public Collection values() { - Values vs = values; - return (vs != null) ? vs : (values = new Values(this)); + public ValuesView values() { + ValuesView vs = values; + return (vs != null) ? vs : (values = new ValuesView(this)); } /** @@ -2873,8 +2931,8 @@ public class ConcurrentHashMapV8 * reflect any modifications subsequent to construction. */ public Set> entrySet() { - EntrySet es = entrySet; - return (es != null) ? es : (entrySet = new EntrySet(this)); + EntrySetView es = entrySet; + return (es != null) ? es : (entrySet = new EntrySetView(this)); } /** @@ -2934,7 +2992,7 @@ public class ConcurrentHashMapV8 public int hashCode() { int h = 0; Traverser it = new Traverser(this); - Object v; + V v; while ((v = it.advance()) != null) { h += it.nextKey.hashCode() ^ v.hashCode(); } @@ -2956,7 +3014,7 @@ public class ConcurrentHashMapV8 Traverser it = new Traverser(this); StringBuilder sb = new StringBuilder(); sb.append('{'); - Object v; + V v; if ((v = it.advance()) != null) { for (;;) { Object k = it.nextKey; @@ -2987,7 +3045,7 @@ public class ConcurrentHashMapV8 return false; Map m = (Map) o; Traverser it = new Traverser(this); - Object val; + V val; while ((val = it.advance()) != null) { Object v = m.get(it.nextKey); if (v == null || (v != val && !v.equals(val))) @@ -3007,19 +3065,19 @@ public class ConcurrentHashMapV8 /* ----------------Iterators -------------- */ - static final class KeyIterator extends Traverser + @SuppressWarnings("serial") static final class KeyIterator + extends Traverser implements Spliterator, Enumeration { KeyIterator(ConcurrentHashMapV8 map) { super(map); } - KeyIterator(Traverser it, boolean split) { - super(it, split); + KeyIterator(ConcurrentHashMapV8 map, Traverser it) { + super(map, it, -1); } public KeyIterator split() { - if (last != null || (next != null && nextVal == null)) + if (nextKey != null) throw new IllegalStateException(); - return new KeyIterator(this, true); + return new KeyIterator(map, this); } - @SuppressWarnings("unchecked") - public final K next() { + @SuppressWarnings("unchecked") public final K next() { if (nextVal == null && advance() == null) throw new NoSuchElementException(); Object k = nextKey; @@ -3030,50 +3088,50 @@ public class ConcurrentHashMapV8 public final K nextElement() { return next(); } } - static final class ValueIterator extends Traverser + @SuppressWarnings("serial") static final class ValueIterator + extends Traverser implements Spliterator, Enumeration { ValueIterator(ConcurrentHashMapV8 map) { super(map); } - ValueIterator(Traverser it, boolean split) { - super(it, split); + ValueIterator(ConcurrentHashMapV8 map, Traverser it) { + super(map, it, -1); } public ValueIterator split() { - if (last != null || (next != null && nextVal == null)) + if (nextKey != null) throw new IllegalStateException(); - return new ValueIterator(this, true); + return new ValueIterator(map, this); } - @SuppressWarnings("unchecked") - public final V next() { - Object v; + public final V next() { + V v; if ((v = nextVal) == null && (v = advance()) == null) throw new NoSuchElementException(); nextVal = null; - return (V) v; + return v; } public final V nextElement() { return next(); } } - static final class EntryIterator extends Traverser + @SuppressWarnings("serial") static final class EntryIterator + extends Traverser implements Spliterator> { EntryIterator(ConcurrentHashMapV8 map) { super(map); } - EntryIterator(Traverser it, boolean split) { - super(it, split); + EntryIterator(ConcurrentHashMapV8 map, Traverser it) { + super(map, it, -1); } public EntryIterator split() { - if (last != null || (next != null && nextVal == null)) + if (nextKey != null) throw new IllegalStateException(); - return new EntryIterator(this, true); + return new EntryIterator(map, this); } - @SuppressWarnings("unchecked") - public final Map.Entry next() { - Object v; + @SuppressWarnings("unchecked") public final Map.Entry next() { + V v; if ((v = nextVal) == null && (v = advance()) == null) throw new NoSuchElementException(); Object k = nextKey; nextVal = null; - return new MapEntry((K)k, (V)v, map); + return new MapEntry((K)k, v, map); } } @@ -3120,222 +3178,12 @@ public class ConcurrentHashMapV8 } } - /* ----------------Views -------------- */ - /** - * Base class for views. + * Returns exportable snapshot entry for the given key and value + * when write-through can't or shouldn't be used. */ - static abstract class CHMView { - final ConcurrentHashMapV8 map; - CHMView(ConcurrentHashMapV8 map) { this.map = map; } - public final int size() { return map.size(); } - public final boolean isEmpty() { return map.isEmpty(); } - public final void clear() { map.clear(); } - - // implementations below rely on concrete classes supplying these - abstract public Iterator iterator(); - abstract public boolean contains(Object o); - abstract public boolean remove(Object o); - - private static final String oomeMsg = "Required array size too large"; - - public final Object[] toArray() { - long sz = map.mappingCount(); - if (sz > (long)(MAX_ARRAY_SIZE)) - throw new OutOfMemoryError(oomeMsg); - int n = (int)sz; - Object[] r = new Object[n]; - int i = 0; - Iterator it = iterator(); - while (it.hasNext()) { - if (i == n) { - if (n >= MAX_ARRAY_SIZE) - throw new OutOfMemoryError(oomeMsg); - if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1) - n = MAX_ARRAY_SIZE; - else - n += (n >>> 1) + 1; - r = Arrays.copyOf(r, n); - } - r[i++] = it.next(); - } - return (i == n) ? r : Arrays.copyOf(r, i); - } - - @SuppressWarnings("unchecked") - public final T[] toArray(T[] a) { - long sz = map.mappingCount(); - if (sz > (long)(MAX_ARRAY_SIZE)) - throw new OutOfMemoryError(oomeMsg); - int m = (int)sz; - T[] r = (a.length >= m) ? a : - (T[])java.lang.reflect.Array - .newInstance(a.getClass().getComponentType(), m); - int n = r.length; - int i = 0; - Iterator it = iterator(); - while (it.hasNext()) { - if (i == n) { - if (n >= MAX_ARRAY_SIZE) - throw new OutOfMemoryError(oomeMsg); - if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1) - n = MAX_ARRAY_SIZE; - else - n += (n >>> 1) + 1; - r = Arrays.copyOf(r, n); - } - r[i++] = (T)it.next(); - } - if (a == r && i < n) { - r[i] = null; // null-terminate - return r; - } - return (i == n) ? r : Arrays.copyOf(r, i); - } - - public final int hashCode() { - int h = 0; - for (Iterator it = iterator(); it.hasNext();) - h += it.next().hashCode(); - return h; - } - - public final String toString() { - StringBuilder sb = new StringBuilder(); - sb.append('['); - Iterator it = iterator(); - if (it.hasNext()) { - for (;;) { - Object e = it.next(); - sb.append(e == this ? "(this Collection)" : e); - if (!it.hasNext()) - break; - sb.append(',').append(' '); - } - } - return sb.append(']').toString(); - } - - public final boolean containsAll(Collection c) { - if (c != this) { - for (Iterator it = c.iterator(); it.hasNext();) { - Object e = it.next(); - if (e == null || !contains(e)) - return false; - } - } - return true; - } - - public final boolean removeAll(Collection c) { - boolean modified = false; - for (Iterator it = iterator(); it.hasNext();) { - if (c.contains(it.next())) { - it.remove(); - modified = true; - } - } - return modified; - } - - public final boolean retainAll(Collection c) { - boolean modified = false; - for (Iterator it = iterator(); it.hasNext();) { - if (!c.contains(it.next())) { - it.remove(); - modified = true; - } - } - return modified; - } - - } - - static final class KeySet extends CHMView implements Set { - KeySet(ConcurrentHashMapV8 map) { - super(map); - } - public final boolean contains(Object o) { return map.containsKey(o); } - public final boolean remove(Object o) { return map.remove(o) != null; } - public final Iterator iterator() { - return new KeyIterator(map); - } - public final boolean add(K e) { - throw new UnsupportedOperationException(); - } - public final boolean addAll(Collection c) { - throw new UnsupportedOperationException(); - } - public boolean equals(Object o) { - Set c; - return ((o instanceof Set) && - ((c = (Set)o) == this || - (containsAll(c) && c.containsAll(this)))); - } - } - - - static final class Values extends CHMView - implements Collection { - Values(ConcurrentHashMapV8 map) { super(map); } - public final boolean contains(Object o) { return map.containsValue(o); } - public final boolean remove(Object o) { - if (o != null) { - Iterator it = new ValueIterator(map); - while (it.hasNext()) { - if (o.equals(it.next())) { - it.remove(); - return true; - } - } - } - return false; - } - public final Iterator iterator() { - return new ValueIterator(map); - } - public final boolean add(V e) { - throw new UnsupportedOperationException(); - } - public final boolean addAll(Collection c) { - throw new UnsupportedOperationException(); - } - - } - - static final class EntrySet extends CHMView - implements Set> { - EntrySet(ConcurrentHashMapV8 map) { super(map); } - public final boolean contains(Object o) { - Object k, v, r; Map.Entry e; - return ((o instanceof Map.Entry) && - (k = (e = (Map.Entry)o).getKey()) != null && - (r = map.get(k)) != null && - (v = e.getValue()) != null && - (v == r || v.equals(r))); - } - public final boolean remove(Object o) { - Object k, v; Map.Entry e; - return ((o instanceof Map.Entry) && - (k = (e = (Map.Entry)o).getKey()) != null && - (v = e.getValue()) != null && - map.remove(k, v)); - } - public final Iterator> iterator() { - return new EntryIterator(map); - } - public final boolean add(Entry e) { - throw new UnsupportedOperationException(); - } - public final boolean addAll(Collection> c) { - throw new UnsupportedOperationException(); - } - public boolean equals(Object o) { - Set c; - return ((o instanceof Set) && - ((c = (Set)o) == this || - (containsAll(c) && c.containsAll(this)))); - } + static AbstractMap.SimpleEntry entryFor(K k, V v) { + return new AbstractMap.SimpleEntry(k, v); } /* ---------------- Serialization Support -------------- */ @@ -3359,8 +3207,8 @@ public class ConcurrentHashMapV8 * for each key-value mapping, followed by a null pair. * The key-value mappings are emitted in no particular order. */ - @SuppressWarnings("unchecked") - private void writeObject(java.io.ObjectOutputStream s) + @SuppressWarnings("unchecked") private void writeObject + (java.io.ObjectOutputStream s) throws java.io.IOException { if (segments == null) { // for serialization compatibility segments = (Segment[]) @@ -3370,7 +3218,7 @@ public class ConcurrentHashMapV8 } s.defaultWriteObject(); Traverser it = new Traverser(this); - Object v; + V v; while ((v = it.advance()) != null) { s.writeObject(it.nextKey); s.writeObject(v); @@ -3384,23 +3232,21 @@ public class ConcurrentHashMapV8 * Reconstitutes the instance from a stream (that is, deserializes it). * @param s the stream */ - @SuppressWarnings("unchecked") - private void readObject(java.io.ObjectInputStream s) + @SuppressWarnings("unchecked") private void readObject + (java.io.ObjectInputStream s) throws java.io.IOException, ClassNotFoundException { s.defaultReadObject(); this.segments = null; // unneeded - // initialize transient final field - UNSAFE.putObjectVolatile(this, counterOffset, new LongAdder()); // Create all nodes, then place in table once size is known long size = 0L; - Node p = null; + Node p = null; for (;;) { K k = (K) s.readObject(); V v = (V) s.readObject(); if (k != null && v != null) { int h = spread(k.hashCode()); - p = new Node(h, k, v, p); + p = new Node(h, k, v, p); ++size; } else @@ -3418,33 +3264,34 @@ public class ConcurrentHashMapV8 int sc = sizeCtl; boolean collide = false; if (n > sc && - UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) { + U.compareAndSwapInt(this, SIZECTL, sc, -1)) { try { if (table == null) { init = true; - Node[] tab = new Node[n]; + @SuppressWarnings("rawtypes") Node[] rt = new Node[n]; + Node[] tab = (Node[])rt; int mask = n - 1; while (p != null) { int j = p.hash & mask; - Node next = p.next; - Node q = p.next = tabAt(tab, j); + Node next = p.next; + Node q = p.next = tabAt(tab, j); setTabAt(tab, j, p); if (!collide && q != null && q.hash == p.hash) collide = true; p = next; } table = tab; - counter.add(size); + addCount(size, -1); sc = n - (n >>> 2); } } finally { sizeCtl = sc; } if (collide) { // rescan and convert to TreeBins - Node[] tab = table; + Node[] tab = table; for (int i = 0; i < tab.length; ++i) { int c = 0; - for (Node e = tabAt(tab, i); e != null; e = e.next) { + for (Node e = tabAt(tab, i); e != null; e = e.next) { if (++c > TREE_THRESHOLD && (e.key instanceof Comparable)) { replaceWithTreeBin(tab, i, e.key); @@ -3456,14 +3303,13 @@ public class ConcurrentHashMapV8 } if (!init) { // Can only happen if unsafely published. while (p != null) { - internalPut(p.key, p.val); + internalPut((K)p.key, p.val, false); p = p.next; } } } } - // ------------------------------------------------------- // Sams @@ -3505,636 +3351,1540 @@ public class ConcurrentHashMapV8 // ------------------------------------------------------- + // Sequential bulk operations + /** - * Returns an extended {@link Parallel} view of this map using the - * given executor for bulk parallel operations. + * Performs the given action for each (key, value). * - * @param executor the executor - * @return a parallel view + * @param action the action */ - public Parallel parallel(ForkJoinPool executor) { - return new Parallel(executor); + @SuppressWarnings("unchecked") public void forEachSequentially + (BiAction action) { + if (action == null) throw new NullPointerException(); + Traverser it = new Traverser(this); + V v; + while ((v = it.advance()) != null) + action.apply((K)it.nextKey, v); } /** - * An extended view of a ConcurrentHashMap supporting bulk - * parallel operations. These operations are designed to be - * safely, and often sensibly, applied even with maps that are - * being concurrently updated by other threads; for example, when - * computing a snapshot summary of the values in a shared - * registry. There are three kinds of operation, each with four - * forms, accepting functions with Keys, Values, Entries, and - * (Key, Value) arguments and/or return values. Because the - * elements of a ConcurrentHashMap are not ordered in any - * particular way, and may be processed in different orders in - * different parallel executions, the correctness of supplied - * functions should not depend on any ordering, or on any other - * objects or values that may transiently change while computation - * is in progress; and except for forEach actions, should ideally - * be side-effect-free. - * - *

- * - *

The concurrency properties of the bulk operations follow - * from those of ConcurrentHashMap: Any non-null result returned - * from {@code get(key)} and related access methods bears a - * happens-before relation with the associated insertion or - * update. The result of any bulk operation reflects the - * composition of these per-element relations (but is not - * necessarily atomic with respect to the map as a whole unless it - * is somehow known to be quiescent). Conversely, because keys - * and values in the map are never null, null serves as a reliable - * atomic indicator of the current lack of any result. To - * maintain this property, null serves as an implicit basis for - * all non-scalar reduction operations. For the double, long, and - * int versions, the basis should be one that, when combined with - * any other value, returns that other value (more formally, it - * should be the identity element for the reduction). Most common - * reductions have these properties; for example, computing a sum - * with basis 0 or a minimum with basis MAX_VALUE. - * - *

Search and transformation functions provided as arguments - * should similarly return null to indicate the lack of any result - * (in which case it is not used). In the case of mapped - * reductions, this also enables transformations to serve as - * filters, returning null (or, in the case of primitive - * specializations, the identity basis) if the element should not - * be combined. You can create compound transformations and - * filterings by composing them yourself under this "null means - * there is nothing there now" rule before using them in search or - * reduce operations. - * - *

Methods accepting and/or returning Entry arguments maintain - * key-value associations. They may be useful for example when - * finding the key for the greatest value. Note that "plain" Entry - * arguments can be supplied using {@code new - * AbstractMap.SimpleEntry(k,v)}. - * - *

Bulk operations may complete abruptly, throwing an - * exception encountered in the application of a supplied - * function. Bear in mind when handling such exceptions that other - * concurrently executing functions could also have thrown - * exceptions, or would have done so if the first exception had - * not occurred. - * - *

Parallel speedups compared to sequential processing are - * common but not guaranteed. Operations involving brief - * functions on small maps may execute more slowly than sequential - * loops if the underlying work to parallelize the computation is - * more expensive than the computation itself. Similarly, - * parallelization may not lead to much actual parallelism if all - * processors are busy performing unrelated tasks. - * - *

All arguments to all task methods must be non-null. - * - *

jsr166e note: During transition, this class - * uses nested functional interfaces with different names but the - * same forms as those expected for JDK8. + * Performs the given action for each non-null transformation + * of each (key, value). + * + * @param transformer a function returning the transformation + * for an element, or null if there is no transformation (in + * which case the action is not applied) + * @param action the action */ - public class Parallel { - final ForkJoinPool fjp; - - /** - * Returns an extended view of this map using the given - * executor for bulk parallel operations. - * - * @param executor the executor - */ - public Parallel(ForkJoinPool executor) { - this.fjp = executor; + @SuppressWarnings("unchecked") public void forEachSequentially + (BiFun transformer, + Action action) { + if (transformer == null || action == null) + throw new NullPointerException(); + Traverser it = new Traverser(this); + V v; U u; + while ((v = it.advance()) != null) { + if ((u = transformer.apply((K)it.nextKey, v)) != null) + action.apply(u); } + } - /** - * Performs the given action for each (key, value). - * - * @param action the action - */ - public void forEach(BiAction action) { - fjp.invoke(ForkJoinTasks.forEach - (ConcurrentHashMapV8.this, action)); + /** + * Returns a non-null result from applying the given search + * function on each (key, value), or null if none. + * + * @param searchFunction a function returning a non-null + * result on success, else null + * @return a non-null result from applying the given search + * function on each (key, value), or null if none + */ + @SuppressWarnings("unchecked") public U searchSequentially + (BiFun searchFunction) { + if (searchFunction == null) throw new NullPointerException(); + Traverser it = new Traverser(this); + V v; U u; + while ((v = it.advance()) != null) { + if ((u = searchFunction.apply((K)it.nextKey, v)) != null) + return u; } + return null; + } - /** - * Performs the given action for each non-null transformation - * of each (key, value). - * - * @param transformer a function returning the transformation - * for an element, or null of there is no transformation (in - * which case the action is not applied). - * @param action the action - */ - public void forEach(BiFun transformer, - Action action) { - fjp.invoke(ForkJoinTasks.forEach - (ConcurrentHashMapV8.this, transformer, action)); + /** + * Returns the result of accumulating the given transformation + * of all (key, value) pairs using the given reducer to + * combine values, or null if none. + * + * @param transformer a function returning the transformation + * for an element, or null if there is no transformation (in + * which case it is not combined) + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all (key, value) pairs + */ + @SuppressWarnings("unchecked") public U reduceSequentially + (BiFun transformer, + BiFun reducer) { + if (transformer == null || reducer == null) + throw new NullPointerException(); + Traverser it = new Traverser(this); + U r = null, u; V v; + while ((v = it.advance()) != null) { + if ((u = transformer.apply((K)it.nextKey, v)) != null) + r = (r == null) ? u : reducer.apply(r, u); } + return r; + } - /** - * Returns a non-null result from applying the given search - * function on each (key, value), or null if none. Further - * element processing is suppressed upon success. However, - * this method does not return until other in-progress - * parallel invocations of the search function also complete. - * - * @param searchFunction a function returning a non-null - * result on success, else null - * @return a non-null result from applying the given search - * function on each (key, value), or null if none - */ - public U search(BiFun searchFunction) { - return fjp.invoke(ForkJoinTasks.search - (ConcurrentHashMapV8.this, searchFunction)); - } + /** + * Returns the result of accumulating the given transformation + * of all (key, value) pairs using the given reducer to + * combine values, and the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all (key, value) pairs + */ + @SuppressWarnings("unchecked") public double reduceToDoubleSequentially + (ObjectByObjectToDouble transformer, + double basis, + DoubleByDoubleToDouble reducer) { + if (transformer == null || reducer == null) + throw new NullPointerException(); + Traverser it = new Traverser(this); + double r = basis; V v; + while ((v = it.advance()) != null) + r = reducer.apply(r, transformer.apply((K)it.nextKey, v)); + return r; + } - /** - * Returns the result of accumulating the given transformation - * of all (key, value) pairs using the given reducer to - * combine values, or null if none. - * - * @param transformer a function returning the transformation - * for an element, or null of there is no transformation (in - * which case it is not combined). - * @param reducer a commutative associative combining function - * @return the result of accumulating the given transformation - * of all (key, value) pairs - */ - public U reduce(BiFun transformer, - BiFun reducer) { - return fjp.invoke(ForkJoinTasks.reduce - (ConcurrentHashMapV8.this, transformer, reducer)); - } + /** + * Returns the result of accumulating the given transformation + * of all (key, value) pairs using the given reducer to + * combine values, and the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all (key, value) pairs + */ + @SuppressWarnings("unchecked") public long reduceToLongSequentially + (ObjectByObjectToLong transformer, + long basis, + LongByLongToLong reducer) { + if (transformer == null || reducer == null) + throw new NullPointerException(); + Traverser it = new Traverser(this); + long r = basis; V v; + while ((v = it.advance()) != null) + r = reducer.apply(r, transformer.apply((K)it.nextKey, v)); + return r; + } - /** - * Returns the result of accumulating the given transformation - * of all (key, value) pairs using the given reducer to - * combine values, and the given basis as an identity value. - * - * @param transformer a function returning the transformation - * for an element - * @param basis the identity (initial default value) for the reduction - * @param reducer a commutative associative combining function - * @return the result of accumulating the given transformation - * of all (key, value) pairs - */ - public double reduceToDouble(ObjectByObjectToDouble transformer, - double basis, - DoubleByDoubleToDouble reducer) { - return fjp.invoke(ForkJoinTasks.reduceToDouble - (ConcurrentHashMapV8.this, transformer, basis, reducer)); - } + /** + * Returns the result of accumulating the given transformation + * of all (key, value) pairs using the given reducer to + * combine values, and the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all (key, value) pairs + */ + @SuppressWarnings("unchecked") public int reduceToIntSequentially + (ObjectByObjectToInt transformer, + int basis, + IntByIntToInt reducer) { + if (transformer == null || reducer == null) + throw new NullPointerException(); + Traverser it = new Traverser(this); + int r = basis; V v; + while ((v = it.advance()) != null) + r = reducer.apply(r, transformer.apply((K)it.nextKey, v)); + return r; + } - /** - * Returns the result of accumulating the given transformation - * of all (key, value) pairs using the given reducer to - * combine values, and the given basis as an identity value. - * - * @param transformer a function returning the transformation - * for an element - * @param basis the identity (initial default value) for the reduction - * @param reducer a commutative associative combining function - * @return the result of accumulating the given transformation - * of all (key, value) pairs using the given reducer to - * combine values, and the given basis as an identity value. - */ - public long reduceToLong(ObjectByObjectToLong transformer, - long basis, - LongByLongToLong reducer) { - return fjp.invoke(ForkJoinTasks.reduceToLong - (ConcurrentHashMapV8.this, transformer, basis, reducer)); - } + /** + * Performs the given action for each key. + * + * @param action the action + */ + @SuppressWarnings("unchecked") public void forEachKeySequentially + (Action action) { + if (action == null) throw new NullPointerException(); + Traverser it = new Traverser(this); + while (it.advance() != null) + action.apply((K)it.nextKey); + } - /** - * Returns the result of accumulating the given transformation - * of all (key, value) pairs using the given reducer to - * combine values, and the given basis as an identity value. - * - * @param transformer a function returning the transformation - * for an element - * @param basis the identity (initial default value) for the reduction - * @param reducer a commutative associative combining function - * @return the result of accumulating the given transformation - * of all (key, value) pairs - */ - public int reduceToInt(ObjectByObjectToInt transformer, - int basis, - IntByIntToInt reducer) { - return fjp.invoke(ForkJoinTasks.reduceToInt - (ConcurrentHashMapV8.this, transformer, basis, reducer)); + /** + * Performs the given action for each non-null transformation + * of each key. + * + * @param transformer a function returning the transformation + * for an element, or null if there is no transformation (in + * which case the action is not applied) + * @param action the action + */ + @SuppressWarnings("unchecked") public void forEachKeySequentially + (Fun transformer, + Action action) { + if (transformer == null || action == null) + throw new NullPointerException(); + Traverser it = new Traverser(this); + U u; + while (it.advance() != null) { + if ((u = transformer.apply((K)it.nextKey)) != null) + action.apply(u); } + ForkJoinTasks.forEachKey + (this, transformer, action).invoke(); + } - /** - * Performs the given action for each key - * - * @param action the action - */ - public void forEachKey(Action action) { - fjp.invoke(ForkJoinTasks.forEachKey - (ConcurrentHashMapV8.this, action)); + /** + * Returns a non-null result from applying the given search + * function on each key, or null if none. + * + * @param searchFunction a function returning a non-null + * result on success, else null + * @return a non-null result from applying the given search + * function on each key, or null if none + */ + @SuppressWarnings("unchecked") public U searchKeysSequentially + (Fun searchFunction) { + Traverser it = new Traverser(this); + U u; + while (it.advance() != null) { + if ((u = searchFunction.apply((K)it.nextKey)) != null) + return u; } + return null; + } - /** - * Performs the given action for each non-null transformation - * of each key - * - * @param transformer a function returning the transformation - * for an element, or null of there is no transformation (in - * which case the action is not applied). - * @param action the action - */ - public void forEachKey(Fun transformer, - Action action) { - fjp.invoke(ForkJoinTasks.forEachKey - (ConcurrentHashMapV8.this, transformer, action)); + /** + * Returns the result of accumulating all keys using the given + * reducer to combine values, or null if none. + * + * @param reducer a commutative associative combining function + * @return the result of accumulating all keys using the given + * reducer to combine values, or null if none + */ + @SuppressWarnings("unchecked") public K reduceKeysSequentially + (BiFun reducer) { + if (reducer == null) throw new NullPointerException(); + Traverser it = new Traverser(this); + K r = null; + while (it.advance() != null) { + K u = (K)it.nextKey; + r = (r == null) ? u : reducer.apply(r, u); + } + return r; + } + + /** + * Returns the result of accumulating the given transformation + * of all keys using the given reducer to combine values, or + * null if none. + * + * @param transformer a function returning the transformation + * for an element, or null if there is no transformation (in + * which case it is not combined) + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all keys + */ + @SuppressWarnings("unchecked") public U reduceKeysSequentially + (Fun transformer, + BiFun reducer) { + if (transformer == null || reducer == null) + throw new NullPointerException(); + Traverser it = new Traverser(this); + U r = null, u; + while (it.advance() != null) { + if ((u = transformer.apply((K)it.nextKey)) != null) + r = (r == null) ? u : reducer.apply(r, u); } + return r; + } - /** - * Returns a non-null result from applying the given search - * function on each key, or null if none. Further element - * processing is suppressed upon success. However, this method - * does not return until other in-progress parallel - * invocations of the search function also complete. - * - * @param searchFunction a function returning a non-null - * result on success, else null - * @return a non-null result from applying the given search - * function on each key, or null if none - */ - public U searchKeys(Fun searchFunction) { - return fjp.invoke(ForkJoinTasks.searchKeys - (ConcurrentHashMapV8.this, searchFunction)); + /** + * Returns the result of accumulating the given transformation + * of all keys using the given reducer to combine values, and + * the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all keys + */ + @SuppressWarnings("unchecked") public double reduceKeysToDoubleSequentially + (ObjectToDouble transformer, + double basis, + DoubleByDoubleToDouble reducer) { + if (transformer == null || reducer == null) + throw new NullPointerException(); + Traverser it = new Traverser(this); + double r = basis; + while (it.advance() != null) + r = reducer.apply(r, transformer.apply((K)it.nextKey)); + return r; + } + + /** + * Returns the result of accumulating the given transformation + * of all keys using the given reducer to combine values, and + * the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all keys + */ + @SuppressWarnings("unchecked") public long reduceKeysToLongSequentially + (ObjectToLong transformer, + long basis, + LongByLongToLong reducer) { + if (transformer == null || reducer == null) + throw new NullPointerException(); + Traverser it = new Traverser(this); + long r = basis; + while (it.advance() != null) + r = reducer.apply(r, transformer.apply((K)it.nextKey)); + return r; + } + + /** + * Returns the result of accumulating the given transformation + * of all keys using the given reducer to combine values, and + * the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all keys + */ + @SuppressWarnings("unchecked") public int reduceKeysToIntSequentially + (ObjectToInt transformer, + int basis, + IntByIntToInt reducer) { + if (transformer == null || reducer == null) + throw new NullPointerException(); + Traverser it = new Traverser(this); + int r = basis; + while (it.advance() != null) + r = reducer.apply(r, transformer.apply((K)it.nextKey)); + return r; + } + + /** + * Performs the given action for each value. + * + * @param action the action + */ + public void forEachValueSequentially(Action action) { + if (action == null) throw new NullPointerException(); + Traverser it = new Traverser(this); + V v; + while ((v = it.advance()) != null) + action.apply(v); + } + + /** + * Performs the given action for each non-null transformation + * of each value. + * + * @param transformer a function returning the transformation + * for an element, or null if there is no transformation (in + * which case the action is not applied) + */ + public void forEachValueSequentially + (Fun transformer, + Action action) { + if (transformer == null || action == null) + throw new NullPointerException(); + Traverser it = new Traverser(this); + V v; U u; + while ((v = it.advance()) != null) { + if ((u = transformer.apply(v)) != null) + action.apply(u); } + } - /** - * Returns the result of accumulating all keys using the given - * reducer to combine values, or null if none. - * - * @param reducer a commutative associative combining function - * @return the result of accumulating all keys using the given - * reducer to combine values, or null if none - */ - public K reduceKeys(BiFun reducer) { - return fjp.invoke(ForkJoinTasks.reduceKeys - (ConcurrentHashMapV8.this, reducer)); + /** + * Returns a non-null result from applying the given search + * function on each value, or null if none. + * + * @param searchFunction a function returning a non-null + * result on success, else null + * @return a non-null result from applying the given search + * function on each value, or null if none + */ + public U searchValuesSequentially + (Fun searchFunction) { + if (searchFunction == null) throw new NullPointerException(); + Traverser it = new Traverser(this); + V v; U u; + while ((v = it.advance()) != null) { + if ((u = searchFunction.apply(v)) != null) + return u; } + return null; + } - /** - * Returns the result of accumulating the given transformation - * of all keys using the given reducer to combine values, or - * null if none. - * - * @param transformer a function returning the transformation - * for an element, or null of there is no transformation (in - * which case it is not combined). - * @param reducer a commutative associative combining function - * @return the result of accumulating the given transformation - * of all keys - */ - public U reduceKeys(Fun transformer, - BiFun reducer) { - return fjp.invoke(ForkJoinTasks.reduceKeys - (ConcurrentHashMapV8.this, transformer, reducer)); + /** + * Returns the result of accumulating all values using the + * given reducer to combine values, or null if none. + * + * @param reducer a commutative associative combining function + * @return the result of accumulating all values + */ + public V reduceValuesSequentially + (BiFun reducer) { + if (reducer == null) throw new NullPointerException(); + Traverser it = new Traverser(this); + V r = null; V v; + while ((v = it.advance()) != null) + r = (r == null) ? v : reducer.apply(r, v); + return r; + } + + /** + * Returns the result of accumulating the given transformation + * of all values using the given reducer to combine values, or + * null if none. + * + * @param transformer a function returning the transformation + * for an element, or null if there is no transformation (in + * which case it is not combined) + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all values + */ + public U reduceValuesSequentially + (Fun transformer, + BiFun reducer) { + if (transformer == null || reducer == null) + throw new NullPointerException(); + Traverser it = new Traverser(this); + U r = null, u; V v; + while ((v = it.advance()) != null) { + if ((u = transformer.apply(v)) != null) + r = (r == null) ? u : reducer.apply(r, u); } + return r; + } - /** - * Returns the result of accumulating the given transformation - * of all keys using the given reducer to combine values, and - * the given basis as an identity value. - * - * @param transformer a function returning the transformation - * for an element - * @param basis the identity (initial default value) for the reduction - * @param reducer a commutative associative combining function - * @return the result of accumulating the given transformation - * of all keys - */ - public double reduceKeysToDouble(ObjectToDouble transformer, - double basis, - DoubleByDoubleToDouble reducer) { - return fjp.invoke(ForkJoinTasks.reduceKeysToDouble - (ConcurrentHashMapV8.this, transformer, basis, reducer)); + /** + * Returns the result of accumulating the given transformation + * of all values using the given reducer to combine values, + * and the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all values + */ + public double reduceValuesToDoubleSequentially + (ObjectToDouble transformer, + double basis, + DoubleByDoubleToDouble reducer) { + if (transformer == null || reducer == null) + throw new NullPointerException(); + Traverser it = new Traverser(this); + double r = basis; V v; + while ((v = it.advance()) != null) + r = reducer.apply(r, transformer.apply(v)); + return r; + } + + /** + * Returns the result of accumulating the given transformation + * of all values using the given reducer to combine values, + * and the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all values + */ + public long reduceValuesToLongSequentially + (ObjectToLong transformer, + long basis, + LongByLongToLong reducer) { + if (transformer == null || reducer == null) + throw new NullPointerException(); + Traverser it = new Traverser(this); + long r = basis; V v; + while ((v = it.advance()) != null) + r = reducer.apply(r, transformer.apply(v)); + return r; + } + + /** + * Returns the result of accumulating the given transformation + * of all values using the given reducer to combine values, + * and the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all values + */ + public int reduceValuesToIntSequentially + (ObjectToInt transformer, + int basis, + IntByIntToInt reducer) { + if (transformer == null || reducer == null) + throw new NullPointerException(); + Traverser it = new Traverser(this); + int r = basis; V v; + while ((v = it.advance()) != null) + r = reducer.apply(r, transformer.apply(v)); + return r; + } + + /** + * Performs the given action for each entry. + * + * @param action the action + */ + @SuppressWarnings("unchecked") public void forEachEntrySequentially + (Action> action) { + if (action == null) throw new NullPointerException(); + Traverser it = new Traverser(this); + V v; + while ((v = it.advance()) != null) + action.apply(entryFor((K)it.nextKey, v)); + } + + /** + * Performs the given action for each non-null transformation + * of each entry. + * + * @param transformer a function returning the transformation + * for an element, or null if there is no transformation (in + * which case the action is not applied) + * @param action the action + */ + @SuppressWarnings("unchecked") public void forEachEntrySequentially + (Fun, ? extends U> transformer, + Action action) { + if (transformer == null || action == null) + throw new NullPointerException(); + Traverser it = new Traverser(this); + V v; U u; + while ((v = it.advance()) != null) { + if ((u = transformer.apply(entryFor((K)it.nextKey, v))) != null) + action.apply(u); } + } - /** - * Returns the result of accumulating the given transformation - * of all keys using the given reducer to combine values, and - * the given basis as an identity value. - * - * @param transformer a function returning the transformation - * for an element - * @param basis the identity (initial default value) for the reduction - * @param reducer a commutative associative combining function - * @return the result of accumulating the given transformation - * of all keys - */ - public long reduceKeysToLong(ObjectToLong transformer, - long basis, - LongByLongToLong reducer) { - return fjp.invoke(ForkJoinTasks.reduceKeysToLong - (ConcurrentHashMapV8.this, transformer, basis, reducer)); + /** + * Returns a non-null result from applying the given search + * function on each entry, or null if none. + * + * @param searchFunction a function returning a non-null + * result on success, else null + * @return a non-null result from applying the given search + * function on each entry, or null if none + */ + @SuppressWarnings("unchecked") public U searchEntriesSequentially + (Fun, ? extends U> searchFunction) { + if (searchFunction == null) throw new NullPointerException(); + Traverser it = new Traverser(this); + V v; U u; + while ((v = it.advance()) != null) { + if ((u = searchFunction.apply(entryFor((K)it.nextKey, v))) != null) + return u; } + return null; + } - /** - * Returns the result of accumulating the given transformation - * of all keys using the given reducer to combine values, and - * the given basis as an identity value. - * - * @param transformer a function returning the transformation - * for an element - * @param basis the identity (initial default value) for the reduction - * @param reducer a commutative associative combining function - * @return the result of accumulating the given transformation - * of all keys - */ - public int reduceKeysToInt(ObjectToInt transformer, - int basis, - IntByIntToInt reducer) { - return fjp.invoke(ForkJoinTasks.reduceKeysToInt - (ConcurrentHashMapV8.this, transformer, basis, reducer)); + /** + * Returns the result of accumulating all entries using the + * given reducer to combine values, or null if none. + * + * @param reducer a commutative associative combining function + * @return the result of accumulating all entries + */ + @SuppressWarnings("unchecked") public Map.Entry reduceEntriesSequentially + (BiFun, Map.Entry, ? extends Map.Entry> reducer) { + if (reducer == null) throw new NullPointerException(); + Traverser it = new Traverser(this); + Map.Entry r = null; V v; + while ((v = it.advance()) != null) { + Map.Entry u = entryFor((K)it.nextKey, v); + r = (r == null) ? u : reducer.apply(r, u); } + return r; + } - /** - * Performs the given action for each value - * - * @param action the action - */ - public void forEachValue(Action action) { - fjp.invoke(ForkJoinTasks.forEachValue - (ConcurrentHashMapV8.this, action)); + /** + * Returns the result of accumulating the given transformation + * of all entries using the given reducer to combine values, + * or null if none. + * + * @param transformer a function returning the transformation + * for an element, or null if there is no transformation (in + * which case it is not combined) + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all entries + */ + @SuppressWarnings("unchecked") public U reduceEntriesSequentially + (Fun, ? extends U> transformer, + BiFun reducer) { + if (transformer == null || reducer == null) + throw new NullPointerException(); + Traverser it = new Traverser(this); + U r = null, u; V v; + while ((v = it.advance()) != null) { + if ((u = transformer.apply(entryFor((K)it.nextKey, v))) != null) + r = (r == null) ? u : reducer.apply(r, u); } + return r; + } + + /** + * Returns the result of accumulating the given transformation + * of all entries using the given reducer to combine values, + * and the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all entries + */ + @SuppressWarnings("unchecked") public double reduceEntriesToDoubleSequentially + (ObjectToDouble> transformer, + double basis, + DoubleByDoubleToDouble reducer) { + if (transformer == null || reducer == null) + throw new NullPointerException(); + Traverser it = new Traverser(this); + double r = basis; V v; + while ((v = it.advance()) != null) + r = reducer.apply(r, transformer.apply(entryFor((K)it.nextKey, v))); + return r; + } + + /** + * Returns the result of accumulating the given transformation + * of all entries using the given reducer to combine values, + * and the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all entries + */ + @SuppressWarnings("unchecked") public long reduceEntriesToLongSequentially + (ObjectToLong> transformer, + long basis, + LongByLongToLong reducer) { + if (transformer == null || reducer == null) + throw new NullPointerException(); + Traverser it = new Traverser(this); + long r = basis; V v; + while ((v = it.advance()) != null) + r = reducer.apply(r, transformer.apply(entryFor((K)it.nextKey, v))); + return r; + } + + /** + * Returns the result of accumulating the given transformation + * of all entries using the given reducer to combine values, + * and the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all entries + */ + @SuppressWarnings("unchecked") public int reduceEntriesToIntSequentially + (ObjectToInt> transformer, + int basis, + IntByIntToInt reducer) { + if (transformer == null || reducer == null) + throw new NullPointerException(); + Traverser it = new Traverser(this); + int r = basis; V v; + while ((v = it.advance()) != null) + r = reducer.apply(r, transformer.apply(entryFor((K)it.nextKey, v))); + return r; + } + + // Parallel bulk operations + + /** + * Performs the given action for each (key, value). + * + * @param action the action + */ + public void forEachInParallel(BiAction action) { + ForkJoinTasks.forEach + (this, action).invoke(); + } + + /** + * Performs the given action for each non-null transformation + * of each (key, value). + * + * @param transformer a function returning the transformation + * for an element, or null if there is no transformation (in + * which case the action is not applied) + * @param action the action + */ + public void forEachInParallel + (BiFun transformer, + Action action) { + ForkJoinTasks.forEach + (this, transformer, action).invoke(); + } + + /** + * Returns a non-null result from applying the given search + * function on each (key, value), or null if none. Upon + * success, further element processing is suppressed and the + * results of any other parallel invocations of the search + * function are ignored. + * + * @param searchFunction a function returning a non-null + * result on success, else null + * @return a non-null result from applying the given search + * function on each (key, value), or null if none + */ + public U searchInParallel + (BiFun searchFunction) { + return ForkJoinTasks.search + (this, searchFunction).invoke(); + } + + /** + * Returns the result of accumulating the given transformation + * of all (key, value) pairs using the given reducer to + * combine values, or null if none. + * + * @param transformer a function returning the transformation + * for an element, or null if there is no transformation (in + * which case it is not combined) + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all (key, value) pairs + */ + public U reduceInParallel + (BiFun transformer, + BiFun reducer) { + return ForkJoinTasks.reduce + (this, transformer, reducer).invoke(); + } + + /** + * Returns the result of accumulating the given transformation + * of all (key, value) pairs using the given reducer to + * combine values, and the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all (key, value) pairs + */ + public double reduceToDoubleInParallel + (ObjectByObjectToDouble transformer, + double basis, + DoubleByDoubleToDouble reducer) { + return ForkJoinTasks.reduceToDouble + (this, transformer, basis, reducer).invoke(); + } + + /** + * Returns the result of accumulating the given transformation + * of all (key, value) pairs using the given reducer to + * combine values, and the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all (key, value) pairs + */ + public long reduceToLongInParallel + (ObjectByObjectToLong transformer, + long basis, + LongByLongToLong reducer) { + return ForkJoinTasks.reduceToLong + (this, transformer, basis, reducer).invoke(); + } + + /** + * Returns the result of accumulating the given transformation + * of all (key, value) pairs using the given reducer to + * combine values, and the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all (key, value) pairs + */ + public int reduceToIntInParallel + (ObjectByObjectToInt transformer, + int basis, + IntByIntToInt reducer) { + return ForkJoinTasks.reduceToInt + (this, transformer, basis, reducer).invoke(); + } + + /** + * Performs the given action for each key. + * + * @param action the action + */ + public void forEachKeyInParallel(Action action) { + ForkJoinTasks.forEachKey + (this, action).invoke(); + } + + /** + * Performs the given action for each non-null transformation + * of each key. + * + * @param transformer a function returning the transformation + * for an element, or null if there is no transformation (in + * which case the action is not applied) + * @param action the action + */ + public void forEachKeyInParallel + (Fun transformer, + Action action) { + ForkJoinTasks.forEachKey + (this, transformer, action).invoke(); + } + + /** + * Returns a non-null result from applying the given search + * function on each key, or null if none. Upon success, + * further element processing is suppressed and the results of + * any other parallel invocations of the search function are + * ignored. + * + * @param searchFunction a function returning a non-null + * result on success, else null + * @return a non-null result from applying the given search + * function on each key, or null if none + */ + public U searchKeysInParallel + (Fun searchFunction) { + return ForkJoinTasks.searchKeys + (this, searchFunction).invoke(); + } + + /** + * Returns the result of accumulating all keys using the given + * reducer to combine values, or null if none. + * + * @param reducer a commutative associative combining function + * @return the result of accumulating all keys using the given + * reducer to combine values, or null if none + */ + public K reduceKeysInParallel + (BiFun reducer) { + return ForkJoinTasks.reduceKeys + (this, reducer).invoke(); + } + + /** + * Returns the result of accumulating the given transformation + * of all keys using the given reducer to combine values, or + * null if none. + * + * @param transformer a function returning the transformation + * for an element, or null if there is no transformation (in + * which case it is not combined) + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all keys + */ + public U reduceKeysInParallel + (Fun transformer, + BiFun reducer) { + return ForkJoinTasks.reduceKeys + (this, transformer, reducer).invoke(); + } + + /** + * Returns the result of accumulating the given transformation + * of all keys using the given reducer to combine values, and + * the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all keys + */ + public double reduceKeysToDoubleInParallel + (ObjectToDouble transformer, + double basis, + DoubleByDoubleToDouble reducer) { + return ForkJoinTasks.reduceKeysToDouble + (this, transformer, basis, reducer).invoke(); + } + + /** + * Returns the result of accumulating the given transformation + * of all keys using the given reducer to combine values, and + * the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all keys + */ + public long reduceKeysToLongInParallel + (ObjectToLong transformer, + long basis, + LongByLongToLong reducer) { + return ForkJoinTasks.reduceKeysToLong + (this, transformer, basis, reducer).invoke(); + } + + /** + * Returns the result of accumulating the given transformation + * of all keys using the given reducer to combine values, and + * the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all keys + */ + public int reduceKeysToIntInParallel + (ObjectToInt transformer, + int basis, + IntByIntToInt reducer) { + return ForkJoinTasks.reduceKeysToInt + (this, transformer, basis, reducer).invoke(); + } + + /** + * Performs the given action for each value. + * + * @param action the action + */ + public void forEachValueInParallel(Action action) { + ForkJoinTasks.forEachValue + (this, action).invoke(); + } + + /** + * Performs the given action for each non-null transformation + * of each value. + * + * @param transformer a function returning the transformation + * for an element, or null if there is no transformation (in + * which case the action is not applied) + */ + public void forEachValueInParallel + (Fun transformer, + Action action) { + ForkJoinTasks.forEachValue + (this, transformer, action).invoke(); + } + + /** + * Returns a non-null result from applying the given search + * function on each value, or null if none. Upon success, + * further element processing is suppressed and the results of + * any other parallel invocations of the search function are + * ignored. + * + * @param searchFunction a function returning a non-null + * result on success, else null + * @return a non-null result from applying the given search + * function on each value, or null if none + */ + public U searchValuesInParallel + (Fun searchFunction) { + return ForkJoinTasks.searchValues + (this, searchFunction).invoke(); + } + + /** + * Returns the result of accumulating all values using the + * given reducer to combine values, or null if none. + * + * @param reducer a commutative associative combining function + * @return the result of accumulating all values + */ + public V reduceValuesInParallel + (BiFun reducer) { + return ForkJoinTasks.reduceValues + (this, reducer).invoke(); + } + + /** + * Returns the result of accumulating the given transformation + * of all values using the given reducer to combine values, or + * null if none. + * + * @param transformer a function returning the transformation + * for an element, or null if there is no transformation (in + * which case it is not combined) + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all values + */ + public U reduceValuesInParallel + (Fun transformer, + BiFun reducer) { + return ForkJoinTasks.reduceValues + (this, transformer, reducer).invoke(); + } + + /** + * Returns the result of accumulating the given transformation + * of all values using the given reducer to combine values, + * and the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all values + */ + public double reduceValuesToDoubleInParallel + (ObjectToDouble transformer, + double basis, + DoubleByDoubleToDouble reducer) { + return ForkJoinTasks.reduceValuesToDouble + (this, transformer, basis, reducer).invoke(); + } + + /** + * Returns the result of accumulating the given transformation + * of all values using the given reducer to combine values, + * and the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all values + */ + public long reduceValuesToLongInParallel + (ObjectToLong transformer, + long basis, + LongByLongToLong reducer) { + return ForkJoinTasks.reduceValuesToLong + (this, transformer, basis, reducer).invoke(); + } + + /** + * Returns the result of accumulating the given transformation + * of all values using the given reducer to combine values, + * and the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all values + */ + public int reduceValuesToIntInParallel + (ObjectToInt transformer, + int basis, + IntByIntToInt reducer) { + return ForkJoinTasks.reduceValuesToInt + (this, transformer, basis, reducer).invoke(); + } + + /** + * Performs the given action for each entry. + * + * @param action the action + */ + public void forEachEntryInParallel(Action> action) { + ForkJoinTasks.forEachEntry + (this, action).invoke(); + } + + /** + * Performs the given action for each non-null transformation + * of each entry. + * + * @param transformer a function returning the transformation + * for an element, or null if there is no transformation (in + * which case the action is not applied) + * @param action the action + */ + public void forEachEntryInParallel + (Fun, ? extends U> transformer, + Action action) { + ForkJoinTasks.forEachEntry + (this, transformer, action).invoke(); + } + + /** + * Returns a non-null result from applying the given search + * function on each entry, or null if none. Upon success, + * further element processing is suppressed and the results of + * any other parallel invocations of the search function are + * ignored. + * + * @param searchFunction a function returning a non-null + * result on success, else null + * @return a non-null result from applying the given search + * function on each entry, or null if none + */ + public U searchEntriesInParallel + (Fun, ? extends U> searchFunction) { + return ForkJoinTasks.searchEntries + (this, searchFunction).invoke(); + } + + /** + * Returns the result of accumulating all entries using the + * given reducer to combine values, or null if none. + * + * @param reducer a commutative associative combining function + * @return the result of accumulating all entries + */ + public Map.Entry reduceEntriesInParallel + (BiFun, Map.Entry, ? extends Map.Entry> reducer) { + return ForkJoinTasks.reduceEntries + (this, reducer).invoke(); + } + + /** + * Returns the result of accumulating the given transformation + * of all entries using the given reducer to combine values, + * or null if none. + * + * @param transformer a function returning the transformation + * for an element, or null if there is no transformation (in + * which case it is not combined) + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all entries + */ + public U reduceEntriesInParallel + (Fun, ? extends U> transformer, + BiFun reducer) { + return ForkJoinTasks.reduceEntries + (this, transformer, reducer).invoke(); + } + + /** + * Returns the result of accumulating the given transformation + * of all entries using the given reducer to combine values, + * and the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all entries + */ + public double reduceEntriesToDoubleInParallel + (ObjectToDouble> transformer, + double basis, + DoubleByDoubleToDouble reducer) { + return ForkJoinTasks.reduceEntriesToDouble + (this, transformer, basis, reducer).invoke(); + } + + /** + * Returns the result of accumulating the given transformation + * of all entries using the given reducer to combine values, + * and the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all entries + */ + public long reduceEntriesToLongInParallel + (ObjectToLong> transformer, + long basis, + LongByLongToLong reducer) { + return ForkJoinTasks.reduceEntriesToLong + (this, transformer, basis, reducer).invoke(); + } + + /** + * Returns the result of accumulating the given transformation + * of all entries using the given reducer to combine values, + * and the given basis as an identity value. + * + * @param transformer a function returning the transformation + * for an element + * @param basis the identity (initial default value) for the reduction + * @param reducer a commutative associative combining function + * @return the result of accumulating the given transformation + * of all entries + */ + public int reduceEntriesToIntInParallel + (ObjectToInt> transformer, + int basis, + IntByIntToInt reducer) { + return ForkJoinTasks.reduceEntriesToInt + (this, transformer, basis, reducer).invoke(); + } + + + /* ----------------Views -------------- */ + + /** + * Base class for views. + */ + abstract static class CHMView { + final ConcurrentHashMapV8 map; + CHMView(ConcurrentHashMapV8 map) { this.map = map; } /** - * Performs the given action for each non-null transformation - * of each value + * Returns the map backing this view. * - * @param transformer a function returning the transformation - * for an element, or null of there is no transformation (in - * which case the action is not applied). + * @return the map backing this view */ - public void forEachValue(Fun transformer, - Action action) { - fjp.invoke(ForkJoinTasks.forEachValue - (ConcurrentHashMapV8.this, transformer, action)); + public ConcurrentHashMapV8 getMap() { return map; } + + public final int size() { return map.size(); } + public final boolean isEmpty() { return map.isEmpty(); } + public final void clear() { map.clear(); } + + // implementations below rely on concrete classes supplying these + public abstract Iterator iterator(); + public abstract boolean contains(Object o); + public abstract boolean remove(Object o); + + private static final String oomeMsg = "Required array size too large"; + + public final Object[] toArray() { + long sz = map.mappingCount(); + if (sz > (long)(MAX_ARRAY_SIZE)) + throw new OutOfMemoryError(oomeMsg); + int n = (int)sz; + Object[] r = new Object[n]; + int i = 0; + Iterator it = iterator(); + while (it.hasNext()) { + if (i == n) { + if (n >= MAX_ARRAY_SIZE) + throw new OutOfMemoryError(oomeMsg); + if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1) + n = MAX_ARRAY_SIZE; + else + n += (n >>> 1) + 1; + r = Arrays.copyOf(r, n); + } + r[i++] = it.next(); + } + return (i == n) ? r : Arrays.copyOf(r, i); } - /** - * Returns a non-null result from applying the given search - * function on each value, or null if none. Further element - * processing is suppressed upon success. However, this method - * does not return until other in-progress parallel - * invocations of the search function also complete. - * - * @param searchFunction a function returning a non-null - * result on success, else null - * @return a non-null result from applying the given search - * function on each value, or null if none - * - */ - public U searchValues(Fun searchFunction) { - return fjp.invoke(ForkJoinTasks.searchValues - (ConcurrentHashMapV8.this, searchFunction)); + @SuppressWarnings("unchecked") public final T[] toArray(T[] a) { + long sz = map.mappingCount(); + if (sz > (long)(MAX_ARRAY_SIZE)) + throw new OutOfMemoryError(oomeMsg); + int m = (int)sz; + T[] r = (a.length >= m) ? a : + (T[])java.lang.reflect.Array + .newInstance(a.getClass().getComponentType(), m); + int n = r.length; + int i = 0; + Iterator it = iterator(); + while (it.hasNext()) { + if (i == n) { + if (n >= MAX_ARRAY_SIZE) + throw new OutOfMemoryError(oomeMsg); + if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1) + n = MAX_ARRAY_SIZE; + else + n += (n >>> 1) + 1; + r = Arrays.copyOf(r, n); + } + r[i++] = (T)it.next(); + } + if (a == r && i < n) { + r[i] = null; // null-terminate + return r; + } + return (i == n) ? r : Arrays.copyOf(r, i); } - /** - * Returns the result of accumulating all values using the - * given reducer to combine values, or null if none. - * - * @param reducer a commutative associative combining function - * @return the result of accumulating all values - */ - public V reduceValues(BiFun reducer) { - return fjp.invoke(ForkJoinTasks.reduceValues - (ConcurrentHashMapV8.this, reducer)); + public final int hashCode() { + int h = 0; + for (Iterator it = iterator(); it.hasNext();) + h += it.next().hashCode(); + return h; } - /** - * Returns the result of accumulating the given transformation - * of all values using the given reducer to combine values, or - * null if none. - * - * @param transformer a function returning the transformation - * for an element, or null of there is no transformation (in - * which case it is not combined). - * @param reducer a commutative associative combining function - * @return the result of accumulating the given transformation - * of all values - */ - public U reduceValues(Fun transformer, - BiFun reducer) { - return fjp.invoke(ForkJoinTasks.reduceValues - (ConcurrentHashMapV8.this, transformer, reducer)); + public final String toString() { + StringBuilder sb = new StringBuilder(); + sb.append('['); + Iterator it = iterator(); + if (it.hasNext()) { + for (;;) { + Object e = it.next(); + sb.append(e == this ? "(this Collection)" : e); + if (!it.hasNext()) + break; + sb.append(',').append(' '); + } + } + return sb.append(']').toString(); } - /** - * Returns the result of accumulating the given transformation - * of all values using the given reducer to combine values, - * and the given basis as an identity value. - * - * @param transformer a function returning the transformation - * for an element - * @param basis the identity (initial default value) for the reduction - * @param reducer a commutative associative combining function - * @return the result of accumulating the given transformation - * of all values - */ - public double reduceValuesToDouble(ObjectToDouble transformer, - double basis, - DoubleByDoubleToDouble reducer) { - return fjp.invoke(ForkJoinTasks.reduceValuesToDouble - (ConcurrentHashMapV8.this, transformer, basis, reducer)); + public final boolean containsAll(Collection c) { + if (c != this) { + for (Iterator it = c.iterator(); it.hasNext();) { + Object e = it.next(); + if (e == null || !contains(e)) + return false; + } + } + return true; } - /** - * Returns the result of accumulating the given transformation - * of all values using the given reducer to combine values, - * and the given basis as an identity value. - * - * @param transformer a function returning the transformation - * for an element - * @param basis the identity (initial default value) for the reduction - * @param reducer a commutative associative combining function - * @return the result of accumulating the given transformation - * of all values - */ - public long reduceValuesToLong(ObjectToLong transformer, - long basis, - LongByLongToLong reducer) { - return fjp.invoke(ForkJoinTasks.reduceValuesToLong - (ConcurrentHashMapV8.this, transformer, basis, reducer)); + public final boolean removeAll(Collection c) { + boolean modified = false; + for (Iterator it = iterator(); it.hasNext();) { + if (c.contains(it.next())) { + it.remove(); + modified = true; + } + } + return modified; } - /** - * Returns the result of accumulating the given transformation - * of all values using the given reducer to combine values, - * and the given basis as an identity value. - * - * @param transformer a function returning the transformation - * for an element - * @param basis the identity (initial default value) for the reduction - * @param reducer a commutative associative combining function - * @return the result of accumulating the given transformation - * of all values - */ - public int reduceValuesToInt(ObjectToInt transformer, - int basis, - IntByIntToInt reducer) { - return fjp.invoke(ForkJoinTasks.reduceValuesToInt - (ConcurrentHashMapV8.this, transformer, basis, reducer)); + public final boolean retainAll(Collection c) { + boolean modified = false; + for (Iterator it = iterator(); it.hasNext();) { + if (!c.contains(it.next())) { + it.remove(); + modified = true; + } + } + return modified; } - /** - * Perform the given action for each entry - * - * @param action the action - */ - public void forEachEntry(Action> action) { - fjp.invoke(ForkJoinTasks.forEachEntry - (ConcurrentHashMapV8.this, action)); + } + + /** + * A view of a ConcurrentHashMapV8 as a {@link Set} of keys, in + * which additions may optionally be enabled by mapping to a + * common value. This class cannot be directly instantiated. See + * {@link #keySet()}, {@link #keySet(Object)}, {@link #newKeySet()}, + * {@link #newKeySet(int)}. + */ + public static class KeySetView extends CHMView + implements Set, java.io.Serializable { + private static final long serialVersionUID = 7249069246763182397L; + private final V value; + KeySetView(ConcurrentHashMapV8 map, V value) { // non-public + super(map); + this.value = value; } /** - * Perform the given action for each non-null transformation - * of each entry + * Returns the default mapped value for additions, + * or {@code null} if additions are not supported. * - * @param transformer a function returning the transformation - * for an element, or null of there is no transformation (in - * which case the action is not applied). - * @param action the action + * @return the default mapped value for additions, or {@code null} + * if not supported */ - public void forEachEntry(Fun, ? extends U> transformer, - Action action) { - fjp.invoke(ForkJoinTasks.forEachEntry - (ConcurrentHashMapV8.this, transformer, action)); - } + public V getMappedValue() { return value; } + + // implement Set API + + public boolean contains(Object o) { return map.containsKey(o); } + public boolean remove(Object o) { return map.remove(o) != null; } /** - * Returns a non-null result from applying the given search - * function on each entry, or null if none. Further element - * processing is suppressed upon success. However, this method - * does not return until other in-progress parallel - * invocations of the search function also complete. + * Returns a "weakly consistent" iterator that will never + * throw {@link ConcurrentModificationException}, and + * guarantees to traverse elements as they existed upon + * construction of the iterator, and may (but is not + * guaranteed to) reflect any modifications subsequent to + * construction. * - * @param searchFunction a function returning a non-null - * result on success, else null - * @return a non-null result from applying the given search - * function on each entry, or null if none + * @return an iterator over the keys of this map */ - public U searchEntries(Fun, ? extends U> searchFunction) { - return fjp.invoke(ForkJoinTasks.searchEntries - (ConcurrentHashMapV8.this, searchFunction)); + public Iterator iterator() { return new KeyIterator(map); } + public boolean add(K e) { + V v; + if ((v = value) == null) + throw new UnsupportedOperationException(); + if (e == null) + throw new NullPointerException(); + return map.internalPut(e, v, true) == null; + } + public boolean addAll(Collection c) { + boolean added = false; + V v; + if ((v = value) == null) + throw new UnsupportedOperationException(); + for (K e : c) { + if (e == null) + throw new NullPointerException(); + if (map.internalPut(e, v, true) == null) + added = true; + } + return added; + } + public boolean equals(Object o) { + Set c; + return ((o instanceof Set) && + ((c = (Set)o) == this || + (containsAll(c) && c.containsAll(this)))); } + } - /** - * Returns the result of accumulating all entries using the - * given reducer to combine values, or null if none. - * - * @param reducer a commutative associative combining function - * @return the result of accumulating all entries - */ - public Map.Entry reduceEntries(BiFun, Map.Entry, ? extends Map.Entry> reducer) { - return fjp.invoke(ForkJoinTasks.reduceEntries - (ConcurrentHashMapV8.this, reducer)); + /** + * A view of a ConcurrentHashMapV8 as a {@link Collection} of + * values, in which additions are disabled. This class cannot be + * directly instantiated. See {@link #values()}. + * + *

The view's {@code iterator} is a "weakly consistent" iterator + * that will never throw {@link ConcurrentModificationException}, + * and guarantees to traverse elements as they existed upon + * construction of the iterator, and may (but is not guaranteed to) + * reflect any modifications subsequent to construction. + */ + public static final class ValuesView extends CHMView + implements Collection { + ValuesView(ConcurrentHashMapV8 map) { super(map); } + public final boolean contains(Object o) { return map.containsValue(o); } + public final boolean remove(Object o) { + if (o != null) { + Iterator it = new ValueIterator(map); + while (it.hasNext()) { + if (o.equals(it.next())) { + it.remove(); + return true; + } + } + } + return false; } /** - * Returns the result of accumulating the given transformation - * of all entries using the given reducer to combine values, - * or null if none. + * Returns a "weakly consistent" iterator that will never + * throw {@link ConcurrentModificationException}, and + * guarantees to traverse elements as they existed upon + * construction of the iterator, and may (but is not + * guaranteed to) reflect any modifications subsequent to + * construction. * - * @param transformer a function returning the transformation - * for an element, or null of there is no transformation (in - * which case it is not combined). - * @param reducer a commutative associative combining function - * @return the result of accumulating the given transformation - * of all entries + * @return an iterator over the values of this map */ - public U reduceEntries(Fun, ? extends U> transformer, - BiFun reducer) { - return fjp.invoke(ForkJoinTasks.reduceEntries - (ConcurrentHashMapV8.this, transformer, reducer)); + public final Iterator iterator() { + return new ValueIterator(map); + } + public final boolean add(V e) { + throw new UnsupportedOperationException(); + } + public final boolean addAll(Collection c) { + throw new UnsupportedOperationException(); } - /** - * Returns the result of accumulating the given transformation - * of all entries using the given reducer to combine values, - * and the given basis as an identity value. - * - * @param transformer a function returning the transformation - * for an element - * @param basis the identity (initial default value) for the reduction - * @param reducer a commutative associative combining function - * @return the result of accumulating the given transformation - * of all entries - */ - public double reduceEntriesToDouble(ObjectToDouble> transformer, - double basis, - DoubleByDoubleToDouble reducer) { - return fjp.invoke(ForkJoinTasks.reduceEntriesToDouble - (ConcurrentHashMapV8.this, transformer, basis, reducer)); + } + + /** + * A view of a ConcurrentHashMapV8 as a {@link Set} of (key, value) + * entries. This class cannot be directly instantiated. See + * {@link #entrySet()}. + */ + public static final class EntrySetView extends CHMView + implements Set> { + EntrySetView(ConcurrentHashMapV8 map) { super(map); } + public final boolean contains(Object o) { + Object k, v, r; Map.Entry e; + return ((o instanceof Map.Entry) && + (k = (e = (Map.Entry)o).getKey()) != null && + (r = map.get(k)) != null && + (v = e.getValue()) != null && + (v == r || v.equals(r))); + } + public final boolean remove(Object o) { + Object k, v; Map.Entry e; + return ((o instanceof Map.Entry) && + (k = (e = (Map.Entry)o).getKey()) != null && + (v = e.getValue()) != null && + map.remove(k, v)); } /** - * Returns the result of accumulating the given transformation - * of all entries using the given reducer to combine values, - * and the given basis as an identity value. + * Returns a "weakly consistent" iterator that will never + * throw {@link ConcurrentModificationException}, and + * guarantees to traverse elements as they existed upon + * construction of the iterator, and may (but is not + * guaranteed to) reflect any modifications subsequent to + * construction. * - * @param transformer a function returning the transformation - * for an element - * @param basis the identity (initial default value) for the reduction - * @param reducer a commutative associative combining function - * @return the result of accumulating the given transformation - * of all entries + * @return an iterator over the entries of this map */ - public long reduceEntriesToLong(ObjectToLong> transformer, - long basis, - LongByLongToLong reducer) { - return fjp.invoke(ForkJoinTasks.reduceEntriesToLong - (ConcurrentHashMapV8.this, transformer, basis, reducer)); + public final Iterator> iterator() { + return new EntryIterator(map); } - /** - * Returns the result of accumulating the given transformation - * of all entries using the given reducer to combine values, - * and the given basis as an identity value. - * - * @param transformer a function returning the transformation - * for an element - * @param basis the identity (initial default value) for the reduction - * @param reducer a commutative associative combining function - * @return the result of accumulating the given transformation - * of all entries - */ - public int reduceEntriesToInt(ObjectToInt> transformer, - int basis, - IntByIntToInt reducer) { - return fjp.invoke(ForkJoinTasks.reduceEntriesToInt - (ConcurrentHashMapV8.this, transformer, basis, reducer)); + public final boolean add(Entry e) { + return map.internalPut(e.getKey(), e.getValue(), false) == null; + } + public final boolean addAll(Collection> c) { + boolean added = false; + for (Entry e : c) { + if (add(e)) + added = true; + } + return added; + } + public boolean equals(Object o) { + Set c; + return ((o instanceof Set) && + ((c = (Set)o) == this || + (containsAll(c) && c.containsAll(this)))); } } @@ -4142,11 +4892,12 @@ public class ConcurrentHashMapV8 /** * Predefined tasks for performing bulk parallel operations on - * ConcurrentHashMaps. These tasks follow the forms and rules used - * in class {@link Parallel}. Each method has the same name, but - * returns a task rather than invoking it. These methods may be - * useful in custom applications such as submitting a task without - * waiting for completion, or combining with other tasks. + * ConcurrentHashMapV8s. These tasks follow the forms and rules used + * for bulk operations. Each method has the same name, but returns + * a task rather than invoking it. These methods may be useful in + * custom applications such as submitting a task without waiting + * for completion, using a custom pool, or combining with other + * tasks. */ public static class ForkJoinTasks { private ForkJoinTasks() {} @@ -4163,7 +4914,7 @@ public class ConcurrentHashMapV8 (ConcurrentHashMapV8 map, BiAction action) { if (action == null) throw new NullPointerException(); - return new ForEachMappingTask(map, action); + return new ForEachMappingTask(map, null, -1, action); } /** @@ -4172,8 +4923,8 @@ public class ConcurrentHashMapV8 * * @param map the map * @param transformer a function returning the transformation - * for an element, or null of there is no transformation (in - * which case the action is not applied). + * for an element, or null if there is no transformation (in + * which case the action is not applied) * @param action the action * @return the task */ @@ -4184,16 +4935,15 @@ public class ConcurrentHashMapV8 if (transformer == null || action == null) throw new NullPointerException(); return new ForEachTransformedMappingTask - (map, transformer, action); + (map, null, -1, transformer, action); } /** - * Returns a task that when invoked, returns a non-null - * result from applying the given search function on each - * (key, value), or null if none. Further element processing - * is suppressed upon success. However, this method does not - * return until other in-progress parallel invocations of the - * search function also complete. + * Returns a task that when invoked, returns a non-null result + * from applying the given search function on each (key, + * value), or null if none. Upon success, further element + * processing is suppressed and the results of any other + * parallel invocations of the search function are ignored. * * @param map the map * @param searchFunction a function returning a non-null @@ -4205,7 +4955,7 @@ public class ConcurrentHashMapV8 BiFun searchFunction) { if (searchFunction == null) throw new NullPointerException(); return new SearchMappingsTask - (map, searchFunction, + (map, null, -1, searchFunction, new AtomicReference()); } @@ -4216,8 +4966,8 @@ public class ConcurrentHashMapV8 * * @param map the map * @param transformer a function returning the transformation - * for an element, or null of there is no transformation (in - * which case it is not combined). + * for an element, or null if there is no transformation (in + * which case it is not combined) * @param reducer a commutative associative combining function * @return the task */ @@ -4228,7 +4978,7 @@ public class ConcurrentHashMapV8 if (transformer == null || reducer == null) throw new NullPointerException(); return new MapReduceMappingsTask - (map, transformer, reducer); + (map, null, -1, null, transformer, reducer); } /** @@ -4252,7 +5002,7 @@ public class ConcurrentHashMapV8 if (transformer == null || reducer == null) throw new NullPointerException(); return new MapReduceMappingsToDoubleTask - (map, transformer, basis, reducer); + (map, null, -1, null, transformer, basis, reducer); } /** @@ -4276,7 +5026,7 @@ public class ConcurrentHashMapV8 if (transformer == null || reducer == null) throw new NullPointerException(); return new MapReduceMappingsToLongTask - (map, transformer, basis, reducer); + (map, null, -1, null, transformer, basis, reducer); } /** @@ -4299,12 +5049,12 @@ public class ConcurrentHashMapV8 if (transformer == null || reducer == null) throw new NullPointerException(); return new MapReduceMappingsToIntTask - (map, transformer, basis, reducer); + (map, null, -1, null, transformer, basis, reducer); } /** * Returns a task that when invoked, performs the given action - * for each key + * for each key. * * @param map the map * @param action the action @@ -4314,17 +5064,17 @@ public class ConcurrentHashMapV8 (ConcurrentHashMapV8 map, Action action) { if (action == null) throw new NullPointerException(); - return new ForEachKeyTask(map, action); + return new ForEachKeyTask(map, null, -1, action); } /** * Returns a task that when invoked, performs the given action - * for each non-null transformation of each key + * for each non-null transformation of each key. * * @param map the map * @param transformer a function returning the transformation - * for an element, or null of there is no transformation (in - * which case the action is not applied). + * for an element, or null if there is no transformation (in + * which case the action is not applied) * @param action the action * @return the task */ @@ -4335,16 +5085,15 @@ public class ConcurrentHashMapV8 if (transformer == null || action == null) throw new NullPointerException(); return new ForEachTransformedKeyTask - (map, transformer, action); + (map, null, -1, transformer, action); } /** * Returns a task that when invoked, returns a non-null result * from applying the given search function on each key, or - * null if none. Further element processing is suppressed - * upon success. However, this method does not return until - * other in-progress parallel invocations of the search - * function also complete. + * null if none. Upon success, further element processing is + * suppressed and the results of any other parallel + * invocations of the search function are ignored. * * @param map the map * @param searchFunction a function returning a non-null @@ -4356,7 +5105,7 @@ public class ConcurrentHashMapV8 Fun searchFunction) { if (searchFunction == null) throw new NullPointerException(); return new SearchKeysTask - (map, searchFunction, + (map, null, -1, searchFunction, new AtomicReference()); } @@ -4374,8 +5123,9 @@ public class ConcurrentHashMapV8 BiFun reducer) { if (reducer == null) throw new NullPointerException(); return new ReduceKeysTask - (map, reducer); + (map, null, -1, null, reducer); } + /** * Returns a task that when invoked, returns the result of * accumulating the given transformation of all keys using the given @@ -4383,8 +5133,8 @@ public class ConcurrentHashMapV8 * * @param map the map * @param transformer a function returning the transformation - * for an element, or null of there is no transformation (in - * which case it is not combined). + * for an element, or null if there is no transformation (in + * which case it is not combined) * @param reducer a commutative associative combining function * @return the task */ @@ -4395,7 +5145,7 @@ public class ConcurrentHashMapV8 if (transformer == null || reducer == null) throw new NullPointerException(); return new MapReduceKeysTask - (map, transformer, reducer); + (map, null, -1, null, transformer, reducer); } /** @@ -4419,7 +5169,7 @@ public class ConcurrentHashMapV8 if (transformer == null || reducer == null) throw new NullPointerException(); return new MapReduceKeysToDoubleTask - (map, transformer, basis, reducer); + (map, null, -1, null, transformer, basis, reducer); } /** @@ -4443,7 +5193,7 @@ public class ConcurrentHashMapV8 if (transformer == null || reducer == null) throw new NullPointerException(); return new MapReduceKeysToLongTask - (map, transformer, basis, reducer); + (map, null, -1, null, transformer, basis, reducer); } /** @@ -4467,12 +5217,12 @@ public class ConcurrentHashMapV8 if (transformer == null || reducer == null) throw new NullPointerException(); return new MapReduceKeysToIntTask - (map, transformer, basis, reducer); + (map, null, -1, null, transformer, basis, reducer); } /** * Returns a task that when invoked, performs the given action - * for each value + * for each value. * * @param map the map * @param action the action @@ -4481,17 +5231,17 @@ public class ConcurrentHashMapV8 (ConcurrentHashMapV8 map, Action action) { if (action == null) throw new NullPointerException(); - return new ForEachValueTask(map, action); + return new ForEachValueTask(map, null, -1, action); } /** * Returns a task that when invoked, performs the given action - * for each non-null transformation of each value + * for each non-null transformation of each value. * * @param map the map * @param transformer a function returning the transformation - * for an element, or null of there is no transformation (in - * which case the action is not applied). + * for an element, or null if there is no transformation (in + * which case the action is not applied) * @param action the action */ public static ForkJoinTask forEachValue @@ -4501,29 +5251,27 @@ public class ConcurrentHashMapV8 if (transformer == null || action == null) throw new NullPointerException(); return new ForEachTransformedValueTask - (map, transformer, action); + (map, null, -1, transformer, action); } /** * Returns a task that when invoked, returns a non-null result * from applying the given search function on each value, or - * null if none. Further element processing is suppressed - * upon success. However, this method does not return until - * other in-progress parallel invocations of the search - * function also complete. + * null if none. Upon success, further element processing is + * suppressed and the results of any other parallel + * invocations of the search function are ignored. * * @param map the map * @param searchFunction a function returning a non-null * result on success, else null * @return the task - * */ public static ForkJoinTask searchValues (ConcurrentHashMapV8 map, Fun searchFunction) { if (searchFunction == null) throw new NullPointerException(); return new SearchValuesTask - (map, searchFunction, + (map, null, -1, searchFunction, new AtomicReference()); } @@ -4541,7 +5289,7 @@ public class ConcurrentHashMapV8 BiFun reducer) { if (reducer == null) throw new NullPointerException(); return new ReduceValuesTask - (map, reducer); + (map, null, -1, null, reducer); } /** @@ -4551,8 +5299,8 @@ public class ConcurrentHashMapV8 * * @param map the map * @param transformer a function returning the transformation - * for an element, or null of there is no transformation (in - * which case it is not combined). + * for an element, or null if there is no transformation (in + * which case it is not combined) * @param reducer a commutative associative combining function * @return the task */ @@ -4563,7 +5311,7 @@ public class ConcurrentHashMapV8 if (transformer == null || reducer == null) throw new NullPointerException(); return new MapReduceValuesTask - (map, transformer, reducer); + (map, null, -1, null, transformer, reducer); } /** @@ -4587,7 +5335,7 @@ public class ConcurrentHashMapV8 if (transformer == null || reducer == null) throw new NullPointerException(); return new MapReduceValuesToDoubleTask - (map, transformer, basis, reducer); + (map, null, -1, null, transformer, basis, reducer); } /** @@ -4611,7 +5359,7 @@ public class ConcurrentHashMapV8 if (transformer == null || reducer == null) throw new NullPointerException(); return new MapReduceValuesToLongTask - (map, transformer, basis, reducer); + (map, null, -1, null, transformer, basis, reducer); } /** @@ -4635,12 +5383,12 @@ public class ConcurrentHashMapV8 if (transformer == null || reducer == null) throw new NullPointerException(); return new MapReduceValuesToIntTask - (map, transformer, basis, reducer); + (map, null, -1, null, transformer, basis, reducer); } /** * Returns a task that when invoked, perform the given action - * for each entry + * for each entry. * * @param map the map * @param action the action @@ -4649,17 +5397,17 @@ public class ConcurrentHashMapV8 (ConcurrentHashMapV8 map, Action> action) { if (action == null) throw new NullPointerException(); - return new ForEachEntryTask(map, action); + return new ForEachEntryTask(map, null, -1, action); } /** * Returns a task that when invoked, perform the given action - * for each non-null transformation of each entry + * for each non-null transformation of each entry. * * @param map the map * @param transformer a function returning the transformation - * for an element, or null of there is no transformation (in - * which case the action is not applied). + * for an element, or null if there is no transformation (in + * which case the action is not applied) * @param action the action */ public static ForkJoinTask forEachEntry @@ -4669,29 +5417,27 @@ public class ConcurrentHashMapV8 if (transformer == null || action == null) throw new NullPointerException(); return new ForEachTransformedEntryTask - (map, transformer, action); + (map, null, -1, transformer, action); } /** * Returns a task that when invoked, returns a non-null result * from applying the given search function on each entry, or - * null if none. Further element processing is suppressed - * upon success. However, this method does not return until - * other in-progress parallel invocations of the search - * function also complete. + * null if none. Upon success, further element processing is + * suppressed and the results of any other parallel + * invocations of the search function are ignored. * * @param map the map * @param searchFunction a function returning a non-null * result on success, else null * @return the task - * */ public static ForkJoinTask searchEntries (ConcurrentHashMapV8 map, Fun, ? extends U> searchFunction) { if (searchFunction == null) throw new NullPointerException(); return new SearchEntriesTask - (map, searchFunction, + (map, null, -1, searchFunction, new AtomicReference()); } @@ -4709,7 +5455,7 @@ public class ConcurrentHashMapV8 BiFun, Map.Entry, ? extends Map.Entry> reducer) { if (reducer == null) throw new NullPointerException(); return new ReduceEntriesTask - (map, reducer); + (map, null, -1, null, reducer); } /** @@ -4719,8 +5465,8 @@ public class ConcurrentHashMapV8 * * @param map the map * @param transformer a function returning the transformation - * for an element, or null of there is no transformation (in - * which case it is not combined). + * for an element, or null if there is no transformation (in + * which case it is not combined) * @param reducer a commutative associative combining function * @return the task */ @@ -4731,7 +5477,7 @@ public class ConcurrentHashMapV8 if (transformer == null || reducer == null) throw new NullPointerException(); return new MapReduceEntriesTask - (map, transformer, reducer); + (map, null, -1, null, transformer, reducer); } /** @@ -4755,7 +5501,7 @@ public class ConcurrentHashMapV8 if (transformer == null || reducer == null) throw new NullPointerException(); return new MapReduceEntriesToDoubleTask - (map, transformer, basis, reducer); + (map, null, -1, null, transformer, basis, reducer); } /** @@ -4779,7 +5525,7 @@ public class ConcurrentHashMapV8 if (transformer == null || reducer == null) throw new NullPointerException(); return new MapReduceEntriesToLongTask - (map, transformer, basis, reducer); + (map, null, -1, null, transformer, basis, reducer); } /** @@ -4803,1932 +5549,1283 @@ public class ConcurrentHashMapV8 if (transformer == null || reducer == null) throw new NullPointerException(); return new MapReduceEntriesToIntTask - (map, transformer, basis, reducer); + (map, null, -1, null, transformer, basis, reducer); } } // ------------------------------------------------------- - /** - * Base for FJ tasks for bulk operations. This adds a variant of - * CountedCompleters and some split and merge bookkeeping to - * iterator functionality. The forEach and reduce methods are - * similar to those illustrated in CountedCompleter documentation, - * except that bottom-up reduction completions perform them within - * their compute methods. The search methods are like forEach - * except they continually poll for success and exit early. Also, - * exceptions are handled in a simpler manner, by just trying to - * complete root task exceptionally. - */ - static abstract class BulkTask extends Traverser { - final BulkTask parent; // completion target - int batch; // split control - int pending; // completion control - - /** Constructor for root tasks */ - BulkTask(ConcurrentHashMapV8 map) { - super(map); - this.parent = null; - this.batch = -1; // force call to batch() on execution - } - - /** Constructor for subtasks */ - BulkTask(BulkTask parent, int batch, boolean split) { - super(parent, split); - this.parent = parent; - this.batch = batch; - } - - // FJ methods - - /** - * Propagate completion. Note that all reduce actions - * bypass this method to combine while completing. - */ - final void tryComplete() { - BulkTask a = this, s = a; - for (int c;;) { - if ((c = a.pending) == 0) { - if ((a = (s = a).parent) == null) { - s.quietlyComplete(); - break; - } - } - else if (U.compareAndSwapInt(a, PENDING, c, c - 1)) - break; - } - } - - /** - * Force root task to throw exception unless already complete. - */ - final void tryAbortComputation(Throwable ex) { - for (BulkTask a = this;;) { - BulkTask p = a.parent; - if (p == null) { - a.completeExceptionally(ex); - break; - } - a = p; - } - } - - public final boolean exec() { - try { - compute(); - } - catch (Throwable ex) { - tryAbortComputation(ex); - } - return false; - } - - public abstract void compute(); - - // utilities - - /** CompareAndSet pending count */ - final boolean casPending(int cmp, int val) { - return U.compareAndSwapInt(this, PENDING, cmp, val); - } - - /** - * Return approx exp2 of the number of times (minus one) to - * split task by two before executing leaf action. This value - * is faster to compute and more convenient to use as a guide - * to splitting than is the depth, since it is used while - * dividing by two anyway. - */ - final int batch() { - int b = batch; - if (b < 0) { - long n = map.counter.sum(); - int sp = getPool().getParallelism() << 3; // slack of 8 - b = batch = (n <= 0L) ? 0 : (n < (long)sp) ? (int)n : sp; - } - return b; - } - - /** - * Error message for hoisted null checks of functions - */ - static final String NullFunctionMessage = - "Unexpected null function"; - - /** - * Return exportable snapshot entry - */ - static AbstractMap.SimpleEntry entryFor(K k, V v) { - return new AbstractMap.SimpleEntry(k, v); - } - - // Unsafe mechanics - private static final sun.misc.Unsafe U; - private static final long PENDING; - static { - try { - U = sun.misc.Unsafe.getUnsafe(); - PENDING = U.objectFieldOffset - (BulkTask.class.getDeclaredField("pending")); - } catch (Exception e) { - throw new Error(e); - } - } - } - /* * Task classes. Coded in a regular but ugly format/style to * simplify checks that each variant differs in the right way from - * others. + * others. The null screenings exist because compilers cannot tell + * that we've already null-checked task arguments, so we force + * simplest hoisted bypass to help avoid convoluted traps. */ - static final class ForEachKeyTask - extends BulkTask { + @SuppressWarnings("serial") static final class ForEachKeyTask + extends Traverser { final Action action; ForEachKeyTask - (ConcurrentHashMapV8 m, + (ConcurrentHashMapV8 m, Traverser p, int b, Action action) { - super(m); + super(m, p, b); this.action = action; } - ForEachKeyTask - (BulkTask p, int b, boolean split, - Action action) { - super(p, b, split); - this.action = action; - } - public final void compute() { - final Action action = this.action; - if (action == null) - throw new Error(NullFunctionMessage); - int b = batch(), c; - while (b > 1 && baseIndex != baseLimit) { - do {} while (!casPending(c = pending, c+1)); - new ForEachKeyTask(this, b >>>= 1, true, action).fork(); - } - while (advance() != null) - action.apply((K)nextKey); - tryComplete(); + @SuppressWarnings("unchecked") public final void compute() { + final Action action; + if ((action = this.action) != null) { + for (int b; (b = preSplit()) > 0;) + new ForEachKeyTask(map, this, b, action).fork(); + while (advance() != null) + action.apply((K)nextKey); + propagateCompletion(); + } } } - static final class ForEachValueTask - extends BulkTask { + @SuppressWarnings("serial") static final class ForEachValueTask + extends Traverser { final Action action; ForEachValueTask - (ConcurrentHashMapV8 m, + (ConcurrentHashMapV8 m, Traverser p, int b, Action action) { - super(m); + super(m, p, b); this.action = action; } - ForEachValueTask - (BulkTask p, int b, boolean split, - Action action) { - super(p, b, split); - this.action = action; - } - public final void compute() { - final Action action = this.action; - if (action == null) - throw new Error(NullFunctionMessage); - int b = batch(), c; - while (b > 1 && baseIndex != baseLimit) { - do {} while (!casPending(c = pending, c+1)); - new ForEachValueTask(this, b >>>= 1, true, action).fork(); - } - Object v; - while ((v = advance()) != null) - action.apply((V)v); - tryComplete(); + @SuppressWarnings("unchecked") public final void compute() { + final Action action; + if ((action = this.action) != null) { + for (int b; (b = preSplit()) > 0;) + new ForEachValueTask(map, this, b, action).fork(); + V v; + while ((v = advance()) != null) + action.apply(v); + propagateCompletion(); + } } } - static final class ForEachEntryTask - extends BulkTask { + @SuppressWarnings("serial") static final class ForEachEntryTask + extends Traverser { final Action> action; ForEachEntryTask - (ConcurrentHashMapV8 m, - Action> action) { - super(m); - this.action = action; - } - ForEachEntryTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, Traverser p, int b, Action> action) { - super(p, b, split); + super(m, p, b); this.action = action; } - public final void compute() { - final Action> action = this.action; - if (action == null) - throw new Error(NullFunctionMessage); - int b = batch(), c; - while (b > 1 && baseIndex != baseLimit) { - do {} while (!casPending(c = pending, c+1)); - new ForEachEntryTask(this, b >>>= 1, true, action).fork(); - } - Object v; - while ((v = advance()) != null) - action.apply(entryFor((K)nextKey, (V)v)); - tryComplete(); + @SuppressWarnings("unchecked") public final void compute() { + final Action> action; + if ((action = this.action) != null) { + for (int b; (b = preSplit()) > 0;) + new ForEachEntryTask(map, this, b, action).fork(); + V v; + while ((v = advance()) != null) + action.apply(entryFor((K)nextKey, v)); + propagateCompletion(); + } } } - static final class ForEachMappingTask - extends BulkTask { + @SuppressWarnings("serial") static final class ForEachMappingTask + extends Traverser { final BiAction action; ForEachMappingTask - (ConcurrentHashMapV8 m, - BiAction action) { - super(m); - this.action = action; - } - ForEachMappingTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, Traverser p, int b, BiAction action) { - super(p, b, split); + super(m, p, b); this.action = action; } - - public final void compute() { - final BiAction action = this.action; - if (action == null) - throw new Error(NullFunctionMessage); - int b = batch(), c; - while (b > 1 && baseIndex != baseLimit) { - do {} while (!casPending(c = pending, c+1)); - new ForEachMappingTask(this, b >>>= 1, true, - action).fork(); - } - Object v; - while ((v = advance()) != null) - action.apply((K)nextKey, (V)v); - tryComplete(); + @SuppressWarnings("unchecked") public final void compute() { + final BiAction action; + if ((action = this.action) != null) { + for (int b; (b = preSplit()) > 0;) + new ForEachMappingTask(map, this, b, action).fork(); + V v; + while ((v = advance()) != null) + action.apply((K)nextKey, v); + propagateCompletion(); + } } } - static final class ForEachTransformedKeyTask - extends BulkTask { + @SuppressWarnings("serial") static final class ForEachTransformedKeyTask + extends Traverser { final Fun transformer; final Action action; ForEachTransformedKeyTask - (ConcurrentHashMapV8 m, - Fun transformer, - Action action) { - super(m); - this.transformer = transformer; - this.action = action; - - } - ForEachTransformedKeyTask - (BulkTask p, int b, boolean split, - Fun transformer, - Action action) { - super(p, b, split); - this.transformer = transformer; - this.action = action; - } - public final void compute() { - final Fun transformer = - this.transformer; - final Action action = this.action; - if (transformer == null || action == null) - throw new Error(NullFunctionMessage); - int b = batch(), c; - while (b > 1 && baseIndex != baseLimit) { - do {} while (!casPending(c = pending, c+1)); - new ForEachTransformedKeyTask - (this, b >>>= 1, true, transformer, action).fork(); - } - U u; - while (advance() != null) { - if ((u = transformer.apply((K)nextKey)) != null) - action.apply(u); + (ConcurrentHashMapV8 m, Traverser p, int b, + Fun transformer, Action action) { + super(m, p, b); + this.transformer = transformer; this.action = action; + } + @SuppressWarnings("unchecked") public final void compute() { + final Fun transformer; + final Action action; + if ((transformer = this.transformer) != null && + (action = this.action) != null) { + for (int b; (b = preSplit()) > 0;) + new ForEachTransformedKeyTask + (map, this, b, transformer, action).fork(); + U u; + while (advance() != null) { + if ((u = transformer.apply((K)nextKey)) != null) + action.apply(u); + } + propagateCompletion(); } - tryComplete(); } } - static final class ForEachTransformedValueTask - extends BulkTask { + @SuppressWarnings("serial") static final class ForEachTransformedValueTask + extends Traverser { final Fun transformer; final Action action; ForEachTransformedValueTask - (ConcurrentHashMapV8 m, - Fun transformer, - Action action) { - super(m); - this.transformer = transformer; - this.action = action; - - } - ForEachTransformedValueTask - (BulkTask p, int b, boolean split, - Fun transformer, - Action action) { - super(p, b, split); - this.transformer = transformer; - this.action = action; - } - public final void compute() { - final Fun transformer = - this.transformer; - final Action action = this.action; - if (transformer == null || action == null) - throw new Error(NullFunctionMessage); - int b = batch(), c; - while (b > 1 && baseIndex != baseLimit) { - do {} while (!casPending(c = pending, c+1)); - new ForEachTransformedValueTask - (this, b >>>= 1, true, transformer, action).fork(); - } - Object v; U u; - while ((v = advance()) != null) { - if ((u = transformer.apply((V)v)) != null) - action.apply(u); + (ConcurrentHashMapV8 m, Traverser p, int b, + Fun transformer, Action action) { + super(m, p, b); + this.transformer = transformer; this.action = action; + } + @SuppressWarnings("unchecked") public final void compute() { + final Fun transformer; + final Action action; + if ((transformer = this.transformer) != null && + (action = this.action) != null) { + for (int b; (b = preSplit()) > 0;) + new ForEachTransformedValueTask + (map, this, b, transformer, action).fork(); + V v; U u; + while ((v = advance()) != null) { + if ((u = transformer.apply(v)) != null) + action.apply(u); + } + propagateCompletion(); } - tryComplete(); } } - static final class ForEachTransformedEntryTask - extends BulkTask { + @SuppressWarnings("serial") static final class ForEachTransformedEntryTask + extends Traverser { final Fun, ? extends U> transformer; final Action action; ForEachTransformedEntryTask - (ConcurrentHashMapV8 m, - Fun, ? extends U> transformer, - Action action) { - super(m); - this.transformer = transformer; - this.action = action; - - } - ForEachTransformedEntryTask - (BulkTask p, int b, boolean split, - Fun, ? extends U> transformer, - Action action) { - super(p, b, split); - this.transformer = transformer; - this.action = action; - } - public final void compute() { - final Fun, ? extends U> transformer = - this.transformer; - final Action action = this.action; - if (transformer == null || action == null) - throw new Error(NullFunctionMessage); - int b = batch(), c; - while (b > 1 && baseIndex != baseLimit) { - do {} while (!casPending(c = pending, c+1)); - new ForEachTransformedEntryTask - (this, b >>>= 1, true, transformer, action).fork(); - } - Object v; U u; - while ((v = advance()) != null) { - if ((u = transformer.apply(entryFor((K)nextKey, (V)v))) != null) - action.apply(u); + (ConcurrentHashMapV8 m, Traverser p, int b, + Fun, ? extends U> transformer, Action action) { + super(m, p, b); + this.transformer = transformer; this.action = action; + } + @SuppressWarnings("unchecked") public final void compute() { + final Fun, ? extends U> transformer; + final Action action; + if ((transformer = this.transformer) != null && + (action = this.action) != null) { + for (int b; (b = preSplit()) > 0;) + new ForEachTransformedEntryTask + (map, this, b, transformer, action).fork(); + V v; U u; + while ((v = advance()) != null) { + if ((u = transformer.apply(entryFor((K)nextKey, + v))) != null) + action.apply(u); + } + propagateCompletion(); } - tryComplete(); } } - static final class ForEachTransformedMappingTask - extends BulkTask { + @SuppressWarnings("serial") static final class ForEachTransformedMappingTask + extends Traverser { final BiFun transformer; final Action action; ForEachTransformedMappingTask - (ConcurrentHashMapV8 m, - BiFun transformer, - Action action) { - super(m); - this.transformer = transformer; - this.action = action; - - } - ForEachTransformedMappingTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, Traverser p, int b, BiFun transformer, Action action) { - super(p, b, split); - this.transformer = transformer; - this.action = action; + super(m, p, b); + this.transformer = transformer; this.action = action; } - public final void compute() { - final BiFun transformer = - this.transformer; - final Action action = this.action; - if (transformer == null || action == null) - throw new Error(NullFunctionMessage); - int b = batch(), c; - while (b > 1 && baseIndex != baseLimit) { - do {} while (!casPending(c = pending, c+1)); - new ForEachTransformedMappingTask - (this, b >>>= 1, true, transformer, action).fork(); - } - Object v; U u; - while ((v = advance()) != null) { - if ((u = transformer.apply((K)nextKey, (V)v)) != null) - action.apply(u); + @SuppressWarnings("unchecked") public final void compute() { + final BiFun transformer; + final Action action; + if ((transformer = this.transformer) != null && + (action = this.action) != null) { + for (int b; (b = preSplit()) > 0;) + new ForEachTransformedMappingTask + (map, this, b, transformer, action).fork(); + V v; U u; + while ((v = advance()) != null) { + if ((u = transformer.apply((K)nextKey, v)) != null) + action.apply(u); + } + propagateCompletion(); } - tryComplete(); } } - static final class SearchKeysTask - extends BulkTask { + @SuppressWarnings("serial") static final class SearchKeysTask + extends Traverser { final Fun searchFunction; final AtomicReference result; SearchKeysTask - (ConcurrentHashMapV8 m, - Fun searchFunction, - AtomicReference result) { - super(m); - this.searchFunction = searchFunction; this.result = result; - } - SearchKeysTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, Traverser p, int b, Fun searchFunction, AtomicReference result) { - super(p, b, split); + super(m, p, b); this.searchFunction = searchFunction; this.result = result; } - public final void compute() { - AtomicReference result = this.result; - final Fun searchFunction = - this.searchFunction; - if (searchFunction == null || result == null) - throw new Error(NullFunctionMessage); - int b = batch(), c; - while (b > 1 && baseIndex != baseLimit && result.get() == null) { - do {} while (!casPending(c = pending, c+1)); - new SearchKeysTask(this, b >>>= 1, true, - searchFunction, result).fork(); - } - U u; - while (result.get() == null && advance() != null) { - if ((u = searchFunction.apply((K)nextKey)) != null) { - result.compareAndSet(null, u); - break; + public final U getRawResult() { return result.get(); } + @SuppressWarnings("unchecked") public final void compute() { + final Fun searchFunction; + final AtomicReference result; + if ((searchFunction = this.searchFunction) != null && + (result = this.result) != null) { + for (int b;;) { + if (result.get() != null) + return; + if ((b = preSplit()) <= 0) + break; + new SearchKeysTask + (map, this, b, searchFunction, result).fork(); + } + while (result.get() == null) { + U u; + if (advance() == null) { + propagateCompletion(); + break; + } + if ((u = searchFunction.apply((K)nextKey)) != null) { + if (result.compareAndSet(null, u)) + quietlyCompleteRoot(); + break; + } } } - tryComplete(); } - public final U getRawResult() { return result.get(); } } - static final class SearchValuesTask - extends BulkTask { + @SuppressWarnings("serial") static final class SearchValuesTask + extends Traverser { final Fun searchFunction; final AtomicReference result; SearchValuesTask - (ConcurrentHashMapV8 m, + (ConcurrentHashMapV8 m, Traverser p, int b, Fun searchFunction, AtomicReference result) { - super(m); + super(m, p, b); this.searchFunction = searchFunction; this.result = result; } - SearchValuesTask - (BulkTask p, int b, boolean split, - Fun searchFunction, - AtomicReference result) { - super(p, b, split); - this.searchFunction = searchFunction; this.result = result; - } - public final void compute() { - AtomicReference result = this.result; - final Fun searchFunction = - this.searchFunction; - if (searchFunction == null || result == null) - throw new Error(NullFunctionMessage); - int b = batch(), c; - while (b > 1 && baseIndex != baseLimit && result.get() == null) { - do {} while (!casPending(c = pending, c+1)); - new SearchValuesTask(this, b >>>= 1, true, - searchFunction, result).fork(); - } - Object v; U u; - while (result.get() == null && (v = advance()) != null) { - if ((u = searchFunction.apply((V)v)) != null) { - result.compareAndSet(null, u); - break; + public final U getRawResult() { return result.get(); } + @SuppressWarnings("unchecked") public final void compute() { + final Fun searchFunction; + final AtomicReference result; + if ((searchFunction = this.searchFunction) != null && + (result = this.result) != null) { + for (int b;;) { + if (result.get() != null) + return; + if ((b = preSplit()) <= 0) + break; + new SearchValuesTask + (map, this, b, searchFunction, result).fork(); + } + while (result.get() == null) { + V v; U u; + if ((v = advance()) == null) { + propagateCompletion(); + break; + } + if ((u = searchFunction.apply(v)) != null) { + if (result.compareAndSet(null, u)) + quietlyCompleteRoot(); + break; + } } } - tryComplete(); } - public final U getRawResult() { return result.get(); } } - static final class SearchEntriesTask - extends BulkTask { + @SuppressWarnings("serial") static final class SearchEntriesTask + extends Traverser { final Fun, ? extends U> searchFunction; final AtomicReference result; SearchEntriesTask - (ConcurrentHashMapV8 m, - Fun, ? extends U> searchFunction, - AtomicReference result) { - super(m); - this.searchFunction = searchFunction; this.result = result; - } - SearchEntriesTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, Traverser p, int b, Fun, ? extends U> searchFunction, AtomicReference result) { - super(p, b, split); + super(m, p, b); this.searchFunction = searchFunction; this.result = result; } - public final void compute() { - AtomicReference result = this.result; - final Fun, ? extends U> searchFunction = - this.searchFunction; - if (searchFunction == null || result == null) - throw new Error(NullFunctionMessage); - int b = batch(), c; - while (b > 1 && baseIndex != baseLimit && result.get() == null) { - do {} while (!casPending(c = pending, c+1)); - new SearchEntriesTask(this, b >>>= 1, true, - searchFunction, result).fork(); - } - Object v; U u; - while (result.get() == null && (v = advance()) != null) { - if ((u = searchFunction.apply(entryFor((K)nextKey, (V)v))) != null) { - result.compareAndSet(null, u); - break; + public final U getRawResult() { return result.get(); } + @SuppressWarnings("unchecked") public final void compute() { + final Fun, ? extends U> searchFunction; + final AtomicReference result; + if ((searchFunction = this.searchFunction) != null && + (result = this.result) != null) { + for (int b;;) { + if (result.get() != null) + return; + if ((b = preSplit()) <= 0) + break; + new SearchEntriesTask + (map, this, b, searchFunction, result).fork(); + } + while (result.get() == null) { + V v; U u; + if ((v = advance()) == null) { + propagateCompletion(); + break; + } + if ((u = searchFunction.apply(entryFor((K)nextKey, + v))) != null) { + if (result.compareAndSet(null, u)) + quietlyCompleteRoot(); + return; + } } } - tryComplete(); } - public final U getRawResult() { return result.get(); } } - static final class SearchMappingsTask - extends BulkTask { + @SuppressWarnings("serial") static final class SearchMappingsTask + extends Traverser { final BiFun searchFunction; final AtomicReference result; SearchMappingsTask - (ConcurrentHashMapV8 m, - BiFun searchFunction, - AtomicReference result) { - super(m); - this.searchFunction = searchFunction; this.result = result; - } - SearchMappingsTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, Traverser p, int b, BiFun searchFunction, AtomicReference result) { - super(p, b, split); + super(m, p, b); this.searchFunction = searchFunction; this.result = result; } - public final void compute() { - AtomicReference result = this.result; - final BiFun searchFunction = - this.searchFunction; - if (searchFunction == null || result == null) - throw new Error(NullFunctionMessage); - int b = batch(), c; - while (b > 1 && baseIndex != baseLimit && result.get() == null) { - do {} while (!casPending(c = pending, c+1)); - new SearchMappingsTask(this, b >>>= 1, true, - searchFunction, result).fork(); - } - Object v; U u; - while (result.get() == null && (v = advance()) != null) { - if ((u = searchFunction.apply((K)nextKey, (V)v)) != null) { - result.compareAndSet(null, u); - break; + public final U getRawResult() { return result.get(); } + @SuppressWarnings("unchecked") public final void compute() { + final BiFun searchFunction; + final AtomicReference result; + if ((searchFunction = this.searchFunction) != null && + (result = this.result) != null) { + for (int b;;) { + if (result.get() != null) + return; + if ((b = preSplit()) <= 0) + break; + new SearchMappingsTask + (map, this, b, searchFunction, result).fork(); + } + while (result.get() == null) { + V v; U u; + if ((v = advance()) == null) { + propagateCompletion(); + break; + } + if ((u = searchFunction.apply((K)nextKey, v)) != null) { + if (result.compareAndSet(null, u)) + quietlyCompleteRoot(); + break; + } } } - tryComplete(); } - public final U getRawResult() { return result.get(); } } - static final class ReduceKeysTask - extends BulkTask { + @SuppressWarnings("serial") static final class ReduceKeysTask + extends Traverser { final BiFun reducer; K result; - ReduceKeysTask sibling; + ReduceKeysTask rights, nextRight; ReduceKeysTask - (ConcurrentHashMapV8 m, + (ConcurrentHashMapV8 m, Traverser p, int b, + ReduceKeysTask nextRight, BiFun reducer) { - super(m); + super(m, p, b); this.nextRight = nextRight; this.reducer = reducer; } - ReduceKeysTask - (BulkTask p, int b, boolean split, - BiFun reducer) { - super(p, b, split); - this.reducer = reducer; - } - - public final void compute() { - ReduceKeysTask t = this; - final BiFun reducer = - this.reducer; - if (reducer == null) - throw new Error(NullFunctionMessage); - int b = batch(); - while (b > 1 && t.baseIndex != t.baseLimit) { - b >>>= 1; - t.pending = 1; - ReduceKeysTask rt = - new ReduceKeysTask - (t, b, true, reducer); - t = new ReduceKeysTask - (t, b, false, reducer); - t.sibling = rt; - rt.sibling = t; - rt.fork(); - } - K r = null; - while (t.advance() != null) { - K u = (K)t.nextKey; - r = (r == null) ? u : reducer.apply(r, u); - } - t.result = r; - for (;;) { - int c; BulkTask par; ReduceKeysTask s, p; K u; - if ((par = t.parent) == null || - !(par instanceof ReduceKeysTask)) { - t.quietlyComplete(); - break; + public final K getRawResult() { return result; } + @SuppressWarnings("unchecked") public final void compute() { + final BiFun reducer; + if ((reducer = this.reducer) != null) { + for (int b; (b = preSplit()) > 0;) + (rights = new ReduceKeysTask + (map, this, b, rights, reducer)).fork(); + K r = null; + while (advance() != null) { + K u = (K)nextKey; + r = (r == null) ? u : reducer.apply(r, u); } - else if ((c = (p = (ReduceKeysTask)par).pending) == 0) { - if ((s = t.sibling) != null && (u = s.result) != null) - r = (r == null) ? u : reducer.apply(r, u); - (t = p).result = r; + result = r; + CountedCompleter c; + for (c = firstComplete(); c != null; c = c.nextComplete()) { + ReduceKeysTask + t = (ReduceKeysTask)c, + s = t.rights; + while (s != null) { + K tr, sr; + if ((sr = s.result) != null) + t.result = (((tr = t.result) == null) ? sr : + reducer.apply(tr, sr)); + s = t.rights = s.nextRight; + } } - else if (p.casPending(c, 0)) - break; } } - public final K getRawResult() { return result; } } - static final class ReduceValuesTask - extends BulkTask { + @SuppressWarnings("serial") static final class ReduceValuesTask + extends Traverser { final BiFun reducer; V result; - ReduceValuesTask sibling; - ReduceValuesTask - (ConcurrentHashMapV8 m, - BiFun reducer) { - super(m); - this.reducer = reducer; - } + ReduceValuesTask rights, nextRight; ReduceValuesTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, Traverser p, int b, + ReduceValuesTask nextRight, BiFun reducer) { - super(p, b, split); + super(m, p, b); this.nextRight = nextRight; this.reducer = reducer; } - - public final void compute() { - ReduceValuesTask t = this; - final BiFun reducer = - this.reducer; - if (reducer == null) - throw new Error(NullFunctionMessage); - int b = batch(); - while (b > 1 && t.baseIndex != t.baseLimit) { - b >>>= 1; - t.pending = 1; - ReduceValuesTask rt = - new ReduceValuesTask - (t, b, true, reducer); - t = new ReduceValuesTask - (t, b, false, reducer); - t.sibling = rt; - rt.sibling = t; - rt.fork(); - } - V r = null; - Object v; - while ((v = t.advance()) != null) { - V u = (V)v; - r = (r == null) ? u : reducer.apply(r, u); - } - t.result = r; - for (;;) { - int c; BulkTask par; ReduceValuesTask s, p; V u; - if ((par = t.parent) == null || - !(par instanceof ReduceValuesTask)) { - t.quietlyComplete(); - break; + public final V getRawResult() { return result; } + @SuppressWarnings("unchecked") public final void compute() { + final BiFun reducer; + if ((reducer = this.reducer) != null) { + for (int b; (b = preSplit()) > 0;) + (rights = new ReduceValuesTask + (map, this, b, rights, reducer)).fork(); + V r = null; + V v; + while ((v = advance()) != null) { + V u = v; + r = (r == null) ? u : reducer.apply(r, u); } - else if ((c = (p = (ReduceValuesTask)par).pending) == 0) { - if ((s = t.sibling) != null && (u = s.result) != null) - r = (r == null) ? u : reducer.apply(r, u); - (t = p).result = r; + result = r; + CountedCompleter c; + for (c = firstComplete(); c != null; c = c.nextComplete()) { + ReduceValuesTask + t = (ReduceValuesTask)c, + s = t.rights; + while (s != null) { + V tr, sr; + if ((sr = s.result) != null) + t.result = (((tr = t.result) == null) ? sr : + reducer.apply(tr, sr)); + s = t.rights = s.nextRight; + } } - else if (p.casPending(c, 0)) - break; } } - public final V getRawResult() { return result; } } - static final class ReduceEntriesTask - extends BulkTask> { + @SuppressWarnings("serial") static final class ReduceEntriesTask + extends Traverser> { final BiFun, Map.Entry, ? extends Map.Entry> reducer; Map.Entry result; - ReduceEntriesTask sibling; + ReduceEntriesTask rights, nextRight; ReduceEntriesTask - (ConcurrentHashMapV8 m, + (ConcurrentHashMapV8 m, Traverser p, int b, + ReduceEntriesTask nextRight, BiFun, Map.Entry, ? extends Map.Entry> reducer) { - super(m); - this.reducer = reducer; - } - ReduceEntriesTask - (BulkTask p, int b, boolean split, - BiFun, Map.Entry, ? extends Map.Entry> reducer) { - super(p, b, split); + super(m, p, b); this.nextRight = nextRight; this.reducer = reducer; } - - public final void compute() { - ReduceEntriesTask t = this; - final BiFun, Map.Entry, ? extends Map.Entry> reducer = - this.reducer; - if (reducer == null) - throw new Error(NullFunctionMessage); - int b = batch(); - while (b > 1 && t.baseIndex != t.baseLimit) { - b >>>= 1; - t.pending = 1; - ReduceEntriesTask rt = - new ReduceEntriesTask - (t, b, true, reducer); - t = new ReduceEntriesTask - (t, b, false, reducer); - t.sibling = rt; - rt.sibling = t; - rt.fork(); - } - Map.Entry r = null; - Object v; - while ((v = t.advance()) != null) { - Map.Entry u = entryFor((K)t.nextKey, (V)v); - r = (r == null) ? u : reducer.apply(r, u); - } - t.result = r; - for (;;) { - int c; BulkTask par; ReduceEntriesTask s, p; - Map.Entry u; - if ((par = t.parent) == null || - !(par instanceof ReduceEntriesTask)) { - t.quietlyComplete(); - break; + public final Map.Entry getRawResult() { return result; } + @SuppressWarnings("unchecked") public final void compute() { + final BiFun, Map.Entry, ? extends Map.Entry> reducer; + if ((reducer = this.reducer) != null) { + for (int b; (b = preSplit()) > 0;) + (rights = new ReduceEntriesTask + (map, this, b, rights, reducer)).fork(); + Map.Entry r = null; + V v; + while ((v = advance()) != null) { + Map.Entry u = entryFor((K)nextKey, v); + r = (r == null) ? u : reducer.apply(r, u); } - else if ((c = (p = (ReduceEntriesTask)par).pending) == 0) { - if ((s = t.sibling) != null && (u = s.result) != null) - r = (r == null) ? u : reducer.apply(r, u); - (t = p).result = r; + result = r; + CountedCompleter c; + for (c = firstComplete(); c != null; c = c.nextComplete()) { + ReduceEntriesTask + t = (ReduceEntriesTask)c, + s = t.rights; + while (s != null) { + Map.Entry tr, sr; + if ((sr = s.result) != null) + t.result = (((tr = t.result) == null) ? sr : + reducer.apply(tr, sr)); + s = t.rights = s.nextRight; + } } - else if (p.casPending(c, 0)) - break; } } - public final Map.Entry getRawResult() { return result; } } - static final class MapReduceKeysTask - extends BulkTask { + @SuppressWarnings("serial") static final class MapReduceKeysTask + extends Traverser { final Fun transformer; final BiFun reducer; U result; - MapReduceKeysTask sibling; + MapReduceKeysTask rights, nextRight; MapReduceKeysTask - (ConcurrentHashMapV8 m, + (ConcurrentHashMapV8 m, Traverser p, int b, + MapReduceKeysTask nextRight, Fun transformer, BiFun reducer) { - super(m); + super(m, p, b); this.nextRight = nextRight; this.transformer = transformer; this.reducer = reducer; } - MapReduceKeysTask - (BulkTask p, int b, boolean split, - Fun transformer, - BiFun reducer) { - super(p, b, split); - this.transformer = transformer; - this.reducer = reducer; - } - public final void compute() { - MapReduceKeysTask t = this; - final Fun transformer = - this.transformer; - final BiFun reducer = - this.reducer; - if (transformer == null || reducer == null) - throw new Error(NullFunctionMessage); - int b = batch(); - while (b > 1 && t.baseIndex != t.baseLimit) { - b >>>= 1; - t.pending = 1; - MapReduceKeysTask rt = - new MapReduceKeysTask - (t, b, true, transformer, reducer); - t = new MapReduceKeysTask - (t, b, false, transformer, reducer); - t.sibling = rt; - rt.sibling = t; - rt.fork(); - } - U r = null, u; - while (t.advance() != null) { - if ((u = transformer.apply((K)t.nextKey)) != null) - r = (r == null) ? u : reducer.apply(r, u); - } - t.result = r; - for (;;) { - int c; BulkTask par; MapReduceKeysTask s, p; - if ((par = t.parent) == null || - !(par instanceof MapReduceKeysTask)) { - t.quietlyComplete(); - break; - } - else if ((c = (p = (MapReduceKeysTask)par).pending) == 0) { - if ((s = t.sibling) != null && (u = s.result) != null) + public final U getRawResult() { return result; } + @SuppressWarnings("unchecked") public final void compute() { + final Fun transformer; + final BiFun reducer; + if ((transformer = this.transformer) != null && + (reducer = this.reducer) != null) { + for (int b; (b = preSplit()) > 0;) + (rights = new MapReduceKeysTask + (map, this, b, rights, transformer, reducer)).fork(); + U r = null, u; + while (advance() != null) { + if ((u = transformer.apply((K)nextKey)) != null) r = (r == null) ? u : reducer.apply(r, u); - (t = p).result = r; } - else if (p.casPending(c, 0)) - break; + result = r; + CountedCompleter c; + for (c = firstComplete(); c != null; c = c.nextComplete()) { + MapReduceKeysTask + t = (MapReduceKeysTask)c, + s = t.rights; + while (s != null) { + U tr, sr; + if ((sr = s.result) != null) + t.result = (((tr = t.result) == null) ? sr : + reducer.apply(tr, sr)); + s = t.rights = s.nextRight; + } + } } } - public final U getRawResult() { return result; } } - static final class MapReduceValuesTask - extends BulkTask { + @SuppressWarnings("serial") static final class MapReduceValuesTask + extends Traverser { final Fun transformer; final BiFun reducer; U result; - MapReduceValuesTask sibling; - MapReduceValuesTask - (ConcurrentHashMapV8 m, - Fun transformer, - BiFun reducer) { - super(m); - this.transformer = transformer; - this.reducer = reducer; - } + MapReduceValuesTask rights, nextRight; MapReduceValuesTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, Traverser p, int b, + MapReduceValuesTask nextRight, Fun transformer, BiFun reducer) { - super(p, b, split); + super(m, p, b); this.nextRight = nextRight; this.transformer = transformer; this.reducer = reducer; } - public final void compute() { - MapReduceValuesTask t = this; - final Fun transformer = - this.transformer; - final BiFun reducer = - this.reducer; - if (transformer == null || reducer == null) - throw new Error(NullFunctionMessage); - int b = batch(); - while (b > 1 && t.baseIndex != t.baseLimit) { - b >>>= 1; - t.pending = 1; - MapReduceValuesTask rt = - new MapReduceValuesTask - (t, b, true, transformer, reducer); - t = new MapReduceValuesTask - (t, b, false, transformer, reducer); - t.sibling = rt; - rt.sibling = t; - rt.fork(); - } - U r = null, u; - Object v; - while ((v = t.advance()) != null) { - if ((u = transformer.apply((V)v)) != null) - r = (r == null) ? u : reducer.apply(r, u); - } - t.result = r; - for (;;) { - int c; BulkTask par; MapReduceValuesTask s, p; - if ((par = t.parent) == null || - !(par instanceof MapReduceValuesTask)) { - t.quietlyComplete(); - break; - } - else if ((c = (p = (MapReduceValuesTask)par).pending) == 0) { - if ((s = t.sibling) != null && (u = s.result) != null) + public final U getRawResult() { return result; } + @SuppressWarnings("unchecked") public final void compute() { + final Fun transformer; + final BiFun reducer; + if ((transformer = this.transformer) != null && + (reducer = this.reducer) != null) { + for (int b; (b = preSplit()) > 0;) + (rights = new MapReduceValuesTask + (map, this, b, rights, transformer, reducer)).fork(); + U r = null, u; + V v; + while ((v = advance()) != null) { + if ((u = transformer.apply(v)) != null) r = (r == null) ? u : reducer.apply(r, u); - (t = p).result = r; } - else if (p.casPending(c, 0)) - break; + result = r; + CountedCompleter c; + for (c = firstComplete(); c != null; c = c.nextComplete()) { + MapReduceValuesTask + t = (MapReduceValuesTask)c, + s = t.rights; + while (s != null) { + U tr, sr; + if ((sr = s.result) != null) + t.result = (((tr = t.result) == null) ? sr : + reducer.apply(tr, sr)); + s = t.rights = s.nextRight; + } + } } } - public final U getRawResult() { return result; } } - static final class MapReduceEntriesTask - extends BulkTask { + @SuppressWarnings("serial") static final class MapReduceEntriesTask + extends Traverser { final Fun, ? extends U> transformer; final BiFun reducer; U result; - MapReduceEntriesTask sibling; - MapReduceEntriesTask - (ConcurrentHashMapV8 m, - Fun, ? extends U> transformer, - BiFun reducer) { - super(m); - this.transformer = transformer; - this.reducer = reducer; - } + MapReduceEntriesTask rights, nextRight; MapReduceEntriesTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, Traverser p, int b, + MapReduceEntriesTask nextRight, Fun, ? extends U> transformer, BiFun reducer) { - super(p, b, split); + super(m, p, b); this.nextRight = nextRight; this.transformer = transformer; this.reducer = reducer; } - public final void compute() { - MapReduceEntriesTask t = this; - final Fun, ? extends U> transformer = - this.transformer; - final BiFun reducer = - this.reducer; - if (transformer == null || reducer == null) - throw new Error(NullFunctionMessage); - int b = batch(); - while (b > 1 && t.baseIndex != t.baseLimit) { - b >>>= 1; - t.pending = 1; - MapReduceEntriesTask rt = - new MapReduceEntriesTask - (t, b, true, transformer, reducer); - t = new MapReduceEntriesTask - (t, b, false, transformer, reducer); - t.sibling = rt; - rt.sibling = t; - rt.fork(); - } - U r = null, u; - Object v; - while ((v = t.advance()) != null) { - if ((u = transformer.apply(entryFor((K)t.nextKey, (V)v))) != null) - r = (r == null) ? u : reducer.apply(r, u); - } - t.result = r; - for (;;) { - int c; BulkTask par; MapReduceEntriesTask s, p; - if ((par = t.parent) == null || - !(par instanceof MapReduceEntriesTask)) { - t.quietlyComplete(); - break; - } - else if ((c = (p = (MapReduceEntriesTask)par).pending) == 0) { - if ((s = t.sibling) != null && (u = s.result) != null) + public final U getRawResult() { return result; } + @SuppressWarnings("unchecked") public final void compute() { + final Fun, ? extends U> transformer; + final BiFun reducer; + if ((transformer = this.transformer) != null && + (reducer = this.reducer) != null) { + for (int b; (b = preSplit()) > 0;) + (rights = new MapReduceEntriesTask + (map, this, b, rights, transformer, reducer)).fork(); + U r = null, u; + V v; + while ((v = advance()) != null) { + if ((u = transformer.apply(entryFor((K)nextKey, + v))) != null) r = (r == null) ? u : reducer.apply(r, u); - (t = p).result = r; } - else if (p.casPending(c, 0)) - break; + result = r; + CountedCompleter c; + for (c = firstComplete(); c != null; c = c.nextComplete()) { + MapReduceEntriesTask + t = (MapReduceEntriesTask)c, + s = t.rights; + while (s != null) { + U tr, sr; + if ((sr = s.result) != null) + t.result = (((tr = t.result) == null) ? sr : + reducer.apply(tr, sr)); + s = t.rights = s.nextRight; + } + } } } - public final U getRawResult() { return result; } } - static final class MapReduceMappingsTask - extends BulkTask { + @SuppressWarnings("serial") static final class MapReduceMappingsTask + extends Traverser { final BiFun transformer; final BiFun reducer; U result; - MapReduceMappingsTask sibling; - MapReduceMappingsTask - (ConcurrentHashMapV8 m, - BiFun transformer, - BiFun reducer) { - super(m); - this.transformer = transformer; - this.reducer = reducer; - } + MapReduceMappingsTask rights, nextRight; MapReduceMappingsTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, Traverser p, int b, + MapReduceMappingsTask nextRight, BiFun transformer, BiFun reducer) { - super(p, b, split); + super(m, p, b); this.nextRight = nextRight; this.transformer = transformer; this.reducer = reducer; } - public final void compute() { - MapReduceMappingsTask t = this; - final BiFun transformer = - this.transformer; - final BiFun reducer = - this.reducer; - if (transformer == null || reducer == null) - throw new Error(NullFunctionMessage); - int b = batch(); - while (b > 1 && t.baseIndex != t.baseLimit) { - b >>>= 1; - t.pending = 1; - MapReduceMappingsTask rt = - new MapReduceMappingsTask - (t, b, true, transformer, reducer); - t = new MapReduceMappingsTask - (t, b, false, transformer, reducer); - t.sibling = rt; - rt.sibling = t; - rt.fork(); - } - U r = null, u; - Object v; - while ((v = t.advance()) != null) { - if ((u = transformer.apply((K)t.nextKey, (V)v)) != null) - r = (r == null) ? u : reducer.apply(r, u); - } - for (;;) { - int c; BulkTask par; MapReduceMappingsTask s, p; - if ((par = t.parent) == null || - !(par instanceof MapReduceMappingsTask)) { - t.quietlyComplete(); - break; - } - else if ((c = (p = (MapReduceMappingsTask)par).pending) == 0) { - if ((s = t.sibling) != null && (u = s.result) != null) + public final U getRawResult() { return result; } + @SuppressWarnings("unchecked") public final void compute() { + final BiFun transformer; + final BiFun reducer; + if ((transformer = this.transformer) != null && + (reducer = this.reducer) != null) { + for (int b; (b = preSplit()) > 0;) + (rights = new MapReduceMappingsTask + (map, this, b, rights, transformer, reducer)).fork(); + U r = null, u; + V v; + while ((v = advance()) != null) { + if ((u = transformer.apply((K)nextKey, v)) != null) r = (r == null) ? u : reducer.apply(r, u); - (t = p).result = r; } - else if (p.casPending(c, 0)) - break; + result = r; + CountedCompleter c; + for (c = firstComplete(); c != null; c = c.nextComplete()) { + MapReduceMappingsTask + t = (MapReduceMappingsTask)c, + s = t.rights; + while (s != null) { + U tr, sr; + if ((sr = s.result) != null) + t.result = (((tr = t.result) == null) ? sr : + reducer.apply(tr, sr)); + s = t.rights = s.nextRight; + } + } } } - public final U getRawResult() { return result; } } - static final class MapReduceKeysToDoubleTask - extends BulkTask { + @SuppressWarnings("serial") static final class MapReduceKeysToDoubleTask + extends Traverser { final ObjectToDouble transformer; final DoubleByDoubleToDouble reducer; final double basis; double result; - MapReduceKeysToDoubleTask sibling; - MapReduceKeysToDoubleTask - (ConcurrentHashMapV8 m, - ObjectToDouble transformer, - double basis, - DoubleByDoubleToDouble reducer) { - super(m); - this.transformer = transformer; - this.basis = basis; this.reducer = reducer; - } + MapReduceKeysToDoubleTask rights, nextRight; MapReduceKeysToDoubleTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, Traverser p, int b, + MapReduceKeysToDoubleTask nextRight, ObjectToDouble transformer, double basis, DoubleByDoubleToDouble reducer) { - super(p, b, split); + super(m, p, b); this.nextRight = nextRight; this.transformer = transformer; this.basis = basis; this.reducer = reducer; } - public final void compute() { - MapReduceKeysToDoubleTask t = this; - final ObjectToDouble transformer = - this.transformer; - final DoubleByDoubleToDouble reducer = this.reducer; - if (transformer == null || reducer == null) - throw new Error(NullFunctionMessage); - final double id = this.basis; - int b = batch(); - while (b > 1 && t.baseIndex != t.baseLimit) { - b >>>= 1; - t.pending = 1; - MapReduceKeysToDoubleTask rt = - new MapReduceKeysToDoubleTask - (t, b, true, transformer, id, reducer); - t = new MapReduceKeysToDoubleTask - (t, b, false, transformer, id, reducer); - t.sibling = rt; - rt.sibling = t; - rt.fork(); - } - double r = id; - while (t.advance() != null) - r = reducer.apply(r, transformer.apply((K)t.nextKey)); - t.result = r; - for (;;) { - int c; BulkTask par; MapReduceKeysToDoubleTask s, p; - if ((par = t.parent) == null || - !(par instanceof MapReduceKeysToDoubleTask)) { - t.quietlyComplete(); - break; - } - else if ((c = (p = (MapReduceKeysToDoubleTask)par).pending) == 0) { - if ((s = t.sibling) != null) - r = reducer.apply(r, s.result); - (t = p).result = r; + public final Double getRawResult() { return result; } + @SuppressWarnings("unchecked") public final void compute() { + final ObjectToDouble transformer; + final DoubleByDoubleToDouble reducer; + if ((transformer = this.transformer) != null && + (reducer = this.reducer) != null) { + double r = this.basis; + for (int b; (b = preSplit()) > 0;) + (rights = new MapReduceKeysToDoubleTask + (map, this, b, rights, transformer, r, reducer)).fork(); + while (advance() != null) + r = reducer.apply(r, transformer.apply((K)nextKey)); + result = r; + CountedCompleter c; + for (c = firstComplete(); c != null; c = c.nextComplete()) { + MapReduceKeysToDoubleTask + t = (MapReduceKeysToDoubleTask)c, + s = t.rights; + while (s != null) { + t.result = reducer.apply(t.result, s.result); + s = t.rights = s.nextRight; + } } - else if (p.casPending(c, 0)) - break; } } - public final Double getRawResult() { return result; } } - static final class MapReduceValuesToDoubleTask - extends BulkTask { + @SuppressWarnings("serial") static final class MapReduceValuesToDoubleTask + extends Traverser { final ObjectToDouble transformer; final DoubleByDoubleToDouble reducer; final double basis; double result; - MapReduceValuesToDoubleTask sibling; - MapReduceValuesToDoubleTask - (ConcurrentHashMapV8 m, - ObjectToDouble transformer, - double basis, - DoubleByDoubleToDouble reducer) { - super(m); - this.transformer = transformer; - this.basis = basis; this.reducer = reducer; - } + MapReduceValuesToDoubleTask rights, nextRight; MapReduceValuesToDoubleTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, Traverser p, int b, + MapReduceValuesToDoubleTask nextRight, ObjectToDouble transformer, double basis, DoubleByDoubleToDouble reducer) { - super(p, b, split); + super(m, p, b); this.nextRight = nextRight; this.transformer = transformer; this.basis = basis; this.reducer = reducer; } - public final void compute() { - MapReduceValuesToDoubleTask t = this; - final ObjectToDouble transformer = - this.transformer; - final DoubleByDoubleToDouble reducer = this.reducer; - if (transformer == null || reducer == null) - throw new Error(NullFunctionMessage); - final double id = this.basis; - int b = batch(); - while (b > 1 && t.baseIndex != t.baseLimit) { - b >>>= 1; - t.pending = 1; - MapReduceValuesToDoubleTask rt = - new MapReduceValuesToDoubleTask - (t, b, true, transformer, id, reducer); - t = new MapReduceValuesToDoubleTask - (t, b, false, transformer, id, reducer); - t.sibling = rt; - rt.sibling = t; - rt.fork(); - } - double r = id; - Object v; - while ((v = t.advance()) != null) - r = reducer.apply(r, transformer.apply((V)v)); - t.result = r; - for (;;) { - int c; BulkTask par; MapReduceValuesToDoubleTask s, p; - if ((par = t.parent) == null || - !(par instanceof MapReduceValuesToDoubleTask)) { - t.quietlyComplete(); - break; - } - else if ((c = (p = (MapReduceValuesToDoubleTask)par).pending) == 0) { - if ((s = t.sibling) != null) - r = reducer.apply(r, s.result); - (t = p).result = r; + public final Double getRawResult() { return result; } + @SuppressWarnings("unchecked") public final void compute() { + final ObjectToDouble transformer; + final DoubleByDoubleToDouble reducer; + if ((transformer = this.transformer) != null && + (reducer = this.reducer) != null) { + double r = this.basis; + for (int b; (b = preSplit()) > 0;) + (rights = new MapReduceValuesToDoubleTask + (map, this, b, rights, transformer, r, reducer)).fork(); + V v; + while ((v = advance()) != null) + r = reducer.apply(r, transformer.apply(v)); + result = r; + CountedCompleter c; + for (c = firstComplete(); c != null; c = c.nextComplete()) { + MapReduceValuesToDoubleTask + t = (MapReduceValuesToDoubleTask)c, + s = t.rights; + while (s != null) { + t.result = reducer.apply(t.result, s.result); + s = t.rights = s.nextRight; + } } - else if (p.casPending(c, 0)) - break; } } - public final Double getRawResult() { return result; } } - static final class MapReduceEntriesToDoubleTask - extends BulkTask { + @SuppressWarnings("serial") static final class MapReduceEntriesToDoubleTask + extends Traverser { final ObjectToDouble> transformer; final DoubleByDoubleToDouble reducer; final double basis; double result; - MapReduceEntriesToDoubleTask sibling; - MapReduceEntriesToDoubleTask - (ConcurrentHashMapV8 m, - ObjectToDouble> transformer, - double basis, - DoubleByDoubleToDouble reducer) { - super(m); - this.transformer = transformer; - this.basis = basis; this.reducer = reducer; - } + MapReduceEntriesToDoubleTask rights, nextRight; MapReduceEntriesToDoubleTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, Traverser p, int b, + MapReduceEntriesToDoubleTask nextRight, ObjectToDouble> transformer, double basis, DoubleByDoubleToDouble reducer) { - super(p, b, split); + super(m, p, b); this.nextRight = nextRight; this.transformer = transformer; this.basis = basis; this.reducer = reducer; } - public final void compute() { - MapReduceEntriesToDoubleTask t = this; - final ObjectToDouble> transformer = - this.transformer; - final DoubleByDoubleToDouble reducer = this.reducer; - if (transformer == null || reducer == null) - throw new Error(NullFunctionMessage); - final double id = this.basis; - int b = batch(); - while (b > 1 && t.baseIndex != t.baseLimit) { - b >>>= 1; - t.pending = 1; - MapReduceEntriesToDoubleTask rt = - new MapReduceEntriesToDoubleTask - (t, b, true, transformer, id, reducer); - t = new MapReduceEntriesToDoubleTask - (t, b, false, transformer, id, reducer); - t.sibling = rt; - rt.sibling = t; - rt.fork(); - } - double r = id; - Object v; - while ((v = t.advance()) != null) - r = reducer.apply(r, transformer.apply(entryFor((K)t.nextKey, (V)v))); - t.result = r; - for (;;) { - int c; BulkTask par; MapReduceEntriesToDoubleTask s, p; - if ((par = t.parent) == null || - !(par instanceof MapReduceEntriesToDoubleTask)) { - t.quietlyComplete(); - break; - } - else if ((c = (p = (MapReduceEntriesToDoubleTask)par).pending) == 0) { - if ((s = t.sibling) != null) - r = reducer.apply(r, s.result); - (t = p).result = r; + public final Double getRawResult() { return result; } + @SuppressWarnings("unchecked") public final void compute() { + final ObjectToDouble> transformer; + final DoubleByDoubleToDouble reducer; + if ((transformer = this.transformer) != null && + (reducer = this.reducer) != null) { + double r = this.basis; + for (int b; (b = preSplit()) > 0;) + (rights = new MapReduceEntriesToDoubleTask + (map, this, b, rights, transformer, r, reducer)).fork(); + V v; + while ((v = advance()) != null) + r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, + v))); + result = r; + CountedCompleter c; + for (c = firstComplete(); c != null; c = c.nextComplete()) { + MapReduceEntriesToDoubleTask + t = (MapReduceEntriesToDoubleTask)c, + s = t.rights; + while (s != null) { + t.result = reducer.apply(t.result, s.result); + s = t.rights = s.nextRight; + } } - else if (p.casPending(c, 0)) - break; } } - public final Double getRawResult() { return result; } } - static final class MapReduceMappingsToDoubleTask - extends BulkTask { + @SuppressWarnings("serial") static final class MapReduceMappingsToDoubleTask + extends Traverser { final ObjectByObjectToDouble transformer; final DoubleByDoubleToDouble reducer; final double basis; double result; - MapReduceMappingsToDoubleTask sibling; + MapReduceMappingsToDoubleTask rights, nextRight; MapReduceMappingsToDoubleTask - (ConcurrentHashMapV8 m, + (ConcurrentHashMapV8 m, Traverser p, int b, + MapReduceMappingsToDoubleTask nextRight, ObjectByObjectToDouble transformer, double basis, DoubleByDoubleToDouble reducer) { - super(m); + super(m, p, b); this.nextRight = nextRight; this.transformer = transformer; this.basis = basis; this.reducer = reducer; } - MapReduceMappingsToDoubleTask - (BulkTask p, int b, boolean split, - ObjectByObjectToDouble transformer, - double basis, - DoubleByDoubleToDouble reducer) { - super(p, b, split); - this.transformer = transformer; - this.basis = basis; this.reducer = reducer; - } - public final void compute() { - MapReduceMappingsToDoubleTask t = this; - final ObjectByObjectToDouble transformer = - this.transformer; - final DoubleByDoubleToDouble reducer = this.reducer; - if (transformer == null || reducer == null) - throw new Error(NullFunctionMessage); - final double id = this.basis; - int b = batch(); - while (b > 1 && t.baseIndex != t.baseLimit) { - b >>>= 1; - t.pending = 1; - MapReduceMappingsToDoubleTask rt = - new MapReduceMappingsToDoubleTask - (t, b, true, transformer, id, reducer); - t = new MapReduceMappingsToDoubleTask - (t, b, false, transformer, id, reducer); - t.sibling = rt; - rt.sibling = t; - rt.fork(); - } - double r = id; - Object v; - while ((v = t.advance()) != null) - r = reducer.apply(r, transformer.apply((K)t.nextKey, (V)v)); - t.result = r; - for (;;) { - int c; BulkTask par; MapReduceMappingsToDoubleTask s, p; - if ((par = t.parent) == null || - !(par instanceof MapReduceMappingsToDoubleTask)) { - t.quietlyComplete(); - break; - } - else if ((c = (p = (MapReduceMappingsToDoubleTask)par).pending) == 0) { - if ((s = t.sibling) != null) - r = reducer.apply(r, s.result); - (t = p).result = r; + public final Double getRawResult() { return result; } + @SuppressWarnings("unchecked") public final void compute() { + final ObjectByObjectToDouble transformer; + final DoubleByDoubleToDouble reducer; + if ((transformer = this.transformer) != null && + (reducer = this.reducer) != null) { + double r = this.basis; + for (int b; (b = preSplit()) > 0;) + (rights = new MapReduceMappingsToDoubleTask + (map, this, b, rights, transformer, r, reducer)).fork(); + V v; + while ((v = advance()) != null) + r = reducer.apply(r, transformer.apply((K)nextKey, v)); + result = r; + CountedCompleter c; + for (c = firstComplete(); c != null; c = c.nextComplete()) { + MapReduceMappingsToDoubleTask + t = (MapReduceMappingsToDoubleTask)c, + s = t.rights; + while (s != null) { + t.result = reducer.apply(t.result, s.result); + s = t.rights = s.nextRight; + } } - else if (p.casPending(c, 0)) - break; } } - public final Double getRawResult() { return result; } } - static final class MapReduceKeysToLongTask - extends BulkTask { + @SuppressWarnings("serial") static final class MapReduceKeysToLongTask + extends Traverser { final ObjectToLong transformer; final LongByLongToLong reducer; final long basis; long result; - MapReduceKeysToLongTask sibling; - MapReduceKeysToLongTask - (ConcurrentHashMapV8 m, - ObjectToLong transformer, - long basis, - LongByLongToLong reducer) { - super(m); - this.transformer = transformer; - this.basis = basis; this.reducer = reducer; - } + MapReduceKeysToLongTask rights, nextRight; MapReduceKeysToLongTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, Traverser p, int b, + MapReduceKeysToLongTask nextRight, ObjectToLong transformer, long basis, LongByLongToLong reducer) { - super(p, b, split); + super(m, p, b); this.nextRight = nextRight; this.transformer = transformer; this.basis = basis; this.reducer = reducer; } - public final void compute() { - MapReduceKeysToLongTask t = this; - final ObjectToLong transformer = - this.transformer; - final LongByLongToLong reducer = this.reducer; - if (transformer == null || reducer == null) - throw new Error(NullFunctionMessage); - final long id = this.basis; - int b = batch(); - while (b > 1 && t.baseIndex != t.baseLimit) { - b >>>= 1; - t.pending = 1; - MapReduceKeysToLongTask rt = - new MapReduceKeysToLongTask - (t, b, true, transformer, id, reducer); - t = new MapReduceKeysToLongTask - (t, b, false, transformer, id, reducer); - t.sibling = rt; - rt.sibling = t; - rt.fork(); - } - long r = id; - while (t.advance() != null) - r = reducer.apply(r, transformer.apply((K)t.nextKey)); - t.result = r; - for (;;) { - int c; BulkTask par; MapReduceKeysToLongTask s, p; - if ((par = t.parent) == null || - !(par instanceof MapReduceKeysToLongTask)) { - t.quietlyComplete(); - break; - } - else if ((c = (p = (MapReduceKeysToLongTask)par).pending) == 0) { - if ((s = t.sibling) != null) - r = reducer.apply(r, s.result); - (t = p).result = r; + public final Long getRawResult() { return result; } + @SuppressWarnings("unchecked") public final void compute() { + final ObjectToLong transformer; + final LongByLongToLong reducer; + if ((transformer = this.transformer) != null && + (reducer = this.reducer) != null) { + long r = this.basis; + for (int b; (b = preSplit()) > 0;) + (rights = new MapReduceKeysToLongTask + (map, this, b, rights, transformer, r, reducer)).fork(); + while (advance() != null) + r = reducer.apply(r, transformer.apply((K)nextKey)); + result = r; + CountedCompleter c; + for (c = firstComplete(); c != null; c = c.nextComplete()) { + MapReduceKeysToLongTask + t = (MapReduceKeysToLongTask)c, + s = t.rights; + while (s != null) { + t.result = reducer.apply(t.result, s.result); + s = t.rights = s.nextRight; + } } - else if (p.casPending(c, 0)) - break; } } - public final Long getRawResult() { return result; } } - static final class MapReduceValuesToLongTask - extends BulkTask { + @SuppressWarnings("serial") static final class MapReduceValuesToLongTask + extends Traverser { final ObjectToLong transformer; final LongByLongToLong reducer; final long basis; long result; - MapReduceValuesToLongTask sibling; - MapReduceValuesToLongTask - (ConcurrentHashMapV8 m, - ObjectToLong transformer, - long basis, - LongByLongToLong reducer) { - super(m); - this.transformer = transformer; - this.basis = basis; this.reducer = reducer; - } + MapReduceValuesToLongTask rights, nextRight; MapReduceValuesToLongTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, Traverser p, int b, + MapReduceValuesToLongTask nextRight, ObjectToLong transformer, long basis, LongByLongToLong reducer) { - super(p, b, split); + super(m, p, b); this.nextRight = nextRight; this.transformer = transformer; this.basis = basis; this.reducer = reducer; } - public final void compute() { - MapReduceValuesToLongTask t = this; - final ObjectToLong transformer = - this.transformer; - final LongByLongToLong reducer = this.reducer; - if (transformer == null || reducer == null) - throw new Error(NullFunctionMessage); - final long id = this.basis; - int b = batch(); - while (b > 1 && t.baseIndex != t.baseLimit) { - b >>>= 1; - t.pending = 1; - MapReduceValuesToLongTask rt = - new MapReduceValuesToLongTask - (t, b, true, transformer, id, reducer); - t = new MapReduceValuesToLongTask - (t, b, false, transformer, id, reducer); - t.sibling = rt; - rt.sibling = t; - rt.fork(); - } - long r = id; - Object v; - while ((v = t.advance()) != null) - r = reducer.apply(r, transformer.apply((V)v)); - t.result = r; - for (;;) { - int c; BulkTask par; MapReduceValuesToLongTask s, p; - if ((par = t.parent) == null || - !(par instanceof MapReduceValuesToLongTask)) { - t.quietlyComplete(); - break; - } - else if ((c = (p = (MapReduceValuesToLongTask)par).pending) == 0) { - if ((s = t.sibling) != null) - r = reducer.apply(r, s.result); - (t = p).result = r; + public final Long getRawResult() { return result; } + @SuppressWarnings("unchecked") public final void compute() { + final ObjectToLong transformer; + final LongByLongToLong reducer; + if ((transformer = this.transformer) != null && + (reducer = this.reducer) != null) { + long r = this.basis; + for (int b; (b = preSplit()) > 0;) + (rights = new MapReduceValuesToLongTask + (map, this, b, rights, transformer, r, reducer)).fork(); + V v; + while ((v = advance()) != null) + r = reducer.apply(r, transformer.apply(v)); + result = r; + CountedCompleter c; + for (c = firstComplete(); c != null; c = c.nextComplete()) { + MapReduceValuesToLongTask + t = (MapReduceValuesToLongTask)c, + s = t.rights; + while (s != null) { + t.result = reducer.apply(t.result, s.result); + s = t.rights = s.nextRight; + } } - else if (p.casPending(c, 0)) - break; } } - public final Long getRawResult() { return result; } } - static final class MapReduceEntriesToLongTask - extends BulkTask { + @SuppressWarnings("serial") static final class MapReduceEntriesToLongTask + extends Traverser { final ObjectToLong> transformer; final LongByLongToLong reducer; final long basis; long result; - MapReduceEntriesToLongTask sibling; - MapReduceEntriesToLongTask - (ConcurrentHashMapV8 m, - ObjectToLong> transformer, - long basis, - LongByLongToLong reducer) { - super(m); - this.transformer = transformer; - this.basis = basis; this.reducer = reducer; - } + MapReduceEntriesToLongTask rights, nextRight; MapReduceEntriesToLongTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, Traverser p, int b, + MapReduceEntriesToLongTask nextRight, ObjectToLong> transformer, long basis, LongByLongToLong reducer) { - super(p, b, split); + super(m, p, b); this.nextRight = nextRight; this.transformer = transformer; this.basis = basis; this.reducer = reducer; } - public final void compute() { - MapReduceEntriesToLongTask t = this; - final ObjectToLong> transformer = - this.transformer; - final LongByLongToLong reducer = this.reducer; - if (transformer == null || reducer == null) - throw new Error(NullFunctionMessage); - final long id = this.basis; - int b = batch(); - while (b > 1 && t.baseIndex != t.baseLimit) { - b >>>= 1; - t.pending = 1; - MapReduceEntriesToLongTask rt = - new MapReduceEntriesToLongTask - (t, b, true, transformer, id, reducer); - t = new MapReduceEntriesToLongTask - (t, b, false, transformer, id, reducer); - t.sibling = rt; - rt.sibling = t; - rt.fork(); - } - long r = id; - Object v; - while ((v = t.advance()) != null) - r = reducer.apply(r, transformer.apply(entryFor((K)t.nextKey, (V)v))); - t.result = r; - for (;;) { - int c; BulkTask par; MapReduceEntriesToLongTask s, p; - if ((par = t.parent) == null || - !(par instanceof MapReduceEntriesToLongTask)) { - t.quietlyComplete(); - break; - } - else if ((c = (p = (MapReduceEntriesToLongTask)par).pending) == 0) { - if ((s = t.sibling) != null) - r = reducer.apply(r, s.result); - (t = p).result = r; + public final Long getRawResult() { return result; } + @SuppressWarnings("unchecked") public final void compute() { + final ObjectToLong> transformer; + final LongByLongToLong reducer; + if ((transformer = this.transformer) != null && + (reducer = this.reducer) != null) { + long r = this.basis; + for (int b; (b = preSplit()) > 0;) + (rights = new MapReduceEntriesToLongTask + (map, this, b, rights, transformer, r, reducer)).fork(); + V v; + while ((v = advance()) != null) + r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, + v))); + result = r; + CountedCompleter c; + for (c = firstComplete(); c != null; c = c.nextComplete()) { + MapReduceEntriesToLongTask + t = (MapReduceEntriesToLongTask)c, + s = t.rights; + while (s != null) { + t.result = reducer.apply(t.result, s.result); + s = t.rights = s.nextRight; + } } - else if (p.casPending(c, 0)) - break; } } - public final Long getRawResult() { return result; } } - static final class MapReduceMappingsToLongTask - extends BulkTask { + @SuppressWarnings("serial") static final class MapReduceMappingsToLongTask + extends Traverser { final ObjectByObjectToLong transformer; final LongByLongToLong reducer; final long basis; long result; - MapReduceMappingsToLongTask sibling; - MapReduceMappingsToLongTask - (ConcurrentHashMapV8 m, - ObjectByObjectToLong transformer, - long basis, - LongByLongToLong reducer) { - super(m); - this.transformer = transformer; - this.basis = basis; this.reducer = reducer; - } + MapReduceMappingsToLongTask rights, nextRight; MapReduceMappingsToLongTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, Traverser p, int b, + MapReduceMappingsToLongTask nextRight, ObjectByObjectToLong transformer, long basis, LongByLongToLong reducer) { - super(p, b, split); + super(m, p, b); this.nextRight = nextRight; this.transformer = transformer; this.basis = basis; this.reducer = reducer; } - public final void compute() { - MapReduceMappingsToLongTask t = this; - final ObjectByObjectToLong transformer = - this.transformer; - final LongByLongToLong reducer = this.reducer; - if (transformer == null || reducer == null) - throw new Error(NullFunctionMessage); - final long id = this.basis; - int b = batch(); - while (b > 1 && t.baseIndex != t.baseLimit) { - b >>>= 1; - t.pending = 1; - MapReduceMappingsToLongTask rt = - new MapReduceMappingsToLongTask - (t, b, true, transformer, id, reducer); - t = new MapReduceMappingsToLongTask - (t, b, false, transformer, id, reducer); - t.sibling = rt; - rt.sibling = t; - rt.fork(); - } - long r = id; - Object v; - while ((v = t.advance()) != null) - r = reducer.apply(r, transformer.apply((K)t.nextKey, (V)v)); - t.result = r; - for (;;) { - int c; BulkTask par; MapReduceMappingsToLongTask s, p; - if ((par = t.parent) == null || - !(par instanceof MapReduceMappingsToLongTask)) { - t.quietlyComplete(); - break; - } - else if ((c = (p = (MapReduceMappingsToLongTask)par).pending) == 0) { - if ((s = t.sibling) != null) - r = reducer.apply(r, s.result); - (t = p).result = r; + public final Long getRawResult() { return result; } + @SuppressWarnings("unchecked") public final void compute() { + final ObjectByObjectToLong transformer; + final LongByLongToLong reducer; + if ((transformer = this.transformer) != null && + (reducer = this.reducer) != null) { + long r = this.basis; + for (int b; (b = preSplit()) > 0;) + (rights = new MapReduceMappingsToLongTask + (map, this, b, rights, transformer, r, reducer)).fork(); + V v; + while ((v = advance()) != null) + r = reducer.apply(r, transformer.apply((K)nextKey, v)); + result = r; + CountedCompleter c; + for (c = firstComplete(); c != null; c = c.nextComplete()) { + MapReduceMappingsToLongTask + t = (MapReduceMappingsToLongTask)c, + s = t.rights; + while (s != null) { + t.result = reducer.apply(t.result, s.result); + s = t.rights = s.nextRight; + } } - else if (p.casPending(c, 0)) - break; } } - public final Long getRawResult() { return result; } } - static final class MapReduceKeysToIntTask - extends BulkTask { + @SuppressWarnings("serial") static final class MapReduceKeysToIntTask + extends Traverser { final ObjectToInt transformer; final IntByIntToInt reducer; final int basis; int result; - MapReduceKeysToIntTask sibling; - MapReduceKeysToIntTask - (ConcurrentHashMapV8 m, - ObjectToInt transformer, - int basis, - IntByIntToInt reducer) { - super(m); - this.transformer = transformer; - this.basis = basis; this.reducer = reducer; - } + MapReduceKeysToIntTask rights, nextRight; MapReduceKeysToIntTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, Traverser p, int b, + MapReduceKeysToIntTask nextRight, ObjectToInt transformer, int basis, IntByIntToInt reducer) { - super(p, b, split); + super(m, p, b); this.nextRight = nextRight; this.transformer = transformer; this.basis = basis; this.reducer = reducer; } - public final void compute() { - MapReduceKeysToIntTask t = this; - final ObjectToInt transformer = - this.transformer; - final IntByIntToInt reducer = this.reducer; - if (transformer == null || reducer == null) - throw new Error(NullFunctionMessage); - final int id = this.basis; - int b = batch(); - while (b > 1 && t.baseIndex != t.baseLimit) { - b >>>= 1; - t.pending = 1; - MapReduceKeysToIntTask rt = - new MapReduceKeysToIntTask - (t, b, true, transformer, id, reducer); - t = new MapReduceKeysToIntTask - (t, b, false, transformer, id, reducer); - t.sibling = rt; - rt.sibling = t; - rt.fork(); - } - int r = id; - while (t.advance() != null) - r = reducer.apply(r, transformer.apply((K)t.nextKey)); - t.result = r; - for (;;) { - int c; BulkTask par; MapReduceKeysToIntTask s, p; - if ((par = t.parent) == null || - !(par instanceof MapReduceKeysToIntTask)) { - t.quietlyComplete(); - break; - } - else if ((c = (p = (MapReduceKeysToIntTask)par).pending) == 0) { - if ((s = t.sibling) != null) - r = reducer.apply(r, s.result); - (t = p).result = r; + public final Integer getRawResult() { return result; } + @SuppressWarnings("unchecked") public final void compute() { + final ObjectToInt transformer; + final IntByIntToInt reducer; + if ((transformer = this.transformer) != null && + (reducer = this.reducer) != null) { + int r = this.basis; + for (int b; (b = preSplit()) > 0;) + (rights = new MapReduceKeysToIntTask + (map, this, b, rights, transformer, r, reducer)).fork(); + while (advance() != null) + r = reducer.apply(r, transformer.apply((K)nextKey)); + result = r; + CountedCompleter c; + for (c = firstComplete(); c != null; c = c.nextComplete()) { + MapReduceKeysToIntTask + t = (MapReduceKeysToIntTask)c, + s = t.rights; + while (s != null) { + t.result = reducer.apply(t.result, s.result); + s = t.rights = s.nextRight; + } } - else if (p.casPending(c, 0)) - break; } } - public final Integer getRawResult() { return result; } } - static final class MapReduceValuesToIntTask - extends BulkTask { + @SuppressWarnings("serial") static final class MapReduceValuesToIntTask + extends Traverser { final ObjectToInt transformer; final IntByIntToInt reducer; final int basis; int result; - MapReduceValuesToIntTask sibling; - MapReduceValuesToIntTask - (ConcurrentHashMapV8 m, - ObjectToInt transformer, - int basis, - IntByIntToInt reducer) { - super(m); - this.transformer = transformer; - this.basis = basis; this.reducer = reducer; - } + MapReduceValuesToIntTask rights, nextRight; MapReduceValuesToIntTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, Traverser p, int b, + MapReduceValuesToIntTask nextRight, ObjectToInt transformer, int basis, IntByIntToInt reducer) { - super(p, b, split); + super(m, p, b); this.nextRight = nextRight; this.transformer = transformer; this.basis = basis; this.reducer = reducer; } - public final void compute() { - MapReduceValuesToIntTask t = this; - final ObjectToInt transformer = - this.transformer; - final IntByIntToInt reducer = this.reducer; - if (transformer == null || reducer == null) - throw new Error(NullFunctionMessage); - final int id = this.basis; - int b = batch(); - while (b > 1 && t.baseIndex != t.baseLimit) { - b >>>= 1; - t.pending = 1; - MapReduceValuesToIntTask rt = - new MapReduceValuesToIntTask - (t, b, true, transformer, id, reducer); - t = new MapReduceValuesToIntTask - (t, b, false, transformer, id, reducer); - t.sibling = rt; - rt.sibling = t; - rt.fork(); - } - int r = id; - Object v; - while ((v = t.advance()) != null) - r = reducer.apply(r, transformer.apply((V)v)); - t.result = r; - for (;;) { - int c; BulkTask par; MapReduceValuesToIntTask s, p; - if ((par = t.parent) == null || - !(par instanceof MapReduceValuesToIntTask)) { - t.quietlyComplete(); - break; - } - else if ((c = (p = (MapReduceValuesToIntTask)par).pending) == 0) { - if ((s = t.sibling) != null) - r = reducer.apply(r, s.result); - (t = p).result = r; + public final Integer getRawResult() { return result; } + @SuppressWarnings("unchecked") public final void compute() { + final ObjectToInt transformer; + final IntByIntToInt reducer; + if ((transformer = this.transformer) != null && + (reducer = this.reducer) != null) { + int r = this.basis; + for (int b; (b = preSplit()) > 0;) + (rights = new MapReduceValuesToIntTask + (map, this, b, rights, transformer, r, reducer)).fork(); + V v; + while ((v = advance()) != null) + r = reducer.apply(r, transformer.apply(v)); + result = r; + CountedCompleter c; + for (c = firstComplete(); c != null; c = c.nextComplete()) { + MapReduceValuesToIntTask + t = (MapReduceValuesToIntTask)c, + s = t.rights; + while (s != null) { + t.result = reducer.apply(t.result, s.result); + s = t.rights = s.nextRight; + } } - else if (p.casPending(c, 0)) - break; } } - public final Integer getRawResult() { return result; } } - static final class MapReduceEntriesToIntTask - extends BulkTask { + @SuppressWarnings("serial") static final class MapReduceEntriesToIntTask + extends Traverser { final ObjectToInt> transformer; final IntByIntToInt reducer; final int basis; int result; - MapReduceEntriesToIntTask sibling; - MapReduceEntriesToIntTask - (ConcurrentHashMapV8 m, - ObjectToInt> transformer, - int basis, - IntByIntToInt reducer) { - super(m); - this.transformer = transformer; - this.basis = basis; this.reducer = reducer; - } + MapReduceEntriesToIntTask rights, nextRight; MapReduceEntriesToIntTask - (BulkTask p, int b, boolean split, + (ConcurrentHashMapV8 m, Traverser p, int b, + MapReduceEntriesToIntTask nextRight, ObjectToInt> transformer, int basis, IntByIntToInt reducer) { - super(p, b, split); + super(m, p, b); this.nextRight = nextRight; this.transformer = transformer; this.basis = basis; this.reducer = reducer; } - public final void compute() { - MapReduceEntriesToIntTask t = this; - final ObjectToInt> transformer = - this.transformer; - final IntByIntToInt reducer = this.reducer; - if (transformer == null || reducer == null) - throw new Error(NullFunctionMessage); - final int id = this.basis; - int b = batch(); - while (b > 1 && t.baseIndex != t.baseLimit) { - b >>>= 1; - t.pending = 1; - MapReduceEntriesToIntTask rt = - new MapReduceEntriesToIntTask - (t, b, true, transformer, id, reducer); - t = new MapReduceEntriesToIntTask - (t, b, false, transformer, id, reducer); - t.sibling = rt; - rt.sibling = t; - rt.fork(); - } - int r = id; - Object v; - while ((v = t.advance()) != null) - r = reducer.apply(r, transformer.apply(entryFor((K)t.nextKey, (V)v))); - t.result = r; - for (;;) { - int c; BulkTask par; MapReduceEntriesToIntTask s, p; - if ((par = t.parent) == null || - !(par instanceof MapReduceEntriesToIntTask)) { - t.quietlyComplete(); - break; - } - else if ((c = (p = (MapReduceEntriesToIntTask)par).pending) == 0) { - if ((s = t.sibling) != null) - r = reducer.apply(r, s.result); - (t = p).result = r; + public final Integer getRawResult() { return result; } + @SuppressWarnings("unchecked") public final void compute() { + final ObjectToInt> transformer; + final IntByIntToInt reducer; + if ((transformer = this.transformer) != null && + (reducer = this.reducer) != null) { + int r = this.basis; + for (int b; (b = preSplit()) > 0;) + (rights = new MapReduceEntriesToIntTask + (map, this, b, rights, transformer, r, reducer)).fork(); + V v; + while ((v = advance()) != null) + r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, + v))); + result = r; + CountedCompleter c; + for (c = firstComplete(); c != null; c = c.nextComplete()) { + MapReduceEntriesToIntTask + t = (MapReduceEntriesToIntTask)c, + s = t.rights; + while (s != null) { + t.result = reducer.apply(t.result, s.result); + s = t.rights = s.nextRight; + } } - else if (p.casPending(c, 0)) - break; } } - public final Integer getRawResult() { return result; } } - static final class MapReduceMappingsToIntTask - extends BulkTask { + @SuppressWarnings("serial") static final class MapReduceMappingsToIntTask + extends Traverser { final ObjectByObjectToInt transformer; final IntByIntToInt reducer; final int basis; int result; - MapReduceMappingsToIntTask sibling; + MapReduceMappingsToIntTask rights, nextRight; MapReduceMappingsToIntTask - (ConcurrentHashMapV8 m, + (ConcurrentHashMapV8 m, Traverser p, int b, + MapReduceMappingsToIntTask nextRight, ObjectByObjectToInt transformer, int basis, IntByIntToInt reducer) { - super(m); + super(m, p, b); this.nextRight = nextRight; this.transformer = transformer; this.basis = basis; this.reducer = reducer; } - MapReduceMappingsToIntTask - (BulkTask p, int b, boolean split, - ObjectByObjectToInt transformer, - int basis, - IntByIntToInt reducer) { - super(p, b, split); - this.transformer = transformer; - this.basis = basis; this.reducer = reducer; - } - public final void compute() { - MapReduceMappingsToIntTask t = this; - final ObjectByObjectToInt transformer = - this.transformer; - final IntByIntToInt reducer = this.reducer; - if (transformer == null || reducer == null) - throw new Error(NullFunctionMessage); - final int id = this.basis; - int b = batch(); - while (b > 1 && t.baseIndex != t.baseLimit) { - b >>>= 1; - t.pending = 1; - MapReduceMappingsToIntTask rt = - new MapReduceMappingsToIntTask - (t, b, true, transformer, id, reducer); - t = new MapReduceMappingsToIntTask - (t, b, false, transformer, id, reducer); - t.sibling = rt; - rt.sibling = t; - rt.fork(); - } - int r = id; - Object v; - while ((v = t.advance()) != null) - r = reducer.apply(r, transformer.apply((K)t.nextKey, (V)v)); - t.result = r; - for (;;) { - int c; BulkTask par; MapReduceMappingsToIntTask s, p; - if ((par = t.parent) == null || - !(par instanceof MapReduceMappingsToIntTask)) { - t.quietlyComplete(); - break; - } - else if ((c = (p = (MapReduceMappingsToIntTask)par).pending) == 0) { - if ((s = t.sibling) != null) - r = reducer.apply(r, s.result); - (t = p).result = r; + public final Integer getRawResult() { return result; } + @SuppressWarnings("unchecked") public final void compute() { + final ObjectByObjectToInt transformer; + final IntByIntToInt reducer; + if ((transformer = this.transformer) != null && + (reducer = this.reducer) != null) { + int r = this.basis; + for (int b; (b = preSplit()) > 0;) + (rights = new MapReduceMappingsToIntTask + (map, this, b, rights, transformer, r, reducer)).fork(); + V v; + while ((v = advance()) != null) + r = reducer.apply(r, transformer.apply((K)nextKey, v)); + result = r; + CountedCompleter c; + for (c = firstComplete(); c != null; c = c.nextComplete()) { + MapReduceMappingsToIntTask + t = (MapReduceMappingsToIntTask)c, + s = t.rights; + while (s != null) { + t.result = reducer.apply(t.result, s.result); + s = t.rights = s.nextRight; + } } - else if (p.casPending(c, 0)) - break; } } - public final Integer getRawResult() { return result; } } - // Unsafe mechanics - private static final sun.misc.Unsafe UNSAFE; - private static final long counterOffset; - private static final long sizeCtlOffset; + private static final sun.misc.Unsafe U; + private static final long SIZECTL; + private static final long TRANSFERINDEX; + private static final long TRANSFERORIGIN; + private static final long BASECOUNT; + private static final long COUNTERBUSY; + private static final long CELLVALUE; private static final long ABASE; private static final int ASHIFT; static { - int ss; try { - UNSAFE = getUnsafe(); + U = getUnsafe(); Class k = ConcurrentHashMapV8.class; - counterOffset = UNSAFE.objectFieldOffset - (k.getDeclaredField("counter")); - sizeCtlOffset = UNSAFE.objectFieldOffset + SIZECTL = U.objectFieldOffset (k.getDeclaredField("sizeCtl")); + TRANSFERINDEX = U.objectFieldOffset + (k.getDeclaredField("transferIndex")); + TRANSFERORIGIN = U.objectFieldOffset + (k.getDeclaredField("transferOrigin")); + BASECOUNT = U.objectFieldOffset + (k.getDeclaredField("baseCount")); + COUNTERBUSY = U.objectFieldOffset + (k.getDeclaredField("counterBusy")); + Class ck = CounterCell.class; + CELLVALUE = U.objectFieldOffset + (ck.getDeclaredField("value")); Class sc = Node[].class; - ABASE = UNSAFE.arrayBaseOffset(sc); - ss = UNSAFE.arrayIndexScale(sc); + ABASE = U.arrayBaseOffset(sc); + int scale = U.arrayIndexScale(sc); + if ((scale & (scale - 1)) != 0) + throw new Error("data type scale not a power of two"); + ASHIFT = 31 - Integer.numberOfLeadingZeros(scale); } catch (Exception e) { throw new Error(e); } - if ((ss & (ss-1)) != 0) - throw new Error("data type scale not a power of two"); - ASHIFT = 31 - Integer.numberOfLeadingZeros(ss); } /** @@ -6741,21 +6838,23 @@ public class ConcurrentHashMapV8 private static sun.misc.Unsafe getUnsafe() { try { return sun.misc.Unsafe.getUnsafe(); - } catch (SecurityException se) { - try { - return java.security.AccessController.doPrivileged - (new java.security - .PrivilegedExceptionAction() { - public sun.misc.Unsafe run() throws Exception { - java.lang.reflect.Field f = sun.misc - .Unsafe.class.getDeclaredField("theUnsafe"); - f.setAccessible(true); - return (sun.misc.Unsafe) f.get(null); - }}); - } catch (java.security.PrivilegedActionException e) { - throw new RuntimeException("Could not initialize intrinsics", - e.getCause()); - } + } catch (SecurityException tryReflectionInstead) {} + try { + return java.security.AccessController.doPrivileged + (new java.security.PrivilegedExceptionAction() { + public sun.misc.Unsafe run() throws Exception { + Class k = sun.misc.Unsafe.class; + for (java.lang.reflect.Field f : k.getDeclaredFields()) { + f.setAccessible(true); + Object x = f.get(null); + if (k.isInstance(x)) + return k.cast(x); + } + throw new NoSuchFieldError("the Unsafe"); + }}); + } catch (java.security.PrivilegedActionException e) { + throw new RuntimeException("Could not initialize intrinsics", + e.getCause()); } } }